text
stringlengths
7.27k
650k
label
int64
0
10
1 A Resistance Distance-Based Approach for Optimal Leader Selection in Noisy Consensus Networks arXiv:1708.06873v1 [math.OC] 23 Aug 2017 Stacy Patterson, Member, IEEE, Yuhao Yi, and Zhongzhi Zhang Abstract—We study the performance of leader-follower noisy consensus networks, and in particular, the relationship betw...
3
arXiv:1709.05703v1 [] 17 Sep 2017 AI Programmer: Autonomously Creating Software Programs Using Genetic Algorithms Kory Becker Justin Gottschlich kbecker@primaryobjects.com Bloomberg LP justin.gottschlich@intel.com Intel Labs Abstract and, of course, a plethora of tools aimed at assisting programmers in nearly eve...
9
Fractality of Massive Graphs: Scalable Analysis with Sketch-Based Box-Covering Algorithm∗ Takuya Akiba† , Kenko Nakamura‡ , Taro Takaguchi§ † § Preferred Networks, Inc. ‡ Recruit Communications Co., Ltd. National Institute of Information and Communications Technology arXiv:1609.07994v1 [] 26 Sep 2016 akiba@preferre...
8
Gibbs Sampling with Low-Power Spiking Digital Neurons Srinjoy Das† + , Bruno Umbria Pedroni⊥ , Paul Merolla‡ , John Arthur‡ , Andrew S. Cassidy‡ , Bryan L. Jackson‡ Dharmendra Modha‡ , Gert Cauwenberghs⊥ + , Ken Kreutz-Delgado† + Email: {s2das, bpedroni, kreutz, gert}@ucsd.edu, {pameroll, arthurjo, andrewca, bryanlj, d...
9
Mechanism Design via Dantzig-Wolfe Decomposition Salman Fadaei ⋆⋆ arXiv:1508.04250v2 [cs.GT] 15 Aug 2016 salman.fadaei@gmail.com Abstract. In random allocation rules, typically first an optimal fractional point is calculated via solving a linear program. The calculated point represents a fractional assignment of ob...
8
Structuring quantum effects: superoperators as arrows Juliana K. Vizzotto1∗ arXiv:quant-ph/0501151v1 25 Jan 2005 1 Thorsten Altenkirch2 Department of Computer Science Indiana University, USA 2 Amr Sabry1 School of Computer Science and IT The University of Nottingham, UK January 31, 2018 Abstract We show that t...
6
On flat submaps of maps of non-positive curvature arXiv:1702.08205v1 [] 27 Feb 2017 A.Yu. Olshanskii, M.V. Sapir∗ Abstract We prove that for every r > 0 if a non-positively curved (p, q)-map M contains no flat submaps of radius r, then the area of M does not exceed Crn for some constant C. This strengthens a theorem...
4
762 IEEE TRANSACTIONS ON TRANSPORTATION ELECTRIFICATION, VOL. 3, NO. 3, SEPTEMBER 2017 Modeling and Real-Time Scheduling of DC Platform Supply Vessel for Fuel Efficient Operation Kuntal Satpathi, Student Member, IEEE, VSK Murthy Balijepalli, Member, IEEE, and Abhisek Ukil, Senior Member, IEEE Abstract— DC marine arc...
3
Efficient Verification of Concurrent Programs Over the TSO Memory Model Chinmay Narayan, Subodh Sharma, S.Arun-Kumar arXiv:1606.05435v1 [cs.LO] 17 Jun 2016 Indian Institute of Technology Delhi Abstract. We address the problem of efficient verification of multithreaded programs running over Total Store Order (TSO) me...
6
arXiv:1303.2054v1 [] 8 Mar 2013 Mining Representative Unsubstituted Graph Patterns Using Prior Similarity Matrix∗ † Wajdi Dhifli Rabie Saidi Engelbert Mephu Nguifo Clermont University, Blaise Pascal University, LIMOS, BP 10448, F-63000 Clermont-Ferrand, France CNRS, UMR 6158, LIMOS, F-63173 Aubière, France Europea...
5
Framework for state and unknown input estimation of linear time-varying systems ? Peng Lu a , Erik-Jan van Kampen a , Cornelis C. de Visser a , Qiping Chu a arXiv:1606.08090v1 [] 26 Jun 2016 a Delft University of Technology, Kluyverweg 1, 2629HS Delft, The Netherlands Abstract The design of unknown-input decoupled ...
3
УДК 004.9:66.013.512 ИНФОРМАТИКА МОДЕЛИРОВАНИЕ СТРОИТЕЛЬНОЙ ПОДОСНОВЫ В САПР РЕКОНСТРУКЦИИ ПРЕДПРИЯТИЙ НА ОСНОВЕ МОДУЛЕЙ В ЧЕРТЕЖЕ В.В. Мигунов ЦЭСИ РТ при КМ РТ, г. Казань Аннотация Описаны параметрическая модель, состав и особенности реализации операций разработки чертежей строительной подосновы - общей составляющ...
5
On the Semantics of Intensionality arXiv:1712.09302v1 [cs.LO] 26 Dec 2017 and Intensional Recursion G. A. Kavvos St John’s College University of Oxford A thesis submitted for the degree of Doctor of Philosophy Trinity Term 2017 This thesis is dedicated to my father, John G. Kavvos (1948–2015), who taught me to pe...
6
CENTRAL QUOTIENT VERSUS COMMUTATOR SUBGROUP OF GROUPS arXiv:1011.2083v4 [] 10 Mar 2016 MANOJ K. YADAV Abstract. In 1904, Issai Schur proved the following result. If G is an arbitrary group such that G/ Z(G) is finite, where Z(G) denotes the center of the group G, then the commutator subgroup of G is finite. A partial...
4
arXiv:1611.08270v1 [math.CO] 24 Nov 2016 Status connectivity indices and co-indices of graphs and its computation to intersection graph, hypercube, Kneser graph and achiral polyhex nanotorus Harishchandra S. Ramanea∗, Ashwini S. Yalnaika†, a Reza Sharafdinib‡ Department of Mathematics, Karnatak University, Dharwad-5...
4
1 Quality and Diversity Optimization: A Unifying Modular Framework Abstract—The optimization of functions to find the best solution according to one or several objectives has a central role in many engineering and research fields. Recently, a new family of optimization algorithms, named Quality-Diversity optimization...
9
arXiv:1610.05725v2 [] 27 Oct 2016 Polynomial-time algorithm for determining the graph isomorphism Anatoly D. Plotnikov e-mail: a.plotnikov@list.ru Abstract We develop the methodology of positioning graph vertices relative to each other to solve the problem of determining isomorphism of two undirected graphs. Based on ...
8
Conditional Lower Bounds for Space/Time Tradeoffs Isaac Goldstein⋆1 , Tsvi Kopelowitz⋆⋆2 , Moshe Lewenstein⋆ ⋆ ⋆1 , and Ely Porat arXiv:1706.05847v2 [] 25 Jul 2017 1 ⋆ ⋆ ⋆1 Bar-Ilan University , {goldshi,moshe,porately}@cs.biu.ac.il 2 University of Waterloo , kopelot@gmail.com Abstract. In recent years much effort...
8
An efficient method for evaluating BEM singular integrals on curved elements with application in acoustic analysis Junjie Rong, Lihua Wen∗, Jinyou Xiao College of Astronautics, Northwestern Polytechnical University, Xi’an 710072, P. R. China arXiv:1306.0282v1 [] 3 Jun 2013 Abstract The polar coordinate transformation...
5
AN OKA PRINCIPLE FOR STEIN G-MANIFOLDS arXiv:1608.05156v2 [math.CV] 9 Jan 2017 GERALD W. SCHWARZ Abstract. Let G be a reductive complex Lie group acting holomorphically on Stein manifolds X and Y . Let pX : X → QX and pY : Y → QY be the quotient mappings. Assume that we have a biholomorphism Q := QX → QY and an open ...
4
arXiv:1705.07874v2 [] 25 Nov 2017 A Unified Approach to Interpreting Model Predictions Scott M. Lundberg Paul G. Allen School of Computer Science University of Washington Seattle, WA 98105 slund1@cs.washington.edu Su-In Lee Paul G. Allen School of Computer Science Department of Genome Sciences University of Washingto...
2
Trainable ISTA for Sparse Signal Recovery Daisuke Ito∗ , Satoshi Takabe∗† , and Tadashi Wadayama∗ ∗ Nagoya arXiv:1801.01978v1 [] 6 Jan 2018 Institute of Technology, Gokiso, Nagoya, Aichi, 466-8555, Japan, d.ito.480@stn.nitech.co.jp, {s_takabe, wadayama}@nitech.ac.jp † RIKEN Center for Advanced Intelligence Project, N...
7
1 Improving the Performance of OTDOA based Positioning in NB-IoT Systems Sha Hu† , Axel Berg‡ , Xuhong Li† , and Fredrik Rusek† of Electrical and Information Technology, Lund University, Lund, Sweden ‡ ARM, Lund, Sweden † {sha.hu, xuhong.li, fredrik.rusek}@eit.lth.se, ‡ axel.berg@arm.com arXiv:1704.05350v2 [] 5 Sep 2...
7
NEW CLASSES OF EXAMPLES SATISFYING THE THREE MATRIX ANALOG OF GERSTENHABER’S THEOREM arXiv:1711.10109v1 [] 28 Nov 2017 JENNA RAJCHGOT AND MATTHEW SATRIANO Abstract. In 1961, Gerstenhaber proved the following theorem: if k is a field and X and Y are commuting d × d matrices with entries in k, then the unital k-algebra...
0
Adversarial Attacks Beyond the Image Space arXiv:1711.07183v2 [] 21 Nov 2017 Xiaohui Zeng1 , Chenxi Liu2 , Yu-Siang Wang3 , Weichao Qiu2 , Lingxi Xie2 Yu-Wing Tai4 , Chi Keung Tang1 , Alan L. Yuille2 1 HKUST 2 Johns Hopkins U 3 National Taiwan U 4 Tencent Youtu Abstract Object Classification Generating adversarial...
1
Light spanners for bounded treewidth graphs imply light spanners for H-minor-free graphs∗ Glencora Borradaile and Hung Le Department of Electrical Engineering and Computer Science Oregon State University, USA glencora@eecs.orst.edu, lehu@onid.oregonstate.edu arXiv:1703.10633v1 [] 30 Mar 2017 Abstract Grigni and Hung ...
8
arXiv:1310.2903v1 [] 10 Oct 2013 EXTREMAL BETTI NUMBERS OF SOME CLASSES OF BINOMIAL EDGE IDEALS AHMET DOKUYUCU A BSTRACT. Let G be a cycle or a complete bipartite graph. We show that the binomial edge ideal JG and its initial ideal with respect to the lexicographic order have the same extremal Betti number. This is a ...
0
arXiv:1801.06434v5 [] 14 Mar 2018 EffNet: AN EFFICIENT STRUCTURE FOR CONVOLUTIONAL NEURAL NETWORKS Ido Freeman, Lutz Roese-Koerner Anton Kummert Aptiv Wuppertal, Germany University of Wuppertal Department of Electical Engineering {first_name.last_name}@aptiv.com kummert@uni-wuppertal.de ABSTRACT With the ever in...
9
1 Generalizable Data-free Objective for Crafting Universal Adversarial Perturbations arXiv:1801.08092v1 [] 24 Jan 2018 Konda Reddy Mopuri*, Aditya Ganeshan*, R. Venkatesh Babu, Senior Member, IEEE Abstract—Machine learning models are susceptible to adversarial perturbations: small changes to input that can cause lar...
2
arXiv:1611.09350v1 [] 26 Nov 2016 A NOTE ABOUT THE (2, 3)-GENERATION OF SL12(q) TSANKO RAYKOV GENCHEV Abstract In this note we provide explicit uniform type (2, 3)-generators for the special linear group SL12 (q) for all q except for q = 2 or q = 4. Our considerations are easily traceable, self-contained and based onl...
4
Optimal weighted least-squares methods ∗ arXiv:1608.00512v1 [math.NA] 1 Aug 2016 Albert Cohen† and Giovanni Migliorati‡ August 2, 2016 Abstract We consider the problem of reconstructing an unknown bounded function u defined on a domain X ⊂ Rd from noiseless or noisy samples of u at n points (xi )i=1,...,n . We measu...
10
Non-Termination Inference of Logic Programs arXiv:cs/0406041v1 [] 22 Jun 2004 Etienne Payet and Fred Mesnard IREMIA, Université de La Réunion, France We present a static analysis technique for non-termination inference of logic programs. Our framework relies on an extension of the subsumption test, where some spec...
2
arXiv:1309.0135v1 [] 31 Aug 2013 RAMIFICATION OF LOCAL RINGS ALONG VALUATIONS STEVEN DALE CUTKOSKY AND PHAM AN VINH Abstract. In this paper we discuss stable forms of extensions of algebraic local rings along a valuation in all dimensions over a field k of characteristic zero, and generalize a formula of Ghezzi, Hà a...
0
DCS 12 March 2018 New Ideas for Brain Modelling 4 Kieran Greer Distributed Computing Systems, Belfast, UK. http://distributedcomputingsystems.co.uk Version 1.2 Abstract: This paper continues the research that considers a new cognitive model based strongly on the human brain. In particular, it considers the neural bi...
2
arXiv:1412.8054v2 [math.OC] 15 Nov 2016 Power Flow as an Algebraic System Jakub Marecek, Timothy McCoy, and Martin Mevissen ∗ January 24, 2018 Abstract Steady states of alternating-current (AC) circuits have been studied in considerable detail. In 1982, Baillieul and Byrnes derived an upper bound on the number of s...
5
FEAST: An Automated Feature Selection Framework for Compilation Tasks Pai-Shun Ting arXiv:1610.09543v1 [] 29 Oct 2016 Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor, Michigan 48109, USA Email: paishun@umich.edu Chun-Chen Tu Department of Statistics University of Michigan A...
6
arXiv:1611.06539v1 [] 20 Nov 2016 Efficient Stochastic Inference of Bitwise Deep Neural Networks Sebastian Vogel∗ Robert Bosch GmbH Corporate Research Campus 71272 Renningen, Germany sebastian.vogel@de.bosch.com Christoph Schorn∗ Robert Bosch GmbH Corporate Research Campus 71272 Renningen, Germany christoph.schorn@de...
9
Published as a conference paper at ICLR 2017 E MERGENCE OF FOVEAL IMAGE SAMPLING FROM LEARNING TO ATTEND IN VISUAL SCENES arXiv:1611.09430v2 [] 21 Oct 2017 Brian Cheung, Eric Weiss, Bruno Olshausen Redwood Center UC Berkeley {bcheung,eaweiss,baolshausen}@berkeley.edu A BSTRACT We describe a neural attention model ...
9
Discriminant analysis in small and large dimensions arXiv:1705.02826v1 [] 8 May 2017 Taras Bodnara,1 , Stepan Mazurb , Edward Ngailoa and Nestor Parolyac a b Department of Mathematics, Stockholm University, Roslagsvägen 101, SE-10691 Stockholm, Sweden Unit of Statistics, School of Business, Örebro University, Fak...
10
Information Sciences Information Sciences 00 (2014) 1–16 arXiv:1410.3744v1 [] 14 Oct 2014 Refined Particle Swarm Intelligence Method for Abrupt Motion Tracking Mei Kuan Lim1 , Chee Seng Chan1 , Dorothy Monekosso2 and Paolo Remagnino3 1 University of Malaya, Center of Image and Signal Processing, 50603 Kuala Lumpur, ...
9
st * Consi se eu * * Easy to ed R nt alu at e d arXiv:1507.07049v3 [] 16 Apr 2016 Ev cu m e Jedidiah McClurg Hossein Hojjat Nate Foster CU Boulder, USA Cornell University, USA Cornell University, USA CU Boulder, USA hojjat@cornell.edu jnfoster@cs.cornell.edu pavol.cerny@colorado.edu jedidiah.mcclurg@...
6
THE MONOID OF ORDER ISOMORPHISMS OF PRINCIPAL FILTERS OF A POWER OF THE POSITIVE INTEGERS arXiv:1802.03598v1 [] 10 Feb 2018 OLEG GUTIK AND TARAS MOKRYTSKYI Abstract. Let n be any positive integer and IPF (Nn ) be the semigroup of all order isomorphisms between principal filters of the n-th power of the set of positiv...
4
1 arXiv:1803.09099v1 [] 24 Mar 2018 A Resourceful Reframing of Behavior Trees CHRIS MARTENS, North Carolina State University ERIC BUTLER, University of Washington JOSEPH C. OSBORN, University of California, Santa Cruz Designers of autonomous agents, whether in physical or virtual environments, need to express nondete...
6
Massive Multiple Input Massive Multiple Output for 5G Wireless Backhauling D.-T. Phan-Huy1, P. Ratajczak1, R. D'Errico2, J. Järveläinen3*, D. Kong4, K. Haneda3, B. Bulut4, A. Karttunen3, M. Beach4, E. Mellios4, M. Castañeda5, M. Hunukumbure6, T. Svensson7 1 Orange Labs, 2CEA-LETI, 3Aalto Univ.,*Premix Oy, 4Univ. of Br...
7
Intersection Logic in sequent calculus style Simona Ronchi Della Rocca Alexis Saurin Dipartimento di Informatica Universita di Torino IT-10149 Torino, Italy ronchi@di.unito.it Laboratoire CNRS PPS & INRIA pi.r2 Paris, France alexis.saurin@pps.jussieu.fr Yiorgos Stavrinos Anastasia Veneti Graduate Program in Logic...
6
CHARACTERISTICS OF ROTA-BAXTER ALGEBRAS arXiv:1511.00936v1 [math.RA] 3 Nov 2015 LI GUO AND HOUYI YU Abstract. The characteristic is a simple yet important invariant of an algebra. In this paper, we study the characteristic of a Rota-Baxter algebra, called the Rota-Baxter characteristic. We introduce an invariant, cal...
0
Inactivation Decoding of LT and Raptor Codes: Analysis and Code Design arXiv:1706.05814v1 [] 19 Jun 2017 Francisco Lázaro, Student Member, IEEE, Gianluigi Liva, Senior Member, IEEE, Gerhard Bauch, Fellow, IEEE Abstract—In this paper we analyze LT and Raptor codes under inactivation decoding. A first order analysis ...
7
Distribution-free Detection of a Submatrix arXiv:1604.07449v1 [] 25 Apr 2016 Ery Arias-Castro∗ Yuchao Liu† Abstract. We consider the problem of detecting the presence of a submatrix with largerthan-usual values in a large data matrix. This problem was considered in (Butucea and Ingster, 2013) under a one-parameter ...
10
1 Diagnose like a Radiologist: Attention Guided Convolutional Neural Network for Thorax Disease Classification arXiv:1801.09927v1 [] 30 Jan 2018 Qingji Guan, Yaping Huang, Zhun Zhong, Zhedong Zheng, Liang Zheng and Yi Yang Abstract—This paper considers the task of thorax disease classification on chest X-ray images...
1
Classification of Major Depressive Disorder via Multi-Site Weighted LASSO Model Dajiang Zhu1, Brandalyn C. Riedel1, Neda Jahanshad1, Nynke A. Groenewold2,3, Dan J. Stein3, Ian H. Gotlib4, Matthew D. Sacchet5, Danai Dima6,7, James H. Cole8, Cynthia H.Y. Fu9, Henrik Walter10, Ilya M. Veer11, Thomas Frodl11,12, Lianne Sch...
5
Declarative vs Rule-based Control for Flocking Dynamics Usama Mehmood Department of Computer Science, Stony Brook University, USA Radu Grosu arXiv:1710.10013v1 [cs.MA] 27 Oct 2017 Cyber-Physical Systems Group, Technische Universitat Wien, Austria Ashish Tiwari SRI International, USA Nicola Paoletti Department o...
3
RANDOM SAMPLING IN COMPUTATIONAL ALGEBRA: HELLY NUMBERS AND VIOLATOR SPACES arXiv:1503.08804v3 [cs.DM] 23 Dec 2015 JESÚS A. DE LOERA, SONJA PETROVIĆ, AND DESPINA STASI Abstract. This paper transfers a randomized algorithm, originally used in geometric optimization, to computational problems in commutative algebra....
0
1 A new bio-inspired method for remote sensing imagery classification Amghar Yasmina Teldja*, Fizazi Hadria† The problem of supervised classification of the satellite image is considered to be the task of grouping pixels into a number of homogeneous regions in space intensity. This paper proposes a novel approach tha...
9
1 Automated Algorithm Selection on Continuous Black-Box Problems By Combining Exploratory Landscape Analysis and Machine Learning arXiv:1711.08921v1 [stat.ML] 24 Nov 2017 Pascal Kerschke and Heike Trautmann Abstract—In this paper, we build upon previous work on designing informative and efficient Exploratory Landsc...
8
1 A Decentralized Framework for Real-Time Energy Trading in Distribution Networks with Load and Generation Uncertainty arXiv:1705.02575v1 [] 7 May 2017 Shahab Bahrami and M. Hadi Amini email: bahramis@ece.ubc.ca, amini@cmu.edu Abstract—The proliferation of small-scale renewable generators and price-responsive loads ...
3
1 Decentralized Online Learning with Kernels Alec Koppel§ , Santiago Paternain? , Cédric Richard† and Alejandro Ribeiro? arXiv:1710.04062v1 [math.OC] 11 Oct 2017 Abstract We consider multi-agent stochastic optimization problems over reproducing kernel Hilbert spaces (RKHS). In this setting, a network of interconnec...
10
A note on the gap between rank and border rank Jeroen Zuiddam arXiv:1504.05597v2 [] 23 Mar 2017 Centrum Wiskunde & Informatica, Science Park 123, Amsterdam Abstract We study the tensor rank of the tensor corresponding to the algebra of n-variate complex polynomials modulo the dth power of each variable. As a result ...
0
Efficient Estimation of Partially Linear Models for Spatial Data over Complex Domains arXiv:1605.08737v2 [] 3 Jun 2016 Li Wanga , Guannan Wangb , Min-Jun Laic and Lei Gaoa a Iowa State University, b College of William & Mary and c University of Georgia Abstract: In this paper, we study the estimation of partially l...
10
arXiv:1506.05607v5 [] 22 Aug 2017 1 Unbounded-Time Analysis of Guarded LTI Systems with Inputs by Abstract Acceleration Dario Cattaruzza Alessandro Abate Peter Schrammel Daniel Kroening Abstract—Reachability analysis of continuous and discrete time systems is a hard problem that has seen much progress in the last de...
3
IAS/Park City Mathematics Series Volume 00, Pages 000–000 S 1079-5634(XX)0000-0 Four lectures on probabilistic methods for data science arXiv:1612.06661v2 [math.PR] 4 Nov 2017 Roman Vershynin Abstract. Methods of high-dimensional probability play a central role in applications for statistics, signal processing, theo...
10
NON-GORENSTEIN ISOLATED SINGULARITIES OF GRADED COUNTABLE COHEN-MACAULAY TYPE arXiv:1307.6206v1 [] 23 Jul 2013 BRANDEN STONE Abstract. In this paper we show a partial answer the a question of C. Huneke and G. Leuschke (2003): Let R be a standard graded Cohen-Macaulay ring of graded countable Cohen-Macaulay represent...
0
Optimized M2L Kernels for the Chebyshev Interpolation based Fast Multipole Method arXiv:1210.7292v2 [cs.NA] 20 Nov 2012 Matthias Messner, Berenger Bramas, Olivier Coulaud, Eric Darve November 21, 2012 Abstract A fast multipole method (FMM) for asymptotically smooth kernel functions (1/r, 1/r4 , Gauss and Stokes kerne...
5
The Lottery Ticket Hypothesis: Training Pruned Neural Networks arXiv:1803.03635v1 [cs.LG] 9 Mar 2018 Jonathan Frankle MIT CSAIL jfrankle@mit.edu Michael Carbin MIT CSAIL mcarbin@mit.edu Abstract Recent work on neural network pruning indicates that, at training time, neural networks need to be significantly larger i...
2
arXiv:1211.3445v2 [] 9 Sep 2013 K-GROUPS FOR RINGS OF FINITE COHEN–MACAULAY TYPE HENRIK HOLM Abstract. For a local Cohen–Macaulay ring R of finite CM-type, Yoshino has applied methods of Auslander and Reiten to compute the Grothendieck group K0 of the category mod R of finitely generated R-modules. For the same type o...
0
GP-ILQG: Data-driven Robust Optimal Control for Uncertain Nonlinear Dynamical Systems arXiv:1705.05344v1 [cs.RO] 15 May 2017 Gilwoo Lee Siddhartha S. Srinivasa Matthew T. Mason ∗ Abstract As we aim to control complex systems, use of a simulator in model-based reinforcement learning is becoming more common. However...
3
1 On Bounds of Spectral Efficiency of Optimally Beamformed NLOS Millimeter Wave Links arXiv:1708.04257v2 [] 23 Nov 2017 Rakesh R T, Student Member, IEEE, Debarati Sen, Member, IEEE, Goutam Das Abstract—Beamforming is an indispensable feature for millimeter wave (mmWave) wireless communications in order to compensa...
7
1 Millimeter Wave Communications for Future Mobile Networks arXiv:1705.06072v1 [] 17 May 2017 Ming Xiao, Senior Member, IEEE, Shahid Mumtaz, Senior Member, IEEE, Yongming Huang, Senior Member, IEEE, Linglong Dai, Senior Member, IEEE, Yonghui Li, Senior Member, IEEE, Michail Matthaiou, Senior Member, IEEE, George K. ...
7
Under review as a conference paper at ICLR 2017 D EEP U NSUPERVISED C LUSTERING WITH G AUSSIAN M IXTURE VARIATIONAL AUTOENCODERS arXiv:1611.02648v2 [cs.LG] 13 Jan 2017 Nat Dilokthanakul1,∗ , Pedro A. M. Mediano1 , Marta Garnelo1 , Matthew C. H. Lee1 , Hugh Salimbeni1 , Kai Arulkumaran2 & Murray Shanahan1 1 Departmen...
9
Probabilistic Numerical Methods for PDE-constrained Bayesian Inverse Problems Jon Cockayne∗ Chris Oates† Mark Girolami§ Tim Sullivan ‡ arXiv:1701.04006v1 [stat.ME] 15 Jan 2017 January 17, 2017 This paper develops meshless methods for probabilistically describing discretisation error in the numerical solution of p...
10
1 An Efficient Manifold Algorithm for Constructive Interference based Constant Envelope Precoding arXiv:1706.02900v1 [] 9 Jun 2017 Fan Liu, Student Member, IEEE, Christos Masouros, Senior Member, IEEE, Pierluigi Vito Amadori, Student Member, IEEE, and Huafei Sun Abstract—In this letter, we propose a novel manifold-...
7
Under review as a conference paper at ICLR 2018 R EINFORCEMENT L EARNING A LGORITHM S ELECTION Romain Laroche1 and Raphaël Féraud2 1 Microsoft Research Maluuba, Montréal, Canada 2 Orange Labs, Lannion, France arXiv:1701.08810v3 [stat.ML] 14 Nov 2017 A BSTRACT This paper formalises the problem of online algorithm ...
2
1 Interference Model Similarity Index and Its Applications to mmWave Networks: arXiv:1710.02659v1 [] 7 Oct 2017 Extended version Hossein Shokri-Ghadikolaei, Student Member, IEEE, Carlo Fischione, Member, IEEE, and Eytan Modiano, Fellow, IEEE Abstract In wireless communication networks, interference models are routi...
7
arXiv:1504.00923v1 [cs.CL] 3 Apr 2015 A UNIFIED DEEP NEURAL NETWORK FOR SPEAKER AND LANGUAGE RECOGNITION Fred Richardson, Douglas Reynolds Najim Dehak MIT Lincoln Laboratory Lexington, MA MIT CSAIL Cambridge, MA ABSTRACT Learned feature representations and sub-phoneme posteriors from Deep Neural Networks (DNNs) ha...
9
Fitness, Apprenticeship, and Polynomials arXiv:1612.03539v1 [math.AG] 12 Dec 2016 Bernd Sturmfels Abstract This article discusses the design of the Apprenticeship Program at the Fields Institute, held 21 August–3 September 2016. Six themes from combinatorial algebraic geometry were selected for the two weeks: curves...
0
PROGRAMMING REQUESTS/RESPONSES WITH GREATFREE IN THE CLOUD ENVIRONMENT Bing Li Department of Computer Science and Engineering, Xi'An Technological University, China bing.li@asu.edu ABSTRACT Programming request with GreatFree is an efficient programming technique to implement distributed polling in the cloud computing ...
6
Evolutionary Multimodal Optimization: A Short Survey Ka-Chun Wong (Department of Computer Science, University of Toronto) arXiv:1508.00457v1 [] 3 Aug 2015 August 4, 2015 Real world problems always have different multiple solutions. For instance, optical engineers need to tune the recording parameters to get as many ...
9
Chained Multi-stream Networks Exploiting Pose, Motion, and Appearance for Action Classification and Detection arXiv:1704.00616v2 [] 26 May 2017 Mohammadreza Zolfaghari , Gabriel L. Oliveira, Nima Sedaghat, and Thomas Brox University of Freiburg Freiburg im Breisgau, Germany {zolfagha,oliveira,nima,brox}@cs.uni-freibu...
2
1 Simultaneously Color-Depth Super-Resolution with Conditional Generative Adversarial Network arXiv:1708.09105v2 [] 8 Nov 2017 Lijun Zhao, Huihui Bai, Member, IEEE, Jie Liang, Senior Member, IEEE, Bing Zeng, Fellow, IEEE, Anhong Wang, Member, IEEE, and Yao Zhao, Senior Member, IEEE Abstract—Recently, Generative Adv...
1
Robust Kernelized Multi-View Self-Representations for Clustering by Tensor Multi-Rank Minimization Yanyun Qu, Jinyan Liu Yuan Xie, Wensheng Zhang arXiv:1709.05083v1 [] 15 Sep 2017 State Key Laboratory of Intelligent Control Fujian Key Laboratory of Sensing and Computing and Management of Complex Systems for Smart Ci...
1
arXiv:1401.5438v1 [math.CA] 21 Jan 2014 On the Reduction of Singularly-Perturbed Linear Differential Systems∗ Moulay Barkatou, Suzy S. Maddah XLIM UMR 7252 ; DMI University of Limoges; CNRS 123, Avenue Albert Thomas 87060 Limoges, France moulay.barkatou@unilim.fr suzy.maddah@etu.unilim.fr † Hassan Abbas Laboratory o...
0
1 Uniform Recovery Bounds for Structured Random Matrices in Corrupted Compressed Sensing arXiv:1706.09087v3 [] 7 Feb 2018 Peng Zhang, Lu Gan, Cong Ling and Sumei Sun Abstract—We study the problem of recovering an s-sparse signal x⋆ ∈ Cn from corrupted measurements y = Ax⋆ +z⋆ +w, where z⋆ ∈ Cm is a k-sparse corrupt...
7
A short note on Simulation and Abstraction Chris Hankin Institute for Security Science and Technology Imperial College London, UK c.hankin@imperial.ac.uk This short note is written in celebration of David Schmidt’s sixtieth birthday. He has now been active in the program analysis research community for over thirty yea...
6
An Online Development Environment for Answer Set Programming Elias Marcopoulos1 and Christian Reotutar2 and Yuanlin Zhang3 1 Department of Computer Science, Tufts University, USA Department of Computer Science, Johns Hopkins University, USA 3 Texas Tech University, Lubbock, TX, USA emarcopoulos@gmail.com, creotut1@jhu....
2
The exp-log normal form of types Decomposing extensional equality and representing terms compactly Danko Ilik arXiv:1502.04634v4 [cs.LO] 30 Jun 2016 Inria & LIX, Ecole Polytechnique 91128 Palaiseau Cedex, France danko.ilik@inria.fr Abstract 1. Lambda calculi with algebraic data types lie at the core of functional ...
6
1 Random Access Communication for Wireless Control Systems with Energy Harvesting Sensors arXiv:1801.10141v1 [math.OC] 30 Jan 2018 Miguel Calvo-Fullana, Carles Antón-Haro, Javier Matamoros, and Alejandro Ribeiro Abstract—In this paper, we study wireless networked control systems in which the sensing devices are po...
7
1 Strategic Topology Switching for Security–Part I: Consensus & Switching Times arXiv:1711.11183v2 [] 6 Apr 2018 Yanbing Mao, Emrah Akyol, and Ziang Zhang Abstract—This two-part paper considers the strategic topology switching for the second-order multi-agent systems under attack. In Part I, we propose a strategy o...
3
3D Trajectory Reconstruction of Dynamic Objects Using Planarity Constraints Sebastian Bullinger1 , Christoph Bodensteiner1 , Michael Arens1 and Rainer Stiefelhagen2 1 arXiv:1711.06136v1 [] 16 Nov 2017 2 Fraunhofer IOSB Karslruhe Institute of Technology {sebastian.bullinger,christoph.bodensteiner,michael.arens}@iosb...
1
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles∗ Pankaj K. Agarwal† Kyle Fox‡ Oren Salzman§ arXiv:1706.02939v1 [cs.CG] 9 Jun 2017 June 12, 2017 Abstract We study a path-planning problem amid a set O of obstacles in R2 , in which we wish to compute a short path between two points wh...
8
Wireless Expanders Shirel Attali∗ Merav Parter† David Peleg‡ Shay Solomon§ Abstract arXiv:1802.07177v1 [] 20 Feb 2018 This paper introduces an extended notion of expansion suitable for radio networks. A graph G = (V, E) is said to be an (αw , βw )-wireless expander if for every subset S ⊆ V s.t. |S| ≤ αw · |V |, ...
8
A CHARACTERIZATION FOR ASYMPTOTIC DIMENSION GROWTH arXiv:1612.06638v2 [math.MG] 6 Jan 2017 GOULNARA ARZHANTSEVA, GRAHAM A. NIBLO, NICK WRIGHT, AND JIAWEN ZHANG Abstract. We give a characterization for asymptotic dimension growth. We apply it to CAT(0) cube complexes of finite dimension, giving an alternative proof of...
4
Variable selection with Hamming loss Butucea, C.1,2 , Stepanova, N.A.3 , and Tsybakov, A.B.2 arXiv:1512.01832v4 [] 10 Mar 2017 1 Université Paris-Est Marne-la-Vallée, LAMA(UMR 8050), UPEM, UPEC, CNRS, F-77454, Marne-la-Vallée, France 2 CREST, ENSAE, Université Paris Saclay, 3, avenue P. Larousse 92245 Malakoff...
10
arXiv:1802.07284v1 [] 20 Feb 2018 Logic programming applications: What are the abstractions and implementations?∗ Yanhong A. Liu Computer Science Department, Stony Brook University liu@cs.stonybrook.edu December 24, 2017 Abstract This article presents an overview of applications of logic programming, classifying the...
2
1 Spectral Efficiency of Mixed-ADC Massive MIMO arXiv:1802.10259v1 [] 28 Feb 2018 Hessam Pirzadeh, Student Member, IEEE, and A. Lee Swindlehurst, Fellow, IEEE Abstract—We study the spectral efficiency (SE) of a mixedADC massive MIMO system in which K single-antenna users communicate with a base station (BS) equippe...
7
Co-evolutionary multi-task learning for dynamic time series prediction Rohitash Chandra, Yew-Soon Ong and Chi-Keong Goh arXiv:1703.01887v1 [] 27 Feb 2017 Rolls Royce @NTU Corp Lab Nanyang Technological University, 42 Nanyang View, Singapore Abstract Multi-task learning employs shared representation of knowledge for ...
9
Using Power-Hardware-in-the-Loop Experiments together with Co-simulation for the Holistic Validation of Cyber-Physical Energy Systems Van Hoa NGUYEN1, Yvon BESANGER1, Quoc Tuan TRAN2, Cédric BOUDINNET1, Tung Lam NGUYEN1,2, Ron BRANDL3, Thomas I. STRASSER4 1 University Grenoble Alpes, G2Elab, F-38000 Grenoble, France CN...
3
On imitation dynamics in potential population games arXiv:1709.04748v1 [] 13 Sep 2017 Lorenzo Zino, Giacomo Como, and Fabio Fagnani Abstract— Imitation dynamics for population games are studied and their asymptotic properties analyzed. In the considered class of imitation dynamics —that encompass the replicator equa...
3
DISCRETENESS OF F -JUMPING NUMBERS AT ISOLATED NON-Q-GORENSTEIN POINTS arXiv:1605.03825v2 [math.AG] 11 Apr 2017 PATRICK GRAF AND KARL SCHWEDE Abstract. We show that the F -jumping numbers of a pair (X, a) in positive characteristic have no limit points whenever the symbolic Rees algebra of −KX is finitely generated o...
0
arXiv:1709.06624v1 [math.AG] 19 Sep 2017 On the multiplicity of isolated roots of sparse polynomial systems∗ Marı́a Isabel Herrero♯,⋄ , Gabriela Jeronimo♯,†,⋄ , Juan Sabia†,⋄ ♯ Departamento de Matemática, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Ciudad Universitaria, (1428) Buenos Aires,...
0
E cient textualrepresentation of structure Brenton Chapin arXiv:1706.00862v1 [] 2 Jun 2017 ABSTRACT This paper attempts a more formal approach to the legibility of text based programming languages, presenting, with proof, minimum possible ways of representing structure in text interleaved with information. This presu...
2
1 System-Level Modeling and Optimization of the Energy Efficiency in Cellular Networks – A Stochastic Geometry Framework arXiv:1801.07513v1 [] 23 Jan 2018 Marco Di Renzo, Senior Member, IEEE, Alessio Zappone, Senior Member, IEEE, Thanh Tu Lam, Student Member, IEEE, and Mérouane Debbah, Fellow, IEEE Abstract—In thi...
7