id stringlengths 9 9 | title stringlengths 4 240 | abstract stringlengths 25 3.66k | authors stringlengths 4 1.48k | categories stringlengths 5 100 | update_date stringdate 2007-05-23 00:00:00 2026-03-12 00:00:00 | text stringlengths 62 3.71k | primary_category stringclasses 136
values | year int32 2.01k 2.03k | abstract_length int64 25 3.66k | abstract_words int64 3 558 | title_length int64 4 240 |
|---|---|---|---|---|---|---|---|---|---|---|---|
0704.0002 | Sparsity-certifying Graph Decompositions | We describe a new algorithm, the $(k,\ell)$-pebble game with colors, and use it obtain a characterization of the family of $(k,\ell)$-sparse graphs and algorithmic solutions to a family of problems concerning tree decompositions of graphs. Special instances of sparse graphs appear in rigidity theory and have received i... | Ileana Streinu and Louis Theran | math.CO cs.CG | 2008-12-13 | Sparsity-certifying Graph Decompositions We describe a new algorithm, the $(k,\ell)$-pebble game with colors, and use it obtain a characterization of the family of $(k,\ell)$-sparse graphs and algorithmic solutions to a family of problems concerning tree decompositions of graphs. Special instances of sparse graphs appe... | math.CO | 2,008 | 795 | 115 | 40 |
0704.0046 | A limit relation for entropy and channel capacity per unit cost | In a quantum mechanical model, Diosi, Feldmann and Kosloff arrived at a conjecture stating that the limit of the entropy of certain mixtures is the relative entropy as system size goes to infinity. The conjecture is proven in this paper for density matrices. The first proof is analytic and uses the quantum law of large... | I. Csiszar, F. Hiai and D. Petz | quant-ph cs.IT math.IT | 2009-11-13 | A limit relation for entropy and channel capacity per unit cost In a quantum mechanical model, Diosi, Feldmann and Kosloff arrived at a conjecture stating that the limit of the entropy of certain mixtures is the relative entropy as system size goes to infinity. The conjecture is proven in this paper for density matrice... | quant-ph | 2,009 | 487 | 79 | 63 |
0704.0047 | Intelligent location of simultaneously active acoustic emission sources: Part I | The intelligent acoustic emission locator is described in Part I, while Part II discusses blind source separation, time delay estimation and location of two simultaneously active continuous acoustic emission sources. The location of acoustic emission on complicated aircraft frame structures is a difficult problem of no... | T. Kosel and I. Grabec | cs.NE cs.AI | 2009-09-29 | Intelligent location of simultaneously active acoustic emission sources: Part I The intelligent acoustic emission locator is described in Part I, while Part II discusses blind source separation, time delay estimation and location of two simultaneously active continuous acoustic emission sources. The location of acousti... | cs.NE | 2,009 | 1,170 | 169 | 79 |
0704.0050 | Intelligent location of simultaneously active acoustic emission sources: Part II | Part I describes an intelligent acoustic emission locator, while Part II discusses blind source separation, time delay estimation and location of two continuous acoustic emission sources. Acoustic emission (AE) analysis is used for characterization and location of developing defects in materials. AE sources often gener... | T. Kosel and I. Grabec | cs.NE cs.AI | 2007-05-23 | Intelligent location of simultaneously active acoustic emission sources: Part II Part I describes an intelligent acoustic emission locator, while Part II discusses blind source separation, time delay estimation and location of two continuous acoustic emission sources. Acoustic emission (AE) analysis is used for charact... | cs.NE | 2,007 | 948 | 136 | 80 |
0704.0062 | On-line Viterbi Algorithm and Its Relationship to Random Walks | In this paper, we introduce the on-line Viterbi algorithm for decoding hidden Markov models (HMMs) in much smaller than linear space. Our analysis on two-state HMMs suggests that the expected maximum memory used to decode sequence of length $n$ with $m$-state HMM can be as low as $\Theta(m\log n)$, without a significan... | Rastislav \v{S}r\'amek, Bro\v{n}a Brejov\'a, Tom\'a\v{s} Vina\v{r} | cs.DS | 2010-01-25 | On-line Viterbi Algorithm and Its Relationship to Random Walks In this paper, we introduce the on-line Viterbi algorithm for decoding hidden Markov models (HMMs) in much smaller than linear space. Our analysis on two-state HMMs suggests that the expected maximum memory used to decode sequence of length $n$ with $m$-sta... | cs.DS | 2,010 | 720 | 110 | 62 |
0704.0090 | Real Options for Project Schedules (ROPS) | Real Options for Project Schedules (ROPS) has three recursive sampling/optimization shells. An outer Adaptive Simulated Annealing (ASA) optimization shell optimizes parameters of strategic Plans containing multiple Projects containing ordered Tasks. A middle shell samples probability distributions of durations of Tasks... | Lester Ingber | cs.CE cond-mat.stat-mech cs.MS cs.NA physics.data-an | 2007-05-23 | Real Options for Project Schedules (ROPS) Real Options for Project Schedules (ROPS) has three recursive sampling/optimization shells. An outer Adaptive Simulated Annealing (ASA) optimization shell optimizes parameters of strategic Plans containing multiple Projects containing ordered Tasks. A middle shell samples proba... | cs.CE | 2,007 | 557 | 76 | 41 |
0704.0098 | Sparsely-spread CDMA - a statistical mechanics based analysis | Sparse Code Division Multiple Access (CDMA), a variation on the standard CDMA method in which the spreading (signature) matrix contains only a relatively small number of non-zero elements, is presented and analysed using methods of statistical physics. The analysis provides results on the performance of maximum likelih... | Jack Raymond, David Saad | cs.IT math.IT | 2009-11-13 | Sparsely-spread CDMA - a statistical mechanics based analysis Sparse Code Division Multiple Access (CDMA), a variation on the standard CDMA method in which the spreading (signature) matrix contains only a relatively small number of non-zero elements, is presented and analysed using methods of statistical physics. The a... | cs.IT | 2,009 | 592 | 88 | 61 |
0704.0108 | Reducing SAT to 2-SAT | Description of a polynomial time reduction of SAT to 2-SAT of polynomial size. | Sergey Gubin | cs.CC | 2007-05-23 | Reducing SAT to 2-SAT Description of a polynomial time reduction of SAT to 2-SAT of polynomial size. | cs.CC | 2,007 | 78 | 13 | 21 |
0704.0213 | Geometric Complexity Theory V: On deciding nonvanishing of a generalized Littlewood-Richardson coefficient | This article has been withdrawn because it has been merged with the earlier article GCT3 (arXiv: CS/0501076 [cs.CC]) in the series. The merged article is now available as: Geometric Complexity Theory III: on deciding nonvanishing of a Littlewood-Richardson Coefficient, Journal of Algebraic Combinatorics, vol. 36, issue... | Ketan D. Mulmuley Hariharan Narayanan | cs.CC | 2012-09-28 | Geometric Complexity Theory V: On deciding nonvanishing of a generalized Littlewood-Richardson coefficient This article has been withdrawn because it has been merged with the earlier article GCT3 (arXiv: CS/0501076 [cs.CC]) in the series. The merged article is now available as: Geometric Complexity Theory III: on decid... | cs.CC | 2,012 | 723 | 101 | 106 |
0704.0217 | Capacity of a Multiple-Antenna Fading Channel with a Quantized Precoding Matrix | Given a multiple-input multiple-output (MIMO) channel, feedback from the receiver can be used to specify a transmit precoding matrix, which selectively activates the strongest channel modes. Here we analyze the performance of Random Vector Quantization (RVQ), in which the precoding matrix is selected from a random code... | Wiroonsak Santipach and Michael L. Honig | cs.IT math.IT | 2010-08-27 | Capacity of a Multiple-Antenna Fading Channel with a Quantized Precoding Matrix Given a multiple-input multiple-output (MIMO) channel, feedback from the receiver can be used to specify a transmit precoding matrix, which selectively activates the strongest channel modes. Here we analyze the performance of Random Vector ... | cs.IT | 2,010 | 1,662 | 246 | 79 |
0704.0218 | On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases | In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm solving the problem is found. A result more or less supporting the conjecture o... | Yuri Pritykin | cs.DM cs.LO | 2007-05-23 | On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm s... | cs.DM | 2,007 | 367 | 56 | 77 |
0704.0229 | Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry | This article belongs to a series on geometric complexity theory (GCT), an approach to the P vs. NP and related problems through algebraic geometry and representation theory. The basic principle behind this approach is called the flip. In essence, it reduces the negative hypothesis in complexity theory (the lower bound ... | Ketan D. Mulmuley | cs.CC | 2009-01-22 | Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry This article belongs to a series on geometric complexity theory (GCT), an approach to the P vs. NP and related problems through algebraic geometry and representation theory. The basic ... | cs.CC | 2,009 | 1,804 | 262 | 135 |
0704.0282 | On Punctured Pragmatic Space-Time Codes in Block Fading Channel | This paper considers the use of punctured convolutional codes to obtain pragmatic space-time trellis codes over block-fading channel. We show that good performance can be achieved even when puncturation is adopted and that we can still employ the same Viterbi decoder of the convolutional mother code by using approximat... | Samuele Bandi, Luca Stabellini, Andrea Conti and Velio Tralli | cs.IT cs.CC math.IT | 2007-07-13 | On Punctured Pragmatic Space-Time Codes in Block Fading Channel This paper considers the use of punctured convolutional codes to obtain pragmatic space-time trellis codes over block-fading channel. We show that good performance can be achieved even when puncturation is adopted and that we can still employ the same Vite... | cs.IT | 2,007 | 392 | 58 | 63 |
0704.0301 | Differential Recursion and Differentially Algebraic Functions | Moore introduced a class of real-valued "recursive" functions by analogy with Kleene's formulation of the standard recursive functions. While his concise definition inspired a new line of research on analog computation, it contains some technical inaccuracies. Focusing on his "primitive recursive" functions, we pin dow... | Akitoshi Kawamura | cs.CC | 2009-04-19 | Differential Recursion and Differentially Algebraic Functions Moore introduced a class of real-valued "recursive" functions by analogy with Kleene's formulation of the standard recursive functions. While his concise definition inspired a new line of research on analog computation, it contains some technical inaccuracie... | cs.CC | 2,009 | 630 | 90 | 61 |
0704.0304 | The World as Evolving Information | This paper discusses the benefits of describing the world as information, especially in the study of the evolution of life and cognition. Traditional studies encounter problems because it is difficult to describe life and cognition in terms of matter and energy, since their laws are valid only at the physical scale. Ho... | Carlos Gershenson | cs.IT cs.AI math.IT q-bio.PE | 2013-04-05 | The World as Evolving Information This paper discusses the benefits of describing the world as information, especially in the study of the evolution of life and cognition. Traditional studies encounter problems because it is difficult to describe life and cognition in terms of matter and energy, since their laws are va... | cs.IT | 2,013 | 788 | 116 | 33 |
0704.0309 | The Complexity of HCP in Digraps with Degree Bound Two | The Hamiltonian cycle problem (HCP) in digraphs D with degree bound two is solved by two mappings in this paper. The first bijection is between an incidence matrix C_{nm} of simple digraph and an incidence matrix F of balanced bipartite undirected graph G; The second mapping is from a perfect matching of G to a cycle o... | Guohun Zhu | cs.CC cs.DM | 2011-11-09 | The Complexity of HCP in Digraps with Degree Bound Two The Hamiltonian cycle problem (HCP) in digraphs D with degree bound two is solved by two mappings in this paper. The first bijection is between an incidence matrix C_{nm} of simple digraph and an incidence matrix F of balanced bipartite undirected graph G; The seco... | cs.CC | 2,011 | 555 | 96 | 54 |
0704.0361 | Pseudo-random Puncturing: A Technique to Lower the Error Floor of Turbo Codes | It has been observed that particular rate-1/2 partially systematic parallel concatenated convolutional codes (PCCCs) can achieve a lower error floor than that of their rate-1/3 parent codes. Nevertheless, good puncturing patterns can only be identified by means of an exhaustive search, whilst convergence towards low bi... | Ioannis Chatzigeorgiou, Miguel R. D. Rodrigues, Ian J. Wassell and
Rolando Carrasco | cs.IT math.IT | 2016-11-18 | Pseudo-random Puncturing: A Technique to Lower the Error Floor of Turbo Codes It has been observed that particular rate-1/2 partially systematic parallel concatenated convolutional codes (PCCCs) can achieve a lower error floor than that of their rate-1/3 parent codes. Nevertheless, good puncturing patterns can only be ... | cs.IT | 2,016 | 1,079 | 159 | 77 |
0704.0468 | Inapproximability of Maximum Weighted Edge Biclique and Its Applications | Given a bipartite graph $G = (V_1,V_2,E)$ where edges take on {\it both} positive and negative weights from set $\mathcal{S}$, the {\it maximum weighted edge biclique} problem, or $\mathcal{S}$-MWEB for short, asks to find a bipartite subgraph whose sum of edge weights is maximized. This problem has various application... | Jinsong Tan | cs.CC cs.DS | 2009-03-23 | Inapproximability of Maximum Weighted Edge Biclique and Its Applications Given a bipartite graph $G = (V_1,V_2,E)$ where edges take on {\it both} positive and negative weights from set $\mathcal{S}$, the {\it maximum weighted edge biclique} problem, or $\mathcal{S}$-MWEB for short, asks to find a bipartite subgraph who... | cs.CC | 2,009 | 1,384 | 189 | 72 |
0704.0492 | Refuting the Pseudo Attack on the REESSE1+ Cryptosystem | We illustrate through example 1 and 2 that the condition at theorem 1 in [8] dissatisfies necessity, and the converse proposition of fact 1.1 in [8] does not hold, namely the condition Z/M - L/Ak < 1/(2 Ak^2) is not sufficient for f(i) + f(j) = f(k). Illuminate through an analysis and ex.3 that there is a logic error d... | Shenghui Su, and Shuwang Lu | cs.CR | 2010-02-04 | Refuting the Pseudo Attack on the REESSE1+ Cryptosystem We illustrate through example 1 and 2 that the condition at theorem 1 in [8] dissatisfies necessity, and the converse proposition of fact 1.1 in [8] does not hold, namely the condition Z/M - L/Ak < 1/(2 Ak^2) is not sufficient for f(i) + f(j) = f(k). Illuminate th... | cs.CR | 2,010 | 1,362 | 263 | 55 |
0704.0499 | Optimal Routing for Decode-and-Forward based Cooperation in Wireless Networks | We investigate cooperative wireless relay networks in which the nodes can help each other in data transmission. We study different coding strategies in the single-source single-destination network with many relay nodes. Given the myriad of ways in which nodes can cooperate, there is a natural routing problem, i.e., det... | Lawrence Ong and Mehul Motani | cs.IT math.IT | 2010-04-15 | Optimal Routing for Decode-and-Forward based Cooperation in Wireless Networks We investigate cooperative wireless relay networks in which the nodes can help each other in data transmission. We study different coding strategies in the single-source single-destination network with many relay nodes. Given the myriad of wa... | cs.IT | 2,010 | 1,179 | 176 | 77 |
0704.0528 | Many-to-One Throughput Capacity of IEEE 802.11 Multi-hop Wireless Networks | This paper investigates the many-to-one throughput capacity (and by symmetry, one-to-many throughput capacity) of IEEE 802.11 multi-hop networks. It has generally been assumed in prior studies that the many-to-one throughput capacity is upper-bounded by the link capacity L. Throughput capacity L is not achievable under... | Chi Pan Chan, Soung Chang Liew, An Chan | cs.NI cs.IT math.IT | 2007-07-13 | Many-to-One Throughput Capacity of IEEE 802.11 Multi-hop Wireless Networks This paper investigates the many-to-one throughput capacity (and by symmetry, one-to-many throughput capacity) of IEEE 802.11 multi-hop networks. It has generally been assumed in prior studies that the many-to-one throughput capacity is upper-bo... | cs.NI | 2,007 | 1,439 | 224 | 74 |
0704.0540 | On the Achievable Rate Regions for Interference Channels with Degraded Message Sets | The interference channel with degraded message sets (IC-DMS) refers to a communication model in which two senders attempt to communicate with their respective receivers simultaneously through a common medium, and one of the senders has complete and a priori (non-causal) knowledge about the message being transmitted by ... | Jinhua Jiang and Xin Yan | cs.IT math.IT | 2007-07-13 | On the Achievable Rate Regions for Interference Channels with Degraded Message Sets The interference channel with degraded message sets (IC-DMS) refers to a communication model in which two senders attempt to communicate with their respective receivers simultaneously through a common medium, and one of the senders has ... | cs.IT | 2,007 | 876 | 125 | 83 |
0704.0590 | A Low Complexity Algorithm and Architecture for Systematic Encoding of Hermitian Codes | We present an algorithm for systematic encoding of Hermitian codes. For a Hermitian code defined over GF(q^2), the proposed algorithm achieves a run time complexity of O(q^2) and is suitable for VLSI implementation. The encoder architecture uses as main blocks q varying-rate Reed-Solomon encoders and achieves a space c... | Rachit Agarwal, Ralf Koetter and Emanuel Popovici | cs.IT math.IT | 2016-11-17 | A Low Complexity Algorithm and Architecture for Systematic Encoding of Hermitian Codes We present an algorithm for systematic encoding of Hermitian codes. For a Hermitian code defined over GF(q^2), the proposed algorithm achieves a run time complexity of O(q^2) and is suitable for VLSI implementation. The encoder archi... | cs.IT | 2,016 | 397 | 60 | 86 |
0704.0671 | Learning from compressed observations | The problem of statistical learning is to construct a predictor of a random variable $Y$ as a function of a related random variable $X$ on the basis of an i.i.d. training sample from the joint distribution of $(X,Y)$. Allowable predictors are drawn from some specified class, and the goal is to approach asymptotically t... | Maxim Raginsky | cs.IT cs.LG math.IT | 2016-11-15 | Learning from compressed observations The problem of statistical learning is to construct a predictor of a random variable $Y$ as a function of a related random variable $X$ on the basis of an i.i.d. training sample from the joint distribution of $(X,Y)$. Allowable predictors are drawn from some specified class, and th... | cs.IT | 2,016 | 982 | 150 | 37 |
0704.0730 | Revisiting the Issues On Netflow Sample and Export Performance | The high volume of packets and packet rates of traffic on some router links makes it exceedingly difficult for routers to examine every packet in order to keep detailed statistics about the traffic which is traversing the router. Sampling is commonly applied on routers in order to limit the load incurred by the collect... | Hamed Haddadi, Raul Landa, Miguel Rio, Saleem Bhatti | cs.PF cs.NI | 2007-05-23 | Revisiting the Issues On Netflow Sample and Export Performance The high volume of packets and packet rates of traffic on some router links makes it exceedingly difficult for routers to examine every packet in order to keep detailed statistics about the traffic which is traversing the router. Sampling is commonly applie... | cs.PF | 2,007 | 1,330 | 217 | 62 |
0704.0788 | Optimal Synthesis of Multiple Algorithms | In this paper we give a definition of "algorithm," "finite algorithm," "equivalent algorithms," and what it means for a single algorithm to dominate a set of algorithms. We define a derived algorithm which may have a smaller mean execution time than any of its component algorithms. We give an explicit expression for th... | Kerry M. Soileau | cs.DS cs.PF | 2007-05-23 | Optimal Synthesis of Multiple Algorithms In this paper we give a definition of "algorithm," "finite algorithm," "equivalent algorithms," and what it means for a single algorithm to dominate a set of algorithms. We define a derived algorithm which may have a smaller mean execution time than any of its component algorith... | cs.DS | 2,007 | 805 | 125 | 40 |
0704.0802 | Hybrid-ARQ in Multihop Networks with Opportunistic Relay Selection | This paper develops a contention-based opportunistic feedback technique towards relay selection in a dense wireless network. This technique enables the forwarding of additional parity information from the selected relay to the destination. For a given network, the effects of varying key parameters such as the feedback ... | Caleb K. Lo, Robert W. Heath, Jr. and Sriram Vishwanath | cs.IT math.IT | 2012-08-27 | Hybrid-ARQ in Multihop Networks with Opportunistic Relay Selection This paper develops a contention-based opportunistic feedback technique towards relay selection in a dense wireless network. This technique enables the forwarding of additional parity information from the selected relay to the destination. For a given n... | cs.IT | 2,012 | 735 | 106 | 66 |
0704.0805 | Opportunistic Relay Selection with Limited Feedback | It has been shown that a decentralized relay selection protocol based on opportunistic feedback from the relays yields good throughput performance in dense wireless networks. This selection strategy supports a hybrid-ARQ transmission approach where relays forward parity information to the destination in the event of a ... | Caleb K. Lo, Robert W. Heath, Jr. and Sriram Vishwanath | cs.IT math.IT | 2016-11-17 | Opportunistic Relay Selection with Limited Feedback It has been shown that a decentralized relay selection protocol based on opportunistic feedback from the relays yields good throughput performance in dense wireless networks. This selection strategy supports a hybrid-ARQ transmission approach where relays forward pari... | cs.IT | 2,016 | 927 | 137 | 51 |
0704.0831 | On packet lengths and overhead for random linear coding over the erasure channel | We assess the practicality of random network coding by illuminating the issue of overhead and considering it in conjunction with increasingly long packets sent over the erasure channel. We show that the transmission of increasingly long packets, consisting of either of an increasing number of symbols per packet or an i... | Brooke Shrader and Anthony Ephremides | cs.IT math.IT | 2007-07-13 | On packet lengths and overhead for random linear coding over the erasure channel We assess the practicality of random network coding by illuminating the issue of overhead and considering it in conjunction with increasingly long packets sent over the erasure channel. We show that the transmission of increasingly long pa... | cs.IT | 2,007 | 726 | 112 | 80 |
0704.0834 | P-adic arithmetic coding | A new incremental algorithm for data compression is presented. For a sequence of input symbols algorithm incrementally constructs a p-adic integer number as an output. Decoding process starts with less significant part of a p-adic integer and incrementally reconstructs a sequence of input symbols. Algorithm is based on... | Anatoly Rodionov, Sergey Volkov | cs.DS | 2007-05-23 | P-adic arithmetic coding A new incremental algorithm for data compression is presented. For a sequence of input symbols algorithm incrementally constructs a p-adic integer number as an output. Decoding process starts with less significant part of a p-adic integer and incrementally reconstructs a sequence of input symbo... | cs.DS | 2,007 | 751 | 117 | 24 |
0704.0838 | Universal Source Coding for Monotonic and Fast Decaying Monotonic Distributions | We study universal compression of sequences generated by monotonic distributions. We show that for a monotonic distribution over an alphabet of size $k$, each probability parameter costs essentially $0.5 \log (n/k^3)$ bits, where $n$ is the coded sequence length, as long as $k = o(n^{1/3})$. Otherwise, for $k = O(n)$, ... | Gil I. Shamir | cs.IT math.IT | 2007-07-13 | Universal Source Coding for Monotonic and Fast Decaying Monotonic Distributions We study universal compression of sequences generated by monotonic distributions. We show that for a monotonic distribution over an alphabet of size $k$, each probability parameter costs essentially $0.5 \log (n/k^3)$ bits, where $n$ is the... | cs.IT | 2,007 | 1,482 | 207 | 79 |
0704.0858 | Lessons Learned from the deployment of a high-interaction honeypot | This paper presents an experimental study and the lessons learned from the observation of the attackers when logged on a compromised machine. The results are based on a six months period during which a controlled experiment has been run with a high interaction honeypot. We correlate our findings with those obtained wit... | Eric Alata (LAAS), Vincent Nicomette (LAAS), Mohamed Ka\^aniche
(LAAS), Marc Dacier (LAAS), Matthieu Herrb (LAAS) | cs.CR | 2016-08-14 | Lessons Learned from the deployment of a high-interaction honeypot This paper presents an experimental study and the lessons learned from the observation of the attackers when logged on a compromised machine. The results are based on a six months period during which a controlled experiment has been run with a high inte... | cs.CR | 2,016 | 381 | 59 | 66 |
0704.0860 | Availability assessment of SunOS/Solaris Unix Systems based on Syslogd and wtmpx logfiles : a case study | This paper presents a measurement-based availability assessment study using field data collected during a 4-year period from 373 SunOS/Solaris Unix workstations and servers interconnected through a local area network. We focus on the estimation of machine uptimes, downtimes and availability based on the identification ... | Cristina Simache (LAAS), Mohamed Kaaniche (LAAS) | cs.PF | 2007-05-23 | Availability assessment of SunOS/Solaris Unix Systems based on Syslogd and wtmpx logfiles : a case study This paper presents a measurement-based availability assessment study using field data collected during a 4-year period from 373 SunOS/Solaris Unix workstations and servers interconnected through a local area networ... | cs.PF | 2,007 | 1,083 | 166 | 104 |
0704.0861 | Empirical analysis and statistical modeling of attack processes based on honeypots | Honeypots are more and more used to collect data on malicious activities on the Internet and to better understand the strategies and techniques used by attackers to compromise target systems. Analysis and modeling methodologies are needed to support the characterization of attack processes based on the data collected f... | Mohamed Kaaniche (LAAS), Y. Deswarte (LAAS), Eric Alata (LAAS), Marc
Dacier (SC), Vincent Nicomette (LAAS) | cs.PF cs.CR | 2007-05-23 | Empirical analysis and statistical modeling of attack processes based on honeypots Honeypots are more and more used to collect data on malicious activities on the Internet and to better understand the strategies and techniques used by attackers to compromise target systems. Analysis and modeling methodologies are neede... | cs.PF | 2,007 | 562 | 82 | 82 |
0704.0865 | An architecture-based dependability modeling framework using AADL | For efficiency reasons, the software system designers' will is to use an integrated set of methods and tools to describe specifications and designs, and also to perform analyses such as dependability, schedulability and performance. AADL (Architecture Analysis and Design Language) has proved to be efficient for softwar... | Ana-Elena Rugina (LAAS), Karama Kanoun (LAAS), Mohamed Kaaniche (LAAS) | cs.PF cs.SE | 2007-05-23 | An architecture-based dependability modeling framework using AADL For efficiency reasons, the software system designers' will is to use an integrated set of methods and tools to describe specifications and designs, and also to perform analyses such as dependability, schedulability and performance. AADL (Architecture An... | cs.PF | 2,007 | 787 | 113 | 65 |
0704.0879 | A Hierarchical Approach for Dependability Analysis of a Commercial Cache-Based RAID Storage Architecture | We present a hierarchical simulation approach for the dependability analysis and evaluation of a highly available commercial cache-based RAID storage system. The archi-tecture is complex and includes several layers of overlap-ping error detection and recovery mechanisms. Three ab-straction levels have been developed to... | Mohamed Kaaniche (LAAS), Luigi Romano (UIUC), Zbigniew Kalbarczyk
(UIUC), Ravishankar Iyer (UIUC), Rick Karcich (STORAGETEK) | cs.PF | 2007-05-23 | A Hierarchical Approach for Dependability Analysis of a Commercial Cache-Based RAID Storage Architecture We present a hierarchical simulation approach for the dependability analysis and evaluation of a highly available commercial cache-based RAID storage system. The archi-tecture is complex and includes several layers ... | cs.PF | 2,007 | 1,557 | 228 | 104 |
0704.0954 | Sensor Networks with Random Links: Topology Design for Distributed Consensus | In a sensor network, in practice, the communication among sensors is subject to:(1) errors or failures at random times; (3) costs; and(2) constraints since sensors and networks operate under scarce resources, such as power, data rate, or communication. The signal-to-noise ratio (SNR) is usually a main factor in determi... | Soummya Kar and Jose M. F. Moura | cs.IT cs.LG math.IT | 2009-11-13 | Sensor Networks with Random Links: Topology Design for Distributed Consensus In a sensor network, in practice, the communication among sensors is subject to:(1) errors or failures at random times; (3) costs; and(2) constraints since sensors and networks operate under scarce resources, such as power, data rate, or commu... | cs.IT | 2,009 | 1,748 | 266 | 76 |
0704.0967 | Cross-Layer Optimization of MIMO-Based Mesh Networks with Gaussian Vector Broadcast Channels | MIMO technology is one of the most significant advances in the past decade to increase channel capacity and has a great potential to improve network capacity for mesh networks. In a MIMO-based mesh network, the links outgoing from each node sharing the common communication spectrum can be modeled as a Gaussian vector b... | Jia Liu and Y. Thomas Hou | cs.IT cs.AR math.IT | 2007-07-13 | Cross-Layer Optimization of MIMO-Based Mesh Networks with Gaussian Vector Broadcast Channels MIMO technology is one of the most significant advances in the past decade to increase channel capacity and has a great potential to improve network capacity for mesh networks. In a MIMO-based mesh network, the links outgoing f... | cs.IT | 2,007 | 1,351 | 203 | 92 |
0704.0985 | Architecture for Pseudo Acausal Evolvable Embedded Systems | Advances in semiconductor technology are contributing to the increasing complexity in the design of embedded systems. Architectures with novel techniques such as evolvable nature and autonomous behavior have engrossed lot of attention. This paper demonstrates conceptually evolvable embedded systems can be characterized... | Mohd Abubakr, R.M.Vinay | cs.NE cs.AI | 2007-05-23 | Architecture for Pseudo Acausal Evolvable Embedded Systems Advances in semiconductor technology are contributing to the increasing complexity in the design of embedded systems. Architectures with novel techniques such as evolvable nature and autonomous behavior have engrossed lot of attention. This paper demonstrates c... | cs.NE | 2,007 | 823 | 119 | 58 |
0704.1020 | The on-line shortest path problem under partial monitoring | The on-line shortest path problem is considered under various models of partial monitoring. Given a weighted directed acyclic graph whose edge weights can change in an arbitrary (adversarial) way, a decision maker has to choose in each round of a game a path between two distinguished vertices such that the loss of the ... | Andras Gyorgy, Tamas Linder, Gabor Lugosi, Gyorgy Ottucsak | cs.LG cs.SC | 2007-05-23 | The on-line shortest path problem under partial monitoring The on-line shortest path problem is considered under various models of partial monitoring. Given a weighted directed acyclic graph whose edge weights can change in an arbitrary (adversarial) way, a decision maker has to choose in each round of a game a path be... | cs.LG | 2,007 | 1,659 | 281 | 58 |
0704.1028 | A neural network approach to ordinal regression | Ordinal regression is an important type of learning, which has properties of both classification and regression. Here we describe a simple and effective approach to adapt a traditional neural network to learn ordinal categories. Our approach is a generalization of the perceptron method for ordinal regression. On severa... | Jianlin Cheng | cs.LG cs.AI cs.NE | 2007-05-23 | A neural network approach to ordinal regression Ordinal regression is an important type of learning, which has properties of both classification and regression. Here we describe a simple and effective approach to adapt a traditional neural network to learn ordinal categories. Our approach is a generalization of the per... | cs.LG | 2,007 | 940 | 129 | 47 |
0704.1043 | On the Kolmogorov-Chaitin Complexity for short sequences | A drawback of Kolmogorov-Chaitin complexity (K) as a function from s to the shortest program producing s is its noncomputability which limits its range of applicability. Moreover, when strings are short, the dependence of K on a particular universal Turing machine U can be arbitrary. In practice one can approximate it ... | Jean-Paul Delahaye and Hector Zenil | cs.CC cs.IT math.IT | 2010-12-20 | On the Kolmogorov-Chaitin Complexity for short sequences A drawback of Kolmogorov-Chaitin complexity (K) as a function from s to the shortest program producing s is its noncomputability which limits its range of applicability. Moreover, when strings are short, the dependence of K on a particular universal Turing machin... | cs.CC | 2,010 | 872 | 125 | 56 |
0704.1068 | Fast paths in large-scale dynamic road networks | Efficiently computing fast paths in large scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by several traffic information service providers who wish to offer a realistic fast path computation to GPS terminal enabled vehicles. The heuristic ... | Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo
Liberti | cs.NI cs.DS | 2007-06-27 | Fast paths in large-scale dynamic road networks Efficiently computing fast paths in large scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by several traffic information service providers who wish to offer a realistic fast path computation ... | cs.NI | 2,007 | 541 | 81 | 47 |
0704.1070 | Differential Diversity Reception of MDPSK over Independent Rayleigh Channels with Nonidentical Branch Statistics and Asymmetric Fading Spectrum | This paper is concerned with optimum diversity receiver structure and its performance analysis of differential phase shift keying (DPSK) with differential detection over nonselective, independent, nonidentically distributed, Rayleigh fading channels. The fading process in each branch is assumed to have an arbitrary Dop... | Hua Fu and Pooi Yuen Kam | cs.IT cs.PF math.IT | 2007-07-13 | Differential Diversity Reception of MDPSK over Independent Rayleigh Channels with Nonidentical Branch Statistics and Asymmetric Fading Spectrum This paper is concerned with optimum diversity receiver structure and its performance analysis of differential phase shift keying (DPSK) with differential detection over nonsel... | cs.IT | 2,007 | 795 | 113 | 143 |
0704.1158 | Novelty and Collective Attention | The subject of collective attention is central to an information age where millions of people are inundated with daily messages. It is thus of interest to understand how attention to novel items propagates and eventually fades among large populations. We have analyzed the dynamics of collective attention among one mill... | Fang Wu and Bernardo A. Huberman | cs.CY cs.IR physics.soc-ph | 2009-11-13 | Novelty and Collective Attention The subject of collective attention is central to an information age where millions of people are inundated with daily messages. It is thus of interest to understand how attention to novel items propagates and eventually fades among large populations. We have analyzed the dynamics of co... | cs.CY | 2,009 | 691 | 104 | 32 |
0704.1196 | Novel algorithm to calculate hypervolume indicator of Pareto approximation set | Hypervolume indicator is a commonly accepted quality measure for comparing Pareto approximation set generated by multi-objective optimizers. The best known algorithm to calculate it for $n$ points in $d$-dimensional space has a run time of $O(n^{d/2})$ with special data structures. This paper presents a recursive, vert... | Qing Yang and Shengchao Ding | cs.CG cs.NE | 2007-05-23 | Novel algorithm to calculate hypervolume indicator of Pareto approximation set Hypervolume indicator is a commonly accepted quality measure for comparing Pareto approximation set generated by multi-objective optimizers. The best known algorithm to calculate it for $n$ points in $d$-dimensional space has a run time of $... | cs.CG | 2,007 | 811 | 116 | 78 |
0704.1198 | A Doubly Distributed Genetic Algorithm for Network Coding | We present a genetic algorithm which is distributed in two novel ways: along genotype and temporal axes. Our algorithm first distributes, for every member of the population, a subset of the genotype to each network node, rather than a subset of the population to each. This genotype distribution is shown to offer a sign... | Minkyu Kim, Varun Aggarwal, Una-May O'Reilly, Muriel Medard | cs.NE cs.NI | 2007-05-23 | A Doubly Distributed Genetic Algorithm for Network Coding We present a genetic algorithm which is distributed in two novel ways: along genotype and temporal axes. Our algorithm first distributes, for every member of the population, a subset of the genotype to each network node, rather than a subset of the population to... | cs.NE | 2,007 | 791 | 122 | 57 |
0704.1267 | Text Line Segmentation of Historical Documents: a Survey | There is a huge amount of historical documents in libraries and in various National Archives that have not been exploited electronically. Although automatic reading of complete pages remains, in most cases, a long-term objective, tasks such as word spotting, text/image alignment, authentication and extraction of specif... | Laurence Likforman-Sulem, Abderrazak Zahour, Bruno Taconet | cs.CV | 2007-05-23 | Text Line Segmentation of Historical Documents: a Survey There is a huge amount of historical documents in libraries and in various National Archives that have not been exploited electronically. Although automatic reading of complete pages remains, in most cases, a long-term objective, tasks such as word spotting, text... | cs.CV | 2,007 | 772 | 116 | 56 |
0704.1269 | Phase Transitions in the Coloring of Random Graphs | We consider the problem of coloring the vertices of a large sparse random graph with a given number of colors so that no adjacent vertices have the same color. Using the cavity method, we present a detailed and systematic analytical study of the space of proper colorings (solutions). We show that for a fixed number of ... | Lenka Zdeborov\'a, Florent Krzakala | cond-mat.dis-nn cond-mat.stat-mech cs.CC | 2011-11-09 | Phase Transitions in the Coloring of Random Graphs We consider the problem of coloring the vertices of a large sparse random graph with a given number of colors so that no adjacent vertices have the same color. Using the cavity method, we present a detailed and systematic analytical study of the space of proper colorin... | cond-mat.dis-nn | 2,011 | 1,724 | 273 | 50 |
0704.1274 | Parametric Learning and Monte Carlo Optimization | This paper uncovers and explores the close relationship between Monte Carlo Optimization of a parametrized integral (MCO), Parametric machine-Learning (PL), and `blackbox' or `oracle'-based optimization (BO). We make four contributions. First, we prove that MCO is mathematically identical to a broad class of PL problem... | David H. Wolpert and Dev G. Rajnarayan | cs.LG | 2011-11-09 | Parametric Learning and Monte Carlo Optimization This paper uncovers and explores the close relationship between Monte Carlo Optimization of a parametrized integral (MCO), Parametric machine-Learning (PL), and `blackbox' or `oracle'-based optimization (BO). We make four contributions. First, we prove that MCO is mathem... | cs.LG | 2,011 | 1,340 | 197 | 48 |
0704.1294 | A Disciplined Approach to Adopting Agile Practices: The Agile Adoption Framework | Many organizations aspire to adopt agile processes to take advantage of the numerous benefits that it offers to an organization. Those benefits include, but are not limited to, quicker return on investment, better software quality, and higher customer satisfaction. To date however, there is no structured process (at le... | Ahmed Sidky, James Arthur, Shawn Bohner | cs.SE | 2007-05-23 | A Disciplined Approach to Adopting Agile Practices: The Agile Adoption Framework Many organizations aspire to adopt agile processes to take advantage of the numerous benefits that it offers to an organization. Those benefits include, but are not limited to, quicker return on investment, better software quality, and hig... | cs.SE | 2,007 | 964 | 147 | 80 |
0704.1308 | Antenna Combining for the MIMO Downlink Channel | A multiple antenna downlink channel where limited channel feedback is available to the transmitter is considered. In a vector downlink channel (single antenna at each receiver), the transmit antenna array can be used to transmit separate data streams to multiple receivers only if the transmitter has very accurate chann... | Nihar Jindal | cs.IT math.IT | 2016-11-17 | Antenna Combining for the MIMO Downlink Channel A multiple antenna downlink channel where limited channel feedback is available to the transmitter is considered. In a vector downlink channel (single antenna at each receiver), the transmit antenna array can be used to transmit separate data streams to multiple receivers... | cs.IT | 2,016 | 1,119 | 166 | 47 |
0704.1317 | Low Density Lattice Codes | Low density lattice codes (LDLC) are novel lattice codes that can be decoded efficiently and approach the capacity of the additive white Gaussian noise (AWGN) channel. In LDLC a codeword x is generated directly at the n-dimensional Euclidean space as a linear transformation of a corresponding integer message vector b, ... | Naftali Sommer, Meir Feder and Ofir Shalvi | cs.IT math.IT | 2007-07-13 | Low Density Lattice Codes Low density lattice codes (LDLC) are novel lattice codes that can be decoded efficiently and approach the capacity of the additive white Gaussian noise (AWGN) channel. In LDLC a codeword x is generated directly at the n-dimensional Euclidean space as a linear transformation of a corresponding ... | cs.IT | 2,007 | 695 | 110 | 25 |
0704.1353 | Supporting Knowledge and Expertise Finding within Australia's Defence Science and Technology Organisation | This paper reports on work aimed at supporting knowledge and expertise finding within a large Research and Development (R&D) organisation. The paper first discusses the nature of knowledge important to R&D organisations and presents a prototype information system developed to support knowledge and expertise finding. Th... | Paul Prekop | cs.OH cs.DB cs.DL cs.HC | 2007-05-23 | Supporting Knowledge and Expertise Finding within Australia's Defence Science and Technology Organisation This paper reports on work aimed at supporting knowledge and expertise finding within a large Research and Development (R&D) organisation. The paper first discusses the nature of knowledge important to R&D organisa... | cs.OH | 2,007 | 480 | 70 | 105 |
0704.1358 | Distance preserving mappings from ternary vectors to permutations | Distance-preserving mappings (DPMs) are mappings from the set of all q-ary vectors of a fixed length to the set of permutations of the same or longer length such that every two distinct vectors are mapped to permutations with the same or even larger Hamming distance than that of the vectors. In this paper, we propose a... | Jyh-Shyan Lin, Jen-Chun Chang, Rong-Jaye Chen, Torleiv Kl{\o}ve | cs.DM cs.IT math.IT | 2007-07-13 | Distance preserving mappings from ternary vectors to permutations Distance-preserving mappings (DPMs) are mappings from the set of all q-ary vectors of a fixed length to the set of permutations of the same or longer length such that every two distinct vectors are mapped to permutations with the same or even larger Hamm... | cs.DM | 2,007 | 452 | 76 | 65 |
0704.1373 | A Language-Based Approach for Improving the Robustness of Network Application Protocol Implementations | The secure and robust functioning of a network relies on the defect-free implementation of network applications. As network protocols have become increasingly complex, however, hand-writing network message processing code has become increasingly error-prone. In this paper, we present a domain-specific language, Zebu, f... | Burgy Laurent (INRIA Futurs), Laurent R\'eveill\`ere (INRIA Futurs),
Julia Lawall (DIKU), Gilles Muller (INRIA Rennes) | cs.PL | 2007-05-23 | A Language-Based Approach for Improving the Robustness of Network Application Protocol Implementations The secure and robust functioning of a network relies on the defect-free implementation of network applications. As network protocols have become increasingly complex, however, hand-writing network message processing ... | cs.PL | 2,007 | 1,066 | 154 | 102 |
0704.1394 | Calculating Valid Domains for BDD-Based Interactive Configuration | In these notes we formally describe the functionality of Calculating Valid Domains from the BDD representing the solution space of valid configurations. The formalization is largely based on the CLab configuration framework. | Tarik Hadzic, Rune Moller Jensen, Henrik Reif Andersen | cs.AI | 2007-05-23 | Calculating Valid Domains for BDD-Based Interactive Configuration In these notes we formally describe the functionality of Calculating Valid Domains from the BDD representing the solution space of valid configurations. The formalization is largely based on the CLab configuration framework. | cs.AI | 2,007 | 224 | 32 | 65 |
0704.1409 | Preconditioned Temporal Difference Learning | This paper has been withdrawn by the author. This draft is withdrawn for its poor quality in english, unfortunately produced by the author when he was just starting his science route. Look at the ICML version instead: http://icml2008.cs.helsinki.fi/papers/111.pdf | Yao HengShuai | cs.LG cs.AI | 2012-06-11 | Preconditioned Temporal Difference Learning This paper has been withdrawn by the author. This draft is withdrawn for its poor quality in english, unfortunately produced by the author when he was just starting his science route. Look at the ICML version instead: http://icml2008.cs.helsinki.fi/papers/111.pdf | cs.LG | 2,012 | 263 | 38 | 43 |
0704.1411 | Trellis-Coded Quantization Based on Maximum-Hamming-Distance Binary Codes | Most design approaches for trellis-coded quantization take advantage of the duality of trellis-coded quantization with trellis-coded modulation, and use the same empirically-found convolutional codes to label the trellis branches. This letter presents an alternative approach that instead takes advantage of maximum-Hamm... | Lorenzo Cappellari | cs.IT math.IT | 2007-12-20 | Trellis-Coded Quantization Based on Maximum-Hamming-Distance Binary Codes Most design approaches for trellis-coded quantization take advantage of the duality of trellis-coded quantization with trellis-coded modulation, and use the same empirically-found convolutional codes to label the trellis branches. This letter pre... | cs.IT | 2,007 | 478 | 63 | 73 |
0704.1455 | A Better Good-Turing Estimator for Sequence Probabilities | We consider the problem of estimating the probability of an observed string drawn i.i.d. from an unknown distribution. The key feature of our study is that the length of the observed string is assumed to be of the same order as the size of the underlying alphabet. In this setting, many letters are unseen and the empiri... | Aaron B. Wagner, Pramod Viswanath, and Sanjeev R. Kulkarni | cs.IT math.IT | 2007-07-13 | A Better Good-Turing Estimator for Sequence Probabilities We consider the problem of estimating the probability of an observed string drawn i.i.d. from an unknown distribution. The key feature of our study is that the length of the observed string is assumed to be of the same order as the size of the underlying alphabe... | cs.IT | 2,007 | 766 | 121 | 57 |
0704.1524 | GLRT-Optimal Noncoherent Lattice Decoding | This paper presents new low-complexity lattice-decoding algorithms for noncoherent block detection of QAM and PAM signals over complex-valued fading channels. The algorithms are optimal in terms of the generalized likelihood ratio test (GLRT). The computational complexity is polynomial in the block length; making GLRT-... | Daniel J. Ryan, Iain B. Collings and I. Vaughan L. Clarkson | cs.IT math.IT | 2009-11-13 | GLRT-Optimal Noncoherent Lattice Decoding This paper presents new low-complexity lattice-decoding algorithms for noncoherent block detection of QAM and PAM signals over complex-valued fading channels. The algorithms are optimal in terms of the generalized likelihood ratio test (GLRT). The computational complexity is po... | cs.IT | 2,009 | 741 | 98 | 41 |
0704.1571 | On restrictions of balanced 2-interval graphs | The class of 2-interval graphs has been introduced for modelling scheduling and allocation problems, and more recently for specific bioinformatic problems. Some of those applications imply restrictions on the 2-interval graphs, and justify the introduction of a hierarchy of subclasses of 2-interval graphs that generali... | Philippe Gambette (LIAFA), St\'ephane Vialette (LRI) | cs.DM q-bio.QM | 2008-02-04 | On restrictions of balanced 2-interval graphs The class of 2-interval graphs has been introduced for modelling scheduling and allocation problems, and more recently for specific bioinformatic problems. Some of those applications imply restrictions on the 2-interval graphs, and justify the introduction of a hierarchy of... | cs.DM | 2,008 | 796 | 109 | 45 |
0704.1675 | Exploiting Social Annotation for Automatic Resource Discovery | Information integration applications, such as mediators or mashups, that require access to information resources currently rely on users manually discovering and integrating them in the application. Manual resource discovery is a slow process, requiring the user to sift through results obtained via keyword-based search... | Anon Plangprasopchok and Kristina Lerman | cs.AI cs.CY cs.DL | 2016-09-08 | Exploiting Social Annotation for Automatic Resource Discovery Information integration applications, such as mediators or mashups, that require access to information resources currently rely on users manually discovering and integrating them in the application. Manual resource discovery is a slow process, requiring the ... | cs.AI | 2,016 | 1,185 | 170 | 61 |
0704.1676 | Personalizing Image Search Results on Flickr | The social media site Flickr allows users to upload their photos, annotate them with tags, submit them to groups, and also to form social networks by adding other users as contacts. Flickr offers multiple ways of browsing or searching it. One option is tag search, which returns all images tagged with a specific keyword... | Kristina Lerman, Anon Plangprasopchok and Chio Wong | cs.IR cs.AI cs.CY cs.DL cs.HC | 2007-05-23 | Personalizing Image Search Results on Flickr The social media site Flickr allows users to upload their photos, annotate them with tags, submit them to groups, and also to form social networks by adding other users as contacts. Flickr offers multiple ways of browsing or searching it. One option is tag search, which retu... | cs.IR | 2,007 | 1,345 | 221 | 44 |
0704.1678 | Settling the Complexity of Computing Two-Player Nash Equilibria | We settle a long-standing open question in algorithmic game theory. We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD Polynomial Parity Argument, Directed version) introduced by Papadimitriou in 1991. This is the first of a series of result... | Xi Chen, Xiaotie Deng, Shang-Hua Teng | cs.GT cs.CC | 2007-05-23 | Settling the Complexity of Computing Two-Player Nash Equilibria We settle a long-standing open question in algorithmic game theory. We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD Polynomial Parity Argument, Directed version) introduced b... | cs.GT | 2,007 | 1,240 | 178 | 63 |
0704.1694 | Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers | A k-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit x_i of the message by querying only k bits of the codeword C(x), even after some constant fraction of codeword bits has been corrupted. The major goal of LDC related research ... | Kiran S. Kedlaya, Sergey Yekhanin | cs.CC math.NT | 2007-05-23 | Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers A k-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit x_i of the message by querying only k bits of the codeword C(x), even after so... | cs.CC | 2,007 | 1,208 | 199 | 96 |
0704.1707 | A Cut-free Sequent Calculus for Bi-Intuitionistic Logic: Extended Version | Bi-intuitionistic logic is the extension of intuitionistic logic with a connective dual to implication. Bi-intuitionistic logic was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But her subsequent ``cut-free'' sequent calculus for BiInt has recently been shown by Uustalu to fail cut-e... | Linda Buisman and Rajeev Gor\'e | cs.LO | 2007-05-23 | A Cut-free Sequent Calculus for Bi-Intuitionistic Logic: Extended Version Bi-intuitionistic logic is the extension of intuitionistic logic with a connective dual to implication. Bi-intuitionistic logic was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But her subsequent ``cut-free'' s... | cs.LO | 2,007 | 913 | 133 | 73 |
0704.1709 | Traitement Des Donnees Manquantes Au Moyen De L'Algorithme De Kohonen | Nous montrons comment il est possible d'utiliser l'algorithme d'auto organisation de Kohonen pour traiter des donn\'ees avec valeurs manquantes et estimer ces derni\`eres. Apr\`es un rappel m\'ethodologique, nous illustrons notre propos \`a partir de trois applications \`a des donn\'ees r\'eelles. ----- We show how it ... | Marie Cottrell (SAMOS, Matisse), Smail Ibbou (SAMOS, Matisse), Patrick
Letr\'emy (SAMOS, Matisse) | stat.AP cs.NE | 2007-05-23 | Traitement Des Donnees Manquantes Au Moyen De L'Algorithme De Kohonen Nous montrons comment il est possible d'utiliser l'algorithme d'auto organisation de Kohonen pour traiter des donn\'ees avec valeurs manquantes et estimer ces derni\`eres. Apr\`es un rappel m\'ethodologique, nous illustrons notre propos \`a partir de... | stat.AP | 2,007 | 542 | 78 | 69 |
0704.1748 | Self-Organization applied to Dynamic Network Layout | As networks and their structure have become a major field of research, a strong demand for network visualization has emerged. We address this challenge by formalizing the well established spring layout in terms of dynamic equations. We thus open up the design space for new algorithms. Drawing from the knowledge of syst... | Markus M. Geipel | physics.comp-ph cs.DS nlin.AO | 2009-11-13 | Self-Organization applied to Dynamic Network Layout As networks and their structure have become a major field of research, a strong demand for network visualization has emerged. We address this challenge by formalizing the well established spring layout in terms of dynamic equations. We thus open up the design space fo... | physics.comp-ph | 2,009 | 747 | 120 | 51 |
0704.1751 | Information Theoretic Proofs of Entropy Power Inequalities | While most useful information theoretic inequalities can be deduced from the basic properties of entropy or mutual information, up to now Shannon's entropy power inequality (EPI) is an exception: Existing information theoretic proofs of the EPI hinge on representations of differential entropy using either Fisher inform... | Olivier Rioul | cs.IT math.IT | 2016-11-17 | Information Theoretic Proofs of Entropy Power Inequalities While most useful information theoretic inequalities can be deduced from the basic properties of entropy or mutual information, up to now Shannon's entropy power inequality (EPI) is an exception: Existing information theoretic proofs of the EPI hinge on represe... | cs.IT | 2,016 | 1,373 | 205 | 58 |
0704.1756 | The Invar Tensor Package | The Invar package is introduced, a fast manipulator of generic scalar polynomial expressions formed from the Riemann tensor of a four-dimensional metric-compatible connection. The package can maximally simplify any polynomial containing tensor products of up to seven Riemann tensors within seconds. It has been implemen... | Jose M. Martin-Garcia, Renato Portugal, Leon R. U. Manssur | cs.SC gr-qc hep-th | 2015-05-13 | The Invar Tensor Package The Invar package is introduced, a fast manipulator of generic scalar polynomial expressions formed from the Riemann tensor of a four-dimensional metric-compatible connection. The package can maximally simplify any polynomial containing tensor products of up to seven Riemann tensors within seco... | cs.SC | 2,015 | 372 | 52 | 24 |
0704.1768 | Assessment and Propagation of Input Uncertainty in Tree-based Option Pricing Models | This paper aims to provide a practical example on the assessment and propagation of input uncertainty for option pricing when using tree-based methods. Input uncertainty is propagated into output uncertainty, reflecting that option prices are as unknown as the inputs they are based on. Option pricing formulas are tools... | Henryk Gzyl, German Molina, Enrique ter Horst | cs.CE cs.GT | 2007-05-23 | Assessment and Propagation of Input Uncertainty in Tree-based Option Pricing Models This paper aims to provide a practical example on the assessment and propagation of input uncertainty for option pricing when using tree-based methods. Input uncertainty is propagated into output uncertainty, reflecting that option pric... | cs.CE | 2,007 | 978 | 149 | 83 |
0704.1783 | Unicast and Multicast Qos Routing with Soft Constraint Logic Programming | We present a formal model to represent and solve the unicast/multicast routing problem in networks with Quality of Service (QoS) requirements. To attain this, first we translate the network adapting it to a weighted graph (unicast) or and-or graph (multicast), where the weight on a connector corresponds to the multidim... | Stefano Bistarelli, Ugo Montanari, Francesca Rossi, Francesco Santini | cs.LO cs.AI cs.NI | 2009-09-29 | Unicast and Multicast Qos Routing with Soft Constraint Logic Programming We present a formal model to represent and solve the unicast/multicast routing problem in networks with Quality of Service (QoS) requirements. To attain this, first we translate the network adapting it to a weighted graph (unicast) or and-or graph... | cs.LO | 2,009 | 1,029 | 163 | 72 |
0704.1818 | Low-density graph codes that are optimal for source/channel coding and binning | We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-density parity check (LDPC) code. Our first pair of theorems establish that there exist codes from this ensemble, with all degrees remaining ... | Martin J. Wainwright, Emin Martinian | cs.IT math.IT | 2007-07-13 | Low-density graph codes that are optimal for source/channel coding and binning We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-density parity check (LDPC) code. Our first pair of theorems e... | cs.IT | 2,007 | 1,304 | 199 | 78 |
0704.1827 | Transaction-Oriented Simulation In Ad Hoc Grids | This paper analyses the possibilities of performing parallel transaction-oriented simulations with a special focus on the space-parallel approach and discrete event simulation synchronisation algorithms that are suitable for transaction-oriented simulation and the target environment of Ad Hoc Grids. To demonstrate the ... | Gerald Krafft | cs.DC | 2007-05-23 | Transaction-Oriented Simulation In Ad Hoc Grids This paper analyses the possibilities of performing parallel transaction-oriented simulations with a special focus on the space-parallel approach and discrete event simulation synchronisation algorithms that are suitable for transaction-oriented simulation and the target ... | cs.DC | 2,007 | 979 | 137 | 47 |
0704.1829 | On-line Chain Partitions of Up-growing Semi-orders | On-line chain partition is a two-player game between Spoiler and Algorithm. Spoiler presents a partially ordered set, point by point. Algorithm assigns incoming points (immediately and irrevocably) to the chains which constitute a chain partition of the order. The value of the game for orders of width $w$ is a minimum ... | Stefan Felsner, Kamil Kloch, Grzegorz Matecki, and Piotr Micek | cs.DM | 2011-02-22 | On-line Chain Partitions of Up-growing Semi-orders On-line chain partition is a two-player game between Spoiler and Algorithm. Spoiler presents a partially ordered set, point by point. Algorithm assigns incoming points (immediately and irrevocably) to the chains which constitute a chain partition of the order. The valu... | cs.DM | 2,011 | 619 | 97 | 50 |
0704.1833 | Analysis of the 802.11e Enhanced Distributed Channel Access Function | The IEEE 802.11e standard revises the Medium Access Control (MAC) layer of the former IEEE 802.11 standard for Quality-of-Service (QoS) provision in the Wireless Local Area Networks (WLANs). The Enhanced Distributed Channel Access (EDCA) function of 802.11e defines multiple Access Categories (AC) with AC-specific Conte... | Inanc Inan, Feyza Keceli, Ender Ayanoglu | cs.NI | 2008-03-28 | Analysis of the 802.11e Enhanced Distributed Channel Access Function The IEEE 802.11e standard revises the Medium Access Control (MAC) layer of the former IEEE 802.11 standard for Quality-of-Service (QoS) provision in the Wireless Local Area Networks (WLANs). The Enhanced Distributed Channel Access (EDCA) function of 8... | cs.NI | 2,008 | 884 | 129 | 68 |
0704.1838 | Performance Analysis of the IEEE 802.11e Enhanced Distributed Coordination Function using Cycle Time Approach | The recently ratified IEEE 802.11e standard defines the Enhanced Distributed Channel Access (EDCA) function for Quality-of-Service (QoS) provisioning in the Wireless Local Area Networks (WLANs). The EDCA uses Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) and slotted Binary Exponential Backoff (BEB) m... | Inanc Inan, Feyza Keceli, Ender Ayanoglu | cs.OH | 2007-05-23 | Performance Analysis of the IEEE 802.11e Enhanced Distributed Coordination Function using Cycle Time Approach The recently ratified IEEE 802.11e standard defines the Enhanced Distributed Channel Access (EDCA) function for Quality-of-Service (QoS) provisioning in the Wireless Local Area Networks (WLANs). The EDCA uses C... | cs.OH | 2,007 | 969 | 137 | 109 |
0704.1842 | Fairness Provision in the IEEE 802.11e Infrastructure Basic Service Set | Most of the deployed IEEE 802.11e Wireless Local Area Networks (WLANs) use infrastructure Basic Service Set (BSS) in which an Access Point (AP) serves as a gateway between wired and wireless domains. We present the unfairness problem between the uplink and the downlink flows of any Access Category (AC) in the 802.11e E... | Feyza Keceli, Inanc Inan, Ender Ayanoglu | cs.OH | 2007-09-13 | Fairness Provision in the IEEE 802.11e Infrastructure Basic Service Set Most of the deployed IEEE 802.11e Wireless Local Area Networks (WLANs) use infrastructure Basic Service Set (BSS) in which an Access Point (AP) serves as a gateway between wired and wireless domains. We present the unfairness problem between the up... | cs.OH | 2,007 | 1,120 | 168 | 71 |
0704.1873 | An Achievable Rate Region for Interference Channels with Conferencing | In this paper, we propose an achievable rate region for discrete memoryless interference channels with conferencing at the transmitter side. We employ superposition block Markov encoding, combined with simultaneous superposition coding, dirty paper coding, and random binning to obtain the achievable rate region. We sho... | Yi Cao and Biao Chen | cs.IT math.IT | 2007-07-13 | An Achievable Rate Region for Interference Channels with Conferencing In this paper, we propose an achievable rate region for discrete memoryless interference channels with conferencing at the transmitter side. We employ superposition block Markov encoding, combined with simultaneous superposition coding, dirty paper c... | cs.IT | 2,007 | 629 | 88 | 69 |
0704.1886 | An algebraic generalization of Kripke structures | The Kripke semantics of classical propositional normal modal logic is made algebraic via an embedding of Kripke structures into the larger class of pointed stably supported quantales. This algebraic semantics subsumes the traditional algebraic semantics based on lattices with unary operators, and it suggests natural in... | S\'ergio Marcelino and Pedro Resende | math.LO cs.LO math.RA | 2009-11-13 | An algebraic generalization of Kripke structures The Kripke semantics of classical propositional normal modal logic is made algebraic via an embedding of Kripke structures into the larger class of pointed stably supported quantales. This algebraic semantics subsumes the traditional algebraic semantics based on lattices... | math.LO | 2,009 | 896 | 131 | 48 |
0704.1925 | Blind Identification of Distributed Antenna Systems with Multiple Carrier Frequency Offsets | In spatially distributed multiuser antenna systems, the received signal contains multiple carrier-frequency offsets (CFOs) arising from mismatch between the oscillators of transmitters and receivers. This results in a time-varying rotation of the data constellation, which needs to be compensated at the receiver before ... | Yuanning Yu, Athina P. Petropulu and H. Vincent Poor | cs.IT math.IT | 2007-07-13 | Blind Identification of Distributed Antenna Systems with Multiple Carrier Frequency Offsets In spatially distributed multiuser antenna systems, the received signal contains multiple carrier-frequency offsets (CFOs) arising from mismatch between the oscillators of transmitters and receivers. This results in a time-varyi... | cs.IT | 2,007 | 1,083 | 161 | 91 |
0704.2010 | A study of structural properties on profiles HMMs | Motivation: Profile hidden Markov Models (pHMMs) are a popular and very useful tool in the detection of the remote homologue protein families. Unfortunately, their performance is not always satisfactory when proteins are in the 'twilight zone'. We present HMMER-STRUCT, a model construction algorithm and tool that tries... | Juliana S Bernardes, Alberto Davila, Vitor Santos Costa, Gerson
Zaverucha | cs.AI | 2008-12-11 | A study of structural properties on profiles HMMs Motivation: Profile hidden Markov Models (pHMMs) are a popular and very useful tool in the detection of the remote homologue protein families. Unfortunately, their performance is not always satisfactory when proteins are in the 'twilight zone'. We present HMMER-STRUCT, ... | cs.AI | 2,008 | 1,598 | 227 | 49 |
0704.2014 | Extensive Games with Possibly Unaware Players | Standard game theory assumes that the structure of the game is common knowledge among players. We relax this assumption by considering extensive games where agents may be unaware of the complete structure of the game. In particular, they may not be aware of moves that they and other agents can make. We show how such ga... | Joseph Y. Halpern, Leandro C. R\^ego | cs.GT cs.MA | 2007-05-23 | Extensive Games with Possibly Unaware Players Standard game theory assumes that the structure of the game is common knowledge among players. We relax this assumption by considering extensive games where agents may be unaware of the complete structure of the game. In particular, they may not be aware of moves that they ... | cs.GT | 2,007 | 881 | 156 | 45 |
0704.2017 | Large System Analysis of Game-Theoretic Power Control in UWB Wireless Networks with Rake Receivers | This paper studies the performance of partial-Rake (PRake) receivers in impulse-radio ultrawideband wireless networks when an energy-efficient power control scheme is adopted. Due to the large bandwidth of the system, the multipath channel is assumed to be frequency-selective. By using noncooperative game-theoretic mod... | G. Bacci, M. Luise, H.V. Poor | cs.IT cs.GT math.IT | 2016-11-17 | Large System Analysis of Game-Theoretic Power Control in UWB Wireless Networks with Rake Receivers This paper studies the performance of partial-Rake (PRake) receivers in impulse-radio ultrawideband wireless networks when an energy-efficient power control scheme is adopted. Due to the large bandwidth of the system, the... | cs.IT | 2,016 | 619 | 89 | 98 |
0704.2083 | Introduction to Arabic Speech Recognition Using CMUSphinx System | In this paper Arabic was investigated from the speech recognition problem point of view. We propose a novel approach to build an Arabic Automated Speech Recognition System (ASR). This system is based on the open source CMU Sphinx-4, from the Carnegie Mellon University. CMU Sphinx is a large-vocabulary; speaker-independ... | H. Satori, M. Harti and N. Chenfour | cs.CL cs.AI | 2007-05-23 | Introduction to Arabic Speech Recognition Using CMUSphinx System In this paper Arabic was investigated from the speech recognition problem point of view. We propose a novel approach to build an Arabic Automated Speech Recognition System (ASR). This system is based on the open source CMU Sphinx-4, from the Carnegie Mell... | cs.CL | 2,007 | 563 | 84 | 64 |
0704.2092 | A Note on the Inapproximability of Correlation Clustering | We consider inapproximability of the correlation clustering problem defined as follows: Given a graph $G = (V,E)$ where each edge is labeled either "+" (similar) or "-" (dissimilar), correlation clustering seeks to partition the vertices into clusters so that the number of pairs correctly (resp. incorrectly) classified... | Jinsong Tan | cs.LG cs.DS | 2009-03-23 | A Note on the Inapproximability of Correlation Clustering We consider inapproximability of the correlation clustering problem defined as follows: Given a graph $G = (V,E)$ where each edge is labeled either "+" (similar) or "-" (dissimilar), correlation clustering seeks to partition the vertices into clusters so that th... | cs.LG | 2,009 | 1,498 | 224 | 57 |
0704.2201 | Arabic Speech Recognition System using CMU-Sphinx4 | In this paper we present the creation of an Arabic version of Automated Speech Recognition System (ASR). This system is based on the open source Sphinx-4, from the Carnegie Mellon University. Which is a speech recognition system based on discrete hidden Markov models (HMMs). We investigate the changes that must be made... | H. Satori, M. Harti and N. Chenfour | cs.CL cs.AI | 2007-05-23 | Arabic Speech Recognition System using CMU-Sphinx4 In this paper we present the creation of an Arabic version of Automated Speech Recognition System (ASR). This system is based on the open source Sphinx-4, from the Carnegie Mellon University. Which is a speech recognition system based on discrete hidden Markov models (... | cs.CL | 2,007 | 475 | 71 | 50 |
End of preview. Expand in Data Studio
No dataset card yet
- Downloads last month
- 3