Nowadays all industrial sectors are increasingly faced with the explosion in the amount of data. Therefore, it raises the question of the efficient use of this large amount of data. In this research work, we are concerned with process and product traceability data. In some sectors (e.g. pharmaceutical and agro-food), the collection and storage of these data are required. Beyond this constraint (regulatory and / or contractual), we are interested in the use of these data for continuous improvements of industrial performances. Two research axes were identified: product recall and responsiveness towards production hazards. For the first axis, a procedure for product recall exploiting traceability data will be propose. The development of detection and prognosis functions combining process and product data is envisaged for the second axis.

These devices, particularly the smart mobile phones have transformed over a period of time from merely communication tools to smart and highly personal devices enabling to assist the users in their variety of day-to-day situations in their daily life. In the real word, users' interest on "Mobile Phones" is more and more than other platforms like "Desktop Computer" or "Tablet Computer" over time [36]. People use mobile phones not only for voice communication between individuals but also for various activities such as applications (mobile apps) using, Internet browsing, emailing, using online social network, instant messaging etc [28]. Recent advances in the sensing capabilities of smart mobile phones make them enable to collect the rich contextual information and users' various activity records with mobile phones through the device logs. These historical mobile phone data are simply as the collection of the past contexts and user's activities with the mobile phones for these past contexts. These are phone call logs [39] having phone call activities, app usages logs [45] having various mobile application usages, mobile phone notification logs [22] having the responses with various notifications from different applications, web logs [13] having Internet browsing activities of the mobile phone users. The main characteristic of such kind of phone log data is that it contains the actual diverse activities of the users in different contexts in their real world life. Modeling smartphone user behaviors by developing various computational machine learning methods (rule-based learning) in order to analyze different behavioral patterns in different contexts, and eventually predict the next behaviors or detect strange behaviors utilizing such mobile phone data, can be used for build- 2 Iqbal H. Sarker*

There's no foolproof way to know if someone's verbally telling lies, but scientists have developed a tool that seems remarkably accurate at judging written falsehoods. Using machine learning and text analysis, they've been able to identify false robbery reports with such accuracy that the tool is now being rolled out to police stations across Spain. Computer scientists from Cardiff University and Charles III University of Madrid developed the tool, called VeriPol, specifically to focus on robbery reports. In their paper, published in the journal Knowledge-Based Systems earlier this year, they describe how they trained a machine-learning model on more than 1000 police robbery reports from Spanish National Police, including those that were known to be false. A pilot study in Murcia and Malaga in June 2017 found that, once VeriPol identified a report as having a high probability of being false, 83% of these cases were closed after the claimants faced further questioning.

This installment of Research for Practice features a curated selection from Alex Ratner and Chris Ré, who provide an overview of recent developments in Knowledge Base Construction (KBC). While knowledge bases have a long history dating to the expert systems of the 1970s, recent advances in machine learning have led to a knowledge base renaissance, with knowledge bases now powering major product functionality including Google Assistant, Amazon Alexa, Apple Siri, and Wolfram Alpha. Ratner and Re's selections highlight key considerations in the modern KBC process, from interfaces that extract knowledge from domain experts to algorithms and representations that transfer knowledge across tasks.

Multi-Criteria Decision Analysis (MCDA) methods are widely used in various fields and disciplines. While most of the research has been focused on the development and improvement of new MCDA methods, relatively limited attention has been paid to their appropriate selection for the given decision problem. Their improper application decreases the quality of recommendations, as different MCDA methods deliver inconsistent results. The current paper presents a methodological and practical framework for selecting suitable MCDA methods for a particular decision situation. A set of 56 available MCDA methods was analyzed and, based on that, a hierarchical set of methods characteristics and the rule base were obtained. This analysis, rules and modelling of the uncertainty in the decision problem description allowed to build a framework supporting the selection of a MCDA method for a given decision-making situation. The practical studies indicate consistency between the methods recommended with the proposed approach and those used by the experts in reference cases. The results of the research also showed that the proposed approach can be used as a general framework for selecting an appropriate MCDA method for a given area of decision support, even in cases of data gaps in the decision-making problem description. The proposed framework was implemented within a web platform available for public use at www.mcda.it.

Knowledge bases (KBs) are paramount in NLP. We employ multiview learning for increasing accuracy and coverage of entity type information in KBs. We rely on two metaviews: language and representation. For language, we consider high-resource and low-resource languages from Wikipedia. For representation, we consider representations based on the context distribution of the entity (i.e., on its embedding), on the entity's name (i.e., on its surface form) and on its description in Wikipedia. The two metaviews language and representation can be freely combined: each pair of language and representation (e.g., German embedding, English description, Spanish name) is a distinct view. Our experiments on entity typing with fine-grained classes demonstrate the effectiveness of multiview learning. We release MVET, a large multiview - and, in particular, multilingual - entity typing dataset we created. Mono- and multilingual fine-grained entity typing systems can be evaluated on this dataset.

The chase is a fundamental tool for existential rules. Several chase variants are known, which differ on how they handle redundancies possibly caused by the introduction of nulls. Given a chase variant, the halting problem takes as input a set of existential rules and asks if this set of rules ensures the termination of the chase for any factbase. It is well-known that this problem is undecidable for all known chase variants. The related problem of boundedness asks if a given set of existential rules is bounded, i.e., whether there is a predefined upper bound on the number of (breadth-first) steps of the chase, independently from any factbase. This problem is already undecidable in the specific case of datalog rules. However, knowing that a set of rules is bounded for some chase variant does not help much in practice if the bound is unknown. Hence, in this paper, we investigate the decidability of the k-boundedness problem, which asks whether a given set of rules is bounded by an integer k. We prove that k-boundedness is decidable for three chase variants, namely the oblivious, semi-oblivious and restricted chase.

In this case, the benchmarks are for running the GoogLetNet V1 convolutional neural network framework, with a batch size of 1. (Meaning that items to be identified are sent through in serial fashion rather than batched up to be chewed on all at once.) This framework came close to beating humans at image recognition, but it took Microsoft's ResNet in 2015 to accomplish this feat, with a 3.57 percent failure rate compared to humans at 5.1 percent. The baseline for performance that Xilinx chose was the smallest F1 FPGA-accelerated instance on the EC2 compute cloud at Amazon Web Services. This instance has a single Virtex UltraScale VU9P FPGA on it, which has 1.182 million LUTs, which is attached to a server slice that has eight vCPUs (Based on the "Broadwell" Xeon E5-2696 v4 processor and 122 GB of main memory.

Abstract--We aim to predict and explain service failures in supply-chain networks, more precisely among last-mile pickup and delivery services to customers. We analyze a dataset of 500,000 services using (1) supervised classification with Random Forests, and (2) Association Rules. Our classifier reaches an average sensitivity of 0.7 and an average specificity of 0.7 for the 5 studied types of failure. Association Rules reassert the importance of confirmation calls to prevent failures due to customers not at home, show the importance of the time window size, slack time, and geographical location of the customer for the other failure types, and highlight the effect of the retailer company on several failure types. To reduce the occurrence of service failures, our data models could be coupled to optimizers, or used to define countermeasures to be taken by human dispatchers. Service failures are pervasive in supply-chain networks, with important consequences on their cost-efficiency and customer experience. We aim at predicting and explaining the cause of such failures, focusing on the last-mile pickup and delivery of items at customer locations. Such services are planned by optimizers solving some variations of the Vehicle-Routing Problem, in our case the Pickup and Delivery Problem with Time Windows (PDPTW [1]).

In this Book we argue that the fruitful interaction of computer vision and belief calculus is capable of stimulating significant advances in both fields. From a methodological point of view, novel theoretical results concerning the geometric and algebraic properties of belief functions as mathematical objects are illustrated and discussed in Part II, with a focus on both a perspective 'geometric approach' to uncertainty and an algebraic solution to the issue of conflicting evidence. In Part III we show how these theoretical developments arise from important computer vision problems (such as articulated object tracking, data association and object pose estimation) to which, in turn, the evidential formalism is able to provide interesting new solutions. Finally, some initial steps towards a generalization of the notion of total probability to belief functions are taken, in the perspective of endowing the theory of evidence with a complete battery of estimation and inference tools to the benefit of all scientists and practitioners.