The characteristics of persistent sexual offenders: a meta-analysis of recidivism studies.

A meta-analysis of 82 recidivism studies (1,620 findings from 29,450 sexual offenders) identified deviant sexual preferences and antisocial orientation as the major predictors of sexual recidivism for both adult and adolescent sexual offenders. Antisocial orientation was the major predictor of violent recidivism and general (any) recidivism. The review also identified some dynamic risk factors that have the potential of being useful treatment targets (e.g., sexual preoccupations, general self-regulation problems). Many of the variables commonly addressed in sex offender treatment programs (e.g., psychological distress, denial of sex crime, victim empathy, stated motivation for treatment) had little or no relationship with sexual or violent recidivism.


A Novel Compact UHF RFID Tag Antenna Designed With Series Connected Open Complementary Split Ring Resonator (OCSRR) Particles

A novel compact planar antenna for passive UHF radio frequency identification (RFID) tags is presented. Instead of using meander-line sections, much smaller open complementary split ring resonator (OCSRR) particles are connected in series to create a small dipole with a conjugate match to the power harvesting circuit on the passive RFID tag. The manufactured (prototype) OCSRR RFID tag presented here has an antenna input impedance of 15.8 + J142.5 Ω at a frequency of 920 MHz and a max read range of 5.48 m. This performance is achieved with overall tag dimensions of 0.036λ0 × 0.17λ0 where λ0 is the free space wavelength of 920 MHz.


Path Planning Based on Bézier Curve for Autonomous Ground Vehicles

In this paper we present two path planning algorithms based on Bezier curves for autonomous vehicles with way points and corridor constraints. Bezier curves have useful properties for the path generation problem. The paper describes how the algorithms apply these properties to generate the reference trajectory for vehicles to satisfy the path constraints. Both algorithms join cubic Bezier curve segments smoothly to generate the path. Additionally, we discuss the constrained optimization problem that optimizes the resulting path for a user-defined cost function. The simulation shows the generation of successful routes for autonomous vehicles using these algorithms as well as control results for a simple kinematic vehicle. Extensions of these algorithms towards navigating through an unstructured environment with limited sensor range are discussed.


A multi-DoF anthropomorphic transradial prosthetic arm

An anthropomorphic transradial prosthetic arm is proposed in this paper. In order to generate the wrist flexion/extension and ulna/radial deviation, a novel wrist mechanism is proposed based on the parallel prismatic manipulators. It is expected to realize high speed operation, higher positional accuracy and anthropomorphic features using the proposed mechanism. The prosthetic arm consists of an under-actuated hand as the terminal device. The hand mechanism is capable of providing the grasping adaptation. With the intention of verifying the effectiveness of the mechanisms in motion generation, motion simulation and kinematic analysis are carried out.


SemEval-2007 Task 02: Evaluating Word Sense Induction and Discrimination Systems

Word Sense Disambiguation (WSD) is a key enabling-technology. Supervised WSD techniques are the best performing in public evaluations, but need large amounts of hand-tagging data. Existing hand-annotated corpora like SemCor (Miller et al., 1993), which is annotated with WordNet senses (Fellbaum, 1998) allow for a small improvement over the simple most frequent sense heuristic, as attested in the all-words track of the last Senseval competition (Snyder and Palmer, 2004). In theory, larger amounts of training data (SemCor has approx. 500M words) would improve the performance of supervised WSD, but no current project exists to provide such an expensive resource. Another problem of the supervised approach is that the inventory and distribution of senses changes dramatically from one domain to the other, requiring additional hand-tagging of corpora (Martı́nez and Agirre, 2000; Koeling et al., 2005). Supervised WSD is based on the “fixed-list of senses” paradigm, where the senses for a target word are a closed list coming from a dictionary or lexicon. Lexicographers and semanticists have long warned about the problems of such an approach, where senses are listed separately as discrete entities, and have argued in favor of more complex representations, where, for instance, senses are dense regions in a continuum (Cruse, 2000). Unsupervised Word Sense Induction and Discrimination (WSID, also known as corpus-based unsupervised systems) has followed this line of thinking, and tries to induce word senses directly from the corpus. Typical WSID systems involve clustering techniques, which group together similar examples. Given a set of induced clusters (which represent word uses or senses1), each new occurrence of the target word will be compared to the clusters and the most similar cluster will be selected as its sense. One of the problems of unsupervised systems is that of managing to do a fair evaluation. Most of current unsupervised systems are evaluated in-house, with a brief comparison to a re-implementation of a former system, leading to a proliferation of unsupervised systems with little ground to compare among them. The goal of this task is to allow for comparison across sense-induction and discrimination systems, and also to compare these systems to other supervised and knowledge-based systems. The paper is organizes as follows. Section 2 presents the evaluation framework used in this task. Section 3 presents the systems that participated in the task, and the official results. Finally, Section 4 draws the conclusions.


Fossils, genes and the evolution of animal limbs

The morphological and functional evolution of appendages has played a crucial role in the adaptive radiation of tetrapods, arthropods and winged insects. The origin and diversification of fins, wings and other structures, long a focus of palaeontology, can now be approached through developmental genetics. Modifications of appendage number and architecture in each phylum are correlated with regulatory changes in specific patterning genes. Although their respective evolutionary histories are unique, vertebrate, insect and other animal appendages are organized by a similar genetic regulatory system that may have been established in a common ancestor.


The DL-Lite Family and Relations

The recently introduced series of description logics under the common moniker ‘DLLite’ has attracted attention of the description logic and semantic web communities due to the low computational complexity of inference, on the one hand, and the ability to represent conceptual modeling formalisms, on the other. The main aim of this article is to carry out a thorough and systematic investigation of inference in extensions of the original DL-Lite logics along five axes: by (i) adding the Boolean connectives and (ii) number restrictions to concept constructs, (iii) allowing role hierarchies, (iv) allowing role disjointness, symmetry, asymmetry, reflexivity, irreflexivity and transitivity constraints, and (v) adopting or dropping the unique name assumption. We analyze the combined complexity of satisfiability for the resulting logics, as well as the data complexity of instance checking and answering positive existential queries. Our approach is based on embedding DL-Lite logics in suitable fragments of the one-variable first-order logic, which provides useful insights into their properties and, in particular, computational behavior.


Generalized schema-mappings: from termination to tractability

Data-Exchange is the problem of creating new databases according to a high-level specification called a schema-mapping while preserving the information encoded in a source database. This paper introduces a notion of generalized schema-mapping that enriches the standard schema-mappings (as defined by Fagin et al) with more expressive power. It then proposes a more general and arguably more intuitive notion of semantics that rely on three criteria: Soundness, Completeness and Laconicity (non-redundancy and minimal size). These semantics are shown to coincide precisely with the notion of cores of universal solutions in the framework of Fagin, Kolaitis and Popa. It is also well-defined and of interest for larger classes of schema-mappings and more expressive source databases (with null-values and equality constraints). After an investigation of the key properties of generalized schema-mappings and their semantics, a criterion called Termination of the Oblivious Chase (TOC) is identified that ensures polynomial data-complexity. This criterion strictly generalizes the previously known criterion of Weak-Acyclicity. To prove the tractability of TOC schema-mappings, a new polynomial time algorithm is provided that, unlike the algorithm of Gottlob and Nash from which it is inspired, does not rely on the syntactic property of Weak-Acyclicity. As the problem of deciding whether a Schema-mapping satisfies the TOC criterion is only recursively enumerable, a more restrictive criterion called Super-weak Acylicity (SwA) is identified that can be decided in Polynomial-time while generalizing substantially the notion of Weak-Acyclicity.


Ontology-Based Data Access: Ontop of Databases

We present the architecture and technologies underpinning the OBDA system Ontop and taking full advantage of storing data in relational databases. We discuss the theoretical foundations of Ontop: the tree-witness query rewriting, T -mappings and optimisations based on database integrity constraints and SQL features. We analyse the performance of Ontop in a series of experiments and demonstrate that, for standard ontologies, queries and data stored in relational databases, Ontop is fast, efficient and produces SQL rewritings of high quality.


Linking Data to Ontologies

Many organizations nowadays face the problem of accessing existing data sources by means of flexible mechanisms that are both powerful and efficient. Ontologies are widely considered as a suitable formal tool for sophisticated data access. The ontology expresses the domain of interest of the information system at a high level of abstraction, and the relationship between data at the sources and instances of concepts and roles in the ontology is expressed by means of mappings. In this paper we present a solution to the problem of designing effective systems for ontology-based data access. Our solution is based on three main ingredients. First, we present a new ontology language, based on Description Logics, that is particularly suited to reason with large amounts of instances. The second ingredient is a novel mapping language that is able to deal with the so-called impedance mismatch problem, i.e., the problem arising from the difference between the basic elements managed by the sources, namely data, and the elements managed by the ontology, namely objects. The third ingredient is the query answering method, that combines reasoning at the level of the ontology with specific mechanisms for both taking into account the mappings and efficiently accessing the data at the sources.


Data Integration: A Theoretical Perspective

Data integration is the problem of combining data residing at different sources, and providing the user with a unified view of these data. The problem of designing data integration systems is important in current real world applications, and is characterized by a number of issues that are interesting from a theoretical point of view. This document presents on overview of the material to be presented in a tutorial on data integration. The tutorial is focused on some of the theoretical issues that are relevant for data integration. Special attention will be devoted to the following aspects: modeling a data integration application, processing queries in data integration, dealing with inconsistent data sources, and reasoning on queries.


Self-Adaptive Systems in Organic Computing: Strategies for Self-Improvement

With the intensified use of intelligent things, the demands on the technological systems are increasing permanently. A possible approach to meet the continuously changing challenges is to shift the system integration from design to run-time by using adaptive systems. Diverse adaptivity properties – so-called self* properties – form the basis of these systems and one of the properties is self-improvement. It describes the ability of a system not only to adapt to a changing environment according to a predefined model, but also the capability to adapt the adaptation logic of the whole system. In this paper, a closer look is taken at the structure of self-adaptive systems. Additionally, the systems’ ability to improve themselves during run-time is described from the perspective of Organic Computing. Furthermore, four different strategies for self-improvement are presented, following the taxonomy of self-adaptation suggested by Christian Krupitzer et al.


Design and Evaluation of a High-Frequency LTCC Inductor Substrate for a Three-Dimensional Integrated DC/DC Converter

High operating frequency and integration technique are two main approaches to achieve high power density for the switching mode power supply. The emerging gallium nitride (GaN)-based power device enables a multimegahertz high-efficiency point-of-load (POL) converter with high current capability. The low-temperature cofire ceramic (LTCC)-based integration technique successfully extends the three-dimensional (3-D) integrated POL module from the low current level to the high current level (>10 A). This paper presents the low-profile LTCC inductor substrate design and evaluation for a multimegahertz 3-D integrated POL converter with large output current. The detailed study about the impact of frequency on the LTCC inductor shows that the high frequency not only shrinks the volume of the inductor, but also simplifies the inductor structure. The comparison between the LTCC inductor and the discrete inductor demonstrates that the LTCC inductor dramatically boosts the converter light-load efficiency due to its nonlinear inductance. Because of the low-profile design, the power density of the single-phase POL module with LTCC inductor achieves 1.1 kW/in3 at 5 MHz. The performance of the LTCC inductor can be further improved by the inverse coupling, which results in more than 40% core thickness and core loss reduction. Therefore, the power density of a two-phase integrated POL module is pushed to 1.5 kW/in3, which is around ten times of the power density of state-of-the-art industry products with the same current level.


Which Predictability Measures Affect Content Word Durations

The pronunciation of a word can vary widely, and many factors are known to affect this variation. This paper focuses on the role of predictability on word duration. Previous research has suggested that more frequent words are shorter, as are words which are more predictable from neighboring words. This research has tended to focus only on extremely high frequency function words; previous research on content words has not been able to examine natural speech and control for key confounding factors like accent and rate of speech. We examined 1401 content words from the Switchboard corpus and studied the role of word frequency, conditional and joint probabilities with neighboring words and a measure of word semantic association, Latent Semantic Analysis. Using multiple regression to control for confounding factors, we show that two predictability variables principally affect a word’s duration—word frequency, and the conditional probability of a word given the following word. Other predictability variables do not make an additional significant contribution. We discuss the implications for pronunciation modeling.


A GENETIC ALGORITHM FOR STRUCTURAL OPTIMIZATION OF STEEL TRUSS ROOFS

A common structural design problem is the weight minimization of structures which is formulated selecting a set of design variables that represent the structural and architectural configuration of the system. The structures are usually subject to stress and displacement constraints and the design variables can be continuous or discrete. In practice, it is often desirable to choose design variables (such as cross-sectional areas) from commercially available sizes. The use of a continuous optimization procedure – although usually more straightforward – will lead to non-available sizes and any attempt to substitute those values by the closest available commercial sizes can make the design unfeasible or unnecessarily heavier. In this paper a genetic algorithm is proposed to evolve the structural configuration for weight minimization of industrial buildings, with rectangular geometry projection, made up of uniform planar structures (steel truss roofs) along the longitudinal direction which are interconnected by purlins. The planar structures are trusses and their number, shape, and topology are allowed to change during the optimization process.


C-OPT: Coverage-Aware Trajectory Optimization Under Uncertainty

We introduce a new problem of continuous, coverage-aware trajectory optimization under localization and sensing uncertainty. In this problem, the goal is to plan a path from a start state to a goal state that maximizes the coverage of a user-specified region while minimizing the control costs of the robot and the probability of collision with the environment. We present a principled method for quantifying the coverage sensing uncertainty of the robot. We use this sensing uncertainty along with the uncertainty in robot localization to develop C-OPT, a coverage-optimization algorithm which optimizes trajectories over belief-space to find locally optimal coverage paths. We highlight the applicability of our approach in multiple simulated scenarios inspired by surveillance, UAV crop analysis, and search-and-rescue tasks. We also present a case study on a physical, differential-drive robot. We also provide quantitative and qualitative analysis of the paths generated by our approach.


Compact Ultrawideband MIMO Antenna With Half-Slot Structure

In this letter, a multiple-input–multiple-output (MIMO) antenna with very compact size of only <inline-formula> <tex-math notation="LaTeX">$\text{23}\times \text{18}\; \text{mm}^{2}$</tex-math></inline-formula> is proposed for ultrawideband (UWB) applications. The proposed MIMO antenna consists of two symmetrical half-slot antenna elements with coplanar waveguide-fed structures and a Y-shaped slot that is cut at the bottom center of the common ground plane. The slot efficiently prevents the current from directly flowing between two ports at low UWB frequency. For such a compact-size antenna, the ground plane works as a radiator as well as a reflector that reflects the radiation from radiators at high frequency. The measured impedance bandwidth for <inline-formula><tex-math notation="LaTeX"> $S_{11}, S_{22}$</tex-math></inline-formula> < −10 dB is from 3 to 12.4 GHz. The measured mutual coupling for <inline-formula><tex-math notation="LaTeX">$S_{12}, S_{21}$</tex-math></inline-formula> < −15 dB is from 3 to 4 GHz and for <inline-formula><tex-math notation="LaTeX">$S_{12}, S_{21}$ </tex-math></inline-formula> < −20 dB is from 4 to 12.4 GHz. The proposed antenna also contains relatively stable radiation patterns and gains. These performances indicate that the proposed antenna is one competitive candidate for UWB applications.


AUV SLAM using forward/downward looking cameras and artificial landmarks

Autonomous underwater vehicles (AUVs) are usually equipped with one or more optical cameras to obtain visual data of underwater environments. The camera can also be used to estimate the AUV's pose information, along with various navigation sensors such as inertial measurement unit (IMU), Doppler velocity log (DVL), depth sensor, and so on. In this paper, we propose a vision-based simultaneous localization and mapping (SLAM) of AUVs, where underwater artificial landmarks are used to help visual sensing of forward and downward looking cameras. Three types of landmarks are introduced and their detection algorithms are organized in a framework of conventional extended Kalman filter (EKF) SLAM to estimate both robot and landmark states. The proposed method is validated by an experiment performed in a engineering basin. Since DVL suffers from noises in a real ocean environment, we generated synthetic noisy data based on the real sensor data. With this data we verify that the proposed SLAM approach can recover from the erroneous dead reckoning position.


A 1.8V CMOS chopper four-quadrant analog multiplier, intending to serve as an autonomous IC block for low-frequency signal processing, is presented. Particular emphasis is laid upon achieving low output noise by means of chopper stabilization, while the multiplier's operation is based on the MOS Translinear Principle. The proposed design has been implemented and simulated in TSMC 0.18 µm CMOS process.


A broadband compact low-loss 4×4 Butler Matrix in CMOS with stacked transformer based quadrature couplers

This paper presents an ultra-broadband ultracompact Butler Matrix design scheme. The design employs stacked transformer based couplers and lumped LC π-network phase shifters for substantial size reduction. As a proof-of-concept design, a 4×4 Butler Matrix is implemented in a standard 130nm bulk CMOS process at a center frequency of 2.0 GHz. Compared with reported fully integrated 2.0 GHz 4×4 Butler Matrix designs in CMOS, the proposed design achieves the lowest insertion loss of 1.10dB, the smallest amplitude mismatch of 0.3 dB, the largest fractional bandwidth of 34.6%, and the smallest chip core area of 0.635×1.122 mm2. Based on the measured S-parameters, the four concurrent electrical array patterns of the Butler Matrix achieve array peak-to-null ratio (PNR) of 29.5 dB at 2.0 GHz and better than 15.0 dB between 1.55 GHz and 2.50 GHz.


A high accuracy solver for RTE in underwater optical communication path loss prediction

In this paper, we present a new improved numerical framework to evaluate the time-dependent radiative transfer equation (RTE) for underwater optical wireless communication (UOWC) systems. The RTE predicts the optical path-loss of light in an underwater channel, as a function of the inherent optical properties (IOPs) related to the water type, namely the absorption and scattering coefficients as well as the phase scattering function (PSF). We reach the simulation performance based on an improvement of the finite difference scheme proposed in [1] as well as an enhancement of the quadrature method aiming to calculate the integral term of the RTE [2]. Additionally, we evaluate the received power at the receiver plane in three dimensions by considering a given receiver aperture and a field of view (FOV). Finally, we evaluate the UOWC system's bit error rate performance metric as a function of the propagation distance, and time.


Interlocking obfuscation for anti-tamper hardware

Tampering and Reverse Engineering of a chip to extract the hardware Intellectual Property (IP) core or to inject malicious alterations is a major concern. Digital systems susceptible to tampering are of immense concern to defense organizations. First, offshore chip manufacturing allows the design secrets of the IP cores to be transparent to the foundry and other entities along the production chain. Second, small malicious modifications to the design may not be detectable after fabrication without anti-tamper mechanisms. Some techniques have been developed in the past to improve the defense against such attacks but they tend to fall prey to the increasing power of the attacker. We present a new way to protect against tampering by a clever obfuscation of the design, which can be unlocked with a specific, dynamic path traversal. Hence, the functional mode of the controller is hidden with the help of obfuscated states, and the functional mode is made operational only on the formation of a specific interlocked Code-Word during state transition. No comparator is needed as the obfuscation is embedded within the transition function of the state machine itself. A side benefit is that any small alteration will be magnified via the obfuscated design. In other words, an alteration to the design will manifest itself as a large difference in the circuit's functionality. Experimental results on an Advanced Encryption Standard (AES) circuit from the open-source IP-cores suite suggest that the proposed method provides better active defense mechanisms against attacks with nominal (7.8%) area overhead.


A printed antenna array fed by balanced Schiffman shifter used for UWB location system

A double-sided printed bow-tie antenna array fed by balanced Schiffman phase shifter, which used as a reader antenna in ultra-wideband (UWB) location system, is proposed in this paper. The presented antenna has a impedance bandwidth of 3.4-4.4 GHz and a high gain of more than 5dB within the whole bandwidth. Good omnidirectional radiation pattern is obtained in the plane of θ = 15°. Good simulation results are achieved by HFSS.


Building event-centric knowledge graphs from news

Knowledge graphs have gained increasing popularity in the past couple of years, thanks to their adoption in everyday search engines. Typically, they consist of fairly static and encyclopedic facts about persons and organizations – e.g. a celebrity’s birth date, occupation and family members – obtained from large repositories such as Freebase or Wikipedia. In this paper, we present a method and tools to automatically build knowledge graphs from news articles. As news articles describe changes in the world through the events they report, we present an approach to create Event-Centric Knowledge Graphs (ECKGs) using state-of-the-art natural language processing and semantic web techniques. Such ECKGs capture long-term developments and histories on hundreds of thousands of entities and are complementary to the static encyclopedic information in traditional knowledge graphs. We describe our event-centric representation schema, the challenges in extracting event information from news, our open source pipeline, and the knowledge graphs we have extracted from four different news corpora: general news (Wikinews), the FIFA world cup, the Global Automotive Industry, and Airbus A380 airplanes. Furthermore, we present an assessment on the accuracy of the pipeline in extracting the triples of the knowledge graphs. Moreover, through an event-centered browser and visualization tool we show how approaching information from news in an event-centric manner can increase the user’s understanding of the domain, facilitates the reconstruction of news story lines, and enable to perform exploratory investigation of news hidden facts. © 2016 Elsevier B.V. All rights reserved.


Information Bottleneck Inspired Method For Chat Text Segmentation

We present a novel technique for segmenting chat conversations using the information bottleneck method (Tishby et al., 2000), augmented with sequential continuity constraints. Furthermore, we utilize critical non-textual clues such as time between two consecutive posts and people mentions within the posts. To ascertain the effectiveness of the proposed method, we have collected data from public Slack conversations and Fresco, a proprietary platform deployed inside our organization. Experiments demonstrate that the proposed method yields an absolute (relative) improvement of as high as 3.23% (11.25%). To facilitate future research, we are releasing manual annotations for segmentation on public Slack conversations.


Neurofeedback treatment for attention-deficit/hyperactivity disorder in children: a comparison with methylphenidate.

Clinical trials have suggested that neurofeedback may be efficient in treating attention-deficit/hyperactivity disorder (ADHD). We compared the effects of a 3-month electroencephalographic feedback program providing reinforcement contingent on the production of cortical sensorimotor rhythm (12-15 Hz) and betal activity (15-18 Hz) with stimulant medication. Participants were N = 34 children aged 8-12 years, 22 of which were assigned to the neurofeedback group and 12 to the methylphenidate group according to their parents' preference. Both neurofeedback and methylphenidate were associated with improvements on all subscales of the Test of Variables of Attention, and on the speed and accuracy measures of the d2 Attention Endurance Test. Furthermore, behaviors related to the disorder were rated as significantly reduced in both groups by both teachers and parents on the IOWA-Conners Behavior Rating Scale. These findings suggest that neurofeedback was efficient in improving some of the behavioral concomitants of ADHD in children whose parents favored a nonpharmacological treatment.


An ultra-wideband absorber based on multiple resonators in 3-D frequency-selective structure

An ultra-wideband absorber based on employing multiple resonators in the unit cell of a 3-D frequency-selective structure is proposed. The original design consists of two-dimensional periodic array of three-dimensional unit cells and lumped components to provide matching with free space and absorb the incident electromagnetic wave. By introducing one more resonator in the unit cell, an ultra-wideband absorber can be constructed. It has a fractional bandwidth of 155.7 % for −10 dB of reflection coefficient under the normal incidence with an absorber thickness of 0.12 λ0 at the lowest absorption frequency. This absorber works for TE polarization at which two quasi-TEM modes are excited in the air and substrate regions. The proposed absorber shows a stable performance under oblique angles of incidence.


Electrical and thermal processes of HEV induction machines taking into account stator winding form

Internal combustion engine start processes in Hybrid Electric Vehicles (HEVs) are accompanied by large currents in the windings of electrical machines. It can lead to insulation overheating and fault operation mode. Induction squirrel-cage machine is one of the best AC machines for HEVs. The high efficiency of HEV induction machine with compact stator winding form is proposed. Its stator electrical and thermal processes are considered. Irregular cross-section of stator winding leads to irregular current density in particular winding parts. To decrease temperature gradients within induction machine and improve heat transfer, air gap between overhang parts and stator should be increased. Numerical and computer models for researching are based on finite element method.


TRESNEI, a Matlab trust-region solver for systems of nonlinear equalities and inequalities

The Matlab implementation of a trust-region Gauss-Newton method for boundconstrained nonlinear least-squares problems is presented. The solver, called TRESNEI, is adequate for zero and small-residual problems and handles the solution of nonlinear systems of equalities and inequalities. The structure and the usage of the solver are described and an extensive numerical comparison with functions from the Matlab Optimization Toolbox is carried out.


A wearable heart rate belt for ambulant ECG monitoring

Long-term ECG monitoring is desirable in many daily healthcare situations where a wearable device that can continuously record ECG signals is needed. In this work, we proposed a wearable heart rate belt for ambulant ECG monitoring which can be comfortably worn on the chest or the waist. Active textile electrodes were designed for ECG recording. And a battery powered circuit board was developed consisting of ECG signal conditioning circuits, a 3-axis accelerator for body motion detection, a 12-bit AD converter, a DSP for signal processing and a SD card for data storage. The system also includes a wireless communication module that can transmit heart rate data to a sport watch for displaying. Experiments were carried out which shows that the proposed system is unobtrusive and can be comfortably worn by the user during daily activities. When wearing on the waist, ECG signals with reasonably good quality were acquired in rest and walking situations. The proposed system shows promise for long-term ambulant ECG monitoring.


Effects of elastic therapeutic taping on motor function in children with motor impairments: a systematic review.

BACKGROUND
The elastic therapeutic taping has been considered a promising resource for disabled children.

OBJECTIVE
To systematically review the evidence of the effects of elastic therapeutic taping on motor function in children with motor impairments.

METHOD
Three independent evaluators conducted searches in electronic databases (MEDLINE/PubMed, Scopus, LILACS, BIREME/BVS, Science Direct, SciELO, and PEDro). Clinical studies design, published until 2016, involving elastic therapeutic taping and children aged 0-12 years with motor impairments were included. The variables considered were the methodological aspects (study design, participants, outcome measurements, and experimental conditions); results presented in the studies, and also the methodological quality of studies.

RESULTS
Final selection was composed by 12 manuscripts (five randomized controlled trials), published in the last 10 years. Among them, cerebral palsy (CP) was the most recurrent disorder (n = 7), followed by congenital muscular torticollis (n = 2) and brachial plexus palsy (n = 2). Positive results were associated with taping application: improvement in the upper limb function, gross motor skills, postural control, muscular balance, and performance in the dynamics functional and daily activities.

LIMITATIONS
Lower quality of the studies, clinical and population heterogeneity existed across studies.

CONCLUSIONS
The elastic therapeutic taping has been shown to be a promising adjunct resource to the conventional rehabilitation in children with motor impairments. However, high methodological studies about its efficacy in this population are already scarce. Implications for Rehabilitation Elastic therapeutic taping has been shown to be a promising adjunct resource to the conventional rehabilitation in disabled children. Clinical trials have indicated improvement in the postural control and functional activities with both, upper and lower limbs, and increase in the functional independency resulting from the taping use. Randomized control trials and well-established protocols are needed to increase the confidence in applying elastic therapeutic taping to specific clinical conditions.


Novelty detection for time series data analysis in water distribution systems using support vector machines

The sampling frequency and quantity of time series data collected from water distribution systems has been increasing in recent years, giving rise to the potential for improving system knowledge if suitable automated techniques can be applied, in particular, machine learning. Novelty (or anomaly) detection refers to the automatic identification of novel or abnormal patterns embedded in large amounts of ‘‘normal’’ data. When dealing with time series data (transformed into vectors), this means abnormal events embedded amongst many normal time series points. The support vector machine is a data-driven statistical technique that has been developed as a tool for classification and regression. The key features include statistical robustness with respect to non-Gaussian errors and outliers, the selection of the decision boundary in a principled way, and the introduction of nonlinearity in the feature space without explicitly requiring a nonlinear algorithm by means of kernel functions. In this research, support vector regression is used as a learning method for anomaly detection from water flow and pressure time series data. No use is made of past event histories collected through other information sources. The support vector regression methodology, whose robustness derives from the training error function, is applied


Domain Adaptation From Multiple Sources: A Domain-Dependent Regularization Approach

In this paper, we propose a new framework called domain adaptation machine (DAM) for the multiple source domain adaption problem. Under this framework, we learn a robust decision function (referred to as target classifier) for label prediction of instances from the target domain by leveraging a set of base classifiers which are prelearned by using labeled instances either from the source domains or from the source domains and the target domain. With the base classifiers, we propose a new domain-dependent regularizer based on smoothness assumption, which enforces that the target classifier shares similar decision values with the relevant base classifiers on the unlabeled instances from the target domain. This newly proposed regularizer can be readily incorporated into many kernel methods (e.g., support vector machines (SVM), support vector regression, and least-squares SVM (LS-SVM)). For domain adaptation, we also develop two new domain adaptation methods referred to as FastDAM and UniverDAM. In FastDAM, we introduce our proposed domain-dependent regularizer into LS-SVM as well as employ a sparsity regularizer to learn a sparse target classifier with the support vectors only from the target domain, which thus makes the label prediction on any test instance very fast. In UniverDAM, we additionally make use of the instances from the source domains as Universum to further enhance the generalization ability of the target classifier. We evaluate our two methods on the challenging TRECIVD 2005 dataset for the large-scale video concept detection task as well as on the 20 newsgroups and email spam datasets for document retrieval. Comprehensive experiments demonstrate that FastDAM and UniverDAM outperform the existing multiple source domain adaptation methods for the two applications.


Adapting Visual Category Models to New Domains

Domain adaptation is an important emerging topic in computer vision. In this paper, we present one of the first studies of domain shift in the context of object recognition. We introduce a method that adapts object models acquired in a particular visual domain to new imaging conditions by learning a transformation that minimizes the effect of domain-induced changes in the feature distribution. The transformation is learned in a supervised manner and can be applied to categories for which there are no labeled examples in the new domain. While we focus our evaluation on object recognition tasks, the transform-based adaptation technique we develop is general and could be applied to non-image data. Another contribution is a new multi-domain object database, freely available for download. We experimentally demonstrate the ability of our method to improve recognition on categories with few or no target domain labels and moderate to large changes in the imaging conditions.


Trends in extreme learning machines: A review

Extreme learning machine (ELM) has gained increasing interest from various research fields recently. In this review, we aim to report the current state of the theoretical research and practical advances on this subject. We first give an overview of ELM from the theoretical perspective, including the interpolation theory, universal approximation capability, and generalization ability. Then we focus on the various improvements made to ELM which further improve its stability, sparsity and accuracy under general or specific conditions. Apart from classification and regression, ELM has recently been extended for clustering, feature selection, representational learning and many other learning tasks. These newly emerging algorithms greatly expand the applications of ELM. From implementation aspect, hardware implementation and parallel computation techniques have substantially sped up the training of ELM, making it feasible for big data processing and real-time reasoning. Due to its remarkable efficiency, simplicity, and impressive generalization performance, ELM have been applied in a variety of domains, such as biomedical engineering, computer vision, system identification, and control and robotics. In this review, we try to provide a comprehensive view of these advances in ELM together with its future perspectives.


Semi-Supervised and Unsupervised Extreme Learning Machines

Extreme learning machines (ELMs) have proven to be efficient and effective learning mechanisms for pattern classification and regression. However, ELMs are primarily applied to supervised learning problems. Only a few existing research papers have used ELMs to explore unlabeled data. In this paper, we extend ELMs for both semi-supervised and unsupervised tasks based on the manifold regularization, thus greatly expanding the applicability of ELMs. The key advantages of the proposed algorithms are as follows: 1) both the semi-supervised ELM (SS-ELM) and the unsupervised ELM (US-ELM) exhibit learning capability and computational efficiency of ELMs; 2) both algorithms naturally handle multiclass classification or multicluster clustering; and 3) both algorithms are inductive and can handle unseen data at test time directly. Moreover, it is shown in this paper that all the supervised, semi-supervised, and unsupervised ELMs can actually be put into a unified framework. This provides new perspectives for understanding the mechanism of random feature mapping, which is the key concept in ELM theory. Empirical study on a wide range of data sets demonstrates that the proposed algorithms are competitive with the state-of-the-art semi-supervised or unsupervised learning algorithms in terms of accuracy and efficiency.


Faster reinforcement learning after pretraining deep networks to predict state dynamics

Deep learning algorithms have recently appeared that pretrain hidden layers of neural networks in unsupervised ways, leading to state-of-the-art performance on large classification problems. These methods can also pretrain networks used for reinforcement learning. However, this ignores the additional information that exists in a reinforcement learning paradigm via the ongoing sequence of state, action, new state tuples. This paper demonstrates that learning a predictive model of state dynamics can result in a pretrained hidden layer structure that reduces the time needed to solve reinforcement learning problems.


Close Yet Distinctive Domain Adaptation

Domain adaptation is transfer learning which aims to generalize a learning model across training and testing data with different distributions. Most previous research tackle this problem in seeking a shared feature representation between source and target domains while reducing the mismatch of their data distributions. In this paper, we propose a close yet discriminative domain adaptation method, namely CDDA, which generates a latent feature representation with two interesting properties. First, the discrepancy between the source and target domain, measured in terms of both marginal and conditional probability distribution via Maximum Mean Discrepancy is minimized so as to attract two domains close to each other. More importantly, we also design a repulsive force term, which maximizes the distances between each label dependent sub-domain to all others so as to drag different class dependent sub-domains far away from each other and thereby increase the discriminative power of the adapted domain. Moreover, given the fact that the underlying data manifold could have complex geometric structure, we further propose the constraints of label smoothness and geometric structure consistency for label propagation. Extensive experiments are conducted on 36 cross-domain image classification tasks over four public datasets. The Comprehensive results show that the proposed method consistently outperforms the state-of-the-art methods with significant margins. ∗These first two authors contributed equally.


Alterations of the human gut microbiome in liver cirrhosis

Liver cirrhosis occurs as a consequence of many chronic liver diseases that are prevalent worldwide. Here we characterize the gut microbiome in liver cirrhosis by comparing 98 patients and 83 healthy control individuals. We build a reference gene set for the cohort containing 2.69 million genes, 36.1% of which are novel. Quantitative metagenomics reveals 75,245 genes that differ in abundance between the patients and healthy individuals (false discovery rate < 0.0001) and can be grouped into 66 clusters representing cognate bacterial species; 28 are enriched in patients and 38 in control individuals. Most (54%) of the patient-enriched, taxonomically assigned species are of buccal origin, suggesting an invasion of the gut from the mouth in liver cirrhosis. Biomarkers specific to liver cirrhosis at gene and function levels are revealed by a comparison with those for type 2 diabetes and inflammatory bowel disease. On the basis of only 15 biomarkers, a highly accurate patient discrimination index is created and validated on an independent cohort. Thus microbiota-targeted biomarkers may be a powerful tool for diagnosis of different diseases.


IOT Based Air And Sound Pollution Monitoring System

The growing air and sound pollution is one of the serious issues these days. This large amount of increasing pollution has made human life prone to large number of diseases. Therefore, it has now become necessary to control the pollution to ensure healthy livelihood and better future. The Air and Sound Pollution Monitoring device can be accessed by the authorities and the common people belonging to the area. The device will be installed through a mobile application which will show the live updates of the pollution level of the area. This device is also capable of detecting the fire in its area and notify the same to the fire brigade authorities so that they could take necessary actions accordingly, and also the mobile applications will be installed in the fire brigades itself so that if a fire is taking place nearby, it could be controlled in time to reduce loss of people and property. This system works on the methods of IOT which is a rising technology based on the fusion of electronics and computer science. The embedded sensors in the system help to detect major air polluting gases such as CO2, SO2 and CO and level of sound pollution. The concept of IOT helps to access data from remote locations and save it in database so that we don’t need to actually be present in that area.


High-Quality Real-Time Video Stabilization Using Trajectory Smoothing and Mesh-Based Warping

Some state-of-the-art video stabilization methods can achieve quite good visual effect, but they always cost a lot of time. On the other hand, current real-time video stabilization methods cannot generate satisfactory results. In this paper, we propose a novel trajectory-based video stabilization method which can generate high-quality results in real time. Our method runs very fast, because many techniques are proposed for acceleration. In the trajectory smoothing step, trajectories are extracted, pre-processed, and smoothed. A video splitting algorithm is proposed for pre-processing, and binomial filtering is used for smoothing. Both of them are simple and fast. In the frame warping step, we calculate a spatially varying warp that is directed by a grid mesh for each frame. Instead of solving time consuming global optimization problems, the transformation matrix of each grid is calculated using nearby trajectories in our method, leading to very high speed. We implement our method and run it on a variety of videos. Experiments show that while the stabilization effect is comparable with state-of-the-art methods, our algorithm can run in real time.


Fusion of facial expressions and EEG for implicit affective tagging

The explosion of user-generated, untagged multimedia data in recent years, generates a strong need for efficient search and retrieval of this data. The predominant method for content-based tagging is through slow, labour-intensive manual annotation. Consequently, automatic tagging is currently a subject of intensive research. However, it is clear that the process will not be fully automated in the foreseeable future. We propose to involve the user and investigate methods for implicit tagging, wherein users’ responses to the interaction with the multimedia content are analysed in order to generate descriptive tags. Here, we present a multi-modal approach that analyses both facial expressions and Electroencephalography(EEG) signals for the generation of affective tags. We perform classification and regression in the valence-arousal space and present results for both feature-level and decision-level fusion. We demonstrate improvement in the results when using both modalities, suggesting the modalities contain complementary information.


Three-dimensional bin packing problem with variable bin height

0377-2217/$ see front matter 2009 Elsevier B.V. A doi:10.1016/j.ejor.2009.05.040 * Corresponding author. Address: Institute for Logi fax: +61 3 9689 4859. E-mail addresses: wuyong@pmail.ntu.edu.sg (Y. W This paper studies a variant of the three-dimensional bin packing problem (3D-BPP), where the bin height can be adjusted to the cartons it packs. The bins and cartons to be packed are assumed rectangular in shape. The cartons are allowed to be rotated into any one of the six positions that keep the carton edges parallel to the bin edges. This greatly increases the difficulty of finding a good solution since the search space expands significantly comparing to the 3D-BPP where the cartons have fixed orientations. A mathematical (mixed integer programming) approach is modified based on [Chen, C. S., Lee, S. M., Shen, Q. S., 1995. An analytical model for the container loading problem. European Journal of Operational Research 80 (1), 68–76] and numerical experiments indicate that the mathematical approach is not suitable for the variable bin height 3D-BPP. A special bin packing algorithm based on packing index is designed to utilize the special problem feature and is used as a building block for a genetic algorithm designed for the 3DBPP. The paper also investigates the situation where more than one type of bin are used and provides a heuristic for packing a batch of cartons using the genetic algorithm. Numerical experiments show that our proposed method yields quick and satisfactory results when benchmarked against the actual packing practice and the MIP model with the latest version of CPLEX. 2009 Elsevier B.V. All rights reserved.


The Role of Adult Attachment Styles in Psychopathology and Psychotherapy Outcomes

Attachment theory provides a model for understanding how the attachment styles formed in infancy systematically affect subsequent psychological functioning across the life span. Attachment styles provide the cognitive schemas, or working models, through which individuals perceive and relate to their worlds. In turn, these schemas predispose the development of psychopathologies and influence outcomes when people undergo psychotherapy. After reviewing recent empirical findings, the authors conclude that an understanding of attachment theory facilitates the conceptualization of clients’ problems and the selection of appropriate interventions. Accordingly, attachment styles should be assessed as a standard part of treatment planning. Furthermore, the authors propose that attachment styles should be assessed as individual difference variables in psychotherapy outcome research because adult attachment styles dictate how people perceive and respond to their environments and, therefore, how clients respond differentially to various treatments.


Self-similarity of complex networks

Complex networks have been studied extensively owing to their relevance to many real systems such as the world-wide web, the Internet, energy landscapes and biological and social networks. A large number of real networks are referred to as ‘scale-free’ because they show a power-law distribution of the number of links per node. However, it is widely believed that complex networks are not invariant or self-similar under a length-scale transformation. This conclusion originates from the ‘small-world’ property of these networks, which implies that the number of nodes increases exponentially with the ‘diameter’ of the network, rather than the power-law relation expected for a self-similar structure. Here we analyse a variety of real complex networks and find that, on the contrary, they consist of self-repeating patterns on all length scales. This result is achieved by the application of a renormalization procedure that coarse-grains the system into boxes containing nodes within a given ‘size’. We identify a power-law relation between the number of boxes needed to cover the network and the size of the box, defining a finite self-similar exponent. These fundamental properties help to explain the scale-free nature of complex networks and suggest a common self-organization dynamics.


Legal Compliance by Design (LCbD) and through Design (LCtD): Preliminary Survey

The purpose of this paper is twofold: (i) carrying out a preliminary survey of the literature and research projects on Compliance by Design (CbD); and (ii) clarifying the double process of (a) extending business managing techniques to other regulatory fields, and (b) converging trends in legal theory, legal technology and Artificial Intelligence. The paper highlights the connections and differences we found across different domains and proposals. We distinguish three different policydriven types of CbD: (i) business, (ii) regulatory, (iii) and legal. The recent deployment of ethical views, and the implementation of general principles of privacy and data protection lead to the conclusion that, in order to appropriately define legal compliance, Compliance through Design (CtD) should be differentiated from CbD.


Microformats: a pragmatic path to the semantic web

Microformats are a clever adaptation of semantic XHTML that makes it easier to publish, index, and extract semi-structured information such as tags, calendar entries, contact information, and reviews on the Web. This makes it a pragmatic path towards achieving the vision set forth for the Semantic Web.Even though it sidesteps the existing "technology stack" of RDF, ontologies, and Artificial Intelligence-inspired processing tools, various microformats have emerged that parallel the goals of several well-known Semantic Web projects. This poster compares their prospects to the Semantic Web according to Rogers' Diffusion of Innovation model.


Efficient Name Disambiguation for Large-Scale Databases

Name disambiguation can occur when one is seeking a list of publications of an author who has used different name variations and when there are multiple other authors with the same name. We present an efficient integrative framework for solving the name disambiguation problem: a blocking method retrieves candidate classes of authors with similar names and a clustering method, DBSCAN, clusters papers by author. The distance metric between papers used in DBSCAN is calculated by an online active selection support vector machine algorithm (LASVM), yielding a simpler model, lower test errors and faster prediction time than a standard SVM. We prove that by recasting transitivity as density reachability in DBSCAN, transitivity is guaranteed for core points. For evaluation, we manually annotated 3,355 papers yielding 490 authors and achieved 90.6% pairwise-F1. For scalability, authors in the entire CiteSeer dataset, over 700,000 papers, were readily disambiguated.


Automatic Segmentation of Liver Tumor in CT Images with Deep Convolutional Neural Networks

Liver tumors segmentation from computed tomography (CT) images is an essential task for diagnosis and treatments of liver cancer. However, it is difficult owing to the variability of appearances, fuzzy boundaries, heterogeneous densities, shapes and sizes of lesions. In this paper, an automatic method based on convolutional neural networks (CNNs) is presented to segment lesions from CT images. The CNNs is one of deep learning models with some convolutional filters which can learn hierarchical features from data. We compared the CNNs model to popular machine learning algorithms: AdaBoost, Random Forests (RF), and support vector machine (SVM). These classifiers were trained by handcrafted features containing mean, variance, and contextual features. Experimental evaluation was performed on 30 portal phase enhanced CT images using leave-one-out cross validation. The average Dice Similarity Coefficient (DSC), precision, and recall achieved of 80.06% ± 1.63%, 82.67% ± 1.43%, and 84.34% ± 1.61%, respectively. The results show that the CNNs method has better performance than other methods and is promising in liver tumor segmentation.


Comparison of Nanostring nCounter® Data on FFPE Colon Cancer Samples and Affymetrix Microarray Data on Matched Frozen Tissues

The prognosis of colorectal cancer (CRC) stage II and III patients remains a challenge due to the difficulties of finding robust biomarkers suitable for testing clinical samples. The majority of published gene signatures of CRC have been generated on fresh frozen colorectal tissues. Because collection of frozen tissue is not practical for routine surgical pathology practice, a clinical test that improves prognostic capabilities beyond standard pathological staging of colon cancer will need to be designed for formalin-fixed paraffin-embedded (FFPE) tissues. The NanoString nCounter® platform is a gene expression analysis tool developed for use with FFPE-derived samples. We designed a custom nCounter® codeset based on elements from multiple published fresh frozen tissue microarray-based prognostic gene signatures for colon cancer, and we used this platform to systematically compare gene expression data from FFPE with matched microarray array data from frozen tissues. Our results show moderate correlation of gene expression between two platforms and discovery of a small subset of genes as candidate biomarkers for colon cancer prognosis that are detectable and quantifiable in FFPE tissue sections.


A Generic Layered Architecture for Context Aware Applications

As pervasive computing is at its preliminary stage a number of computing solutions were proposed and more are still under experimentation. In this paper a four layered generic architecture is proposed with a recommended components so as to support context awareness for pervasive applications. Detail of each layer is described sufficiently to insight the process of context generation from low level contextual data up to high level context reporting scheme in a given pervasive environment. The implementation section of this article describes how the context reasoning component employee different level of reasoning techniques such as knowledge acquisition, context based rule execution and the application of ontology in pervasive computing. © 2014 The Authors. Published by Elsevier B.V. Peer-review under responsibility of the Program Chairs of EICM-2014.


CTR prediction for contextual advertising: learning-to-rank approach

Contextual advertising is a textual advertising displayed within the content of a generic web page. Predicting the probability that users will click on ads plays a crucial role in contextual advertising because it influences ranking, filtering, placement, and pricing of ads. In this paper, we introduce a click-through rate prediction algorithm based on the learning-to-rank approach. Focusing on the fact that some of the past click data are noisy and ads are ranked as lists, we build a ranking model by using partial click logs and then a regression model on it. We evaluated this approach offline on a data set based on logs from an ad network. Our method is observed to achieve better results than other baselines in our three metrics.


Design of Novel Reconfigurable Reflectarrays With Single-Bit Phase Resolution for Ku-Band Satellite Antenna Applications

Reconfigurable reflectarray antennas operating in Ku-band are presented in this paper. First, a novel multilayer unit-cell based on polarization turning concept is proposed to achieve the single-bit phase shift required for reconfigurable reflectarray applications. The principle of the unit-cell is discussed using the current model and the space match condition, along with simulations to corroborate the design and performance criteria. Then, an offset-fed configuration is developed to verify performance of the unit-cell in antenna application, and its polarization transformation property is elaborated. Finally, an offset-fed reflectarray with 10 × 10 elements is developed and fabricated. The dual-polarized antenna utilizes the control code matrices to accomplish a wide angle beam-scanning. A full-wave analysis is applied to the reflectarray, and detailed results are presented and discussed. This electronically steerable reflectarray antenna has significant potential for satellite applications, due to its wide operating band, simple control and beam-scanning capability.


An agile process model for product derivation in software product line engineering

Software Product Lines (SPL) and Agile practices have emerged as new paradigms for developing software. Both approaches share common goals; such as improving productivity, reducing time to market, decreasing development costs and increasing customer satisfaction. These common goals provide the motivation for this research. We believe that integrating Agile practices into SPL can bring a balance between agility and formalism. However, there has been little research on such integration. We have been researching the potential of integrating Agile approaches in one of the key SPL process areas, product derivation. In this paper we present an outline of our Agile process model for product derivation that was developed through industry based case study research.


A Proximity Authentication System for Smartphones

Authenticating whether two smartphones are in close proximity is important in smartphone security. For example, the authentication result can be used to pair two devices and construct a secure communication channel between them. Many existing proximity authentication systems rely on short range networks-the communication is usually restricted in short range networks. However, this approach is inadequate when we want to verify whether the communication distance is within a few centimeters, i.e. near field. To address this challenge, many other techniques construct systems based on the near field communication (NFC) system. Unfortunately, only a small portion of smart devices in the current market are equipped with NFC chips. The purpose of this paper is to provide a close proximity authentication system which does not depend on NFC chips. We devise a system to achieve close proximity authentication by using correlated finger movements on the two smartphones. Human input usually contains errors and is of low entropy, which affects the usability and security of our system. We solve these issues in an efficient way, considering the limited computational resources on smart devices. Our system does not need any prior secret information shared between the two devices, and generates the same high-entropy cryptographic key for both devices in a successful authentication. The efficiency of the system is validated by evaluations on Motorola Droid smartphones.


Survey on Computer Vision for UAVs: Current Developments and Trends

During last decade the scientific research on Unmanned Aerial Vehicless (UAVs) increased spectacularly and led to the design of multiple types of aerial platforms. The major challenge today is the development of autonomously operating aerial agents capable of completing missions independently of human interaction. To this extent, visual sensing techniques have been integrated in the control pipeline of the UAVs in order to enhance their navigation and guidance skills. The aim of this article is to present a comprehensive literature review on vision based applications for UAVs focusing mainly on current developments and trends. These applications are sorted in different categories according to the research topics among various research groups. More specifically vision based position-attitude control, pose estimation and mapping, obstacle detection as well as target tracking are the identified components towards autonomous agents. Aerial platforms could reach greater level of autonomy by integrating all these technologies onboard. Additionally, throughout this article the concept of fusion multiple sensors is highlighted, while an overview on the challenges C. Kanellakis ( ) · G. Nikolakopoulos Luleå University of Technology, Luleå, Sweden e-mail: christoforos.kanellakis@ltu.se G. Nikolakopoulos e-mail: geonik@ltu.se addressed and future trends in autonomous agent development will be also provided.


Persistent Point Feature Histograms for 3 D Point Clouds

This paper proposes a novel way of characterizing the local geometry of 3D points, using persistent feature histograms. The relationships between the neighbors of a point are analyzed and the resulted values are stored in a 16-bin histogram. The histograms are pose and point cloud density invariant and cope well with noisy datasets. We show that geometric primitives have unique signatures in this feature space, preserved even in the presence of additive noise. To extract a compact subset of points which characterizes a point cloud dataset, we perform an in-depth analysis of all point feature histograms using different distance metrics. Preliminary results show that point clouds can be roughly segmented based on the uniqueness of geometric primitives feature histograms. We validate our approach on datasets acquired from laser sensors in indoor (kitchen) environments.


Towards a benchmark for RGB-D SLAM evaluation

We provide a large dataset containing RGB-D image sequences and the ground-truth camera trajectories with the goal to establish a benchmark for the evaluation of visual SLAM systems. Our dataset contains the color and depth images of a Microsoft Kinect sensor and the groundtruth trajectory of camera poses. The data was recorded at full frame rate (30 Hz) and sensor resolution (640x480). The ground-truth trajectory was obtained from a high-accuracy motion-capture system with eight high-speed tracking cameras (100 Hz). Further, we provide the accelerometer data from the Kinect. Finally, we propose an evaluation criterion for measuring the quality of the estimated camera trajectory of visual SLAM systems.


Surface feature detection and description with applications to mesh matching

In this paper we revisit local feature detectors/descriptors developed for 2D images and extend them to the more general framework of scalar fields defined on 2D manifolds. We provide methods and tools to detect and describe features on surfaces equiped with scalar functions, such as photometric information. This is motivated by the growing need for matching and tracking photometric surfaces over temporal sequences, due to recent advancements in multiple camera 3D reconstruction. We propose a 3D feature detector (MeshDOG) and a 3D feature descriptor (MeshHOG) for uniformly triangulated meshes, invariant to changes in rotation, translation, and scale. The descriptor is able to capture the local geometric and/or photometric properties in a succinct fashion. Moreover, the method is defined generically for any scalar function, e.g., local curvature. Results with matching rigid and non-rigid meshes demonstrate the interest of the proposed framework.


Fast Point Feature Histograms (FPFH) for 3D registration

In our recent work [1], [2], we proposed Point Feature Histograms (PFH) as robust multi-dimensional features which describe the local geometry around a point p for 3D point cloud datasets. In this paper, we modify their mathematical expressions and perform a rigorous analysis on their robustness and complexity for the problem of 3D registration for overlapping point cloud views. More concretely, we present several optimizations that reduce their computation times drastically by either caching previously computed values or by revising their theoretical formulations. The latter results in a new type of local features, called Fast Point Feature Histograms (FPFH), which retain most of the discriminative power of the PFH. Moreover, we propose an algorithm for the online computation of FPFH features for realtime applications. To validate our results we demonstrate their efficiency for 3D registration and propose a new sample consensus based method for bringing two datasets into the convergence basin of a local non-linear optimizer: SAC-IA (SAmple Consensus Initial Alignment).


GENERATIVE ADVERSARIAL NETWORK BASED ACOUSTIC SCENE TRAINING SET AUGMENTATION AND SELECTION USING SVM HYPERPLANE

Although it is typically expected that using a large amount of labeled training data would lead to improve performance in deep learning, it is generally difficult to obtain such DataBase (DB). In competitions such as the Detection and Classification of Acoustic Scenes and Events (DCASE) challenge Task 1, participants are constrained to use a relatively small DB as a rule, which is similar to the aforementioned issue. To improve Acoustic Scene Classification (ASC) performance without employing additional DB, this paper proposes to use Generative Adversarial Networks (GAN) based method for generating additional training DB. Since it is not clear whether every sample generated by GAN would have equal impact in classification performance, this paper proposes to use Support Vector Machine (SVM) hyper plane for each class as reference for selecting samples, which have class discriminative information. Based on the crossvalidated experiments on development DB, the usage of the generated features could improve ASC performance.


Visual tree detection for autonomous navigation in forest environment

This paper describes a classification based tree detection method for autonomous navigation of forest vehicles in forest environment. Fusion of color, and texture cues has been used to segment the image into tree trunk and background objects. The segmentation of images into tree trunk and background objects is a challenging task due to high variations of illumination, effect of different color shades, non-homogeneous bark texture, shadows and foreshortening. To accomplish this, the approach has been to find the best combinations of color, and texture descriptors, and classification techniques. An additional task has been to estimate the distance between forest vehicle and the base of segmented trees using monocular vision. A simple heuristic distance measurement method is proposed that is based on pixel height and a reference width. The performance of various color and texture operators, and accuracy of classifiers has been evaluated using cross validation techniques.


Learning Semantic Correspondences with Less Supervision

A central problem in grounded language acquisition is learning the correspondences between a rich world state and a stream of text which references that world state. To deal with the high degree of ambiguity present in this setting, we present a generative model that simultaneously segments the text into utterances and maps each utterance to a meaning representation grounded in the world state. We show that our model generalizes across three domains of increasing difficulty—Robocup sportscasting, weather forecasts (a new domain), and NFL recaps.


A Primer on Memory Consistency and Cache Coherence

Many modern computer systems and most multicore chips (chip multiprocessors) support shared memory in hardware. In a shared memory system, each of the processor cores may read and write to a single shared address space. For a shared memory machine, the memory consistency model defines the architecturally visible behavior of its memory system. Consistency definitions provide rules about loads and stores (or memory reads and writes) and how they act upon memory. As part of supporting a memory consistency model, many machines also provide cache coherence protocols that ensure that multiple cached copies of data are kept up-to-date. The goal of this primer is to provide readers with a basic understanding of consistency and coherence. This understanding includes both the issues that must be solved as well as a variety of solutions. We present both highlevel concepts as well as specific, concrete examples from real-world systems. vi


Improving Movie Gross Prediction through News Analysis

Traditional movie gross predictions are based on numerical and categorical movie data from The Internet Movie Database (IMDB). In this paper, we use the quantitative news data generated by Lydia, our system for large-scale news analysis, to help people to predict movie grosses. By analyzing two different models (regression and k-nearest neighbor models), we find models using only news data can achieve similar performance to those using IMDB data. Moreover, we can achieve better performance by using the combination of IMDB data and news data. Further, the improvement is statistically significant.


Prevalence of chronic pain with neuropathic characteristics in the general population

We conducted a large nationwide postal survey to estimate the prevalence of chronic pain with or without neuropathic characteristics in the French general population. A questionnaire aimed at identifying chronic pain (defined as daily pain for at least 3 months), evaluating its intensity, duration and body locations, was sent to a representative sample of 30,155 subjects. The DN4 questionnaire was used to identify neuropathic characteristics. Of the questionnaires, 24,497 (81.2%) were returned and 23,712 (96.8%) could be assessed. Seven thousand five hundred and twenty-two respondents reported chronic pain (prevalence=31.7%; [95%CI: 31.1-32.3]) and 4709 said the pain intensity was moderate to severe (prevalence=19.9%; [95%CI: 19.5-20.4]). Neuropathic characteristics were reported by 1631 respondents with chronic pain (prevalence=6.9%; [95%CI: 6.6-7.2]), which was moderate to severe in 1209 (prevalence=5.1% [95%CI: 4.8-5.4]). A higher prevalence of chronic pain with neuropathic characteristics was associated with middle age (50-64 years), manual professions and those living in rural areas. It was more frequently located in the lower limbs and its intensity and duration were higher in comparison with chronic pain without neuropathic characteristics. This large national population-based study indicates that a significant proportion of chronic pain patients report neuropathic characteristics. We identified distinctive socio-demographic profile and clinical features indicating that chronic pain with neuropathic characteristics is a specific health problem.


You had me at hello: How phrasing affects memorability

Understanding the ways in which information achieves widespread public awareness is a research question of significant interest. We consider whether, and how, the way in which the information is phrased — the choice of words and sentence structure — can affect this process. To this end, we develop an analysis framework and build a corpus of movie quotes, annotated with memorability information, in which we are able to control for both the speaker and the setting of the quotes. We find that there are significant differences between memorable and non-memorable quotes in several key dimensions, even after controlling for situational and contextual factors. One is lexical distinctiveness: in aggregate, memorable quotes use less common word choices, but at the same time are built upon a scaffolding of common syntactic patterns. Another is that memorable quotes tend to be more general in ways that make them easy to apply in new contexts — that is, more portable. We also show how the concept of “memorable language” can be extended across domains. To appear at ACL 2012; final version 1 Hello. My name is Inigo Montoya. Understanding what items will be retained in the public consciousness, and why, is a question of fundamental interest in many domains, including marketing, politics, entertainment, and social media; as we all know, many items barely register, whereas others catch on and take hold in many people’s minds. An active line of recent computational work has employed a variety of perspectives on this question. Building on a foundation in the sociology of diffusion [27, 31], researchers have explored the ways in which network structure affects the way information spreads, with domains of interest including blogs [1, 11], email [37], on-line commerce [22], and social media [2, 28, 33, 38]. There has also been recent research addressing temporal aspects of how different media sources convey information [23, 30, 39] and ways in which people react differently to information on different topics [28, 36]. Beyond all these factors, however, one’s everyday experience with these domains suggests that the way in which a piece of information is expressed — the choice of words, the way it is phrased — might also have a fundamental effect on the extent to which it takes hold in people’s minds. Concepts that attain wide reach are often carried in messages such as political slogans, marketing phrases, or aphorisms whose language seems intuitively to be memorable, “catchy,” or otherwise compelling. Our first challenge in exploring this hypothesis is to develop a notion of “successful” language that is precise enough to allow for quantitative evaluation. We also face the challenge of devising an evaluation setting that separates the phrasing of a message from the conditions in which it was delivered — highlycited quotes tend to have been delivered under compelling circumstances or fit an existing cultural, political, or social narrative, and potentially what appeals to us about the quote is really just its invocation of these extra-linguistic contexts. Is the form of the language adding an effect beyond or indepenar X iv :1 20 3. 63 60 v2 [ cs .C L ] 3 0 A pr 2 01 2 dent of these (obviously very crucial) factors? To investigate the question, one needs a way of controlling — as much as possible — for the role that the surrounding context of the language plays. The present work (i): Evaluating language-based memorability Defining what makes an utterance memorable is subtle, and scholars in several domains have written about this question. There is a rough consensus that an appropriate definition involves elements of both recognition — people should be able to retain the quote and recognize it when they hear it invoked — and production — people should be motivated to refer to it in relevant situations [15]. One suggested reason for why some memes succeed is their ability to provoke emotions [16]. Alternatively, memorable quotes can be good for expressing the feelings, mood, or situation of an individual, a group, or a culture (the zeitgeist): “Certain quotes exquisitely capture the mood or feeling we wish to communicate to someone. We hear them ... and store them away for future use” [10]. None of these observations, however, serve as definitions, and indeed, we believe it desirable to not pre-commit to an abstract definition, but rather to adopt an operational formulation based on external human judgments. In designing our study, we focus on a domain in which (i) there is rich use of language, some of which has achieved deep cultural penetration; (ii) there already exist a large number of external human judgments — perhaps implicit, but in a form we can extract; and (iii) we can control for the setting in which the text was used. Specifically, we use the complete scripts of roughly 1000 movies, representing diverse genres, eras, and levels of popularity, and consider which lines are the most “memorable”. To acquire memorability labels, for each sentence in each script, we determine whether it has been listed as a “memorable quote” by users of the widely-known IMDb (the Internet Movie Database), and also estimate the number of times it appears on the Web. Both of these serve as memorability metrics for our purposes. When we evaluate properties of memorable quotes, we compare them with quotes that are not assessed as memorable, but were spoken by the same character, at approximately the same point in the same movie. This enables us to control in a fairly fine-grained way for the confounding effects of context discussed above: we can observe differences that persist even after taking into account both the speaker and the setting. In a pilot validation study, we find that human subjects are effective at recognizing the more IMDbmemorable of two quotes, even for movies they have not seen. This motivates a search for features intrinsic to the text of quotes that signal memorability. In fact, comments provided by the human subjects as part of the task suggested two basic forms that such textual signals could take: subjects felt that (i) memorable quotes often involve a distinctive turn of phrase; and (ii) memorable quotes tend to invoke general themes that aren’t tied to the specific setting they came from, and hence can be more easily invoked for future (out of context) uses. We test both of these principles in our analysis of the data. The present work (ii): What distinguishes memorable quotes Under the controlled-comparison setting sketched above, we find that memorable quotes exhibit significant differences from nonmemorable quotes in several fundamental respects, and these differences in the data reinforce the two main principles from the human pilot study. First, we show a concrete sense in which memorable quotes are indeed distinctive: with respect to lexical language models trained on the newswire portions of the Brown corpus [21], memorable quotes have significantly lower likelihood than their nonmemorable counterparts. Interestingly, this distinctiveness takes place at the level of words, but not at the level of other syntactic features: the part-ofspeech composition of memorable quotes is in fact more likely with respect to newswire. Thus, we can think of memorable quotes as consisting, in an aggregate sense, of unusual word choices built on a scaffolding of common part-of-speech patterns. We also identify a number of ways in which memorable quotes convey greater generality. In their patterns of verb tenses, personal pronouns, and determiners, memorable quotes are structured so as to be more “free-standing,” containing fewer markers that indicate references to nearby text. Memorable quotes differ in other interesting aspects as well, such as sound distributions. Our analysis of memorable movie quotes suggests a framework by which the memorability of text in a range of different domains could be investigated. We provide evidence that such cross-domain properties may hold, guided by one of our motivating applications in marketing. In particular, we analyze a corpus of advertising slogans, and we show that these slogans have significantly greater likelihood at both the word level and the part-of-speech level with respect to a language model trained on memorable movie quotes, compared to a corresponding language model trained on non-memorable movie quotes. This suggests that some of the principles underlying memorable text have the potential to apply across different areas. Roadmap §2 lays the empirical foundations of our work: the design and creation of our movie-quotes dataset, which we make publicly available (§2.1), a pilot study with human subjects validating IMDbbased memorability labels (§2.2), and further study of incorporating search-engine counts (§2.3). §3 details our analysis and prediction experiments, using both movie-quotes data and, as an exploration of cross-domain applicability, slogans data. §4 surveys related work across a variety of fields. §5 briefly summarizes and indicates some future directions. 2 I’m ready for my close-up.


Self-Oscillating Fluxgate-Based Quasi-Digital Sensor for DC High-Current Measurement

A quasi-digital dc current sensor with rated current of ±600 A while overload current of about ±750 A is proposed in this paper. The new sensor is based on the open-loop self-oscillating fluxgate technology, but its originality is using a microcontroller unit to detect the duty cycle of the exciting voltage of the fluxgate. Compared with the published similar method, the whole signal chain of the new sensor is quasi-digital and without low-pass filter and analog-to-digital converter required when connected to digital systems. A precisely theoretical equation with respect to the linear dependence between the duty cycle and the current to be measured is established. Based on the equation, factors affecting the sensor sensitivity, accuracy, and resolution are determined, which constitutes the theoretical basis on the optimization design of the new sensor. The sensor linearity is improved using the least-squares polynomial fitting method. Some key specifications including the linearity, repeatability, and power supply effect of the sensor are characterized. The measurement results show that the linearity of the new sensor with the theoretical equation is better than 1.7% in the full scale of ±600 A, and can be improved to 0.3% when the fifth-order polynomial fitting method is used.


HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Applying Organizational Routines in understanding organizational change Markus Becker, Nathalie Lazaric, Richard Nelson, Sidney G. Winter


Text and Data Mining Techniques in Adverse Drug Reaction Detection

We review data mining and related computer science techniques that have been studied in the area of drug safety to identify signals of adverse drug reactions from different data sources, such as spontaneous reporting databases, electronic health records, and medical literature. Development of such techniques has become more crucial for public heath, especially with the growth of data repositories that include either reports of adverse drug reactions, which require fast processing for discovering signals of adverse reactions, or data sources that may contain such signals but require data or text mining techniques to discover them. In order to highlight the importance of contributions made by computer scientists in this area so far, we categorize and review the existing approaches, and most importantly, we identify areas where more research should be undertaken.


FIRST AND SECOND ORDER METHODS FOR ONLINE CONVOLUTIONAL

Convolutional sparse representations are a form of sparse representation with a structured, translation invariant dictionary. Most convolutional dictionary learning algorithms to date operate in batch mode, requiring simultaneous access to all training images during the learning process, which results in very high memory usage, and severely limits the training data that can be used. Very recently, however, a number of authors have considered the design of online convolutional dictionary learning algorithms that offer far better scaling of memory and computational cost with training set size than batch methods. This paper extends our prior work, improving a number of aspects of our previous algorithm; proposing an entirely new one, with better performance, and that supports the inclusion of a spatial mask for learning from incomplete data; and providing a rigorous theoretical analysis of these methods.


Interactive multiple anisotropic scattering in clouds

We propose an algorithm for the real time realistic simulation of multiple anisotropic scattering of light in a volume. Contrary to previous real-time methods we account for all kinds of light paths through the medium and preserve their anisotropic behavior.
 Our approach consists of estimating the energy transport from the illuminated cloud surface to the rendered cloud pixel for each separate order of multiple scattering. We represent the distribution of light paths reaching a given viewed cloud pixel with the mean and standard deviation of their entry points on the lit surface, which we call the collector area. At rendering time for each pixel we determine the collector area on the lit cloud surface for different sets of scattering orders, then we infer the associated light transport. The fast computation of the collector area and light transport is possible thanks to a preliminary analysis of multiple scattering in plane-parallel slabs and does not require slicing or marching through the volume.
 Rendering is done efficiently in a shader on the GPU, relying on a cloud surface mesh augmented with a Hypertexture to enrich the shape and silhouette. We demonstrate our model with the interactive rendering of detailed animated cumulus and cloudy sky at 2--10 frames per second.


On label dependence and loss minimization in multi-label classification

Most of the multi-label classification (MLC) methods proposed in recent years intended to exploit, in one way or the other, dependencies between the class labels. Comparing to simple binary relevance learning as a baseline, any gain in performance is normally explained by the fact that this method is ignoring such dependencies. Without questioning the correctness of such studies, one has to admit that a blanket explanation of that kind is hiding many subtle details, and indeed, the underlying mechanisms and true reasons for the improvements reported in experimental studies are rarely laid bare. Rather than proposing yet another MLC algorithm, the aim of this paper is to elaborate more closely on the idea of exploiting label dependence, thereby contributing to a better understanding of MLC. Adopting a statistical perspective, we claim that two types of label dependence should be distinguished, namely conditional and marginal dependence. Subsequently, we present three scenarios in which the exploitation of one of these types of dependence may boost the predictive performance of a classifier. In this regard, a close connection with loss minimization is established, showing that the benefit of exploiting label dependence does also depend on the type of loss to be minimized. Concrete theoretical results are presented for two representative loss functions, namely the Hamming loss and the subset 0/1 loss. In addition, we give an overview of state-of-the-art decomposition algorithms for MLC and we try to reveal the reasons for their effectiveness. Our conclusions are supported by carefully designed experiments on synthetic and benchmark data.


Automated and safe vulnerability assessment

As the number of system vulnerabilities multiplies in recent years, vulnerability assessment has emerged as a powerful system security administration tool that can identify vulnerabilities in existing systems before they are exploited. Although there are many commercial vulnerability assessment tools in the market, none of them can formally guarantee that the assessment process never compromises the computer systems being tested. This paper proposes a featherweight virtual machine (FVM) technology to address the safety issue associated with vulnerability testing. Compared with other virtual machine technologies, FVM is designed to facilitate sharing between virtual machines but still provides strong protection between them. The FVM technology allows a vulnerability assessment tool to test an exact replica of a production-mode network service, including both hardware and system software components, while guaranteeing that the production-mode network service is fully isolated from the testing process. In addition to safety, the vulnerability assessment support system described in this paper can also automate the entire process of vulnerability testing and thus for the first time makes it feasible to run vulnerability testing autonomously and frequently. Experiments on a Windows-based prototype show that Nessus assessment results against an FVM virtual machine are identical to those against a real machine. Furthermore, modifications to the file system and registry state made by vulnerability assessment runs are completely isolated from the host machine. Finally, the performance impact of vulnerability assessment runs on production network services is as low as 3%


Understanding Performance Interference of I/O Workload in Virtualized Cloud Environments

Server virtualization offers the ability to slice large, underutilized physical servers into smaller, parallel virtual machines (VMs), enabling diverse applications to run in isolated environments on a shared hardware platform. Effective management of virtualized cloud environments introduces new and unique challenges, such as efficient CPU scheduling for virtual machines, effective allocation of virtual machines to handle both CPU intensive and I/O intensive workloads. Although a fair number of research projects have dedicated to measuring, scheduling, and resource management of virtual machines, there still lacks of in-depth understanding of the performance factors that can impact the efficiency and effectiveness of resource multiplexing and resource scheduling among virtual machines. In this paper, we present our experimental study on the performance interference in parallel processing of CPU and network intensive workloads in the Xen Virtual Machine Monitors (VMMs). We conduct extensive experiments to measure the performance interference among VMs running network I/O workloads that are either CPU bound or network bound. Based on our experiments and observations, we conclude with four key findings that are critical to effective management of virtualized cloud environments for both cloud service providers and cloud consumers. First, running network-intensive workloads in isolated environments on a shared hardware platform can lead to high overheads due to extensive context switches and events in driver domain and VMM. Second, co-locating CPU-intensive workloads in isolated environments on a shared hardware platform can incur high CPU contention due to the demand for fast memory pages exchanges in I/O channel. Third, running CPU-intensive workloads and network-intensive workloads in conjunction incurs the least resource contention, delivering higher aggregate performance. Last but not the least, identifying factors that impact the total demand of the exchanged memory pages is critical to the in-depth understanding of the interference overheads in I/O channel in the driver domain and VMM.


Efficient Algorithms for Citation Network Analysis

In the paper very efficient, linear in number of arcs, algorithms for determining Hummon and Doreian’s arc weights SPLC and SPNP in citation network are proposed, and some theoretical properties of these weights are presented. The nonacyclicity problem in citation networks is discussed. An approach to identify on the basis of arc weights an important small subnetwork is proposed and illustrated on the citation networks of SOM (self organizing maps) literature and US patents.


Upvoting hurricane Sandy: event-based news production processes on a social news site

This paper uses the case of Hurricane Sandy and reddit's topical community (subreddit) /r/sandy to examine the production and curation of news content around events on a social news site. Through qualitative analysis, we provide a coded topology of produced content and describe how types of networked gatekeeping impact the framing of a crisis situation. This study also examines, through quantitative modeling, what kind of information becomes negotiated and voted as relevant. We suggest that highly scored content shared in a social news setting focused more on human-interest media and perspective-based citizen journalism than professional news reports. We conclude by discussing how the mechanisms of social news sites conflict with the social norms and culture of reddit to produce differing expectations around news.


Kuijk Bandgap Voltage Reference With High Immunity to EMI

This brief evaluates the effect of conducted electromagnetic interference (EMI) that is injected in the power supply of a classic Kuijk bandgap reference voltage circuit. Two modified Kuijk bandgap topologies with high immunity to EMI are introduced and compared to the original structure. Measurements of a test IC confirm the theoretical analyses.


Containerization and the PaaS Cloud

Containerization is widely discussed as a lightweight virtualization solution. Apart from exhibiting benefits over traditional virtual machines in the cloud, containers are especially relevant for platform-as-a-service (PaaS) clouds to manage and orchestrate applications through containers as an application packaging mechanism. This article discusses the requirements that arise from having to facilitate applications through distributed multicloud platforms.


Vehicle detection with sub-class training using R-CNN for the UA-DETRAC benchmark

Different types of vehicles, such as buses and cars, can be quite different in shapes and details. This makes it more difficult to try to learn a single feature vector that can detect all types of vehicles using a single object class. We proposed an approach to perform vehicle detection with Sub-Classes categories learning using R-CNN in order to improve the performance of vehicle detection. Instead of using a single object class, which is a vehicle in this experiment, to train on the R-CNN, we used multiple sub-classes of vehicles so that the network can better learn the features of each individual type. In the experiment, we also evaluated the result of using a transfer learning approach to use a pre-trained weights on a new dataset.