Assuming computational technologies as a dominant factor in forming new scientific methods during the last century, we review the field of computational urban modeling based on the ways different approaches deal with evolving computational and informational capacities. We claim that during the last few years, due to advancements in ubiquitous computing the flow of unstructured data streams have changed the landscape of empirical modeling and simulation. However, there is a conceptual mismatch between the state of the art in urban modeling paradigms and the capacities offered by these urban data streams. We discuss some alternative mathematical methodologies that introduce an abstraction from the traditional urban modeling methodologies.

Cochlear implants (CIs) are an effective intervention for individuals with severe-to-profound sensorineural hearing loss. Currently, no tuning procedure exists that can fully exploit the technology. We propose online unsupervised algorithms to learn features from the speech of a severely-to-profoundly hearing-impaired patient round-the-clock and compare the features to those learned from the normal hearing population using a set of neurophysiological metrics. Experimental results are presented. The information from comparison can be exploited to modify the signal processing in a patient’s CI to enhance his audibility of speech.

Infants at risk for cerebral palsy are at a severe disadvantage in learning to crawl as compared with typically developing infants. An assistive system is being created at the University of Oklahoma to improve these children's crawling abilities. The infants are: outfitted with a suit that allows kinematic reconstruction of their movements; EEG monitoring of their neural responses; and placed in an assistive robot that can amplify the effectiveness of their crawling actions and reduce the required weight bearing for successful prone locomotion. The system can also map their attempted motions into a library of recognized movements, and create directed robot motion even when the subject has not generated any propulsive forces on their own.

Relentless progress in artificial intelligence (AI) is increasingly raising concerns that machines will replace humans on the job market, and perhaps altogether. Eliezer Yudkowski and others have explored the possibility that a promising future for humankind could be guaranteed by a superintelligent "Friendly AI" , designed to safeguard humanity and its values. I will argue that, from a physics perspective where everything is simply an arrangement of elementary particles, this might be even harder than it appears. Indeed, it may require thinking rigorously about the meaning of life: What is "meaning" in a particle arrangement? What is "life"? What is the ultimate ethical imperative, i.e., how should we strive to rearrange the particles of our Universe and shape its future? If we fail to answer the last question rigorously, this future is unlikely to contain humans.

This paper focuses on a preliminary experimental protocol that aims at assessing a robot operator’s behavior when the robot is equipped with what appears as moral decision capabilities. The protocol is derived from the trolley dilemma, a well-known decision making paradigm. Indeed the participants, acting as operators of simulated aerial robots via a computer screen, are faced to impersonal moral dilemmas, i.e. decide to crash a damaged robot on one of two inhabited areas, and to non-moral choices, i.e. decide to crash a damaged robot on one of two uninhabited areas. In each situation, the robot has a default crash behavior which is displayed to the participant who will have to decide whether to follow it or not. The participants are equipped with fNIRS and eye-tracking and answer a post-experimental questionnaire. As some of the behavioral and physiological results do not match the hypotheses we had set, we give the features of the further experiments that we are planning.

A paradigm of case-supported principle-based behavior (CPB) is proposed to help ensure ethical behavior of autonomous machines. We argue that ethically significant behavior of autonomous systems should be guided by explicit ethical principles determined through a consensus of ethicists. Such a consensus is likely to emerge in many areas in which autonomous systems are apt to be deployed and for the actions they are liable to undertake, as we are more likely to agree on how machines ought to treat us than on how human beings ought to treat one another. Given such a consensus, particular cases of ethical dilemmas where ethicists agree on the ethically relevant features and the right course of action can be used to help discover principles needed for ethical guidance of the behavior of autonomous systems. Such principles help ensure the ethical behavior of complex and dynamic systems and further serve as a basis for justification of their actions as well as a control abstraction for managing unanticipated behavior. The requirements, methods, implementation, and evaluation components of the CPB paradigm are detailed.

This is especially the media as an event unfolds. This methodology consists of case in emergency situations, where the spread of a false rumour three main steps: (i) collection of (source) tweets posted during can have dangerous consequences. For instance, in a an emergency situation, sampling in such a way that situation where a hurricane is hitting a region, or a terrorist it is manageable for human assessment, while generating attack occurs in a city, access to accurate information is a good number of rumourous tweets from multiple stories, crucial for finding out how to stay safe and for maximising (ii) collection of conversations associated with each of the citizens' wellbeing. This is even more important in cases source tweets, which includes a set of replies discussing the where users tend to pass on false information more often source tweet, and (iii) collection of human annotations on than real facts, as occurred with Hurricane Sandy in 2012 the tweets sampled. We provide a definition of a rumour (Zubiaga and Ji 2014). Hence, identifying rumours within a which informs the annotation process. Our definition draws social media stream can be of great help for the development on definitions from different sources, including dictionaries of tools that prevent the spread of inaccurate information.

The paper gives a constructive method, based on greedy algorithms, that provides for the classes of functions with small mixed smoothness the best possible in the sense of order approximation error for the $m$-term approximation with respect to the trigonometric system.

Kernel means are frequently used to represent probability distributions in machine learning problems. In particular, the well known kernel density estimator and the kernel mean embedding both have the form of a kernel mean. Unfortunately, kernel means are faced with scalability issues. A single point evaluation of the kernel density estimator, for example, requires a computation time linear in the training sample size. To address this challenge, we present a method to efficiently construct a sparse approximation of a kernel mean. We do so by first establishing an incoherence-based bound on the approximation error, and then noticing that, for the case of radial kernels, the bound can be minimized by solving the $k$-center problem. The outcome is a linear time construction of a sparse kernel mean, which also lends itself naturally to an automatic sparsity selection scheme. We show the computational gains of our method by looking at three problems involving kernel means: Euclidean embedding of distributions, class proportion estimation, and clustering using the mean-shift algorithm.

We study optimal estimation for sparse principal component analysis when the number of non-zero elements is small but on the same order as the dimension of the data. We employ approximate message passing (AMP) algorithm and its state evolution to analyze what is the information theoretically minimal mean-squared error and the one achieved by AMP in the limit of large sizes. For a special case of rank one and large enough density of non-zeros Deshpande and Montanari [1] proved that AMP is asymptotically optimal. We show that both for low density and for large rank the problem undergoes a series of phase transitions suggesting existence of a region of parameters where estimation is information theoretically possible, but AMP (and presumably every other polynomial algorithm) fails. The analysis of the large rank limit is particularly instructive.