OpenRaiser/Intern-Atlas huggingface dataset:
Optimal Design Method of MIMO Antenna Directivities and Corresponding Current Distributions by Using Spherical Mode Expansion
Venue: arXiv cs.IT 2017
Year: 2017

This paper proposes a new methodology to design optimal antennas for MIMO (Multi-Input Multi-Output) communication systems by using spherical mode expansion. Given spatial channel properties of a MIMO channel, such as the angular profile at both sides, the optimal MIMO antennas should provide the largest channel capacity with a constraint of the limited implementation space (volume). In designing a conventional MIMO antenna, first the antenna structure (current distribution) is determined, second antenna directivity is calculated based on the current distribution, and thirdly MIMO channel capacity is calculated by using given angular profiles and obtained antenna directivity. This process is repeated by adjusting the antenna structure until the performance satisfies a predefined threshold. To the contrary, this paper solves the optimization problem analytically and finally gives near optimal antenna structure (current distribution) without any greedy search. In the proposed process, first the optimal directivity of MIMO antennas is derived by applying spherical mode expansion to the angular profiles, and second a far-near field conversion is applied on the derived optimal directivity to achieve near optimal current distributions on a limited surface. The effectiveness of the proposed design methodology is validated via numerical calculation of MIMO channel capacity as in the conventional design method while giving near optimal current distribution with constraint of an antenna structure derived from proposed methodology.
Sparse Stochastic Bandits
Venue: arXiv cs.LG 2017
Year: 2017

In the classical multi-armed bandit problem, d arms are available to the decision maker who pulls them sequentially in order to maximize his cumulative reward. Guarantees can be obtained on a relative quantity called regret, which scales linearly with d (or with sqrt(d) in the minimax sense). We here consider the sparse case of this classical problem in the sense that only a small number of arms, namely s < d, have a positive expected reward. We are able to leverage this additional assumption to provide an algorithm whose regret scales with s instead of d. Moreover, we prove that this algorithm is optimal by providing a matching lower bound - at least for a wide and pertinent range of parameters that we determine - and by evaluating its performance on simulated data.
Visual Interaction Networks
Venue: arXiv cs.CV 2017
Year: 2017

From just a glance, humans can make rich predictions about the future state of a wide range of physical systems. On the other hand, modern approaches from engineering, robotics, and graphics are often restricted to narrow domains and require direct measurements of the underlying states. We introduce the Visual Interaction Network, a general-purpose model for learning the dynamics of a physical system from raw visual observations. Our model consists of a perceptual front-end based on convolutional neural networks and a dynamics predictor based on interaction networks. Through joint training, the perceptual front-end learns to parse a dynamic visual scene into a set of factored latent object representations. The dynamics predictor learns to roll these states forward in time by computing their interactions and dynamics, producing a predicted physical trajectory of arbitrary length. We found that from just six input video frames the Visual Interaction Network can generate accurate future trajectories of hundreds of time steps on a wide range of physical systems. Our model can also be applied to scenes with invisible objects, inferring their future states from their effects on the visible objects, and can implicitly infer the unknown mass of objects. Our results demonstrate that the perceptual module and the object-based dynamics predictor module can induce factored latent representations that support accurate dynamical predictions. This work opens new opportunities for model-based decision-making and planning from raw sensory observations in complex physical environments.
Cognitive Depletion in the Wild: a Case Study of NMR Spectroscopy Analysis
Venue: arXiv cs.HC 2017
Year: 2017

NMR spectroscopy analysis is a detail-oriented analytic feat that typically requires specific domain expertise and hours of concentration. This work presents an ethnographic-style study of this analysis process in the context of evaluating the symptoms of cognitive depletion. The repeated, non-trivial decisions required by and the time-consuming nature of NMR spectroscopy analysis make it an ideal, real-world scenario to study the symptoms of cognitive depletion, its effect on workflow and performance, and potential strategies for mitigating its deleterious effects.
Approximation Algorithms for Minimizing Maximum Sensor Movement for Line Barrier Coverage in the Plane
Venue: arXiv cs.DS 2017
Year: 2017

Given a line barrier and a set of mobile sensors distributed in the plane, the Minimizing Maximum Sensor Movement problem (MMSM) for \textcolor{black}{line barrier coverage} is to compute relocation positions for the sensors in the plane such that the barrier is entirely covered by the monitoring area of the sensors while the maximum relocation movement (distance) is minimized. Its weaker version, decision MMSM is to determine whether the barrier can be covered by the sensors within a given relocation distance bound $D\in\mathbb{Z}^{+}$. This paper presents three approximation algorithms for decision MMSM. The first is a simple greedy approach, which runs in time $O(n\log n)$ and achieves a maximum movement $D^{*}+2r_{max}$, where $n$ is the number of the sensors, $D^{*}$ is the maximum movement of an optimal solution and $r_{max}$ is the maximum radii of the sensors. The second and the third algorithms improve the maximum movement to $D^{*}+r_{max}$ , running in time $O(n^{7}L)$ and $O(R^{2}\sqrt{\frac{M}{\log R}})$ by applying linear programming (LP) rounding and maximal matching tchniques respecitvely, where $R=\sum2r_{i}$, which is $O(n)$ in practical scenarios of uniform sensing radius for all sensors, and $M\leq n\max r_{i}$. Applying the above algorithms for $O(\log(d_{max}))$ time in binary search immediately yields solutions to MMSM with the same performance guarantee. In addition, we also give a factor-2 approximation algorithm which can be used to improve the performance of the first three algorithms when $r_{max}>D^{*}$. As shown in \cite{dobrev2015complexity}, the 2-D MMSM problem admits no FPTAS as it is strongly NP-complete, so our algorithms arguably achieve the best possible ratio.
Symbolic Multibody Methods for Real-Time Simulation of Railway Vehicles
Venue: arXiv cs.RO 2017
Year: 2017

In this work, recently developed state-of-the-art symbolic multibody methods are tested to accurately model a complex railway vehicle. The model is generated using a symbolic implementation of the principle of the virtual power. Creep forces are modeled using a direct symbolic implementation of the standard linear Kalker model. No simplifications, as base parameter reduction, partial-linearization or look-up tables for contact kinematics, are used. An Implicit-Explicit integration scheme is proposed to efficiently deal with the stiff creep dynamics. Hard real-time performance is achieved: the CPU time required for a very stable 1 ms integration time step is 256 μs.
Text Summarization using Abstract Meaning Representation
Venue: arXiv cs.CL 2017
Year: 2017

With an ever increasing size of text present on the Internet, automatic summary generation remains an important problem for natural language understanding. In this work we explore a novel full-fledged pipeline for text summarization with an intermediate step of Abstract Meaning Representation (AMR). The pipeline proposed by us first generates an AMR graph of an input story, through which it extracts a summary graph and finally, generate summary sentences from this summary graph. Our proposed method achieves state-of-the-art results compared to the other text summarization routines based on AMR. We also point out some significant problems in the existing evaluation methods, which make them unsuitable for evaluating summary quality.
A General-Purpose Tagger with Convolutional Neural Networks
Venue: arXiv cs.CL 2017
Year: 2017

We present a general-purpose tagger based on convolutional neural networks (CNN), used for both composing word vectors and encoding context information. The CNN tagger is robust across different tagging tasks: without task-specific tuning of hyper-parameters, it achieves state-of-the-art results in part-of-speech tagging, morphological tagging and supertagging. The CNN tagger is also robust against the out-of-vocabulary problem, it performs well on artificially unnormalized texts.
Clustering Spectrum of scale-free networks
Venue: arXiv cs.SI 2017
Year: 2017

Real-world networks often have power-law degrees and scale-free properties such as ultra-small distances and ultra-fast information spreading. In this paper, we study a third universal property: three-point correlations that suppress the creation of triangles and signal the presence of hierarchy. We quantify this property in terms of $\bar c(k)$, the probability that two neighbors of a degree-$k$ node are neighbors themselves. We investigate how the clustering spectrum $k\mapsto\bar c(k)$ scales with $k$ in the hidden variable model and show that $c(k)$ follows a {\it universal curve} that consists of three $k$-ranges where $\bar c(k)$ remains flat, starts declining, and eventually settles on a power law $\bar c(k)\sim k^{-α}$ with $α$ depending on the power law of the degree distribution. We test these results against ten contemporary real-world networks and explain analytically why the universal curve properties only reveal themselves in large networks.
Visualization of Constraint Handling Rules: Semantics and Applications
Venue: arXiv cs.SE 2017
Year: 2017

The work in the paper presents an animation extension ($CHR^{vis}$) to Constraint Handling Rules (CHR). Visualizations have always helped programmers understand data and debug programs. A picture is worth a thousand words. It can help identify where a problem is or show how something works. It can even illustrate a relation that was not clear otherwise. $CHR^{vis}$ aims at embedding animation and visualization features into CHR programs. It thus enables users, while executing programs, to have such executions animated. The paper aims at providing the operational semantics for $CHR^{vis}$. The correctness of $CHR^{vis}$ programs is also discussed. Some applications of the new extension are also introduced.
Joint Fractional Time Allocation and Beamforming for Downlink Multiuser MISO Systems
Venue: arXiv cs.IT 2017
Year: 2017

It is well-known that the traditional transmit beamforming at a base station (BS) to manage interference in serving multiple users is effective only when the number of users is less than the number of transmit antennas at the BS. Non-orthogonal multiple access (NOMA) can improve the throughput of users with poorer channel conditions by compromising their own privacy because other users with better channel conditions can decode the information of users in poorer channel state. NOMA still prefers that the number of users is less than the number of antennas at the BS transmitter. This paper resolves such issues by allocating separate fractional time slots for serving the users with similar channel conditions. This enables the BS to serve more users within the time unit while the privacy of each user is preserved. The fractional times and beamforming vectors are jointly optimized to maximize the system's throughput. An efficient path-following algorithm, which invokes a simple convex quadratic program at each iteration, is proposed for the solution of this challenging optimization problem. Numerical results confirm its versatility.
Deep Alignment Network: A convolutional neural network for robust face alignment
Venue: arXiv cs.CV 2017
Year: 2017

In this paper, we propose Deep Alignment Network (DAN), a robust face alignment method based on a deep neural network architecture. DAN consists of multiple stages, where each stage improves the locations of the facial landmarks estimated by the previous stage. Our method uses entire face images at all stages, contrary to the recently proposed face alignment methods that rely on local patches. This is possible thanks to the use of landmark heatmaps which provide visual information about landmark locations estimated at the previous stages of the algorithm. The use of entire face images rather than patches allows DAN to handle face images with large variation in head pose and difficult initializations. An extensive evaluation on two publicly available datasets shows that DAN reduces the state-of-the-art failure rate by up to 70%. Our method has also been submitted for evaluation as part of the Menpo challenge.
Information Bottleneck in Control Tasks with Recurrent Spiking Neural Networks
Venue: arXiv cs.NE 2017
Year: 2017

The nervous system encodes continuous information from the environment in the form of discrete spikes, and then decodes these to produce smooth motor actions. Understanding how spikes integrate, represent, and process information to produce behavior is one of the greatest challenges in neuroscience. Information theory has the potential to help us address this challenge. Informational analyses of deep and feed-forward artificial neural networks solving static input-output tasks, have led to the proposal of the \emph{Information Bottleneck} principle, which states that deeper layers encode more relevant yet minimal information about the inputs. Such an analyses on networks that are recurrent, spiking, and perform control tasks is relatively unexplored. Here, we present results from a Mutual Information analysis of a recurrent spiking neural network that was evolved to perform the classic pole-balancing task. Our results show that these networks deviate from the \emph{Information Bottleneck} principle prescribed for feed-forward networks.
Full Quantification of Left Ventricle via Deep Multitask Learning Network Respecting Intra- and Inter-Task Relatedness
Venue: arXiv cs.CV 2017
Year: 2017

Cardiac left ventricle (LV) quantification is among the most clinically important tasks for identification and diagnosis of cardiac diseases, yet still a challenge due to the high variability of cardiac structure and the complexity of temporal dynamics. Full quantification, i.e., to simultaneously quantify all LV indices including two areas (cavity and myocardium), six regional wall thicknesses (RWT), three LV dimensions, and one cardiac phase, is even more challenging since the uncertain relatedness intra and inter each type of indices may hinder the learning procedure from better convergence and generalization. In this paper, we propose a newly-designed multitask learning network (FullLVNet), which is constituted by a deep convolution neural network (CNN) for expressive feature embedding of cardiac structure; two followed parallel recurrent neural network (RNN) modules for temporal dynamic modeling; and four linear models for the final estimation. During the final estimation, both intra- and inter-task relatedness are modeled to enforce improvement of generalization: 1) respecting intra-task relatedness, group lasso is applied to each of the regression tasks for sparse and common feature selection and consistent prediction; 2) respecting inter-task relatedness, three phase-guided constraints are proposed to penalize violation of the temporal behavior of the obtained LV indices. Experiments on MR sequences of 145 subjects show that FullLVNet achieves high accurate prediction with our intra- and inter-task relatedness, leading to MAE of 190mm$^2$, 1.41mm, 2.68mm for average areas, RWT, dimensions and error rate of 10.4\% for the phase classification. This endows our method a great potential in comprehensive clinical assessment of global, regional and dynamic cardiac function.
On Separating Points by Lines
Venue: arXiv cs.CG 2017
Year: 2017

Given a set $P$ of $n$ points in the plane, its separability is the minimum number of lines needed to separate all its pairs of points from each other. We show that the minimum number of lines needed to separate $n$ points, picked randomly (and uniformly) in the unit square, is $Θ( n^{2/3})$, where $Θ$ hides polylogarithmic factors. In addition, we provide a fast approximation algorithm for computing the separability of a given point set in the plane. Finally, we point out the connection between separability and partitions.
On Guarding Orthogonal Polygons with Bounded Treewidth
Venue: arXiv cs.CG 2017
Year: 2017

There exist many variants of guarding an orthogonal polygon in an orthogonal fashion: sometimes a guard can see an entire rectangle, or along a staircase, or along an orthogonal path with at most $k$ bends. In this paper, we study all these guarding models in the special case of orthogonal polygons that have bounded treewidth in some sense. Exploiting algorithms for graphs of bounded treewidth, we show that the problem of finding the minimum number of guards in these models becomes linear-time solvable in orthogonal polygons of bounded treewidth.
DeepSketch2Face: A Deep Learning Based Sketching System for 3D Face and Caricature Modeling
Venue: arXiv cs.GR 2017
Year: 2017

Face modeling has been paid much attention in the field of visual computing. There exist many scenarios, including cartoon characters, avatars for social media, 3D face caricatures as well as face-related art and design, where low-cost interactive face modeling is a popular approach especially among amateur users. In this paper, we propose a deep learning based sketching system for 3D face and caricature modeling. This system has a labor-efficient sketching interface, that allows the user to draw freehand imprecise yet expressive 2D lines representing the contours of facial features. A novel CNN based deep regression network is designed for inferring 3D face models from 2D sketches. Our network fuses both CNN and shape based features of the input sketch, and has two independent branches of fully connected layers generating independent subsets of coefficients for a bilinear face representation. Our system also supports gesture based interactions for users to further manipulate initial face models. Both user studies and numerical results indicate that our sketching system can help users create face models quickly and effectively. A significantly expanded face database with diverse identities, expressions and levels of exaggeration is constructed to promote further research and evaluation of face modeling techniques.
Epistemic Logic with Functional Dependency Operator
Venue: arXiv cs.AI 2017
Year: 2017

Epistemic logic with non-standard knowledge operators, especially the "knowing-value" operator, has recently gathered much attention. With the "knowing-value" operator, we can express knowledge of individual variables, but not of the relations between them in general. In this paper, we propose a new operator Kf to express knowledge of the functional dependencies between variables. The semantics of this Kf operator uses a function domain which imposes a constraint on what counts as a functional dependency relation. By adjusting this function domain, different interesting logics arise, and in this paper we axiomatize three such logics in a single agent setting. Then we show how these three logics can be unified by allowing the function domain to vary relative to different agents and possible worlds. A multiagent axiomatization is given in this case.
Spectral Efficient and Energy Aware Clustering in Cellular Networks
Venue: arXiv cs.NI 2017
Year: 2017

The current and envisaged increase of cellular traffic poses new challenges to Mobile Network Operators (MNO), who must densify their Radio Access Networks (RAN) while maintaining low Capital Expenditure and Operational Expenditure to ensure long-term sustainability. In this context, this paper analyses optimal clustering solutions based on Device-to-Device (D2D) communications to mitigate partially or completely the need for MNOs to carry out extremely dense RAN deployments. Specifically, a low complexity algorithm that enables the creation of spectral efficient clusters among users from different cells, denoted as enhanced Clustering Optimization for Resources' Efficiency (eCORE) is presented. Due to the imbalance between uplink and downlink traffic, a complementary algorithm, known as Clustering algorithm for Load Balancing (CaLB), is also proposed to create non-spectral efficient clusters when they result in a capacity increase. Finally, in order to alleviate the energy overconsumption suffered by cluster heads, the Clustering Energy Efficient algorithm (CEEa) is also designed to manage the trade-off between the capacity enhancement and the early battery drain of some users. Results show that the proposed algorithms increase the network capacity and outperform existing solutions, while, at the same time, CEEa is able to handle the cluster heads energy overconsumption.
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
Venue: arXiv cs.DS 2017
Year: 2017

The problem presented in this paper is a generalization of the usual coupled-tasks scheduling problem in presence of compatibility constraints. The reason behind this study is the data acquisition problem for a submarine torpedo. We investigate a particular configuration for coupled tasks (any task is divided into two sub-tasks separated by an idle time), in which the idle time of a coupled task is equal to the sum of durations of its two sub-tasks. We prove -completeness of the minimization of the schedule length, we show that finding a solution to our problem amounts to solving a graph problem, which in itself is close to the minimum-disjoint-path cover (min-DCP) problem. We design a (3a+2b)/(2a+2b)-approximation, where a and b (the processing time of the two sub-tasks) are two input data such as a>b>0, and that leads to a ratio between 3/2 and 5/4. Using a polynomial-time algorithm developed for some class of graph of min-DCP, we show that the ratio decreases to 1.37 .
Classifying the Correctness of Generated White-Box Tests: An Exploratory Study
Venue: arXiv cs.SE 2017
Year: 2017

White-box test generator tools rely only on the code under test to select test inputs, and capture the implementation's output as assertions. If there is a fault in the implementation, it could get encoded in the generated tests. Tool evaluations usually measure fault-detection capability using the number of such fault-encoding tests. However, these faults are only detected, if the developer can recognize that the encoded behavior is faulty. We designed an exploratory study to investigate how developers perform in classifying generated white-box test as faulty or correct. We carried out the study in a laboratory setting with 54 graduate students. The tests were generated for two open-source projects with the help of the IntelliTest tool. The performance of the participants were analyzed using binary classification metrics and by coding their observed activities. The results showed that participants incorrectly classified a large number of both fault-encoding and correct tests (with median misclassification rate 33% and 25% respectively). Thus the real fault-detection capability of test generators could be much lower than typically reported, and we suggest to take this human factor into account when evaluating generated white-box tests.