OpenRaiser/Intern-Atlas huggingface dataset:
Secure Count Query on Encrypted Genomic Data
Venue: arXiv cs.CR 2017
Year: 2017

Capturing the vast amount of meaningful information encoded in the human genome is a fascinating research problem. The outcome of these researches have significant influences in a number of health related fields --- personalized medicine, paternity testing and disease susceptibility testing are a few to be named. To facilitate these types of large scale biomedical research projects, it oftentimes requires to share genomic and clinical data collected by disparate organizations among themselves. In that case, it is of utmost importance to ensure that sharing, managing and analyzing the data does not reveal the identity of the individuals who contribute their genomic samples. The task of storage and computation on the shared data can be delegated to third party cloud infrastructures, equipped with large storage and high performance computation resources. Outsourcing these sensitive genomic data to the third party cloud storage is associated with the challenges of the potential loss, theft or misuse of the data as the server administrator cannot be completely trusted as well as there is no guarantee that the security of the server will not be breached. In this paper, we provide a model for secure sharing and computation on genomic data in a semi-honest third party cloud server. The security of the shared data is guaranteed through encryption while making the overall computation fast and scalable enough for real-life large-scale biomedical applications. We evaluated the efficiency of our proposed model on a database of Single-Nucleotide Polymorphism (SNP) sequences and experimental results demonstrate that a query of 50 SNPs in a database of 50000 records, where each record contains 300 SNPs, takes approximately 6 seconds.
Towards implementation of Cellular Automata in Microbial Fuel Cells
Venue: arXiv cs.ET 2017
Year: 2017

The Microbial Fuel Cell (MFC) is a bio-electrochemical transducer converting waste products into electricity using microbial communities. Cellular Automaton (CA) is a uniform array of finite-state machines that update their states in discrete time depending on states of their closest neighbors by the same rule. Arrays of MFCs could, in principle, act as massive-parallel computing devices with local connectivity between elementary processors. We provide a theoretical design of such a parallel processor by implementing CA in MFCs. We have chosen Conway's Game of Life as the 'benchmark' CA because this is the most popular CA which also exhibits an enormously rich spectrum of patterns. Each cell of the Game of Life CA is realized using two MFCs. The MFCs are linked electrically and hydraulically. The model is verified via simulation of an electrical circuit demonstrating equivalent behaviors. The design is a first step towards future implementations of fully autonomous biological computing devices with massive parallelism. The energy independence of such devices counteracts their somewhat slow transitions - compared to silicon circuitry - between the different states during computation.
How bad is selfish routing in practice?
Venue: arXiv cs.GT 2017
Year: 2017

Routing games are one of the most successful domains of application of game theory. It is well understood that simple dynamics converge to equilibria, whose performance is nearly optimal regardless of the size of the network or the number of agents. These strong theoretical assertions prompt a natural question: How well do these pen-and-paper calculations agree with the reality of everyday traffic routing? We focus on a semantically rich dataset from Singapore's National Science Experiment that captures detailed information about the daily behavior of thousands of Singaporean students. Using this dataset, we can identify the routes as well as the modes of transportation used by the students, e.g. car (driving or being driven to school) versus bus or metro, estimate source and sink destinations (home-school) and trip duration, as well as their mode-dependent available routes. We quantify both the system and individual optimality. Our estimate of the Empirical Price of Anarchy lies between 1.11 and 1.22. Individually, the typical behavior is consistent from day to day and nearly optimal, with low regret for not deviating to alternative paths.
Magneto-inductive Passive Relaying in Arbitrarily Arranged Networks
Venue: arXiv cs.IT 2017
Year: 2017

We consider a wireless sensor network that uses inductive near-field coupling for wireless powering or communication, or for both. The severely limited range of an inductively coupled source-destination pair can be improved using resonant relay devices, which are purely passive in nature. Utilization of such magneto-inductive relays has only been studied for regular network topologies, allowing simplified assumptions on the mutual antenna couplings. In this work we present an analysis of magneto-inductive passive relaying in arbitrarily arranged networks. We find that the resulting channel has characteristics similar to multipath fading: the channel power gain is governed by a non-coherent sum of phasors, resulting in increased frequency selectivity. We propose and study two strategies to increase the channel power gain of random relay networks: i) deactivation of individual relays by open-circuit switching and ii) frequency tuning. The presented results show that both methods improve the utilization of available passive relays, leading to reliable and significant performance gains.
A Theory of Output-Side Unsupervised Domain Adaptation
Venue: arXiv cs.LG 2017
Year: 2017

When learning a mapping from an input space to an output space, the assumption that the sample distribution of the training data is the same as that of the test data is often violated. Unsupervised domain shift methods adapt the learned function in order to correct for this shift. Previous work has focused on utilizing unlabeled samples from the target distribution. We consider the complementary problem in which the unlabeled samples are given post mapping, i.e., we are given the outputs of the mapping of unknown samples from the shifted domain. Two other variants are also studied: the two sided version, in which unlabeled samples are give from both the input and the output spaces, and the Domain Transfer problem, which was recently formalized. In all cases, we derive generalization bounds that employ discrepancy terms.
Automatic Classification of Cancerous Tissue in Laserendomicroscopy Images of the Oral Cavity using Deep Learning
Venue: arXiv cs.CV 2017
Year: 2017

Oral Squamous Cell Carcinoma (OSCC) is a common type of cancer of the oral epithelium. Despite their high impact on mortality, sufficient screening methods for early diagnosis of OSCC often lack accuracy and thus OSCCs are mostly diagnosed at a late stage. Early detection and accurate outline estimation of OSCCs would lead to a better curative outcome and an reduction in recurrence rates after surgical treatment. Confocal Laser Endomicroscopy (CLE) records sub-surface micro-anatomical images for in vivo cell structure analysis. Recent CLE studies showed great prospects for a reliable, real-time ultrastructural imaging of OSCC in situ. We present and evaluate a novel automatic approach for a highly accurate OSCC diagnosis using deep learning technologies on CLE images. The method is compared against textural feature-based machine learning approaches that represent the current state of the art. For this work, CLE image sequences (7894 images) from patients diagnosed with OSCC were obtained from 4 specific locations in the oral cavity, including the OSCC lesion. The present approach is found to outperform the state of the art in CLE image recognition with an area under the curve (AUC) of 0.96 and a mean accuracy of 88.3% (sensitivity 86.6%, specificity 90%).
Faster-than-Nyquist Non-Orthogonal Frequency-Division Multiplexing for Visible Light Communications
Venue: arXiv cs.IT 2017
Year: 2017

In this paper, we propose a faster-than-Nyquist (FTN) non-orthogonal frequency-division multiplexing (NOFDM) scheme for visible light communications (VLC) where the multiplexing/demultiplexing employs the inverse fractional cosine transform (IFrCT)/FrCT. Different to the common fractional Fourier transform-based NOFDM (FrFT-NOFDM) signal, FrCT-based NOFDM (FrCT-NOFDM) signal is real-valued which can be directly applied to the VLC systems without the expensive upconversion. Thus, FrCT-NOFDM is more suitable for the cost-sensitive VLC systems. Meanwhile, under the same transmission rate, FrCT-NOFDM signal occupies smaller bandwidth compared to OFDM signal. When the bandwidth compression factor $α$ is set to $0.8$, $20\%$ bandwidth saving can be obtained. Therefore, FrCT-NOFDM has higher spectral efficiency and suffers less high-frequency distortion compared to OFDM, which benefits the bandwidth-limited VLC systems. As the simulation results show, bit error rate (BER) performance of FrCT-NOFDM with $α$ of $0.9$ or $0.8$ is better than that of OFDM. Moreover, FrCT-NOFDM has a superior security performance. In conclusion, FrCT-NOFDM shows great potential for application in the future VLC systems.
Control Interpretations for First-Order Optimization Methods
Venue: arXiv cs.SY 2017
Year: 2017

First-order iterative optimization methods play a fundamental role in large scale optimization and machine learning. This paper presents control interpretations for such optimization methods. First, we give loop-shaping interpretations for several existing optimization methods and show that they are composed of basic control elements such as PID and lag compensators. Next, we apply the small gain theorem to draw a connection between the convergence rate analysis of optimization methods and the input-output gain computations of certain complementary sensitivity functions. These connections suggest that standard classical control synthesis tools may be brought to bear on the design of optimization algorithms.
Viewpoint Selection for Photographing Architectures
Venue: arXiv cs.CV 2017
Year: 2017

This paper studies the problem of how to choose good viewpoints for taking photographs of architectures. We achieve this by learning from professional photographs of world famous landmarks that are available on the Internet. Unlike previous efforts devoted to photo quality assessment which mainly rely on 2D image features, we show in this paper combining 2D image features extracted from images with 3D geometric features computed on the 3D models can result in more reliable evaluation of viewpoint quality. Specifically, we collect a set of photographs for each of 15 world famous architectures as well as their 3D models from the Internet. Viewpoint recovery for images is carried out through an image-model registration process, after which a newly proposed viewpoint clustering strategy is exploited to validate users' viewpoint preferences when photographing landmarks. Finally, we extract a number of 2D and 3D features for each image based on multiple visual and geometric cues and perform viewpoint recommendation by learning from both 2D and 3D features using a specifically designed SVM-2K multi-view learner, achieving superior performance over using solely 2D or 3D features. We show the effectiveness of the proposed approach through extensive experiments. The experiments also demonstrate that our system can be used to recommend viewpoints for rendering textured 3D models of buildings for the use of architectural design, in addition to viewpoint evaluation of photographs and recommendation of viewpoints for photographing architectures in practice.
Wireless Powered Dual-Hop Multi-Antenna Relaying Systems: Impact of CSI and Antenna Correlation
Venue: arXiv cs.IT 2017
Year: 2017

This paper investigates the impact of the channel state information (CSI) and antenna correlation at the multi-antenna relay on the performance of wireless powered dual-hop amplify-and-forward relaying systems. Depending on the available CSI at the relay, two different scenarios are considered, namely, instantaneous CSI and statistical CSI where the relay has access only to the antenna correlation matrix. Adopting the power-splitting architecture, we present a detailed performance study for both cases. Closed-form analytical expressions are derived for the outage probability and ergodic capacity. In addition, simple high signal-to-noise ratio (SNR) outage approximations are obtained. Our results show that, antenna correlation itself does not affect the achievable diversity order, the availability of CSI at the relay determines the achievable diversity order. Full diversity order can be achieved with instantaneous CSI, while only a diversity order of one can be achieved with statistical CSI. In addition, the transmit antenna correlation and receive antenna correlation exhibit different impact on the ergodic capacity. Moreover, the impact of antenna correlation on the ergodic capacity also depends heavily on the available CSI and operating SNR.
A Novel Comprehensive Approach for Estimating Concept Semantic Similarity in WordNet
Venue: arXiv cs.CL 2017
Year: 2017

Computation of semantic similarity between concepts is an important foundation for many research works. This paper focuses on IC computing methods and IC measures, which estimate the semantic similarities between concepts by exploiting the topological parameters of the taxonomy. Based on analyzing representative IC computing methods and typical semantic similarity measures, we propose a new hybrid IC computing method. Through adopting the parameter dhyp and lch, we utilize the new IC computing method and propose a novel comprehensive measure of semantic similarity between concepts. An experiment based on WordNet "is a" taxonomy has been designed to test representative measures and our measure on benchmark dataset R&G, and the results show that our measure can obviously improve the similarity accuracy. We evaluate the proposed approach by comparing the correlation coefficients between five measures and the artificial data. The results show that our proposal outperforms the previous measures.
Multi-Level and Multi-Scale Feature Aggregation Using Pre-trained Convolutional Neural Networks for Music Auto-tagging
Venue: arXiv cs.NE 2017
Year: 2017

Music auto-tagging is often handled in a similar manner to image classification by regarding the 2D audio spectrogram as image data. However, music auto-tagging is distinguished from image classification in that the tags are highly diverse and have different levels of abstractions. Considering this issue, we propose a convolutional neural networks (CNN)-based architecture that embraces multi-level and multi-scaled features. The architecture is trained in three steps. First, we conduct supervised feature learning to capture local audio features using a set of CNNs with different input sizes. Second, we extract audio features from each layer of the pre-trained convolutional networks separately and aggregate them altogether given a long audio clip. Finally, we put them into fully-connected networks and make final predictions of the tags. Our experiments show that using the combination of multi-level and multi-scale features is highly effective in music auto-tagging and the proposed method outperforms previous state-of-the-arts on the MagnaTagATune dataset and the Million Song Dataset. We further show that the proposed architecture is useful in transfer learning.
Robust Cooperative Relay Beamforming
Venue: arXiv cs.IT 2017
Year: 2017

In this paper, the robust distributed relay beamforming problem is solved using the worst case approach, where the problem solution has been involved because of the effect of uncertainty of channel knowledge on the quality of service (QoS) constraints. It is shown that the original robust design, which is a non-convex semi-infinite problem (SIP), can be relaxed and reformed to a semi-definite problem (SDP). Monte-Carlo simulations are presented to verify the performance improvement of our proposed robust problem over existing robust and non-robust problems in terms of transmit power and symbol error probability.
A new belief Markov chain model and its application in inventory prediction
Venue: arXiv cs.AI 2017
Year: 2017

Markov chain model is widely applied in many fields, especially the field of prediction. The classical Discrete-time Markov chain(DTMC) is a widely used method for prediction. However, the classical DTMC model has some limitation when the system is complex with uncertain information or state space is not discrete. To address it, a new belief Markov chain model is proposed by combining Dempster-Shafer evidence theory with Markov chain. In our model, the uncertain data is allowed to be handle in the form of interval number and the basic probability assignment(BPA) is generated based on the distance between interval numbers. The new belief Markov chain model overcomes the shortcomings of classical Markov chain and has an efficient ability in dealing with uncertain information. Moreover, an example of inventory prediction and the comparison between our model and classical DTMC model can show the effectiveness and rationality of our proposed model.
Evidential supplier selection based on interval data fusion
Venue: arXiv cs.AI 2017
Year: 2017

Supplier selection is a typical multi-criteria decision making (MCDM) problem and lots of uncertain information exist inevitably. To address this issue, a new method was proposed based on interval data fusion. Our method follows the original way to generate classical basic probability assignment(BPA) determined by the distance among the evidences. However, the weights of criteria are kept as interval numbers to generate interval BPAs and do the fusion of interval BPAs. Finally, the order is ranked and the decision is made according to the obtained interval BPAs. In this paper, a numerical example of supplier selection is applied to verify the feasibility and validity of our method. The new method is presented aiming at solving multiple-criteria decision-making problems in which the weights of criteria or experts are described in fuzzy data like linguistic terms or interval data.
The Fog Makes Sense: Enabling Social Sensing Services With Limited Internet Connectivity
Venue: arXiv cs.DC 2017
Year: 2017

Social sensing services use humans as sensor carriers, sensor operators and sensors themselves in order to provide situation-awareness to applications. This promises to provide a multitude of benefits to the users, for example in the management of natural disasters or in community empowerment. However, current social sensing services depend on Internet connectivity since the services are deployed on central Cloud platforms. In many circumstances, Internet connectivity is constrained, for instance when a natural disaster causes Internet outages or when people do not have Internet access due to economical reasons. In this paper, we propose the emerging Fog Computing infrastructure to become a key-enabler of social sensing services in situations of constrained Internet connectivity. To this end, we develop a generic architecture and API of Fog-enabled social sensing services. We exemplify the usage of the proposed social sensing architecture on a number of concrete use cases from two different scenarios.
Model Reduction for Aperiodically Sampled Data Systems
Venue: arXiv cs.SY 2017
Year: 2017

Two approaches to moment matching based model reduction of aperiodically sampled data systems are given. The term "aperiodic sampling" is used in the paper to indicate that the time between two consecutive sampling instants can take its value from a pre-specified finite set of allowed sampling intervals. Such systems can be represented by discrete-time linear switched (LS) state space (SS) models. One of the approaches investigated in the paper is to apply model reduction by moment matching on the linear time-invariant (LTI) plant model, then compare the responses of the LS SS models acquired from the original and reduced order LTI plants. The second approach is to apply a moment matching based model reduction method on the LS SS model acquired from the original LTI plant, and then compare the responses of the original and reduced LS SS models. It is proven that for both methods, as long as the original LTI plant is stable, the resulting reduced order LS SS model of the sampled data system is quadratically stable. The results from two approaches are compared with numerical examples.
Non-line-of-sight tracking of people at long range
Venue: arXiv cs.CV 2017
Year: 2017

A remote-sensing system that can determine the position of hidden objects has applications in many critical real-life scenarios, such as search and rescue missions and safe autonomous driving. Previous work has shown the ability to range and image objects hidden from the direct line of sight, employing advanced optical imaging technologies aimed at small objects at short range. In this work we demonstrate a long-range tracking system based on single laser illumination and single-pixel single-photon detection. This enables us to track one or more people hidden from view at a stand-off distance of over 50~m. These results pave the way towards next generation LiDAR systems that will reconstruct not only the direct-view scene but also the main elements hidden behind walls or corners.
Scalable Underapproximation for the Stochastic Reach-Avoid Problem for High-Dimensional LTI Systems using Fourier Transforms
Venue: arXiv cs.SY 2017
Year: 2017

We present a scalable underapproximation of the terminal hitting time stochastic reach-avoid probability at a given initial condition, for verification of high-dimensional stochastic LTI systems. While several approximation techniques have been proposed to alleviate the curse of dimensionality associated with dynamic programming, these techniques are limited and cannot handle larger, more realistic systems. We present a scalable method that uses Fourier transforms to compute an underapproximation of the reach-avoid probability for systems with disturbances with arbitrary probability densities. We characterize sufficient conditions for Borel-measurability of the value functions. We exploit fixed control sequences parameterized by the initial condition (an open-loop control policy) to generate the underapproximation. For Gaussian disturbances, the underapproximation can be obtained using existing efficient algorithms by solving a convex optimization problem. Our approach produces non-trivial lower bounds and is demonstrated on a chain of integrators with 40 states.
Decentralized Consistent Network Updates in SDN with ez-Segway
Venue: arXiv cs.NI 2017
Year: 2017

We present ez-Segway, a decentralized mechanism to consistently and quickly update the network state while preventing forwarding anomalies (loops and black-holes) and avoiding link congestion. In our design, the centralized SDN controller only pre-computes information needed by the switches during the update execution. This information is distributed to the switches, which use partial knowledge and direct message passing to efficiently realize the update. This separation of concerns has the key benefit of improving update performance as the communication and computation bottlenecks at the controller are removed. Our evaluations via network emulations and large-scale simulations demonstrate the efficiency of ez-Segway, which compared to a centralized approach, improves network update times by up to 45% and 57% at the median and the 99th percentile, respectively. A deployment of a system prototype in a real OpenFlow switch and an implementation in P4 demonstrate the feasibility and low overhead of implementing simple network update functionality within switches.