Rapid progress in natural language processing has led to its utilization in a variety of industrial and enterprise settings, including in its use for information extraction, specifically named entity recognition and relation extraction, from documents such as engineering manuals and field maintenance reports. While named entity recognition is a well-studied problem, existing state-of-the-art approaches require large labelled datasets which are hard to acquire for sensitive data such as maintenance records. Further, industrial domain experts tend to distrust results from black box machine learning models, especially when the extracted information is used in downstream predictive maintenance analytics. We overcome these challenges by developing three approaches built on the foundation of domain expert knowledge captured in dictionaries and ontologies. We develop a syntactic and semantic rules-based approach and an approach leveraging a pre-trained language model, fine-tuned for a question-answering task on top of our base dictionary lookup to extract entities of interest from maintenance records. We also develop a preliminary ontology to represent and capture the semantics of maintenance records. Our evaluations on a real-world aviation maintenance records dataset show promising results and help identify challenges specific to named entity recognition in the context of noisy industrial data.

Well, the battery won't allow you to drive for a million miles without recharging, but it will last for a million miles before it must be replaced. This is a big step forward considering EV batteries typically last 200,000 miles. With a million-mile battery, the car would fall apart long before the battery goes dead. This also means the owner can sell it or transfer it to a new car, resulting in less pollution and waste. The brains at Huawei are working on a solution.

The U.S. Department of Energy announced $15.1 million for three collaborative research projects at five universities to advance the development of a flexible multi-tiered data and computational infrastructure to support a diverse collection of on-demand scientific data processing tasks and computationally intensive simulations. Scientists from The University of Texas–Austin, the University of Notre Dame, Louisiana State University, and Lawrence Berkeley National Laboratory will address mitigation strategies for gulf coastal flooding events due to extreme weather with artificial intelligence and machine learning techniques that combine experimental data with computer simulations. Scientists from the University of Connecticut and Lawrence Berkeley National Laboratory will couple experimental data with simulations using AI/ML techniques to design, manufacture, and test new materials with uniquely designed properties for potential applications in batteries, sensors, and energy storage. Scientists from the University of Southern California, Argonne National Laboratory, and Lawrence Berkeley National Laboratory will develop AI/ML-based methods to simulate and experimentally verify the performance of large, distributed computing infrastructures.

BRUSSELS – (Thomson Reuters Foundation) – As climate change intensifies the devastation from storms, wildfires and droughts, artificial intelligence (AI) and digital tools are increasingly being seen as a way to predict and limit its impacts. Governments, tech firms and investors are showing growing interest in machine-based learning systems that use algorithms to identify patterns in data sets and make predictions, recommendations or decisions in real or virtual settings. In June, the Rise Fund, an impact investing arm of private equity firm TPG, invested $100 million in a data and AI-driven "nowcasting" system devised by Kentucky-based startup Climavision to predict weather patterns with granular accuracy. And an intergovernmental roadmap on AI's role in fighting global warming is due to launch at November's COP26 climate summit in Scotland. But AI can also be highly energy-intensive and environmentally damaging, say critics who warn that the tech could be a costly distraction from more effective ways of tackling climate change.

Abstract-- We present a strategy for designing and building very general robot manipulation systems involving the integration of a general-purpose task-and-motion planner with engineered and learned perception modules that estimate properties and affordances of unknown objects. Such systems are closedloop policies that map from RGB images, depth images, and robot joint encoder measurements to robot joint position commands. We show that following this strategy a task-and-motion planner can be used to plan intelligent behaviors even in the absence of a priori knowledge regarding the set of manipulable objects, their geometries, and their affordances. We explore several different ways of implementing such perceptual modules for segmentation, property detection, shape estimation, and grasp generation. We show how these modules are integrated within the PDDLStream task and motion planning framework. The goal is for all perceivable objects to be on a blue target region. The robot first finds and executes a plan that picks and places the cracker box on the blue target region. Our objective is to design and build robot policies that can interact robustly and safely with large collections of objects that are only partially observable, where the objects have The operation of our system, called M0M (Manipulation never been seen before and where achieving the goal may with Zero Models), is illustrated in Figure 1. The goal is require many coordinated actions, as in putting away all the for all objects to be on a blue target region.

Perceiving obstacles and avoiding collisions is fundamental to the safe operation of a robot system, particularly when the robot must operate in highly dynamic human environments. Proximity detection using on-robot sensors can be used to avoid or mitigate impending collisions. However, existing proximity sensing methods are orientation and placement dependent, resulting in blind spots even with large numbers of sensors. In this paper, we introduce the phenomenon of the Leaky Surface Wave (LSW), a novel sensing modality, and present AuraSense, a proximity detection system using the LSW. AuraSense is the first system to realize no-dead-spot proximity sensing for robot arms. It requires only a single pair of piezoelectric transducers, and can easily be applied to off-the-shelf robots with minimal modifications. We further introduce a set of signal processing techniques and a lightweight neural network to address the unique challenges in using the LSW for proximity sensing. Finally, we demonstrate a prototype system consisting of a single piezoelectric element pair on a robot manipulator, which validates our design. We conducted several micro benchmark experiments and performed more than 2000 on-robot proximity detection trials with various potential robot arm materials, colliding objects, approach patterns, and robot movement patterns. AuraSense achieves 100% and 95.3% true positive proximity detection rates when the arm approaches static and mobile obstacles respectively, with a true negative rate over 99%, showing the real-world viability of this system.

After a decade of research, we developed a prototype device and experimentally demonstrated that the direct phi q interaction could be memristive, as predicted by Chua in 1971. With a constant input current to avoid any parasitic inductor effect, our device meets three criteria for an ideal memristor: a single valued, nonlinear, continuously differentiable, and strictly monotonically increasing constitutive phi q curve, a pinched v i hysteresis loop, and a charge only dependent resistance. Our work represents a step forward in terms of experimentally verifying the memristive flux charge interaction but we have not reached the final because this prototype still suffers from two serious limitations: 1, a superficial but dominant inductor effect (behind which the above memristive fingerprints hide) due to its inductor-like core structure, and 2. bistability and dynamic sweep of a continuous resistance range. In this article, we also discuss how to make a fully functioning ideal memristor with multiple or an infinite number of stable states and no parasitic inductance, and give a number of suggestions, such as open structure, nanoscale size, magnetic materials with cubic anisotropy (or even isotropy), and sequential switching of the magnetic domains. Additionally, we respond to a recent challenge from arXiv.org that claims that our device is simply an inductor with memory since our device did not pass their designed capacitor-memristor circuit test. Contrary to their conjecture that an ideal memristor may not exist or may be a purely mathematical concept, we remain optimistic that researchers will discover an ideal memristor in nature or make one in the laboratory based on our current work.

The transition state (TS) calculation is a grand challenge for computational intensive energy function. The traditional methods need to evaluate the gradients of the energy function at a very large number of locations. To reduce the number of expensive computations of the true gradients, we propose an active learning framework consisting of a statistical surrogate model, Gaussian process regression (GPR) for the energy function, and a single-walker dynamics method, gentle accent dynamics (GAD), for the saddle-type transition states. TS is detected by the GAD applied to the GPR surrogate for the gradient vector and the Hessian matrix. Our key ingredient for efficiency improvements is an active learning method which sequentially designs the most informative locations and takes evaluations of the original model at these locations to train GPR. We formulate this active learning task as the optimal experimental design problem and propose a very efficient sample-based sub-optimal criterion to construct the optimal locations. We show that the new method significantly decreases the required number of energy or force evaluations of the original model.

A concept of multi-valued cognitive maps is introduced in this paper. The concept expands the fuzzy one. However, all variables and weights are not linearly ordered in the concept, but are only partially-ordered. Such an ap- proach allows us to operate in cognitive maps with partially-ordered linguis- tic variables directly, without vague fuzzification/defuzzification methods. Hence, we may consider more subtle differences in degrees of experts' uncer- tainty, than in the fuzzy case. We prove the convergence of such cognitive maps and give a simple computational example which demonstrates using such a partially-ordered uncertainty degree scale.

But more often, the objective involves multiple criteria including not only the total distance of the tour but also other factors such as travel costs, travel time, and fuel consumption. Moreover, in reality, there are numerous implicit preferences ingrained in the minds of the route planners and the drivers. Drivers, for instance, have familiarity with certain neighborhoods and knowledge of the state of roads, and often consider the best places for rest and lunch breaks. This knowledge is difficult to formulate and balance when operational routing decisions have to be made. This motivates us to learn the implicit preferences from past solutions and to incorporate these learned preferences in the optimization process. These preferences are in the form of arc probabilities, i.e., the more preferred a route is, the higher is the joint probability. The novelty of this work is the use of a neural network model to estimate the arc probabilities, which allows for additional features and automatic parameter estimation. This first requires identifying suitable features, neural architectures and loss functions, taking into account that there is typically few data available. We investigate the difference with a prior weighted Markov counting approach, and study the applicability of neural networks in this setting.