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-674601 | cs/0608021 | The Shannon capacity of a graph and the independence numbers of its powers | <|reference_start|>The Shannon capacity of a graph and the independence numbers of its powers: The independence numbers of powers of graphs have been long studied, under several definitions of graph products, and in particular, under the strong graph product. We show that the series of independence numbers in strong powers of a fixed graph can exhibit a complex structure, implying that the Shannon Capacity of a graph cannot be approximated (up to a sub-polynomial factor of the number of vertices) by any arbitrarily large, yet fixed, prefix of the series. This is true even if this prefix shows a significant increase of the independence number at a given power, after which it stabilizes for a while.<|reference_end|> | arxiv | @article{alon2006the,
title={The Shannon capacity of a graph and the independence numbers of its
powers},
author={Noga Alon, Eyal Lubetzky},
journal={IEEE Trans. on Information Theory 52 (2006), 2172-2176},
year={2006},
doi={10.1109/TIT.2006.872856},
archivePrefix={arXiv},
eprint={cs/0608021},
primaryClass={cs.IT cs.DM math.IT}
} | alon2006the |
arxiv-674602 | cs/0608022 | Expressing Security Properties Using Selective Interleaving Functions | <|reference_start|>Expressing Security Properties Using Selective Interleaving Functions: McLean's notion of Selective Interleaving Functions (SIFs) is perhaps the best-known attempt to construct a framework for expressing various security properties. We examine the expressive power of SIFs carefully. We show that SIFs cannot capture nondeducibility on strategies (NOS). We also prove that the set of security properties expressed with SIFs is not closed under conjunction, from which it follows that separability is strictly stronger than double generalized noninterference. However, we show that if we generalize the notion of SIF in a natural way, then NOS is expressible, and the set of security properties expressible by generalized SIFs is closed under conjunction.<|reference_end|> | arxiv | @article{halpern2006expressing,
title={Expressing Security Properties Using Selective Interleaving Functions},
author={Joseph Y. Halpern and Sabina Petride},
journal={arXiv preprint arXiv:cs/0608022},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608022},
primaryClass={cs.CR}
} | halpern2006expressing |
arxiv-674603 | cs/0608023 | Optimal resource allocation for OFDM multiuser channels | <|reference_start|>Optimal resource allocation for OFDM multiuser channels: In this paper, a unifying framework for orthogonal frequency division multiplexing (OFDM) multiuser resource allocation is presented. The isolated seeming problems of maximizing a weighted sum of rates for a given power budget $\bar{P}$ and minimizing sum power for given rate requirements $\mathbf{\bar{R}}$ can be interpreted jointly in this framework. To this end we embed the problems in a higher dimensional space. Based on these results, we subsequently consider the combined problem of maximizing a weighted sum of rates under given rate requirements $\mathbf{\bar{R}}$ and a fixed power budget $\bar{P}$. This new problem is challenging, since the additional constraints do not allow to use the hitherto existing approaches. Interestingly, the optimal decoding orders turn out to be the ordering of the Lagrangian factors in all problems.<|reference_end|> | arxiv | @article{wunder2006optimal,
title={Optimal resource allocation for OFDM multiuser channels},
author={Gerhard Wunder, Thomas Michel},
journal={arXiv preprint arXiv:cs/0608023},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608023},
primaryClass={cs.IT math.IT}
} | wunder2006optimal |
arxiv-674604 | cs/0608024 | Cryptanalysis of an Encryption Scheme Based on Blind Source Separation | <|reference_start|>Cryptanalysis of an Encryption Scheme Based on Blind Source Separation: Recently Lin et al. proposed a method of using the underdetermined BSS (blind source separation) problem to realize image and speech encryption. In this paper, we give a cryptanalysis of this BSS-based encryption and point out that it is not secure against known/chosen-plaintext attack and chosen-ciphertext attack. In addition, there exist some other security defects: low sensitivity to part of the key and the plaintext, a ciphertext-only differential attack, divide-and-conquer (DAC) attack on part of the key. We also discuss the role of BSS in Lin et al.'s efforts towards cryptographically secure ciphers.<|reference_end|> | arxiv | @article{li2006cryptanalysis,
title={Cryptanalysis of an Encryption Scheme Based on Blind Source Separation},
author={Shujun Li, Chengqing Li, Kwok-Tung Lo and Guanrong Chen},
journal={IEEE Transactions on Circuits and Systems-I: Regular Papers, vol.
55, no. 4, pp. 1055-1063, April 2008},
year={2006},
doi={10.1109/TCSI.2008.916540},
archivePrefix={arXiv},
eprint={cs/0608024},
primaryClass={cs.CR cs.MM}
} | li2006cryptanalysis |
arxiv-674605 | cs/0608025 | User-Network Association in a WLAN-UMTS Hybrid Cell: Global & Individual Optimality | <|reference_start|>User-Network Association in a WLAN-UMTS Hybrid Cell: Global & Individual Optimality: We study optimal user-network association in an integrated 802.11 WLAN and 3G-UMTS hybrid cell. Assuming saturated resource allocation on the downlink of WLAN and UMTS networks and a single QoS class of mobiles arriving at an average location in the hybrid cell, we formulate the problem with two different approaches: Global and Individual optimality. The Globally optimal association is formulated as an SMDP (Semi Markov Decision Process) connection routing decision problem where rewards comprise a financial gain component and an aggregate network throughput component. The corresponding Dynamic Programming equations are solved using Value Iteration method and a stationary optimal policy with neither convex nor concave type switching curve structure is obtained. Threshold type and symmetric switching curves are observed for the analogous homogenous network cases. The Individual optimality is studied under a non-cooperative dynamic game framework with expected service time of a mobile as the decision cost criteria. It is shown that individual optimality in a WLAN-UMTS hybrid cell, results in a threshold policy curve of descending staircase form with increasing Poisson arrival rate of mobiles.<|reference_end|> | arxiv | @article{kumar2006user-network,
title={User-Network Association in a WLAN-UMTS Hybrid Cell: Global & Individual
Optimality},
author={Dinesh Kumar (INRIA Sophia Antipolis), Eitan Altman (INRIA Sophia
Antipolis), Jean-Marc Kelif (INRIA Sophia Antipolis)},
journal={arXiv preprint arXiv:cs/0608025},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608025},
primaryClass={cs.NI}
} | kumar2006user-network |
arxiv-674606 | cs/0608026 | New Cross-Layer Channel Switching Policy for TCP Transmission on 3G UMTS Downlink | <|reference_start|>New Cross-Layer Channel Switching Policy for TCP Transmission on 3G UMTS Downlink: In 3G UMTS, two main transport channels have been provided for downlink data transmission: a common FACH channel and a dedicated DCH channel. The performance of TCP in UMTS depends much on the channel switching policy used. In this paper, we propose and analyze three new basic threshold-based channel switching policies for UMTS that we name as QS (Queue Size), FS (Flow Size) and QSFS (QS & FS combined) policy. These policies significantly improve over a modified threshold policy in [1] by about 17% in response time metrics. We further propose and evaluate a new improved switching policy that we call FS-DCH (at-least flow-size threshold on DCH) policy. This policy is biased towards short TCP flows of few packets and is thus a cross-layer policy that improves the performance of TCP by giving priority to the initial few packets of a flow on the fast DCH channel. Extensive simulation results confirm this improvement for the case when number of TCP connections is low.<|reference_end|> | arxiv | @article{kumar2006new,
title={New Cross-Layer Channel Switching Policy for TCP Transmission on 3G UMTS
Downlink},
author={Dinesh Kumar (INRIA Sophia Antipolis), Dhiman Barman, Eitan Altman
(INRIA Sophia Antipolis), Jean-Marc Kelif (FT R&D)},
journal={arXiv preprint arXiv:cs/0608026},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608026},
primaryClass={cs.NI}
} | kumar2006new |
arxiv-674607 | cs/0608027 | myADS-arXiv - a Tailor-Made, Open Access, Virtual Journal | <|reference_start|>myADS-arXiv - a Tailor-Made, Open Access, Virtual Journal: The myADS-arXiv service provides the scientific community with a one stop shop for staying up-to-date with a researcher's field of interest. The service provides a powerful and unique filter on the enormous amount of bibliographic information added to the ADS on a daily basis. It also provides a complete view with the most relevant papers available in the subscriber's field of interest. With this service, the subscriber will get to know the lastest developments, popular trends and the most important papers. This makes the service not only unique from a technical point of view, but also from a content point of view. On this poster we will argue why myADS-arXiv is a tailor-made, open access, virtual journal and we will illustrate its unique character.<|reference_end|> | arxiv | @article{henneken2006myads-arxiv,
title={myADS-arXiv - a Tailor-Made, Open Access, Virtual Journal},
author={E. Henneken, M.J. Kurtz, G. Eichhorn, A. Accomazzi, C.S. Grant, D.
Thompson, E. Bohlen, S.S. Murray},
journal={arXiv preprint arXiv:cs/0608027},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608027},
primaryClass={cs.DL astro-ph}
} | henneken2006myads-arxiv |
arxiv-674608 | cs/0608028 | Using Sets of Probability Measures to Represent Uncertainty | <|reference_start|>Using Sets of Probability Measures to Represent Uncertainty: I explore the use of sets of probability measures as a representation of uncertainty.<|reference_end|> | arxiv | @article{halpern2006using,
title={Using Sets of Probability Measures to Represent Uncertainty},
author={Joseph Y. Halpern},
journal={arXiv preprint arXiv:cs/0608028},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608028},
primaryClass={cs.AI}
} | halpern2006using |
arxiv-674609 | cs/0608029 | Guessing Facets: Polytope Structure and Improved LP Decoder | <|reference_start|>Guessing Facets: Polytope Structure and Improved LP Decoder: A new approach for decoding binary linear codes by solving a linear program (LP) over a relaxed codeword polytope was recently proposed by Feldman et al. In this paper we investigate the structure of the polytope used in the LP relaxation decoding. We begin by showing that for expander codes, every fractional pseudocodeword always has at least a constant fraction of non-integral bits. We then prove that for expander codes, the active set of any fractional pseudocodeword is smaller by a constant fraction than the active set of any codeword. We exploit this fact to devise a decoding algorithm that provably outperforms the LP decoder for finite blocklengths. It proceeds by guessing facets of the polytope, and resolving the linear program on these facets. While the LP decoder succeeds only if the ML codeword has the highest likelihood over all pseudocodewords, we prove that for expander codes the proposed algorithm succeeds even with a constant number of pseudocodewords of higher likelihood. Moreover, the complexity of the proposed algorithm is only a constant factor larger than that of the LP decoder.<|reference_end|> | arxiv | @article{dimakis2006guessing,
title={Guessing Facets: Polytope Structure and Improved LP Decoder},
author={Alexandros G. Dimakis, Martin J. Wainwright},
journal={arXiv preprint arXiv:cs/0608029},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608029},
primaryClass={cs.IT math.IT}
} | dimakis2006guessing |
arxiv-674610 | cs/0608030 | On Quasi-Interpretations, Blind Abstractions and Implicit Complexity | <|reference_start|>On Quasi-Interpretations, Blind Abstractions and Implicit Complexity: Quasi-interpretations are a technique to guarantee complexity bounds on first-order functional programs: with termination orderings they give in particular a sufficient condition for a program to be executable in polynomial time, called here the P-criterion. We study properties of the programs satisfying the P-criterion, in order to better understand its intensional expressive power. Given a program on binary lists, its blind abstraction is the nondeterministic program obtained by replacing lists by their lengths (natural numbers). A program is blindly polynomial if its blind abstraction terminates in polynomial time. We show that all programs satisfying a variant of the P-criterion are in fact blindly polynomial. Then we give two extensions of the P-criterion: one by relaxing the termination ordering condition, and the other one (the bounded value property) giving a necessary and sufficient condition for a program to be polynomial time executable, with memoisation.<|reference_end|> | arxiv | @article{baillot2006on,
title={On Quasi-Interpretations, Blind Abstractions and Implicit Complexity},
author={Patrick Baillot, Ugo Dal Lago and Jean-Yves Moyen},
journal={arXiv preprint arXiv:cs/0608030},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608030},
primaryClass={cs.PL cs.CC cs.LO}
} | baillot2006on |
arxiv-674611 | cs/0608031 | Secure Positioning of Mobile Terminals with Simplex Radio Communication | <|reference_start|>Secure Positioning of Mobile Terminals with Simplex Radio Communication: With the rapid spread of various mobile terminals in our society, the importance of secure positioning is growing for wireless networks in adversarial settings. Recently, several authors have proposed a secure positioning mechanism of mobile terminals which is based on the geometric property of wireless node placement, and on the postulate of modern physics that a propagation speed of information never exceeds the velocity of light. In particular, they utilize the measurements of the round-trip time of radio signal propagation and bidirectional communication for variants of the challenge-and-response. In this paper, we propose a novel means to construct the above mechanism by use of unidirectional communication instead of bidirectional communication. Our proposal is based on the assumption that a mobile terminal incorporates a high-precision inner clock in a tamper-resistant protected area. In positioning, the mobile terminal uses its inner clock and the time and location information broadcasted by radio from trusted stations. Our proposal has a major advantage in protecting the location privacy of mobile terminal users, because the mobile terminal need not provide any information to the trusted stations through positioning procedures. Besides, our proposal is free from the positioning error due to claimant's processing-time fluctuations in the challenge-and-response, and is well-suited for mobile terminals in the open air, or on the move at high speed, in terms of practical usage. We analyze the security, the functionality, and the feasibility of our proposal in comparison to previous proposals.<|reference_end|> | arxiv | @article{fujii2006secure,
title={Secure Positioning of Mobile Terminals with Simplex Radio Communication},
author={Mikio Fujii},
journal={arXiv preprint arXiv:cs/0608031},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608031},
primaryClass={cs.CR}
} | fujii2006secure |
arxiv-674612 | cs/0608032 | Satisfying KBO Constraints | <|reference_start|>Satisfying KBO Constraints: This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for the precedence are encoded in (pseudo-)propositional logic and the resulting formula is tested for satisfiability. Any satisfying assignment represents a weight function and a precedence such that the induced Knuth-Bendix order orients the rules of the encoded rewrite system from left to right.<|reference_end|> | arxiv | @article{zankl2006satisfying,
title={Satisfying KBO Constraints},
author={Harald Zankl, Aart Middeldorp},
journal={arXiv preprint arXiv:cs/0608032},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608032},
primaryClass={cs.SC cs.LO}
} | zankl2006satisfying |
arxiv-674613 | cs/0608033 | A Study on Learnability for Rigid Lambek Grammars | <|reference_start|>A Study on Learnability for Rigid Lambek Grammars: We present basic notions of Gold's "learnability in the limit" paradigm, first presented in 1967, a formalization of the cognitive process by which a native speaker gets to grasp the underlying grammar of his/her own native language by being exposed to well formed sentences generated by that grammar. Then we present Lambek grammars, a formalism issued from categorial grammars which, although not as expressive as needed for a full formalization of natural languages, is particularly suited to easily implement a natural interface between syntax and semantics. In the last part of this work, we present a learnability result for Rigid Lambek grammars from structured examples.<|reference_end|> | arxiv | @article{bonato2006a,
title={A Study on Learnability for Rigid Lambek Grammars},
author={Roberto Bonato (INRIA Futurs, LaBRI)},
journal={arXiv preprint arXiv:cs/0608033},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608033},
primaryClass={cs.LG}
} | bonato2006a |
arxiv-674614 | cs/0608034 | Security Assessment of E-Tax Filing Websites | <|reference_start|>Security Assessment of E-Tax Filing Websites: Technical security is only part of E-Commerce security operations; human usability and security perception play major and sometimes dominating factors. For instance, slick websites with impressive security icons but no real technical security are often perceived by users to be trustworthy (and thus more profitable) than plain vanilla websites that use powerful encryption for transmission and server protection. We study one important type of E-Commerce transaction website, E-Tax Filing, that is exposed to large populations. We assess a large number of international (5), Federal (USA), and state E-Tax filing websites (38) for both technical security protection and human perception of security. As a result of this assessment, we identify security best practices across these E-Tax Filing websites and recommend additional security techniques that have not been found in current use by E-Tax Filing websites.<|reference_end|> | arxiv | @article{sharma2006security,
title={Security Assessment of E-Tax Filing Websites},
author={Aashish Sharma, William Yurcik},
journal={arXiv preprint arXiv:cs/0608034},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608034},
primaryClass={cs.CR}
} | sharma2006security |
arxiv-674615 | cs/0608035 | Resource Usage Analysis for the Pi-Calculus | <|reference_start|>Resource Usage Analysis for the Pi-Calculus: We propose a type-based resource usage analysis for the π-calculus extended with resource creation/access primitives. The goal of the resource usage analysis is to statically check that a program accesses resources such as files and memory in a valid manner. Our type system is an extension of previous behavioral type systems for the π-calculus, and can guarantee the safety property that no invalid access is performed, as well as the property that necessary accesses (such as the close operation for a file) are eventually performed unless the program diverges. A sound type inference algorithm for the type system is also developed to free the programmer from the burden of writing complex type annotations. Based on the algorithm, we have implemented a prototype resource usage analyzer for the π-calculus. To the authors' knowledge, ours is the first type-based resource usage analysis that deals with an expressive concurrent language like the pi-calculus.<|reference_end|> | arxiv | @article{kobayashi2006resource,
title={Resource Usage Analysis for the Pi-Calculus},
author={Naoki Kobayashi, Kohei Suenaga, and Lucian Wischik},
journal={Logical Methods in Computer Science, Volume 2, Issue 3 (September
13, 2006) lmcs:2246},
year={2006},
doi={10.2168/LMCS-2(3:4)2006},
archivePrefix={arXiv},
eprint={cs/0608035},
primaryClass={cs.PL cs.LO}
} | kobayashi2006resource |
arxiv-674616 | cs/0608036 | Reversal Complexity Revisited | <|reference_start|>Reversal Complexity Revisited: We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several further tapes on which head reversals remain unrestricted, but size is bounded by s(n). Recently, such machines were introduced as a formalization of a computation model that restricts random access to external memory and internal memory space. Here, each of the tapes with a restriction on the head reversals corresponds to an external memory device, and the tapes of restricted size model internal memory. We use ST(r(n),s(n),O(1)) to denote the class of all problems that can be solved by deterministic Turing machines that comply to the above resource bounds. Similarly, NST and RST, respectively, are used for the corresponding nondeterministic and randomized classes. While previous papers focused on lower bounds for particular problems, including sorting, the set equality problem, and several query evaluation problems, the present paper addresses the relations between the (R,N)ST-classes and classical complexity classes and investigates the structural complexity of the (R,N)ST-classes. Our main results are (1) a trade-off between internal memory space and external memory head reversals, (2) correspondences between the (R,N)ST-classes and ``classical'' time-bounded, space-bounded, reversal-bounded, and circuit complexity classes, and (3) hierarchies of (R)ST-classes in terms of increasing numbers of head reversals on external memory tapes.<|reference_end|> | arxiv | @article{hernich2006reversal,
title={Reversal Complexity Revisited},
author={Andre Hernich, Nicole Schweikardt},
journal={arXiv preprint arXiv:cs/0608036},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608036},
primaryClass={cs.CC}
} | hernich2006reversal |
arxiv-674617 | cs/0608037 | Cascade hash tables: a series of multilevel double hashing schemes with O(1) worst case lookup time | <|reference_start|>Cascade hash tables: a series of multilevel double hashing schemes with O(1) worst case lookup time: In this paper, the author proposes a series of multilevel double hashing schemes called cascade hash tables. They use several levels of hash tables. In each table, we use the common double hashing scheme. Higher level hash tables work as fail-safes of lower level hash tables. By this strategy, it could effectively reduce collisions in hash insertion. Thus it gains a constant worst case lookup time with a relatively high load factor(70%-85%) in random experiments. Different parameters of cascade hash tables are tested.<|reference_end|> | arxiv | @article{li2006cascade,
title={Cascade hash tables: a series of multilevel double hashing schemes with
O(1) worst case lookup time},
author={Shaohua Li},
journal={arXiv preprint arXiv:cs/0608037},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608037},
primaryClass={cs.DS cs.AI}
} | li2006cascade |
arxiv-674618 | cs/0608038 | Morphisms of Coloured Petri Nets | <|reference_start|>Morphisms of Coloured Petri Nets: We introduce the concept of a morphism between coloured nets. Our definition generalizes Petris definition for ordinary nets. A morphism of coloured nets maps the topological space of the underlying undirected net as well as the kernel and cokernel of the incidence map. The kernel are flows along the transition-bordered fibres of the morphism, the cokernel are classes of markings of the place-bordered fibres. The attachment of bindings, colours, flows and marking classes to a subnet is formalized by using concepts from sheaf theory. A coloured net is a sheaf-cosheaf pair over a Petri space and a morphism between coloured nets is a morphism between such pairs. Coloured nets and their morphisms form a category. We prove the existence of a product in the subcategory of sort-respecting morphisms. After introducing markings our concepts generalize to coloured Petri nets.<|reference_end|> | arxiv | @article{wehler2006morphisms,
title={Morphisms of Coloured Petri Nets},
author={Joachim Wehler},
journal={arXiv preprint arXiv:cs/0608038},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608038},
primaryClass={cs.SE}
} | wehler2006morphisms |
arxiv-674619 | cs/0608039 | The weak pigeonhole principle for function classes in S^1_2 | <|reference_start|>The weak pigeonhole principle for function classes in S^1_2: It is well known that S^1_2 cannot prove the injective weak pigeonhole principle for polynomial time functions unless RSA is insecure. In this note we investigate the provability of the surjective (dual) weak pigeonhole principle in S^1_2 for provably weaker function classes.<|reference_end|> | arxiv | @article{danner2006the,
title={The weak pigeonhole principle for function classes in S^1_2},
author={Norman Danner and Chris Pollett},
journal={Mathematical Logic Quarterly 52(6):575-584, 2006},
year={2006},
doi={10.1002/malq.200610015},
archivePrefix={arXiv},
eprint={cs/0608039},
primaryClass={cs.LO}
} | danner2006the |
arxiv-674620 | cs/0608040 | An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus | <|reference_start|>An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus: This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in the Blum-Shub-Smale (BSS) model on the other. Given a fixed ring structure K we define an extension of Terui's light affine lambda-calculus typed in LAL (Light Affine Logic) with a basic type for K. We show that this calculus captures the polynomial time function class FP(K): every typed term can be evaluated in polynomial time and conversely every polynomial time BSS machine over K can be simulated in this calculus.<|reference_end|> | arxiv | @article{baillot2006an,
title={An Embedding of the BSS Model of Computation in Light Affine
Lambda-Calculus},
author={Patrick Baillot (LIPN), Marco Pedicini},
journal={8th International Workshop on Logic and Computational Complexity
Seattle, August 10 - 11, 2006 (Satellite Workshop of FLOC-LICS 2006),
\'{E}tats-Unis d'Am\'{e}rique (2006)},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608040},
primaryClass={cs.LO}
} | baillot2006an |
arxiv-674621 | cs/0608041 | The Dynamics of A Self-Forming Network | <|reference_start|>The Dynamics of A Self-Forming Network: This article describes our strategy for deploying self-forming ad hoc networks based on the Internet Protocol version 6 and evaluates the dynamics of this proposal. Among others, we suggest a technique called adaptive routing that provides secure intelligent routing capabilities to computer communication networks. This technique uses the flow label, supports hybrid metrics, network load sharing, and is not restricted to evaluation of performance on first hop routers when making routing decisions. Selective anycasting is an extension to the anycast addressing model that supports exclusion of members of groups that perform poorly or inappropriately on a per-host basis. Distributed name lookup is suggested for integrating self-forming and global networks where they coexist. At last, we pose an address hierarchy to support unmanaged discovery of services in unknown networks.<|reference_end|> | arxiv | @article{sobrado2006the,
title={The Dynamics of A Self-Forming Network},
author={Igor Sobrado and Dave Uhring},
journal={arXiv preprint arXiv:cs/0608041},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608041},
primaryClass={cs.NI}
} | sobrado2006the |
arxiv-674622 | cs/0608042 | An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels | <|reference_start|>An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels: This paper derives an improved sphere-packing (ISP) bound for finite-length codes whose transmission takes place over symmetric memoryless channels. We first review classical results, i.e., the 1959 sphere-packing (SP59) bound of Shannon for the Gaussian channel, and the 1967 sphere-packing (SP67) bound of Shannon et al. for discrete memoryless channels. A recent improvement on the SP67 bound, as suggested by Valembois and Fossorier, is also discussed. These concepts are used for the derivation of a new lower bound on the decoding error probability (referred to as the ISP bound) which is uniformly tighter than the SP67 bound and its recent improved version. The ISP bound is applicable to symmetric memoryless channels, and some of its applications are exemplified. Its tightness is studied by comparing it with bounds on the ML decoding error probability, and computer simulations of iteratively decoded turbo-like codes. The paper also presents a technique which performs the entire calculation of the SP59 bound in the logarithmic domain, thus facilitating the exact calculation of this bound for moderate to large block lengths without the need for the asymptotic approximations provided by Shannon.<|reference_end|> | arxiv | @article{wiechman2006an,
title={An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric
Memoryless Channels},
author={Gil Wiechman and Igal Sason},
journal={arXiv preprint arXiv:cs/0608042},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608042},
primaryClass={cs.IT math.IT}
} | wiechman2006an |
arxiv-674623 | cs/0608043 | Using Users' Expectations to Adapt Business Intelligence Systems | <|reference_start|>Using Users' Expectations to Adapt Business Intelligence Systems: This paper takes a look at the general characteristics of business or economic intelligence system. The role of the user within this type of system is emphasized. We propose two models which we consider important in order to adapt this system to the user. The first model is based on the definition of decisional problem and the second on the four cognitive phases of human learning. We also describe the application domain we are using to test these models in this type of system.<|reference_end|> | arxiv | @article{afolabi2006using,
title={Using Users' Expectations to Adapt Business Intelligence Systems},
author={Babajide Afolabi (LORIA), Odile Thiery (LORIA)},
journal={Advances in Knowledge Organization 10 (2006) 247-254},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608043},
primaryClass={cs.IR}
} | afolabi2006using |
arxiv-674624 | cs/0608044 | Network Coding in a Multicast Switch | <|reference_start|>Network Coding in a Multicast Switch: We consider the problem of serving multicast flows in a crossbar switch. We show that linear network coding across packets of a flow can sustain traffic patterns that cannot be served if network coding were not allowed. Thus, network coding leads to a larger rate region in a multicast crossbar switch. We demonstrate a traffic pattern which requires a switch speedup if coding is not allowed, whereas, with coding the speedup requirement is eliminated completely. In addition to throughput benefits, coding simplifies the characterization of the rate region. We give a graph-theoretic characterization of the rate region with fanout splitting and intra-flow coding, in terms of the stable set polytope of the 'enhanced conflict graph' of the traffic pattern. Such a formulation is not known in the case of fanout splitting without coding. We show that computing the offline schedule (i.e. using prior knowledge of the flow arrival rates) can be reduced to certain graph coloring problems. Finally, we propose online algorithms (i.e. using only the current queue occupancy information) for multicast scheduling based on our graph-theoretic formulation. In particular, we show that a maximum weighted stable set algorithm stabilizes the queues for all rates within the rate region.<|reference_end|> | arxiv | @article{sundararajan2006network,
title={Network Coding in a Multicast Switch},
author={Jay Kumar Sundararajan, Muriel Medard, MinJi Kim, Atilla Eryilmaz,
Devavrat Shah, Ralf Koetter},
journal={arXiv preprint arXiv:cs/0608044},
year={2006},
doi={10.1109/INFCOM.2007.137},
archivePrefix={arXiv},
eprint={cs/0608044},
primaryClass={cs.NI cs.IT math.IT}
} | sundararajan2006network |
arxiv-674625 | cs/0608045 | LiveWN, cpu scavenging in the Grid Era | <|reference_start|>LiveWN, cpu scavenging in the Grid Era: The goal of this research is to introduce an easy and versatile way to provide and use Grid resources without the need of any OS installation or middleware configuration. At the same time we provide an excellent training tool for newer Grid users and people that want to experiment, without enforcing any installation. We have been testing it thoroughly under different circumstances with firm success.<|reference_end|> | arxiv | @article{kouretis2006livewn,,
title={LiveWN, cpu scavenging in the Grid Era},
author={Giannis Kouretis, Fotis Georgatos},
journal={arXiv preprint arXiv:cs/0608045},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608045},
primaryClass={cs.DC cs.NI}
} | kouretis2006livewn, |
arxiv-674626 | cs/0608046 | From Grid Middleware to a Grid Operating System | <|reference_start|>From Grid Middleware to a Grid Operating System: Grid computing has made substantial advances during the last decade. Grid middleware such as Globus has contributed greatly in making this possible. There are, however, significant barriers to the adoption of Grid computing in other fields, most notably day-to-day user computing environments. We will demonstrate in this paper that this is primarily due to the limitations of the existing Grid middleware which does not take into account the needs of everyday scientific and business users. In this paper we will formally advocate a Grid Operating System and propose an architecture to migrate Grid computing into a Grid operating system which we believe would help remove most of the technical barriers to the adoption of Grid computing and make it relevant to the day-to-day user. We believe this proposed transition to a Grid operating system will drive more pervasive Grid computing research and application development and deployment in future.<|reference_end|> | arxiv | @article{ali2006from,
title={From Grid Middleware to a Grid Operating System},
author={Arshad Ali, Richard McClatchey, Ashiq Anjum, Irfan Habib, Kamran
Soomro, Mohammed Asif, Ali Adil, Athar Mohsin},
journal={arXiv preprint arXiv:cs/0608046},
year={2006},
doi={10.1109/GCC.2006.49},
archivePrefix={arXiv},
eprint={cs/0608046},
primaryClass={cs.DC}
} | ali2006from |
arxiv-674627 | cs/0608047 | Lessons Learned from MammoGrid for Integrated Biomedical Solutions | <|reference_start|>Lessons Learned from MammoGrid for Integrated Biomedical Solutions: This paper presents an overview of the MammoGrid project and some of its achievements. In terms of the global grid project, and European research in particular, the project has successfully demonstrated the capacity of a grid-based system to support effective collaboration between physicians, including handling and querying image databases, as well as using grid services, such as image standardization and Computer-Aided Detection (CADe) of suspect or indicative features. In terms of scientific results, in radiology, there have been significant epidemiological findings in the assessment of breast density as a risk factor, but the results for CADe are less clear-cut. Finally, the foundations of a technology transfer process to establish a working MammoGrid plus system in Spain through the company Maat GKnowledge and the collaboration of CIEMAT and hospitals in Extremadura.<|reference_end|> | arxiv | @article{mcclatchey2006lessons,
title={Lessons Learned from MammoGrid for Integrated Biomedical Solutions},
author={R. H. McClatchey, D. Manset, A. E. Solomonides},
journal={arXiv preprint arXiv:cs/0608047},
year={2006},
doi={10.1109/CBMS.2006.109},
archivePrefix={arXiv},
eprint={cs/0608047},
primaryClass={cs.DC}
} | mcclatchey2006lessons |
arxiv-674628 | cs/0608048 | Bulk Scheduling with the DIANA Scheduler | <|reference_start|>Bulk Scheduling with the DIANA Scheduler: Results from the research and development of a Data Intensive and Network Aware (DIANA) scheduling engine, to be used primarily for data intensive sciences such as physics analysis, are described. In Grid analyses, tasks can involve thousands of computing, data handling, and network resources. The central problem in the scheduling of these resources is the coordinated management of computation and data at multiple locations and not just data replication or movement. However, this can prove to be a rather costly operation and efficient sing can be a challenge if compute and data resources are mapped without considering network costs. We have implemented an adaptive algorithm within the so-called DIANA Scheduler which takes into account data location and size, network performance and computation capability in order to enable efficient global scheduling. DIANA is a performance-aware and economy-guided Meta Scheduler. It iteratively allocates each job to the site that is most likely to produce the best performance as well as optimizing the global queue for any remaining jobs. Therefore it is equally suitable whether a single job is being submitted or bulk scheduling is being performed. Results indicate that considerable performance improvements can be gained by adopting the DIANA scheduling approach.<|reference_end|> | arxiv | @article{anjum2006bulk,
title={Bulk Scheduling with the DIANA Scheduler},
author={Ashiq Anjum, Richard McClatchey, Arshad Ali and Ian Willers},
journal={arXiv preprint arXiv:cs/0608048},
year={2006},
doi={10.1109/TNS.2006.886047},
archivePrefix={arXiv},
eprint={cs/0608048},
primaryClass={cs.DC}
} | anjum2006bulk |
arxiv-674629 | cs/0608049 | Solving non-uniqueness in agglomerative hierarchical clustering using multidendrograms | <|reference_start|>Solving non-uniqueness in agglomerative hierarchical clustering using multidendrograms: In agglomerative hierarchical clustering, pair-group methods suffer from a problem of non-uniqueness when two or more distances between different clusters coincide during the amalgamation process. The traditional approach for solving this drawback has been to take any arbitrary criterion in order to break ties between distances, which results in different hierarchical classifications depending on the criterion followed. In this article we propose a variable-group algorithm that consists in grouping more than two clusters at the same time when ties occur. We give a tree representation for the results of the algorithm, which we call a multidendrogram, as well as a generalization of the Lance and Williams' formula which enables the implementation of the algorithm in a recursive way.<|reference_end|> | arxiv | @article{fernandez2006solving,
title={Solving non-uniqueness in agglomerative hierarchical clustering using
multidendrograms},
author={Alberto Fernandez and Sergio Gomez},
journal={Journal of Classification 25 (2008) 43-65},
year={2006},
doi={10.1007/s00357-008-9004-x},
archivePrefix={arXiv},
eprint={cs/0608049},
primaryClass={cs.IR math.ST physics.data-an stat.TH}
} | fernandez2006solving |
arxiv-674630 | cs/0608050 | Post-Processing Hierarchical Community Structures: Quality Improvements and Multi-scale View | <|reference_start|>Post-Processing Hierarchical Community Structures: Quality Improvements and Multi-scale View: Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Most existing community detection algorithms produce a hierarchical structure of community and seek a partition into communities that optimizes a given quality function. We propose new methods to improve the results of any of these algorithms. First we show how to optimize a general class of additive quality functions (containing the modularity, the performance, and a new similarity based quality function we propose) over a larger set of partitions than the classical methods. Moreover, we define new multi-scale quality functions which make it possible to detect the different scales at which meaningful community structures appear, while classical approaches find only one partition.<|reference_end|> | arxiv | @article{pons2006post-processing,
title={Post-Processing Hierarchical Community Structures: Quality Improvements
and Multi-scale View},
author={Pascal Pons and Matthieu Latapy},
journal={Theoretical Computer Science, volume 412, issues 8-10, 4 March
2011, pages 892-900},
year={2006},
doi={10.1016/j.tcs.2010.11.041},
archivePrefix={arXiv},
eprint={cs/0608050},
primaryClass={cs.DS cond-mat.dis-nn physics.soc-ph}
} | pons2006post-processing |
arxiv-674631 | cs/0608051 | Modules over Monads and Linearity | <|reference_start|>Modules over Monads and Linearity: Inspired by the classical theory of modules over a monoid, we give a first account of the natural notion of module over a monad. The associated notion of morphism of left modules ("Linear" natural transformations) captures an important property of compatibility with substitution, in the heterogeneous case where "terms" and variables therein could be of different types as well as in the homogeneous case. In this paper, we present basic constructions of modules and we show examples concerning in particular abstract syntax and lambda-calculus.<|reference_end|> | arxiv | @article{hirschowitz2006modules,
title={Modules over Monads and Linearity},
author={Andr'e Hirschowitz, Marco Maggesi},
journal={arXiv preprint arXiv:cs/0608051},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608051},
primaryClass={cs.LO cs.PL}
} | hirschowitz2006modules |
arxiv-674632 | cs/0608052 | GDF - A general dataformat for biosignals | <|reference_start|>GDF - A general dataformat for biosignals: Biomedical signals are stored in many different data formats. Most formats have been developed for a specific purpose of a specialized community for ECG research, EEG analysis, sleep research, etc. So far none of the existing formats can be considered a general purpose data format for biomedical signals. In order to solve this problem and to unify the various needs of the various biomedical signal processing fields, the so-called "General Data Format for biomedical signals" (GDF) is developed. This GDF format is fully described and specified. Software for reading and writing GDF data is implemented in Octave/Matlab and C/C++ and provided through BioSig - an free and open source software library for biomedical signal processing. BioSig privides also converters from various data formats to GDF, and a viewing and scoring software.<|reference_end|> | arxiv | @article{schlögl2006gdf,
title={GDF - A general dataformat for biosignals},
author={Alois Schl"ogl},
journal={arXiv preprint arXiv:cs/0608052},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608052},
primaryClass={cs.DL}
} | schlögl2006gdf |
arxiv-674633 | cs/0608053 | Renormalization group approach to the P versus NP question | <|reference_start|>Renormalization group approach to the P versus NP question: This paper argues that the ideas underlying the renormalization group technique used to characterize phase transitions in condensed matter systems could be useful for distinguishing computational complexity classes. The paper presents a renormalization group transformation that maps an arbitrary Boolean function of $N$ Boolean variables to one of $N-1$ variables. When this transformation is applied repeatedly, the behavior of the resulting sequence of functions is different for a generic Boolean function than for Boolean functions that can be written as a polynomial of degree $\xi$ with $\xi \ll N$ as well as for functions that depend on composite variables such as the arithmetic sum of the inputs. Being able to demonstrate that functions are non-generic is of interest because it suggests an avenue for constructing an algorithm capable of demonstrating that a given Boolean function cannot be computed using resources that are bounded by a polynomial of $N$.<|reference_end|> | arxiv | @article{coppersmith2006renormalization,
title={Renormalization group approach to the P versus NP question},
author={S.N. Coppersmith},
journal={arXiv preprint arXiv:cs/0608053},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608053},
primaryClass={cs.CC cond-mat.stat-mech}
} | coppersmith2006renormalization |
arxiv-674634 | cs/0608054 | Dispersion of Mass and the Complexity of Randomized Geometric Algorithms | <|reference_start|>Dispersion of Mass and the Complexity of Randomized Geometric Algorithms: How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a notion of dispersion and connect it to asymptotic convex geometry. We obtain a nearly quadratic lower bound on the complexity of randomized volume algorithms for convex bodies in R^n (the current best algorithm has complexity roughly n^4, conjectured to be n^3). Our main tools, dispersion of random determinants and dispersion of the length of a random point from a convex body, are of independent interest and applicable more generally; in particular, the latter is closely related to the variance hypothesis from convex geometry. This geometric dispersion also leads to lower bounds for matrix problems and property testing.<|reference_end|> | arxiv | @article{rademacher2006dispersion,
title={Dispersion of Mass and the Complexity of Randomized Geometric Algorithms},
author={Luis Rademacher, Santosh Vempala},
journal={arXiv preprint arXiv:cs/0608054},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608054},
primaryClass={cs.CC cs.CG cs.DS math.FA}
} | rademacher2006dispersion |
arxiv-674635 | cs/0608055 | MDS Ideal Secret Sharing Scheme from AG-codes on Elliptic Curves | <|reference_start|>MDS Ideal Secret Sharing Scheme from AG-codes on Elliptic Curves: For a secret sharing scheme, two parameters $d_{min}$ and $d_{cheat}$ are defined in [12] and [13]. These two parameters measure the error-correcting capability and the secret-recovering capability of the secret sharing scheme against cheaters. Some general properties of the parameters have been studied in [12,[9] and [13]. The MDS secret-sharing scheme was defined in [12] and it is proved that MDS perfect secret sharing scheme can be constructed for any monotone access structure. The famous Shamir $(k,n)$ threshold secret sharing scheme is the MDS with $d_{min}=d_{cheat}=n-k+1$. In [3] we proposed the linear secret sharing scheme from algebraic-geometric codes. In this paper the linear secret sharing scheme from AG-codes on elliptic curves is studied and it is shown that many of them are MDS linear secret sharing scheme.<|reference_end|> | arxiv | @article{chen2006mds,
title={MDS Ideal Secret Sharing Scheme from AG-codes on Elliptic Curves},
author={Hao Chen},
journal={arXiv preprint arXiv:cs/0608055},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608055},
primaryClass={cs.CR}
} | chen2006mds |
arxiv-674636 | cs/0608056 | Wiretap Channel With Side Information | <|reference_start|>Wiretap Channel With Side Information: This submission has been withdrawn by the author.<|reference_end|> | arxiv | @article{dai2006wiretap,
title={Wiretap Channel With Side Information},
author={Bin Dai, Yuan Luo},
journal={arXiv preprint arXiv:cs/0608056},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608056},
primaryClass={cs.IT math.IT}
} | dai2006wiretap |
arxiv-674637 | cs/0608057 | Hybrid Elections Broaden Complexity-Theoretic Resistance to Control | <|reference_start|>Hybrid Elections Broaden Complexity-Theoretic Resistance to Control: Electoral control refers to attempts by an election's organizer ("the chair") to influence the outcome by adding/deleting/partitioning voters or candidates. The groundbreaking work of Bartholdi, Tovey, and Trick [BTT92] on (constructive) control proposes computational complexity as a means of resisting control attempts: Look for election systems where the chair's task in seeking control is itself computationally infeasible. We introduce and study a method of combining two or more candidate-anonymous election schemes in such a way that the combined scheme possesses all the resistances to control (i.e., all the NP-hardnesses of control) possessed by any of its constituents: It combines their strengths. From this and new resistance constructions, we prove for the first time that there exists an election scheme that is resistant to all twenty standard types of electoral control.<|reference_end|> | arxiv | @article{hemaspaandra2006hybrid,
title={Hybrid Elections Broaden Complexity-Theoretic Resistance to Control},
author={Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe},
journal={arXiv preprint arXiv:cs/0608057},
year={2006},
number={URCS TR-2006-900},
archivePrefix={arXiv},
eprint={cs/0608057},
primaryClass={cs.GT cs.CC cs.MA}
} | hemaspaandra2006hybrid |
arxiv-674638 | cs/0608058 | Evolution of the Internet AS-Level Ecosystem | <|reference_start|>Evolution of the Internet AS-Level Ecosystem: We present an analytically tractable model of Internet evolution at the level of Autonomous Systems (ASs). We call our model the multiclass preferential attachment (MPA) model. As its name suggests, it is based on preferential attachment. All of its parameters are measurable from available Internet topology data. Given the estimated values of these parameters, our analytic results predict a definitive set of statistics characterizing the AS topology structure. These statistics are not part of the model formulation. The MPA model thus closes the "measure-model-validate-predict" loop, and provides further evidence that preferential attachment is a driving force behind Internet evolution.<|reference_end|> | arxiv | @article{shakkottai2006evolution,
title={Evolution of the Internet AS-Level Ecosystem},
author={Srinivas Shakkottai, Marina Fomenkov, Ryan Koga, Dmitri Krioukov, kc
claffy},
journal={Eur. Phys. J. B 74, 271-278 (2010)},
year={2006},
doi={10.1140/epjb/e2010-00057-x},
archivePrefix={arXiv},
eprint={cs/0608058},
primaryClass={cs.NI cs.GT physics.soc-ph}
} | shakkottai2006evolution |
arxiv-674639 | cs/0608059 | A Distribution Law for CCS and a New Congruence Result for the pi-calculus | <|reference_start|>A Distribution Law for CCS and a New Congruence Result for the pi-calculus: We give an axiomatisation of strong bisimilarity on a small fragment of CCS that does not feature the sum operator. This axiomatisation is then used to derive congruence of strong bisimilarity in the finite pi-calculus in absence of sum. To our knowledge, this is the only nontrivial subcalculus of the pi-calculus that includes the full output prefix and for which strong bisimilarity is a congruence.<|reference_end|> | arxiv | @article{hirschkoff2006a,
title={A Distribution Law for CCS and a New Congruence Result for the
pi-calculus},
author={Daniel Hirschkoff, Damien Pous},
journal={Logical Methods in Computer Science, Volume 4, Issue 2 (May 14,
2008) lmcs:823},
year={2006},
doi={10.2168/LMCS-4(2:4)2008},
archivePrefix={arXiv},
eprint={cs/0608059},
primaryClass={cs.LO}
} | hirschkoff2006a |
arxiv-674640 | cs/0608060 | Duality and Capacity Region of AF Relay MAC and BC | <|reference_start|>Duality and Capacity Region of AF Relay MAC and BC: We consider multi-hop multiple access (MAC) and broadcast channels (BC) where communication takes place with the assistance of relays that amplify and forward (AF) their received signals. For a two hop parallel AF relay MAC, assuming a sum power constraint across all relays we characterize optimal relay amplification factors and the resulting capacity regions. We find that the parallel AF relay MAC with total transmit power of the two users $P_1+P_2=P$ and total relay power $P_R$ is the dual of the parallel AF relay BC where the MAC source nodes become the BC destination nodes, the MAC destination node becomes the BC source node, the dual BC source transmit power is $P_R$ and the total transmit power of the AF relays is $P$. The duality means that the capacity region of the AF relay MAC with a sum power constraint $P$ on the transmitters is the same as that of the dual BC. The duality relationship is found to be useful in characterizing the capacity region of the AF relay BC as the union of MAC capacity regions. The duality extends to distributed relays with multiple antennas and more than 2 hops as well.<|reference_end|> | arxiv | @article{jafar2006duality,
title={Duality and Capacity Region of AF Relay MAC and BC},
author={Syed A. Jafar, Krishna S. Gomadam},
journal={arXiv preprint arXiv:cs/0608060},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608060},
primaryClass={cs.IT math.IT}
} | jafar2006duality |
arxiv-674641 | cs/0608061 | Concurrent Processing Memory | <|reference_start|>Concurrent Processing Memory: A theoretical memory with limited processing power and internal connectivity at each element is proposed. This memory carries out parallel processing within itself to solve generic array problems. The applicability of this in-memory finest-grain massive SIMD approach is studied in some details. For an array of N items, it reduces the total instruction cycle count of universal operations such as insertion/deletion and match finding to ~ 1, local operations such as filtering and template matching to ~ local operation size, and global operations such as sum, finding global limit and sorting to ~\sqroot{N} instruction cycles. It eliminates most streaming activities for data processing purpose on the system bus. Yet it remains general-purposed, easy to use, pin compatible with conventional memory, and practical for implementation.<|reference_end|> | arxiv | @article{wang2006concurrent,
title={Concurrent Processing Memory},
author={Chengpu Wang},
journal={arXiv preprint arXiv:cs/0608061},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608061},
primaryClass={cs.DC cs.AR cs.PF}
} | wang2006concurrent |
arxiv-674642 | cs/0608062 | Tarski's influence on computer science | <|reference_start|>Tarski's influence on computer science: The influence of Alfred Tarski on computer science was indirect but significant in a number of directions and was in certain respects fundamental. Here surveyed is the work of Tarski on the decision procedure for algebra and geometry, the method of elimination of quantifiers, the semantics of formal languages, modeltheoretic preservation theorems, and algebraic logic; various connections of each with computer science are taken up.<|reference_end|> | arxiv | @article{feferman2006tarski's,
title={Tarski's influence on computer science},
author={Solomon Feferman},
journal={Logical Methods in Computer Science, Volume 2, Issue 3 (September
27, 2006) lmcs:2248},
year={2006},
doi={10.2168/LMCS-2(3:6)2006},
archivePrefix={arXiv},
eprint={cs/0608062},
primaryClass={cs.GL cs.LO}
} | feferman2006tarski's |
arxiv-674643 | cs/0608063 | A Generic Lazy Evaluation Scheme for Exact Geometric Computations | <|reference_start|>A Generic Lazy Evaluation Scheme for Exact Geometric Computations: We present a generic C++ design to perform efficient and exact geometric computations using lazy evaluations. Exact geometric computations are critical for the robustness of geometric algorithms. Their efficiency is also critical for most applications, hence the need for delaying the exact computations at run time until they are actually needed. Our approach is generic and extensible in the sense that it is possible to make it a library which users can extend to their own geometric objects or primitives. It involves techniques such as generic functor adaptors, dynamic polymorphism, reference counting for the management of directed acyclic graphs and exception handling for detecting cases where exact computations are needed. It also relies on multiple precision arithmetic as well as interval arithmetic. We apply our approach to the whole geometric kernel of CGAL.<|reference_end|> | arxiv | @article{pion2006a,
title={A Generic Lazy Evaluation Scheme for Exact Geometric Computations},
author={Sylvain Pion (INRIA Sophia Antipolis), Andreas Fabri},
journal={arXiv preprint arXiv:cs/0608063},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608063},
primaryClass={cs.CG cs.PF}
} | pion2006a |
arxiv-674644 | cs/0608064 | A linear algebra approach to the differentiation index of generic DAE systems | <|reference_start|>A linear algebra approach to the differentiation index of generic DAE systems: The notion of differentiation index for DAE systems of arbitrary order with generic second members is discussed by means of the study of the behavior of the ranks of certain Jacobian associated sub-matrices. As a by-product, we obtain upper bounds for the regularity of the Hilbert-Kolchin function and the order of the ideal associated to the DAE systems under consideration, not depending on characteristic sets. Some quantitative and algorithmic results concerning differential transcendence bases and induced equivalent explicit ODE systems are also established.<|reference_end|> | arxiv | @article{d'alfonso2006a,
title={A linear algebra approach to the differentiation index of generic DAE
systems},
author={Lisi D'Alfonso, Gabriela Jeronimo, Pablo Solerno},
journal={arXiv preprint arXiv:cs/0608064},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608064},
primaryClass={cs.SC math.AC}
} | d'alfonso2006a |
arxiv-674645 | cs/0608065 | Combinatorial and Arithmetical Properties of Infinite Words Associated with Non-simple Quadratic Parry Numbers | <|reference_start|>Combinatorial and Arithmetical Properties of Infinite Words Associated with Non-simple Quadratic Parry Numbers: We study arithmetical and combinatorial properties of $\beta$-integers for $\beta$ being the root of the equation $x^2=mx-n, m,n \in \mathbb N, m \geq n+2\geq 3$. We determine with the accuracy of $\pm 1$ the maximal number of $\beta$-fractional positions, which may arise as a result of addition of two $\beta$-integers. For the infinite word $u_\beta$ coding distances between consecutive $\beta$-integers, we determine precisely also the balance. The word $u_\beta$ is the fixed point of the morphism $A \to A^{m-1}B$ and $B\to A^{m-n-1}B$. In the case $n=1$ the corresponding infinite word $u_\beta$ is sturmian and therefore 1-balanced. On the simplest non-sturmian example with $n\geq 2$, we illustrate how closely the balance and arithmetical properties of $\beta$-integers are related.<|reference_end|> | arxiv | @article{balková2006combinatorial,
title={Combinatorial and Arithmetical Properties of Infinite Words Associated
with Non-simple Quadratic Parry Numbers},
author={Lubom'ira Balkov'a, Edita Pelantov'a, and Ondv{r}ej Turek},
journal={arXiv preprint arXiv:cs/0608065},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608065},
primaryClass={cs.DM}
} | balková2006combinatorial |
arxiv-674646 | cs/0608066 | k-Connectivity in the Semi-Streaming Model | <|reference_start|>k-Connectivity in the Semi-Streaming Model: We present the first semi-streaming algorithms to determine k-connectivity of an undirected graph with k being any constant. The semi-streaming model for graph algorithms was introduced by Muthukrishnan in 2003 and turns out to be useful when dealing with massive graphs streamed in from an external storage device. Our two semi-streaming algorithms each compute a sparse subgraph of an input graph G and can use this subgraph in a postprocessing step to decide k-connectivity of G. To this end the first algorithm reads the input stream only once and uses time O(k^2*n) to process each input edge. The second algorithm reads the input k+1 times and needs time O(k+alpha(n)) per input edge. Using its constructed subgraph the second algorithm can also generate all l-separators of the input graph for all l<k.<|reference_end|> | arxiv | @article{zelke2006k-connectivity,
title={k-Connectivity in the Semi-Streaming Model},
author={Mariano Zelke},
journal={arXiv preprint arXiv:cs/0608066},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608066},
primaryClass={cs.DM cs.DS}
} | zelke2006k-connectivity |
arxiv-674647 | cs/0608067 | On Polynomial Time Computable Numbers | <|reference_start|>On Polynomial Time Computable Numbers: It will be shown that the polynomial time computable numbers form a field, and especially an algebraically closed field.<|reference_end|> | arxiv | @article{matsui2006on,
title={On Polynomial Time Computable Numbers},
author={Tetsushi Matsui},
journal={arXiv preprint arXiv:cs/0608067},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608067},
primaryClass={cs.CC}
} | matsui2006on |
arxiv-674648 | cs/0608068 | The Aligned-Coordinated Geographical Routing for Multihop Wireless Networks | <|reference_start|>The Aligned-Coordinated Geographical Routing for Multihop Wireless Networks: The stateless, low overhead and distributed nature of the Geographic routing protocols attract a lot of research attentions recently. Since the geographic routing would face void problems, leading to complementary routing such as perimeter routing which degrades the performance of geographic routing, most research works are focus on optimizing this complementary part of geographic routing to improve it. The greedy forwarding part of geographic routing provides an optimal routing performance in terms of path stretch. If the geographic routing could adapt the greedy forwarding more, its performance would be enhanced much more than to optimize the complementary routing such as perimeter routings. Our work is the first time to do so. The aligned physical coordinate is used to do the greedy forwarding routing decision which would lead more greedy forwarding. We evaluate our design to most geographic routing protocols, showing it helps much and maintain the stateless nature of geographic routing.<|reference_end|> | arxiv | @article{liu2006the,
title={The Aligned-Coordinated Geographical Routing for Multihop Wireless
Networks},
author={Ke Liu, Nael Abu-Ghazaleh},
journal={ijsnet 2008},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608068},
primaryClass={cs.NI cs.DC}
} | liu2006the |
arxiv-674649 | cs/0608069 | JiTS: Just-in-Time Scheduling for Real-Time Sensor Data Dissemination | <|reference_start|>JiTS: Just-in-Time Scheduling for Real-Time Sensor Data Dissemination: We consider the problem of real-time data dissemination in wireless sensor networks, in which data are associated with deadlines and it is desired for data to reach the sink(s) by their deadlines. To this end, existing real-time data dissemination work have developed packet scheduling schemes that prioritize packets according to their deadlines. In this paper, we first demonstrate that not only the scheduling discipline but also the routing protocol has a significant impact on the success of real-time sensor data dissemination. We show that the shortest path routing using the minimum number of hops leads to considerably better performance than Geographical Forwarding, which has often been used in existing real-time data dissemination work. We also observe that packet prioritization by itself is not enough for real-time data dissemination, since many high priority packets may simultaneously contend for network resources, deteriorating the network performance. Instead, real-time packets could be judiciously delayed to avoid severe contention as long as their deadlines can be met. Based on this observation, we propose a Just-in-Time Scheduling (JiTS) algorithm for scheduling data transmissions to alleviate the shortcomings of the existing solutions. We explore several policies for non-uniformly delaying data at different intermediate nodes to account for the higher expected contention as the packet gets closer to the sink(s). By an extensive simulation study, we demonstrate that JiTS can significantly improve the deadline miss ratio and packet drop ratio compared to existing approaches in various situations. Notably, JiTS improves the performance requiring neither lower layer support nor synchronization among the sensor nodes.<|reference_end|> | arxiv | @article{liu2006jits:,
title={JiTS: Just-in-Time Scheduling for Real-Time Sensor Data Dissemination},
author={Ke Liu, Nael Abu-Ghazaleh, Kyoung-Don Kang},
journal={PerCom 2006},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608069},
primaryClass={cs.NI cs.DC cs.PF}
} | liu2006jits: |
arxiv-674650 | cs/0608070 | Finite State Channels with Time-Invariant Deterministic Feedback | <|reference_start|>Finite State Channels with Time-Invariant Deterministic Feedback: We consider capacity of discrete-time channels with feedback for the general case where the feedback is a time-invariant deterministic function of the output samples. Under the assumption that the channel states take values in a finite alphabet, we find an achievable rate and an upper bound on the capacity. We further show that when the channel is indecomposable, and has no intersymbol interference (ISI), its capacity is given by the limit of the maximum of the (normalized) directed information between the input $X^N$ and the output $Y^N$, i.e. $C = \lim_{N \to \infty} \frac{1}{N} \max I(X^N \to Y^N)$, where the maximization is taken over the causal conditioning probability $Q(x^N||z^{N-1})$ defined in this paper. The capacity result is used to show that the source-channel separation theorem holds for time-invariant determinist feedback. We also show that if the state of the channel is known both at the encoder and the decoder then feedback does not increase capacity.<|reference_end|> | arxiv | @article{permuter2006finite,
title={Finite State Channels with Time-Invariant Deterministic Feedback},
author={Haim Permuter, Tsachy Weissman and Andrea Goldsmith},
journal={arXiv preprint arXiv:cs/0608070},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608070},
primaryClass={cs.IT math.IT}
} | permuter2006finite |
arxiv-674651 | cs/0608071 | Broadcast Cooperation Strategies for Two Colocated Users | <|reference_start|>Broadcast Cooperation Strategies for Two Colocated Users: This work considers the problem of communication from a single transmitter, over a network with colocated users, through an independent block Rayleigh fading channel. The colocation nature of the users allows cooperation, which increases the overall achievable rate, from the transmitter to the destined user. The transmitter is ignorant of the fading coefficients, while receivers have access to perfect channel state information (CSI). This gives rise to the multi-layer broadcast approach used by the transmitter. The broadcast approach allows, in our network setting, to improve the cooperation between the colocated users. That is due to the nature of broadcasting, where the better the channel quality, the more layers that can be decoded. The cooperation between the users is performed over an additive white Gaussian channels (AWGN), with a relaying power constraint, and unlimited bandwidth. Three commonly used cooperation techniques are studied: amplify-forward (AF), compress-forward (CF), and decode-forward (DF). These methods are extended using the broadcast approach, for the case of relaxed decoding delay constraint. For this case a separated processing of the layers, which includes multi-session cooperation is shown to be beneficial. Further, closed form expressions for infinitely many AF sessions and recursive expressions for the more complex CF are given. Numerical results for the various cooperation strategies demonstrate the efficiency of multi-session cooperation.<|reference_end|> | arxiv | @article{steiner2006broadcast,
title={Broadcast Cooperation Strategies for Two Colocated Users},
author={Avi Steiner, Amichai Sanderovich, Shlomo Shamai (Shitz)},
journal={arXiv preprint arXiv:cs/0608071},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608071},
primaryClass={cs.IT math.IT}
} | steiner2006broadcast |
arxiv-674652 | cs/0608072 | Applications of Random Parameter Matrices Kalman Filtering in Uncertain Observation and Multi-Model Systems | <|reference_start|>Applications of Random Parameter Matrices Kalman Filtering in Uncertain Observation and Multi-Model Systems: This paper considers the Linear Minimum Variance recursive state estimation for the linear discrete time dynamic system with random state transition and measurement matrices, i.e., random parameter matrices Kalman filtering. It is shown that such system can be converted to a linear dynamic system with deterministic parameter matrices but state-dependent process and measurement noises. It is proved that under mild conditions, the recursive state estimation of this system is still of the form of a modified Kalman filtering. More importantly, this result can be applied to Kalman filtering with intermittent and partial observations as well as randomly variant dynamic systems.<|reference_end|> | arxiv | @article{luo2006applications,
title={Applications of Random Parameter Matrices Kalman Filtering in Uncertain
Observation and Multi-Model Systems},
author={Dandan Luo, Yunmin Zhu},
journal={arXiv preprint arXiv:cs/0608072},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608072},
primaryClass={cs.IT math.IT}
} | luo2006applications |
arxiv-674653 | cs/0608073 | Parametrical Neural Networks and Some Other Similar Architectures | <|reference_start|>Parametrical Neural Networks and Some Other Similar Architectures: A review of works on associative neural networks accomplished during last four years in the Institute of Optical Neural Technologies RAS is given. The presentation is based on description of parametrical neural networks (PNN). For today PNN have record recognizing characteristics (storage capacity, noise immunity and speed of operation). Presentation of basic ideas and principles is accentuated.<|reference_end|> | arxiv | @article{litinskii2006parametrical,
title={Parametrical Neural Networks and Some Other Similar Architectures},
author={Leonid B. Litinskii},
journal={arXiv preprint arXiv:cs/0608073},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608073},
primaryClass={cs.CV cs.NE}
} | litinskii2006parametrical |
arxiv-674654 | cs/0608074 | From Invariants to Canonization in Parallel | <|reference_start|>From Invariants to Canonization in Parallel: A function $f$ of a graph is called a complete graph invariant if the isomorphism of graphs $G$ and $H$ is equivalent to the equality $f(G)=f(H)$. If, in addition, $f(G)$ is a graph isomorphic to $G$, then $f$ is called a canonical form for graphs. Gurevich proves that graphs have a polynomial-time computable canonical form exactly when they have a polynomial-time computable complete invariant. We extend this equivalence to the polylogarithmic-time model of parallel computation for classes of graphs with bounded rigidity index and for classes of graphs with small separators. In particular, our results apply to three representative classes of graphs embeddable into a fixed surface, namely, to 5-connected graphs, to 3-connected graphs admitting a polyhedral embedding, and 3-connected graphs admitting a large-edge-width embedding. Another application covers graphs with bounded treewidth. Since in the latter case an NC complete-invariant algorithm is known, we conclude that graphs of bounded treewidth have a canonical form (and even a canonical labeling) computable in NC.<|reference_end|> | arxiv | @article{koebler2006from,
title={From Invariants to Canonization in Parallel},
author={Johannes Koebler and Oleg Verbitsky},
journal={arXiv preprint arXiv:cs/0608074},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608074},
primaryClass={cs.CC}
} | koebler2006from |
arxiv-674655 | cs/0608075 | Design of multimedia processor based on metric computation | <|reference_start|>Design of multimedia processor based on metric computation: Media-processing applications, such as signal processing, 2D and 3D graphics rendering, and image compression, are the dominant workloads in many embedded systems today. The real-time constraints of those media applications have taxing demands on today's processor performances with low cost, low power and reduced design delay. To satisfy those challenges, a fast and efficient strategy consists in upgrading a low cost general purpose processor core. This approach is based on the personalization of a general RISC processor core according the target multimedia application requirements. Thus, if the extra cost is justified, the general purpose processor GPP core can be enforced with instruction level coprocessors, coarse grain dedicated hardware, ad hoc memories or new GPP cores. In this way the final design solution is tailored to the application requirements. The proposed approach is based on three main steps: the first one is the analysis of the targeted application using efficient metrics. The second step is the selection of the appropriate architecture template according to the first step results and recommendations. The third step is the architecture generation. This approach is experimented using various image and video algorithms showing its feasibility.<|reference_end|> | arxiv | @article{amor2006design,
title={Design of multimedia processor based on metric computation},
author={Nader Ben Amor (LESTER, CES), Yannick Le Moullec (LESTER),
Jean-Philippe Diguet (LESTER), Jean Luc Philippe (LESTER), Mohamed Abid (CES)},
journal={Advances in Engineering Software (Elsevier) Vol.36 No.7 (2005)
448-458},
year={2006},
doi={10.1016/j.advengsoft.2005.01.010},
archivePrefix={arXiv},
eprint={cs/0608075},
primaryClass={cs.AR}
} | amor2006design |
arxiv-674656 | cs/0608076 | Oblivious-Transfer Amplification | <|reference_start|>Oblivious-Transfer Amplification: Oblivious transfer is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately, oblivious transfer cannot be achieved in an unconditionally secure way for both parties from scratch. Therefore, it is a natural question what information-theoretic primitives or computational assumptions oblivious transfer can be based on. The results in our thesis are threefold. First, we present a protocol that implements oblivious transfer from a weakened oblivious transfer called universal oblivious transfer, where one of the two players may get additional information. Our reduction is about twice as efficient as previous results. Weak oblivious transfer is an even weaker form of oblivious transfer, where both players may obtain additional information about the other player's input, and where the output can contain errors. We give a new, weaker definition of weak oblivious transfer, as well as new reductions with a more detailed analysis. Finally, we carry over our results to the computational setting and show how a weak oblivious transfer that is sometimes incorrect and only mildly secure against computationally bounded adversaries can be strengthened.<|reference_end|> | arxiv | @article{wullschleger2006oblivious-transfer,
title={Oblivious-Transfer Amplification},
author={J"urg Wullschleger},
journal={arXiv preprint arXiv:cs/0608076},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608076},
primaryClass={cs.CR}
} | wullschleger2006oblivious-transfer |
arxiv-674657 | cs/0608077 | The Effect of Scheduling on Link Capacity in Multi-hopWireless Networks | <|reference_start|>The Effect of Scheduling on Link Capacity in Multi-hopWireless Networks: Existing models of Multi-Hop Wireless Networks (MHWNs) assume that interference estimators of link quality such as observed busy time predict the capacity of the links. We show that these estimators do not capture the intricate interactions that occur at the scheduling level, which have a large impact on effective link capacity under contention based MAC protocols. We observe that scheduling problems arise only among those interfering sources whose concurrent transmissions cannot be prevented by the MAC protocol's collision management mechanisms; other interfering sources can arbitrate the medium and coexist successfully. Based on this observation, we propose a methodology for rating links and show that it achieves high correlation with observed behavior in simulation. We then use this rating as part of a branch-and-bound framework based on a linear programming formulation for traffic engineering in static MHWNs and show that it achieves considerable improvement in performance relative to interference based models.<|reference_end|> | arxiv | @article{kolar2006the,
title={The Effect of Scheduling on Link Capacity in Multi-hopWireless Networks},
author={Vinay Kolar and Nael Abu-Ghazaleh},
journal={arXiv preprint arXiv:cs/0608077},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608077},
primaryClass={cs.NI cs.AR cs.PF}
} | kolar2006the |
arxiv-674658 | cs/0608078 | Searching for Globally Optimal Functional Forms for Inter-Atomic Potentials Using Parallel Tempering and Genetic Programming | <|reference_start|>Searching for Globally Optimal Functional Forms for Inter-Atomic Potentials Using Parallel Tempering and Genetic Programming: We develop a Genetic Programming-based methodology that enables discovery of novel functional forms for classical inter-atomic force-fields, used in molecular dynamics simulations. Unlike previous efforts in the field, that fit only the parameters to the fixed functional forms, we instead use a novel algorithm to search the space of many possible functional forms. While a follow-on practical procedure will use experimental and {\it ab inito} data to find an optimal functional form for a forcefield, we first validate the approach using a manufactured solution. This validation has the advantage of a well-defined metric of success. We manufactured a training set of atomic coordinate data with an associated set of global energies using the well-known Lennard-Jones inter-atomic potential. We performed an automatic functional form fitting procedure starting with a population of random functions, using a genetic programming functional formulation, and a parallel tempering Metropolis-based optimization algorithm. Our massively-parallel method independently discovered the Lennard-Jones function after searching for several hours on 100 processors and covering a miniscule portion of the configuration space. We find that the method is suitable for unsupervised discovery of functional forms for inter-atomic potentials/force-fields. We also find that our parallel tempering Metropolis-based approach significantly improves the optimization convergence time, and takes good advantage of the parallel cluster architecture.<|reference_end|> | arxiv | @article{slepoy2006searching,
title={Searching for Globally Optimal Functional Forms for Inter-Atomic
Potentials Using Parallel Tempering and Genetic Programming},
author={A. Slepoy, A. P. Thompson, M. D. Peters},
journal={arXiv preprint arXiv:cs/0608078},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608078},
primaryClass={cs.NE cs.AI}
} | slepoy2006searching |
arxiv-674659 | cs/0608079 | Algorithmic linear dimension reduction in the l_1 norm for sparse vectors | <|reference_start|>Algorithmic linear dimension reduction in the l_1 norm for sparse vectors: This paper develops a new method for recovering m-sparse signals that is simultaneously uniform and quick. We present a reconstruction algorithm whose run time, O(m log^2(m) log^2(d)), is sublinear in the length d of the signal. The reconstruction error is within a logarithmic factor (in m) of the optimal m-term approximation error in l_1. In particular, the algorithm recovers m-sparse signals perfectly and noisy signals are recovered with polylogarithmic distortion. Our algorithm makes O(m log^2 (d)) measurements, which is within a logarithmic factor of optimal. We also present a small-space implementation of the algorithm. These sketching techniques and the corresponding reconstruction algorithms provide an algorithmic dimension reduction in the l_1 norm. In particular, vectors of support m in dimension d can be linearly embedded into O(m log^2 d) dimensions with polylogarithmic distortion. We can reconstruct a vector from its low-dimensional sketch in time O(m log^2(m) log^2(d)). Furthermore, this reconstruction is stable and robust under small perturbations.<|reference_end|> | arxiv | @article{gilbert2006algorithmic,
title={Algorithmic linear dimension reduction in the l_1 norm for sparse
vectors},
author={A. C. Gilbert, M. J. Strauss, J. A. Tropp, and R. Vershynin},
journal={arXiv preprint arXiv:cs/0608079},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608079},
primaryClass={cs.DS}
} | gilbert2006algorithmic |
arxiv-674660 | cs/0608080 | Lower Bounds on the Algebraic Immunity of Boolean Functions | <|reference_start|>Lower Bounds on the Algebraic Immunity of Boolean Functions: From the motivation of algebraic attacks to stream and block ciphers([1,2,7,13,14,15]), the concept of {\em algebraic immunity} (AI) was introduced in [21] and studied in [3,5,10,11,17,18,19,20,21]. High algebraic immunity is a necessary condition for resisting algebraic attacks. In this paper, we give some lower bounds on algebraic immunity of Boolean functions. The results are applied to give lower bounds on AI of symmetric Boolean functions and rotation symmetric Boolean functions. Some balanced rotation symmetric Boolean functions with their AI near the maximum possible value $\lceil \frac{n}{2}\rceil$ are constructed.<|reference_end|> | arxiv | @article{chen2006lower,
title={Lower Bounds on the Algebraic Immunity of Boolean Functions},
author={Hao Chen and Jianhua Li},
journal={arXiv preprint arXiv:cs/0608080},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608080},
primaryClass={cs.CR}
} | chen2006lower |
arxiv-674661 | cs/0608081 | How Hard Is Bribery in Elections? | <|reference_start|>How Hard Is Bribery in Elections?: We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voters a specified candidate can be made the election's winner? We study this problem for election systems as varied as scoring protocols and Dodgson voting, and in a variety of settings regarding homogeneous-vs.-nonhomogeneous electorate bribability, bounded-size-vs.-arbitrary-sized candidate sets, weighted-vs.-unweighted voters, and succinct-vs.-nonsuccinct input specification. We obtain both polynomial-time bribery algorithms and proofs of the intractability of bribery, and indeed our results show that the complexity of bribery is extremely sensitive to the setting. For example, we find settings in which bribery is NP-complete but manipulation (by voters) is in P, and we find settings in which bribing weighted voters is NP-complete but bribing voters with individual bribe thresholds is in P. For the broad class of elections (including plurality, Borda, k-approval, and veto) known as scoring protocols, we prove a dichotomy result for bribery of weighted voters: We find a simple-to-evaluate condition that classifies every case as either NP-complete or in P.<|reference_end|> | arxiv | @article{faliszewski2006how,
title={How Hard Is Bribery in Elections?},
author={Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra},
journal={arXiv preprint arXiv:cs/0608081},
year={2006},
number={URCS TR-2006-895},
archivePrefix={arXiv},
eprint={cs/0608081},
primaryClass={cs.GT cs.CC cs.MA}
} | faliszewski2006how |
arxiv-674662 | cs/0608082 | Competition and Request Routing Policies in Content Delivery Networks | <|reference_start|>Competition and Request Routing Policies in Content Delivery Networks: The role of competition and monetary benefits in the design of Content Delivery Networks (CDNs) is largely an unexplored area. In this paper, we investigate the effect of competition among the competitive web based CDNs and show that little difference in their performance may cause significant financial gain/loss. It turns out that the economy of scale effect is very significant for the success of a CDN in a competitive market. So CDN peering might be a good idea. Since performance and conforming to the service level agreement (SLA) with content providers is very important, we then focus on designing CDN from this perspective. We provide an asymptotically optimal static request routing policy for a CDN under a model where a CDN company guarantees a certain level of user latency to the content providers in the SLA.<|reference_end|> | arxiv | @article{alam2006competition,
title={Competition and Request Routing Policies in Content Delivery Networks},
author={S. M. Nazrul Alam and Peter Marbach},
journal={arXiv preprint arXiv:cs/0608082},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608082},
primaryClass={cs.NI}
} | alam2006competition |
arxiv-674663 | cs/0608083 | Where's the "Party" in "Multi-Party"? Analyzing the Structure of Small-Group Sociable Talk | <|reference_start|>Where's the "Party" in "Multi-Party"? Analyzing the Structure of Small-Group Sociable Talk: Spontaneous multi-party interaction - conversation among groups of three or more participants - is part of daily life. While automated modeling of such interactions has received increased attention in ubiquitous computing research, there is little applied research on the organization of this highly dynamic and spontaneous sociable interaction within small groups. We report here on an applied conversation analytic study of small-group sociable talk, emphasizing structural and temporal aspects that can inform computational models. In particular, we examine the mechanics of multiple simultaneous conversational floors - how participants initiate a new floor amidst an on-going floor, and how they subsequently show their affiliation with one floor over another. We also discuss the implications of these findings for the design of "smart" multi-party applications.<|reference_end|> | arxiv | @article{aoki2006where's,
title={Where's the "Party" in "Multi-Party"? Analyzing the Structure of
Small-Group Sociable Talk},
author={Paul M. Aoki, Margaret H. Szymanski, Luke Plurkowski, James D.
Thornton, Allison Woodruff, Weilie Yi},
journal={Proc. ACM Conf. on Computer Supported Cooperative Work, Banff,
Alberta, Canada, Nov. 2006, 393-402. ACM Press.},
year={2006},
doi={10.1145/1180875.1180934},
archivePrefix={arXiv},
eprint={cs/0608083},
primaryClass={cs.HC}
} | aoki2006where's |
arxiv-674664 | cs/0608084 | The computational power of population protocols | <|reference_start|>The computational power of population protocols: We consider the model of population protocols introduced by Angluin et al., in which anonymous finite-state agents stably compute a predicate of the multiset of their inputs via two-way interactions in the all-pairs family of communication networks. We prove that all predicates stably computable in this model (and certain generalizations of it) are semilinear, answering a central open question about the power of the model. Removing the assumption of two-way interaction, we also consider several variants of the model in which agents communicate by anonymous message-passing where the recipient of each message is chosen by an adversary and the sender is not identified to the recipient. These one-way models are distinguished by whether messages are delivered immediately or after a delay, whether a sender can record that it has sent a message, and whether a recipient can queue incoming messages, refusing to accept new messages until it has had a chance to send out messages of its own. We characterize the classes of predicates stably computable in each of these one-way models using natural subclasses of the semilinear predicates.<|reference_end|> | arxiv | @article{angluin2006the,
title={The computational power of population protocols},
author={Dana Angluin and James Aspnes and David Eisenstat and Eric Ruppert},
journal={arXiv preprint arXiv:cs/0608084},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608084},
primaryClass={cs.CC cs.DC}
} | angluin2006the |
arxiv-674665 | cs/0608085 | A Quadratic Time-Space Tradeoff for Unrestricted Deterministic Decision Branching Programs | <|reference_start|>A Quadratic Time-Space Tradeoff for Unrestricted Deterministic Decision Branching Programs: For a decision problem from coding theory, we prove a quadratic expected time-space tradeoff of the form $\eT\eS=\Omega(\tfrac{n^2}{q})$ for $q$-way deterministic decision branching programs, where $q\geq 2$. Here $\eT$ is the expected computation time and $\eS$ is the expected space, when all inputs are equally likely. This bound is to our knowledge, the first such to show an exponential size requirement whenever $\eT = O(n^2)$. Previous exponential size tradeoffs for Boolean decision branching programs were valid for time-restricted models with $T=o(n\log_2{n})$. Proving quadratic time-space tradeoffs for unrestricted time decision branching programs has been a major goal of recent research -- this goal has already been achieved for multiple-output branching programs two decades ago. We also show the first quadratic time-space tradeoffs for Boolean decision branching programs verifying circular convolution, matrix-vector multiplication and discrete Fourier transform. Furthermore, we demonstrate a constructive Boolean decision function which has a quadratic expected time-space tradeoff in the Boolean deterministic decision branching program model. When $q$ is a constant the tradeoff results derived here for decision functions verifying various functions are order-comparable to previously known tradeoff bounds for calculating the corresponding multiple-output functions.<|reference_end|> | arxiv | @article{santhi2006a,
title={A Quadratic Time-Space Tradeoff for Unrestricted Deterministic Decision
Branching Programs},
author={Nandakishore Santhi, Alexander Vardy},
journal={arXiv preprint arXiv:cs/0608085},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608085},
primaryClass={cs.CC cs.DM cs.IT math.IT}
} | santhi2006a |
arxiv-674666 | cs/0608086 | Analog Codes on Graphs | <|reference_start|>Analog Codes on Graphs: We consider the problem of transmission of a sequence of real data produced by a Nyquist sampled band-limited analog source over a band-limited analog channel, which introduces an additive white Gaussian noise. An analog coding scheme is described, which can achieve a mean-squared error distortion proportional to $(1+SNR)^{-B}$ for a bandwidth expansion factor of $B/R$, where $0 < R < 1$ is the rate of individual component binary codes used in the construction and $B \geq 1$ is an integer. Thus, over a wide range of SNR values, the proposed code performs much better than any single previously known analog coding system.<|reference_end|> | arxiv | @article{santhi2006analog,
title={Analog Codes on Graphs},
author={Nandakishore Santhi, Alexander Vardy},
journal={arXiv preprint arXiv:cs/0608086},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608086},
primaryClass={cs.IT cs.DM math.IT}
} | santhi2006analog |
arxiv-674667 | cs/0608087 | On an Improvement over R\'enyi's Equivocation Bound | <|reference_start|>On an Improvement over R\'enyi's Equivocation Bound: We consider the problem of estimating the probability of error in multi-hypothesis testing when MAP criterion is used. This probability, which is also known as the Bayes risk is an important measure in many communication and information theory problems. In general, the exact Bayes risk can be difficult to obtain. Many upper and lower bounds are known in literature. One such upper bound is the equivocation bound due to R\'enyi which is of great philosophical interest because it connects the Bayes risk to conditional entropy. Here we give a simple derivation for an improved equivocation bound. We then give some typical examples of problems where these bounds can be of use. We first consider a binary hypothesis testing problem for which the exact Bayes risk is difficult to derive. In such problems bounds are of interest. Furthermore using the bounds on Bayes risk derived in the paper and a random coding argument, we prove a lower bound on equivocation valid for most random codes over memoryless channels.<|reference_end|> | arxiv | @article{santhi2006on,
title={On an Improvement over R\'enyi's Equivocation Bound},
author={Nandakishore Santhi, Alexander Vardy},
journal={arXiv preprint arXiv:cs/0608087},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608087},
primaryClass={cs.IT cs.DM math.IT}
} | santhi2006on |
arxiv-674668 | cs/0608088 | Radial Structure of the Internet | <|reference_start|>Radial Structure of the Internet: The structure of the Internet at the Autonomous System (AS) level has been studied by both the Physics and Computer Science communities. We extend this work to include features of the core and the periphery, taking a radial perspective on AS network structure. New methods for plotting AS data are described, and they are used to analyze data sets that have been extended to contain edges missing from earlier collections. In particular, the average distance from one vertex to the rest of the network is used as the baseline metric for investigating radial structure. Common vertex-specific quantities are plotted against this metric to reveal distinctive characteristics of central and peripheral vertices. Two data sets are analyzed using these measures as well as two common generative models (Barabasi-Albert and Inet). We find a clear distinction between the highly connected core and a sparse periphery. We also find that the periphery has a more complex structure than that predicted by degree distribution or the two generative models.<|reference_end|> | arxiv | @article{holme2006radial,
title={Radial Structure of the Internet},
author={Petter Holme, Josh Karlin, Stephanie Forrest},
journal={Proc. R. Soc. A 463, (2007) 1231-1246},
year={2006},
doi={10.1098/rspa.2007.1820},
archivePrefix={arXiv},
eprint={cs/0608088},
primaryClass={cs.NI physics.soc-ph}
} | holme2006radial |
arxiv-674669 | cs/0608089 | Wireless ad-hoc networks: Strategies and Scaling laws for the fixed SNR regime | <|reference_start|>Wireless ad-hoc networks: Strategies and Scaling laws for the fixed SNR regime: This paper deals with throughput scaling laws for random ad-hoc wireless networks in a rich scattering environment. We develop schemes to optimize the ratio, $\rho(n)$ of achievable network sum capacity to the sum of the point-to-point capacities of source-destinations pairs operating in isolation. For fixed SNR networks, i.e., where the worst case SNR over the source-destination pairs is fixed independent of $n$, we show that collaborative strategies yield a scaling law of $\rho(n) = {\cal O}(\frac{1}{n^{1/3}})$ in contrast to multi-hop strategies which yield a scaling law of $\rho(n) = {\cal O}(\frac{1}{\sqrt{n}})$. While, networks where worst case SNR goes to zero, do not preclude the possibility of collaboration, multi-hop strategies achieve optimal throughput. The plausible reason is that the gains due to collaboration cannot offset the effect of vanishing receive SNR. This suggests that for fixed SNR networks, a network designer should look for network protocols that exploit collaboration. The fact that most current networks operate in a fixed SNR interference limited environment provides further motivation for considering this regime.<|reference_end|> | arxiv | @article{aeron2006wireless,
title={Wireless ad-hoc networks: Strategies and Scaling laws for the fixed SNR
regime},
author={Shuchin Aeron and Venkatesh Saligrama},
journal={IEEE Transactions on Information Theory, Volume 53, No. 6, June
2007, pp. 2044-2059},
year={2006},
doi={10.1109/TIT.2007.896858},
archivePrefix={arXiv},
eprint={cs/0608089},
primaryClass={cs.IT math.IT}
} | aeron2006wireless |
arxiv-674670 | cs/0608090 | A Condition Number Analysis of a Line-Surface Intersection Algorithm | <|reference_start|>A Condition Number Analysis of a Line-Surface Intersection Algorithm: We propose an algorithm based on Newton's method and subdivision for finding all zeros of a polynomial system in a bounded region of the plane. This algorithm can be used to find the intersections between a line and a surface, which has applications in graphics and computer-aided geometric design. The algorithm can operate on polynomials represented in any basis that satisfies a few conditions. The power basis, the Bernstein basis, and the first-kind Chebyshev basis are among those compatible with the algorithm. The main novelty of our algorithm is an analysis showing that its running is bounded only in terms of the condition number of the polynomial's zeros and a constant depending on the polynomial basis.<|reference_end|> | arxiv | @article{srijuntongsiri2006a,
title={A Condition Number Analysis of a Line-Surface Intersection Algorithm},
author={Gun Srijuntongsiri and Stephen A. Vavasis},
journal={arXiv preprint arXiv:cs/0608090},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608090},
primaryClass={cs.NA cs.CG}
} | srijuntongsiri2006a |
arxiv-674671 | cs/0608091 | On-line topological simplification of weighted graphs | <|reference_start|>On-line topological simplification of weighted graphs: We describe two efficient on-line algorithms to simplify weighted graphs by eliminating degree-two vertices. Our algorithms are on-line in that they react to updates on the data, keeping the simplification up-to-date. The supported updates are insertions of vertices and edges; hence, our algorithms are partially dynamic. We provide both analytical and empirical evaluations of the efficiency of our approaches. Specifically, we prove an O(log n) upper bound on the amortized time complexity of our maintenance algorithms, with n the number of insertions.<|reference_end|> | arxiv | @article{geerts2006on-line,
title={On-line topological simplification of weighted graphs},
author={Floris Geerts, Peter Revesz, Jan Van den Bussche},
journal={Proceedings ACM-GIS 2006, ACM Press},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608091},
primaryClass={cs.DS cs.DB}
} | geerts2006on-line |
arxiv-674672 | cs/0608092 | Self-Stabilizing Byzantine Pulse Synchronization | <|reference_start|>Self-Stabilizing Byzantine Pulse Synchronization: The ``Pulse Synchronization'' problem can be loosely described as targeting to invoke a recurring distributed event as simultaneously as possible at the different nodes and with a frequency that is as regular as possible. This target becomes surprisingly subtle and difficult to achieve when facing both transient and permanent failures. In this paper we present an algorithm for pulse synchronization that self-stabilizes while at the same time tolerating a permanent presence of Byzantine faults. The Byzantine nodes might incessantly try to de-synchronize the correct nodes. Transient failures might throw the system into an arbitrary state in which correct nodes have no common notion what-so-ever, such as time or round numbers, and can thus not infer anything from their own local states upon the state of other correct nodes. The presented algorithm grants nodes the ability to infer that eventually all correct nodes will invoke their pulses within a very short time interval of each other and will do so regularly. Pulse synchronization has previously been shown to be a powerful tool for designing general self-stabilizing Byzantine algorithms and is hitherto the only method that provides for the general design of efficient practical protocols in the confluence of these two fault models. The difficulty, in general, to design any algorithm in this fault model may be indicated by the remarkably few algorithms resilient to both fault models. The few published self-stabilizing Byzantine algorithms are typically complicated and sometimes converge from an arbitrary initial state only after exponential or super exponential time.<|reference_end|> | arxiv | @article{daliot2006self-stabilizing,
title={Self-Stabilizing Byzantine Pulse Synchronization},
author={Ariel Daliot and Danny Dolev},
journal={arXiv preprint arXiv:cs/0608092},
year={2006},
number={TR-2005-84},
archivePrefix={arXiv},
eprint={cs/0608092},
primaryClass={cs.DC}
} | daliot2006self-stabilizing |
arxiv-674673 | cs/0608093 | Connection between continuous and digital n-manifolds and the Poincare conjecture | <|reference_start|>Connection between continuous and digital n-manifolds and the Poincare conjecture: We introduce LCL covers of closed n-dimensional manifolds by n-dimensional disks and study their properties. We show that any LCL cover of an n-dimensional sphere can be converted to the minimal LCL cover, which consists of 2n+2 disks. We prove that an LCL collection of n-disks is a cover of a continuous n-sphere if and only if the intersection graph of this collection is a digital n-sphere. Using a link between LCL covers of closed continuous n-manifolds and digital n-manifolds, we find conditions where a continuous closed three-dimensional manifold is the three-dimensional sphere. We discuss a connection between the classification problems for closed continuous three-dimensional manifolds and digital three-manifolds.<|reference_end|> | arxiv | @article{evako2006connection,
title={Connection between continuous and digital n-manifolds and the Poincare
conjecture},
author={Alexander Evako},
journal={arXiv preprint arXiv:cs/0608093},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608093},
primaryClass={cs.DM cs.CV math.AT}
} | evako2006connection |
arxiv-674674 | cs/0608094 | On Universality in Real Computation | <|reference_start|>On Universality in Real Computation: Models of computation operating over the real numbers and computing a larger class of functions compared to the class of general recursive functions invariably introduce a non-finite element of infinite information encoded in an arbitrary non-computable number or non-recursive function. In this paper we show that Turing universality is only possible at every Turing degree but not over all, in that sense universality at the first level is elegantly well defined while universality at higher degrees is at least ambiguous. We propose a concept of universal relativity and universal jump between levels in the arithmetical and analytical hierarchy.<|reference_end|> | arxiv | @article{zenil2006on,
title={On Universality in Real Computation},
author={Hector Zenil},
journal={arXiv preprint arXiv:cs/0608094},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608094},
primaryClass={cs.CC cs.LO}
} | zenil2006on |
arxiv-674675 | cs/0608095 | Stationary Algorithmic Probability | <|reference_start|>Stationary Algorithmic Probability: Kolmogorov complexity and algorithmic probability are defined only up to an additive resp. multiplicative constant, since their actual values depend on the choice of the universal reference computer. In this paper, we analyze a natural approach to eliminate this machine-dependence. Our method is to assign algorithmic probabilities to the different computers themselves, based on the idea that "unnatural" computers should be hard to emulate. Therefore, we study the Markov process of universal computers randomly emulating each other. The corresponding stationary distribution, if it existed, would give a natural and machine-independent probability measure on the computers, and also on the binary strings. Unfortunately, we show that no stationary distribution exists on the set of all computers; thus, this method cannot eliminate machine-dependence. Moreover, we show that the reason for failure has a clear and interesting physical interpretation, suggesting that every other conceivable attempt to get rid of those additive constants must fail in principle, too. However, we show that restricting to some subclass of computers might help to get rid of some amount of machine-dependence in some situations, and the resulting stationary computer and string probabilities have beautiful properties.<|reference_end|> | arxiv | @article{mueller2006stationary,
title={Stationary Algorithmic Probability},
author={Markus Mueller},
journal={Theoretical Computer Science 411 pp. 113-130 (2010)},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608095},
primaryClass={cs.IT cs.CC math.IT math.PR}
} | mueller2006stationary |
arxiv-674676 | cs/0608096 | Linear-time Self-stabilizing Byzantine Clock Synchronization | <|reference_start|>Linear-time Self-stabilizing Byzantine Clock Synchronization: Clock synchronization is a very fundamental task in distributed system. It thus makes sense to require an underlying clock synchronization mechanism to be highly fault-tolerant. A self-stabilizing algorithm seeks to attain synchronization once lost; a Byzantine algorithm assumes synchronization is never lost and focuses on containing the influence of the permanent presence of faulty nodes. There are efficient self-stabilizing solutions for clock synchronization as well as efficient solutions that are resilient to Byzantine faults. In contrast, to the best of our knowledge there is no practical solution that is self-stabilizing while tolerating the permanent presence of Byzantine nodes. We present the first linear-time self-stabilizing Byzantine clock synchronization algorithm. Our deterministic clock synchronization algorithm is based on the observation that all clock synchronization algorithms require events for exchanging clock values and re-synchronizing the clocks to within safe bounds. These events usually need to happen synchronously at the different nodes. In classic Byzantine algorithms this is fulfilled or aided by having the clocks initially close to each other and thus the actual clock values can be used for synchronizing the events. This implies that clock values cannot differ arbitrarily, which necessarily renders these solutions to be non-stabilizing. Our scheme suggests using an underlying distributed pulse synchronization module that is uncorrelated to the clock values.<|reference_end|> | arxiv | @article{daliot2006linear-time,
title={Linear-time Self-stabilizing Byzantine Clock Synchronization},
author={Ariel Daliot, Danny Dolev and Hanna Parnas},
journal={Proc. of 7th International Conference on Principles of Distributed
Systems (OPODIS'03 La Martinique, France), December, 2003},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608096},
primaryClass={cs.DC}
} | daliot2006linear-time |
arxiv-674677 | cs/0608097 | A study of fuzzy and many-valued logics in cellular automata | <|reference_start|>A study of fuzzy and many-valued logics in cellular automata: In this paper we provide an analytical study of the theory of multi-valued and fuzzy cellular automata where the fuzziness appears as the result of the application of an underlying multi-valued or continuous logic as opposed to standard logic as used conventionally. Using the disjunctive normal form of any one of the 255 ECA's so defined, we modify the underlying logic structure and redefine the ECA within the framework of this new logic. The idea here is to show that the evolution of space-time diagrams of ECA's under even a probabilistic logic can exhibit non-chaotic behavior. This is looked at specifically for Probabilistic Rule 110, in contrast with Boolean Rule 110 which is known to be capable of universal computation.<|reference_end|> | arxiv | @article{mingarelli2006a,
title={A study of fuzzy and many-valued logics in cellular automata},
author={Angelo B. Mingarelli},
journal={J. Cellular Automata, 1 (3) (2006), 233-252},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608097},
primaryClass={cs.LO cs.CC}
} | mingarelli2006a |
arxiv-674678 | cs/0608098 | Improved Content Based Image Watermarking | <|reference_start|>Improved Content Based Image Watermarking: This paper presents a robust and transparent scheme of watermarking that exploits the human visual systems' sensitivity to frequency, along with local image characteristics obtained from the spatial domain. The underlying idea is generating a visual mask based on the visual systems' perception of image content. This mask is used to embed a decimal sequence while keeping its amplitude below the distortion sensitivity of the image pixel. We consider texture, luminance, corner and the edge information in the image to generate a mask that makes the addition of the watermark imperceptible to the human eye.<|reference_end|> | arxiv | @article{parthasarathy2006improved,
title={Improved Content Based Image Watermarking},
author={Arvind Parthasarathy},
journal={arXiv preprint arXiv:cs/0608098},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608098},
primaryClass={cs.CR}
} | parthasarathy2006improved |
arxiv-674679 | cs/0608099 | Automated verification of weak equivalence within the SMODELS system | <|reference_start|>Automated verification of weak equivalence within the SMODELS system: In answer set programming (ASP), a problem at hand is solved by (i) writing a logic program whose answer sets correspond to the solutions of the problem, and by (ii) computing the answer sets of the program using an answer set solver as a search engine. Typically, a programmer creates a series of gradually improving logic programs for a particular problem when optimizing program length and execution time on a particular solver. This leads the programmer to a meta-level problem of ensuring that the programs are equivalent, i.e., they give rise to the same answer sets. To ease answer set programming at methodological level, we propose a translation-based method for verifying the equivalence of logic programs. The basic idea is to translate logic programs P and Q under consideration into a single logic program EQT(P,Q) whose answer sets (if such exist) yield counter-examples to the equivalence of P and Q. The method is developed here in a slightly more general setting by taking the visibility of atoms properly into account when comparing answer sets. The translation-based approach presented in the paper has been implemented as a translator called lpeq that enables the verification of weak equivalence within the smodels system using the same search engine as for the search of models. Our experiments with lpeq and smodels suggest that establishing the equivalence of logic programs in this way is in certain cases much faster than naive cross-checking of answer sets.<|reference_end|> | arxiv | @article{janhunen2006automated,
title={Automated verification of weak equivalence within the SMODELS system},
author={Tomi Janhunen and Emilia Oikarinen},
journal={arXiv preprint arXiv:cs/0608099},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608099},
primaryClass={cs.AI cs.LO}
} | janhunen2006automated |
arxiv-674680 | cs/0608100 | Similarity of Semantic Relations | <|reference_start|>Similarity of Semantic Relations: There are at least two kinds of similarity. Relational similarity is correspondence between relations, in contrast with attributional similarity, which is correspondence between attributes. When two words have a high degree of attributional similarity, we call them synonyms. When two pairs of words have a high degree of relational similarity, we say that their relations are analogous. For example, the word pair mason:stone is analogous to the pair carpenter:wood. This paper introduces Latent Relational Analysis (LRA), a method for measuring relational similarity. LRA has potential applications in many areas, including information extraction, word sense disambiguation, and information retrieval. Recently the Vector Space Model (VSM) of information retrieval has been adapted to measuring relational similarity, achieving a score of 47% on a collection of 374 college-level multiple-choice word analogy questions. In the VSM approach, the relation between a pair of words is characterized by a vector of frequencies of predefined patterns in a large corpus. LRA extends the VSM approach in three ways: (1) the patterns are derived automatically from the corpus, (2) the Singular Value Decomposition (SVD) is used to smooth the frequency data, and (3) automatically generated synonyms are used to explore variations of the word pairs. LRA achieves 56% on the 374 analogy questions, statistically equivalent to the average human score of 57%. On the related problem of classifying semantic relations, LRA achieves similar gains over the VSM.<|reference_end|> | arxiv | @article{turney2006similarity,
title={Similarity of Semantic Relations},
author={Peter D. Turney (National Research Council of Canada)},
journal={Computational Linguistics, (2006), 32(3), 379-416},
year={2006},
doi={10.1162/coli.2006.32.3.379},
number={NRC-48775},
archivePrefix={arXiv},
eprint={cs/0608100},
primaryClass={cs.CL cs.IR cs.LG}
} | turney2006similarity |
arxiv-674681 | cs/0608101 | Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs | <|reference_start|>Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs: For digraphs $D$ and $H$, a mapping $f: V(D)\dom V(H)$ is a homomorphism of $D$ to $H$ if $uv\in A(D)$ implies $f(u)f(v)\in A(H).$ If, moreover, each vertex $u \in V(D)$ is associated with costs $c_i(u), i \in V(H)$, then the cost of the homomorphism $f$ is $\sum_{u\in V(D)}c_{f(u)}(u)$. For each fixed digraph $H$, we have the {\em minimum cost homomorphism problem for} $H$. The problem is to decide, for an input graph $D$ with costs $c_i(u),$ $u \in V(D), i\in V(H)$, whether there exists a homomorphism of $D$ to $H$ and, if one exists, to find one of minimum cost. Minimum cost homomorphism problems encompass (or are related to) many well studied optimization problems. We describe a dichotomy of the minimum cost homomorphism problem for semicomplete multipartite digraphs $H$. This solves an open problem from an earlier paper. To obtain the dichotomy of this paper, we introduce and study a new notion, a $k$-Min-Max ordering of digraphs.<|reference_end|> | arxiv | @article{gutin2006minimum,
title={Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs},
author={G. Gutin, A. Rafiey, A. Yeo},
journal={arXiv preprint arXiv:cs/0608101},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608101},
primaryClass={cs.DM cs.CC}
} | gutin2006minimum |
arxiv-674682 | cs/0608102 | Analysis of a Reputation System for Mobile Ad-Hoc Networks with Liars | <|reference_start|>Analysis of a Reputation System for Mobile Ad-Hoc Networks with Liars: The application of decentralized reputation systems is a promising approach to ensure cooperation and fairness, as well as to address random failures and malicious attacks in Mobile Ad-Hoc Networks. However, they are potentially vulnerable to liars. With our work, we provide a first step to analyzing robustness of a reputation system based on a deviation test. Using a mean-field approach to our stochastic process model, we show that liars have no impact unless their number exceeds a certain threshold (phase transition). We give precise formulae for the critical values and thus provide guidelines for an optimal choice of parameters.<|reference_end|> | arxiv | @article{mundinger2006analysis,
title={Analysis of a Reputation System for Mobile Ad-Hoc Networks with Liars},
author={Jochen Mundinger, Jean-Yves Le Boudec},
journal={arXiv preprint arXiv:cs/0608102},
year={2006},
number={LCA-REPORT-2006-009},
archivePrefix={arXiv},
eprint={cs/0608102},
primaryClass={cs.PF}
} | mundinger2006analysis |
arxiv-674683 | cs/0608103 | Logic programs with monotone abstract constraint atoms | <|reference_start|>Logic programs with monotone abstract constraint atoms: We introduce and study logic programs whose clauses are built out of monotone constraint atoms. We show that the operational concept of the one-step provability operator generalizes to programs with monotone constraint atoms, but the generalization involves nondeterminism. Our main results demonstrate that our formalism is a common generalization of (1) normal logic programming with its semantics of models, supported models and stable models, (2) logic programming with weight atoms (lparse programs) with the semantics of stable models, as defined by Niemela, Simons and Soininen, and (3) of disjunctive logic programming with the possible-model semantics of Sakama and Inoue.<|reference_end|> | arxiv | @article{marek2006logic,
title={Logic programs with monotone abstract constraint atoms},
author={V.W. Marek, I. Niemela and M. Truszczynski]},
journal={arXiv preprint arXiv:cs/0608103},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608103},
primaryClass={cs.AI cs.LO}
} | marek2006logic |
arxiv-674684 | cs/0608104 | Heap Reference Analysis Using Access Graphs | <|reference_start|>Heap Reference Analysis Using Access Graphs: Despite significant progress in the theory and practice of program analysis, analysing properties of heap data has not reached the same level of maturity as the analysis of static and stack data. The spatial and temporal structure of stack and static data is well understood while that of heap data seems arbitrary and is unbounded. We devise bounded representations which summarize properties of the heap data. This summarization is based on the structure of the program which manipulates the heap. The resulting summary representations are certain kinds of graphs called access graphs. The boundedness of these representations and the monotonicity of the operations to manipulate them make it possible to compute them through data flow analysis. An important application which benefits from heap reference analysis is garbage collection, where currently liveness is conservatively approximated by reachability from program variables. As a consequence, current garbage collectors leave a lot of garbage uncollected, a fact which has been confirmed by several empirical studies. We propose the first ever end-to-end static analysis to distinguish live objects from reachable objects. We use this information to make dead objects unreachable by modifying the program. This application is interesting because it requires discovering data flow information representing complex semantics. In particular, we discover four properties of heap data: liveness, aliasing, availability, and anticipability. Together, they cover all combinations of directions of analysis (i.e. forward and backward) and confluence of information (i.e. union and intersection). Our analysis can also be used for plugging memory leaks in C/C++ languages.<|reference_end|> | arxiv | @article{khedker2006heap,
title={Heap Reference Analysis Using Access Graphs},
author={Uday Khedker, Amitabha Sanyal, and Amey Karkare},
journal={ACM TOPLAS, 30(1), 2007},
year={2006},
doi={10.1145/1290520.1290521},
archivePrefix={arXiv},
eprint={cs/0608104},
primaryClass={cs.PL cs.SE}
} | khedker2006heap |
arxiv-674685 | cs/0608105 | Application Layer Definition and Analyses of Controller Area Network Bus for Wire Harness Assembly Machine | <|reference_start|>Application Layer Definition and Analyses of Controller Area Network Bus for Wire Harness Assembly Machine: With the feature of multi-master bus access, nondestructive contention-based arbitration and flexible configuration, Controller Area Network (CAN) bus is applied into the control system of Wire Harness Assembly Machine (WHAM). To accomplish desired goal, the specific features of the CAN bus is analyzed by compared with other field buses and the functional performances in the CAN bus system of WHAM is discussed. Then the application layer planning of CAN bus for dynamic priority is presented. The critical issue for the use of CAN bus system in WHAM is the data transfer rate between different nodes. So processing efficient model is introduced to assist analyzing data transfer procedure. Through the model, it is convenient to verify the real time feature of the CAN bus system in WHAM.<|reference_end|> | arxiv | @article{guo2006application,
title={Application Layer Definition and Analyses of Controller Area Network Bus
for Wire Harness Assembly Machine},
author={Hui Guo, Ying Jiang},
journal={arXiv preprint arXiv:cs/0608105},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608105},
primaryClass={cs.RO cs.NI}
} | guo2006application |
arxiv-674686 | cs/0608106 | Lp Computable Functions and Fourier Series | <|reference_start|>Lp Computable Functions and Fourier Series: This paper studies how well computable functions can be approximated by their Fourier series. To this end, we equip the space of Lp-computable functions (computable Lebesgue integrable functions) with a size notion, by introducing Lp-computable Baire categories. We show that Lp-computable Baire categories satisfy the following three basic properties. Singleton sets {f} (where f is Lp-computable) are meager, suitable infinite unions of meager sets are meager, and the whole space of Lp-computable functions is not meager. We give an alternative characterization of meager sets via Banach Mazur games. We study the convergence of Fourier series for Lp-computable functions and show that whereas for every p>1, the Fourier series of every Lp-computable function f converges to f in the Lp norm, the set of L1-computable functions whose Fourier series does not diverge almost everywhere is meager.<|reference_end|> | arxiv | @article{moser2006lp,
title={Lp Computable Functions and Fourier Series},
author={Philippe Moser},
journal={arXiv preprint arXiv:cs/0608106},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608106},
primaryClass={cs.CC}
} | moser2006lp |
arxiv-674687 | cs/0608107 | The Haar Wavelet Transform of a Dendrogram | <|reference_start|>The Haar Wavelet Transform of a Dendrogram: We describe a new wavelet transform, for use on hierarchies or binary rooted trees. The theoretical framework of this approach to data analysis is described. Case studies are used to further exemplify this approach. A first set of application studies deals with data array smoothing, or filtering. A second set of application studies relates to hierarchical tree condensation. Finally, a third study explores the wavelet decomposition, and the reproducibility of data sets such as text, including a new perspective on the generation or computability of such data objects.<|reference_end|> | arxiv | @article{murtagh2006the,
title={The Haar Wavelet Transform of a Dendrogram},
author={Fionn Murtagh},
journal={Journal of Classification, 24, 3-32, 2007},
year={2006},
doi={10.1007/s00357-007-0007-9},
archivePrefix={arXiv},
eprint={cs/0608107},
primaryClass={cs.IR}
} | murtagh2006the |
arxiv-674688 | cs/0608108 | Spherical Indexing for Neighborhood Queries | <|reference_start|>Spherical Indexing for Neighborhood Queries: This is an algorithm for finding neighbors when the objects can freely move and have no predefined position. The query consists in finding neighbors for a center location and a given radius. Space is discretized in cubic cells. This algorithm introduces a direct spherical indexing that gives the list of all cells making up the query sphere, for any radius and any center location. It can additionally take in account both cyclic and non-cyclic regions of interest. Finding only the K nearest neighbors naturally benefits from the spherical indexing by minimally running through the sphere from center to edge, and reducing the maximum distance when K neighbors have been found.<|reference_end|> | arxiv | @article{brodu2006spherical,
title={Spherical Indexing for Neighborhood Queries},
author={Nicolas Brodu},
journal={arXiv preprint arXiv:cs/0608108},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608108},
primaryClass={cs.DS cs.CG}
} | brodu2006spherical |
arxiv-674689 | cs/0608109 | Realistic Boundary Conditions for Ad Hoc Network Node Mobility Models and a New Approach to the Random Waypoint Model | <|reference_start|>Realistic Boundary Conditions for Ad Hoc Network Node Mobility Models and a New Approach to the Random Waypoint Model: In this paper, we examine the cause of the border effect observed in many mobility models used to construct simulations of ad hoc networking protocol performance. We specify conditions under which a node mobility model must produce spatial mobile node distribution functions that obey the diffusion equation. In particular demonstrate that these conditions are satisfied by the random direction (RD) model. We show that it is possible to construct mobility models that attain uniform steady-state distributions without resorting to reflection or ``wrapping'' of nodes at the border of a test region. Finally, we show that the random waypoint (RWP) model may be reproduced by the application of a ``volume rule'' to an RD model. This volume rule violates the assumptions that lead to the diffusion equation. We suggest a generalization of the RWP model that can provide more uniform mobile node distributions.<|reference_end|> | arxiv | @article{hohensee2006realistic,
title={Realistic Boundary Conditions for Ad Hoc Network Node Mobility Models
and a New Approach to the Random Waypoint Model},
author={Michael Hohensee},
journal={arXiv preprint arXiv:cs/0608109},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608109},
primaryClass={cs.NI}
} | hohensee2006realistic |
arxiv-674690 | cs/0608110 | Calculating modules in contextual logic program refinement | <|reference_start|>Calculating modules in contextual logic program refinement: The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specifications and code, and a refinement relation that models the notion of correct implementation. In this paper we extend and generalise earlier work on contextual refinement. Contextual refinement simplifies the refinement process by abstractly capturing the context of a subcomponent of a program, which typically includes information about the values of the free variables. This paper also extends and generalises module refinement. A module is a collection of procedures that operate on a common data type; module refinement between a specification module A and an implementation module C allows calls to the procedures of A to be systematically replaced with calls to the corresponding procedures of C. Based on the conditions for module refinement, we present a method for calculating an implementation module from a specification module. Both contextual and module refinement within the refinement calculus have been generalised from earlier work and the results are presented in a unified framework.<|reference_end|> | arxiv | @article{colvin2006calculating,
title={Calculating modules in contextual logic program refinement},
author={Robert Colvin, Ian J. Hayes and Paul Strooper},
journal={arXiv preprint arXiv:cs/0608110},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608110},
primaryClass={cs.LO}
} | colvin2006calculating |
arxiv-674691 | cs/0608111 | An Architectural Style for Ajax | <|reference_start|>An Architectural Style for Ajax: A new breed of web application, dubbed AJAX, is emerging in response to a limited degree of interactivity in large-grain stateless Web interactions. At the heart of this new approach lies a single page interaction model that facilitates rich interactivity. We have studied and experimented with several AJAX frameworks trying to understand their architectural properties. In this paper, we summarize three of these frameworks and examine their properties and introduce the SPIAR architectural style. We describe the guiding software engineering principles and the constraints chosen to induce the desired properties. The style emphasizes user interface component development, and intermediary delta-communication between client/server components, to improve user interactivity and ease of development. In addition, we use the concepts and principles to discuss various open issues in AJAX frameworks and application development.<|reference_end|> | arxiv | @article{mesbah2006an,
title={An Architectural Style for Ajax},
author={Ali Mesbah, Arie van Deursen},
journal={Proceedings of the 6th Working IEEE/IFIP Conference on Software
Architecture (WICSA'07). IEEE Computer Society, 2007},
year={2006},
doi={10.1109/WICSA.2007.7},
number={TUD-SERG-2006-016},
archivePrefix={arXiv},
eprint={cs/0608111},
primaryClass={cs.SE}
} | mesbah2006an |
arxiv-674692 | cs/0608112 | Entity Based Peer-to-Peer in a Data Grid Environment | <|reference_start|>Entity Based Peer-to-Peer in a Data Grid Environment: During the last decade there has been a huge interest in Grid technologies, and numerous Grid projects have been initiated with various visions of the Grid. While all these visions have the same goal of resource sharing, they differ in the functionality that a Grid supports, the grid characterisation, programming environments, etc. In this paper we present a new Grid system dedicated to deal with data issues, called DGET (Data Grid Environment and Tools). DGET is characterized by its peer-to-peer communication system and entity-based architecture, therefore, taking advantage of the main functionality of both systems; P2P and Grid. DGET is currently under development and a prototype implementing the main components is in its first phase of testing. In this paper we limit our description to the system architectural features and to the main differences with other systems.<|reference_end|> | arxiv | @article{hudzia2006entity,
title={Entity Based Peer-to-Peer in a Data Grid Environment},
author={B. Hudzia, L. McDermott, T.N. Illahi and M-T. Kechadi},
journal={B. Hudzia, L. McDermott, T.N. Illahi, and M-T. Kechadi, "Entity
Based Peer-to-Peer in a Data Grid Environment", The 17th IMACS World Congress
Scientific Computation, Applied Mathematics and Simulation, Paris, France,
July, 11-15, 2005},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608112},
primaryClass={cs.DC}
} | hudzia2006entity |
arxiv-674693 | cs/0608113 | A Java Based Architecture of P2P-Grid Middleware | <|reference_start|>A Java Based Architecture of P2P-Grid Middleware: During the last decade there has been a huge interest in Grid technologies, and numerous Grid projects have been initiated with various visions of the Grid. While all these visions have the same goal of resource sharing, they differ in the functionality that a Grid supports, characterization, programming environments, etc. We present a new Grid system dedicated to dealing with data issues, called DGET (Data Grid Environment and Tools). DGET is characterized by its peerto- peer communication system and entity-based architecture, therefore, taking advantage of the main functionality of both systems; P2P and Grid. DGET is currently under development and a prototype implementing the main components is in its first phase of testing. In this paper we limit our description to the system architectural features and to the main differences with other systems. Keywords: Grid Computing, Peer to Peer, Peer to Peer Grid<|reference_end|> | arxiv | @article{hudzia2006a,
title={A Java Based Architecture of P2P-Grid Middleware},
author={B. Hudzia, T. N. Ellahi, L. McDermott, T. Kechadi},
journal={B. Hudzia, T. N. Ellahi, L. McDermott, T. Kechadi, 'A Java Based
Architecture of P2P-Grid Middleware', The 2006 International Conference on
Parallel and Distributed Processing Techniques and Applications, June 26-29,
2006, Las Vegas, USA},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608113},
primaryClass={cs.DC}
} | hudzia2006a |
arxiv-674694 | cs/0608114 | Reliable multicast fault tolerant MPI in the Grid environment | <|reference_start|>Reliable multicast fault tolerant MPI in the Grid environment: Grid environments have recently been developed with low stretch and overheads that increase with the logarithm of the number of nodes in the system. Getting and sending data to/from a large numbers of nodes is gaining importance due to an increasing number of independent data providers and the heterogeneity of the network/Grid. One of the key challenges is to achieve a balance between low bandwidth consumption and good reliability. In this paper we present an implementation of a reliable multicast protocol over a fault tolerant MPI: MPICHV2. It can provide one way to solve the problem of transferring large chunks of data between applications running on a grid with limited network links. We first show that we can achieve similar performance as the MPICH-P4 implementation by using multicast with data compression in a cluster. Next, we provide a theoretical cluster organization and GRID network architecture to harness the performance provided by using multicast. Finally, we present the conclusion and future work.<|reference_end|> | arxiv | @article{hudzia2006reliable,
title={Reliable multicast fault tolerant MPI in the Grid environment},
author={Benoit Hudzia and Serge Petiton},
journal={Benoit Hudzia and Serge Petiton, "Reliable multicast fault
tolerant MPI in the Grid environment", International Conference GRIDnet,
october 2004},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608114},
primaryClass={cs.DC}
} | hudzia2006reliable |
arxiv-674695 | cs/0608115 | Neural Network Clustering Based on Distances Between Objects | <|reference_start|>Neural Network Clustering Based on Distances Between Objects: We present an algorithm of clustering of many-dimensional objects, where only the distances between objects are used. Centers of classes are found with the aid of neuron-like procedure with lateral inhibition. The result of clustering does not depend on starting conditions. Our algorithm makes it possible to give an idea about classes that really exist in the empirical data. The results of computer simulations are presented.<|reference_end|> | arxiv | @article{litinskii2006neural,
title={Neural Network Clustering Based on Distances Between Objects},
author={Leonid B. Litinskii, Dmitry E. Romanov},
journal={arXiv preprint arXiv:cs/0608115},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608115},
primaryClass={cs.CV cs.NE}
} | litinskii2006neural |
arxiv-674696 | cs/0608116 | Transparent Migration of Multi-Threaded Applications on a Java Based Grid | <|reference_start|>Transparent Migration of Multi-Threaded Applications on a Java Based Grid: Grid computing has enabled pooling a very large number of heterogeneous resource administered by different security domains. Applications are dynamically deployed on the resources available at the time. Dynamic nature of the resources and applications requirements makes needs the grid middleware to support the ability of migrating a running application to a different resource. Especially, Grid applications are typically long running and thus stoping them and starting them from scratch is not a feasible option. This paper presents an overview of migration support in a java based grid middleware called DGET. Migration support in DGET includes multi-threaded migration and asynchronous migration as well.<|reference_end|> | arxiv | @article{ellahi2006transparent,
title={Transparent Migration of Multi-Threaded Applications on a Java Based
Grid},
author={T. N. Ellahi, B. Hudzia, L. McDermott, T. Kechadi},
journal={T. N. Ellahi, B. Hudzia, L. McDermott, T. Kechadi, Transparent
Migration of Multi-Threaded Applications on a Java Based Grid, The IASTED
International Conference on Web Technologies, Applications, and Services
(WTAS 2006), July 17-19, 2006, Alberta, Canada},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608116},
primaryClass={cs.DC}
} | ellahi2006transparent |
arxiv-674697 | cs/0608117 | Code Annealing and the Suppressing Effect of the Cyclically Lifted LDPC Code Ensemble | <|reference_start|>Code Annealing and the Suppressing Effect of the Cyclically Lifted LDPC Code Ensemble: Code annealing, a new method of designing good codes of short block length, is proposed, which is then concatenated with cyclic lifting to create finite codes of low frame error rate (FER) error floors without performance outliers. The stopping set analysis is performed on the cyclically lifted code ensemble assuming uniformly random lifting sequences, and the suppressing effect/weight of the cyclic lifting is identified for the first time, based on which the ensemble FER error floor can be analytically determined and a scaling law is derived. Both the first-order and high-order suppressing effects are discussed and quantified by different methods including the explicit expression, an algorithmic upper bound, and an algebraic lower bound. The mismatch between the suppressing weight and the stopping distances explains the dramatic performance discrepancy among different cyclically lifted codes when the underlying base codes have degree 2 variable nodes or not. For the former case, a degree augmentation method is further introduced to mitigate this metric mismatch, and a systematic method of constructing irregular codes of low FER error floors is presented. Both regular and irregular codes of very low FER error floors are reported, for which the improvement factor ranges from 10^6-10^4 when compared to the classic graph-based code ensembles.<|reference_end|> | arxiv | @article{wang2006code,
title={Code Annealing and the Suppressing Effect of the Cyclically Lifted LDPC
Code Ensemble},
author={Chih-Chun Wang (Purdue University)},
journal={arXiv preprint arXiv:cs/0608117},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608117},
primaryClass={cs.IT math.IT}
} | wang2006code |
arxiv-674698 | cs/0608118 | TreeP: A Tree-Based P2P Network Architecture | <|reference_start|>TreeP: A Tree-Based P2P Network Architecture: In this paper we proposed a hierarchical P2P network based on a dynamic partitioning on a 1-D space. This hierarchy is created and maintained dynamically and provides a gridmiddleware (like DGET) a P2P basic functionality for resource discovery and load-balancing.This network architecture is called TreeP (Tree based P2P network architecture) and is based on atessellation of a 1-D space. We show that this topology exploits in an efficient way theheterogeneity feature of the network while limiting the overhead introduced by the overlaymaintenance. Experimental results show that this topology is highly resilient to a large number ofnetwork failures.<|reference_end|> | arxiv | @article{hudzia2006treep:,
title={TreeP: A Tree-Based P2P Network Architecture},
author={B. Hudzia, M-T. Kechadi and A. Ottewill},
journal={B. Hudzia, M-T. Kechadi, and A. Ottewill, "TreeP: A Tree-Based P2P
Network Architecture", International Workshop on Algorithms, Models and tools
for parallel computing on heterogeneous networks (HeteroPar' 05), Boston,
Massachusetts, USA, September 27-30, 2005},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608118},
primaryClass={cs.DC}
} | hudzia2006treep: |
arxiv-674699 | cs/0608119 | Security Analysis of A Chaos-based Image Encryption Algorithm | <|reference_start|>Security Analysis of A Chaos-based Image Encryption Algorithm: The security of Fridrich Image Encryption Algorithm against brute-force attack, statistical attack, known-plaintext attack and select-plaintext attack is analyzed by investigating the properties of the involved chaotic maps and diffusion functions. Based on the given analyses, some means are proposed to strengthen the overall performance of the focused cryptosystem.<|reference_end|> | arxiv | @article{lian2006security,
title={Security Analysis of A Chaos-based Image Encryption Algorithm},
author={Shiguo Lian, Jinsheng Sun, Zhiquan Wang},
journal={arXiv preprint arXiv:cs/0608119},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608119},
primaryClass={cs.MM cs.CR}
} | lian2006security |
arxiv-674700 | cs/0608120 | Controller synthesis & Ordinal Automata | <|reference_start|>Controller synthesis & Ordinal Automata: Ordinal automata are used to model physical systems with Zeno behavior. Using automata and games techniques we solve a control problem formulated and left open by Demri and Nowak in 2005. It involves partial observability and a new synchronization between the controller and the environment.<|reference_end|> | arxiv | @article{cachat2006controller,
title={Controller synthesis & Ordinal Automata},
author={Thierry Cachat (LIAFA)},
journal={Proceedings of the 4th International Symposium on Automated
Technology for Verification and Analysis (ATVA'06) Springer (Ed.) (2006)
215-228},
year={2006},
archivePrefix={arXiv},
eprint={cs/0608120},
primaryClass={cs.GT}
} | cachat2006controller |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.