title: Mapping the antigenic and genetic evolution of influenza virus.

text: The antigenic evolution of influenza A (H3N2) virus was quantified and visualized from its introduction into humans in 1968 to 2003. Although there was remarkable correspondence between antigenic and genetic evolution, significant differences were observed: Antigenic evolution was more punctuated than genetic evolution, and genetic change sometimes had a disproportionately large antigenic effect. The method readily allows monitoring of antigenic differences among vaccine and circulating strains and thus estimation of the effects of vaccination. Further, this approach offers a route to predicting the relative success of emerging strains, which could be achieved by quantifying the combined effects of population level immune escape and viral fitness on strain evolution.


title: Color image processing [basics and special issue overview]

text: umans have always seen the world in color but only recently have we been able to generate vast quantities of color images with such ease. In the last three decades, we have seen a rapid and enormous transition from grayscale images to color ones. Today, we are exposed to color images on a daily basis in print, photographs, television, computer displays, and cinema movies, where color now plays a vital role in the advertising and dissemination of information throughout the world. Color monitors, printers, and copiers now dominate the office and home environments, with color becoming increasingly cheaper and easier to generate and reproduce. Color demands have soared in the marketplace and are projected to do so for years to come. With this rapid progression, color and multispectral properties of images are becoming increasingly crucial to the field of image processing, often extending and/or replacing previously known grayscale techniques. We have seen the birth of color algorithms that range from direct extensions of grayscale ones, where images are treated as three monochrome separations, to more sophisticated approaches that exploit the correlations among the color bands, yielding more accurate results. Hence, it is becoming increasingly necessary for the signal processing community to understand the fundamental differences between color and grayscale imaging. There are more than a few extensions of concepts


title: Relational active learning for link-based classification

text: Many information tasks involve objects that are explicitly or implicitly connected in a network (or graph), such as webpages connected by hyperlinks or people linked by “friendships” in a social network. Research on link-based classification (LBC) has shown how to leverage these connections to improve classification accuracy. Unfortunately, acquiring a sufficient number of labeled examples to enable accurate learning for LBC can often be expensive or impractical. In response, some recent work has proposed the use of active learning, where the LBC method can intelligently select a limited set of additional labels to acquire, so as to reduce the overall cost of learning a model with sufficient accuracy. This work, however, has produced conflicting results and has not considered recent progress for LBC inference and semi-supervised learning. In this paper, we evaluate multiple prior methods for active learning and demonstrate that none consistently improve upon random guessing. We then introduce two new methods that both seek to improve active learning by leveraging the link structure to identify nodes to acquire that are more representative of the underlying data. We show that both approaches have some merit, but that one method, by proactively acquiring nodes so as to produce a more representative distribution of known labels, often leads to significant accuracy increases with minimal computational cost.


title: MRJS : A JavaScript MapReduce Framework for Web Browsers

text: This paper describes MRJS, a JavaScript based MapReduce framework. MRJS runs on the open internet over HTTP rather than in a data center. Instead of using clusters of machines for processing power, it relies on volunteer clients in the form of JavaScript engines in web browsers. Users can specify, execute, and fetch data for arbitrary MapReduce jobs with HTTP requests. Our centralized job server acts as a coordinator. We have implemented MRJS and results show that it performs well for certain types of MapReduce computations.


title: Privacy-preserving personal health record using multi-authority attribute-based encryption with revocation

text: Personal health record (PHR) service is an emerging model for health information exchange. In PHR systems, patient’s health records and information are maintained by the patient himself through the Web. In reality, PHRs are often outsourced to be stored at the third parties like cloud service providers. However, there have been serious privacy concerns about cloud service as it may expose user’s sensitive data like PHRs to those cloud service providers or unauthorized users. Using attribute-based encryption (ABE) to encrypt patient’s PHRs in cloud environment, secure and flexible access control can be achieved. Yet, problems like scalability in key management, fine-grained access control, and efficient user revocation remain to be addressed. In this paper, we propose a privacy-preserving PHR, which supports fine-grained access control and efficient revocation. To be specific, our scheme achieves the goals (1) scalable and fine-grained access control for PHRs by using multi-authority ABE scheme, and (2) efficient on-demand user/attribute revocation and dynamic policy update. In our scheme, we consider the situation that multiple data owners exist, and patient’s PHRs are encrypted and stored in semi-trust servers. The access structure in our scheme is expressive access tree structure, and the security of our scheme can be reduced to the standard decisional bilinear Diffie–Hellman assumption.


title: Identity-based encryption with efficient revocation

text: Identity-based encryption (IBE) is an exciting alternative to public-key encryption, as IBE eliminates the need for a Public Key Infrastructure (PKI). The senders using an IBE do not need to look up the public keys and the corresponding certificates of the receivers, the identities (e.g. emails or IP addresses) of the latter are sufficient to encrypt. Any setting, PKI- or identity-based, must provide a means to revoke users from the system. Efficient revocation is a well-studied problem in the traditional PKI setting. However in the setting of IBE, there has been little work on studying the revocation mechanisms. The most practical solution requires the senders to also use time periods when encrypting, and all the receivers (regardless of whether their keys have been compromised or not) to update their private keys regularly by contacting the trusted authority. We note that this solution does not scale well -- as the number of users increases, the work on key updates becomes a bottleneck. We propose an IBE scheme that significantly improves key-update efficiency on the side of the trusted party (from linear to logarithmic in the number of users), while staying efficient for the users. Our scheme builds on the ideas of the Fuzzy IBE primitive and binary tree data structure, and is provably secure.


title: Using Markov decision process in cognitive radio networks towards the optimal reward

text:
The Learning is an indispensable phase in the cognition cycle of cognitive radio network. It corresponds between the executed actions and the estimated rewards. Based on this phase, the agent learns from past experiences to improve his actions in the next interventions. In the literature, there are several methods that treat the artificial learning. Among them, we cite the reinforcement learning that look for the optimal policy, for ensuring the maximum reward.
 The present work exposes an approach, based on a model of reinforcement learning, namely Markov decision process, to maximize the sum of transfer rates of all secondary users. Such conception defines all notions relative to an environment with finite set of states, including: the agent, all states, the allowed actions with a given state, the obtained reward after the execution of an action and the optimal policy. After the implementation, we remark a correlation between the started policy and the optimal policy, and we improve the performances by referring to a previous work.


title: High Performance Transactions via Early Write Visibility

text: In order to guarantee recoverable transaction execution, database systems permit a transaction’s writes to be observable only at the end of its execution. As a consequence, there is generally a delay between the time a transaction performs a write and the time later transactions are permitted to read it. This delayed write visibility can significantly impact the performance of serializable database systems by reducing concurrency among conflicting transactions. This paper makes the observation that delayed write visibility stems from the fact that database systems can arbitrarily abort transactions at any point during their execution. Accordingly, we make the case for database systems which only abort transactions under a restricted set of conditions, thereby enabling a new recoverability mechanism, early write visibility, which safely makes transactions’ writes visible prior to the end of their execution. We design a new serializable concurrency control protocol, piece-wise visibility (PWV), with the explicit goal of enabling early write visibility. We evaluate PWV against state-of-the-art serializable protocols and a highly optimized implementation of read committed, and find that PWV can outperform serializable protocols by an order of magnitude and read committed by 3X on high contention workloads.


title: A Genetic NewGreedy Algorithm for Influence Maximization in Social Network

text: A user may be influenced by the other users of a social network by sharing information. Influence maximization is one of the critical research topics aimed at knowing the current circumstances of a social network, such as the general mood of the society. The goal of this problem is to find a seed set which has a maximum influence with respect to a propagation model. For the influence maximization problem is NP-Hard, it is obvious that an exhausted search algorithm is not able to find the solution in a reasonable time. It is also obvious that a greedy algorithm may not find a solution that satisfies all the requirements. Hence, a high-performance algorithm for solving the influence maximization problem, which leverages the strength of the greedy method and the genetic algorithm (GA) is presented in this paper. Experimental results show that the proposed algorithm can provide a better result than simple GA by about 10% in terms of the quality.


title: Hyperdimensional biosignal processing: A case study for EMG-based hand gesture recognition

text: The mathematical properties of high-dimensional spaces seem remarkably suited for describing behaviors produces by brains. Brain-inspired hyperdimensional computing (HDC) explores the emulation of cognition by computing with hypervectors as an alternative to computing with numbers. Hypervectors are high-dimensional, holographic, and (pseudo)random with independent and identically distributed (i.i.d.) components. These features provide an opportunity for energy-efficient computing applied to cyberbiological and cybernetic systems. We describe the use of HDC in a smart prosthetic application, namely hand gesture recognition from a stream of Electromyography (EMG) signals. Our algorithm encodes a stream of analog EMG signals that are simultaneously generated from four channels to a single hypervector. The proposed encoding effectively captures spatial and temporal relations across and within the channels to represent a gesture. This HDC encoder achieves a high level of classification accuracy (97.8%) with only 1/3 the training data required by state-of-the-art SVM on the same task. HDC exhibits fast and accurate learning explicitly allowing online and continuous learning. We further enhance the encoder to adaptively mitigate the effect of gesture-timing uncertainties across different subjects endogenously; further, the encoder inherently maintains the same accuracy when there is up to 30% overlapping between two consecutive gestures in a classification window.


title: Ambulance redeployment: An approximate dynamic programming approach

text: Emergency medical service (EMS) providers are charged with the task of managing ambulances so that the time required to respond to emergency calls is minimized. One approach that may assist in reducing response times is ambulance redeployment, i.e., repositioning idle ambulances in real time. We formulate a simulation model of EMS operations to evaluate the performance of a given allocation policy and use this model in an approximate dynamic programming (ADP) context to compute high-quality redeployment policies. We find that the resulting ADP policies perform much better than sub-optimal static policies and marginally better than near-optimal static policies. Representative computational results for Edmonton, Alberta are included.


title: Design of household appliances for a Dc-based nanogrid system: An induction heating cooktop study case

text: Efficient energy management is becoming an important issue when designing any electrical system. Recently, a significant effort has been devoted to the design of optimized micro and nanogrids comprising residential area subsystems. One of these approaches consists on the design of a dc-based nanogrid optimized for the interoperation of electric loads, sources, and storage elements. Home appliances are one of the main loads in such dc-based nanogrids. In this paper, the design and optimization of an appliance for operation in a dc-based nanogrid is detailed. An induction heating cooktop appliance will be considered as a reference example, being some of the design considerations generalizable to other appliances. The main design aspects, including the inductor system, power converter, EMC filter, and control are considered. Finally, some simulation results of the expected converter performance are shown.


title: PCS/W-CDMA dual-band MMIC power amplifier with a newly proposed linearizing bias circuit

text: A personal communications service/wide-band code division multiple access (PCS/W-CDMA) dual-band monolithic microwave integrated circuit (MMIC) power amplifier with a single-chip MMIC and a single-path output matching network is demonstrated by adopting a newly proposed on-chip linearizer. The linearizer is composed of the base–emitter diode of an active bias transistor and a capacitor to provide an RF short at the base node of the active bias transistor. The linearizer enhances the linearity of the power amplifier effectively for both PCS and W-CDMA bands with no additional dc power consumption, and has negligible insertion power loss with almost no increase in die area. It improves the input 1-dB gain compression point by 18.5 (20) dB and phase distortion by 6.1 (12.42 ) at an output power of 28 (28) dBm for the PCS (W-CDMA) band while keeping the base bias voltage of the power amplifier as designed. A PCS and W-CDMA dual-band InGaP heterojunction bipolar transistor MMIC power amplifier with single input and output and no switch for band selection is embodied by implementing the linearizer and by designing the amplifier to have broad-band characteristics. The dual-band power amplifier exhibits an output power of 30 (28.5) dBm, power-added efficiency of 39.5% (36%), and adjacent channel power ratio of 46 ( 50) dBc at the output power of 28 (28) dBm under 3.4-V operation voltage for PCS (W-CDMA) applications.


title: Punica granatum (pomegranate) and its potential for prevention and treatment of inflammation and cancer.

text: The last 7 years have seen over seven times as many publications indexed by Medline dealing with pomegranate and Punica granatum than in all the years preceding them. Because of this, and the virtual explosion of interest in pomegranate as a medicinal and nutritional product that has followed, this review is accordingly launched. The pomegranate tree, Punica granatum, especially its fruit, possesses a vast ethnomedical history and represents a phytochemical reservoir of heuristic medicinal value. The tree/fruit can be divided into several anatomical compartments: (1) seed, (2) juice, (3) peel, (4) leaf, (5) flower, (6) bark, and (7) roots, each of which has interesting pharmacologic activity. Juice and peels, for example, possess potent antioxidant properties, while juice, peel and oil are all weakly estrogenic and heuristically of interest for the treatment of menopausal symptoms and sequellae. The use of juice, peel and oil have also been shown to possess anticancer activities, including interference with tumor cell proliferation, cell cycle, invasion and angiogenesis. These may be associated with plant based anti-inflammatory effects, The phytochemistry and pharmacological actions of all Punica granatum components suggest a wide range of clinical applications for the treatment and prevention of cancer, as well as other diseases where chronic inflammation is believed to play an essential etiologic role.


title: Transfer learning using computational intelligence: A survey

text: 26 27 28 29 30 31 32 33 34 35 36 37 38 Article history: Received 3 December 2014 Received in revised form 7 January 2015 Accepted 17 January 2015 Available online xxxx


title: The development of a new test of agility for rugby league.

text: Agility requires change of direction speed (CODS) and also perceptual and decision-making skills and reaction speed. The purpose of this study was to develop a reliable and valid agility test for rugby league, which stressed all those dimensions. Players from a subelite rugby league team were tested twice on a sport-specific reactive agility test (RAT) and CODS test. Data were analyzed for reliability. For validity results from the subelite groups, first test was compared with data from an elite group. The RAT required participants to run toward an unpredictable life-size video of an attacking opponent and react to that video by changing direction. The CODS test required the same movement patterns however direction changes were preplanned. The subelite group's mean time to complete the CODS test and RAT on their first test was 1.67 ± 0.15 and 1.98 ± 0.16 seconds, respectively, and 1.62 ± 0.14 and 1.91 ± 0.17 seconds, respectively, on their second test (results are ± σ). Statistical analyses revealed no significant difference in means (p < 0.05) and good correlation (intraclass correlation coefficient = 0.87 and 0.82, respectively). The elite group's mean time to complete the tests was 1.65 ± 0.09 and 1.79 ±0.12 seconds, respectively. Statistical analyses revealed a significant difference in mean RAT time between the elite group and the subelite group (p < 0.05). The RAT was reliable and valid. Performance differences on the RAT were attributed to differences in perceptual skills and/or reaction ability. Testing and training agility should therefore stress those dimensions of agility and not just CODS.


title: Diabetes Prediction by using Bacterial Foraging Optimization Algorithm And Artificial Neural Network

text: Diagnosis of any diseases earlier is always preferable .diabetes is one such diseases.it reaches to the epidemic proportional in many developing countries and also reaching to industrialized nations. In this study, we investigate a programmable method to analyze diabetes diseases based on BFO and ANN.ANN is a powerful tool and solves the problems such as classification and prediction. Its performance is highly dependent on its architecture and weights. To gain high efficiency in ANN, an appropriate Architecture and learning Algorithm is preferable. The experiments on dataset occupied from undertaking repository to verify the potential of BFO algorithm and showed that BFO-ANN is more accurate than traditional ANN in terms of classification. General Terms-Artificial Neural Network, BacterialForaging Optimization Algorithm.


title: Cross-Domain Ranking via Latent Space Learning

text: We study the problem of cross-domain ranking, which addresses learning to rank objects from multiple interrelated domains. In many applications, we may have multiple interrelated domains, some of them with a large amount of training data and others with very little. We often wish to utilize the training data from all these related domains to help improve ranking performance. In this paper, we present a unified model: BayCDR for cross-domain ranking. BayCDR uses a latent space to measure the correlation between different domains, and learns the ranking functions from the interrelated domains via the latent space by a Bayesian model, where each ranking function is based on a weighted average model. An efficient learning algorithm based on variational inference and a generalization bound has been developed. To scale up to handle real large data, we also present a learning algorithm under the Map-Reduce programming model. Finally, we demonstrate the effectiveness and efficiency of BayCDR on large datasets.


title: Mitigation of Continuous and Pulsed Radio Interference with GNSS Antenna Arrays

text: Dr. Andriy Konovaltsev received his engineer diploma and the Ph.D. degree in electrical engineering from Kharkov State Technical University of Radio Electronics, Ukraine in 1993 and 1996, correspondingly. He joined the Institute of Communications and Navigation of DLR in 2001. His research interests are in array processing for satellite navigation systems, signal processing algorithms for navigation receivers including synchronisation, multipath and radio interference mitigation.


title: Facial Expression Recognition in Older Adults using Deep Machine Learning

text: Facial Expression Recognition is still one of the challenging fields in pattern recognition and machine learning science. Despite efforts made in developing various methods for this topic, existing approaches lack generalizability and almost all studies focus on more traditional hand-crafted features extraction to characterize facial expressions. Moreover, effective classifiers to model the spatial and temporary patterns embedded in facial expressions ignore the effects of facial attributes, such as age, on expression recognition even though research indicates that facial expression manifestation varies with ages. Although there are large amount of benchmark datasets available for the recognition of facial expressions, only few datasets contains faces of older adults. Consequently the current scientific literature has not exhausted this topic. Recently, deep learning methods have been attracting more and more researchers due to their great success in various computer vision tasks, mainly because they avoid a process of feature definition and extraction which is often very difficult due to the wide variability of the facial expressions. Based on the deep learning theory, a neural network for facial expression recognition in older adults is constructed by combining a Stacked Denoising Auto-Encoder method to pre-train the network and a supervised training that provides a fine-tuning adjustment of the network. For the supervised classification layer, the -class softmax classifier was implemented, where is the number of expressions to be recognized. The performance are evaluated on two benchmark datasets (FACES and Lifespan), that are the only ones that contain facial expressions of the elderly. The achieved results show the superiority of the proposed deep learning approach compared to the conventional non-deep learning based facial expression recognition methods used in this context.


title: Wasserstein Propagation for Semi-Supervised Learning

text: Probability distributions and histograms are natural representations for product ratings, traffic measurements, and other data considered in many machine learning applications. Thus, this paper introduces a technique for graph-based semisupervised learning of histograms, derived from the theory of optimal transportation. Our method has several properties making it suitable for this application; in particular, its behavior can be characterized by the moments and shapes of the histograms at the labeled nodes. In addition, it can be used for histograms on non-standard domains like circles, revealing a strategy for manifold-valued semi-supervised learning. We also extend this technique to related problems such as smoothing distributions on graph nodes.


title: Cuckoo search algorithm and wind driven optimization based study of satellite image segmentation for multilevel thresholding using Kapur's entropy

text: The objective of image segmentation is to extract meaningful objects. A meaningful segmentation selects the proper threshold values to optimize a criterion using entropy. The conventional multilevel thresholding methods are efficient for bi-level thresholding. However, they are computationally expensive when extended to multilevel thresholding since they exhaustively search the optimal thresholds to optimize the objective functions. To overcome this problem, two successful swarm-intelligence-based global optimization algorithms, cuckoo search (CS) algorithm and wind driven optimization (WDO) for multilevel thresholding using Kapur’s entropy has been employed. For this purpose, best solution as fitness function is achieved through CS and WDO algorithm using Kapur’s entropy for optimal multilevel thresholding. A new approach of CS andWDO algorithm is used for selection of optimal threshold value. This algorithm is used to obtain the best solution or best fitness value from the initial random threshold values, and to evaluate the quality of a solution, correlation function is used. Experimental results have been examined on standard set of satellite images using various numbers of thresholds. The results based on Kapur’s entropy reveal that CS, ELR-CS and WDO method can be accurately and efficiently used in multilevel thresholding problem. 2013 Elsevier Ltd. All rights reserved.


title: Improved Relation Extraction with Feature-Rich Compositional Embedding Models

text: Compositional embedding models build a representation (or embedding) for a linguistic structure based on its component word embeddings. We propose a Feature-rich Compositional Embedding Model (FCM) for relation extraction that is expressive, generalizes to new domains, and is easy-to-implement. The key idea is to combine both (unlexicalized) handcrafted features with learned word embeddings. The model is able to directly tackle the difficulties met by traditional compositional embeddings models, such as handling arbitrary types of sentence annotations and utilizing global information for composition. We test the proposed model on two relation extraction tasks, and demonstrate that our model outperforms both previous compositional models and traditional feature rich models on the ACE 2005 relation extraction task, and the SemEval 2010 relation classification task. The combination of our model and a loglinear classifier with hand-crafted features gives state-of-the-art results. We made our implementation available for general use1.


title: Exploring Semantic Properties of Sentence Embeddings

text: Neural vector representations are ubiquitous throughout all subfields of NLP. While word vectors have been studied in much detail, thus far only little light has been shed on the properties of sentence embeddings. In this paper, we assess to what extent prominent sentence embedding methods exhibit select semantic properties. We propose a framework that generate triplets of sentences to explore how changes in the syntactic structure or semantics of a given sentence affect the similarities obtained between their sentence embeddings.


title: High Gain Wide-Band U-Shaped Patch Antennas With Modified Ground Planes

text: A high gain wideband U-shaped patch antenna with two equal arms on poly tetra fluoro ethylene (PTFE) substrate is presented. An inverted U-shaped slot is introduced on the circular or square shaped ground plane just under the U-shaped patch. In this communication the effect of size and shape of the ground plane on impedance bandwidth is studied. Maximum impedance bandwidth of 86.79% (4.5–11.4 GHz) is obtained with circular shaped ground plane with diameter 36 mm. The highest gain achieved is 4.1 dBi. The simulated results are confirmed experimentally. The proposed antenna is simple in structure compared to the regular stacked or coplanar parasitic patch antennas. It is highly suitable for wireless communications.


title: Influence and correlation in social networks

text:
In many online social systems, social ties between users play an important role in dictating their behavior. One of the ways this can happen is through social influence, the phenomenon that the actions of a user can induce his/her friends to behave in a similar way. In systems where social influence exists, ideas, modes of behavior, or new technologies can diffuse through the network like an epidemic. Therefore, identifying and understanding social influence is of tremendous interest from both analysis and design points of view.
 This is a difficult task in general, since there are factors such as homophily or unobserved confounding variables that can induce statistical correlation between the actions of friends in a social network. Distinguishing influence from these is essentially the problem of distinguishing correlation from causality, a notoriously hard statistical problem.
 In this paper we study this problem systematically. We define fairly general models that replicate the aforementioned sources of social correlation. We then propose two simple tests that can identify influence as a source of social correlation when the time series of user actions is available.
 We give a theoretical justification of one of the tests by proving that with high probability it succeeds in ruling out influence in a rather general model of social correlation. We also simulate our tests on a number of examples designed by randomly generating actions of nodes on a real social network (from Flickr) according to one of several models. Simulation results confirm that our test performs well on these data. Finally, we apply them to real tagging data on Flickr, exhibiting that while there is significant social correlation in tagging behavior on this system, this correlation cannot be attributed to social influence.


title: Simulation on Simulink AC4 model (200hp DTC induction motor drive) using Fuzzy Logic controller

text: Classical direct torque control (DTC) has advantage in absence of coordinate transform and voltage modulator block. However, it may have disadvantage in controlling electromagnetic torque. DTC produces high ripple in electromagnetic torque as it is not directly controlled. High torque ripple causes vibrations to the motor which may lead to component lose, bearing failure or resonance. Thus, Fuzzy Logic controller is applied to reduce electromagnetic torque ripple. This paper presents the simulation analysis of Fuzzy Logic Direct Torque Controller (FLDTC) of induction machine drives. However, only the design of the controller using built in DTC induction motor drive model of Simulink AC4 will be discussed in this paper. Using FLDTC, the resulting electromagnetic torque from produced less ripple than classical DTC.


title: Camera calibration with spheres: linear approaches

text: This paper addresses the problem of camera calibration from spheres. By studying the relationship between the dual images of spheres and that of the absolute conic, a linear solution has been derived from a recently proposed non-linear semi-definite approach. However, experiments show that this approach is quite sensitive to noise. In order to overcome this problem, a second approach has been proposed, where the orthogonal calibration relationship is obtained by regarding any two spheres as a surface of revolution. This allows a camera to be fully calibrated from an image of three spheres. Besides, a conic homography is derived from the imaged spheres, and from its eigenvectors the orthogonal invariants can be computed directly. Experiments on synthetic and real data show the practicality of such an approach.


title: Smart music player integrating facial emotion recognition and music mood recommendation

text: Songs, as a medium of expression, have always been a popular choice to depict and understand human emotions. Reliable emotion based classification systems can go a long way in helping us parse their meaning. However, research in the field of emotion-based music classification has not yielded optimal results. In this paper, we present an affective cross-platform music player, EMP, which recommends music based on the real-time mood of the user. EMP provides smart mood based music recommendation by incorporating the capabilities of emotion context reasoning within our adaptive music recommendation system. Our music player contains three modules: Emotion Module, Music Classification Module and Recommendation Module. The Emotion Module takes an image of the user's face as an input and makes use of deep learning algorithms to identify their mood with an accuracy of 90.23%. The Music Classification Module makes use of audio features to achieve a remarkable result of 97.69% while classifying songs into 4 different mood classes. The Recommendation Module suggests songs to the user by mapping their emotions to the mood type of the song, taking into consideration the preferences of the user.


title: Jubatus : An Open Source Platform for Distributed Online Machine Learning

text: Distributed computing is essential for handling very large datasets. Online learning is also promising for learning from rapid data streams. However, it is still an unresolved problem how to combine them for scalable learning and prediction on big data streams. We propose a general computational framework called loose model sharing for online and distributed machine learning. The key is to share only models rather than data between distributed servers. We also introduce Jubatus, an open source software platform based on the framework. Finally, we describe the details of implementing classifier and nearest neighbor algorithms, and discuss our experimental evaluations.


title: Reinforcement Learning Testbed for Power-Consumption Optimization

text: Common approaches to control a data-center cooling system rely on approximated system/environment models that are built upon the knowledge of mechanical cooling and electrical and thermal management. These models are difficult to design and often lead to suboptimal or unstable performance. In this paper, we show how deep reinforcement learning techniques can be used to control the cooling system of a simulated data center. In contrast to common control algorithms, those based on reinforcement learning techniques can optimize a system’s performance automatically without the need of explicit model knowledge. Instead, only a reward signal needs to be designed. We evaluated the proposed algorithm on the open source simulation platform EnergyPlus. The experimental results indicate that we can achieve 22% improvement compared to a model-based control algorithm built into the EnergyPlus. To encourage the reproduction of our work as well as future research, we have also publicly released an open-source EnergyPlus wrapper interface 1 directly compatible with existing reinforcement learning frameworks.


Drawing on social network theories and previous studies, this research examines the dynamics of social network structures in open source software (OSS) teams. Three projects were selected from SourceForge.net in terms of their similarities as well as their differences. Monthly data were extracted from the bug tracking systems in order to achieve a longitudinal view of the interaction pattern of each project. Social network analysis was used to generate the indices of social structure. The finding suggests that the interaction pattern of OSS projects evolves from a single hub at the beginning to a core/periphery model as the projects move forward. INtrODUctION The information system development arena has seen many revolutions and evolutions. We have witnessed the movement from structured development to object-oriented (OO) development. Modeling methods, such as data flow diagram and entity relationship diagram, are facing new OO modeling languages, such as the unified modeling language (UML) (see Siau & Cao, 2001; Siau, Erickson, & Lee, 2005; Siau & Loo, 2006) and OO methodologies, such as unified process (UP). The latest development includes agile modeling (see Erickson, Lyytinen, & Siau, 2005), extreme programming, and OSS development. While many of these changes are related to systems development paradigms, methodologies, methods, and techniques, the phenomenon of OSS development entails a different structure for software development teams. Chapter 2.17 Social Network Structures in Open Source Software Development Teams Yuan Long Colorado State University-Pueblo, USA Keng Siau University of Nebraska-Lincoln, USA Copyright © 2009, IGI Global, distributing in print or electronic forms without written permission of IGI Global is prohibited. 646 Social Network Structures in Open Source Software Development Teams Unlike conventional software projects, the participants of OSS projects are volunteers. They are self-selected based on their interests and capability to contribute to the projects (Raymond, 2000). In addition, the developers of OSS projects are distributed all around the world. They communicate and collaborate with each other through the Internet, using e-mails or discussion boards. Therefore, effective and efficient communication and collaboration are critical to OSS success. However, little empirical research has been conducted to study the underlying interaction pattern of OSS teams, especially the dynamics of the social network structures in OSS development teams. To fill this gap, this study examines the evolvement of social structure in OSS teams. The study contributes to the enhancement of the understanding of OSS development, and provides foundation for future studies to analyze the antecedents and consequences of social networks in the OSS context. The remainder of the paper is structured as follows. First, prior studies on social network structures in OSS teams are reviewed. Second, theories related to social structure and social network theory are discussed. Third, the research methodology is presented, and the research results are reported. Next, discussions of the results, the limitations, and the implications are provided. The paper concludes with suggestions for future research.


title: Mermaid: Integrating Vertex-Centric with Edge-Centric for Real-World Graph Processing

text: There has been increasing interests in processing large-scale real-world graphs, and recently many graph systems have been proposed. Vertex-centric GAS (Gather-Apply-Scatter) and Edge-centric GAS are two graph computation models being widely adopted, and existing graph analytics systems commonly follow only one computation model, which is not the best choice for real-world graph processing. In fact, vertex degrees in real-world graphs often obey skewed power-law distributions: most vertices have relatively few neighbors while a few have many neighbors. We observe that vertex-centric GAS for high-degree vertices and edge-centric GAS for low-degree vertices is a much better choice for real-world graph processing. In this paper, we present Mermaid, a system for processing large-scale real-world graphs on a single machine. Mermaid skillfully integrates vertex-centric GAS with edge-centric GAS through a novel vertex-mapping mechanism, and supports streamlined graph processing. On a total of 6 practical natural graph processing tasks, we demonstrate that, on average, Mermaid achieves 1.83x better performance than the state-of-the-art graph system on a single machine.


title: Bayesian Optimization Algorithm

text: In this paper an algorithm based on the concepts of genetic algorithms that uses an estimation of a probability distribution of promising solutions in order to generate new candidate solutions is proposed To esti mate the distribution techniques for model ing multivariate data by Bayesian networks are used The proposed algorithm identi es reproduces and mixes building blocks up to a speci ed order It is independent of the ordering of the variables in the strings rep resenting the solutions Moreover prior in formation about the problem can be incor porated into the algorithm However prior information is not essential Preliminary ex periments show that the BOA outperforms the simple genetic algorithm even on decom posable functions with tight building blocks as a problem size grows


title: Space-Efficient Online Computation of Quantile Summaries

text:
An ∈-approximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of ∈N.
We present a new online algorithm for computing∈-approximate quantile summaries of very large data sequences. The algorithm has a worst-case space requirement of &Ogr;(1÷∈ log(∈N)). This improves upon the previous best result of &Ogr;(1÷∈ log2(∈N)). Moreover, in contrast to earlier deterministic algorithms, our algorithm does not require a priori knowledge of the length of the input sequence.
Finally, the actual space bounds obtained on experimental data are significantly better than the worst case guarantees of our algorithm as well as the observed space requirements of earlier algorithms.


title: Load Disaggregation Based on Aided Linear Integer Programming

text: Load disaggregation based on aided linear integer programming (ALIP) is proposed. We start with a conventional linear integer programming (IP)-based disaggregation and enhance it in several ways. The enhancements include additional constraints, correction based on a state diagram, median filtering, and linear-programming-based refinement. With the aid of these enhancements, the performance of IP-based disaggregation is significantly improved. The proposed ALIP system relies only on the instantaneous load samples instead of waveform signatures and, hence, works well on low-frequency data. Experimental results show that the proposed ALIP system performs better than conventional IP-based load disaggregation.


title: Information flow and cooperative control of vehicle formations

text: We consider the problem of cooperation among a collection of vehicles performing a shared task using intervehicle communication to coordinate their actions. Tools from algebraic graph theory prove useful in modeling the communication network and relating its topology to formation stability. We prove a Nyquist criterion that uses the eigenvalues of the graph Laplacian matrix to determine the effect of the communication topology on formation stability. We also propose a method for decentralized information exchange between vehicles. This approach realizes a dynamical system that supplies each vehicle with a common reference to be used for cooperative motion. We prove a separation principle that decomposes formation stability into two components: Stability of this is achieved information flow for the given graph and stability of an individual vehicle for the given controller. The information flow can thus be rendered highly robust to changes in the graph, enabling tight formation control despite limitations in intervehicle communication capability.


title: Enhanced Visibility of MoS 2 , MoSe 2 , WSe 2 and Black-Phosphorus : Making Optical Identification of 2 D Semiconductors Easier

text: We explore the use of Si3N4/Si substrates as a substitute of the standard SiO2/Si substrates employed nowadays to fabricate nanodevices based on 2D materials. We systematically study the visibility of several 2D semiconducting materials that are attracting a great deal of interest in nanoelectronics and optoelectronics: MoS2, MoSe2, WSe2 and black-phosphorus. We find that the use of Si3N4/Si substrates provides an increase of the optical contrast up to a 50%–100% and also the maximum contrast shifts towards wavelength values optimal for human eye detection, making optical identification of 2D semiconductors easier. OPEN ACCESS Electronics 2015, 4 848


title: Scaling Similarity Joins over Tree-Structured Data

text: Given a large collection of tree-structured objects (e.g., XML documents), the similarity join finds the pairs of objects that are similar to each other, based on a similarity threshold and a tree edit distance measure. The state-ofthe-art similarity join methods compare simpler approximations of the objects (e.g., strings), in order to prune pairs that cannot be part of the similarity join result based on distance bounds derived by the approximations. In this paper, we propose a novel similarity join approach, which is based on the dynamic decomposition of the tree objects into subgraphs, according to the similarity threshold. Our technique avoids computing the exact distance between two tree objects, if the objects do not share at least one common subgraph. In order to scale up the join, the computed subgraphs are managed in a two-layer index. Our experimental results on real and synthetic data collections show that our approach outperforms the state-of-the-art methods by up to an order of magnitude.


title: Design and simulation of a Sierpinski carpet fractal antenna for 5G commercial applications

text: This article presents the design and simulation of a multi-band microstrip patch antenna, using Sierpinski carpet fractal concept. The proposed antenna is designed on a FR-4 substrate with a relative permittivity of 4.4 and excited using a microstrip feed line at the edge of the patch. Sierpinski carpet fractal with iteration-3 is applied to the radiating patch. After the application of fractal, this patch antenna resonates at 14.80 GHz, 17.92 GHz, 23.12 GHz, and 27.92 GHz with impedance bandwidth of 5800 MHz, 3040 MHz, 2960 MHz, and 3840 MHz respectively. With these four bands, this antenna finds application in commercial 5G wireless communications. To illustrate the effectiveness of the fractal concept, four patch antennas are designed independently at those four resonating frequencies and compared with the single fractal antenna in terms of their size and other performance parameters. All the antennas proposed here, are designed using HFSS15 and results are analyzed in terms of return loss, VSWR, gain, and bandwidth.


title: OpenCV based disease identification of mango leaves

text: This paper aims in classifying and identifying the diseases of mango leaves for Indian agriculture. K-means algorithm is chosen for the disease segmentation, and the disease classification and identification is carried out using the SVM classifier. Disease identification based on analysis of patches or discoloring of leaf will hold good for some of the plant diseases, but some other diseases which will deform the leaf shape cannot be identified based on the same method. In this case leaf shape based disease identification has to be performed. Based on this analysis two topics are addressed in this research paper. (1) Disease identification using the OpenCV libraries (2) Leaf shape based disease identification. Keywordk-means,Principal Component Analysis (PCA), feature extraction, shape detection, disease identification, Elliptic fourier analysis, Support Vector Machine(SVM), Artificial Neural Network (ANN)


title: Assessing the benefits of computational offloading in mobile-cloud applications

text: This paper presents the results of a formative study conducted to determine the effects of computation offloading in mobile applications by comparing “application performance” (chiefly energy consumption and response time). The study examined two general execution scenarios: (1) computation is performed locally on a mobile device, and (2) when it is offloaded entirely to the cloud. The study also carefully considered the underlying network characteristics as an important factor affecting the performance. More specifically, we refactored two mobile applications to offload their computationally intensive functionality to execute in the cloud. We then profiled these applications under different network conditions, and carefully measured “application performance” in each case. The results were not as conclusive as we had expected. On fast networks, offloading is almost always beneficial. However, on slower networks, the offloading cost-benefit analysis is not as clear cut. The characteristics of the data transferred between the mobile device and the cloud may be a deciding factor in determining whether offloading a computation would improve performance.


title: A Batteryless Sensor ASIC for Implantable Bio-Impedance Applications

text: The measurement of the biological tissue's electrical impedance is an active research field that has attracted a lot of attention during the last decades. Bio-impedances are closely related to a large variety of physiological conditions; therefore, they are useful for diagnosis and monitoring in many medical applications. Measuring living tissues, however, is a challenging task that poses countless technical and practical problems, in particular if the tissues need to be measured under the skin. This paper presents a bio-impedance sensor ASIC targeting a battery-free, miniature size, implantable device, which performs accurate 4-point complex impedance extraction in the frequency range from 2 kHz to 2 MHz. The ASIC is fabricated in 150 nm CMOS, has a size of 1.22 mm × 1.22 mm and consumes 165 μA from a 1.8 V power supply. The ASIC is embedded in a prototype which communicates with, and is powered by an external reader device through inductive coupling. The prototype is validated by measuring the impedances of different combinations of discrete components, measuring the electrochemical impedance of physiological solution, and performing ex vivo measurements on animal organs. The proposed ASIC is able to extract complex impedances with around 1 Ω resolution; therefore enabling accurate wireless tissue measurements.


title: Skeleton-based Adaptive In-between Generation for Hand-drawn Key Frames

text: For improving the efficiency of 2D animation production, this paper presents a method to create in-between frames based on hand-drawn key-frames. The outlines of characters or objects on two key-frames are used as inputs. First, a skeleton linkage of the target object is automatically constructed by rasterizing each of input key-frames and then applying a pixel-based skeleton extraction method. Secondary, a pair of skeleton linkages having corresponding structure between the current key-frame and the next key-frame is constructed by applying the stroke matching algorithm. After these processes, motion transitions between the skeleton linkages are generated based on our simulation model. When the in-between frames are created only in the 2D plane, the outlines at in-between frames can be generated by a 2D deformation. In case that the in-between transitions are containing a rotation around an axis which is no perpendicular to the drawing plane, however, a 3D structure is required. For achieving such in-between transitions, our method constructs a 3D structure by inflating 2D mesh based on the input outlines. Finally, the contours from the view-point for the created 3D structure are projected onto the 2D plane during in-between transitions. In our method, we adopt the Photic Extremum Lines (PEL) to extract the 2D contours from the obtained 3D shape. In this way, we achieve the in-between creation containing spatial rotation such as hand-flipping, which has not been achieved by general ways of in-between creation method.


title: Memory-Efficient Adaptive Optimization for Large-Scale Learning

text: Adaptive gradient-based optimizers such as AdaGrad and Adam are among the methods of choice in modern machine learning. These methods maintain second-order statistics of each parameter, thus doubling the memory footprint of the optimizer. In behemoth-size applications, this memory overhead restricts the size of the model being used as well as the number of examples in a mini-batch. We describe a novel, simple, and flexible adaptive optimization method with sublinear memory cost that retains the benefits of per-parameter adaptivity while allowing for larger models and mini-batches. We give convergence guarantees for our method and demonstrate its effectiveness in training very large deep models.


title: Better Approximation of Betweenness Centrality

text: Centrality indices are used to classify a graph in important and unimportant vertices. A commonly used index is betweenness centrality which is based on shortest paths. For large graphs it is almost impossible to calculate exact betweenness centrality in appropriate time. The best known algorithm today is based on solving n SSSPs and requires O(nm+ n2 log(n)) time. But in most cases, e.g. on a home computer, resources are limited. Current approximation algorithms extrapolate values by solving only k ≪ n SSSPs. Vertices near the source of a SSSP are often overestimated. We introduce improvements which take the distance to the source into account. Euclidean distance between approximation and exact values is reduced by factor 4 with same runtime. Or runtime is 16 times faster with same Euclidean distance in a standard example, the movie actor network. Other real-world networks show similar promising results.


title: Am I wasting my time organizing email?: a study of email refinding

text: We all spend time every day looking for information in our email, yet we know little about this refinding process. Some users expend considerable preparatory effort creating complex folder structures to promote effective refinding. However modern email clients provide alternative opportunistic methods for access, such as search and threading, that promise to reduce the need to manually prepare. To compare these different refinding strategies, we instrumented a modern email client that supports search, folders, tagging and threading. We carried out a field study of 345 long-term users who conducted over 85,000 refinding actions. Our data support opportunistic access. People who create complex folders indeed rely on these for retrieval, but these preparatory behaviors are inefficient and do not improve retrieval success. In contrast, both search and threading promote more effective finding. We present design implications: current search-based clients ignore scrolling, the most prevalent refinding behavior, and threading approaches need to be extended.


title: Partially supervised clustering for image segmentation

text: All clustering algorithms process unlabeled data and, consequently, suffer from two problems: (P1) choosing and validating the correct number of clusters and (P2) insuring that algorithmic labels correspond to meaningful physical labels. Clustering algorithms such as hard and fuzzy c-means, based on optimizing sums of squared errors objective functions, suffer from a third problem: (P3) a tendency to recommend solutions that equalize cluster populations. The semi-supervised c-means algorithms introduced in this paper attempt to overcome these three problems for problem domains where a few data from each class can be labeled. Segmentation of magnetic resonance images is a problem of this type and we use it to illustrate the new algorithm. Our examples show that the semi-supervised approach provides MRI segmentations that are superior to ordinary fuzzy c-means and to the crisp k-nearest neighbor rule and further, that the new method ameliorates (P1)-(P3). Cluster analysis Fuzzy c-means Partial supervision Image segmentation Magnetic resonance images


title: Design and Implementation of a Network Security Model for Cooperative Network

text: In this paper a design and implementation of a network security model was presented, using routers and firewall. Also this paper was conducted the network security weakness in router and firewall network devices, type of threats and responses to those threats, and the method to prevent the attacks and hackers to access the network. Also this paper provides a checklist to use in evaluating whether a network is adhering to best practices in network security and data confidentiality. The main aim of this research is to protect the network from vulnerabilities, threats, attacks, configuration weaknesses and security policy weaknesses. KeywordsNetwork security, network management, threats, security policy Received December 17, 2008; Accepted March 2 2009


title: Building End-To-End Dialogue Systems Using Generative Hierarchical Neural Network Models

text: We investigate the task of building open domain, conversational dialogue systems based on large dialogue corpora using generative models. Generative models produce system responses that are autonomously generated word-by-word, opening up the possibility for realistic, flexible interactions. In support of this goal, we extend the recently proposed hierarchical recurrent encoder-decoder neural network to the dialogue domain, and demonstrate that this model is competitive with state-of-the-art neural language models and backoff n-gram models. We investigate the limitations of this and similar approaches, and show how its performance can be improved by bootstrapping the learning from a larger questionanswer pair corpus and from pretrained word embeddings.


title: The Dialog State Tracking Challenge

text: In a spoken dialog system, dialog state tracking deduces information about the user’s goal as the dialog progresses, synthesizing evidence such as dialog acts over multiple turns with external data sources. Recent approaches have been shown to overcome ASR and SLU errors in some applications. However, there are currently no common testbeds or evaluation measures for this task, hampering progress. The dialog state tracking challenge seeks to address this by providing a heterogeneous corpus of 15K human-computer dialogs in a standard format, along with a suite of 11 evaluation metrics. The challenge received a total of 27 entries from 9 research groups. The results show that the suite of performance metrics cluster into 4 natural groups. Moreover, the dialog systems that benefit most from dialog state tracking are those with less discriminative speech recognition confidence scores. Finally, generalization is a key problem: in 2 of the 4 test sets, fewer than half of the entries out-performed simple baselines. 1 Overview and motivation Spoken dialog systems interact with users via natural language to help them achieve a goal. As the interaction progresses, the dialog manager maintains a representation of the state of the dialog in a process called dialog state tracking (DST). For example, in a bus schedule information system, the dialog state might indicate the user’s desired bus route, origin, and destination. Dialog state tracking is difficult because automatic speech ∗Most of the work for the challenge was performed when the second and third authors were with Honda Research Institute, Mountain View, CA, USA recognition (ASR) and spoken language understanding (SLU) errors are common, and can cause the system to misunderstand the user’s needs. At the same time, state tracking is crucial because the system relies on the estimated dialog state to choose actions – for example, which bus schedule information to present to the user. Most commercial systems use hand-crafted heuristics for state tracking, selecting the SLU result with the highest confidence score, and discarding alternatives. In contrast, statistical approaches compute scores for many hypotheses for the dialog state (Figure 1). By exploiting correlations between turns and information from external data sources – such as maps, bus timetables, or models of past dialogs – statistical approaches can overcome some SLU errors. Numerous techniques for dialog state tracking have been proposed, including heuristic scores (Higashinaka et al., 2003), Bayesian networks (Paek and Horvitz, 2000; Williams and Young, 2007), kernel density estimators (Ma et al., 2012), and discriminative models (Bohus and Rudnicky, 2006). Techniques have been fielded which scale to realistically sized dialog problems and operate in real time (Young et al., 2010; Thomson and Young, 2010; Williams, 2010; Mehta et al., 2010). In end-to-end dialog systems, dialog state tracking has been shown to improve overall system performance (Young et al., 2010; Thomson and Young, 2010). Despite this progress, direct comparisons between methods have not been possible because past studies use different domains and system components, for speech recognition, spoken language understanding, dialog control, etc. Moreover, there is little agreement on how to evaluate dialog state tracking. Together these issues limit progress in this research area. The Dialog State Tracking Challenge (DSTC) provides a first common testbed and evaluation


title: Partially observable Markov decision processes for spoken dialog systems

text: In a spoken dialog system, determining which action a machine should take in a given situation is a difficult problem because automatic speech recognition is unreliable and hence the state of the conversation can never be known with certainty. Much of the research in spoken dialog systems centres on mitigating this uncertainty and recent work has focussed on three largely disparate techniques: parallel dialog state hypotheses, local use of confidence scores, and automated planning. While in isolation each of these approaches can improve action selection, taken together they currently lack a unified statistical framework that admits global optimization. In this paper we cast a spoken dialog system as a partially observable Markov decision process (POMDP). We show how this formulation unifies and extends existing techniques to form a single principled framework. A number of illustrations are used to show qualitatively the potential benefits of POMDPs compared to existing techniques, and empirical results from dialog simulations are presented which demonstrate significant quantitative gains. Finally, some of the key challenges to advancing this method – in particular scalability – are briefly outlined. 2006 Elsevier Ltd. All rights reserved.


title: Human balance and posture control during standing and walking

text: The fact that we as humans are bipeds and locomote over the ground with one foot in contact (walking), no feet in contact (running), or both feet in contact (standing) creates a major challenge to our balance control system. Because two-thirds of our body mass is located two-thirds of body height above the ground we are an inherently unstable system unless a control system is continuously acting. The purpose of this review is to introduce the reader to the basic anatomy, mechanics, and neuromuscular control that is seen in the current literature related to balance control. The degeneration of the balance control system in the elderly and in many pathologies has forced researchers and clinicians to understand more about how the system works and how to quantify its status at any point in time. With the increase in our ageing population and with increased life expectancy of our elderly the importance of maintaining mobility is becoming ever more critical. Injuries and loss of life due to falls in the elderly is a very major factor facing them. Table 1 compares the deaths due to falls with the deaths due to motor vehicle accidents (MVA) as a function of age as reported by Statistics Canada in 1991. The startling fact is that the deaths due to falls in the SO+ population is almost as high as the MVA deaths in the accident-prone l5-29-year group. However, when we look at the deaths per 100 000 for these two causes the figures are even more startling. The young 15-29-year-old group had 21.5 MVA deaths per 100 000 while the elderly deaths


title: Math Anxiety : Personal , Educational , and Cognitive Consequences

text: Highly math-anxious individuals are characterized by a strong tendency to avoid math, which ultimately undercuts their math competence and forecloses important career paths. But timed, on-line tests reveal math-anxiety effects on w h o l e-n u m b e r a r i t h m e t i c p r o b l e m s (e. g. , 4 6 ϩ 2 7) , whereas achievement tests show no competence differences. Math anxiety disrupts cognitive processing by compromising ongoing activity in working memory. Although the causes of math anxiety are undetermined, some teaching styles are implicated as risk factors. We need research on the origins of math anxiety and on its " signature " in brain activity , to examine both its emo-t i o n a l a n d i t s c o g n i t i v e components. My graduate assistant recently told me about a participant he had tested in the lab. She exhibited increasing discomfort and nervousness as the testing session progressed , eventually becoming so distraught that she burst into tears. My assistant remarked that many of our participants show some un-ease or apprehension during test-ing—trembling hands, nervous laughter, and so forth. Many ask, defensively, if their performance says anything about their overall intelligence. These occasionally extreme emotional reactions are not triggered by deliberately provocative procedures—there are no personally sensitive questions or intentional manipulations of stress. Instead, we merely ask college adults to solve elementary-school arithmetic problems, such as 46 ϩ 18 ϭ ? and 34 Ϫ 19 ϭ ? The reactions are obvious symptoms of anxiety, in this case math anxiety induced by ordinary arithmetic problems presented in timed tasks. On the one hand, it is almost unbelievable that tests on such fundamental topics can be so upsetting ; knowing that 15 Ϫ 8 ϭ 7 ought to be as basic as knowing how to spell " cat. " On the other hand, U.S. culture abounds with attitudes that foster math anxiety: Math is thought to be inherently difficult (as Barbie dolls used to say, " Math class is hard "), aptitude is considered far more important than effort (Geary, 1994, chap. 7), and being good at math is considered relatively unimportant, or even optional. In this article, I discuss what has been learned about math anxiety across the past 30 years or so, and suggest …


title: Enabling Public Verifiability and Data Dynamics for Storage Security

text: Cloud Computing has been envisioned as the next-generation architecture of IT Enterprise. It moves the application software and databases to the centralized large data centers, where the management of the data and services may not be fully trustworthy. This unique paradigm brings about many new security challenges, which have not been well understood. This work studies the problem of ensuring the integrity of data storage in Cloud Computing. In particular, we consider the task of allowing a third party auditor (TPA), on behalf of the cloud client, to verify the integrity of the dynamic data stored in the cloud. The introduction of TPA eliminates the involvement of client through the auditing of whether his data stored in the cloud is indeed intact, which can be important in achieving economies of scale for Cloud Computing. The support for data dynamics via the most general forms of data operation, such as block modification, insertion and deletion, is also a significant step toward practicality, since services in Cloud Computing are not limited to archive or backup data only. While prior works on ensuring remote data integrity often lacks the support of either public verifiability or dynamic data operations, this paper achieves both. We first identify the difficulties and potential security problems of direct extensions with fully dynamic data updates from prior works and then show how to construct an elegant verification scheme for seamless integration of these two salient features in our protocol design. In particular, to achieve efficient data dynamics, we improve the Proof of Retrievability model [1] by manipulating the classic Merkle Hash Tree (MHT) construction for block tag authentication. Extensive security and performance analysis show that the proposed scheme is highly efficient and provably secure.


title: The Effect of Noise on Sofware Engineers' Performance

text: Background: Noise, dened as an unwanted sound, is one of the commonest factors that could aect people’s performance in their daily work activities. e soware engineering research community has marginally investigated the eects of noise on soware engineers’ performance. Aims: We studied if noise aects soware engineers’ performance in: (i) comprehending functional requirements and (ii) xing faults in source code. Method: We conducted two experiments with nal-year undergraduate students in Computer Science. In the rst experiment, we asked 55 students to comprehend functional requirements exposing them or not to noise, while in the second experiment 42 students were asked to x faults in Java code. Results: e participants in the second experiment, when exposed to noise, had signicantly worse performance in xing faults in source code. On the other hand, we did not observe any statistically signicant dierence in the rst experiment. Conclusions: Fixing faults in source code seems to be more vulnerable to noise than comprehending functional requirements.


title: Transcranial Direct Current Stimulation Modulates Neuronal Activity and Learning in Pilot Training

text: Skill acquisition requires distributed learning both within (online) and across (offline) days to consolidate experiences into newly learned abilities. In particular, piloting an aircraft requires skills developed from extensive training and practice. Here, we tested the hypothesis that transcranial direct current stimulation (tDCS) can modulate neuronal function to improve skill learning and performance during flight simulator training of aircraft landing procedures. Thirty-two right-handed participants consented to participate in four consecutive daily sessions of flight simulation training and received sham or anodal high-definition-tDCS to the right dorsolateral prefrontal cortex (DLPFC) or left motor cortex (M1) in a randomized, double-blind experiment. Continuous electroencephalography (EEG) and functional near infrared spectroscopy (fNIRS) were collected during flight simulation, n-back working memory, and resting-state assessments. tDCS of the right DLPFC increased midline-frontal theta-band activity in flight and n-back working memory training, confirming tDCS-related modulation of brain processes involved in executive function. This modulation corresponded to a significantly different online and offline learning rates for working memory accuracy and decreased inter-subject behavioral variability in flight and n-back tasks in the DLPFC stimulation group. Additionally, tDCS of left M1 increased parietal alpha power during flight tasks and tDCS to the right DLPFC increased midline frontal theta-band power during n-back and flight tasks. These results demonstrate a modulation of group variance in skill acquisition through an increasing in learned skill consistency in cognitive and real-world tasks with tDCS. Further, tDCS performance improvements corresponded to changes in electrophysiological and blood-oxygenation activity of the DLPFC and motor cortices, providing a stronger link between modulated neuronal function and behavior.


title: How to gamify software engineering

text: Software development, like any prolonged and intellectually demanding activity, can negatively affect the motivation of developers. This is especially true in specific areas of software engineering, such as requirements engineering, test-driven development, bug reporting and fixing, where the creative aspects of programming fall short. The developers' engagement might progressively degrade, potentially impacting their work's quality.


title: A multi-method simulation of a high-frequency bus line

text: A methodology to model high-frequency bus lines is proposed and a realistic event-simulation model for such a line in the Netherlands is presented. This simulation model helps policy makers to predict changes that have to be made to bus routes and planned travel times before problems occur. With this model, different passenger growth scenarios can be easily evaluated. The model is validated using different key performance indicators, showing that under some model assumptions, it can realistically simulate real-life scenarios. The simulations workings are illustrated by a case study of passenger growth.


title: The role of mindfulness in a contextual cognitive-behavioral analysis of chronic pain-related suffering and disability

text: An increasing number of studies consider the specific processes by which distressing sensations, thoughts, and emotional experiences exert their influence on the daily functioning of those who suffer with chronic pain. Clinical methods of mindfulness and the processes that underlie them appear to have clear implications in this area, but have not been systematically investigated to this point in time. The purpose of the present study was to examine mindfulness in relation to the pain, emotional, physical, and social functioning of individuals with chronic pain. The present study included 105 consecutive patients attending a clinical assessment for treatment of chronic pain. Each completed a standardized battery of questionnaires, including a measure of mindfulness, the Mindful Attention Awareness Scale [Brown KW, Ryan RM. The benefits of being present: mindfulness and its role in psychological well-being. J Pers Soc Psychol 2003;84:822-48]. Correlation analyses indicated that mindfulness was unrelated to age, gender, education, or chronicity of pain, but was significantly related to multiple measures of patient functioning. In multiple regression analyses, after controlling for patient background variables, pain intensity, and pain-related acceptance, mindfulness accounted for significant variance in measures of depression, pain-related anxiety; physical, psychosocial, and "other" disability. In each instance greater mindfulness was associated with better functioning. The combined increments of variance explained from acceptance of pain and mindfulness were at least moderate and, in some cases, appeared potentially meaningful. The behavioral processes of mindfulness and their accessibility to scientific study are considered.


title: Integrative Neuromuscular Training in Youth Athletes. Part II

text: THE SECOND PART OF THIS REVIEW PROVIDES A FLEXIBLE APPROACH TO INTEGRATIVE NEUROMUSCULAR TRAINING (INT) WITH THE GOALS TO IMPROVE INJURY RESILIENCE AND TO ENHANCE SPORT AND MOTOR PERFORMANCE ABILITIES IN YOUTH POPULATIONS. THE PROPOSED MODEL OF INT IN THIS MANUSCRIPT PRESENTS 6 ESSENTIAL COMPONENTS: DYNAMIC STABILITY (LOWER LIMB AND CORE), STRENGTH, PLYOMETRICS, COORDINATION, SPEED AND AGILITY, AND FATIGUE RESISTANCE. THE DEVELOPMENT OF THESE 6 CAPACITIES ARE INTEGRAL IN ESTABLISHING AN IMPORTANT FOUNDATION BY INITIALLY DEVELOPING FUNDAMENTAL MOVEMENT SKILL COMPETENCY BEFORE BUILDING UPON THESE SKILLS TO ENRICH SPORTS-SPECIFIC AND ACTIVITY-SPECIFIC SKILL SETS. FOR A VIDEO ABSTRACT OF THIS ARTICLE, SEE SUPPLEMENTAL DIGITAL CONTENT 1 (SEE VIDEO, http://links.lww.com/SCJ/A190).


title: Coping theory and research: past, present, and future.

text: In this essay in honor of Donald Oken, I emphasize coping as a key concept for theory and research on adaptation and health. My focus will be the contrasts between two approaches to coping, one that emphasizes style—that is, it treats coping as a personality characteristic—and another that emphasizes process—that is, efforts to manage stress that change over time and are shaped by the adaptational context out of which it is generated. I begin with an account of the style and process approaches, discuss their history briefly, set forth the principles of a process approach, describe my own efforts at measurement, and define coping and its functions from a process standpoint. This is followed by a digest of major generalizations that resulted from coping process research. The essay concludes with a discussion of special issues of coping measurement, in particular, the limitations of both coping style and process approaches and how these limitations might be dealt with. There has been a prodigious volume of coping research in the last decade or two, which I can only touch on very selectively. In this essay, I also ignore a host of important developmental issues that have to do with the emergence of coping and its cognitive and motivational bases in infants, as well as a growing literature on whether, how, and why the coping process changes with aging.


title: Sentiment-specific word embedding for Indonesian sentiment analysis

text: Word embedding has been proven to improve performance of sentiment classification systems. A new proposed word embedding called sentiment-specific word embedding exploits sentiment information, in order to reach better performance of sentiment analysis systems using word embedding. In this paper, we build Indonesian sentiment-specific word embedding and apply it for sentiment analysis. We compare performance of sentiment classification based on sentiment-specific word embedding with other popular feature representations such as bag of words, Term Frequency-Inverse Document Frequency (TF-IDF), and also generic word embedding. Although our sentiment-specific word embedding models achieve a higher score than the Word2Vec embedding, the lexical representations, bag of words and TF-IDF still gained better performance.


title: The Airport Ground Movement Problem : Past and Current Research and Future Directions

text: Determining efficient airport operations is an important and critical problem for airports, airlines, passengers and other stakeholders. Moreover, it is likely to become even more so given the traffic increases which are expected over the next few years. The ground movement problem forms the link between other airside problems, such as arrival sequencing, departure sequencing and gate/stand allocation. This paper provides an overview, categorisation and critical examination of the previous research for ground movement and highlights various important open areas of research. Of particular importance is the question of the integration of various airport operations and their relationships which are considered in this paper.


title: An Organization Ontology for Enterprise Modelling

text: The paper presents our exploration into an organization ontology for the TOVE enterprise model. Its primary focus has been in linking structure and behavior through the concept of empowerment. Empowerment is the right of an organization agent to perform status changing actions. This linkage is critical to the unification of enterprise models and their executability.


title: VL2: a scalable and flexible data center network

text: To be agile and cost effective, data centers should allow dynamic resource allocation across large server pools. In particular, the data center network should enable any server to be assigned to any service. To meet these goals, we present VL2, a practical network architecture that scales to support huge data centers with uniform high capacity between servers, performance isolation between services, and Ethernet layer-2 semantics. VL2 uses (1) flat addressing to allow service instances to be placed anywhere in the network, (2) Valiant Load Balancing to spread traffic uniformly across network paths, and (3) end-system based address resolution to scale to large server pools, without introducing complexity to the network control plane. VL2's design is driven by detailed measurements of traffic and fault data from a large operational cloud service provider. VL2's implementation leverages proven network technologies, already available at low cost in high-speed hardware implementations, to build a scalable and reliable network architecture. As a result, VL2 networks can be deployed today, and we have built a working prototype. We evaluate the merits of the VL2 design using measurement, analysis, and experiments. Our VL2 prototype shuffles 2.7 TB of data among 75 servers in 395 seconds - sustaining a rate that is 94% of the maximum possible.


title: Friendlink: Link prediction in social networks via bounded local path traversal

text: Online social networks (OSNs) like Facebook, Myspace, and Hi5 have become popular, because they allow users to easily share content or expand their social circle. OSNs recommend new friends to registered users based on local graph features (i.e. based on the number of common friends that two users share). However, OSNs do not exploit all different length paths of the network. Instead, they consider only pathways of maximum length 2 between a user and his candidate friends. On the other hand, there are global approaches, which detect the overall path structure in a network, being computationally prohibitive for huge-size social networks. In this paper, we provide friend recommendations, also known as the link prediction problem, by traversing all paths of a bounded length, based on the “algorithmic small world hypothesis”. As a result, we are able to provide more accurate and faster friend recommendations. We perform an extensive experimental comparison of the proposed method against existing link prediction algorithms, using two real data sets (Hi5 and Epinions). Our experimental results show that our FriendLink algorithm outperforms other approaches in terms of effectiveness and efficiency in both real data sets.


title: Fast local search and guided local search and their application to British Telecom's workforce scheduling problem

text: This paper reports a Fast Local Search (FLS) algorithm which helps to improve the efficiency of hill climbing and a Guided Local Search (GLS) Algorithm which is developed to help local search to escape local optima and distribute search effort. To illustrate how these algorithms work, this paper describes their application to British Telecom’s workforce scheduling problem, which is a hard real life problem. The effectiveness of FLS and GLS are demonstrated by the fact that they both out-perform all the methods applied to this problem so far, which include simulated annealing, genetic algorithms and constraint logic programming.


title: Implementation and Optimization of the Accelerator Based on FPGA Hardware for LSTM Network

text: Today, artificial neural networks (ANNs) are important machine learning methods which are widely used in a variety of applications. As the emerging field of ANNs, recurrent neural networks (RNNs) are often used for sequencerelated applications. And Long Short-Term Memory (LSTM) is an improved RNN which contains complex computational logic. To achieve high accuracy, researchers always build largescale LSTM networks which are time-consuming and powerconsuming. Thus the acceleration of LSTM networks, low power & energy consumption become the hot issues in today's research. In this paper, we present a hardware accelerator for the LSTM neural network layer based on FPGA Zedboard and use pipeline methods to parallelize the forward computing process. To optimize our implementation, we also use multiple methods including tiled matrix-vector multiplication, binary adder tree, and overlap of computation and data access. Through the acceleration and optimization methods, our accelerator is power-efficient and has a better performance than ARM Cortex A9 processor and Intel Core i5 processor.


title: Demonstration of MOS capacitor measurement for wafer manufacturing using a Direct Charge Measurement

text: Direct Charge Measurement (DCM) has a capability to improve the capacitance measurement time in parametric test. Through an actual wafer measurement, we have successfully verified that DCM can measure MOS capacitor much faster than an LCR meter while keeping good correlations for wafer manufacturing.


title: NB-IoT and LoRA connectivity analysis for M2M/IoT smart grids applications

text: The evolution of the new M2M/IoT paradigm suggests new applications in several fields. However, the unique characteristics of M2M communications pose different challenges in terms of connectivity and capacity with respect to the conventional telecommunications networks. In particular, the harmful locations where IoT devices could be deployed and the massive number of the devices to be connected require a different approach with respect the traditional wireless communication. In this paper, we analyzed two different technologies expressly devoted the M2M communication: the Long Term Evolution (LTE) based solution, NB-IoT (Narrow Band — Internet of Things), and the LPWAN (Low Power Wide Area Network) based solution, LoRa (Low Range). The analysis has been provided taking into account different propagation scenarios and geographical information of the real MNOs (Mobile Network Operators) sites operating in the territory under test. The aim of this work is to check wireless access method of both cellular and proprietary technologies for the novel IoT Smart Grid applications requirements.


title: A Survey of Context-Aware Mobile Computing Research

text: Context-aware computing is a mobile computing paradigm in which applications can discover and take advantage of contextual information (such as user location, time of day, nearby people and devices, and user activity). Since it was proposed about a decade ago, many researchers have studied this topic and built several context-aware applications to demonstrate the usefulness of this new technology. Context-aware applications (or the system infrastructure to support them), however, have never been widely available to everyday users. In this survey of research on context-aware systems and applications, we looked in depth at the types of context used and models of context information, at systems that support collecting and disseminating context, and at applications that adapt to the changing context. Through this survey, it is clear that context-aware research is an old but rich area for research. The difficulties and possible solutions we outline serve as guidance for researchers hoping to make context-aware computing a reality.


title: Convolutional Neural Networks for Real-Time Beat Tracking: A Dancing Robot Application

text: In this paper a novel approach that adopts Convolutional Neural Networks (CNN) for the Beat Tracking task is proposed. The proposed architecture involves 2 convolutional layers with the CNN filter dimensions corresponding to time and band frequencies, in order to learn a Beat Activation Function (BAF) from a time-frequency representation. The output of each convolutional layer is computed only over the past values of the previous layer, to enable the computation of the BAF in an online fashion. The output of the CNN is post-processed by a dynamic programming algorithm in combination with a bank of resonators for calculating the salient rhythmic periodicities. The proposed method has been designed to be computational efficient in order to be embedded on a dancing NAO robot application, where the dance moves of the choreography are synchronized with the beat tracking output. The proposed system was submitted to the Signal Processing Cup Challenge 2017 and ranked among the top third algorithms.


title: Design of a Compact GPS and SDARS Integrated Antenna for Automotive Applications

text: This letter describes a novel compact solution for integrating a Global Positioning System (GPS) and a Satellite Digital Audio Radio Service (SDARS) antenna in a very small volume to satisfy the requirements of the automotive market. The GPS antenna is a classic small commercial ceramic patch, and the SDARS antenna is designed in order to fit in the reduced space without affecting radiation and band performance of the GPS antenna. The SDARS basic geometry is a square-ring microstrip antenna operating in the frequency range 2.320-2.345 GHz with left-hand circular polarization (LHCP), and it is wrapped around the GPS patch, which receives a right-hand circular polarization (RHCP) signal at 1.575 GHz. The overall volume of the presented integrated antenna solution is only 30 x 30 x 7.6 mm3, rendering it attractive for the automotive market.


title: A DUAL BAND CIRCULARLY POLARIZED RING ANTENNA BASED ON COMPOSITE RIGHT AND LEFT HANDED METAMATERIALS

text: Abstract—In this paper a dual band circularly polarized antenna is designed, fabricated, and measured. Based on the concept of composite right and left handed (CRLH) metamaterials, the same phase constants and current distributions on the ring antenna are achieved at two frequency bands. Thus, the antenna has similar radiation patterns at both bands. The circular polarization is implemented by feeding two vertical ports from power dividers that provide equal magnitudes and quadrature phase excitations.


title: Omnidirectional Circularly Polarized Antenna Utilizing Zeroth-Order Resonance of Epsilon Negative Transmission Line

text: The omnidirectional circularly polarized (CP) antenna using a circular mushroom structure with curved branches is proposed. The antenna is based on the zeroth-order resonance (ZOR) mode of epsilon negative (ENG) transmission line (TL) to obtain a vertical polarization and an omnidirectional radiation pattern. Also, the horizontal polarization is obtained by the curved branches. The 90° phase difference between two orthogonal polarizations is inherently provided by the zeroth-order resonator. Therefore, the antenna has an omnidirectional CP radiation pattern in the azimuthal plane. In addition, this antenna is planar type and simply designed without a dual feeding structure and 90° phase shifter. The measured average axial ratio and left-hand (LH) CP gain are 2.03 dB and - 0.40 dBic, respectively, in the azimuthal plane.


title: Gaze Direction based Mobile Application for Quadriplegia Wheelchair Control System

text: People with quadriplegia recruit the interest of researchers in introducing automated movement systems for adopted special purpose wheelchairs. These systems were introduced for easing the movement of such type of disabled people independently. This paper proposed a comprehensive control system that can control the movement of Quadriplegia wheelchairs using gaze direction and blink detection. The presented system includes two main parts. The first part consists of a smartphone that applies the propose gaze direction detection based mobile application. It then sends the direction commands to the second part via Wi-Fi connection. The second part is a prototype representing the quadriplegia wheelchair that contains robotic car (two-wheel driving car), Raspberry Pi III and ultrasound sensors. The gaze direction commands, sent from the smartphone, are received by the Raspberry Pi for processing and producing the control signals. The ultrasound sensors are fixed at the front and back of the car for performing the emergency stop when obstacles are detected. The proposed system is based on gaze tracking and direction detection without the requirement of calibration with additional sensors and instruments. The obtained results show the superior performance of the proposed system that proves the claim of authors. The accuracy ratio is ranged between 66% and 82% depending on the environment (indoor and outdoor) and surrounding lighting as well as the smart phone type. Keywords—Gaze direction detection; mobile application; obstacle detection; quadriplegia; Raspberry Pi microcomputer


title: Understanding crowdfunding work: implications for support tools

text: Crowdfunding is changing the way people realize their work by providing a new way to gain support from a distributed audience. This study seeks to understand the work of crowdfunding project creators in order to inform the design of crowdfunding support tools and systems. We conducted interviews with 30 project creators from three popular crowdfunding platforms in order to understand what tasks are involved and what tools people use to accomplish crowdfunding work. Initial results suggest that project creators carry out three main types of work-preparing the campaign material, marketing the project, and following through with project goals-and have adapted general support tools to facilitate doing this work. From our initial findings, we hope to improve and design future crowdfunding support tools and systems.


title: Delicate manipulations with compliant mechanism and electrostatic adhesion

text: Traditional rigid robotic hand manipulator has been used in many field nowadays due to its advantages of large gripping force and stable performance. However, this kind of rigid manipulator is not suitable for gripping fragile objects since it is motorized and force control can be a problem. It is also not suitable to grip object with different shapes since the manipulator is rigid and not compliant. In this study, a novel manipulator with gripping capability is designed and fabricated. The manipulator combines electrostatic adhesion actuation with soft manipulators. The manipulator has high flexibility and can be compliant to different shapes due to the property of the materials. It is very promising to do delicate manipulations in industry field and biomedical field.


title: A hybrid approach for database intrusion detection at transaction and inter-transaction levels

text: Nowadays, information plays an important role in the organizations. Sensitive information is often stored within the database. Traditional mechanisms such as encryption, access control, and authentication cannot provide a high level of confidence. Therefore, the existence of Intrusion Detection Systems in the database is a necessity. In this paper, we propose a type of intrusion detection system for detecting attacks in both database transaction level and inter-transaction level (user task level). For this purpose, we propose a detection method at transaction level, which is based on describing the expected transactions within the database applications. Then at inter-transaction level, we propose a detection method that is based on anomaly detection and uses data mining to find dependency and sequence rules. The advantage of this system compared to the previous database intrusion detection systems is that it can detect malicious behaviors in both transaction and inter-transaction levels. Also, it gains advantages of a hybrid method, including specification-based detection and anomaly detection, to minimize both false positive and false negative errors. In order to evaluate the accuracy of the proposed system, some experiments have been done. The experimental evaluation results show high accuracy and effectiveness of the proposed system.


title: Deep Domain Adaptation in Action Space

text: In the general settings of supervised learning, human action recognition has been a widely studied topic. The classifiers learned in this setting assume that the training and test data have been sampled from the same underlying probability distribution. However, in most of the practical scenarios, this assumption is not true, resulting in a suboptimal performance of the classifiers. This problem, referred to as Domain Shift, has been extensively studied, but mostly for image/object classification task. In this paper, we investigate the problem of Domain Shift in action videos, an area that has remained under-explored, and propose two new approaches named Action Modeling on Latent Subspace (AMLS) and Deep Adversarial Action Adaptation (DAAA). In the AMLS approach, the action videos in the target domain are modeled as a sequence of points on a latent subspace and adaptive kernels are successively learned between the source domain point and the sequence of target domain points on the manifold. In the DAAA approach, an end-to-end adversarial learning framework is proposed to align the two domains. The action adaptation experiments were conducted using various combinations of multi-domain action datasets, including six common classes of Olympic Sports and UCF50 datasets and all classes of KTH, MSR and our own SonyCam datasets. In this paper, we have achieved consistent improvements over chosen baselines and obtained some state-of-the-art results for the datasets.


title: Parallel Computer Architecture: A Hardware/Software Approach

text: enter the circuit several times, possibly via different input processors. More elaborate combinatorial considerations than for standard VLSI circuits are needed to show how communication complexity can be used to get lower bounds on multilective VLSI computations. Near the end of the book, Hromkovic presents relations between communication complexity and some complexity measures of sequential computations. The core section introduces a uniform model of one-way communication protocols and shows that the corresponding uniform one-way communication complexity is strongly related to the size of deterministic finite automata. Then he relates communication complexity to the time and space complexity of Turing machines. Finally, he shows how communication complexity can be used to obtain lower bounds on the size and the depth of decisions nees and branching programs.


title: Sub-Nyquist Radar via Doppler Focusing

text: We investigate the problem of a monostatic pulse-Doppler radar transceiver trying to detect targets sparsely populated in the radar's unambiguous time-frequency region. Several past works employ compressed sensing (CS) algorithms to this type of problem but either do not address sample rate reduction, impose constraints on the radar transmitter, propose CS recovery methods with prohibitive dictionary size, or perform poorly in noisy conditions. Here, we describe a sub-Nyquist sampling and recovery approach called Doppler focusing, which addresses all of these problems: it performs low rate sampling and digital processing, imposes no restrictions on the transmitter, and uses a CS dictionary with size, which does not increase with increasing number of pulses P. Furthermore, in the presence of noise, Doppler focusing enjoys a signal-to-noise ratio (SNR) improvement, which scales linearly with P, obtaining good detection performance even at SNR as low as - 25 dB. The recovery is based on the Xampling framework, which allows reduction of the number of samples needed to accurately represent the signal, directly in the analog-to-digital conversion process. After sampling, the entire digital recovery process is performed on the low rate samples without having to return to the Nyquist rate. Finally, our approach can be implemented in hardware using a previously suggested Xampling radar prototype.