corpus_id
stringlengths 7
12
| paper_id
stringlengths 9
16
| title
stringlengths 1
261
| abstract
stringlengths 70
4.02k
| source
stringclasses 1
value | bibtex
stringlengths 208
20.9k
| citation_key
stringlengths 6
100
|
|---|---|---|---|---|---|---|
arxiv-3401 | 0804.3215 | Multicast Capacity of Optical WDM Packet Ring for Hotspot Traffic | <|reference_start|>Multicast Capacity of Optical WDM Packet Ring for Hotspot Traffic: Packet-switching WDM ring networks with a hotspot transporting unicast, multicast, and broadcast traffic are important components of high-speed metropolitan area networks. For an arbitrary multicast fanout traffic model with uniform, hotspot destination, and hotspot source packet traffic, we analyze the maximum achievable long-run average packet throughput, which we refer to as \textit{multicast capacity}, of bi-directional shortest-path routed WDM rings. We identify three segments that can experience the maximum utilization, and thus, limit the multicast capacity. We characterize the segment utilization probabilities through bounds and approximations, which we verify through simulations. We discover that shortest-path routing can lead to utilization probabilities above one half for moderate to large portions of hotspot source multi- and broadcast traffic, and consequently multicast capacities of less than two simultaneous packet transmissions. We outline a one-copy routing strategy that guarantees a multicast capacity of at least two simultaneous packet transmissions for arbitrary hotspot source traffic.<|reference_end|> | arxiv | @article{der heiden2008multicast,
title={Multicast Capacity of Optical WDM Packet Ring for Hotspot Traffic},
author={Matthias an der Heiden, Michel Sortais, Michael Scheutzow, Martin
Reisslein, and Martin Maier},
journal={arXiv preprint arXiv:0804.3215},
year={2008},
doi={10.1016/j.osn.2011.05.002},
archivePrefix={arXiv},
eprint={0804.3215},
primaryClass={cs.IT math.IT}
} | der heiden2008multicast |
arxiv-3402 | 0804.3234 | Technical Report - Automatic Contour Extraction from 2D Neuron Images | <|reference_start|>Technical Report - Automatic Contour Extraction from 2D Neuron Images: This work describes a novel methodology for automatic contour extraction from 2D images of 3D neurons (e.g. camera lucida images and other types of 2D microscopy). Most contour-based shape analysis methods can not be used to characterize such cells because of overlaps between neuronal processes. The proposed framework is specifically aimed at the problem of contour following even in presence of multiple overlaps. First, the input image is preprocessed in order to obtain an 8-connected skeleton with one-pixel-wide branches, as well as a set of critical regions (i.e., bifurcations and crossings). Next, for each subtree, the tracking stage iteratively labels all valid pixel of branches, up to a critical region, where it determines the suitable direction to proceed. Finally, the labeled skeleton segments are followed in order to yield the parametric contour of the neuronal shape under analysis. The reported system was successfully tested with respect to several images and the results from a set of three neuron images are presented here, each pertaining to a different class, i.e. alpha, delta and epsilon ganglion cells, containing a total of 34 crossings. The algorithms successfully got across all these overlaps. The method has also been found to exhibit robustness even for images with close parallel segments. The proposed method is robust and may be implemented in an efficient manner. The introduction of this approach should pave the way for more systematic application of contour-based shape analysis methods in neuronal morphology.<|reference_end|> | arxiv | @article{leandro2008technical,
title={Technical Report - Automatic Contour Extraction from 2D Neuron Images},
author={J. J. G. Leandro (1), R. M. Cesar Jr (1) and L. da F. Costa (2) ((1)
Institute of Mathematics and Statistics - USP - Brazil, (2) Instituto de
F'isica de S~ao Carlos - USP - Brazil)},
journal={arXiv preprint arXiv:0804.3234},
year={2008},
archivePrefix={arXiv},
eprint={0804.3234},
primaryClass={cs.CV q-bio.NC}
} | leandro2008technical |
arxiv-3403 | 0804.3237 | Electronic Voting: the Devil is in the Details | <|reference_start|>Electronic Voting: the Devil is in the Details: Observing electronic voting from an international point of view gives some perspective about its genesis and evolution. An analysis of the voting process through its cultural, ontological, legal and political dimensions explains the difficulty to normalize this process. It appears that international organizations are not capable to properly defend the fundamental rights of the citizens. The approach that was taken when DRE voting computers appeared seems to have reoccured with VVAT voting computers and the european e-poll project.<|reference_end|> | arxiv | @article{enguehard2008electronic,
title={Electronic Voting: the Devil is in the Details},
author={Chantal Enguehard (LINA), Jean-Didier Graton},
journal={arXiv preprint arXiv:0804.3237},
year={2008},
archivePrefix={arXiv},
eprint={0804.3237},
primaryClass={cs.CY}
} | enguehard2008electronic |
arxiv-3404 | 0804.3241 | A Synthesizer Based on Frequency-Phase Analysis and Square Waves | <|reference_start|>A Synthesizer Based on Frequency-Phase Analysis and Square Waves: This article introduces an effective generalization of the polar flavor of the Fourier Theorem based on a new method of analysis. Under the premises of the new theory an ample class of functions become viable as bases, with the further advantage of using the same basis for analysis and reconstruction. In fact other tools, like the wavelets, admit specially built nonorthogonal bases but require different bases for analysis and reconstruction (biorthogonal and dual bases) and vectorial coordinates; this renders those systems unintuitive and computing intensive. As an example of the advantages of the new generalization of the Fourier Theorem, this paper introduces a novel method for the synthesis that is based on frequency-phase series of square waves (the equivalent of the polar Fourier Theorem but for nonorthogonal bases). The resulting synthesizer is very efficient needing only few components, frugal in terms of computing needs, and viable for many applications.<|reference_end|> | arxiv | @article{vergara2008a,
title={A Synthesizer Based on Frequency-Phase Analysis and Square Waves},
author={Sossio Vergara},
journal={arXiv preprint arXiv:0804.3241},
year={2008},
archivePrefix={arXiv},
eprint={0804.3241},
primaryClass={cs.SD cs.DM}
} | vergara2008a |
arxiv-3405 | 0804.3255 | Reconstruction of Multidimensional Signals from Irregular Noisy Samples | <|reference_start|>Reconstruction of Multidimensional Signals from Irregular Noisy Samples: We focus on a multidimensional field with uncorrelated spectrum, and study the quality of the reconstructed signal when the field samples are irregularly spaced and affected by independent and identically distributed noise. More specifically, we apply linear reconstruction techniques and take the mean square error (MSE) of the field estimate as a metric to evaluate the signal reconstruction quality. We find that the MSE analysis could be carried out by using the closed-form expression of the eigenvalue distribution of the matrix representing the sampling system. Unfortunately, such distribution is still unknown. Thus, we first derive a closed-form expression of the distribution moments, and we find that the eigenvalue distribution tends to the Marcenko-Pastur distribution as the field dimension goes to infinity. Finally, by using our approach, we derive a tight approximation to the MSE of the reconstructed field.<|reference_end|> | arxiv | @article{nordio2008reconstruction,
title={Reconstruction of Multidimensional Signals from Irregular Noisy Samples},
author={A. Nordio, C-F. Chiasserini, and E. Viterbo},
journal={arXiv preprint arXiv:0804.3255},
year={2008},
doi={10.1109/TSP.2008.925953},
archivePrefix={arXiv},
eprint={0804.3255},
primaryClass={cs.IT math.IT}
} | nordio2008reconstruction |
arxiv-3406 | 0804.3259 | On Multiuser Power Region of Fading Multiple-Access Channel with Multiple Antennas | <|reference_start|>On Multiuser Power Region of Fading Multiple-Access Channel with Multiple Antennas: This paper is concerned with the fading MIMO-MAC with multiple receive antennas at the base station (BS) and multiple transmit antennas at each mobile terminal (MT). Two multiple-access techniques are considered for scheduling transmissions from each MT to the BS at the same frequency, which are space-division multiple-access (SDMA) and time-division multiple-access (TDMA). For SDMA, all MTs transmit simultaneously to the BS and their individual signals are resolved at the BS via multiple receive antennas while for TDMA, each MT transmits independently to the BS during mutually orthogonal time slots. It is assumed that the channel-state information (CSI) of the fading channel from each MT to the BS is unknown at each MT transmitter, but is perfectly known at the BS receiver. Thereby, the BS can acquire the long-term channel-distribution information (CDI) for each MT. This paper extends the well-known transmit-covariance feedback scheme for the point-to-point fading MIMO channel to the fading MIMO-MAC, whereby the BS jointly optimizes the transmit signal covariance matrices for all MTs based on their CDI, and then sends each transmit covariance matrix back to the corresponding MT via a feedback channel. The main goal of this paper is to characterize the so-called multiuser power region under the multiuser transmit-covariance feedback scheme for both SDMA and TDMA. The power region is defined as the constitution of all user transmit power-tuples that can achieve reliable transmissions for a given set of user target rates. Simulation results show that SDMA can achieve substantial power savings over TDMA for the fading MIMO-MAC. Moreover, this paper demonstrates the usefulness of the multiuser power region for maintaining proportionally-fair power consumption among the MTs.<|reference_end|> | arxiv | @article{zhang2008on,
title={On Multiuser Power Region of Fading Multiple-Access Channel with
Multiple Antennas},
author={Rui Zhang, Mehdi Mohseni, and John M. Cioffi},
journal={arXiv preprint arXiv:0804.3259},
year={2008},
archivePrefix={arXiv},
eprint={0804.3259},
primaryClass={cs.IT math.IT}
} | zhang2008on |
arxiv-3407 | 0804.3261 | Optimal Dynamic Resource Allocation for Multi-Antenna Broadcasting with Heterogeneous Delay-Constrained Traffic | <|reference_start|>Optimal Dynamic Resource Allocation for Multi-Antenna Broadcasting with Heterogeneous Delay-Constrained Traffic: This paper is concerned with dynamic resource allocation in a cellular wireless network with slow fading for support of data traffic having heterogeneous transmission delay requirements. The multiple-input single-output (MISO) fading broadcast channel (BC) is of interest where the base station (BS) employs multiple transmit antennas to realize simultaneous downlink transmission at the same frequency to multiple mobile users each having a single receive antenna. An information-theoretic approach is taken for characterizing capacity limits of the fading MISO-BC under various transmission delay considerations. First, this paper studies transmit optimization at the BS when some users have delay-tolerant ``packet'' data and the others have delay-sensitive ``circuit'' data for transmission at the same time. Based on the convex optimization framework, an online resource allocation algorithm is derived that is amenable to efficient cross-layer implementation of both physical (PHY) -layer multi-antenna transmission and media-access-control (MAC) -layer multiuser rate scheduling. Secondly, this paper investigates the fundamental throughput-delay tradeoff for transmission over the fading MISO-BC. By comparing the network throughput under completely relaxed versus strictly zero transmission delay constraint, this paper characterizes the limiting loss in sum capacity due to the vanishing delay tolerance, termed the delay penalty, under some prescribed user fairness for transmit rate allocation.<|reference_end|> | arxiv | @article{zhang2008optimal,
title={Optimal Dynamic Resource Allocation for Multi-Antenna Broadcasting with
Heterogeneous Delay-Constrained Traffic},
author={Rui Zhang},
journal={arXiv preprint arXiv:0804.3261},
year={2008},
doi={10.1109/JSTSP.2008.922470},
archivePrefix={arXiv},
eprint={0804.3261},
primaryClass={cs.IT math.IT}
} | zhang2008optimal |
arxiv-3408 | 0804.3266 | Wadge Degrees of Infinitary Rational Relations | <|reference_start|>Wadge Degrees of Infinitary Rational Relations: We show that, from the topological point of view, 2-tape B\"uchi automata have the same accepting power as Turing machines equipped with a B\"uchi acceptance condition. The Borel and the Wadge hierarchies of the class RAT_omega of infinitary rational relations accepted by 2-tape B\"uchi automata are equal to the Borel and the Wadge hierarchies of omega-languages accepted by real-time B\"uchi 1-counter automata or by B\"uchi Turing machines. In particular, for every non-null recursive ordinal $\alpha$, there exist some $\Sigma^0_\alpha$-complete and some $\Pi^0_\alpha$-complete infinitary rational relations. And the supremum of the set of Borel ranks of infinitary rational relations is an ordinal $\gamma^1_2$ which is strictly greater than the first non-recursive ordinal $\omega_1^{CK}$. This very surprising result gives answers to questions of Simonnet (1992) and of Lescow and Thomas (1988,1994).<|reference_end|> | arxiv | @article{finkel2008wadge,
title={Wadge Degrees of Infinitary Rational Relations},
author={Olivier Finkel (LIP)},
journal={Mathematics in Computer Science 1, 2 (2008) 85-102},
year={2008},
doi={10.1007/s11786-008-0045-7},
archivePrefix={arXiv},
eprint={0804.3266},
primaryClass={cs.LO cs.CC math.LO}
} | finkel2008wadge |
arxiv-3409 | 0804.3269 | Phoneme recognition in TIMIT with BLSTM-CTC | <|reference_start|>Phoneme recognition in TIMIT with BLSTM-CTC: We compare the performance of a recurrent neural network with the best results published so far on phoneme recognition in the TIMIT database. These published results have been obtained with a combination of classifiers. However, in this paper we apply a single recurrent neural network to the same task. Our recurrent neural network attains an error rate of 24.6%. This result is not significantly different from that obtained by the other best methods, but they rely on a combination of classifiers for achieving comparable performance.<|reference_end|> | arxiv | @article{fernández2008phoneme,
title={Phoneme recognition in TIMIT with BLSTM-CTC},
author={Santiago Fern'andez, Alex Graves, Juergen Schmidhuber},
journal={arXiv preprint arXiv:0804.3269},
year={2008},
number={IDSIA-04-08},
archivePrefix={arXiv},
eprint={0804.3269},
primaryClass={cs.CL cs.NE}
} | fernández2008phoneme |
arxiv-3410 | 0804.3271 | Information Theoretic Operating Regimes of Large Wireless Networks | <|reference_start|>Information Theoretic Operating Regimes of Large Wireless Networks: In analyzing the point-to-point wireless channel, insights about two qualitatively different operating regimes--bandwidth- and power-limited--have proven indispensable in the design of good communication schemes. In this paper, we propose a new scaling law formulation for wireless networks that allows us to develop a theory that is analogous to the point-to-point case. We identify fundamental operating regimes of wireless networks and derive architectural guidelines for the design of optimal schemes. Our analysis shows that in a given wireless network with arbitrary size, area, power, bandwidth, etc., there are three parameters of importance: the short-distance SNR, the long-distance SNR, and the power path loss exponent of the environment. Depending on these parameters we identify four qualitatively different regimes. One of these regimes is especially interesting since it is fundamentally a consequence of the heterogeneous nature of links in a network and does not occur in the point-to-point case; the network capacity is {\em both} power and bandwidth limited. This regime has thus far remained hidden due to the limitations of the existing formulation. Existing schemes, either multihop transmission or hierarchical cooperation, fail to achieve capacity in this regime; we propose a new hybrid scheme that achieves capacity.<|reference_end|> | arxiv | @article{ozgur2008information,
title={Information Theoretic Operating Regimes of Large Wireless Networks},
author={Ayfer Ozgur, Ramesh Johari, David Tse, Olivier Leveque},
journal={arXiv preprint arXiv:0804.3271},
year={2008},
archivePrefix={arXiv},
eprint={0804.3271},
primaryClass={cs.IT math.IT}
} | ozgur2008information |
arxiv-3411 | 0804.3336 | Differential Meadows | <|reference_start|>Differential Meadows: A meadow is a zero totalised field (0^{-1}=0), and a cancellation meadow is a meadow without proper zero divisors. In this paper we consider differential meadows, i.e., meadows equipped with differentiation operators. We give an equational axiomatization of these operators and thus obtain a finite basis for differential cancellation meadows. Using the Zariski topology we prove the existence of a differential cancellation meadow.<|reference_end|> | arxiv | @article{bergstra2008differential,
title={Differential Meadows},
author={Jan A. Bergstra and Alban Ponse},
journal={arXiv preprint arXiv:0804.3336},
year={2008},
archivePrefix={arXiv},
eprint={0804.3336},
primaryClass={math.RA cs.LO math.AC}
} | bergstra2008differential |
arxiv-3412 | 0804.3351 | On the Expressive Power of Multiple Heads in CHR | <|reference_start|>On the Expressive Power of Multiple Heads in CHR: Constraint Handling Rules (CHR) is a committed-choice declarative language which has been originally designed for writing constraint solvers and which is nowadays a general purpose language. CHR programs consist of multi-headed guarded rules which allow to rewrite constraints into simpler ones until a solved form is reached. Many empirical evidences suggest that multiple heads augment the expressive power of the language, however no formal result in this direction has been proved, so far. In the first part of this paper we analyze the Turing completeness of CHR with respect to the underneath constraint theory. We prove that if the constraint theory is powerful enough then restricting to single head rules does not affect the Turing completeness of the language. On the other hand, differently from the case of the multi-headed language, the single head CHR language is not Turing powerful when the underlying signature (for the constraint theory) does not contain function symbols. In the second part we prove that, no matter which constraint theory is considered, under some reasonable assumptions it is not possible to encode the CHR language (with multi-headed rules) into a single headed language while preserving the semantics of the programs. We also show that, under some stronger assumptions, considering an increasing number of atoms in the head of a rule augments the expressive power of the language. These results provide a formal proof for the claim that multiple heads augment the expressive power of the CHR language.<|reference_end|> | arxiv | @article{di giusto2008on,
title={On the Expressive Power of Multiple Heads in CHR},
author={Cinzia Di Giusto, Maurizio Gabbrielli, Maria Chiara Meo},
journal={arXiv preprint arXiv:0804.3351},
year={2008},
archivePrefix={arXiv},
eprint={0804.3351},
primaryClass={cs.LO cs.DC}
} | di giusto2008on |
arxiv-3413 | 0804.3361 | A New Approach to Automated Epileptic Diagnosis Using EEG and Probabilistic Neural Network | <|reference_start|>A New Approach to Automated Epileptic Diagnosis Using EEG and Probabilistic Neural Network: Epilepsy is one of the most common neurological disorders that greatly impair patient' daily lives. Traditional epileptic diagnosis relies on tedious visual screening by neurologists from lengthy EEG recording that requires the presence of seizure (ictal) activities. Nowadays, there are many systems helping the neurologists to quickly find interesting segments of the lengthy signal by automatic seizure detection. However, we notice that it is very difficult, if not impossible, to obtain long-term EEG data with seizure activities for epilepsy patients in areas lack of medical resources and trained neurologists. Therefore, we propose to study automated epileptic diagnosis using interictal EEG data that is much easier to collect than ictal data. The authors are not aware of any report on automated EEG diagnostic system that can accurately distinguish patients' interictal EEG from the EEG of normal people. The research presented in this paper, therefore, aims to develop an automated diagnostic system that can use interictal EEG data to diagnose whether the person is epileptic. Such a system should also detect seizure activities for further investigation by doctors and potential patient monitoring. To develop such a system, we extract four classes of features from the EEG data and build a Probabilistic Neural Network (PNN) fed with these features. Leave-one-out cross-validation (LOO-CV) on a widely used epileptic-normal data set reflects an impressive 99.5% accuracy of our system on distinguishing normal people's EEG from patient's interictal EEG. We also find our system can be used in patient monitoring (seizure detection) and seizure focus localization, with 96.7% and 77.5% accuracy respectively on the data set.<|reference_end|> | arxiv | @article{bao2008a,
title={A New Approach to Automated Epileptic Diagnosis Using EEG and
Probabilistic Neural Network},
author={Forrest Sheng Bao, Donald Yu-Chun Lie, Yuanlin Zhang},
journal={arXiv preprint arXiv:0804.3361},
year={2008},
doi={10.1109/ICTAI.2008.99},
archivePrefix={arXiv},
eprint={0804.3361},
primaryClass={cs.AI cs.CV}
} | bao2008a |
arxiv-3414 | 0804.3417 | Robust Machine Learning Applied to Terascale Astronomical Datasets | <|reference_start|>Robust Machine Learning Applied to Terascale Astronomical Datasets: We present recent results from the LCDM (Laboratory for Cosmological Data Mining; http://lcdm.astro.uiuc.edu) collaboration between UIUC Astronomy and NCSA to deploy supercomputing cluster resources and machine learning algorithms for the mining of terascale astronomical datasets. This is a novel application in the field of astronomy, because we are using such resources for data mining, and not just performing simulations. Via a modified implementation of the NCSA cyberenvironment Data-to-Knowledge, we are able to provide improved classifications for over 100 million stars and galaxies in the Sloan Digital Sky Survey, improved distance measures, and a full exploitation of the simple but powerful k-nearest neighbor algorithm. A driving principle of this work is that our methods should be extensible from current terascale datasets to upcoming petascale datasets and beyond. We discuss issues encountered to-date, and further issues for the transition to petascale. In particular, disk I/O will become a major limiting factor unless the necessary infrastructure is implemented.<|reference_end|> | arxiv | @article{ball2008robust,
title={Robust Machine Learning Applied to Terascale Astronomical Datasets},
author={Nicholas M. Ball (1), Robert J. Brunner (1 and 2), Adam D. Myers (1)
((1) Department of Astronomy, University of Illinois at Urbana-Champaign, (2)
National Center for Supercomputing Applications, Urbana-Champaign)},
journal={arXiv preprint arXiv:0804.3417},
year={2008},
number={Not arXiv:0710.4482},
archivePrefix={arXiv},
eprint={0804.3417},
primaryClass={astro-ph cs.DC}
} | ball2008robust |
arxiv-3415 | 0804.3421 | Coalitions in Cooperative Wireless Networks | <|reference_start|>Coalitions in Cooperative Wireless Networks: Cooperation between rational users in wireless networks is studied using coalitional game theory. Using the rate achieved by a user as its utility, it is shown that the stable coalition structure, i.e., set of coalitions from which users have no incentives to defect, depends on the manner in which the rate gains are apportioned among the cooperating users. Specifically, the stability of the grand coalition (GC), i.e., the coalition of all users, is studied. Transmitter and receiver cooperation in an interference channel (IC) are studied as illustrative cooperative models to determine the stable coalitions for both flexible (transferable) and fixed (non-transferable) apportioning schemes. It is shown that the stable sum-rate optimal coalition when only receivers cooperate by jointly decoding (transferable) is the GC. The stability of the GC depends on the detector when receivers cooperate using linear multiuser detectors (non-transferable). Transmitter cooperation is studied assuming that all receivers cooperate perfectly and that users outside a coalition act as jammers. The stability of the GC is studied for both the case of perfectly cooperating transmitters (transferrable) and under a partial decode-and-forward strategy (non-transferable). In both cases, the stability is shown to depend on the channel gains and the transmitter jamming strengths.<|reference_end|> | arxiv | @article{mathur2008coalitions,
title={Coalitions in Cooperative Wireless Networks},
author={Suhas Mathur, Lalitha Sankar, Narayan B. Mandayam},
journal={arXiv preprint arXiv:0804.3421},
year={2008},
doi={10.1109/JSAC.2008.080908},
archivePrefix={arXiv},
eprint={0804.3421},
primaryClass={cs.GT cs.IT math.IT}
} | mathur2008coalitions |
arxiv-3416 | 0804.3430 | Combining Beamforming and Space-Time Coding Using Noisy Quantized Feedback | <|reference_start|>Combining Beamforming and Space-Time Coding Using Noisy Quantized Feedback: The goal of combining beamforming and space-time coding in this work is to obtain full-diversity order and to provide additional received power (array gain) compared to conventional space-time codes. In our system, we consider a quasi-static fading environment and we incorporate both high-rate and low-rate feedback channels with possible feedback errors. To utilize feedback information, a class of code constellations is proposed, inspired from orthogonal designs and precoded space-time block codes, which is called generalized partly orthogonal designs or generalized PODs. Furthermore, to model feedback errors, we assume that the feedback bits go through binary symmetric channels (BSCs). Two cases are studied: first, when the BSC bit error probability is known a priori to the transmission ends and second, when it is not known exactly. In the first case, we derive a minimum pairwise error probability (PEP) design criterion for generalized PODs. Then we design the quantizer for the erroneous feedback channel and the precoder codebook of PODs based on this criterion. The quantization scheme in our system is a channel optimized vector quantizer (COVQ). In the second case, the design of the quantizer and the precoder codebook is based on similar approaches, however with a worst-case design strategy. The attractive property of our combining scheme is that it converges to conventional space-time coding with low-rate and erroneous feedback and to directional beamforming with high-rate and error-free feedback. This scheme shows desirable robustness against feedback channel modeling mismatch.<|reference_end|> | arxiv | @article{ekbatani2008combining,
title={Combining Beamforming and Space-Time Coding Using Noisy Quantized
Feedback},
author={Siavash Ekbatani and Hamid Jafarkhani},
journal={arXiv preprint arXiv:0804.3430},
year={2008},
archivePrefix={arXiv},
eprint={0804.3430},
primaryClass={cs.IT math.IT}
} | ekbatani2008combining |
arxiv-3417 | 0804.3434 | Lecture notes on the lambda calculus | <|reference_start|>Lecture notes on the lambda calculus: This is a set of lecture notes that developed out of courses on the lambda calculus that I taught at the University of Ottawa in 2001 and at Dalhousie University in 2007 and 2013. Topics covered in these notes include the untyped lambda calculus, the Church-Rosser theorem, combinatory algebras, the simply-typed lambda calculus, the Curry-Howard isomorphism, weak and strong normalization, polymorphism, type inference, denotational semantics, complete partial orders, and the language PCF.<|reference_end|> | arxiv | @article{selinger2008lecture,
title={Lecture notes on the lambda calculus},
author={Peter Selinger},
journal={arXiv preprint arXiv:0804.3434},
year={2008},
archivePrefix={arXiv},
eprint={0804.3434},
primaryClass={cs.LO}
} | selinger2008lecture |
arxiv-3418 | 0804.3439 | Information theoretic bounds for Compressed Sensing | <|reference_start|>Information theoretic bounds for Compressed Sensing: In this paper we derive information theoretic performance bounds to sensing and reconstruction of sparse phenomena from noisy projections. We consider two settings: output noise models where the noise enters after the projection and input noise models where the noise enters before the projection. We consider two types of distortion for reconstruction: support errors and mean-squared errors. Our goal is to relate the number of measurements, $m$, and $\snr$, to signal sparsity, $k$, distortion level, $d$, and signal dimension, $n$. We consider support errors in a worst-case setting. We employ different variations of Fano's inequality to derive necessary conditions on the number of measurements and $\snr$ required for exact reconstruction. To derive sufficient conditions we develop new insights on max-likelihood analysis based on a novel superposition property. In particular this property implies that small support errors are the dominant error events. Consequently, our ML analysis does not suffer the conservatism of the union bound and leads to a tighter analysis of max-likelihood. These results provide order-wise tight bounds. For output noise models we show that asymptotically an $\snr$ of $\Theta(\log(n))$ together with $\Theta(k \log(n/k))$ measurements is necessary and sufficient for exact support recovery. Furthermore, if a small fraction of support errors can be tolerated, a constant $\snr$ turns out to be sufficient in the linear sparsity regime. In contrast for input noise models we show that support recovery fails if the number of measurements scales as $o(n\log(n)/SNR)$ implying poor compression performance for such cases. We also consider Bayesian set-up and characterize tradeoffs between mean-squared distortion and the number of measurements using rate-distortion theory.<|reference_end|> | arxiv | @article{aeron2008information,
title={Information theoretic bounds for Compressed Sensing},
author={Shuchin Aeron, Venkatesh Saligrama and Manqi Zhao},
journal={IEEE Transactions on Information Theory, 56, Issue:10, Oct. 2010,
5111-5130},
year={2008},
doi={10.1109/TIT.2010.2059891},
number={INSPEC accession number 11523421},
archivePrefix={arXiv},
eprint={0804.3439},
primaryClass={cs.IT math.IT}
} | aeron2008information |
arxiv-3419 | 0804.3453 | Weighted Sum Rate Optimization for Cognitive Radio MIMO Broadcast Channels | <|reference_start|>Weighted Sum Rate Optimization for Cognitive Radio MIMO Broadcast Channels: In this paper, we consider a cognitive radio (CR) network in which the unlicensed (secondary) users are allowed to concurrently access the spectrum allocated to the licensed (primary) users provided that their interference to the primary users (PUs) satisfies certain constraints. We study a weighted sum rate maximization problem for the secondary user (SU) multiple input multiple output (MIMO) broadcast channel (BC), in which the SUs have not only the sum power constraint but also interference constraints. We first transform this multi-constraint maximization problem into its equivalent form, which involves a single constraint with multiple auxiliary variables. Fixing these multiple auxiliary variables, we propose a duality result for the equivalent problem. Our duality result can solve the optimization problem for MIMO-BC with multiple linear constraints, and thus can be viewed as an extension of the conventional results, which rely crucially on a single sum power constraint. Furthermore, we develop an efficient sub-gradient based iterative algorithm to solve the equivalent problem and show that the developed algorithm converges to a globally optimal solution. Simulation results are further provided to corroborate the effectiveness of the proposed algorithm.<|reference_end|> | arxiv | @article{zhang2008weighted,
title={Weighted Sum Rate Optimization for Cognitive Radio MIMO Broadcast
Channels},
author={Lan Zhang, Yan Xin, Ying-Chang Liang},
journal={arXiv preprint arXiv:0804.3453},
year={2008},
archivePrefix={arXiv},
eprint={0804.3453},
primaryClass={cs.IT math.IT}
} | zhang2008weighted |
arxiv-3420 | 0804.3459 | Towards a stable definition of Kolmogorov-Chaitin complexity | <|reference_start|>Towards a stable definition of Kolmogorov-Chaitin complexity: Although information content is invariant up to an additive constant, the range of possible additive constants applicable to programming languages is so large that in practice it plays a major role in the actual evaluation of K(s), the Kolmogorov-Chaitin complexity of a string s. Some attempts have been made to arrive at a framework stable enough for a concrete definition of K, independent of any constant under a programming language, by appealing to the "naturalness" of the language in question. The aim of this paper is to present an approach to overcome the problem by looking at a set of models of computation converging in output probability distribution such that that "naturalness" can be inferred, thereby providing a framework for a stable definition of K under the set of convergent models of computation.<|reference_end|> | arxiv | @article{delahaye2008towards,
title={Towards a stable definition of Kolmogorov-Chaitin complexity},
author={Jean-Paul Delahaye, Hector Zenil},
journal={arXiv preprint arXiv:0804.3459},
year={2008},
archivePrefix={arXiv},
eprint={0804.3459},
primaryClass={cs.IT cs.CC math.IT}
} | delahaye2008towards |
arxiv-3421 | 0804.3486 | Stability and Throughput of Buffered Aloha with Backoff | <|reference_start|>Stability and Throughput of Buffered Aloha with Backoff: This paper studies the buffered Aloha with K-exponential backoff collision resolution algorithms. The buffered Aloha network is modeled as a multi-queue single-server system. We adopt a widely used approach in packet switching systems to decompose the multi-queue system into independent first-in-first-out (FIFO) queues, which are hinged together by the probability of success of head-of-line (HOL) packets. A unified method is devised to tackle the stability and throughput problems of K-exponential backoff with any cutoff phase K. For networks with a finite number of nodes, we show that the K-exponential backoff is stable if the retransmission factor is properly chosen from the stable region. The maximum stable throughput is derived and demonstrated via examples of geometric retransmission (K=1) and exponential backoff (K=infinity). For networks with an infinite number of nodes, we show that geometric retransmission is unstable, and the stable network throughput of exponential backoff can only be achieved at the cost of potential unbounded delay in each input queue. Furthermore, we address the stability issue of the systems at the undesired stable point. All analytical results presented in this paper are verified and confirmed by simulations.<|reference_end|> | arxiv | @article{lee2008stability,
title={Stability and Throughput of Buffered Aloha with Backoff},
author={Tony T. Lee and Lin Dai},
journal={arXiv preprint arXiv:0804.3486},
year={2008},
archivePrefix={arXiv},
eprint={0804.3486},
primaryClass={cs.NI}
} | lee2008stability |
arxiv-3422 | 0804.3500 | Natural pseudo-distance and optimal matching between reduced size functions | <|reference_start|>Natural pseudo-distance and optimal matching between reduced size functions: This paper studies the properties of a new lower bound for the natural pseudo-distance. The natural pseudo-distance is a dissimilarity measure between shapes, where a shape is viewed as a topological space endowed with a real-valued continuous function. Measuring dissimilarity amounts to minimizing the change in the functions due to the application of homeomorphisms between topological spaces, with respect to the $L_\infty$-norm. In order to obtain the lower bound, a suitable metric between size functions, called matching distance, is introduced. It compares size functions by solving an optimal matching problem between countable point sets. The matching distance is shown to be resistant to perturbations, implying that it is always smaller than the natural pseudo-distance. We also prove that the lower bound so obtained is sharp and cannot be improved by any other distance between size functions.<|reference_end|> | arxiv | @article{d'amico2008natural,
title={Natural pseudo-distance and optimal matching between reduced size
functions},
author={M. d'Amico, P. Frosini and C.Landi},
journal={arXiv preprint arXiv:0804.3500},
year={2008},
archivePrefix={arXiv},
eprint={0804.3500},
primaryClass={cs.CG cs.CV}
} | d'amico2008natural |
arxiv-3423 | 0804.3507 | Sixteen New Linear Codes With Plotkin Sum | <|reference_start|>Sixteen New Linear Codes With Plotkin Sum: Sixteen new linear codes are presented: three of them improve the lower bounds on the minimum distance for a linear code and the rest are an explicit construction of unknown codes attaining the lower bounds on the minimum distance. They are constructed using the Plotkin sum of two linear codes, also called $(u|u+v)$ construction. The computations have been achieved using an exhaustiv search.<|reference_end|> | arxiv | @article{hernando2008sixteen,
title={Sixteen New Linear Codes With Plotkin Sum},
author={Fernando Hernando, Diego Ruano},
journal={arXiv preprint arXiv:0804.3507},
year={2008},
archivePrefix={arXiv},
eprint={0804.3507},
primaryClass={cs.IT math.IT}
} | hernando2008sixteen |
arxiv-3424 | 0804.3575 | Isotropic PCA and Affine-Invariant Clustering | <|reference_start|>Isotropic PCA and Affine-Invariant Clustering: We present a new algorithm for clustering points in R^n. The key property of the algorithm is that it is affine-invariant, i.e., it produces the same partition for any affine transformation of the input. It has strong guarantees when the input is drawn from a mixture model. For a mixture of two arbitrary Gaussians, the algorithm correctly classifies the sample assuming only that the two components are separable by a hyperplane, i.e., there exists a halfspace that contains most of one Gaussian and almost none of the other in probability mass. This is nearly the best possible, improving known results substantially. For k > 2 components, the algorithm requires only that there be some (k-1)-dimensional subspace in which the emoverlap in every direction is small. Here we define overlap to be the ratio of the following two quantities: 1) the average squared distance between a point and the mean of its component, and 2) the average squared distance between a point and the mean of the mixture. The main result may also be stated in the language of linear discriminant analysis: if the standard Fisher discriminant is small enough, labels are not needed to estimate the optimal subspace for projection. Our main tools are isotropic transformation, spectral projection and a simple reweighting technique. We call this combination isotropic PCA.<|reference_end|> | arxiv | @article{brubaker2008isotropic,
title={Isotropic PCA and Affine-Invariant Clustering},
author={S. Charles Brubaker and Santosh S. Vempala},
journal={arXiv preprint arXiv:0804.3575},
year={2008},
archivePrefix={arXiv},
eprint={0804.3575},
primaryClass={cs.LG cs.CG}
} | brubaker2008isotropic |
arxiv-3425 | 0804.3583 | Matching Interdiction | <|reference_start|>Matching Interdiction: In the matching interdiction problem, we are given an undirected graph with weights and interdiction costs on the edges and seek to remove a subset of the edges constrained to some budget, such that the weight of a maximum weight matching in the remaining graph is minimized. In this work we introduce the matching interdiction problem and show that it is strongly NP-complete even when the input is restricted to simple, bipartite graphs with unit edge weights and unit interdiction costs. Furthermore, we present a pseudo-polynomial algorithm for solving the matching interdiction problem on graphs with bounded treewidth. The proposed algorithm extends the approach that is typically used for the creation of efficient algorithms on graphs with bounded treewidth to interdiction problems.<|reference_end|> | arxiv | @article{zenklusen2008matching,
title={Matching Interdiction},
author={Rico Zenklusen},
journal={arXiv preprint arXiv:0804.3583},
year={2008},
archivePrefix={arXiv},
eprint={0804.3583},
primaryClass={cs.DM}
} | zenklusen2008matching |
arxiv-3426 | 0804.3599 | Respect My Authority! HITS Without Hyperlinks, Utilizing Cluster-Based Language Models | <|reference_start|>Respect My Authority! HITS Without Hyperlinks, Utilizing Cluster-Based Language Models: We present an approach to improving the precision of an initial document ranking wherein we utilize cluster information within a graph-based framework. The main idea is to perform re-ranking based on centrality within bipartite graphs of documents (on one side) and clusters (on the other side), on the premise that these are mutually reinforcing entities. Links between entities are created via consideration of language models induced from them. We find that our cluster-document graphs give rise to much better retrieval performance than previously proposed document-only graphs do. For example, authority-based re-ranking of documents via a HITS-style cluster-based approach outperforms a previously-proposed PageRank-inspired algorithm applied to solely-document graphs. Moreover, we also show that computing authority scores for clusters constitutes an effective method for identifying clusters containing a large percentage of relevant documents.<|reference_end|> | arxiv | @article{kurland2008respect,
title={Respect My Authority! HITS Without Hyperlinks, Utilizing Cluster-Based
Language Models},
author={Oren Kurland, Lillian Lee},
journal={Proceedings of SIGIR 2006, pp 83--90},
year={2008},
archivePrefix={arXiv},
eprint={0804.3599},
primaryClass={cs.IR cs.CL}
} | kurland2008respect |
arxiv-3427 | 0804.3615 | Combinatorial invariants for graph isomorphism problem | <|reference_start|>Combinatorial invariants for graph isomorphism problem: Presented approach in polynomial time calculates large number of invariants for each vertex, which won't change with graph isomorphism and should fully determine the graph. For example numbers of closed paths of length k for given starting vertex, what can be though as the diagonal terms of k-th power of the adjacency matrix. For k=2 we would get degree of verities invariant, higher describes local topology deeper. Now if two graphs are isomorphic, they have the same set of such vectors of invariants - we can sort theses vectors lexicographically and compare them. If they agree, permutations from sorting allow to reconstruct the isomorphism. I'm presenting arguments that these invariants should fully determine the graph, but unfortunately I can't prove it in this moment. This approach can give hope, that maybe P=NP - instead of checking all instances, we should make arithmetics on these large numbers.<|reference_end|> | arxiv | @article{duda2008combinatorial,
title={Combinatorial invariants for graph isomorphism problem},
author={Jarek Duda},
journal={arXiv preprint arXiv:0804.3615},
year={2008},
archivePrefix={arXiv},
eprint={0804.3615},
primaryClass={cs.CC cs.DS}
} | duda2008combinatorial |
arxiv-3428 | 0804.3650 | On generic frequency decomposition Part 1: vectorial decomposition | <|reference_start|>On generic frequency decomposition Part 1: vectorial decomposition: The famous Fourier theorem states that, under some restrictions, any periodic function (or real world signal) can be obtained as a sum of sinusoids, and hence, a technique exists for decomposing a signal into its sinusoidal components. From this theory an entire branch of research has flourished: from the Short-Time or Windowed Fourier Transform to the Wavelets, the Frames, and lately the Generic Frequency Analysis. The aim of this paper is to take the Frequency Analysis a step further. It will be shown that keeping the same reconstruction algorithm as the Fourier Theorem but changing to a new computing method for the analysis phase allows the generalization of the Fourier Theorem to a large class of nonorthogonal bases. New methods and algorithms can be employed in function decomposition on such generic bases. It will be shown that these algorithms are a generalization of the Fourier analysis, i.e. they are reduced to the familiar Fourier tools when using orthogonal bases. The differences between this tool and the wavelets and frames theories will be discussed. Examples of analysis and reconstruction of functions using the given algorithms and nonorthogonal bases will be given. In this first part the focus will be on vectorial decomposition, while the second part will be on phased decomposition. The phased decomposition thanks to a single function basis has many interesting consequences and applications.<|reference_end|> | arxiv | @article{vergara2008on,
title={On generic frequency decomposition. Part 1: vectorial decomposition},
author={Sossio Vergara},
journal={Digital Signal Processing Journal, Vol. 17 March 2007},
year={2008},
archivePrefix={arXiv},
eprint={0804.3650},
primaryClass={cs.NA math.FA}
} | vergara2008on |
arxiv-3429 | 0804.3671 | Constructions for Clumps Statistics | <|reference_start|>Constructions for Clumps Statistics: We consider a component of the word statistics known as clump; starting from a finite set of words, clumps are maximal overlapping sets of these occurrences. This parameter has first been studied by Schbath with the aim of counting the number of occurrences of words in random texts. Later work with similar probabilistic approach used the Chen-Stein approximation for a compound Poisson distribution, where the number of clumps follows a law close to Poisson. Presently there is no combinatorial counterpart to this approach, and we fill the gap here. We emphasize the fact that, in contrast with the probabilistic approach which only provides asymptotic results, the combinatorial approach provides exact results that are useful when considering short sequences.<|reference_end|> | arxiv | @article{bassino2008constructions,
title={Constructions for Clumps Statistics},
author={Frederique Bassino, Julien Clement, Julien Fayolle, Pierre Nicodeme},
journal={arXiv preprint arXiv:0804.3671},
year={2008},
archivePrefix={arXiv},
eprint={0804.3671},
primaryClass={cs.DM cs.IR}
} | bassino2008constructions |
arxiv-3430 | 0804.3678 | Causal inference using the algorithmic Markov condition | <|reference_start|>Causal inference using the algorithmic Markov condition: Inferring the causal structure that links n observables is usually based upon detecting statistical dependences and choosing simple graphs that make the joint measure Markovian. Here we argue why causal inference is also possible when only single observations are present. We develop a theory how to generate causal graphs explaining similarities between single objects. To this end, we replace the notion of conditional stochastic independence in the causal Markov condition with the vanishing of conditional algorithmic mutual information and describe the corresponding causal inference rules. We explain why a consistent reformulation of causal inference in terms of algorithmic complexity implies a new inference principle that takes into account also the complexity of conditional probability densities, making it possible to select among Markov equivalent causal graphs. This insight provides a theoretical foundation of a heuristic principle proposed in earlier work. We also discuss how to replace Kolmogorov complexity with decidable complexity criteria. This can be seen as an algorithmic analog of replacing the empirically undecidable question of statistical independence with practical independence tests that are based on implicit or explicit assumptions on the underlying distribution.<|reference_end|> | arxiv | @article{janzing2008causal,
title={Causal inference using the algorithmic Markov condition},
author={Dominik Janzing and Bernhard Schoelkopf},
journal={arXiv preprint arXiv:0804.3678},
year={2008},
archivePrefix={arXiv},
eprint={0804.3678},
primaryClass={math.ST cs.IT math.IT stat.ML stat.TH}
} | janzing2008causal |
arxiv-3431 | 0804.3680 | Word-Based Text Compression | <|reference_start|>Word-Based Text Compression: Today there are many universal compression algorithms, but in most cases is for specific data better using specific algorithm - JPEG for images, MPEG for movies, etc. For textual documents there are special methods based on PPM algorithm or methods with non-character access, e.g. word-based compression. In the past, several papers describing variants of word-based compression using Huffman encoding or LZW method were published. The subject of this paper is the description of a word-based compression variant based on the LZ77 algorithm. The LZ77 algorithm and its modifications are described in this paper. Moreover, various ways of sliding window implementation and various possibilities of output encoding are described, as well. This paper also includes the implementation of an experimental application, testing of its efficiency and finding the best combination of all parts of the LZ77 coder. This is done to achieve the best compression ratio. In conclusion there is comparison of this implemented application with other word-based compression programs and with other commonly used compression programs.<|reference_end|> | arxiv | @article{platos2008word-based,
title={Word-Based Text Compression},
author={Jan Platos, Jiri Dvorsky},
journal={arXiv preprint arXiv:0804.3680},
year={2008},
archivePrefix={arXiv},
eprint={0804.3680},
primaryClass={cs.IT math.IT}
} | platos2008word-based |
arxiv-3432 | 0804.3752 | The privacy implications of Bluetooth | <|reference_start|>The privacy implications of Bluetooth: A substantial amount of research, as well as media hype, has surrounded RFID technology and its privacy implications. Currently, researchers and the media focus on the privacy threats posed by RFID, while consumer groups choose to boycott products bearing RFID tags. At the same, however, a very similar technology has quietly become part of our everyday lives: Bluetooth. In this paper we highlight the fact that Bluetooth is a widespread technology that has real privacy implications. Furthermore, we explore the applicability of RFID-based solutions to address these privacy implications.<|reference_end|> | arxiv | @article{kostakos2008the,
title={The privacy implications of Bluetooth},
author={Vassilis Kostakos},
journal={arXiv preprint arXiv:0804.3752},
year={2008},
archivePrefix={arXiv},
eprint={0804.3752},
primaryClass={cs.CR cs.CY}
} | kostakos2008the |
arxiv-3433 | 0804.3762 | From formal proofs to mathematical proofs: a safe, incremental way for building in first-order decision procedures | <|reference_start|>From formal proofs to mathematical proofs: a safe, incremental way for building in first-order decision procedures: We investigate here a new version of the Calculus of Inductive Constructions (CIC) on which the proof assistant Coq is based: the Calculus of Congruent Inductive Constructions, which truly extends CIC by building in arbitrary first-order decision procedures: deduction is still in charge of the CIC kernel, while computation is outsourced to dedicated first-order decision procedures that can be taken from the shelves provided they deliver a proof certificate. The soundness of the whole system becomes an incremental property following from the soundness of the certificate checkers and that of the kernel. A detailed example shows that the resulting style of proofs becomes closer to that of the working mathematician.<|reference_end|> | arxiv | @article{blanqui2008from,
title={From formal proofs to mathematical proofs: a safe, incremental way for
building in first-order decision procedures},
author={Fr'ed'eric Blanqui (INRIA Lorraine - LORIA), Jean-Pierre Jouannaud
(LIX, INRIA Saclay Ile de France), Pierre-Yves Strub (LIX, INRIA Saclay Ile
de France)},
journal={Dans TCS 2008 5th IFIP International Conference on Theoretical
Computer Science (2008)},
year={2008},
archivePrefix={arXiv},
eprint={0804.3762},
primaryClass={cs.LO}
} | blanqui2008from |
arxiv-3434 | 0804.3784 | On the metric distortion of nearest-neighbour graphs on random point sets | <|reference_start|>On the metric distortion of nearest-neighbour graphs on random point sets: We study the graph constructed on a Poisson point process in $d$ dimensions by connecting each point to the $k$ points nearest to it. This graph a.s. has an infinite cluster if $k > k_c(d)$ where $k_c(d)$, known as the critical value, depends only on the dimension $d$. This paper presents an improved upper bound of 188 on the value of $k_c(2)$. We also show that if $k \geq 188$ the infinite cluster of $\NN(2,k)$ has an infinite subset of points with the property that the distance along the edges of the graphs between these points is at most a constant multiplicative factor larger than their Euclidean distance. Finally we discuss in detail the relevance of our results to the study of multi-hop wireless sensor networks.<|reference_end|> | arxiv | @article{bagchi2008on,
title={On the metric distortion of nearest-neighbour graphs on random point
sets},
author={Amitabha Bagchi, Sohit Bansal},
journal={arXiv preprint arXiv:0804.3784},
year={2008},
archivePrefix={arXiv},
eprint={0804.3784},
primaryClass={cs.NI cs.CG}
} | bagchi2008on |
arxiv-3435 | 0804.3791 | Towards Usage-based Impact Metrics: - First Results from the MESUR Project | <|reference_start|>Towards Usage-based Impact Metrics: - First Results from the MESUR Project: Scholarly usage data holds the potential to be used as a tool to study the dynamics of scholarship in real time, and to form the basis for the definition of novel metrics of scholarly impact. However, the formal groundwork to reliably and validly exploit usage data is lacking, and the exact nature, meaning and applicability of usage-based metrics is poorly understood. The MESUR project funded by the Andrew W. Mellon Foundation constitutes a systematic effort to define, validate and cross-validate a range of usage-based metrics of scholarly impact. MESUR has collected nearly 1 billion usage events as well as all associated bibliographic and citation data from significant publishers, aggregators and institutional consortia to construct a large-scale usage data reference set. This paper describes some major challenges related to aggregating and processing usage data, and discusses preliminary results obtained from analyzing the MESUR reference data set. The results confirm the intrinsic value of scholarly usage data, and support the feasibility of reliable and valid usage-based metrics of scholarly impact.<|reference_end|> | arxiv | @article{bollen2008towards,
title={Towards Usage-based Impact Metrics: - First Results from the MESUR
Project},
author={Johan Bollen, Herbert Van de Sompel and Marko A. Rodriguez},
journal={arXiv preprint arXiv:0804.3791},
year={2008},
archivePrefix={arXiv},
eprint={0804.3791},
primaryClass={cs.DL}
} | bollen2008towards |
arxiv-3436 | 0804.3796 | Service Cloaking and Authentication at Data Link Layer | <|reference_start|>Service Cloaking and Authentication at Data Link Layer: This paper discusses that there is significant benefit in providing stronger security at lower layers of the network stack for hosts connected to a network. It claims to reduce the attack vulnerability of a networked host by providing security mechanisms in a programmable Network Interface Card (NIC). Dynamic access control mechanisms are implemented in hardware to restrict access to the services provided, only to authenticated hosts. This reduces server vulnerability to various layer 2 attacks. Also the services will be immune to zero-day vulnerabilities due to the minimal code execution paths. To this end, it presents architecture and implementation details of a programmable network interface card equipped with these measures. It works alongside, and augments, existing security protocols making deployment practical.<|reference_end|> | arxiv | @article{p2008service,
title={Service Cloaking and Authentication at Data Link Layer},
author={Arun Kumar S P},
journal={arXiv preprint arXiv:0804.3796},
year={2008},
archivePrefix={arXiv},
eprint={0804.3796},
primaryClass={cs.NI cs.CR}
} | p2008service |
arxiv-3437 | 0804.3814 | Link Enhancer for Vehicular Wireless ATM Communications | <|reference_start|>Link Enhancer for Vehicular Wireless ATM Communications: Majority of the applications used in defense are voice, video and data oriented and has strict QoS requirements. One of the technologies that enabled this is Asynchronous Transfer Mode (ATM) networking. Traditional ATM networks are wired networks. But Tactical networks are meant to be mobile and this necessitates the use of radio relays for Vehicle-to-Infrastructure (V2I) and Vehicle-to-Vehicle (V2V) communications. ATM networks assume a physical link layer BER of 10^-9 or better because of the availability of reliable media like optical fiber links. But this assumption is no longer valid when ATM switches are connected through radio relay where error rates are in the rage of 10^-3. This paper presents the architecture of a Link Enhancer meant to improve the Bit Error Rate of the Wireless links used for V2I and V2V communications from 1 in 10^4 to 1 in 10^8<|reference_end|> | arxiv | @article{p2008link,
title={Link Enhancer for Vehicular Wireless ATM Communications},
author={Arun Kumar S P, Diganta Baishya, Amrendra Kumar},
journal={arXiv preprint arXiv:0804.3814},
year={2008},
archivePrefix={arXiv},
eprint={0804.3814},
primaryClass={cs.NI cs.PF}
} | p2008link |
arxiv-3438 | 0804.3817 | Multiple Random Oracles Are Better Than One | <|reference_start|>Multiple Random Oracles Are Better Than One: We study the problem of learning k-juntas given access to examples drawn from a number of different product distributions. Thus we wish to learn a function f : {-1,1}^n -> {-1,1} that depends on k (unknown) coordinates. While the best known algorithms for the general problem of learning a k-junta require running time of n^k * poly(n,2^k), we show that given access to k different product distributions with biases separated by \gamma>0, the functions may be learned in time poly(n,2^k,\gamma^{-k}). More generally, given access to t <= k different product distributions, the functions may be learned in time n^{k/t} * poly(n,2^k,\gamma^{-k}). Our techniques involve novel results in Fourier analysis relating Fourier expansions with respect to different biases and a generalization of Russo's formula.<|reference_end|> | arxiv | @article{arpe2008multiple,
title={Multiple Random Oracles Are Better Than One},
author={Jan Arpe and Elchanan Mossel},
journal={arXiv preprint arXiv:0804.3817},
year={2008},
archivePrefix={arXiv},
eprint={0804.3817},
primaryClass={cs.LG}
} | arpe2008multiple |
arxiv-3439 | 0804.3825 | On the inner and outer bounds for 2-receiver discrete memoryless broadcast channels | <|reference_start|>On the inner and outer bounds for 2-receiver discrete memoryless broadcast channels: We study the best known general inner bound[MAR '79] and outer bound[N-EG'07] for the capacity region of the two user discrete memory less channel. We prove that a seemingly stronger outer bound is identical to a weaker form of the outer bound that was also presented in [N-EG'07]. We are able to further express the best outer bound in a form that is computable, i.e. there are bounds on the cardinalities of the auxiliary random variables. The inner and outer bounds coincide for all channels for which the capacity region is known and it is not known whether the regions described by these bounds are same or different. We present a channel, where assuming a certain conjecture backed by simulations and partial theoretical results, one can show that the bounds are different.<|reference_end|> | arxiv | @article{nair2008on,
title={On the inner and outer bounds for 2-receiver discrete memoryless
broadcast channels},
author={Chandra Nair and Vincent Wang Zizhou},
journal={arXiv preprint arXiv:0804.3825},
year={2008},
archivePrefix={arXiv},
eprint={0804.3825},
primaryClass={cs.IT math.IT}
} | nair2008on |
arxiv-3440 | 0804.3860 | An $\tildeO(n^25)$-Time Algorithm for Online Topological Ordering | <|reference_start|>An $\tildeO(n^25)$-Time Algorithm for Online Topological Ordering: We present an $\tilde{O}(n^{2.5})$-time algorithm for maintaining the topological order of a directed acyclic graph with $n$ vertices while inserting $m$ edges.<|reference_end|> | arxiv | @article{liu2008an,
title={An $\tilde{O}(n^{2.5})$-Time Algorithm for Online Topological Ordering},
author={Hsiao-Fei Liu and Kun-Mao Chao},
journal={arXiv preprint arXiv:0804.3860},
year={2008},
archivePrefix={arXiv},
eprint={0804.3860},
primaryClass={cs.GT cs.DS}
} | liu2008an |
arxiv-3441 | 0804.3862 | Image Processing in Optical Guidance for Autonomous Landing of Lunar Probe | <|reference_start|>Image Processing in Optical Guidance for Autonomous Landing of Lunar Probe: Because of the communication delay between earth and moon, the GNC technology of lunar probe is becoming more important than ever. Current navigation technology is not able to provide precise motion estimation for probe landing control system Computer vision offers a new approach to solve this problem. In this paper, author introduces an image process algorithm of computer vision navigation for autonomous landing of lunar probe. The purpose of the algorithm is to detect and track feature points which are factors of navigation. Firstly, fixation areas are detected as sub-images and matched. Secondly, feature points are extracted from sub-images and tracked. Computer simulation demonstrates the result of algorithm takes less computation and fulfils requests of navigation algorithm.<|reference_end|> | arxiv | @article{meng2008image,
title={Image Processing in Optical Guidance for Autonomous Landing of Lunar
Probe},
author={Ding Meng, Cao Yun-feng, Wu Qing-xian and Zhang Zhen},
journal={Proceedings of International Conference on Intelligent Unmanned
System (ICIUS 2007), Bali, Indonesia, October 24-25, 2007, ICIUS2007-A001},
year={2008},
archivePrefix={arXiv},
eprint={0804.3862},
primaryClass={cs.RO}
} | meng2008image |
arxiv-3442 | 0804.3868 | Comparison of Various Methods for the Calculation of the Distance Potential Field | <|reference_start|>Comparison of Various Methods for the Calculation of the Distance Potential Field: The distance from a given position toward one or more destinations, exits, and way points is a more or less important input variable in most models of pedestrian dynamics. Except for the special case when there are no obstacles in a concave scenario -- i.e. each position is visible from any other -- the calculation of these distances is a non-trivial task. This isn't that big a problem, as long as the model only demands the distances to be stored in a Static Floor Field also called Potential Field, which never changes throughout the whole simulation. In this case a pre-calculation once before the simulation starts is sufficient. But if one wants to allow changes of the geometry during a simulation run -- imagine doors or the blocking of a corridor due to some hazard -- in the Distance Potential Field, calculation time matters strongly. This contribution gives an overview over existing and new exact and approximate methods to calculate a potential field, analytical investigations for their exactness, and tests of their computation speed. The advantages and drawbacks of the methods are discussed.<|reference_end|> | arxiv | @article{kretz2008comparison,
title={Comparison of Various Methods for the Calculation of the Distance
Potential Field},
author={Tobias Kretz, Cornelia B"onisch, and Peter Vortisch},
journal={Pedestrian and Evacuation Dynamics 2008 (2010), Part 2, 335-346},
year={2008},
doi={10.1007/978-3-642-04504-2_29},
archivePrefix={arXiv},
eprint={0804.3868},
primaryClass={physics.comp-ph cs.MA physics.soc-ph}
} | kretz2008comparison |
arxiv-3443 | 0804.3874 | Hardware In The Loop Simulator in UAV Rapid Development Life Cycle | <|reference_start|>Hardware In The Loop Simulator in UAV Rapid Development Life Cycle: Field trial is very critical and high risk in autonomous UAV development life cycle. Hardware in the loop (HIL) simulation is a computer simulation that has the ability to simulate UAV flight characteristic, sensor modeling and actuator modeling while communicating in real time with the UAV autopilot hardware. HIL simulation can be used to test the UAV autopilot hardware reliability, test the closed loop performance of the overall system and tuning the control parameter. By rigorous testing in the HIL simulator, the risk in the field trial can be minimized.<|reference_end|> | arxiv | @article{adiprawita2008hardware,
title={Hardware In The Loop Simulator in UAV Rapid Development Life Cycle},
author={Widyawardana Adiprawita, Adang Suwandi Ahmad, and Jaka Semibiring},
journal={Proceedings of the International Conference on Intelligent
Unmanned System (ICIUS 2007), Bali, Indonesia, October 24-25, 2007, Paper No.
ICIUS2007-A006},
year={2008},
archivePrefix={arXiv},
eprint={0804.3874},
primaryClass={cs.RO}
} | adiprawita2008hardware |
arxiv-3444 | 0804.3879 | Effects of Leaders Position and Shape on Aerodynamic Performances of V Flight Formation | <|reference_start|>Effects of Leaders Position and Shape on Aerodynamic Performances of V Flight Formation: The influences of the leader in a group of V flight formation are dealt with. The investigation is focused on the effect of its position and shape on aerodynamics performances of a given V flight formation. Vortices generated the wing tip of the leader moves downstream forming a pair of opposite rotating line vortices. These vortices are generally undesirable because they create a downwash that increases the induced drag on leaders wing. However, this downwash is also accompanied by an upwash that can beneficial to the followers wing flying behind the leaders one, namely a favorable lift for the followers wing. How much contributions of the leaders wing to the followers wing in the V formation flight is determined by the strength of tip vortices generated by the leaders wing which is influenced by its position and shape including incidence angle, dihedral angle, aspect ratio and taper ratio. The prediction of aerodynamic performances of the V flight formation including lift, drag and moment coefficients is numerically performed by solving Navier Stokes equations with k e turbulence model. The computational domain is defined with multiblock topology to capture the complex geometry arrangement of the V flight formation.<|reference_end|> | arxiv | @article{thien2008effects,
title={Effects of Leaders Position and Shape on Aerodynamic Performances of V
Flight Formation},
author={H.P.Thien, M.A.Moelyadi, and H. Muhammad},
journal={Proceedings of the International Conference on Intelligent
Unmanned System (ICIUS 2007), Bali, Indonesia, October 24-25, 2007, Paper No.
ICIUS2007-A008},
year={2008},
archivePrefix={arXiv},
eprint={0804.3879},
primaryClass={cs.RO}
} | thien2008effects |
arxiv-3445 | 0804.3881 | Automated Flight Test and System Identification for Rotary Wing Small Aerial Platform using Frequency Responses Analysis | <|reference_start|>Automated Flight Test and System Identification for Rotary Wing Small Aerial Platform using Frequency Responses Analysis: This paper proposes an autopilot system that can be used to control the small scale rotorcraft during the flight test for linear-frequency-domain system identification. The input frequency swept is generated automatically as part of the autopilot control command. Therefore the bandwidth coverage and consistency of the frequency swept is guaranteed to produce high quality data for system identification. Beside that we can set the safety parameter during the flight test (maximum roll or pitch value, minimum altitude, etc) so the safety of the whole flight test is guaranteed. This autopilot for automated flight test will be tested using hardware in the loop simulator for hover flight condition.<|reference_end|> | arxiv | @article{adiprawita2008automated,
title={Automated Flight Test and System Identification for Rotary Wing Small
Aerial Platform using Frequency Responses Analysis},
author={Widyawardana Adiprawita, Adang Suwandi Ahmad, and Jaka Semibiring},
journal={Proceedings of the International Conference on Intelligent
Unmanned System (ICIUS 2007), Bali, Indonesia, October 24-25, 2007, Paper No.
ICIUS2007-A009},
year={2008},
archivePrefix={arXiv},
eprint={0804.3881},
primaryClass={cs.RO}
} | adiprawita2008automated |
arxiv-3446 | 0804.3882 | Virtual Reality Simulation of Fire Fighting Robot Dynamic and Motion | <|reference_start|>Virtual Reality Simulation of Fire Fighting Robot Dynamic and Motion: This paper presents one approach in designing a Fire Fighting Robot which has been contested annually in a robotic student competition in many countries following the rules initiated at the Trinity College. The approach makes use of computer simulation and animation in a virtual reality environment. In the simulation, the amount of time, starting from home until the flame is destroyed, can be confirmed. The efficacy of algorithms and parameter values employed can be easily evaluated. Rather than spending time building the real robot in a trial and error fashion, now students can explore more variation of algorithm, parameter and sensor-actuator configuration in the early stage of design. Besides providing additional excitement during learning process and enhancing students understanding to the engineering aspects of the design, this approach could become a useful tool to increase the chance of winning the contest.<|reference_end|> | arxiv | @article{setiawan2008virtual,
title={Virtual Reality Simulation of Fire Fighting Robot Dynamic and Motion},
author={Joga D. Setiawan, Mochamad Subchan, and Agus Budiyono},
journal={Proceedings of the International Conference on Intelligent
Unmanned System (ICIUS 2007), Bali, Indonesia, October 24-25, 2007, Paper No.
ICIUS2007-A010},
year={2008},
archivePrefix={arXiv},
eprint={0804.3882},
primaryClass={cs.RO}
} | setiawan2008virtual |
arxiv-3447 | 0804.3885 | Heading Lock Maneuver Testing of Autonomous Underwater Vehicle | <|reference_start|>Heading Lock Maneuver Testing of Autonomous Underwater Vehicle: In recent years, Autonomous Underwater Vehicle (UAV) research and development at Bandung Institute of Technology in Indonesia has achieved the testing stage in the field. This testing was still being classified as the early testing, since some of the preliminary tests were carried out in the scale of the laboratory. The paper would discuss the laboratory test and several tests that were done in the field. Discussions were stressed in the procedure and the aim that will be achieved, along with several early results. The testing was carried out in the lake with the area around 8300 Ha and the maximum depth of 50 meters. The location of the testing was chosen with consideration of minimizing the effect of the current and the wave, as well as the location that was not too far from the Laboratory. The type of testing that will be discussed in paper was Heading Lock Maneuver Testing. The vehicle was tested to move with a certain cruising speed, afterwards it was commanded by an arbitrarily selected heading direction. The response and the behavior of the vehicle were recorded as the data produced by the testing.<|reference_end|> | arxiv | @article{muljowidodo2008heading,
title={Heading Lock Maneuver Testing of Autonomous Underwater Vehicle},
author={K. Muljowidodo, and N. Sapto Adi},
journal={Proceedings of the International Conference on Intelligent
Unmanned System (ICIUS 2007), Bali, Indonesia, October 24-25, 2007, Paper No.
ICIUS2007-A014},
year={2008},
archivePrefix={arXiv},
eprint={0804.3885},
primaryClass={cs.RO}
} | muljowidodo2008heading |
arxiv-3448 | 0804.3891 | Development of Architectures for Internet Telerobotics Systems | <|reference_start|>Development of Architectures for Internet Telerobotics Systems: This paper presents our experience in developing and implementing Internet telerobotics system. Internet telerobotics system refers to a robot system controlled and monitored remotely through the Internet. A robot manipulator with five degrees of freedom, called Mentor, is employed. Client-server architecture is chosen as a platform for our Internet telerobotics system. Three generations of telerobotics systems have evolved in this research. The first generation was based on CGI and two tiered architecture, where a client presents a Graphical User Interface to the user, and utilizes the user's data entry and actions to perform requests to robot server running on a different machine. The second generation was developed using Java. We also employ Java 3D for creating and manipulating 3D geometry of manipulator links and for constructing the structures used in rendering that geometry, resulting in 3D robot movement simulation presented to the users(clients) through their web browser. Recent development in our Internet telerobotics includes object recognition through image captured by a camera, which poses challenging problem, given the undeterministic latency of the Internet. The third generation is centered around the use of CORBA for development platform of distributed internet telerobotics system, aimed at distributing task of telerobotics system.<|reference_end|> | arxiv | @article{bambang2008development,
title={Development of Architectures for Internet Telerobotics Systems},
author={Riyanto Bambang},
journal={Proceedings of the International Conference on Intelligent
Unmanned System (ICIUS 2007), Bali, Indonesia, October 24-25, 2007, Paper No.
ICIUS2007-B004},
year={2008},
archivePrefix={arXiv},
eprint={0804.3891},
primaryClass={cs.RO}
} | bambang2008development |
arxiv-3449 | 0804.3894 | Unmanned Aerial Vehicle Instrumentation for Rapid Aerial Photo System | <|reference_start|>Unmanned Aerial Vehicle Instrumentation for Rapid Aerial Photo System: This research will proposed a new kind of relatively low cost autonomous UAV that will enable farmers to make just in time mosaics of aerial photo of their crop. These mosaics of aerial photo should be able to be produced with relatively low cost and within the 24 hours of acquisition constraint. The autonomous UAV will be equipped with payload management system specifically developed for rapid aerial mapping. As mentioned before turn around time is the key factor, so accuracy is not the main focus (not orthorectified aerial mapping). This system will also be equipped with special software to post process the aerial photos to produce the mosaic aerial photo map<|reference_end|> | arxiv | @article{adiprawita2008unmanned,
title={Unmanned Aerial Vehicle Instrumentation for Rapid Aerial Photo System},
author={Widyawardana Adiprawita, Adang Suwandi Ahmad, and Jaka Semibiring},
journal={Proceedings of the International Conference on Intelligent
Unmanned System (ICIUS 2007), Bali, Indonesia, October 24-25, 2007, Paper No.
ICIUS2007-A020-P},
year={2008},
archivePrefix={arXiv},
eprint={0804.3894},
primaryClass={cs.RO}
} | adiprawita2008unmanned |
arxiv-3450 | 0804.3895 | First Principle Approach to Modeling of Small Scale Helicopter | <|reference_start|>First Principle Approach to Modeling of Small Scale Helicopter: The establishment of global helicopter linear model is very precious and useful for the design of the linear control laws, since it is never afforded in the published literatures. In the first principle approach, the mathematical model was developed using basic helicopter theory accounting for particular characteristic of the miniature helicopter. No formal system identification procedures are required for the proposed model structure. The relevant published literatures however did not present the linear models required for the design of linear control laws. The paper presents a step by step development of linear model for small scale helicopter based on first-principle approach. Beyond the previous work in literatures, the calculation of the stability derivatives is presented in detail. A computer program is used to solve the equilibrium conditions and then calculate the change in aerodynamics forces and moments due to the change in each degree of freedom and control input. The detail derivation allows the comprehensive analysis of relative dominance of vehicle states and input variables to force and moment components. Hence it facilitates the development of minimum complexity small scale helicopter dynamics model.<|reference_end|> | arxiv | @article{budiyono2008first,
title={First Principle Approach to Modeling of Small Scale Helicopter},
author={A. Budiyono, T. Sudiyanto, and H. Lesmana},
journal={Proceedings of the International Conference on Intelligent
Unmanned System (ICIUS 2007), Bali, Indonesia, October 24-25, 2007, Paper No.
ICIUS2007-A019-P},
year={2008},
archivePrefix={arXiv},
eprint={0804.3895},
primaryClass={cs.RO}
} | budiyono2008first |
arxiv-3451 | 0804.3897 | Optimal Tracking Controller Design for a Small Scale Helicopter | <|reference_start|>Optimal Tracking Controller Design for a Small Scale Helicopter: A model helicopter is more difficult to control than its full scale counterparts. This is due to its greater sensitivity to control inputs and disturbances as well as higher bandwidth of dynamics. This works is focused on designing practical tracking controller for a small scale helicopter following predefined trajectories. A tracking controller based on optimal control theory is synthesized as part of the development of an autonomous helicopter. Some issues in regards to control constraints are addressed. The weighting between state tracking performance and control power expenditure is analyzed. Overall performance of the control design is evaluated based on its time domain histories of trajectories as well as control inputs.<|reference_end|> | arxiv | @article{budiyono2008optimal,
title={Optimal Tracking Controller Design for a Small Scale Helicopter},
author={Agus Budiyono, and Singgih S. Wibowo},
journal={Proceedings of the International Conference on Intelligent
Unmanned System (ICIUS 2007), Bali, Indonesia, October 24-25, 2007, Paper No.
ICIUS2007-A018-P},
year={2008},
archivePrefix={arXiv},
eprint={0804.3897},
primaryClass={cs.RO}
} | budiyono2008optimal |
arxiv-3452 | 0804.3902 | Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms | <|reference_start|>Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms: The Min Energy broadcast problem consists in assigning transmission ranges to the nodes of an ad-hoc network in order to guarantee a directed spanning tree from a given source node and, at the same time, to minimize the energy consumption (i.e. the energy cost) yielded by the range assignment. Min energy broadcast is known to be NP-hard. We consider random-grid networks where nodes are chosen independently at random from the $n$ points of a $\sqrt n \times \sqrt n$ square grid in the plane. The probability of the existence of a node at a given point of the grid does depend on that point, that is, the probability distribution can be non-uniform. By using information-theoretic arguments, we prove a lower bound $(1-\epsilon) \frac n{\pi}$ on the energy cost of any feasible solution for this problem. Then, we provide an efficient solution of energy cost not larger than $1.1204 \frac n{\pi}$. Finally, we present a fully-distributed protocol that constructs a broadcast range assignment of energy cost not larger than $8n$,thus still yielding constant approximation. The energy load is well balanced and, at the same time, the work complexity (i.e. the energy due to all message transmissions of the protocol) is asymptotically optimal. The completion time of the protocol is only an $O(\log n)$ factor slower than the optimum. The approximation quality of our distributed solution is also experimentally evaluated. All bounds hold with probability at least $1-1/n^{\Theta(1)}$.<|reference_end|> | arxiv | @article{calamoneri2008minimum-energy,
title={Minimum-energy broadcast in random-grid ad-hoc networks: approximation
and distributed algorithms},
author={Tiziana Calamoneri, Andrea E.F. Clementi, Angelo Monti, Gianluca
Rossi, Riccardo Silvestri},
journal={arXiv preprint arXiv:0804.3902},
year={2008},
archivePrefix={arXiv},
eprint={0804.3902},
primaryClass={cs.DS}
} | calamoneri2008minimum-energy |
arxiv-3453 | 0804.3914 | Reasoning in Abella about Structural Operational Semantics Specifications | <|reference_start|>Reasoning in Abella about Structural Operational Semantics Specifications: The approach to reasoning about structural operational semantics style specifications supported by the Abella system is discussed. This approach uses lambda tree syntax to treat object language binding and encodes binding related properties in generic judgments. Further, object language specifications are embedded directly into the reasoning framework through recursive definitions. The treatment of binding via generic judgments implicitly enforces distinctness and atomicity in the names used for bound variables. These properties must, however, be made explicit in reasoning tasks. This objective can be achieved by allowing recursive definitions to also specify generic properties of atomic predicates. The utility of these various logical features in the Abella system is demonstrated through actual reasoning tasks. Brief comparisons with a few other logic based approaches are also made.<|reference_end|> | arxiv | @article{gacek2008reasoning,
title={Reasoning in Abella about Structural Operational Semantics
Specifications},
author={Andrew Gacek, Dale Miller, Gopalan Nadathur},
journal={arXiv preprint arXiv:0804.3914},
year={2008},
archivePrefix={arXiv},
eprint={0804.3914},
primaryClass={cs.LO cs.PL}
} | gacek2008reasoning |
arxiv-3454 | 0804.3947 | Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas | <|reference_start|>Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas: Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks with time-dependent edge weights. This is the first hierarchical speedup technique for time-dependent routing that allows bidirectional query algorithms.<|reference_end|> | arxiv | @article{sanders2008time,
title={Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas},
author={Peter Sanders},
journal={arXiv preprint arXiv:0804.3947},
year={2008},
archivePrefix={arXiv},
eprint={0804.3947},
primaryClass={cs.DS}
} | sanders2008time |
arxiv-3455 | 0804.4039 | Energy and Time Efficient Scheduling of Tasks with Dependencies on Asymmetric Multiprocessors | <|reference_start|>Energy and Time Efficient Scheduling of Tasks with Dependencies on Asymmetric Multiprocessors: In this work we study the problem of scheduling tasks with dependencies in multiprocessor architectures where processors have different speeds. We present the preemptive algorithm "Save-Energy" that given a schedule of tasks it post processes it to improve the energy efficiency without any deterioration of the makespan. In terms of time efficiency, we show that preemptive scheduling in an asymmetric system can achieve the same or better optimal makespan than in a symmetric system. Motivited by real multiprocessor systems, we investigate architectures that exhibit limited asymmetry: there are two essentially different speeds. Interestingly, this special case has not been studied in the field of parallel computing and scheduling theory; only the general case was studied where processors have $K$ essentially different speeds. We present the non-preemptive algorithm ``Remnants'' that achieves almost optimal makespan. We provide a refined analysis of a recent scheduling method. Based on this analysis, we specialize the scheduling policy and provide an algorithm of $(3 + o(1))$ expected approximation factor. Note that this improves the previous best factor (6 for two speeds). We believe that our work will convince researchers to revisit this well studied scheduling problem for these simple, yet realistic, asymmetric multiprocessor architectures.<|reference_end|> | arxiv | @article{chatzigiannakis2008energy,
title={Energy and Time Efficient Scheduling of Tasks with Dependencies on
Asymmetric Multiprocessors},
author={Ioannis Chatzigiannakis, Georgios Giannoulis and Paul G. Spirakis},
journal={arXiv preprint arXiv:0804.4039},
year={2008},
number={RACTI-RU1-2008-10},
archivePrefix={arXiv},
eprint={0804.4039},
primaryClass={cs.DC cs.DS cs.PF}
} | chatzigiannakis2008energy |
arxiv-3456 | 0804.4042 | Uncorrectable Errors of Weight Half the Minimum Distance for Binary Linear Codes | <|reference_start|>Uncorrectable Errors of Weight Half the Minimum Distance for Binary Linear Codes: A lower bound on the number of uncorrectable errors of weight half the minimum distance is derived for binary linear codes satisfying some condition. The condition is satisfied by some primitive BCH codes, extended primitive BCH codes, Reed-Muller codes, and random linear codes. The bound asymptotically coincides with the corresponding upper bound for Reed-Muller codes and random linear codes. By generalizing the idea of the lower bound, a lower bound on the number of uncorrectable errors for weights larger than half the minimum distance is also obtained, but the generalized lower bound is weak for large weights. The monotone error structure and its related notion larger half and trial set, which are introduced by Helleseth, Kl{\o}ve, and Levenshtein, are mainly used to derive the bounds.<|reference_end|> | arxiv | @article{yasunaga2008uncorrectable,
title={Uncorrectable Errors of Weight Half the Minimum Distance for Binary
Linear Codes},
author={Kenji Yasunaga, Toru Fujiwara},
journal={arXiv preprint arXiv:0804.4042},
year={2008},
archivePrefix={arXiv},
eprint={0804.4042},
primaryClass={cs.IT math.IT}
} | yasunaga2008uncorrectable |
arxiv-3457 | 0804.4071 | Logic Mining Using Neural Networks | <|reference_start|>Logic Mining Using Neural Networks: Knowledge could be gained from experts, specialists in the area of interest, or it can be gained by induction from sets of data. Automatic induction of knowledge from data sets, usually stored in large databases, is called data mining. Data mining methods are important in the management of complex systems. There are many technologies available to data mining practitioners, including Artificial Neural Networks, Regression, and Decision Trees. Neural networks have been successfully applied in wide range of supervised and unsupervised learning applications. Neural network methods are not commonly used for data mining tasks, because they often produce incomprehensible models, and require long training times. One way in which the collective properties of a neural network may be used to implement a computational task is by way of the concept of energy minimization. The Hopfield network is well-known example of such an approach. The Hopfield network is useful as content addressable memory or an analog computer for solving combinatorial-type optimization problems. Wan Abdullah [1] proposed a method of doing logic programming on a Hopfield neural network. Optimization of logical inconsistency is carried out by the network after the connection strengths are defined from the logic program; the network relaxes to neural states corresponding to a valid interpretation. In this article, we describe how Hopfield network is able to induce logical rules from large database by using reverse analysis method: given the values of the connections of a network, we can hope to know what logical rules are entrenched in the database.<|reference_end|> | arxiv | @article{sathasivam2008logic,
title={Logic Mining Using Neural Networks},
author={Saratha Sathasivam (USM), Wan Ahmad Tajuddin Wan Abdullah (Univ
Malaya)},
journal={arXiv preprint arXiv:0804.4071},
year={2008},
archivePrefix={arXiv},
eprint={0804.4071},
primaryClass={cs.LO cs.NE}
} | sathasivam2008logic |
arxiv-3458 | 0804.4073 | Grainy Numbers | <|reference_start|>Grainy Numbers: Grainy numbers are defined as tuples of bits. They form a lattice where the meet and the join operations are an addition and a multiplication. They may be substituted for the real numbers in the definition of fuzzy sets. The aim is to propose an alternative negation for the complement that we'll call supplement.<|reference_end|> | arxiv | @article{champenois2008grainy,
title={Grainy Numbers},
author={Gilles Champenois},
journal={arXiv preprint arXiv:0804.4073},
year={2008},
archivePrefix={arXiv},
eprint={0804.4073},
primaryClass={cs.LO cs.AI}
} | champenois2008grainy |
arxiv-3459 | 0804.4075 | Logic Learning in Hopfield Networks | <|reference_start|>Logic Learning in Hopfield Networks: Synaptic weights for neurons in logic programming can be calculated either by using Hebbian learning or by Wan Abdullah's method. In other words, Hebbian learning for governing events corresponding to some respective program clauses is equivalent with learning using Wan Abdullah's method for the same respective program clauses. In this paper we will evaluate experimentally the equivalence between these two types of learning through computer simulations.<|reference_end|> | arxiv | @article{sathasivam2008logic,
title={Logic Learning in Hopfield Networks},
author={Saratha Sathasivam (USM), Wan Ahmad Tajuddin Wan Abdullah (Univ
Malaya)},
journal={arXiv preprint arXiv:0804.4075},
year={2008},
archivePrefix={arXiv},
eprint={0804.4075},
primaryClass={cs.LO cs.NE}
} | sathasivam2008logic |
arxiv-3460 | 0804.4116 | Design and Implementation of a Tracer Driver: Easy and Efficient Dynamic Analyses of Constraint Logic Programs | <|reference_start|>Design and Implementation of a Tracer Driver: Easy and Efficient Dynamic Analyses of Constraint Logic Programs: Tracers provide users with useful information about program executions. In this article, we propose a ``tracer driver''. From a single tracer, it provides a powerful front-end enabling multiple dynamic analysis tools to be easily implemented, while limiting the overhead of the trace generation. The relevant execution events are specified by flexible event patterns and a large variety of trace data can be given either systematically or ``on demand''. The proposed tracer driver has been designed in the context of constraint logic programming; experiments have been made within GNU-Prolog. Execution views provided by existing tools have been easily emulated with a negligible overhead. Experimental measures show that the flexibility and power of the described architecture lead to good performance. The tracer driver overhead is inversely proportional to the average time between two traced events. Whereas the principles of the tracer driver are independent of the traced programming language, it is best suited for high-level languages, such as constraint logic programming, where each traced execution event encompasses numerous low-level execution steps. Furthermore, constraint logic programming is especially hard to debug. The current environments do not provide all the useful dynamic analysis tools. They can significantly benefit from our tracer driver which enables dynamic analyses to be integrated at a very low cost.<|reference_end|> | arxiv | @article{langevine2008design,
title={Design and Implementation of a Tracer Driver: Easy and Efficient Dynamic
Analyses of Constraint Logic Programs},
author={Ludovic Langevine and Mireille Ducasse},
journal={arXiv preprint arXiv:0804.4116},
year={2008},
archivePrefix={arXiv},
eprint={0804.4116},
primaryClass={cs.SE cs.PL}
} | langevine2008design |
arxiv-3461 | 0804.4138 | Sketching and Streaming Entropy via Approximation Theory | <|reference_start|>Sketching and Streaming Entropy via Approximation Theory: We conclude a sequence of work by giving near-optimal sketching and streaming algorithms for estimating Shannon entropy in the most general streaming model, with arbitrary insertions and deletions. This improves on prior results that obtain suboptimal space bounds in the general model, and near-optimal bounds in the insertion-only model without sketching. Our high-level approach is simple: we give algorithms to estimate Renyi and Tsallis entropy, and use them to extrapolate an estimate of Shannon entropy. The accuracy of our estimates is proven using approximation theory arguments and extremal properties of Chebyshev polynomials, a technique which may be useful for other problems. Our work also yields the best-known and near-optimal additive approximations for entropy, and hence also for conditional entropy and mutual information.<|reference_end|> | arxiv | @article{harvey2008sketching,
title={Sketching and Streaming Entropy via Approximation Theory},
author={Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak},
journal={arXiv preprint arXiv:0804.4138},
year={2008},
archivePrefix={arXiv},
eprint={0804.4138},
primaryClass={cs.DS}
} | harvey2008sketching |
arxiv-3462 | 0804.4150 | On Computing the Shadows and Slices of Polytopes | <|reference_start|>On Computing the Shadows and Slices of Polytopes: We study the complexity of computing the projection of an arbitrary $d$-polytope along $k$ orthogonal vectors for various input and output forms. We show that if $d$ and $k$ are part of the input (i.e. not a constant) and we are interested in output-sensitive algorithms, then in most forms the problem is equivalent to enumerating vertices of polytopes, except in two where it is NP-hard. In two other forms the problem is trivial. We also review the complexity of computing projections when the projection directions are in some sense non-degenerate. For full-dimensional polytopes containing origin in the interior, projection is an operation dual to intersecting the polytope with a suitable linear subspace and so the results in this paper can be dualized by interchanging vertices with facets and projection with intersection. To compare the complexity of projection and vertex enumeration, we define new complexity classes based on the complexity of Vertex Enumeration.<|reference_end|> | arxiv | @article{tiwary2008on,
title={On Computing the Shadows and Slices of Polytopes},
author={Hans Raj Tiwary},
journal={arXiv preprint arXiv:0804.4150},
year={2008},
archivePrefix={arXiv},
eprint={0804.4150},
primaryClass={cs.CC cs.CG}
} | tiwary2008on |
arxiv-3463 | 0804.4187 | On the Asymptotic Behavior of Selfish Transmitters Sharing a Common Channel | <|reference_start|>On the Asymptotic Behavior of Selfish Transmitters Sharing a Common Channel: This paper analyzes the asymptotic behavior of a multiple-access network comprising a large number of selfish transmitters competing for access to a common wireless communication channel, and having different utility functions for determining their strategies. A necessary and sufficient condition is given for the total number of packet arrivals from selfish transmitters to converge in distribution. The asymptotic packet arrival distribution at Nash equilibrium is shown to be a mixture of a Poisson distribution and finitely many Bernoulli distributions.<|reference_end|> | arxiv | @article{inaltekin2008on,
title={On the Asymptotic Behavior of Selfish Transmitters Sharing a Common
Channel},
author={Hazer Inaltekin, Mung Chiang, Harold Vincent Poor and Stephen B.
Wicker},
journal={arXiv preprint arXiv:0804.4187},
year={2008},
doi={10.1109/ISIT.2008.4595345},
archivePrefix={arXiv},
eprint={0804.4187},
primaryClass={cs.IT cs.GT math.IT}
} | inaltekin2008on |
arxiv-3464 | 0804.4194 | Asymptotic Bound on Binary Self-Orthogonal Codes | <|reference_start|>Asymptotic Bound on Binary Self-Orthogonal Codes: We present two constructions for binary self-orthogonal codes. It turns out that our constructions yield a constructive bound on binary self-orthogonal codes. In particular, when the information rate R=1/2, by our constructive lower bound, the relative minimum distance \delta\approx 0.0595 (for GV bound, \delta\approx 0.110). Moreover, we have proved that the binary self-orthogonal codes asymptotically achieve the Gilbert-Varshamov bound.<|reference_end|> | arxiv | @article{ding2008asymptotic,
title={Asymptotic Bound on Binary Self-Orthogonal Codes},
author={Yang Ding},
journal={arXiv preprint arXiv:0804.4194},
year={2008},
doi={10.1007/s11425-008-0133-9},
archivePrefix={arXiv},
eprint={0804.4194},
primaryClass={cs.IT math.IT}
} | ding2008asymptotic |
arxiv-3465 | 0804.4195 | Multi-Antenna Gaussian Broadcast Channels with Confidential Messages | <|reference_start|>Multi-Antenna Gaussian Broadcast Channels with Confidential Messages: In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of secret communication over a Gaussian broadcast channel, where a multi-antenna transmitter sends independent confidential messages to two users with \emph{information-theoretic secrecy}. That is, each user would like to obtain its own confidential message in a reliable and safe manner. This communication model is referred to as the multi-antenna Gaussian broadcast channel with confidential messages (MGBC-CM). Under this communication scenario, a secret dirty-paper coding scheme and the corresponding achievable secrecy rate region are first developed based on Gaussian codebooks. Next, a computable Sato-type outer bound on the secrecy capacity region is provided for the MGBC-CM. Furthermore, the Sato-type outer bound proves to be consistent with the boundary of the secret dirty-paper coding achievable rate region, and hence, the secrecy capacity region of the MGBC-CM is established. Finally, a numerical example demonstrates that both users can achieve positive rates simultaneously under the information-theoretic secrecy requirement.<|reference_end|> | arxiv | @article{liu2008multi-antenna,
title={Multi-Antenna Gaussian Broadcast Channels with Confidential Messages},
author={Ruoheng Liu and H. Vincent Poor},
journal={arXiv preprint arXiv:0804.4195},
year={2008},
archivePrefix={arXiv},
eprint={0804.4195},
primaryClass={cs.IT cs.CR math.IT}
} | liu2008multi-antenna |
arxiv-3466 | 0804.4204 | Distance Distributions in Finite Uniformly Random Networks: Theory and Applications | <|reference_start|>Distance Distributions in Finite Uniformly Random Networks: Theory and Applications: In wireless networks, the knowledge of nodal distances is essential for several areas such as system configuration, performance analysis and protocol design. In order to evaluate distance distributions in random networks, the underlying nodal arrangement is almost universally taken to be an infinite Poisson point process. While this assumption is valid in some cases, there are also certain impracticalities to this model. For example, practical networks are non-stationary, and the number of nodes in disjoint areas are not independent. This paper considers a more realistic network model where a finite number of nodes are uniformly randomly distributed in a general d-dimensional ball of radius R and characterizes the distribution of Euclidean distances in the system. The key result is that the probability density function of the distance from the center of the network to its nth nearest neighbor follows a generalized beta distribution. This finding is applied to study network characteristics such as energy consumption, interference, outage and connectivity.<|reference_end|> | arxiv | @article{srinivasa2008distance,
title={Distance Distributions in Finite Uniformly Random Networks: Theory and
Applications},
author={Sunil Srinivasa and Martin Haenggi},
journal={arXiv preprint arXiv:0804.4204},
year={2008},
archivePrefix={arXiv},
eprint={0804.4204},
primaryClass={cs.IT math.IT}
} | srinivasa2008distance |
arxiv-3467 | 0804.4237 | Explaining the Logical Nature of Electrical Solitons in Neural Circuits | <|reference_start|>Explaining the Logical Nature of Electrical Solitons in Neural Circuits: Neurons are modeled electrically based on ferroelectric membranes thin enough to permit charge transfer, conjectured to be the tunneling result of thermally energetic ions and random electrons. These membranes can be triggered to produce electrical solitons, the main signals for brain associative memory and logical processing. Dendritic circuits are modeled, and electrical solitons are simulated to demonstrate the nature of soliton propagation, soliton reflection, the collision of solitons, as well as soliton OR gates, AND gates, XOR gates and NOT gates.<|reference_end|> | arxiv | @article{burger2008explaining,
title={Explaining the Logical Nature of Electrical Solitons in Neural Circuits},
author={John Robert Burger},
journal={arXiv preprint arXiv:0804.4237},
year={2008},
archivePrefix={arXiv},
eprint={0804.4237},
primaryClass={cs.NE q-bio.NC}
} | burger2008explaining |
arxiv-3468 | 0804.4239 | Capacity Definitions for General Channels with Receiver Side Information | <|reference_start|>Capacity Definitions for General Channels with Receiver Side Information: We consider three capacity definitions for general channels with channel side information at the receiver, where the channel is modeled as a sequence of finite dimensional conditional distributions not necessarily stationary, ergodic, or information stable. The {\em Shannon capacity} is the highest rate asymptotically achievable with arbitrarily small error probability. The {\em capacity versus outage} is the highest rate asymptotically achievable with a given probability of decoder-recognized outage. The {\em expected capacity} is the highest average rate asymptotically achievable with a single encoder and multiple decoders, where the channel side information determines the decoder in use. As a special case of channel codes for expected rate, the code for capacity versus outage has two decoders: one operates in the non-outage states and decodes all transmitted information, and the other operates in the outage states and decodes nothing. Expected capacity equals Shannon capacity for channels governed by a stationary ergodic random process but is typically greater for general channels. These alternative capacity definitions essentially relax the constraint that all transmitted information must be decoded at the receiver. We derive capacity theorems for these capacity definitions through information density. Numerical examples are provided to demonstrate their connections and differences. We also discuss the implication of these alternative capacity definitions for end-to-end distortion, source-channel coding and separation.<|reference_end|> | arxiv | @article{effros2008capacity,
title={Capacity Definitions for General Channels with Receiver Side Information},
author={Michelle Effros, Andrea Goldsmith, Yifan Liang},
journal={arXiv preprint arXiv:0804.4239},
year={2008},
doi={10.1109/ISIT.2007.4557342},
archivePrefix={arXiv},
eprint={0804.4239},
primaryClass={cs.IT math.IT}
} | effros2008capacity |
arxiv-3469 | 0804.4255 | Expected Message Delivery Time for Small-world Networks in the Continuum Limit | <|reference_start|>Expected Message Delivery Time for Small-world Networks in the Continuum Limit: Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared with the ones in a random graph. Examples of small-world networks abound in sociology, biology, neuroscience and physics as well as in human-made networks. This paper analyzes the average delivery time of messages in dense small-world networks constructed on a plane. Iterative equations for the average message delivery time in these networks are provided for the situation in which nodes employ a simple greedy geographic routing algorithm. It is shown that two network nodes communicate with each other only through their short-range contacts, and that the average message delivery time rises linearly if the separation between them is small. On the other hand, if their separation increases, the average message delivery time rapidly saturates to a constant value and stays almost the same for all large values of their separation.<|reference_end|> | arxiv | @article{inaltekin2008expected,
title={Expected Message Delivery Time for Small-world Networks in the Continuum
Limit},
author={Hazer Inaltekin, Mung Chiang and Harold Vincent Poor},
journal={arXiv preprint arXiv:0804.4255},
year={2008},
doi={10.1109/ISIT.2008.4595070},
archivePrefix={arXiv},
eprint={0804.4255},
primaryClass={cs.IT math.IT}
} | inaltekin2008expected |
arxiv-3470 | 0804.4284 | Network Coding Capacity of Random Wireless Networks under a SINR Model | <|reference_start|>Network Coding Capacity of Random Wireless Networks under a SINR Model: Previous work on network coding capacity for random wired and wireless networks have focused on the case where the capacities of links in the network are independent. In this paper, we consider a more realistic model, where wireless networks are modelled by random geometric graphs with interference and noise. In this model, the capacities of links are not independent. By employing coupling and martingale methods, we show that, under mild conditions, the network coding capacity for random wireless networks still exhibits a concentration behavior around the mean value of the minimum cut.<|reference_end|> | arxiv | @article{kong2008network,
title={Network Coding Capacity of Random Wireless Networks under a SINR Model},
author={Zhenning Kong, Salah A. Aly, Emina Soljanin, Edmund M. Yeh, Andreas
Klappenecker},
journal={arXiv preprint arXiv:0804.4284},
year={2008},
archivePrefix={arXiv},
eprint={0804.4284},
primaryClass={cs.IT cs.NI math.IT}
} | kong2008network |
arxiv-3471 | 0804.4298 | Wireless Erasure Networks with Feedback | <|reference_start|>Wireless Erasure Networks with Feedback: Consider a lossy packet network of queues, communicating over a wireless medium. This paper presents a throughput-optimal transmission strategy for a unicast network when feedback is available, which has the following advantages: It requires a very limited form of acknowledgment feedback. It is completely distributed, and independent of the network topology. Finally, communication at the information theoretic cut-set rate requires no network coding and no rateless coding on the packets. This simple strategy consists of each node randomly choosing a packet from its buffer to transmit at each opportunity. However, the packet is only deleted from a node's buffer once it has been successfully received by the final destination<|reference_end|> | arxiv | @article{smith2008wireless,
title={Wireless Erasure Networks with Feedback},
author={Brian Smith, Babak Hassibi},
journal={arXiv preprint arXiv:0804.4298},
year={2008},
archivePrefix={arXiv},
eprint={0804.4298},
primaryClass={cs.IT math.IT}
} | smith2008wireless |
arxiv-3472 | 0804.4305 | An Algorigtm for Singular Value Decomposition of Matrices in Blocks | <|reference_start|>An Algorigtm for Singular Value Decomposition of Matrices in Blocks: Two methods to decompose block matrices analogous to Singular Matrix Decomposition are proposed, one yielding the so called economy decomposition, and other yielding the full decomposition. This method is devised to avoid handling matrices bigger than the biggest blocks, so it is particularly appropriate when a limitation on the size of matrices exists. The method is tested on a document-term matrix (17780x3204) divided in 4 blocks, the upper-left corner being 215x215.<|reference_end|> | arxiv | @article{huertas-rosero2008an,
title={An Algorigtm for Singular Value Decomposition of Matrices in Blocks},
author={Alvaro Francisco Huertas-Rosero},
journal={DCS Technical Report Series, TR-2008-269},
year={2008},
number={TR-2008-269},
archivePrefix={arXiv},
eprint={0804.4305},
primaryClass={math.NA cs.IR math.AC}
} | huertas-rosero2008an |
arxiv-3473 | 0804.4316 | Asymmetric Quantum LDPC Codes | <|reference_start|>Asymmetric Quantum LDPC Codes: Recently, quantum error-correcting codes were proposed that capitalize on the fact that many physical error models lead to a significant asymmetry between the probabilities for bit flip and phase flip errors. An example for a channel which exhibits such asymmetry is the combined amplitude damping and dephasing channel, where the probabilities of bit flips and phase flips can be related to relaxation and dephasing time, respectively. We give systematic constructions of asymmetric quantum stabilizer codes that exploit this asymmetry. Our approach is based on a CSS construction that combines BCH and finite geometry LDPC codes.<|reference_end|> | arxiv | @article{sarvepalli2008asymmetric,
title={Asymmetric Quantum LDPC Codes},
author={Pradeep Kiran Sarvepalli, Martin Roetteler, Andreas Klappenecker},
journal={Proceedings 2008 IEEE International Symposium on Information
Theory (ISIT 2008), Toronto, Canada, pp. 305-309, 2008},
year={2008},
doi={10.1109/ISIT.2008.4594997},
archivePrefix={arXiv},
eprint={0804.4316},
primaryClass={quant-ph cs.IT math.IT}
} | sarvepalli2008asymmetric |
arxiv-3474 | 0804.4324 | Hochschild Homology and Cohomology of Klein Surfaces | <|reference_start|>Hochschild Homology and Cohomology of Klein Surfaces: Within the framework of deformation quantization, a first step towards the study of star-products is the calculation of Hochschild cohomology. The aim of this article is precisely to determine the Hochschild homology and cohomology in two cases of algebraic varieties. On the one hand, we consider singular curves of the plane; here we recover, in a different way, a result proved by Fronsdal and make it more precise. On the other hand, we are interested in Klein surfaces. The use of a complex suggested by Kontsevich and the help of Groebner bases allow us to solve the problem.<|reference_end|> | arxiv | @article{butin2008hochschild,
title={Hochschild Homology and Cohomology of Klein Surfaces},
author={Fr'ed'eric Butin},
journal={SIGMA 4 (2008), 064, 26 pages},
year={2008},
doi={10.3842/SIGMA.2008.064},
archivePrefix={arXiv},
eprint={0804.4324},
primaryClass={math-ph cs.SC math.AC math.MP math.QA math.RA}
} | butin2008hochschild |
arxiv-3475 | 0804.4336 | Counterflow Extension for the FAST-Model | <|reference_start|>Counterflow Extension for the FAST-Model: The F.A.S.T. (Floor field and Agent based Simulation Tool) model is a microscopic model of pedestrian dynamics, which is discrete in space and time. It was developed in a number of more or less consecutive steps from a simple CA model. This contribution is a summary of a study on an extension of the F.A.S.T-model for counterflow situations. The extensions will be explained and it will be shown that the extended F.A.S.T.-model is capable of handling various counterflow situations and to reproduce the well known lane formation effect.<|reference_end|> | arxiv | @article{kretz2008counterflow,
title={Counterflow Extension for the F.A.S.T.-Model},
author={Tobias Kretz and Maike Kaufman and Michael Schreckenberg},
journal={Cellular Automata Lecture Notes in Computer Science, 2008, Volume
5191/2008, 555-558},
year={2008},
doi={10.1007/978-3-540-79992-4_75},
archivePrefix={arXiv},
eprint={0804.4336},
primaryClass={cs.MA physics.comp-ph}
} | kretz2008counterflow |
arxiv-3476 | 0804.4347 | Nonorthogonal Bases and Phase Decomposition: Properties and Applications | <|reference_start|>Nonorthogonal Bases and Phase Decomposition: Properties and Applications: In a previous paper [1] it was discussed the viability of functional analysis using as a basis a couple of generic functions, and hence vectorial decomposition. Here we complete the paradigm exploiting one of the analysis methodologies developed there, but applied to phase coordinates, so needing only one function as a basis. It will be shown that, thanks to the novel iterative analysis, any function satisfying a rather loose requisite is ontologically a basis. This in turn generalizes the polar version of the Fourier theorem to an ample class of nonorthogonal bases. The main advantage of this generalization is that it inherits some of the properties of the original Fourier theorem. As a result the new transform has a wide range of applications and some remarkable consequences. The new tool will be compared with wavelets and frames. Examples of analysis and reconstruction of functions using the developed algorithms and generic bases will be given. Some of the properties, and applications that can promptly benefit from the theory, will be discussed. The implementation of a matched filter for noise suppression will be used as an example of the potential of the theory.<|reference_end|> | arxiv | @article{vergara2008nonorthogonal,
title={Nonorthogonal Bases and Phase Decomposition: Properties and Applications},
author={Sossio Vergara},
journal={Published in : Digital Signal Processing (2014), pp. 223-230},
year={2008},
archivePrefix={arXiv},
eprint={0804.4347},
primaryClass={cs.NA cs.SD math.FA}
} | vergara2008nonorthogonal |
arxiv-3477 | 0804.4383 | Practical Automated Partial Verification of Multi-Paradigm Real-Time Models | <|reference_start|>Practical Automated Partial Verification of Multi-Paradigm Real-Time Models: This article introduces a fully automated verification technique that permits to analyze real-time systems described using a continuous notion of time and a mixture of operational (i.e., automata-based) and descriptive (i.e., logic-based) formalisms. The technique relies on the reduction, under reasonable assumptions, of the continuous-time verification problem to its discrete-time counterpart. This reconciles in a viable and effective way the dense/discrete and operational/descriptive dichotomies that are often encountered in practice when it comes to specifying and analyzing complex critical systems. The article investigates the applicability of the technique through a significant example centered on a communication protocol. More precisely, concurrent runs of the protocol are formalized by parallel instances of a Timed Automaton, while the synchronization rules between these instances are specified through Metric Temporal Logic formulas, thus creating a multi-paradigm model. Verification tests run on this model using a bounded validity checker implementing the technique show consistent results and interesting performances.<|reference_end|> | arxiv | @article{furia2008practical,
title={Practical Automated Partial Verification of Multi-Paradigm Real-Time
Models},
author={Carlo A. Furia, Matteo Pradella, Matteo Rossi},
journal={Proceedings of the 10th International Conference on Formal
Engineering Methods (ICFEM'08). Lecture Notes in Computer Science,
5256:298--317, Springer-Verlag, October 2008},
year={2008},
doi={10.1007/978-3-540-88194-0_19},
archivePrefix={arXiv},
eprint={0804.4383},
primaryClass={cs.LO}
} | furia2008practical |
arxiv-3478 | 0804.4384 | Linear-Programming Decoding of Nonbinary Linear Codes | <|reference_start|>Linear-Programming Decoding of Nonbinary Linear Codes: A framework for linear-programming (LP) decoding of nonbinary linear codes over rings is developed. This framework facilitates linear-programming based reception for coded modulation systems which use direct modulation mapping of coded symbols. It is proved that the resulting LP decoder has the 'maximum-likelihood certificate' property. It is also shown that the decoder output is the lowest cost pseudocodeword. Equivalence between pseudocodewords of the linear program and pseudocodewords of graph covers is proved. It is also proved that if the modulator-channel combination satisfies a particular symmetry condition, the codeword error rate performance is independent of the transmitted codeword. Two alternative polytopes for use with linear-programming decoding are studied, and it is shown that for many classes of codes these polytopes yield a complexity advantage for decoding. These polytope representations lead to polynomial-time decoders for a wide variety of classical nonbinary linear codes. LP decoding performance is illustrated for the [11,6] ternary Golay code with ternary PSK modulation over AWGN, and in this case it is shown that the performance of the LP decoder is comparable to codeword-error-rate-optimum hard-decision based decoding. LP decoding is also simulated for medium-length ternary and quaternary LDPC codes with corresponding PSK modulations over AWGN.<|reference_end|> | arxiv | @article{flanagan2008linear-programming,
title={Linear-Programming Decoding of Nonbinary Linear Codes},
author={Mark F. Flanagan, Vitaly Skachek, Eimear Byrne, Marcus Greferath},
journal={arXiv preprint arXiv:0804.4384},
year={2008},
doi={10.1109/TIT.2009.2025571},
number={CSI-01-01},
archivePrefix={arXiv},
eprint={0804.4384},
primaryClass={cs.IT math.IT}
} | flanagan2008linear-programming |
arxiv-3479 | 0804.4391 | A Lower Bound on the Bayesian MSE Based on the Optimal Bias Function | <|reference_start|>A Lower Bound on the Bayesian MSE Based on the Optimal Bias Function: A lower bound on the minimum mean-squared error (MSE) in a Bayesian estimation problem is proposed in this paper. This bound utilizes a well-known connection to the deterministic estimation setting. Using the prior distribution, the bias function which minimizes the Cramer-Rao bound can be determined, resulting in a lower bound on the Bayesian MSE. The bound is developed for the general case of a vector parameter with an arbitrary probability distribution, and is shown to be asymptotically tight in both the high and low signal-to-noise ratio regimes. A numerical study demonstrates several cases in which the proposed technique is both simpler to compute and tighter than alternative methods.<|reference_end|> | arxiv | @article{ben-haim2008a,
title={A Lower Bound on the Bayesian MSE Based on the Optimal Bias Function},
author={Zvika Ben-Haim and Yonina C. Eldar},
journal={arXiv preprint arXiv:0804.4391},
year={2008},
archivePrefix={arXiv},
eprint={0804.4391},
primaryClass={cs.IT math.IT}
} | ben-haim2008a |
arxiv-3480 | 0804.4395 | Development of a peristaltic micropump for bio-medical applications based on mini LIPCA | <|reference_start|>Development of a peristaltic micropump for bio-medical applications based on mini LIPCA: This paper presents the design, fabrication, and experimental characterization of a peristaltic micropump. The micropump is composed of two layers fabricated from polydimethylsiloxane (PDMS) material. The first layer has a rectangular channel and two valve seals. Three rectangular mini lightweight piezo-composite actuators are integrated in the second layer, and used as actuation parts. Two layers are bonded, and covered by two polymethyl methacrylate (PMMA) plates, which help increase the stiffness of the micropump. A maximum flow rate of 900 mokroliter per min and a maximum backpressure of 1.8 kPa are recorded when water is used as pump liquid. We measured the power consumption of the micropump. The micropump is found to be a promising candidate for bio-medical application due to its bio-compatibility, portability, bidirectionality, and simple effective design.<|reference_end|> | arxiv | @article{pham2008development,
title={Development of a peristaltic micropump for bio-medical applications
based on mini LIPCA},
author={My Pham, Thanh Tung Nguyen, Nam Seo Goo},
journal={Proceedings of the International Conference on Intelligent
Unmanned System (ICIUS 2007), Bali, Indonesia, October 24-25, 2007, Paper No.
ICIUS2007-B002},
year={2008},
archivePrefix={arXiv},
eprint={0804.4395},
primaryClass={cs.RO}
} | pham2008development |
arxiv-3481 | 0804.4415 | Eppstein's bound on intersecting triangles revisited | <|reference_start|>Eppstein's bound on intersecting triangles revisited: Let S be a set of n points in the plane, and let T be a set of m triangles with vertices in S. Then there exists a point in the plane contained in Omega(m^3 / (n^6 log^2 n)) triangles of T. Eppstein (1993) gave a proof of this claim, but there is a problem with his proof. Here we provide a correct proof by slightly modifying Eppstein's argument.<|reference_end|> | arxiv | @article{nivasch2008eppstein's,
title={Eppstein's bound on intersecting triangles revisited},
author={Gabriel Nivasch and Micha Sharir},
journal={Journal of Combinatorial Theory, Series A, 116:494-497, 2009},
year={2008},
doi={10.1016/j.jcta.2008.07.003},
archivePrefix={arXiv},
eprint={0804.4415},
primaryClass={cs.CG}
} | nivasch2008eppstein's |
arxiv-3482 | 0804.4451 | Dependence Structure Estimation via Copula | <|reference_start|>Dependence Structure Estimation via Copula: Dependence strucuture estimation is one of the important problems in machine learning domain and has many applications in different scientific areas. In this paper, a theoretical framework for such estimation based on copula and copula entropy -- the probabilistic theory of representation and measurement of statistical dependence, is proposed. Graphical models are considered as a special case of the copula framework. A method of the framework for estimating maximum spanning copula is proposed. Due to copula, the method is irrelevant to the properties of individual variables, insensitive to outlier and able to deal with non-Gaussianity. Experiments on both simulated data and real dataset demonstrated the effectiveness of the proposed method.<|reference_end|> | arxiv | @article{ma2008dependence,
title={Dependence Structure Estimation via Copula},
author={Jian Ma and Zengqi Sun},
journal={arXiv preprint arXiv:0804.4451},
year={2008},
archivePrefix={arXiv},
eprint={0804.4451},
primaryClass={cs.LG cs.IR stat.ME}
} | ma2008dependence |
arxiv-3483 | 0804.4455 | On the Capacity Bounds of Undirected Networks | <|reference_start|>On the Capacity Bounds of Undirected Networks: In this work we improve on the bounds presented by Li&Li for network coding gain in the undirected case. A tightened bound for the undirected multicast problem with three terminals is derived. An interesting result shows that with fractional routing, routing throughput can achieve at least 75% of the coding throughput. A tighter bound for the general multicast problem with any number of terminals shows that coding gain is strictly less than 2. Our derived bound depends on the number of terminals in the multicast network and approaches 2 for arbitrarily large number of terminals.<|reference_end|> | arxiv | @article{al-bashabsheh2008on,
title={On the Capacity Bounds of Undirected Networks},
author={Ali Al-Bashabsheh, Abbas Yongacoglu},
journal={IEEE International Symposium on Information Theory (ISIT), Nice,
France, June 2007},
year={2008},
doi={10.1109/ISIT.2007.4557081},
archivePrefix={arXiv},
eprint={0804.4455},
primaryClass={cs.IT math.IT}
} | al-bashabsheh2008on |
arxiv-3484 | 0804.4464 | Stabbing simplices by points and flats | <|reference_start|>Stabbing simplices by points and flats: The following result was proved by Barany in 1982: For every d >= 1 there exists c_d > 0 such that for every n-point set S in R^d there is a point p in R^d contained in at least c_d n^{d+1} - O(n^d) of the simplices spanned by S. We investigate the largest possible value of c_d. It was known that c_d <= 1/(2^d(d+1)!) (this estimate actually holds for every point set S). We construct sets showing that c_d <= (d+1)^{-(d+1)}, and we conjecture this estimate to be tight. The best known lower bound, due to Wagner, is c_d >= gamma_d := (d^2+1)/((d+1)!(d+1)^{d+1}); in his method, p can be chosen as any centerpoint of S. We construct n-point sets with a centerpoint that is contained in no more than gamma_d n^{d+1}+O(n^d) simplices spanned by S, thus showing that the approach using an arbitrary centerpoint cannot be further improved. We also prove that for every n-point set S in R^d there exists a (d-2)-flat that stabs at least c_{d,d-2} n^3 - O(n^2) of the triangles spanned by S, with c_{d,d-2}>=(1/24)(1- 1/(2d-1)^2). To this end, we establish an equipartition result of independent interest (generalizing planar results of Buck and Buck and of Ceder): Every mass distribution in R^d can be divided into 4d-2 equal parts by 2d-1 hyperplanes intersecting in a common (d-2)-flat.<|reference_end|> | arxiv | @article{bukh2008stabbing,
title={Stabbing simplices by points and flats},
author={Boris Bukh, Jiv{r}'i Matouv{s}ek, Gabriel Nivasch},
journal={Discrete and Computational Geometry, 43:321--338, 2010},
year={2008},
doi={10.1007/s00454-008-9124-4},
archivePrefix={arXiv},
eprint={0804.4464},
primaryClass={math.CO cs.CG}
} | bukh2008stabbing |
arxiv-3485 | 0804.4466 | Free Distance Bounds for Protograph-Based Regular LDPC Convolutional Codes | <|reference_start|>Free Distance Bounds for Protograph-Based Regular LDPC Convolutional Codes: In this paper asymptotic methods are used to form lower bounds on the free distance to constraint length ratio of several ensembles of regular, asymptotically good, protograph-based LDPC convolutional codes. In particular, we show that the free distance to constraint length ratio of the regular LDPC convolutional codes exceeds that of the minimum distance to block length ratio of the corresponding LDPC block codes.<|reference_end|> | arxiv | @article{mitchell2008free,
title={Free Distance Bounds for Protograph-Based Regular LDPC Convolutional
Codes},
author={David G. M. Mitchell, Ali E. Pusane, Norbert Goertz, Daniel J.
Costello Jr},
journal={arXiv preprint arXiv:0804.4466},
year={2008},
archivePrefix={arXiv},
eprint={0804.4466},
primaryClass={cs.IT math.IT}
} | mitchell2008free |
arxiv-3486 | 0804.4489 | Generalized Degrees of Freedom of the Symmetric Gaussian $K$ User Interference Channel | <|reference_start|>Generalized Degrees of Freedom of the Symmetric Gaussian $K$ User Interference Channel: We characterize the generalized degrees of freedom of the $K$ user symmetric Gaussian interference channel where all desired links have the same signal-to-noise ratio (SNR) and all undesired links carrying interference have the same interference-to-noise ratio, ${INR}={SNR}^\alpha$. We find that the number of generalized degrees of freedom per user, $d(\alpha)$, does not depend on the number of users, so that the characterization is identical to the 2 user interference channel with the exception of a singularity at $\alpha=1$ where $d(1)=\frac{1}{K}$. The achievable schemes use multilevel coding with a nested lattice structure that opens the possibility that the sum of interfering signals can be decoded at a receiver even though the messages carried by the interfering signals are not decodable.<|reference_end|> | arxiv | @article{jafar2008generalized,
title={Generalized Degrees of Freedom of the Symmetric Gaussian $K$ User
Interference Channel},
author={Syed A. Jafar, Sriram Vishwanath},
journal={IEEE Transactions on Information Theory, July 2010, Vol. 56,
Issue: 7, Pages: 3297-3303},
year={2008},
archivePrefix={arXiv},
eprint={0804.4489},
primaryClass={cs.IT math.IT}
} | jafar2008generalized |
arxiv-3487 | 0804.4517 | A multivariate generalization of Costa's entropy power inequality | <|reference_start|>A multivariate generalization of Costa's entropy power inequality: A simple multivariate version of Costa's entropy power inequality is proved. In particular, it is shown that if independent white Gaussian noise is added to an arbitrary multivariate signal, the entropy power of the resulting random variable is a multidimensional concave function of the individual variances of the components of the signal. As a side result, we also give an expression for the Hessian matrix of the entropy and entropy power functions with respect to the variances of the signal components, which is an interesting result in its own right.<|reference_end|> | arxiv | @article{payaró2008a,
title={A multivariate generalization of Costa's entropy power inequality},
author={M. Payar'o, D. P. Palomar},
journal={arXiv preprint arXiv:0804.4517},
year={2008},
archivePrefix={arXiv},
eprint={0804.4517},
primaryClass={cs.IT math.IT}
} | payaró2008a |
arxiv-3488 | 0804.4523 | A non-distillability criterion for secret correlations | <|reference_start|>A non-distillability criterion for secret correlations: Within entanglement theory there are criteria which certify that some quantum states cannot be distilled into pure entanglement. An example is the positive partial transposition criterion. Here we present, for the first time, the analogous thing for secret correlations. We introduce a computable criterion which certifies that a probability distribution between two honest parties and an eavesdropper cannot be (asymptotically) distilled into a secret key. The existence of non-distillable correlations with positive secrecy cost, also known as bound information, is an open question. This criterion may be the key for finding bound information. However, if it turns out that this criterion does not detect bound information, then, a very interesting consequence follows: any distribution with positive secrecy cost can increase the secrecy content of another distribution. In other words, all correlations with positive secrecy cost constitute a useful resource.<|reference_end|> | arxiv | @article{masanes2008a,
title={A non-distillability criterion for secret correlations},
author={Lluis Masanes, Andreas Winter},
journal={Quantum Information and Computation, Vol.10, No.1&2, pp0152 (2009)},
year={2008},
archivePrefix={arXiv},
eprint={0804.4523},
primaryClass={quant-ph cs.CR}
} | masanes2008a |
arxiv-3489 | 0804.4524 | Approximate Equilibria in Games with Few Players | <|reference_start|>Approximate Equilibria in Games with Few Players: We study the problem of computing approximate Nash equilibria (epsilon-Nash equilibria) in normal form games, where the number of players is a small constant. We consider the approach of looking for solutions with constant support size. It is known from recent work that in the 2-player case, a 1/2-Nash equilibrium can be easily found, but in general one cannot achieve a smaller value of epsilon than 1/2. In this paper we extend those results to the k-player case, and find that epsilon = 1-1/k is feasible, but cannot be improved upon. We show how stronger results for the 2-player case may be used in order to slightly improve upon the epsilon = 1-1/k obtained in the k-player case.<|reference_end|> | arxiv | @article{briest2008approximate,
title={Approximate Equilibria in Games with Few Players},
author={Patrick Briest, Paul W. Goldberg, Heiko Roeglin},
journal={arXiv preprint arXiv:0804.4524},
year={2008},
archivePrefix={arXiv},
eprint={0804.4524},
primaryClass={cs.GT}
} | briest2008approximate |
arxiv-3490 | 0804.4525 | The Complexity of Coverage | <|reference_start|>The Complexity of Coverage: We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between the tester and the system, where the system state space is partitioned according to some coverage criterion and the objective of the tester is to maximize the set of partitions (or coverage goals) visited during the game. We show the complexity of the maximal coverage problem for non-deterministic systems is PSPACE-complete, but is NP-complete for deterministic systems. For the special case of non-deterministic systems with a re-initializing ``reset'' action, which represent running a new test input on a re-initialized system, we show that the complexity is again co-NP-complete. Our proof technique for reset games uses randomized testing strategies that circumvent the exponentially large memory requirement in the deterministic case.<|reference_end|> | arxiv | @article{chatterjee2008the,
title={The Complexity of Coverage},
author={Krishnendu Chatterjee, Luca de Alfaro and Rupak Majumdar},
journal={arXiv preprint arXiv:0804.4525},
year={2008},
archivePrefix={arXiv},
eprint={0804.4525},
primaryClass={cs.PL cs.SE}
} | chatterjee2008the |
arxiv-3491 | 0804.4530 | Strategy Improvement for Concurrent Safety Games | <|reference_start|>Strategy Improvement for Concurrent Safety Games: We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition to a successor state. Two basic objectives are the safety objective: ``stay forever in a set F of states'', and its dual, the reachability objective, ``reach a set R of states''. We present in this paper a strategy improvement algorithm for computing the value of a concurrent safety game, that is, the maximal probability with which player 1 can enforce the safety objective. The algorithm yields a sequence of player-1 strategies which ensure probabilities of winning that converge monotonically to the value of the safety game. The significance of the result is twofold. First, while strategy improvement algorithms were known for Markov decision processes and turn-based games, as well as for concurrent reachability games, this is the first strategy improvement algorithm for concurrent safety games. Second, and most importantly, the improvement algorithm provides a way to approximate the value of a concurrent safety game from below (the known value-iteration algorithms approximate the value from above). Thus, when used together with value-iteration algorithms, or with strategy improvement algorithms for reachability games, our algorithm leads to the first practical algorithm for computing converging upper and lower bounds for the value of reachability and safety games.<|reference_end|> | arxiv | @article{chatterjee2008strategy,
title={Strategy Improvement for Concurrent Safety Games},
author={Krishnendu Chatterjee, Luca de Alfaro and Thomas A. Henzinger},
journal={arXiv preprint arXiv:0804.4530},
year={2008},
archivePrefix={arXiv},
eprint={0804.4530},
primaryClass={cs.GT cs.LO}
} | chatterjee2008strategy |
arxiv-3492 | 0804.4565 | Data linkage algebra, data linkage dynamics, and priority rewriting | <|reference_start|>Data linkage algebra, data linkage dynamics, and priority rewriting: We introduce an algebra of data linkages. Data linkages are intended for modelling the states of computations in which dynamic data structures are involved. We present a simple model of computation in which states of computations are modelled as data linkages and state changes take place by means of certain actions. We describe the state changes and replies that result from performing those actions by means of a term rewriting system with rule priorities. The model in question is an upgrade of molecular dynamics. The upgrading is mainly concerned with the features to deal with values and the features to reclaim garbage.<|reference_end|> | arxiv | @article{bergstra2008data,
title={Data linkage algebra, data linkage dynamics, and priority rewriting},
author={J. A. Bergstra, C. A. Middelburg},
journal={Fundamenta Informaticae, 128(4):367--412, 2013},
year={2008},
doi={10.3233/FI-2013-950},
number={PRG0806},
archivePrefix={arXiv},
eprint={0804.4565},
primaryClass={cs.LO}
} | bergstra2008data |
arxiv-3493 | 0804.4584 | Feature Unification in TAG Derivation Trees | <|reference_start|>Feature Unification in TAG Derivation Trees: The derivation trees of a tree adjoining grammar provide a first insight into the sentence semantics, and are thus prime targets for generation systems. We define a formalism, feature-based regular tree grammars, and a translation from feature based tree adjoining grammars into this new formalism. The translation preserves the derivation structures of the original grammar, and accounts for feature unification.<|reference_end|> | arxiv | @article{schmitz2008feature,
title={Feature Unification in TAG Derivation Trees},
author={Sylvain Schmitz and Joseph Le Roux},
journal={In TAG+9, Ninth International Workshop on Tree Adjoining Grammars
and Related Formalisms, 2008},
year={2008},
archivePrefix={arXiv},
eprint={0804.4584},
primaryClass={cs.CL}
} | schmitz2008feature |
arxiv-3494 | 0804.4590 | \'Etude de performance des syst\`emes de d\'ecouverte de ressources | <|reference_start|>\'Etude de performance des syst\`emes de d\'ecouverte de ressources: The Desktop Grid offers solutions to overcome several challenges and to answer increasingly needs of scientific computing. This technology consists mainly in exploiting PC resources, geographically dispersed, to treat time consuming applications and/or important storage capacity requiring applications. However, as resources number increases, the need for scalability, self-organisation, dynamic reconfiguration, decentralization and performance becomes more and more essential. In this context, this paper evaluates the scalability and performance of P2P tools for registering and discovering services (Publish/Subscribe systems). Three protocols are used in this purpose: Bonjour, Avahi and Pastry. We have studied the behaviour of these protocols related to two criteria: the elapsed time for registrations services and the needed time to discover new services.<|reference_end|> | arxiv | @article{abbes2008\'etude,
title={\'Etude de performance des syst\`emes de d\'ecouverte de ressources},
author={Heithem Abbes (LIPN, UTIC), Christophe C'erin (LIPN), Jean-Christophe
Dubacq (LIPN), Mohamed Jemni (UTIC)},
journal={Dans Actes de Fribourg'2008 : Renpar'18 / SympA'2008 / CFSE'6 -
Renpar'18, Fribourg : Suisse (2008)},
year={2008},
archivePrefix={arXiv},
eprint={0804.4590},
primaryClass={cs.DC}
} | abbes2008\'etude |
arxiv-3495 | 0804.4622 | Fast Density Codes for Image Data | <|reference_start|>Fast Density Codes for Image Data: Recently, a new method for encoding data sets in the form of "Density Codes" was proposed in the literature (Courrieu, 2006). This method allows to compare sets of points belonging to every multidimensional space, and to build shape spaces invariant to a wide variety of affine and non-affine transformations. However, this general method does not take advantage of the special properties of image data, resulting in a quite slow encoding process that makes this tool practically unusable for processing large image databases with conventional computers. This paper proposes a very simple variant of the density code method that directly works on the image function, which is thousands times faster than the original Parzen window based method, without loss of its useful properties.<|reference_end|> | arxiv | @article{courrieu2008fast,
title={Fast Density Codes for Image Data},
author={Pierre Courrieu (LPC)},
journal={Neural Information Processing - Letters and Reviews 11, 12 (2007)
247-255},
year={2008},
archivePrefix={arXiv},
eprint={0804.4622},
primaryClass={cs.NE}
} | courrieu2008fast |
arxiv-3496 | 0804.4628 | Comment - Practical Data Protection | <|reference_start|>Comment - Practical Data Protection: Recently, Rawat and Saxena proposed a method for protecting data using ``Disclaimer Statement''. This paper presents some issues and several flaws in their proposal.<|reference_end|> | arxiv | @article{das2008comment,
title={Comment - Practical Data Protection},
author={Manik Lal Das},
journal={arXiv preprint arXiv:0804.4628},
year={2008},
archivePrefix={arXiv},
eprint={0804.4628},
primaryClass={cs.CR}
} | das2008comment |
arxiv-3497 | 0804.4662 | Rateless Coding for MIMO Block Fading Channels | <|reference_start|>Rateless Coding for MIMO Block Fading Channels: In this paper the performance limits and design principles of rateless codes over fading channels are studied. The diversity-multiplexing tradeoff (DMT) is used to analyze the system performance for all possible transmission rates. It is revealed from the analysis that the design of such rateless codes follows the design principle of approximately universal codes for parallel multiple-input multiple-output (MIMO) channels, in which each sub-channel is a MIMO channel. More specifically, it is shown that for a single-input single-output (SISO) channel, the previously developed permutation codes of unit length for parallel channels having rate LR can be transformed directly into rateless codes of length L having multiple rate levels (R, 2R, . . ., LR), to achieve the DMT performance limit.<|reference_end|> | arxiv | @article{fan2008rateless,
title={Rateless Coding for MIMO Block Fading Channels},
author={Yijia Fan, Lifeng Lai, Elza Erkip, H. Vincent Poor},
journal={arXiv preprint arXiv:0804.4662},
year={2008},
archivePrefix={arXiv},
eprint={0804.4662},
primaryClass={cs.IT math.IT}
} | fan2008rateless |
arxiv-3498 | 0804.4666 | Combining geometry and combinatorics: A unified approach to sparse signal recovery | <|reference_start|>Combining geometry and combinatorics: A unified approach to sparse signal recovery: There are two main algorithmic approaches to sparse signal recovery: geometric and combinatorial. The geometric approach starts with a geometric constraint on the measurement matrix and then uses linear programming to decode information about the signal from its measurements. The combinatorial approach constructs the measurement matrix and a combinatorial decoding algorithm to match. We present a unified approach to these two classes of sparse signal recovery algorithms. The unifying elements are the adjacency matrices of high-quality unbalanced expanders. We generalize the notion of Restricted Isometry Property (RIP), crucial to compressed sensing results for signal recovery, from the Euclidean norm to the l_p norm for p about 1, and then show that unbalanced expanders are essentially equivalent to RIP-p matrices. From known deterministic constructions for such matrices, we obtain new deterministic measurement matrix constructions and algorithms for signal recovery which, compared to previous deterministic algorithms, are superior in either the number of measurements or in noise tolerance.<|reference_end|> | arxiv | @article{berinde2008combining,
title={Combining geometry and combinatorics: A unified approach to sparse
signal recovery},
author={R. Berinde, A. C. Gilbert, P. Indyk, H. Karloff, M. J. Strauss},
journal={arXiv preprint arXiv:0804.4666},
year={2008},
archivePrefix={arXiv},
eprint={0804.4666},
primaryClass={cs.DM cs.DS cs.NA}
} | berinde2008combining |
arxiv-3499 | 0804.4682 | Introduction to Relational Networks for Classification | <|reference_start|>Introduction to Relational Networks for Classification: The use of computational intelligence techniques for classification has been used in numerous applications. This paper compares the use of a Multi Layer Perceptron Neural Network and a new Relational Network on classifying the HIV status of women at ante-natal clinics. The paper discusses the architecture of the relational network and its merits compared to a neural network and most other computational intelligence classifiers. Results gathered from the study indicate comparable classification accuracies as well as revealed relationships between data features in the classification data. Much higher classification accuracies are recommended for future research in the area of HIV classification as well as missing data estimation.<|reference_end|> | arxiv | @article{marivate2008introduction,
title={Introduction to Relational Networks for Classification},
author={Vukosi Marivate and Tshilidzi Marwala},
journal={arXiv preprint arXiv:0804.4682},
year={2008},
archivePrefix={arXiv},
eprint={0804.4682},
primaryClass={cs.LG}
} | marivate2008introduction |
arxiv-3500 | 0804.4701 | Superposition-Coded Concurrent Decode-and-Forward Relaying | <|reference_start|>Superposition-Coded Concurrent Decode-and-Forward Relaying: In this paper, a superposition-coded concurrent decode-and-forward (DF) relaying protocol is presented. A specific scenario, where the inter-relay channel is sufficiently strong, is considered. Assuming perfect source-relay transmissions, the proposed scheme further improves the diversity performance of previously proposed repetition-coded concurrent DF relaying, in which the advantage of the inter-relay interference is not fully extracted.<|reference_end|> | arxiv | @article{wang2008superposition-coded,
title={Superposition-Coded Concurrent Decode-and-Forward Relaying},
author={Chao Wang, Yijia Fan, Ioannis Krikidis, John S. Thompson, and H.
Vincent Poor},
journal={arXiv preprint arXiv:0804.4701},
year={2008},
archivePrefix={arXiv},
eprint={0804.4701},
primaryClass={cs.IT math.IT}
} | wang2008superposition-coded |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.