19
19

Jun 28, 2018
06/18

by
A Djaballah; Alexandre Chapoutot; Michel Kieffer; O Bouissou

texts

######
eye 19

######
favorite 0

######
comment 0

Recently, barrier certificates have been introduced to prove the safety of continuous or hybrid dynamical systems. A barrier certificate needs to exhibit some barrier function, which partitions the state space in two subsets: the safe subset in which the state can be proved to remain and the complementary subset containing some unsafe region. This approach does not require any reachability analysis, but needs the computation of a valid barrier function, which is difficult when considering...

Topics: Systems and Control, Computing Research Repository, Dynamical Systems, Mathematics

Source: http://arxiv.org/abs/1506.05885

2
2.0

Jun 28, 2018
06/18

by
A Mani

texts

######
eye 2

######
favorite 0

######
comment 0

An open concept of rough evolution and an axiomatic approach to granules was also developed recently by the present author. Subsequently the concepts were used in the formal framework of rough Y-systems (RYS) for developing on granular correspondences by her. These have since been used for a new approach towards comparison of rough algebraic semantics across different semantic domains by way of correspondences that preserve rough evolution and try to avoid contamination. In this research paper,...

Topics: Artificial Intelligence, Computing Research Repository

Source: http://arxiv.org/abs/1512.02140

2
2.0

Jun 30, 2018
06/18

by
A Mani

texts

######
eye 2

######
favorite 0

######
comment 0

Lattice-theoretic ideals have been used to define and generate non granular rough approximations over general approximation spaces over the last few years by few authors. The goal of these studies, in relation based rough sets, have been to obtain nice properties comparable to those of classical rough approximations. In this research paper, these ideas are generalized in a severe way by the present author and associated semantic features are investigated by her. Granules are used in the...

Topics: Logic, Computing Research Repository, Information Theory, Logic in Computer Science, Artificial...

Source: http://arxiv.org/abs/1704.05477

2
2.0

Jun 28, 2018
06/18

by
A Rakotomamonjy; S Koço; Liva Ralaivola

texts

######
eye 2

######
favorite 0

######
comment 0

Several sparsity-constrained algorithms such as Orthogonal Matching Pursuit or the Frank-Wolfe algorithm with sparsity constraints work by iteratively selecting a novel atom to add to the current non-zero set of variables. This selection step is usually performed by computing the gradient and then by looking for the gradient component with maximal absolute entry. This step can be computationally expensive especially for large-scale and high-dimensional data. In this work, we aim at accelerating...

Topics: Computing Research Repository, Learning

Source: http://arxiv.org/abs/1508.06477

15
15

Jun 28, 2018
06/18

by
A. -M. Leventi-Peetz; J. -V. Peetz

texts

######
eye 15

######
favorite 0

######
comment 0

A new method to derive Multivariate Quadratic equation systems (MQ) for the input and output bit variables of a cryptographic S-box from its algebraic expressions with the aid of the computer mathematics software system SageMath is presented. We consolidate the deficiency of previously presented MQ metrics, supposed to quantify the resistance of S-boxes against algebraic attacks.

Topics: Computing Research Repository, Cryptography and Security

Source: http://arxiv.org/abs/1506.04319

4
4.0

Jun 30, 2018
06/18

by
A. A. Karawia

texts

######
eye 4

######
favorite 0

######
comment 0

Many authors studied numeric algorithms for solving the linear systems of the pentadiagonal type. The well-known Fast Pentadiagonal System Solver algorithm is an example of such algorithms. The current article are described new numeric and symbolic algorithms for solving pentadiagonal linear systems via transformations. New algorithms are natural generalization of the work presented in [Moawwad El- Mikkawy and Faiz Atlan, Algorithms for Solving Linear Systems of Equations of Tridiagonal Type...

Topics: Mathematics, Numerical Analysis, Symbolic Computation, Computing Research Repository

Source: http://arxiv.org/abs/1409.4802

3
3.0

Jun 30, 2018
06/18

by
A. A. Karawia

texts

######
eye 3

######
favorite 0

######
comment 0

In this paper, we developed new numeric and symbolic algorithms to find the inverse of any nonsingular heptadiagonal matrix. Symbolic algorithm will not break and it is without setting any restrictive conditions. The computational cost of our algorithms is $O(n)$. The algorithms are suitable for implementation using computer algebra system such as MAPLE, MATLAB and MATHEMATICA. Examples are given to illustrate the efficiency of the algorithms.

Topics: Mathematics, Numerical Analysis, Symbolic Computation, Computing Research Repository

Source: http://arxiv.org/abs/1412.4155

9
9.0

Jun 28, 2018
06/18

by
A. A. Nasir; S. Durrani; H. Mehrpouyan; S. D. Blostein; R. A. Kennedy

texts

######
eye 9

######
favorite 0

######
comment 0

Timing and carrier synchronization is a fundamental requirement for any wireless communication system to work properly. Timing synchronization is the process by which a receiver node determines the correct instants of time at which to sample the incoming signal. Carrier synchronization is the process by which a receiver adapts the frequency and phase of its local carrier oscillator with those of the received signal. In this paper, we survey the literature over the last five years (2010-2014)...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1507.02032

2
2.0

Jun 29, 2018
06/18

by
A. A. Panarin; A. V. Reznichenko; I. S. Terekhov

texts

######
eye 2

######
favorite 0

######
comment 0

We consider the optical fiber channel modelled by the nonlinear Shr\"{o}dinger equation with zero dispersion and additive Gaussian noise. Using Feynman path-integral approach for the model we find corrections to conditional probability density function, output signal distribution, conditional and output signal entropies, and the channel capacity at large signal-to-noise ratio. We demonstrate that the correction to the channel capacity is positive for large signal power. Therefore, this...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1610.00906

3
3.0

Jun 30, 2018
06/18

by
A. A. Waskita; H. Suhartanto; L. T. Handoko

texts

######
eye 3

######
favorite 0

######
comment 0

An experiment to study the entropy method for an anomaly detection system has been performed. The study has been conducted using real data generated from the distributed sensor networks at the Intel Berkeley Research Laboratory. The experimental results were compared with the elliptical method and has been analyzed in two dimensional data sets acquired from temperature and humidity sensors across 52 micro controllers. Using the binary classification to determine the upper and lower boundaries...

Topics: Cryptography and Security, Computing Research Repository

Source: http://arxiv.org/abs/1703.04086

2
2.0

Jun 30, 2018
06/18

by
A. A. Waskita; H. Suhartanto; P. D. Persadha; L. T. Handoko

texts

######
eye 2

######
favorite 0

######
comment 0

A novel approach to analyze statistically the network traffic raw data is proposed. The huge amount of raw data of actual network traffic from the Intrusion Detection System is analyzed to determine if a traffic is a normal or harmful one. Using the active ports in each host in a network as sensors, the system continuously monitors the incoming packets, and generates its average behaviors at different time scales including its variances. The average region of behaviors at certain time scale is...

Topics: Cryptography and Security, Computing Research Repository

Source: http://arxiv.org/abs/1405.7268

2
2.0

Jun 30, 2018
06/18

by
A. Abdel-Rehim; C. Alexandrou; N. Anastopoulos; G. Koutsou; I. Liabotis; N. Papadopoulou

texts

######
eye 2

######
favorite 0

######
comment 0

PLQCD is a stand-alone software library developed under PRACE for lattice QCD. It provides an implementation of the Dirac operator for Wilson type fermions and few efficient linear solvers. The library is optimized for multi-core machines using a hybrid parallelization with OpenMP+MPI. The main objectives of the library is to provide a scalable implementation of the Dirac operator for efficient computation of the quark propagator. In this contribution, a description of the PLQCD library is...

Topics: Mathematical Software, High Energy Physics - Lattice, Computing Research Repository

Source: http://arxiv.org/abs/1405.0700

7
7.0

Jun 28, 2018
06/18

by
A. Amelio; C. Pizzuti

texts

######
eye 7

######
favorite 0

######
comment 0

The roll calls of the Italian Parliament in the XVI legislature are studied by employing multidimensional scaling, hierarchical clustering, and network analysis. In order to detect changes in voting behavior, the roll calls have been divided in seven periods of six months each. All the methods employed pointed out an increasing fragmentation of the political parties endorsing the previous government that culminated in its downfall. By using the concept of modularity at different resolution...

Topics: Social and Information Networks, Computing Research Repository, Computers and Society

Source: http://arxiv.org/abs/1508.01354

2
2.0

Jun 30, 2018
06/18

by
A. Amorim Pereira; R. Sampaio-Neto

texts

######
eye 2

######
favorite 0

######
comment 0

Massive Multiple-input Multiple-output (MIMO) systems offer exciting opportunities due to their high spectral efficiencies capabilities. On the other hand, one major issue in these scenarios is the high-complexity detectors of such systems. In this work, we present a low-complexity, near maximum-likelihood (ML) performance achieving detector for the uplink in large MIMO systems with tens to hundreds of antennas at the base station (BS) and similar number of uplink users. The proposed algorithm...

Topics: Networking and Internet Architecture, Mathematics, Computing Research Repository, Information Theory

Source: http://arxiv.org/abs/1412.6118

3
3.0

Jun 30, 2018
06/18

by
A. Arbona; B. Miñano; A. Rigo; C. Bona; C. Palenzuela; A. Artigues; C. Bona-Casas; J. Massó

texts

######
eye 3

######
favorite 0

######
comment 0

Simflowny is an open platform which automatically generates parallel code of scientific dynamical models for different simulation frameworks. Here we present major upgrades on this software to support an extended set of families of models, in particular: i) a new generic family for partial differential equations, which can include spatial derivatives of any order, ii) a new family for agent based models to study complex phenomena --either on a spatial domain or on a graph--. Additionally we...

Topics: Mathematical Software, Computing Research Repository

Source: http://arxiv.org/abs/1702.04715

42
42

Jun 29, 2018
06/18

by
A. Atashpendar; T. Schilling; Th. Voigtmann

texts

######
eye 42

######
favorite 0

######
comment 0

We analyze the structure of the state space of chess by means of transition path sampling Monte Carlo simulation. Based on the typical number of moves required to transpose a given configuration of chess pieces into another, we conclude that the state space consists of several pockets between which transitions are rare. Skilled players explore an even smaller subset of positions that populate some of these pockets only very sparsely. These results suggest that the usual measures to estimate...

Topics: Artificial Intelligence, Computing Research Repository

Source: http://arxiv.org/abs/1609.04648

7
7.0

Jun 27, 2018
06/18

by
A. Atminas; R. Brignall; V. Lozin; J. Stacho

texts

######
eye 7

######
favorite 0

######
comment 0

We discover new hereditary classes of graphs that are minimal (with respect to set inclusion) of unbounded clique-width. The new examples include split permutation graphs and bichain graphs. Each of these classes is characterised by a finite list of minimal forbidden induced subgraphs. These, therefore, disprove a conjecture due to Daligault, Rao and Thomasse from 2010 claiming that all such minimal classes must be defined by infinitely many forbidden induced subgraphs. In the same paper,...

Topics: Combinatorics, Computing Research Repository, Discrete Mathematics, Mathematics

Source: http://arxiv.org/abs/1503.01628

2
2.0

Jun 29, 2018
06/18

by
A. Aurisano; A. Radovic; D. Rocco; A. Himmel; M. D. Messier; E. Niner; G. Pawloski; F. Psihas; A. Sousa; P. Vahle

texts

######
eye 2

######
favorite 0

######
comment 0

Convolutional neural networks (CNNs) have been widely applied in the computer vision community to solve complex problems in image recognition and analysis. We describe an application of the CNN technology to the problem of identifying particle interactions in sampling calorimeters used commonly in high energy physics and high energy neutrino physics in particular. Following a discussion of the core concepts of CNNs and recent innovations in CNN architectures related to the field of deep...

Topics: Computer Vision and Pattern Recognition, Computing Research Repository, High Energy Physics -...

Source: http://arxiv.org/abs/1604.01444

5
5.0

Jun 30, 2018
06/18

by
A. B. Dieker; Santosh Vempala

texts

######
eye 5

######
favorite 0

######
comment 0

Stochastic billiards can be used for approximate sampling from the boundary of a bounded convex set through the Markov Chain Monte Carlo (MCMC) paradigm. This paper studies how many steps of the underlying Markov chain are required to get samples (approximately) from the uniform distribution on the boundary of the set, for sets with an upper bound on the curvature of the boundary. Our main theorem implies a polynomial-time algorithm for sampling from the boundary of such sets.

Topics: Probability, Mathematics, Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1410.5775

7
7.0

Jun 27, 2018
06/18

by
A. Ben Hamza

texts

######
eye 7

######
favorite 0

######
comment 0

In this paper we introduce a nonextensive quantum information theoretic measure which may be defined between any arbitrary number of density matrices, and we analyze its fundamental properties in the spectral graph-theoretic framework. Unlike other entropic measures, the proposed quantum divergence is symmetric, matrix-convex, theoretically upper-bounded, and has the advantage of being generalizable to any arbitrary number of density matrices, with a possibility of assigning weights to these...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1504.01799

2
2.0

Jun 30, 2018
06/18

by
A. Bernini; S. Bilotta; R. Pinzani; A. Sabri; V. Vajnovszki

texts

######
eye 2

######
favorite 0

######
comment 0

Based on BRGC inspired order relations we give Gray codes and a generating algorithm for $q$-ary words avoiding a prescribed factor. These generalize an early 2001 result and a very recent one published by some of the present authors, and can be seen as an alternative to those of Squire published in 1996. Among the involved tools, we make use of generalized BRGC order relations, ultimate periodicity of infinite words, and word matching techniques.

Topics: Mathematics, Discrete Mathematics, Combinatorics, Computing Research Repository

Source: http://arxiv.org/abs/1404.0823

2
2.0

Jun 29, 2018
06/18

by
A. Bethani; A. J. Bevan; J. Hays; T. J. Stevenson

texts

######
eye 2

######
favorite 0

######
comment 0

We review the concept of support vector machines (SVMs) and discuss examples of their use. One of the benefits of SVM algorithms, compared with neural networks and decision trees is that they can be less susceptible to over fitting than those other algorithms are to over training. This issue is related to the generalisation of a multivariate algorithm (MVA); a problem that has often been overlooked in particle physics. We discuss cross validation and how this can be used to improve the...

Topics: Data Analysis, Statistics and Probability, Computing Research Repository, High Energy Physics -...

Source: http://arxiv.org/abs/1610.09932

7
7.0

Jun 29, 2018
06/18

by
A. Bordallo; F. Previtali; N. Nardelli; S. Ramamoorthy

texts

######
eye 7

######
favorite 0

######
comment 0

Many modern robotics applications require robots to function autonomously in dynamic environments including other decision making agents, such as people or other robots. This calls for fast and scalable interactive motion planning. This requires models that take into consideration the other agent's intended actions in one's own planning. We present a real-time motion planning framework that brings together a few key components including intention inference by reasoning counterfactually about...

Topics: Learning, Computing Research Repository, Robotics

Source: http://arxiv.org/abs/1610.08424

2
2.0

Jun 29, 2018
06/18

by
A. Borumand Saeid; Cristina Flaut; Sarka Hoskova-Mayerova; Roxana-Lavinia Cristea; M. Afshar; M. Kuchaki Rafsanjani

texts

######
eye 2

######
favorite 0

######
comment 0

In the last time some papers were devoted to the study of the con- nections between binary block codes and BCK-algebras. In this paper, we try to generalize these results to n-ary block codes, providing an algorithm which allows us to construct a BCK-algebra from a given n-ary block code.

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1608.03684

2
2.0

Jun 30, 2018
06/18

by
A. Borumand Saeid; H. Fatemidokht; C. Flaut; M. Kuchaki Rafsanjani

texts

######
eye 2

######
favorite 0

######
comment 0

In this paper, we present some new connections between BCK- algebras and binary block codes.

Topics: Mathematics, Computing Research Repository, Information Theory

Source: http://arxiv.org/abs/1412.8395

5
5.0

Jun 30, 2018
06/18

by
A. C. Cem Say; Abuzer Yakaryilmaz

texts

######
eye 5

######
favorite 0

######
comment 0

Although polynomial-time probabilistic Turing machines can utilize uncomputable transition probabilities to recognize uncountably many languages with bounded error when allowed to use logarithmic space, it is known that such "magic coins" give no additional computational power to constant-space versions of those machines. We show that adding a few quantum bits to the model changes the picture dramatically. For every language $L$, there exists such a two-way quantum finite automaton...

Topics: Quantum Physics, Computational Complexity, Computing Research Repository, Formal Languages and...

Source: http://arxiv.org/abs/1411.7647

6
6.0

Jun 30, 2018
06/18

by
A. C. Cem Say; Abuzer Yakaryilmaz

texts

######
eye 6

######
favorite 0

######
comment 0

We present five examples where quantum finite automata (QFAs) outperform their classical counterparts. This may be useful as a relatively simple technique to introduce quantum computation concepts to computer scientists. We also describe a modern QFA model involving superoperators that is able to simulate all known QFA and classical finite automaton variants.

Topics: Quantum Physics, Computational Complexity, Computing Research Repository, Formal Languages and...

Source: http://arxiv.org/abs/1406.4048

6
6.0

Jun 29, 2018
06/18

by
A. Canton; L. Fernandez-Jambrina; E. Rosado Maria; M. J. Vazquez-Gallo

texts

######
eye 6

######
favorite 0

######
comment 0

In this paper we review the derivation of implicit equations for non-degenerate quadric patches in rational Bezier triangular form. These are the case of Steiner surfaces of degree two. We derive the bilinear forms for such quadrics in a coordinate-free fashion in terms of their control net and their list of weights in a suitable form. Our construction relies on projective geometry and is grounded on the pencil of quadrics circumscribed to a tetrahedron formed by vertices of the control net and...

Topics: Graphics, Numerical Analysis, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1601.03224

5
5.0

Jun 27, 2018
06/18

by
A. Cantón; L. Fernández-Jambrina; M. E. Rosado María; M. J. Vázquez-Gallo

texts

######
eye 5

######
favorite 0

######
comment 0

In this paper we classify and derive closed formulas for geometric elements of quadrics in rational B\'ezier triangular form (such as the center, the conic at infinity, the vertex and the axis of paraboloids and the principal planes), using just the control vertices and the weights for the quadric patch. The results are extended also to quadric tensor product patches. Our results rely on using techniques from projective algebraic geometry to find suitable bilinear forms for the quadric in a...

Topics: Computing Research Repository, Mathematics, Numerical Analysis, Graphics

Source: http://arxiv.org/abs/1506.00967

10
10.0

Jun 27, 2018
06/18

by
A. Cantón; L. Fernández-Jambrina

texts

######
eye 10

######
favorite 0

######
comment 0

In this paper we address the problem of interpolating a spline developable patch bounded by a given spline curve and the first and the last rulings of the developable surface. In order to complete the boundary of the patch a second spline curve is to be given. Up to now this interpolation problem could be solved, but without the possibility of choosing both endpoints for the rulings. We circumvent such difficulty here by resorting to degree elevation of the developable surface. This is useful...

Topics: Numerical Analysis, Computing Research Repository, Mathematics, Graphics

Source: http://arxiv.org/abs/1503.06995

4
4.0

Jun 29, 2018
06/18

by
A. Casteigts; Y. Métivier; J. M. Robson; A. Zemmari

texts

######
eye 4

######
favorite 0

######
comment 0

We consider networks of processes which interact with beeps. In the basic model defined by Cornejo and Kuhn, which we refer to as the $BL$ variant, processes can choose in each round either to beep or to listen. Those who beep are unable to detect simultaneous beeps. Those who listen can only distinguish between silence and the presence of at least one beep. Beeping models are weak in essence and even simple tasks may become difficult or unfeasible with them. In this paper, we address the...

Topics: Distributed, Parallel, and Cluster Computing, Computing Research Repository

Source: http://arxiv.org/abs/1605.09516

2
2.0

Jun 28, 2018
06/18

by
A. Chiuso

texts

######
eye 2

######
favorite 0

######
comment 0

Regularization and Bayesian methods for system identification have been repopularized in the recent years, and proved to be competitive w.r.t. classical parametric approaches. In this paper we shall make an attempt to illustrate how the use of regularization in system identification has evolved over the years, starting from the early contributions both in the Automatic Control as well as Econometrics and Statistics literature. In particular we shall discuss some fundamental issues such as...

Topics: Systems and Control, Statistics, Machine Learning, Computing Research Repository

Source: http://arxiv.org/abs/1511.01543

6
6.0

Jun 30, 2018
06/18

by
A. Cichocki; D. Mandic; A-H. Phan; C. Caiafa; G. Zhou; Q. Zhao; L. De Lathauwer

texts

######
eye 6

######
favorite 0

######
comment 0

The widespread use of multi-sensor technology and the emergence of big datasets has highlighted the limitations of standard flat-view matrix models and the necessity to move towards more versatile data analysis tools. We show that higher-order tensors (i.e., multiway arrays) enable such a fundamental paradigm shift towards models that are essentially polynomial and whose uniqueness, unlike the matrix methods, is guaranteed under verymild and natural conditions. Benefiting fromthe power...

Topics: Numerical Analysis, Computing Research Repository

Source: http://arxiv.org/abs/1403.4462

4
4.0

Jun 30, 2018
06/18

by
A. Collins; J. Foniok; N. Korpelainen; V. Lozin; V. Zamaraev

texts

######
eye 4

######
favorite 0

######
comment 0

The celebrated theorem of Robertson and Seymour states that in the family of minor-closed graph classes, there is a unique minimal class of graphs of unbounded tree-width, namely, the class of planar graphs. In the case of tree-width, the restriction to minor-closed classes is justified by the fact that the tree-width of a graph is never smaller than the tree-width of any of its minors. This, however, is not the case with respect to clique-width, as the clique-width of a graph can be (much)...

Topics: Discrete Mathematics, Combinatorics, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1701.08857

2
2.0

Jun 30, 2018
06/18

by
A. D'yachkov; V. Rykov; C. Deppe; V. Lebedev

texts

######
eye 2

######
favorite 0

######
comment 0

We will discuss superimposed codes and non-adaptive group testing designs arising from the potentialities of compressed genotyping models in molecular biology. The given paper was motivated by the 30th anniversary of D'yachkov-Rykov recurrent upper bound on the rate of superimposed codes published in 1982. We were also inspired by recent results obtained for non-adaptive threshold group testing which develop the theory of superimposed codes

Topics: Mathematics, Computing Research Repository, Information Theory

Source: http://arxiv.org/abs/1401.7485

8
8.0

Jun 30, 2018
06/18

by
A. D. Medus; C. O. Dorso

texts

######
eye 8

######
favorite 0

######
comment 0

Vaccination is widely recognized as the most effective way of immunization against many infectious diseases. However, unfounded claims about supposed side effects of some vaccines have contributed to spread concern and fear among people, thus inducing vaccination refusal. For instance, MMR vaccine coverage has undergone an important decrease in a large part of Europe and US as a consequence of erroneously alleged side effects, leading to recent measles outbreaks. In this work, we propose a...

Topics: Physics, Physics and Society, Computing Research Repository, Social and Information Networks

Source: http://arxiv.org/abs/1412.0583

3
3.0

Jun 29, 2018
06/18

by
A. Dadkhah; M. S. Moslehian

texts

######
eye 3

######
favorite 0

######
comment 0

We present some generalizations of quantum information inequalities involving tracial positive linear maps between $C^*$-algebras. Among several results, we establish a noncommutative Heisenberg uncertainty relation. More precisely, we show that if $\Phi: \mathcal{A} \to \mathcal{B}$ is a tracial positive linear map between $C^*$-algebras , $\rho \in \mathcal{A}$ is a $\Phi$-density element and $A,B$ are self-adjoint operators of $\mathcal{A}$ such that $ {\rm...

Topics: Functional Analysis, Mathematics, Information Theory, Mathematical Physics, Operator Algebras,...

Source: http://arxiv.org/abs/1610.03929

2
2.0

Jun 29, 2018
06/18

by
A. Diego S. Farias; Valdigleis S. Costa; Luiz Ranyer A. Lopes; Benjamín Bedregal; Regivan Santiago

texts

######
eye 2

######
favorite 0

######
comment 0

In this paper we propose a special type of aggregation function which generalizes the notion of Ordered Weighted Averaging Function - OWA. The resulting functions are called Dynamic Ordered Weighted Averaging Functions --- DYOWAs. This generalization will be developed in such way that the weight vectors are variables depending on the input vector. Particularly, this operators generalize the aggregation functions: Minimum, Maximum, Arithmetic Mean, Median, etc, which are extensively used in...

Topics: Artificial Intelligence, Computing Research Repository

Source: http://arxiv.org/abs/1601.03785

6
6.0

Jun 30, 2018
06/18

by
A. Dyachkov

texts

######
eye 6

######
favorite 0

######
comment 0

For $q$-ary $n$-sequences, we develop the concept of similarity functions that can be used (for $q=4$) to model a thermodynamic similarity on DNA sequences. A similarity function is identified by the length of a longest common subsequence between two $q$-ary $n$-sequences. Codes based on similarity functions are called DNA codes. DNA codes are important components in biomolecular computing and other biotechnical applications that employ DNA hybridization assays. The main aim of the given...

Topics: Mathematics, Quantitative Methods, Computing Research Repository, Information Theory, Quantitative...

Source: http://arxiv.org/abs/1401.7492

9
9.0

Jun 30, 2018
06/18

by
A. E. Allahverdyan; Aram Galstyan

texts

######
eye 9

######
favorite 0

######
comment 0

Background: Confirmation bias is the tendency to acquire or evaluate new information in a way that is consistent with one's preexisting beliefs. It is omnipresent in psychology, economics, and even scientific practices. Prior theoretical research of this phenomenon has mainly focused on its economic implications possibly missing its potential connections with broader notions of cognitive science. Methodology/Principal Findings: We formulate a (non-Bayesian) model for revising subjective...

Topics: Physics, Physics and Society, Computing Research Repository, Social and Information Networks

Source: http://arxiv.org/abs/1411.4328

8
8.0

Jun 28, 2018
06/18

by
A. E. Biondo; A. Giarlotta; A. Pluchino; A. Rapisarda

texts

######
eye 8

######
favorite 0

######
comment 0

We present a graph-theoretic model of consumer choice, where final decisions are shown to be influenced by information and knowledge, in the form of individual awareness, discriminating ability, and perception of market structure. Building upon the distance-based Hotelling's differentiation idea, we describe the behavioral experience of several prototypes of consumers, who walk a hypothetical cognitive path in an attempt to maximize their satisfaction. Our simulations show that even consumers...

Topics: Social and Information Networks, Physics and Society, Computing Research Repository, Physics

Source: http://arxiv.org/abs/1507.01458

4
4.0

Jun 29, 2018
06/18

by
A. E. Kolesov; P. N. Vabishchevich

texts

######
eye 4

######
favorite 0

######
comment 0

We consider unsteady poroelasticity problem in fractured porous medium within the classical Barenblatt double-porosity model. For numerical solution of double-porosity poroelasticity problems we construct splitting schemes with respect to physical processes, where transition to a new time level is associated with solving separate problem for the displacements and fluid pressures in pores and fractures. The stability of schemes is achieved by switching to three-level explicit-implicit difference...

Topics: Computational Engineering, Finance, and Science, Numerical Analysis, Computing Research Repository,...

Source: http://arxiv.org/abs/1601.06368

2
2.0

Jun 30, 2018
06/18

by
A. Ebadat; B. Wahlberg; H. Hjalmarsson; C. R. Rojas; P. Hagg; C. A. Larsson

texts

######
eye 2

######
favorite 0

######
comment 0

In this paper we propose a method for applications oriented input design for linear systems under time-domain constraints on the amplitude of input and output signals. The method guarantees a desired control performance for the estimated model in minimum time, by imposing some lower bound on the information matrix. The problem is formulated as a time domain optimization problem, which is non-convex. This is addressed through an alternating method, where we separate the problem into two steps...

Topics: Systems and Control, Computing Research Repository

Source: http://arxiv.org/abs/1403.6953

2
2.0

Jun 30, 2018
06/18

by
A. Enis Cetin; Mohammad Tofighi

texts

######
eye 2

######
favorite 0

######
comment 0

Both wavelet denoising and denosing methods using the concept of sparsity are based on soft-thresholding. In sparsity based denoising methods, it is assumed that the original signal is sparse in some transform domains such as the wavelet domain and the wavelet subsignals of the noisy signal are projected onto L1-balls to reduce noise. In this lecture note, it is shown that the size of the L1-ball or equivalently the soft threshold value can be determined using linear algebra. The key step is an...

Topics: Mathematics, Computing Research Repository, Computer Vision and Pattern Recognition, Optimization...

Source: http://arxiv.org/abs/1406.2528

2
2.0

Jun 29, 2018
06/18

by
A. Erdem Sariyuce; Ali Pinar

texts

######
eye 2

######
favorite 0

######
comment 0

Discovering dense subgraphs and understanding the relations among them is a fundamental problem in graph mining. We want to not only identify dense subgraphs, but also build a hierarchy among them (e.g., larger but sparser subgraphs formed by two smaller dense subgraphs). Peeling algorithms (k-core, k-truss, and nucleus decomposition) have been effective to locate many dense subgraphs. However, constructing a hierarchical representation of density structure, even correctly computing the...

Topics: Computing Research Repository, Social and Information Networks

Source: http://arxiv.org/abs/1610.01961

9
9.0

Jun 29, 2018
06/18

by
A. Erdem Sariyuce; Ali Pinar

texts

######
eye 9

######
favorite 0

######
comment 0

Bipartite graphs are the natural way to model affiliation networks, such as actor-movie, document-keyword, and user-product networks. Finding dense bipartite subgraphs and detecting the relations among them is an important problem for affiliation networks that arise in a range of domains, such as social network analysis, word-document clustering, internet advertising, and bioinformatics, to name a few. However, most dense subgraph discovery algorithms are designed for classic, unipartite...

Topics: Physics and Society, Physics, Computing Research Repository, Social and Information Networks

Source: http://arxiv.org/abs/1611.02756

3
3.0

Jun 30, 2018
06/18

by
A. Fiasconaro; M. Tumminello; V. Nicosia; V. Latora; R. N. Mantegna

texts

######
eye 3

######
favorite 0

######
comment 0

We propose here two new recommendation methods, based on the appropriate normalization of already existing similarity measures, and on the convex combination of the recommendation scores derived from similarity between users and between objects. We validate the proposed measures on three relevant data sets, and we compare their performance with several recommendation systems recently proposed in the literature. We show that the proposed similarity measures allow to attain an improvement of...

Topics: Physics, Physics and Society, Computing Research Repository, Information Retrieval, Social and...

Source: http://arxiv.org/abs/1412.3697

2
2.0

Jun 29, 2018
06/18

by
A. Fotue Tabue; E. Martínez-Moro; C. Mouaha

texts

######
eye 2

######
favorite 0

######
comment 0

Given $\texttt{S}|\texttt{R}$ a finite Galois extension of finite chain rings and $\mathcal{B}$ an $\texttt{S}$-linear code we define two Galois operators, the closure operator and the interior operator. We proof that a linear code is Galois invariant if and only if the row standard form of its generator matrix has all entries in the fixed ring by the Galois group and show a Galois correspondence in the class of $\texttt{S}$-linear codes. As applications some improvements of upper and lower...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1602.01242

2
2.0

Jun 30, 2018
06/18

by
A. G. Chatterjee; M. K. Verma; M. Chaudhuri

texts

######
eye 2

######
favorite 0

######
comment 0

Pseudo-spectral method is one of the most accurate techniques for simulating turbulent flows. Fast Fourier transform (FFT) is an integral part of this method. In this paper, we present a new procedure to compute FFT in which we save operations during interprocess communications by avoiding transpose of the array. As a result, our transpose-free FFT is 15\% to 20\% faster than FFTW.

Topics: Physics, Fluid Dynamics, Computing Research Repository, Mathematical Software, Data Structures and...

Source: http://arxiv.org/abs/1406.5597

3
3.0

Jun 29, 2018
06/18

by
A. G. Chung; M. J. Shafiee; A. Wong

texts

######
eye 3

######
favorite 0

######
comment 0

The approximation of nonlinear kernels via linear feature maps has recently gained interest due to their applications in reducing the training and testing time of kernel-based learning algorithms. Current random projection methods avoid the curse of dimensionality by embedding the nonlinear feature space into a low dimensional Euclidean space to create nonlinear kernels. We introduce a Layered Random Projection (LaRP) framework, where we model the linear kernels and nonlinearity separately for...

Topics: Machine Learning, Statistics, Computer Vision and Pattern Recognition, Computing Research...

Source: http://arxiv.org/abs/1602.01818