OpenRaiser/Intern-Atlas huggingface dataset:
Population-based Respiratory 4D Motion Atlas Construction and its Application for VR Simulations of Liver Punctures
Venue: arXiv cs.CV 2017
Year: 2017

Virtual reality (VR) training simulators of liver needle insertion in the hepatic area of breathing virtual patients currently need 4D data acquisitions as a prerequisite. Here, first a population-based breathing virtual patient 4D atlas can be built and second the requirement of a dose-relevant or expensive acquisition of a 4D data set for a new static 3D patient can be mitigated by warping the mean atlas motion. The breakthrough contribution of this work is the construction and reuse of population-based learned 4D motion models.
Co-domain Embedding using Deep Quadruplet Networks for Unseen Traffic Sign Recognition
Venue: arXiv cs.CV 2017
Year: 2017

Recent advances in visual recognition show overarching success by virtue of large amounts of supervised data. However,the acquisition of a large supervised dataset is often challenging. This is also true for intelligent transportation applications, i.e., traffic sign recognition. For example, a model trained with data of one country may not be easily generalized to another country without much data. We propose a novel feature embedding scheme for unseen class classification when the representative class template is given. Traffic signs, unlike other objects, have official images. We perform co-domain embedding using a quadruple relationship from real and synthetic domains. Our quadruplet network fully utilizes the explicit pairwise similarity relationships among samples from different domains. We validate our method on three datasets with two experiments involving one-shot classification and feature generalization. The results show that the proposed method outperforms competing approaches on both seen and unseen classes.
What's in my closet?: Image classification using fuzzy logic
Venue: arXiv cs.CV 2017
Year: 2017

A fuzzy system was created in MATLAB to identify an item of clothing as a dress, shirt, or pair of pants from a series of input images. The system was initialized using a high-contrast vector-image of each item of clothing as the state closest to a direct solution. Nine other user-input images (three of each item) were also used to determine the characteristic function of each item and recognize each pattern. Mamdani inference systems were used for edge location and identification of characteristic regions of interest for each item of clothing. Based on these non-dimensional trends, a second Mamdani fuzzy inference system was used to characterize each image as containing a shirt, a dress, or a pair of pants. An outline of the fuzzy inference system and image processing techniques used for creating an image pattern recognition system are discussed.
High-order Discretization of a Gyrokinetic Vlasov Model in Edge Plasma Geometry
Venue: arXiv cs.CE 2017
Year: 2017

We present a high-order spatial discretization of a continuum gyrokinetic Vlasov model in axisymmetric tokamak edge plasma geometries. Such models describe the phase space advection of plasma species distribution functions in the absence of collisions. The gyrokinetic model is posed in a four-dimensional phase space, upon which a grid is imposed when discretized. To mitigate the computational cost associated with high-dimensional grids, we employ a high-order discretization to reduce the grid size needed to achieve a given level of accuracy relative to lower-order methods. Strong anisotropy induced by the magnetic field motivates the use of mapped coordinate grids aligned with magnetic flux surfaces. The natural partitioning of the edge geometry by the separatrix between the closed and open field line regions leads to the consideration of multiple mapped blocks, in what is known as a mapped multiblock (MMB) approach. We describe the specialization of a more general formalism that we have developed for the construction of high-order, finite-volume discretizations on MMB grids, yielding the accurate evaluation of the gyrokinetic Vlasov operator, the metric factors resulting from the MMB coordinate mappings, and the interaction of blocks at adjacent boundaries. Our conservative formulation of the gyrokinetic Vlasov model incorporates the fact that the phase space velocity has zero divergence, which must be preserved discretely to avoid truncation error accumulation. We describe an approach for the discrete evaluation of the gyrokinetic phase space velocity that preserves the divergence-free property to machine precision.
Evaluating the Usability of Automatically Generated Captions for People who are Deaf or Hard of Hearing
Venue: arXiv cs.HC 2017
Year: 2017

The accuracy of Automated Speech Recognition (ASR) technology has improved, but it is still imperfect in many settings. Researchers who evaluate ASR performance often focus on improving the Word Error Rate (WER) metric, but WER has been found to have little correlation with human-subject performance on many applications. We propose a new captioning-focused evaluation metric that better predicts the impact of ASR recognition errors on the usability of automatically generated captions for people who are Deaf or Hard of Hearing (DHH). Through a user study with 30 DHH users, we compared our new metric with the traditional WER metric on a caption usability evaluation task. In a side-by-side comparison of pairs of ASR text output (with identical WER), the texts preferred by our new metric were preferred by DHH participants. Further, our metric had significantly higher correlation with DHH participants' subjective scores on the usability of a caption, as compared to the correlation between WER metric and participant subjective scores. This new metric could be used to select ASR systems for captioning applications, and it may be a better metric for ASR researchers to consider when optimizing ASR systems.
Selective Jamming of LoRaWAN using Commodity Hardware
Venue: arXiv cs.NI 2017
Year: 2017

Long range, low power networks are rapidly gaining acceptance in the Internet of Things (IoT) due to their ability to economically support long-range sensing and control applications while providing multi-year battery life. LoRa is a key example of this new class of network and is being deployed at large scale in several countries worldwide. As these networks move out of the lab and into the real world, they expose a large cyber-physical attack surface. Securing these networks is therefore both critical and urgent. This paper highlights security issues in LoRa and LoRaWAN that arise due to the choice of a robust but slow modulation type in the protocol. We exploit these issues to develop a suite of practical attacks based around selective jamming. These attacks are conducted and evaluated using commodity hardware. The paper concludes by suggesting a range of countermeasures that can be used to mitigate the attacks.
Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting
Venue: arXiv cs.DM 2017
Year: 2017

Mixed-integer mathematical programs are among the most commonly used models for a wide set of problems in Operations Research and related fields. However, there is still very little known about what can be expressed by small mixed-integer programs. In particular, prior to this work, it was open whether some classical problems, like the minimum odd-cut problem, can be expressed by a compact mixed-integer program with few (even constantly many) integer variables. This is in stark contrast to linear formulations, where recent breakthroughs in the field of extended formulations have shown that many polytopes associated to classical combinatorial optimization problems do not even admit approximate extended formulations of sub-exponential size. We provide a general framework for lifting inapproximability results of extended formulations to the setting of mixed-integer extended formulations, and obtain almost tight lower bounds on the number of integer variables needed to describe a variety of classical combinatorial optimization problems. Among the implications we obtain, we show that any mixed-integer extended formulation of sub-exponential size for the matching polytope, cut polytope, traveling salesman polytope or dominant of the odd-cut polytope, needs $ Ω(n/\log n) $ many integer variables, where $ n $ is the number of vertices of the underlying graph. Conversely, the above-mentioned polyhedra admit polynomial-size mixed-integer formulations with only $ O(n) $ or $ O(n \log n) $ (for the traveling salesman polytope) many integer variables. Our results build upon a new decomposition technique that, for any convex set $ C $, allows for approximating any mixed-integer description of $ C $ by the intersection of $ C $ with the union of a small number of affine subspaces.
Android Multi-Level System Permission Management Approach
Venue: arXiv cs.CR 2017
Year: 2017

With the expansion of the market share occupied by the Android platform, security issues (especially application security) have become attention focus of researchers. In fact, the existing methods lack the capabilities to manage application permissions without root privilege. This study proposes a dynamic management mechanism of Android application permissions based on security policies. The paper first describes the permissions by security policies, then implementes permission checking code and request evaluation algorithm in Android framework layer. Experimental results indicate that the presented approach succeeds in permission management of Android applications, and its system overhead is low, which makes it an effective method for Android permission management.
Stochastic Geometry Analysis of Ultra-Dense Networks: Impact of Antenna Height and Performance Limits
Venue: arXiv cs.IT 2017
Year: 2017

The concept of Ultra Dense Networks (UDN) is often seen as a key enabler of the next generation mobile networks. However, existing analysis of UDNs, including Stochastic Geometry, has not been able to fully determine the potential gains and limits of densification. In this paper we study performance of UDNs in downlink and provide new insights on the impact of antenna height and careful site selection on the network performance. We focus our investigation on the probability of coverage, average cell rate and average area spectral efficiency for networks with regular and random BS deployments. We show that under a path-loss model which considers antenna height there exists an upper limit on network performance which is dependent on the path-loss model parameters. Our analysis shows an interesting finding that even for over-densified networks a non-negligible system performance can be achieved.
Tomographic Reconstruction using Global Statistical Prior
Venue: arXiv cs.CV 2017
Year: 2017

Recent research in tomographic reconstruction is motivated by the need to efficiently recover detailed anatomy from limited measurements. One of the ways to compensate for the increasingly sparse sets of measurements is to exploit the information from templates, i.e., prior data available in the form of already reconstructed, structurally similar images. Towards this, previous work has exploited using a set of global and patch based dictionary priors. In this paper, we propose a global prior to improve both the speed and quality of tomographic reconstruction within a Compressive Sensing framework. We choose a set of potential representative 2D images referred to as templates, to build an eigenspace; this is subsequently used to guide the iterative reconstruction of a similar slice from sparse acquisition data. Our experiments across a diverse range of datasets show that reconstruction using an appropriate global prior, apart from being faster, gives a much lower reconstruction error when compared to the state of the art.
A Macromodeling Approach to Efficiently Compute Scattering from Large Arrays of Complex Scatterers
Venue: arXiv cs.CE 2017
Year: 2017

Full-wave electromagnetic simulations of electrically large arrays of complex antennas and scatterers are challenging, as they consume large amount of memory and require long CPU times. This paper presents a new reduced-order modeling technique to compute scattering and radiation from large arrays of complex scatterers and antennas. In the proposed technique, each element of the array is replaced by an equivalent electric current distribution on a fictitious closed surface enclosing the element. This equivalent electric current density is derived using the equivalence theorem and it is related to the surface currents on the scatterer by the Stratton-Chu formulation. With the proposed approach, instead of directly solving for the unknown surface current density on the scatterers, we only need to solve for the unknowns on the equivalent surface. This approach leads to a reduction in the number of unknowns and better conditioning when it is applied to problems involving complex scatterers with multiscale features. Furthermore, the proposed approach is accelerated with the adaptive integral equation method to solve large problems. As illustrated in several practical examples, the proposed method yields speed up of up to 20 times and consumes up to 12 times less memory than the standard method of moments accelerated with the adaptive integral method.
On Colouring $(2P_2,H)$-Free and $(P_5,H)$-Free Graphs
Venue: arXiv cs.CC 2017
Year: 2017

The Colouring problem asks whether the vertices of a graph can be coloured with at most $k$ colours for a given integer $k$ in such a way that no two adjacent vertices receive the same colour. A graph is $(H_1,H_2)$-free if it has no induced subgraph isomorphic to $H_1$ or $H_2$. A connected graph $H_1$ is almost classified if Colouring on $(H_1,H_2)$-free graphs is known to be polynomial-time solvable or NP-complete for all but finitely many connected graphs $H_2$. We show that every connected graph $H_1$ apart from the claw $K_{1,3}$ and the $5$-vertex path $P_5$ is almost classified. We also prove a number of new hardness results for Colouring on $(2P_2,H)$-free graphs. This enables us to list all graphs $H$ for which the complexity of Colouring is open on $(2P_2,H)$-free graphs and all graphs $H$ for which the complexity of Colouring is open on $(P_5,H)$-free graphs. In fact we show that these two lists coincide. Moreover, we show that the complexities of Colouring for $(2P_2,H)$-free graphs and for $(P_5,H)$-free graphs are the same for all known cases.
Deep Primal-Dual Reinforcement Learning: Accelerating Actor-Critic using Bellman Duality
Venue: arXiv cs.LG 2017
Year: 2017

We develop a parameterized Primal-Dual $π$ Learning method based on deep neural networks for Markov decision process with large state space and off-policy reinforcement learning. In contrast to the popular Q-learning and actor-critic methods that are based on successive approximations to the nonlinear Bellman equation, our method makes primal-dual updates to the policy and value functions utilizing the fundamental linear Bellman duality. Naive parametrization of the primal-dual $π$ learning method using deep neural networks would encounter two major challenges: (1) each update requires computing a probability distribution over the state space and is intractable; (2) the iterates are unstable since the parameterized Lagrangian function is no longer linear. We address these challenges by proposing a relaxed Lagrangian formulation with a regularization penalty using the advantage function. We show that the dual policy update step in our method is equivalent to the policy gradient update in the actor-critic method in some special case, while the value updates differ substantially. The main advantage of the primal-dual $π$ learning method lies in that the value and policy updates are closely coupled together using the Bellman duality and therefore more informative. Experiments on a simple cart-pole problem show that the algorithm significantly outperforms the one-step temporal-difference actor-critic method, which is the most relevant benchmark method to compare with. We believe that the primal-dual updates to the value and policy functions would expedite the learning process. The proposed methods might open a door to more efficient algorithms and sharper theoretical analysis.
Semi-Supervised Learning with IPM-based GANs: an Empirical Study
Venue: arXiv cs.LG 2017
Year: 2017

We present an empirical investigation of a recent class of Generative Adversarial Networks (GANs) using Integral Probability Metrics (IPM) and their performance for semi-supervised learning. IPM-based GANs like Wasserstein GAN, Fisher GAN and Sobolev GAN have desirable properties in terms of theoretical understanding, training stability, and a meaningful loss. In this work we investigate how the design of the critic (or discriminator) influences the performance in semi-supervised learning. We distill three key take-aways which are important for good SSL performance: (1) the K+1 formulation, (2) avoiding batch normalization in the critic and (3) avoiding gradient penalty constraints on the classification layer.
Fair mixing: the case of dichotomous preferences
Venue: arXiv cs.GT 2017
Year: 2017

Agents vote to choose a fair mixture of public outcomes; each agent likes or dislikes each outcome. We discuss three outstanding voting rules. The Conditional Utilitarian rule, a variant of the random dictator, is Strategyproof and guarantees to any group of like-minded agents an influence proportional to its size. It is easier to compute and more efficient than the familiar Random Priority rule. Its worst case (resp. average) inefficiency is provably (resp. in numerical experiments) low if the number of agents is low. The efficient Egalitarian rule protects similarly individual agents but not coalitions. It is Excludable Strategyproof: I do not want to lie if I cannot consume outcomes I claim to dislike. The efficient Nash Max Product rule offers the strongest welfare guarantees to coalitions, who can force any outcome with a probability proportional to their size. But it fails even the excludable form of Strategyproofness.
Towards a Holistic Approach to Designing Theory-based Mobile Health Interventions
Venue: arXiv cs.HC 2017
Year: 2017

Increasing evidence has shown that theory-based health behavior change interventions are more effective than non-theory-based ones. However, only a few segments of relevant studies were theory-based, especially the studies conducted by non-psychology researchers. On the other hand, many mobile health interventions, even those based on the behavioral theories, may still fail in the absence of a user-centered design process. The gap between behavioral theories and user-centered design increases the difficulty of designing and implementing mobile health interventions. To bridge this gap, we propose a holistic approach to designing theory-based mobile health interventions built on the existing theories and frameworks of three categories: (1) behavioral theories (e.g., the Social Cognitive Theory, the Theory of Planned Behavior, and the Health Action Process Approach), (2) the technological models and frameworks (e.g., the Behavior Change Techniques, the Persuasive System Design and Behavior Change Support System, and the Just-in-Time Adaptive Interventions), and (3) the user-centered systematic approaches (e.g., the CeHRes Roadmap, the Wendel's Approach, and the IDEAS Model). This holistic approach provides researchers a lens to see the whole picture for developing mobile health interventions.
Dynamic Fault Trees Analysis using an Integration of Theorem Proving and Model Checking
Venue: arXiv cs.LO 2017
Year: 2017

Dynamic fault trees (DFTs) have emerged as an important tool for capturing the dynamic behavior of system failure. These DFTs are then analyzed qualitatively and quantitatively using stochastic or algebraic methods to judge the failure characteristics of the given system in terms of the failures of its sub-components. Model checking has been recently proposed to conduct the failure analysis of systems using DFTs with the motivation to provide a rigorous failure analysis of safety-critical systems. However, model checking has not been used for the DFT qualitative analysis and the reduction algorithms used in model checking are usually not formally verified. Moreover, the analysis time grows exponentially with the increase of the number of states. These issues limit the usefulness of model checking for analyzing complex systems used in safety-critical domains, where the accuracy and completeness of analysis matters the most. To overcome these limitations, we propose a comprehensive methodology to perform the qualitative and quantitative analysis of DFTs using an integration of theorem proving and model checking based approaches. For this purpose, we formalized all the basic dynamic fault tree gates using higher-order logic based on the algebraic approach and formally verified some of the simplification properties. This formalization allows us to formally verify the equivalence between the original and reduced DFTs using a theorem prover, and conduct the qualitative analysis. We then use model checking to perform the quantitative analysis of the formally verified reduced DFT. We applied our methodology to five benchmarks and the results show that the formally verified reduced DFT was analyzed using model checking with up to six times less states and up to 133000 times faster.
A Pilot Study on Using an Intelligent Life-like Robot as a Companion for Elderly Individuals with Dementia and Depression
Venue: arXiv cs.RO 2017
Year: 2017

This paper presents the design, development, methodology, and the results of a pilot study on using an intelligent, emotive and perceptive social robot (aka Companionbot) for improving the quality of life of elderly people with dementia and/or depression. Ryan Companionbot prototyped in this project, is a rear-projected life-like conversational robot. Ryan is equipped with features that can (1) interpret and respond to users' emotions through facial expressions and spoken language, (2) proactively engage in conversations with users, and (3) remind them about their daily life schedules (e.g. taking their medicine on time). Ryan engages users in cognitive games and reminiscence activities. We conducted a pilot study with six elderly individuals with moderate dementia and/or depression living in a senior living facility in Denver. Each individual had 24/7 access to a Ryan in his/her room for a period of 4-6 weeks. Our observations of these individuals, interviews with them and their caregivers, and analyses of their interactions during this period revealed that they established rapport with the robot and greatly valued and enjoyed having a Companionbot in their room.