Query: Convergence of Online Gradient Method for Pi-sigma Neural Networks with Inner-penalty Terms

Relevant passages:
A Penalty-Function Approach for Pruning Feedforward Neural Networks <=SEP=> This article proposes the use of a penalty function for pruning feedforward neural network by weight elimination. The penalty function proposed consists of two terms. The first term is to discourage the use of unnecessary connections, and the second term is to prevent the weights of the connections from taking excessively large values. Simple criteria for eliminating weights from the network are also given. The effectiveness of this penalty function is tested on three well-known problems: the contiguity problem, the parity problems, and the monks problems. The resulting pruned networks obtained for many of these problems have fewer connections than previously reported in the literature.

Optimal Brain Damage <=SEP=> We have used information-theoretic ideas to derive a class of practical and nearly optimal schemes for adapting the size of a neural network. By removing unimportant weights from a network, several improvements can be expected: better generalization, fewer training examples required, and improved speed of learning and/or classification. The basic idea is to use second-derivative information to make a tradeoff between network complexity and training set error. Experiments confirm the usefulness of the methods on a real-world application.

The Cascade-Correlation Learning Architecture <=SEP=> Cascade-Correlation is a new architecture and supervised learning algorithm for artificial neural networks. Instead of just adjusting the weights in a network of fixed topology, Cascade-Correlation begins with a minimal network, then automatically trains and adds new hidden units one by one, creating a multi-layer structure. Once a new hidden unit has been added to the network, its input-side weights are frozen. This unit then becomes a permanent feature-detector in the network, available for producing outputs or for creating other, more complex feature detectors. The Cascade-Correlation architecture has several advantages over existing algorithms: it learns very quickly, the network determines its own size and topology, it retains the structures it has built even if the training set changes, and it requires no back-propagation of error signals through the connections of the network. This research was sponsored in part by the National Science Foundation under Contract Number EET-8716324 and by the Defense Advanced Research Projects Agency (DOD), ARPA Order No. 4976 under Contract F33615-87-C-1499 and monitored by: Avionics Laboratory, Air Force Wright Aeronautical Laboratories, Aeronautical Systems Division (AFSC), Wright-Patterson AFB, OH 45433-6543. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Defense Advanced Research Projects Agency or the US Government. 1. Why is Back-Propagation Learning So Slow? The Cascade-Correlation learning algorithm was developed in an attempt to overcome certain problems and limitations of the popular back-propagation (or “backprop”) learning algorithm [Rumelhart, 1986]. The most important of these limitations is the slow pace at which backprop learns from examples. Even on simple benchmark problems, a back-propagation network may require many thousands of epochs to learn the desired behavior from examples. (An epoch is defined as one pass through the entire set of training examples.) We have attempted to analyze the reasons why backprop learning is so slow, and we have identified two major problems that contribute to the slowness. We call these the step-size problem and the moving target problem. There may, of course, be other contributing factors that we have not yet identified. 1.1. The Step-Size Problem The step-size problem occurs because the standard back-propagation method computes only E w, the partial first derivative of the overall error function with respect to each weight in the network. Given these derivatives, we can perform a gradient descent in weight space, reducing the error with each step. It is straightforward to show that if we take infinitesimal steps down the gradient vector, running a new training epoch to recompute the gradient after each step, we will eventually reach a local minimum of the error function. Experience has shown that in most situations this local minimum will be a global minimum as well, or at least a “good enough” solution to the problem at hand. In a practical learning system, however, we do not want to take infinitesimal steps; for fast learning, we want to take the largest steps that we can. Unfortunately, if we choose a step size that is too large, the network will not reliably converge to a good solution. In order to choose a reasonable step size, we need to know not just the slope of the error function, but something about its higher-order derivatives—its curvature—in the vicinity of the current point in weight space. This information is not available in the standard back-propagation algorithm. A number of schemes have been proposed for dealing with the step-size problem. Some form of “momentum” [Rumelhart, 1986] is often used as a crude way of summarizing the slope of the error surface at earlier points in the computation. Conjugate gradient methods have been explored in the context of artificial neural networks by a number of researchers [Watrous, 1988, Lapedes, 1987, Kramer, 1989] with generally good results. Several schemes, for example [Franzini, 1987] and jacobs:dynamic, have been proposed that adjust the step-size dynamically, based on the change in gradient from one step to another. Becker and LeCun [Becker, 1988] explicitly compute an approximation to the second derivative of the error function at each step and use that information to guide the speed of descent. Fahlman’s quickprop algorithm [Fahlman, 1988] is one of the more successful algorithms for handling the step-size problem in back-propagation systems. Quickprop computes the E w values just as in standard backprop, but instead of simple gradient descent, Quickprop uses a second-order method, related to Newton’s method, to update the weights. On the learning benchmarks we have collected, quickprop consistently out-performs other backprop-like algorithms, sometimes by a large factor. Quickprop’s weight-update procedure depends on two approximations: first, that small changes in one weight have relatively little effect on the error gradient observed at other weights; second, that the error function with respect to each weight is locally quadratic. For each weight, quickprop keeps a copy of

Dynamic node creation in backpropagation networks <=SEP=> Summary form only given. A novel method called dynamic node creation (DNC) that attacks issues of training large networks and of testing networks with different numbers of hidden layer units is presented. DNC sequentially adds nodes one at a time to the hidden layer(s) of the network until the desired approximation accuracy is achieved. Simulation results for parity, symmetry, binary addition, and the encoder problem are presented. The procedure was capable of finding known minimal topologies in many cases, and was always within three nodes of the minimum. Computational expense for finding the solutions was comparable to training normal backpropagation (BP) networks with the same final topologies. Starting out with fewer nodes than needed to solve the problem actually seems to help find a solution. The method yielded a solution for every problem tried. BP applied to the same large networks with randomized initial weights was unable, after repeated attempts, to replicate some minimum solutions found by DNC.<<ETX>>

A simple procedure for pruning back-propagation trained neural networks <=SEP=> The sensitivity of the global error (cost) function to the inclusion/exclusion of each synapse in the artificial neural network is estimated. Introduced are shadow arrays which keep track of the incremental changes to the synaptic weights during a single pass of back-propagating learning. The synapses are then ordered by decreasing sensitivity numbers so that the network can be efficiently pruned by discarding the last items of the sorted list. Unlike previous approaches, this simple procedure does not require a modification of the cost function, does not interfere with the learning process, and demands a negligible computational overhead.

Emotion-based music recommendation by affinity discovery from film music <=SEP=> 0957-4174/$ see front matter 2008 Elsevier Ltd. A doi:10.1016/j.eswa.2008.09.042 q Part of the content of this paper has been publi International Conference on Multimedia, 2005. * Corresponding author. Tel.: +886 2 29393091x67 E-mail address: mkshan@cs.nccu.edu.tw (M.-K. Sh With the growth of digital music, the development of music recommendation is helpful for users to pick desirable music pieces from a huge repository of music. The existing music recommendation approaches are based on a user’s preference on music. However, sometimes, it might better meet users’ requirement to recommend music pieces according to emotions. In this paper, we propose a novel framework for emotion-based music recommendation. The core of the recommendation framework is the construction of the music emotion model by affinity discovery from film music, which plays an important role in conveying emotions in film. We investigate the music feature extraction and propose the Music Affinity Graph and Music Affinity Graph-Plus algorithms for the construction of music emotion model. Experimental result shows the proposed emotion-based music recommendation achieves 85% accuracy in average. 2008 Elsevier Ltd. All rights reserved.

Autonomous cleaning robot: Roboking system integration and overview <=SEP=> This paper would present the system integration and overview of the autonomous cleaning robot Roboking. Roboking is self-propelled autonomously navigating vacuum cleaning robot. It uses several sensors in order to protect indoor environments and itself while cleaning. In this paper, we would describe the principle of operation along with system structure, sensors, functions and integrated subsystems.

Design of auxetic structures via mathematical optimization. <=SEP=> The design of auxetic structures is traditionally based on engineering experience, see, for instance, refs. [1,2]. The goal of this article is to demonstrate how an existing auxetic structure can be improved by structural optimization techniques and manufactured by a selective electron beam melting (SEBM) system. Auxetic materials possess negative Poisson’s ratios ν which is in contrast to almost all engineering materials (e. g. metals ν ≈ 0.3). The negative Poisson’s ratio translates into the unusual geometric effect that these materials expand when stretched and contract when compressed. This behavior is of interest for example for fastener systems and fi lters. [ 2 , 3 ] It also results in interesting mechanical behavior like increased penetration resistance for large negative Poisson’s ratios [ 4 ] and in the case of isotropy for higher shear strength relative to the Young’s modulus [ 2 ] of the structure. The auxetic behavior can always be traced back to complex mesoor microscopic geometric mechanisms, e. g. unfolding of inverted elements or rotation of star shaped rigid units relative to each other. [ 5 – 7 ] These geometries can be realized on vastly different scales from specifi cally designed polymers to reactor cores. [ 2 , 8 ]

CMT-bone: A Mini-App for Compressible Multiphase Turbulence Simulation Software <=SEP=> Designed with the goal of mimicking key features of real HPC workloads, mini-apps have become an important tool for co-design. An investigation of mini-app behavior can provide system designers with insight into the impact of architectures, programming models, and tools on application performance. Mini-apps can also serve as a platform for fast algorithm design space exploration, allowing the application developers to evaluate their design choices before significantly redesigning the application codes. Consequently, it is prudent to develop a mini-app alongside the full blown application it is intended to represent. In this paper, we present CMT-bone a mini-app for the compressible multiphase turbulence (CMT) application, CMT-nek, being developed to extend the physics of the CESAR Nek5000 application code. CMT-bone consists of the most computationally intensive kernels of CMT-nek and the communication operations involved in nearest-neighbor updates and vector reductions. The mini-app represents CMT-nek in its most mature state and going forward it will be developed in parallel with the CMT-nek application to keep pace with key new performance impacting changes. We describe these kernels and discuss the role that CMT-bone has played in enabling interdisciplinary collaboration by allowing application developers to work with computer scientists on performance optimization on current architectures and performance analysis on notional future systems.

A typology for visualizing uncertainty <=SEP=> Information analysts, especially those working in the field of intelligence analysis, must assess not only the information presented to them, but the confidence they have in that information. Visual representations of information are challenged to incorporate a notion of confidence or certainty because the factors that influence the certainty or uncertainty of information vary with the type of information and the type of decisions being made. Visualization researchers have no model or framework for describing uncertainty as it relates to intelligence analysis, thus no consistent basis for constructing visualizations of uncertainty. This paper presents a typology describing the aspects of uncertainty related to intelligence analysis, drawing on frameworks for uncertainty representation in scientific computing.

Broadcast news story segmentation using latent topics on data manifold <=SEP=> This paper proposes to use Laplacian Probabilistic Latent Semantic Analysis (LapPLSA) for broadcast news story segmentation. The latent topic distributions estimated by LapPLSA are used to replace term frequency vector as the representation of sentences and measure the cohesive strength between the sentences. Subword n-gram is used as the basic term unit in the computation. Dynamic Programming is used for story boundary detection. LapPLSA projects the data into a low-dimensional semantic topic representation while preserving the intrinsic local geometric structure of the data. The locality preserving property attempts to make the estimated latent topic distributions more robust to the noise from automatic speech recognition errors. Experiments are conducted on the ASR transcripts of TDT2 Mandarin broadcast news corpus. Our proposed approach is compared with other approaches which use dimensionality reduction technique with the locality preserving property, and two different topic modeling techniques. Experiment results show that our proposed approach provides the highest F1-measure of 0.8228, which significantly outperforms the best previous approaches.

A 10-year retrospective of research in health mass media campaigns: where do we go from here? <=SEP=> Mass media campaigns have long been a tool for promoting public health. How effective are such campaigns in changing health-related attitudes and behaviors, however, and how has the literature in this area progressed over the past decade? The purpose of the current article is threefold. First, I discuss the importance of health mass media campaigns and raise the question of whether they are capable of effectively impacting public health. Second, I review the literature and discuss what we have learned about the effectiveness of campaigns over the past 10 years. Finally, I conclude with a discussion of possible avenues for the health campaign literature over the next 10 years. The overriding conclusion is the following: The literature is beginning to amass evidence that targeted, well-executed health mass media campaigns can have small-to-moderate effects not only on health knowledge, beliefs, and attitudes, but on behaviors as well, which can translate into major public health impact given the wide reach of mass media. Such impact can only be achieved, however, if principles of effective campaign design are carefully followed.

Identifying differentially expressed genes using false discovery rate controlling procedures <=SEP=> MOTIVATION
DNA microarrays have recently been used for the purpose of monitoring expression levels of thousands of genes simultaneously and identifying those genes that are differentially expressed. The probability that a false identification (type I error) is committed can increase sharply when the number of tested genes gets large. Correlation between the test statistics attributed to gene co-regulation and dependency in the measurement errors of the gene expression levels further complicates the problem. In this paper we address this very large multiplicity problem by adopting the false discovery rate (FDR) controlling approach. In order to address the dependency problem, we present three resampling-based FDR controlling procedures, that account for the test statistics distribution, and compare their performance to that of the naïve application of the linear step-up procedure in Benjamini and Hochberg (1995). The procedures are studied using simulated microarray data, and their performance is examined relative to their ease of implementation.


RESULTS
Comparative simulation analysis shows that all four FDR controlling procedures control the FDR at the desired level, and retain substantially more power then the family-wise error rate controlling procedures. In terms of power, using resampling of the marginal distribution of each test statistics substantially improves the performance over the naïve one. The highest power is achieved, at the expense of a more sophisticated algorithm, by the resampling-based procedures that resample the joint distribution of the test statistics and estimate the level of FDR control.


AVAILABILITY
An R program that adjusts p-values using FDR controlling procedures is freely available over the Internet at www.math.tau.ac.il/~ybenja.

Conditional Generative Adversarial Networks for Commonsense Machine Comprehension <=SEP=> Recently proposed Story Cloze Test [Mostafazadeh et al., 2016] is a commonsense machine comprehension application to deal with natural language understanding problem. This dataset contains a lot of story tests which require commonsense inference ability. Unfortunately, the training data is almost unsupervised where each context document followed with only one positive sentence that can be inferred from the context. However, in the testing period, we must make inference from two candidate sentences. To tackle this problem, we employ the generative adversarial networks (GANs) to generate fake sentence. We proposed a Conditional GANs (CGANs) in which the generator is conditioned by the context. Our experiments show the advantage of the CGANs in discriminating sentence and achieve state-of-the-art results in commonsense story reading comprehension task compared with previous feature engineering and deep learning methods.

Outliers , Level Shifts , and Variance Changes in Time Series <=SEP=> Outliers, level shifts, and variance changes are commonplace in applied time series analysis. However, their existence is often ignored and their impact is overlooked, for the lack of simple and useful methods to detect and handle those extraordinary events. The problem of detecting outliers, level shifts, and variance changes in a univariate time series is considered. The methods employed are extremely simple yet useful. Only the least squares techniques and residual variance ratios are used. The effectiveness of these simple methods is demonstrated by analysing three real data sets.

Plant/microbe cooperation for electricity generation in a rice paddy field <=SEP=> Soils are rich in organics, particularly those that support growth of plants. These organics are possible sources of sustainable energy, and a microbial fuel cell (MFC) system can potentially be used for this purpose. Here, we report the application of an MFC system to electricity generation in a rice paddy field. In our system, graphite felt electrodes were used; an anode was set in the rice rhizosphere, and a cathode was in the flooded water above the rhizosphere. It was observed that electricity generation (as high as 6 mW/m2, normalized to the anode projection area) was sunlight dependent and exhibited circadian oscillation. Artificial shading of rice plants in the daytime inhibited the electricity generation. In the rhizosphere, rice roots penetrated the anode graphite felt where specific bacterial populations occurred. Supplementation to the anode region with acetate (one of the major root-exhausted organic compounds) enhanced the electricity generation in the dark. These results suggest that the paddy-field electricity-generation system was an ecological solar cell in which the plant photosynthesis was coupled to the microbial conversion of organics to electricity.

Low numeracy and dyscalculia : identification and intervention <=SEP=> One important factor in the failure to learn arithmetic in the normal way is an endogenous core deficit in the sense of number. This has been associated with low numeracy in general (e.g. Halberda et al. in Nature 455:665–668, 2008) and with dyscalculia more specifically (e.g. Landerl et al. in Cognition 93:99–125, 2004). Here, we describe straightforward ways of identifying this deficit, and offer some new ways of strengthening the sense of number using learning technologies.

A simple tractor-trailer backing control law for path following <=SEP=> Backing of tractor-trailer systems is a problem addressed in many literatures. It is usually solved using various nonlinear-based control methods, which are often not easy to implement or tune. Similar to other work focused on backing a single axle trailer with a car like vehicle, we propose a two-tier controller that is simple and intuitive. However, ours is based upon curvature as opposed to hitch angle, which allows the control input to be more directly related to path specification and to handle path curvature discontinuity better. Experimental results are provided to illustrate the capability of this new algorithm applied to a full scale autonomous vehicle and trailer system in a real field environment using minimal sensing capability. Results demonstrate good performance on sloped grounds with various grades.

Weighted graph comparison techniques for brain connectivity analysis <=SEP=> The analysis of brain connectivity is a vast field in neuroscience with a frequent use of visual representations and an increasing need for visual analysis tools. Based on an in-depth literature review and interviews with neuroscientists, we explore high-level brain connectivity analysis tasks that need to be supported by dedicated visual analysis tools. A significant example of such a task is the comparison of different connectivity data in the form of weighted graphs. Several approaches have been suggested for graph comparison within information visualization, but the comparison of weighted graphs has not been addressed. We explored the design space of applicable visual representations and present augmented adjacency matrix and node-link visualizations. To assess which representation best support weighted graph comparison tasks, we performed a controlled experiment. Our findings suggest that matrices support these tasks well, outperforming node-link diagrams. These results have significant implications for the design of brain connectivity analysis tools that require weighted graph comparisons. They can also inform the design of visual analysis tools in other domains, e.g. comparison of weighted social networks or biological pathways.

Identifying Customer Preferences about Tourism Products Using an Aspect-based Opinion Mining Approach <=SEP=> In this study we extend Bing Liu’s aspect-based opinion mining technique to apply it to the tourism domain. Using this extension, we also offer an approach for considering a new alternative to discover consumer preferences about tourism products, particularly hotels and restaurants, using opinions available on the Web as reviews. An experiment is also conducted, using hotel and restaurant reviews obtained from TripAdvisor, to evaluate our proposals. Results showed that tourism product reviews available on web sites contain valuable information about customer preferences that can be extracted using an aspect-based opinion mining approach. The proposed approach proved to be very effective in determining the sentiment orientation of opinions, achieving a precision and recall of 90%. However, on average, the algorithms were only capable of extracting 35% of the explicit aspect expressions. c © 2013 The Authors. Published by Elsevier B.V. Selection and peer-review under responsibility of KES International.

Cannabinoids and the skeleton: from marijuana to reversal of bone loss. <=SEP=> The active component of marijuana, Delta(9)-tetrahydrocannabinol, activates the CB1 and CB2 cannabinoid receptors, thus mimicking the action of endogenous cannabinoids. CB1 is predominantly neuronal and mediates the cannabinoid psychotropic effects. CB2 is predominantly expressed in peripheral tissues, mainly in pathological conditions. So far the main endocannabinoids, anandamide and 2-arachidonoylglycerol, have been found in bone at 'brain' levels. The CB1 receptor is present mainly in skeletal sympathetic nerve terminals, thus regulating the adrenergic tonic restrain of bone formation. CB2 is expressed in osteoblasts and osteoclasts, stimulates bone formation, and inhibits bone resorption. Because low bone mass is the only spontaneous phenotype so far reported in CB2 mutant mice, it appears that the main physiologic involvement of CB2 is associated with maintaining bone remodeling at balance, thus protecting the skeleton against age-related bone loss. Indeed, in humans, polymorphisms in CNR2, the gene encoding CB2, are strongly associated with postmenopausal osteoporosis. Preclinical studies have shown that a synthetic CB2-specific agonist rescues ovariectomy-induced bone loss. Taken together, the reports on cannabinoid receptors in mice and humans pave the way for the development of 1) diagnostic measures to identify osteoporosis-susceptible polymorphisms in CNR2, and 2) cannabinoid drugs to combat osteoporosis.

A Bayesian Approach to Predict Performance of a Student (BAPPS): A Case with Ethiopian Students <=SEP=> The importance of accurate estimation of student’s future performance is essential in order to provide the student with adequate assistance in the learning process. To this end, this research aimed at investigating the use of Bayesian networks for predicting performance of a student, based on values of some identified attributes. We presented empirical experiments on the prediction of performance with a data set of high school students containing 8 attributes. The paper demonstrates an application of the Bayesian approach in the field of education and shows that the Bayesian network classifier has a potential to be used as a tool for prediction of student performance.

A Prolog Framework for Integrating Business Rules into Java Applications <=SEP=> Business specifications – that formerly only supported IT development – increasingly become business configurations in the form of rules that can be loaded directly into IT solutions. PROLOG is well–known for its qualities in the development of sophisticated rule systems. It is desirable to combine the advantages of PROLOG with JAVA, since JAVA has become one of the most used programming languages in industry. However, experts of both programming languages are rare. To overcome the resulting interoperability problems, we have developed a framework which generates a JAVA archive that provides methods to query a given set of PROLOG rules; it ensures that valid knowledge bases are transmitted between JAVA and PROLOG. We use XML Schema for describing the format for exchanging a knowledge base between PROLOG and JAVA. From the XML Schema desciption, we scaffold JAVA classes; the JAVA programmer can use them and fill in the open slots by statements accessing other JAVA data structures. The data structure on the JAVA side reflects the complex structured knowledge base, with which the PROLOG rules work, in an object–oriented way. We can to some extend verify the correctness of the data set / knowledge base sent from JAVA to PROLOG using standard methods for XML Schema. Moreover, we can add constraints that go beyond XML. For instance, we can specify standard integrity constraints known from relational databases, such as primary key, foreign key, and not–null constraints. Since we are dealing with complex structured XML data, however, there can be far more general integrity constraints. These can be expressed by standard PROLOG rules, which can be evaluated on the PROLOG side; they could also be compiled to JAVA by available PROLOG to JAVA converters such as Prolog Cafe – since they will usually be written in a supported subset of PROLOG. We have used our framework for integrating PROLOG business rules into a commercial E–Commerce system written in JAVA.

Confluence: conformity influence in large social networks <=SEP=> Conformity is a type of social influence involving a change in opinion or behavior in order to fit in with a group. Employing several social networks as the source for our experimental data, we study how the effect of conformity plays a role in changing users' online behavior. We formally define several major types of conformity in individual, peer, and group levels. We propose Confluence model to formalize the effects of social conformity into a probabilistic model. Confluence can distinguish and quantify the effects of the different types of conformities. To scale up to large social networks, we propose a distributed learning method that can construct the Confluence model efficiently with near-linear speedup. Our experimental results on four different types of large social networks, i.e., Flickr, Gowalla, Weibo and Co-Author, verify the existence of the conformity phenomena. Leveraging the conformity information, Confluence can accurately predict actions of users. Our experiments show that Confluence significantly improves the prediction accuracy by up to 5-10% compared with several alternative methods.

On board eco-driving system for varying road-traffic environments using model predictive control <=SEP=> This paper presents model predictive control of a vehicle in a varying road-traffic environment for ecological (eco) driving. The vehicle control input is derived by rigorous reasoning approach of model based anticipation of road, traffic and fuel consumption in a crowded road network regulated by traffic signals. Model predictive control with Continuation and generalized minimum residual method for optimization is used to calculate the sequence of control inputs aiming at long run fuel economy maintaining a safe driving. Performance of the proposed eco-driving system is evaluated through simulations in AIMSUN microscopic transport simulator. In spite of nonlinearity and discontinuous movement of other traffic and signals, the proposed system is robust enough to control the vehicle safely. The driving behavior with fuel saving aspects is graphically illustrated, compared and analyzed to signify the prospect of the proposed eco-driving of a vehicle.

Joint Computation Partitioning and Resource Allocation for Latency Sensitive Applications in Mobile Edge Clouds <=SEP=> The proliferation of mobile devices and ubiquitous access of the wireless network enables many new mobile applications such as augmented reality, mobile gaming and so on. As the applications are latency sensitive, researchers propose to offload the complex computations of these applications to the nearby mobile edge cloud, in order to reduce the latency. Existing works mostly consider the problem of partitioning the computations between the mobile device and the traditional cloud that has abundant resources. The proposed approaches can not be applied in the context of mobile edge cloud, because both the resources in the mobile edge cloud and the wireless access bandwidth to the edge cloud are constrained. In this paper, we study joint computation partitioning and resource allocation problem for latency sensitive applications in mobile edge clouds. The problem is novel in that we combine the computation partitioning and the two-dimensional resource allocations in both the computation resources and the network bandwidth. We develop a new and efficient method, namely Multi-Dimensional Search and Adjust (MDSA), to solve the problem. We compares MDSA with the classic list scheduling method and the SearchAdjust algorithm via comprehensive simulations. The results show that MDSA outperforms the benchmark algorithms in terms of the overall application latency.

The Spatial Orienting paradigm: How to design and interpret spatial attention experiments <=SEP=> This paper is conceived as a guide that will describe the very well known Spatial Orienting paradigm, used to explore attentional processes in healthy individuals as well as in people suffering from psychiatric disorders and brain-damaged patients. The paradigm was developed in the late 1970s, and since then, it has been used in thousands of attentional studies. In this review, we attempt to describe, the paradigm for the naïf reader, and explain in detail when is it used, which variables are usually manipulated, how to interpret its results, and how can it be adapted to different populations and methodologies. The main goal of this review is to provide a practical guide to researchers who have never used the paradigm that will help them design their experiments, as a function of their theoretical and experimental needs. We also focus on how to adapt the paradigm to different technologies (such as event-related potentials, functional resonance imaging, or transcranial magnetic stimulation), and to different populations by presenting an example of its use in brain-damaged patients.

smartPrediction: a real-time smartphone-based fall risk prediction and prevention system <=SEP=> The high risk of falls and the substantial increase in the elderly population have recently stimulated scientific research on Smartphone-based fall detection systems. Even though these systems are helpful for fall detection, the best way to reduce the number of falls and their consequences is to predict and prevent them from happening in the first place. To address the issue of fall prevention, in this paper, we propose a fall prediction system by integrating the sensor data of Smartphones and a Smartshoe. We designed and implemented a Smartshoe that contains four pressure sensors with a Wi-Fi communication module to unobtrusively collect data in any environment. By assimilating the Smartshoe and Smartphone sensors data, we performed an extensive set of experiments to evaluate normal and abnormal walking patterns. The system can generate an alert message in the Smartphone to warn the user about the high-risk gait patterns and potentially save them from an imminent fall. We validated our approach using a decision tree with 10-fold cross validation and found 97.2% accuracy in gait abnormality detection.

Evaluation of LoRa LPWAN technology for remote health and wellbeing monitoring <=SEP=> Low power consumption, low transceiver chip cost and large coverage area are the main characteristics of the low power wide area networks (LPWAN) technologies. We expect that LPWAN can be part of enabling new human-centric health and wellness monitoring applications. Therefore in this work we study the indoor performance of one LPWAN technology, namely LoRa, by the means of real-life measurements. The measurements were conducted using the commercially available equipment in the main campus of the University of Oulu, Finland, which has an indoor area spanning for over 570 meters North to South and over 320 meters East to West. The measurements were executed for a sensor node operating close to human body that was periodically reporting the sensed data to a base station. The obtained results show that when using 14 dBm transmit power and the largest spreading factor of 12 for the 868 MHz ISM band, the whole campus area can be covered. Measured packet success delivery ratio was 96.7 % without acknowledgements and retransmissions.

Executive control in language processing <=SEP=> During communication, speakers and listeners need the mechanisms of executive control to organize thoughts and actions along internal goals. Speakers may use executive functions to select the right word over competing alternatives to refer to the concept in mind. Listeners may use executive functions to coordinate the outputs of multiple linguistic processes to reach a coherent interpretation of what others say. Bilinguals may use executive functions to control which language is to use or to switch from one language to another. The control mechanisms recruited in language processing may be similar to those recruited in perception and attention, supported by a network of frontal, parietal and sub-cortical brain structures. Here we review existing evidences regarding the involvement of domain-general executive control in language processing. We will explain how executive functions are employed to control interference in comprehension and production, within and across languages.