OpenRaiser/Intern-Atlas huggingface dataset:
Towards the Existential Control of Boolean Networks: A Preliminary Report (Extended Abstract)
Venue: arXiv cs.SY 2018
Year: 2018

Given a Boolean network BN and a subset A of attractors of BN, we study the problem of identifying a minimal subset C of vertices of BN, such that the dynamics of BN can reach from a state s in any attractor As in A to any attractor At in A by controlling or toggling a subset of vertices in C in a single time step. We describe a method based on the decomposition of the network structure into strongly connected components called blocks. The control subset can be locally computed for each such block and the results then merged to derive the global control subset C. This potentially improves the efficiency for many real-life networks that are large but modular and well-structured. We are currently in the process of implementing our method in software.
Amortized Analysis of Asynchronous Price Dynamics
Venue: arXiv cs.GT 2018
Year: 2018

We extend a recently developed framework for analyzing asynchronous coordinate descent algorithms to show that an asynchronous version of tatonnement, a fundamental price dynamic widely studied in general equilibrium theory, converges toward a market equilibrium for Fisher markets with CES utilities or Leontief utilities, for which tatonnement is equivalent to coordinate descent.
Performance of Massive MIMO Self-Backhauling for Ultra-Dense Small Cell Deployments
Venue: arXiv cs.NI 2018
Year: 2018

A key aspect of the fifth-generation wireless communication network will be the integration of different services and technologies to provide seamless connectivity. In this paper, we consider using massive multiple-input multiple-output (mMIMO) to provide backhaul links to a dense deployment of self-backhauling (s-BH) small cells (SCs) that provide cellular access within the same spectrum resources of the backhaul. Through a comprehensive system-level simulation study, we evaluate the interplay between access and backhaul and the resulting end-to-end user rates. Moreover, we analyze the impact of different SCs deployment strategies, while varying the time resource allocation between radio access and backhaul links. We finally compare the above mMIMO-based s-BH approach to a mMIMO direct access (DA) architecture accounting for the effects of pilot reuse schemes, together with their associated overhead and contamination mitigation effects. The results show that dense SCs deployments supported by mMIMO s-BH provide significant rate improvements for cell-edge users (UEs) in ultra-dense deployments with respect to mMIMO DA, while the latter outperforms mMIMO s-BH from the median UEs' standpoint.
Reachability in timed automata with diagonal constraints
Venue: arXiv cs.LO 2018
Year: 2018

We consider the reachability problem for timed automata having diagonal constraints (like x - y < 5) as guards in transitions. The best algorithms for timed automata proceed by enumerating reachable sets of its configurations, stored in the form of a data structure called "zones". Simulation relations between zones are essential to ensure termination and efficiency. The algorithm employs a simulation test "is-Z-simulated-by-Z' ?" which ascertains that zone Z does not reach more states than zone Z', and hence further enumeration from Z is not necessary. No effective simulations are known for timed automata containing diagonal constraints as guards. In this paper, we propose a simulation relation LU-d for timed automata with diagonal constraints. On the negative side, we show that deciding Z-is-not-LU-d-simulated-by-Z' is NP-complete. On the positive side, we identify a witness for non-simulation and propose an algorithm to decide the existence of such a witness using an SMT solver. The shape of the witness reveals that the simulation test is likely to be efficient in practice.
Secrecy Beamforming for SWIPT MISO Heterogeneous Cellular Networks
Venue: arXiv cs.IT 2018
Year: 2018

In this paper, we consider the secure transmission design for a multiple-input single-output Femtocell overlaid with a Macrocell in co-channel deployment. The Femtocell base station sends confidential messages to information receiving Femtocell users (FUs) and energy signals to energy receiving (ER) FUs while limiting the interference to Macrocell users (MUs). The ER FUs have the potential to wiretap the confidential messages. By taking fairness into account, we propose a sum logarithmic secrecy rate maximization beamforming design problem under the interference constraints for MUs and energy harvesting (EH) constraints for ER FUs. The formulated design problem is nontrivial to solve due to the nonconvexity which lies in the objective and the constraints. To tackle the design problem, a semidefinite relaxation and successive convex approximation based algorithm is proposed. Simulation results demonstrate the effectiveness of the proposed beamforming design.
Neural-net-induced Gaussian process regression for function approximation and PDE solution
Venue: arXiv cs.LG 2018
Year: 2018

Neural-net-induced Gaussian process (NNGP) regression inherits both the high expressivity of deep neural networks (deep NNs) as well as the uncertainty quantification property of Gaussian processes (GPs). We generalize the current NNGP to first include a larger number of hyperparameters and subsequently train the model by maximum likelihood estimation. Unlike previous works on NNGP that targeted classification, here we apply the generalized NNGP to function approximation and to solving partial differential equations (PDEs). Specifically, we develop an analytical iteration formula to compute the covariance function of GP induced by deep NN with an error-function nonlinearity. We compare the performance of the generalized NNGP for function approximations and PDE solutions with those of GPs and fully-connected NNs. We observe that for smooth functions the generalized NNGP can yield the same order of accuracy with GP, while both NNGP and GP outperform deep NN. For non-smooth functions, the generalized NNGP is superior to GP and comparable or superior to deep NN.
A Multimodal Recommender System for Large-scale Assortment Generation in E-commerce
Venue: arXiv cs.IR 2018
Year: 2018

E-commerce platforms surface interesting products largely through product recommendations that capture users' styles and aesthetic preferences. Curating recommendations as a complete complementary set, or assortment, is critical for a successful e-commerce experience, especially for product categories such as furniture, where items are selected together with the overall theme, style or ambiance of a space in mind. In this paper, we propose two visually-aware recommender systems that can automatically curate an assortment of living room furniture around a couple of pre-selected seed pieces for the room. The first system aims to maximize the visual-based style compatibility of the entire selection by making use of transfer learning and topic modeling. The second system extends the first by incorporating text data and applying polylingual topic modeling to infer style over both modalities. We review the production pipeline for surfacing these visually-aware recommender systems and compare them through offline validations and large-scale online A/B tests on Overstock. Our experimental results show that complimentary style is best discovered over product sets when both visual and textual data are incorporated.
Energy Optimization for Cellular-Connected Multi-UAV Mobile Edge Computing Systems with Multi-Access Schemes
Venue: arXiv cs.IT 2018
Year: 2018

In this paper, a cellular-connected unmanned aerial vehicles (UAV) mobile edge computing system is studied in which the multiple UAVs are served by terrestrial base station (TBS) for computation task offloading. Our goal is to minimize the total UAVs energy consumption, including propulsion energy, computation energy and communication energy, while ensuring that the total number of bits of UAVs are completely computed. For tackling the large amount of bits for computation, we propose a resource partitioning strategy where one portion of tasks is migrated to TBS for computation and the other portion of tasks is locally computed at UAV. For deeply comprehending the impacts of access manners on the system performance, we consider four access schemes in the uplink transmission, i.e., time division multiple access (TDMA), orthogonal frequency division multiple access (OFDMA), One-by-One access and non-orthogonal multiple access (NOMA). The problem of jointly optimizing bit allocation, power allocation, resource partitioning as well as UAV trajectory under TBS's energy budget is formulated and tackled by means of successive convex approximation (SCA) technique. The numerical results show that the proposed schemes save much energy compared with benchmark schemes.
Generating Connected Random Graphs
Venue: arXiv cs.SI 2018
Year: 2018

Sampling random graphs is essential in many applications, and often algorithms use Markov chain Monte Carlo methods to sample uniformly from the space of graphs. However, often there is a need to sample graphs with some property that we are unable, or it is too inefficient, to sample using standard approaches. In this paper, we are interested in sampling graphs from a conditional ensemble of the underlying graph model. We present an algorithm to generate samples from an ensemble of connected random graphs using a Metropolis-Hastings framework. The algorithm extends to a general framework for sampling from a known distribution of graphs, conditioned on a desired property. We demonstrate the method to generate connected spatially embedded random graphs, specifically the well known Waxman network, and illustrate the convergence and practicalities of the algorithm.
Guaranteed Deterministic Bounds on the Total Variation Distance between Univariate Mixtures
Venue: arXiv cs.LG 2018
Year: 2018

The total variation distance is a core statistical distance between probability measures that satisfies the metric axioms, with value always falling in $[0,1]$. This distance plays a fundamental role in machine learning and signal processing: It is a member of the broader class of $f$-divergences, and it is related to the probability of error in Bayesian hypothesis testing. Since the total variation distance does not admit closed-form expressions for statistical mixtures (like Gaussian mixture models), one often has to rely in practice on costly numerical integrations or on fast Monte Carlo approximations that however do not guarantee deterministic lower and upper bounds. In this work, we consider two methods for bounding the total variation of univariate mixture models: The first method is based on the information monotonicity property of the total variation to design guaranteed nested deterministic lower bounds. The second method relies on computing the geometric lower and upper envelopes of weighted mixture components to derive deterministic bounds based on density ratio. We demonstrate the tightness of our bounds in a series of experiments on Gaussian, Gamma and Rayleigh mixture models.
Bias in Semantic and Discourse Interpretation
Venue: arXiv cs.CL 2018
Year: 2018

In this paper, we show how game-theoretic work on conversation combined with a theory of discourse structure provides a framework for studying interpretive bias. Interpretive bias is an essential feature of learning and understanding but also something that can be used to pervert or subvert the truth. The framework we develop here provides tools for understanding and analyzing the range of interpretive biases and the factors that contribute to them.
Stability conditions for the explicit integration of projection based nonlinear reduced-order and hyper reduced structural mechanics finite element models
Venue: arXiv cs.NA 2018
Year: 2018

Projection-based nonlinear model order reduction methods can be used to reduce simulation times for the solution of many PDE-constrained problems. It has been observed in literature that such nonlinear reduced-order models (ROMs) based on Galerkin projection sometimes exhibit much larger stable time step sizes than their unreduced counterparts. This work provides a detailed theoretical analysis of this phenomenon for structural mechanics. We first show that many desirable system matrix properties are preserved by the Galerkin projection. Next, we prove that the eigenvalues of the linearized Galerkin reduced-order system separate the eigenvalues of the linearized original system. Assuming non-negative Rayleigh damping and a time integration using the popular central difference method, we further prove that the theoretical linear stability time step of the ROM is in fact always larger than or equal to the critical time step of its corresponding full-order model. We also give mathematical expressions for computing the stable time step size. Finally, we show that under certain conditions this increase in the stability time step even extends to some hyper-reduction methods. The findings can be used to compute numerical stability time step sizes for the integration of nonlinear ROMs in structural mechanics, and to speed up simulations by permitting the use of larger time steps.
Hierarchical Robust Analysis for Identified Systems in Network
Venue: arXiv cs.SY 2018
Year: 2018

This technical report considers worst-case robustness analysis of a network of locally controlled uncertain systems with uncertain parameter vectors belonging to the ellipsoid sets found by identification procedures. In order to deal with computational complexity of large-scale systems, an hierarchical robustness analysis approach is adapted to these uncertain parameter vectors thus addressing the trade-off between the computation time and the conservatism of the obtained result.
Footwear Size Recommendation System
Venue: arXiv cs.IR 2018
Year: 2018

While shopping for fashion products, customers usually prefer to try-out products to examine fit, material, overall look and feel. Due to lack of try out options during online shopping, it becomes pivotal to provide customers with as much of this information as possible to enhance their shopping experience. Also it becomes essential to provide same experience for new customers. Our work here focuses on providing a production ready size recommendation system for shoes and address the challenge of providing recommendation for users with no previous purchases on the platform. In our work, we present a probabilistic approach based on user co-purchase data facilitated by generating a brand-brand relationship graph. Specifically we address two challenges that are commonly faced while implementing such solution. 1. Sparse signals for less popular or new products in the system 2. Extending the solution for new users. Further we compare and contrast this approach with our previous work and show significant improvement both in recommendation precision and coverage.
Team assembly mechanisms and the knowledge produced in the Mexico's National Institute of Geriatrics: a network analysis and agent-based modelling approach
Venue: arXiv cs.DL 2018
Year: 2018

Mexico's National Institute of Geriatrics (INGER) is the national research center of reference for matters related to human aging. INGER scientists perform basic, clinical and demographic research which may imply different scientific cultures working together in the same specialized institution. In this paper, by a combination of text mining, co-authorship network analysis and agent-based modeling we analyzed and modeled the team assembly practices and the structure of the knowledge produced by scientists from INGER. Our results showed a weak connection between basic and clinical research, and the emergence of a highly connected academic leadership. Importantly, basic and clinical-demographic researchers exhibited different team assembly strategies: Basic researchers tended to form larger teams mainly with external collaborators while clinical and demographic researchers formed smaller teams that very often incorporated internal (INGER) collaborators. We showed how these two different ways to form research teams impacted the organization of knowledge produced at INGER. Following these observations, we modeled, via agent-based modeling, the coexistence of different scientific cultures (basic and clinical research) exhibiting different team assembly strategies in the same institution. Our agent model successfully reproduced the current situation of INGER. Moreover, by modifying the values of homophily we obtain alternative scenarios in which multidisciplinary and interdisciplinary research could be done.
Non-linear Real Arithmetic Benchmarks derived from Automated Reasoning in Economics
Venue: arXiv cs.SC 2018
Year: 2018

We consider problems originating in economics that may be solved automatically using mathematical software. We present and make freely available a new benchmark set of such problems. The problems have been shown to fall within the framework of non-linear real arithmetic, and so are in theory soluble via Quantifier Elimination (QE) technology as usually implemented in computer algebra systems. Further, they all can be phrased in prenex normal form with only existential quantifiers and so are also admissible to those Satisfiability Module Theory (SMT) solvers that support the QF_NRA. There is a great body of work considering QE and SMT application in science and engineering, but we demonstrate here that there is potential for this technology also in the social sciences.
MRFusion: A Deep Learning architecture to fuse PAN and MS imagery for land cover mapping
Venue: arXiv cs.CV 2018
Year: 2018

Nowadays, Earth Observation systems provide a multitude of heterogeneous remote sensing data. How to manage such richness leveraging its complementarity is a crucial chal- lenge in modern remote sensing analysis. Data Fusion techniques deal with this point proposing method to combine and exploit complementarity among the different data sensors. Considering optical Very High Spatial Resolution (VHSR) images, satellites obtain both Multi Spectral (MS) and panchro- matic (PAN) images at different spatial resolution. VHSR images are extensively exploited to produce land cover maps to deal with agricultural, ecological, and socioeconomic issues as well as assessing ecosystem status, monitoring biodiversity and provid- ing inputs to conceive food risk monitoring systems. Common techniques to produce land cover maps from such VHSR images typically opt for a prior pansharpening of the multi-resolution source for a full resolution processing. Here, we propose a new deep learning architecture to jointly use PAN and MS imagery for a direct classification without any prior image fusion or resampling process. By managing the spectral information at its native spatial resolution, our method, named MRFusion, aims at avoiding the possible infor- mation loss induced by pansharpening or any other hand-crafted preprocessing. Moreover, the proposed architecture is suitably designed to learn non-linear transformations of the sources with the explicit aim of taking as much as possible advantage of the complementarity of PAN and MS imagery. Experiments are carried out on two-real world scenarios depicting large areas with different land cover characteristics. The characteristics of the proposed scenarios underline the applicability and the generality of our method in operational settings.
Exploration of Low Numeric Precision Deep Learning Inference Using Intel FPGAs
Venue: arXiv cs.DC 2018
Year: 2018

CNNs have been shown to maintain reasonable classification accuracy when quantized to lower precisions. Quantizing to sub 8-bit activations and weights can result in accuracy falling below an acceptable threshold. Techniques exist for closing the accuracy gap of limited numeric precision typically by increasing computation. This results in a trade-off between throughput and accuracy and can be tailored for different networks through various combinations of activation and weight data widths. Hardware architectures like FPGAs provide the opportunity for data width specific computation through unique logic configurations leading to highly optimized processing that is unattainable by full precision networks. Ternary and binary weighted networks offer an efficient method of inference for 2-bit and 1-bit data respectively. Most hardware architectures can take advantage of the memory storage and bandwidth savings that come along with smaller datapaths, but very few architectures can take advantage of limited numeric precision at the computation level. In this paper, we present a hardware design for FPGAs that takes advantage of bandwidth, memory, power, and computation savings of limited numerical precision data. We provide insights into the trade-offs between throughput and accuracy for various networks and how they map to our framework. Further, we show how limited numeric precision computation can be efficiently mapped onto FPGAs for both ternary and binary cases. Starting with Arria 10, we show a 2-bit activation and ternary weighted AlexNet running in hardware that achieves 3,700 images per second on the ImageNet dataset with a top-1 accuracy of 0.49. Using a hardware modeler designed for our low numeric precision framework we project performance most notably for a 55.5 TOPS Stratix 10 device running a modified ResNet-34 with only 3.7% accuracy degradation compared with single precision.
Echo: An Edge-Centric Code Offloading System with Quality of Service Guarantee
Venue: arXiv cs.DC 2018
Year: 2018

Code offloading is promising to accelerate mobile applications and save energy of mobile devices by shifting some computation to cloud. However, existing code offloading systems suffer from a long communication delay between mobile devices and cloud. To address this challenge, in this paper, we consider to deploy edge nodes in the proximity of mobile devices, and study how they benefit code offloading. We design an edge-centric code offloading system, called Echo, over a three-layer computing hierarchy consisting of mobile devices, edge and cloud. A critical problem needs to be addressed by Echo is to decide which method should be offloaded to which computing platform (edge or cloud). Different from existing offloading systems that let mobile devices individually make offloading decisions, Echo implements a centralized decision engine at the edge node. This edge-centric design can fully exploit the limited hardware resources at the edge to provide an offloading service with Quality of Service guarantee. Furthermore, we propose some novel mechanisms, e.g., lazy object transmission and differential object update, to further improve system performance. The results of a small-scale real deployment and trace-driven simulations show that Echo significantly outperforms existing
An Improved Energy-Aware Clustering Method for the Regional Queries in the Internet of Things
Venue: arXiv cs.DC 2018
Year: 2018

We will offer a method to improve energy efficient consumption for processing queries on the Internet of Things. We focused on an energy efficient hierarchical clustering index tree such that we can facilitate time-correlated region queries in the I.O.T (Internet of Things). We try to improve clustering and make a change on its proposed index tree. We try to do this by optimizing the query processing. We improve clustering to increase the accuracy of the Internet of Things and prevent the network from disconnecting. In the article that we have chosen, there is a heterogeneous cluster which means there exists a large data difference in the two ends of a cluster. Also, it often happens that the same information is sent to the base station by two overlapping clusters; therefore, we save energy by eliminating duplicated data.