Machining processes are most accurately described using complex dynamical systems that include nonlinearities, time delays and stochastic effects. Due to the nature of these models as well as the practical challenges which include time-varying parameters, the transition from numerical/analytical modeling of machining to the analysis of real cutting signals remains challenging. Some studies have focused on studying the time series of cutting processes using machine learning algorithms with the goal of identifying and predicting undesirable vibrations during machining referred to as chatter. These tools typically decompose the signal using Wavelet Packet Transforms (WPT) or Ensemble Empirical Mode Decomposition (EEMD). However, these methods require a significant overhead in identifying the feature vectors before a classifier can be trained. In this study, we present an alternative approach based on featurizing the time series of the cutting process using its topological features. We utilize support vector machine classifier combined with feature vectors derived from persistence diagrams, a tool from persistent homology, to encode distinguishing characteristics based on embedding the time series as a point cloud using Takens embedding. We present the results for several choices of the topological feature vectors, and we compare our results to the WPT and EEMD methods using experimental time series from a turning cutting test. Our results show that in most cases combining the TDA-based features with a simple Support Vector Machine (SVM) yields accuracies that either exceed or are within the error bounds of their WPT and EEMD counterparts.

Recently, interpretable models called self-explaining models (SEMs) have been proposed with the goal of providing interpretability robustness. We evaluate the interpretability robustness of SEMs and show that explanations provided by SEMs as currently proposed are not robust to adversarial inputs. Specifically, we successfully created adversarial inputs that do not change the model outputs but cause significant changes in the explanations. We find that even though current SEMs use stable co-efficients for mapping explanations to output labels, they do not consider the robustness of the first stage of the model that creates interpretable basis concepts from the input, leading to non-robust explanations. Our work makes a case for future work to start examining how to generate interpretable basis concepts in a robust way.

Despite the fact that generative models are extremely successful in practice, the theory underlying this phenomenon is only starting to catch up with practice. In this work we address the question of the universality of generative models: is it true that neural networks can approximate any data manifold arbitrarily well? We provide a positive answer to this question and show that under mild assumptions on the activation function one can always find a feedforward neural network which maps the latent space onto a set located within the specified Hausdorff distance from the desired data manifold. We also prove similar theorems for the case of multiclass generative models and cycle generative models, trained to map samples from one manifold to another and vice versa.

A core challenge for both physics and artificial intellicence (AI) is symbolic regression: finding a symbolic expression that matches data from an unknown function. Although this problem is likely to be NP-hard in principle, functions of practical interest often exhibit symmetries, separability, compositionality and other simplifying properties. In this spirit, we develop a recursive multidimensional symbolic regression algorithm that combines neural network fitting with a suite of physics-inspired techniques. We apply it to 100 equations from the Feynman Lectures on Physics, and it discovers all of them, while previous publicly available software cracks only 71; for a more difficult test set, we improve the state of the art success rate from 15% to 90%.

Vehicle speed monitoring and management of highways is the critical problem of the road in this modern age of growing technology and population. A poor management results in frequent traffic jam, traffic rules violation and fatal road accidents. Using traditional techniques of RADAR, LIDAR and LASAR to address this problem is time-consuming, expensive and tedious. This paper presents an efficient framework to produce a simple, cost efficient and intelligent system for vehicle speed monitoring. The proposed method uses an HD (High Definition) camera mounted on the road side either on a pole or on a traffic signal for recording video frames. On the basis of these frames, a vehicle can be tracked by using radius growing method, and its speed can be calculated by calculating vehicle mask and its displacement in consecutive frames. The method uses pattern recognition, digital image processing and mathematical techniques for vehicle detection, tracking and speed calculation. The validity of the proposed model is proved by testing it on different highways.

We study synthesis problems with constraints in partially observable Markov decision processes (POMDPs), where the objective is to compute a strategy for an agent that is guaranteed to satisfy certain safety and performance specifications. Verification and strategy synthesis for POMDPs are, however, computationally intractable in general. We alleviate this difficulty by focusing on planning applications and exploiting typical structural properties of such scenarios; for instance, we assume that the agent has the ability to observe its own position inside an environment. We propose an abstraction refinement framework which turns such a POMDP model into a (fully observable) probabilistic two-player game (PG). For the obtained PGs, efficient verification and synthesis tools allow to determine strategies with optimal safety and performance measures, which approximate optimal schedulers on the POMDP. If the approximation is too coarse to satisfy the given specifications, an refinement scheme improves the computed strategies. As a running example, we use planning problems where an agent moves inside an environment with randomly moving obstacles and restricted observability. We demonstrate that the proposed method advances the state of the art by solving problems several orders-of-magnitude larger than those that can be handled by existing POMDP solvers. Furthermore, this method gives guarantees on safety constraints, which is not supported by the majority of the existing solvers.

Quivering and hesitant, like a spoon-wielding toddler trying to eat soup without spilling it, the world's first raspberry-picking robot is attempting to harvest one of the fruits. After sizing it up for an age, the robot plucks the fruit with its gripping arm and gingerly deposits it into a waiting punnet. The whole process takes about a minute for a single berry. It seems like heavy going for a robot that cost £700,000 to develop but, if all goes to plan, this is the future of fruit-picking. Each robot will be able to pick more than 25,000 raspberries a day, outpacing human workers who manage about 15,000 in an eight-hour shift, according to Fieldwork Robotics, a spinout from the University of Plymouth.

A research report on "Global Automotive Artificial Intelligence (AI) Market 2019 Industry Research Report" is being published by researchunt.com. This is a key document as far as the clients and industries are concerned to not only understand the Global competitive market status that exists currently but also what future holds for it in the upcoming period, i.e., between 2018 and 2025. It has taken the previous market status of 2013 – 2018 to project the future status. The report has categorized in terms of region, type, key industries, and application. Global Automotive Artificial Intelligence (AI) revenue was xx.xx Million USD in 2013, grew to xx.xx Million USD in 2017, and will reach xx.xx Million USD in 2023, with a CAGR of x.x% during 2018-2023.

It's never easy to predict the future, and the speakers of Data Science Salon New York have somewhat divergent views on how we might expect ML and AI to be applied to the field of Media and Entertainment in the next five to ten years. But there's one clear area of agreement: "We're going to continue to see the implementation (and improvement) of personalized recommendation algorithms that are based on person-level data." said Lauren Lombardo, Senior Data Scientist at Nielsen. "It will vastly improve the overall relevance of the content and advertisements served across premium video, and make content exploration much simpler and more enjoyable," suggests Chris Whitely, Senior Director, Applied Analytics at Comcast. But the recommendation engines of tomorrow will be even more robust. "We've barely scratched the surface of utilizing recommendation engines for generating new content," said Josh Miller, Director of Data Analytics at Samba.tv.

Nearly every day, we hear about new advances in AI that enable new ways to monitor activities and people, transforming many processes in our day to day life. What we may then hear every other day is how AI can exacerbate racial and gender bias and pose a threat to privacy, job security, and economic well being. It could possibly even spark a war in the view of Elon Musk. As explained in Facial Recognition Concerns: Microsoft's Six Ethical Principles, "The widespread use of Artificial Intelligence-powered facial recognition technology can lead to some new intrusions into people's privacy." Given the ability to capture people's image and identify them on public streets in the name of security, people are rightfully concerned that they will lose their ability to maintain any privacy.