id stringlengths 9 16 | title stringlengths 4 278 | categories listlengths 1 13 | abstract stringlengths 3 4.08k | filtered_category_membership dict |
|---|---|---|---|---|
1101.0305 | Measuring support for a hypothesis about a random parameter without
estimating its unknown prior | [
"math.ST",
"cs.IT",
"math.IT",
"q-bio.QM",
"stat.ME",
"stat.TH"
] | For frequentist settings in which parameter randomness represents variability rather than uncertainty, the ideal measure of the support for one hypothesis over another is the difference in the posterior and prior log odds. For situations in which the prior distribution cannot be accurately estimated, that ideal support... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0306 | The Degrees of Freedom Regions of Two-User and Certain Three-User MIMO
Broadcast Channels with Delayed CSIT | [
"cs.IT",
"math.IT"
] | The degrees of freedom (DoF) region of the fast-fading MIMO (multiple-input multiple-output) Gaussian broadcast channel (BC) is studied when there is delayed channel state information at the transmitter (CSIT). In this setting, the channel matrices are assumed to vary independently across time and the transmitter is as... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0309 | Concrete Sentence Spaces for Compositional Distributional Models of
Meaning | [
"cs.CL",
"cs.AI",
"cs.IR"
] | Coecke, Sadrzadeh, and Clark (arXiv:1003.4394v1 [cs.CL]) developed a compositional model of meaning for distributional semantics, in which each word in a sentence has a meaning vector and the distributional meaning of the sentence is a function of the tensor products of the word vectors. Abstractly speaking, this funct... | {
"Other": 0,
"cs.AI": 1,
"cs.CE": 0,
"cs.CL": 1,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 1,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0327 | On the Performance of Selection Cooperation with Imperfect Channel
Estimation | [
"cs.IT",
"math.IT"
] | In this paper, we investigate the performance of selection cooperation in the presence of imperfect channel estimation. In particular, we consider a cooperative scenario with multiple relays and amplify-and- forward protocol over frequency flat fading channels. In the selection scheme, only the "best" relay which maxim... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0339 | Lattice Sequential Decoding for LAST Coded MIMO Channels: Achievable
Rate, DMT, and Complexity Analysis | [
"cs.IT",
"math.IT"
] | In this paper, the asymptotic performance of the lattice sequential decoder for LAttice Space-Time (LAST) coded MIMO channel is analyzed. We determine the rates achievable by lattice coding and sequential decoding applied to such a channel. The diversity-multiplexing tradeoff (DMT) under lattice sequential decoding is ... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0345 | Diffusion of Confidential Information on Networks | [
"cs.SI",
"physics.soc-ph"
] | This is a natural generalization of the previous work by Dan, "Modeling and Simulation of Diffusion Phenomena on Social Networks," to appear in The proceedings of 2011 Third International Conference on Computer Modeling and Simulation. In this paper, we consider the diffusion phenomena of personal or secret information... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 1,
"cs.SY": 0
} |
1101.0350 | Graffiti Networks: A Subversive, Internet-Scale File Sharing Model | [
"cs.NI",
"cs.DB"
] | The proliferation of peer-to-peer (P2P) file sharing protocols is due to their efficient and scalable methods for data dissemination to numerous users. But many of these networks have no provisions to provide users with long term access to files after the initial interest has diminished, nor are they able to guarantee ... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 1,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0362 | An Adaptive Quantum-inspired Differential Evolution Algorithm for 0-1
Knapsack Problem | [
"cs.NE"
] | Differential evolution (DE) is a population based evolutionary algorithm widely used for solving multidimensional global optimization problems over continuous spaces. However, the design of its operators makes it unsuitable for many real-life constrained combinatorial optimization problems which operate on binary space... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 1,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0377 | Circadian pattern and burstiness in mobile phone communication | [
"physics.soc-ph",
"cs.SI"
] | The temporal communication patterns of human individuals are known to be inhomogeneous or bursty, which is reflected as the heavy tail behavior in the inter-event time distribution. As the cause of such bursty behavior two main mechanisms have been suggested: a) Inhomogeneities due to the circadian and weekly activity ... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 1,
"cs.SY": 0
} |
1101.0380 | Critical behavior and correlations on scale-free small-world networks.
Application to network design | [
"cond-mat.dis-nn",
"cond-mat.stat-mech",
"cs.SI",
"physics.soc-ph"
] | We analyze critical phenomena on networks generated as the union of hidden variables models (networks with any desired degree sequence) with arbitrary graphs. The resulting networks are general small-worlds similar to those a` la Watts and Strogatz but with a heterogeneous degree distribution. We prove that the critica... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 1,
"cs.SY": 0
} |
1101.0382 | Reduction in Solving Some Integer Least Squares Problems | [
"math.OC",
"cs.DS",
"cs.NA",
"cs.SY",
"math.NA"
] | Solving an integer least squares (ILS) problem usually consists of two stages: reduction and search. This thesis is concerned with the reduction process for the ordinary ILS problem and the ellipsoid-constrained ILS problem. For the ordinary ILS problem, we dispel common misconceptions on the reduction stage in the lit... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 1
} |
1101.0384 | Combining Neural Networks for Skin Detection | [
"cs.CV"
] | Two types of combining strategies were evaluated namely combining skin features and combining skin classifiers. Several combining rules were applied where the outputs of the skin classifiers are combined using binary operators such as the AND and the OR operators, "Voting", "Sum of Weights" and a new neural network. Th... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 1,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0407 | Interconnecting bilayer networks | [
"physics.soc-ph",
"cs.SI"
] | A typical complex system should be described by a supernetwork or a network of networks, in which the networks are coupled to some other networks. As the first step to understanding the complex systems on such more systematic level, scientists studied interdependent multilayer networks. In this letter, we introduce a n... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 1,
"cs.SY": 0
} |
1101.0428 | The Local Optimality of Reinforcement Learning by Value Gradients, and
its Relationship to Policy Gradient Learning | [
"cs.LG",
"cs.AI"
] | In this theoretical paper we are concerned with the problem of learning a value function by a smooth general function approximator, to solve a deterministic episodic control problem in a large continuous state space. It is shown that learning the gradient of the value-function at every point along a trajectory generate... | {
"Other": 0,
"cs.AI": 1,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 1,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0457 | Segmentation of Camera Captured Business Card Images for Mobile Devices | [
"cs.CV"
] | Due to huge deformation in the camera captured images, variety in nature of the business cards and the computational constraints of the mobile devices, design of an efficient Business Card Reader (BCR) is challenging to the researchers. Extraction of text regions and segmenting them into characters is one of such chall... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 1,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0461 | Distributive Network Utility Maximization (NUM) over Time-Varying Fading
Channels | [
"cs.IT",
"math.IT"
] | Distributed network utility maximization (NUM) has received an increasing intensity of interest over the past few years. Distributed solutions (e.g., the primal-dual gradient method) have been intensively investigated under fading channels. As such distributed solutions involve iterative updating and explicit message p... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0510 | Good Friends, Bad News - Affect and Virality in Twitter | [
"cs.SI",
"cs.CL",
"physics.soc-ph"
] | The link between affect, defined as the capacity for sentimental arousal on the part of a message, and virality, defined as the probability that it be sent along, is of significant theoretical and practical importance, e.g. for viral marketing. A quantitative study of emailing of articles from the NY Times finds a stro... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 1,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 1,
"cs.SY": 0
} |
1101.0529 | Channel Optimized Distributed Multiple Description Coding | [
"cs.IT",
"math.IT"
] | In this paper, channel optimized distributed multiple description vector quantization (CDMD) schemes are presented for distributed source coding in symmetric and asymmetric settings. The CDMD encoder is designed using a deterministic annealing approach over noisy channels with packet loss. A minimum mean squared error ... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0613 | Distributed Collections of Web Pages in the Wild | [
"cs.DL",
"cs.HC",
"cs.SI"
] | As the Distributed Collection Manager's work on building tools to support users maintaining collections of changing web-based resources has progressed, questions about the characteristics of people's collections of web pages have arisen. Simultaneously, work in the areas of social bookmarking, social news, and subscrip... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 1,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 1,
"cs.SY": 0
} |
1101.0640 | A note on outer bounds for broadcast channel | [
"cs.IT",
"math.IT"
] | In this note we establish two facts concerning the so-called {\em New-Jersey} outer bound. We show that this outer bound is equivalent to a much simpler {\em computable} region; and secondly we show that in the absence of private information this bound is exactly same as the $UV$-outerbound. | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0653 | On the Performance of Selection Cooperation with Outdated CSI and
Channel Estimation Errors | [
"cs.IT",
"math.IT"
] | In this paper, we investigate the performance of selection cooperation in the presence of imperfect channel estimation. In particular, we consider a cooperative scenario with multiple relays and amplify-and-forward protocol over frequency flat fading channels. In the selection scheme, only the "best" relay which maximi... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0656 | Evolution of Chinese airport network | [
"stat.AP",
"cs.SI",
"physics.soc-ph"
] | With the rapid development of economy and the accelerated globalization process, the aviation industry plays more and more critical role in today's world, in both developed and developing countries. As the infrastructure of aviation industry, the airport network is one of the most important indicators of economic growt... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 1,
"cs.SY": 0
} |
1101.0679 | Status of GDL - GNU Data Language | [
"astro-ph.IM",
"cs.CE"
] | GNU Data Language (GDL) is an open-source interpreted language aimed at numerical data analysis and visualisation. It is a free implementation of the Interactive Data Language (IDL) widely used in Astronomy. GDL has a full syntax compatibility with IDL, and includes a large set of library routines targeting advanced ma... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 1,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0698 | Best Effort and Practice Activation Codes | [
"cs.CR",
"cs.CE"
] | Activation Codes are used in many different digital services and known by many different names including voucher, e-coupon and discount code. In this paper we focus on a specific class of ACs that are short, human-readable, fixed-length and represent value. Even though this class of codes is extensively used there are ... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 1,
"cs.CL": 0,
"cs.CR": 1,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0764 | Binary Polar Code Kernels from Code Decompositions | [
"cs.IT",
"math.IT"
] | Code decompositions (a.k.a code nestings) are used to design good binary polar code kernels. The proposed kernels are in general non-linear and show a better rate of polarization under successive cancelation decoding, than the ones suggested by Korada et al., for the same kernel dimensions. In particular, kernels of si... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0766 | Information Retrieval of Jumbled Words | [
"cs.IR"
] | It is known that humans can easily read words where the letters have been jumbled in a certain way. This paper examines this problem by associating a distance measure with the jumbling process. Modifications to text were generated according to the Damerau-Levenshtein distance and it was checked if the users are able to... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 1,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0776 | Multiplicative Drift Analysis | [
"cs.NE"
] | In this work, we introduce multiplicative drift analysis as a suitable way to analyze the runtime of randomized search heuristics such as evolutionary algorithms. We give a multiplicative version of the classical drift theorem. This allows easier analyses in those settings where the optimization progress is roughly p... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 1,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0788 | Valued Ties Tell Fewer Lies: Why Not To Dichotomize Network Edges With
Thresholds | [
"stat.AP",
"cs.SI",
"physics.soc-ph"
] | In order to conduct analyses of networked systems where connections between individuals take on a range of values - counts, continuous strengths or ordinal rankings - a common technique is to dichotomize the data according to their positions with respect to a threshold value. However, there are two issues to consider: ... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 1,
"cs.SY": 0
} |
1101.0820 | Emotionally Colorful Reflexive Games | [
"cs.MA"
] | This study addresses the matter of reflexive control of the emotional states by means of Reflexive Game Theory (RGT). It is shown how to build a bridge between RGT and emotions. For this purpose the Pleasure-Arousal-Dominance (PAD) model is adopted. The major advantages of RGT are its ability to predict human behavior ... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 1,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0833 | Dynamical systems, simulation, abstract computation | [
"math.DS",
"cs.CE",
"nlin.CD"
] | We survey an area of recent development, relating dynamics to theoretical computer science. We discuss the theoretical limits of simulation and computation of interesting quantities in dynamical systems. We will focus on central objects of the theory of dynamics, as invariant measures and invariant sets, showing that e... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 1,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0854 | Improved Achievable Rates for Regularized Tomlinson-Harashima Precoding
in Multiuser MIMO Downlink | [
"cs.IT",
"math.IT"
] | Tomlinson-Harashima precoding (THP) is considered as a prominent precoding scheme due to its capability to efficiently cancel out the known interference at the transmitter side. Therefore, the information rates achieved by THP are superior to those achieved by conventional linear precoding schemes. In this paper, a new... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0855 | Lattice Reduction Aided Precoding for Multiuser MIMO using Seysen's
Algorithm | [
"cs.IT",
"math.IT"
] | Lenstra-Lenstra-Lovasz (LLL) algorithm, which is one of the lattice reduction (LR) techniques, has been extensively used to obtain better basis of the channel matrix. In this paper, we jointly apply Seysen's lattice reduction algorithm (SA), instead of LLL, with the conventional linear precoding algorithms. Since SA ob... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0906 | Energy Efficiency and Reliability in Wireless Biomedical Implant Systems | [
"cs.IT",
"math.IT"
] | The use of wireless implant technology requires correct delivery of the vital physiological signs of the patient along with the energy management in power-constrained devices. Toward these goals, we present an augmentation protocol for the physical layer of the Medical Implant Communications Service (MICS) with focus o... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.0970 | Asymmetric Quantizers Are Better at Low SNR | [
"cs.IT",
"math.IT"
] | We study the behavior of channel capacity when a one-bit quantizer is employed at the output of the discrete-time average-power-limited Gaussian channel. We focus on the low signal-to-noise ratio regime, where communication at very low spectral efficiencies takes place, as in Spread-Spectrum and Ultra-Wideband communic... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1001 | Extreme Eigenvalue Distributions of Some Complex Correlated Non-Central
Wishart and Gamma-Wishart Random Matrices | [
"math.ST",
"cs.IT",
"math.IT",
"stat.TH"
] | Let $\mathbf{W}$ be a correlated complex non-central Wishart matrix defined through $\mathbf{W}=\mathbf{X}^H\mathbf{X}$, where $\mathbf{X}$ is $n\times m \, (n\geq m)$ complex Gaussian with non-zero mean $\boldsymbol{\Upsilon}$ and non-trivial covariance $\boldsymbol{\Sigma}$. We derive exact expressions for the cumula... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1042 | The Accelerating Growth of Online Tagging Systems | [
"cs.IR",
"cs.SI",
"physics.soc-ph"
] | Research on the growth of online tagging systems not only is interesting in its own right, but also yields insights for website management and semantic web analysis. Traditional models that describing the growth of online systems can be divided between linear and nonlinear versions. Linear models, including the BA mode... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 1,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 1,
"cs.SY": 0
} |
1101.1043 | Global Stability Analysis of Fluid Flows using Sum-of-Squares | [
"math.OC",
"cs.SY",
"math.AP",
"math.DS"
] | This paper introduces a new method for proving global stability of fluid flows through the construction of Lyapunov functionals. For finite dimensional approximations of fluid systems, we show how one can exploit recently developed optimization methods based on sum-of-squares decomposition to construct a polynomial Lya... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 1
} |
1101.1045 | Beating the Gilbert-Varshamov Bound for Online Channels | [
"cs.IT",
"math.IT"
] | In the online channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword x =(x_1,...,x_n) in {0,1}^n bit by bit via a channel limited to at most pn corruptions. The channel is online in the sense that at the ith step the channel decides whether to flip the ith bit or not and... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1057 | Sparsity regret bounds for individual sequences in online linear
regression | [
"stat.ML",
"cs.LG",
"math.ST",
"stat.TH"
] | We consider the problem of online linear regression on arbitrary deterministic sequences when the ambient dimension d can be much larger than the number of time rounds T. We introduce the notion of sparsity regret bound, which is a deterministic online counterpart of recent risk bounds derived in the stochastic setting... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 1,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1070 | From joint convexity of quantum relative entropy to a concavity theorem
of Lieb | [
"cs.IT",
"math.IT"
] | This note provides a succinct proof of a 1973 theorem of Lieb that establishes the concavity of a certain trace function. The development relies on a deep result from quantum information theory, the joint convexity of quantum relative entropy, as well as a recent argument due to Carlen and Lieb. | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1110 | Provenance for Aggregate Queries | [
"cs.DB"
] | We study in this paper provenance information for queries with aggregation. Provenance information was studied in the context of various query languages that do not allow for aggregation, and recent work has suggested to capture provenance by annotating the different database tuples with elements of a commutative semir... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 1,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1118 | Towards Decentralized Trading: A Topological Investigation of the Dutch
Medium and Low Voltage Grids | [
"cs.CE",
"cs.DM",
"cs.SI",
"physics.soc-ph"
] | The traditional Power Grid has been designed in a hierarchical fashion, with Energy pushed from the large scale production facilities towards the end users. But with the increasing availability of micro and medium scale generating facilities, the situation is changing. Many end users can now produce energy and share it... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 1,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 1,
"cs.SY": 0
} |
1101.1146 | Opinion dynamics of random-walking agents on a lattice | [
"physics.soc-ph",
"cs.SI"
] | Opinion dynamics of random-walking agents on finite two-dimensional lattices is studied. In the model, the opinion is continuous, and both the lattice and the opinion can be either periodic or non-periodic. At each time step, all agents move randomly on the lattice, and update their opinions based on those of neighbors... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 1,
"cs.SY": 0
} |
1101.1165 | Critical behavior of the contact process in a multiscale network | [
"physics.soc-ph",
"cond-mat.stat-mech",
"cs.SI",
"q-bio.PE"
] | Inspired by dengue and yellow fever epidemics, we investigated the contact process (CP) in a multiscale network constituted by one-dimensional chains connected through a Barab\'asi-Albert scale-free network. In addition to the CP dynamics inside the chains, the exchange of individuals between connected chains (travels)... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 1,
"cs.SY": 0
} |
1101.1232 | Levenshtein Distance Technique in Dictionary Lookup Methods: An Improved
Approach | [
"cs.IT",
"math.IT"
] | Dictionary lookup methods are popular in dealing with ambiguous letters which were not recognized by Optical Character Readers. However, a robust dictionary lookup method can be complex as apriori probability calculation or a large dictionary size increases the overhead and the cost of searching. In this context, Leven... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1252 | Scientific data searching, sharing and retrieval | [
"cs.IT",
"math.IT"
] | In the recent years, there has been significant advancement in the areas of scientific data management and retrieval techniques, especially in terms of standards and protocols for archiving data. Oak Ridge National Laboratory Distributed Data Archive Center for biogeochemical dynamics is making efforts in building adva... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1266 | Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem | [
"cs.DS",
"cs.CV"
] | This contribution extends the Bron Kerbosch algorithm for solving the maximum weight clique problem, where continuous-valued weights are assigned to both, vertices and edges. We applied the proposed algorithm to graph matching problems. | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 1,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1310 | Bounds on the Capacity of Random Insertion and Deletion-Additive Noise
Channels | [
"cs.IT",
"math.IT"
] | We develop several analytical lower bounds on the capacity of binary insertion and deletion channels by considering independent uniformly distributed (i.u.d.) inputs and computing lower bounds on the mutual information between the input and output sequences. For the deletion channel, we consider two different models: i... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1325 | Heat-to-work conversion by exploiting full or partial correlations of
quantum particles | [
"quant-ph",
"cs.IT",
"math.IT"
] | It is shown how information contained in the pairwise correlations (in general, partial) between atoms of a gas can be used to completely convert heat taken from a thermostat into mechanical work in a process of relaxation of the system to its thermal equilibrium state. Both classical correlations and quantum correlati... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1345 | Linear Precoding for Relay Networks with Finite-Alphabet Constraints | [
"cs.IT",
"math.IT"
] | In this paper, we investigate the optimal precoding scheme for relay networks with finite-alphabet constraints. We show that the previous work utilizing various design criteria to maximize either the diversity order or the transmission rate with the Gaussian-input assumption may lead to significant loss for a practical... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1350 | Time-Out Lattice Sequential Decoding for the MIMO ARQ Channel | [
"cs.IT",
"math.IT"
] | The optimal diversity-multiplexing-delay tradeoff for the multi-input multi-output (MIMO) automatic repeat request (ARQ) channel can be achieved using incremental redundancy lattice space-time codes coupled with a list decoder for joint error detection and correction. Such a decoder is based on the minimum mean-square ... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1477 | Asynchronous Code-Division Random Access Using Convex Optimization | [
"cs.IT",
"math.IT"
] | Many applications in cellular systems and sensor networks involve a random subset of a large number of users asynchronously reporting activity to a base station. This paper examines the problem of multiuser detection (MUD) in random access channels for such applications. Traditional orthogonal signaling ignores the ran... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1515 | On the Achievable Rates of the Diamond Relay Channel with Conferencing
Links | [
"cs.IT",
"math.IT"
] | We consider a half-duplex diamond relay channel, which consists of one source-destination pair and two relay nodes connected with two-way rate-limited out-of-band conferencing links. Three basic schemes and their achievable rates are studied: For the decode-and-forward (DF) scheme, we obtain the achievable rate by lett... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1550 | Structured optical receivers to attain superadditive capacity and the
Holevo limit | [
"quant-ph",
"cs.IT",
"math.IT"
] | When classical information is sent over a quantum channel, attaining the ultimate limit to channel capacity requires the receiver to make joint measurements over long codeword blocks. For a pure-state channel, we construct a receiver that can attain the ultimate capacity by applying a single-shot unitary transformation... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1577 | Sharp Support Recovery from Noisy Random Measurements by L1 minimization | [
"cs.IT",
"math.IT",
"math.NA"
] | In this paper, we investigate the theoretical guarantees of penalized $\lun$ minimization (also called Basis Pursuit Denoising or Lasso) in terms of sparsity pattern recovery (support and sign consistency) from noisy measurements with non-necessarily random noise, when the sensing operator belongs to the Gaussian ensem... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1602 | Application of Freeman Chain Codes: An Alternative Recognition Technique
for Malaysian Car Plates | [
"cs.CV"
] | Various applications of car plate recognition systems have been developed using various kinds of methods and techniques by researchers all over the world. The applications developed were only suitable for specific country due to its standard specification endorsed by the transport department of particular countries. Th... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 1,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1637 | A Science Model Driven Retrieval Prototype | [
"cs.IR",
"cs.DL"
] | This paper is about a better understanding on the structure and dynamics of science and the usage of these insights for compensating the typical problems that arises in metadata-driven Digital Libraries. Three science model driven retrieval services are presented: co-word analysis based query expansion, re-ranking via ... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 1,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1638 | Universality of competitive networks for weighted networks | [
"physics.soc-ph",
"cs.SI"
] | In this paper, we propose a new model that allows us to investigate this competitive aspect of real networks in quantitative terms. Through theoretical analysis and numerical simulations, we find that the competitive network have the universality for a weighted network. The relation between parameters in the weighted n... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 1,
"cs.SY": 0
} |
1101.1639 | Applying Science Models for Search | [
"cs.IR",
"cs.DL"
] | The paper proposes three different kinds of science models as value-added services that are integrated in the retrieval process to enhance retrieval quality. The paper discusses the approaches Search Term Recommendation, Bradfordizing and Author Centrality on a general level and addresses implementation issues of the m... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 1,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1643 | Multi-Relay Selection Design and Analysis for Multi-Stream Cooperative
Communications | [
"cs.IT",
"math.IT"
] | In this paper, we consider the problem of multi-relay selection for multi-stream cooperative MIMO systems with $M$ relay nodes. Traditionally, relay selection approaches are primarily focused on selecting one relay node to improve the transmission reliability given a single-antenna destination node. As such, in the coo... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1688 | Secret Writing on Dirty Paper: A Deterministic View | [
"cs.IT",
"math.IT"
] | Recently there has been a lot of success in using the deterministic approach to provide approximate characterization of Gaussian network capacity. In this paper, we take a deterministic view and revisit the problem of wiretap channel with side information. A precise characterization of the secrecy capacity is obtained ... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1703 | Detecting Important Nodes to Community Structure Using the Spectrum of
the Graph | [
"physics.soc-ph",
"cs.SI"
] | Many complex systems can be represented as networks, and how a network breaks up into subnetworks or communities is of wide interest. However, the development of a method to detect nodes important to communities that is both fast and accurate is a very challenging and open problem. In this manuscript, we introduce a ne... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 1,
"cs.SY": 0
} |
1101.1712 | Network Capacity Region and Minimum Energy Function for a Delay-Tolerant
Mobile Ad Hoc Network | [
"cs.NI",
"cs.IT",
"math.IT"
] | We investigate two quantities of interest in a delay-tolerant mobile ad hoc network: the network capacity region and the minimum energy function. The network capacity region is defined as the set of all input rates that the network can stably support considering all possible scheduling and routing algorithms. Given any... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1715 | Finding Consensus Bayesian Network Structures | [
"stat.ML",
"cs.AI",
"math.ST",
"stat.TH"
] | Suppose that multiple experts (or learning algorithms) provide us with alternative Bayesian network (BN) structures over a domain, and that we are interested in combining them into a single consensus BN structure. Specifically, we are interested in that the consensus BN structure only represents independences all the g... | {
"Other": 0,
"cs.AI": 1,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1740 | Optimal stopping for the predictive maintenance of a structure subject
to corrosion | [
"math.PR",
"cs.SY",
"math.OC"
] | We present a numerical method to compute the optimal maintenance time for a complex dynamic system applied to an example of maintenance of a metallic structure subject to corrosion. An arbitrarily early intervention may be uselessly costly, but a late one may lead to a partial/complete failure of the system, which has ... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 1
} |
1101.1798 | On Krawtchouk polynomials | [
"math.CA",
"cs.IT",
"math.IT"
] | Krawtchouk polynomials play an important role in coding theory and are also useful in graph theory and number theory. Although the basic properties of these polynomials are to some extent known, there is, to my knowledge, no detailed development available. My aim in writing this article is to fill in this gap. | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1803 | Information sets from defining sets in abelian codes | [
"cs.IT",
"math.IT"
] | We describe a technique to construct a set of check positions (and hence an information set) for every abelian code solely in terms of its defining set. This generalizes that given by Imai in \cite{Imai} in the case of binary TDC codes. | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1895 | Constructive spherical codes near the Shannon bound | [
"cs.IT",
"math.IT"
] | Shannon gave a lower bound in 1959 on the binary rate of spherical codes of given minimum Euclidean distance $\rho$. Using nonconstructive codes over a finite alphabet, we give a lower bound that is weaker but very close for small values of $\rho$. The construction is based on the Yaglom map combined with some finite s... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1915 | A Novel Approach to the Statistical Modeling of Wireline Channels | [
"cs.IT",
"math.IT"
] | We report here that channel power gain and Root-Mean-Square Delay Spread (RMS-DS) in Low/Medium Voltage power line channels are negatively correlated lognormal random variables. Further analysis of other wireline channels allows us to report a strong similarity between some properties observed in power line channels an... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1920 | Superposition Coding-Based Bounds and Capacity for the Cognitive
Z-Interference Channels | [
"cs.IT",
"math.IT"
] | This paper considers the cognitive interference channel (CIC) with two transmitters and two receivers, in which the cognitive transmitter non-causally knows the message and codeword of the primary transmitter. We first introduce a discrete memoryless more capable CIC, which is an extension to the more capable broadcast... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.1934 | Bit-wise Unequal Error Protection for Variable Length Block Codes with
Feedback | [
"cs.IT",
"math.IT"
] | The bit-wise unequal error protection problem, for the case when the number of groups of bits $\ell$ is fixed, is considered for variable length block codes with feedback. An encoding scheme based on fixed length block codes with erasures is used to establish inner bounds to the achievable performance for finite expect... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.2002 | Cooperative Tasking for Deterministic Specification Automata | [
"cs.SY",
"cs.MA"
] | In our previous work [1], a divide-and-conquer approach was proposed for cooperative tasking among multi-agent systems. The basic idea is to decompose a requested global specification into subtasks for individual agents such that the fulfillment of these subtasks by each individual agent leads to the satisfaction of th... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 1,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 1
} |
1101.2003 | Fault-tolerant Cooperative Tasking for Multi-agent Systems | [
"cs.SY",
"cs.MA",
"math.OC"
] | A natural way for cooperative tasking in multi-agent systems is through a top-down design by decomposing a global task into sub-tasks for each individual agent such that the accomplishments of these sub-tasks will guarantee the achievement of the global task. In our previous works [1], [2] we presented necessary and su... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 1,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 1
} |
1101.2007 | New Results on Multiple-Input Multiple-Output Broadcast Channels with
Confidential Messages | [
"cs.IT",
"cs.CR",
"math.IT"
] | This paper presents two new results on multiple-input multiple-output (MIMO) Gaussian broadcast channels with confidential messages. First, the problem of the MIMO Gaussian wiretap channel is revisited. A matrix characterization of the capacity-equivocation region is provided, which extends the previous result on the s... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 1,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.2057 | Percolation in networks composed of connectivity and dependency links | [
"cond-mat.stat-mech",
"cs.SI",
"physics.soc-ph"
] | Networks composed from both connectivity and dependency links were found to be more vulnerable compared to classical networks with only connectivity links. Their percolation transition is usually of a first order compared to the second order transition found in classical networks. We analytically analyze the effect of ... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 1,
"cs.SY": 0
} |
1101.2135 | Bounded confidence model: addressed information maintain diversity of
opinions | [
"physics.soc-ph",
"cs.SI"
] | A community of agents is subject to a stream of messages, which are represented as points on a plane of issues. Messages are sent by media and by agents themselves. Messages from media shape the public opinion. They are unbiased, i.e. positive and negative opinions on a given issue appear with equal frequencies. In our... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 1,
"cs.SY": 0
} |
1101.2182 | The Degrees of Freedom of Compute-and-Forward | [
"cs.IT",
"math.IT"
] | We analyze the asymptotic behavior of compute-and-forward relay networks in the regime of high signal-to-noise ratios. We consider a section of such a network consisting of K transmitters and K relays. The aim of the relays is to reliably decode an invertible function of the messages sent by the transmitters. An upper ... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.2190 | Scaled Bregman divergences in a Tsallis scenario | [
"cond-mat.stat-mech",
"cs.IT",
"math-ph",
"math.IT",
"math.MP"
] | There exist two different versions of the Kullback-Leibler divergence (K-Ld) in Tsallis statistics, namely the usual generalized K-Ld and the generalized Bregman K-Ld. Problems have been encountered in trying to reconcile them. A condition for consistency between these two generalized K-Ld-forms by recourse to the addi... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.2192 | Power Allocation Games in Interference Relay Channels: Existence
Analysis of Nash Equilibria | [
"cs.IT",
"math.IT"
] | We consider a network composed of two interfering point-to-point links where the two transmitters can exploit one common relay node to improve their individual transmission rate. Communications are assumed to be multi-band and transmitters are assumed to selfishly allocate their resources to optimize their individual t... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.2220 | Stability Analysis of Transportation Networks with Multiscale Driver
Decisions | [
"math.DS",
"cs.GT",
"cs.SY",
"math.OC",
"nlin.AO"
] | Stability of Wardrop equilibria is analyzed for dynamical transportation networks in which the drivers' route choices are influenced by information at multiple temporal and spatial scales. The considered model involves a continuum of indistinguishable drivers commuting between a common origin/destination pair in an acy... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 1
} |
1101.2228 | Valued Ties Tell Fewer Lies, II: Why Not To Dichotomize Network Edges
With Bounded Outdegrees | [
"stat.AP",
"cs.SI",
"physics.soc-ph"
] | Various methods have been proposed for creating a binary version of a complex network with valued ties. Rather than the default method of choosing a single threshold value about which to dichotomize, we consider a method of choosing the highest k outbound arcs from each person and assigning a binary tie, as this has th... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 1,
"cs.SY": 0
} |
1101.2229 | Why aren't the small worlds of protein contact networks smaller | [
"q-bio.MN",
"cs.SI",
"physics.bio-ph",
"physics.soc-ph",
"q-bio.BM"
] | Computer experiments are performed to investigate why protein contact networks (networks induced by spatial contacts between amino acid residues of a protein) do not have shorter average shortest path lengths in spite of their importance to protein folding. We find that shorter average inter-nodal distances is no guara... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 1,
"cs.SY": 0
} |
1101.2242 | Modelling to study its non-linear effects on Communication System's
performance with BER as performance measure | [
"cs.IT",
"math.IT"
] | This paper is a study of non-linear effects of RF Amplifiers on Communication Systems Performance. High speed data communication is made possible by Multilevel Modulation schemes. This paper presents a study of these non linear effects on multilevel Modulation schemes like MPSK and MQAM. We make use of Bit Error Ratio ... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.2243 | Illustrating Color Evolution and Color Blindness by the Decoding Model
of Color Vision | [
"cs.CV"
] | A symmetrical model of color vision, the decoding model as a new version of zone model, was introduced. The model adopts new continuous-valued logic and works in a way very similar to the way a 3-8 decoder in a numerical circuit works. By the decoding model, Young and Helmholtz's tri-pigment theory and Hering's opponen... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 1,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.2245 | Invertible Bloom Lookup Tables | [
"cs.DS",
"cs.DB"
] | We present a version of the Bloom filter data structure that supports not only the insertion, deletion, and lookup of key-value pairs, but also allows a complete listing of its contents with high probability, as long the number of key-value pairs is below a designed threshold. Our structure allows the number of key-val... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 1,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.2249 | Fixed-complexity Sphere Encoder for Multi-user MIMO Systems | [
"cs.IT",
"math.IT"
] | In this paper, we propose a fixed-complexity sphere encoder (FSE) for multi-user MIMO (MU-MIMO) systems. The proposed FSE accomplishes a scalable tradeoff between performance and complexity. Also, because it has a parallel tree-search structure, the proposed encoder can be easily pipelined, leading to a tremendous redu... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.2268 | Casting Robotic End-effectors To Reach Faraway Moving Objects | [
"cs.RO"
] | In this article we address the problem of catching objects that move at a relatively large distance from the robot, of the order of tens of times the size of the robot itself. To this purpose, we adopt casting manipulation and visual-based feedback control. Casting manipulation is a technique to deploy a robotic end-ef... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 1,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.2270 | Distributed Collision-free Protocol for AGVs in Industrial Environments | [
"cs.RO"
] | In this paper, we propose a decentralized coordina- tion algorithm for safe and efficient management of a group of mobile robots following predefined paths in a dynamic industrial environment. The proposed algorithm is based on a shared resources protocol and a replanning strategy. It is proved to guarantee ordered tra... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 1,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.2272 | Logical Consensus for Distributed and Robust Intrusion Detection | [
"cs.RO"
] | In this paper we introduce a novel consensus mech- anism where agents of a network are able to share logical values, or Booleans, representing their local opinions on e.g. the presence of an intruder or of a fire within an indoor environment. We first formulate the logical consensus problem, and then we review relevant... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 1,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.2273 | Distributed Intrusion Detection for the Security of Societies of Robots | [
"cs.RO"
] | This paper addresses the problem of detecting possible intruders in a group of autonomous robots, which coexist in a shared environment and interact with each other according to a set of "social behaviors", or common rules. Such rules specify what actions each robot is allowed to perform in the pursuit of its individua... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 1,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.2275 | Distributed Consensus on Set-valued Information | [
"cs.RO"
] | This paper focuses on the convergence of infor- mation in distributed systems of agents communicating over a network. The information on which the convergence is sought is not represented by real numbers, rather by sets of real numbers, whose possible dynamics are given by the class of so-called Boolean maps, involving... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 1,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.2279 | Planning with Partial Preference Models | [
"cs.AI"
] | Current work in planning with preferences assume that the user's preference models are completely specified and aim to search for a single solution plan. In many real-world planning scenarios, however, the user probably cannot provide any information about her desired plans, or in some cases can only express partial pr... | {
"Other": 0,
"cs.AI": 1,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.2286 | Group Invariant Scattering | [
"math.FA",
"cs.CV"
] | This paper constructs translation invariant operators on L2(R^d), which are Lipschitz continuous to the action of diffeomorphisms. A scattering propagator is a path ordered product of non-linear and non-commuting operators, each of which computes the modulus of a wavelet transform. A local integration defines a windowe... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 1,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.2288 | On the Degree of Freedom for Multi-Source Multi-Destination Wireless
Network with Multi-layer Relays | [
"cs.IT",
"math.IT"
] | Degree of freedom (DoF) region provides an approximation of capacity region in high signal-to-noise ratio (SNR) regime, while sum DoF gives the scaling factor. In this correspondence, we analyse the DoF region and sum DoF for unicast layered multi-hop relay wireless networks with arbitrary number of source/destination/... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.2301 | A Factorial Experiment on Scalability of Search Based Software Testing | [
"cs.SE",
"cs.AI"
] | Software testing is an expensive process, which is vital in the industry. Construction of the test-data in software testing requires the major cost and to decide which method to use in order to generate the test data is important. This paper discusses the efficiency of search-based algorithms (preferably genetic algori... | {
"Other": 1,
"cs.AI": 1,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.2312 | Automatic segmentation of HeLa cell images | [
"cs.CV"
] | In this work, the possibilities for segmentation of cells from their background and each other in digital image were tested, combined and improoved. Lot of images with young, adult and mixture cells were able to prove the quality of described algorithms. Proper segmentation is one of the main task of image analysis and... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 1,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.2317 | A Generalized MMSE Detection with Reduced Complexity for Spatially
Multiplexed MIMO Signals | [
"cs.IT",
"math.IT"
] | In multiple-input multiple-output (MIMO) spatially multiplexing (SM) systems, achievable error rate performance is determined by signal detection strategy. The optimal maximum-likelihood detection (MLD) that exhaustively examines all symbol candidates has exponential complexity and may not be applicable in many practic... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.2320 | Review and Evaluation of Feature Selection Algorithms in Synthetic
Problems | [
"cs.AI",
"cs.LG"
] | The main purpose of Feature Subset Selection is to find a reduced subset of attributes from a data set described by a feature set. The task of a feature selection algorithm (FSA) is to provide with a computational solution motivated by a certain definition of relevance or by a reliable evaluation measure. In this paper... | {
"Other": 0,
"cs.AI": 1,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 1,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.2378 | Extracting Features from Ratings: The Role of Factor Models | [
"cs.AI"
] | Performing effective preference-based data retrieval requires detailed and preferentially meaningful structurized information about the current user as well as the items under consideration. A common problem is that representations of items often only consist of mere technical attributes, which do not resemble human pe... | {
"Other": 0,
"cs.AI": 1,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
1101.2389 | Capacity Region of Finite State Multiple-Access Channel with Delayed
State Information at the Transmitters | [
"cs.IT",
"math.IT"
] | A single-letter characterization is provided for the capacity region of finite-state multiple access channels. The channel state is a Markov process, the transmitters have access to delayed state information, and channel state information is available at the receiver. The delays of the channel state information are ass... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.