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-676901 | math/0702116 | A Direct Matrix Method for Computing Analytical Jacobians of Discretized Nonlinear Integro-differential Equations | <|reference_start|>A Direct Matrix Method for Computing Analytical Jacobians of Discretized Nonlinear Integro-differential Equations: In this pedagogical article, we present a simple direct matrix method for analytically computing the Jacobian of nonlinear algebraic equations that arise from the discretization of nonli... | arxiv | @article{chu2007a,
title={A Direct Matrix Method for Computing Analytical Jacobians of Discretized
Nonlinear Integro-differential Equations},
author={Kevin T. Chu},
journal={arXiv preprint arXiv:math/0702116},
year={2007},
doi={10.1016/j.jcp.2009.04.031},
archivePrefix={arXiv},
eprint={mat... | chu2007a |
arxiv-676902 | math/0702129 | Pebble Game Algorithms and Sparse Graphs | <|reference_start|>Pebble Game Algorithms and Sparse Graphs: A multi-graph $G$ on $n$ vertices is $(k,\ell)$-sparse if every subset of $n'\leq n$ vertices spans at most $kn'- \ell$ edges. $G$ is {\em tight} if, in addition, it has exactly $kn - \ell$ edges. For integer values $k$ and $\ell \in [0, 2k)$, we characterize... | arxiv | @article{lee2007pebble,
title={Pebble Game Algorithms and Sparse Graphs},
author={Audrey Lee and Ileana Streinu},
journal={arXiv preprint arXiv:math/0702129},
year={2007},
number={UMass Amherst Computer Science Department TR 07-02},
archivePrefix={arXiv},
eprint={math/0702129},
primaryCl... | lee2007pebble |
arxiv-676903 | math/0702239 | Polyhedral representation conversion up to symmetries | <|reference_start|>Polyhedral representation conversion up to symmetries: We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. We in particular discuss decomposition methods, which reduce the problem to a number of lower dime... | arxiv | @article{bremner2007polyhedral,
title={Polyhedral representation conversion up to symmetries},
author={David Bremner, Mathieu Dutour Sikiric, Achill Schuermann},
journal={CRM Proceedings & Lecture Notes 48, AMS, 2009, pp. 45-71},
year={2007},
archivePrefix={arXiv},
eprint={math/0702239},
pri... | bremner2007polyhedral |
arxiv-676904 | math/0702301 | Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting | <|reference_start|>Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting: The problem of recovering the sparsity pattern of a fixed but unknown vector $\beta^* \in \real^p based on a set of $n$ noisy observations arises in a variety of settings, including subset selection in regres... | arxiv | @article{wainwright2007information-theoretic,
title={Information-theoretic limits on sparsity recovery in the
high-dimensional and noisy setting},
author={Martin J. Wainwright},
journal={arXiv preprint arXiv:math/0702301},
year={2007},
archivePrefix={arXiv},
eprint={math/0702301},
primaryC... | wainwright2007information-theoretic |
arxiv-676905 | math/0702325 | Neighbor selection and hitting probability in small-world graphs | <|reference_start|>Neighbor selection and hitting probability in small-world graphs: Small-world graphs, which combine randomized and structured elements, are seen as prevalent in nature. Jon Kleinberg showed that in some graphs of this type it is possible to route, or navigate, between vertices in few steps even with ... | arxiv | @article{sandberg2007neighbor,
title={Neighbor selection and hitting probability in small-world graphs},
author={Oskar Sandberg},
journal={Annals of Applied Probability 2008, Vol. 18, No. 5, 1771-1793},
year={2007},
doi={10.1214/07-AAP499},
number={IMS-AAP-AAP499},
archivePrefix={arXiv},
... | sandberg2007neighbor |
arxiv-676906 | math/0702334 | An Example of Pi^0_3-complete Infinitary Rational Relation | <|reference_start|>An Example of Pi^0_3-complete Infinitary Rational Relation: We give in this paper an example of infinitary rational relation, accepted by a 2-tape B\"{u}chi automaton, which is Pi^0_3-complete in the Borel hierarchy. Moreover the example of infinitary rational relation given in this paper has a very ... | arxiv | @article{finkel2007an,
title={An Example of Pi^0_3-complete Infinitary Rational Relation},
author={Olivier Finkel (LIP)},
journal={arXiv preprint arXiv:math/0702334},
year={2007},
archivePrefix={arXiv},
eprint={math/0702334},
primaryClass={math.LO cs.CC cs.LO}
} | finkel2007an |
arxiv-676907 | math/0702744 | Matrix norms and rapid mixing for spin systems | <|reference_start|>Matrix norms and rapid mixing for spin systems: We give a systematic development of the application of matrix norms to rapid mixing in spin systems. We show that rapid mixing of both random update Glauber dynamics and systematic scan Glauber dynamics occurs if any matrix norm of the associated depend... | arxiv | @article{dyer2007matrix,
title={Matrix norms and rapid mixing for spin systems},
author={Martin Dyer, Leslie Ann Goldberg, Mark Jerrum},
journal={Annals of Applied Probability 2009, Vol. 19, No. 1, 71-107},
year={2007},
doi={10.1214/08-AAP532},
number={IMS-AAP-AAP532},
archivePrefix={arXiv},... | dyer2007matrix |
arxiv-676908 | math/0702804 | The Loss Rank Principle for Model Selection | <|reference_start|>The Loss Rank Principle for Model Selection: We introduce a new principle for model selection in regression and classification. Many regression models are controlled by some smoothness or flexibility or complexity parameter c, e.g. the number of neighbors to be averaged over in k nearest neighbor (kN... | arxiv | @article{hutter2007the,
title={The Loss Rank Principle for Model Selection},
author={Marcus Hutter},
journal={Proc. 20th Annual Conf. on Learning Theory (COLT 2007) pages
589-603},
year={2007},
doi={10.1007/978-3-540-72927-3_42},
archivePrefix={arXiv},
eprint={math/0702804},
primaryCla... | hutter2007the |
arxiv-676909 | math/0702866 | Consumer Profile Identification and Allocation | <|reference_start|>Consumer Profile Identification and Allocation: We propose an easy-to-use methodology to allocate one of the groups which have been previously built from a complete learning data base, to new individuals. The learning data base contains continuous and categorical variables for each individual. The gr... | arxiv | @article{letrémy2007consumer,
title={Consumer Profile Identification and Allocation},
author={Patrick Letr'emy (SAMOS, CES), Marie Cottrell (SAMOS, CES), Eric
Esposito (RDD GDF), Val'erie Laffite (RDD GDF), Sally Showk (RDD GDF)},
journal={arXiv preprint arXiv:math/0702866},
year={2007},
archivePr... | letrémy2007consumer |
arxiv-676910 | math/0703019 | Reading policies for joins: An asymptotic analysis | <|reference_start|>Reading policies for joins: An asymptotic analysis: Suppose that $m_n$ observations are made from the distribution $\mathbf {R}$ and $n-m_n$ from the distribution $\mathbf {S}$. Associate with each pair, $x$ from $\mathbf {R}$ and $y$ from $\mathbf {S}$, a nonnegative score $\phi(x,y)$. An optimal re... | arxiv | @article{russo2007reading,
title={Reading policies for joins: An asymptotic analysis},
author={Ralph P. Russo, Nariankadu D. Shyamalkumar},
journal={Annals of Applied Probability 2007, Vol. 17, No. 1, 230-264},
year={2007},
doi={10.1214/105051606000000646},
number={IMS-AAP-AAP404},
archivePr... | russo2007reading |
arxiv-676911 | math/0703241 | Sofic Trace of a Cellular Automaton | <|reference_start|>Sofic Trace of a Cellular Automaton: The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram, ie the infinite sequence of states of a particular cell of a configuration; in the language of symbolic dynamics one says that it is a facto... | arxiv | @article{cervelle2007sofic,
title={Sofic Trace of a Cellular Automaton},
author={Julien Cervelle (IGM), Enrico Formenti (I3S), Pierre Guillon (IGM)},
journal={arXiv preprint arXiv:math/0703241},
year={2007},
archivePrefix={arXiv},
eprint={math/0703241},
primaryClass={math.DS cs.CC cs.DM}
} | cervelle2007sofic |
arxiv-676912 | math/0703436 | A parametric representation of totally mixed Nash equilibria | <|reference_start|>A parametric representation of totally mixed Nash equilibria: We compute a parametric description of the totally mixed Nash equilibria of a generic game in normal form with pre-fixed structure. Using this representation, we show conditions under which a game has the maximum possible number of this ki... | arxiv | @article{jeronimo2007a,
title={A parametric representation of totally mixed Nash equilibria},
author={G. Jeronimo, D. Perrucci, J. Sabia},
journal={arXiv preprint arXiv:math/0703436},
year={2007},
archivePrefix={arXiv},
eprint={math/0703436},
primaryClass={math.AG cs.GT}
} | jeronimo2007a |
arxiv-676913 | math/0703575 | Convex Discrete Optimization | <|reference_start|>Convex Discrete Optimization: We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial optimization problems and convex integer p... | arxiv | @article{onn2007convex,
title={Convex Discrete Optimization},
author={Shmuel Onn},
journal={Encyclopedia of Optimization 2009: 513-550},
year={2007},
archivePrefix={arXiv},
eprint={math/0703575},
primaryClass={math.OC cs.CC cs.DM math.CO}
} | onn2007convex |
arxiv-676914 | math/0703656 | Using decision problems in public key cryptography | <|reference_start|>Using decision problems in public key cryptography: There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by now. Most of these problems are search problems, i.e., they are of the ... | arxiv | @article{shpilrain2007using,
title={Using decision problems in public key cryptography},
author={Vladimir Shpilrain and Gabriel Zapata},
journal={arXiv preprint arXiv:math/0703656},
year={2007},
archivePrefix={arXiv},
eprint={math/0703656},
primaryClass={math.GR cs.CR}
} | shpilrain2007using |
arxiv-676915 | math/0703713 | The logic of message passing | <|reference_start|>The logic of message passing: Message passing is a key ingredient of concurrent programming. The purpose of this paper is to describe the equivalence between the proof theory, the categorical semantics, and term calculus of message passing. In order to achieve this we introduce the categorical notion... | arxiv | @article{cockett2007the,
title={The logic of message passing},
author={J. R. B. Cockett and Craig Pastro},
journal={Science of Computer Programming 74 no.8 (2009) 498-533},
year={2007},
archivePrefix={arXiv},
eprint={math/0703713},
primaryClass={math.CT cs.LO}
} | cockett2007the |
arxiv-676916 | math/0703865 | Solving Triangular Peg Solitaire | <|reference_start|>Solving Triangular Peg Solitaire: We consider the one-person game of peg solitaire on a triangular board of arbitrary size. The basic game begins from a full board with one peg missing and finishes with one peg at a specified board location. We develop necessary and sufficient conditions for this gam... | arxiv | @article{bell2007solving,
title={Solving Triangular Peg Solitaire},
author={George I. Bell},
journal={Journal of Integer Sequences, Vol. 11 (2008), Article 08.4.8},
year={2007},
archivePrefix={arXiv},
eprint={math/0703865},
primaryClass={math.CO cs.DM}
} | bell2007solving |
arxiv-676917 | math/0703902 | Connectivity and equilibrium in random games | <|reference_start|>Connectivity and equilibrium in random games: We study how the structure of the interaction graph of a game affects the existence of pure Nash equilibria. In particular, for a fixed interaction graph, we are interested in whether there are pure Nash equilibria arising when random utility tables are a... | arxiv | @article{daskalakis2007connectivity,
title={Connectivity and equilibrium in random games},
author={Constantinos Daskalakis, Alexandros G. Dimakis, Elchanan Mossel},
journal={Annals of Applied Probability 2011, Vol. 21, No. 3, 987-1016},
year={2007},
doi={10.1214/10-AAP715},
number={IMS-AAP-AAP71... | daskalakis2007connectivity |
arxiv-676918 | math/0703921 | Sparse Hypergraphs and Pebble Game Algorithms | <|reference_start|>Sparse Hypergraphs and Pebble Game Algorithms: A hypergraph $G=(V,E)$ is $(k,\ell)$-sparse if no subset $V'\subset V$ spans more than $k|V'|-\ell$ hyperedges. We characterize $(k,\ell)$-sparse hypergraphs in terms of graph theoretic, matroidal and algorithmic properties. We extend several well-known ... | arxiv | @article{streinu2007sparse,
title={Sparse Hypergraphs and Pebble Game Algorithms},
author={Ileana Streinu and Louis Theran},
journal={arXiv preprint arXiv:math/0703921},
year={2007},
archivePrefix={arXiv},
eprint={math/0703921},
primaryClass={math.CO cs.DS}
} | streinu2007sparse |
arxiv-676919 | math/0703927 | On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach | <|reference_start|>On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach: A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest integer k for which G has a dis... | arxiv | @article{arvind2007on,
title={On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a
Counting Approach},
author={V. Arvind, Christine T. Cheng, Nikhil R. Devanur},
journal={arXiv preprint arXiv:math/0703927},
year={2007},
archivePrefix={arXiv},
eprint={math/0703927},
primar... | arvind2007on |
arxiv-676920 | math/9310227 | A linear construction for certain Kerdock and Preparata codes | <|reference_start|>A linear construction for certain Kerdock and Preparata codes: The Nordstrom-Robinson, Kerdock, and (slightly modified) Pre\- parata codes are shown to be linear over $\ZZ_4$, the integers $\bmod~4$. The Kerdock and Preparata codes are duals over $\ZZ_4$, and the Nordstrom-Robinson code is self-dual.... | arxiv | @article{calderbank1993a,
title={A linear construction for certain Kerdock and Preparata codes},
author={A. R. Calderbank, A. Roger Hammons Jr., P. Vijay Kumar, N. J. A.
Sloane, Patrick Sol'e},
journal={Bull. Amer. Math. Soc. (N.S.) 29 (1993) 218-222},
year={1993},
number={Bulletin migration 11/99... | calderbank1993a |
arxiv-676921 | math/9409219 | Proving probabilistic correctness statements: the case of Rabin's algorithm for mutual exclusion | <|reference_start|>Proving probabilistic correctness statements: the case of Rabin's algorithm for mutual exclusion: The correctness of most randomized distributed algorithms is expressed by a statement of the form ``some predicate of the executions holds with high probability, regardless of the order in which actions ... | arxiv | @article{saias1994proving,
title={Proving probabilistic correctness statements: the case of Rabin's
algorithm for mutual exclusion},
author={Isaac Saias},
journal={arXiv preprint arXiv:math/9409219},
year={1994},
number={LACES 68Q-94-14},
archivePrefix={arXiv},
eprint={math/9409219},
p... | saias1994proving |
arxiv-676922 | math/9409220 | Number of faults a system can withstand without repairs | <|reference_start|>Number of faults a system can withstand without repairs: We consider the following scheduling problem. A system is composed of $n$ processors drawn from a pool of $N$. The processors can become faulty while in operation and faulty processors never recover. A report is issued whenever a fault occurs. ... | arxiv | @article{goemans1994number,
title={Number of faults a system can withstand without repairs},
author={Michel Goemans, Nancy Lynch, Isaac Saias},
journal={arXiv preprint arXiv:math/9409220},
year={1994},
number={LACES 68Q-94-15},
archivePrefix={arXiv},
eprint={math/9409220},
primaryClass={... | goemans1994number |
arxiv-676923 | math/9409221 | Proving time bounds for randomized distributed algorithms | <|reference_start|>Proving time bounds for randomized distributed algorithms: A method of analyzing time bounds for randomized distributed algorithms is presented, in the context of a new and general framework for describing and reasoning about randomized algorithms. The method consists of proving auxiliary statements ... | arxiv | @article{lynch1994proving,
title={Proving time bounds for randomized distributed algorithms},
author={Nancy Lynch, Isaac Saias, Roberto Segala},
journal={arXiv preprint arXiv:math/9409221},
year={1994},
number={LACES 68Q-94-16},
archivePrefix={arXiv},
eprint={math/9409221},
primaryClass=... | lynch1994proving |
arxiv-676924 | math/9409223 | On the minimum latency problem | <|reference_start|>On the minimum latency problem: We are given a set of points $p_1,\ldots , p_n$ and a symmetric distance matrix $(d_{ij})$ giving the distance between $p_i$ and $p_j$. We wish to construct a tour that minimizes $\sum_{i=1}^n \ell(i)$, where $\ell(i)$ is the {\em latency} of $p_i$, defined to be the d... | arxiv | @article{blum1994on,
title={On the minimum latency problem},
author={Avrim Blum, Prasad Chalasani, Don Coppersmith, Bill Pulleyblank,
Prabhakar Raghavan, Madhu Sudan},
journal={arXiv preprint arXiv:math/9409223},
year={1994},
number={LACES 68Q-94-18},
archivePrefix={arXiv},
eprint={math/94... | blum1994on |
arxiv-676925 | math/9409224 | An on-line algorithm for improving performance in navigation | <|reference_start|>An on-line algorithm for improving performance in navigation: Recent papers have shown optimally-competitive on-line strategies for a robot traveling from a point $s$ to a point $t$ in certain unknown geometric environments. We consider the question: Having gained some partial information about the s... | arxiv | @article{blum1994an,
title={An on-line algorithm for improving performance in navigation},
author={Avrim Blum, Prasad Chalasani},
journal={arXiv preprint arXiv:math/9409224},
year={1994},
number={LACES 68Q-94-19},
archivePrefix={arXiv},
eprint={math/9409224},
primaryClass={math.CO cs.CC}... | blum1994an |
arxiv-676926 | math/9409225 | The complexity of approximating PSPACE-Complete problems for hierarchical specifications | <|reference_start|>The complexity of approximating PSPACE-Complete problems for hierarchical specifications: We extend the concept of polynomial time approximation algorithms to apply to problems for hierarchically specified graphs, many of which are PSPACE-complete. Assuming P != PSPACE, the existence or nonexistence ... | arxiv | @article{marathe1994the,
title={The complexity of approximating PSPACE-Complete problems for
hierarchical specifications},
author={Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi},
journal={arXiv preprint arXiv:math/9409225},
year={1994},
number={LACES 68Q-94-21},
archivePrefix={arXiv},
e... | marathe1994the |
arxiv-676927 | math/9409226 | Geometry based heuristics for unit disk graphs | <|reference_start|>Geometry based heuristics for unit disk graphs: Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP-hard optimization problems on unit disk graphs. The problems considered include maximum independ... | arxiv | @article{marathe1994geometry,
title={Geometry based heuristics for unit disk graphs},
author={Madhav V. Marathe, H. Breu, Harry B. Hunt III, S. S. Ravi, Daniel J.
Rosenkrantz},
journal={arXiv preprint arXiv:math/9409226},
year={1994},
number={LACES 68Q-94-22},
archivePrefix={arXiv},
eprint... | marathe1994geometry |
arxiv-676928 | math/9410208 | Three-dimensional alpha shapes | <|reference_start|>Three-dimensional alpha shapes: Frequently, data in scientific computing is in its abstract form a finite point set in space, and it is sometimes useful or required to compute what one might call the ``shape'' of the set. For that purpose, this paper introduces the formal notion of the family of $\al... | arxiv | @article{edelsbrunner1994three-dimensional,
title={Three-dimensional alpha shapes},
author={Herbert Edelsbrunner, Ernst M"ucke},
journal={arXiv preprint arXiv:math/9410208},
year={1994},
number={LACES 52B-94-25},
archivePrefix={arXiv},
eprint={math/9410208},
primaryClass={math.CO cs.CC m... | edelsbrunner1994three-dimensional |
arxiv-676929 | math/9410209 | Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms | <|reference_start|>Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms: This paper describes a general-purpose programming technique, called the Simulation of Simplicity, which can be used to cope with degenerate input data for geometric algorithms. It relieves the programmer fro... | arxiv | @article{edelsbrunner1994simulation,
title={Simulation of simplicity: a technique to cope with degenerate cases in
geometric algorithms},
author={Herbert Edelsbrunner, Ernst M"ucke},
journal={arXiv preprint arXiv:math/9410209},
year={1994},
number={LACES 68Q-94-24},
archivePrefix={arXiv},
... | edelsbrunner1994simulation |
arxiv-676930 | math/9411219 | Lower bounds for identifying subset members with subset queries | <|reference_start|>Lower bounds for identifying subset members with subset queries: An instance of a group testing problem is a set of objects $\cO$ and an unknown subset $P$ of $\cO$. The task is to determine $P$ by using queries of the type ``does $P$ intersect $Q$'', where $Q$ is a subset of $\cO$. This problem occu... | arxiv | @article{knill1994lower,
title={Lower bounds for identifying subset members with subset queries},
author={Emanuel Knill},
journal={arXiv preprint arXiv:math/9411219},
year={1994},
number={LACES 68Q-94-23},
archivePrefix={arXiv},
eprint={math/9411219},
primaryClass={math.CO cs.CC}
} | knill1994lower |
arxiv-676931 | math/9411222 | The complexity of broadcasting in bounded-degree networks | <|reference_start|>The complexity of broadcasting in bounded-degree networks: Broadcasting concerns the dissemination of a message originating at one node of a network to all other nodes. This task is accomplished by placing a series of calls over the communication lines of the network between neighboring nodes, where ... | arxiv | @article{dinneen1994the,
title={The complexity of broadcasting in bounded-degree networks},
author={Michael J. Dinneen},
journal={arXiv preprint arXiv:math/9411222},
year={1994},
number={LACES 68Q-94-31},
archivePrefix={arXiv},
eprint={math/9411222},
primaryClass={math.CO cs.CC}
} | dinneen1994the |
arxiv-676932 | math/9411235 | McColm conjecture | <|reference_start|>McColm conjecture: Gregory McColm conjectured that positive elementary inductions are bounded in a class K of finite structures if every (FO + LFP) formula is equivalent to a first-order formula in K. Here (FO + LFP) is the extension of first-order logic with the least fixed point operator. We dispro... | arxiv | @article{gurevich1994mccolm,
title={McColm conjecture},
author={Yuri Gurevich, Neil Immerman, Saharon Shelah},
journal={Symposium on Logic in Computer Science (1994), 10--19},
year={1994},
number={Shelah [GISh:525]},
archivePrefix={arXiv},
eprint={math/9411235},
primaryClass={math.LO cs.... | gurevich1994mccolm |
arxiv-676933 | math/9411236 | On finite rigid structures | <|reference_start|>On finite rigid structures: The main result of this paper is a probabilistic construction of finite rigid structures. It yields a finitely axiomatizable class of finite rigid structures where no L^omega_{infty, omega} formula with counting quantifiers defines a linear order.<|reference_end|> | arxiv | @article{gurevich1994on,
title={On finite rigid structures},
author={Yuri Gurevich, Saharon Shelah},
journal={J. Symbolic Logic 61 (1996), 549--562},
year={1994},
number={Shelah [GuSh:526]},
archivePrefix={arXiv},
eprint={math/9411236},
primaryClass={math.LO cs.LO}
} | gurevich1994on |
arxiv-676934 | math/9504213 | Path optimization and near-greedy analysis for graph partitioning: an empirical study | <|reference_start|>Path optimization and near-greedy analysis for graph partitioning: an empirical study: This paper presents the results of an experimental study of graph partitioning. We describe a new heuristic technique, path optimization, and its application to two variations of graph partitioning: the max_cut pro... | arxiv | @article{berry1995path,
title={Path optimization and near-greedy analysis for graph partitioning: an
empirical study},
author={Jonathan Berry, Mark Goldberg},
journal={arXiv preprint arXiv:math/9504213},
year={1995},
number={LACES 68Q-95-25},
archivePrefix={arXiv},
eprint={math/9504213},
... | berry1995path |
arxiv-676935 | math/9508218 | An analysis of Bennett's pebble game | <|reference_start|>An analysis of Bennett's pebble game: Bennett's pebble game was introduced to obtain better time/space tradeoffs in the simulation of standard Turing machines by reversible ones. So far only upper bounds for the tradeoff based on the pebble game have been published. Here we give a recursion for the t... | arxiv | @article{knill1995an,
title={An analysis of Bennett's pebble game},
author={Emanuel Knill},
journal={arXiv preprint arXiv:math/9508218},
year={1995},
number={LACES 68Q-95-31},
archivePrefix={arXiv},
eprint={math/9508218},
primaryClass={math.CO cs.CC}
} | knill1995an |
arxiv-676936 | math/9508219 | New results on binary linear codes | <|reference_start|>New results on binary linear codes: This research announcement describes in very rough terms methods and a computer language under development, which can be used to prove the nonexistence of binary linear codes. Over a hundred new results have been obtained by the author. For example, there is no [29... | arxiv | @article{jaffe1995new,
title={New results on binary linear codes},
author={David B. Jaffe},
journal={arXiv preprint arXiv:math/9508219},
year={1995},
number={LACES 94B-95-32},
archivePrefix={arXiv},
eprint={math/9508219},
primaryClass={math.CO cs.IT math.IT}
} | jaffe1995new |
arxiv-676937 | math/9610221 | Extensions and Corrections for: ``A Convex Geometric Approach to Counting the Roots of a Polynomial System'' | <|reference_start|>Extensions and Corrections for: ``A Convex Geometric Approach to Counting the Roots of a Polynomial System'': This brief note corrects some errors in the paper quoted in the title, highlights a combinatorial result which may have been overlooked, and points to further improvements in recent literatur... | arxiv | @article{rojas1996extensions,
title={Extensions and Corrections for: ``A Convex Geometric Approach to
Counting the Roots of a Polynomial System''},
author={J. Maurice Rojas},
journal={arXiv preprint arXiv:math/9610221},
year={1996},
number={MSRI 1996-075},
archivePrefix={arXiv},
eprint={ma... | rojas1996extensions |
arxiv-676938 | math/9702221 | Some New Applications of Toric Geometry | <|reference_start|>Some New Applications of Toric Geometry: This paper reexamines univariate reduction from a toric geometric point of view. We begin by constructing a binomial variant of the $u$-resultant and then retailor the generalized characteristic polynomial to fully exploit sparsity in the monomial structure of... | arxiv | @article{rojas1997some,
title={Some New Applications of Toric Geometry},
author={J. Maurice Rojas},
journal={arXiv preprint arXiv:math/9702221},
year={1997},
number={MSRI 1997-016},
archivePrefix={arXiv},
eprint={math/9702221},
primaryClass={math.AG cs.DS}
} | rojas1997some |
arxiv-676939 | math/9702222 | Toric Generalized Characteristic Polynomials | <|reference_start|>Toric Generalized Characteristic Polynomials: We illustrate an efficient new method for handling polynomial systems with degenerate solution sets. In particular, a corollary of our techniques is a new algorithm to find an isolated point in every excess component of the zero set (over an algebraically... | arxiv | @article{rojas1997toric,
title={Toric Generalized Characteristic Polynomials},
author={J. Maurice Rojas},
journal={arXiv preprint arXiv:math/9702222},
year={1997},
number={MSRI 1997-017},
archivePrefix={arXiv},
eprint={math/9702222},
primaryClass={math.AG cs.DS}
} | rojas1997toric |
arxiv-676940 | math/9704218 | A simple polynomial time algorithm to approximate the permanent within a simply exponential factor | <|reference_start|>A simple polynomial time algorithm to approximate the permanent within a simply exponential factor: We present a simple randomized polynomial time algorithm to approximate the mixed discriminant of $n$ positive semidefinite $n \times n$ matrices within a factor $2^{O(n)}$. Consequently, the algorithm... | arxiv | @article{barvinok1997a,
title={A simple polynomial time algorithm to approximate the permanent within a
simply exponential factor},
author={Alexander Barvinok},
journal={arXiv preprint arXiv:math/9704218},
year={1997},
number={MSRI 1997-031, formerly math.LA/9704218},
archivePrefix={arXiv},
... | barvinok1997a |
arxiv-676941 | math/9705225 | Choiceless polynomial time | <|reference_start|>Choiceless polynomial time: Turing machines define polynomial time (PTime) on strings but cannot deal with structures like graphs directly, and there is no known, easily computable string encoding of isomorphism classes of structures. Is there a computation model whose machines do not distinguish bet... | arxiv | @article{blass1997choiceless,
title={Choiceless polynomial time},
author={Andreas Blass, Yuri Gurevich, Saharon Shelah},
journal={arXiv preprint arXiv:math/9705225},
year={1997},
number={Shelah [BGSh:533]},
archivePrefix={arXiv},
eprint={math/9705225},
primaryClass={math.LO cs.LO}
} | blass1997choiceless |
arxiv-676942 | math/9801152 | On the classifiability of cellular automata | <|reference_start|>On the classifiability of cellular automata: Based on computer simulations Wolfram presented in several papers conjectured classifications of cellular automata into 4 types. He distinguishes the 4 classes of cellular automata by the evolution of the pattern generated by applying a cellular automaton ... | arxiv | @article{baldwin1998on,
title={On the classifiability of cellular automata},
author={John T. Baldwin, Saharon Shelah},
journal={arXiv preprint arXiv:math/9801152},
year={1998},
number={Shelah [BlSh:623]},
archivePrefix={arXiv},
eprint={math/9801152},
primaryClass={math.LO cs.NE}
} | baldwin1998on |
arxiv-676943 | math/9807179 | Polynomial time logic: Inability to express | <|reference_start|>Polynomial time logic: Inability to express: Here we deal with the logic of [GuSh 533], which tries to capture polynomial time (for finite models). There it is proved that the logic cannot say much on models with equality only. Here we prove that it cannot say much on models for which we expect it ca... | arxiv | @article{shelah1998polynomial,
title={Polynomial time logic: Inability to express},
author={Saharon Shelah},
journal={arXiv preprint arXiv:math/9807179},
year={1998},
number={Shelah [Sh:634]},
archivePrefix={arXiv},
eprint={math/9807179},
primaryClass={math.LO cs.LO}
} | shelah1998polynomial |
arxiv-676944 | math/9809009 | Uncomputably Large Integral Points on Algebraic Plane Curves? | <|reference_start|>Uncomputably Large Integral Points on Algebraic Plane Curves?: We show that the decidability of an amplification of Hilbert's Tenth Problem in three variables implies the existence of uncomputably large integral points on certain algebraic curves. We obtain this as a corollary of a new positive compl... | arxiv | @article{rojas1998uncomputably,
title={Uncomputably Large Integral Points on Algebraic Plane Curves?},
author={J. Maurice Rojas},
journal={arXiv preprint arXiv:math/9809009},
year={1998},
archivePrefix={arXiv},
eprint={math/9809009},
primaryClass={math.NT cs.CC cs.SC math.AG math.LO}
} | rojas1998uncomputably |
arxiv-676945 | math/9809071 | Solving Degenerate Sparse Polynomial Systems Faster | <|reference_start|>Solving Degenerate Sparse Polynomial Systems Faster: Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in every irreducible component of the zero set Z of F. Our techniques allow us to ... | arxiv | @article{rojas1998solving,
title={Solving Degenerate Sparse Polynomial Systems Faster},
author={J. Maurice Rojas},
journal={arXiv preprint arXiv:math/9809071},
year={1998},
archivePrefix={arXiv},
eprint={math/9809071},
primaryClass={math.AG cs.CC cs.NA math.NA}
} | rojas1998solving |
arxiv-676946 | math/9809201 | On quantification with a finite universe | <|reference_start|>On quantification with a finite universe: We consider a finite universe U (more exactly - a family U of them) and second order quantifiers Q_K, where for each U this means quantifying over a family of n(K)-place relations closed under permuting U. We define some natural orders and shed some light on ... | arxiv | @article{shelah1998on,
title={On quantification with a finite universe},
author={Saharon Shelah},
journal={arXiv preprint arXiv:math/9809201},
year={1998},
number={Shelah [Sh:639]},
archivePrefix={arXiv},
eprint={math/9809201},
primaryClass={math.LO cs.CC cs.LO}
} | shelah1998on |
arxiv-676947 | math/9810022 | Active Libraries: Rethinking the roles of compilers and libraries | <|reference_start|>Active Libraries: Rethinking the roles of compilers and libraries: We describe Active Libraries, which take an active role in compilation. Unlike traditional libraries which are passive collections of functions and objects, Active Libraries may generate components, specialize algorithms, optimize cod... | arxiv | @article{veldhuizen1998active,
title={Active Libraries: Rethinking the roles of compilers and libraries},
author={Todd L. Veldhuizen and Dennis Gannon},
journal={arXiv preprint arXiv:math/9810022},
year={1998},
number={formerly math.SC/9810022},
archivePrefix={arXiv},
eprint={math/9810022},
... | veldhuizen1998active |
arxiv-676948 | math/9901074 | Differential interactive games: The short-term predictions | <|reference_start|>Differential interactive games: The short-term predictions: Procedures of the short-term predictions for processes in general 2-person differential interactive games are proposed. Their effectiveness is discussed.<|reference_end|> | arxiv | @article{juriev1999differential,
title={Differential interactive games: The short-term predictions},
author={Denis V. Juriev},
journal={arXiv preprint arXiv:math/9901074},
year={1999},
archivePrefix={arXiv},
eprint={math/9901074},
primaryClass={math.HO cs.HC}
} | juriev1999differential |
arxiv-676949 | math/9902043 | The Average-Case Area of Heilbronn-Type Triangles | <|reference_start|>The Average-Case Area of Heilbronn-Type Triangles: From among $ {n \choose 3}$ triangles with vertices chosen from $n$ points in the unit square, let $T$ be the one with the smallest area, and let $A$ be the area of $T$. Heilbronn's triangle problem asks for the maximum value assumed by $A$ over all ... | arxiv | @article{jiang1999the,
title={The Average-Case Area of Heilbronn-Type Triangles},
author={Tao Jiang (UCR), Ming Li (UCSB), Paul Vitanyi (CWI and U Amsterdam)},
journal={T. Jiang, M. Li, and P. Vitanyi, The average-case area of
Heilbronn-type triangles, Random Structures and Algorithms, 20:2(2002),
206-2... | jiang1999the |
arxiv-676950 | math/9902151 | Homotopy invariants of higher dimensional categories and concurrency in computer science | <|reference_start|>Homotopy invariants of higher dimensional categories and concurrency in computer science: The strict globular $\omega$-categories formalize the execution paths of a parallel automaton and the homotopies between them. One associates to such (and any) $\omega$-category $\C$ three homology theories. The... | arxiv | @article{gaucher1999homotopy,
title={Homotopy invariants of higher dimensional categories and concurrency in
computer science},
author={Philippe Gaucher},
journal={Mathematical Structure in Computer Science 10 (2000), no. 4,
p.481-524},
year={1999},
doi={10.1017/S0960129500003182},
archivePr... | gaucher1999homotopy |
arxiv-676951 | math/9905046 | Duality between Multidimensional Convolutional Codes and Systems | <|reference_start|>Duality between Multidimensional Convolutional Codes and Systems: Multidimensional convolutional codes generalize (one dimensional) convolutional codes and they correspond under a natural duality to multidimensional systems widely studied in the systems literature.<|reference_end|> | arxiv | @article{gluesing-luerssen1999duality,
title={Duality between Multidimensional Convolutional Codes and Systems},
author={Heide Gluesing-Luerssen, Joachim Rosenthal and Paul Weiner},
journal={arXiv preprint arXiv:math/9905046},
year={1999},
archivePrefix={arXiv},
eprint={math/9905046},
primar... | gluesing-luerssen1999duality |
arxiv-676952 | math/9905155 | An Implementation of the Bestvina-Handel Algorithm for Surface Homeomorphisms | <|reference_start|>An Implementation of the Bestvina-Handel Algorithm for Surface Homeomorphisms: Bestvina and Handel have found an effective algorithm that determines whether a given homeomorphism of an orientable, possibly punctured surface is pseudo-Anosov. We present a software package in Java that realizes this al... | arxiv | @article{brinkmann1999an,
title={An Implementation of the Bestvina-Handel Algorithm for Surface
Homeomorphisms},
author={Peter Brinkmann},
journal={Experimental Mathematics 9:2, 2000, 235-240},
year={1999},
archivePrefix={arXiv},
eprint={math/9905155},
primaryClass={math.GR cs.MS math.GT}
... | brinkmann1999an |
arxiv-676953 | math/9905165 | Perception games, the image understanding and interpretational geometry | <|reference_start|>Perception games, the image understanding and interpretational geometry: The interactive game theoretical approach to the description of perception processes is proposed. The subject is treated formally in terms of a new class of the verbalizable interactive games which are called the perception game... | arxiv | @article{juriev1999perception,
title={Perception games, the image understanding and interpretational geometry},
author={Denis V. Juriev},
journal={arXiv preprint arXiv:math/9905165},
year={1999},
archivePrefix={arXiv},
eprint={math/9905165},
primaryClass={math.HO cs.CV}
} | juriev1999perception |
arxiv-676954 | math/9909163 | Coding Theory and Uniform Distributions | <|reference_start|>Coding Theory and Uniform Distributions: In the present paper we introduce and study finite point subsets of a special kind, called optimum distributions, in the n-dimensional unit cube. Such distributions are closely related with known (delta,s,n)-nets of low discrepancy. It turns out that optimum d... | arxiv | @article{skriganov1999coding,
title={Coding Theory and Uniform Distributions},
author={M. M. Skriganov},
journal={arXiv preprint arXiv:math/9909163},
year={1999},
archivePrefix={arXiv},
eprint={math/9909163},
primaryClass={math.CO cs.IT math.IT math.NT}
} | skriganov1999coding |
arxiv-676955 | math/9910062 | Efficient sphere-covering and converse measure concentration via generalized coding theorems | <|reference_start|>Efficient sphere-covering and converse measure concentration via generalized coding theorems: Suppose A is a finite set equipped with a probability measure P and let M be a ``mass'' function on A. We give a probabilistic characterization of the most efficient way in which A^n can be almost-covered us... | arxiv | @article{kontoyiannis1999efficient,
title={Efficient sphere-covering and converse measure concentration via
generalized coding theorems},
author={Ioannis Kontoyiannis},
journal={arXiv preprint arXiv:math/9910062},
year={1999},
archivePrefix={arXiv},
eprint={math/9910062},
primaryClass={mat... | kontoyiannis1999efficient |
arxiv-676956 | math/9910149 | Rational points, genus and asymptotic behaviour in reduced algebraic curves over finite fields | <|reference_start|>Rational points, genus and asymptotic behaviour in reduced algebraic curves over finite fields: The number A(q) shows the asymptotic behaviour of the quotient of the number of rational points over the genus of non-singular absolutely irreducible curves over a finite field Fq. Research on bounds for A... | arxiv | @article{farran1999rational,
title={Rational points, genus and asymptotic behaviour in reduced algebraic
curves over finite fields},
author={J. I. Farran},
journal={arXiv preprint arXiv:math/9910149},
year={1999},
number={AGT-34},
archivePrefix={arXiv},
eprint={math/9910149},
primaryCl... | farran1999rational |
arxiv-676957 | math/9910151 | Decoding Algebraic Geometry codes by a key equation | <|reference_start|>Decoding Algebraic Geometry codes by a key equation: A new effective decoding algorithm is presented for arbitrary algebraic-geometric codes on the basis of solving a generalized key equation with the majority coset scheme of Duursma. It is an improvement of Ehrhard's algorithm, since the method corr... | arxiv | @article{farran1999decoding,
title={Decoding Algebraic Geometry codes by a key equation},
author={J. I. Farran},
journal={arXiv preprint arXiv:math/9910151},
year={1999},
number={AGT-63},
archivePrefix={arXiv},
eprint={math/9910151},
primaryClass={math.AG cs.IT math.IT math.NA}
} | farran1999decoding |
arxiv-676958 | math/9910155 | Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models | <|reference_start|>Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models: We present an algorithm to compute the Weierstrass semigroup at a point P together with functions for each value in the semigroup, provided P is the only branch at infinity of a singular plane model for the curve. ... | arxiv | @article{campillo1999computing,
title={Computing Weierstrass semigroups and the Feng-Rao distance from singular
plane models},
author={A. Campillo and J. I. Farran},
journal={arXiv preprint arXiv:math/9910155},
year={1999},
number={AGT-58},
archivePrefix={arXiv},
eprint={math/9910155},
... | campillo1999computing |
arxiv-676959 | math/9910175 | Polynomial method in coding and information theory | <|reference_start|>Polynomial method in coding and information theory: Polynomial, or Delsarte's, method in coding theory accounts for a variety of structural results on, and bounds on the size of, extremal configurations (codes and designs) in various metric spaces. In recent works of the authors the applicability of ... | arxiv | @article{ashikhmin1999polynomial,
title={Polynomial method in coding and information theory},
author={A. Ashikhmin, A. Barg, S. Litsyn},
journal={arXiv preprint arXiv:math/9910175},
year={1999},
archivePrefix={arXiv},
eprint={math/9910175},
primaryClass={math.CO cs.IT math.IT}
} | ashikhmin1999polynomial |
arxiv-676960 | math/9910185 | Geometric Thickness of Complete Graphs | <|reference_start|>Geometric Thickness of Complete Graphs: We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straight-line edges and assign each edge to a layer so that no two edges on the same layer cross. The geometric thickness lies bet... | arxiv | @article{dillencourt1999geometric,
title={Geometric Thickness of Complete Graphs},
author={Michael B. Dillencourt and David Eppstein and Daniel S. Hirschberg},
journal={J. Graph Algorithms & Applications 4(3):5-17, 2000},
year={1999},
archivePrefix={arXiv},
eprint={math/9910185},
primaryClas... | dillencourt1999geometric |
arxiv-676961 | math/9911025 | On the parameters of Algebraic Geometry codes related to Arf semigroups | <|reference_start|>On the parameters of Algebraic Geometry codes related to Arf semigroups: In this paper we compute the order (or Feng-Rao) bound on the minimum distance of one-point algebraic geometry codes, when the Weierstrass semigroup at the point Q is an Arf semigroup. The results developed to that purpose also ... | arxiv | @article{campillo1999on,
title={On the parameters of Algebraic Geometry codes related to Arf semigroups},
author={A. Campillo, J. I. Farran and C. Munuera},
journal={arXiv preprint arXiv:math/9911025},
year={1999},
number={AGT-83},
archivePrefix={arXiv},
eprint={math/9911025},
primaryCla... | campillo1999on |
arxiv-676962 | math/9912059 | Combinatorics of branchings in higher dimensional automata | <|reference_start|>Combinatorics of branchings in higher dimensional automata: We explore the combinatorial properties of the branching areas of execution paths in higher dimensional automata. Mathematically, this means that we investigate the combinatorics of the negative corner (or branching) homology of a globular $... | arxiv | @article{gaucher1999combinatorics,
title={Combinatorics of branchings in higher dimensional automata},
author={Philippe Gaucher},
journal={Theory and Applications of Categories, Vol. 8, 2001, No. 12, pp
324-376},
year={1999},
archivePrefix={arXiv},
eprint={math/9912059},
primaryClass={math... | gaucher1999combinatorics |
arxiv-676963 | nlin/0001057 | Numerical Replication of Computer Simulations: Some Pitfalls and How To Avoid Them | <|reference_start|>Numerical Replication of Computer Simulations: Some Pitfalls and How To Avoid Them: A computer simulation, such as a genetic algorithm, that uses IEEE standard floating-point arithmetic may not produce exactly the same results in two different runs, even if it is rerun on the same computer with the s... | arxiv | @article{belding2000numerical,
title={Numerical Replication of Computer Simulations: Some Pitfalls and How To
Avoid Them},
author={Theodore C. Belding},
journal={arXiv preprint arXiv:nlin/0001057},
year={2000},
archivePrefix={arXiv},
eprint={nlin/0001057},
primaryClass={nlin.AO cs.NE}
} | belding2000numerical |
arxiv-676964 | nlin/0002040 | The dynamics of iterated transportation simulations | <|reference_start|>The dynamics of iterated transportation simulations: Iterating between a router and a traffic micro-simulation is an increasibly accepted method for doing traffic assignment. This paper, after pointing out that the analytical theory of simulation-based assignment to-date is insufficient for some prac... | arxiv | @article{nagel2000the,
title={The dynamics of iterated transportation simulations},
author={Kai Nagel, Marcus Rickert, Patrice M. Simon, Martin Pieck},
journal={arXiv preprint arXiv:nlin/0002040},
year={2000},
archivePrefix={arXiv},
eprint={nlin/0002040},
primaryClass={nlin.AO cs.CE}
} | nagel2000the |
arxiv-676965 | nlin/0004007 | A Century of Controvery Over the Foundations of Mathematics II | <|reference_start|>A Century of Controvery Over the Foundations of Mathematics II: Transcript of G.J. Chaitin's 2 March 2000 Carnegie Mellon University School of Computer Science Distinguished Lecture. The notion of randomness is taken from physics and applied to pure mathematics in order to shed light on the incomplet... | arxiv | @article{chaitin2000a,
title={A Century of Controvery Over the Foundations of Mathematics II},
author={G.J. Chaitin (IBM Research)},
journal={arXiv preprint arXiv:nlin/0004007},
year={2000},
archivePrefix={arXiv},
eprint={nlin/0004007},
primaryClass={nlin.CD cs.CC math.HO}
} | chaitin2000a |
arxiv-676966 | nlin/0006025 | Information Bottlenecks, Causal States, and Statistical Relevance Bases: How to Represent Relevant Information in Memoryless Transduction | <|reference_start|>Information Bottlenecks, Causal States, and Statistical Relevance Bases: How to Represent Relevant Information in Memoryless Transduction: Discovering relevant, but possibly hidden, variables is a key step in constructing useful and predictive theories about the natural world. This brief note explain... | arxiv | @article{shalizi2000information,
title={Information Bottlenecks, Causal States, and Statistical Relevance Bases:
How to Represent Relevant Information in Memoryless Transduction},
author={Cosma Rohilla Shalizi and James P. Crutchfield (Santa Fe Institute)},
journal={Advances in Complex Systems, vol. 5, pp... | shalizi2000information |
arxiv-676967 | nlin/0102026 | Parity Problem With A Cellular Automaton Solution | <|reference_start|>Parity Problem With A Cellular Automaton Solution: The parity of a bit string of length $N$ is a global quantity that can be efficiently compute using a global counter in ${O} (N)$ time. But is it possible to find the parity using cellular automata with a set of local rule tables without using any gl... | arxiv | @article{lee2001parity,
title={Parity Problem With A Cellular Automaton Solution},
author={K. M. Lee, Hao Xu and H. F. Chau},
journal={arXiv preprint arXiv:nlin/0102026},
year={2001},
doi={10.1103/PhysRevE.64.026702},
archivePrefix={arXiv},
eprint={nlin/0102026},
primaryClass={nlin.CG co... | lee2001parity |
arxiv-676968 | nlin/0103057 | Finding The Sign Of A Function Value By Binary Cellular Automaton | <|reference_start|>Finding The Sign Of A Function Value By Binary Cellular Automaton: Given a continuous function $f(x)$, suppose that the sign of $f$ only has finitely many discontinuous points in the interval $[0,1]$. We show how to use a sequence of one dimensional deterministic binary cellular automata to determine... | arxiv | @article{chau2001finding,
title={Finding The Sign Of A Function Value By Binary Cellular Automaton},
author={H. F. Chau, H. Xu, K. M. Lee, L. W. Siu and K. K. Yan},
journal={arXiv preprint arXiv:nlin/0103057},
year={2001},
doi={10.1142/S0129183102003929},
archivePrefix={arXiv},
eprint={nlin/... | chau2001finding |
arxiv-676969 | nlin/0109001 | Complex Philosophy | <|reference_start|>Complex Philosophy: We present several philosophical ideas emerging from the studies of complex systems. We make a brief introduction to the basic concepts of complex systems, for then defining "abstraction levels". These are useful for representing regularities in nature. We define absolute being (o... | arxiv | @article{gershenson2001complex,
title={Complex Philosophy},
author={Carlos Gershenson},
journal={arXiv preprint arXiv:nlin/0109001},
year={2001},
archivePrefix={arXiv},
eprint={nlin/0109001},
primaryClass={nlin.AO cs.CC}
} | gershenson2001complex |
arxiv-676970 | nlin/0109019 | Olfactory search at high Reynolds number | <|reference_start|>Olfactory search at high Reynolds number: Locating the source of odor in a turbulent environment - a common behavior for living organisms - is non-trivial because of the random nature of mixing. Here we analyze the statistical physics aspects of the problem and propose an efficient strategy for olfac... | arxiv | @article{balkovsky2001olfactory,
title={Olfactory search at high Reynolds number},
author={Eugene Balkovsky, Boris I. Shraiman},
journal={arXiv preprint arXiv:nlin/0109019},
year={2001},
doi={10.1073/pnas.192393499},
archivePrefix={arXiv},
eprint={nlin/0109019},
primaryClass={nlin.CD cs.... | balkovsky2001olfactory |
arxiv-676971 | nlin/0202038 | On model selection and the disability of neural networks to decompose tasks | <|reference_start|>On model selection and the disability of neural networks to decompose tasks: A neural network with fixed topology can be regarded as a parametrization of functions, which decides on the correlations between functional variations when parameters are adapted. We propose an analysis, based on a differen... | arxiv | @article{toussaint2002on,
title={On model selection and the disability of neural networks to decompose
tasks},
author={Marc Toussaint},
journal={Proceedings of the International Joint Conference on Neural
Networks (IJCNN 2002), 245-250.},
year={2002},
archivePrefix={arXiv},
eprint={nlin/0202... | toussaint2002on |
arxiv-676972 | nlin/0202039 | A neural model for multi-expert architectures | <|reference_start|>A neural model for multi-expert architectures: We present a generalization of conventional artificial neural networks that allows for a functional equivalence to multi-expert systems. The new model provides an architectural freedom going beyond existing multi-expert models and an integrative formalis... | arxiv | @article{toussaint2002a,
title={A neural model for multi-expert architectures},
author={Marc Toussaint},
journal={Proceedings of the International Joint Conference on Neural
Networks (IJCNN 2002), 2755-2760.},
year={2002},
archivePrefix={arXiv},
eprint={nlin/0202039},
primaryClass={nlin.AO... | toussaint2002a |
arxiv-676973 | nlin/0204038 | Neutrality: A Necessity for Self-Adaptation | <|reference_start|>Neutrality: A Necessity for Self-Adaptation: Self-adaptation is used in all main paradigms of evolutionary computation to increase efficiency. We claim that the basis of self-adaptation is the use of neutrality. In the absence of external control neutrality allows a variation of the search distributi... | arxiv | @article{toussaint2002neutrality:,
title={Neutrality: A Necessity for Self-Adaptation},
author={Marc Toussaint and Christian Igel},
journal={Proceedings of the Congress on Evolutionary Computation (CEC
2002), 1354-1359.},
year={2002},
archivePrefix={arXiv},
eprint={nlin/0204038},
primaryCl... | toussaint2002neutrality: |
arxiv-676974 | nlin/0207032 | Modulo Three Problem With A Cellular Automaton Solution | <|reference_start|>Modulo Three Problem With A Cellular Automaton Solution: An important global property of a bit string is the number of ones in it. It has been found that the parity (odd or even) of this number can be found by a sequence of deterministic, translational invariant cellular automata with parallel update... | arxiv | @article{xu2002modulo,
title={Modulo Three Problem With A Cellular Automaton Solution},
author={Hao Xu, K. M. Lee and H. F. Chau},
journal={arXiv preprint arXiv:nlin/0207032},
year={2002},
doi={10.1142/S0129183103004450},
archivePrefix={arXiv},
eprint={nlin/0207032},
primaryClass={nlin.C... | xu2002modulo |
arxiv-676975 | nlin/0210041 | Simple Model for the Dynamics of Correlations in the Evolution of Economic Entities Under Varying Economic Conditions | <|reference_start|>Simple Model for the Dynamics of Correlations in the Evolution of Economic Entities Under Varying Economic Conditions: From some observations on economic behaviors, in particular changing economic conditions with time and space, we develop a very simple model for the evolution of economic entities wi... | arxiv | @article{ausloos2002simple,
title={Simple Model for the Dynamics of Correlations in the Evolution of
Economic Entities Under Varying Economic Conditions},
author={Marcel Ausloos (Univ. de Liege), Paulette Clippe (Univ. de Liege) and
Andrzej Pekalski (University of Wroclaw)},
journal={Physica A 324 (2003... | ausloos2002simple |
arxiv-676976 | nlin/0211010 | Evolution and anti-evolution in a minimal stock market model | <|reference_start|>Evolution and anti-evolution in a minimal stock market model: We present a novel microscopic stock market model consisting of a large number of random agents modeling traders in a market. Each agent is characterized by a set of parameters that serve to make iterated predictions of two successive retu... | arxiv | @article{rothenstein2002evolution,
title={Evolution and anti-evolution in a minimal stock market model},
author={R. Rothenstein and K. Pawelzik},
journal={Physica A 326, 534-543(2003)},
year={2002},
doi={10.1016/S0378-4371(03)00396-0},
archivePrefix={arXiv},
eprint={nlin/0211010},
primar... | rothenstein2002evolution |
arxiv-676977 | nlin/0211013 | A Spin Glass Model of Human Logic Systems | <|reference_start|>A Spin Glass Model of Human Logic Systems: In this paper, we discuss different models for human logic systems and describe a game with nature. G\"odel`s incompleteness theorem is taken into account to construct a model of logical networks based on axioms obtained by symmetry breaking. These classical... | arxiv | @article{shafee2002a,
title={A Spin Glass Model of Human Logic Systems},
author={Fariel Shafee},
journal={arXiv preprint arXiv:nlin/0211013},
year={2002},
archivePrefix={arXiv},
eprint={nlin/0211013},
primaryClass={nlin.AO cond-mat.dis-nn cs.MA}
} | shafee2002a |
arxiv-676978 | nlin/0211024 | Exploring the cooperative regimes in a model of agents without memory or "tags": indirect reciprocity vs selfish incentives | <|reference_start|>Exploring the cooperative regimes in a model of agents without memory or "tags": indirect reciprocity vs selfish incentives: The self-organization in cooperative regimes in a simple mean-field version of a model based on "selfish" agents which play the Prisoner's Dilemma (PD) game is studied. The age... | arxiv | @article{fort2002exploring,
title={Exploring the cooperative regimes in a model of agents without memory or
"tags": indirect reciprocity vs. selfish incentives},
author={H. Fort},
journal={Physica A326 (2003) 286-298},
year={2002},
doi={10.1016/S0378-4371(03)00263-2},
archivePrefix={arXiv},
... | fort2002exploring |
arxiv-676979 | nlin/0212001 | A Generalization of Chaitin's Halting Probability \Omega and Halting Self-Similar Sets | <|reference_start|>A Generalization of Chaitin's Halting Probability \Omega and Halting Self-Similar Sets: We generalize the concept of randomness in an infinite binary sequence in order to characterize the degree of randomness by a real number D>0. Chaitin's halting probability \Omega is generalized to \Omega^D whose ... | arxiv | @article{tadaki2002a,
title={A Generalization of Chaitin's Halting Probability \Omega and Halting
Self-Similar Sets},
author={Kohtaro Tadaki},
journal={Hokkaido Mathematical Journal, Vol. 31, No. 1, February 2002,
219-253},
year={2002},
doi={10.14492/hokmj/1350911778},
archivePrefix={arXiv},... | tadaki2002a |
arxiv-676980 | nlin/0212030 | The structure of evolutionary exploration: On crossover, buildings blocks and Estimation-Of-Distribution Algorithms | <|reference_start|>The structure of evolutionary exploration: On crossover, buildings blocks and Estimation-Of-Distribution Algorithms: The notion of building blocks can be related to the structure of the offspring probability distribution: loci of which variability is strongly correlated constitute a building block. W... | arxiv | @article{toussaint2002the,
title={The structure of evolutionary exploration: On crossover, buildings
blocks and Estimation-Of-Distribution Algorithms},
author={Marc Toussaint},
journal={arXiv preprint arXiv:nlin/0212030},
year={2002},
archivePrefix={arXiv},
eprint={nlin/0212030},
primaryCl... | toussaint2002the |
arxiv-676981 | nlin/0303016 | Algorithmic Chaos | <|reference_start|>Algorithmic Chaos: Many physical theories like chaos theory are fundamentally concerned with the conceptual tension between determinism and randomness. Kolmogorov complexity can express randomness in determinism and gives an approach to formulate chaotic behavior.<|reference_end|> | arxiv | @article{vitanyi2003algorithmic,
title={Algorithmic Chaos},
author={Paul Vitanyi (CWI and University of Amsterdam)},
journal={arXiv preprint arXiv:nlin/0303016},
year={2003},
archivePrefix={arXiv},
eprint={nlin/0303016},
primaryClass={nlin.CD cs.CC math.DS}
} | vitanyi2003algorithmic |
arxiv-676982 | nlin/0303020 | When Can we Call a System Self-organizing? | <|reference_start|>When Can we Call a System Self-organizing?: We do not attempt to provide yet another definition of selforganization, but explore the conditions under which we can model a system as self-organizing. These involve the dynamics of entropy, and the purpose, aspects, and description level chosen by an obs... | arxiv | @article{gershenson2003when,
title={When Can we Call a System Self-organizing?},
author={Carlos Gershenson and Francis Heylighen},
journal={In Banzhaf, W, T. Christaller, P. Dittrich, J. T. Kim, and J.
Ziegler, Advances in Artificial Life, 7th European Conference, ECAL 2003,
Dortmund, Germany, pp. 606-6... | gershenson2003when |
arxiv-676983 | nlin/0303021 | Contextual Random Boolean Networks | <|reference_start|>Contextual Random Boolean Networks: We propose the use of Deterministic Generalized Asynchronous Random Boolean Networks [Gershenson, 2002] as models of contextual deterministic discrete dynamical systems. We show that changes in the context have drastic effects on the global properties of the same n... | arxiv | @article{gershenson2003contextual,
title={Contextual Random Boolean Networks},
author={Carlos Gershenson, Jan Broekaert, and Diederik Aerts},
journal={In Banzhaf, W, T. Christaller, P. Dittrich, J. T. Kim, and J.
Ziegler, Advances in Artificial Life, 7th European Conference, ECAL 2003,
Dortmund, Germany... | gershenson2003contextual |
arxiv-676984 | nlin/0304006 | Determining possible avenues of approach using ANTS | <|reference_start|>Determining possible avenues of approach using ANTS: Threat assessment is an important part of level 3 data fusion. Here we study a subproblem of this, worst-case risk assessment. Inspired by agent-based models used for simulation of trail formation for urban planning, we use ant colony optimization ... | arxiv | @article{svenson2003determining,
title={Determining possible avenues of approach using ANTS},
author={Pontus Svenson and Hedvig Sidenbladh},
journal={Proc 6th Int Conf Information Fusion, Cairns, p 1110 (2003)},
year={2003},
archivePrefix={arXiv},
eprint={nlin/0304006},
primaryClass={nlin.AO... | svenson2003determining |
arxiv-676985 | nlin/0306055 | A Model for Prejudiced Learning in Noisy Environments | <|reference_start|>A Model for Prejudiced Learning in Noisy Environments: Based on the heuristics that maintaining presumptions can be beneficial in uncertain environments, we propose a set of basic axioms for learning systems to incorporate the concept of prejudice. The simplest, memoryless model of a deterministic le... | arxiv | @article{schmidt2003a,
title={A Model for Prejudiced Learning in Noisy Environments},
author={Andreas U. Schmidt},
journal={Applied Mathematics and Computation, vol. 168, no. 1 (2005)
354-379},
year={2003},
doi={10.1016/j.amc.2004.09.003},
archivePrefix={arXiv},
eprint={nlin/0306055},
... | schmidt2003a |
arxiv-676986 | nlin/0309033 | The Interactive Minority Game: a Web-based investigation of human market interactions | <|reference_start|>The Interactive Minority Game: a Web-based investigation of human market interactions: The unprecedented access offered by the World Wide Web brings with it the potential to gather huge amounts of data on human activities. Here we exploit this by using a toy model of financial markets, the Minority G... | arxiv | @article{laureti2003the,
title={The Interactive Minority Game: a Web-based investigation of human market
interactions},
author={Paolo Laureti, Peter Ruch, Joseph Wakeling and Yi-Cheng Zhang},
journal={Physica A 331 (2004) 651-659},
year={2003},
doi={10.1016/j.physa.2003.07.002},
archivePrefix=... | laureti2003the |
arxiv-676987 | nlin/0309039 | Self-organizing Traffic Control: First Results | <|reference_start|>Self-organizing Traffic Control: First Results: We developed a virtual laboratory for traffic control where agents use different strategies in order to self-organize on the road. We present our first results where we compare the performance and behaviour promoted by environmental constrains and five ... | arxiv | @article{gershenson2003self-organizing,
title={Self-organizing Traffic Control: First Results},
author={Carlos Gershenson},
journal={arXiv preprint arXiv:nlin/0309039},
year={2003},
archivePrefix={arXiv},
eprint={nlin/0309039},
primaryClass={nlin.AO cs.MA}
} | gershenson2003self-organizing |
arxiv-676988 | nlin/0311008 | Phase Transitions in Random Boolean Networks with Different Updating Schemes | <|reference_start|>Phase Transitions in Random Boolean Networks with Different Updating Schemes: In this paper we study the phase transitions of different types of Random Boolean networks. These differ in their updating scheme: synchronous, semi-synchronous, or asynchronous, and deterministic or non-deterministic. It h... | arxiv | @article{gershenson2003phase,
title={Phase Transitions in Random Boolean Networks with Different Updating
Schemes},
author={Carlos Gershenson},
journal={arXiv preprint arXiv:nlin/0311008},
year={2003},
archivePrefix={arXiv},
eprint={nlin/0311008},
primaryClass={nlin.AO cond-mat.stat-mech c... | gershenson2003phase |
arxiv-676989 | nlin/0312056 | Shannon information, LMC complexity and Renyi entropies: a straightforward approach | <|reference_start|>Shannon information, LMC complexity and Renyi entropies: a straightforward approach: The LMC complexity, an indicator of complexity based on a probabilistic description, is revisited. A straightforward approach allows us to establish the time evolution of this indicator in a near-equilibrium situatio... | arxiv | @article{lopez-ruiz2003shannon,
title={Shannon information, LMC complexity and Renyi entropies: a
straightforward approach},
author={Ricardo Lopez-Ruiz},
journal={arXiv preprint arXiv:nlin/0312056},
year={2003},
archivePrefix={arXiv},
eprint={nlin/0312056},
primaryClass={nlin.AO cond-mat.s... | lopez-ruiz2003shannon |
arxiv-676990 | nlin/0402006 | Updating Schemes in Random Boolean Networks: Do They Really Matter? | <|reference_start|>Updating Schemes in Random Boolean Networks: Do They Really Matter?: In this paper we try to end the debate concerning the suitability of different updating schemes in random Boolean networks (RBNs). We quantify for the first time loose attractors in asyncrhonous RBNs, which allows us to analyze the ... | arxiv | @article{gershenson2004updating,
title={Updating Schemes in Random Boolean Networks: Do They Really Matter?},
author={Carlos Gershenson},
journal={In Pollack, J., M. Bedau, P. Husbands, T. Ikegami, and R. A.
Watson (eds.) Artificial Life IX, Proceedings of the Ninth International
Conference on the Simul... | gershenson2004updating |
arxiv-676991 | nlin/0402046 | Spontaneous Emergence of Complex Optimal Networks through Evolutionary Adaptation | <|reference_start|>Spontaneous Emergence of Complex Optimal Networks through Evolutionary Adaptation: An important feature of many complex systems, both natural and artificial, is the structure and organization of their interaction networks with interesting properties. Here we present a theory of self-organization by e... | arxiv | @article{venkatasubramanian2004spontaneous,
title={Spontaneous Emergence of Complex Optimal Networks through Evolutionary
Adaptation},
author={Venkat Venkatasubramanian, Santhoji Katare, Priyan R. Patkar, and
Fangping Mu},
journal={arXiv preprint arXiv:nlin/0402046},
year={2004},
archivePrefix={... | venkatasubramanian2004spontaneous |
arxiv-676992 | nlin/0404004 | Protocol Requirements for Self-organizing Artifacts: Towards an Ambient Intelligence | <|reference_start|>Protocol Requirements for Self-organizing Artifacts: Towards an Ambient Intelligence: We discuss which properties common-use artifacts should have to collaborate without human intervention. We conceive how devices, such as mobile phones, PDAs, and home appliances, could be seamlessly integrated to pr... | arxiv | @article{gershenson2004protocol,
title={Protocol Requirements for Self-organizing Artifacts: Towards an Ambient
Intelligence},
author={Carlos Gershenson and Francis Heylighen (Vrije Universiteit Brussel)},
journal={Minai, A., Braha, D., and Bar-Yam, Y., editors, Unifying Themes in
Complex Systems, volum... | gershenson2004protocol |
arxiv-676993 | nlin/0404032 | Metrics for more than two points at once | <|reference_start|>Metrics for more than two points at once: The conventional definition of a topological metric over a space specifies properties that must be obeyed by any measure of "how separated" two points in that space are. Here it is shown how to extend that definition, and in particular the triangle inequality... | arxiv | @article{wolpert2004metrics,
title={Metrics for more than two points at once},
author={David H. Wolpert},
journal={arXiv preprint arXiv:nlin/0404032},
year={2004},
archivePrefix={arXiv},
eprint={nlin/0404032},
primaryClass={nlin.AO cond-mat.other cs.LG math.GM}
} | wolpert2004metrics |
arxiv-676994 | nlin/0405038 | When Chaos Meets Computers | <|reference_start|>When Chaos Meets Computers: This paper focuses on an interesting phenomenon when chaos meets computers. It is found that digital computers are absolutely incapable of showing true long-time dynamics of some chaotic systems, including the tent map, the Bernoulli shift map and their analogues, even in ... | arxiv | @article{li2004when,
title={When Chaos Meets Computers},
author={Shujun Li},
journal={arXiv preprint arXiv:nlin/0405038},
year={2004},
archivePrefix={arXiv},
eprint={nlin/0405038},
primaryClass={nlin.CD cs.NA}
} | li2004when |
arxiv-676995 | nlin/0407032 | Application of Artificial Neural Network in Jitter Analysis of Dispersion-Managed Communication System | <|reference_start|>Application of Artificial Neural Network in Jitter Analysis of Dispersion-Managed Communication System: Artificial Neural Network (ANN) is used as numerical methode in solving modified Nonlinear Schroedinger (NLS) equation with Dispersion Managed System (DMS) for jitter analysis. We take the optical ... | arxiv | @article{zen2004application,
title={Application of Artificial Neural Network in Jitter Analysis of
Dispersion-Managed Communication System},
author={F.P. Zen, B.E. Gunara, W. Hidayat, Z.A. Thalib, H. Zainuddin, J.
Aminuddin},
journal={arXiv preprint arXiv:nlin/0407032},
year={2004},
archivePrefi... | zen2004application |
arxiv-676996 | nlin/0407052 | Breaking a chaos-noise-based secure communication scheme | <|reference_start|>Breaking a chaos-noise-based secure communication scheme: This paper studies the security of a secure communication scheme based on two discrete-time intermittently-chaotic systems synchronized via a common random driving signal. Some security defects of the scheme are revealed: 1) the key space can ... | arxiv | @article{li2004breaking,
title={Breaking a chaos-noise-based secure communication scheme},
author={Shujun Li, Gonzalo 'Alvarez, Guanrong Chen and Xuanqin Mou},
journal={Chaos, vol. 15, no. 1, art. no. 013703, March 2005},
year={2004},
doi={10.1063/1.1856711},
archivePrefix={arXiv},
eprint={n... | li2004breaking |
arxiv-676997 | nlin/0407062 | Construction of Single-valued Solutions for Nonintegrable Systems with the Help of the Painleve Test | <|reference_start|>Construction of Single-valued Solutions for Nonintegrable Systems with the Help of the Painleve Test: The Painleve test is very useful to construct not only the Laurent-series solutions but also the elliptic and trigonometric ones. Such single-valued functions are solutions of some polynomial first o... | arxiv | @article{vernov2004construction,
title={Construction of Single-valued Solutions for Nonintegrable Systems with
the Help of the Painleve Test},
author={S. Yu. Vernov (Skobeltsyn Institute of Nuclear Physics of Moscow State
University)},
journal={arXiv preprint arXiv:nlin/0407062},
year={2004},
ar... | vernov2004construction |
arxiv-676998 | nlin/0408006 | Introduction to Random Boolean Networks | <|reference_start|>Introduction to Random Boolean Networks: The goal of this tutorial is to promote interest in the study of random Boolean networks (RBNs). These can be very interesting models, since one does not have to assume any functionality or particular connectivity of the networks to study their generic propert... | arxiv | @article{gershenson2004introduction,
title={Introduction to Random Boolean Networks},
author={Carlos Gershenson},
journal={In Bedau, M., P. Husbands, T. Hutton, S. Kumar, and H. Suzuki
(eds.) Workshop and Tutorial Proceedings, Ninth International Conference on
the Simulation and Synthesis of Living Syst... | gershenson2004introduction |
arxiv-676999 | nlin/0408007 | Entropy Maximization as a Holistic Design Principle for Complex Optimal Networks and the Emergence of Power Laws | <|reference_start|>Entropy Maximization as a Holistic Design Principle for Complex Optimal Networks and the Emergence of Power Laws: We present a general holistic theory for the organization of complex networks, both human-engineered and naturally-evolved. Introducing concepts of value of interactions and satisfaction ... | arxiv | @article{venkatasubramanian2004entropy,
title={Entropy Maximization as a Holistic Design Principle for Complex Optimal
Networks and the Emergence of Power Laws},
author={Venkat Venkatasubramanian, Dimitris N. Politis and Priyan R. Patkar},
journal={arXiv preprint arXiv:nlin/0408007},
year={2004},
... | venkatasubramanian2004entropy |
arxiv-677000 | nlin/0408039 | Stability and Diversity in Collective Adaptation | <|reference_start|>Stability and Diversity in Collective Adaptation: We derive a class of macroscopic differential equations that describe collective adaptation, starting from a discrete-time stochastic microscopic model. The behavior of each agent is a dynamic balance between adaptation that locally achieves the best ... | arxiv | @article{sato2004stability,
title={Stability and Diversity in Collective Adaptation},
author={Yuzuru Sato, Eizo Akiyama, James P. Crutchfield},
journal={arXiv preprint arXiv:nlin/0408039},
year={2004},
doi={10.1016/j.physd.2005.06.031},
number={Santa Fe Institute Working Paper 04-08-025},
ar... | sato2004stability |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.