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-2401 | 0801.3046 | A model for reactive porous transport during re-wetting of hardened concrete | <|reference_start|>A model for reactive porous transport during re-wetting of hardened concrete: A mathematical model is developed that captures the transport of liquid water in hardened concrete, as well as the chemical reactions that occur between the imbibed water and the residual calcium silicate compounds residing... | arxiv | @article{chapwanya2008a,
title={A model for reactive porous transport during re-wetting of hardened
concrete},
author={Michael Chapwanya, Wentao Liu and John M. Stockie},
journal={Journal of Engineering Mathematics, 65(1):53-73, 2009},
year={2008},
doi={10.1007/s10665-009-9268-0},
archivePrefi... | chapwanya2008a |
arxiv-2402 | 0801.3048 | Human Heuristics for Autonomous Agents | <|reference_start|>Human Heuristics for Autonomous Agents: We investigate the problem of autonomous agents processing pieces of information that may be corrupted (tainted). Agents have the option of contacting a central database for a reliable check of the status of the message, but this procedure is costly and therefo... | arxiv | @article{bagnoli2008human,
title={Human Heuristics for Autonomous Agents},
author={Franco Bagnoli, Andrea Guazzini, Pietro Lio'},
journal={P. Li\'o et al. editors, BIOWIRE 2007, LNCS 5151, pages 340-351,
Springer--Verlag Berlin Heidelberg 2008},
year={2008},
doi={10.1007/978-3-540-92191-2_30},
... | bagnoli2008human |
arxiv-2403 | 0801.3049 | Spatial-Spectral Joint Detection for Wideband Spectrum Sensing in Cognitive Radio Networks | <|reference_start|>Spatial-Spectral Joint Detection for Wideband Spectrum Sensing in Cognitive Radio Networks: Spectrum sensing is an essential functionality that enables cognitive radios to detect spectral holes and opportunistically use under-utilized frequency bands without causing harmful interference to primary ne... | arxiv | @article{quan2008spatial-spectral,
title={Spatial-Spectral Joint Detection for Wideband Spectrum Sensing in
Cognitive Radio Networks},
author={Zhi Quan, Shuguang Cui, Ali. H. Sayed, and H. Vincent Poor},
journal={arXiv preprint arXiv:0801.3049},
year={2008},
doi={10.1109/TSP.2008.2008540},
arc... | quan2008spatial-spectral |
arxiv-2404 | 0801.3065 | Cut Elimination for a Logic with Generic Judgments and Induction | <|reference_start|>Cut Elimination for a Logic with Generic Judgments and Induction: This paper presents a cut-elimination proof for the logic $LG^\omega$, which is an extension of a proof system for encoding generic judgments, the logic $\FOLDNb$ of Miller and Tiu, with an induction principle. The logic $LG^\omega$, j... | arxiv | @article{tiu2008cut,
title={Cut Elimination for a Logic with Generic Judgments and Induction},
author={Alwen Tiu},
journal={arXiv preprint arXiv:0801.3065},
year={2008},
archivePrefix={arXiv},
eprint={0801.3065},
primaryClass={cs.LO}
} | tiu2008cut |
arxiv-2405 | 0801.3073 | Large Deviations Analysis for the Detection of 2D Hidden Gauss-Markov Random Fields Using Sensor Networks | <|reference_start|>Large Deviations Analysis for the Detection of 2D Hidden Gauss-Markov Random Fields Using Sensor Networks: The detection of hidden two-dimensional Gauss-Markov random fields using sensor networks is considered. Under a conditional autoregressive model, the error exponent for the Neyman-Pearson detect... | arxiv | @article{sung2008large,
title={Large Deviations Analysis for the Detection of 2D Hidden Gauss-Markov
Random Fields Using Sensor Networks},
author={Youngchul Sung, H. Vincent Poor and Heejung Yu},
journal={arXiv preprint arXiv:0801.3073},
year={2008},
doi={10.1109/ICASSP.2008.4518504},
archiveP... | sung2008large |
arxiv-2406 | 0801.3097 | Auction-based Resource Allocation for Multi-relay Asynchronous Cooperative Networks | <|reference_start|>Auction-based Resource Allocation for Multi-relay Asynchronous Cooperative Networks: Resource allocation is considered for cooperative transmissions in multiple-relay wireless networks. Two auction mechanisms, SNR auctions and power auctions, are proposed to distributively coordinate the allocation o... | arxiv | @article{huang2008auction-based,
title={Auction-based Resource Allocation for Multi-relay Asynchronous
Cooperative Networks},
author={Jianwei Huang, Zhu Han, Mung Chiang, H. Vincent Poor},
journal={arXiv preprint arXiv:0801.3097},
year={2008},
doi={10.1109/ICASSP.2008.4518870},
archivePrefix={... | huang2008auction-based |
arxiv-2407 | 0801.3102 | Balancing transparency, efficiency and security in pervasive systems | <|reference_start|>Balancing transparency, efficiency and security in pervasive systems: This chapter will survey pervasive computing with a look at how its constraint for transparency affects issues of resource management and security. The goal of pervasive computing is to render computing transparent, such that compu... | arxiv | @article{wenstrom2008balancing,
title={Balancing transparency, efficiency and security in pervasive systems},
author={Mark Wenstrom, Eloisa Bentivegna and Ali Hurson (Pennsylvania State
University)},
journal={arXiv preprint arXiv:0801.3102},
year={2008},
archivePrefix={arXiv},
eprint={0801.310... | wenstrom2008balancing |
arxiv-2408 | 0801.3111 | Analysis of Estimation of Distribution Algorithms and Genetic Algorithms on NK Landscapes | <|reference_start|>Analysis of Estimation of Distribution Algorithms and Genetic Algorithms on NK Landscapes: This study analyzes performance of several genetic and evolutionary algorithms on randomly generated NK fitness landscapes with various values of n and k. A large number of NK problem instances are first genera... | arxiv | @article{pelikan2008analysis,
title={Analysis of Estimation of Distribution Algorithms and Genetic Algorithms
on NK Landscapes},
author={Martin Pelikan},
journal={Proceedings of the Genetic and Evolutionary Computation Conference
(GECCO-2008), ACM Press, 1033-1040},
year={2008},
number={MEDAL Re... | pelikan2008analysis |
arxiv-2409 | 0801.3112 | The Two User Gaussian Compound Interference Channel | <|reference_start|>The Two User Gaussian Compound Interference Channel: We introduce the two user finite state compound Gaussian interference channel and characterize its capacity region to within one bit. The main contributions involve both novel inner and outer bounds. The inner bound is multilevel superposition codi... | arxiv | @article{raja2008the,
title={The Two User Gaussian Compound Interference Channel},
author={Adnan Raja, Vinod M. Prabhakaran, and Pramod Viswanath},
journal={arXiv preprint arXiv:0801.3112},
year={2008},
archivePrefix={arXiv},
eprint={0801.3112},
primaryClass={cs.IT math.IT}
} | raja2008the |
arxiv-2410 | 0801.3113 | iBOA: The Incremental Bayesian Optimization Algorithm | <|reference_start|>iBOA: The Incremental Bayesian Optimization Algorithm: This paper proposes the incremental Bayesian optimization algorithm (iBOA), which modifies standard BOA by removing the population of solutions and using incremental updates of the Bayesian network. iBOA is shown to be able to learn and exploit u... | arxiv | @article{pelikan2008iboa:,
title={iBOA: The Incremental Bayesian Optimization Algorithm},
author={Martin Pelikan, Kumara Sastry, and David E. Goldberg},
journal={Proceedings of the Genetic and Evolutionary Computation Conference
(GECCO-2008), ACM Press, 455-462},
year={2008},
number={MEDAL Report ... | pelikan2008iboa: |
arxiv-2411 | 0801.3114 | Thinking is Bad: Implications of Human Error Research for Spreadsheet Research and Practice | <|reference_start|>Thinking is Bad: Implications of Human Error Research for Spreadsheet Research and Practice: In the spreadsheet error community, both academics and practitioners generally have ignored the rich findings produced by a century of human error research. These findings can suggest ways to reduce errors; w... | arxiv | @article{panko2008thinking,
title={Thinking is Bad: Implications of Human Error Research for Spreadsheet
Research and Practice},
author={Raymond R. Panko},
journal={Proc. European Spreadsheet Risks Int. Grp. 2007 69-80 ISBN
978-905617-58-6},
year={2008},
archivePrefix={arXiv},
eprint={0801.3... | panko2008thinking |
arxiv-2412 | 0801.3116 | Enterprise Spreadsheet Management: A Necessary Good | <|reference_start|>Enterprise Spreadsheet Management: A Necessary Good: This paper presents the arguments and supporting business metrics for Enterprise Spreadsheet Management to be seen as a necessary good. These arguments are divided into a summary of external business drivers that make it necessary and the good that... | arxiv | @article{baxter2008enterprise,
title={Enterprise Spreadsheet Management: A Necessary Good},
author={Ralph Baxter},
journal={Proc. European Spreadsheet Risks Int. Grp. 2007 7-13 ISBN
978-905617-58-6},
year={2008},
archivePrefix={arXiv},
eprint={0801.3116},
primaryClass={cs.CY}
} | baxter2008enterprise |
arxiv-2413 | 0801.3117 | A hierarchy of behavioral equivalences in the $\pi$-calculus with noisy channels | <|reference_start|>A hierarchy of behavioral equivalences in the $\pi$-calculus with noisy channels: The $\pi$-calculus is a process algebra where agents interact by sending communication links to each other via noiseless communication channels. Taking into account the reality of noisy channels, an extension of the $\p... | arxiv | @article{cao2008a,
title={A hierarchy of behavioral equivalences in the $\pi$-calculus with noisy
channels},
author={Yongzhi Cao},
journal={Comput. J., vol. 53, no. 1, pp. 3-20, 2010},
year={2008},
archivePrefix={arXiv},
eprint={0801.3117},
primaryClass={cs.LO}
} | cao2008a |
arxiv-2414 | 0801.3118 | Spreadsheet Hell | <|reference_start|>Spreadsheet Hell: This management paper looks at the real world issues faced by practitioners managing spreadsheets through the production phase of their life cycle. It draws on the commercial experience of several developers working with large corporations, either as employees or consultants or cont... | arxiv | @article{murphy2008spreadsheet,
title={Spreadsheet Hell},
author={Simon Murphy},
journal={Proc. European Spreadsheet Risks Int. Grp. 2007 15-20 ISBN
978-905617-58-6},
year={2008},
archivePrefix={arXiv},
eprint={0801.3118},
primaryClass={cs.CY}
} | murphy2008spreadsheet |
arxiv-2415 | 0801.3119 | Categorisation of Spreadsheet Use within Organisations, Incorporating Risk: A Progress Report | <|reference_start|>Categorisation of Spreadsheet Use within Organisations, Incorporating Risk: A Progress Report: There has been a significant amount of research into spreadsheets over the last two decades. Errors in spreadsheets are well documented. Once used mainly for simple functions such as logging, tracking and t... | arxiv | @article{madahar2008categorisation,
title={Categorisation of Spreadsheet Use within Organisations, Incorporating
Risk: A Progress Report},
author={Mukul Madahar, Pat Cleary, David Ball},
journal={Proc. European Spreadsheet Risks Int. Grp. 2007 37-45 ISBN
978-905617-58-6},
year={2008},
archivePre... | madahar2008categorisation |
arxiv-2416 | 0801.3147 | From k-SAT to k-CSP: Two Generalized Algorithms | <|reference_start|>From k-SAT to k-CSP: Two Generalized Algorithms: Constraint satisfaction problems (CSPs) models many important intractable NP-hard problems such as propositional satisfiability problem (SAT). Algorithms with non-trivial upper bounds on running time for restricted SAT with bounded clause length k (k-S... | arxiv | @article{li2008from,
title={From k-SAT to k-CSP: Two Generalized Algorithms},
author={Liang Li, Xin Li, Tian Liu, Ke Xu},
journal={arXiv preprint arXiv:0801.3147},
year={2008},
archivePrefix={arXiv},
eprint={0801.3147},
primaryClass={cs.DS cs.AI cs.CC}
} | li2008from |
arxiv-2417 | 0801.3199 | Descent methods for Nonnegative Matrix Factorization | <|reference_start|>Descent methods for Nonnegative Matrix Factorization: In this paper, we present several descent methods that can be applied to nonnegative matrix factorization and we analyze a recently developped fast block coordinate method called Rank-one Residue Iteration (RRI). We also give a comparison of these... | arxiv | @article{ho2008descent,
title={Descent methods for Nonnegative Matrix Factorization},
author={Ngoc-Diep Ho (1), Paul Van Dooren (1) and Vincent D. Blondel (1) ((1)
Universit'e catholique de Louvain, Belgium)},
journal={arXiv preprint arXiv:0801.3199},
year={2008},
number={2007.057},
archivePre... | ho2008descent |
arxiv-2418 | 0801.3209 | A Pyramidal Evolutionary Algorithm with Different Inter-Agent Partnering Strategies for Scheduling Problems | <|reference_start|>A Pyramidal Evolutionary Algorithm with Different Inter-Agent Partnering Strategies for Scheduling Problems: This paper combines the idea of a hierarchical distributed genetic algorithm with different inter-agent partnering strategies. Cascading clusters of sub-populations are built from bottom up, w... | arxiv | @article{aickelin2008a,
title={A Pyramidal Evolutionary Algorithm with Different Inter-Agent Partnering
Strategies for Scheduling Problems},
author={Uwe Aickelin},
journal={Proceedings of the Genetic and Evolutionary Computation Conference
(GECCO 2001), late-breaking papers volume, pp 1-8, San Francisco... | aickelin2008a |
arxiv-2419 | 0801.3239 | Online-concordance "Perekhresni stezhky" ("The Cross-Paths"), a novel by Ivan Franko | <|reference_start|>Online-concordance "Perekhresni stezhky" ("The Cross-Paths"), a novel by Ivan Franko: In the article, theoretical principles and practical realization for the compilation of the concordance to "Perekhresni stezhky" ("The Cross-Paths"), a novel by Ivan Franko, are described. Two forms for the context ... | arxiv | @article{buk2008online-concordance,
title={Online-concordance "Perekhresni stezhky" ("The Cross-Paths"), a novel by
Ivan Franko},
author={Solomiya Buk, Andrij Rovenchak},
journal={Ivan Franko: Spirit, Science, Thought, Will (Proceedings of the
International Scientific Congress dedicated to the 150th ann... | buk2008online-concordance |
arxiv-2420 | 0801.3249 | Complex Eigenvalues for Binary Subdivision Schemes | <|reference_start|>Complex Eigenvalues for Binary Subdivision Schemes: Convergence properties of binary stationary subdivision schemes for curves have been analyzed using the techniques of z-transforms and eigenanalysis. Eigenanalysis provides a way to determine derivative continuity at specific points based on the eig... | arxiv | @article{kuehn2008complex,
title={Complex Eigenvalues for Binary Subdivision Schemes},
author={Christian Kuehn},
journal={arXiv preprint arXiv:0801.3249},
year={2008},
archivePrefix={arXiv},
eprint={0801.3249},
primaryClass={cs.GR cs.NA}
} | kuehn2008complex |
arxiv-2421 | 0801.3272 | Nonregenerative MIMO Relaying with Optimal Transmit Antenna Selection | <|reference_start|>Nonregenerative MIMO Relaying with Optimal Transmit Antenna Selection: We derive optimal SNR-based transmit antenna selection rules at the source and relay for the nonregenerative half duplex MIMO relay channel. While antenna selection is a suboptimal form of beamforming, it has the advantage that th... | arxiv | @article{peters2008nonregenerative,
title={Nonregenerative MIMO Relaying with Optimal Transmit Antenna Selection},
author={Steven W. Peters and Robert W. Heath Jr},
journal={arXiv preprint arXiv:0801.3272},
year={2008},
doi={10.1109/LSP.2008.921466},
archivePrefix={arXiv},
eprint={0801.3272}... | peters2008nonregenerative |
arxiv-2422 | 0801.3289 | Optimal Medium Access Control in Cognitive Radios: A Sequential Design Approach | <|reference_start|>Optimal Medium Access Control in Cognitive Radios: A Sequential Design Approach: The design of medium access control protocols for a cognitive user wishing to opportunistically exploit frequency bands within parts of the radio spectrum having multiple bands is considered. In the scenario under consid... | arxiv | @article{lai2008optimal,
title={Optimal Medium Access Control in Cognitive Radios: A Sequential Design
Approach},
author={Lifeng Lai, Hesham El Gamal, Hai Jiang and H. Vincent Poor},
journal={arXiv preprint arXiv:0801.3289},
year={2008},
doi={10.1109/ICASSP.2008.4518049},
archivePrefix={arXiv}... | lai2008optimal |
arxiv-2423 | 0801.3331 | Worst-Case Hermite-Korkine-Zolotarev Reduced Lattice Bases | <|reference_start|>Worst-Case Hermite-Korkine-Zolotarev Reduced Lattice Bases: The Hermite-Korkine-Zolotarev reduction plays a central role in strong lattice reduction algorithms. By building upon a technique introduced by Ajtai, we show the existence of Hermite-Korkine-Zolotarev reduced bases that are arguably least r... | arxiv | @article{hanrot2008worst-case,
title={Worst-Case Hermite-Korkine-Zolotarev Reduced Lattice Bases},
author={Guillaume Hanrot (INRIA Lorraine - LORIA), Damien Stehl'e (INRIA
Rh^one-Alpes)},
journal={arXiv preprint arXiv:0801.3331},
year={2008},
archivePrefix={arXiv},
eprint={0801.3331},
prim... | hanrot2008worst-case |
arxiv-2424 | 0801.3408 | On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth | <|reference_start|>On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth: Some 25 years ago Valiant introduced an algebraic model of computation in order to study the complexity of evaluating families of polynomials. The theory was introduced along with the complexity ... | arxiv | @article{flarup2008on,
title={On the expressive power of permanents and perfect matchings of matrices
of bounded pathwidth/cliquewidth},
author={Uffe Flarup (IMADA), Laurent Lyaudet (LIP)},
journal={arXiv preprint arXiv:0801.3408},
year={2008},
archivePrefix={arXiv},
eprint={0801.3408},
pr... | flarup2008on |
arxiv-2425 | 0801.3511 | Deterministic Design of Low-Density Parity-Check Codes for Binary Erasure Channels | <|reference_start|>Deterministic Design of Low-Density Parity-Check Codes for Binary Erasure Channels: We propose a deterministic method to design irregular Low-Density Parity-Check (LDPC) codes for binary erasure channels (BEC). Compared to the existing methods, which are based on the application of asymptomatic analy... | arxiv | @article{saeedi2008deterministic,
title={Deterministic Design of Low-Density Parity-Check Codes for Binary
Erasure Channels},
author={Hamid Saeedi and Amir H. Banihashemi},
journal={arXiv preprint arXiv:0801.3511},
year={2008},
archivePrefix={arXiv},
eprint={0801.3511},
primaryClass={cs.IT... | saeedi2008deterministic |
arxiv-2426 | 0801.3521 | Capacity of Sparse Wideband Channels with Partial Channel Feedback | <|reference_start|>Capacity of Sparse Wideband Channels with Partial Channel Feedback: This paper studies the ergodic capacity of wideband multipath channels with limited feedback. Our work builds on recent results that have established the possibility of significant capacity gains in the wideband/low-SNR regime when t... | arxiv | @article{hariharan2008capacity,
title={Capacity of Sparse Wideband Channels with Partial Channel Feedback},
author={Gautham Hariharan, Vasanthan Raghavan, Akbar M. Sayeed},
journal={arXiv preprint arXiv:0801.3521},
year={2008},
archivePrefix={arXiv},
eprint={0801.3521},
primaryClass={cs.IT m... | hariharan2008capacity |
arxiv-2427 | 0801.3526 | Quantized Multimode Precoding in Spatially Correlated Multi-Antenna Channels | <|reference_start|>Quantized Multimode Precoding in Spatially Correlated Multi-Antenna Channels: Multimode precoding, where the number of independent data-streams is adapted optimally, can be used to maximize the achievable throughput in multi-antenna communication systems. Motivated by standardization efforts embraced... | arxiv | @article{raghavan2008quantized,
title={Quantized Multimode Precoding in Spatially Correlated Multi-Antenna
Channels},
author={Vasanthan Raghavan, Venu Veeravalli, Akbar Sayeed},
journal={arXiv preprint arXiv:0801.3526},
year={2008},
doi={10.1109/TSP.2008.2005748},
archivePrefix={arXiv},
ep... | raghavan2008quantized |
arxiv-2428 | 0801.3539 | On the Effects of Idiotypic Interactions for Recommendation Communities in Artificial Immune Systems | <|reference_start|>On the Effects of Idiotypic Interactions for Recommendation Communities in Artificial Immune Systems: It has previously been shown that a recommender based on immune system idiotypic principles can out perform one based on correlation alone. This paper reports the results of work in progress, where w... | arxiv | @article{cayzer2008on,
title={On the Effects of Idiotypic Interactions for Recommendation Communities
in Artificial Immune Systems},
author={Steve Cayzer and Uwe Aickelin},
journal={Proceedings of the 1st International Conference on Artificial
Immune Systems (ICARIS 2002), pp 154-160, Canterbury, UK, 20... | cayzer2008on |
arxiv-2429 | 0801.3547 | A Recommender System based on the Immune Network | <|reference_start|>A Recommender System based on the Immune Network: The immune system is a complex biological system with a highly distributed, adaptive and self-organising nature. This paper presents an artificial immune system (AIS) that exploits some of these characteristics and is applied to the task of film recom... | arxiv | @article{cazyer2008a,
title={A Recommender System based on the Immune Network},
author={Steve Cazyer and Uwe Aickelin},
journal={Proceedings of the IEEE Congress on Evolutionary Computation (CEC
2002), pp 807-813, Honolulu, USA, 2002},
year={2008},
archivePrefix={arXiv},
eprint={0801.3547},
... | cazyer2008a |
arxiv-2430 | 0801.3549 | The Danger Theory and Its Application to Artificial Immune Systems | <|reference_start|>The Danger Theory and Its Application to Artificial Immune Systems: Over the last decade, a new idea challenging the classical self-non-self viewpoint has become popular amongst immunologists. It is called the Danger Theory. In this conceptual paper, we look at this theory from the perspective of Art... | arxiv | @article{aickelin2008the,
title={The Danger Theory and Its Application to Artificial Immune Systems},
author={Uwe Aickelin and Steve Cayzer},
journal={Proceedings of the 1st International Conference on Artificial
Immune Systems (ICARIS 2002), pp 141-148, Canterbury, Uk, 2002},
year={2008},
archive... | aickelin2008the |
arxiv-2431 | 0801.3550 | Partnering Strategies for Fitness Evaluation in a Pyramidal Evolutionary Algorithm | <|reference_start|>Partnering Strategies for Fitness Evaluation in a Pyramidal Evolutionary Algorithm: This paper combines the idea of a hierarchical distributed genetic algorithm with different inter-agent partnering strategies. Cascading clusters of sub-populations are built from bottom up, with higher-level sub-popu... | arxiv | @article{aickelin2008partnering,
title={Partnering Strategies for Fitness Evaluation in a Pyramidal Evolutionary
Algorithm},
author={Uwe Aickelin and Larry Bull},
journal={Proceedings of the Genetic and Evolutionary Computation Conference
(GECCO 2002), pp 263-270, New York, USA, 2002},
year={2008},
... | aickelin2008partnering |
arxiv-2432 | 0801.3581 | Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners | <|reference_start|>Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners: We show that for every $n$-point metric space $M$ there exists a spanning tree $T$ with unweighted diameter $O(\log n)$ and weight $\omega(T) = O(\log n) \cdot \omega(MST(M))$. Moreover, there is a designated point $rt$ suc... | arxiv | @article{dinitz2008shallow,,
title={Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean
Spanners},
author={Yefim Dinitz, Michael Elkin, Shay Solomon},
journal={arXiv preprint arXiv:0801.3581},
year={2008},
archivePrefix={arXiv},
eprint={0801.3581},
primaryClass={cs.CG cs.DS... | dinitz2008shallow, |
arxiv-2433 | 0801.3624 | Multiparty Communication Complexity of Disjointness | <|reference_start|>Multiparty Communication Complexity of Disjointness: We obtain a lower bound of n^Omega(1) on the k-party randomized communication complexity of the Disjointness function in the `Number on the Forehead' model of multiparty communication when k is a constant. For k=o(loglog n), the bounds remain super... | arxiv | @article{chattopadhyay2008multiparty,
title={Multiparty Communication Complexity of Disjointness},
author={Arkadev Chattopadhyay and Anil Ada},
journal={arXiv preprint arXiv:0801.3624},
year={2008},
archivePrefix={arXiv},
eprint={0801.3624},
primaryClass={cs.CC}
} | chattopadhyay2008multiparty |
arxiv-2434 | 0801.3640 | Energy Efficiency in Multi-Hop CDMA Networks: a Game Theoretic Analysis Considering Operating Costs | <|reference_start|>Energy Efficiency in Multi-Hop CDMA Networks: a Game Theoretic Analysis Considering Operating Costs: A game-theoretic analysis is used to study the effects of receiver choice and transmit power on the energy efficiency of multi-hop networks in which the nodes communicate using Direct-Sequence Code Di... | arxiv | @article{betz2008energy,
title={Energy Efficiency in Multi-Hop CDMA Networks: a Game Theoretic Analysis
Considering Operating Costs},
author={Sharon Betz and H. Vincent Poor},
journal={arXiv preprint arXiv:0801.3640},
year={2008},
doi={10.1109/TSP.2008.929118},
archivePrefix={arXiv},
eprin... | betz2008energy |
arxiv-2435 | 0801.3642 | Information Rates of Minimal Non-Matroid-Related Access Structures | <|reference_start|>Information Rates of Minimal Non-Matroid-Related Access Structures: In a secret sharing scheme, shares of a secret are distributed to participants in such a way that only certain predetermined sets of participants are qualified to reconstruct the secret. An access structure on a set of participants s... | arxiv | @article{metcalf-burton2008information,
title={Information Rates of Minimal Non-Matroid-Related Access Structures},
author={Jessica Ruth Metcalf-Burton},
journal={arXiv preprint arXiv:0801.3642},
year={2008},
archivePrefix={arXiv},
eprint={0801.3642},
primaryClass={cs.CR math.CO}
} | metcalf-burton2008information |
arxiv-2436 | 0801.3654 | A path following algorithm for the graph matching problem | <|reference_start|>A path following algorithm for the graph matching problem: We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted graph matching problem as a least-square problem on the set of ... | arxiv | @article{zaslavskiy2008a,
title={A path following algorithm for the graph matching problem},
author={Mikhail Zaslavskiy, Francis Bach, and Jean-Philippe Vert},
journal={arXiv preprint arXiv:0801.3654},
year={2008},
archivePrefix={arXiv},
eprint={0801.3654},
primaryClass={cs.CV cs.DM}
} | zaslavskiy2008a |
arxiv-2437 | 0801.3669 | Merkle's Key Agreement Protocol is Optimal: An $O(n^2)$ Attack on any Key Agreement from Random Oracles | <|reference_start|>Merkle's Key Agreement Protocol is Optimal: An $O(n^2)$ Attack on any Key Agreement from Random Oracles: We prove that every key agreement protocol in the random oracle model in which the honest users make at most $n$ queries to the oracle can be broken by an adversary who makes $O(n^2)$ queries to t... | arxiv | @article{barak2008merkle's,
title={Merkle's Key Agreement Protocol is Optimal: An $O(n^2)$ Attack on any
Key Agreement from Random Oracles},
author={Boaz Barak, Mohammad Mahmoody},
journal={arXiv preprint arXiv:0801.3669},
year={2008},
archivePrefix={arXiv},
eprint={0801.3669},
primaryClas... | barak2008merkle's |
arxiv-2438 | 0801.3678 | Regulation and the Integrity of Spreadsheets in the Information Supply Chain | <|reference_start|>Regulation and the Integrity of Spreadsheets in the Information Supply Chain: Spreadsheets provide many of the key links between information systems, closing the gap between business needs and the capability of central systems. Recent regulations have brought these vulnerable parts of information sup... | arxiv | @article{baxter2008regulation,
title={Regulation and the Integrity of Spreadsheets in the Information Supply
Chain},
author={Ralph Baxter},
journal={Proc. European Spreadsheet Risks Int. Grp. 2005 95-101
ISBN:1-902724-16-X},
year={2008},
archivePrefix={arXiv},
eprint={0801.3678},
primary... | baxter2008regulation |
arxiv-2439 | 0801.3680 | Lower Bounds on Signatures from Symmetric Primitives | <|reference_start|>Lower Bounds on Signatures from Symmetric Primitives: We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most $2^{(1+o(1))q}$, where $q$ is the total number of oracle queries asked by the key generation, signing, and verification algorith... | arxiv | @article{barak2008lower,
title={Lower Bounds on Signatures from Symmetric Primitives},
author={Boaz Barak, Mohammad Mahmoody},
journal={arXiv preprint arXiv:0801.3680},
year={2008},
archivePrefix={arXiv},
eprint={0801.3680},
primaryClass={cs.CC cs.CR}
} | barak2008lower |
arxiv-2440 | 0801.3690 | Ensuring Spreadsheet Integrity with Model Master | <|reference_start|>Ensuring Spreadsheet Integrity with Model Master: We have developed the Model Master (MM) language for describing spreadsheets, and tools for converting MM programs to and from spreadsheets. The MM decompiler translates a spreadsheet into an MM program which gives a concise summary of its calculation... | arxiv | @article{paine2008ensuring,
title={Ensuring Spreadsheet Integrity with Model Master},
author={Jocelyn Paine},
journal={Proc. European Spreadsheet Risks Int. Grp. 2001 17-38 ISBN:1 86166
179 7},
year={2008},
archivePrefix={arXiv},
eprint={0801.3690},
primaryClass={cs.PL cs.HC}
} | paine2008ensuring |
arxiv-2441 | 0801.3697 | The mathematics of Septoku | <|reference_start|>The mathematics of Septoku: Septoku is a Sudoku variant invented by Bruce Oberg, played on a hexagonal grid of 37 cells. We show that up to rotations, reflections, and symbol permutations, there are only six valid Septoku boards. In order to have a unique solution, we show that the minimum number of ... | arxiv | @article{bell2008the,
title={The mathematics of Septoku},
author={George I. Bell},
journal={arXiv preprint arXiv:0801.3697},
year={2008},
archivePrefix={arXiv},
eprint={0801.3697},
primaryClass={math.CO cs.DM math.GM}
} | bell2008the |
arxiv-2442 | 0801.3702 | Joint source and channel coding for MIMO systems: Is it better to be robust or quick? | <|reference_start|>Joint source and channel coding for MIMO systems: Is it better to be robust or quick?: We develop a framework to optimize the tradeoff between diversity, multiplexing, and delay in MIMO systems to minimize end-to-end distortion. We first focus on the diversity-multiplexing tradeoff in MIMO systems, a... | arxiv | @article{holliday2008joint,
title={Joint source and channel coding for MIMO systems: Is it better to be
robust or quick?},
author={Tim Holliday, Andrea J. Goldsmith, and H. Vincent Poor},
journal={IEEE Transactions on Information Theory, Vol. 54, No. 4, April
2008},
year={2008},
doi={10.1109/TIT... | holliday2008joint |
arxiv-2443 | 0801.3703 | On minimality of convolutional ring encoders | <|reference_start|>On minimality of convolutional ring encoders: Convolutional codes are considered with code sequences modelled as semi-infinite Laurent series. It is wellknown that a convolutional code C over a finite group G has a minimal trellis representation that can be derived from code sequences. It is also wel... | arxiv | @article{kuijper2008on,
title={On minimality of convolutional ring encoders},
author={Margreta Kuijper and Raquel Pinto},
journal={IEEE Trans. Information Theory, Vol. 55, No. 11, pp. 4890-4897,
November 2009},
year={2008},
archivePrefix={arXiv},
eprint={0801.3703},
primaryClass={cs.IT mat... | kuijper2008on |
arxiv-2444 | 0801.3710 | Picking up the Pieces: Self-Healing in Reconfigurable Networks | <|reference_start|>Picking up the Pieces: Self-Healing in Reconfigurable Networks: We consider the problem of self-healing in networks that are reconfigurable in the sense that they can change their topology during an attack. Our goal is to maintain connectivity in these networks, even in the presence of repeated adver... | arxiv | @article{saia2008picking,
title={Picking up the Pieces: Self-Healing in Reconfigurable Networks},
author={Jared Saia, Amitabh Trehan},
journal={arXiv preprint arXiv:0801.3710},
year={2008},
doi={10.1109/IPDPS.2008.4536326},
archivePrefix={arXiv},
eprint={0801.3710},
primaryClass={cs.DS c... | saia2008picking |
arxiv-2445 | 0801.3711 | 3D-Ultrasound probe calibration for computer-guided diagnosis and therapy | <|reference_start|>3D-Ultrasound probe calibration for computer-guided diagnosis and therapy: With the emergence of swept-volume ultrasound (US) probes, precise and almost real-time US volume imaging has become available. This offers many new opportunities for computer guided diagnosis and therapy, 3-D images containin... | arxiv | @article{baumann20083d-ultrasound,
title={3D-Ultrasound probe calibration for computer-guided diagnosis and
therapy},
author={Michael Baumann (TIMC), Vincent Daanen (TIMC), Antoine Leroy (TIMC),
Jocelyne Troccaz (TIMC)},
journal={Dans Proceedings of CVAMIA'06 - 2nd International workshop on
Computer V... | baumann20083d-ultrasound |
arxiv-2446 | 0801.3714 | 5-cycles and the Petersen graph | <|reference_start|>5-cycles and the Petersen graph: We show that if G is a connected bridgeless cubic graph whose every 2-factor is comprised of cycles of length five then G is the Petersen graph.<|reference_end|> | arxiv | @article{devos20085-cycles,
title={5-cycles and the Petersen graph},
author={Matt DeVos, Vahan V. Mkrtchyan, Samvel S. Petrosyan},
journal={arXiv preprint arXiv:0801.3714},
year={2008},
archivePrefix={arXiv},
eprint={0801.3714},
primaryClass={cs.DM}
} | devos20085-cycles |
arxiv-2447 | 0801.3715 | Modular Compilation of a Synchronous Language | <|reference_start|>Modular Compilation of a Synchronous Language: Synchronous languages rely on formal methods to ease the development of applications in an efficient and reusable way. Formal methods have been advocated as a means of increasing the reliability of systems, especially those which are safety or business c... | arxiv | @article{ressouche2008modular,
title={Modular Compilation of a Synchronous Language},
author={Annie Ressouche, Daniel Gaff'e (LEAT), Val'erie Roy},
journal={arXiv preprint arXiv:0801.3715},
year={2008},
archivePrefix={arXiv},
eprint={0801.3715},
primaryClass={cs.PL cs.LO}
} | ressouche2008modular |
arxiv-2448 | 0801.3773 | Graph-Based Classification of Self-Dual Additive Codes over Finite Fields | <|reference_start|>Graph-Based Classification of Self-Dual Additive Codes over Finite Fields: Quantum stabilizer states over GF(m) can be represented as self-dual additive codes over GF(m^2). These codes can be represented as weighted graphs, and orbits of graphs under the generalized local complementation operation co... | arxiv | @article{danielsen2008graph-based,
title={Graph-Based Classification of Self-Dual Additive Codes over Finite
Fields},
author={Lars Eirik Danielsen},
journal={Adv. Math. Commun. 3(4), pp. 329-348, 2009},
year={2008},
doi={10.3934/amc.2009.3.329},
archivePrefix={arXiv},
eprint={0801.3773},
... | danielsen2008graph-based |
arxiv-2449 | 0801.3790 | Characterization of the Vertices and Extreme Directions of the Negative Cycles Polyhedron and Hardness of Generating Vertices of 0/1-Polyhedra | <|reference_start|>Characterization of the Vertices and Extreme Directions of the Negative Cycles Polyhedron and Hardness of Generating Vertices of 0/1-Polyhedra: Given a graph $G=(V,E)$ and a weight function on the edges $w:E\mapsto\RR$, we consider the polyhedron $P(G,w)$ of negative-weight flows on $G$, and get a co... | arxiv | @article{boros2008characterization,
title={Characterization of the Vertices and Extreme Directions of the Negative
Cycles Polyhedron and Hardness of Generating Vertices of 0/1-Polyhedra},
author={Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Hans Raj Tiwary},
journal={arXiv preprint arXiv:0801.3790},
... | boros2008characterization |
arxiv-2450 | 0801.3802 | Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems | <|reference_start|>Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems: A complete classification of the computational complexity of the fixed-point existence problem for boolean dynamical systems, i.e., finite discrete dynamical systems over the domain {0, 1}, is presented. For function ... | arxiv | @article{kosub2008dichotomy,
title={Dichotomy Results for Fixed-Point Existence Problems for Boolean
Dynamical Systems},
author={Sven Kosub},
journal={Mathematics in Computer Science, 1(3):487-505, 2008, special issue
on Modeling and Analysis of Complex Systems},
year={2008},
number={TUM-I0701, ... | kosub2008dichotomy |
arxiv-2451 | 0801.3817 | Robustness Evaluation of Two CCG, a PCFG and a Link Grammar Parsers | <|reference_start|>Robustness Evaluation of Two CCG, a PCFG and a Link Grammar Parsers: Robustness in a parser refers to an ability to deal with exceptional phenomena. A parser is robust if it deals with phenomena outside its normal range of inputs. This paper reports on a series of robustness evaluations of state-of-t... | arxiv | @article{kakkonen2008robustness,
title={Robustness Evaluation of Two CCG, a PCFG and a Link Grammar Parsers},
author={Tuomo Kakkonen},
journal={Proceedings of the 3rd Language & Technology Conference: Human
Language Technologies as a Challenge for Computer Science and Linguistics.
Poznan, Poland, 2007},... | kakkonen2008robustness |
arxiv-2452 | 0801.3837 | Universal Fingerprinting: Capacity and Random-Coding Exponents | <|reference_start|>Universal Fingerprinting: Capacity and Random-Coding Exponents: This paper studies fingerprinting (traitor tracing) games in which the number of colluders and the collusion channel are unknown. The fingerprints are embedded into host sequences representing signals to be protected and provide the rece... | arxiv | @article{moulin2008universal,
title={Universal Fingerprinting: Capacity and Random-Coding Exponents},
author={Pierre Moulin},
journal={arXiv preprint arXiv:0801.3837},
year={2008},
archivePrefix={arXiv},
eprint={0801.3837},
primaryClass={cs.IT math.IT}
} | moulin2008universal |
arxiv-2453 | 0801.3841 | Analysis of Prime Reciprocal Sequences in Base 10 | <|reference_start|>Analysis of Prime Reciprocal Sequences in Base 10: Prime reciprocals have applications in coding and cryptography and for generation of random sequences. This paper investigates the structural redundancy of prime reciprocals in base 10 in a manner that parallels an earlier study for binary prime reci... | arxiv | @article{gangasani2008analysis,
title={Analysis of Prime Reciprocal Sequences in Base 10},
author={Sumanth Kumar Reddy Gangasani},
journal={arXiv preprint arXiv:0801.3841},
year={2008},
archivePrefix={arXiv},
eprint={0801.3841},
primaryClass={cs.CR}
} | gangasani2008analysis |
arxiv-2454 | 0801.3853 | Comparison of Spreadsheets with other Development Tools (limitations, solutions, workarounds and alternatives) | <|reference_start|>Comparison of Spreadsheets with other Development Tools (limitations, solutions, workarounds and alternatives): The spreadsheet paradigm has some unique risks and challenges that are not present in more traditional development technologies. Many of the recent advances in other branches of software de... | arxiv | @article{murphy2008comparison,
title={Comparison of Spreadsheets with other Development Tools (limitations,
solutions, workarounds and alternatives)},
author={Simon Murphy},
journal={Proc. European Spreadsheet Risks Int. Grp. 2005 201208
ISBN:1-902724-16-X},
year={2008},
archivePrefix={arXiv},
... | murphy2008comparison |
arxiv-2455 | 0801.3864 | Between conjecture and memento: shaping a collective emotional perception of the future | <|reference_start|>Between conjecture and memento: shaping a collective emotional perception of the future: Large scale surveys of public mood are costly and often impractical to perform. However, the web is awash with material indicative of public mood such as blogs, emails, and web queries. Inexpensive content analys... | arxiv | @article{pepe2008between,
title={Between conjecture and memento: shaping a collective emotional
perception of the future},
author={Alberto Pepe and Johan Bollen},
journal={arXiv preprint arXiv:0801.3864},
year={2008},
archivePrefix={arXiv},
eprint={0801.3864},
primaryClass={cs.CL cs.GL}
} | pepe2008between |
arxiv-2456 | 0801.3871 | On the Scaling Window of Model RB | <|reference_start|>On the Scaling Window of Model RB: This paper analyzes the scaling window of a random CSP model (i.e. model RB) for which we can identify the threshold points exactly, denoted by $r_{cr}$ or $p_{cr}$. For this model, we establish the scaling window $W(n,\delta)=(r_{-}(n,\delta), r_{+}(n,\delta))$ suc... | arxiv | @article{zhao2008on,
title={On the Scaling Window of Model RB},
author={Chunyan Zhao, Ke Xu, Zhiming Zheng},
journal={arXiv preprint arXiv:0801.3871},
year={2008},
archivePrefix={arXiv},
eprint={0801.3871},
primaryClass={cs.CC cond-mat.stat-mech cs.AI}
} | zhao2008on |
arxiv-2457 | 0801.3875 | Towards a Real-Time Data Driven Wildland Fire Model | <|reference_start|>Towards a Real-Time Data Driven Wildland Fire Model: A wildland fire model based on semi-empirical relations for the spread rate of a surface fire and post-frontal heat release is coupled with the Weather Research and Forecasting atmospheric model (WRF). The propagation of the fire front is implement... | arxiv | @article{mandel2008towards,
title={Towards a Real-Time Data Driven Wildland Fire Model},
author={Jan Mandel, Jonathan D. Beezley, Soham Chakraborty, Janice L. Coen,
Craig C. Douglas, Anthony Vodacek, Zhen Wang},
journal={IEEE International Symposium on Parallel and Distributed
Processing, 2008 (IPDPS 20... | mandel2008towards |
arxiv-2458 | 0801.3878 | Hash Property and Coding Theorems for Sparse Matrices and Maximum-Likelihood Coding | <|reference_start|>Hash Property and Coding Theorems for Sparse Matrices and Maximum-Likelihood Coding: The aim of this paper is to prove the achievability of several coding problems by using sparse matrices (the maximum column weight grows logarithmically in the block length) and maximal-likelihood (ML) coding. These ... | arxiv | @article{muramatsu2008hash,
title={Hash Property and Coding Theorems for Sparse Matrices and
Maximum-Likelihood Coding},
author={Jun Muramatsu and Shigeki Miyake},
journal={IEEE Transactions on Information Theory, vol 56, no. 5,
pp.2143-2167, May 2010; Corrections: IEEE Transactions on Information Theor... | muramatsu2008hash |
arxiv-2459 | 0801.3880 | Spectral efficiency and optimal medium access control of random access systems over large random spreading CDMA | <|reference_start|>Spectral efficiency and optimal medium access control of random access systems over large random spreading CDMA: This paper analyzes the spectral efficiency as a function of medium access control (MAC) for large random spreading CDMA random access systems that employ a linear receiver. It is shown th... | arxiv | @article{sun2008spectral,
title={Spectral efficiency and optimal medium access control of random access
systems over large random spreading CDMA},
author={Yi Sun},
journal={arXiv preprint arXiv:0801.3880},
year={2008},
doi={10.1109/TCOMM.2009.05.07044},
archivePrefix={arXiv},
eprint={0801.... | sun2008spectral |
arxiv-2460 | 0801.3908 | Encoding changing country codes for the Semantic Web with ISO 3166 and SKOS | <|reference_start|>Encoding changing country codes for the Semantic Web with ISO 3166 and SKOS: This paper shows how authority files can be encoded for the Semantic Web with the Simple Knowledge Organisation System (SKOS). In particular the application of SKOS for encoding the structure, management, and utilization of ... | arxiv | @article{voss2008encoding,
title={Encoding changing country codes for the Semantic Web with ISO 3166 and
SKOS},
author={Jakob Voss},
journal={arXiv preprint arXiv:0801.3908},
year={2008},
archivePrefix={arXiv},
eprint={0801.3908},
primaryClass={cs.IR}
} | voss2008encoding |
arxiv-2461 | 0801.3912 | On the Continuity Set of an omega Rational Function | <|reference_start|>On the Continuity Set of an omega Rational Function: In this paper, we study the continuity of rational functions realized by B\"uchi finite state transducers. It has been shown by Prieur that it can be decided whether such a function is continuous. We prove here that surprisingly, it cannot be decid... | arxiv | @article{carton2008on,
title={On the Continuity Set of an omega Rational Function},
author={Olivier Carton (LIAFA), Olivier Finkel (LIP), Pierre Simonnet (SPE)},
journal={Theoretical Informatics and Applications (1), 42 (2008) 183-196},
year={2008},
archivePrefix={arXiv},
eprint={0801.3912},
... | carton2008on |
arxiv-2462 | 0801.3924 | Increased security through open source | <|reference_start|>Increased security through open source: In this paper we discuss the impact of open source on both the security and transparency of a software system. We focus on the more technical aspects of this issue, combining and extending arguments developed over the years. We stress that our discussion of the... | arxiv | @article{hoepman2008increased,
title={Increased security through open source},
author={Jaap-Henk Hoepman, Bart Jacobs},
journal={Communications of the ACM, 50(1):79-83, 2007},
year={2008},
archivePrefix={arXiv},
eprint={0801.3924},
primaryClass={cs.CR cs.CY cs.SE}
} | hoepman2008increased |
arxiv-2463 | 0801.3926 | On the Weight Distribution of the Extended Quadratic Residue Code of Prime 137 | <|reference_start|>On the Weight Distribution of the Extended Quadratic Residue Code of Prime 137: The Hamming weight enumerator function of the formally self-dual even, binary extended quadratic residue code of prime p = 8m + 1 is given by Gleason's theorem for singly-even code. Using this theorem, the Hamming weight ... | arxiv | @article{tjhai2008on,
title={On the Weight Distribution of the Extended Quadratic Residue Code of
Prime 137},
author={C. Tjhai, M. Tomlinson, M. Ambroze and M. Ahmed},
journal={arXiv preprint arXiv:0801.3926},
year={2008},
archivePrefix={arXiv},
eprint={0801.3926},
primaryClass={cs.IT cs.D... | tjhai2008on |
arxiv-2464 | 0801.3930 | Crossing Borders: Security and Privacy Issues of the European e-Passport | <|reference_start|>Crossing Borders: Security and Privacy Issues of the European e-Passport: The first generation of European e-passports will be issued in 2006. We discuss how borders are crossed regarding the security and privacy erosion of the proposed schemes, and show which borders need to be crossed to improve th... | arxiv | @article{hoepman2008crossing,
title={Crossing Borders: Security and Privacy Issues of the European e-Passport},
author={Jaap-Henk Hoepman, Engelbert Hubbers, Bart Jacobs, Martijn Oostdijk,
Ronny Wichers Schreur},
journal={1st Int. Workshop on Security, LNCS 4266, pages 152-167, Kyoto,
Japan, October 23-... | hoepman2008crossing |
arxiv-2465 | 0801.3965 | Framework for 3D TransRectal Ultrasound | <|reference_start|>Framework for 3D TransRectal Ultrasound: Prostate biopsies are mainly performed under 2D TransRectal UltraSound (TRUS) control by sampling the prostate according to a predefined pattern. In case of first biopsies, this pattern follows a random systematic plan. Sometimes, repeat biopsies can be needed... | arxiv | @article{mozer2008framework,
title={Framework for 3D TransRectal Ultrasound},
author={Pierre Mozer (TIMC), Michael Baumann (TIMC), G. Chevreau (TIMC),
Vincent Daanen (TIMC), Alexandre Moreau-Gaudry (TIMC, CHU-Grenoble CIC),
Jocelyne Troccaz (TIMC)},
journal={Johns Hopkins University "Prostate Day", Balt... | mozer2008framework |
arxiv-2466 | 0801.3971 | A Bayesian Optimisation Algorithm for the Nurse Scheduling Problem | <|reference_start|>A Bayesian Optimisation Algorithm for the Nurse Scheduling Problem: A Bayesian optimization algorithm for the nurse scheduling problem is presented, which involves choosing a suitable scheduling rule from a set for each nurses assignment. Unlike our previous work that used Gas to implement implicit l... | arxiv | @article{li2008a,
title={A Bayesian Optimisation Algorithm for the Nurse Scheduling Problem},
author={Jingpeng Li and Uwe Aickelin},
journal={Proceedings of the IEEE Congress on Evolutionary Computation (CEC
2003), pp 2149-2156, Canberra, Australia, 2003},
year={2008},
archivePrefix={arXiv},
e... | li2008a |
arxiv-2467 | 0801.3982 | Pseudo-Random Bit Generation based on 2D chaotic maps of logistic type and its Applications in Chaotic Cryptography | <|reference_start|>Pseudo-Random Bit Generation based on 2D chaotic maps of logistic type and its Applications in Chaotic Cryptography: Pseudo-Random Bit Generation (PRBG) is required in many aspects of cryptography as well as in other applications of modern security engineering. In this work, PRBG based on 2D symmetri... | arxiv | @article{pellicer-lostao2008pseudo-random,
title={Pseudo-Random Bit Generation based on 2D chaotic maps of logistic type
and its Applications in Chaotic Cryptography},
author={C. Pellicer-Lostao and R. Lopez-Ruiz},
journal={arXiv preprint arXiv:0801.3982},
year={2008},
archivePrefix={arXiv},
e... | pellicer-lostao2008pseudo-random |
arxiv-2468 | 0801.3983 | New Upper Bounds on Sizes of Permutation Arrays | <|reference_start|>New Upper Bounds on Sizes of Permutation Arrays: A permutation array(or code) of length $n$ and distance $d$, denoted by $(n,d)$ PA, is a set of permutations $C$ from some fixed set of $n$ elements such that the Hamming distance between distinct members $\mathbf{x},\mathbf{y}\in C$ is at least $d$. L... | arxiv | @article{yang2008new,
title={New Upper Bounds on Sizes of Permutation Arrays},
author={Lizhen Yang, Ling Dong, Kefei Chen},
journal={arXiv preprint arXiv:0801.3983},
year={2008},
archivePrefix={arXiv},
eprint={0801.3983},
primaryClass={cs.IT math.IT}
} | yang2008new |
arxiv-2469 | 0801.3985 | Cobweb posets - Recent Results | <|reference_start|>Cobweb posets - Recent Results: Cobweb posets uniquely represented by directed acyclic graphs are such a generalization of the Fibonacci tree that allows joint combinatorial interpretation for all of them under admissibility condition. This interpretation was derived in the source papers ([6,7] and r... | arxiv | @article{kwasniewski2008cobweb,
title={Cobweb posets - Recent Results},
author={A. Krzysztof Kwasniewski, M. Dziemianczuk},
journal={Adv. Stud. Contemp. Math. volume 16 (2), 2008 (April) pp. 197-218},
year={2008},
archivePrefix={arXiv},
eprint={0801.3985},
primaryClass={math.CO cs.DM}
} | kwasniewski2008cobweb |
arxiv-2470 | 0801.3986 | New Lower Bounds on Sizes of Permutation Arrays | <|reference_start|>New Lower Bounds on Sizes of Permutation Arrays: A permutation array(or code) of length $n$ and distance $d$, denoted by $(n,d)$ PA, is a set of permutations $C$ from some fixed set of $n$ elements such that the Hamming distance between distinct members $\mathbf{x},\mathbf{y}\in C$ is at least $d$. L... | arxiv | @article{yang2008new,
title={New Lower Bounds on Sizes of Permutation Arrays},
author={Lizhen Yang, Kefei Chen, Luo Yuan},
journal={arXiv preprint arXiv:0801.3986},
year={2008},
archivePrefix={arXiv},
eprint={0801.3986},
primaryClass={cs.IT math.IT}
} | yang2008new |
arxiv-2471 | 0801.3987 | New Constructions of Permutation Arrays | <|reference_start|>New Constructions of Permutation Arrays: A permutation array(permutation code, PA) of length $n$ and distance $d$, denoted by $(n,d)$ PA, is a set of permutations $C$ from some fixed set of $n$ elements such that the Hamming distance between distinct members $\mathbf{x},\mathbf{y}\in C$ is at least $... | arxiv | @article{yang2008new,
title={New Constructions of Permutation Arrays},
author={Lizhen Yang, Kefei Chen, Luo Yuan},
journal={arXiv preprint arXiv:0801.3987},
year={2008},
archivePrefix={arXiv},
eprint={0801.3987},
primaryClass={cs.IT math.IT}
} | yang2008new |
arxiv-2472 | 0801.4013 | Spanners of Additively Weighted Point Sets | <|reference_start|>Spanners of Additively Weighted Point Sets: We study the problem of computing geometric spanners for (additively) weighted point sets. A weighted point set is a set of pairs $(p,r)$ where $p$ is a point in the plane and $r$ is a real number. The distance between two points $(p_i,r_i)$ and $(p_j,r_j)$... | arxiv | @article{bose2008spanners,
title={Spanners of Additively Weighted Point Sets},
author={Prosenjit Bose and Paz Carmi and Mathieu Couture},
journal={arXiv preprint arXiv:0801.4013},
year={2008},
archivePrefix={arXiv},
eprint={0801.4013},
primaryClass={cs.CG}
} | bose2008spanners |
arxiv-2473 | 0801.4019 | A Class of Convex Polyhedra with Few Edge Unfoldings | <|reference_start|>A Class of Convex Polyhedra with Few Edge Unfoldings: We construct a sequence of convex polyhedra on n vertices with the property that, as n -> infinity, the fraction of its edge unfoldings that avoid overlap approaches 0, and so the fraction that overlap approaches 1. Nevertheless, each does have (s... | arxiv | @article{benton2008a,
title={A Class of Convex Polyhedra with Few Edge Unfoldings},
author={Alex Benton and Joseph O'Rourke},
journal={arXiv preprint arXiv:0801.4019},
year={2008},
number={Smith Computer Science 088},
archivePrefix={arXiv},
eprint={0801.4019},
primaryClass={cs.CG}
} | benton2008a |
arxiv-2474 | 0801.4024 | Set-based complexity and biological information | <|reference_start|>Set-based complexity and biological information: It is not obvious what fraction of all the potential information residing in the molecules and structures of living systems is significant or meaningful to the system. Sets of random sequences or identically repeated sequences, for example, would be ex... | arxiv | @article{galas2008set-based,
title={Set-based complexity and biological information},
author={David J. Galas, Matti Nykter, Gregory W. Carter, Nathan D. Price, Ilya
Shmulevich},
journal={arXiv preprint arXiv:0801.4024},
year={2008},
archivePrefix={arXiv},
eprint={0801.4024},
primaryClass={... | galas2008set-based |
arxiv-2475 | 0801.4048 | High Performance Cooperative Transmission Protocols Based on Multiuser Detection and Network Coding | <|reference_start|>High Performance Cooperative Transmission Protocols Based on Multiuser Detection and Network Coding: Cooperative transmission is an emerging communication technique that takes advantage of the broadcast nature of wireless channels. However, due to low spectral efficiency and the requirement of orthog... | arxiv | @article{han2008high,
title={High Performance Cooperative Transmission Protocols Based on Multiuser
Detection and Network Coding},
author={Zhu Han, Xin Zhang, H. Vincent Poor},
journal={arXiv preprint arXiv:0801.4048},
year={2008},
doi={10.1109/TWC.2009.070181},
archivePrefix={arXiv},
epri... | han2008high |
arxiv-2476 | 0801.4054 | Bounded Mean-Delay Throughput and Non-Starvation Conditions in Aloha Network | <|reference_start|>Bounded Mean-Delay Throughput and Non-Starvation Conditions in Aloha Network: This paper considers the requirements to ensure bounded mean queuing delay and non-starvation in a slotted Aloha network operating the exponential backoff protocol. It is well-known that the maximum possible throughput of a... | arxiv | @article{liew2008bounded,
title={Bounded Mean-Delay Throughput and Non-Starvation Conditions in Aloha
Network},
author={Soung Chang Liew, Ying Jun Zhang, Da Rui Chen},
journal={arXiv preprint arXiv:0801.4054},
year={2008},
archivePrefix={arXiv},
eprint={0801.4054},
primaryClass={cs.NI}
} | liew2008bounded |
arxiv-2477 | 0801.4061 | The optimal assignment kernel is not positive definite | <|reference_start|>The optimal assignment kernel is not positive definite: We prove that the optimal assignment kernel, proposed recently as an attempt to embed labeled graphs and more generally tuples of basic data to a Hilbert space, is in fact not always positive definite.<|reference_end|> | arxiv | @article{vert2008the,
title={The optimal assignment kernel is not positive definite},
author={Jean-Philippe Vert (CB)},
journal={arXiv preprint arXiv:0801.4061},
year={2008},
archivePrefix={arXiv},
eprint={0801.4061},
primaryClass={cs.LG}
} | vert2008the |
arxiv-2478 | 0801.4079 | An equivalence preserving transformation from the Fibonacci to the Galois NLFSRs | <|reference_start|>An equivalence preserving transformation from the Fibonacci to the Galois NLFSRs: Conventional Non-Linear Feedback Shift Registers (NLFSRs) use the Fibonacci configuration in which the value of the first bit is updated according to some non-linear feedback function of previous values of other bits, a... | arxiv | @article{dubrova2008an,
title={An equivalence preserving transformation from the Fibonacci to the
Galois NLFSRs},
author={Elena Dubrova (Royal Institute of Technology)},
journal={arXiv preprint arXiv:0801.4079},
year={2008},
archivePrefix={arXiv},
eprint={0801.4079},
primaryClass={cs.CR}
} | dubrova2008an |
arxiv-2479 | 0801.4082 | On Reliability of Dynamic Addressing Routing Protocols in Mobile Ad Hoc Networks | <|reference_start|>On Reliability of Dynamic Addressing Routing Protocols in Mobile Ad Hoc Networks: In this paper, a reliability analysis is carried out to state a performance comparison between two recently proposed proactive routing algorithms. These protocols are able to scale in ad hoc and sensor networks by resor... | arxiv | @article{caleffi2008on,
title={On Reliability of Dynamic Addressing Routing Protocols in Mobile Ad Hoc
Networks},
author={Marcello Caleffi, Giancarlo Ferraiuolo, Luigi Paura},
journal={arXiv preprint arXiv:0801.4082},
year={2008},
archivePrefix={arXiv},
eprint={0801.4082},
primaryClass={cs... | caleffi2008on |
arxiv-2480 | 0801.4105 | Quantified Propositional Logspace Reasoning | <|reference_start|>Quantified Propositional Logspace Reasoning: In this paper, we develop a quantified propositional proof systems that corresponds to logarithmic-space reasoning. We begin by defining a class SigmaCNF(2) of quantified formulas that can be evaluated in log space. Then our new proof system GL^* is define... | arxiv | @article{perron2008quantified,
title={Quantified Propositional Logspace Reasoning},
author={Steven Perron (University of Toronto)},
journal={arXiv preprint arXiv:0801.4105},
year={2008},
archivePrefix={arXiv},
eprint={0801.4105},
primaryClass={cs.LO cs.CC}
} | perron2008quantified |
arxiv-2481 | 0801.4119 | Strategic Alert Throttling for Intrusion Detection Systems | <|reference_start|>Strategic Alert Throttling for Intrusion Detection Systems: Network intrusion detection systems are themselves becoming targets of attackers. Alert flood attacks may be used to conceal malicious activity by hiding it among a deluge of false alerts sent by the attacker. Although these types of attacks... | arxiv | @article{tedesco2008strategic,
title={Strategic Alert Throttling for Intrusion Detection Systems},
author={Gianni Tedesco and Uwe Aickelin},
journal={4th WSEAS International Conference on Information Security (WSEAS
2005), Tenerife, Spain, 2005},
year={2008},
archivePrefix={arXiv},
eprint={080... | tedesco2008strategic |
arxiv-2482 | 0801.4129 | Scaling Laws and Techniques in Decentralized Processing of Interfered Gaussian Channels | <|reference_start|>Scaling Laws and Techniques in Decentralized Processing of Interfered Gaussian Channels: The scaling laws of the achievable communication rates and the corresponding upper bounds of distributed reception in the presence of an interfering signal are investigated. The scheme includes one transmitter co... | arxiv | @article{sanderovich2008scaling,
title={Scaling Laws and Techniques in Decentralized Processing of Interfered
Gaussian Channels},
author={Amichai Sanderovich, Michael Peleg and Shlomo Shamai},
journal={arXiv preprint arXiv:0801.4129},
year={2008},
archivePrefix={arXiv},
eprint={0801.4129},
... | sanderovich2008scaling |
arxiv-2483 | 0801.4130 | Solving Min-Max Problems with Applications to Games | <|reference_start|>Solving Min-Max Problems with Applications to Games: We refine existing general network optimization techniques, give new characterizations for the class of problems to which they can be applied, and show that they can also be used to solve various two-player games in almost linear time. Among these ... | arxiv | @article{andersson2008solving,
title={Solving Min-Max Problems with Applications to Games},
author={Daniel Andersson},
journal={arXiv preprint arXiv:0801.4130},
year={2008},
archivePrefix={arXiv},
eprint={0801.4130},
primaryClass={cs.GT cs.DS}
} | andersson2008solving |
arxiv-2484 | 0801.4150 | e-Science perspectives in Venezuela | <|reference_start|>e-Science perspectives in Venezuela: We describe the e-Science strategy in Venezuela, in particular initiatives by the Centro Nacional de Calculo Cientifico Universidad de Los Andes (CECALCULA), Merida, the Universidad de Los Andes (ULA), Merida, and the Instituto Venezolano de Investigaciones Cienti... | arxiv | @article{diaz2008e-science,
title={e-Science perspectives in Venezuela},
author={G. Diaz, J. Florez-Lopez, V. Hamar, H. Hoeger, C. Mendoza, Z. Mendez,
L. A. Nunez, N. Ruiz, R. Torrens, M. Uzcategui},
journal={Proceedings of the Third EELA Conference, R. Gavela, B. Marechal,
R. Barbera, L.N. Ciuffo, R. M... | diaz2008e-science |
arxiv-2485 | 0801.4158 | Measuring the Dynamical State of the Internet: Large Scale Network Tomography via the ETOMIC Infrastructure | <|reference_start|>Measuring the Dynamical State of the Internet: Large Scale Network Tomography via the ETOMIC Infrastructure: In this paper we show how to go beyond the study of the topological properties of the Internet, by measuring its dynamical state using special active probing techniques and the methods of netw... | arxiv | @article{simon2008measuring,
title={Measuring the Dynamical State of the Internet: Large Scale Network
Tomography via the ETOMIC Infrastructure},
author={Gabor Simon, Jozsef Steger, Peter Haga Istvan Csabai, Gabor Vattay},
journal={arXiv preprint arXiv:0801.4158},
year={2008},
archivePrefix={arXiv... | simon2008measuring |
arxiv-2486 | 0801.4190 | Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep | <|reference_start|>Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep: We introduce a new phylogenetic reconstruction algorithm which, unlike most previous rigorous inference techniques, does not rely on assumptions regarding the branch lengths or the depth of the tree. The algorithm returns a f... | arxiv | @article{daskalakis2008phylogenies,
title={Phylogenies without Branch Bounds: Contracting the Short, Pruning the
Deep},
author={Constantinos Daskalakis, Elchanan Mossel, Sebastien Roch},
journal={arXiv preprint arXiv:0801.4190},
year={2008},
archivePrefix={arXiv},
eprint={0801.4190},
prima... | daskalakis2008phylogenies |
arxiv-2487 | 0801.4194 | A statistical mechanical interpretation of algorithmic information theory | <|reference_start|>A statistical mechanical interpretation of algorithmic information theory: We develop a statistical mechanical interpretation of algorithmic information theory by introducing the notion of thermodynamic quantities, such as free energy, energy, statistical mechanical entropy, and specific heat, into a... | arxiv | @article{tadaki2008a,
title={A statistical mechanical interpretation of algorithmic information
theory},
author={Kohtaro Tadaki},
journal={arXiv preprint arXiv:0801.4194},
year={2008},
archivePrefix={arXiv},
eprint={0801.4194},
primaryClass={cs.IT cs.CC math.IT math.PR quant-ph}
} | tadaki2008a |
arxiv-2488 | 0801.4198 | Microscopic Analysis for Decoupling Principle of Linear Vector Channel | <|reference_start|>Microscopic Analysis for Decoupling Principle of Linear Vector Channel: This paper studies the decoupling principle of a linear vector channel, which is an extension of CDMA and MIMO channels. We show that the scalar-channel characterization obtained via the decoupling principle is valid not only for... | arxiv | @article{nakamura2008microscopic,
title={Microscopic Analysis for Decoupling Principle of Linear Vector Channel},
author={Kazutaka Nakamura, Toshiyuki Tanaka},
journal={arXiv preprint arXiv:0801.4198},
year={2008},
archivePrefix={arXiv},
eprint={0801.4198},
primaryClass={cs.IT math.IT}
} | nakamura2008microscopic |
arxiv-2489 | 0801.4230 | Quantum entanglement analysis based on abstract interpretation | <|reference_start|>Quantum entanglement analysis based on abstract interpretation: Entanglement is a non local property of quantum states which has no classical counterpart and plays a decisive role in quantum information theory. Several protocols, like the teleportation, are based on quantum entangled states. Moreover... | arxiv | @article{perdrix2008quantum,
title={Quantum entanglement analysis based on abstract interpretation},
author={Simon Perdrix},
journal={Proc. of 15th International Static Analysis Symposium (SAS 2008).
LNCS 5079, pp 270-282},
year={2008},
doi={10.1007/978-3-540-69166-2_18},
archivePrefix={arXiv}... | perdrix2008quantum |
arxiv-2490 | 0801.4238 | Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems | <|reference_start|>Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems: We study scheduling problems motivated by recently developed techniques for microprocessor thermal management at the operating systems level. The general scenario can be described as follows. The microprocessor's temperature ... | arxiv | @article{chrobak2008algorithms,
title={Algorithms for Temperature-Aware Task Scheduling in Microprocessor
Systems},
author={Marek Chrobak, Christoph Durr, Mathilde Hurand and Julien Robert},
journal={arXiv preprint arXiv:0801.4238},
year={2008},
archivePrefix={arXiv},
eprint={0801.4238},
p... | chrobak2008algorithms |
arxiv-2491 | 0801.4268 | Protecting Spreadsheets Against Fraud | <|reference_start|>Protecting Spreadsheets Against Fraud: Previous research on spreadsheet risks has predominantly focussed on errors inadvertently introduced by spreadsheet writers i.e. it focussed on the end-user aspects of spreadsheet development. When analyzing a faulty spreadsheet, one might not be able to determi... | arxiv | @article{mittermeir2008protecting,
title={Protecting Spreadsheets Against Fraud},
author={Roland T. Mittermeir, Markus Clermont, Karin Hodnigg},
journal={Proc. European Spreadsheet Risks Int. Grp. 2005 69-80
ISBN:1-902724-16-X},
year={2008},
archivePrefix={arXiv},
eprint={0801.4268},
prima... | mittermeir2008protecting |
arxiv-2492 | 0801.4274 | Computational Models of Spreadsheet Development: Basis for Educational Approaches | <|reference_start|>Computational Models of Spreadsheet Development: Basis for Educational Approaches: Among the multiple causes of high error rates in spreadsheets, lack of proper training and of deep understanding of the computational model upon which spreadsheet computations rest might not be the least issue. The pap... | arxiv | @article{hodnigg2008computational,
title={Computational Models of Spreadsheet Development: Basis for Educational
Approaches},
author={Karin Hodnigg, Markus Clermont, Roland T. Mittermeir},
journal={Proc. European Spreadsheet Risks Int. Grp. 2004 153-168 ISBN 1
902724 94 1},
year={2008},
archiveP... | hodnigg2008computational |
arxiv-2493 | 0801.4280 | Spreadsheet Debugging | <|reference_start|>Spreadsheet Debugging: Spreadsheet programs, artifacts developed by non-programmers, are used for a variety of important tasks and decisions. Yet a significant proportion of them have severe quality problems. To address this issue, our previous work presented an interval-based testing methodology for... | arxiv | @article{ayalew2008spreadsheet,
title={Spreadsheet Debugging},
author={Yirsaw Ayalew, Roland Mittermeir},
journal={Proc. European Spreadsheet Risks Int. Grp. 2003 67-79 ISBN 1 86166
199 1},
year={2008},
archivePrefix={arXiv},
eprint={0801.4280},
primaryClass={cs.SE cs.PL}
} | ayalew2008spreadsheet |
arxiv-2494 | 0801.4287 | Movie Recommendation Systems Using An Artificial Immune System | <|reference_start|>Movie Recommendation Systems Using An Artificial Immune System: We apply the Artificial Immune System (AIS) technology to the Collaborative Filtering (CF) technology when we build the movie recommendation system. Two different affinity measure algorithms of AIS, Kendall tau and Weighted Kappa, are us... | arxiv | @article{chen2008movie,
title={Movie Recommendation Systems Using An Artificial Immune System},
author={Qi Chen and Uwe Aickelin},
journal={6th International Conference in Adaptive Computing in Design and
Manufacture (ACDM 2004), Bristol, UK, 2004},
year={2008},
archivePrefix={arXiv},
eprint={... | chen2008movie |
arxiv-2495 | 0801.4292 | Exact Feasibility Tests for Real-Time Scheduling of Periodic Tasks upon Multiprocessor Platforms | <|reference_start|>Exact Feasibility Tests for Real-Time Scheduling of Periodic Tasks upon Multiprocessor Platforms: In this paper we study the global scheduling of periodic task systems upon multiprocessor platforms. We first show two very general properties which are well-known for uniprocessor platforms and which re... | arxiv | @article{cucu2008exact,
title={Exact Feasibility Tests for Real-Time Scheduling of Periodic Tasks upon
Multiprocessor Platforms},
author={Liliana Cucu and Jo"el Goossens},
journal={arXiv preprint arXiv:0801.4292},
year={2008},
archivePrefix={arXiv},
eprint={0801.4292},
primaryClass={cs.OS}... | cucu2008exact |
arxiv-2496 | 0801.4305 | Risk-Seeking versus Risk-Avoiding Investments in Noisy Periodic Environments | <|reference_start|>Risk-Seeking versus Risk-Avoiding Investments in Noisy Periodic Environments: We study the performance of various agent strategies in an artificial investment scenario. Agents are equipped with a budget, $x(t)$, and at each time step invest a particular fraction, $q(t)$, of their budget. The return o... | arxiv | @article{barrientos2008risk-seeking,
title={Risk-Seeking versus Risk-Avoiding Investments in Noisy Periodic
Environments},
author={J. Emeterio Navarro Barrientos, Frank E. Walter, Frank Schweitzer},
journal={International Journal of Modern Physics C vol. 19, no. 6 (2008)
971-994},
year={2008},
d... | barrientos2008risk-seeking |
arxiv-2497 | 0801.4307 | On Affinity Measures for Artificial Immune System Movie Recommenders | <|reference_start|>On Affinity Measures for Artificial Immune System Movie Recommenders: We combine Artificial Immune Systems 'AIS', technology with Collaborative Filtering 'CF' and use it to build a movie recommendation system. We already know that Artificial Immune Systems work well as movie recommenders from previou... | arxiv | @article{aickelin2008on,
title={On Affinity Measures for Artificial Immune System Movie Recommenders},
author={Uwe Aickelin and Qi Chen},
journal={Proceedings of the 5th International Conference on Recent Advances
in Soft Computing (RASC 2004), Nottingham, UK},
year={2008},
archivePrefix={arXiv},
... | aickelin2008on |
arxiv-2498 | 0801.4312 | Investigating Artificial Immune Systems For Job Shop Rescheduling In Changing Environments | <|reference_start|>Investigating Artificial Immune Systems For Job Shop Rescheduling In Changing Environments: Artificial immune system can be used to generate schedules in changing environments and it has been proven to be more robust than schedules developed using a genetic algorithm. Good schedules can be produced e... | arxiv | @article{aickelin2008investigating,
title={Investigating Artificial Immune Systems For Job Shop Rescheduling In
Changing Environments},
author={Uwe Aickelin, Edmund Burke and Aniza Din},
journal={6th International Conference in Adaptive Computing in Design and
Manufacture (ACDM 2004), Bristol, UK, 2004}... | aickelin2008investigating |
arxiv-2499 | 0801.4314 | Artificial Immune Systems (AIS) - A New Paradigm for Heuristic Decision Making | <|reference_start|>Artificial Immune Systems (AIS) - A New Paradigm for Heuristic Decision Making: Over the last few years, more and more heuristic decision making techniques have been inspired by nature, e.g. evolutionary algorithms, ant colony optimisation and simulated annealing. More recently, a novel computational... | arxiv | @article{aickelin2008artificial,
title={Artificial Immune Systems (AIS) - A New Paradigm for Heuristic Decision
Making},
author={Uwe Aickelin},
journal={Invited Keynote Talk, Annual Operational Research Conference 46,
York, UK, 2004},
year={2008},
archivePrefix={arXiv},
eprint={0801.4314},
... | aickelin2008artificial |
arxiv-2500 | 0801.4355 | TER: A Robot for Remote Ultrasonic Examination: Experimental Evaluations | <|reference_start|>TER: A Robot for Remote Ultrasonic Examination: Experimental Evaluations: This chapter: o Motivates the clinical use of robotic tele-echography o Introduces the TER system o Describes technical and clinical evaluations performed with TER<|reference_end|> | arxiv | @article{banihachemi2008ter:,
title={TER: A Robot for Remote Ultrasonic Examination: Experimental Evaluations},
author={Jean-Jacques Banihachemi (TIMC), Eric Boidard (TIMC), Jean-Luc Bosson
(TIMC, CHU-Grenoble CIC), Luc Bressollette, Ivan Bricault (TIMC, CHU-Grenoble
radio), Philippe Cinquin (TIMC), Gilbert... | banihachemi2008ter: |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.