Sharing, downloading, and reusing software is common-place, some of which is carried out legally with open source software. When it is not legal, it is unclear just how many copyright infringements and trade secret violations have taken place: does an infringement count for the artefact as a whole or perhaps for each file of the program? To answer this question, it must first be established whether a program should be considered as an integral whole, a collection, or a mere set of distinct files, and why. We argue that a program is a functional whole, availing of, and combining, arguments from mereology, granularity, modularity, unity, and function to substantiate the claim. The argumentation and answer contributes to the ontology of software artefacts, may assist industry in litigation cases, and demonstrates that the notion of unifying relation is operationalisable. Indirectly, it provides support for continued modular design of artefacts following established engineering practices.

CANDECOMP/PARAFAC (CP) decomposition has been widely used to deal with multi-way data. For real-time or large-scale tensors, based on the ideas of randomized-sampling CP decomposition algorithm and online CP decomposition algorithm, a novel CP decomposition algorithm called randomized online CP decomposition (ROCP) is proposed in this paper. The proposed algorithm can avoid forming full Khatri-Rao product, which leads to boost the speed largely and reduce memory usage. The experimental results on synthetic data and real-world data show the ROCP algorithm is able to cope with CP decomposition for large-scale tensors with arbitrary number of dimensions. In addition, ROCP can reduce the computing time and memory usage dramatically, especially for large-scale tensors.

In this paper, we study the sparse nonnegative tensor factorization and completion problem from partial and noisy observations for third-order tensors. Because of sparsity and nonnegativity, the underling tensor is decomposed into the tensor-tensor product of one sparse nonnegative tensor and one nonnegative tensor. We propose to minimize the sum of the maximum likelihood estimate for the observations with nonnegativity constraints and the tensor $\ell_0$ norm for the sparse factor. We show that the error bounds of the estimator of the proposed model can be established under general noise observations. The detailed error bounds under specific noise distributions including additive Gaussian noise, additive Laplace noise, and Poisson observations can be derived. Moreover, the minimax lower bounds are shown to be matched with the established upper bounds up to a logarithmic factor of the sizes of the underlying tensor. These theoretical results for tensors are better than those obtained for matrices, and this illustrates the advantage of the use of nonnegative sparse tensor models for completion and denoising. Numerical experiments are provided to validate the superiority of the proposed tensor-based method compared with the matrix-based approach.

Google has launched a hieroglyphics translator that uses AI to decipher images of Ancient Egyptian script. The new tool, called Fabricius, uses machine learning to give experts a fast way to decode hieroglyphics by uploading their files. But the tool is available to non-experts as a fun and interactive way to learn about and write in the ancient language. Anyone can type in messages and be provided with an instant hieroglyphic equivalent to share on social media. Users can also draw their own best attempt at an ancient hieroglyphic and see if Google's machine learning technology can identify it from its database of hieroglyphs. The tool aims to'help bring people closer to ancient Egyptian heritage and culture' and highlight the importance of the preserving hieroglyphics as a language.

This report documents ideas for improving the field of machine learning, which arose from discussions at the ML Retrospectives workshop at NeurIPS 2019. The goal of the report is to disseminate these ideas more broadly, and in turn encourage continuing discussion about how the field could improve along these axes. We focus on topics that were most discussed at the workshop: incentives for encouraging alternate forms of scholarship, restructuring the review process, participation from academia and industry, and how we might better train computer scientists as scientists. Videos from the workshop can be accessed at Lowe et al. (2019).

Precision Medicine aims to design individualized strategies for diagnostic or therapeutic decision-making, based on both genotypic and phenotypic information. It allows scientists and clinicians to understand which therapeutic and preventive approaches to a specific illness can work effectively in subgroups of patients based on their genetic makeup, lifestyle, and environmental factors [15]. The diffusion of high-throughput assays, such as next-generation sequencing (NGS) and mass spectrometry (MS), has led to fast accumulation of sequences and other omics data which can be used to enable Precision Medicine in practice. As an example, specific disease biomarkers may be identified by cleaning up raw data generated by NGS or MS, and then experimentally validated in laboratory. An important problem in this context is the indexing of NGS data [8].

Purpose: This paper presents an algorithm that can elicitate (infer) all or any combination of ELECTRE Tri-B parameters. For example, a decision-maker can maintain the values for indifference, preference, and veto thresholds, and our algorithm can find the criteria weights, reference profiles, and the lambda cutting level. Our approach is inspired by a Machine Learning ensemble technique, the Random Forest, and for that, we named our approach as ELECTRE Tree algorithm. Methodology: First, we generate a set of ELECTRE Tri-B models, where each model solves a random sample of criteria and alternatives. Each sample is made with replacement, having at least two criteria and between 10% to 25% of alternatives. Each model has its parameters optimized by a genetic algorithm that can use an ordered cluster or an assignment example as a reference to the optimization. Finally, after the optimization phase, two procedures can be performed, the first one will merge all models, finding in this way the elicitated parameters, and in the second procedure each alternative is classified (voted) by each separated model, and the majority vote decides the final class. Findings: We have noted that concerning the voting procedure, non-linear decision boundaries are generated, and they can be suitable in analyzing problems with the same nature. In contrast, the merged model generates linear decision boundaries. Originality: The elicitation of ELECTRE Tri-B parameters is made by an ensemble technique that is composed of a set of multicriteria models that are engaged in generating robust solutions.

We waste 1.6 billion tons of food every year while 25 million starve and another billion are malnourished. If one startup in Berlin is successful, just maybe. The global food supply chain is mind-bogglingly complex. Tens of millions of farms feed millions of grocery stores and restaurants, which in turn supply almost eight billion people their daily food. Plus of course there are transport companies, wholesalers, distributors, processors, and delivery companies.

We are interested in the problem of efficiently determining the data complexity of answering queries mediated by non-Horn description logic ontologies and constructing their optimal rewritings to standard database queries. In general, this problem is known to be extremely complex. In this article, we strip it to the bare bones and focus on conjunctive queries mediated by a simple covering axiom stating that one class is covered by the union of two other classes. We develop a novel technique to prove that, quite surprisingly, deciding first-order rewritability of even such simple ontology-mediated queries is PSpace-hard. The main result of this article is a complete and transparent syntactic AC0/NL/P/coNP tetrachotomy of path queries under the assumption that the covering classes are disjoint. We also obtain a number of syntactic and semantic sufficient conditions (without the path query assumption) for membership in AC0, L, NL, and P.

In many areas of science, various sensing technologies are used to obtain information about a single system of interest. Often, none of the datasets alone contains a complete view of the system, but the data measured from different modalities can complement each other. For instance, brain activity patterns can be captured using both electroencephalography (EEG) and functional magnetic resonance imaging (fMRI) signals, which have complementary temporal and spatial resolutions. Similarly, in metabolomics, multiple analytical techniques such as LCMS (Liquid Chromatography - Mass Spectrometry) and NMR (Nuclear Magnetic Resonance) spectroscopy are used to measure chemical compounds in biological samples, providing a more complete picture of underlying biological processes. Joint analysis of datasets from multiple sources, also referred to as data fusion (or multi-modal data mining), exploits these complementary measurements, and allows for better interpretability and, potentially, more accurate recovery of patterns characterizing the underlying phenomena. Nevertheless, data fusion poses many challenges, and there is an emerging need for data fusion methods that can take into account different characteristics of data from multiple sources in many disciplines [1-4]. Data from multiple sources can often be represented in the form of matrices and higher-order tensors. Coupled matrix and tensor factorizations (CMTF) are an effective approach for joint analysis of such datasets in many domains including social network analysis [5-8], neuroscience [9-13], and chemometrics [2, 14]. In such coupled factorizations, each dataset is modelled by a low-rank approximation.