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-2801 | 0802.3106 | Studies of Polymer Deformation and Recovery in Hot Embossing | <|reference_start|>Studies of Polymer Deformation and Recovery in Hot Embossing: In large area micro hot embossing, the process temperature plays a critical role to both the local fidelity of microstructure formation and global uniformity. The significance of low temperature hot embossing is to improve global flatness ... | arxiv | @article{shan2008studies,
title={Studies of Polymer Deformation and Recovery in Hot Embossing},
author={X. C. Shan, Y. C. Liu, H. J. Lu, Z. F. Wang, Y. C. Lam},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)},
year={2... | shan2008studies |
arxiv-2802 | 0802.3107 | Evaluation of the thermal and hydraulic performances of a very thin sintered copper flat heat pipe for 3D microsystem packages | <|reference_start|>Evaluation of the thermal and hydraulic performances of a very thin sintered copper flat heat pipe for 3D microsystem packages: The reported research work presents numerical studies validated by experimental results of a flat micro heat pipe with sintered copper wick structure. The objectives of this... | arxiv | @article{tzanova2008evaluation,
title={Evaluation of the thermal and hydraulic performances of a very thin
sintered copper flat heat pipe for 3D microsystem packages},
author={S. Tzanova, L. Kamenova, Y. Avenas, Ch. Schaeffer (CIME)},
journal={Dans Symposium on Design, Test, Integration and Packaging of
... | tzanova2008evaluation |
arxiv-2803 | 0802.3110 | An entropic view of Pickands' theorem | <|reference_start|>An entropic view of Pickands' theorem: It is shown that distributions arising in Renyi-Tsallis maximum entropy setting are related to the Generalized Pareto Distributions (GPD) that are widely used for modeling the tails of distributions. The relevance of such modelization, as well as the ubiquity of... | arxiv | @article{bercher2008an,
title={An entropic view of Pickands' theorem},
author={J.-F. Bercher and C. Vignat},
journal={arXiv preprint arXiv:0802.3110},
year={2008},
archivePrefix={arXiv},
eprint={0802.3110},
primaryClass={cs.IT math.IT}
} | bercher2008an |
arxiv-2804 | 0802.3137 | Design and Implementation of Aggregate Functions in the DLV System | <|reference_start|>Design and Implementation of Aggregate Functions in the DLV System: Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows for expressing every property of finite structures that is decidable in the complexity class SigmaP2 (= NP^NP). Despite this high expressiveness, there are... | arxiv | @article{faber2008design,
title={Design and Implementation of Aggregate Functions in the DLV System},
author={Wolfgang Faber, Gerald Pfeifer, Nicola Leone, Tina Dell'Armi, Giuseppe
Ielpa},
journal={arXiv preprint arXiv:0802.3137},
year={2008},
archivePrefix={arXiv},
eprint={0802.3137},
pri... | faber2008design |
arxiv-2805 | 0802.3235 | Characterization of the convergence of stationary Fokker-Planck learning | <|reference_start|>Characterization of the convergence of stationary Fokker-Planck learning: The convergence properties of the stationary Fokker-Planck algorithm for the estimation of the asymptotic density of stochastic search processes is studied. Theoretical and empirical arguments for the characterization of conver... | arxiv | @article{berrones2008characterization,
title={Characterization of the convergence of stationary Fokker-Planck learning},
author={Arturo Berrones},
journal={arXiv preprint arXiv:0802.3235},
year={2008},
doi={10.1016/j.neucom.2008.12.042},
archivePrefix={arXiv},
eprint={0802.3235},
primary... | berrones2008characterization |
arxiv-2806 | 0802.3253 | On the Capacity and Design of Limited Feedback Multiuser MIMO Uplinks | <|reference_start|>On the Capacity and Design of Limited Feedback Multiuser MIMO Uplinks: The theory of multiple-input multiple-output (MIMO) technology has been well-developed to increase fading channel capacity over single-input single-output (SISO) systems. This capacity gain can often be leveraged by utilizing chan... | arxiv | @article{kim2008on,
title={On the Capacity and Design of Limited Feedback Multiuser MIMO Uplinks},
author={Il Han Kim and David J. Love},
journal={arXiv preprint arXiv:0802.3253},
year={2008},
archivePrefix={arXiv},
eprint={0802.3253},
primaryClass={cs.IT cs.MM math.IT}
} | kim2008on |
arxiv-2807 | 0802.3254 | General Algorithms for Testing the Ambiguity of Finite Automata | <|reference_start|>General Algorithms for Testing the Ambiguity of Finite Automata: This paper presents efficient algorithms for testing the finite, polynomial, and exponential ambiguity of finite automata with $\epsilon$-transitions. It gives an algorithm for testing the exponential ambiguity of an automaton $A$ in ti... | arxiv | @article{allauzen2008general,
title={General Algorithms for Testing the Ambiguity of Finite Automata},
author={Cyril Allauzen and Mehryar Mohri and Ashish Rastogi},
journal={arXiv preprint arXiv:0802.3254},
year={2008},
archivePrefix={arXiv},
eprint={0802.3254},
primaryClass={cs.CC}
} | allauzen2008general |
arxiv-2808 | 0802.3267 | The Forgiving Tree: A Self-Healing Distributed Data Structure | <|reference_start|>The Forgiving Tree: A Self-Healing Distributed Data Structure: We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that the following process continues for up to n rounds where n is the total number of nodes initially i... | arxiv | @article{hayes2008the,
title={The Forgiving Tree: A Self-Healing Distributed Data Structure},
author={Tom Hayes and Navin Rustagi and Jared Saia and Amitabh Trehan},
journal={PODC '08: Proceedings of the twenty-seventh ACM symposium on
Principles of distributed computing. 2008, pages 203--212},
year={... | hayes2008the |
arxiv-2809 | 0802.3283 | An integrated model of traffic, geography and economy in the Internet | <|reference_start|>An integrated model of traffic, geography and economy in the Internet: Modeling Internet growth is important both for understanding the current network and to predict and improve its future. To date, Internet models have typically attempted to explain a subset of the following characteristics: networ... | arxiv | @article{holme2008an,
title={An integrated model of traffic, geography and economy in the Internet},
author={Petter Holme, Josh Karlin, Stephanie Forrest},
journal={ACM SIGCOMM Computer Communication Review 38, 7-15 (2008)},
year={2008},
archivePrefix={arXiv},
eprint={0802.3283},
primaryClas... | holme2008an |
arxiv-2810 | 0802.3284 | Tur\'an Graphs, Stability Number, and Fibonacci Index | <|reference_start|>Tur\'an Graphs, Stability Number, and Fibonacci Index: The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the stability numb... | arxiv | @article{bruyère2008tur\'an,
title={Tur\'an Graphs, Stability Number, and Fibonacci Index},
author={V'eronique Bruy`ere, and Hadrien M'elot},
journal={arXiv preprint arXiv:0802.3284},
year={2008},
doi={10.1007/978-3-540-85097-7_12},
archivePrefix={arXiv},
eprint={0802.3284},
primaryClass... | bruyère2008tur\'an |
arxiv-2811 | 0802.3285 | Some Aspects of Testing Process for Transport Streams in Digital Video Broadcasting | <|reference_start|>Some Aspects of Testing Process for Transport Streams in Digital Video Broadcasting: This paper presents some aspects related to the DVB (Digital Video Broadcasting) investigation. The basic aspects of DVB are presented, with an emphasis on DVB-T version of standard. The main purpose of this research... | arxiv | @article{arsinte2008some,
title={Some Aspects of Testing Process for Transport Streams in Digital Video
Broadcasting},
author={Radu Arsinte, Ciprian Ilioaei},
journal={Acta Technica Napocensis, Electronics and Telecommunications,
nr.1/2004 pp.59-74},
year={2008},
archivePrefix={arXiv},
eprin... | arsinte2008some |
arxiv-2812 | 0802.3288 | Implementing a Test Strategy for an Advanced Video Acquisition and Processing Architecture | <|reference_start|>Implementing a Test Strategy for an Advanced Video Acquisition and Processing Architecture: This paper presents some aspects related to test process of an advanced video system used in remote IP surveillance. The system is based on a Pentium compatible architecture using the industrial standard PC104... | arxiv | @article{arsinte2008implementing,
title={Implementing a Test Strategy for an Advanced Video Acquisition and
Processing Architecture},
author={Radu Arsinte},
journal={Acta Technica Napocensis, Electronics and Telecommunications,
nr.2/2005 pp.15-20},
year={2008},
archivePrefix={arXiv},
eprint=... | arsinte2008implementing |
arxiv-2813 | 0802.3293 | Use of Rapid Probabilistic Argumentation for Ranking on Large Complex Networks | <|reference_start|>Use of Rapid Probabilistic Argumentation for Ranking on Large Complex Networks: We introduce a family of novel ranking algorithms called ERank which run in linear/near linear time and build on explicitly modeling a network as uncertain evidence. The model uses Probabilistic Argumentation Systems (PAS... | arxiv | @article{cetin2008use,
title={Use of Rapid Probabilistic Argumentation for Ranking on Large Complex
Networks},
author={Burak Cetin, Haluk Bingol},
journal={arXiv preprint arXiv:0802.3293},
year={2008},
archivePrefix={arXiv},
eprint={0802.3293},
primaryClass={cs.AI cs.IR}
} | cetin2008use |
arxiv-2814 | 0802.3300 | Projective Expected Utility | <|reference_start|>Projective Expected Utility: Motivated by several classic decision-theoretic paradoxes, and by analogies with the paradoxes which in physics motivated the development of quantum mechanics, we introduce a projective generalization of expected utility along the lines of the quantum-mechanical generaliz... | arxiv | @article{la mura2008projective,
title={Projective Expected Utility},
author={Pierfrancesco La Mura},
journal={J. of Math. Psychology, 53:5 (2009)},
year={2008},
doi={10.1016/j.jmp.2009.02.001},
archivePrefix={arXiv},
eprint={0802.3300},
primaryClass={quant-ph cs.GT econ.TH}
} | la mura2008projective |
arxiv-2815 | 0802.3328 | An Algebraic Characterization of Security of Cryptographic Protocols | <|reference_start|>An Algebraic Characterization of Security of Cryptographic Protocols: Several of the basic cryptographic constructs have associated algebraic structures. Formal models proposed by Dolev and Yao to study the (unconditional) security of public key protocols form a group. The security of some types of p... | arxiv | @article{patra2008an,
title={An Algebraic Characterization of Security of Cryptographic Protocols},
author={Manas K Patra and Yan Zhang},
journal={arXiv preprint arXiv:0802.3328},
year={2008},
archivePrefix={arXiv},
eprint={0802.3328},
primaryClass={cs.CR}
} | patra2008an |
arxiv-2816 | 0802.3355 | PVM-Distributed Implementation of the Radiance Code | <|reference_start|>PVM-Distributed Implementation of the Radiance Code: The Parallel Virtual Machine (PVM) tool has been used for a distributed implementation of Greg Ward's Radiance code. In order to generate exactly the same primary rays with both the sequential and the parallel codes, the quincunx sampling technique... | arxiv | @article{villatoro2008pvm-distributed,
title={PVM-Distributed Implementation of the Radiance Code},
author={Francisco R. Villatoro, Antonio J. Nebro, and Jose E. Fern'andez},
journal={arXiv preprint arXiv:0802.3355},
year={2008},
archivePrefix={arXiv},
eprint={0802.3355},
primaryClass={cs.DC... | villatoro2008pvm-distributed |
arxiv-2817 | 0802.3401 | On the Structure of the Capacity Region of Asynchronous Memoryless Multiple-Access Channels | <|reference_start|>On the Structure of the Capacity Region of Asynchronous Memoryless Multiple-Access Channels: The asynchronous capacity region of memoryless multiple-access channels is the union of certain polytopes. It is well-known that vertices of such polytopes may be approached via a technique called successive ... | arxiv | @article{marina2008on,
title={On the Structure of the Capacity Region of Asynchronous Memoryless
Multiple-Access Channels},
author={Ninoslav Marina, Bixio Rimoldi},
journal={arXiv preprint arXiv:0802.3401},
year={2008},
doi={10.1109/TIT.2012.2191469},
archivePrefix={arXiv},
eprint={0802.34... | marina2008on |
arxiv-2818 | 0802.3414 | A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped Robots in a Quadratic Number of Moves | <|reference_start|>A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped Robots in a Quadratic Number of Moves: In the modular robot reconfiguration problem, we are given $n$ cube-shaped modules (or robots) as well as two configurations, i.e., placements of the $n$ modules so that their union is face-c... | arxiv | @article{abel2008a,
title={A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped
Robots in a Quadratic Number of Moves},
author={Zachary Abel, Hugo A. Akitaya, Scott Duke Kominers, Matias Korman,
Frederick Stock},
journal={arXiv preprint arXiv:0802.3414},
year={2008},
archivePre... | abel2008a |
arxiv-2819 | 0802.3419 | Randomized Frameproof Codes: Fingerprinting Plus Validation Minus Tracing | <|reference_start|>Randomized Frameproof Codes: Fingerprinting Plus Validation Minus Tracing: We propose randomized frameproof codes for content protection, which arise by studying a variation of the Boneh-Shaw fingerprinting problem. In the modified system, whenever a user tries to access his fingerprinted copy, the f... | arxiv | @article{anthapadmanabhan2008randomized,
title={Randomized Frameproof Codes: Fingerprinting Plus Validation Minus
Tracing},
author={N. Prasanth Anthapadmanabhan and Alexander Barg},
journal={arXiv preprint arXiv:0802.3419},
year={2008},
archivePrefix={arXiv},
eprint={0802.3419},
primaryCla... | anthapadmanabhan2008randomized |
arxiv-2820 | 0802.3429 | Quasi-Large Sparse-Sequence CDMA: Approach to Single-User Bound by Linearly-Complex LAS Detectors | <|reference_start|>Quasi-Large Sparse-Sequence CDMA: Approach to Single-User Bound by Linearly-Complex LAS Detectors: We have proposed a quasi-large random-sequence (QLRS) CDMA where K users access a point through a common channel with spectral spreading factor N. Each bit is extended by a temporal spreading factor B a... | arxiv | @article{sun2008quasi-large,
title={Quasi-Large Sparse-Sequence CDMA: Approach to Single-User Bound by
Linearly-Complex LAS Detectors},
author={Yi Sun},
journal={arXiv preprint arXiv:0802.3429},
year={2008},
archivePrefix={arXiv},
eprint={0802.3429},
primaryClass={cs.IT math.IT}
} | sun2008quasi-large |
arxiv-2821 | 0802.3430 | A Class of Nonbinary Codes and Their Weight Distribution | <|reference_start|>A Class of Nonbinary Codes and Their Weight Distribution: In this paper, for an even integer $n\geq 4$ and any positive integer $k$ with ${\rm gcd}(n/2,k)={\rm gcd}(n/2-k,2k)=d$ being odd, a class of $p$-ary codes $\mathcal{C}^k$ is defined and their weight distribution is completely determined, wher... | arxiv | @article{zeng2008a,
title={A Class of Nonbinary Codes and Their Weight Distribution},
author={Xiangyong Zeng, Nian Li, and Lei Hu},
journal={arXiv preprint arXiv:0802.3430},
year={2008},
archivePrefix={arXiv},
eprint={0802.3430},
primaryClass={cs.IT math.IT}
} | zeng2008a |
arxiv-2822 | 0802.3437 | On Cusick-Cheon's Conjecture About Balanced Boolean Functions in the Cosets of the Binary Reed-Muller Code | <|reference_start|>On Cusick-Cheon's Conjecture About Balanced Boolean Functions in the Cosets of the Binary Reed-Muller Code: It is proved an amplification of Cusick-Cheon's conjecture on balanced Boolean functions in the cosets of the binary Reed-Muller code RM(k,m) of order k and length 2^m, in the cases where k = 1... | arxiv | @article{borissov2008on,
title={On Cusick-Cheon's Conjecture About Balanced Boolean Functions in the
Cosets of the Binary Reed-Muller Code},
author={Yuri L. Borissov},
journal={arXiv preprint arXiv:0802.3437},
year={2008},
archivePrefix={arXiv},
eprint={0802.3437},
primaryClass={cs.IT math... | borissov2008on |
arxiv-2823 | 0802.3441 | Efficient implementation of GALS systems over commercial synchronous FPGAs: a new approach | <|reference_start|>Efficient implementation of GALS systems over commercial synchronous FPGAs: a new approach: The new vision presented is aimed to overcome the logic overhead issues that previous works exhibit when applying GALS techniques to programmable logic devices. The proposed new view relies in a 2-phase, bundl... | arxiv | @article{garcia-lasheras2008efficient,
title={Efficient implementation of GALS systems over commercial synchronous
FPGAs: a new approach},
author={Javier D. Garcia-Lasheras},
journal={"Implementacion eficiente de sistemas GALS sobre FPGAs", Jornadas
de Computacion Reconfigurable y Aplicaciones (JCRA'07)... | garcia-lasheras2008efficient |
arxiv-2824 | 0802.3444 | Automatic Verification of Correspondences for Security Protocols | <|reference_start|>Automatic Verification of Correspondences for Security Protocols: We present a new technique for verifying correspondences in security protocols. In particular, correspondences can be used to formalize authentication. Our technique is fully automatic, it can handle an unbounded number of sessions of ... | arxiv | @article{blanchet2008automatic,
title={Automatic Verification of Correspondences for Security Protocols},
author={Bruno Blanchet},
journal={arXiv preprint arXiv:0802.3444},
year={2008},
archivePrefix={arXiv},
eprint={0802.3444},
primaryClass={cs.CR cs.LO}
} | blanchet2008automatic |
arxiv-2825 | 0802.3448 | Sketch-Based Estimation of Subpopulation-Weight | <|reference_start|>Sketch-Based Estimation of Subpopulation-Weight: Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a predicate over records' attributes. Bottom-k sketches are a powerful summ... | arxiv | @article{cohen2008sketch-based,
title={Sketch-Based Estimation of Subpopulation-Weight},
author={Edith Cohen and Haim Kaplan},
journal={arXiv preprint arXiv:0802.3448},
year={2008},
archivePrefix={arXiv},
eprint={0802.3448},
primaryClass={cs.DB cs.DS cs.NI cs.PF}
} | cohen2008sketch-based |
arxiv-2826 | 0802.3457 | Spreadsheet Errors: What We Know What We Think We Can Do | <|reference_start|>Spreadsheet Errors: What We Know What We Think We Can Do: Fifteen years of research studies have concluded unanimously that spreadsheet errors are both common and non-trivial. Now we must seek ways to reduce spreadsheet errors. Several approaches have been suggested, some of which are promising and o... | arxiv | @article{panko2008spreadsheet,
title={Spreadsheet Errors: What We Know. What We Think We Can Do},
author={Raymond R. Panko},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2000 7-17
ISBN:1 86166 158 4},
year={2008},
archivePrefix={arXiv},
eprint={0802.3457},
primaryClass={cs... | panko2008spreadsheet |
arxiv-2827 | 0802.3473 | On Cobweb Posets and Discrete F-Boxes Tilings | <|reference_start|>On Cobweb Posets and Discrete F-Boxes Tilings: F-boxes defined in [6] as hyper-boxes in N^{\infty} discrete space were applied here for the geometric description of the cobweb posetes Hasse diagrams tilings. The F-boxes edges sizes are taken to be values of terms of natural numbers' valued sequence F... | arxiv | @article{dziemianczuk2008on,
title={On Cobweb Posets and Discrete F-Boxes Tilings},
author={M. Dziemianczuk},
journal={arXiv preprint arXiv:0802.3473},
year={2008},
archivePrefix={arXiv},
eprint={0802.3473},
primaryClass={math.CO cs.DM}
} | dziemianczuk2008on |
arxiv-2828 | 0802.3475 | Spreadsheet Development Methodologies using Resolver: Moving spreadsheets into the 21st Century | <|reference_start|>Spreadsheet Development Methodologies using Resolver: Moving spreadsheets into the 21st Century: We intend to demonstrate the innate problems with existing spreadsheet products and to show how to tackle these issues using a new type of spreadsheet program called Resolver. It addresses the issues head... | arxiv | @article{kemmis2008spreadsheet,
title={Spreadsheet Development Methodologies using Resolver: Moving
spreadsheets into the 21st Century},
author={Patrick Kemmis, Giles Thomas},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2007 93-104
ISBN 978-905617-58-6},
year={2008},
archivePre... | kemmis2008spreadsheet |
arxiv-2829 | 0802.3476 | Fun Boy Three Were Wrong: it is what you do, not the way that you do it | <|reference_start|>Fun Boy Three Were Wrong: it is what you do, not the way that you do it: I revisit some classic publications on modularity, to show what problems its pioneers wanted to solve. These problems occur with spreadsheets too: to recognise them may help us avoid them.<|reference_end|> | arxiv | @article{paine2008fun,
title={Fun Boy Three Were Wrong: it is what you do, not the way that you do it},
author={Jocelyn Paine},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2007 105-116
ISBN 978-905617-58-6},
year={2008},
archivePrefix={arXiv},
eprint={0802.3476},
primaryC... | paine2008fun |
arxiv-2830 | 0802.3477 | Concerning the Feasibility of Example-driven Modelling Techniques | <|reference_start|>Concerning the Feasibility of Example-driven Modelling Techniques: We report on a series of experiments concerning the feasibility of example driven modelling. The main aim was to establish experimentally within an academic environment: the relationship between error and task complexity using a) Trad... | arxiv | @article{thorne2008concerning,
title={Concerning the Feasibility of Example-driven Modelling Techniques},
author={Simon R. Thorne, David Ball, Z. Lawson},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2007 117-130
ISBN 978-905617-58-6},
year={2008},
archivePrefix={arXiv},
eprin... | thorne2008concerning |
arxiv-2831 | 0802.3478 | It Ain't What You View, But The Way That You View It: documenting spreadsheets with Excelsior, semantic wikis, and literate programming | <|reference_start|>It Ain't What You View, But The Way That You View It: documenting spreadsheets with Excelsior, semantic wikis, and literate programming: I describe preliminary experiments in documenting Excelsior versions of spreadsheets using semantic wikis and literate programming. The objective is to create well-... | arxiv | @article{paine2008it,
title={It Ain't What You View, But The Way That You View It: documenting
spreadsheets with Excelsior, semantic wikis, and literate programming},
author={Jocelyn Paine},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2007 131-142
ISBN 978-905617-58-6},
year={2008}... | paine2008it |
arxiv-2832 | 0802.3479 | An Empirical Study of End-User Behaviour in Spreadsheet Error Detection & Correction | <|reference_start|>An Empirical Study of End-User Behaviour in Spreadsheet Error Detection & Correction: Very little is known about the process by which end-user developers detect and correct spreadsheet errors. Any research pertaining to the development of spreadsheet testing methodologies or auditing tools would bene... | arxiv | @article{bishop2008an,
title={An Empirical Study of End-User Behaviour in Spreadsheet Error Detection
& Correction},
author={Brian Bishop, Kevin McDaid},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2007 165-176
ISBN 978-905617-58-6},
year={2008},
archivePrefix={arXiv},
epri... | bishop2008an |
arxiv-2833 | 0802.3480 | Why Task-Based Training is Superior to Traditional Training Methods | <|reference_start|>Why Task-Based Training is Superior to Traditional Training Methods: The risks of spreadsheet use do not just come from the misuse of formulae. As such, training needs to go beyond this technical aspect of spreadsheet use and look at the spreadsheet in its full business context. While standard traini... | arxiv | @article{mcguire2008why,
title={Why Task-Based Training is Superior to Traditional Training Methods},
author={Kath McGuire},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2007 191-196
ISBN 978-905617-58-6},
year={2008},
archivePrefix={arXiv},
eprint={0802.3480},
primaryClas... | mcguire2008why |
arxiv-2834 | 0802.3481 | Establishing A Minimum Generic Skill Set For Risk Management Teaching In A Spreadsheet Training Course | <|reference_start|>Establishing A Minimum Generic Skill Set For Risk Management Teaching In A Spreadsheet Training Course: Past research shows that spreadsheet models are prone to such a high frequency of errors and data security implications that the risk management of spreadsheet development and spreadsheet use is of... | arxiv | @article{chadwick2008establishing,
title={Establishing A Minimum Generic Skill Set For Risk Management Teaching In
A Spreadsheet Training Course},
author={David Chadwick},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2007 197-208
ISBN 978-905617-58-6},
year={2008},
archivePrefix... | chadwick2008establishing |
arxiv-2835 | 0802.3483 | Voice-controlled Debugging of Spreadsheets | <|reference_start|>Voice-controlled Debugging of Spreadsheets: Developments in Mobile Computing are putting pressure on the software industry to research new modes of interaction that do not rely on the traditional keyboard and mouse combination. Computer users suffering from Repetitive Strain Injury also seek an alter... | arxiv | @article{flood2008voice-controlled,
title={Voice-controlled Debugging of Spreadsheets},
author={Derek Flood, Kevin Mc Daid},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2007 155-164
ISBN 978-905617-58-6},
year={2008},
archivePrefix={arXiv},
eprint={0802.3483},
primaryClas... | flood2008voice-controlled |
arxiv-2836 | 0802.3490 | On capacity of wireless ad hoc networks with MIMO MMSE receivers | <|reference_start|>On capacity of wireless ad hoc networks with MIMO MMSE receivers: Widely adopted at home, business places, and hot spots, wireless ad-hoc networks are expected to provide broadband services parallel to their wired counterparts in near future. To address this need, MIMO techniques, which are capable o... | arxiv | @article{ma2008on,
title={On capacity of wireless ad hoc networks with MIMO MMSE receivers},
author={Jing Ma and Ying Jun Zhang},
journal={arXiv preprint arXiv:0802.3490},
year={2008},
archivePrefix={arXiv},
eprint={0802.3490},
primaryClass={cs.NI cs.IT math.IT}
} | ma2008on |
arxiv-2837 | 0802.3492 | The RDF Virtual Machine | <|reference_start|>The RDF Virtual Machine: The Resource Description Framework (RDF) is a semantic network data model that is used to create machine-understandable descriptions of the world and is the basis of the Semantic Web. This article discusses the application of RDF to the representation of computer software and... | arxiv | @article{rodriguez2008the,
title={The RDF Virtual Machine},
author={Marko A. Rodriguez},
journal={Knowledge-Based Systems, 24(6), 890-903, August 2011},
year={2008},
doi={10.1016/j.knosys.2011.04.004},
number={LA-UR-08-03925},
archivePrefix={arXiv},
eprint={0802.3492},
primaryClass={... | rodriguez2008the |
arxiv-2838 | 0802.3495 | Gaussian Interference Networks: Sum Capacity in the Low Interference Regime and New Outer Bounds on the Capacity Region | <|reference_start|>Gaussian Interference Networks: Sum Capacity in the Low Interference Regime and New Outer Bounds on the Capacity Region: Establishing the capacity region of a Gaussian interference network is an open problem in information theory. Recent progress on this problem has led to the characterization of the... | arxiv | @article{annapureddy2008gaussian,
title={Gaussian Interference Networks: Sum Capacity in the Low Interference
Regime and New Outer Bounds on the Capacity Region},
author={V. Sreekanth Annapureddy and Venugopal V. Veeravalli},
journal={arXiv preprint arXiv:0802.3495},
year={2008},
archivePrefix={ar... | annapureddy2008gaussian |
arxiv-2839 | 0802.3513 | The Complexity of Node Blocking for Dags | <|reference_start|>The Complexity of Node Blocking for Dags: We consider the following modification of annihilation game called node blocking. Given a directed graph, each vertex can be occupied by at most one token. There are two types of tokens, each player can move his type of tokens. The players alternate their mov... | arxiv | @article{dereniowski2008the,
title={The Complexity of Node Blocking for Dags},
author={Dariusz Dereniowski},
journal={Journal of Combinatorial Theory, Series A 118 (2011) 248-256},
year={2008},
doi={10.1016/j.jcta.2010.03.011},
archivePrefix={arXiv},
eprint={0802.3513},
primaryClass={cs.... | dereniowski2008the |
arxiv-2840 | 0802.3522 | Time Warp Edit Distance | <|reference_start|>Time Warp Edit Distance: This technical report details a family of time warp distances on the set of discrete time series. This family is constructed as an editing distance whose elementary operations apply on linear segments. A specific parameter allows controlling the stiffness of the elastic match... | arxiv | @article{marteau2008time,
title={Time Warp Edit Distance},
author={Pierre-Franc{c}ois Marteau (VALORIA)},
journal={arXiv preprint arXiv:0802.3522},
year={2008},
number={VALORIA.2008.1V5},
archivePrefix={arXiv},
eprint={0802.3522},
primaryClass={cs.IR}
} | marteau2008time |
arxiv-2841 | 0802.3528 | Wavelet and Curvelet Moments for Image Classification: Application to Aggregate Mixture Grading | <|reference_start|>Wavelet and Curvelet Moments for Image Classification: Application to Aggregate Mixture Grading: We show the potential for classifying images of mixtures of aggregate, based themselves on varying, albeit well-defined, sizes and shapes, in order to provide a far more effective approach compared to the... | arxiv | @article{murtagh2008wavelet,
title={Wavelet and Curvelet Moments for Image Classification: Application to
Aggregate Mixture Grading},
author={Fionn Murtagh and Jean-Luc Starck},
journal={Pattern Recognition Letters, 29, 1557-1564, 2008},
year={2008},
archivePrefix={arXiv},
eprint={0802.3528},
... | murtagh2008wavelet |
arxiv-2842 | 0802.3535 | Approximate Capacity of Gaussian Relay Networks | <|reference_start|>Approximate Capacity of Gaussian Relay Networks: We present an achievable rate for general Gaussian relay networks. We show that the achievable rate is within a constant number of bits from the information-theoretic cut-set upper bound on the capacity of these networks. This constant depends on the t... | arxiv | @article{avestimehr2008approximate,
title={Approximate Capacity of Gaussian Relay Networks},
author={Amir Salman Avestimehr, Suhas N. Diggavi and David N C. Tse},
journal={arXiv preprint arXiv:0802.3535},
year={2008},
doi={10.1109/ISIT.2008.4595031},
archivePrefix={arXiv},
eprint={0802.3535}... | avestimehr2008approximate |
arxiv-2843 | 0802.3554 | Data Traffic Dynamics and Saturation on a Single Link | <|reference_start|>Data Traffic Dynamics and Saturation on a Single Link: The dynamics of User Datagram Protocol (UDP) traffic over Ethernet between two computers are analyzed using nonlinear dynamics which shows that there are two clear regimes in the data flow: free flow and saturated. The two most important variable... | arxiv | @article{smith2008data,
title={Data Traffic Dynamics and Saturation on a Single Link},
author={Reginald D. Smith},
journal={International Journal of Computer, Information, and Systems
Science, and Engineering, vol 3, no. 1, 11-16 2009},
year={2008},
archivePrefix={arXiv},
eprint={0802.3554},
... | smith2008data |
arxiv-2844 | 0802.3563 | Distributed Sensor Localization in Random Environments using Minimal Number of Anchor Nodes | <|reference_start|>Distributed Sensor Localization in Random Environments using Minimal Number of Anchor Nodes: The paper develops DILOC, a \emph{distributive}, \emph{iterative} algorithm that locates M sensors in $\mathbb{R}^m, m\geq 1$, with respect to a minimal number of m+1 anchors with known locations. The sensors... | arxiv | @article{khan2008distributed,
title={Distributed Sensor Localization in Random Environments using Minimal
Number of Anchor Nodes},
author={Usman A. Khan, Soummya Kar, and Jose' M. F. Moura},
journal={U. A. Khan, S. Kar, and J. M. F. Moura, "Distributed sensor
localization in random environments using mi... | khan2008distributed |
arxiv-2845 | 0802.3569 | Delay Analysis for Wireless Local Area Networks with Multipacket Reception under Finite Load | <|reference_start|>Delay Analysis for Wireless Local Area Networks with Multipacket Reception under Finite Load: To date, most analysis of WLANs has been focused on their operation under saturation condition. This work is an attempt to understand the fundamental performance of WLANs under unsaturated condition. In part... | arxiv | @article{zhang2008delay,
title={Delay Analysis for Wireless Local Area Networks with Multipacket
Reception under Finite Load},
author={Ying Jun Zhang, Soung Chang Liew, and Darui Chen},
journal={arXiv preprint arXiv:0802.3569},
year={2008},
archivePrefix={arXiv},
eprint={0802.3569},
primar... | zhang2008delay |
arxiv-2846 | 0802.3570 | Asymptotic Behaviour of Random Vandermonde Matrices with Entries on the Unit Circle | <|reference_start|>Asymptotic Behaviour of Random Vandermonde Matrices with Entries on the Unit Circle: Analytical methods for finding moments of random Vandermonde matrices with entries on the unit circle are developed. Vandermonde Matrices play an important role in signal processing and wireless applications such as ... | arxiv | @article{ryan2008asymptotic,
title={Asymptotic Behaviour of Random Vandermonde Matrices with Entries on the
Unit Circle},
author={{O}yvind Ryan, Merouane Debbah},
journal={arXiv preprint arXiv:0802.3570},
year={2008},
archivePrefix={arXiv},
eprint={0802.3570},
primaryClass={cs.IT math.IT}
... | ryan2008asymptotic |
arxiv-2847 | 0802.3572 | Random Vandermonde Matrices-Part II: Applications | <|reference_start|>Random Vandermonde Matrices-Part II: Applications: This paper has been withdrawn by the authors, since it has been merged with Part I (ID 0802.3570)<|reference_end|> | arxiv | @article{ryan2008random,
title={Random Vandermonde Matrices-Part II: Applications},
author={{O}yvind Ryan, Merouane Debbah},
journal={arXiv preprint arXiv:0802.3572},
year={2008},
archivePrefix={arXiv},
eprint={0802.3572},
primaryClass={cs.IT math.IT}
} | ryan2008random |
arxiv-2848 | 0802.3582 | Neural Networks and Database Systems | <|reference_start|>Neural Networks and Database Systems: Object-oriented database systems proved very valuable at handling and administrating complex objects. In the following guidelines for embedding neural networks into such systems are presented. It is our goal to treat networks as normal data in the database system... | arxiv | @article{schikuta2008neural,
title={Neural Networks and Database Systems},
author={Erich Schikuta},
journal={pp. 133-152, 2007, publisher Austrian Computer Society},
year={2008},
archivePrefix={arXiv},
eprint={0802.3582},
primaryClass={cs.DB cs.NE}
} | schikuta2008neural |
arxiv-2849 | 0802.3597 | Processing Information in Quantum Decision Theory | <|reference_start|>Processing Information in Quantum Decision Theory: A survey is given summarizing the state of the art of describing information processing in Quantum Decision Theory, which has been recently advanced as a novel variant of decision making, based on the mathematical theory of separable Hilbert spaces. ... | arxiv | @article{yukalov2008processing,
title={Processing Information in Quantum Decision Theory},
author={V.I. Yukalov and D. Sornette},
journal={Entropy 11 (2009) 1073-1120},
year={2008},
doi={10.3390/e11041073},
archivePrefix={arXiv},
eprint={0802.3597},
primaryClass={physics.soc-ph cs.AI qua... | yukalov2008processing |
arxiv-2850 | 0802.3611 | Power Allocation for Fading Channels with Peak-to-Average Power Constraints | <|reference_start|>Power Allocation for Fading Channels with Peak-to-Average Power Constraints: Power allocation with peak-to-average power ratio constraints is investigated for transmission over Nakagami-m fading channels with arbitrary input distributions. In the case of delay-limited block-fading channels, we find t... | arxiv | @article{nguyen2008power,
title={Power Allocation for Fading Channels with Peak-to-Average Power
Constraints},
author={Khoa D. Nguyen, Albert Guillen i Fabregas, Lars K. Rasmussen},
journal={arXiv preprint arXiv:0802.3611},
year={2008},
archivePrefix={arXiv},
eprint={0802.3611},
primaryCla... | nguyen2008power |
arxiv-2851 | 0802.3617 | Towards a formalization of budgets | <|reference_start|>Towards a formalization of budgets: We go into the need for, and the requirements on, a formal theory of budgets. We present a simple algebraic theory of rational budgets, i.e., budgets in which amounts of money are specified by functions on the rational numbers. This theory is based on the tuplix ca... | arxiv | @article{bergstra2008towards,
title={Towards a formalization of budgets},
author={Jan A. Bergstra, Sanne Nolst Trenit'e, Mark B. van der Zwaag},
journal={arXiv preprint arXiv:0802.3617},
year={2008},
number={PRG0712},
archivePrefix={arXiv},
eprint={0802.3617},
primaryClass={cs.LO}
} | bergstra2008towards |
arxiv-2852 | 0802.3626 | Color Graphs: An Efficient Model For Two-Dimensional Cellular Automata Linear Rules | <|reference_start|>Color Graphs: An Efficient Model For Two-Dimensional Cellular Automata Linear Rules: Two-dimensional nine neighbor hood rectangular Cellular Automata rules can be modeled using many different techniques like Rule matrices, State Transition Diagrams, Boolean functions, Algebraic Normal Form etc. In th... | arxiv | @article{nayak2008color,
title={Color Graphs: An Efficient Model For Two-Dimensional Cellular Automata
Linear Rules},
author={Birendra Kumar Nayak, Sudhakar Sahoo, Sushant Kumar Rout},
journal={arXiv preprint arXiv:0802.3626},
year={2008},
archivePrefix={arXiv},
eprint={0802.3626},
primary... | nayak2008color |
arxiv-2853 | 0802.3627 | Clusters of solutions and replica symmetry breaking in random k-satisfiability | <|reference_start|>Clusters of solutions and replica symmetry breaking in random k-satisfiability: We study the set of solutions of random k-satisfiability formulae through the cavity method. It is known that, for an interval of the clause-to-variables ratio, this decomposes into an exponential number of pure states (c... | arxiv | @article{montanari2008clusters,
title={Clusters of solutions and replica symmetry breaking in random
k-satisfiability},
author={Andrea Montanari, Federico Ricci-Tersenghi, Guilhem Semerjian},
journal={J. Stat. Mech. P04004 (2008)},
year={2008},
doi={10.1088/1742-5468/2008/04/P04004},
archivePr... | montanari2008clusters |
arxiv-2854 | 0802.3628 | Dynamic data models: an application of MOP-based persistence in Common Lisp | <|reference_start|>Dynamic data models: an application of MOP-based persistence in Common Lisp: The data model of an application, the nature and format of data stored across executions, is typically a very rigid part of its early specification, even when prototyping, and changing it after code that relies on it was wri... | arxiv | @article{thierry2008dynamic,
title={Dynamic data models: an application of MOP-based persistence in Common
Lisp},
author={Pierre Thierry and Simon E. B. Thierry},
journal={arXiv preprint arXiv:0802.3628},
year={2008},
archivePrefix={arXiv},
eprint={0802.3628},
primaryClass={cs.SE}
} | thierry2008dynamic |
arxiv-2855 | 0802.3634 | Local Information Based Algorithms for Packet Transport in Complex Networks | <|reference_start|>Local Information Based Algorithms for Packet Transport in Complex Networks: We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node, the number of packets posted down each edge, the mea... | arxiv | @article{kujawski2008local,
title={Local Information Based Algorithms for Packet Transport in Complex
Networks},
author={B. Kujawski, G.J. Rodgers, and Bosiljka Tadi'c},
journal={In V.N. Alexnandrov et l., editor, ICCS 2006, volume \textbf{3993}
of Lecture Notes in Computer Science, pages 1024-1031, Ber... | kujawski2008local |
arxiv-2856 | 0802.3665 | Outward Accessibility in Urban Street Networks: Characterization and Improvements | <|reference_start|>Outward Accessibility in Urban Street Networks: Characterization and Improvements: The dynamics of transportation through towns and cities is strongly affected by the topology of the connections and routes. The current work describes an approach combining complex networks and self-avoiding random wal... | arxiv | @article{travençolo2008outward,
title={Outward Accessibility in Urban Street Networks: Characterization and
Improvements},
author={Bruno Augusto Nassif Travenc{c}olo and Luciano da Fontoura Costa},
journal={arXiv preprint arXiv:0802.3665},
year={2008},
archivePrefix={arXiv},
eprint={0802.3665}... | travençolo2008outward |
arxiv-2857 | 0802.3703 | On incidence algebras description of cobweb posets | <|reference_start|>On incidence algebras description of cobweb posets: The explicite formulas for Mobius function and some other important elements of the incidence algebra of an arbitrary cobweb poset are delivered. For that to do one uses Kwasniewski's construction of his cobweb posets . The digraph representation of... | arxiv | @article{krot-sieniawska2008on,
title={On incidence algebras description of cobweb posets},
author={Ewa Krot-Sieniawska},
journal={arXiv preprint arXiv:0802.3703},
year={2008},
archivePrefix={arXiv},
eprint={0802.3703},
primaryClass={math.CO cs.DM}
} | krot-sieniawska2008on |
arxiv-2858 | 0802.3718 | Preventing Coordinated Attacks Via Distributed Alert Exchange | <|reference_start|>Preventing Coordinated Attacks Via Distributed Alert Exchange: Attacks on information systems followed by intrusions may cause large revenue losses. The prevention of both is not always possible by just considering information from isolated sources of the network. A global view of the whole system is... | arxiv | @article{garcia-alfaro2008preventing,
title={Preventing Coordinated Attacks Via Distributed Alert Exchange},
author={Joaquin Garcia-Alfaro, Michael A. Jaeger, Gero Muehl, and Joan Borrell},
journal={IFIP International Conference on Intelligence in Communication
Systems (INTELLCOMM 2005) (17/10/2005) 87-98... | garcia-alfaro2008preventing |
arxiv-2859 | 0802.3734 | Generic case complexity and One-Way functions | <|reference_start|>Generic case complexity and One-Way functions: The goal of this paper is to introduce ideas and methodology of the generic case complexity to cryptography community. This relatively new approach allows one to analyze the behavior of an algorithm on ''most'' inputs in a simple and intuitive fashion wh... | arxiv | @article{myasnikov2008generic,
title={Generic case complexity and One-Way functions},
author={Alex D. Myasnikov},
journal={arXiv preprint arXiv:0802.3734},
year={2008},
archivePrefix={arXiv},
eprint={0802.3734},
primaryClass={cs.CC cs.CR}
} | myasnikov2008generic |
arxiv-2860 | 0802.3746 | Information Hiding Techniques: A Tutorial Review | <|reference_start|>Information Hiding Techniques: A Tutorial Review: The purpose of this tutorial is to present an overview of various information hiding techniques. A brief history of steganography is provided along with techniques that were used to hide information. Text, image and audio based information hiding tech... | arxiv | @article{thampi2008information,
title={Information Hiding Techniques: A Tutorial Review},
author={Sabu M. Thampi},
journal={arXiv preprint arXiv:0802.3746},
year={2008},
archivePrefix={arXiv},
eprint={0802.3746},
primaryClass={cs.CR cs.IR}
} | thampi2008information |
arxiv-2861 | 0802.3767 | Architecture for Integrated Mems Resonators Quality Factor Measurement | <|reference_start|>Architecture for Integrated Mems Resonators Quality Factor Measurement: In this paper, an architecture designed for electrical measurement of the quality factor of MEMS resonators is proposed. An estimation of the measurement performance is made using PSPICE simulations taking into account the compon... | arxiv | @article{mathias2008architecture,
title={Architecture for Integrated Mems Resonators Quality Factor Measurement},
author={H. Mathias (IEF), F. Parrain (IEF), J.-P. Gilles (IEF), S. Megherbi
(IEF), M. Zhang (IEF), Ph. Coste (IEF), A. Dupret (IEF)},
journal={Dans Symposium on Design, Test, Integration and P... | mathias2008architecture |
arxiv-2862 | 0802.3768 | Optimization of Cricket-inspired, Biomimetic Artificial Hair Sensors for Flow Sensing | <|reference_start|>Optimization of Cricket-inspired, Biomimetic Artificial Hair Sensors for Flow Sensing: High density arrays of artificial hair sensors, biomimicking the extremely sensitive mechanoreceptive filiform hairs found on cerci of crickets have been fabricated successfully. We assess the sensitivity of these ... | arxiv | @article{izadi2008optimization,
title={Optimization of Cricket-inspired, Biomimetic Artificial Hair Sensors for
Flow Sensing},
author={N. Izadi, R. K. Jaganatharaja, J. Floris, G. Krijnen},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggior... | izadi2008optimization |
arxiv-2863 | 0802.3784 | Pattern-Oriented Analysis and Design (POAD) Theory | <|reference_start|>Pattern-Oriented Analysis and Design (POAD) Theory: Pattern-Oriented Analysis and Design (POAD) is the practice of building complex software by applying proven designs to specific problem domains. Although a great deal of research and practice has been devoted to formalizing existing design patterns ... | arxiv | @article{overton2008pattern-oriented,
title={Pattern-Oriented Analysis and Design (POAD) Theory},
author={Jerry Overton},
journal={arXiv preprint arXiv:0802.3784},
year={2008},
archivePrefix={arXiv},
eprint={0802.3784},
primaryClass={cs.SE cs.IT math.IT}
} | overton2008pattern-oriented |
arxiv-2864 | 0802.3789 | Knowledge Technologies | <|reference_start|>Knowledge Technologies: Several technologies are emerging that provide new ways to capture, store, present and use knowledge. This book is the first to provide a comprehensive introduction to five of the most important of these technologies: Knowledge Engineering, Knowledge Based Engineering, Knowled... | arxiv | @article{milton2008knowledge,
title={Knowledge Technologies},
author={Nick Milton},
journal={"Publishing studies" book series, edited by Giandomenico Sica,
ISSN 1973-6061 (Printed edition), ISSN 1973-6053 (Electronic edition)},
year={2008},
archivePrefix={arXiv},
eprint={0802.3789},
primar... | milton2008knowledge |
arxiv-2865 | 0802.3820 | On the Kuratowski graph planarity criterion | <|reference_start|>On the Kuratowski graph planarity criterion: This paper is purely expositional. The statement of the Kuratowski graph planarity criterion is simple and well-known. However, its classical proof is not easy. In this paper we present the Makarychev proof (with further simplifications by Prasolov, Telish... | arxiv | @article{skopenkov2008on,
title={On the Kuratowski graph planarity criterion},
author={A. Skopenkov},
journal={Mat. Prosveschenie, 9 (2005), 116-128, and 11 (2007), 159--160},
year={2008},
archivePrefix={arXiv},
eprint={0802.3820},
primaryClass={math.GT cs.DM math.CO}
} | skopenkov2008on |
arxiv-2866 | 0802.3851 | Joint Source Channel Coding with Side Information Using Hybrid Digital Analog Codes | <|reference_start|>Joint Source Channel Coding with Side Information Using Hybrid Digital Analog Codes: We study the joint source channel coding problem of transmitting an analog source over a Gaussian channel in two cases - (i) the presence of interference known only to the transmitter and (ii) in the presence of side... | arxiv | @article{wilson2008joint,
title={Joint Source Channel Coding with Side Information Using Hybrid Digital
Analog Codes},
author={Makesh Pravin Wilson, Krishna Narayanan and Giuseppe Caire},
journal={arXiv preprint arXiv:0802.3851},
year={2008},
archivePrefix={arXiv},
eprint={0802.3851},
prim... | wilson2008joint |
arxiv-2867 | 0802.3855 | The Discrete Hilbert Transform for Non-Periodic Signals | <|reference_start|>The Discrete Hilbert Transform for Non-Periodic Signals: This note investigates the size of the guard band for non-periodic discrete Hilbert transform, which has recently been proposed for data hiding and security applications. It is shown that a guard band equal to the duration of the message is suf... | arxiv | @article{gangasani2008the,
title={The Discrete Hilbert Transform for Non-Periodic Signals},
author={Sumanth Kumar Reddy Gangasani},
journal={arXiv preprint arXiv:0802.3855},
year={2008},
archivePrefix={arXiv},
eprint={0802.3855},
primaryClass={cs.CR}
} | gangasani2008the |
arxiv-2868 | 0802.3860 | Separating NOF communication complexity classes RP and NP | <|reference_start|>Separating NOF communication complexity classes RP and NP: We provide a non-explicit separation of the number-on-forehead communication complexity classes RP and NP when the number of players is up to \delta log(n) for any \delta<1. Recent lower bounds on Set-Disjointness [LS08,CA08] provide an expli... | arxiv | @article{david2008separating,
title={Separating NOF communication complexity classes RP and NP},
author={Matei David and Toniann Pitassi},
journal={arXiv preprint arXiv:0802.3860},
year={2008},
archivePrefix={arXiv},
eprint={0802.3860},
primaryClass={cs.CC}
} | david2008separating |
arxiv-2869 | 0802.3875 | Are complex systems hard to evolve? | <|reference_start|>Are complex systems hard to evolve?: Evolutionary complexity is here measured by the number of trials/evaluations needed for evolving a logical gate in a non-linear medium. Behavioural complexity of the gates evolved is characterised in terms of cellular automata behaviour. We speculate that hierarch... | arxiv | @article{adamatzky2008are,
title={Are complex systems hard to evolve?},
author={Andy Adamatzky and Larry Bull},
journal={Volume 14, Issue 6, pages 15-20, July/August 2009},
year={2008},
doi={10.1002/cplx.20269},
archivePrefix={arXiv},
eprint={0802.3875},
primaryClass={cs.NE}
} | adamatzky2008are |
arxiv-2870 | 0802.3881 | Deriving Sorting Algorithms | <|reference_start|>Deriving Sorting Algorithms: This paper proposes new derivations of three well-known sorting algorithms, in their functional formulation. The approach we use is based on three main ingredients: first, the algorithms are derived from a simpler algorithm, i.e. the specification is already a solution to... | arxiv | @article{almeida2008deriving,
title={Deriving Sorting Algorithms},
author={Jos'e Bacelar Almeida, Jorge Sousa Pinto},
journal={arXiv preprint arXiv:0802.3881},
year={2008},
number={DI-PURe-06.04.01},
archivePrefix={arXiv},
eprint={0802.3881},
primaryClass={cs.DS cs.LO}
} | almeida2008deriving |
arxiv-2871 | 0802.3885 | Rich, Sturmian, and trapezoidal words | <|reference_start|>Rich, Sturmian, and trapezoidal words: In this paper we explore various interconnections between rich words, Sturmian words, and trapezoidal words. Rich words, first introduced in arXiv:0801.1656 by the second and third authors together with J. Justin and S. Widmer, constitute a new class of finite a... | arxiv | @article{de luca2008rich,,
title={Rich, Sturmian, and trapezoidal words},
author={Aldo de Luca, Amy Glen, Luca Q. Zamboni},
journal={Theoretical Computer Science 407 (2008) 569--573},
year={2008},
doi={10.1016/j.tcs.2008.06.009},
archivePrefix={arXiv},
eprint={0802.3885},
primaryClass={m... | de luca2008rich, |
arxiv-2872 | 0802.3888 | Directive words of episturmian words: equivalences and normalization | <|reference_start|>Directive words of episturmian words: equivalences and normalization: Episturmian morphisms constitute a powerful tool to study episturmian words. Indeed, any episturmian word can be infinitely decomposed over the set of pure episturmian morphisms. Thus, an episturmian word can be defined by one of i... | arxiv | @article{glen2008directive,
title={Directive words of episturmian words: equivalences and normalization},
author={Amy Glen, Florence Lev'e, Gw'ena"el Richomme},
journal={RAIRO - Theoretical Informatics and Applications 43 (2009) 299-319},
year={2008},
doi={10.1051/ita:2008029},
archivePrefix={ar... | glen2008directive |
arxiv-2873 | 0802.3895 | Complexity Metrics for Spreadsheet Models | <|reference_start|>Complexity Metrics for Spreadsheet Models: Several complexity metrics are described which are related to logic structure, data structure and size of spreadsheet models. They primarily concentrate on the dispersion of cell references and cell paths. Most metrics are newly defined, while some are adapt... | arxiv | @article{bregar2008complexity,
title={Complexity Metrics for Spreadsheet Models},
author={Andrej Bregar},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2004 85-93
ISBN 1 902724 94 1},
year={2008},
archivePrefix={arXiv},
eprint={0802.3895},
primaryClass={cs.SE}
} | bregar2008complexity |
arxiv-2874 | 0802.3919 | A Paradigm for Spreadsheet Engineering Methodologies | <|reference_start|>A Paradigm for Spreadsheet Engineering Methodologies: Spreadsheet engineering methodologies are diverse and sometimes contradictory. It is difficult for spreadsheet developers to identify a spreadsheet engineering methodology that is appropriate for their class of spreadsheet, with its unique combina... | arxiv | @article{grossman2008a,
title={A Paradigm for Spreadsheet Engineering Methodologies},
author={Thomas A. Grossman, Ozgur Ozluk},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2004 23-33
ISBN 1 902724 94 1},
year={2008},
archivePrefix={arXiv},
eprint={0802.3919},
primaryClass... | grossman2008a |
arxiv-2875 | 0802.3924 | A Toolkit for Scalable Spreadsheet Visualization | <|reference_start|>A Toolkit for Scalable Spreadsheet Visualization: This paper presents a toolkit for spreadsheet visualization based on logical areas, semantic classes and data modules. Logical areas, semantic classes and data modules are abstract representations of spreadsheet programs that are meant to reduce the a... | arxiv | @article{clermont2008a,
title={A Toolkit for Scalable Spreadsheet Visualization},
author={Markus Clermont},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2004 95-106
ISBN 1 902724 94 1},
year={2008},
archivePrefix={arXiv},
eprint={0802.3924},
primaryClass={cs.HC}
} | clermont2008a |
arxiv-2876 | 0802.3939 | Using Layout Information for Spreadsheet Visualization | <|reference_start|>Using Layout Information for Spreadsheet Visualization: This paper extends a spreadsheet visualization technique by using layout information. The original approach identifies logically or semantically related cells by relying exclusively on the content of cells for identifying semantic classes. A dis... | arxiv | @article{hipfl2008using,
title={Using Layout Information for Spreadsheet Visualization},
author={Sabine Hipfl},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2004 107-119
ISBN 1 902724 94 1},
year={2008},
archivePrefix={arXiv},
eprint={0802.3939},
primaryClass={cs.HC}
} | hipfl2008using |
arxiv-2877 | 0802.3940 | Spreadsheet Structure Discovery with Logic Programming | <|reference_start|>Spreadsheet Structure Discovery with Logic Programming: Our term "structure discovery" denotes the recovery of structure, such as the grouping of cells, that was intended by a spreadsheet's author but is not explicit in the spreadsheet. We are implementing structure discovery tools in the logic-progr... | arxiv | @article{paine2008spreadsheet,
title={Spreadsheet Structure Discovery with Logic Programming},
author={Jocelyn Paine},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2004 121-133
ISBN 1 902724 94 1},
year={2008},
archivePrefix={arXiv},
eprint={0802.3940},
primaryClass={cs.SE... | paine2008spreadsheet |
arxiv-2878 | 0802.3950 | Belief Propagation and Loop Series on Planar Graphs | <|reference_start|>Belief Propagation and Loop Series on Planar Graphs: We discuss a generic model of Bayesian inference with binary variables defined on edges of a planar graph. The Loop Calculus approach of [1, 2] is used to evaluate the resulting series expansion for the partition function. We show that, for planar ... | arxiv | @article{chertkov2008belief,
title={Belief Propagation and Loop Series on Planar Graphs},
author={Michael Chertkov, Vladimir Y. Chernyak and Razvan Teodorescu},
journal={J. Stat. Mech. (2008) P05003},
year={2008},
doi={10.1088/1742-5468/2008/05/P05003},
archivePrefix={arXiv},
eprint={0802.39... | chertkov2008belief |
arxiv-2879 | 0802.3974 | Syntax diagrams as a formalism for representation of syntactic relations of formal languages | <|reference_start|>Syntax diagrams as a formalism for representation of syntactic relations of formal languages: The new approach to representation of syntax of formal languages-- a formalism of syntax diagrams is offered. Syntax diagrams look a convenient language for the description of syntactic relations in the lang... | arxiv | @article{lapshin2008syntax,
title={Syntax diagrams as a formalism for representation of syntactic relations
of formal languages},
author={Vladimir Lapshin},
journal={arXiv preprint arXiv:0802.3974},
year={2008},
archivePrefix={arXiv},
eprint={0802.3974},
primaryClass={cs.LO}
} | lapshin2008syntax |
arxiv-2880 | 0802.3992 | Polynomial Filtering for Fast Convergence in Distributed Consensus | <|reference_start|>Polynomial Filtering for Fast Convergence in Distributed Consensus: In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods proposed in the literature address the consensus averaging problem by ... | arxiv | @article{kokiopoulou2008polynomial,
title={Polynomial Filtering for Fast Convergence in Distributed Consensus},
author={Effrosyni Kokiopoulou and Pascal Frossard},
journal={arXiv preprint arXiv:0802.3992},
year={2008},
doi={10.1109/TSP.2008.2006147},
number={LTS-2008-005},
archivePrefix={arX... | kokiopoulou2008polynomial |
arxiv-2881 | 0802.4002 | Sensing Danger: Innate Immunology for Intrusion Detection | <|reference_start|>Sensing Danger: Innate Immunology for Intrusion Detection: The immune system provides an ideal metaphor for anomaly detection in general and computer security in particular. Based on this idea, artificial immune systems have been used for a number of years for intrusion detection, unfortunately so fa... | arxiv | @article{aickelin2008sensing,
title={Sensing Danger: Innate Immunology for Intrusion Detection},
author={Uwe Aickelin and Julie Greensmith},
journal={Information Security Technical Report, 12(4), pp 218-227, 2007},
year={2008},
doi={10.1016/j.istr.2007.10.003},
archivePrefix={arXiv},
eprint=... | aickelin2008sensing |
arxiv-2882 | 0802.4010 | Brain architecture: A design for natural computation | <|reference_start|>Brain architecture: A design for natural computation: Fifty years ago, John von Neumann compared the architecture of the brain with that of computers that he invented and which is still in use today. In those days, the organisation of computers was based on concepts of brain organisation. Here, we gi... | arxiv | @article{kaiser2008brain,
title={Brain architecture: A design for natural computation},
author={Marcus Kaiser},
journal={Philosophical Transactions of The Royal Society A, 365: 3033-3045,
2007},
year={2008},
doi={10.1098/rsta.2007.0007},
archivePrefix={arXiv},
eprint={0802.4010},
prima... | kaiser2008brain |
arxiv-2883 | 0802.4018 | Algebraic Pattern Matching in Join Calculus | <|reference_start|>Algebraic Pattern Matching in Join Calculus: We propose an extension of the join calculus with pattern matching on algebraic data types. Our initial motivation is twofold: to provide an intuitive semantics of the interaction between concurrency and pattern matching; to define a practical compilation ... | arxiv | @article{ma2008algebraic,
title={Algebraic Pattern Matching in Join Calculus},
author={Qin Ma and Luc Maranget},
journal={Logical Methods in Computer Science, Volume 4, Issue 1 (March 21,
2008) lmcs:770},
year={2008},
doi={10.2168/LMCS-4(1:7)2008},
archivePrefix={arXiv},
eprint={0802.4018}... | ma2008algebraic |
arxiv-2884 | 0802.4040 | Analysis of the Karmarkar-Karp Differencing Algorithm | <|reference_start|>Analysis of the Karmarkar-Karp Differencing Algorithm: The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and statistical physics. We analyze the performance of the differencing al... | arxiv | @article{boettcher2008analysis,
title={Analysis of the Karmarkar-Karp Differencing Algorithm},
author={Stefan Boettcher, Stephan Mertens},
journal={European Physics Journal B 65, 131-140 (2008)},
year={2008},
doi={10.1140/epjb/e2008-00320-9},
archivePrefix={arXiv},
eprint={0802.4040},
pr... | boettcher2008analysis |
arxiv-2885 | 0802.4057 | A Qualitative Modal Representation of Quantum Register Transformations | <|reference_start|>A Qualitative Modal Representation of Quantum Register Transformations: We introduce two modal natural deduction systems that are suitable to represent and reason about transformations of quantum registers in an abstract, qualitative, way. Quantum registers represent quantum systems, and can be viewe... | arxiv | @article{masini2008a,
title={A Qualitative Modal Representation of Quantum Register Transformations},
author={Andrea Masini, Luca Vigan`o, Margherita Zorzi},
journal={arXiv preprint arXiv:0802.4057},
year={2008},
archivePrefix={arXiv},
eprint={0802.4057},
primaryClass={cs.LO}
} | masini2008a |
arxiv-2886 | 0802.4079 | Families of LDPC Codes Derived from Nonprimitive BCH Codes and Cyclotomic Cosets | <|reference_start|>Families of LDPC Codes Derived from Nonprimitive BCH Codes and Cyclotomic Cosets: Low-density parity check (LDPC) codes are an important class of codes with many applications. Two algebraic methods for constructing regular LDPC codes are derived -- one based on nonprimitive narrow-sense BCH codes and... | arxiv | @article{aly2008families,
title={Families of LDPC Codes Derived from Nonprimitive BCH Codes and
Cyclotomic Cosets},
author={Salah A. Aly},
journal={arXiv preprint arXiv:0802.4079},
year={2008},
archivePrefix={arXiv},
eprint={0802.4079},
primaryClass={cs.IT math.IT}
} | aly2008families |
arxiv-2887 | 0802.4089 | An algorithmic complexity interpretation of Lin's third law of information theory | <|reference_start|>An algorithmic complexity interpretation of Lin's third law of information theory: Instead of static entropy we assert that the Kolmogorov complexity of a static structure such as a solid is the proper measure of disorder (or chaoticity). A static structure in a surrounding perfectly-random universe ... | arxiv | @article{ratsaby2008an,
title={An algorithmic complexity interpretation of Lin's third law of
information theory},
author={Joel Ratsaby},
journal={arXiv preprint arXiv:0802.4089},
year={2008},
doi={10.3390/entropy-e10010006},
archivePrefix={arXiv},
eprint={0802.4089},
primaryClass={cs.... | ratsaby2008an |
arxiv-2888 | 0802.4095 | For each $\alpha$ > 2 there is an infinite binary word with critical exponent $\alpha$ | <|reference_start|>For each $\alpha$ > 2 there is an infinite binary word with critical exponent $\alpha$: For each $\alpha > 2$ there is a binary word with critical exponent $\alpha$.<|reference_end|> | arxiv | @article{currie2008for,
title={For each $\alpha$ > 2 there is an infinite binary word with critical
exponent $\alpha$},
author={James D. Currie, Narad Rampersad},
journal={arXiv preprint arXiv:0802.4095},
year={2008},
archivePrefix={arXiv},
eprint={0802.4095},
primaryClass={math.CO cs.FL}
... | currie2008for |
arxiv-2889 | 0802.4101 | New bounds on classical and quantum one-way communication complexity | <|reference_start|>New bounds on classical and quantum one-way communication complexity: In this paper we provide new bounds on classical and quantum distributional communication complexity in the two-party, one-way model of communication. In the classical model, our bound extends the well known upper bound of Kremer, ... | arxiv | @article{jain2008new,
title={New bounds on classical and quantum one-way communication complexity},
author={Rahul Jain and Shengyu Zhang},
journal={arXiv preprint arXiv:0802.4101},
year={2008},
archivePrefix={arXiv},
eprint={0802.4101},
primaryClass={cs.IT cs.DC math.IT}
} | jain2008new |
arxiv-2890 | 0802.4112 | Hubs in Languages: Scale Free Networks of Synonyms | <|reference_start|>Hubs in Languages: Scale Free Networks of Synonyms: Natural languages are described in this paper in terms of networks of synonyms: a word is identified with a node, and synonyms are connected by undirected links. Our statistical analysis of the network of synonyms in Polish language showed it is sca... | arxiv | @article{makaruk2008hubs,
title={Hubs in Languages: Scale Free Networks of Synonyms},
author={Hanna E. Makaruk, Robert Owczarek},
journal={arXiv preprint arXiv:0802.4112},
year={2008},
number={LA-UR-08-0084},
archivePrefix={arXiv},
eprint={0802.4112},
primaryClass={physics.soc-ph cs.CL p... | makaruk2008hubs |
arxiv-2891 | 0802.4126 | Hospital Case Cost Estimates Modelling - Algorithm Comparison | <|reference_start|>Hospital Case Cost Estimates Modelling - Algorithm Comparison: Ontario (Canada) Health System stakeholders support the idea and necessity of the integrated source of data that would include both clinical (e.g. diagnosis, intervention, length of stay, case mix group) and financial (e.g. cost per weigh... | arxiv | @article{andru2008hospital,
title={Hospital Case Cost Estimates Modelling - Algorithm Comparison},
author={Peter Andru, Alexei Botchkarev},
journal={arXiv preprint arXiv:0802.4126},
year={2008},
archivePrefix={arXiv},
eprint={0802.4126},
primaryClass={cs.CE cs.DB}
} | andru2008hospital |
arxiv-2892 | 0802.4130 | Wideband Spectrum Sensing in Cognitive Radio Networks | <|reference_start|>Wideband Spectrum Sensing in Cognitive Radio Networks: Spectrum sensing is an essential enabling functionality for cognitive radio networks to detect spectrum holes and opportunistically use the under-utilized frequency bands without causing harmful interference to legacy networks. This paper introdu... | arxiv | @article{quan2008wideband,
title={Wideband Spectrum Sensing in Cognitive Radio Networks},
author={Zhi Quan, Shuguang Cui, Ali H. Sayed, and H. Vincent Poor},
journal={Proceedings of the 2008 IEEE International Conference on
Communications, Beijing, May 19-23, 2008},
year={2008},
doi={10.1109/ICC.2... | quan2008wideband |
arxiv-2893 | 0802.4131 | Language of Boolean functions its Grammar and Machine | <|reference_start|>Language of Boolean functions its Grammar and Machine: In this paper an algorithm is designed which generates in-equivalent Boolean functions of any number of variables from the four Boolean functions of single variable. The grammar for such set of Boolean function is provided. The Turing Machine tha... | arxiv | @article{nayak2008language,
title={Language of Boolean functions its Grammar and Machine},
author={Birendra Kumar Nayak (1), Sudhakar Sahoo (2)},
journal={arXiv preprint arXiv:0802.4131},
year={2008},
archivePrefix={arXiv},
eprint={0802.4131},
primaryClass={cs.LO}
} | nayak2008language |
arxiv-2894 | 0802.4191 | HyperSmooth : calcul et visualisation de cartes de potentiel interactives | <|reference_start|>HyperSmooth : calcul et visualisation de cartes de potentiel interactives: The HyperCarte research group wishes to offer a new cartographic tool for spatial analysis of social data, using the potential smoothing method. The purpose of this method is to view the spreading of phenomena's in a continuou... | arxiv | @article{plumejeaud2008hypersmooth,
title={HyperSmooth : calcul et visualisation de cartes de potentiel
interactives},
author={Christine Plumejeaud (INRIA Rh^one-Alpes / LIG Laboratoire
d'Informatique de Grenoble), Jean-Marc Vincent (INRIA Rh^one-Alpes / LIG
laboratoire d'Informatique de Grenoble), Claude... | plumejeaud2008hypersmooth |
arxiv-2895 | 0802.4198 | Some properties of the Ukrainian writing system | <|reference_start|>Some properties of the Ukrainian writing system: We investigate the grapheme-phoneme relation in Ukrainian and some properties of the Ukrainian version of the Cyrillic alphabet.<|reference_end|> | arxiv | @article{buk2008some,
title={Some properties of the Ukrainian writing system},
author={Solomija Buk, J'an Mav{c}utek, Andrij Rovenchak},
journal={Glottometrics 16, 63-79 (2008)},
year={2008},
archivePrefix={arXiv},
eprint={0802.4198},
primaryClass={cs.CL}
} | buk2008some |
arxiv-2896 | 0802.4215 | Equilibrium (Zipf) and Dynamic (Grasseberg-Procaccia) method based analyses of human texts A comparison of natural (english) and artificial (esperanto) languages | <|reference_start|>Equilibrium (Zipf) and Dynamic (Grasseberg-Procaccia) method based analyses of human texts A comparison of natural (english) and artificial (esperanto) languages: A comparison of two english texts from Lewis Carroll, one (Alice in wonderland), also translated into esperanto, the other (Through a look... | arxiv | @article{ausloos2008equilibrium,
title={Equilibrium (Zipf) and Dynamic (Grasseberg-Procaccia) method based
analyses of human texts. A comparison of natural (english) and artificial
(esperanto) languages},
author={M. Ausloos},
journal={Physica A 387 (25) 6411-6420 (2008)},
year={2008},
doi={10.10... | ausloos2008equilibrium |
arxiv-2897 | 0802.4233 | Adaptive Sum Power Iterative Waterfilling for MIMO Cognitive Radio Channels | <|reference_start|>Adaptive Sum Power Iterative Waterfilling for MIMO Cognitive Radio Channels: In this paper, the sum capacity of the Gaussian Multiple Input Multiple Output (MIMO) Cognitive Radio Channel (MCC) is expressed as a convex problem with finite number of linear constraints, allowing for polynomial time inte... | arxiv | @article{soundararajan2008adaptive,
title={Adaptive Sum Power Iterative Waterfilling for MIMO Cognitive Radio
Channels},
author={Rajiv Soundararajan and Sriram Vishwanath},
journal={arXiv preprint arXiv:0802.4233},
year={2008},
archivePrefix={arXiv},
eprint={0802.4233},
primaryClass={cs.IT... | soundararajan2008adaptive |
arxiv-2898 | 0802.4237 | Safety alternating automata on data words | <|reference_start|>Safety alternating automata on data words: A data word is a sequence of pairs of a letter from a finite alphabet and an element from an infinite set, where the latter can only be compared for equality. Safety one-way alternating automata with one register on infinite data words are considered, their ... | arxiv | @article{lazic2008safety,
title={Safety alternating automata on data words},
author={Ranko Lazic},
journal={arXiv preprint arXiv:0802.4237},
year={2008},
archivePrefix={arXiv},
eprint={0802.4237},
primaryClass={cs.LO}
} | lazic2008safety |
arxiv-2899 | 0802.4244 | Call Admission Control Algorithm for pre-stored VBR video streams | <|reference_start|>Call Admission Control Algorithm for pre-stored VBR video streams: We examine the problem of accepting a new request for a pre-stored VBR video stream that has been smoothed using any of the smoothing algorithms found in the literature. The output of these algorithms is a piecewise constant-rate sche... | arxiv | @article{tryfonas2008call,
title={Call Admission Control Algorithm for pre-stored VBR video streams},
author={Christos Tryfonas, Dimitris Papamichail, Andrew Mehler, Steven Skiena},
journal={arXiv preprint arXiv:0802.4244},
year={2008},
archivePrefix={arXiv},
eprint={0802.4244},
primaryClass... | tryfonas2008call |
arxiv-2900 | 0802.4270 | Propagation Rules of Subsystem Codes | <|reference_start|>Propagation Rules of Subsystem Codes: We demonstrate propagation rules of subsystem code constructions by extending, shortening and combining given subsystem codes. Given an $[[n,k,r,d]]_q$ subsystem code, we drive new subsystem codes with parameters $[[n+1,k,r,\geq d]]_q$, $[[n-1,k+1,r,\geq d-1]]_q$... | arxiv | @article{aly2008propagation,
title={Propagation Rules of Subsystem Codes},
author={Salah A. Aly},
journal={arXiv preprint arXiv:0802.4270},
year={2008},
archivePrefix={arXiv},
eprint={0802.4270},
primaryClass={quant-ph cs.IT math.IT}
} | aly2008propagation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.