RGB-D Based Action Recognition with Light-weight 3D Convolutional Networks

Different from RGB videos, depth data in RGB-D videos provide key complementary information for tristimulus visual data which potentially could achieve accuracy improvement for action recognition. However, most of the existing action recognition models solely using RGB videos limit the performance capacity. Additionally, the state-of-the-art action recognition models, namely 3D convolutional neural networks (3D-CNNs) contain tremendous parameters suffering from computational inefficiency. In this paper, we propose a series of 3D lightweight architectures for action recognition based on RGB-D data. Compared with conventional 3D-CNN models, the proposed lightweight 3D-CNNs have considerably less parameters involving lower computation cost, while it results in favorable recognition performance. Experimental results on two public benchmark datasets show that our models can approximate or outperform the state-of-the-art approaches. Specifically, on the RGB+DNTU (NTU) dataset, we achieve 93.2% and 97.6% for crosssubject and cross-view measurement, and on the NorthwesternUCLA Multiview Action 3D (N-UCLA) dataset, we achieve 95.5% accuracy of cross-view.


Learning from Ambiguously Labeled Face Images

Learning a classifier from ambiguously labeled face images is challenging since training images are not always explicitly-labeled. For instance, face images of two persons in a news photo are not explicitly labeled by their names in the caption. We propose a Matrix Completion for Ambiguity Resolution (MCar) method for predicting the actual labels from ambiguously labeled images. This step is followed by learning a standard supervised classifier from the disambiguated labels to classify new images. To prevent the majority labels from dominating the result of MCar, we generalize MCar to a weighted MCar (WMCar) that handles label imbalance. Since WMCar outputs a soft labeling vector of reduced ambiguity for each instance, we can iteratively refine it by feeding it as the input to WMCar. Nevertheless, such an iterative implementation can be affected by the noisy soft labeling vectors, and thus the performance may degrade. Our proposed Iterative Candidate Elimination (ICE) procedure makes the iterative ambiguity resolution possible by gradually eliminating a portion of least likely candidates in ambiguously labeled faces. We further extend MCar to incorporate the labeling constraints among instances when such prior knowledge is available. Compared to existing methods, our approach demonstrates improvements on several ambiguously labeled datasets.


Using Generative Adversarial Networks to Design Shoes : The Preliminary Steps

In this paper, we envision a Conditional Generative Adversarial Network (CGAN) designed to generate shoes according to an input vector encoding desired features and functional type. Though we do not build the CGAN, we lay the foundation for its completion by exploring 3 areas. Our dataset is the UT-Zap50K dataset, which has 50,025 images of shoes categorized by functional type and with relative attribute comparisons. First, we experiment with several models to build a stable Generative Adversarial Network (GAN) trained on just athletic shoes. Then, we build a classifier based on GoogLeNet that is able to accurately categorize shoe images into their respective functional types. Finally, we explore the possibility of creating a binary classifier for each attribute in our dataset, though we are ultimately limited by the quality of the attribute comparisons provided. The progress made by this study will provide a robust base to create a conditional GAN that generates customized shoe designs.


A confirmatory factor analysis of IS employee motivation and retention

It is widely recognized that the relationships between organizations and their IS departments are changing. This trend threatens to undermine the retention of IS workers and the productivity of IS operations. In the study reported here, we examine IS employees' motivation and intent to remain using structural equation modeling. A survey was conducted among existing IS employees and analyzed with LISREL VIII. Results showed that latent motivation has an impact on latent retention, with job satisfaction and perceptions of management on career development as indicator variables for the former, and burnout, loyalty, and turnover intent as indicator variables for the latter. Implications for management in developing strategies for the retention of IS employees are provided. # 2001 Elsevier Science B.V. All rights reserved.


Living with Seal Robots in a Care House - Evaluations of Social and Physiological Influences

Robot therapy for elderly residents in a care house has been conducted since June 2005. Two therapeutic seal robots were introduced and activated for over 9 hours every day to interact with the residents. This paper presents the results of this experiment. In order to investigate the psychological and social effects of the robots, the activities of the residents in public areas were recorded by video cameras during daytime hours (8:30-18:00) for over 2 months. In addition, the hormones 17-Ketosteroid sulfate (17-KS-S) and 17-hydroxycorticosteroids (17-OHCS) in the residents' urine were obtained and analyzed. The results indicate that their social interaction was increased through interaction with the seal robots. Furthermore, the results of the urinary tests showed that the reactions of the subjects' vital organs to stress improved after the introduction of the robots


Guest Editorial Deep Learning in Medical Imaging: Overview and Future Promise of an Exciting New Technique

D EEP learning is a growing trend in general data analysis and has been termed one of the 10 breakthrough technologies of 2013 [1]. Deep learning is an improvement of artificial neural networks, consisting of more layers that permit higher levels of abstraction and improved predictions from data [2]. To date, it is emerging as the leading machine-learning tool in the general imaging and computer vision domains. In particular, convolutional neural networks (CNNs) have proven to be powerful tools for a broad range of computer vision tasks. Deep CNNs automatically learn mid-level and high-level abstractions obtained from raw data (e.g., images). Recent results indicate that the generic descriptors extracted from CNNs are extremely effective in object recognition and localization in natural images. Medical image analysis groups across the world are quickly entering the field and applying CNNs and other deep learning methodologies to a wide variety of applications. Promising results are emerging. In medical imaging, the accurate diagnosis and/or assessment of a disease depends on both image acquisition and image interpretation. Image acquisition has improved substantially over recent years, with devices acquiring data at faster rates and increased resolution. The image interpretation process, however, has only recently begun to benefit from computer technology. Most interpretations of medical images are performed by physicians; however, image interpretation by humans is limited due to its subjectivity, large variations across interpreters, and fatigue. Many diagnostic tasks require an initial search process to detect abnormalities, and to quantify measurements and changes over time. Computerized tools, specifically image analysis and machine learning, are the key enablers to improve diagnosis, by facilitating identification of the findings that require treatment and to support the expert’s workflow. Among these tools, deep learning is rapidly proving to be the state-of-the-art foundation, leading to improved accuracy. It has also opened up new frontiers in data analysis with rates of progress not before experienced.


Privacy in e-commerce: examining user scenarios and privacy preferences

Privacy is a necessary concern in electronic commerce. It is difficult, if not impossible, to complete a transaction without revealing some personal data – a shipping address, billing information, or product preference. Users may be unwilling to provide this necessary information or even to browse online if they believe their privacy is invaded or threatened. Fortunately, there are technologies to help users protect their privacy. P3P (Platform for Privacy Preferences Project) from the World Wide Web Consortium is one such technology. However, there is a need to know more about the range of user concerns and preferences about privacy in order to build usable and effective interface mechanisms for P3P and other privacy technologies. Accordingly, we conducted a survey of 381 U.S. Net users, detailing a range of commerce scenarios and examining the participants' concerns and preferences about privacy. This paper presents both the findings from that study as well as their design implications.


Hyperspectral image classification and dimensionality reduction: an orthogonal subspace projection approach

Abstruct-Most applications of hyperspectral imagery require processing techniques which achieve two fundamental goals: 1) detect and classify the constituent materials for each pixel in the scene; 2) reduce the data volumeldimensionality, without loss of critical information, so that it can be processed efficiently and assimilated by a human analyst. In this paper, we describe a technique which simultaneously reduces the data dimensionality, suppresses undesired or interfering spectral signatures, and detects the presence of a spectral signature of interest. The basic concept is to project each pixel vector onto a subspace which is orthogonal to the undesired signatures. This operation is an optimal interference suppression process in the least squares sense. Once the interfering signatures have been nulled, projecting the residual onto the signature of interest maximizes the signal-to-noise ratio and results in a single component image that represents a classification for the signature of interest. The orthogonal subspace projection (OSP) operator can be extended to k signatures of interest, thus reducing the dimensionality of k and classifying the hyperspectral image simultaneously. The approach is applicable to both spectrally pure as well as mixed pixels.


Flow Wars: Systemizing the Attack Surface and Defenses in Software-Defined Networks

Emerging software defined network SDN stacks have introduced an entirely new attack surface that is exploitable from a wide range of launch points. Through an analysis of the various attack strategies reported in prior work, and through our own efforts to enumerate new and variant attack strategies, we have gained two insights. First, we observe that different SDN controller implementations, developed independently by different groups, seem to manifest common sets of pitfalls and design weakness that enable the extensive set of attacks compiled in this paper. Second, through a principled exploration of the underlying design and implementation weaknesses that enables these attacks, we introduce a taxonomy to offer insight into the common pitfalls that enable SDN stacks to be broken or destabilized when fielded within hostile computing environments. This paper first captures our understanding of the SDN attack surface through a comprehensive survey of existing SDN attack studies, which we extend by enumerating 12 new vectors for SDN abuse. We then organize these vulnerabilities within the well-known confidentiality, integrity, and availability model, assess the severity of these attacks by replicating them in a physical SDN testbed, and evaluate them against three popular SDN controllers. We also evaluate the impact of these attacks against published SDN defense solutions. Finally, we abstract our findings to offer the research and development communities with a deeper understanding of the common design and implementation pitfalls that are enabling the abuse of SDN networks.


Psychopathy and the DSM-IV criteria for antisocial personality disorder.

The Axis II Work Group of the Task Force on DSM-IV has expressed concern that antisocial personality disorder (APD) criteria are too long and cumbersome and that they focus on antisocial behaviors rather than personality traits central to traditional conceptions of psychopathy and to international criteria. We describe an alternative to the approach taken in the rev. 3rd ed. of the Diagnostic and Statistical Manual of Mental Disorders (DSM-III-R; American Psychiatric Association, 1987), namely, the revised Psychopathy Checklist. We also discuss the multisite APD field trials designed to evaluate and compare four criteria sets: the DSM-III-R criteria, a shortened list of these criteria, the criteria for dyssocial personality disorder from the 10th ed. of the International Classification of Diseases (World Health Organization, 1990), and a 10-item criteria set for psychopathic personality disorder derived from the revised Psychopathy Checklist.


Annular-ring CMUT arrays for forward-looking IVUS: transducer characterization and imaging

In this study, a 64-element, 1.15-mm diameter annular-ring capacitive micromachined ultrasonic transducer (CMUT) array was characterized and used for forward-looking intravascular ultrasound (IVUS) imaging tests. The array was manufactured using low-temperature processes suitable for CMOS electronics integration on a single chip. The measured radiation pattern of a 43 /spl times/ 140-/spl mu/m array element depicts a 40/spl deg/ view angle for forward-looking imaging around a 15-MHz center frequency in agreement with theoretical models. Pulse-echo measurements show a -10-dB fractional bandwidth of 104% around 17 MHz for wire targets 2.5 mm away from the array in vegetable oil. For imaging and SNR measurements, RF A-scan data sets from various targets were collected using an interconnect scheme forming a 32-element array configuration. An experimental point spread function was obtained and compared with simulated and theoretical array responses, showing good agreement. Therefore, this study demonstrates that annular-ring CMUT arrays fabricated with CMOS-compatible processes are capable of forward-looking IVUS imaging, and the developed modeling tools can be used to design improved IVUS imaging arrays.


Interactive Robots as Social Partners and Peer Tutors for Children: A Field Trial

Robots increasingly have the potential to interact with people in daily life. It is believed that, based on this ability, they will play an essential role in human society in the not-so-distant future. This article examined the proposition that robots could form relationships with children and that children might learn from robots as they learn from other children. In this article, this idea is studied in an 18-day field trial held at a Japanese elementary school. Two English-speaking “Robovie” robots interacted with firstand sixth-grade pupils at the perimeter of their respective classrooms. Using wireless identification tags and sensors, these robots identified and interacted with children who came near them. The robots gestured and spoke English with the children, using a vocabulary of about 300 sentences for speaking and 50 words for recognition. The children were given a brief picture–word matching English test at the start of the trial, af62 KANDA, HIRANO, EATON, ISHIGURO


The role of physical embodiment in human-robot interaction

Autonomous robots are agents with physical bodies that share our environment. In this work, we test the hypothesis that physical embodiment has a measurable effect on performance and perception of social interactions. Support of this hypothesis would suggest fundamental differences between virtual agents and robots from a social standpoint and have significant implications for human-robot interaction. We measure task performance and perception of a robot's social abilities in a structured but open-ended task based on the Towers of Hanoi puzzle. Our experiment compares aspects of embodiment by evaluating: (1) the difference between a physical robot and a simulated one; (2) the effect of physical presence through a co-located robot versus a remote tele-present robot. We present data from a pilot study with 12 subjects showing interesting differences in perception of remote physical robot's and simulated agent's attention to the task, and task enjoyment


Representations in Distributed Cognitive Tasks

In this paper we propose a theoretical framework of distributed representations and a methodology of representational analysis for the study of distributed cognitive tasksÑtasks that require the processing of information distributed across the internal mind and the external environment. The basic principle of distributed representations is that the representational system of a distributed cognitive task is a set of internal and external representations, which together represent the abstract structure of the task. The basic strategy of representational analysis is to decompose the representation of a hierarchical task into its component levels so that the representational properties at each level can be independently examined. The theoretical framework and the methodology are used to analyze the hierarchical structure of the Tower of Hanoi problem. Based on this analysis, four experiments are designed to examine the representational properties of the Tower of Hanoi. Finally, the nature of external representations is discussed. This research was supported by a grant to Donald Norman and Edwin Hutchins from the Ames Research Center of the National Aeronautics & Space Agency, Grant NCC 2-591 in the Aviation Safety/Automation Program, technical monitor, Everett Palmer. Additional support was provided by funds from the Apple Computer Company and the Digital Equipment Corporation to the Affiliates of Cognitive Science at


The usability of everyday technology: emerging and fading opportunities

Current work in the field of usability tends to focus on snapshots of use as the basis for evaluating designs. However, giving due consideration to the fact that everyday use of technology involves a process of evolution, we set out to investigate how the design of the technology may be used to support this. Based on a long-term empirical study of television use in the homes of two families, we illustrate how use continuously develops in a complex interplay between the users' expectations---as they are formed and triggered by the design---and the needs and context of use per se. We analyze the empirical data from the perspective of activity theory. This framework serves to highlight how use develops, and it supports our analysis and discussion about how design, the users' backgrounds, previous experience, and needs, and the specific context of use supports or hinders the development of use. Moreover, we discuss how the characteristics of the home settings, in which the televisions studied were situated, represent a challenge to usability work. The concluding discussion leads to a set of hypotheses relevant to designers and researchers who wish to tackle some of the aspects of usability of particular importance to development in the use of home technology.


Are Robots Embodied ?

Embodiment has become an important concept in many areas of cognitive science. There are, however, very different notions of exactly what embodiment is and what kind of body is required for what kind of embodied cognition. Hence, while many would agree that humans are embodied cognizers, there is much less agreement on what kind of artefact could be considered as embodied. This paper identifies and contrasts five different notions of embodiment which can roughly be characterized as (1) structural coupling between agent and environment, (2) historical embodiment as the result of a history of structural coupling, (3) physical embodiment, (4) ‘organismoid’ embodiment, i.e. organism-like bodily form (e.g., humanoid robots), and (5) organismic embodiment of autopoietic, living systems.


Single Cesium Lead Halide Perovskite Nanocrystals at Low Temperature: Fast Single-Photon Emission, Reduced Blinking, and Exciton Fine Structure.

Metal-halide semiconductors with perovskite crystal structure are attractive due to their facile solution processability, and have recently been harnessed very successfully for high-efficiency photovoltaics and bright light sources. Here, we show that at low temperature single colloidal cesium lead halide (CsPbX3, where X = Cl/Br) nanocrystals exhibit stable, narrow-band emission with suppressed blinking and small spectral diffusion. Photon antibunching demonstrates unambiguously nonclassical single-photon emission with radiative decay on the order of 250 ps, representing a significant acceleration compared to other common quantum emitters. High-resolution spectroscopy provides insight into the complex nature of the emission process such as the fine structure and charged exciton dynamics.


Abstract Structures in Spatial Cognition

Structures in Spatial Cognition Christopher Habel and Carola Eschenbach University of Hamburg Abstract. The importance of studying spatial cognition in cognitive science is enforced by the fact that the applicability of spatial concepts and spatial expressions is not limited to the spatial domain. We claim that common structures underlying both concrete, physical space and other domains are the basis for using spatial expressions, e.g., prepositions like between, with respect to space as well as time or other domains. This claim opposes the thesis that the common use is based upon an analogy between concrete space and other domains. The development of geometry from Euclid’s Elements to more differentiated systems of diverse geometries and topologies can be perceived of as an example of the transfer from modeling concrete space towards describing abstract spatial structures. The importance of studying spatial cognition in cognitive science is enforced by the fact that the applicability of spatial concepts and spatial expressions is not limited to the spatial domain. We claim that common structures underlying both concrete, physical space and other domains are the basis for using spatial expressions, e.g., prepositions like between, with respect to space as well as time or other domains. This claim opposes the thesis that the common use is based upon an analogy between concrete space and other domains. The development of geometry from Euclid’s Elements to more differentiated systems of diverse geometries and topologies can be perceived of as an example of the transfer from modeling concrete space towards describing abstract spatial structures. 1 The Current Interest in Spatial Cognition: Spatial Representations and Spatial Concepts Human behavior is anchored in space and time. Spatial information, i.e., information about spatial properties of the entities in our environment, about spatial constellations in our surrounding, and about the spatial properties and relations of our bodies with respect to this surrounding, has a central position for human cognition. In the recognition of objects and events by different sensory channels, i.e., in visual, haptic or auditory perception, spatial information is involved. Motor behavior, i.e., locomotion and the movement of the body, is based on such information as well. Beyond perception and motor action, some higher cognitive activities that interact indirectly with the spatial environment are coupled with spatial information, for instance, memory, problem solving and planning (cf. Eilan et al. 1993). The interaction of spatial cognition and other cognitive faculties is also exemplified by the ability to communicate information about spatial properties of the external world, especially about objects or constellations not directly perceivable (cf. Freksa & Habel 1990). The cognitive science method of investigating and explaining cognition based on computation and representation has led to increasing research activities focusing on spatial representations and processes on such representations: * Parts of this paper are based on Habel & Eschenbach (1995). The research reported in this paper was carried out in connection to the project ‘Axiomatik räumlicher Konzepte’ (Ha 1237/7) supported by the Deutsche Forschungsgemeinschaft (DFG). Thanks to an anonymous referee for comments and suggestions for improvements. Address: FB Informatik (AB WSV) and Graduiertenkolleg Kognitionswissenschaft, Universität Hamburg, Vogt-Kölln-Str. 30, D-22527 Hamburg. {habel, eschenbach}@informatik.uni-hamburg.de. • In cognitive psychology spatial concepts are basic for thinking about objects and situations in physical space and therefore the necessary constituents for the integration of the central higher cognitive faculties with sensory, motor and linguistic faculties (cf. Miller 1978, Landau & Jackendoff 1993). • In linguistics spatial concepts are discussed as basic ingredients of the – mental – lexicon; the linguistic approach of cognitive grammar – with Lakoff, Langacker and Talmy as its most influential advocates – is committed to space as the foundation for semantics and for the general grammatical system. • In Artificial Intelligence spatial concepts are the basis for developing representational formalisms for processing spatial knowledge; for example, calculi of Qualitative Spatial Reasoning differ with respect to what their primitive terms are and which spatial expressions are definable on this basis (See, e.g., Freksa 1992, Hernández 1994, and Randell et al. 1992, Schlieder 1995a, b). In the cognitive grammar approach as well as in most other discussions on spatial information the question what the basis of using the term spatial is seems to allow a simple answer: Space is identified with three-dimensional physical space. And by this, the concrete, physical space of our environment is seen as the conceptual and semantic basis for a wide range of linguistic and non-linguistic cognition. Accordingly, spatial concepts concern size, shape or relative location of objects in three-dimensional physical space. This view is based on the judgment that direct interaction with concrete, physical space is the core of our experience and therefore of our knowledge. Our spatial experience leads to groupings among spatial concepts depending on geometrical types of spatial characterizations. Examples of such groups, each of them corresponding to types of experience, are: topological concepts • based on relations between regions and their boundaries • invariant with respect to elastic transformations concepts of ordering • based on relations between objects or regions with respect to the relative position in a spatial constellation. • independent of the extensions and distances of the objects and regions in question metric concepts • include measures of distance and size of objects and regions. 1 Following Miller (1978) we assume that the conceptual structure includes different types of concepts, e.g. concepts for objects, properties and relations. In this sense, spatial relations like touching or betweenness correspond to relational concepts, while shape properties like being round or angular correspond to predicative concepts. 2 See, e.g., Lakoff (1987), Langacker (1986), Talmy (1983). Note that in the initial phase of this framework the term space grammar was used (Langacker 1982). 3 Although it is often claimed that physical space is not concrete but an abstraction based on spatial properties and relations of material bodies, we will use the term concrete space to refer to physical space in contrast to abstract spatial structures referring to less restricted structures (such as topological, ordering or metric spaces) underlying physical space. Aspects of this division are reflected by the contrast between qualitative and quantitative spatial reasoning. The means of qualitative spatial reasoning are in many cases restricted to topological terms (e.g., Randell et al. 1992) and terms of ordering (e.g., Schlieder 1995a, b). An independent dimension of analysis concerns the distinction between concept types and types of spatial entities: On the one hand we deal with spatial relations between objects, their location or relative position. Characteristically these relations are independent of shape and extension, such that they can apply to points idealizing the place of the objects. On the other hand we are concerned with shape properties of extended objects or regions independent of their location. Shape properties are coined by the relative position of object parts among themselves. Concepts of object orientation combine both, shape of extended entities and spatial relations of their parts and other objects. These types of spatial concepts can be subdivided according to the dimension of geometrical type. As a third dimension in classifying spatial concepts, we distinguish between static and dynamic concepts. Whereas the former concern properties and relations without consideration of time and change, the latter reflect the possibility of changes of spatial properties and relations over time. Since trajectories or paths of locomotion processes are extended spatial entities, spatial concepts are applicable to them as well as to material or geographical entities. (See Table 1 for an exemplification of some sections according to the three-dimensional classification scheme).


DA-GAN: Instance-Level Image Translation by Deep Attention Generative Adversarial Networks

Unsupervised image translation, which aims in translating two independent sets of images, is challenging in discovering the correct correspondences without paired data. Existing works build upon Generative Adversarial Networks (GANs) such that the distribution of the translated images are indistinguishable from the distribution of the target set. However, such set-level constraints cannot learn the instance-level correspondences (e.g. aligned semantic parts in object transfiguration task). This limitation often results in false positives (e.g. geometric or semantic artifacts), and further leads to mode collapse problem. To address the above issues, we propose a novel framework for instance-level image translation by Deep Attention GAN (DA-GAN). Such a design enables DA-GAN to decompose the task of translating samples from two sets into translating instances in a highly-structured latent space. Specifically, we jointly learn a deep attention encoder, and the instance-level correspondences could be consequently discovered through attending on the learned instances. Therefore, the constraints could be exploited on both set-level and instance-level. Comparisons against several state-of-the-arts demonstrate the superiority of our approach, and the broad application capability, e.g, pose morphing, data augmentation, etc., pushes the margin of domain translation problem.1


Automatic detection and rapid determination of earthquake magnitude by wavelet multiscale analysis of the primary arrival

Earthquake early warning systems must save lives. It is of great importance that networked systems of seismometers be equipped with reliable tools to make rapid determinations of earthquake magnitude in the few to tens of seconds before the damaging ground motion occurs. A new fully automated algorithm based on the discrete wavelet transform detects as well as analyzes the incoming first arrival with great accuracy and precision, estimating the final magnitude to within a single unit from the first few seconds of the P wave. © 2006 Elsevier B.V. All rights reserved.


High-Accuracy Tracking Control of Hydraulic Rotary Actuators With Modeling Uncertainties

Structured and unstructured uncertainties are the main obstacles in the development of advanced controllers for high-accuracy tracking control of hydraulic servo systems. For the structured uncertainties, nonlinear adaptive control can be employed to achieve asymptotic tracking performance. But modeling errors, such as nonlinear frictions, always exist in physical hydraulic systems and degrade the tracking accuracy. In this paper, a robust integral of the sign of the error controller and an adaptive controller are synthesized via backstepping method for motion control of a hydraulic rotary actuator. In addition, an experimental internal leakage model of the actuator is built for precise model compensation. The proposed controller accounts for not only the structured uncertainties (i.e., parametric uncertainties), but also the unstructured uncertainties (i.e., nonlinear frictions). Furthermore, the controller theoretically guarantees asymptotic tracking performance in the presence of various uncertainties, which is very important for high-accuracy tracking control of hydraulic servo systems. Extensive comparative experimental results are obtained to verify the high-accuracy tracking performance of the proposed control strategy.


Computationally efficient leakage inductance calculation for a high-frequency core-type transformer

Leakage inductance is a critical design attribute of high-frequency transformers. In this paper, a new method to estimate core-type transformer leakage inductance is proposed. The magnetic analysis uses a combination of analytical and numerical analysis. A two-dimensional magnetic analysis using Biot-Savart law and the method of images is introduced. Using the same field analysis, expressions for mean squared field intensity values necessary for estimating proximity effect loss in the windings are also derived.


View-Independent Recognition of Hand Postures

In Proc. of IEEE Conf. on CVPR’2000, Vol.II, pp.88-94, Hilton Head Island, SC, 2000 Since human hand is highly articulated and deformable, hand posture recognition is a challenging example in the research of view-independent object recognition. Due to the difficulties of the modelbased approach, the appearance-based learning approach is promising to handle large variation in visual inputs. However, the generalization of many proposed supervised learning methods to this problem often suffers from the insufficiency of labeled training data. This paper describes an approach to alleviate this difficulty by adding a large unlabeled training set. Combining supervised and unsupervised learning paradigms, a novel and powerful learning approach, the Discriminant-EM (D-EM) algorithm, is proposed in this paper to handle the case of small labeled training set. Experiments show that D-EM outperforms many other learning methods. Based on this approach, we implement a gesture interface to recognize a set of predefined gesture commands, and it is also extended to hand detection. This algorithm can also apply to other object recognition tasks.


A Survey of CPU-GPU Heterogeneous Computing Techniques

As both CPUs and GPUs become employed in a wide range of applications, it has been acknowledged that both of these Processing Units (PUs) have their unique features and strengths and hence, CPU-GPU collaboration is inevitable to achieve high-performance computing. This has motivated a significant amount of research on heterogeneous computing techniques, along with the design of CPU-GPU fused chips and petascale heterogeneous supercomputers. In this article, we survey Heterogeneous Computing Techniques (HCTs) such as workload partitioning that enable utilizing both CPUs and GPUs to improve performance and/or energy efficiency. We review heterogeneous computing approaches at runtime, algorithm, programming, compiler, and application levels. Further, we review both discrete and fused CPU-GPU systems and discuss benchmark suites designed for evaluating Heterogeneous Computing Systems (HCSs). We believe that this article will provide insights into the workings and scope of applications of HCTs to researchers and motivate them to further harness the computational powers of CPUs and GPUs to achieve the goal of exascale performance.


Software engineering for big data projects: Domains, methodologies and gaps

Context: Big data has become the new buzzword in the information and communication technology industry. Researchers and major corporations are looking into big data applications to extract the maximum value from the data available to them. However, developing and maintaining stable and scalable big data applications is still a distant milestone. Objective: To look at existing research on how software engineering concepts, namely the phases of the software development project life cycle (SDPLC), can help build better big data application projects. Method: A literature survey was performed. A manual search covered papers returned by search engines resulting in approximately 2,000 papers being searched and 170 papers selected for review. Results: The search results helped in identifying data rich application projects that have the potential to utilize big data successfully. The review helped in exploring SDPLC phases in the context of big data applications and performing a gap analysis of the phases that have yet to see detailed research efforts but deserve attention.


Biology of language-The epistemology of reality

2. What processes take place in a linguistic interaction that permit an organism (us) to describe and to predict events that it may experience? This is my way of honoring the memory of Eric H. Lenneberg, if one honors the memory of another scientist by speaking about one’s own work Whatever the case, I wish to honor his memory not only because of his great accomplishments, but also because he was capable of inspiring his students, as the symposium on which this book is based revealed. The only way I can do this is to accept the honor of presenting my views about biology, language, and reality. I shall, accordingly, speak about language as a biologist. In doing so, I shall use language, notwithstanding that this use of language to speak about language is within the core of the problem I wish to consider.


Statistical significance versus clinical relevance.

In March this year, the American Statistical Association (ASA) posted a statement on the correct use of P-values, in response to a growing concern that the P-value is commonly misused and misinterpreted. We aim to translate these warnings given by the ASA into a language more easily understood by clinicians and researchers without a deep background in statistics. Moreover, we intend to illustrate the limitations of P-values, even when used and interpreted correctly, and bring more attention to the clinical relevance of study findings using two recently reported studies as examples. We argue that P-values are often misinterpreted. A common mistake is saying that P < 0.05 means that the null hypothesis is false, and P ≥0.05 means that the null hypothesis is true. The correct interpretation of a P-value of 0.05 is that if the null hypothesis were indeed true, a similar or more extreme result would occur 5% of the times upon repeating the study in a similar sample. In other words, the P-value informs about the likelihood of the data given the null hypothesis and not the other way around. A possible alternative related to the P-value is the confidence interval (CI). It provides more information on the magnitude of an effect and the imprecision with which that effect was estimated. However, there is no magic bullet to replace P-values and stop erroneous interpretation of scientific results. Scientists and readers alike should make themselves familiar with the correct, nuanced interpretation of statistical tests, P-values and CIs.


Derivation of Human Trophoblast Stem Cells.

Trophoblast cells play an essential role in the interactions between the fetus and mother. Mouse trophoblast stem (TS) cells have been derived and used as the best in vitro model for molecular and functional analysis of mouse trophoblast lineages, but attempts to derive human TS cells have so far been unsuccessful. Here we show that activation of Wingless/Integrated (Wnt) and EGF and inhibition of TGF-β, histone deacetylase (HDAC), and Rho-associated protein kinase (ROCK) enable long-term culture of human villous cytotrophoblast (CT) cells. The resulting cell lines have the capacity to give rise to the three major trophoblast lineages, which show transcriptomes similar to those of the corresponding primary trophoblast cells. Importantly, equivalent cell lines can be derived from human blastocysts. Our data strongly suggest that the CT- and blastocyst-derived cell lines are human TS cells, which will provide a powerful tool to study human trophoblast development and function.


A Bidirectional-Switch-Based Wide-Input Range High-Efficiency Isolated Resonant Converter for Photovoltaic Applications

Modular photovoltaic (PV) power conditioning systems (PCSs) require a high-efficiency dc-dc converter stage capable of regulation over a wide input voltage range for maximum power point tracking. In order to mitigate ground leakage currents and to be able to use a high-efficiency, nonisolated grid-tied inverter, it is also desirable for this microconverter to provide galvanic isolation between the PV module and the inverter. This paper presents a novel, isolated topology that is able to meet the high efficiency over a wide input voltage range requirement. This topology yields high efficiency through low circulating currents, zero-voltage switching (ZVS) and low-current switching of the primary side devices, ZCS of the output diodes, and direct power transfer to the load for the majority of switching cycle. This topology is also able to provide voltage regulation through basic fixed-frequency pulsewidth modulated (PWM) control. These features are able to be achieved with the simple addition of a secondary-side bidirectional ac switch to the isolated series resonant converter. Detailed analysis of the operation of this converter is discussed along with a detailed design procedure. Experimental results of a 300-W prototype are given. The prototype reached a peak power stage efficiency of 98.3% and a California Energy Commission (CEC) weighted power stage efficiency of 98.0% at the nominal input voltage.


Detection of Red Tomato on Plants using Image Processing Techniques

Tomatoes are the best-known grown fruit in greenhouses that have been recently attempted to be picked up automatically. Tomato is a plant which its fruit does not ripe simultaneously, therefore it is necessary to develop an algorithm to distinguish red tomatoes. In the current study, a new segmentation algorithm based on region growing was proposed for guiding a robot to pick up red tomatoes. For this purpose, several colour images of tomato plants were acquired in a greenhouse. The colour images of tomato were captured under natural light, without any artificial lighting equipment. To recognize red tomatoes form non-red ones, at first background of images were removed. For removing the background, subtraction of red and green components (R-G) was applied. Usually tomatoes touch together, so separating touching tomatoes was next step. In this step, the watershed algorithm was used that was followed by improving process. Afterwards, red tomato was detected by the region growing approach. Results obtained from testing the developed algorithm showed an encouraging accuracy (82.38%) to develop an expert system for online recognition of red


A Novel Metal-Plate Monopole Antenna for DTV Application

In this paper, a novel metal-plate monopole antenna is presented for indoor digital television (DTV) signal coverage in the 468-880MHz band. The proposed antenna consists of two orthorhombic metal-plates with symmetrical bevels, a top-uploaded metal-plate and a ground plane. Simulation results show that the antenna achieves a bandwidth ranging from 468MHz to 880MHz which covers the DTV band (470-860MHZ) and shows stable radiation patterns in three coordinate planes.


Plot Induction and Evolutionary Search for Story Generation

In this paper we develop a story generator that leverages knowledge inherent in corpora without requiring extensive manual involvement. A key feature in our approach is the reliance on a story planner which we acquire automatically by recording events, their participants, and their precedence relationships in a training corpus. Contrary to previous work our system does not follow a generate-and-rank architecture. Instead, we employ evolutionary search techniques to explore the space of possible stories which we argue are well suited to the story generation task. Experiments on generating simple children’s stories show that our system outperforms previous data-driven approaches.


, GT-GOLEM-2011-001 , 2011 Ach : IPC for Real-Time Robot Control

We present a new Inter-Process Communication (IPC) mechanism and library. Ach is uniquely suited for coordinating perception, control drivers, and algorithms in real-time systems that sample data from physical processes. Ach eliminates the Head-of-Line Blocking problem for applications that always require access to the newest message. Ach is efficient, robust, and formally verified. It has been tested and demonstrated on a variety of physical robotic systems. Finally, the source code for Ach is available under an Open Source BSD-style license.


CNNPred: CNN-based stock market prediction using several data sources

Feature extraction from financial data is one of the most important problems in market prediction domain for which many approaches have been suggested. Among other modern tools, convolutional neural networks (CNN) have recently been applied for automatic feature selection and market prediction. However, in experiments reported so far, less attention has been paid to the correlation among different markets as a possible source of information for extracting features. In this paper, we suggest a CNN-based framework with specially designed CNNs, that can be applied on a collection of data from a variety of sources, including different markets, in order to extract features for predicting the future of those markets. The suggested framework has been applied for predicting the next days direction of movement for the indices of S&P 500, NASDAQ, DJI, NYSE, and RUSSELL markets based on various sets of initial features. The evaluations show a significant improvement in predictions performance compared to the state of the art baseline algorithms.


Deep Learning for Multi-label Classification

In multi-label classification, the main focus has been to develop ways of learning the underlying dependencies between labels, and to take advantage of this at classification time. Developing better feature-space representations has been predominantly employed to reduce complexity, e.g., by eliminating non-helpful feature attributes from the input space prior to (or during) training. This is an important task, since many multilabel methods typically create many different copies or views of the same input data as they transform it, and considerable memory can be saved by taking advantage of redundancy. In this paper, we show that a proper development of the feature space can make labels less interdependent and easier to model and predict at inference time. For this task we use a deep learning approach with restricted Boltzmann machines. We present a deep network that, in an empirical evaluation, outperforms a number of competitive methods from the literature.


A 69.8 dB SNDR 3rd-order Continuous Time Delta-Sigma Modulator with an Ultimate Low Power Tuning System for a Worldwide Digital TV-Receiver

This paper presents a 3rd-order continuous time delta-sigma modulator for a worldwide digital TV-receiver whose SNDR is 69.8 dB. An ultimate low power tuning system using RC-relaxation oscillator is developed in order to achieve high yield against PVT variations. A 3rd-order modulator with modified single opamp resonator contributes to cost reduction by realizing very compact circuit. The mechanism to occur 2nd-order harmonic distortion at current feedback DAC was analyzed and a reduction scheme of the distortion enabled the modulator to achieved FOM of 0.18 pJ/conv-step.


A comparison of spotlight synthetic aperture radar image formation techniques

Spotlight synthetic aperture radar images can be formed from the complex phase history data using two main techniques: 1) polar-to-Cartesian interpolation followed by twodimensional inverse Fourier transform (2DFFT) , and 2) convolution backprojection (CBP) . CBP has been widely used to reconstruct medical images in computer aided tomography, and only recently has been applied to form synthetic aperture radar imagery. It is alleged that CBP yields higher quality images because 1) all the Fourier data are used and 2) the polar formatted data is used directly to form a 2D Cartesian image and therefore 2D interpolation is not required. This report compares the quality of images formed by CBP and several modified versions of the 2DFFT method. We show from an image quality point of view that CBP is equivalent to first windowing the phase history data and then interpolating to an exscribed rectangle. From a mathematical perspective, we should expect this conclusion since the same Fourier data are used to form the SAR image. We next address the issue of parallel implementation of each algorithm. We dispute previous claims that CBP is more readily parallelizable than the 2DFFT method. Our conclusions are supported by comparing execution times between massively parallel implementations of both algorithms, showing that both experience similar decreases in computation time, but that CBP takes significantly longer to form an image. This page intentionally left blank


A Decision Framework for Blockchain Platforms for IoT and Edge Computing

Blockchains started as an enabling technology in the area of digital currencies with the introduction of Bitcoin. However, blockchains have emerged as a technology that goes beyond financial transactions by providing a platform supporting secure and robust distributed public ledgers. We think that the Internet of Things (IoT) can also benefit from blockchain technology, especially in the areas of security, privacy, fault tolerance, and autonomous behavior. Here we present a decision framework to help practitioners systematically evaluate the potential use of blockchains in an IoT context.


Brain Activity during Simulated Deception: An Event-Related Functional Magnetic Resonance Study

TheGuilty Knowledge Test (GKT) has been used extensively to model deception. An association between the brain evoked response potentials and lying on the GKT suggests that deception may be associated with changes in other measures of brain activity such as regional blood flow that could be anatomically localized with event-related functional magnetic resonance imaging (fMRI). Blood oxygenation level-dependent fMRI contrasts between deceptive and truthful responses were measured with a 4 Tesla scanner in 18 participants performing the GKT and analyzed using statistical parametric mapping. Increased activity in the anterior cingulate cortex (ACC), the superior frontal gyrus (SFG), and the left premotor, motor, and anterior parietal cortex was specifically associated with deceptive responses. The results indicate that: (a) cognitive differences between deception and truth have neural correlates detectable by fMRI, (b) inhibition of the truthful response may be a basic component of intentional deception, and (c) ACC and SFG are components of the basic neural circuitry for deception.


Central sensitization in carpal tunnel syndrome with extraterritorial spread of sensory symptoms

Extraterritorial spread of sensory symptoms is frequent in carpal tunnel syndrome (CTS). Animal models suggest that this phenomenon may depend on central sensitization. We sought to obtain psychophysical evidence of sensitization in CTS with extraterritorial symptoms spread. We recruited 100 unilateral CTS patients. After selection to rule out concomitant upper-limb causes of pain, 48 patients were included. The hand symptoms distribution was graded with a diagram into median and extramedian pattern. Patients were asked on proximal pain. Quantitative sensory testing (QST) was performed in the territory of injured median nerve and in extramedian territories to document signs of sensitization (hyperalgesia, allodynia, wind-up). Extramedian pattern and proximal pain were found in 33.3% and 37.5% of patients, respectively. The QST profile associated with extramedian pattern includes: (1) thermal and mechanic hyperalgesia in the territory of the injured median nerve and in those of the uninjured ulnar and radial nerves and (2) enhanced wind-up. No signs of sensitization were found in patients with the median distribution and those with proximal symptoms. Different mechanisms may underlie hand extramedian and proximal spread of symptoms, respectively. Extramedian spread of symptoms in the hand may be secondary to spinal sensitization but peripheral and supraspinal mechanisms may contribute. Proximal spread may represent referred pain. Central sensitization may be secondary to abnormal activity in the median nerve afferents or the consequence of a predisposing trait. Our data may explain the persistence of sensory symptoms after median nerve surgical release and the presence of non-anatomical sensory patterns in neuropathic pain.


PsychoPy—Psychophysics software in Python

The vast majority of studies into visual processing are conducted using computer display technology. The current paper describes a new free suite of software tools designed to make this task easier, using the latest advances in hardware and software. PsychoPy is a platform-independent experimental control system written in the Python interpreted language using entirely free libraries. PsychoPy scripts are designed to be extremely easy to read and write, while retaining complete power for the user to customize the stimuli and environment. Tools are provided within the package to allow everything from stimulus presentation and response collection (from a wide range of devices) to simple data analysis such as psychometric function fitting. Most importantly, PsychoPy is highly extensible and the whole system can evolve via user contributions. If a user wants to add support for a particular stimulus, analysis or hardware device they can look at the code for existing examples, modify them and submit the modifications back into the package so that the whole community benefits.


Learning realistic human actions from movies

The aim of this paper is to address recognition of natural human actions in diverse and realistic video settings. This challenging but important subject has mostly been ignored in the past due to several problems one of which is the lack of realistic and annotated video datasets. Our first contribution is to address this limitation and to investigate the use of movie scripts for automatic annotation of human actions in videos. We evaluate alternative methods for action retrieval from scripts and show benefits of a text-based classifier. Using the retrieved action samples for visual learning, we next turn to the problem of action classification in video. We present a new method for video classification that builds upon and extends several recent ideas including local space-time features, space-time pyramids and multi-channel non-linear SVMs. The method is shown to improve state-of-the-art results on the standard KTH action dataset by achieving 91.8% accuracy. Given the inherent problem of noisy labels in automatic annotation, we particularly investigate and show high tolerance of our method to annotation errors in the training set. We finally apply the method to learning and classifying challenging action classes in movies and show promising results.


DeepFace: Closing the Gap to Human-Level Performance in Face Verification

In modern face recognition, the conventional pipeline consists of four stages: detect => align => represent => classify. We revisit both the alignment step and the representation step by employing explicit 3D face modeling in order to apply a piecewise affine transformation, and derive a face representation from a nine-layer deep neural network. This deep network involves more than 120 million parameters using several locally connected layers without weight sharing, rather than the standard convolutional layers. Thus we trained it on the largest facial dataset to-date, an identity labeled dataset of four million facial images belonging to more than 4, 000 identities. The learned representations coupling the accurate model-based alignment with the large facial database generalize remarkably well to faces in unconstrained environments, even with a simple classifier. Our method reaches an accuracy of 97.35% on the Labeled Faces in the Wild (LFW) dataset, reducing the error of the current state of the art by more than 27%, closely approaching human-level performance.


A Multi-scale Approach to Gesture Detection and Recognition

We propose a generalized approach to human gesture recognition based on multiple data modalities such as depth video, articulated pose and speech. In our system, each gesture is decomposed into large-scale body motion and local subtle movements such as hand articulation. The idea of learning at multiple scales is also applied to the temporal dimension, such that a gesture is considered as a set of characteristic motion impulses, or dynamic poses. Each modality is first processed separately in short spatio-temporal blocks, where discriminative data-specific features are either manually extracted or learned. Finally, we employ a Recurrent Neural Network for modeling large-scale temporal dependencies, data fusion and ultimately gesture classification. Our experiments on the 2013 Challenge on Multimodal Gesture Recognition dataset have demonstrated that using multiple modalities at several spatial and temporal scales leads to a significant increase in performance allowing the model to compensate for errors of individual classifiers as well as noise in the separate channels.


Unsupervised Learning of Invariant Feature Hierarchies with Applications to Object Recognition

We present an unsupervised method for learning a hierarchy of sparse feature detectors that are invariant to small shifts and distortions. The resulting feature extractor consists of multiple convolution filters, followed by a feature-pooling layer that computes the max of each filter output within adjacent windows, and a point-wise sigmoid non-linearity. A second level of larger and more invariant features is obtained by training the same algorithm on patches of features from the first level. Training a supervised classifier on these features yields 0.64% error on MNIST, and 54% average recognition rate on Caltech 101 with 30 training samples per category. While the resulting architecture is similar to convolutional networks, the layer-wise unsupervised training procedure alleviates the over-parameterization problems that plague purely supervised learning procedures, and yields good performance with very few labeled training samples.


Efficient model-based 3D tracking of hand articulations using Kinect

The 3D tracking of the articulation of human hands is a theoretically interesting and challenging problem with numerous and diverse applications [1]. Several attempts have been made to address the problem by considering markerless visual data. Existing approaches can be categorized into modeland appearance-based [1]. In this work, we propose a model-based approach to the problem (Fig. 1). We formulate it as an optimization problem that minimizes the discrepancy between the 3D structure and appearance of hypothesized 3D hand model instances, and actual visual observations. Optimization is performed with a variant of an existing stochastic optimization method (Particle Swarm Optimization PSO) [2]. The most computationally demanding parts of the process have been implemented to run efficiently on a GPU [3]. The resulting system performs hand articulations tracking at a rate of 15Hz.


DeepCas: An End-to-end Predictor of Information Cascades

Information cascades, effectively facilitated by most social network platforms, are recognized as a major factor in almost every social success and disaster in these networks. Can cascades be predicted? While many believe that they are inherently unpredictable, recent work has shown that some key properties of information cascades, such as size, growth, and shape, can be predicted by a machine learning algorithm that combines many features. These predictors all depend on a bag of hand-crafting features to represent the cascade network and the global network structures. Such features, always carefully and sometimes mysteriously designed, are not easy to extend or to generalize to a different platform or domain. Inspired by the recent successes of deep learning in multiple data mining tasks, we investigate whether an end-to-end deep learning approach could effectively predict the future size of cascades. Such a method automatically learns the representation of individual cascade graphs in the context of the global network structure, without hand-crafted features or heuristics. We find that node embeddings fall short of predictive power, and it is critical to learn the representation of a cascade graph as a whole. We present algorithms that learn the representation of cascade graphs in an end-to-end manner, which significantly improve the performance of cascade prediction over strong baselines including feature based methods, node embedding methods, and graph kernel methods. Our results also provide interesting implications for cascade prediction in general.


Applications of Probabilistic Programming (Master's thesis, 2015)

This thesis describes work on two applications of probabilistic programming: the learning of probabilistic program code given specifications, in particular program code of one-dimensional samplers; and the facilitation of sequential Monte Carlo inference with help of data-driven proposals. The latter is presented with experimental results on a linear Gaussian model and a non-parametric dependent Dirichlet process mixture of objects model for object recognition and tracking. We begin this work by providing a brief introduction to probabilistic programming. In the second Chapter we present an approach to automatic discovery of samplers in the form of probabilistic programs. Specifically, we learn the procedure code of samplers for one-dimensional distributions. We formulate a Bayesian approach to this problem by specifying a grammar-based prior over probabilistic program code. We use an approximate Bayesian computation method to learn the programs, whose executions generate samples that statistically match observed data or analytical characteristics of distributions of interest. In our experiments we leverage different probabilistic programming systems, including Anglican and Probabilistic C, to perform Markov chain Monte Carlo sampling over the space of programs. Experimental results have demonstrated that, using the proposed methodology, we can learn approximate and even some exact samplers. Finally, we show that our results are competitive with regard to genetic programming methods.


Low-Level Software Security: Attacks and Defenses

This tutorial paper considers the issues of low-level software security from a language-based perspective, with the help of concrete examples. Four examples of low-level software attacks are covered in full detail; these examples are representative of the major types of attacks on C and C++ software that is compiled into machine code. Six examples of practical defenses against those attacks are also covered in detail; these defenses are selected because of their effectiveness, wide applicability, and low enforcement overhead.


Towards integrated safety analysis and design

There are currently many problems with the development and assessment of software intensive safety-critical systems. In this paper we describe the problems, and introduce a novel approach to their solution, based around goal-structuring concepts, which we believe will ameliorate some of the difficulties. We discuss the use of modified and new forms of safety assessment notations to provide evidence of safety, and the use of data derived from such notations as a means of providing quantified input into the design assessment process. We then show how the design assessment can be partially automated, and from this develop some ideas on how we might move from analytical to synthetic approaches, using safety criteria and evidence as a fitness function for comparing alternative automatically-generated designs.


Hand Gesture Recognition Based on Perceptual Shape Decomposition with a Kinect Camera

In this paper, we propose the Perceptual Shape Decomposition (PSD) to detect fingers for a Kinect-based hand gesture recognition system. The PSD is formulated as a discrete optimization problem by removing all negative minima with minimum cost. Experiments show that our PSD is perceptually relevant and robust against distortion and hand variations, and thus improves the recognition system performance. key words: Kinect camerta, hand gesture recognition, perceptual decomposition, finger detection


Convergence guarantees for RMSProp and ADAM in non-convex optimization and their comparison to Nesterov acceleration on autoencoders

RMSProp and ADAM continue to be extremely popular algorithms for training neural nets but their theoretical foundations have remained unclear. In this work we make progress towards that by giving proofs that these adaptive gradient algorithms are guaranteed to reach criticality for smooth non-convex objectives and we give bounds on the running time. We then design experiments to compare the performances of RMSProp and ADAM against Nesterov Accelerated Gradient method on a variety of autoencoder setups. Through these experiments we demonstrate the interesting sensitivity that ADAM has to its momentum parameter β1. We show that in terms of getting lower training and test losses, at very high values of the momentum parameter (β1 = 0.99) (and large enough nets if using mini-batches) ADAM outperforms NAG at any momentum value tried for the latter. On the other hand, NAG can sometimes do better when ADAM’s β1 is set to the most commonly used value: β1 = 0.9. We also report experiments on different autoencoders to demonstrate that NAG has better abilities in terms of reducing the gradient norms and finding weights which increase the minimum eigenvalue of the Hessian of the loss function.


Input-series output-parallel AC/AC converter

Input-series and output-parallel (ISOP) converters are suitable for the high input voltage and low output voltage conversion applications. An ISOP current mode AC/AC converter with high frequency link is proposed. The control strategy and operation principle of the ISOP AC/AC converter are investigated. The control strategy ensures the proper sharing of the input voltage and the proper sharing of the output current among the ISOP AC/AC converter. By simulation, the correctness of the operation principle and the control strategy of the ISOP AC/AC converter are proved.


Visual Dynamics: Probabilistic Future Frame Synthesis via Cross Convolutional Networks

We study the problem of synthesizing a number of likely future frames from a single input image. In contrast to traditional methods, which have tackled this problem in a deterministic or non-parametric way, we propose to model future frames in a probabilistic manner. Our probabilistic model makes it possible for us to sample and synthesize many possible future frames from a single input image. To synthesize realistic movement of objects, we propose a novel network structure, namely a Cross Convolutional Network; this network encodes image and motion information as feature maps and convolutional kernels, respectively. In experiments, our model performs well on synthetic data, such as 2D shapes and animated game sprites, as well as on real-world video frames. We also show that our model can be applied to visual analogy-making, and present an analysis of the learned network representations.


High efficiency Ka-band Gallium Nitride power amplifier MMICs

The design and performance of two high efficiency Ka-band power amplifier MMICs utilizing a 0.15μm GaN HEMT process technology is presented. Measured in-fixture continuous wave (CW) results for the 3-stage balanced amplifier demonstrates up to 11W of output power and 30% power added efficiency (PAE) at 30GHz. The 3-stage single-ended design produced over 6W of output power and up to 34% PAE. The die size for the balanced and single-ended MMICs are 3.24×3.60mm2 and 1.74×3.24mm2 respectively.


A prioritized grid long short-term memory RNN for speech recognition

Recurrent neural networks (RNNs) are naturally suitable for speech recognition because of their ability of utilizing dynamically changing temporal information. Deep RNNs have been argued to be able to model temporal relationships at different time granularities, but suffer vanishing gradient problems. In this paper, we extend stacked long short-term memory (LSTM) RNNs by using grid LSTM blocks that formulate computation along not only the temporal dimension, but also the depth dimension, in order to alleviate this issue. Moreover, we prioritize the depth dimension over the temporal one to provide the depth dimension more updated information, since the output from it will be used for classification. We call this model the prioritized Grid LSTM (pGLSTM). Extensive experiments on four large datasets (AMI, HKUST, GALE, and MGB) indicate that the pGLSTM outperforms alternative deep LSTM models, beating stacked LSTMs with 4% to 7% relative improvement, and achieve new benchmarks among uni-directional models on all datasets.


Correlation for user confidence in predictive decision making

Despite the recognized value of Machine Learning (ML) techniques and high expectation of applying ML techniques within various applications, significant barriers to the widespread adoption and local implementation of ML approaches still exist in the areas of trust (of ML results), comprehension (of ML processes), as well as confidence (in decision making) by users. This paper investigates the effects of correlation between features and target values on user confidence in data analytics-driven decision making. Our user study found that revealing the correlation between features and target variables affected user confidence in decision making significantly. Moreover, users felt more confident in decision making when correlation shared the same trend with the prediction model performance. These findings would help design intelligent user interfaces and evaluate the effectiveness of machine learning models in applications.


Databases, features and classifiers for speech emotion recognition: a review

Abstract Speech is an effective medium to express emotions and attitude through language. Finding the emotional content from a speech signal and identify the emotions from the speech utterances is an important task for the researchers. Speech emotion recognition has considered as an important research area over the last decade. Many researchers have been attracted due to the automated analysis of human affective behaviour. Therefore a number of systems, algorithms, and classifiers have been developed and outlined for the identification of emotional content of a speech from a person’s speech. In this study, available literature on various databases, different features and classifiers have been taken in to consideration for speech emotion recognition from assorted languages.


A WL-SPPIM Semantic Model for Document Classification

In this paper, we explore SPPIM-based text classification method, and the experiment reveals that the SPPIM method is equal to or even superior than SGNS method in text classification task on three international and standard text datasets, namely 20newsgroups, Reuters52 and WebKB. Comparing to SGNS, although SPPMI provides a better solution, it is not necessarily better than SGNS in text classification tasks.. Based on our analysis, SGNS takes into the consideration of weight calculation during decomposition process, so it has better performance than SPPIM in some standard datasets. Inspired by this, we propose a WL-SPPIM semantic model based on SPPIM model, and experiment shows that WL-SPPIM approach has better classification and higher scalability in the text classification task compared with LDA, SGNS and SPPIM approaches.


Estimation of human body shape and cloth field in front of a kinect

This paper describes an easy-to-use system to estimate the shape of a human body and his/her clothes. The system uses a Kinect to capture the human's RGB and depth information from different views. Using the depth data, a non-rigid deformation method is devised to compensate motions between different views, thus to align and complete the dressed shape. Given the reconstructed dressed shape, the skin regions are recognized by a skin classifier from the RGB images, and these skin regions are taken as a tight constraints for the body estimation. Subsequently, the body shape is estimated from the skin regions of the dressed shape by leveraging a statistical model of human body. After the body estimation, the body shape is non-rigidly deformed to fit the dressed shape, so as to extract the cloth field of the dressed shape. We demonstrate our system and the therein algorithms by several experiments. The results show the effectiveness of the proposed method. & 2014 Elsevier B.V. All rights reserved.


Identifying and Eliminating Mislabeled Training Instances

This paper presents a new approach to identifying and eliminating mislabeled training instances. The goal of this technique is to improve classiication accuracies produced by learning algorithms by improving the quality of the training data. The approach employs an ensemble of clas-siiers that serve as a lter for the training data. Using an n-fold cross validation, the training data is passed through the lter. Only instances that the lter classiies correctly are passed to the-nal learning algorithm. We present an empirical evaluation of the approach for the task of automated land cover mapping from remotely sensed data. Labeling error arises in these data from a multitude of sources including lack of consistency in the vegetation classiication used, variable measurement techniques, and variation in the spatial sampling resolution. Our evaluation shows that for noise levels of less than 40%, lter-ing results in higher predictive accuracy than not ltering, and for levels of class noise less than or equal to 20% ltering allows the base-line accuracy to be retained. Our empirical results suggest that the ensemble lter approach is an eeective method for identifying labeling errors, and further , that the approach will signiicantly beneet ongoing research to develop accurate and robust remote sensing-based methods to map land cover at global scales.


Low-power energy harvester for wiegand transducers

This paper discusses the use of Wiegand magnetic sensors as energy harvesters for powering low-power electronic equipments. A Wiegand device typically releases a ~10 μs voltage pulse several volts wide when subject to an external, time-varying magnetic field. Due to the sharpness of the magnetic transition, pulse generation occurs regardless of how slow the magnetic field variation is, an attractive feature which enables its use in energy harvesting scenarios even when low-frequency sources are considered. The paper first identifies the theoretical conditions for maximum energy extraction. An efficient energy harvesting circuit is then proposed which interfaces the Wiegand source to a fixed DC voltage provided, for instance, by a rechargeable Lithium-Ion battery. Simulations and experimental results are provided supporting the developed theoretical framework and the effectiveness of the proposed implementation.


Improving Estimation Accuracy using Better Similarity Distance in Analogy-based Software Cost Estimation

Software cost estimation nowadays plays a more and more important role in practical projects since modern software projects become more and more complex as well as diverse. To help estimate software development cost accurately, this research does a systematic analysis of the similarity distances in analogy-based software cost estimation and based on this, a new non-orthogonal space distance (NoSD) is proposed as a measure of the similarities between real software projects. Different from currently adopted measures like the Euclidean distance and so on, this non-orthogonal space distance not only considers the different features to have different importance for cost estimation, but also assumes project features to have a non-orthogonal dependent relationship which is considered independent to each other in Euclidean distance. Based on such assumptions, NoSD method describes the non-orthogonal angles between feature axes using feature redundancy and it represents the feature weights using feature relevance, where both redundancy and relevance are defined in terms of mutual information. It can better reveal the real dependency relationships between real life software projects based on this non-orthogonal space distance. Also experiments show that it brings a greatest of 13.1% decrease of MMRE and a 12.5% increase of PRED(0.25) on ISBSG R8 dataset, and 7.5% and 20.5% respectively on the Desharnais dataset. Furthermore, to make it better fit the complex data distribution of real life software projects data, this research leverages the particle swarm optimization algorithm for an optimization of the proposed non-orthogonal space distance and proposes a PSO optimized non-orthogonal space distance (PsoNoSD). It brings further improvement in the estimation accuracy. As shown in experiments, compared with the normally used Euclidean distance, PsoNoSD improves the estimation accuracy by 38.73% and 11.59% in terms of MMRE and PRED(0.25) on ISBSG R8 dataset. On the Desharnais dataset, the improvements are 23.38% and 24.94% respectively. In summary, the new methods proposed in this research, which are based on theoretical study as well as systematic experiments, have solved some problems of currently used techniques and they show a great ability of notably improving the software cost estimation accuracy.


A Counterexample to Theorems of Cox and Fine

Cox s well known theorem justifying the use of probability is shown not to hold in nite domains The counterexample also suggests that Cox s assumptions are insu cient to prove the result even in in nite domains The same counterexample is used to disprove a result of Fine on comparative conditional probability


Location Assisted Coding (LAC): Embracing Interference in Free Space Optical Communications

As the number of wireless devices grows, the increasing demand for the shared radio frequency (RF) spectrum becomes a critical problem. Unlike wired communications in which, theoretically, more fibers can be used to accommodate the increasing bandwidth demand, wireless spectrum cannot be arbitrarily increased due to the fundamental limitations imposed by the physical laws. On the other hand, recent advances in free space optical (FSO) technologies promise a complementary approach to increase wireless capacity. However, high-speed FSO technologies are currently confined to short distance transmissions, resulting in limited mobility. In this paper, we briefly describe WiFO, a hybrid WiFi-FSO network for Gbps wireless local area network (WLAN) femtocells that can provide up to one Gbps per user while maintaining seamless mobility. While typical RF femtocells are non-overlapped to minimize inter-cell interference, there are advantages of using overlapped femtocells to increase mobility and throughput when the number of users is small. That said, the primary contribution of this paper will be a novel location assisted coding (LAC) technique used in the WiFO network that aims to increase throughput and reduce interference for multiple users in a dense array of femtocells. Both theoretical analysis and numerical experiments show orders of magnitude increase in throughput using LAC over basic codes.


Innovative enhancement of the Caesar cipher algorithm for cryptography

The Caesar Cipher algorithm for cryptography is one of the oldest algorithms. Now much newer algorithms have arrived that are much more secure, however in terms of speed of execution Caesar cipher algorithm is still the fastest owing to its simplicity. However the algorithm is extremely easy to crack. This is because in this algorithm each character of a message is always replaced by the same fixed character that has been predetermined. To improve the algorithm and enhance it's security feature, a few changes can be added. This paper proposes an enhancement to the existing algorithm by making use first of a simple Diffie-Hellman key exchange scenario to obtain a secret key and later using simple mathematics to ensure the encryption of data is much more safer. Once a private shared key is obtained by making use of the Diffie-Hellman method, the key is subject to the mod operation with 26 to obtain a value less than or equal to 26, then the current character is taken and to this the key value obtained is added to obtain a new character. For any character in the `x' position the key is simply first multiplied with `x' and then mod is done to obtain the encrypted character. So 2nd character of the message is multiplied with 2, third character with 3 and so on. This enhances the security and also does not increase the time of execution by a large margin.


Turret: A Platform for Automated Attack Finding in Unmodified Distributed System Implementations

Security and performance are critical goals for distributed systems. The increased design complexity, incomplete expertise of developers, and limited functionality of existing testing tools often result in bugs and vulnerabilities that prevent implementations from achieving their design goals in practice. Many of these bugs, vulnerabilities, and misconfigurations manifest after the code has already been deployed making the debugging process difficult and costly. In this paper, we present Turret, a platform for automatically finding performance attacks in unmodified implementations of distributed systems. Turret does not require the user to provide any information about vulnerabilities and runs the implementation in the same operating system setup as the deployment, with an emulated network. Turret uses a new attack finding algorithm and several optimizations that allow it to find attacks in a matter of minutes. We ran Turret on 5 different distributed system implementations specifically designed to tolerate insider attacks, and found 30 performance attacks, 24 of which were not previously reported to the best of our knowledge.


A Relational Approach to Monitoring Complex Systems

Monitoring is an essential part of many program development tools, and plays a central role in debugging, optimization, status reporting, and reconfiguration. Traditional monitoring techniques are inadequate when monitoring complex systems such as multiprocessors or distributed systems. A new approach is described in which a historical database forms the conceptual basis for the information processed by the monitor. This approach permits advances in specifying the low-level data collection, specifying the analysis of the collected data, performing the analysis, and displaying the results. Two prototype implementations demonstrate the feasibility of the approach.


Mapping and Localization in 3D Environments Using a 2D Laser Scanner and a Stereo Camera

2D laser scanners have been widely used for accomplishing a number of challenging AI and robotics tasks such as mapping of large environments and localization in highly dynamic environments. However, using only one 2D laser scanner could be insufficient and less reliable for accomplishing tasks in 3D environments. The problem could be solved using multiple 2D laser scanners or a 3D laser scanner for performing 3D perception. Unfortunately, the cost of such 3D sensing systems is still too high for enabling AI and robotics applications. In this paper, we propose to use a 2D laser scanner and a stereo camera for accomplishing simultaneous localization and mapping (SLAM) in 3D indoor environments in which the 2D laser scanner is used for SLAM and the stereo camera is used for 3D mapping. The experimental results demonstrate that the proposed system is lower cost yet effective, and the obstacle detection rate is significant improved compares to using one 2D laser scanner for mapping.


Architecting the next generation of service-based SCADA/DCS system of systems

SCADA and DCS systems are in the heart of the modern industrial infrastructure. The rapid changes in the networked embedded systems and the way industrial applications are designed and implemented, call for a shift in the architectural paradigm. Next generation SCADA and DCS systems will be able to foster cross-layer collaboration with the shop-floor devices as well as in-network and enterprise applications. Ecosystems driven by (web) service based interactions will enable stronger coupling of real-world and the business side, leading to a new generation of monitoring and control applications and services witnessed as the integration of large-scale systems of systems that are constantly evolving to address new user needs.


Information Processing in Medical Imaging

In this paper, we present novel algorithms to compute robust statistics from manifold-valued data. Specifically, we present algorithms for estimating the robust Fréchet Mean (FM) and performing a robust exact-principal geodesic analysis (ePGA) for data lying on known Riemannian manifolds. We formulate the minimization problems involved in both these problems using the minimum distance estimator called the L2E. This leads to a nonlinear optimization which is solved efficiently using a Riemannian accelerated gradient descent technique. We present competitive performance results of our algorithms applied to synthetic data with outliers, the corpus callosum shapes extracted from OASIS MRI database, and diffusion MRI scans from movement disorder patients respectively.


Complex Embeddings for Simple Link Prediction

In statistical relational learning, the link prediction problem is key to automatically understand the structure of large knowledge bases. As in previous studies, we propose to solve this problem through latent factorization. However, here we make use of complex valued embeddings. The composition of complex embeddings can handle a large variety of binary relations, among them symmetric and antisymmetric relations. Compared to state-of-the-art models such as Neural Tensor Network and Holographic Embeddings, our approach based on complex embeddings is arguably simpler, as it only uses the Hermitian dot product, the complex counterpart of the standard dot product between real vectors. Our approach is scalable to large datasets as it remains linear in both space and time, while consistently outperforming alternative approaches on standard link prediction benchmarks.1


SQuAD: 100, 000+ Questions for Machine Comprehension of Text

We present the Stanford Question Answering Dataset (SQuAD), a new reading comprehension dataset consisting of 100,000+ questions posed by crowdworkers on a set of Wikipedia articles, where the answer to each question is a segment of text from the corresponding reading passage. We analyze the dataset to understand the types of reasoning required to answer the questions, leaning heavily on dependency and constituency trees. We build a strong logistic regression model, which achieves an F1 score of 51.0%, a significant improvement over a simple baseline (20%). However, human performance (86.8%) is much higher, indicating that the dataset presents a good challenge problem for future research. The dataset is freely available at https://stanford-qa.com.


Freebase: A Shared Database of Structured General Human Knowledge

Freebase is a practical, scalable, graph-shaped database of structured general human knowledge, inspired by Semantic Web research and collaborative data communities such as the Wikipedia. Freebase allows public read and write access through an HTTP-based graph-query API for research, the creation and maintenance of structured data, and application building. Access is free and all data in Freebase has a very open (e.g. Creative Commons, GFDL) license.


TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehension

We present TriviaQA, a challenging reading comprehension dataset containing over 650K question-answer-evidence triples. TriviaQA includes 95K questionanswer pairs authored by trivia enthusiasts and independently gathered evidence documents, six per question on average, that provide high quality distant supervision for answering the questions. We show that, in comparison to other recently introduced large-scale datasets, TriviaQA (1) has relatively complex, compositional questions, (2) has considerable syntactic and lexical variability between questions and corresponding answer-evidence sentences, and (3) requires more cross sentence reasoning to find answers. We also present two baseline algorithms: a featurebased classifier and a state-of-the-art neural network, that performs well on SQuAD reading comprehension. Neither approach comes close to human performance (23% and 40% vs. 80%), suggesting that TriviaQA is a challenging testbed that is worth significant future study.1


Emotion recognition with multimodal features and temporal models

This paper presents our methods to the Audio-Video Based Emotion Recognition subtask in the 2017 Emotion Recognition in the Wild (EmotiW) Challenge. The task aims to predict one of the seven basic emotions for short video segments. We extract different features from audio and facial expression modalities. We also explore the temporal LSTM model with the input of frame facial features, which improves the performance of the non-temporal model. The fusion of different modality features and the temporal model lead us to achieve a 58.5% accuracy on the testing set, which shows the effectiveness of our methods.


Recommendation to Groups

Recommender systems have traditionally recommended items to individual users, but there has recently been a proliferation of recommenders that address their recommendations to groups of users. The shift of focus from an individual to a group makes more of a difference than one might at first expect. This chapter discusses the most important new issues that arise, organizing them in terms of four subtasks that can or must be dealt with by a group recommender: 1. acquiring information about the user’s preferences; 2. generating recommendations; 3. explaining recommendations; and 4. helping users to settle on a final decision. For each issue, we discuss how it has been dealt with in existing group recommender systems and what open questions call for further research.


The cyber threat landscape: Challenges and future research directions

Cyber threats are becoming more sophisticated with the blending of once distinct types of attack into more damaging forms. Increased variety and volume of attacks is inevitable given the desire of financially and criminally-motivated actors to obtain personal and confidential information, as highlighted in this paper. We describe how the Routine Activity Theory can be applied to mitigate these risks by reducing the opportunities for cyber crime to occur, making cyber crime more difficult to commit and by increasing the risks of detection and punishment associated with committing cyber crime. Potential research questions are also identified. a 2011 Elsevier Ltd. All rights reserved.


Genetics-Based Machine Learning for Rule Induction: State of the Art, Taxonomy, and Comparative Study

The classification problem can be addressed by numerous techniques and algorithms which belong to different paradigms of machine learning. In this paper, we are interested in evolutionary algorithms, the so-called genetics-based machine learning algorithms. In particular, we will focus on evolutionary approaches that evolve a set of rules, i.e., evolutionary rule-based systems, applied to classification tasks, in order to provide a state of the art in this field. This paper has a double aim: to present a taxonomy of the genetics-based machine learning approaches for rule induction, and to develop an empirical analysis both for standard classification and for classification with imbalanced data sets. We also include a comparative study of the genetics-based machine learning (GBML) methods with some classical non-evolutionary algorithms, in order to observe the suitability and high potential of the search performed by evolutionary algorithms and the behavior of the GBML algorithms in contrast to the classical approaches, in terms of classification accuracy.


A connectionist approach to dynamic resource management for virtualised network functions

Network Functions Virtualisation (NFV) continues to gain attention as a paradigm shift in the way telecommunications services are deployed and managed. By separating Network Functions (NFs) from traditional middleboxes, NFV is expected to lead to reduced CAPEX and OPEX, and to more agile services. However, one of the main challenges to achieving these objectives is on how physical resources can be efficiently, autonomously, and dynamically allocated to Virtualised Network Functions (VNFs) whose resource requirements ebb and flow. In this paper, we propose a Graph Neural Network (GNN)-based algorithm which exploits Virtual Network Function Forwarding Graph (VNF-FG) topology information to predict future resource requirements for each Virtual Network Function Component (VNFC). The topology information of each VNFC is derived from combining its past resource utilisation as well as the modelled effect on the same from VNFCs in its neighbourhood. Our proposal has been evaluated using a deployment of a virtualised IP Multimedia Subsystem (IMS), and real VoIP traffic traces, with results showing an average prediction accuracy of 90%. Moreover, compared to a scenario where resources are allocated manually and/or statically, our proposal reduces the average number of dropped calls by at least 27% and improves call setup latency by over 29%.


A Chopper Current-Feedback Instrumentation Amplifier With a 1 mHz $1/f$  Noise Corner and an AC-Coupled Ripple Reduction Loop

This paper presents a chopper instrumentation amplifier for interfacing precision thermistor bridges. For high CMRR and DC gain, the amplifier employs a three-stage current-feedback topology with nested-Miller compensation. By chopping both the input and intermediate stages of the amplifier, a 1 mHz 1/f noise corner was achieved at an input-referred noise power spectral density (PSD) of 15 nV/¿Hz. To reduce chopper ripple, the amplifier employs a continuous-time AC-coupled ripple reduction loop. Due to its continuous-time nature, the loop causes no noise folding to DC and hence offers improved noise performance over auto-zeroed amplifiers. The loop reduces chopper ripple by more than 60 dB, to levels below the amplifier's own input-referred noise. Furthermore, a maximum input referred offset of 5 ¿ V and a CMRR greater than 120 dB were measured at a supply current of 230 ¿A at 5 V.


Digitalism: The New Realism?

Today’s society is increasingly digitalised, with mobile smartphones being routinely carried and used by a significant percentage of the population. This provides an augmented experience for the individual that does not depend on their geographical separation with respect to their community of friends and other contacts. This changes the nature of relationships between people. Individuals may live in a “digital bubble”, close to others physically, but far away from them in their digital world. More specifically, digital images can be generated and shared with ever greater ease. Sometimes the digital image takes on an important part of the individual’s experience of reality. This paper explores examples of the phenomenon, within the context of the arts in particular and culture in general. We also consider the assortment of terms used in a variety of ways by researchers in different fields with regard to our ever more digital society, such as digitalism, digitality, digitalisation, digital culture, digital philosophy, etc. We survey these terms, exploring them from alternative viewpoints, including sociological and philosophical aspects, and attempt to pinpoint some of these terms more precisely, especially in a cultural and artistic context.


Strategic Business / IT Alignment using Goal Models

Since few years, enterprise information technologies (IT) are no more seen as a simple technological support for business strategies in the enterprise. Moreover, standalone IT departments are created in order to support evolution and growth of IT in the enterprise. Often, IT department defines a specific strategy describing vision, goals and objectives of IT development in the organization. However, to remain competitive, IT strategy and IT investment should be coherent with global enterprise strategies. The continuous process of preserving coherence between Business/IT strategies is widely known as strategic Business/IT alignment. Our work aims at discussing the relation between interview based Business IT alignement discovery and the Strategic Alignement Model proposed by Venkatraman. The paper proposes also modeling tools and engineering methodologies to support this alignment process.


On the use of X-vectors for Robust Speaker Recognition

Text-independent speaker verification (SV) is currently in the process of embracing DNN modeling in every stage of SV system. Slowly, the DNN-based approaches such as end-to-end modelling and systems based on DNN embeddings start to be competitive even in challenging and diverse channel conditions of recent NIST SREs. Domain adaptation and the need for a large amount of training data are still a challenge for current discriminative systems and (unlike with generative models), we see significant gains from data augmentation, simulation and other techniques designed to overcome lack of training data. We present an analysis of a SV system based on DNN embeddings (x-vectors) and focus on robustness across diverse data domains such as standard telephone and microphone conversations, both in clean, noisy and reverberant environments. We also evaluate the system on challenging far-field data created by re-transmitting a subset of NIST SRE 2008 and 2010 microphone interviews. We compare our results with the stateof-the-art i-vector system. In general, we were able to achieve better performance with the DNN-based systems, but most importantly, we have confirmed the robustness of such systems across multiple data domains.