text
stringlengths
2.85k
2.55M
label
int64
0
10
arXiv:1412.1393v1 [cs.PL] 3 Dec 2014 CLAZY: Lazy Calling for Common Lisp Marco Antoniotti Lab Linguaggi Programmazione – Programming Language Lab < LLP ΠΛΛ > Dipartimento di Informatica, Sistemistica e Comunicazione, Università Milano Bicocca U14 - Viale Sarca 336, I-20126 Milan, Italy Abstract This document contain...
6
Stepwise Transmit Antenna Selection in Downlink Massive Multiuser MIMO Ali Bereyhi, Saba Asaad, Ralf R. Müller arXiv:1802.05148v2 [cs.IT] 19 Feb 2018 Friedrich-Alexander Universität Erlangen-Nürnberg (FAU) ali.bereyhi@fau.de, saba.asaad@fau.de, ralf.r.mueller@fau.de Abstract—Due to the large power consumption in RF-...
7
1 Gray Box Identification of State-Space Models Using Difference of Convex Programming arXiv:1611.04359v1 [cs.SY] 14 Nov 2016 Chengpu Yu, Lennart Ljung and Michel Verhaegen Abstract—Gray-box identification is prevalent in modeling physical and networked systems. However, due to the nonconvex nature of the gray-box ...
3
On the Weighted Quartet Consensus problem∗ Manuel Lafond1 and Celine Scornavacca2 1 Department of Mathematics and Statistics, University of Ottawa, 585 King Edward Ave., K1N 6N5 Ottawa, Canada mlafond2@uottawa.ca Institut des Sciences de l’Evolution – Université Montpellier, CNRS, IRD, EPHE, Place Eugène Bataillon, 34...
8
1 Riding on the Primary: A New Spectrum Sharing Paradigm for Wireless-Powered IoT Devices arXiv:1801.06679v1 [cs.IT] 20 Jan 2018 Xin Kang, Member, IEEE, Ying-Chang Liang, Fellow, IEEE, Jing Yang, Member, IEEE Abstract In this paper, a new spectrum sharing model referred to as riding on the primary (ROP) is proposed ...
7
arXiv:1612.06958v3 [math.GR] 14 Sep 2017 CONTRACTION GROUPS AND PASSAGE TO SUBGROUPS AND QUOTIENTS FOR ENDOMORPHISMS OF TOTALLY DISCONNECTED LOCALLY COMPACT GROUPS BY Timothy P. Bywaters The University of Sydney, School of Mathematics and Statistics NSW 2006, Australia e-mail: t.bywaters@maths.usyd.edu.au AND Helge...
4
arXiv:1601.07317v2 [math.GR] 15 Oct 2016 DENSE NORMAL SUBGROUPS AND CHIEF FACTORS IN LOCALLY COMPACT GROUPS COLIN D. REID AND PHILLIP R. WESOLEK Abstract. In The essentially chief series of a compactly generated locally compact group, an analogue of chief series for finite groups is discovered for compactly generated ...
4
1 Online Geographical Load Balancing for Mobile Edge Computing with Energy arXiv:1704.00107v3 [cs.IT] 23 Dec 2017 Harvesting Jie Xu, Hang Wu, Lixing Chen, Cong Shen Abstract Mobile Edge Computing (MEC) (a.k.a. fog computing) has recently emerged to enable low-latency and location-aware data processing at the edge o...
7
Effective Classification of MicroRNA Precursors Using Combinatorial Feature Mining and AdaBoost Algorithms Ling Zhong and Jason T. L. Wang Bioinformatics Program and Department of Computer Science, New Jersey Institute of Technology, Newark, New Jersey 07102, USA Abstract MicroRNAs (miRNAs) are non-coding RNAs with ap...
5
Learnable Explicit Density for Continuous Latent Space and Variational Inference Chin-Wei Huang 1 Ahmed Touati 1 Laurent Dinh 1 Michal Drozdzal 1 2 Mohammad Havaei 1 2 Laurent Charlin 1 3 Aaron Courville 1 4 arXiv:1710.02248v1 [cs.LG] 6 Oct 2017 Abstract In this paper, we study two aspects of the variational autoenc...
2
On Low-Risk Heavy Hitter and Sparse Recovery Schemes Vasileios Nakos∗ Harvard University vasileiosnakos@g.harvard.edu Yi Li Division of Mathematical Sciences Nanyang Technological University yili@ntu.edu.sg arXiv:1709.02919v1 [cs.DS] 9 Sep 2017 David P. Woodruff Carnegie Mellon University dwoodruf@cs.cmu.edu Abstra...
8
Impact of different time series aggregation methods on optimal energy system design Leander Kotzura,∗, Peter Markewitza , Martin Robiniusa , Detlef Stoltena,b a Institute of Electrochemical Process Engineering (IEK-3), Forschungszentrum Jülich GmbH, Wilhelm-Johnen-Str., 52428 Jülich, Germany b Chair for Fuel Cells, ...
5
1 Distributed Kalman filtering with minimum-time consensus algorithm arXiv:1703.05438v1 [cs.SY] 16 Mar 2017 Ye Yuan, Ling Shi, Jun Liu, Zhiyong Chen, Hai-Tao Zhang and Jorge Goncalves Abstract Fueled by applications in sensor networks, these years have witnessed a surge of interest in distributed estimation and fil...
3
Convex Computation of the Reachable Set for Hybrid Systems with Parametric Uncertainty Shankar Mohan∗, Victor Shia†, Ram Vasudevan‡ arXiv:1601.01019v1 [math.OC] 5 Jan 2016 January 7, 2016 Abstract To verify the correct operation of systems, engineers need to determine the set of configurations of a dynamical model t...
3
Output-sensitive Complexity of Multiobjective Combinatorial Optimization Fritz Bökler*1 , Matthias Ehrgott2 , Christopher Morris†1 , and Petra Mutzel1 1 arXiv:1610.07204v1 [math.OC] 23 Oct 2016 Department of Computer Science, TU Dortmund University, Dortmund, Germany, {fritz.boekler, christopher.morris, petra.mutzel}...
8
arXiv:1612.00198v2 [math.GR] 7 Jul 2017 Pro-p subgroups of profinite completions of 3-manifold groups Henry Wilton∗ and Pavel Zalesskii† July 10, 2017 Abstract We completely describe the finitely generated pro-p subgroups of the profinite completion of the fundamental group of an arbitrary 3manifold. We also prove a ...
4
TESTING FOR PRINCIPAL COMPONENT DIRECTIONS UNDER WEAK IDENTIFIABILITY arXiv:1710.05291v1 [math.ST] 15 Oct 2017 By Davy Paindaveine∗ , Julien Remy and Thomas Verdebout Université libre de Bruxelles We consider the problem of testing, on the basis of a p-variate Gaussian random sample, the null hypothesis H0 : θ 1 = θ...
10
arXiv:1306.0514v4 [cs.NE] 3 Feb 2015 Riemannian metrics for neural networks II: recurrent networks and learning symbolic data sequences Yann Ollivier February 4, 2015 Abstract Recurrent neural networks are powerful models for sequential data, able to represent complex dependencies in the sequence that simpler models ...
9
arXiv:1802.02183v1 [cs.CV] 5 Jan 2018 Enhanced Image Classification With Data Augmentation Using Position Coordinates Avinash Kori Ganapathy Krishnamurthi Balaji Srinivasan avinashgkori@smail.iitm.ac.in gankrish@iitm.ac.in sbalaji@iitm.ac.in Abstract—In this paper we propose the use of image pixel position coord...
1
Typical Approximation Performance for Maximum Coverage Problem Satoshi Takabe,1, 2, ∗ Takanori Maehara,2 and Koji Hukushima3 1 arXiv:1706.08721v2 [cond-mat.dis-nn] 7 Feb 2018 Department of Computer Science, Nagoya Institute of Technology, Gokiso-cho, Showa-ku, Nagoya, Aichi, 466-8555, Japan 2 RIKEN Center for Advance...
8
F -SINGULARITIES UNDER GENERIC LINKAGE arXiv:1607.03972v2 [math.AC] 18 Mar 2018 LINQUAN MA, JANET PAGE, REBECCA R.G., WILLIAM TAYLOR, AND WENLIANG ZHANG Dedicated to Prof. Craig Huneke on the occasion of his 65th birthday Abstract. Let R = k[x1 , . . . , xn ] be a polynomial ring over a prefect field of positive cha...
0
1 A Stochastic Geometry-based Demand Response Management Framework for Cellular Networks Powered by Smart Grid arXiv:1612.01636v1 [cs.SY] 6 Dec 2016 Muhammad Junaid Farooq, Hakim Ghazzai, and Abdullah Kadri Qatar Mobility Innovations Center (QMIC), Qatar Science & Technology Park, Doha, Qatar, Email: {junaidf, hakim...
3
ROBUST STABILIZATION OF LINEAR PLANTS UNDER UNCERTAINTIES AND HIGH-FREQUENCY MEASUREMENT NOISES1 Igor B. Furtat*,**. Artem N. Nekhoroshikh, *,** *Institute for Problems of Mechanical Engineering Russian Academy of Sciences, 61 Bolshoy ave V.O., St.-Petersburg, 199178, Russia (Tel: +7-812-321-47-66; e-mail: cainenash@ma...
3
A COUNTEREXAMPLE TO QUESTIONS ABOUT BOUNDARIES, STABILITY, AND COMMENSURABILITY arXiv:1705.03984v3 [math.GR] 26 Jan 2018 JASON BEHRSTOCK A BSTRACT. We construct a family of right-angled Coxeter groups which provide counter-examples to questions about the stable boundary of a group, one-endedness of stable subgroups, ...
4
arXiv:1603.07713v3 [math.GR] 18 May 2016 CHIRAL POLYHEDRA AND FINITE SIMPLE GROUPS DIMITRI LEEMANS AND MARTIN W. LIEBECK Abstract. We prove that every finite non-abelian simple group acts as the automorphism group of a chiral polyhedron, apart from the groups P SL2 (q), P SL3 (q), P SU3 (q) and A7 . Keywords: finite ...
4
ActiveMonitor: Non-blocking Monitor Executions for Increased Parallelism arXiv:1408.0818v1 [cs.DC] 4 Aug 2014 Wei-Lun Hung Himanshu Chauhan∗ Vijay K. Garg† The University of Texas at Austin {wlhung,himanshu}@utexas.edu garg@ece.utexas.edu We present a set of novel ideas on design and implementation of monitor obj...
6
PORTRAIT GROWTH IN CONTRACTING, REGULAR BRANCH GROUPS arXiv:1710.02902v1 [math.GR] 9 Oct 2017 ZORAN ŠUNIĆ AND JONE URIA-ALBIZURI Abstract. We address a question of Grigorchuk by providing both a system of recursive formulas and an asymptotic result for the portrait growth of the first Grigorchuk group. The results ...
4
On Zariski’s Cancellation Problem in positive characteristic Neena Gupta Stat-Math Unit, Indian Statistical Institute arXiv:1309.1368v1 [math.AC] 5 Sep 2013 203 B.T. Road, Kolkata 700108, India e-mail: neenag@isical.ac.in, rnanina@gmail.com Abstract In this paper we shall show that when k is a field of positive char...
0
Stability and performance analysis of linear positive systems with delays using input-output methods arXiv:1703.00405v1 [math.OC] 1 Mar 2017 Corentin Briat∗ Abstract It is known that input-output approaches based on scaled small-gain theorems with constant Dscalings and integral linear constraints are non-conservati...
3
arXiv:1803.01683v1 [cs.SE] 22 Feb 2018 Investigating the Evolvability of Web Page Load Time Brendan Cody-Kenny1 , Umberto Manganiello2 , John Farrelly2 , Adrian Ronayne2 , Eoghan Considine2 , Thomas McGuire2 , and Michael O’Neill1 1 Natural Computing Research and Applications Group (NCRA), Michael Smurfit Graduate Bu...
9
arXiv:1504.00273v3 [math.GR] 24 May 2017 On Alternating and Symmetric Groups Which Are Quasi OD-Characterizable Ali Reza Moghaddamfar Faculty of Mathematics, K. N. Toosi University of Technology, P. O. Box 16315-1618, Tehran, Iran. E-mails: moghadam@ipm.ir and moghadam@kntu.ac.ir April 9, 2018 Abstract Let Γ(G) be the...
4
A Constructor-Based Reachability Logic for Rewrite Theories arXiv:1709.05045v1 [cs.PL] 15 Sep 2017 Stephen Skeirik, Andrei Stefanescu and José Meseguer University of Illinois at Urbana-Champaign, USA Abstract. Reachability logic has been applied to K rewrite-rule-based language definitions as a language-generic log...
6
Inferring protein-protein interaction and protein-DNA interaction directions based on cause–effect pairs in undirected and mixed networks1 Mehdy Roayaei2 and MohammadReza Razzazi3 Department of Computer Engineering and Information Technology, AmirKabir University of Technology, Tehran, Iran Abstract We consider the fo...
8
Programming the Interactions of Collective Adaptive Systems by Relying on Attribute-based Communication arXiv:1711.06092v3 [cs.PL] 29 Nov 2017 YEHIA ABD ALRAHMAN, IMT School for Advanced Studies, Lucca, Italy ROCCO DE NICOLA, IMT School for Advanced Studies, Lucca, Italy MICHELE LORETI, Università di Camerino, Cameri...
6
Hard Capacitated Set Cover and Uncapacitated Geometric Set Cover Rahil Sharma Department of Computer Science, The University of Iowa, Iowa City, IA 52242 arXiv:1612.03097v1 [cs.DS] 30 Nov 2016 rahil-sharma@uiowa.edu 1 Introduction In the optimization problem, minimum set cover, we are given a set system (X, S), wh...
8
arXiv:1801.04889v1 [math.GR] 15 Jan 2018 On non-amenable embeddable spaces in relation with free products Kévin BOUCHER January 16, 2018 Abstract In this paper we give sufficient conditions for a free product of residually finite groups to admit an embeddable box space. This generalizes the constructions of Arzhantse...
4
Robust Estimators in High Dimensions without the Computational Intractability arXiv:1604.06443v1 [cs.DS] 21 Apr 2016 Ilias Diakonikolas∗ CS, USC diakonik@usc.edu Jerry Li § EECS, MIT jerryzli@mit.edu Gautam Kamath† EECS, MIT g@csail.mit.edu Ankur Moitra¶ Math & CSAIL, MIT moitra@mit.edu Daniel Kane‡ CSE & Math, UCS...
10
Under consideration for publication in Theory and Practice of Logic Programming 1 arXiv:cs/0110034v2 [cs.PL] 10 Jul 2003 Inference of termination conditions for numerical loops in Prolog ALEXANDER SEREBRENIK and DANNY DE SCHREYE Department of Computer Science, K.U. Leuven Celestijnenlaan 200A, B-3001, Heverlee, Belg...
2
1 Adaptive Channel Prediction, Beamforming and Scheduling Design for 5G V2I Network arXiv:1707.07068v1 [cs.IT] 21 Jul 2017 Tadilo Endeshaw Bogale+ , Xianbin Wang++ and Long Bao Le+ Institute National de la Recherche Scientifique (INRS) Université du Québec, Montréal, Canada+ Western University, London, Canada++ E...
7
arXiv:1802.07789v1 [cs.CV] 21 Feb 2018 Semantic Segmentation Refinement by Monte Carlo Region Growing of High Confidence Detections Philipe A. Dias Henry Medeiros philipe.ambroziodias@marquette.edu henry.medeiros@marquette.edu EECE, Marquette University Milwaukee, WI, USA Abstract tasks aim at pixel-wise classif...
1
arXiv:1605.03733v1 [cs.SY] 12 May 2016 Kernel-based system identification from noisy and incomplete input-output data Riccardo S. Risuleo, Giulio Bottegal and Håkan Hjalmarsson ∗ May 13, 2016 Abstract In this contribution, we propose a kernel-based method for the identification of linear systems from noisy and inco...
3
Under review as a conference paper at ICLR 2017 R ENDER GAN: G ENERATING R EALISTIC L ABELED DATA Leon Sixt, Benjamin Wild, & Tim Landgraf Fachbereich Mathematik und Informatik Freie Universität Berlin Berlin, Germany arXiv:1611.01331v5 [cs.NE] 12 Jan 2017 {leon.sixt, benjamin.wild, tim.landgraf}@fu-berlin.de A BS...
9
arXiv:1607.04030v3 [math.GT] 26 Feb 2018 THE EXTENDED MAPPING CLASS GROUP CAN BE GENERATED BY TWO TORSIONS XIAOMING DU Abstract. Let Sg be the closed oriented surface of genus g and let Mod± (Sg ) be the extended mapping class group of Sg . When the genus is at least 5, we prove that Mod± (Sg ) can be generated by tw...
4
STUDY OF JOINT MMSE CONSENSUS AND RELAY SELECTION ALGORITHMS FOR DISTRIBUTED BEAMFORMING arXiv:1707.00953v1 [cs.IT] 28 May 2017 Hang Ruan * and Rodrigo C. de Lamare*# *Department of Electronics, The University of York, England, YO10 5BB # CETUC, Pontifical Catholic University of Rio de Janeiro, Brazil Emails: hr648@y...
7
Beyond Markov Logic: Efficient Mining of Prediction Rules in Large Graphs arXiv:1802.03638v2 [cs.DB] 13 Feb 2018 Tommaso Soru André Valdestilhas AKSW, University of Leipzig Leipzig, Germany 04109 tsoru@informatik.uni-leipzig.de AKSW, University of Leipzig Leipzig, Germany 04109 valdestilhas@informatik.uni-leipzig...
2
Disentangled Representations via Synergy Minimization arXiv:1710.03839v1 [cs.LG] 10 Oct 2017 Greg Ver Steeg1 , Rob Brekelmans1 , Hrayr Harutyunyan2 , and Aram Galstyan1 Abstract— Scientists often seek simplified representations of complex systems to facilitate prediction and understanding. If the factors comprising ...
7
Representation Learning using Event-based STDP Amirhossein Tavanaeia , Timothée Masquelierb , Anthony Maidaa arXiv:1706.06699v3 [cs.NE] 9 Mar 2018 a The School of Computing and Informatics University of Louisiana at Lafayette, Lafayette, LA 70504, USA Email: {tavanaei,maida}@louisiana.edu b CERCO UMR 5549, CNRS-Uni...
9
Adversarial Examples Detection in Deep Networks with Convolutional Filter Statistics arXiv:1612.07767v2 [cs.CV] 26 Oct 2017 Xin Li, Fuxin Li School of Electrical Engineering and Computer Science Oregon State University urumican@gmail.com, lif@eecs.oregonstate.edu Abstract Δ𝐼 Giant Panda (99.32% confidence) = +0...
1
Learning One-hidden-layer Neural Networks with Landscape Design Rong Ge Jason D. Lee Tengyu Ma arXiv:1711.00501v2 [cs.LG] 3 Nov 2017 November 6, 2017 Abstract We consider the problem of learning a one-hidden-layer neural network: we assume the input x ∈ Rd is from Gaussian distribution and the label y = a⊤ σ(Bx) + ...
8
Submitted to the Annals of Statistics EFFICIENT ESTIMATION FOR DIMENSION REDUCTION WITH CENSORED DATA arXiv:1710.05377v1 [math.ST] 15 Oct 2017 By Ge Zhao, Yanyuan Ma and Wenbin Lu∗ We propose a general index model for survival data, which generalizes many commonly used semiparametric survival models and belongs to t...
10
DATA AUGMENTATION BY PAIRING S AMPLES FOR I MAGES C LASSIFICATION Hiroshi Inoue IBM Research - Tokyo inouehrs@jp.ibm.com arXiv:1801.02929v1 [cs.LG] 9 Jan 2018 A BSTRACT Data augmentation is a widely used technique in many machine learning tasks, such as image classification, to virtually enlarge the training dataset ...
1
On kernel design for regularized LTI system identification ⋆ Tianshi Chen arXiv:1612.03542v3 [cs.SY] 31 Jul 2017 School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen, 518172, China, (e-mail: tschen@cuhk.edu.cn). Abstract There are two key issues for the kernel-based regularization method:...
3
Meta Inverse Reinforcement Learning via Maximum Reward Sharing for Human Motion Analysis arXiv:1710.03592v2 [cs.AI] 12 Oct 2017 Kun Li1 , Joel W. Burdick1 Abstract— This work handles the inverse reinforcement learning (IRL) problem where only a small number of demonstrations are available from a demonstrator for each...
2
An Adaptive Amoeba Algorithm for Shortest Path Tree Computation in Dynamic Graphs Xiaoge Zhang a,f , Qi Liub,c,g , Yong Hud , Felix T. S. Chane , Sankaran Mahadevanf , Zili Zhanga ,g , Yong Deng a,f* arXiv:1311.0460v1 [cs.NE] 3 Nov 2013 a School of Computer and Information Science, Southwest University, Chongqing ...
9
arXiv:1602.01952v2 [math.GR] 26 Feb 2017 A GENERALIZED AXIS THEOREM FOR CUBE COMPLEXES DANIEL J. WOODHOUSE Abstract. We consider a finitely generated virtually abelian group G acting properly and without inversions on a CAT(0) cube complex X. We prove that G stabilizes a finite dimensional CAT(0) subcomplex Y ⊆ X that...
4
arXiv:1712.01815v1 [cs.AI] 5 Dec 2017 Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm David Silver,1∗ Thomas Hubert,1∗ Julian Schrittwieser,1∗ Ioannis Antonoglou,1 Matthew Lai,1 Arthur Guez,1 Marc Lanctot,1 Laurent Sifre,1 Dharshan Kumaran,1 Thore Graepel,1 Timothy Lillicrap,1 Ka...
2
Toward Deeper Understanding of Neural Networks: The Power of Initialization and a Dual View on Expressivity arXiv:1602.05897v2 [cs.LG] 19 May 2017 Amit Daniely∗ Roy Frostig† Yoram Singer‡ May 23, 2017 Abstract We develop a general duality between neural networks and compositional kernels, striving towards a better...
2
1 Centralized versus Decentralized Infrastructure Networks arXiv:1510.08792v1 [physics.soc-ph] 29 Oct 2015 Paul D. H. Hines, Senior Member, IEEE, Seth Blumsack, Member, IEEE, and Markus Schläpfer Abstract—While many large infrastructure networks, such as power, water, and natural gas systems, have similar physical...
3
Submitted to the Annals of Statistics arXiv:1803.07793v1 [math.ST] 21 Mar 2018 HIGH-DIMENSIONAL COVARIANCE MATRICES IN ELLIPTICAL DISTRIBUTIONS WITH APPLICATION TO SPHERICAL TEST By Jiang Hu∗,¶ , Weiming Li†,k , ‡,∗∗ Zhi Liu and Wang Zhou§,†† Key Laboratory for Applied Statistics of MOE & Northeast Normal University¶...
10
arXiv:cs/0702131v1 [cs.CE] 22 Feb 2007 AICA: a New Pair Force Evaluation Method for Parallel Molecular Dynamics in Arbitrary Geometries Graham B. Macpherson ∗ and Jason M. Reese a Department of Mechanical Engineering, University of Strathclyde, Glasgow, G1 1XJ, UK Abstract A new algorithm for calculating intermolecu...
5
Homological vanishing for the Steinberg representation arXiv:1704.08344v3 [math.AT] 27 Nov 2017 Avner Ash Andrew Putman∗ Steven V Sam† November 20, 2017 Abstract For a field k, we prove that the ith homology of the groups GLn (k), SLn (k), Sp2n (k), SOn,n (k), and SOn,n+1 (k) with coefficients in their Steinberg re...
4
A STUDY ON SPLAY TREES∗ LUÍS M. S. RUSSO† arXiv:1511.03148v1 [cs.DS] 10 Nov 2015 Abstract. We study the dynamic optimality conjecture, which predicts that splay trees are a form of universally efficient binary search tree, for any access sequence. We reduce this claim to a regular access bound, which seems plausible...
8
LogLog-Beta and More: A New Algorithm for Cardinality Estimation Based on LogLog Counting Jason Qin, Denys Kim, Yumei Tung The AOLP Core Data Service, AOL, 22000 AOL Way Dulles, VA 20163 E-mail: j​ ason.qin@teamaol.com ​ ​ Abstract—The information presented in this paper defines LogLog-Beta (LogLog-β). LogLog-β is a...
8
THE SALLY MODULES OF IDEALS: A SURVEY arXiv:1612.06261v1 [math.AC] 19 Dec 2016 WOLMER V VASCONCELOS Abstract. The Sally module of a Rees algebra B relative to one of its Rees subalgebras A is a construct that can be used as a mediator for the trade-off of cohomological (e.g. depth) information between B and the corr...
0
On Coordinate Minimization of Convex Piecewise-Affine Functions Tomáš Werner Dept. of Cybernetics, Faculty of Electrical Engineering, Czech Technical Univ. in Prague Research Report CTU–CMP–2017–05 arXiv:1709.04989v1 [math.OC] 14 Sep 2017 September 14, 2017 Abstract A popular class of algorithms to optimize the du...
1
Inference for Continuous Time Random Maxima with Heavy-Tailed Waiting Times arXiv:1802.05218v2 [math.ST] 17 Feb 2018 Katharina Hees ∗ University of Dortmund and Smarak Nayak † National Australia Bank and Peter Straka ‡ UNSW Sydney February 20, 2018 Abstract In many complex systems of interest, inter-arrival times bet...
10
This paper has been accepted for publication in forthcoming issue of IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS. The content is final but has NOT been proof-read. This is an author copy for personal record only. SRE: Semantic Rules Engine For the Industrial InternetOf-Things Gateways Charbel El Kaed, Member, IEEE, Im...
2
1 Full-Duplex Relaying with Improper Gaussian Signaling over Nakagami-m Fading Channels arXiv:1704.06640v2 [cs.IT] 26 Sep 2017 Mohamed Gaafar, Student Member, IEEE, Mohammad Galal Khafagy, Senior Member, IEEE, Osama Amin, Senior Member, IEEE, Rafael F. Schaefer, Senior Member, IEEE and Mohamed-Slim Alouini, Fellow, ...
7
C OMPACT N EURAL N ETWORKS BASED ON THE M ULTISCALE E NTANGLEMENT R ENORMALIZATION A NSATZ Andrew Hallam1 , Edward Grant2 , Vid Stojevic1,3 , Simone Severini2,4 , Andrew G. Green5 arXiv:1711.03357v2 [cs.NE] 3 Apr 2018 1 Department of Physics & Astronomy, University College London Department of Computer Science, Univ...
9
Implementing an Agent Trade Server Magnus Boman arXiv:cs/0307064v1 [cs.CE] 29 Jul 2003 Swedish Institute of Computer Science (SICS) AB and The Royal Institute of Technology, Kista, Sweden Anna Sandin Swedish Institute of Computer Science (SICS) AB, Kista, Sweden Abstract An experimental server for stock trading aut...
5
Real-Time Stochastic Optimal Control for Multi-agent Quadrotor Systems Vicenç Gómez1 , Sep Thijssen2 , Andrew Symington3 , Stephen Hailes4 , Hilbert J. Kappen2 arXiv:1502.04548v5 [cs.SY] 10 Mar 2016 2 1 Universitat Pompeu Fabra. Barcelona, Spain vicen.gomez@upf.edu Radboud University Nijmegen, the Netherlands {s.t...
3
The gene family-free median of three Daniel Doerr1 , Pedro Feijão2 , Metin Balaban1 , and Cedric Chauve3 arXiv:1606.05910v1 [cs.DS] 19 Jun 2016 1 3 School of Computer and Communication Sciences, EPFL, 1015 Lausanne, Switzerland daniel.doerr@epfl.ch 2 Faculty of Technology, Bielefeld University, 33615 Bielefeld, Ge...
8
arXiv:1707.05163v2 [physics.ao-ph] 26 Sep 2017 Parcels v0.9: prototyping a Lagrangian Ocean Analysis framework for the petascale age Michael Lange1 and Erik van Sebille2,3 1 Grantham Institute & Department of Earth Science and Engineering, Imperial College London, UK Institute for Marine and Atmospheric research Utre...
5
arXiv:1711.06400v2 [math.RT] 23 Jan 2018 GENERICALLY FREE REPRESENTATIONS II: IRREDUCIBLE REPRESENTATIONS SKIP GARIBALDI AND ROBERT M. GURALNICK Abstract. We determine which faithful irreducible representations V of a simple linear algebraic group G are generically free for Lie(G), i.e., which V have an open subset co...
4
1 Secure SWIPT for Directional Modulation Aided AF Relaying Networks arXiv:1803.05278v1 [cs.IT] 14 Mar 2018 Xiaobo Zhou, Jun Li, Feng Shu, Qingqing Wu, Yongpeng Wu, Wen Chen, and Hanzo Lajos Abstract—Secure wireless information and power transfer based on directional modulation is conceived for amplify-andforward (...
7
arXiv:1710.01696v1 [math.ST] 4 Oct 2017 MAXIMUM LIKELIHOOD ESTIMATION OF THE LATENT CLASS MODEL THROUGH MODEL BOUNDARY DECOMPOSITION ELIZABETH ALLMAN, HECTOR BAÑOS CERVANTES, ROBIN EVANS, SERKAN HOŞTEN, KAIE KUBJAS, DANIEL LEMKE, JOHN RHODES, AND PIOTR ZWIERNIK Abstract. The Expectation-Maximization (EM) algorithm i...
10
OPERAD GROUPS AND THEIR FINITENESS PROPERTIES arXiv:1409.1085v3 [math.GR] 2 Apr 2016 WERNER THUMANN Abstract. We propose a new unifying framework for Thompson-like groups using a well-known device called operads and category theory as language. We discuss examples of operad groups which have appeared in the literatur...
4
RESEARCH REPORT N° 8581 March 2015 Project-Teams Neo ISRN INRIA/RR--8581--FR+ENG Konstantin Avrachenkov, Alexey Piunovskiy, Yi Zhang ISSN 0249-6399 arXiv:1503.08548v2 [cs.PF] 10 Mar 2017 Hitting Times in Markov Chains with Restart and their Application to Network Centrality Hitting Times in Markov Chains with R...
3
Single-sink Fractionally Subadditive Network Design Guru Guruganesh ∗1 , Jennifer Iglesias † 1 , R. Ravi ‡1 , and Laura Sanità2 1 arXiv:1707.01487v2 [cs.DS] 11 Jul 2017 Carnegie Mellon University, Pittsburgh, PA, USA , {ggurugan, jiglesia, ravi}@andrew.cmu.edu 2 University of Waterloo, Waterloo, Canada , laur...
8
Flexible Resource Allocation for Clouds and All-Optical Networks Dmitriy Katz1 , Baruch Schieber1 , and Hadas Shachnai2? arXiv:1605.04982v1 [cs.DS] 16 May 2016 1 IBM T.J. Watson Research Center, Yorktown Heights, NY 10598. E-mail: {katzrog,sbar}@us.ibm.com 2 Computer Science Department, Technion, Haifa 3200003, Isra...
8
The pure braid groups and their relatives arXiv:1602.05291v2 [math.GR] 29 May 2016 Alexander I. Suciu and He Wang Abstract In this mostly survey paper, we investigate the resonance varieties, the lower central series ranks, and the Chen ranks, as well as the residual and formality properties of several families of b...
4
Registration and Fusion of Multi-Spectral Images Using a Novel Edge Descriptor Nati Ofir Shai Silberstein Dani Rozenbaum Sharon Duvdevani Bar arXiv:1711.01543v4 [cs.CV] 24 Jan 2018 Abstract In this paper we introduce a fully end-to-end approach for multi-spectral image registration and fusion. Our method for fusio...
1
arXiv:1602.08307v2 [math.ST] 13 Nov 2017 A note on maximum likelihood estimation for cubic and quartic canonical toric Del Pezzo surfaces Dimitra Kosta Abstract This article focuses on the study of algebraic statistical models corresponding to toric Del Pezzo surfaces with Du Val singularities. A closedform for the ma...
10
arXiv:1506.01074v3 [math.GR] 11 Mar 2016 Discrete Mathematics and Theoretical Computer Science DMTCS vol. 18:3, 2016, #1 Factoriality and the Pin-Reutenauer procedure J. Almeida1∗ 1 2 3 J. C. Costa2† M. Zeitoun3‡ Centro de Matemática e Departamento de Matemática, Faculdade de Ciências, Universidade do Porto, Por...
4
1 Adversarial Generation of Training Examples: Applications to Moving Vehicle License Plate Recognition arXiv:1707.03124v3 [cs.CV] 10 Nov 2017 Xinlong Wang, Zhipeng Man, Mingyu You, Chunhua Shen Abstract—Generative Adversarial Networks (GAN) have attracted much research attention recently, leading to impressive res...
1
A COFFEE: an Optimizing Compiler for Finite Element Local Assembly arXiv:1407.0904v2 [cs.MS] 4 Jul 2014 Fabio Luporini, Imperial College London Ana Lucia Varbanescu, University of Amsterdam Florian Rathgeber, Imperial College London Gheorghe-Teodor Bercea, Imperial College London J. Ramanujam, Louisiana State Univers...
5
ON FUNCTION COMPOSITIONS THAT ARE POLYNOMIALS arXiv:1601.01779v1 [math.AC] 8 Jan 2016 ERHARD AICHINGER Abstract. For a polynomial map f : k n → k m (k a field), we investigate those polynomials g ∈ k[t1 , . . . , tn ] that can be written as a composition g = h ◦ f , where h : k m → k is an arbitrary function. In the...
0
Minimum Throughput Maximization in UAV-Aided Wireless Powered Communication Networks Junhee Park, Hoon Lee, Subin Eom, and Inkyu Lee, Fellow, IEEE School of Electrical Eng., Korea University, Seoul, Korea arXiv:1801.02781v1 [cs.IT] 9 Jan 2018 Email: {pjh0585, ihun1, esb777, inkyu}@korea.ac.kr Abstract This paper inv...
7
Predicting potential treatments for complex diseases based on miRNA and tissue specificity Liang Yu* School of Computer Science and Technology, Xidian University, Xi'an, 710071, P.R.China lyu@xidian.edu.cn *Corresponding author Jin Zhao School of Computer Science and Technology, Xidian University, Xi'an, 710071, P.R.Ch...
5
A Quadratic Assignment Formulation of the Graph Edit Distance Sébastien Bougleux1,4 , Luc Brun1,4 , Vincenzo Carletti1,2 , Pasquale Foggia2 , Benoit Gaüzère3,4 , and Mario Vento2 arXiv:1512.07494v1 [cs.DS] 23 Dec 2015 2 MVIA, 1 GREYC UMR 6072, CNRS - Université de Caen Normandie - ENSICAEN, France Dept. of Infor...
8
An Algebra of Synchronous Scheduling Interfaces Michael Mendler Faculty of Information Systems and Applied Computer Sciences Bamberg University michael.mendler@uni-bamberg.de In this paper we propose an algebra of synchronous scheduling interfaces which combines the expressiveness of Boolean algebra for logical and fu...
6
arXiv:0912.4877v1 [cs.PL] 24 Dec 2009 Electronic Notes in Theoretical Computer Science 86 No. 2 (2003) 14 pages Typing rule-based transformations over topological collections Julien Cohen 1 LaMI, U.M.R. 8042 CNRS – Université d’Évry Val d’Essonne 523 place des Terrasses de l’Agora 91000 Évry, France Abstract Pa...
6
New efficient algorithms for multiple change-point detection with kernels A. Célissec,e , G. Marota,c , M. Pierre-Jeana,b , G.J. Rigaillb,d a Univ. Lille Droit et Santé EA 2694 - CERIM, F-59000 Lille, France 8071 CNRS - Université d’Evry - INRA Laboratoire Statistique et Génome Evry c Inria Lille Nord Europe Équip...
10
EXISTENCE OF ALMOST COHEN-MACAULAY ALGEBRAS IMPLIES THE EXISTENCE OF BIG COHEN-MACAULAY ALGEBRAS arXiv:1601.03335v2 [math.AC] 29 Mar 2016 RAJSEKHAR BHATTACHARYYA Abstract. In [1], the dagger closure is extended over finitely generated modules over Noetherian local domain (R, m) and it is proved to be a Dietz closure....
0
Isogeometric shape optimisation of shell structures using multiresolution subdivision surfaces Kosala Bandara, Fehmi Cirak∗ Department of Engineering, University of Cambridge, Trumpington Street, Cambridge CB2 1PZ, U.K. arXiv:1605.06288v1 [math.NA] 20 May 2016 Abstract We introduce the isogeometric shape optimisation...
5
AN ALGORITHM FOR CANONICAL FORMS OF FINITE SUBSETS OF Zd UP TO AFFINITIES arXiv:1408.3310v3 [cs.DS] 8 Feb 2016 GIOVANNI PAOLINI Abstract. In this paper we describe an algorithm for the computation of canonical forms of finite subsets of Zd , up to affinities over Z. For fixed dimension d, this algorithm has worst-cas...
4
arXiv:1704.06942v1 [cs.AI] 23 Apr 2017 Population Seeding Techniques for Rolling Horizon Evolution in General Video Game Playing Raluca D. Gaina Simon M. Lucas Diego Pérez-Liébana University of Essex Colchester, UK Email: rdgain@essex.ac.uk University of Essex Colchester, UK Email: sml@essex.ac.uk University of...
9
Which Distribution Distances are Sublinearly Testable? arXiv:1708.00002v2 [cs.DS] 31 Oct 2017 Constantinos Daskalakis∗ EECS & CSAIL, MIT costis@csail.mit.edu Gautam Kamath† EECS & CSAIL, MIT g@csail.mit.edu John Wright‡ Physics, MIT jswright@mit.edu November 1, 2017 Abstract Given samples from an unknown distribu...
8
Least squares estimator for non-ergodic Ornstein-Uhlenbeck processes driven by Gaussian processes arXiv:1507.00802v2 [math.PR] 26 Sep 2016 Mohamed El Machkouri1 , Khalifa Es-Sebaiy2 and Youssef Ouknine3 Abstract: The statistical analysis for equations driven by fractional Gaussian process (fGp) is relatively recent....
10
Exploratory Data Analysis of The KelvinHelmholtz instability in Jets arXiv:1503.06331v1 [cs.CE] 21 Mar 2015 Santosh Tirunagari Department of Computing & CVSSP University of Surrey Guildford, Surrey GU2 7XH Email: s.tirunagari@surrey.ac.uk Abstract The KelvinHelmholtz (KH) instability is a fundamental wave instability...
5