OpenRaiser/Intern-Atlas huggingface dataset:
Attributed Social Network Embedding
Venue: arXiv cs.SI 2017
Year: 2017

Embedding network data into a low-dimensional vector space has shown promising performance for many real-world applications, such as node classification and entity retrieval. However, most existing methods focused only on leveraging network structure. For social networks, besides the network structure, there also exists rich information about social actors, such as user profiles of friendship networks and textual content of citation networks. These rich attribute information of social actors reveal the homophily effect, exerting huge impacts on the formation of social networks. In this paper, we explore the rich evidence source of attributes in social networks to improve network embedding. We propose a generic Social Network Embedding framework (SNE), which learns representations for social actors (i.e., nodes) by preserving both the structural proximity and attribute proximity. While the structural proximity captures the global network structure, the attribute proximity accounts for the homophily effect. To justify our proposal, we conduct extensive experiments on four real-world social networks. Compared to the state-of-the-art network embedding approaches, SNE can learn more informative representations, achieving substantial gains on the tasks of link prediction and node classification. Specifically, SNE significantly outperforms node2vec with an 8.2% relative improvement on the link prediction task, and a 12.7% gain on the node classification task.
EffiTest: Efficient Delay Test and Statistical Prediction for Configuring Post-silicon Tunable Buffers
Venue: arXiv cs.AR 2017
Year: 2017

At nanometer manufacturing technology nodes, process variations significantly affect circuit performance. To combat them, post- silicon clock tuning buffers can be deployed to balance timing bud- gets of critical paths for each individual chip after manufacturing. The challenge of this method is that path delays should be mea- sured for each chip to configure the tuning buffers properly. Current methods for this delay measurement rely on path-wise frequency stepping. This strategy, however, requires too much time from ex- pensive testers. In this paper, we propose an efficient delay test framework (EffiTest) to solve the post-silicon testing problem by aligning path delays using the already-existing tuning buffers in the circuit. In addition, we only test representative paths and the delays of other paths are estimated by statistical delay prediction. Exper- imental results demonstrate that the proposed method can reduce the number of frequency stepping iterations by more than 94% with only a slight yield loss.
Max-min Fair Beamforming for SWIPT Systems with Non-linear EH Model
Venue: arXiv cs.IT 2017
Year: 2017

We study the beamforming design for multiuser systems with simultaneous wireless information and power transfer (SWIPT). Employing a practical non-linear energy harvesting (EH) model, the design is formulated as a non-convex optimization problem for the maximization of the minimum harvested power across several energy harvesting receivers. The proposed problem formulation takes into account imperfect channel state information (CSI) and a minimum required signal-to-interference-plus-noise ratio (SINR). The globally optimal solution of the design problem is obtained via the semidefinite programming (SDP) relaxation approach. Interestingly, we can show that at most one dedicated energy beam is needed to achieve optimality. Numerical results demonstrate that with the proposed design a significant performance gain and improved fairness can be provided to the users compared to two baseline schemes.
AirSim: High-Fidelity Visual and Physical Simulation for Autonomous Vehicles
Venue: arXiv cs.RO 2017
Year: 2017

Developing and testing algorithms for autonomous vehicles in real world is an expensive and time consuming process. Also, in order to utilize recent advances in machine intelligence and deep learning we need to collect a large amount of annotated training data in a variety of conditions and environments. We present a new simulator built on Unreal Engine that offers physically and visually realistic simulations for both of these goals. Our simulator includes a physics engine that can operate at a high frequency for real-time hardware-in-the-loop (HITL) simulations with support for popular protocols (e.g. MavLink). The simulator is designed from the ground up to be extensible to accommodate new types of vehicles, hardware platforms and software protocols. In addition, the modular design enables various components to be easily usable independently in other projects. We demonstrate the simulator by first implementing a quadrotor as an autonomous vehicle and then experimentally comparing the software components with real-world flights.
Visualization of Feature Separation in Advected Scalar Fields
Venue: arXiv cs.GR 2017
Year: 2017

Scalar features in time-dependent fluid flow are traditionally visualized using 3D representation, and their topology changes over time are often conveyed with abstract graphs. Using such techniques, however, the structural details of feature separation and the temporal evolution of features undergoing topological changes are difficult to analyze. In this paper, we propose a novel approach for the spatio-temporal visualization of feature separation that segments feature volumes into regions with respect to their contribution to distinct features after separation. To this end, we employ particle-based feature tracking to find volumetric correspondences between features at two different instants of time. We visualize this segmentation by constructing mesh boundaries around each volume segment of a feature at the initial time that correspond to the separated features at the later time. To convey temporal evolution of the partitioning within the investigated time interval, we complement our approach with spatio-temporal separation surfaces. For the application of our approach to multiphase flow, we additionally present a feature-based corrector method to ensure phase-consistent particle trajectories. The utility of our technique is demonstrated by application to two-phase (liquid-gas) and multi-component (liquid-liquid) flows where the scalar field represents the fraction of one of the phases.
Joint Design of Multi-Tap Analog Cancellation and Digital Beamforming for Reduced Complexity Full Duplex MIMO Systems
Venue: arXiv cs.IT 2017
Year: 2017

Incorporating full duplex operation in Multiple Input Multiple Output (MIMO) systems provides the potential of boosting throughput performance. However, the hardware complexity of the analog self-interference canceller scales with the number of transmit and receive antennas, thus exploiting the benefits of analog cancellation becomes impractical for full duplex MIMO transceivers. In this paper, we present a novel architecture for the analog canceller comprising of reduced number of taps (tap refers to a line of fixed delay and variable phase shifter and attenuator) and simple multiplexers for efficient signal routing among the transmit and receive radio frequency chains. In contrast to the available analog cancellation architectures, the values for each tap and the configuration of the multiplexers are jointly designed with the digital beamforming filters according to certain performance objectives. Focusing on a narrowband flat fading channel model as an example, we present a general optimization framework for the joint design of analog cancellation and digital beamforming. We also detail a particular optimization objective together with its derived solution for the latter architectural components. Representative computer simulation results demonstrate the superiority of the proposed low complexity full duplex MIMO system over lately available ones.
Autonomous and Connected Intersection Crossing Traffic Management using Discrete-Time Occupancies Trajectory
Venue: arXiv cs.SY 2017
Year: 2017

In this paper, we address a problem of safe and efficient intersection crossing traffic management of autonomous and connected ground traffic. Toward this objective, we propose an algorithm that is called the Discrete-time occupancies trajectory based Intersection traffic Coordination Algorithm (DICA). We first prove that the basic DICA is deadlock free and also starvation free. Then, we show that the basic DICA has a computational complexity of $\mathcal{O}(n^2 L_m^3)$ where $n$ is the number of vehicles granted to cross an intersection and $L_m$ is the maximum length of intersection crossing routes. To improve the overall computational efficiency of the algorithm, the basic DICA is enhanced by several computational approaches that are proposed in this paper. The enhanced algorithm has the computational complexity of $\mathcal{O}(n^2 L_m \log_2 L_m)$. The improved computational efficiency of the enhanced algorithm is validated through simulation using an open source traffic simulator, called the Simulation of Urban MObility (SUMO). The overall throughput as well as the computational efficiency of the enhanced algorithm are also compared with those of an optimized traffic light control.
Interactive Runtime Verification
Venue: arXiv cs.SE 2017
Year: 2017

Monitoring is the study of a system at runtime, looking for input and output events to discover, check or enforce behavioral properties. Interactive debugging is the study of a system at runtime in order to discover and understand its bugs and fix them, inspecting interactively its internal state. Interactive Runtime Verification (i-RV) combines monitoring and interactive debugging. We define an efficient and convenient way to check behavioral properties automatically on a program using a debugger. We aim at helping bug discovery while keeping the classical debugging techniques and interactivity, which allow understanding and fixing bugs.
Learning Probabilistic Programs Using Backpropagation
Venue: arXiv cs.LG 2017
Year: 2017

Probabilistic modeling enables combining domain knowledge with learning from data, thereby supporting learning from fewer training instances than purely data-driven methods. However, learning probabilistic models is difficult and has not achieved the level of performance of methods such as deep neural networks on many tasks. In this paper, we attempt to address this issue by presenting a method for learning the parameters of a probabilistic program using backpropagation. Our approach opens the possibility to building deep probabilistic programming models that are trained in a similar way to neural networks.
Key-Value Retrieval Networks for Task-Oriented Dialogue
Venue: arXiv cs.CL 2017
Year: 2017

Neural task-oriented dialogue systems often struggle to smoothly interface with a knowledge base. In this work, we seek to address this problem by proposing a new neural dialogue agent that is able to effectively sustain grounded, multi-domain discourse through a novel key-value retrieval mechanism. The model is end-to-end differentiable and does not need to explicitly model dialogue state or belief trackers. We also release a new dataset of 3,031 dialogues that are grounded through underlying knowledge bases and span three distinct tasks in the in-car personal assistant space: calendar scheduling, weather information retrieval, and point-of-interest navigation. Our architecture is simultaneously trained on data from all domains and significantly outperforms a competitive rule-based system and other existing neural dialogue architectures on the provided domains according to both automatic and human evaluation metrics.
A Biomedical Information Extraction Primer for NLP Researchers
Venue: arXiv cs.CL 2017
Year: 2017

Biomedical Information Extraction is an exciting field at the crossroads of Natural Language Processing, Biology and Medicine. It encompasses a variety of different tasks that require application of state-of-the-art NLP techniques, such as NER and Relation Extraction. This paper provides an overview of the problems in the field and discusses some of the techniques used for solving them.
Toward Intelligent Traffic Light Control with Quality-of-Service Provisioning
Venue: arXiv cs.SY 2017
Year: 2017

Today's fixed-cycle traffic signaling is highly suboptimal and aggravates traffic congestion and waste of energy in urban areas. In addition, it offers no quality-of-service guarantee and makes travel time prediction extremely hard. While existing traffic light control research primarily focuses on improving the average wait time of cars, we study in this paper how traffic light scheduling affects the worst-case wait time. In particular, we derive the time a car spends at an intersection in the best-case and the worst-case, respectively. Using the theoretical results, we propose a simple but effective controller and run simulation to verify its performance. The result shows that it works much better than fixed-cycle controllers in both light and heavy traffic scenarios.
First- and Second-Order Models of Recursive Arithmetics
Venue: arXiv cs.LO 2017
Year: 2017

We study a quadruple of interrelated subexponential subsystems of arithmetic WKL$_0^-$, RCA$^-_0$, I$Δ_0$, and $Δ$RA$_1$, which complement the similarly related quadruple WKL$_0$, RCA$_0$, I$Σ_1$, and PRA studied by Simpson, and the quadruple WKL$_0^\ast$, RCA$_0^\ast$, I$Δ_0$(exp), and EFA studied by Simpson and Smith. We then explore the space of subexponential arithmetic theories between I$Δ_0$ and I$Δ_0$(exp). We introduce and study first- and second-order theories of recursive arithmetic $A$RA$_1$ and $A$RA$_2$ capable of characterizing various computational complexity classes and based on function algebras $A$, studied by Clote and others.
Automated Body Structure Extraction from Arbitrary 3D Mesh
Venue: arXiv cs.GR 2017
Year: 2017

This paper presents an automated method for 3D character skeleton extraction that can be applied for generic 3D shapes. Our work is motivated by the skeleton-based prior work on automatic rigging focused on skeleton extraction and can automatically aligns the extracted structure to fit the 3D shape of the given 3D mesh. The body mesh can be subsequently skinned based on the extracted skeleton and thus enables rigging process. In the experiment, we apply public dataset to drive the estimated skeleton from different body shapes, as well as the real data obtained from 3D scanning systems. Satisfactory results are obtained compared to the existing approaches.
Algorithm-Directed Crash Consistence in Non-Volatile Memory for HPC
Venue: arXiv cs.DC 2017
Year: 2017

Fault tolerance is one of the major design goals for HPC. The emergence of non-volatile memories (NVM) provides a solution to build fault tolerant HPC. Data in NVM-based main memory are not lost when the system crashes because of the non-volatility nature of NVM. However, because of volatile caches, data must be logged and explicitly flushed from caches into NVM to ensure consistence and correctness before crashes, which can cause large runtime overhead. In this paper, we introduce an algorithm-based method to establish crash consistence in NVM for HPC applications. We slightly extend application data structures or sparsely flush cache blocks, which introduce ignorable runtime overhead. Such extension or cache flushing allows us to use algorithm knowledge to \textit{reason} data consistence or correct inconsistent data when the application crashes. We demonstrate the effectiveness of our method for three algorithms, including an iterative solver, dense matrix multiplication, and Monte-Carlo simulation. Based on comprehensive performance evaluation on a variety of test environments, we demonstrate that our approach has very small runtime overhead (at most 8.2\% and less than 3\% in most cases), much smaller than that of traditional checkpoint, while having the same or less recomputation cost.
Balancing the Migration of Virtual Network Functions with Replications in Data Centers
Venue: arXiv cs.NI 2017
Year: 2017

The Network Function Virtualization (NFV) paradigm is enabling flexibility, programmability and implementation of traditional network functions into generic hardware, in form of the so-called Virtual Network Functions (VNFs). Today, cloud service providers use Virtual Machines (VMs) for the instantiation of VNFs in the data center (DC) networks. To instantiate multiple VNFs in a typical scenario of Service Function Chains (SFCs), many important objectives need to be met simultaneously, such as server load balancing, energy efficiency and service execution time. The well-known \emph{VNF placement} problem requires solutions that often consider \emph{migration} of virtual machines (VMs) to meet this objectives. Ongoing efforts, for instance, are making a strong case for migrations to minimize energy consumption, while showing that attention needs to be paid to the Quality of Service (QoS) due to service interruptions caused by migrations. To balance the server allocation strategies and QoS, we propose using \emph{replications} of VNFs to reduce migrations in DC networks. We propose a Linear Programming (LP) model to study a trade-off between replications, which while beneficial to QoS require additional server resources, and migrations, which while beneficial to server load management can adversely impact the QoS. The results show that, for a given objective, the replications can reduce the number of migrations and can also enable a better server and data center network load balancing.
Position and line-of-sight stabilization of spherical robot using feedforward proportional-derivative geometric controller
Venue: arXiv cs.SY 2017
Year: 2017

In this paper we present a geometric control law for position and line-of-sight stabilization of the nonholonomic spherical robot actuated by three independent actuators. A simple configuration error function with an appropriately defined transport map is proposed to extract feedforward and proportional-derivative control law. Simulations are provided to validate the controller performance.
Transmitter Beam Selection in Millimeter-wave MIMO with In-Band Position-Aiding
Venue: arXiv cs.IT 2017
Year: 2017

Emerging wireless communication systems will be characterized by a tight coupling between communication and positioning. This is particularly apparent in millimeter-wave (mm-wave) communications, where devices use a large number of antennas and the propagation is well described by geometric channel models. For mm-wave communications, initial access, consisting in the beam selection and alignment of two devices, is challenging and time-consuming in the absence of location information. Conversely, accurate positioning relies on high-quality communication links with proper beam alignment. This paper studies this interaction and proposes a new position-aided beam selection protocol, which considers the problem of joint communication and positioning in scenarios with direct line-of-sight and scattering. Simulation results show significant reductions in latency with respect to a standard protocol.
Efficient Bit-Channel Reliability Computation for Multi-Mode Polar Code Encoders and Decoders
Venue: arXiv cs.IT 2017
Year: 2017

Polar codes are a family of capacity-achieving error-correcting codes, and they have been selected as part of the next generation wireless communication standard. Each polar code bit-channel is assigned a reliability value, used to determine which bits transmit information and which parity. Relative reliabilities need to be known by both encoders and decoders: in case of multi-mode systems, where multiple code lengths and code rates are supported, the storage of relative reliabilities can lead to high implementation complexity. In this work, observe patterns among code reliabilities. We propose an approximate computation technique to easily represent the reliabilities of multiple codes, through a limited set of variables and update rules. The proposed method allows to tune the trade-off between reliability accuracy and implementation complexity. An approximate computation architecture for encoders and decoders is designed and implemented, showing 50.7% less area occupation than storage-based solutions, with less than 0.05 dB error correction performance degradation.
Active Control of Camera Parameters for Object Detection Algorithms
Venue: arXiv cs.CV 2017
Year: 2017

Camera parameters not only play an important role in determining the visual quality of perceived images, but also affect the performance of vision algorithms, for a vision-guided robot. By quantitatively evaluating four object detection algorithms, with respect to varying ambient illumination, shutter speed and voltage gain, it is observed that the performance of the algorithms is highly dependent on these variables. From this observation, a novel active control of camera parameters method is proposed, to make robot vision more robust under different light conditions. Experimental results demonstrate the effectiveness of our proposed approach, which improves the performance of object detection algorithms, compared with the conventional auto-exposure algorithm.
Motion-Compensated Temporal Filtering for Critically-Sampled Wavelet-Encoded Images
Venue: arXiv cs.CV 2017
Year: 2017

We propose a novel motion estimation/compensation (ME/MC) method for wavelet-based (in-band) motion compensated temporal filtering (MCTF), with application to low-bitrate video coding. Unlike the conventional in-band MCTF algorithms, which require redundancy to overcome the shift-variance problem of critically sampled (complete) discrete wavelet transforms (DWT), we perform ME/MC steps directly on DWT coefficients by avoiding the need of shift-invariance. We omit upsampling, the inverse-DWT (IDWT), and the calculation of redundant DWT coefficients, while achieving arbitrary subpixel accuracy without interpolation, and high video quality even at very low-bitrates, by deriving the exact relationships between DWT subbands of input image sequences. Experimental results demonstrate the accuracy of the proposed method, confirming that our model for ME/MC effectively improves video coding quality.
New Directions In Cellular Automata
Venue: arXiv cs.FL 2017
Year: 2017

We Propose A Novel Automaton Model which uses Arithmetic Operations as the Evolving Rules, each cell has the states of the Natural Numbers k = (N), a radius of r = 1/2 and operates on an arbitrary input size. The Automaton reads an Arithmetic Expression as an input and outputs another Arithmetic Expression. In Addition, we simulate a variety of One Dimensional Cellular Automata Structures with different Dynamics including Elementary Cellular Automata.
Computed Axial Lithography (CAL): Toward Single Step 3D Printing of Arbitrary Geometries
Venue: arXiv cs.GR 2017
Year: 2017

Most additive manufacturing processes today operate by printing voxels (3D pixels) serially point-by-point to build up a 3D part. In some more recently-developed techniques, for example optical printing methods such as projection stereolithography [Zheng et al. 2012], [Tumbleston et al. 2015], parts are printed layer-by-layer by curing full 2d (very thin in one dimension) layers of the 3d part in each print step. There does not yet exist a technique which is able to print arbitrarily-defined 3D geometries in a single print step. If such a technique existed, it could be used to expand the range of printable geometries in additive manufacturing and relax constraints on factors such as overhangs in topology optimization. It could also vastly increase print speed for 3D parts. In this work, we develop the principles for an approach for single exposure 3D printing of arbitrarily defined geometries. The approach, termed Computed Axial Lithgography (CAL), is based on tomographic reconstruction, with mathematical optimization to generate a set of projections to optically define an arbitrary dose distribution within a target volume. We demonstrate the potential ability of the technique to print 3D parts using a prototype CAL system based on sequential illumination from many angles. We also propose new hardware designs which will help us to realize true single-shot arbitrary-geometry 3D CAL.