Simplifying and improving mobile based data collection

Social programs often require collection of demographic and program related information. Pen-paper surveys have been the most favorable way of collecting such information. However, with proliferation of smartphones, low cost mobile connectivity with good coverage and availability of several data collection applications that can even work around the connectivity concerns, pen-paper surveys are now being replaced by mobile based data collection. In this work, we discuss the enhancement of Open Data Kit (ODK), an existing mobile based data collection application, with features such as pre-filling and validation SMS. The additional features were motivated from the real world requirements of reducing the data collection effort and minimizing the discrepancies in records for a project requiring information dissemination to beneficiaries of National Rural Employment Guarantee Scheme (NREGS), a government of India scheme. Data collection exercise, using our extended tool, is currently ongoing in two districts across two different states in India. Preliminary results from one deployment indicate that even with 8% of pre-filled fields in a form, there was a 16.1% decrease in the errors. Additionally, time per survey reduced with the pre-filling option. Preliminary results from another deployment indicate that 35% of the pre-filled forms had mismatched or changed information when compared with the data available in government records.


DakNet: rethinking connectivity in developing nations

DakNet provides extraordinarily low-cost digital communication, letting remote villages leapfrog past the expense of traditional connectivity solutions and begin development of a full-coverage broadband wireless infrastructure. What is the basis for a progressive, market-driven migration from e-governance to universal broadband connectivity that local users will pay for? DakNet, an ad hoc network that uses wireless technology to provide asynchronous digital connectivity, is evidence that the marriage of wireless and asynchronous service may indeed be the beginning of a road to universal broadband connectivity. DakNet has been successfully deployed in remote parts of both India and Cambodia at a cost two orders of magnitude less than that of traditional landline solutions.


Open data kit: tools to build information services for developing regions

This paper presents Open Data Kit (ODK), an extensible, open-source suite of tools designed to build information services for developing regions. ODK currently provides four tools to this end: Collect, Aggregate, Voice, and Build. Collect is a mobile platform that renders application logic and supports the manipulation of data. Aggregate provides a "click-to-deploy" server that supports data storage and transfer in the "cloud" or on local servers. Voice renders application logic using phone prompts that users respond to with keypad presses. Finally, Build is a application designer that generates the logic used by the tools. Designed to be used together or independently, ODK core tools build on existing open standards and are supported by an open-source community that has contributed additional tools. We describe four deployments that demonstrate how the decisions made in the system architecture of ODK enable services that can both push and pull information in developing regions.


MyExperience: a system for in situ tracing and capturing of user feedback on mobile phones

This paper presents MyExperience, a system for capturing both objective and subjective in situ data on mobile computing activities. MyExperience combines the following two techniques: 1) passive logging of device usage, user context, and environmental sensor readings, and 2) active context-triggered user experience sampling to collect in situ, subjective user feedback. MyExperience currently runs on mobile phones and supports logging of more than 140 event types, including: 1) device usage such as communication, application usage, and media capture, 2) user context such as calendar appointments, and 3) environmental sensing such as Bluetooth and GPS. In addition, user experience sampling can be targeted to moments of interest by triggering off sensor readings. We present several case studies of field deployments on people's personal phones to demonstrate how MyExperience can be used effectively to understand how people use and experience mobile technology.


Study of Brightness Preservation Histogram Equalization Techniques

Image captured under various environment conditions with low contrast results in visual deterioration. To enhance the contrast of images a number of techniques have been proposed over the years. Histogram equalization is one of those methods which could be used for this purpose. For the contrast enhancement purpose histogram equalization (HE) attempts reduction in the number of gray levels. Contrast enhancement by histogram equalization method involve mapping of gray levels on the basis of changeover function that is derived from the probability distribution of gray levels embedded in input image. For this, the neighbouring gray levels in image having low probability density values are combined into single gray level value. Whereas for neighbouring gray levels having high probability density value the gap between them is increased, HE often makes over-enhancement of images with frequent gray level region resulting in loss of contrast for less frequent area of the images. Thus, the HE technique is not able to preserve image brightness. So wherever the preservation of image brightness is required this method is not preferred. This paper review various histogram equalization techniques used in preserving image brightness as well as the contrast enhancement is presented. The key approach for this aim is to use image segmentation. The criteria used are decomposition of images and the presentation of the basic difference between these techniques. For comparative study of performance of these techniques, absolute mean brightness error (AMBE) is used to determine degree of brightness preservation while peak signal to noise ratio (PSNR) have been used to fine\ degree of contrast enhancement.


Recurrent neural network based recommendation for time heterogeneous feedback

In recommender systems, several kinds of user feedback with time stamps are collected and used for recommendation, which is called the time heterogeneous feedback recommendation problem. The existing recommendation methods can handle only one kind of feedback or ignore the time stamps of the feedback. To solve the time heterogeneous feedback recommendation problem, in this paper, we propose a recurrent neural network model to predict the probability that the user will access an item given the time heterogeneous feedback of this user. To our best knowledge, it is the first time to solve the time heterogeneous feedback recommendation problem by deep neural network model. The proposed model is learned by back propagation algorithm and back propagation through time algorithm. The comparison results on four real-life datasets indicate that the proposed method outperforms the compared state-ofthe-art approaches. © 2016 Elsevier B.V. All rights reserved.


GaitViewer: Semantic Gait Data Analysis and Visualization Tool

Clinical gait analysis studies human locomotion by characterizing movement patterns with heterogeneous acquired gait data (e.g., spatio-temporal parameters, geometry of motion, measures of force). Lack of semantic integration of these heterogeneous data slows down collaborative studies among the laboratories that have different acquisition systems. In this work we propose a semantic integration methodology for gait data, and present GaitViewer a prototype web application for semantic analysis and visualization of gait data. The proposed semantic integration methodology separates heterogeneous and mixed numerical and meta information in gait data. Ontology concepts represent the separated meta information, while numerical information is stored in a NoSQL database. Parallel coordinates visual analytics technique are used as an interface to the analytics tools proposed by the NoSQL database. We tailor GaitViewer for two common use-cases in clinical gait analysis: correlation of measured signals for different subjects, and follow-up analysis of the same subject. Finally, we discuss the potential of a large-scale adoption of frameworks such as GaitViewer for the next generation diagnosis systems for movement disorders.


The VQA-Machine: Learning How to Use Existing Vision Algorithms to Answer New Questions

One of the most intriguing features of the Visual Question Answering (VQA) challenge is the unpredictability of the questions. Extracting the information required to answer them demands a variety of image operations from detection and counting, to segmentation and reconstruction. To train a method to perform even one of these operations accurately from {image, question, answer} tuples would be challenging, but to aim to achieve them all with a limited set of such training data seems ambitious at best. Our method thus learns how to exploit a set of external off-the-shelf algorithms to achieve its goal, an approach that has something in common with the Neural Turing Machine [10]. The core of our proposed method is a new co-attention model. In addition, the proposed approach generates human-readable reasons for its decision, and can still be trained end-to-end without ground truth reasons being given. We demonstrate the effectiveness on two publicly available datasets, Visual Genome and VQA, and show that it produces the state-of-the-art results in both cases.


BJOLP : The Big Joint Optimal Landmarks Planner

BJOLP, The Big Joint Optimal Landmarks Planner uses landmarks to derive an admissible heuristic, which is then used to guide a search for a cost-optimal plan. In this paper we review landmarks and describe how they can be used to derive an admissible heuristic. We conclude with presenting the BJOLP


On Minimal Sets to Destroy the k-Core in Random Networks

We study the problem of finding the smallest set of nodes in a network whose removal results in an empty k-core; where the k-core is the sub-network obtained after the iterative removal of all nodes of degree smaller than k. This problem is also known in the literature as finding the minimal contagious set. The main contribution of our work is an analysis of the performance of the recently introduced corehd algorithm [Scientific Reports, 6, 37954 (2016)] on random networks taken from the configuration model via a set of deterministic differential equations. Our analyses provides upper bounds on the size of the minimal contagious set that improve over previously known bounds. Our second contribution is a new heuristic called the weak-neighbor algorithm that outperforms all currently known local methods in the regimes considered.


Random k-Labelsets for Multilabel Classification

A simple yet effective multilabel learning method, called label powerset (LP), considers each distinct combination of labels that exist in the training set as a different class value of a single-label classification task. The computational efficiency and predictive performance of LP is challenged by application domains with large number of labels and training examples. In these cases, the number of classes may become very large and at the same time many classes are associated with very few training examples. To deal with these problems, this paper proposes breaking the initial set of labels into a number of small random subsets, called labelsets and employing LP to train a corresponding classifier. The labelsets can be either disjoint or overlapping depending on which of two strategies is used to construct them. The proposed method is called RAkEL (RAndom k labELsets), where k is a parameter that specifies the size of the subsets. Empirical evidence indicates that RAkEL manages to improve substantially over LP, especially in domains with large number of labels and exhibits competitive performance against other high-performing multilabel learning methods.


Financial Frictions and the Persistence of History : A Quantitative Exploration

The transitional dynamics of the neoclassical growth model is at odds with the growth experiences of many developing economies. For example, consider the post-communist transition of Eastern Europe: Following liberalization, output grew slowly (and even fell), while interest rates and investment rates remained low, contrary to the predictions of the standard growth theory. We incorporate financial frictions and resource misallocation into an otherwise-standard growth model, and account for the observed growth dynamics. We discipline the model by calibrating its stationary equilibrium to the US data on standard macroeconomic aggregates, wealth distribution, and firms’ internal v. external financing. Our model economy converges slowly to the steady state, with the interest rate and the investment rate starting low and rising over time. We also obtain a new result on heterogeneity and macroeconomic dynamics: Even though strict approximate aggregation—that relies only on unconditional first moments—does not hold in our economy, the effect of heterogeneity on aggregate dynamics is almost completely captured by conditional first moments. Department of Economics, Northwestern University, 2001 Sheridan Road, Evanston, IL 60208, USA (e-mail: f-buera@northwestern.edu). Department of Economics, University of Wisconsin, 1180 Observatory Drive, Madison, WI 53706, USA (email: yshin@ssc.wisc.edu). The transitional dynamics of the neoclassical growth model is characterized by swift convergence to the steady state, staggeringly high real interest rates in the early stages of development, and decreasing investment-to-output ratio over time. However, most economies’ growth experiences are at odds with these neoclassical predictions. One such example is the “miracle” economies of East Asia. As Figure 1 illustrates, growth and investment rates were relatively low initially and peaked in the latter stages. More dramatic evidence against the neoclassical growth model can be found in the post-communist transition of the Eastern European economies. The liberalization of these economies was followed by disappointingly low—even negative—growth rates and slowly increasing investment rates (Figure 2).1 Even after going through an exhaustive list of modified neoclassical growth models, King and Rebelo (1993) conclude that neoclassical transitional dynamics can only play a minor role in explaining observed growth experiences. This is a fundamental challenge for the neoclassical growth theory. Output Per Capita Relative to the US + + + + + + + + + + + JPN KOR SGP bc bc bc bc bc bc bc bc bc bc TWN rs rs rs rs rs rs rs rs rs rs rs THA 195


Neural interactions between motor cortical hemispheres during bimanual and unimanual arm movements.

Cortico-cortical connections through the corpus callosum are a major candidate for mediating bimanual coordination. However, aside from the deficits observed after lesioning this connection, little positive evidence indicates its function in bimanual tasks. In order to address this issue, we simultaneously recorded neuronal activity at multiple sites within the arm area of motor cortex in both hemispheres of awake primates performing different bimanual and unimanual movements. By employing an adapted form of the joint peri-stimulus time histogram technique, we discovered rapid movement-related correlation changes between the local field potentials (LFPs) of the two hemispheres that escaped detection by time-averaged cross-correlation methods. The frequency and amplitude of dynamic modifications in correlations between the hemispheres were similar to those within the same hemisphere. As in previous EEG studies, we found that, on average, correlation decreased during movements. However, a subset of recording site pairs did show transiently increased correlations around movement onset (57% of all pairs and conditions in monkey G, 39% in monkey P). In interhemispheric pairs, these increases were consistently related to the mode of coupling between the two arms. Both the correlations between the movements themselves and the interhemispheric LFP correlation increases were strongest during bimanual symmetric movements, and weaker during bimanual asymmetric and unimanual movements. Increased correlations occurred mainly around movement onset, whilst decreases in correlation dominated during movement execution. The task-specific way in which interhemispheric correlations are modulated is compatible with the notion that interactions between the hemispheres contribute to behavioural coupling between the arms.


Modeling and performance evaluation of IEEE 802.22 physical layer

IEEE 802.22, also called Wireless Regional Area Network (WRAN), is the newest wireless standard being developed for remote and rural areas. In this paper an overview of the standard, and more specifically its PHY layer is introduced. In order to evaluate the performance of the system, we model the PHY layer in MATLAB/SIMULINK and extract the Bit Error Rate (BER) of the system for different code rates and modulation schemes with noisy channel.


Using deep networks for fraud detection in the credit card transactions

Deep learning is a very noteworthy technic that is take into consideration in the several fields. One of the most attractive subjects that need more attention in the prediction accuracy is fraud detection. As the deep network can gradually learn the concepts of any complicated problem, using this technic in this realm is very beneficial. To do so, we propose a deep autoencoder to extract best features from the information of the credit card transactions and then append a softmax network to determine the class labels. Regarding the effect of features in such data employing an overcomplete autoencoder can map data to a high dimensional space and using the sparse models leads to be in a discriminative space that is useful for classification aims. The benefit of this method is the generality virtues that we can use such networks in several realms e.g. national intelligence, cyber security, marketing, medical informatics and so on. Another advantage is the ability to facing big datasets. As the learning phase is offline we can use it for a huge amount of data and generalize that is earned. Results can reveal the advantages of proposed method comparing to the state of the arts.


Robust control and H∞-optimization - Tutorial paper

-The paper presents a tutorial exposition of ~=-optimal regulation theory, emphasizing the relevance of the mixed sensitivity problem for robust control system design.


Rogue-Access-Point Detection: Challenges, Solutions, and Future Directions

Rogue devices are an increasingly dangerous reality in the insider threat problem domain. Industry, government, and academia need to be aware of this problem and promote state-of-the-art detection methods.


Using Summarization to Discover Argument Facets in Online Idealogical Dialog

More and more of the information available on the web is dialogic, and a significant portion of it takes place in online forum conversations about current social and political topics. We aim to develop tools to summarize what these conversations are about. What are the CENTRAL PROPOSITIONS associated with different stances on an issue; what are the abstract objects under discussion that are central to a speaker’s argument? How can we recognize that two CENTRAL PROPOSITIONS realize the same FACET of the argument? We hypothesize that the CENTRAL PROPOSITIONS are exactly those arguments that people find most salient, and use human summarization as a probe for discovering them. We describe our corpus of human summaries of opinionated dialogs, then show how we can identify similar repeated arguments, and group them into FACETS across many discussions of a topic. We define a new task, ARGUMENT FACET SIMILARITY (AFS), and show that we can predict AFS with a .54 correlation score, versus an ngram system baseline of .39 and a semantic textual similarity system baseline of .45.


Ensemble Methods in Machine Learning


QELAR: A Machine-Learning-Based Adaptive Routing Protocol for Energy-Efficient and Lifetime-Extended Underwater Sensor Networks

Underwater sensor network (UWSN) has emerged in recent years as a promising networking technique for various aquatic applications. Due to specific characteristics of UWSNs, such as high latency, low bandwidth, and high energy consumption, it is challenging to build networking protocols for UWSNs. In this paper, we focus on addressing the routing issue in UWSNs. We propose an adaptive, energy-efficient, and lifetime-aware routing protocol based on reinforcement learning, QELAR. Our protocol assumes generic MAC protocols and aims at prolonging the lifetime of networks by making residual energy of sensor nodes more evenly distributed. The residual energy of each node as well as the energy distribution among a group of nodes is factored in throughout the routing process to calculate the reward function, which aids in selecting the adequate forwarders for packets. We have performed extensive simulations of the proposed protocol on the Aqua-sim platform and compared with one existing routing protocol (VBF) in terms of packet delivery rate, energy efficiency, latency, and lifetime. The results show that QELAR yields 20 percent longer lifetime on average than VBF.


Mechanical design of a novel Hand Exoskeleton for accurate force displaying

This paper deals with the mechanical design of a novel haptic Hand Exoskeleton (HE) that allows exerting controlled forces on the fingertip of the index and thumb of the operator. The proposed device includes several design solutions for optimizing the accuracy and mechanical performances. Remote Centers of Motion mechanisms have been adopted for delocalizing the encumbrance of linkages of the structure away from the operator's fingers. An improved stiffness of the transmission and reduced requirements for the actuators have been achieved thanks to a novel Patent Pending principle for integrating speed reduction ratio with the transmission system.


End-fire Quasi-Yagi antennas with pattern diversity on LTCC technology for 5G mobile communications

We have designed two end-fire antennas on LTCC with horizontal and vertical polarizations respectively. The antennas operate at 38GHz, a potential frequency for 5G applications. The horizontally-polarized antenna provide a broadband performance about 27% and 6dB end-fire gain and the vertically-polarized one provide a 12.5% bandwidth and 5dB gain. Both antenna are integrated under a compact substrate. Excellent isolation is achieved between the nearby elements making these antennas suitable for corner elements in 5G mobile system.


Algorithmic Bias in Autonomous Systems

Algorithms play a key role in the functioning of autonomous systems, and so concerns have periodically been raised about the possibility of algorithmic bias. However, debates in this area have been hampered by different meanings and uses of the term, “bias.” It is sometimes used as a purely descriptive term, sometimes as a pejorative term, and such variations can promote confusion and hamper discussions about when and how to respond to algorithmic bias. In this paper, we first provide a taxonomy of different types and sources of algorithmic bias, with a focus on their different impacts on the proper functioning of autonomous systems. We then use this taxonomy to distinguish between algorithmic biases that are neutral or unobjectionable, and those that are problematic in some way and require a response. In some cases, there are technological or algorithmic adjustments that developers can use to compensate for problematic bias. In other cases, however, responses require adjustments by the agent, whether human or autonomous system, who uses the results of the algorithm. There is no “one size fits all” solution to algorithmic bias.


A power line communication network infrastructure for the smart home

Low voltage electrical wiring in homes has largely been dismissed as too noisy and unpredictable to support high speed communication signals. However, recent advances in communication and modulation methodologies as well as in adaptive digital signal processing and error detection and correction have spawned novel media access control (MAC) and physical layer (PHY) protocols, capable of supporting power line communication networks at speeds comparable to wired local area networks (LANs). In this paper we motivate the use of power line LAN’s as a basic infrastructure for building integrated ”smart homes,” wherein information appliances (IA)—ranging from simple control or monitoring devices to multimedia entertainment systems—are seamlessly interconnected by the very wires which provide them electricity. By simulation and actual measurements using ”reference design” prototype commercial powerline products, we show that the HomePlugMAC and PHY layers can guarantee QoS for real-time communications, supporting delay sensitive data streams for ”Smart Home” applications.


Learning Deep Boltzmann Machines using Adaptive MCMC

When modeling high-dimensional richly structured data, it is often the case that the distribution defined by the Deep Boltzmann Machine (DBM) has a rough energy landscape with many local minima separated by high energy barriers. The commonly used Gibbs sampler tends to get trapped in one local mode, which often results in unstable learning dynamics and leads to poor parameter estimates. In this paper, we concentrate on learning DBM’s using adaptive MCMC algorithms. We first show a close connection between Fast PCD and adaptive MCMC. We then develop a Coupled Adaptive Simulated Tempering algorithm that can be used to better explore a highly multimodal energy landscape. Finally, we demonstrate that the proposed algorithm considerably improves parameter estimates, particularly when learning large-scale DBM’s.


Classification using discriminative restricted Boltzmann machines

Recently, many applications for Restricted Boltzmann Machines (RBMs) have been developed for a large variety of learning problems. However, RBMs are usually used as feature extractors for another learning algorithm or to provide a good initialization for deep feed-forward neural network classifiers, and are not considered as a standalone solution to classification problems. In this paper, we argue that RBMs provide a self-contained framework for deriving competitive non-linear classifiers. We present an evaluation of different learning algorithms for RBMs which aim at introducing a discriminative component to RBM training and improve their performance as classifiers. This approach is simple in that RBMs are used directly to build a classifier, rather than as a stepping stone. Finally, we demonstrate how discriminative RBMs can also be successfully employed in a semi-supervised setting.


Deep Belief Networks Are Compact Universal Approximators

Deep belief networks (DBN) are generative models with many layers of hidden causal variables, recently introduced by Hinton, Osindero, and Teh (2006), along with a greedy layer-wise unsupervised learning algorithm. Building on Le Roux and Bengio (2008) and Sutskever and Hinton (2008), we show that deep but narrow generative networks do not require more parameters than shallow ones to achieve universal approximation. Exploiting the proof technique, we prove that deep but narrow feedforward neural networks with sigmoidal units can represent any Boolean expression.


Global, regional, and national causes of child mortality: an updated systematic analysis for 2010 with time trends since 2000

BACKGROUND
Information about the distribution of causes of and time trends for child mortality should be periodically updated. We report the latest estimates of causes of child mortality in 2010 with time trends since 2000.

METHODS
Updated total numbers of deaths in children aged 0-27 days and 1-59 months were applied to the corresponding country-specific distribution of deaths by cause. We did the following to derive the number of deaths in children aged 1-59 months: we used vital registration data for countries with an adequate vital registration system; we applied a multinomial logistic regression model to vital registration data for low-mortality countries without adequate vital registration; we used a similar multinomial logistic regression with verbal autopsy data for high-mortality countries; for India and China, we developed national models. We aggregated country results to generate regional and global estimates.

FINDINGS
Of 7·6 million deaths in children younger than 5 years in 2010, 64·0% (4·879 million) were attributable to infectious causes and 40·3% (3·072 million) occurred in neonates. Preterm birth complications (14·1%; 1·078 million, uncertainty range [UR] 0·916-1·325), intrapartum-related complications (9·4%; 0·717 million, 0·610-0·876), and sepsis or meningitis (5·2%; 0·393 million, 0·252-0·552) were the leading causes of neonatal death. In older children, pneumonia (14·1%; 1·071 million, 0·977-1·176), diarrhoea (9·9%; 0·751 million, 0·538-1·031), and malaria (7·4%; 0·564 million, 0·432-0·709) claimed the most lives. Despite tremendous efforts to identify relevant data, the causes of only 2·7% (0·205 million) of deaths in children younger than 5 years were medically certified in 2010. Between 2000 and 2010, the global burden of deaths in children younger than 5 years decreased by 2 million, of which pneumonia, measles, and diarrhoea contributed the most to the overall reduction (0·451 million [0·339-0·547], 0·363 million [0·283-0·419], and 0·359 million [0·215-0·476], respectively). However, only tetanus, measles, AIDS, and malaria (in Africa) decreased at an annual rate sufficient to attain the Millennium Development Goal 4.

INTERPRETATION
Child survival strategies should direct resources toward the leading causes of child mortality, with attention focusing on infectious and neonatal causes. More rapid decreases from 2010-15 will need accelerated reduction for the most common causes of death, notably pneumonia and preterm birth complications. Continued efforts to gather high-quality data and enhance estimation methods are essential for the improvement of future estimates.

FUNDING
The Bill & Melinda Gates Foundation.


Theory and Applications of Robust Optimization

In this paper we survey the primary research, both theoretical and applied, in the area of Robust Optimization (RO). Our focus will be on the computational attractiveness of RO approaches, as well as the modeling power and broad applicability of the methodology. In addition to surveying the most prominent theoretical results of RO over the past decade, we will also present some recent results linking RO to adaptable models for multi-stage decision-making problems. Finally, we will highlight applications of RO across a wide spectrum of domains, including finance, statistics, learning, and various areas of engineering.


Building a motor simulation de novo: Observation of dance by dancers

Research on action simulation identifies brain areas that are active while imagining or performing simple overlearned actions. Are areas engaged during imagined movement sensitive to the amount of actual physical practice? In the present study, participants were expert dancers who learned and rehearsed novel, complex whole-body dance sequences 5 h a week across 5 weeks. Brain activity was recorded weekly by fMRI as dancers observed and imagined performing different movement sequences. Half these sequences were rehearsed and half were unpracticed control movements. After each trial, participants rated how well they could perform the movement. We hypothesized that activity in premotor areas would increase as participants observed and simulated movements that they had learnt outside the scanner. Dancers' ratings of their ability to perform rehearsed sequences, but not the control sequences, increased with training. When dancers observed and simulated another dancer's movements, brain regions classically associated with both action simulation and action observation were active, including inferior parietal lobule, cingulate and supplementary motor areas, ventral premotor cortex, superior temporal sulcus and primary motor cortex. Critically, inferior parietal lobule and ventral premotor activity was modulated as a function of dancers' ratings of their own ability to perform the observed movements and their motor experience. These data demonstrate that a complex motor resonance can be built de novo over 5 weeks of rehearsal. Furthermore, activity in premotor and parietal areas during action simulation is enhanced by the ability to execute a learned action irrespective of stimulus familiarity or semantic label.


A Novel Miniature YIG Tuned Oscillator Achieves Octave Tuning Bandwidth with Ultra Low Phase Noise in X and Ku Bands

Traditional YIG tuned oscillators use negative resistance type circuits and large magnetic structure to produce excellent phase noise with octave plus tuning ranges, but at the expense of size and weight. This paper describes a revolutionary approach to YIG tuned oscillator design which makes use of a unique combination of a miniaturized magnetic structure, and a GaAs HBT ring oscillator circuit topology, working through a YIG tuned filter to produce octave tuning ranges in X and Ku bands with phase noise less than -125 dBC per Hz at 100 KHz. Frequency pulling is less than 10 KHz into a 2:1 VSWR load over all phases. Simulations and measured data are in excellent agreement


Perceptual category mapping between English and Korean obstruents in non-CV positions: Prosodic location effects in second language identification skills

This study examines the degree to which mapping patterns between native language (L1) and second language (L2) categories for one prosodic context will generalize to other prosodic contexts, and how position-specific neutralization in the L1 influences the category mappings. Forty L1-Korean learners of English listened to English nonsense words consisting of /p b t d f v h ð/ and /ɑ/, with the consonants appearing in pre-stressed intervocalic, poststressed intervocalic, or coda context, and were asked to identify the consonant with both Korean and English labeling and to give gradient evaluations of the goodness of each label to the stimuli. Results show that the mapping patterns differ extensively from those found previously with the same subjects for consonants in initial, onset context. The mapping patterns for the intervocalic context also differed by position with respect to stress location. Coda consonants elicited poor goodness-of-fit and noisier mapping patterns for all segments, suggesting that an L1 coda neutralization process put all L2-English sounds in codas as “new” sounds under the Speech Learning Model (SLM) framework (Flege, 1995). Taken together, the results indicate that consonant learning needs to be evaluated in terms of position-by-position variants, rather than just being a general property of the overall


Viraliency: Pooling Local Virality

In our overly-connected world, the automatic recognition of virality – the quality of an image or video to be rapidly and widely spread in social networks – is of crucial importance, and has recently awaken the interest of the computer vision community. Concurrently, recent progress in deep learning architectures showed that global pooling strategies allow the extraction of activation maps, which highlight the parts of the image most likely to contain instances of a certain class. We extend this concept by introducing a pooling layer that learns the size of the support area to be averaged: the learned top-N average (LENA) pooling. We hypothesize that the latent concepts (feature maps) describing virality may require such a rich pooling strategy. We assess the effectiveness of the LENA layer by appending it on top of a convolutional siamese architecture and evaluate its performance on the task of predicting and localizing virality. We report experiments on two publicly available datasets annotated for virality and show that our method outperforms state-of-the-art approaches.


Indirect Image Registration with Large Diffeomorphic Deformations

The paper adapts the large deformation diffeomorphic metric mapping framework for image registration to the indirect setting where a template is registered against a target that is given through indirect noisy observations. The registration uses diffeomorphisms that transform the template through a (group) action. These diffeomorphisms are generated by solving a flow equation that is defined by a velocity field with certain regularity. The theoretical analysis includes a proof that indirect image registration has solutions (existence) that are stable and that converge as the data error tends so zero, so it becomes a well-defined regularization method. The paper concludes with examples of indirect image registration in 2D tomography with very sparse and/or highly noisy data.


Shape-based recognition of wiry objects

We present an approach to the recognition of complex-shaped objects in cluttered environments based on edge information. We first use example images of a target object in typical environments to train a classifier cascade that determines whether edge pixels in an image belong to an instance of the desired object or the clutter. Presented with a novel image, we use the cascade to discard clutter edge pixels and group the object edge pixels into overall detections of the object. The features used for the edge pixel classification are localized, sparse edge density operations. Experiments validate the effectiveness of the technique for recognition of a set of complex objects in a variety of cluttered indoor scenes under arbitrary out-of-image-plane rotation. Furthermore, our experiments suggest that the technique is robust to variations between training and testing environments and is efficient at runtime.


Consistent Linear Tracker With Converted Range, Bearing, and Range Rate Measurements

Active sonar and radar systems often include a measurement of range rate in addition to the position-based measurements of range and bearing. Due to the nonlinearity of the range rate measurement with respect to a target state in the Cartesian coordinate system, this measurement is not always fully exploited. The state of the art methods to utilize range rate include the extended Kalman filter and the unscented Kalman filter with sequential processing of the position based measurements and the range rate measurement. Common to these approaches is that the measurement prediction function remains nonlinear. The goal of this work is to develop a measurement conversion from range, bearing, and range rate to Cartesian position and velocity that is unbiased and consistent, with appropriate elimination of estimation bias. The converted measurement is then used with a linear Kalman filter. Performance of this new method is compared to state of the art techniques and shown to match or exceed that of existing techniques over a wide range of scenarios.


A term-based methodology for query reformulation understanding

Key to any research involving session search is the understanding of how a user’s queries evolve throughout the session. When a user creates a query reformulation, he or she is consciously retaining terms from their original query, removing others and adding new terms. By measuring the similarity between queries we can make inferences on the user’s information need and how successful their new query is likely to be. By identifying the origins of added terms we can infer the user’s motivations and gain an understanding of their interactions. In this paper we present a novel term-based methodology for understanding and interpreting query reformulation actions. We use TREC Session Track data to demonstrate how our technique is able to learn from query logs and we make use of click data to test user interaction behavior when reformulating queries. We identify and evaluate a range of term-based query reformulation strategies and show that our methods provide valuable insight into understanding query reformulation in session search.


Object-Aware Identification of Microservices

Microservices is an architectural style inspired by service-oriented computing that structures an application as a collection of cohesive and loosely coupled components, which implement business capabilities. One of today’s problems in designing microservice architectures is to decompose a system into cohesive, loosely coupled, and fine-grained microservices. Identification of microservices is usually performed intuitively, based on the experience of the system designers, however, if the functionalities of a system are highly interconnected, it is a challenging task to decompose the system into appropriate microservices. To tackle this challenge, we present a microservice identification method that decomposes a system using clustering technique. To this end, we model a system as a set of business processes and take two aspects of structural dependency and data object dependency of functionalities into account. Furthermore, we conduct a study to evaluate the effect of process characteristics on the accuracy of identification approaches.


On the Reception and Detection of Pseudo-profound Bullshit

Although bullshit is common in everyday life and has attracted attention from philosophers, its reception (critical or ingenuous) has not, to our knowledge, been subject to empirical investigation. Here we focus on pseudo-profound bullshit, which consists of seemingly impressive assertions that are presented as true and meaningful but are actually vacuous. We presented participants with bullshit statements consisting of buzzwords randomly organized into statements with syntactic structure but no discernible meaning (e.g., “Wholeness quiets infinite phenomena”). Across multiple studies, the propensity to judge bullshit statements as profound was associated with a variety of conceptually relevant variables (e.g., intuitive cognitive style, supernatural belief). Parallel associations were less evident among profundity judgments for more conventionally profound (e.g., “A wet person does not fear the rain”) or mundane (e.g., “Newborn babies require constant attention”) statements. These results support the idea that some people are more receptive to this type of bullshit and that detecting it is not merely a matter of indiscriminate skepticism but rather a discernment of deceptive vagueness in otherwise impressive sounding claims. Our results also suggest that a bias toward accepting statements as true may be an important component of pseudo-profound bullshit receptivity.


Model Shrinking for Embedded Keyword Spotting

In this paper we present two approaches to improve computational efficiency of a keyword spotting system running on a resource constrained device. This embedded keyword spotting system detects a pre-specified keyword in real time at low cost of CPU and memory. Our system is a two stage cascade. The first stage extracts keyword hypotheses from input audio streams. After the first stage is triggered, hand-crafted features are extracted from the keyword hypothesis and fed to a support vector machine (SVM) classifier on the second stage. This paper focuses on improving the computational efficiency of the second stage SVM classifier. More specifically, select a subset of feature dimensions and merge the SVM classifier to a smaller size, while maintaining the keyword spotting performance. Experimental results indicate that we can remove more than 36% of the non-discriminative SVM features, and reduce the number of support vectors by more than 60% without significant performance degradation. This results in more than 15% relative reduction in CPU utilization.


Predictive Analytics On Public Data - The Case Of Stock Markets

This work examines the predictive power of public data by aggregating information from multiple online sources. Our sources include microblogging sites like Twitter, online message boards like Yahoo! Finance, and traditional news articles. The subject of prediction are daily stock price movements from Standard & Poor’s 500 index (S&P 500) during a period from June 2011 to November 2011. To forecast price movements we filter messages by stocks, apply state-of-the-art sentiment analysis to message texts, and aggregate message sentiments to generate trading signals for daily buy and sell decisions. We evaluate prediction quality through a simple trading model considering real-world limitations like transaction costs or broker commission fees. Considering 833 virtual trades, our model outperformed the S&P 500 and achieved a positive return on investment of up to ~0.49% per trade or ~0.24% when adjusted by market, depending on supposed trading costs.


Soft pneumatic actuator with adjustable stiffness layers for Multi-DoF Actuation

The soft pneumatic actuators (SPAs) are a solution toward the highly customizable and light actuators with the versatility of actuation modes, and an inherent compliance. Such flexibility allows SPAs to be considered as alternative actuators for wearable rehabilitative devices and search and rescue robots. The actuator material and air-chamber design dictate the actuator's mechanical performance. Therefore, each actuator design with a single pressure source produces a highly customized motion but only a single degree of freedom (DoF). We present a novel design and fabrication method for a SPA with different modes of actuation using integrated adjustable stiffness layers (ASLs). Unlike the most SPA designs where one independent chamber is needed for each mode of actuation, here we have a single chamber that drives three different modes of actuation by activating different combinations of ASLs. Adapting customized micro heaters and thermistors for modulating the temperature and stiffness of ASLs, we considerably broaden the work space of the SPA actuator. Here, a thorough characterization of the materials and the modeling of the actuator are presented. We propose a design methodology for developing application specific actuators with multi-DoFs that are light and compact.


Deep learning traffic sign detection, recognition and augmentation

Driving is a complex, continuous, and multitask process that involves driver's cognition, perception, and motor movements. The way road traffic signs and vehicle information is displayed impacts strongly driver's attention with increased mental workload leading to safety concerns. Drivers must keep their eyes on the road, but can always use some assistance in maintaining their awareness and directing their attention to potential emerging hazards. Research in perceptual and human factors assessment is needed for relevant and correct display of this information for maximal road traffic safety as well as optimal driver comfort. In-vehicle contextual Augmented Reality (AR) has the potential to provide novel visual feedbacks to drivers for an enhanced driving experience. In this paper, we present a new real-time approach for fast and accurate framework for traffic sign recognition, based on Cascade Deep learning and AR, which superimposes augmented virtual objects onto a real scene under all types of driving situations, including unfavorable weather conditions. Experiments results show that, by combining the Haar Cascade and deep convolutional neural networks show that the joint learning greatly enhances the capability of detection and still retains its realtime performance.


A Design and Assessment of a Direction Finding Proximity Fuze Sensor

This paper presents the implementation and assessment of a direction finding proximity fuze sensor for anti-aircrafts or anti-air missiles. A higher rejection of clutter signals is achieved by employing a binary phase shift keying modulation using Legendre sequence. The direction finding is implemented by comparing received powers from six receiving antennas equally spaced by an angle of 60° around a cylindrical surface. In addition, target detection algorithms have been developed for a robust detection of the target, taking the wide variation of target related parameters into considerations. The performances of the developed fuze sensor are experimentally verified by constructing the fuze-specific encounter simulation test apparatus, which collects and analyzes reflected signals from a standard target. The developed fuze sensor can successfully detect the -10 dBsm target over a 10 m range as well as the direction with an out-of-range rejection of about 40 dB. Furthermore, the developed fuze sensor can clearly detect the target with mesh clutter environment. To assess realistic operation, the fuze sensor is tested using 155 mm gun firing test setup. Through the gun firing test, the successful fuzing range and direction finding performances are demonstrated.


Cognitive Context Models and Discourse

1. Mental models Since the early 1980s, the notion of mental model has been quite successful in cognitive psychology in general, and in the theory of text processing in particu-Such models have been conceptualized as representations in episodic memory of situations, acts or events spoken or thought about, observed or participated in by human actors, that is of experiences (Ehrlich, Tardieu & Cavazza 1993). In the theory of text processing, such (situation or event) models played a crucial role in establishing the necessary referential basis for the processing of anaphora and other phenomena of coherence (Albrecht & O Brien 1993). They further explained, among many other things, why text recall does not seem to be based on semantic representations of texts, but rather on the mental model construed or updated of the event the text is about (Bower & Morrow 1990). Conversely, mental models also play a role in the much neglected theory of discourse production, viz., as the mental point of departure of all text and talk, from which relevant information may be selected for the strategic construction of their global and local semantic structures. Many experiments have confirmed these hypotheses, and have shown at text comprehension and recall essentially involve a strategic manipulation of models, for instance by matching text information with structures of the The notion of mental space is sometimes also used in formal linguistics as a construct that has similar functions as our notion of a mental model (Faucormier 1985).


XBOS: An Extensible Building Operating System

We present XBOS, an eXtensible Building Operating System for integrated management of previously isolated building subsystems. The key contribution of XBOS is the development of the Building Profile, a canonical, executable description of a building and its subsystems that changes with a building and evolves the control processes and applications accordingly. We discuss the design and implementation of XBOS in the context of 6 dimensions of an effective BAS – hardware presentation layer, canonical metadata, control process management, building evolution management, security, scalable UX and API – and evaluate against several recent building and sensor management systems. Lastly, we examine the evolution of a real, 10 month deployment of XBOS in a 7000 sq ft office building.


Survey on Collaborative AR for Multi-user in Urban Simulation

This paper describes an augmented reality (AR) environment that allows multiple participants or multi-user to interact with 2D and 3D data. AR simply can provide a collaborative interactive AR environment for urban simulation, where users can interact naturally and intuitively. In addition, the collaborative AR makes multi-user in urban simulation to share simultaneously a real world and virtual world. The fusion between real and virtual world, existed in AR environment by see-through HMDs, achieves higher interactivity as a key features of collaborative AR. In real-time, precise registration between both worlds and multiuser are crucial for the collaborations. Collaborative AR allow multi-user to simultaneously share a real world surrounding them and a virtual world. Common problems in AR environment will be discussed and major issues in collaborative AR will be explained details in this paper. The features of collaboration in AR environment are will be identified and the requirements of collaborative AR will be defined. This paper will give an overview on collaborative AR environment for multi-user in urban studies and planning. The work will also cover numerous systems of collaborative AR environments for multi-user.


Training Deep and Recurrent Networks with Hessian-Free Optimization

Hessian-Free optimization (HF) is an approach for unconstrained minimization of real-valued smooth objective functions. Like standard Newton’s method, it uses local quadratic approximations to generate update proposals. It belongs to the broad class of approximate Newton methods that are practical for problems of very high dimensionality, such as the training objectives of large neural networks. Different algorithms that use many of the same key principles have appeared in the literatures of various communities under different names such as Newton-CG, CG-Steihaug, Newton-Lanczos, and Truncated Newton [27, 28], but applications to machine learning and especially neural networks, have been limited or non-existent until recently. With the work of Martens [22] and later Martens and Sutskever [23] it has been demonstrated that such an approach, if carefully designed and implemented, can work very well for optimizing nonconvex functions such as the training objective for deep neural networks and recurrent neural networks (RNNs), given sensible random initializations. This was significant because gradient descent methods have been observed to be very slow and sometimes completely ineffective [16, 4, 17] on these problems, unless special non-random initializations schemes like layer-wise pre-training [16, 15, 3] are used. HF, which is a general optimization-based approach, can be used in conjunction with or as an alternative to existing pre-training methods and is more widely applicable, since it relies on fewer assumptions about the specific structure of the network. In this report we will first describe the basic HF approach, and then examine well-known general purpose performance-improving techniques as well as others that are specific to HF (versus other Truncated-Newton type approaches) or to neural networks. We will also provide practical tips for creating efficient and correct implementations, and discuss the pitfalls which may arise when designing and using an HF-based approach in a particular application.


Neuronlike adaptive elements that can solve difficult learning control problems

It is shown how a system consisting of two neuronlike adaptive elements can solve a difficult learning control problem. The task is to balance a pole that is hinged to a movable cart by applying forces to the cart's base. It is argued that the learning problems faced by adaptive elements that are components of adaptive networks are at least as difficult as this version of the pole-balancing problem. The learning system consists of a single associative search element (ASE) and a single adaptive critic element (ACE). In the course of learning to balance the pole, the ASE constructs associations between input and output by searching under the influence of reinforcement feedback, and the ACE constructs a more informative evaluation function than reinforcement feedback alone can provide. The differences between this approach and other attempts to solve problems using neurolike elements are discussed, as is the relation of this work to classical and instrumental conditioning in animal learning studies and its possible implications for research in the neurosciences.


Convergent Temporal-Difference Learning with Arbitrary Smooth Function Approximation

We introduce the first temporal-difference learning algorithms that converge with smooth value function approximators, such as neural networks. Conventional temporal-difference (TD) methods, such as TD(λ), Q-learning and Sarsa have been used successfully with function approximation in many applications. However, it is well known that off-policy sampling, as well as nonlinear function approximation, can cause these algorithms to become unstable (i.e., the parameters of the approximator may diverge). Sutton et al. (2009a, 2009b) solved the problem of off-policy learning with linear TD algorithms by introducing a new objective function, related to the Bellman error, and algorithms that perform stochastic gradient-descent on this function. These methods can be viewed as natural generalizations to previous TD methods, as they converge to the same limit points when used with linear function approximation methods. We generalize this work to nonlinear function approximation. We present a Bellman error objective function and two gradient-descent TD algorithms that optimize it. We prove the asymptotic almost-sure convergence of both algorithms, for any finite Markov decision process and any smooth value function approximator, to a locally optimal solution. The algorithms are incremental and the computational complexity per time step scales linearly with the number of parameters of the approximator. Empirical results obtained in the game of Go demonstrate the algorithms’ effectiveness.


A 0.5V supply, 49nW band-gap reference and crystal oscillator in 40nm CMOS

This paper presents the co-design of 0.5V operational band-gap reference (BGR) and 32kHz crystal oscillator (XO) in 40nm CMOS process. The proposed BJT-based BGR offers 10× resistor area reduction compared to the conventional BGR. The proposed XO provides trans-conductance enhancement without the need for large coupling capacitor and uses a feedback loop to regulate its bias current, oscillation amplitude across PVT. The total power consumption is less than 49nW from −40°C to 120°C. Without any trimming, the BGR achieves temperature coefficients of 8ppm/°C and XO has temperature coefficient of 0.25ppm/°C. The BGR offers 5× lower area, 2× lower power consumption at 120°C compared to prior work on resistor-based, non-duty cycled BGR. The XO improves power consumption by at least 2× compared to prior work at 120°C, 0.5V supply.


Multiobjective Optimization of Ultraflat Magnetic Components With PCB-Integrated Core

In future applications, e.g., in ultra-flat OLED lamp drivers or flat screen power supplies, ultra-flat ac/dc and dc/dc converter systems are highly demanded. Therefore, the design and implementation of a printed circuit board (PCB)-integrated flyback transformer for a 1-mm-thin single-phase power factor correction rectifier is under investigation. In this paper, first an overview on several integration methods is given. It is shown that the PCB integration of magnetic cores allows us to achieve the required thickness of 1 mm and a high energy density. In a next step, the design and the realization of ultra-flat magnetic components with PCB-integrated cores are discussed in detail. The presented multi-objective design procedure determines the inductor and/or transformer setup optimal with respect to minimal losses and/or minimal footprint area; for this purpose, all required electrical, magnetic, and geometrical parameters of the magnetic component are considered in the design process. Furthermore, all specific implications entailed by the PCB-integrated core, e.g., the core setup, anisotropic core losses, the interleaving of windings, or an accurate reluctance model are treated. Finally, experimental results are used to verify the design procedure.


The Logic of Plausible Reasoning: A Core Theory

1. o formal representation of plausible inference patterns; such OS deductions, inductions, ond analogies, thot ore frequently employed in answering every doy questions: 2. a set of parameters, such OS conditional likelihood, typicality, and similarity, that affect the certainty of people’s onswers to such questions; ond 3. a system relating the different plorisible inference patterns and the different certainty parameters.


A FPGA-Based Neuromorphic Locomotion System for Multi-Legged Robots

The paper develops a neuromorphic system on a Spartan 6 field programmable gate array (FPGA) board to generate locomotion patterns (gaits) for three different legged robots (biped, quadruped, and hexapod). The neuromorphic system consists of a reconfigurable FPGA-based architecture for a 3G artificial neural network (spiking neural network), which acts as a Central Pattern Generator (CPG). The locomotion patterns, are then generated by the CPG through a general neural architecture, which parameters are offline estimated by means of grammatical evolution and Victor-Purpura distance-based fitness function. The neuromorphic system is fully validated on real biped, quadruped, and hexapod robots.


An Empirical Study of Algorithms for Point-Feature Label Placement

A major factor affecting the clarity of graphical displays that include text labels is the degree to which labels obscure display features (including other labels) as a result of spatial overlap. Point-feature label placement (PFLP) is the problem of placing text labels adjacent to point features on a map or diagram so as to maximize legibility. This problem occurs frequently in the production of many types of informational graphics, though it arises most often in automated cartography. In this paper we present a comprehensive treatment of the PFLP problem, viewed as a type of combinatorial optimization problem. Complexity analysis reveals that the basic PFLP problem and most interesting variants of it are NP-hard. These negative results help inform a survey of previously reported algorithms for PFLP; not surprisingly, all such algorithms either have exponential time complexity or are incomplete. To solve the PFLP problem in practice, then, we must rely on good heuristic methods. We propose two new methods, one based on a discrete form of gradient descent, the other on simulated annealing, and report on a series of empirical tests comparing these and the other known algorithms for the problem. Based on this study, the first to be conducted, we identify the best approaches as a function of available computation time.


Mapping Agricultural Ecosystem Services across Scales

Given the cross-scale interactions of agricultural ecosystems, it is important to collect ecosystem service data at the multiple spatial scales they operate at. Mapping of ecosystem services helps to assess their spatial and temporal distribution and is a popular communication tool of their availability and value. For example, maps can be used to quantify distance between areas of available ecosystem services and their beneficiaries and how services fluctuate with changes in land use patterns over time, allowing identification of synergies and trade-offs. However, a lack of local context and too large a resolution can reduce the utility of these maps, whilst masking heterogeneities in access due to equity dynamics. This review identifies and summarizes eight main methods of ESS mapping found in the literature – remote sensing, biophysical modelling, agent based modelling, economic valuation, expert opinion, user preference, participatory mapping, and photo-elicitation. We consider what spatial scales these methods are utilized at and the transferability of data created by each method. The analysis concludes with a methodological framework for mapping ecosystem services, intended to help researchers identify appropriate methods for a multi-scale research design. The framework is exemplified with an overview of a research project in Ethiopia.


Evidence for physiotherapy practice: a survey of the Physiotherapy Evidence Database (PEDro).

Evidence-based practice involves the use of evidence from systematic reviews and randomised controlled trials, but the extent of this evidence in physiotherapy has not previously been surveyed. The aim of this survey is to describe the quantity and quality of randomised controlled trials and the quantity of systematic reviews relevant to physiotherapy. The Physiotherapy Evidence Database (PEDro) was searched. The quality of trials was assessed with the PEDro scale. The search identified a total of 2,376 randomised controlled trials and 332 systematic reviews. The first trial was published in 1955 and the first review was published in 1982. Since that time, the number of trials and reviews has grown exponentially. The mean PEDro quality score has increased from 2.8 in trials published between 1955 and 1959 to 5.0 for trials published between 1995 and 1999. There is a substantial body of evidence about the effects of physiotherapy. However, there remains scope for improvements in the quality of the conduct and reporting of clinical trials.


A Guided Tour Puzzle for Denial of Service Prevention

Various cryptographic puzzle schemes are proposed as a defense mechanism against denial of service attack. But, all these puzzle schemes face a dilemma when there is a large disparity between the computational power of attackers and legitimate clients: increasing the difficulty of puzzles might unnecessarily restrict legitimate clients too much, and lower difficulty puzzles cannot sufficiently block attackers with large computational resources. In this paper, we introduce guided tour puzzle, a novel puzzle scheme that is not affected by such resource disparity. A guided tour puzzle requires a client to visit a predefined set of nodes, called tour guides, in a certain sequential order to retrieve an n piece answer, one piece from each tour guide that appears in the tour. This puzzle solving process is non-parallelizable, thus cheating by trying to solve the puzzle in parallel is not possible. Guided tour puzzle not only achieves all previously defined desired properties of a cryptographic puzzle scheme, but it also satisfies more important requirements, such as puzzle fairness and minimum interference, that we identified. The number of tour guides required by the scheme can be as few as two, and this extra cost can be amortized by sharing the same set of tour guides among multiple servers.


On-Chip Compensation of Ring VCO Oscillation Frequency Changes Due to Supply Noise and Process Variation

A novel circuit technique that stabilizes the oscillation frequency of a ring-type voltage-controlled oscillator (RVCO) is demonstrated. The technique uses on-chip bias-current and voltage-swing controllers, which compensate RVCO oscillation frequency changes caused by supply noise and process variation. A prototype phase-locked loop (PLL) having the RVCO with the compensation circuit is fabricated with 0.13-μm CMOS technology. At the operating frequency of 4 GHz, the measured PLL rms jitter improves from 20.11 to 5.78 ps with 4-MHz RVCO supply noise. Simulation results show that the oscillation frequency difference between FF and SS corner is reduced from 63% to 6% of the NN corner oscillation frequency.


Learning Bayesian Belief Network Classifiers: Algorithms and System

This paper investigates the methods for learning Bayesian belief network (BN) based predictive models for classification. Our primary interests are in the unrestricted Bayesian network and Bayesian multi-net based classifiers. We present our algorithms for learning these classifiers and also the methods for fighting the overfitting problem. A natural method for feature subset selection is also studied. Using a set of standard classification problems, we empirically evaluate the performance of various BN based classifiers. The results show that the proposed BN and Bayes multi-net classifiers are competitive with (or superior to) the best known classifiers, based on both BN and other formalisms; and that the computational time for learning and using these classifiers is relatively small. We also briefly introduce our BN classifier learning system – BN PowerPredictor. We argue that BN based classifiers deserve more attention in the data mining community.


We present a reinforcement learning framework, called Programmatically Interpretable Reinforcement Learning (PIRL), that is designed to generate interpretable and verifiable agent policies. Unlike the popular Deep Reinforcement Learning (DRL) paradigm, which represents policies by neural networks, PIRL represents policies using a high-level, domain-specific programming language. Such programmatic policies have the benefits of being more easily interpreted than neural networks, and being amenable to verification by symbolic methods. We propose a new method, called Neurally Directed Program Search (NDPS), for solving the challenging nonsmooth optimization problem of finding a programmatic policy with maximal reward. NDPS works by first learning a neural policy network using DRL, and then performing a local search over programmatic policies that seeks to minimize a distance from this neural “oracle”. We evaluate NDPS on the task of learning to drive a simulated car in the TORCS carracing environment. We demonstrate that NDPS is able to discover human-readable policies that pass some significant performance bars. We also show that PIRL policies can have smoother trajectories, and can be more easily transferred to environments not encountered during training, than corresponding policies discovered by DRL.


Estimator initialization in vision-aided inertial navigation with unknown camera-IMU calibration

This paper focuses on motion estimation using inertial measurements and observations of naturally occurring point features. To date, this task has primarily been addressed using filtering methods, which track the system state starting from known initial conditions. However, when no prior knowledge of the initial system state is available, (e.g., at the onset of the system's operation), the existing approaches are not applicable. To address this problem, in this work we present algorithms for computing the system's observable quantities (platform attitude and velocity, feature positions, and IMU-camera calibration) directly from the sensor measurements, without any prior knowledge. A key contribution of this work is a convex-optimization based algorithm for computing the rotation matrix between the camera and IMU. We show that once this rotation matrix has been computed, all remaining quantities can be determined by solving a quadratically constrained least-squares problem. To increase their accuracy, the initial estimates are refined by an iterative maximum-likelihood estimator.


LKIM : The Linux Kernel Integrity

509 he Linux Kernel Integrity Measurer (LKIM) is a next-generation technology for the detection of malicious modifications to a running piece of software. Unlike traditional antivirus systems, LKIM does not rely on a database of known malware signatures; instead, LKIM uses a precise model of expected program behavior to verify the consistency of critical data structures at runtime. APL and the Research Directorate of the National Security Agency (NSA) developed the LKIM prototype and are now working to transition the technology to a variety of critical government applications. LKIM: The Linux Kernel Integrity Measurer


A Wide-Field-of-View Monocentric Light Field Camera

Light field (LF) capture and processing are important in an expanding range of computer vision applications, offering rich textural and depth information and simplification of conventionally complex tasks. Although LF cameras are commercially available, no existing device offers wide field-of-view (FOV) imaging. This is due in part to the limitations of fisheye lenses, for which a fundamentally constrained entrance pupil diameter severely limits depth sensitivity. In this work we describe a novel, compact optical design that couples a monocentric lens with multiple sensors using microlens arrays, allowing LF capture with an unprecedented FOV. Leveraging capabilities of the LF representation, we propose a novel method for efficiently coupling the spherical lens and planar sensors, replacing expensive and bulky fiber bundles. We construct a single-sensor LF camera prototype, rotating the sensor relative to a fixed main lens to emulate a wide-FOV multi-sensor scenario. Finally, we describe a processing toolchain, including a convenient spherical LF parameterization, and demonstrate depth estimation and post-capture refocus for indoor and outdoor panoramas with 15 x 15 x 1600 x 200 pixels (72 MPix) and a 138° FOV.


A lightweight gravity-balanced exoskeleton for home rehabilitation of upper limbs

Stroke recovery requires intensive and continuous rehabilitation over a long period of time. Access to existing rehabilitation devices is limited to hospitals due to the considerable cost and maintenance. This paper proposes a lightweight, low-cost gravity-balanced exoskeleton for home rehabilitation of upper limbs. Gravity balancing is based on a two-bar mechanism that can fit the periphery of a human arm. A type of planar flexural spring is proposed to achieve the required spring potential energy. This type of spring has a thin cross-section and can be designed and fabricated conveniently. A model is constructed to optimize the geometry and dimension of the exoskeleton. Performance is evaluated through a static analysis. The results show that the proposed exoskeleton is both simpler and lighter than existing passive devices. It can be easily custom-made for different arm masses and sizes. We expect the exoskeleton to be used in both clinical and homecare environments for the arm rehabilitation of stroke patients.


Using Risk to Balance Agile and Plan-Driven Methods

M ethodologies such as Extreme Programming (XP), Scrum, and agile software development promise increased customer satisfaction, lower defect rates, faster development times, and a solution to rapidly changing requirements. Plan-driven approaches such as Cleanroom, the Personal Software Process, or methods based on the Capability Maturity Model promise predictability , stability, and high assurance. However, both agile and planned approaches have situation-dependent shortcomings that, if left unaddressed, can lead to project failure. The challenge is to balance the two approaches to take advantage of their strengths in a given situation while compensating for their weaknesses. We present a risk-based approach for structuring projects to incorporate both agile and plan-driven approaches in proportion to a project's needs. We drew this material from our book, Balancing Agility and Discipline: A Guide for the Perplexed, to be published in 2003. Our method uses risk analysis and a unified process framework to tailor risk-based processes into an overall development strategy. This method enhances the ability of key development team members to understand their environment and organizational capabilities and to identify and collaborate with the project's stakeholders. We use risk analysis to define and address risks particularly associated with agile and plan-driven methods. The Risk-Based Spiral Model Anchor Points 2 provide the framework for this process. Both the Rational Unified Process 3 (RUP) and the Model-Based Architecting and Software Engineering (Mbase) process 4 have adopted these anchor points, which are essentially an integrated set of decision criteria for stakeholder commitment at specific points in the development process. Our method consists of five steps. Step 1 First, we apply risk analysis to specific risk areas associated with agile and plan-driven methods. We identify three specific risk categories: environmental , agile, and plan-driven. While not a simple task, Step 1 provides the basis for making decisions about the development strategy later in the process. If we uncover too much uncertainty about some risk categories, spending resources early to buy information about the project aspects that create the uncertainty may prove prudent. The candidate risks we describe are just that— candidates for consideration. They are neither complete nor always applicable, but serve as guides to stimulate participants' thinking. Next, we evaluate the risk analysis results to determine if the project at hand is appropriate for either purely agile or purely plan-driven methods. In these cases, the project characteristics fall squarely in the home ground of one approach or A …


Why healthcare workers don't wash their hands: a behavioral explanation.

OBJECTIVE
To elucidate behavioral determinants of handwashing among nurses.

DESIGN
Statistical modeling using the Theory of Planned Behavior and relevant components to handwashing behavior by nurses that were derived from focus-group discussions and literature review.

SETTING
The community and 3 tertiary care hospitals.

PARTICIPANTS
Children aged 9-10 years, mothers, and nurses.

RESULTS
Responses from 754 nurses were analyzed using backward linear regression for handwashing intention. We reasoned that handwashing results in 2 distinct behavioral practices--inherent handwashing and elective handwashing--with our model explaining 64% and 76%, respectively, of the variance in behavioral intention. Translation of community handwashing behavior to healthcare settings is the predominant driver of all handwashing, both inherent (weighted beta =2.92) and elective (weighted beta =4.1). Intended elective in-hospital handwashing behavior is further significantly predicted by nurses' beliefs in the benefits of the activity (weighted beta =3.12), peer pressure of senior physicians (weighted beta =3.0) and administrators (weighted beta =2.2), and role modeling (weighted beta =3.0) but only to a minimal extent by reduction in effort (weighted beta =1.13). Inherent community behavior (weighted beta =2.92), attitudes (weighted beta =0.84), and peer behavior (weighted beta =1.08) were strongly predictive of inherent handwashing intent.

CONCLUSIONS
A small increase in handwashing adherence may be seen after implementing the use of alcoholic hand rubs, to decrease the effort required to wash hands. However, the facilitation of compliance is not simply related to effort but is highly dependent on altering behavioral perceptions. Thus, introduction of hand rub alone without an associated behavioral modification program is unlikely to induce a sustained increase in hand hygiene compliance.


Platelet-rich plasma vs hyaluronic acid to treat knee degenerative pathology: study design and preliminary results of a randomized controlled trial

BACKGROUND
Platelet rich plasma (PRP), a blood-derived product rich in growth factors, is a promising treatment for cartilage defects but there is still a lack of clinical evidence. The aim of this study is to show, through a randomized double blind prospective trial, the efficacy of this procedure, by comparing PRP to Hyaluronic Acid (HA) injections for the treatment of knee chondropathy or osteoarthritis (OA).

METHODS
109 patients (55 treated with HA and 54 with PRP) were treated and evaluated at 12 months of follow-up. The patients were enrolled according to the following inclusion criteria: age > 18 years, history of chronic (at least 4 months) pain or swelling of the knee and imaging findings of degenerative changes of the joint (Kellgren-Lawrence Score up to 3). A cycle of 3 weekly injections was administered blindly. All patients were prospectively evaluated before and at 2, 6, and 12 months after the treatment by: IKDC, EQ-VAS, TEGNER, and KOOS scores. Range of motion and knee circumference changes were measured over time. Adverse events and patient satisfaction were also recorded.

RESULTS
Only minor adverse events were detected in some patients, such as mild pain and effusion after the injections, in particular in the PRP group, where a significantly higher post-injective pain reaction was observed (p=0.039). At the follow-up evaluations, both groups presented a clinical improvement but the comparison between the two groups showed a not statistically significant difference in all scores evaluated. A trend favorable for the PRP group was only found in patients with low grade articular degeneration (Kellgren-Lawrence score up to 2).

CONCLUSIONS
Results suggest that PRP injections offer a significant clinical improvement up to one year of follow-up. However, conversely to what was shown by the current literature, for middle-aged patients with moderate signs of OA, PRP results were not better than those obtained with HA injections, and thus it should not be considered as first line treatment. More promising results are shown for its use in low grade degeneration, but they still have to be confirmed.


CamOdoCal: Automatic intrinsic and extrinsic calibration of a rig with multiple generic cameras and odometry

Multiple cameras are increasingly prevalent on robotic and human-driven vehicles. These cameras come in a variety of wide-angle, fish-eye, and catadioptric models. Furthermore, wheel odometry is generally available on the vehicles on which the cameras are mounted. For robustness, vision applications tend to use wheel odometry as a strong prior for camera pose estimation, and in these cases, an accurate extrinsic calibration is required in addition to an accurate intrinsic calibration. To date, there is no known work on automatic intrinsic calibration of generic cameras, and more importantly, automatic extrinsic calibration of a rig with multiple generic cameras and odometry. We propose an easy-to-use automated pipeline that handles both intrinsic and extrinsic calibration; we do not assume that there are overlapping fields of view. At the begining, we run an intrinsic calibration for each generic camera. The intrinsic calibration is automatic and requires a chessboard. Subsequently, we run an extrinsic calibration which finds all camera-odometry transforms. The extrinsic calibration is unsupervised, uses natural features, and only requires the vehicle to be driven around for a short time. The intrinsic parameters are optimized in a final bundle adjustment step in the extrinsic calibration. In addition, the pipeline produces a globally-consistent sparse map of landmarks which can be used for visual localization. The pipeline is publicly available as a standalone C++ package.


PSRR of bridge-tied load PWM Class D Amps

In this paper, the effects of power supply noise, qualified by power supply rejection ratio (PSRR), on two types of bridge-tied load (BTL) pulse width modulation (PWM) class D amps (denoted as Type-I BTL and Type-II BTL respectively) are investigated and the analytical expressions for PSRR of the two designs derived. The derived analytical expressions are verified by means of HSPICE simulations. The relationships derived herein provide good insight to the design of BTL class D amps, including how various parameters may be varied/optimized to meet a given PSRR specification. Furthermore, the PSRR of the two BTL Class D amps are compared against the single-ended class D amp, and the former designs show superior PSRR compared to the latter.


ARMageddon: Cache Attacks on Mobile Devices

In the last 10 years, cache attacks on Intel x86 CPUs have gained increasing attention among the scientific community and powerful techniques to exploit cache side channels have been developed. However, modern smartphones use one or more multi-core ARM CPUs that have a different cache organization and instruction set than Intel x86 CPUs. So far, no cross-core cache attacks have been demonstrated on non-rooted Android smartphones. In this work, we demonstrate how to solve key challenges to perform the most powerful cross-core cache attacks Prime+Probe, Flush+Reload, Evict+Reload, and Flush+Flush on non-rooted ARM-based devices without any privileges. Based on our techniques, we demonstrate covert channels that outperform state-of-the-art covert channels on Android by several orders of magnitude. Moreover, we present attacks to monitor tap and swipe events as well as keystrokes, and even derive the lengths of words entered on the touchscreen. Eventually, we are the first to attack cryptographic primitives implemented in Java. Our attacks work across CPUs and can even monitor cache activity in the ARM TrustZone from the normal world. The techniques we present can be used to attack hundreds of millions of Android devices.


Cache Template Attacks: Automating Attacks on Inclusive Last-Level Caches

Recent work on cache attacks has shown that CPU caches represent a powerful source of information leakage. However, existing attacks require manual identification of vulnerabilities, i.e., data accesses or instruction execution depending on secret information. In this paper, we present Cache Template Attacks. This generic attack technique allows us to profile and exploit cachebased information leakage of any program automatically, without prior knowledge of specific software versions or even specific system information. Cache Template Attacks can be executed online on a remote system without any prior offline computations or measurements. Cache Template Attacks consist of two phases. In the profiling phase, we determine dependencies between the processing of secret information, e.g., specific key inputs or private keys of cryptographic primitives, and specific cache accesses. In the exploitation phase, we derive the secret values based on observed cache accesses. We illustrate the power of the presented approach in several attacks, but also in a useful application for developers. Among the presented attacks is the application of Cache Template Attacks to infer keystrokes and—even more severe—the identification of specific keys on Linux and Windows user interfaces. More specifically, for lowercase only passwords, we can reduce the entropy per character from log2(26) = 4.7 to 1.4 bits on Linux systems. Furthermore, we perform an automated attack on the Ttable-based AES implementation of OpenSSL that is as efficient as state-of-the-art manual cache attacks.


TruSpy: Cache Side-Channel Information Leakage from the Secure World on ARM Devices

As smart, embedded devices are increasingly integrated into our daily life, the security of these devices has become a major concern. The ARM processor family, which powers more than 60% of embedded devices, introduced TrustZone technology to offer security protection via an isolated execution environment called secure world. Caches in TrustZone-enabled processors are extended with a nonsecure (NS) bit to indicate whether a cache line is used by the secure world or the normal world. This cache design improves system performance by eliminating the need to perform cache flush during world switches; however, it also enables cache contention between the two worlds. In this work, we present TruSpy, the first study of timingbased cache side-channel information leakage of TrustZone. Our proposed attack exploits the cache contention between normal world and secure world to recover secret information from secure world. Two attacks are proposed in TruSpy, namely, the normal world OS attack and the normal world Android app attack. In the OS-based attack, the attacker is able to access virtual-to-physical address translation and high precision timers. In the Android app-based attack, these tools are unavailable to the attacker, so we devise a novel method that uses the expected channel statistics to allocate memory for cache probing. We also show how an attacker might use the less accurate performance event interface as a timer. Using the T-table based AES implementation in OpenSSL 1.0.1f as an example, we demonstrate that it is possible for a normal world attacker to steal a fine-grained secret from the secure world using a timing-based cache side-channel. We can recover the full AES encryption key via either the OS-based attack or the Android app-based attack. Since our zero permission TruSpy attack is based on the cache design in TrustZone enabled ARM processors, it poses a significant threat to a wide array of devices. To mitigate the newly discovered threat, we also propose both application-based and system-oriented countermeasures.


Using GLCM and Gabor filters for classification of PAN images

In the present research we have used GLCM and Gabor filters to extract texture features in order to classify PAN images. The main drawback of GLCM algorithm is its time-consuming nature. In this work, we proposed a fast GLCM algorithm to overcome the mentioned weakness of traditional GLCM. The fast GLCM is capable of extracting approximately the same features as the traditional GLCM does, but in a really much less time (in the best case, 180 times faster, and in the worst case, 30 times faster). The other weakness of the traditional GLCM is its lower accuracies in the region near the class borders. As Gabor filters are more powerful in border regions, we have tried to combine Gabor features with GLCM features. In this way we would compensate the latter mentioned weakness of GLCM. Experimental results show good capabilities of the proposed fast GLCM and the feature fusion method in classification of PAN images.


Exploring knowledge sharing in ERP implementation: an organizational culture framework

This is a multi-site case study of firms that have implemented enterprise resource planning (ERP) systems. It examines eight dimensions of culture and their impact on how ERP implementation teams are able to effectively share knowledge across diverse functions and perspectives during ERP implementation. Through synthesizing the data, we develop a cultural configuration that shows the dimensions of culture that best facilitate knowledge sharing in ERP implementation. The results also indicate ways that firms may overcome cultural barriers to knowledge sharing. A model is developed that demonstrates the link between the dimensions of culture and knowledge sharing during ERP implementation. Possible research questions on which future research can be based are also identified. D 2004 Elsevier B.V. All rights reserved.


External Data Access And Indexing In AsterixDB

Traditional database systems offer rich query interfaces (SQL) and efficient query execution for data that they store. Recent years have seen the rise of Big Data analytics platforms offering query-based access to "raw" external data, e.g., file-resident data (often in HDFS). In this paper, we describe techniques to achieve the qualities offered by DBMSs when accessing external data. This work has been built into Apache AsterixDB, an open source Big Data Management System. We describe how we build distributed indexes over external data, partition external indexes, provide query consistency across access paths, and manage external indexes amidst concurrent activities. We compare the performance of this new AsterixDB capability to an external-only solution (Hive) and to its internally managed data and indexes.


Realtime FPGA-based processing unit for a high-resolution automotive MIMO radar platform

Next generations of high-resolution automotive radar sensors rely on powerful, real-time capable processing units. High sampling rates, large antenna arrays as well as hard real-time constraints require the use of both parallel architectures and high-bandwidth memory interfaces. This paper presents a novel architecture of a FPGA-based multiple-input multiple-output (MIMO) radar sensor processing unit. Sampling rates up to 250 MSPS and a maximum of 16 parallel receiving channels can be used, resulting in a maximum data rate of 56GBit/s. The processing chain consists of a flexible FIR filter, a range-Doppler processing unit using windowed FFTs and an ordered statistics constant-false-alarm-rate (OS-CFAR) unit for optimal target detection and data reduction. The realized target system is composed of a Virtex7-FPGA and a 1GByte SDRAM memory. The resource usage of the FPGA implementation is analyzed in order to provide estimations for future system designs. Finally, the resulting performance of the system is verified in connection with a prototype MIMO radar front-end. High-resolution measurements of moving scenes have been carried out to validate the correct operation of the system.


A tensor-based deep learning framework

This paper presents an unsupervised deep learning framework that derives spatio-temporal features for human-robot interaction. The respective models extract high-level features from low-level ones through a hierarchical network, viz. the Hierarchical Temporal Memory (HTM), providing at the same time a solution to the curse of dimensionality in shallow techniques. The presented work incorporates the tensor-based framework within the operation of the nodes and, thus, enhances the feature derivation procedure. This is due to the fact that tensors allow the preservation of the initial data format and their respective correlation and, moreover, attain more compact representations. The computational nodes form spatial and temporal groups by exploiting the multilinear algebra, subsequently express the samples according to those groups in terms of proximity. This generic framework may be applied in a diverse of visual data, whilst it has been examined on sequences of color and depth images, exhibiting remarkable performance.


On Resampling Algorithms for Particle Filters

In this paper a comparison is made between four frequently encountered resampling algorithms for particle filters. A theoretical framework is introduced to be able to understand and explain the differences between the resampling algorithms. This facilitates a comparison of the algorithms with respect to their resampling quality and computational complexity. Using extensive Monte Carlo simulations the theoretical results are verified. It is found that systematic resampling is favourable, both in terms of resampling quality and computational complexity.


Contributions from research on anger and cognitive dissonance to understanding the motivational functions of asymmetrical frontal brain activity

Research has suggested that approach-related positive emotions are associated with greater left frontal brain activity and that withdrawal-related negative emotions are associated with greater right frontal brain activity. Different explanations have been proposed. One posits that frontal asymmetry is due to emotional valence (positivity/negativity), one posits that frontal asymmetry is due to motivational direction (approach/withdrawal), and one posits that frontal asymmetry is due to a combination of emotional valence and motivational direction (positive-approach/negative-withdrawal). Because research had confounded emotional valence and motivational direction, the theoretical explanation was muddled. Solely supporting the motivational direction model, recent research has revealed that anger and cognitive dissonance, emotions with negative valence and approach motivational tendencies, are related to relatively greater left frontal activity.


Motives for using Facebook, patterns of Facebook activities, and late adolescents' social adjustment to college.

Previous studies have confirmed that Facebook, the leading social networking site among young people, facilitates social connections among college students, but the specific activities and motives that foster social adjustment remain unclear. This study examined associations between patterns of Facebook activity, motives for using Facebook, and late adolescents' social adjustment to the college environment. Anonymous self-report survey data from 193 mostly European American students (M age = 20.32; 54 % female) attending a major Midwestern university indicated that motives and activity patterns were associated directly with social adjustment, but the association between one activity, status updating, and social adjustment also was moderated by the motive of relationship maintenance. Findings provide a more comprehensive portrait of how Facebook use may foster or inhibit social adjustment in college.


The eyeBook – Using Eye Tracking to Enhance the Reading Experience

Introduction A rapid development of eye tracking technology has been observed in recent years. Today’s eye trackers can determine the current focus point of the eye precisely while being relatively unobtrusive in their application. Also, a variety of research and commercial groups has been working on this technology, and there is a growing interest for such devices on the market. Eye tracking has great potential and it can be assumed that it will advance further and might become a widespread technology used at a large number of personal or office computer workplaces. Approaches using simple webcams for eye tracking already exist, for example webcams integrated into laptop computers by default. Thus, they allow for new kinds of applications using eye gaze data. However, not only eye tracking technology is advancing rapidly to an easily usable state. Additionally, during the past 100 years researchers gathered a considerable amount of knowledge on eye movements, why and how they occur, and what they might mean. So, today, we have the technology and knowledge for tracking and analyzing eye movements, making an excellent starting point for sophisticated interactive gaze-based applications. Naive approaches where gaze data is directly employed for interacting with the system, e. g., pressing buttons on the screen with the “blink of an eye” generally have serious problems. Because the eyes are organs used for perceiving the world and not for manipulating the world, it is hard and against human nature to control eye movements deliberately. However, a highly promising approach is just to observe eye movements of the user during his or her daily work in front of the computer, to infer user intentions based on eye movement behavior, and to provide assistance where helpful. Gaze can be seen as a proxy for the user’s attention, and eye movements are known to be usually tightly coupled with cognitive processes in the brain, so that a great deal about those processes can be observed by eye tracking. For example, by interpreting eye movements, reading behavior of the user can be detected, which most likely entails cognitive processes of understanding with regard to the currently read text. In this paper we are focusing particularly on reading behavior since reading is probably the most common activity of knowledge workers sitting in front of a computer screen. We present an algorithm for online reading detection based on eye tracking data and introduce an application for assisted and augmented reading called the eyeBook. The idea behind the eyeBook is to create an interactive and entertaining reading experience. The system observes, which text parts are currently being read by the user on the screen and generates appropriate effects such as playing sounds, presenting