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-2201 | 0712.4015 | A Fast Hierarchical Multilevel Image Segmentation Method using Unbiased Estimators | <|reference_start|>A Fast Hierarchical Multilevel Image Segmentation Method using Unbiased Estimators: This paper proposes a novel method for segmentation of images by hierarchical multilevel thresholding. The method is global, agglomerative in nature and disregards pixel locations. It involves the optimization of the ratio of the unbiased estimators of within class to between class variances. We obtain a recursive relation at each step for the variances which expedites the process. The efficacy of the method is shown in a comparison with some well-known methods.<|reference_end|> | arxiv | @article{goparaju2007a,
title={A Fast Hierarchical Multilevel Image Segmentation Method using Unbiased
Estimators},
author={Sreechakra Goparaju, Jayadev Acharya, Ajoy K. Ray, Jaideva C. Goswami},
journal={arXiv preprint arXiv:0712.4015},
year={2007},
archivePrefix={arXiv},
eprint={0712.4015},
primaryClass={cs.CV}
} | goparaju2007a |
arxiv-2202 | 0712.4027 | Accurate and Efficient Expression Evaluation and Linear Algebra | <|reference_start|>Accurate and Efficient Expression Evaluation and Linear Algebra: We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By "accurate" we mean that the computed answer has relative error less than 1, i.e., has some correct leading digits. We also address efficiency, by which we mean algorithms that run in polynomial time in the size of the input. Our results will depend strongly on the model of arithmetic: Most of our results will use the so-called Traditional Model (TM). We give a set of necessary and sufficient conditions to decide whether a high accuracy algorithm exists in the TM, and describe progress toward a decision procedure that will take any problem and provide either a high accuracy algorithm or a proof that none exists. When no accurate algorithm exists in the TM, it is natural to extend the set of available accurate operations by a library of additional operations, such as $x+y+z$, dot products, or indeed any enumerable set which could then be used to build further accurate algorithms. We show how our accurate algorithms and decision procedure for finding them extend to this case. Finally, we address other models of arithmetic, and the relationship between (im)possibility in the TM and (in)efficient algorithms operating on numbers represented as bit strings.<|reference_end|> | arxiv | @article{demmel2007accurate,
title={Accurate and Efficient Expression Evaluation and Linear Algebra},
author={James Demmel, Ioana Dumitriu, Olga Holtz, Plamen Koev},
journal={Acta Numerica, Volume 17, May 2008, pp 87-145},
year={2007},
doi={10.1017/S0962492906350015},
archivePrefix={arXiv},
eprint={0712.4027},
primaryClass={math.NA cs.CC cs.DS math.RA}
} | demmel2007accurate |
arxiv-2203 | 0712.4046 | Faster polynomial multiplication via multipoint Kronecker substitution | <|reference_start|>Faster polynomial multiplication via multipoint Kronecker substitution: We give several new algorithms for dense polynomial multiplication based on the Kronecker substitution method. For moderately sized input polynomials, the new algorithms improve on the performance of the standard Kronecker substitution by a sizeable constant, both in theory and in empirical tests.<|reference_end|> | arxiv | @article{harvey2007faster,
title={Faster polynomial multiplication via multipoint Kronecker substitution},
author={David Harvey},
journal={arXiv preprint arXiv:0712.4046},
year={2007},
archivePrefix={arXiv},
eprint={0712.4046},
primaryClass={cs.SC cs.DS}
} | harvey2007faster |
arxiv-2204 | 0712.4057 | On Compression of Cryptographic Keys | <|reference_start|>On Compression of Cryptographic Keys: Any secured system can be modeled as a capability-based access control system in which each user is given a set of secret keys of the resources he is granted access to. In some large systems with resource-constrained devices, such as sensor networks and RFID systems, the design is sensitive to memory or key storage cost. With a goal to minimize the maximum users' key storage, key compression based on key linking, that is, deriving one key from another without compromising security, is studied. A lower bound on key storage needed for a general access structure with key derivation is derived. This bound demonstrates the theoretic limit of any systems which do not trade off security and can be treated as a negative result to provide ground for designs with security tradeoff. A concrete, provably secure key linking scheme based on pseudorandom functions is given. Using the key linking framework, a number of key pre-distribution schemes in the literature are analyzed.<|reference_end|> | arxiv | @article{chan2007on,
title={On Compression of Cryptographic Keys},
author={Aldar C-F. Chan},
journal={Theoretical Computer Science, 2013},
year={2007},
doi={10.1016/j.tcs.2013.04.010},
archivePrefix={arXiv},
eprint={0712.4057},
primaryClass={cs.CR cs.NI}
} | chan2007on |
arxiv-2205 | 0712.4059 | On Distributed Computation in Noisy Random Planar Networks | <|reference_start|>On Distributed Computation in Noisy Random Planar Networks: We consider distributed computation of functions of distributed data in random planar networks with noisy wireless links. We present a new algorithm for computation of the maximum value which is order optimal in the number of transmissions and computation time.We also adapt the histogram computation algorithm of Ying et al to make the histogram computation time optimal.<|reference_end|> | arxiv | @article{kanoria2007on,
title={On Distributed Computation in Noisy Random Planar Networks},
author={Y. Kanoria, D. Manjunath},
journal={Proceedings of IEEE International Symposium on Information Theory,
2007},
year={2007},
doi={10.1109/ISIT.2007.4557101},
archivePrefix={arXiv},
eprint={0712.4059},
primaryClass={cs.IT math.IT}
} | kanoria2007on |
arxiv-2206 | 0712.4075 | Polytope Representations for Linear-Programming Decoding of Non-Binary Linear Codes | <|reference_start|>Polytope Representations for Linear-Programming Decoding of Non-Binary Linear Codes: In previous work, we demonstrated how decoding of a non-binary linear code could be formulated as a linear-programming problem. In this paper, we study different polytopes for use with linear-programming decoding, and show that for many classes of codes these polytopes yield a complexity advantage for decoding. These representations lead to polynomial-time decoders for a wide variety of classical non-binary linear codes.<|reference_end|> | arxiv | @article{skachek2007polytope,
title={Polytope Representations for Linear-Programming Decoding of Non-Binary
Linear Codes},
author={Vitaly Skachek, Mark F. Flanagan, Eimear Byrne, Marcus Greferath},
journal={arXiv preprint arXiv:0712.4075},
year={2007},
doi={10.1109/ISIT.2008.4595239},
archivePrefix={arXiv},
eprint={0712.4075},
primaryClass={cs.IT math.IT}
} | skachek2007polytope |
arxiv-2207 | 0712.4096 | Error-Correction of Multidimensional Bursts | <|reference_start|>Error-Correction of Multidimensional Bursts: In this paper we present several constructions to generate codes for correcting a multidimensional cluster-error. The goal is to correct a cluster-error whose shape can be a box-error, a Lee sphere error, or an error with an arbitrary shape. Our codes have very low redundancy, close to optimal, and large range of parameters of arrays and clusters. Our main results are summarized as follows: 1) A construction of two-dimensional codes capable to correct a rectangular-error with considerably more flexible parameters from previously known constructions. Another advantage of this construction is that it is easily generalized for D dimensions. 2) A novel method based on D colorings of the D-dimensional space for constructing D-dimensional codes correcting D-dimensional cluster-error of various shapes. This method is applied efficiently to correct a D-dimensional cluster error of parameters not covered efficiently by previous onstructions. 3) A transformation of the D-dimensional space into another D-dimensional space such that a D-dimensional Lee sphere is transformed into a shape located in a D-dimensional box of a relatively small size. We use the previous constructions to correct a D-dimensional error whose shape is a D-dimensional Lee sphere. 4) Applying the coloring method to correct more efficiently a two-dimensional error whose shape is a Lee sphere. The D-dimensional case is also discussed. 5) A construction of one-dimensional codes capable to correct a burst-error of length b in which the number of erroneous positions is relatively small compared to b. This construction is generalized for D-dimensional codes. 6) Applying the constructions correcting a Lee sphere error and a cluster-error with small number of erroneous positions, to correct an arbitrary cluster-error.<|reference_end|> | arxiv | @article{etzion2007error-correction,
title={Error-Correction of Multidimensional Bursts},
author={Tuvi Etzion, and Eitan Yaakobi},
journal={arXiv preprint arXiv:0712.4096},
year={2007},
archivePrefix={arXiv},
eprint={0712.4096},
primaryClass={cs.IT math.IT}
} | etzion2007error-correction |
arxiv-2208 | 0712.4099 | Digital Ecosystems: Optimisation by a Distributed Intelligence | <|reference_start|>Digital Ecosystems: Optimisation by a Distributed Intelligence: Can intelligence optimise Digital Ecosystems? How could a distributed intelligence interact with the ecosystem dynamics? Can the software components that are part of genetic selection be intelligent in themselves, as in an adaptive technology? We consider the effect of a distributed intelligence mechanism on the evolutionary and ecological dynamics of our Digital Ecosystem, which is the digital counterpart of a biological ecosystem for evolving software services in a distributed network. We investigate Neural Networks and Support Vector Machine for the learning based pattern recognition functionality of our distributed intelligence. Simulation results imply that the Digital Ecosystem performs better with the application of a distributed intelligence, marginally more effectively when powered by Support Vector Machine than Neural Networks, and suggest that it can contribute to optimising the operation of our Digital Ecosystem.<|reference_end|> | arxiv | @article{briscoe2007digital,
title={Digital Ecosystems: Optimisation by a Distributed Intelligence},
author={G. Briscoe, P. De Wilde},
journal={arXiv preprint arXiv:0712.4099},
year={2007},
archivePrefix={arXiv},
eprint={0712.4099},
primaryClass={cs.NE}
} | briscoe2007digital |
arxiv-2209 | 0712.4101 | Digital Ecosystems: Stability of Evolving Agent Populations | <|reference_start|>Digital Ecosystems: Stability of Evolving Agent Populations: Stability is perhaps one of the most desirable features of any engineered system, given the importance of being able to predict its response to various environmental conditions prior to actual deployment. Engineered systems are becoming ever more complex, approaching the same levels of biological ecosystems, and so their stability becomes ever more important, but taking on more and more differential dynamics can make stability an ever more elusive property. The Chli-DeWilde definition of stability views a Multi-Agent System as a discrete time Markov chain with potentially unknown transition probabilities. With a Multi-Agent System being considered stable when its state, a stochastic process, has converged to an equilibrium distribution, because stability of a system can be understood intuitively as exhibiting bounded behaviour. We investigate an extension to include Multi-Agent Systems with evolutionary dynamics, focusing on the evolving agent populations of our Digital Ecosystem. We then built upon this to construct an entropy-based definition for the degree of instability (entropy of the limit probabilities), which was later used to perform a stability analysis. The Digital Ecosystem is considered to investigate the stability of an evolving agent population through simulations, for which the results were consistent with the original Chli-DeWilde definition.<|reference_end|> | arxiv | @article{de wilde2007digital,
title={Digital Ecosystems: Stability of Evolving Agent Populations},
author={P. De Wilde, G. Briscoe},
journal={arXiv preprint arXiv:0712.4101},
year={2007},
archivePrefix={arXiv},
eprint={0712.4101},
primaryClass={cs.NE}
} | de wilde2007digital |
arxiv-2210 | 0712.4102 | Digital Ecosystems: Evolving Service-Oriented Architectures | <|reference_start|>Digital Ecosystems: Evolving Service-Oriented Architectures: We view Digital Ecosystems to be the digital counterparts of biological ecosystems, exploiting the self-organising properties of biological ecosystems, which are considered to be robust, self-organising and scalable architectures that can automatically solve complex, dynamic problems. Digital Ecosystems are a novel optimisation technique where the optimisation works at two levels: a first optimisation, migration of agents (representing services) which are distributed in a decentralised peer-to-peer network, operating continuously in time; this process feeds a second optimisation based on evolutionary computing that operates locally on single peers and is aimed at finding solutions to satisfy locally relevant constraints. We created an Ecosystem-Oriented Architecture of Digital Ecosystems by extending Service-Oriented Architectures with distributed evolutionary computing, allowing services to recombine and evolve over time, constantly seeking to improve their effectiveness for the user base. Individuals within our Digital Ecosystem will be applications (groups of services), created in response to user requests by using evolutionary optimisation to aggregate the services. These individuals will migrate through the Digital Ecosystem and adapt to find niches where they are useful in fulfilling other user requests for applications. Simulation results imply that the Digital Ecosystem performs better at large scales than a comparable Service-Oriented Architecture, suggesting that incorporating ideas from theoretical ecology can contribute to useful self-organising properties in digital ecosystems.<|reference_end|> | arxiv | @article{briscoe2007digital,
title={Digital Ecosystems: Evolving Service-Oriented Architectures},
author={G. Briscoe, P. De Wilde},
journal={In IEEE First International Conference on Bio Inspired mOdels of
NETwork, Information and Computing Systems (BIONETICS) (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0712.4102},
primaryClass={cs.NE}
} | briscoe2007digital |
arxiv-2211 | 0712.4103 | On the Monotonicity of the Generalized Marcum and Nuttall Q-Functions | <|reference_start|>On the Monotonicity of the Generalized Marcum and Nuttall Q-Functions: Monotonicity criteria are established for the generalized Marcum Q-function, $\emph{Q}_{M}$, the standard Nuttall Q-function, $\emph{Q}_{M,N}$, and the normalized Nuttall Q-function, $\mathcal{Q}_{M,N}$, with respect to their real order indices M,N. Besides, closed-form expressions are derived for the computation of the standard and normalized Nuttall Q-functions for the case when M,N are odd multiples of 0.5 and $M\geq N$. By exploiting these results, novel upper and lower bounds for $\emph{Q}_{M,N}$ and $\mathcal{Q}_{M,N}$ are proposed. Furthermore, specific tight upper and lower bounds for $\emph{Q}_{M}$, previously reported in the literature, are extended for real values of M. The offered theoretical results can be efficiently applied in the study of digital communications over fading channels, in the information-theoretic analysis of multiple-input multiple-output systems and in the description of stochastic processes in probability theory, among others.<|reference_end|> | arxiv | @article{kapinas2007on,
title={On the Monotonicity of the Generalized Marcum and Nuttall Q-Functions},
author={Vasilios M. Kapinas, Sotirios K. Mihos and George K. Karagiannidis},
journal={IEEE Trans. Inf. Theory, vol. 55, no. 8, pp. 3701-3710, Aug. 2009},
year={2007},
doi={10.1109/TIT.2009.2023710},
archivePrefix={arXiv},
eprint={0712.4103},
primaryClass={cs.IT math.IT}
} | kapinas2007on |
arxiv-2212 | 0712.4115 | A Class of Quantum LDPC Codes Constructed From Finite Geometries | <|reference_start|>A Class of Quantum LDPC Codes Constructed From Finite Geometries: Low-density parity check (LDPC) codes are a significant class of classical codes with many applications. Several good LDPC codes have been constructed using random, algebraic, and finite geometries approaches, with containing cycles of length at least six in their Tanner graphs. However, it is impossible to design a self-orthogonal parity check matrix of an LDPC code without introducing cycles of length four. In this paper, a new class of quantum LDPC codes based on lines and points of finite geometries is constructed. The parity check matrices of these codes are adapted to be self-orthogonal with containing only one cycle of length four. Also, the column and row weights, and bounds on the minimum distance of these codes are given. As a consequence, the encoding and decoding algorithms of these codes as well as their performance over various quantum depolarizing channels will be investigated.<|reference_end|> | arxiv | @article{aly2007a,
title={A Class of Quantum LDPC Codes Constructed From Finite Geometries},
author={Salah A. Aly},
journal={Proc. of IEEE Globecom 08, New Orleans, LA 2008},
year={2007},
doi={10.1109/GLOCOM.2008.ECP.217},
archivePrefix={arXiv},
eprint={0712.4115},
primaryClass={quant-ph cs.IT math.IT}
} | aly2007a |
arxiv-2213 | 0712.4124 | Introduction to the Galois Theory of Linear Differential Equations | <|reference_start|>Introduction to the Galois Theory of Linear Differential Equations: This is an expanded version of the 10 lectures given as the 2006 London Mathematical Society Invited Lecture Series at the Heriot-Watt University 31 July - 4 August 2006.<|reference_end|> | arxiv | @article{singer2007introduction,
title={Introduction to the Galois Theory of Linear Differential Equations},
author={Michael F. Singer},
journal={arXiv preprint arXiv:0712.4124},
year={2007},
archivePrefix={arXiv},
eprint={0712.4124},
primaryClass={math.CA cs.SC}
} | singer2007introduction |
arxiv-2214 | 0712.4126 | TRUST-TECH based Methods for Optimization and Learning | <|reference_start|>TRUST-TECH based Methods for Optimization and Learning: Many problems that arise in machine learning domain deal with nonlinearity and quite often demand users to obtain global optimal solutions rather than local optimal ones. Optimization problems are inherent in machine learning algorithms and hence many methods in machine learning were inherited from the optimization literature. Popularly known as the initialization problem, the ideal set of parameters required will significantly depend on the given initialization values. The recently developed TRUST-TECH (TRansformation Under STability-reTaining Equilibria CHaracterization) methodology systematically explores the subspace of the parameters to obtain a complete set of local optimal solutions. In this thesis work, we propose TRUST-TECH based methods for solving several optimization and machine learning problems. Two stages namely, the local stage and the neighborhood-search stage, are repeated alternatively in the solution space to achieve improvements in the quality of the solutions. Our methods were tested on both synthetic and real datasets and the advantages of using this novel framework are clearly manifested. This framework not only reduces the sensitivity to initialization, but also allows the flexibility for the practitioners to use various global and local methods that work well for a particular problem of interest. Other hierarchical stochastic algorithms like evolutionary algorithms and smoothing algorithms are also studied and frameworks for combining these methods with TRUST-TECH have been proposed and evaluated on several test systems.<|reference_end|> | arxiv | @article{reddy2007trust-tech,
title={TRUST-TECH based Methods for Optimization and Learning},
author={Chandan K. Reddy},
journal={Chandan K. Reddy, TRUST-TECH based Methods for Optimization and
Learning, PHD Thesis, Cornell University, February 2007},
year={2007},
archivePrefix={arXiv},
eprint={0712.4126},
primaryClass={cs.AI cs.CE cs.MS cs.NA cs.NE}
} | reddy2007trust-tech |
arxiv-2215 | 0712.4135 | On the Throughput of Secure Hybrid-ARQ Protocols for Gaussian Block-Fading Channels | <|reference_start|>On the Throughput of Secure Hybrid-ARQ Protocols for Gaussian Block-Fading Channels: The focus of this paper is an information-theoretic study of retransmission protocols for reliable packet communication under a secrecy constraint. The hybrid automatic retransmission request (HARQ) protocol is revisited for a block-fading wire-tap channel, in which two legitimate users communicate over a block-fading channel in the presence of a passive eavesdropper who intercepts the transmissions through an independent block-fading channel. In this model, the transmitter obtains a 1-bit ACK/NACK feedback from the legitimate receiver via an error-free public channel. Both reliability and confidentiality of secure HARQ protocols are studied by the joint consideration of channel coding, secrecy coding, and retransmission protocols. In particular, the error and secrecy performance of repetition time diversity (RTD) and incremental redundancy (INR) protocols are investigated based on good Wyner code sequences, which ensure that the confidential message is decoded successfully by the legitimate receiver and is kept in total ignorance by the eavesdropper for a given set of channel realizations. This paper first illustrates that there exists a good rate-compatible Wyner code family which ensures a secure INR protocol. Next, two types of outage probabilities, connection outage and secrecy outage probabilities are defined in order to characterize the tradeoff between the reliability of the legitimate communication link and the confidentiality with respect to the eavesdropper's link. For a given connection/secrecy outage probability pair, an achievable throughput of secure HARQ protocols is derived for block-fading channels. Finally, both asymptotic analysis and numerical computations demonstrate the benefits of HARQ protocols to throughput and secrecy.<|reference_end|> | arxiv | @article{tang2007on,
title={On the Throughput of Secure Hybrid-ARQ Protocols for Gaussian
Block-Fading Channels},
author={Xiaojun Tang, Ruoheng Liu, Predrag Spasojevic, H. Vincent Poor},
journal={arXiv preprint arXiv:0712.4135},
year={2007},
doi={10.1109/TIT.2009.2013043},
archivePrefix={arXiv},
eprint={0712.4135},
primaryClass={cs.IT math.IT}
} | tang2007on |
arxiv-2216 | 0712.4148 | Lower bounds for the greatest possible number of colors in interval edge colorings of bipartite cylinders and bipartite tori | <|reference_start|>Lower bounds for the greatest possible number of colors in interval edge colorings of bipartite cylinders and bipartite tori: An interval edge t-coloring of a graph G is a proper edge coloring of G with colors 1,2...,t such that at least one edge of G is colored by color i,i=1,2...,t, and the edges incident with each vertex v are colored by d_{G}(v) consecutive colors, where d_{G}(v) is the degree of the vertex v in G. In this paper interval edge colorings of bipartite cylinders and bipartite tori are investigated.<|reference_end|> | arxiv | @article{petrosyan2007lower,
title={Lower bounds for the greatest possible number of colors in interval edge
colorings of bipartite cylinders and bipartite tori},
author={Petros A. Petrosyan and Gagik H. Karapetyan},
journal={Proceedings of the CSIT Conference, Yerevan, 2007, 86-88},
year={2007},
archivePrefix={arXiv},
eprint={0712.4148},
primaryClass={cs.DM}
} | petrosyan2007lower |
arxiv-2217 | 0712.4153 | Biology of Applied Digital Ecosystems | <|reference_start|>Biology of Applied Digital Ecosystems: A primary motivation for our research in Digital Ecosystems is the desire to exploit the self-organising properties of biological ecosystems. Ecosystems are thought to be robust, scalable architectures that can automatically solve complex, dynamic problems. However, the biological processes that contribute to these properties have not been made explicit in Digital Ecosystems research. Here, we discuss how biological properties contribute to the self-organising features of biological ecosystems, including population dynamics, evolution, a complex dynamic environment, and spatial distributions for generating local interactions. The potential for exploiting these properties in artificial systems is then considered. We suggest that several key features of biological ecosystems have not been fully explored in existing digital ecosystems, and discuss how mimicking these features may assist in developing robust, scalable self-organising architectures. An example architecture, the Digital Ecosystem, is considered in detail. The Digital Ecosystem is then measured experimentally through simulations, with measures originating from theoretical ecology, to confirm its likeness to a biological ecosystem. Including the responsiveness to requests for applications from the user base, as a measure of the 'ecological succession' (development).<|reference_end|> | arxiv | @article{briscoe2007biology,
title={Biology of Applied Digital Ecosystems},
author={G. Briscoe, S. Sadedin, G. Paperin},
journal={In IEEE First International Conference on Digital Ecosystems and
Technologies, 2007},
year={2007},
doi={10.1109/DEST.2007.372015},
archivePrefix={arXiv},
eprint={0712.4153},
primaryClass={cs.NE cs.MA}
} | briscoe2007biology |
arxiv-2218 | 0712.4159 | Creating a Digital Ecosystem: Service-Oriented Architectures with Distributed Evolutionary Computing | <|reference_start|>Creating a Digital Ecosystem: Service-Oriented Architectures with Distributed Evolutionary Computing: We start with a discussion of the relevant literature, including Nature Inspired Computing as a framework in which to understand this work, and the process of biomimicry to be used in mimicking the necessary biological processes to create Digital Ecosystems. We then consider the relevant theoretical ecology in creating the digital counterpart of a biological ecosystem, including the topological structure of ecosystems, and evolutionary processes within distributed environments. This leads to a discussion of the relevant fields from computer science for the creation of Digital Ecosystems, including evolutionary computing, Multi-Agent Systems, and Service-Oriented Architectures. We then define Ecosystem-Oriented Architectures for the creation of Digital Ecosystems, imbibed with the properties of self-organisation and scalability from biological ecosystems, including a novel form of distributed evolutionary computing.<|reference_end|> | arxiv | @article{briscoe2007creating,
title={Creating a Digital Ecosystem: Service-Oriented Architectures with
Distributed Evolutionary Computing},
author={G Briscoe},
journal={In JavaOne Conference, 2006, BOF-0759},
year={2007},
archivePrefix={arXiv},
eprint={0712.4159},
primaryClass={cs.NE}
} | briscoe2007creating |
arxiv-2219 | 0712.4168 | A Framework for Providing E-Services to the Rural Areas using Wireless Ad Hoc and Sensor Networks | <|reference_start|>A Framework for Providing E-Services to the Rural Areas using Wireless Ad Hoc and Sensor Networks: In recent years, the proliferation of mobile computing devices has driven a revolutionary change in the computing world. The nature of ubiquitous devices makes wireless networks the easiest solution for their interconnection. This has led to the rapid growth of several wireless systems like wireless ad hoc networks, wireless sensor networks etc. In this paper we have proposed a framework for rural development by providing various e-services to the rural areas with the help of wireless ad hoc and sensor networks. We have discussed how timely and accurate information could be collected from the rural areas using wireless technologies. In addition to this, we have also mentioned the technical and operational challenges that could hinder the implementation of such a framework in the rural areas in the developing countries.<|reference_end|> | arxiv | @article{pathan2007a,
title={A Framework for Providing E-Services to the Rural Areas using Wireless
Ad Hoc and Sensor Networks},
author={Al-Sakib Khan Pathan, Humayun Kadir Islam, Sabit Anjum Sayeed, Farruk
Ahmed, Choong Seon Hong},
journal={Proceedings of IEEE ICNEWS 2006, January 2-4, Dhaka, Bangladesh,
2006, pp. 282-286},
year={2007},
archivePrefix={arXiv},
eprint={0712.4168},
primaryClass={cs.OH cs.NI}
} | pathan2007a |
arxiv-2220 | 0712.4169 | Security in Wireless Sensor Networks: Issues and Challenges | <|reference_start|>Security in Wireless Sensor Networks: Issues and Challenges: Wireless Sensor Network (WSN) is an emerging technology that shows great promise for various futuristic applications both for mass public and military. The sensing technology combined with processing power and wireless communication makes it lucrative for being exploited in abundance in future. The inclusion of wireless communication technology also incurs various types of security threats. The intent of this paper is to investigate the security related issues and challenges in wireless sensor networks. We identify the security threats, review proposed security mechanisms for wireless sensor networks. We also discuss the holistic view of security for ensuring layered and robust security in wireless sensor networks.<|reference_end|> | arxiv | @article{pathan2007security,
title={Security in Wireless Sensor Networks: Issues and Challenges},
author={Al-Sakib Khan Pathan, Hyung-Woo Lee, Choong Seon Hong},
journal={Proceedings of 8th IEEE ICACT 2006, Volume II, February 20-22,
Phoenix Park, Korea, 2006, pp. 1043-1048},
year={2007},
doi={10.1109/ICACT.2006.206151},
archivePrefix={arXiv},
eprint={0712.4169},
primaryClass={cs.NI}
} | pathan2007security |
arxiv-2221 | 0712.4170 | Smartening the Environment using Wireless Sensor Networks in a Developing Country | <|reference_start|>Smartening the Environment using Wireless Sensor Networks in a Developing Country: The miniaturization process of various sensing devices has become a reality by enormous research and advancements accomplished in Micro Electro-Mechanical Systems (MEMS) and Very Large Scale Integration (VLSI) lithography. Regardless of such extensive efforts in optimizing the hardware, algorithm, and protocols for networking, there still remains a lot of scope to explore how these innovations can all be tied together to design Wireless Sensor Networks (WSN) for smartening the surrounding environment for some practical purposes. In this paper we explore the prospects of wireless sensor networks and propose a design level framework for developing a smart environment using WSNs, which could be beneficial for a developing country like Bangladesh. In connection to this, we also discuss the major aspects of wireless sensor networks.<|reference_end|> | arxiv | @article{pathan2007smartening,
title={Smartening the Environment using Wireless Sensor Networks in a
Developing Country},
author={Al-Sakib Khan Pathan, Choong Seon Hong, Hyung-Woo Lee},
journal={Proceedings of 8th IEEE ICACT 2006, Volume I, February 20-22,
Phoenix Park, Korea, 2006, pp. 705-709},
year={2007},
doi={10.1109/ICACT.2006.206063},
archivePrefix={arXiv},
eprint={0712.4170},
primaryClass={cs.NI}
} | pathan2007smartening |
arxiv-2222 | 0712.4172 | Developing an Efficient DMCIS with Next-Generation Wireless Networks | <|reference_start|>Developing an Efficient DMCIS with Next-Generation Wireless Networks: The impact of extreme events across the globe is extraordinary which continues to handicap the advancement of the struggling developing societies and threatens most of the industrialized countries in the globe. Various fields of Information and Communication Technology have widely been used for efficient disaster management; but only to a limited extent though, there is a tremendous potential for increasing efficiency and effectiveness in coping with disasters with the utilization of emerging wireless network technologies. Early warning, response to the particular situation and proper recovery are among the main focuses of an efficient disaster management system today. Considering these aspects, in this paper we propose a framework for developing an efficient Disaster Management Communications and Information System (DMCIS) which is basically benefited by the exploitation of the emerging wireless network technologies combined with other networking and data processing technologies.<|reference_end|> | arxiv | @article{pathan2007developing,
title={Developing an Efficient DMCIS with Next-Generation Wireless Networks},
author={Al-Sakib Khan Pathan, Choong Seon Hong},
journal={IEEE Military Communications Conference (IEEE MILCOM 2006),
October 23-25, Washington, DC, USA},
year={2007},
doi={10.1109/MILCOM.2006.302515},
archivePrefix={arXiv},
eprint={0712.4172},
primaryClass={cs.NI}
} | pathan2007developing |
arxiv-2223 | 0712.4173 | Secure Clustering in DSN with Key Predistribution and WCDS | <|reference_start|>Secure Clustering in DSN with Key Predistribution and WCDS: This paper proposes an efficient approach of secure clustering in distributed sensor networks. The clusters or groups in the network are formed based on offline rank assignment and predistribution of secret keys. Our approach uses the concept of weakly connected dominating set (WCDS) to reduce the number of cluster-heads in the network. The formation of clusters in the network is secured as the secret keys are distributed and used in an efficient way to resist the inclusion of any hostile entity in the clusters. Along with the description of our approach, we present an analysis and comparison of our approach with other schemes. We also mention the limitations of our approach considering the practical implementation of the sensor networks.<|reference_end|> | arxiv | @article{pathan2007secure,
title={Secure Clustering in DSN with Key Predistribution and WCDS},
author={Al-Sakib Khan Pathan, Choong Seon Hong},
journal={IEEE Military Communications Conference (IEEE MILCOM 2006),
October 23-25, Washington, DC, USA},
year={2007},
doi={10.1109/MILCOM.2006.302183},
archivePrefix={arXiv},
eprint={0712.4173},
primaryClass={cs.NI}
} | pathan2007secure |
arxiv-2224 | 0712.4174 | A Novel and Efficient Bilateral Remote User Authentication Scheme Using Smart Cards | <|reference_start|>A Novel and Efficient Bilateral Remote User Authentication Scheme Using Smart Cards: This paper proposes a novel remote user authentication scheme using smart cards which allows both the authentication server (AS) and the user to verify authenticity of each other. Our scheme is efficient enough to resist the known attacks that could be launched against remote user authentication process.<|reference_end|> | arxiv | @article{pathan2007a,
title={A Novel and Efficient Bilateral Remote User Authentication Scheme Using
Smart Cards},
author={Al-Sakib Khan Pathan, Choong Seon Hong, Tatsuya Suda},
journal={Proceedings of the 2007 IEEE International Conference on Consumer
Electronics (IEEE ICCE 2007), January 10-14, Las Vegas, USA, pp. 1-2},
year={2007},
doi={10.1109/ICCE.2007.341503},
archivePrefix={arXiv},
eprint={0712.4174},
primaryClass={cs.CR cs.NI}
} | pathan2007a |
arxiv-2225 | 0712.4176 | An Improved Timestamp-Based Password Authentication Scheme Using Smart Cards | <|reference_start|>An Improved Timestamp-Based Password Authentication Scheme Using Smart Cards: With the recent proliferation of distributed systems and networking, remote authentication has become a crucial task in many networking applications. Various schemes have been proposed so far for the two-party remote authentication; however, some of them have been proved to be insecure. In this paper, we propose an efficient timestamp-based password authentication scheme using smart cards. We show various types of forgery attacks against a previously proposed timestamp-based password authentication scheme and improve that scheme to ensure robust security for the remote authentication process, keeping all the advantages that were present in that scheme. Our scheme successfully defends the attacks that could be launched against other related previous schemes. We present a detailed cryptanalysis of previously proposed Shen et. al scheme and an analysis of the improved scheme to show its improvements and efficiency.<|reference_end|> | arxiv | @article{pathan2007an,
title={An Improved Timestamp-Based Password Authentication Scheme Using Smart
Cards},
author={Al-Sakib Khan Pathan, Choong Seon Hong},
journal={Proceedings of the 9th IEEE ICACT 2007, Volume I, February 12-14,
2007, Phoenix Park, Korea, pp. 804-809},
year={2007},
doi={10.1093/ietisy/e90-d.11.1885},
archivePrefix={arXiv},
eprint={0712.4176},
primaryClass={cs.CR cs.NI}
} | pathan2007an |
arxiv-2226 | 0712.4177 | A Secure Lightweight Approach of Node Membership Verification in Dense HDSN | <|reference_start|>A Secure Lightweight Approach of Node Membership Verification in Dense HDSN: In this paper, we consider a particular type of deployment scenario of a distributed sensor network (DSN), where sensors of different types and categories are densely deployed in the same target area. In this network, the sensors are associated with different groups, based on their functional types and after deployment they collaborate with one another in the same group for doing any assigned task for that particular group. We term this sort of DSN as a heterogeneous distributed sensor network (HDSN). Considering this scenario, we propose a secure membership verification mechanism using one-way accumulator (OWA) which ensures that, before collaborating for a particular task, any pair of nodes in the same deployment group can verify each other-s legitimacy of membership. Our scheme also supports addition and deletion of members (nodes) in a particular group in the HDSN. Our analysis shows that, the proposed scheme could work well in conjunction with other security mechanisms for sensor networks and is very effective to resist any adversary-s attempt to be included in a legitimate group in the network.<|reference_end|> | arxiv | @article{pathan2007a,
title={A Secure Lightweight Approach of Node Membership Verification in Dense
HDSN},
author={Al-Sakib Khan Pathan, Gihyuk Heo, Choong Seon Hong},
journal={IEEE Military Communications Conference (IEEE MILCOM 2007),
October 29-31, Orlando, Florida, USA},
year={2007},
doi={10.1109/MILCOM.2007.4455133},
archivePrefix={arXiv},
eprint={0712.4177},
primaryClass={cs.NI cs.CR}
} | pathan2007a |
arxiv-2227 | 0712.4178 | An Efficient PKC-Based Security Architecture for Wireless Sensor Networks | <|reference_start|>An Efficient PKC-Based Security Architecture for Wireless Sensor Networks: In spite of previous widely held belief of the incompatibility of public key cryptography (PKC) schemes for wireless sensor networks (WSNs), some recent works have shown that, PKC based schemes could be implemented for such networks in some ways. The major challenge of employing a PKC scheme in wireless sensor network is posed by the limitations of resources of the tiny sensors. Considering this feature of the sensors, in this paper, we propose an efficient PKC based security architecture with relatively less resource requirements than those of the other previously proposed PKC schemes for WSN. Our security architecture comprises basically of two parts; a key handshaking scheme based on simple linear operations and the derivation of decryption key by a receiver node. Our architecture allows both base-station-to-node or node-to-base-station secure communications, and node-to-node secure communications. Analysis and simulation results show that, our proposed architecture ensures a good level of security for communications in the network and could effectively be implemented using the limited computation, memory and energy budgets of the current generation sensor nodes.<|reference_end|> | arxiv | @article{haque2007an,
title={An Efficient PKC-Based Security Architecture for Wireless Sensor
Networks},
author={Md. Mokammel Haque, Al-Sakib Khan Pathan, Byung Goo Choi, Choong Seon
Hong},
journal={IEEE Military Communications Conference (IEEE MILCOM 2007),
October 29-31, Orlando, Florida, USA},
year={2007},
doi={10.1109/MILCOM.2007.4455317},
archivePrefix={arXiv},
eprint={0712.4178},
primaryClass={cs.CR cs.NI}
} | haque2007an |
arxiv-2228 | 0712.4183 | Probabilistic Visual Secret Sharing Schemes for Gray-scale images and Color images | <|reference_start|>Probabilistic Visual Secret Sharing Schemes for Gray-scale images and Color images: Visual secrete sharing (VSS) is an encryption technique that utilizes human visual system in the recovering of the secret image and it does not require any complex calculation. Pixel expansion has been a major issue of VSS schemes. A number of probabilistic VSS schemes with minimum pixel expansion have been proposed for binary secret images. This paper presents a general probabilistic (k, n)-VSS scheme for gray-scale images and another scheme for color images. With our schemes, the pixel expansion can be set to a user-defined value. When this value is 1, there is no pixel expansion at all. The quality of reconstructed secret images, measured by Average Relative Difference, is equivalent to Relative Difference of existing deterministic schemes. Previous probabilistic VSS schemes for black-and-white images with respect to pixel expansion can be viewed as special cases of the schemes proposed here<|reference_end|> | arxiv | @article{wang2007probabilistic,
title={Probabilistic Visual Secret Sharing Schemes for Gray-scale images and
Color images},
author={Dao-Shun Wang, Feng Yi and Xiaobo Li},
journal={arXiv preprint arXiv:0712.4183},
year={2007},
archivePrefix={arXiv},
eprint={0712.4183},
primaryClass={cs.CR cs.CV}
} | wang2007probabilistic |
arxiv-2229 | 0712.4209 | The Generalized Random Energy Model and its Application to the Statistical Physics of Ensembles of Hierarchical Codes | <|reference_start|>The Generalized Random Energy Model and its Application to the Statistical Physics of Ensembles of Hierarchical Codes: In an earlier work, the statistical physics associated with finite--temperature decoding of code ensembles, along with the relation to their random coding error exponents, were explored in a framework that is analogous to Derrida's random energy model (REM) of spin glasses, according to which the energy levels of the various spin configurations are independent random variables. The generalized REM (GREM) extends the REM in that it introduces correlations between energy levels in an hierarchical structure. In this paper, we explore some analogies between the behavior of the GREM and that of code ensembles which have parallel hierarchical structures. In particular, in analogy to the fact that the GREM may have different types of phase transition effects, depending on the parameters of the model, then the above--mentioned hierarchical code ensembles behave substantially differently in the various domains of the design parameters of these codes. We make an attempt to explore the insights that can be imported from the statistical mechanics of the GREM and be harnessed to serve for code design considerations and guidelines.<|reference_end|> | arxiv | @article{merhav2007the,
title={The Generalized Random Energy Model and its Application to the
Statistical Physics of Ensembles of Hierarchical Codes},
author={Neri Merhav},
journal={arXiv preprint arXiv:0712.4209},
year={2007},
doi={10.1109/TIT.2008.2011445},
archivePrefix={arXiv},
eprint={0712.4209},
primaryClass={cs.IT math.IT}
} | merhav2007the |
arxiv-2230 | 0712.4213 | Exact Quantum Algorithms for the Leader Election Problem | <|reference_start|>Exact Quantum Algorithms for the Leader Election Problem: This paper gives the first separation of quantum and classical pure (i.e., non-cryptographic) computing abilities with no restriction on the amount of available computing resources, by considering the exact solvability of a celebrated unsolvable problem in classical distributed computing, the ``leader election problem'' on anonymous networks. The goal of the leader election problem is to elect a unique leader from among distributed parties. The paper considers this problem for anonymous networks, in which each party has the same identifier. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks, even if it is given the number of parties. This paper gives two quantum algorithms that, given the number of parties, can exactly solve the problem for any network topology in polynomial rounds and polynomial communication/time complexity with respect to the number of parties, when the parties are connected by quantum communication links.<|reference_end|> | arxiv | @article{tani2007exact,
title={Exact Quantum Algorithms for the Leader Election Problem},
author={Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto},
journal={ACM TOCT 4 (2012): Article 1; IEEE TPDS 23 (2012): 255 - 262},
year={2007},
archivePrefix={arXiv},
eprint={0712.4213},
primaryClass={quant-ph cs.DC cs.DS}
} | tani2007exact |
arxiv-2231 | 0712.4215 | Cyberspace security: How to develop a security strategy | <|reference_start|>Cyberspace security: How to develop a security strategy: Despite all visible dividers, the Internet is getting us closer and closer, but with a great price. Our security is the price. The international community is fully aware of the urgent need to secure the cyberspace as you see the multiplication of security standards and national schemes interpreting them beyond borders: ISO 15408, ISO 17799, and ISO 27001. Even though some countries, including the Security Big Six (SB6), are equipped with their security books and may feel relatively safe; this remains a wrong sense of security as long as they share their networks with entities of less security. The standards impose security best practices and system specifications for the development of information security management systems. Partners beyond borders have to be secure as this is only possible if all entities connected to the partnership remain secure. Unfortunately, there is no way to verify the continuous security of partners without periodic security auditing and certification, and members who do not comply should be barred from the partnership. This concept also applies to the cyber space or the electronic society. In order to clean our society from cyber crimes and cyber terrorism we need to impose strict security policies and enforce them in a cooperative manner. The paper discusses a country's effort in the development of a national security strategy given its security economic intelligence position, its security readiness, and its adverse exposure.<|reference_end|> | arxiv | @article{raggad2007cyberspace,
title={Cyberspace security: How to develop a security strategy},
author={Bel G. Raggad (PU - Seidenberg School of CS & IS), Sahbi Sidhom
(LORIA)},
journal={Dans V. International conference Cyberspace 2007 (2007)},
year={2007},
archivePrefix={arXiv},
eprint={0712.4215},
primaryClass={cs.OH}
} | raggad2007cyberspace |
arxiv-2232 | 0712.4222 | Weak Affine Light Typing: Polytime intensional expressivity, soundness and completeness | <|reference_start|>Weak Affine Light Typing: Polytime intensional expressivity, soundness and completeness: Weak affine light typing (WALT) assigns light affine linear formulae as types to a subset of lambda-terms in System F. WALT is poly-time sound: if a lambda-term M has type in WALT, M can be evaluated with a polynomial cost in the dimension of the derivation that gives it a type. In particular, the evaluation can proceed under any strategy of a rewriting relation, obtained as a mix of both call-by-name/call-by-value beta-reductions. WALT is poly-time complete since it can represent any poly-time Turing machine. WALT weakens, namely generalizes, the notion of stratification of deductions common to some Light Systems -- we call as such those logical systems, derived from Linear logic, to characterize FP, the set of Polynomial functions -- . A weaker stratification allows to define a compositional embedding of the Quasi-linear fragment QlSRN of Safe recursion on notation (SRN) into WALT. QlSRN is SRN, which is a recursive-theoretical system characterizing FP, where only the composition scheme is restricted to linear safe variables. So, the expressivity of WALT is stronger, as compared to the known Light Systems. In particular, using the types, the embedding puts in evidence the stratification of normal and safe arguments hidden in QlSRN: the less an argument is impredicative, the deeper, in a formal, proof-theoretical sense, gets its representation in WALT.<|reference_end|> | arxiv | @article{roversi2007weak,
title={Weak Affine Light Typing: Polytime intensional expressivity, soundness
and completeness},
author={Luca Roversi},
journal={arXiv preprint arXiv:0712.4222},
year={2007},
archivePrefix={arXiv},
eprint={0712.4222},
primaryClass={cs.LO}
} | roversi2007weak |
arxiv-2233 | 0712.4248 | Computer algebra in systems biology | <|reference_start|>Computer algebra in systems biology: Systems biology focuses on the study of entire biological systems rather than on their individual components. With the emergence of high-throughput data generation technologies for molecular biology and the development of advanced mathematical modeling techniques, this field promises to provide important new insights. At the same time, with the availability of increasingly powerful computers, computer algebra has developed into a useful tool for many applications. This article illustrates the use of computer algebra in systems biology by way of a well-known gene regulatory network, the Lac Operon in the bacterium E. coli.<|reference_end|> | arxiv | @article{laubenbacher2007computer,
title={Computer algebra in systems biology},
author={Reinhard Laubenbacher and Bernd Sturmfels},
journal={arXiv preprint arXiv:0712.4248},
year={2007},
archivePrefix={arXiv},
eprint={0712.4248},
primaryClass={cs.SC q-bio.MN q-bio.QM}
} | laubenbacher2007computer |
arxiv-2234 | 0712.4273 | Online EM Algorithm for Latent Data Models | <|reference_start|>Online EM Algorithm for Latent Data Models: In this contribution, we propose a generic online (also sometimes called adaptive or recursive) version of the Expectation-Maximisation (EM) algorithm applicable to latent variable models of independent observations. Compared to the algorithm of Titterington (1984), this approach is more directly connected to the usual EM algorithm and does not rely on integration with respect to the complete data distribution. The resulting algorithm is usually simpler and is shown to achieve convergence to the stationary points of the Kullback-Leibler divergence between the marginal distribution of the observation and the model distribution at the optimal rate, i.e., that of the maximum likelihood estimator. In addition, the proposed approach is also suitable for conditional (or regression) models, as illustrated in the case of the mixture of linear regressions model.<|reference_end|> | arxiv | @article{cappé2007online,
title={Online EM Algorithm for Latent Data Models},
author={Olivier Capp'e (LTCI), Eric Moulines (LTCI)},
journal={Journal of the Royal Statistical Society: Series B, Royal
Statistical Society, 2009, 71 (3), pp.593-613},
year={2007},
doi={10.1111/j.1467-9868.2009.00698.x},
archivePrefix={arXiv},
eprint={0712.4273},
primaryClass={stat.CO cs.LG}
} | cappé2007online |
arxiv-2235 | 0712.4279 | Disjointness is hard in the multi-party number on the forehead model | <|reference_start|>Disjointness is hard in the multi-party number on the forehead model: We show that disjointness requires randomized communication Omega(n^{1/(k+1)}/2^{2^k}) in the general k-party number-on-the-forehead model of complexity. The previous best lower bound for k >= 3 was log(n)/(k-1). Our results give a separation between nondeterministic and randomized multiparty number-on-the-forehead communication complexity for up to k=log log n - O(log log log n) many players. Also by a reduction of Beame, Pitassi, and Segerlind, these results imply subexponential lower bounds on the size of proofs needed to refute certain unsatisfiable CNFs in a broad class of proof systems, including tree-like Lovasz-Schrijver proofs.<|reference_end|> | arxiv | @article{lee2007disjointness,
title={Disjointness is hard in the multi-party number on the forehead model},
author={Troy Lee, Adi Shraibman},
journal={arXiv preprint arXiv:0712.4279},
year={2007},
archivePrefix={arXiv},
eprint={0712.4279},
primaryClass={cs.CC}
} | lee2007disjointness |
arxiv-2236 | 0712.4318 | Convergence of Expected Utilities with Algorithmic Probability Distributions | <|reference_start|>Convergence of Expected Utilities with Algorithmic Probability Distributions: We consider an agent interacting with an unknown environment. The environment is a function which maps natural numbers to natural numbers; the agent's set of hypotheses about the environment contains all such functions which are computable and compatible with a finite set of known input-output pairs, and the agent assigns a positive probability to each such hypothesis. We do not require that this probability distribution be computable, but it must be bounded below by a positive computable function. The agent has a utility function on outputs from the environment. We show that if this utility function is bounded below in absolute value by an unbounded computable function, then the expected utility of any input is undefined. This implies that a computable utility function will have convergent expected utilities iff that function is bounded.<|reference_end|> | arxiv | @article{de blanc2007convergence,
title={Convergence of Expected Utilities with Algorithmic Probability
Distributions},
author={Peter de Blanc},
journal={arXiv preprint arXiv:0712.4318},
year={2007},
archivePrefix={arXiv},
eprint={0712.4318},
primaryClass={cs.AI}
} | de blanc2007convergence |
arxiv-2237 | 0712.4321 | Subsystem Code Constructions | <|reference_start|>Subsystem Code Constructions: Subsystem codes are the most versatile class of quantum error-correcting codes known to date that combine the best features of all known passive and active error-control schemes. The subsystem code is a subspace of the quantum state space that is decomposed into a tensor product of two vector spaces: the subsystem and the co-subsystem. A generic method to derive subsystem codes from existing subsystem codes is given that allows one to trade the dimensions of subsystem and co-subsystem while maintaining or improving the minimum distance. As a consequence, it is shown that all pure MDS subsystem codes are derived from MDS stabilizer codes. The existence of numerous families of MDS subsystem codes is established. Propagation rules are derived that allow one to obtain longer and shorter subsystem codes from given subsystem codes. Furthermore, propagation rules are derived that allow one to construct a new subsystem code by combining two given subsystem codes.<|reference_end|> | arxiv | @article{aly2007subsystem,
title={Subsystem Code Constructions},
author={Salah A. Aly and Andreas Klappenecker},
journal={Proc. of IEEE ISIT 08, Toronto, CA, 2008},
year={2007},
archivePrefix={arXiv},
eprint={0712.4321},
primaryClass={quant-ph cs.IT math.IT}
} | aly2007subsystem |
arxiv-2238 | 0712.4341 | Finite Automata Based on Quantum Logic and Their Determinization | <|reference_start|>Finite Automata Based on Quantum Logic and Their Determinization: We give the quantum subset construction of orthomodular lattice-valued finite automata, then we show the equivalence between orthomodular lattice-valued finite automata, orthomodular lattice-valued deterministic finite automata and orthomodular lattice-valued finite automata with empty string-moves. Based on these equivalences, we study the algebraic operations on orthomodular lattice-valued regular languages, then we establish Kleene theorem in the frame of quantum logic.<|reference_end|> | arxiv | @article{li2007finite,
title={Finite Automata Based on Quantum Logic and Their Determinization},
author={Yongming Li},
journal={arXiv preprint arXiv:0712.4341},
year={2007},
archivePrefix={arXiv},
eprint={0712.4341},
primaryClass={cs.LO}
} | li2007finite |
arxiv-2239 | 0712.4402 | Judgment | <|reference_start|>Judgment: The concept of a judgment as a logical action which introduces new information into a deductive system is examined. This leads to a way of mathematically representing implication which is distinct from the familiar material implication, according to which "If A then B" is considered to be equivalent to "B or not-A". This leads, in turn, to a resolution of the paradox of the raven.<|reference_end|> | arxiv | @article{o'flanagan2007judgment,
title={Judgment},
author={Ruadhan O'Flanagan},
journal={arXiv preprint arXiv:0712.4402},
year={2007},
archivePrefix={arXiv},
eprint={0712.4402},
primaryClass={math.PR cs.AI math.LO}
} | o'flanagan2007judgment |
arxiv-2240 | 0801.0061 | Security for Wiretap Networks via Rank-Metric Codes | <|reference_start|>Security for Wiretap Networks via Rank-Metric Codes: The problem of securing a network coding communication system against a wiretapper adversary is considered. The network implements linear network coding to deliver $n$ packets from source to each receiver, and the wiretapper can eavesdrop on $\mu$ arbitrarily chosen links. A coding scheme is proposed that can achieve the maximum possible rate of $k=n-\mu$ packets that are information-theoretically secure from the adversary. A distinctive feature of our scheme is that it is universal: it can be applied on top of any communication network without requiring knowledge of or any modifications on the underlying network code. In fact, even a randomized network code can be used. Our approach is based on Rouayheb-Soljanin's formulation of a wiretap network as a generalization of the Ozarow-Wyner wiretap channel of type II. Essentially, the linear MDS code in Ozarow-Wyner's coset coding scheme is replaced by a maximum-rank-distance code over an extension of the field in which linear network coding operations are performed.<|reference_end|> | arxiv | @article{silva2007security,
title={Security for Wiretap Networks via Rank-Metric Codes},
author={Danilo Silva, Frank R. Kschischang},
journal={arXiv preprint arXiv:0801.0061},
year={2007},
doi={10.1109/ISIT.2008.4594971},
archivePrefix={arXiv},
eprint={0801.0061},
primaryClass={cs.IT cs.CR math.IT}
} | silva2007security |
arxiv-2241 | 0801.0092 | Nash bargaining with a nondeterministic threat | <|reference_start|>Nash bargaining with a nondeterministic threat: We consider bargaining problems which involve two participants, with a nonempty closed, bounded convex bargaining set of points in the real plane representing all realizable bargains. We also assume that there is no definite threat or disagreement point which will provide the default bargain if the players cannot agree on some point in the bargaining set. However, there is a nondeterministic threat: if the players fail to agree on a bargain, one of them will be chosen at random with equal probability, and that chosen player will select any realizable bargain as the solution, subject to a reasonable restriction.<|reference_end|> | arxiv | @article{soileau2007nash,
title={Nash bargaining with a nondeterministic threat},
author={Kerry Michael Soileau},
journal={arXiv preprint arXiv:0801.0092},
year={2007},
archivePrefix={arXiv},
eprint={0801.0092},
primaryClass={cs.GT}
} | soileau2007nash |
arxiv-2242 | 0801.0102 | Reserved-Length Prefix Coding | <|reference_start|>Reserved-Length Prefix Coding: Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all codewords have lengths that lie in a user-specified set of lengths (or, equivalently, no codewords have lengths that lie in a complementary set). This paper introduces a polynomial-time dynamic programming algorithm that finds optimal codes for this reserved-length prefix coding problem. This has applications to quickly encoding and decoding lossless codes. In addition, one modification of the approach solves any quasiarithmetic prefix coding problem, while another finds optimal codes restricted to the set of codes with g codeword lengths for user-specified g (e.g., g=2).<|reference_end|> | arxiv | @article{baer2007reserved-length,
title={Reserved-Length Prefix Coding},
author={Michael B. Baer},
journal={arXiv preprint arXiv:0801.0102},
year={2007},
archivePrefix={arXiv},
eprint={0801.0102},
primaryClass={cs.IT cs.DS math.IT}
} | baer2007reserved-length |
arxiv-2243 | 0801.0131 | Two-Level Concept-Oriented Data Model | <|reference_start|>Two-Level Concept-Oriented Data Model: In this paper we describe a new approach to data modelling called the concept-oriented model (CoM). This model is based on the formalism of nested ordered sets which uses inclusion relation to produce hierarchical structure of sets and ordering relation to produce multi-dimensional structure among its elements. Nested ordered set is defined as an ordered set where an each element can be itself an ordered set. Ordering relation in CoM is used to define data semantics and operations with data such as projection and de-projection. This data model can be applied to very different problems and the paper describes some its uses such grouping with aggregation and multi-dimensional analysis.<|reference_end|> | arxiv | @article{savinov2007two-level,
title={Two-Level Concept-Oriented Data Model},
author={Alexandr Savinov},
journal={Institute of Mathematics and Computer Science, Academy of Sciences
of Moldova, Technical Report RT0006, 2007},
year={2007},
number={Technical Report RT0006},
archivePrefix={arXiv},
eprint={0801.0131},
primaryClass={cs.DB}
} | savinov2007two-level |
arxiv-2244 | 0801.0133 | An Approach to Programming Based on Concepts | <|reference_start|>An Approach to Programming Based on Concepts: In this paper we describe a new approach to programming which generalizes object-oriented programming. It is based on using a new programming construct, called concept, which generalizes classes. Concept is defined as a pair of two classes: one reference class and one object class. Each concept has a parent concept which is specified using inclusion relation generalizing inheritance. We describe several important mechanisms such as reference resolution, context stack, dual methods and life-cycle management, inheritance and polymorphism. This approach to programming is positioned as a new programming paradigm and therefore we formulate its main principles and rules.<|reference_end|> | arxiv | @article{savinov2007an,
title={An Approach to Programming Based on Concepts},
author={Alexandr Savinov},
journal={Institute of Mathematics and Computer Science, Academy of Sciences
of Moldova, Technical Report RT0005, 2007},
year={2007},
number={Technical Report RT0005},
archivePrefix={arXiv},
eprint={0801.0133},
primaryClass={cs.PL}
} | savinov2007an |
arxiv-2245 | 0801.0135 | Concepts and their Use for Modelling Objects and References in Programming Languages | <|reference_start|>Concepts and their Use for Modelling Objects and References in Programming Languages: In the paper a new programming construct, called concept, is introduced. Concept is pair of two classes: a reference class and an object class. Instances of the reference classes are passed-by-value and are intended to represent objects. Instances of the object class are passed-by-reference. An approach to programming where concepts are used instead of classes is called concept-oriented programming (CoP). In CoP objects are represented and accessed indirectly by means of references. The structure of concepts describes a hierarchical space with a virtual address system. The paper describes this new approach to programming including such mechanisms as reference resolution, complex references, method interception, dual methods, life-cycle management inheritance and polymorphism.<|reference_end|> | arxiv | @article{savinov2007concepts,
title={Concepts and their Use for Modelling Objects and References in
Programming Languages},
author={Alexandr Savinov},
journal={Institute of Mathematics and Computer Science, Academy of Sciences
of Moldova, Technical Report RT0004, 2007},
year={2007},
number={Technical Report RT0004},
archivePrefix={arXiv},
eprint={0801.0135},
primaryClass={cs.PL}
} | savinov2007concepts |
arxiv-2246 | 0801.0136 | Indirect Object Representation and Access by Means of Concepts | <|reference_start|>Indirect Object Representation and Access by Means of Concepts: The paper describes a mechanism for indirect object representation and access (ORA) in programming languages. The mechanism is based on using a new programming construct which is referred to as concept. Concept consists of one object class and one reference class both having their fields and methods. The object class is the conventional class as defined in OOP with instances passed by reference. Instances of the reference class are passed by value and are intended to represent objects. The reference classes are used to describe how objects have to be represented and accessed by providing custom format for their identifiers and custom access procedures. Such an approach to programming where concepts are used instead of classes is referred to as concept-oriented programming. It generalizes OOP and its main advantage is that it allows the programmer to describe not only the functionality of target objects but also intermediate functions which are executed behind the scenes as an object is being accessed.<|reference_end|> | arxiv | @article{savinov2007indirect,
title={Indirect Object Representation and Access by Means of Concepts},
author={Alexandr Savinov},
journal={Institute of Mathematics and Computer Science, Academy of Sciences
of Moldova, Technical Report, 2006},
year={2007},
archivePrefix={arXiv},
eprint={0801.0136},
primaryClass={cs.PL}
} | savinov2007indirect |
arxiv-2247 | 0801.0139 | Principles of the Concept-Oriented Data Model | <|reference_start|>Principles of the Concept-Oriented Data Model: In the paper a new approach to data representation and manipulation is described, which is called the concept-oriented data model (CODM). It is supposed that items represent data units, which are stored in concepts. A concept is a combination of superconcepts, which determine the concept's dimensionality or properties. An item is a combination of superitems taken by one from all the superconcepts. An item stores a combination of references to its superitems. The references implement inclusion relation or attribute-value relation among items. A concept-oriented database is defined by its concept structure called syntax or schema and its item structure called semantics. The model defines formal transformations of syntax and semantics including the canonical semantics where all concepts are merged and the data semantics is represented by one set of items. The concept-oriented data model treats relations as subconcepts where items are instances of the relations. Multi-valued attributes are defined via subconcepts as a view on the database semantics rather than as a built-in mechanism. The model includes concept-oriented query language, which is based on collection manipulations. It also has such mechanisms as aggregation and inference based on semantics propagation through the database schema.<|reference_end|> | arxiv | @article{savinov2007principles,
title={Principles of the Concept-Oriented Data Model},
author={Alexandr Savinov},
journal={Institute of Mathematics and Computer Science, Academy of Sciences
of Moldova, Technical Report, 2004},
year={2007},
archivePrefix={arXiv},
eprint={0801.0139},
primaryClass={cs.DB}
} | savinov2007principles |
arxiv-2248 | 0801.0159 | Interval Edge Colorings of Mobius Ladders | <|reference_start|>Interval Edge Colorings of Mobius Ladders: An interval edge t-coloring of a graph G is a proper edge coloring of G with colors 1,2...,t such that at least one edge of G is colored by color i,i=1,2...,t, and the edges incident with each vertex x are colored by d_{G}(x) consecutive colors, where d_{G}(x) is the degree of the vertex x in G. For Mobius ladders the existence of this coloring is proved and all possible numbers of colors in such colorings are found.<|reference_end|> | arxiv | @article{petrosyan2007interval,
title={Interval Edge Colorings of Mobius Ladders},
author={P.A. Petrosyan},
journal={Proceedings of the CSIT Conference, Yerevan, 2005, 146-149},
year={2007},
archivePrefix={arXiv},
eprint={0801.0159},
primaryClass={cs.DM}
} | petrosyan2007interval |
arxiv-2249 | 0801.0184 | The Existence of Strongly-MDS Convolutional Codes | <|reference_start|>The Existence of Strongly-MDS Convolutional Codes: It is known that maximum distance separable and maximum distance profile convolutional codes exist over large enough finite fields of any characteristic for all parameters $(n,k,\delta)$. It has been conjectured that the same is true for convolutional codes that are strongly maximum distance separable. Using methods from linear systems theory, we resolve this conjecture by showing that, over a large enough finite field of any characteristic, codes which are simultaneously maximum distance profile and strongly maximum distance separable exist for all parameters $(n,k,\delta)$.<|reference_end|> | arxiv | @article{hutchinson2007the,
title={The Existence of Strongly-MDS Convolutional Codes},
author={Ryan Hutchinson},
journal={arXiv preprint arXiv:0801.0184},
year={2007},
archivePrefix={arXiv},
eprint={0801.0184},
primaryClass={math.OC cs.IT math.IT}
} | hutchinson2007the |
arxiv-2250 | 0801.0209 | Effective symbolic dynamics, random points, statistical behavior, complexity and entropy | <|reference_start|>Effective symbolic dynamics, random points, statistical behavior, complexity and entropy: We consider the dynamical behavior of Martin-L\"of random points in dynamical systems over metric spaces with a computable dynamics and a computable invariant measure. We use computable partitions to define a sort of effective symbolic model for the dynamics. Through this construction we prove that such points have typical statistical behavior (the behavior which is typical in the Birkhoff ergodic theorem) and are recurrent. We introduce and compare some notions of complexity for orbits in dynamical systems and prove: (i) that the complexity of the orbits of random points equals the Kolmogorov-Sina\"i entropy of the system, (ii) that the supremum of the complexity of orbits equals the topological entropy.<|reference_end|> | arxiv | @article{galatolo2007effective,
title={Effective symbolic dynamics, random points, statistical behavior,
complexity and entropy},
author={Stefano Galatolo, Mathieu Hoyrup and Cristobal Rojas},
journal={arXiv preprint arXiv:0801.0209},
year={2007},
archivePrefix={arXiv},
eprint={0801.0209},
primaryClass={math.DS cs.IT math.IT math.PR}
} | galatolo2007effective |
arxiv-2251 | 0801.0232 | Does intelligence imply contradiction? | <|reference_start|>Does intelligence imply contradiction?: Contradiction is often seen as a defect of intelligent systems and a dangerous limitation on efficiency. In this paper we raise the question of whether, on the contrary, it could be considered a key tool in increasing intelligence in biological structures. A possible way of answering this question in a mathematical context is shown, formulating a proposition that suggests a link between intelligence and contradiction. A concrete approach is presented in the well-defined setting of cellular automata. Here we define the models of ``observer'', ``entity'', ``environment'', ``intelligence'' and ``contradiction''. These definitions, which roughly correspond to the common meaning of these words, allow us to deduce a simple but strong result about these concepts in an unbiased, mathematical manner. Evidence for a real-world counterpart to the demonstrated formal link between intelligence and contradiction is provided by three computational experiments.<|reference_end|> | arxiv | @article{frosini2007does,
title={Does intelligence imply contradiction?},
author={Patrizio Frosini},
journal={arXiv preprint arXiv:0801.0232},
year={2007},
archivePrefix={arXiv},
eprint={0801.0232},
primaryClass={cs.AI cs.LO}
} | frosini2007does |
arxiv-2252 | 0801.0249 | A mathematical formalism for agent-based modeling | <|reference_start|>A mathematical formalism for agent-based modeling: Many complex systems can be modeled as multiagent systems in which the constituent entities (agents) interact with each other. The global dynamics of such a system is determined by the nature of the local interactions among the agents. Since it is difficult to formally analyze complex multiagent systems, they are often studied through computer simulations. While computer simulations can be very useful, results obtained through simulations do not formally validate the observed behavior. Thus, there is a need for a mathematical framework which one can use to represent multiagent systems and formally establish their properties. This work contains a brief exposition of some known mathematical frameworks that can model multiagent systems. The focus is on one such framework, namely that of finite dynamical systems. Both, deterministic and stochastic versions of this framework are discussed. The paper contains a sampling of the mathematical results from the literature to show how finite dynamical systems can be used to carry out a rigorous study of the properties of multiagent systems and it is shown how the framework can also serve as a universal model for computation.<|reference_end|> | arxiv | @article{laubenbacher2007a,
title={A mathematical formalism for agent-based modeling},
author={Reinhard Laubenbacher, Abdul S. Jarrah, Henning Mortveit, and S.S.
Ravi},
journal={arXiv preprint arXiv:0801.0249},
year={2007},
archivePrefix={arXiv},
eprint={0801.0249},
primaryClass={cs.MA cs.DM math.CO}
} | laubenbacher2007a |
arxiv-2253 | 0801.0253 | Toward a statistical mechanics of four letter words | <|reference_start|>Toward a statistical mechanics of four letter words: We consider words as a network of interacting letters, and approximate the probability distribution of states taken on by this network. Despite the intuition that the rules of English spelling are highly combinatorial (and arbitrary), we find that maximum entropy models consistent with pairwise correlations among letters provide a surprisingly good approximation to the full statistics of four letter words, capturing ~92% of the multi-information among letters and even "discovering" real words that were not represented in the data from which the pairwise correlations were estimated. The maximum entropy model defines an energy landscape on the space of possible words, and local minima in this landscape account for nearly two-thirds of words used in written English.<|reference_end|> | arxiv | @article{stephens2007toward,
title={Toward a statistical mechanics of four letter words},
author={Greg J. Stephens and William Bialek},
journal={arXiv preprint arXiv:0801.0253},
year={2007},
doi={10.1103/PhysRevE.81.066119},
archivePrefix={arXiv},
eprint={0801.0253},
primaryClass={q-bio.NC cs.CL physics.data-an physics.soc-ph}
} | stephens2007toward |
arxiv-2254 | 0801.0258 | On the Maximum Span of Fixed-Angle Chains | <|reference_start|>On the Maximum Span of Fixed-Angle Chains: Soss proved that it is NP-hard to find the maximum 2D span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These fixed-angle chains can serve as models of protein backbones. The corresponding problem in 3D is open. We show that three special cases of particular relevance to the protein model are solvable in polynomial time. When all link lengths and all angles are equal, the maximum 3D span is achieved in a flat configuration and can be computed in constant time. When all angles are equal and the chain is simple (non-self-crossing), the maximum flat span can be found in linear time. In 3D, when all angles are equal to 90 deg (but the link lengths arbitrary), the maximum 3D span is in general nonplanar but can be found in quadratic time.<|reference_end|> | arxiv | @article{benbernou2008on,
title={On the Maximum Span of Fixed-Angle Chains},
author={Nadia Benbernou, Joseph O'Rourke},
journal={arXiv preprint arXiv:0801.0258},
year={2008},
number={Smith Computer Science 088},
archivePrefix={arXiv},
eprint={0801.0258},
primaryClass={cs.CG}
} | benbernou2008on |
arxiv-2255 | 0801.0275 | Estimating Signals with Finite Rate of Innovation from Noisy Samples: A Stochastic Algorithm | <|reference_start|>Estimating Signals with Finite Rate of Innovation from Noisy Samples: A Stochastic Algorithm: As an example of the recently-introduced concept of rate of innovation, signals that are linear combinations of a finite number of Diracs per unit time can be acquired by linear filtering followed by uniform sampling. However, in reality, samples are rarely noiseless. In this paper, we introduce a novel stochastic algorithm to reconstruct a signal with finite rate of innovation from its noisy samples. Even though variants of this problem has been approached previously, satisfactory solutions are only available for certain classes of sampling kernels, for example kernels which satisfy the Strang-Fix condition. In this paper, we consider the infinite-support Gaussian kernel, which does not satisfy the Strang-Fix condition. Other classes of kernels can be employed. Our algorithm is based on Gibbs sampling, a Markov chain Monte Carlo (MCMC) method. Extensive numerical simulations demonstrate the accuracy and robustness of our algorithm.<|reference_end|> | arxiv | @article{tan2008estimating,
title={Estimating Signals with Finite Rate of Innovation from Noisy Samples: A
Stochastic Algorithm},
author={Vincent Y. F. Tan, Vivek K. Goyal},
journal={IEEE Trans. on Signal Processing, vol. 56, no. 10, pp. 5135-5146,
October 2008},
year={2008},
doi={10.1109/TSP.2008.928510},
archivePrefix={arXiv},
eprint={0801.0275},
primaryClass={stat.AP cs.IT math.IT}
} | tan2008estimating |
arxiv-2256 | 0801.0289 | Is Randomness "Native" to Computer Science? | <|reference_start|>Is Randomness "Native" to Computer Science?: We survey the Kolmogorov's approach to the notion of randomness through the Kolmogorov complexity theory. The original motivation of Kolmogorov was to give up a quantitative definition of information. In this theory, an object is randomness in the sense that it has a large information content. Afterwards, we present parts of the work of Martin-Lof, Schnorr, Chaitin and Levin which supply a mathematical notion of randomness throughout diverse theories from the the 60' up to recently.<|reference_end|> | arxiv | @article{ferbus-zanda2008is,
title={Is Randomness "Native" to Computer Science?},
author={Marie Ferbus-Zanda (LIAFA), Serge Grigorieff (LIAFA)},
journal={Current Trends in Theoretical Computer Science. Vol2, World
Scientific (Ed.) (2004) 141-180},
year={2008},
archivePrefix={arXiv},
eprint={0801.0289},
primaryClass={math.LO cs.CC}
} | ferbus-zanda2008is |
arxiv-2257 | 0801.0337 | The Physical World as a Virtual Reality | <|reference_start|>The Physical World as a Virtual Reality: This paper explores the idea that the universe is a virtual reality created by information processing, and relates this strange idea to the findings of modern physics about the physical world. The virtual reality concept is familiar to us from online worlds, but our world as a virtual reality is usually a subject for science fiction rather than science. Yet logically the world could be an information simulation running on a multi-dimensional space-time screen. Indeed, if the essence of the universe is information, matter, charge, energy and movement could be aspects of information, and the many conservation laws could be a single law of information conservation. If the universe were a virtual reality, its creation at the big bang would no longer be paradoxical, as every virtual system must be booted up. It is suggested that whether the world is an objective reality or a virtual reality is a matter for science to resolve. Modern information science can suggest how core physical properties like space, time, light, matter and movement could derive from information processing. Such an approach could reconcile relativity and quantum theories, with the former being how information processing creates space-time, and the latter how it creates energy and matter.<|reference_end|> | arxiv | @article{whitworth2008the,
title={The Physical World as a Virtual Reality},
author={Brian Whitworth},
journal={arXiv preprint arXiv:0801.0337},
year={2008},
number={CDMTCS0316},
archivePrefix={arXiv},
eprint={0801.0337},
primaryClass={cs.OH}
} | whitworth2008the |
arxiv-2258 | 0801.0340 | Sum Rate Maximization using Linear Precoding and Decoding in the Multiuser MIMO Downlink | <|reference_start|>Sum Rate Maximization using Linear Precoding and Decoding in the Multiuser MIMO Downlink: We propose an algorithm to maximize the instantaneous sum data rate transmitted by a base station in the downlink of a multiuser multiple-input, multiple-output system. The transmitter and the receivers may each be equipped with multiple antennas and each user may receive more than one data stream. We show that maximizing the sum rate is closely linked to minimizing the product of mean squared errors (PMSE). The algorithm employs an uplink/downlink duality to iteratively design transmit-receive linear precoders, decoders, and power allocations that minimize the PMSE for all data streams under a sum power constraint. Numerical simulations illustrate the effectiveness of the algorithm and support the use of the PMSE criterion in maximizing the overall instantaneous data rate.<|reference_end|> | arxiv | @article{tenenbaum2008sum,
title={Sum Rate Maximization using Linear Precoding and Decoding in the
Multiuser MIMO Downlink},
author={Adam J. Tenenbaum and Raviraj S. Adve},
journal={arXiv preprint arXiv:0801.0340},
year={2008},
archivePrefix={arXiv},
eprint={0801.0340},
primaryClass={cs.IT math.IT}
} | tenenbaum2008sum |
arxiv-2259 | 0801.0341 | Exactness of Belief Propagation for Some Graphical Models with Loops | <|reference_start|>Exactness of Belief Propagation for Some Graphical Models with Loops: It is well known that an arbitrary graphical model of statistical inference defined on a tree, i.e. on a graph without loops, is solved exactly and efficiently by an iterative Belief Propagation (BP) algorithm convergent to unique minimum of the so-called Bethe free energy functional. For a general graphical model on a loopy graph the functional may show multiple minima, the iterative BP algorithm may converge to one of the minima or may not converge at all, and the global minimum of the Bethe free energy functional is not guaranteed to correspond to the optimal Maximum-Likelihood (ML) solution in the zero-temperature limit. However, there are exceptions to this general rule, discussed in \cite{05KW} and \cite{08BSS} in two different contexts, where zero-temperature version of the BP algorithm finds ML solution for special models on graphs with loops. These two models share a key feature: their ML solutions can be found by an efficient Linear Programming (LP) algorithm with a Totally-Uni-Modular (TUM) matrix of constraints. Generalizing the two models we consider a class of graphical models reducible in the zero temperature limit to LP with TUM constraints. Assuming that a gedanken algorithm, g-BP, funding the global minimum of the Bethe free energy is available we show that in the limit of zero temperature g-BP outputs the ML solution. Our consideration is based on equivalence established between gapless Linear Programming (LP) relaxation of the graphical model in the $T\to 0$ limit and respective LP version of the Bethe-Free energy minimization.<|reference_end|> | arxiv | @article{chertkov2008exactness,
title={Exactness of Belief Propagation for Some Graphical Models with Loops},
author={Michael Chertkov (Los Alamos)},
journal={J. Stat. Mech. (2008) P10016},
year={2008},
doi={10.1088/1742-5468/2008/10/P10016},
number={LANL LA-UR-07-8441},
archivePrefix={arXiv},
eprint={0801.0341},
primaryClass={cond-mat.stat-mech cond-mat.other cs.AI cs.IT math.IT}
} | chertkov2008exactness |
arxiv-2260 | 0801.0349 | Church, Cardinal and Ordinal Representations of Integers and Kolmogorov complexity | <|reference_start|>Church, Cardinal and Ordinal Representations of Integers and Kolmogorov complexity: We consider classical representations of integers: Church's function iterators, cardinal equivalence classes of sets, ordinal equivalence classes of totally ordered sets. Since programs do not work on abstract entities and require formal representations of objects, we effectivize these abstract notions in order to allow them to be computed by programs. To any such effectivized representation is then associated a notion of Kolmogorov complexity. We prove that these Kolmogorov complexities form a strict hierarchy which coincides with that obtained by relativization to jump oracles and/or allowance of infinite computations.<|reference_end|> | arxiv | @article{ferbus-zanda2008church,,
title={Church, Cardinal and Ordinal Representations of Integers and Kolmogorov
complexity},
author={Marie Ferbus-Zanda (LIAFA), Serge Grigorieff (LIAFA)},
journal={Dans Denis Richard's 60th Biirthday Conference - Denis Richard's
60th Biirthday Conference, France (2002)},
year={2008},
archivePrefix={arXiv},
eprint={0801.0349},
primaryClass={math.LO cs.CC cs.LO}
} | ferbus-zanda2008church, |
arxiv-2261 | 0801.0350 | Refinment of the "up to a constant" ordering using contructive co-immunity and alike Application to the Min/Max hierarchy of Kolmogorov complexities | <|reference_start|>Refinment of the "up to a constant" ordering using contructive co-immunity and alike Application to the Min/Max hierarchy of Kolmogorov complexities: We introduce orderings between total functions f,g: N -> N which refine the pointwise "up to a constant" ordering <=cte and also insure that f(x) is often much less thang(x). With such orderings, we prove a strong hierarchy theorem for Kolmogorov complexities obtained with jump oracles and/or Max or Min of partial recursive functions. We introduce a notion of second order conditional Kolmogorov complexity which yields a uniform bound for the "up to a constant" comparisons involved in the hierarchy theorem.<|reference_end|> | arxiv | @article{ferbus-zanda2008refinment,
title={Refinment of the "up to a constant" ordering using contructive
co-immunity and alike. Application to the Min/Max hierarchy of Kolmogorov
complexities},
author={Marie Ferbus-Zanda (LIAFA), Serge Grigorieff (LIAFA)},
journal={arXiv preprint arXiv:0801.0350},
year={2008},
archivePrefix={arXiv},
eprint={0801.0350},
primaryClass={math.LO cs.CC}
} | ferbus-zanda2008refinment |
arxiv-2262 | 0801.0351 | Kolmogorov complexities Kmax, Kmin on computable partially ordered sets | <|reference_start|>Kolmogorov complexities Kmax, Kmin on computable partially ordered sets: We introduce a machine free mathematical framework to get a natural formalization of some general notions of infinite computation in the context of Kolmogorov complexity. Namely, the classes Max^{X\to D}_{PR} and Max^{X\to D}_{Rec} of functions X \to D which are pointwise maximum of partial or total computable sequences of functions where D = (D,<) is some computable partially ordered set. The enumeration theorem and the invariance theorem always hold for Max^{X\to D}_{PR}, leading to a variant KD;max of Kolmogorov complexity. We characterize the orders D such that the enumeration theorem (resp. the invariance theorem) also holds for Max^{X\to D}_{Rec} . It turns out that Max^{X\to D}_{Rec} may satisfy the invariance theorem but not the enumeration theorem. Also, when Max^{X\to D}_{Rec} satisfies the invariance theorem then the Kolmogorov complexities associated to Max^{X\to D}_{Rec} and Max^{X\to D}_{PR} are equal (up to a constant). Letting K^D_{min} = K^{D^{rev}}_{max}, where D^{rev} is the reverse order, we prove that either K^D_{min} =_{ct} K^D_{max} =_{ct} K^D (=_{ct} is equality up to a constant) or K^D_{min}, K^D_{max} are <=_{ct} incomparable and <_{ct} K^D and >_{ct} K^{0',D}. We characterize the orders leading to each case. We also show that K^D_{min}, K^D_{max} cannot be both much smaller than K^D at any point. These results are proved in a more general setting with two orders on D, one extending the other.<|reference_end|> | arxiv | @article{ferbus-zanda2008kolmogorov,
title={Kolmogorov complexities Kmax, Kmin on computable partially ordered sets},
author={Marie Ferbus-Zanda (LIAFA), Serge Grigorieff (LIAFA)},
journal={Theoretical Computer Science 352 (2006) 159-180},
year={2008},
archivePrefix={arXiv},
eprint={0801.0351},
primaryClass={math.LO cs.LO}
} | ferbus-zanda2008kolmogorov |
arxiv-2263 | 0801.0352 | The price of certainty: "waterslide curves" and the gap to capacity | <|reference_start|>The price of certainty: "waterslide curves" and the gap to capacity: The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. Traditional information-theoretic analysis uses `waterfall' curves to convey the revolutionary idea that unboundedly low probabilities of bit-error are attainable using only finite transmit power. However, practitioners have long observed that the decoder complexity, and hence the total power consumption, goes up when attempting to use sophisticated codes that operate close to the waterfall curve. This paper gives an explicit model for power consumption at an idealized decoder that allows for extreme parallelism in implementation. The decoder architecture is in the spirit of message passing and iterative decoding for sparse-graph codes. Generalized sphere-packing arguments are used to derive lower bounds on the decoding power needed for any possible code given only the gap from the Shannon limit and the desired probability of error. As the gap goes to zero, the energy per bit spent in decoding is shown to go to infinity. This suggests that to optimize total power, the transmitter should operate at a power that is strictly above the minimum demanded by the Shannon capacity. The lower bound is plotted to show an unavoidable tradeoff between the average bit-error probability and the total power used in transmission and decoding. In the spirit of conventional waterfall curves, we call these `waterslide' curves.<|reference_end|> | arxiv | @article{sahai2008the,
title={The price of certainty: "waterslide curves" and the gap to capacity},
author={Anant Sahai and Pulkit Grover},
journal={arXiv preprint arXiv:0801.0352},
year={2008},
number={UCB/EECS-2008-1},
archivePrefix={arXiv},
eprint={0801.0352},
primaryClass={cs.IT math.IT}
} | sahai2008the |
arxiv-2264 | 0801.0353 | Set theoretical Representations of Integers, I | <|reference_start|>Set theoretical Representations of Integers, I: We reconsider some classical natural semantics of integers (namely iterators of functions, cardinals of sets, index of equivalence relations), in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple representation of integers that we suitably effectivize in order to develop an associated Kolmogorov theory. Such effectivizations are particular instances of a general notion of "self-enumerated system" that we introduce in this paper. Our main result asserts that, with such effectivizations, Kolmogorov theory allows to quantitatively distinguish the underlying semantics. We characterize the families obtained by such effectivizations and prove that the associated Kolmogorov complexities constitute a hierarchy which coincides with that of Kolmogorov complexities defined via jump oracles and/or infinite computations. This contrasts with the well-known fact that usual Kolmogorov complexity does not depend (up to a constant) on the chosen arithmetic representation of integers, let it be in any base unary, binary et so on. Also, in a conceptual point of view, our result can be seen as a mean to measure the degree of abstraction of these diverse semantics.<|reference_end|> | arxiv | @article{ferbus-zanda2008set,
title={Set theoretical Representations of Integers, I},
author={Marie Ferbus-Zanda (LIAFA), Serge Grigorieff (LIAFA)},
journal={Mathematical Logic Quaterly 52, Number 4 (2006) 375-403},
year={2008},
doi={10.1002/malq.200510040},
archivePrefix={arXiv},
eprint={0801.0353},
primaryClass={math.LO cs.CC}
} | ferbus-zanda2008set |
arxiv-2265 | 0801.0354 | Kolmogorov complexity in perspective | <|reference_start|>Kolmogorov complexity in perspective: We survey the diverse approaches to the notion of information content: from Shannon entropy to Kolmogorov complexity. The main applications of Kolmogorov complexity are presented namely, the mathematical notion of randomness (which goes back to the 60's with the work of Martin-Lof, Schnorr, Chaitin, Levin), and classification, which is a recent idea with provocative implementation by Vitanyi and Cilibrasi.<|reference_end|> | arxiv | @article{ferbus-zanda2008kolmogorov,
title={Kolmogorov complexity in perspective},
author={Marie Ferbus-Zanda (LIAFA), Serge Grigorieff (LIAFA)},
journal={arXiv preprint arXiv:0801.0354},
year={2008},
archivePrefix={arXiv},
eprint={0801.0354},
primaryClass={math.LO cs.CC cs.IT math.IT}
} | ferbus-zanda2008kolmogorov |
arxiv-2266 | 0801.0386 | Spam: It's Not Just for Inboxes and Search Engines! Making Hirsch h-index Robust to Scientospam | <|reference_start|>Spam: It's Not Just for Inboxes and Search Engines! Making Hirsch h-index Robust to Scientospam: What is the 'level of excellence' of a scientist and the real impact of his/her work upon the scientific thinking and practising? How can we design a fair, an unbiased metric -- and most importantly -- a metric robust to manipulation?<|reference_end|> | arxiv | @article{katsaros2008spam:,
title={Spam: It's Not Just for Inboxes and Search Engines! Making Hirsch
h-index Robust to Scientospam},
author={Dimitrios Katsaros, Leonidas Akritidis, Panayiotis Bozanis},
journal={arXiv preprint arXiv:0801.0386},
year={2008},
archivePrefix={arXiv},
eprint={0801.0386},
primaryClass={cs.DL cs.IR}
} | katsaros2008spam: |
arxiv-2267 | 0801.0390 | Staring at Economic Aggregators through Information Lenses | <|reference_start|>Staring at Economic Aggregators through Information Lenses: It is hard to exaggerate the role of economic aggregators -- functions that summarize numerous and / or heterogeneous data -- in economic models since the early XX$^{th}$ century. In many cases, as witnessed by the pioneering works of Cobb and Douglas, these functions were information quantities tailored to economic theories, i.e. they were built to fit economic phenomena. In this paper, we look at these functions from the complementary side: information. We use a recent toolbox built on top of a vast class of distortions coined by Bregman, whose application field rivals metrics' in various subfields of mathematics. This toolbox makes it possible to find the quality of an aggregator (for consumptions, prices, labor, capital, wages, etc.), from the standpoint of the information it carries. We prove a rather striking result. From the informational standpoint, well-known economic aggregators do belong to the \textit{optimal} set. As common economic assumptions enter the analysis, this large set shrinks, and it essentially ends up \textit{exactly fitting} either CES, or Cobb-Douglas, or both. To summarize, in the relevant economic contexts, one could not have crafted better some aggregator from the information standpoint. We also discuss global economic behaviors of optimal information aggregators in general, and present a brief panorama of the links between economic and information aggregators. Keywords: Economic Aggregators, CES, Cobb-Douglas, Bregman divergences<|reference_end|> | arxiv | @article{nock2008staring,
title={Staring at Economic Aggregators through Information Lenses},
author={Richard Nock, Nicolas Sanz, Fred Celimene, Frank Nielsen},
journal={arXiv preprint arXiv:0801.0390},
year={2008},
archivePrefix={arXiv},
eprint={0801.0390},
primaryClass={cs.IT cs.LG math.IT math.OC}
} | nock2008staring |
arxiv-2268 | 0801.0398 | On the graph isomorphism problem | <|reference_start|>On the graph isomorphism problem: We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.<|reference_end|> | arxiv | @article{friedland2008on,
title={On the graph isomorphism problem},
author={Shmuel Friedland},
journal={arXiv preprint arXiv:0801.0398},
year={2008},
archivePrefix={arXiv},
eprint={0801.0398},
primaryClass={cs.CC cs.DM}
} | friedland2008on |
arxiv-2269 | 0801.0426 | On the Relationship between Transmission Power and Capacity of an Underwater Acoustic Communication Channel | <|reference_start|>On the Relationship between Transmission Power and Capacity of an Underwater Acoustic Communication Channel: The underwater acoustic channel is characterized by a path loss that depends not only on the transmission distance, but also on the signal frequency. As a consequence, transmission bandwidth depends on the transmission distance, a feature that distinguishes an underwater acoustic system from a terrestrial radio system. The exact relationship between power, transmission band, distance and capacity for the Gaussian noise scenario is a complicated one. This work provides a closed-form approximate model for 1) power consumption, 2) band-edge frequency and 3) bandwidth as functions of distance and capacity required for a data link. This approximate model is obtained by numerical evaluation of analytical results which takes into account physical models of acoustic propagation loss and ambient noise. The closed-form approximations may become useful tools in the design and analysis of underwater acoustic networks.<|reference_end|> | arxiv | @article{lucani2008on,
title={On the Relationship between Transmission Power and Capacity of an
Underwater Acoustic Communication Channel},
author={Daniel E. Lucani, Milica Stojanovic, Muriel M'edard},
journal={arXiv preprint arXiv:0801.0426},
year={2008},
doi={10.1109/OCEANSKOBE.2008.4531073},
archivePrefix={arXiv},
eprint={0801.0426},
primaryClass={cs.IT math.IT}
} | lucani2008on |
arxiv-2270 | 0801.0452 | Sum Capacity of the Gaussian Interference Channel in the Low Interference Regime | <|reference_start|>Sum Capacity of the Gaussian Interference Channel in the Low Interference Regime: New upper bounds on the sum capacity of the two-user Gaussian interference channel are derived. Using these bounds, it is shown that treating interference as noise achieves the sum capacity if the interference levels are below certain thresholds.<|reference_end|> | arxiv | @article{annapureddy2008sum,
title={Sum Capacity of the Gaussian Interference Channel in the Low
Interference Regime},
author={V. Sreekanth Annapureddy and Venugopal V. Veeravalli},
journal={arXiv preprint arXiv:0801.0452},
year={2008},
archivePrefix={arXiv},
eprint={0801.0452},
primaryClass={cs.IT math.IT}
} | annapureddy2008sum |
arxiv-2271 | 0801.0455 | A System Theoretic Approach to Bandwidth Estimation | <|reference_start|>A System Theoretic Approach to Bandwidth Estimation: It is shown that bandwidth estimation in packet networks can be viewed in terms of min-plus linear system theory. The available bandwidth of a link or complete path is expressed in terms of a {\em service curve}, which is a function that appears in the network calculus to express the service available to a traffic flow. The service curve is estimated based on measurements of a sequence of probing packets or passive measurements of a sample path of arrivals. It is shown that existing bandwidth estimation methods can be derived in the min-plus algebra of the network calculus, thus providing further mathematical justification for these methods. Principal difficulties of estimating available bandwidth from measurement of network probes are related to potential non-linearities of the underlying network. When networks are viewed as systems that operate either in a linear or in a non-linear regime, it is argued that probing schemes extract the most information at a point when the network crosses from a linear to a non-linear regime. Experiments on the Emulab testbed at the University of Utah evaluate the robustness of the system theoretic interpretation of networks in practice. Multi-node experiments evaluate how well the convolution operation of the min-plus algebra provides estimates for the available bandwidth of a path from estimates of individual links.<|reference_end|> | arxiv | @article{liebeherr2008a,
title={A System Theoretic Approach to Bandwidth Estimation},
author={Jorg Liebeherr, Markus Fidler, Shahrokh Valaee},
journal={arXiv preprint arXiv:0801.0455},
year={2008},
archivePrefix={arXiv},
eprint={0801.0455},
primaryClass={cs.NI cs.PF}
} | liebeherr2008a |
arxiv-2272 | 0801.0474 | Analysis and Counterexamples Regarding Yatsenko's Polynomial-Time Algorithm for Solving the Traveling Salesman Problem | <|reference_start|>Analysis and Counterexamples Regarding Yatsenko's Polynomial-Time Algorithm for Solving the Traveling Salesman Problem: Yatsenko gives a polynomial-time algorithm for solving the traveling salesman problem. We examine the correctness of the algorithm and its construction. We also comment on Yatsenko's evaluation of the algorithm.<|reference_end|> | arxiv | @article{clingerman2008analysis,
title={Analysis and Counterexamples Regarding Yatsenko's Polynomial-Time
Algorithm for Solving the Traveling Salesman Problem},
author={Christopher Clingerman, Jeremiah Hemphill, Corey Proscia},
journal={arXiv preprint arXiv:0801.0474},
year={2008},
archivePrefix={arXiv},
eprint={0801.0474},
primaryClass={cs.CC}
} | clingerman2008analysis |
arxiv-2273 | 0801.0514 | New results on Noncommutative and Commutative Polynomial Identity Testing | <|reference_start|>New results on Noncommutative and Commutative Polynomial Identity Testing: Using ideas from automata theory we design a new efficient (deterministic) identity test for the \emph{noncommutative} polynomial identity testing problem (first introduced and studied in \cite{RS05,BW05}). We also apply this idea to the reconstruction of black-box noncommuting algebraic branching programs. Assuming the black-box model allows us to query the ABP for the output at any given gate, we can reconstruct an (equivalent) ABP in deterministic polynomial time. Finally, we explore commutative identity testing when the coefficients of the input polynomial come from an arbitrary finite commutative ring with unity.<|reference_end|> | arxiv | @article{arvind2008new,
title={New results on Noncommutative and Commutative Polynomial Identity
Testing},
author={V. Arvind, Partha Mukhopadhyay, and Srikanth Srinivasan},
journal={arXiv preprint arXiv:0801.0514},
year={2008},
archivePrefix={arXiv},
eprint={0801.0514},
primaryClass={cs.CC}
} | arvind2008new |
arxiv-2274 | 0801.0523 | Certifying floating-point implementations using Gappa | <|reference_start|>Certifying floating-point implementations using Gappa: High confidence in floating-point programs requires proving numerical properties of final and intermediate values. One may need to guarantee that a value stays within some range, or that the error relative to some ideal value is well bounded. Such work may require several lines of proof for each line of code, and will usually be broken by the smallest change to the code (e.g. for maintenance or optimization purpose). Certifying these programs by hand is therefore very tedious and error-prone. This article discusses the use of the Gappa proof assistant in this context. Gappa has two main advantages over previous approaches: Its input format is very close to the actual C code to validate, and it automates error evaluation and propagation using interval arithmetic. Besides, it can be used to incrementally prove complex mathematical properties pertaining to the C code. Yet it does not require any specific knowledge about automatic theorem proving, and thus is accessible to a wide community. Moreover, Gappa may generate a formal proof of the results that can be checked independently by a lower-level proof assistant like Coq, hence providing an even higher confidence in the certification of the numerical code. The article demonstrates the use of this tool on a real-size example, an elementary function with correctly rounded output.<|reference_end|> | arxiv | @article{de dinechin2008certifying,
title={Certifying floating-point implementations using Gappa},
author={Florent De Dinechin (LIP), Christoph Quirin Lauter (LIP), Guillaume
Melquiond (LIP)},
journal={arXiv preprint arXiv:0801.0523},
year={2008},
archivePrefix={arXiv},
eprint={0801.0523},
primaryClass={cs.NA cs.MS}
} | de dinechin2008certifying |
arxiv-2275 | 0801.0533 | Topology and Ambiguity in Omega Context Free Languages | <|reference_start|>Topology and Ambiguity in Omega Context Free Languages: We study the links between the topological complexity of an omega context free language and its degree of ambiguity. In particular, using known facts from classical descriptive set theory, we prove that non Borel omega context free languages which are recognized by B\"uchi pushdown automata have a maximum degree of ambiguity. This result implies that degrees of ambiguity are really not preserved by the operation of taking the omega power of a finitary context free language. We prove also that taking the adherence or the delta-limit of a finitary language preserves neither unambiguity nor inherent ambiguity. On the other side we show that methods used in the study of omega context free languages can also be applied to study the notion of ambiguity in infinitary rational relations accepted by B\"uchi 2-tape automata and we get first results in that direction.<|reference_end|> | arxiv | @article{finkel2008topology,
title={Topology and Ambiguity in Omega Context Free Languages},
author={Olivier Finkel (ELM), Pierre Simonnet (SPE)},
journal={Bulletin of the Belgian Mathematical Society 10 (5) (2003) 707-722},
year={2008},
archivePrefix={arXiv},
eprint={0801.0533},
primaryClass={cs.LO math.LO}
} | finkel2008topology |
arxiv-2276 | 0801.0534 | On the Length of the Wadge Hierarchy of Omega Context Free Languages | <|reference_start|>On the Length of the Wadge Hierarchy of Omega Context Free Languages: We prove in this paper that the length of the Wadge hierarchy of omega context free languages is greater than the Cantor ordinal epsilon_omega, which is the omega-th fixed point of the ordinal exponentiation of base omega. The same result holds for the conciliating Wadge hierarchy, defined by J. Duparc, of infinitary context free languages, studied by D. Beauquier. We show also that there exist some omega context free languages which are Sigma^0_omega-complete Borel sets, improving previous results on omega context free languages and the Borel hierarchy.<|reference_end|> | arxiv | @article{finkel2008on,
title={On the Length of the Wadge Hierarchy of Omega Context Free Languages},
author={Olivier Finkel (ELM)},
journal={Journal of Automata, Languages and Combinatorics 10 (4) (2005)
439-464},
year={2008},
archivePrefix={arXiv},
eprint={0801.0534},
primaryClass={cs.LO cs.CC cs.GT math.LO}
} | finkel2008on |
arxiv-2277 | 0801.0535 | An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank | <|reference_start|>An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank: Omega-powers of finitary languages are omega languages in the form V^omega, where V is a finitary language over a finite alphabet X. Since the set of infinite words over X can be equipped with the usual Cantor topology, the question of the topological complexity of omega-powers naturally arises and has been raised by Niwinski, by Simonnet, and by Staiger. It has been recently proved that for each integer n > 0, there exist some omega-powers of context free languages which are Pi^0_n-complete Borel sets, and that there exists a context free language L such that L^omega is analytic but not Borel. But the question was still open whether there exists a finitary language V such that V^omega is a Borel set of infinite rank. We answer this question in this paper, giving an example of a finitary language whose omega-power is Borel of infinite rank.<|reference_end|> | arxiv | @article{finkel2008an,
title={An omega-Power of a Finitary Language Which is a Borel Set of Infinite
Rank},
author={Olivier Finkel (ELM)},
journal={Fundamenta Informaticae 62 (3-4) (2004) 333-342},
year={2008},
archivePrefix={arXiv},
eprint={0801.0535},
primaryClass={cs.LO math.LO}
} | finkel2008an |
arxiv-2278 | 0801.0537 | On Infinite Real Trace Rational Languages of Maximum Topological Complexity | <|reference_start|>On Infinite Real Trace Rational Languages of Maximum Topological Complexity: We consider the set of infinite real traces, over a dependence alphabet (Gamma, D) with no isolated letter, equipped with the topology induced by the prefix metric. We then prove that all rational languages of infinite real traces are analytic sets and that there exist some rational languages of infinite real traces which are analytic but non Borel sets, and even Sigma^1_1-complete, hence of maximum possible topological complexity.<|reference_end|> | arxiv | @article{finkel2008on,
title={On Infinite Real Trace Rational Languages of Maximum Topological
Complexity},
author={Olivier Finkel (ELM), Jean-Pierre Ressayre (ELM), Pierre Simonnet
(SPE)},
journal={Zapiski Nauchnyh Seminarov POMI 316 (2004) 205-223},
year={2008},
archivePrefix={arXiv},
eprint={0801.0537},
primaryClass={cs.LO math.LO}
} | finkel2008on |
arxiv-2279 | 0801.0540 | Blind decoding of Linear Gaussian channels with ISI, capacity, error exponent, universality | <|reference_start|>Blind decoding of Linear Gaussian channels with ISI, capacity, error exponent, universality: A new straightforward universal blind detection algorithm for linear Gaussian channel with ISI is given. A new error exponent is derived, which is better than Gallager's random coding error exponent.<|reference_end|> | arxiv | @article{farkas2008blind,
title={Blind decoding of Linear Gaussian channels with ISI, capacity, error
exponent, universality},
author={L'or'ant Farkas},
journal={arXiv preprint arXiv:0801.0540},
year={2008},
archivePrefix={arXiv},
eprint={0801.0540},
primaryClass={cs.IT math.IT}
} | farkas2008blind |
arxiv-2280 | 0801.0558 | Words and morphisms with Sturmian erasures | <|reference_start|>Words and morphisms with Sturmian erasures: We say $x \in \{0,1,2 \}^{\NN}$ is a word with Sturmian erasures if for any $a\in \{0,1,2 \}$ the word obtained erasing all $a$ in $x$ is a Sturmian word. A large family of such words is given coding trajectories of balls in the game of billiards in the cube. We prove that the monoid of morphisms mapping all words with Sturmian erasures to words with Sturmian erasures is not finitely generated.<|reference_end|> | arxiv | @article{durand2008words,
title={Words and morphisms with Sturmian erasures},
author={Fabien Durand (LAMFA), Adel Guerziz (LAMFA), Michel Koskas (LAMFA)},
journal={Bulletin of the Belgian Mathematical Society 11, 4 (2004) 575-588},
year={2008},
archivePrefix={arXiv},
eprint={0801.0558},
primaryClass={math.CO cs.DM}
} | durand2008words |
arxiv-2281 | 0801.0575 | A Flexible and Secure Remote Systems Authentication Scheme Using Smart Cards | <|reference_start|>A Flexible and Secure Remote Systems Authentication Scheme Using Smart Cards: The paper presents an authentication scheme for remote systems using smart card. The scheme prevents the scenario of many logged in users with the same login identity, and does not require password/verifier table to validate the users' login request. The scheme provides a user-friendly password change option, and withstands the replay, impersonation, stolen-verifier, guessing, and denial-of-service attacks.<|reference_end|> | arxiv | @article{das2008a,
title={A Flexible and Secure Remote Systems Authentication Scheme Using Smart
Cards},
author={Manik Lal Das},
journal={Published in the Transactions on Electronics, Computer and
Communication, 1(2):78-82, 2006},
year={2008},
archivePrefix={arXiv},
eprint={0801.0575},
primaryClass={cs.CR}
} | das2008a |
arxiv-2282 | 0801.0581 | Capacity of The Discrete-Time Non-Coherent Memoryless Rayleigh Fading Channels at Low SNR | <|reference_start|>Capacity of The Discrete-Time Non-Coherent Memoryless Rayleigh Fading Channels at Low SNR: The capacity of a discrete-time memoryless channel, in which successive symbols fade independently, and where the channel state information (CSI) is neither available at the transmitter nor at the receiver, is considered at low SNR. We derive a closed form expression of the optimal capacity-achieving input distribution at low signal-to-noise ratio (SNR) and give the exact capacity of a non-coherent channel at low SNR. The derived relations allow to better understanding the capacity of non-coherent channels at low SNR and bring an analytical answer to the peculiar behavior of the optimal input distribution observed in a previous work by Abou Faycal, Trott and Shamai. Then, we compute the non-coherence penalty and give a more precise characterization of the sub-linear term in SNR. Finally, in order to better understand how the optimal input varies with SNR, upper and lower bounds on the capacity-achieving input are given.<|reference_end|> | arxiv | @article{rezki2008capacity,
title={Capacity of The Discrete-Time Non-Coherent Memoryless Rayleigh Fading
Channels at Low SNR},
author={Z. Rezki, David Haccoun and Franc{c}ois Gagnon},
journal={arXiv preprint arXiv:0801.0581},
year={2008},
archivePrefix={arXiv},
eprint={0801.0581},
primaryClass={cs.IT math.IT}
} | rezki2008capacity |
arxiv-2283 | 0801.0586 | On sign conditions over real multivariate polynomials | <|reference_start|>On sign conditions over real multivariate polynomials: We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a family of real polynomials defining regular hypersurfaces that intersect transversally. This enables us to show a probabilistic procedure to list all feasible sign conditions over the polynomials. In addition, we extend these results to the case of closed sign conditions over an arbitrary family of real multivariate polynomials. The complexity bounds for these procedures improve the known ones.<|reference_end|> | arxiv | @article{jeronimo2008on,
title={On sign conditions over real multivariate polynomials},
author={Gabriela Jeronimo, Daniel Perrucci, Juan Sabia},
journal={arXiv preprint arXiv:0801.0586},
year={2008},
archivePrefix={arXiv},
eprint={0801.0586},
primaryClass={math.AG cs.CG cs.SC}
} | jeronimo2008on |
arxiv-2284 | 0801.0590 | An algorithm for finding the Independence Number of a graph | <|reference_start|>An algorithm for finding the Independence Number of a graph: In this paper, we prove that for every connected graph G, there exists a split graph H with the same independence number and the same order. Then we propose a first algorithm for finding this graph, given the degree sequence of the input graph G. Further, we propose a second algorithm for finding the independence number of G, given the adjacency matrix of G.<|reference_end|> | arxiv | @article{kettani2008an,
title={An algorithm for finding the Independence Number of a graph},
author={Omar Kettani},
journal={arXiv preprint arXiv:0801.0590},
year={2008},
archivePrefix={arXiv},
eprint={0801.0590},
primaryClass={cs.DM cs.DS}
} | kettani2008an |
arxiv-2285 | 0801.0597 | Distributed Power Allocation Strategies for Parallel Relay Networks | <|reference_start|>Distributed Power Allocation Strategies for Parallel Relay Networks: We consider a source-destination pair assisted by parallel regenerative decode-and-forward relays operating in orthogonal channels. We investigate distributed power allocation strategies for this system with limited channel state information at the source and the relay nodes. We first propose a distributed decision mechanism for each relay to individually make its decision on whether to forward the source data. The decision mechanism calls for each relay that is able to decode the information from the source to compare its relay-to-destination channel gain with a given threshold. We identify the optimum distributed power allocation strategy that minimizes the total transmit power while providing a target signal-to-noise ratio at the destination with a target outage probability. The strategy dictates the optimum choices for the source power as well as the threshold value at the relays. Next, we consider two simpler distributed power allocation strategies, namely the passive source model where the source power and the relay threshold are fixed, and the single relay model where only one relay is allowed to forward the source data. These models are motivated by limitations on the available channel state information as well as ease of implementation as compared to the optimum distributed strategy. Simulation results are presented to demonstrate the performance of the proposed distributed power allocation schemes. Specifically, we observe significant power savings with proposed methods as compared to random relay selection.<|reference_end|> | arxiv | @article{chen2008distributed,
title={Distributed Power Allocation Strategies for Parallel Relay Networks},
author={Min Chen, Semih Serbetli and Aylin Yener},
journal={arXiv preprint arXiv:0801.0597},
year={2008},
archivePrefix={arXiv},
eprint={0801.0597},
primaryClass={cs.IT math.IT}
} | chen2008distributed |
arxiv-2286 | 0801.0609 | Applying the CobiT Control Framework to Spreadsheet Developments | <|reference_start|>Applying the CobiT Control Framework to Spreadsheet Developments: One of the problems reported by researchers and auditors in the field of spreadsheet risks is that of getting and keeping managements attention to the problem. Since 1996, the Information Systems Audit & Control Foundation and the IT Governance Institute have published CobiT which brings mainstream IT control issues into the corporate governance arena. This paper illustrates how spreadsheet risk and control issues can be mapped onto the CobiT framework and thus brought to managers attention in a familiar format.<|reference_end|> | arxiv | @article{butler2008applying,
title={Applying the CobiT Control Framework to Spreadsheet Developments},
author={Raymond J. Butler},
journal={Proc. European Spreadsheet Risks Int. Grp. 2001 7-13 ISBN:1 86166
179 7},
year={2008},
archivePrefix={arXiv},
eprint={0801.0609},
primaryClass={cs.SE cs.CY}
} | butler2008applying |
arxiv-2287 | 0801.0625 | On the Robustness of the Delay-Based Fingerprint Embedding Scheme | <|reference_start|>On the Robustness of the Delay-Based Fingerprint Embedding Scheme: The delay-based fingerprint embedding was recently proposed to support more users in secure media distribution scenario. In this embedding scheme, some users are assigned the same fingerprint code with only different embedding delay. The algorithm's robustness against collusion attacks is investigated. However, its robustness against common desynchronization attacks, e.g., cropping and time shifting, is not considered. In this paper, desynchronization attacks are used to break the delay-based fingerprint embedding algorithm. To improve the robustness, two means are proposed to keep the embedded fingerprint codes synchronized, i.e., adding a synchronization fingerprint and adopting the relative delay to detect users. Analyses and experiments are given to show the improvements.<|reference_end|> | arxiv | @article{lian2008on,
title={On the Robustness of the Delay-Based Fingerprint Embedding Scheme},
author={Shiguo Lian},
journal={arXiv preprint arXiv:0801.0625},
year={2008},
archivePrefix={arXiv},
eprint={0801.0625},
primaryClass={cs.MM cs.SD}
} | lian2008on |
arxiv-2288 | 0801.0649 | A logical analysis of entanglement and separability in quantum higher-order functions | <|reference_start|>A logical analysis of entanglement and separability in quantum higher-order functions: We present a logical separability analysis for a functional quantum computation language. This logic is inspired by previous works on logical analysis of aliasing for imperative functional programs. Both analyses share similarities notably because they are highly non-compositional. Quantum setting is harder to deal with since it introduces non determinism and thus considerably modifies semantics and validity of logical assertions. This logic is the first proposal of entanglement/separability analysis dealing with a functional quantum programming language with higher-order functions.<|reference_end|> | arxiv | @article{prost2008a,
title={A logical analysis of entanglement and separability in quantum
higher-order functions},
author={F. Prost and C. Zerrari},
journal={arXiv preprint arXiv:0801.0649},
year={2008},
doi={10.1007/978-3-642-03745-0_25},
archivePrefix={arXiv},
eprint={0801.0649},
primaryClass={cs.LO}
} | prost2008a |
arxiv-2289 | 0801.0665 | A theorem of Cobham for non-primitive substitutions | <|reference_start|>A theorem of Cobham for non-primitive substitutions: In this article we generalize Cobham theorem to a large class of substitutions including non primitive and non constant length substitutions.<|reference_end|> | arxiv | @article{durand2008a,
title={A theorem of Cobham for non-primitive substitutions},
author={Fabien Durand (LAMFA)},
journal={Acta Arithmetica 104, 3 (2002) 225-241},
year={2008},
archivePrefix={arXiv},
eprint={0801.0665},
primaryClass={math.CO cs.DM}
} | durand2008a |
arxiv-2290 | 0801.0672 | On Multipath Fading Channels at High SNR | <|reference_start|>On Multipath Fading Channels at High SNR: This paper studies the capacity of discrete-time multipath fading channels. It is assumed that the number of paths is finite, i.e., that the channel output is influenced by the present and by the L previous channel inputs. A noncoherent channel model is considered where neither transmitter nor receiver are cognizant of the fading's realization, but both are aware of its statistic. The focus is on capacity at high signal-to-noise ratios (SNR). In particular, the capacity pre-loglog - defined as the limiting ratio of the capacity to loglog SNR as SNR tends to infinity - is studied. It is shown that, irrespective of the number paths L, the capacity pre-loglog is 1.<|reference_end|> | arxiv | @article{koch2008on,
title={On Multipath Fading Channels at High SNR},
author={Tobias Koch and Amos Lapidoth},
journal={arXiv preprint arXiv:0801.0672},
year={2008},
archivePrefix={arXiv},
eprint={0801.0672},
primaryClass={cs.IT math.IT}
} | koch2008on |
arxiv-2291 | 0801.0677 | Finite-state concurrent programs can be expressed pairwise | <|reference_start|>Finite-state concurrent programs can be expressed pairwise: We present a \emph{pairwise normal form} for finite-state shared memory concurrent programs: all variables are shared between exactly two processes, and the guards on transitions are conjunctions of conditions over this pairwise shared state. This representation has been used to efficiently (in polynomial time) synthesize and model-check correctness properties of concurrent programs. Our main result is that any finite state concurrent program can be transformed into pairwise normal form. Specifically, if $Q$ is an arbitrary finite-state shared memory concurrent program, then there exists a finite-state shared memory concurrent program $P$ expressed in pairwise normal form such that $P$ is strongly bisimilar to $Q$. Our result is constructive: we give an algorithm for producing $P$, given $Q$.<|reference_end|> | arxiv | @article{attie2008finite-state,
title={Finite-state concurrent programs can be expressed pairwise},
author={Paul C. Attie},
journal={arXiv preprint arXiv:0801.0677},
year={2008},
archivePrefix={arXiv},
eprint={0801.0677},
primaryClass={cs.LO}
} | attie2008finite-state |
arxiv-2292 | 0801.0678 | Implementation of perception and action at nanoscale | <|reference_start|>Implementation of perception and action at nanoscale: Real time combination of nanosensors and nanoactuators with virtual reality environment and multisensorial interfaces enable us to efficiently act and perceive at nanoscale. Advanced manipulation of nanoobjects and new strategies for scientific education are the key motivations. We have no existing intuitive representation of the nanoworld ruled by laws foreign to our experience. A central challenge is then the construction of nanoworld simulacrum that we can start to visit and to explore. In this nanoworld simulacrum, object identifications will be based on probed entity physical and chemical intrinsic properties, on their interactions with sensors and on the final choices made in building a multisensorial interface so that these objects become coherent elements of the human sphere of action and perception. Here we describe a 1D virtual nanomanipulator, part of the Cit\'e des Sciences EXPO NANO in Paris, that is the first realization based on this program.<|reference_end|> | arxiv | @article{marlière2008implementation,
title={Implementation of perception and action at nanoscale},
author={Sylvain Marli`ere (ICA), Jean Loup Florens (ICA), Florence Marchi
(ESRF, NEEL), Annie Luciani (ICA), Joel Chevrier (ESRF, NEEL)},
journal={arXiv preprint arXiv:0801.0678},
year={2008},
archivePrefix={arXiv},
eprint={0801.0678},
primaryClass={cs.RO cs.HC}
} | marlière2008implementation |
arxiv-2293 | 0801.0701 | Adversarial Models and Resilient Schemes for Network Coding | <|reference_start|>Adversarial Models and Resilient Schemes for Network Coding: In a recent paper, Jaggi et al. (INFOCOM 2007), presented a distributed polynomial-time rate-optimal network-coding scheme that works in the presence of Byzantine faults. We revisit their adversarial models and augment them with three, arguably realistic, models. In each of the models, we present a distributed scheme that demonstrates the usefulness of the model. In particular, all of the schemes obtain optimal rate $C-z$, where $C$ is the network capacity and $z$ is a bound on the number of links controlled by the adversary.<|reference_end|> | arxiv | @article{nutman2008adversarial,
title={Adversarial Models and Resilient Schemes for Network Coding},
author={Leah Nutman and Michael Langberg},
journal={arXiv preprint arXiv:0801.0701},
year={2008},
archivePrefix={arXiv},
eprint={0801.0701},
primaryClass={cs.IT cs.DC cs.NI math.IT}
} | nutman2008adversarial |
arxiv-2294 | 0801.0714 | Regular Expression Subtyping for XML Query and Update Languages | <|reference_start|>Regular Expression Subtyping for XML Query and Update Languages: XML database query languages such as XQuery employ regular expression types with structural subtyping. Subtyping systems typically have two presentations, which should be equivalent: a declarative version in which the subsumption rule may be used anywhere, and an algorithmic version in which the use of subsumption is limited in order to make typechecking syntax-directed and decidable. However, the XQuery standard type system circumvents this issue by using imprecise typing rules for iteration constructs and defining only algorithmic typechecking, and another extant proposal provides more precise types for iteration constructs but ignores subtyping. In this paper, we consider a core XQuery-like language with a subsumption rule and prove the completeness of algorithmic typechecking; this is straightforward for XQuery proper but requires some care in the presence of more precise iteration typing disciplines. We extend this result to an XML update language we have introduced in earlier work.<|reference_end|> | arxiv | @article{cheney2008regular,
title={Regular Expression Subtyping for XML Query and Update Languages},
author={James Cheney},
journal={arXiv preprint arXiv:0801.0714},
year={2008},
archivePrefix={arXiv},
eprint={0801.0714},
primaryClass={cs.PL cs.DB}
} | cheney2008regular |
arxiv-2295 | 0801.0715 | Impact of Errors in Operational Spreadsheets | <|reference_start|>Impact of Errors in Operational Spreadsheets: All users of spreadsheets struggle with the problem of errors. Errors are thought to be prevalent in spreadsheets, and in some instances they have cost organizations millions of dollars. In a previous study of 50 operational spreadsheets we found errors in 0.8% to 1.8% of all formula cells, depending on how errors are defined. In the current study we estimate the quantitative impacts of errors in 25 operational spreadsheets from five different organizations. We find that many errors have no quantitative impact on the spreadsheet. Those that have an impact often affect unimportant portions of the spreadsheet. The remaining errors do sometimes have substantial impacts on key aspects of the spreadsheet. This paper provides the first fully-documented evidence on the quantitative impact of errors in operational spreadsheets.<|reference_end|> | arxiv | @article{powell2008impact,
title={Impact of Errors in Operational Spreadsheets},
author={Stephen G. Powell, Barry Lawson, and Kenneth R. Baker},
journal={Proc. European Spreadsheet Risks Int. Grp. 2007 57-68 ISBN
978-905617-58-6},
year={2008},
archivePrefix={arXiv},
eprint={0801.0715},
primaryClass={cs.CY}
} | powell2008impact |
arxiv-2296 | 0801.0756 | Distributed Source Coding for Interactive Function Computation | <|reference_start|>Distributed Source Coding for Interactive Function Computation: A two-terminal interactive distributed source coding problem with alternating messages for function computation at both locations is studied. For any number of messages, a computable characterization of the rate region is provided in terms of single-letter information measures. While interaction is useless in terms of the minimum sum-rate for lossless source reproduction at one or both locations, the gains can be arbitrarily large for function computation even when the sources are independent. For a class of sources and functions, interaction is shown to be useless, even with infinite messages, when a function has to be computed at only one location, but is shown to be useful, if functions have to be computed at both locations. For computing the Boolean AND function of two independent Bernoulli sources at both locations, an achievable infinite-message sum-rate with infinitesimal-rate messages is derived in terms of a two-dimensional definite integral and a rate-allocation curve. A general framework for multiterminal interactive function computation based on an information exchange protocol which successively switches among different distributed source coding configurations is developed. For networks with a star topology, multiple rounds of interactive coding is shown to decrease the scaling law of the total network rate by an order of magnitude as the network grows.<|reference_end|> | arxiv | @article{ma2008distributed,
title={Distributed Source Coding for Interactive Function Computation},
author={Nan Ma, Prakash Ishwar},
journal={arXiv preprint arXiv:0801.0756},
year={2008},
archivePrefix={arXiv},
eprint={0801.0756},
primaryClass={cs.IT math.IT}
} | ma2008distributed |
arxiv-2297 | 0801.0813 | A linear-non-linear model for a computational call-by-value lambda calculus (extended abstract) | <|reference_start|>A linear-non-linear model for a computational call-by-value lambda calculus (extended abstract): We give a categorical semantics for a call-by-value linear lambda calculus. Such a lambda calculus was used by Selinger and Valiron as the backbone of a functional programming language for quantum computation. One feature of this lambda calculus is its linear type system, which includes a duplicability operator "!" as in linear logic. Another main feature is its call-by-value reduction strategy, together with a side-effect to model probabilistic measurements. The "!" operator gives rise to a comonad, as in the linear logic models of Seely, Bierman, and Benton. The side-effects give rise to a monad, as in Moggi's computational lambda calculus. It is this combination of a monad and a comonad that makes the present paper interesting. We show that our categorical semantics is sound and complete.<|reference_end|> | arxiv | @article{selinger2008a,
title={A linear-non-linear model for a computational call-by-value lambda
calculus (extended abstract)},
author={Peter Selinger (1), Beno^it Valiron (2) ((1) Dalhousie University,
(2) University of Ottawa)},
journal={arXiv preprint arXiv:0801.0813},
year={2008},
archivePrefix={arXiv},
eprint={0801.0813},
primaryClass={cs.LO}
} | selinger2008a |
arxiv-2298 | 0801.0815 | Joint Wyner-Ziv/Dirty Paper coding by modulo-lattice modulation | <|reference_start|>Joint Wyner-Ziv/Dirty Paper coding by modulo-lattice modulation: The combination of source coding with decoder side-information (Wyner-Ziv problem) and channel coding with encoder side-information (Gel'fand-Pinsker problem) can be optimally solved using the separation principle. In this work we show an alternative scheme for the quadratic-Gaussian case, which merges source and channel coding. This scheme achieves the optimal performance by a applying modulo-lattice modulation to the analog source. Thus it saves the complexity of quantization and channel decoding, and remains with the task of "shaping" only. Furthermore, for high signal-to-noise ratio (SNR), the scheme approaches the optimal performance using an SNR-independent encoder, thus it is robust to unknown SNR at the encoder.<|reference_end|> | arxiv | @article{kochman2008joint,
title={Joint Wyner-Ziv/Dirty Paper coding by modulo-lattice modulation},
author={Yuval Kochman and Ram Zamir},
journal={arXiv preprint arXiv:0801.0815},
year={2008},
archivePrefix={arXiv},
eprint={0801.0815},
primaryClass={cs.IT math.IT}
} | kochman2008joint |
arxiv-2299 | 0801.0821 | Unified Quantum Convolutional Coding | <|reference_start|>Unified Quantum Convolutional Coding: We outline a quantum convolutional coding technique for protecting a stream of classical bits and qubits. Our goal is to provide a framework for designing codes that approach the ``grandfather'' capacity of an entanglement-assisted quantum channel for sending classical and quantum information simultaneously. Our method incorporates several resources for quantum redundancy: fresh ancilla qubits, entangled bits, and gauge qubits. The use of these diverse resources gives our technique the benefits of both active and passive quantum error correction. We can encode a classical-quantum bit stream with periodic quantum gates because our codes possess a convolutional structure. We end with an example of a ``grandfather'' quantum convolutional code that protects one qubit and one classical bit per frame by encoding them with one fresh ancilla qubit, one entangled bit, and one gauge qubit per frame. We explicitly provide the encoding and decoding circuits for this example.<|reference_end|> | arxiv | @article{wilde2008unified,
title={Unified Quantum Convolutional Coding},
author={Mark M. Wilde and Todd A. Brun},
journal={Proceedings of the 2008 International Symposium on Information
Theory, pp. 359-363, Toronto, Ontario, Canada, July 2008.},
year={2008},
doi={10.1109/ISIT.2008.4595008},
number={CSI-08-01-01},
archivePrefix={arXiv},
eprint={0801.0821},
primaryClass={quant-ph cs.IT math.IT}
} | wilde2008unified |
arxiv-2300 | 0801.0830 | Evolution of central pattern generators for the control of a five-link bipedal walking mechanism | <|reference_start|>Evolution of central pattern generators for the control of a five-link bipedal walking mechanism: Central pattern generators (CPGs), with a basis is neurophysiological studies, are a type of neural network for the generation of rhythmic motion. While CPGs are being increasingly used in robot control, most applications are hand-tuned for a specific task and it is acknowledged in the field that generic methods and design principles for creating individual networks for a given task are lacking. This study presents an approach where the connectivity and oscillatory parameters of a CPG network are determined by an evolutionary algorithm with fitness evaluations in a realistic simulation with accurate physics. We apply this technique to a five-link planar walking mechanism to demonstrate its feasibility and performance. In addition, to see whether results from simulation can be acceptably transferred to real robot hardware, the best evolved CPG network is also tested on a real mechanism. Our results also confirm that the biologically inspired CPG model is well suited for legged locomotion, since a diverse manifestation of networks have been observed to succeed in fitness simulations during evolution.<|reference_end|> | arxiv | @article{baydin2008evolution,
title={Evolution of central pattern generators for the control of a five-link
bipedal walking mechanism},
author={Atilim Gunes Baydin},
journal={Paladyn. Journal of Behavioral Robotics 3(1), 45-53 (2012)},
year={2008},
doi={10.2478/s13230-012-0019-y},
archivePrefix={arXiv},
eprint={0801.0830},
primaryClass={cs.NE cs.RO}
} | baydin2008evolution |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.