5
5.0
Sep 28, 2019
09/19
Sep 28, 2019
by
Michael Gygli; Yale Song; Liangliang Cao
movies
eye 5
favorite 0
comment 0
The dependencies for the 2016 Yahoo video2gif neural network have intermittently gone offline. These are mirrors of those required files from the tutorial . The video2gif paper is mirrored on IA here: https://archive.org/details/arxiv-1605.04850
Topics: Computer Vision and Pattern Recognition, Multimedia, Computing Research Repository
16
16
Jul 2, 2018
07/18
Jul 2, 2018
by
Iztok Fister; Marjan Mernik; Bogdan Filipič
texts
eye 16
favorite 0
comment 0
This paper proposes a hybrid self-adaptive evolutionary algorithm for graph coloring that is hybridized with the following novel elements: heuristic genotype-phenotype mapping, a swap local search heuristic, and a neutral survivor selection operator. This algorithm was compared with the evolutionary algorithm with the SAW method of Eiben et al., the Tabucol algorithm of Hertz and de Werra, and the hybrid evolutionary algorithm of Galinier and Hao. The performance of these algorithms were tested...
Topics: Neural and Evolutionary Computing, Computing Research Repository
Source: http://arxiv.org/abs/1301.0939
17
17
Jul 2, 2018
07/18
Jul 2, 2018
by
Iztok Fister; Marjan Mernik; Janez Brest
texts
eye 17
favorite 0
comment 0
Evolutionary algorithms are good general problem solver but suffer from a lack of domain specific knowledge. However, the problem specific knowledge can be added to evolutionary algorithms by hybridizing. Interestingly, all the elements of the evolutionary algorithms can be hybridized. In this chapter, the hybridization of the three elements of the evolutionary algorithms is discussed: the objective function, the survivor selection operator and the parameter settings. As an objective function,...
Topics: Neural and Evolutionary Computing, Computing Research Repository
Source: http://arxiv.org/abs/1301.0929
5
5.0
Jul 2, 2018
07/18
Jul 2, 2018
by
Pavankumar Tallapragada; Nikhil Chopra
texts
eye 5
favorite 0
comment 0
In this paper we study an event based control algorithm for trajectory tracking in nonlinear systems. The desired trajectory is modelled as the solution of a reference system with an exogenous input and it is assumed that the desired trajectory and the exogenous input to the reference system are uniformly bounded. Given a continuous-time control law that guarantees global uniform asymptotic tracking of the desired trajectory, our algorithm provides an event based controller that not only...
Topics: Systems and Control, Mathematics, Computing Research Repository, Optimization and Control
Source: http://arxiv.org/abs/1301.0875
7
7.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Spyros Kontogiannis; Georgia Papastavrou; Andreas Paraskevopoulos; Dorothea Wagner; Christos Zaroliagis
texts
eye 7
favorite 0
comment 0
A novel landmark-based oracle (CFLAT) is presented, which provides earliest-arrival-time route plans in time-dependent road networks. To our knowledge, this is the first oracle that preprocesses combinatorial structures (collections of time-stamped min-travel-time-path trees) rather than travel-time functions. The preprocessed data structure is exploited by a new query algorithm (CFCA) which computes (and pays for it), apart from earliest-arrival-time estimations, the actual connecting path...
Topics: Data Structures and Algorithms, Computing Research Repository
Source: http://arxiv.org/abs/1704.08445
16
16
Jun 30, 2018
06/18
Jun 30, 2018
by
Irati Zamalloa; Risto Kojcev; Alejandro Hernández; Iñigo Muguruza; Lander Usategui; Asier Bilbao; Víctor Mayoral
texts
eye 16
favorite 0
comment 0
Robotics is called to be the next technological revolution and estimations indicate that it will trigger the fourth industrial revolution. This article presents a review of some of the most relevant milestones that occurred in robotics over the last few decades and future perspectives. Despite the fact that, nowadays, robotics is an emerging field, the challenges in many technological aspects and more importantly bringing innovative solutions to the market still remain open. The need of...
Topics: Computing Research Repository, Robotics
Source: http://arxiv.org/abs/1704.08617
11
11
Jun 30, 2018
06/18
Jun 30, 2018
by
Xinru Yan; Ted Pedersen
texts
eye 11
favorite 0
comment 0
This paper describes the Duluth system that participated in SemEval-2017 Task 6 #HashtagWars: Learning a Sense of Humor. The system participated in Subtasks A and B using N-gram language models, ranking highly in the task evaluation. This paper discusses the results of our system in the development and evaluation stages and from two post-evaluation runs.
Topics: Computing Research Repository, Computation and Language
Source: http://arxiv.org/abs/1704.08390
10
10.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Seungkyu Shin; Juyong Park
texts
eye 10
favorite 0
comment 0
In the modern era where highly-commodified cultural products compete heavily for mass consumption, finding the principles behind the complex process of how successful, "hit" products emerge remains a vital scientific goal that requires an interdisciplinary approach. Here we present a framework for tracing the cycle of prosperity-and-decline of a product to find insights into influential and potent factors that determine its success. As a rapid, high-throughput indicator of the...
Topics: Physics, Computing Research Repository, Physics and Society, Social and Information Networks
Source: http://arxiv.org/abs/1704.08437
5
5.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Biao Zhang; Deyi Xiong; Jinsong Su
texts
eye 5
favorite 0
comment 0
Neural machine translation (NMT) heavily relies on an attention network to produce a context vector for each target word prediction. In practice, we find that context vectors for different target words are quite similar to one another and therefore are insufficient in discriminatively predicting target words. The reason for this might be that context vectors produced by the vanilla attention network are just a weighted sum of source representations that are invariant to decoder states. In this...
Topics: Computing Research Repository, Computation and Language
Source: http://arxiv.org/abs/1704.08430
14
14
Jun 30, 2018
06/18
Jun 30, 2018
by
Boyue Wang; Yongli Hu; Junbin Gao; Yanfeng Sun; Haoran Chen; Baocai Yin
texts
eye 14
favorite 0
comment 0
Learning on Grassmann manifold has become popular in many computer vision tasks, with the strong capability to extract discriminative information for imagesets and videos. However, such learning algorithms particularly on high-dimensional Grassmann manifold always involve with significantly high computational cost, which seriously limits the applicability of learning on Grassmann manifold in more wide areas. In this research, we propose an unsupervised dimensionality reduction algorithm on...
Topics: Computing Research Repository, Computer Vision and Pattern Recognition
Source: http://arxiv.org/abs/1704.08458
8
8.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Matthias Kümmerer; Thomas S. A. Wallis; Matthias Bethge
texts
eye 8
favorite 0
comment 0
The field of fixation prediction is heavily model-driven, with dozens of new models published every year. However, progress in the field can be difficult to judge because models are compared using a variety of inconsistent metrics. As soon as a saliency map is optimized for a certain metric, it is penalized by other metrics. Here we propose a principled approach to solve the benchmarking problem: we separate the notions of saliency models and saliency maps. We define a saliency model to be a...
Topics: Statistics, Applications, Computing Research Repository, Computer Vision and Pattern Recognition
Source: http://arxiv.org/abs/1704.08615
7
7.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Stefano Beretta; Mauro Castelli; Ivo Goncalves; Daniele Ramazzotti
texts
eye 7
favorite 0
comment 0
One of the most challenging tasks when adopting Bayesian Networks (BNs) is the one of learning their structure from data. This task is complicated by the huge search space of possible solutions and turned out to be a well-known NP-hard problem and, hence, approximations are required. However, to the best of our knowledge, a quantitative analysis of the performance and characteristics of the different heuristics to solve this problem has never been done before. For this reason, in this work, we...
Topics: Learning, Machine Learning, Statistics, Artificial Intelligence, Computing Research Repository
Source: http://arxiv.org/abs/1704.08676
10
10.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Hengshuang Zhao; Xiaojuan Qi; Xiaoyong Shen; Jianping Shi; Jiaya Jia
texts
eye 10
favorite 0
comment 0
We focus on the challenging task of realtime semantic segmentation in this paper. It finds many practical applications and yet is with fundamental difficulty of reducing a large portion of computation for pixel-wise label inference. We propose an compressed-PSPNet-based image cascade network (ICNet) that incorporates multi-resolution branches under proper label guidance to address this challenge. We provide in-depth analysis of our framework and introduce the cascade feature fusion to quickly...
Topics: Computing Research Repository, Computer Vision and Pattern Recognition
Source: http://arxiv.org/abs/1704.08545
14
14
Jun 30, 2018
06/18
Jun 30, 2018
by
Ho Bae; Byunghan Lee; Sunyoung Kwon; Sungroh Yoon
texts
eye 14
favorite 0
comment 0
The technique of hiding messages in digital data is called a steganography technique. With improved sequencing techniques, increasing attempts have been conducted to hide hidden messages in deoxyribonucleic acid (DNA) sequences which have been become a medium for steganography. Many detection schemes have developed for conventional digital data, but these schemes not applicable to DNA sequences because of DNA's complex internal structures. In this paper, we propose the first DNA steganalysis...
Topics: Learning, Multimedia, Computing Research Repository
Source: http://arxiv.org/abs/1704.08443
3
3.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Michael Elkin; Ofer Neiman
texts
eye 3
favorite 0
comment 0
For a positive parameter $\beta$, the $\beta$-bounded distance between a pair of vertices $u,v$ in a weighted undirected graph $G = (V,E,\omega)$ is the length of the shortest $u-v$ path in $G$ with at most $\beta$ edges, aka {\em hops}. For $\beta$ as above and $\epsilon>0$, a {\em $(\beta,\epsilon)$-hopset} of $G = (V,E,\omega)$ is a graph $G' =(V,H,\omega_H)$ on the same vertex set, such that all distances in $G$ are $(1+\epsilon)$-approximated by $\beta$-bounded distances in $G\cup G'$....
Topics: Data Structures and Algorithms, Computing Research Repository
Source: http://arxiv.org/abs/1704.08468
2
2.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Christopher J. Tralie; Jose A. Perea
texts
eye 2
favorite 0
comment 0
This work introduces a novel framework for quantifying the presence and strength of recurrent dynamics in video data. Specifically, we provide continuous measures of periodicity (perfect repetition) and quasiperiodicity (superposition of periodic modes with non-commensurate periods), in a way which does not require segmentation, training, object tracking or 1-dimensional surrogate signals. Our methodology operates directly on video data. The approach combines ideas from nonlinear time series...
Topics: Computing Research Repository, Computer Vision and Pattern Recognition
Source: http://arxiv.org/abs/1704.08382
5
5.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Nicolas Honnorat; Christos Davatzikos
texts
eye 5
favorite 0
comment 0
Many neuroimaging studies focus on the cortex, in order to benefit from better signal to noise ratios and reduced computational burden. Cortical data are usually projected onto a reference mesh, where subsequent analyses are carried out. Several multiscale approaches have been proposed for analyzing these surface data, such as spherical harmonics and graph wavelets. As far as we know, however, the hierarchical structure of the template icosahedral meshes used by most neuroimaging software has...
Topics: Computing Research Repository, Computer Vision and Pattern Recognition
Source: http://arxiv.org/abs/1704.08631
5
5.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Borislav H. Hristov; Mona Singh
texts
eye 5
favorite 0
comment 0
A central goal in cancer genomics is to identify the somatic alterations that underpin tumor initiation and progression. This task is challenging as the mutational profiles of cancer genomes exhibit vast heterogeneity, with many alterations observed within each individual, few shared somatically mutated genes across individuals, and important roles in cancer for both frequently and infrequently mutated genes. While commonly mutated cancer genes are readily identifiable, those that are rarely...
Topics: Genomics, Quantitative Biology, Artificial Intelligence, Computing Research Repository, Molecular...
Source: http://arxiv.org/abs/1704.08544
5
5.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Berenger Bramas
texts
eye 5
favorite 0
comment 0
This paper describes fast sorting techniques using the recent AVX-512 instruction set. Our implementations benefit from the latest possibilities offered by AVX-512 to vectorize a two-parts hybrid algorithm: we sort the small arrays using a branch- free Bitonic variant, and we provide a vectorized partitioning kernel which is the main component of the well-known Quicksort. Our algorithm sorts in-place and is straightforward to implement thanks to the new instructions. Meanwhile, we also show how...
Topics: Mathematical Software, Computing Research Repository
Source: http://arxiv.org/abs/1704.08579
5
5.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Mehrnoosh Shafiee; Javad Ghaderi
texts
eye 5
favorite 0
comment 0
In data-parallel computing frameworks, intermediate parallel data is often produced at various stages which needs to be transferred among servers in the datacenter network (e.g. the shuffle phase in MapReduce). A stage often cannot start or be completed unless all the required data pieces from the preceding stage are received. \emph{Coflow} is a recently proposed networking abstraction to capture such communication patterns. We consider the problem of efficiently scheduling coflows with release...
Topics: Data Structures and Algorithms, Computing Research Repository, Discrete Mathematics
Source: http://arxiv.org/abs/1704.08357
2
2.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Zhiwei Lin; Yi Li; Xiaolian Guo
texts
eye 2
favorite 0
comment 0
Rankings are widely used in many information systems. In information retrieval, a ranking is a list of ordered documents, in which a document with lower position has higher ranking score than the documents behind it. This paper studies the consensus measure for a given set of rankings, in order to understand the degree to which the rankings agree and the extent to which the rankings are related. The proposed multi-facet approach, without the need for pairwise comparison between rankings, allows...
Topics: Artificial Intelligence, Computing Research Repository
Source: http://arxiv.org/abs/1704.08464
3
3.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Boštjan Brešar; Tanja Gologranc; Tim Kos
texts
eye 3
favorite 0
comment 0
A set $D$ of vertices in a graph $G$ is a dominating set if every vertex of $G$, which is not in $D$, has a neighbor in $D$. A set of vertices $D$ in $G$ is convex (respectively, isometric), if all vertices in all shortest paths (respectively, all vertices in one of the shortest paths) between any two vertices in $D$ lie in $D$. The problem of finding a minimum convex dominating (respectively, isometric dominating) set is considered in this paper from algorithmic point of view. For the class of...
Topics: Discrete Mathematics, Combinatorics, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1704.08484
5
5.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Lydia Manikonda; Cameron Dudley; Subbarao Kambhampati
texts
eye 5
favorite 0
comment 0
With the recent advancements in Artificial Intelligence (AI), various organizations and individuals started debating about the progress of AI as a blessing or a curse for the future of the society. This paper conducts an investigation on how the public perceives the progress of AI by utilizing the data shared on Twitter. Specifically, this paper performs a comparative analysis on the understanding of users from two categories -- general AI-Tweeters (AIT) and the expert AI-Tweeters (EAIT) who...
Topics: Artificial Intelligence, Computing Research Repository, Computers and Society, Social and...
Source: http://arxiv.org/abs/1704.08389
6
6.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Niel de Beaudrap; Dominic Horsman
texts
eye 6
favorite 0
comment 0
Quantum computing is moving rapidly to the point of deployment of technology. Functional quantum devices will require the ability to correct error in order to be scalable and effective. A leading choice of error correction, in particular for modular or distributed architectures, is the surface code with logical two-qubit operations realised via "lattice surgery". These operations consist of "merges" and "splits" acting non-unitarily on the logical states and are...
Topics: Logic in Computer Science, Quantum Physics, Computing Research Repository
Source: http://arxiv.org/abs/1704.08670
4
4.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Shahar Dobzinski; Shahar Ovadia
texts
eye 4
favorite 0
comment 0
We introduce a combinatorial variant of the cost sharing problem: several services can be provided to each player and each player values every combination of services differently. A publicly known cost function specifies the cost of providing every possible combination of services. A combinatorial cost sharing mechanism is a protocol that decides which services each player gets and at what price. We look for dominant strategy mechanisms that are (economically) efficient and cover the cost,...
Topics: Computer Science and Game Theory, Computing Research Repository
Source: http://arxiv.org/abs/1704.08480
6
6.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Philip Bille; Inge Li Gørtz; Nicola Prezza
texts
eye 6
favorite 0
comment 0
Re-Pair is an efficient grammar compressor that operates by recursively replacing high-frequency character pairs with new grammar symbols. The most space-efficient linear-time algorithm computing Re-Pair uses $(1+\epsilon)n+\sqrt n$ words on top of the re-writable text (of length $n$ and stored in $n$ words), for any constant $\epsilon>0$; in practice however, this solution uses complex sub-procedures preventing it from being practical. In this paper, we present an implementation of the...
Topics: Data Structures and Algorithms, Computing Research Repository
Source: http://arxiv.org/abs/1704.08558
3
3.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Dongrui Wu; Brent J. Lance; Vernon J. Lawhern; Stephen Gordon; Tzyy-Ping Jung; Chin-Teng Lin
texts
eye 3
favorite 0
comment 0
Riemannian geometry has been successfully used in many brain-computer interface (BCI) classification problems and demonstrated superior performance. In this paper, for the first time, it is applied to BCI regression problems, an important category of BCI applications. More specifically, we propose a new feature extraction approach for Electroencephalogram (EEG) based BCI regression problems: a spatial filter is first used to increase the signal quality of the EEG trials and also to reduce the...
Topics: Human-Computer Interaction, Learning, Computing Research Repository
Source: http://arxiv.org/abs/1704.08533
4
4.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Édouard Bonnet; Serge Gaspers; Antonin Lambilliotte; Stefan Rümmele; Abdallah Saffidine
texts
eye 4
favorite 0
comment 0
We study the parameterized complexity of several positional games. Our main result is that Short Generalized Hex is W[1]-complete parameterized by the number of moves. This solves an open problem from Downey and Fellows' influential list of open problems from 1999. Previously, the problem was thought of as a natural candidate for AW[*]-completeness. Our main tool is a new fragment of first-order logic where universally quantified variables only occur in inequalities. We show that model-checking...
Topics: Computational Complexity, Computing Research Repository
Source: http://arxiv.org/abs/1704.08536
4
4.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Javier Rodríguez-Fernández; Nuria González-Prelcic; Kiran Venugopal; Robert W. Heath
texts
eye 4
favorite 0
comment 0
Channel estimation is useful in millimeter wave (mmWave) MIMO communication systems. Channel state information allows optimized designs of precoders and combiners under different metrics such as mutual information or signal-to-interference-noise (SINR) ratio. At mmWave, MIMO precoders and combiners are usually hybrid, since this architecture provides a means to trade-off power consumption and achievable rate. Channel estimation is challenging when using these architectures, however, since there...
Topics: Information Theory, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1704.08572
3
3.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Gilberto Martinez; Janito V. Ferreira Filho; Eduardo X. Miqueles
texts
eye 3
favorite 0
comment 0
In this manuscript we present a fast GPU implementation for tomographic reconstruction of large datasets using data obtained at the Brazilian synchrotron light source. The algorithm is distributed in a cluster with 4 GPUs through a fast pipeline implemented in C programming language. Our algorithm is theoretically based on a recently discovered low complexity formula, computing the total volume within O(N3logN) floating point operations; much less than traditional algorithms that operates with...
Topics: Distributed, Parallel, and Cluster Computing, Computing Research Repository
Source: http://arxiv.org/abs/1704.08364
4
4.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Rajarshi Das; Manzil Zaheer; Siva Reddy; Andrew McCallum
texts
eye 4
favorite 0
comment 0
Existing question answering methods infer answers either from a knowledge base or from raw text. While knowledge base (KB) methods are good at answering compositional questions, their performance is often affected by the incompleteness of the KB. Au contraire, web text contains millions of facts that are absent in the KB, however in an unstructured form. {\it Universal schema} can support reasoning on the union of both structured KBs and unstructured text by aligning them in a common embedded...
Topics: Computing Research Repository, Computation and Language
Source: http://arxiv.org/abs/1704.08384
4
4.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Takashi Ishio; Yusuke Sakaguchi; Kaoru Ito; Katsuro Inoue
texts
eye 4
favorite 0
comment 0
Clone-and-own approach is a natural way of source code reuse for software developers. To assess how known bugs and security vulnerabilities of a cloned component affect an application, developers and security analysts need to identify an original version of the component and understand how the cloned component is different from the original one. Although developers may record the original version information in a version control system and/or directory names, such information is often either...
Topics: Software Engineering, Computing Research Repository
Source: http://arxiv.org/abs/1704.08395
2
2.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Chao Zhou; Chia-Wen Lin; Xinggong Zhang; Zongming Guo
texts
eye 2
favorite 0
comment 0
Dynamic adaptive streaming over HTTP (DASH) has recently been widely deployed in the Internet and adopted in the industry. It, however, does not impose any adaptation logic for selecting the quality of video fragments requested by clients and suffers from lackluster performance with respect to a number of desirable properties: efficiency, stability, and fairness when multiple players compete for a bottleneck link. In this paper, we propose a throughput-friendly DASH (TFDASH) rate control scheme...
Topics: Networking and Internet Architecture, Multimedia, Computing Research Repository
Source: http://arxiv.org/abs/1704.08535
7
7.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Muhammad Usman; Irfan Ahmed; M. Imran Aslam; Shujaat Khan; Usman Ali Shah
texts
eye 7
favorite 0
comment 0
The Internet of Things (IoT) being a promising technology of the future is expected to connect billions of devices. The increased number of communication is expected to generate mountains of data and the security of data can be a threat. The devices in the architecture are essentially smaller in size and low powered. Conventional encryption algorithms are generally computationally expensive due to their complexity and requires many rounds to encrypt, essentially wasting the constrained energy...
Topics: Cryptography and Security, Information Theory, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1704.08688
4
4.0
Jun 30, 2018
06/18
Jun 30, 2018
by
S. Luna Frank-Fischer; Venkatesan Guruswami; Mary Wootters
texts
eye 4
favorite 0
comment 0
In error-correcting codes, locality refers to several different ways of quantifying how easily a small amount of information can be recovered from encoded data. In this work, we study a notion of locality called the s-Disjoint-Repair-Group Property (s-DRGP). This notion can interpolate between two very different settings in coding theory: that of Locally Correctable Codes (LCCs) when s is large---a very strong guarantee---and Locally Recoverable Codes (LRCs) when s is small---a relatively...
Topics: Information Theory, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1704.08627
2
2.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Ben Athiwaratkun; Andrew Gordon Wilson
texts
eye 2
favorite 0
comment 0
Word embeddings provide point representations of words containing useful semantic information. We introduce multimodal word distributions formed from Gaussian mixtures, for multiple word meanings, entailment, and rich uncertainty information. To learn these distributions, we propose an energy-based max-margin objective. We show that the resulting approach captures uniquely expressive semantic information, and outperforms alternatives, such as word2vec skip-grams, and Gaussian embeddings, on...
Topics: Learning, Computing Research Repository, Machine Learning, Computation and Language, Statistics,...
Source: http://arxiv.org/abs/1704.08424
2
2.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Shayan Taheri; Jiann-Shiun Yuan
texts
eye 2
favorite 0
comment 0
Energy efficiency is one of the most important parameters for designing and building a computing system nowadays. Introduction of new transistor and memory technologies to the integrated circuits design have brought hope for low energy very large scale integration (VLSI) circuit design. This excellency is pleasant if the computing system is secure and the energy is not wasted through execution of malicious actions. In fact, it is required to make sure that the utilized transistor and memory...
Topics: Cryptography and Security, Computing Research Repository
Source: http://arxiv.org/abs/1704.08513
6
6.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Daniel Fett; Ralf Küsters; Guido Schmitz
texts
eye 6
favorite 0
comment 0
Web-based single sign-on (SSO) services such as Google Sign-In and Log In with Paypal are based on the OpenID Connect protocol. This protocol enables so-called relying parties to delegate user authentication to so-called identity providers. OpenID Connect is one of the newest and most widely deployed single sign-on protocols on the web. Despite its importance, it has not received much attention from security researchers so far, and in particular, has not undergone any rigorous security...
Topics: Cryptography and Security, Computing Research Repository
Source: http://arxiv.org/abs/1704.08539
4
4.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Danielle Gonzalez; Joanna C. S. Santos; Andrew Popovich; Mehdi Mirakhorli; Mei Nagappan
texts
eye 4
favorite 0
comment 0
Test case maintainability is an important concern, especially in open source and distributed development environments where projects typically have high contributor turnover with varying backgrounds and experience, and where code ownership changes often. Similar to design patterns, patterns for unit testing promote maintainability quality attributes such as ease of diagnoses, modifiability, and comprehension. In this paper, we report the results of a large-scale study on the usage of four xUnit...
Topics: Software Engineering, Computing Research Repository
Source: http://arxiv.org/abs/1704.08412
3
3.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Tomasz Raducha; Tomasz Gubiec
texts
eye 3
favorite 0
comment 0
Evolution and propagation of the world's languages is a complex phenomenon, driven, to a large extent, by social interactions. Multilingual society can be seen as a system of interacting agents, where the interaction leads to a modification of the language spoken by the individuals. Two people can reach the state of full linguistic compatibility due to the positive interactions, like transfer of loanwords. But, on the other hand, if they speak entirely different languages, they will separate...
Topics: Physics, Computing Research Repository, Social and Information Networks, Physics and Society
Source: http://arxiv.org/abs/1704.08359
3
3.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Yi-Hsin Chen; Wei-Yu Chen; Yu-Ting Chen; Bo-Cheng Tsai; Yu-Chiang Frank Wang; Min Sun
texts
eye 3
favorite 0
comment 0
Despite the recent success of deep-learning based semantic segmentation, deploying a pre-trained road scene segmenter to a city whose images are not presented in the training set would not achieve satisfactory performance due to dataset biases. Instead of collecting a large number of annotated images of each city of interest to train or refine the segmenter, we propose an unsupervised learning approach to adapt road scene segmenters across different cities. By utilizing Google Street View and...
Topics: Artificial Intelligence, Computing Research Repository, Computer Vision and Pattern Recognition
Source: http://arxiv.org/abs/1704.08509
4
4.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Britta Peis; José Verschae; Andreas Wierz
texts
eye 4
favorite 0
comment 0
We present a general approximation framework for weighted integer covering problems. In a weighted integer covering problem, the goal is to determine a non-negative integer solution $x$ to system $\{ Ax \geq r \}$ minimizing a non-negative cost function $c^T x$ (of appropriate dimensions). All coefficients in matrix $A$ are assumed to be non-negative. We analyze the performance of a very simple primal-dual greedy algorithm and discuss conditions of system $(A,r)$ that guarantee feasibility of...
Topics: Computing Research Repository, Discrete Mathematics
Source: http://arxiv.org/abs/1704.08522
7
7.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Quan Quan; Zhiyao Zhao; Liyong Lin; Peng Wang; Walter Murray Wonham; Kai-Yuan Cai
texts
eye 7
favorite 0
comment 0
In order to handle undesirable failures of a multicopter which occur in either the pre-flight process or the in-flight process, a failsafe mechanism design method based on supervisory control theory is proposed for the semi-autonomous control mode. Failsafe mechanism is a control logic that guides what subsequent actions the multicopter should take, by taking account of real-time information from guidance, attitude control, diagnosis, and other low-level subsystems. In order to design a...
Topics: Systems and Control, Computing Research Repository
Source: http://arxiv.org/abs/1704.08605
4
4.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Neil D. Sandham; Roderick Johnstone; Christian T. Jacobs
texts
eye 4
favorite 0
comment 0
A new approach to turbulence simulation, based on a combination of large-eddy simulation (LES) for the whole flow and an array of non-space-filling quasi-direct numerical simulations (QDNS), which sample the response of near-wall turbulence to large-scale forcing, is proposed and evaluated. The technique overcomes some of the cost limitations of turbulence simulation, since the main flow is treated with a coarse-grid LES, with the equivalent of wall functions supplied by the near-wall sampled...
Topics: Fluid Dynamics, Physics, Computational Engineering, Finance, and Science, Computing Research...
Source: http://arxiv.org/abs/1704.08368
5
5.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Vineet John
texts
eye 5
favorite 0
comment 0
This paper aims to catalyze the discussions about text feature extraction techniques using neural network architectures. The research questions discussed in the paper focus on the state-of-the-art neural network techniques that have proven to be useful tools for language processing, language generation, text classification and other computational linguistics tasks.
Topics: Computing Research Repository, Computation and Language
Source: http://arxiv.org/abs/1704.08531
6
6.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Panagiotis Tzirakis; George Trigeorgis; Mihalis A. Nicolaou; Björn Schuller; Stefanos Zafeiriou
texts
eye 6
favorite 0
comment 0
Automatic affect recognition is a challenging task due to the various modalities emotions can be expressed with. Applications can be found in many domains including multimedia retrieval and human computer interaction. In recent years, deep neural networks have been used with great success in determining emotional states. Inspired by this success, we propose an emotion recognition system using auditory and visual modalities. To capture the emotional content for various styles of speaking, robust...
Topics: Computing Research Repository, Computer Vision and Pattern Recognition, Computation and Language
Source: http://arxiv.org/abs/1704.08619
3
3.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Chris Culnane; Benjamin I. P. Rubinstein; Vanessa Teague
texts
eye 3
favorite 0
comment 0
We consider the privacy implications of public release of a de-identified dataset of Opal card transactions. The data was recently published at https://opendata.transport.nsw.gov.au/dataset/opal-tap-on-and-tap-off. It consists of tap-on and tap-off counts for NSW's four modes of public transport, collected over two separate week-long periods. The data has been further treated to improve privacy by removing small counts, aggregating some stops and routes, and perturbing the counts. This is a...
Topics: Cryptography and Security, Computing Research Repository
Source: http://arxiv.org/abs/1704.08547
4
4.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Elisabetta Bergamini; Henning Meyerhenke; Mark Ortmann; Arie Slobbe
texts
eye 4
favorite 0
comment 0
Finding central nodes is a fundamental problem in network analysis. Betweenness centrality is a well-known measure which quantifies the importance of a node based on the fraction of shortest paths going though it. Due to the dynamic nature of many today's networks, algorithms that quickly update centrality scores have become a necessity. For betweenness, several dynamic algorithms have been proposed over the years, targeting different update types (incremental- and decremental-only,...
Topics: Data Structures and Algorithms, Computing Research Repository
Source: http://arxiv.org/abs/1704.08592
6
6.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Saba Asaad; Ali Bereyhi; Ralf R. Müller; Amir M. Rabiei
texts
eye 6
favorite 0
comment 0
Consider a fading Gaussian MIMO channel with $N_\mathrm{t}$ transmit and $N_\mathrm{r}$ receive antennas. The transmitter selects $L_\mathrm{t}$ antennas corresponding to the strongest channels. For this setup, we study the distribution of the input-output mutual information when $N_\mathrm{t}$ grows large. We show that, for any $N_\mathrm{r}$ and $L_\mathrm{t}$, the distribution of the input-output mutual information is accurately approximated by a Gaussian distribution whose mean grows large...
Topics: Information Theory, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1704.08473
4
4.0
Jun 30, 2018
06/18
Jun 30, 2018
by
Bastien Moysset; Christopher Kermorvant; Christian Wolf
texts
eye 4
favorite 0
comment 0
Text line detection and localization is a crucial step for full page document analysis, but still suffers from heterogeneity of real life documents. In this paper, we present a new approach for full page text recognition. Localization of the text lines is based on regressions with Fully Convolutional Neural Networks and Multidimensional Long Short-Term Memory as contextual layers. In order to increase the efficiency of this localization method, only the position of the left side of the text...
Topics: Computing Research Repository, Computer Vision and Pattern Recognition
Source: http://arxiv.org/abs/1704.08628
