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-1101 | 0708.4407 | Algebraic Distributed Differential Space-Time Codes with Low Decoding Complexity | <|reference_start|>Algebraic Distributed Differential Space-Time Codes with Low Decoding Complexity: The differential encoding/decoding setup introduced by Kiran et al, Oggier-Hassibi and Jing-Jafarkhani for wireless relay networks that use codebooks consisting of unitary matrices is extended to allow codebooks consisting of scaled unitary matrices. For such codebooks to be usable in the Jing-Hassibi protocol for cooperative diversity, the conditions involving the relay matrices and the codebook that need to be satisfied are identified. Using the algebraic framework of extended Clifford algebras, a new class of Distributed Differential Space-Time Codes satisfying these conditions for power of two number of relays and also achieving full cooperative diversity with a low complexity sub-optimal receiver is proposed. Simulation results indicate that the proposed codes outperform both the cyclic codes as well as the circulant codes. Furthermore, these codes can also be applied as Differential Space-Time codes for non-coherent communication in classical point to point multiple antenna systems.<|reference_end|> | arxiv | @article{rajan2007algebraic,
title={Algebraic Distributed Differential Space-Time Codes with Low Decoding
Complexity},
author={G. Susinder Rajan and B. Sundar Rajan},
journal={arXiv preprint arXiv:0708.4407},
year={2007},
archivePrefix={arXiv},
eprint={0708.4407},
primaryClass={cs.IT cs.DM math.IT math.RA}
} | rajan2007algebraic |
arxiv-1102 | 0708.4409 | Characterizations of finite and infinite episturmian words via lexicographic orderings | <|reference_start|>Characterizations of finite and infinite episturmian words via lexicographic orderings: In this paper, we characterize by lexicographic order all finite Sturmian and episturmian words, i.e., all (finite) factors of such infinite words. Consequently, we obtain a characterization of infinite episturmian words in a "wide sense" (episturmian and episkew infinite words). That is, we characterize the set of all infinite words whose factors are (finite) episturmian. Similarly, we characterize by lexicographic order all balanced infinite words over a 2-letter alphabet; in other words, all Sturmian and skew infinite words, the factors of which are (finite) Sturmian.<|reference_end|> | arxiv | @article{glen2007characterizations,
title={Characterizations of finite and infinite episturmian words via
lexicographic orderings},
author={Amy Glen, Jacques Justin, Giuseppe Pirillo},
journal={European Journal of Combinatorics 29 (2008) 45-58},
year={2007},
doi={10.1016/j.ejc.2007.01.002},
archivePrefix={arXiv},
eprint={0708.4409},
primaryClass={math.CO cs.DM}
} | glen2007characterizations |
arxiv-1103 | 0709.0035 | On The Limitations of The Naive Lattice Decoding | <|reference_start|>On The Limitations of The Naive Lattice Decoding: In this paper, the inherent drawbacks of the naive lattice decoding for MIMO fading systems is investigated. We show that using the naive lattice decoding for MIMO systems has considerable deficiencies in terms of the rate-diversity trade-off. Unlike the case of maximum-likelihood decoding, in this case, even the perfect lattice space-time codes which have the non-vanishing determinant property can not achieve the optimal rate-diversity trade-off. Indeed, we show that in the case of naive lattice decoding, when we fix the underlying lattice, all the codes based on full-rate lattices have the same rate-diversity trade-off as V-BLAST. Also, we drive a lower bound on the symbol error probability of the naive lattice decoding for the fixed-rate MIMO systems (with equal numbers of receive and transmit antennas). This bound shows that asymptotically, the naive lattice decoding has an unbounded loss in terms of the required SNR, compared to the maximum likelihood decoding.<|reference_end|> | arxiv | @article{taherzadeh2007on,
title={On The Limitations of The Naive Lattice Decoding},
author={Mahmoud Taherzadeh and Amir K. Khandani},
journal={arXiv preprint arXiv:0709.0035},
year={2007},
archivePrefix={arXiv},
eprint={0709.0035},
primaryClass={cs.IT math.IT}
} | taherzadeh2007on |
arxiv-1104 | 0709.0099 | The road coloring problem | <|reference_start|>The road coloring problem: The synchronizing word of deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of edges of a directed graph is synchronizing if the coloring turns the graph into deterministic finite automaton possessing a synchronizing word. The road coloring problem is a problem of synchronizing coloring of directed finite strongly connected graph with constant outdegree of all its vertices if the greatest common divisor of lengths of all its cycles is one. The problem was posed by Adler, Goodwyn and Weiss over 30 years ago and evoked a noticeable interest among the specialists in theory of graphs, deterministic automata and symbolic dynamics. The problem is described even in "Wikipedia" - the popular Internet Encyclopedia. The positive solution of the road coloring problem is presented.<|reference_end|> | arxiv | @article{trahtman2007the,
title={The road coloring problem},
author={A. N. Trahtman},
journal={arXiv preprint arXiv:0709.0099},
year={2007},
archivePrefix={arXiv},
eprint={0709.0099},
primaryClass={cs.DM}
} | trahtman2007the |
arxiv-1105 | 0709.0116 | On Ultrametric Algorithmic Information | <|reference_start|>On Ultrametric Algorithmic Information: How best to quantify the information of an object, whether natural or artifact, is a problem of wide interest. A related problem is the computability of an object. We present practical examples of a new way to address this problem. By giving an appropriate representation to our objects, based on a hierarchical coding of information, we exemplify how it is remarkably easy to compute complex objects. Our algorithmic complexity is related to the length of the class of objects, rather than to the length of the object.<|reference_end|> | arxiv | @article{murtagh2007on,
title={On Ultrametric Algorithmic Information},
author={Fionn Murtagh},
journal={Computer Journal, 53, 405-416, 2010},
year={2007},
doi={10.1093/comjnl/bxm084},
archivePrefix={arXiv},
eprint={0709.0116},
primaryClass={cs.AI cs.CL}
} | murtagh2007on |
arxiv-1106 | 0709.0124 | High Rate Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks | <|reference_start|>High Rate Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks: Distributed Orthogonal Space-Time Block Codes (DOSTBCs) achieving full diversity order and single-symbol ML decodability have been introduced recently by Yi and Kim for cooperative networks and an upperbound on the maximal rate of such codes along with code constructions has been presented. In this paper, we introduce a new class of Distributed STBCs called Semi-orthogonal Precoded Distributed Single-Symbol Decodable STBCs (S-PDSSDC) wherein, the source performs co-ordinate interleaving of information symbols appropriately before transmitting it to all the relays. It is shown that DOSTBCs are a special case of S-PDSSDCs. A special class of S-PDSSDCs having diagonal covariance matrix at the destination is studied and an upperbound on the maximal rate of such codes is derived. The bounds obtained are approximately twice larger than that of the DOSTBCs. A systematic construction of S-PDSSDCs is presented when the number of relays $K \geq 4$. The constructed codes are shown to achieve the upperbound on the rate when $K$ is of the form 0 or 3 modulo 4. For the rest of the values of $K$, the constructed codes are shown to have rates higher than that of DOSTBCs. It is shown that S-PDSSDCs cannot be constructed with any form of linear processing at the relays when the source doesn't perform co-ordinate interleaving of the information symbols. Simulation result shows that S-PDSSDCs have better probability of error performance than that of DOSTBCs.<|reference_end|> | arxiv | @article{j.2007high,
title={High Rate Single-Symbol ML Decodable Precoded DSTBCs for Cooperative
Networks},
author={Harshan J. and B. Sundar Rajan},
journal={arXiv preprint arXiv:0709.0124},
year={2007},
archivePrefix={arXiv},
eprint={0709.0124},
primaryClass={cs.IT math.IT}
} | j.2007high |
arxiv-1107 | 0709.0145 | Estimating Random Variables from Random Sparse Observations | <|reference_start|>Estimating Random Variables from Random Sparse Observations: Let X_1,...., X_n be a collection of iid discrete random variables, and Y_1,..., Y_m a set of noisy observations of such variables. Assume each observation Y_a to be a random function of some a random subset of the X_i's, and consider the conditional distribution of X_i given the observations, namely \mu_i(x_i)\equiv\prob\{X_i=x_i|Y\} (a posteriori probability). We establish a general relation between the distribution of \mu_i, and the fixed points of the associated density evolution operator. Such relation holds asymptotically in the large system limit, provided the average number of variables an observation depends on is bounded. We discuss the relevance of our result to a number of applications, ranging from sparse graph codes, to multi-user detection, to group testing.<|reference_end|> | arxiv | @article{montanari2007estimating,
title={Estimating Random Variables from Random Sparse Observations},
author={Andrea Montanari},
journal={arXiv preprint arXiv:0709.0145},
year={2007},
archivePrefix={arXiv},
eprint={0709.0145},
primaryClass={cs.IT math.IT math.PR}
} | montanari2007estimating |
arxiv-1108 | 0709.0170 | Untangling a Planar Graph | <|reference_start|>Untangling a Planar Graph: A straight-line drawing $\delta$ of a planar graph $G$ need not be plane, but can be made so by \emph{untangling} it, that is, by moving some of the vertices of $G$. Let shift$(G,\delta)$ denote the minimum number of vertices that need to be moved to untangle $\delta$. We show that shift$(G,\delta)$ is NP-hard to compute and to approximate. Our hardness results extend to a version of \textsc{1BendPointSetEmbeddability}, a well-known graph-drawing problem. Further we define fix$(G,\delta)=n-shift(G,\delta)$ to be the maximum number of vertices of a planar $n$-vertex graph $G$ that can be fixed when untangling $\delta$. We give an algorithm that fixes at least $\sqrt{((\log n)-1)/\log \log n}$ vertices when untangling a drawing of an $n$-vertex graph $G$. If $G$ is outerplanar, the same algorithm fixes at least $\sqrt{n/2}$ vertices. On the other hand we construct, for arbitrarily large $n$, an $n$-vertex planar graph $G$ and a drawing $\delta_G$ of $G$ with fix$(G,\delta_G) \le \sqrt{n-2}+1$ and an $n$-vertex outerplanar graph $H$ and a drawing $\delta_H$ of $H$ with fix$(H,\delta_H) \le 2 \sqrt{n-1}+1$. Thus our algorithm is asymptotically worst-case optimal for outerplanar graphs.<|reference_end|> | arxiv | @article{goaoc2007untangling,
title={Untangling a Planar Graph},
author={Xavier Goaoc and Jan Kratochvil and Yoshio Okamoto and Chan-Su Shin
and Andreas Spillner and Alexander Wolff},
journal={arXiv preprint arXiv:0709.0170},
year={2007},
doi={10.1007/s00454-008-9130-6},
archivePrefix={arXiv},
eprint={0709.0170},
primaryClass={cs.CG cs.DM}
} | goaoc2007untangling |
arxiv-1109 | 0709.0178 | Effective Generation of Subjectively Random Binary Sequences | <|reference_start|>Effective Generation of Subjectively Random Binary Sequences: We present an algorithm for effectively generating binary sequences which would be rated by people as highly likely to have been generated by a random process, such as flipping a fair coin.<|reference_end|> | arxiv | @article{sanderson2007effective,
title={Effective Generation of Subjectively Random Binary Sequences},
author={Yasmine B. Sanderson},
journal={arXiv preprint arXiv:0709.0178},
year={2007},
archivePrefix={arXiv},
eprint={0709.0178},
primaryClass={cs.HC cs.AI}
} | sanderson2007effective |
arxiv-1110 | 0709.0204 | Capacity constraints and the inevitability of mediators in adword auctions | <|reference_start|>Capacity constraints and the inevitability of mediators in adword auctions: One natural constraint in the sponsored search advertising framework arises from the fact that there is a limit on the number of available slots, especially for the popular keywords, and as a result, a significant pool of advertisers are left out. We study the emergence of diversification in the adword market triggered by such capacity constraints in the sense that new market mechanisms, as well as, new for-profit agents are likely to emerge to combat or to make profit from the opportunities created by shortages in ad-space inventory. We propose a model where the additional capacity is provided by for-profit agents (or, mediators), who compete for slots in the original auction, draw traffic, and run their own sub-auctions. The quality of the additional capacity provided by a mediator is measured by its {\it fitness} factor. We compute revenues and payoffs for all the different parties at a {\it symmetric Nash equilibrium} (SNE) when the mediator-based model is operated by a mechanism currently being used by Google and Yahoo!, and then compare these numbers with those obtained at a corresponding SNE for the same mechanism, but without any mediators involved in the auctions. Such calculations allow us to determine the value of the additional capacity. Our results show that the revenue of the auctioneer, as well as the social value (i.e. efficiency), always increase when mediators are involved; moreover even the payoffs of {\em all} the bidders will increase if the mediator has a high enough fitness. Thus, our analysis indicates that there are significant opportunities for diversification in the internet economy and we should expect it to continue to develop richer structure, with room for different types of agents and mechanisms to coexist.<|reference_end|> | arxiv | @article{singh2007capacity,
title={Capacity constraints and the inevitability of mediators in adword
auctions},
author={Sudhir Kumar Singh, Vwani P. Roychowdhury, Himawan Gunadhi, Behnam A.
Rezaei},
journal={arXiv preprint arXiv:0709.0204},
year={2007},
archivePrefix={arXiv},
eprint={0709.0204},
primaryClass={cs.GT}
} | singh2007capacity |
arxiv-1111 | 0709.0218 | Inferring Neuronal Network Connectivity using Time-constrained Episodes | <|reference_start|>Inferring Neuronal Network Connectivity using Time-constrained Episodes: Discovering frequent episodes in event sequences is an interesting data mining task. In this paper, we argue that this framework is very effective for analyzing multi-neuronal spike train data. Analyzing spike train data is an important problem in neuroscience though there are no data mining approaches reported for this. Motivated by this application, we introduce different temporal constraints on the occurrences of episodes. We present algorithms for discovering frequent episodes under temporal constraints. Through simulations, we show that our method is very effective for analyzing spike train data for unearthing underlying connectivity patterns.<|reference_end|> | arxiv | @article{patnaik2007inferring,
title={Inferring Neuronal Network Connectivity using Time-constrained Episodes},
author={Debprakash Patnaik (Electrical Engg. Dept., Indian Institute of
Science), P. S. Sastry (Electrical Engg. Dept., Indian Institute of Science),
K. P. Unnikrishnan (General Motors R&D)},
journal={arXiv preprint arXiv:0709.0218},
year={2007},
archivePrefix={arXiv},
eprint={0709.0218},
primaryClass={cs.DB q-bio.NC}
} | patnaik2007inferring |
arxiv-1112 | 0709.0223 | Brief encounter networks | <|reference_start|>Brief encounter networks: Many complex human and natural phenomena can usefully be represented as networks describing the relationships between individuals. While these relationships are typically intermittent, previous research has used network representations that aggregate the relationships at discrete intervals. However, such an aggregation discards important temporal information, thus inhibiting our understanding of the networks dynamic behaviour and evolution. We have recorded patterns of human urban encounter using Bluetooth technology thus retaining the temporal properties of this network. Here we show how this temporal information influences the structural properties of the network. We show that the temporal properties of human urban encounter are scale-free, leading to an overwhelming proportion of brief encounters between individuals. While previous research has shown preferential attachment to result in scale-free connectivity in aggregated network data, we found that scale-free connectivity results from the temporal properties of the network. In addition, we show that brief encounters act as weak social ties in the diffusion of non-expiring information, yet persistent encounters provide the means for sustaining time-expiring information through a network.<|reference_end|> | arxiv | @article{kostakos2007brief,
title={Brief encounter networks},
author={Vassilis Kostakos, Eamonn O'Neill, Alan Penn},
journal={ACM Transactions on Computer Human Interaction, 17(1):1-38, 2010},
year={2007},
doi={10.1145/1721831.1721833},
archivePrefix={arXiv},
eprint={0709.0223},
primaryClass={cs.CY}
} | kostakos2007brief |
arxiv-1113 | 0709.0259 | Spectrum Sensing in Wideband OFDM Cognitive Radios | <|reference_start|>Spectrum Sensing in Wideband OFDM Cognitive Radios: In this paper, detection of the primary user (PU) signal in an orthogonal frequency division multiplexing (OFDM) based cognitive radio (CR) system is addressed. According to the prior knowledge of the PU signal known to the detector, three detection algorithms based on the Neyman-Pearson philosophy are proposed. In the first case, a Gaussian PU signal with completely known probability density function (PDF) except for its received power is considered. The frequency band that the PU signal resides is also assumed known. Detection is performed individually at each OFDM sub-carrier possibly interfered by the PU signal, and the results are then combined to form a final decision. In the second case, the sub-carriers that the PU signal resides are known. Observations from all possibly interfered sub-carriers are considered jointly to exploit the fact that the presence of a PU signal interferers all of them simultaneously. In the last case, it is assumed no PU signal prior knowledge is available. The detection is involved with a search of the interfered band. The proposed detector is able to detect an abrupt power change when tracing along the frequency axis.<|reference_end|> | arxiv | @article{hwang2007spectrum,
title={Spectrum Sensing in Wideband OFDM Cognitive Radios},
author={Chien-Hwa Hwang and Shih-Chang Chen},
journal={arXiv preprint arXiv:0709.0259},
year={2007},
archivePrefix={arXiv},
eprint={0709.0259},
primaryClass={cs.IT math.IT}
} | hwang2007spectrum |
arxiv-1114 | 0709.0289 | Cryptography in the Bounded-Quantum-Storage Model | <|reference_start|>Cryptography in the Bounded-Quantum-Storage Model: This thesis initiates the study of cryptographic protocols in the bounded-quantum-storage model. On the practical side, simple protocols for Rabin Oblivious Transfer, 1-2 Oblivious Transfer and Bit Commitment are presented. No quantum memory is required for honest players, whereas the protocols can only be broken by an adversary controlling a large amount of quantum memory. The protocols are efficient, non-interactive and can be implemented with today's technology. On the theoretical side, new entropic uncertainty relations involving min-entropy are established and used to prove the security of protocols according to new strong security definitions. For instance, in the realistic setting of Quantum Key Distribution (QKD) against quantum-memory-bounded eavesdroppers, the uncertainty relation allows to prove the security of QKD protocols while tolerating considerably higher error rates compared to the standard model with unbounded adversaries.<|reference_end|> | arxiv | @article{schaffner2007cryptography,
title={Cryptography in the Bounded-Quantum-Storage Model},
author={Christian Schaffner},
journal={arXiv preprint arXiv:0709.0289},
year={2007},
archivePrefix={arXiv},
eprint={0709.0289},
primaryClass={quant-ph cs.CR}
} | schaffner2007cryptography |
arxiv-1115 | 0709.0303 | Navigability of Complex Networks | <|reference_start|>Navigability of Complex Networks: Routing information through networks is a universal phenomenon in both natural and manmade complex systems. When each node has full knowledge of the global network connectivity, finding short communication paths is merely a matter of distributed computation. However, in many real networks nodes communicate efficiently even without such global intelligence. Here we show that the peculiar structural characteristics of many complex networks support efficient communication without global knowledge. We also describe a general mechanism that explains this connection between network structure and function. This mechanism relies on the presence of a metric space hidden behind an observable network. Our findings suggest that real networks in nature have underlying metric spaces that remain undiscovered. Their discovery would have practical applications ranging from routing in the Internet and searching social networks, to studying information flows in neural, gene regulatory networks, or signaling pathways.<|reference_end|> | arxiv | @article{boguna2007navigability,
title={Navigability of Complex Networks},
author={Marian Boguna, Dmitri Krioukov, kc claffy},
journal={Nature Physics 5, 74-80 (2009)},
year={2007},
doi={10.1038/NPHYS1130},
archivePrefix={arXiv},
eprint={0709.0303},
primaryClass={physics.soc-ph cond-mat.dis-nn cs.NI}
} | boguna2007navigability |
arxiv-1116 | 0709.0355 | Solution of moving-boundary problems by the spectral element method | <|reference_start|>Solution of moving-boundary problems by the spectral element method: This paper describes a novel numerical model aiming at solving moving-boundary problems such as free-surface flows or fluid-structure interaction. This model uses a moving-grid technique to solve the Navier--Stokes equations expressed in the arbitrary Lagrangian--Eulerian kinematics. The discretization in space is based on the spectral element method. The coupling of the fluid equations and the moving-grid equations is essentially done through the conditions on the moving boundaries. Two- and three-dimensional simulations are presented: translation and rotation of a cylinder in a fluid, and large-amplitude sloshing in a rectangular tank. The accuracy and robustness of the present numerical model is studied and discussed.<|reference_end|> | arxiv | @article{bodard2007solution,
title={Solution of moving-boundary problems by the spectral element method},
author={Nicolas Bodard, Roland Bouffanais, Michel O. Deville},
journal={Applied Numerial Mathematics 58 (2008) 968-984},
year={2007},
doi={10.1016/j.apnum.2007.04.009},
archivePrefix={arXiv},
eprint={0709.0355},
primaryClass={cs.CE cs.NA}
} | bodard2007solution |
arxiv-1117 | 0709.0367 | Relationship between clustering and algorithmic phase transitions in the random k-XORSAT model and its NP-complete extensions | <|reference_start|>Relationship between clustering and algorithmic phase transitions in the random k-XORSAT model and its NP-complete extensions: We study the performances of stochastic heuristic search algorithms on Uniquely Extendible Constraint Satisfaction Problems with random inputs. We show that, for any heuristic preserving the Poissonian nature of the underlying instance, the (heuristic-dependent) largest ratio $\alpha_a$ of constraints per variables for which a search algorithm is likely to find solutions is smaller than the critical ratio $\alpha_d$ above which solutions are clustered and highly correlated. In addition we show that the clustering ratio can be reached when the number k of variables per constraints goes to infinity by the so-called Generalized Unit Clause heuristic.<|reference_end|> | arxiv | @article{altarelli2007relationship,
title={Relationship between clustering and algorithmic phase transitions in the
random k-XORSAT model and its NP-complete extensions},
author={Fabrizio Altarelli, Remi Monasson and Francesco Zamponi},
journal={Journal of Physics: Conference Series 95 (2008) 012013},
year={2007},
doi={10.1088/1742-6596/95/1/012013},
archivePrefix={arXiv},
eprint={0709.0367},
primaryClass={cs.CC}
} | altarelli2007relationship |
arxiv-1118 | 0709.0370 | An Integrated Simulation System for Human Factors Study | <|reference_start|>An Integrated Simulation System for Human Factors Study: It has been reported that virtual reality can be a useful tool for ergonomics study. The proposed integrated simulation system aims at measuring operator's performance in an interactive way for 2D control panel design. By incorporating some sophisticated virtual reality hardware/software, the system allows natural human-system and/or human-human interaction in a simulated virtual environment; enables dynamic objective measurement of human performance; and evaluates the quality of the system design in human factors perspective based on the measurement. It can also be for operation training for some 2D control panels.<|reference_end|> | arxiv | @article{wang2007an,
title={An Integrated Simulation System for Human Factors Study},
author={Ying Wang (DIE), Wei Zhang (DIE), Fouad Bennis (IRCCyN), Damien
Chablat (IRCCyN)},
journal={Dans The Institute of Industrial Engineers Annual Conference - The
Institute of Industrial Engineers Annual Conference, Orlando : \'Etats-Unis
d'Am\'erique (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0709.0370},
primaryClass={cs.HC}
} | wang2007an |
arxiv-1119 | 0709.0409 | A DH-parameter based condition for 3R orthogonal manipulators to have 4 distinct inverse kinematic solutions | <|reference_start|>A DH-parameter based condition for 3R orthogonal manipulators to have 4 distinct inverse kinematic solutions: Positioning 3R manipulators may have two or four inverse kinematic solutions (IKS). This paper derives a necessary and sufficient condition for 3R positioning manipulators with orthogonal joint axes to have four distinct IKS. We show that the transition between manipulators with 2 and 4 IKS is defined by the set of manipulators with a quadruple root of their inverse kinematics. The resulting condition is explicit and states that the last link length of the manipulator must be greater than a quantity that depends on three of its remaining DH-parameters. This result is of interest for the design of new manipulators.<|reference_end|> | arxiv | @article{wenger2007a,
title={A DH-parameter based condition for 3R orthogonal manipulators to have 4
distinct inverse kinematic solutions},
author={Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN), Maher Baili
(IRCCyN)},
journal={Journal of Mechanical Design 127 (2005) 150-155},
year={2007},
archivePrefix={arXiv},
eprint={0709.0409},
primaryClass={cs.RO}
} | wenger2007a |
arxiv-1120 | 0709.0426 | Do oral messages help visual search? | <|reference_start|>Do oral messages help visual search?: A preliminary experimental study is presented, that aims at eliciting the contribution of oral messages to facilitating visual search tasks on crowded visual displays. Results of quantitative and qualitative analyses suggest that appropriate verbal messages can improve both target selection time and accuracy. In particular, multimodal messages including a visual presentation of the isolated target together with absolute spatial oral information on its location in the displayed scene seem most effective. These messages also got top-ranking ratings from most subjects.<|reference_end|> | arxiv | @article{carbonell2007do,
title={Do oral messages help visual search?},
author={No"elle Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA),
Suzanne Kieffer (INRIA Rocquencourt / INRIA Lorraine - LORIA)},
journal={Advances in Natural Multimodal Dialogue Systems, Dordrecht (NL)
Springer (Ed.) (2005) pp. 131-157},
year={2007},
archivePrefix={arXiv},
eprint={0709.0426},
primaryClass={cs.HC}
} | carbonell2007do |
arxiv-1121 | 0709.0428 | Oral messages improve visual search | <|reference_start|>Oral messages improve visual search: Input multimodality combining speech and hand gestures has motivated numerous usability studies. Contrastingly, issues relating to the design and ergonomic evaluation of multimodal output messages combining speech with visual modalities have not yet been addressed extensively. The experimental study presented here addresses one of these issues. Its aim is to assess the actual efficiency and usability of oral system messages including brief spatial information for helping users to locate objects on crowded displays rapidly. Target presentation mode, scene spatial structure and task difficulty were chosen as independent variables. Two conditions were defined: the visual target presentation mode (VP condition) and the multimodal target presentation mode (MP condition). Each participant carried out two blocks of visual search tasks (120 tasks per block, and one block per condition). Scene target presentation mode, scene structure and task difficulty were found to be significant factors. Multimodal target presentation proved to be more efficient than visual target presentation. In addition, participants expressed very positive judgments on multimodal target presentations which were preferred to visual presentations by a majority of participants. Besides, the contribution of spatial messages to visual search speed and accuracy was influenced by scene spatial structure and task difficulty: (i) messages improved search efficiency to a lesser extent for 2D array layouts than for some other symmetrical layouts, although the use of 2D arrays for displaying pictures is currently prevailing; (ii) message usefulness increased with task difficulty. Most of these results are statistically significant.<|reference_end|> | arxiv | @article{kieffer2007oral,
title={Oral messages improve visual search},
author={Suzanne Kieffer (INRIA Rocquencourt / INRIA Lorraine - LORIA),
No"elle Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA)},
journal={Dans Proceedings of ACM Working Conference on Advanced Visual
Interfaces - ACM Working Conference on Advanced Visual Interfaces (AVI 2006),
Venezia : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0709.0428},
primaryClass={cs.HC}
} | kieffer2007oral |
arxiv-1122 | 0709.0435 | A Generic Approach to Coalition Formation | <|reference_start|>A Generic Approach to Coalition Formation: We propose an abstract approach to coalition formation that focuses on simple merge and split rules transforming partitions of a group of players. We identify conditions under which every iteration of these rules yields a unique partition. The main conceptual tool is a specific notion of a stable partition. The results are parametrized by a preference relation between partitions of a group of players and naturally apply to coalitional TU-games, hedonic games and exchange economy games.<|reference_end|> | arxiv | @article{apt2007a,
title={A Generic Approach to Coalition Formation},
author={Krzysztof R. Apt and Andreas Witzel},
journal={arXiv preprint arXiv:0709.0435},
year={2007},
archivePrefix={arXiv},
eprint={0709.0435},
primaryClass={cs.GT}
} | apt2007a |
arxiv-1123 | 0709.0446 | Logic Column 19: Symbolic Model Checking for Temporal-Epistemic Logics | <|reference_start|>Logic Column 19: Symbolic Model Checking for Temporal-Epistemic Logics: This article surveys some of the recent work in verification of temporal epistemic logic via symbolic model checking, focusing on OBDD-based and SAT-based approaches for epistemic logics built on discrete and real-time branching time temporal logics.<|reference_end|> | arxiv | @article{lomuscio2007logic,
title={Logic Column 19: Symbolic Model Checking for Temporal-Epistemic Logics},
author={Alessio Lomuscio and Wojciech Penczek},
journal={arXiv preprint arXiv:0709.0446},
year={2007},
archivePrefix={arXiv},
eprint={0709.0446},
primaryClass={cs.LO}
} | lomuscio2007logic |
arxiv-1124 | 0709.0492 | Composable Security in the Bounded-Quantum-Storage Model | <|reference_start|>Composable Security in the Bounded-Quantum-Storage Model: We present a simplified framework for proving sequential composability in the quantum setting. In particular, we give a new, simulation-based, definition for security in the bounded-quantum-storage model, and show that this definition allows for sequential composition of protocols. Damgard et al. (FOCS '05, CRYPTO '07) showed how to securely implement bit commitment and oblivious transfer in the bounded-quantum-storage model, where the adversary is only allowed to store a limited number of qubits. However, their security definitions did only apply to the standalone setting, and it was not clear if their protocols could be composed. Indeed, we first give a simple attack that shows that these protocols are not composable without a small refinement of the model. Finally, we prove the security of their randomized oblivious transfer protocol in our refined model. Secure implementations of oblivious transfer and bit commitment then follow easily by a (classical) reduction to randomized oblivious transfer.<|reference_end|> | arxiv | @article{wehner2007composable,
title={Composable Security in the Bounded-Quantum-Storage Model},
author={Stephanie Wehner, J"urg Wullschleger},
journal={Proceedings of ICALP 2008, pages 604--615},
year={2007},
archivePrefix={arXiv},
eprint={0709.0492},
primaryClass={quant-ph cs.CR}
} | wehner2007composable |
arxiv-1125 | 0709.0509 | Filtering Additive Measurement Noise with Maximum Entropy in the Mean | <|reference_start|>Filtering Additive Measurement Noise with Maximum Entropy in the Mean: The purpose of this note is to show how the method of maximum entropy in the mean (MEM) may be used to improve parametric estimation when the measurements are corrupted by large level of noise. The method is developed in the context on a concrete example: that of estimation of the parameter in an exponential distribution. We compare the performance of our method with the bayesian and maximum likelihood approaches.<|reference_end|> | arxiv | @article{gzyl2007filtering,
title={Filtering Additive Measurement Noise with Maximum Entropy in the Mean},
author={Henryk Gzyl and Enrique ter Horst},
journal={arXiv preprint arXiv:0709.0509},
year={2007},
archivePrefix={arXiv},
eprint={0709.0509},
primaryClass={cs.LG}
} | gzyl2007filtering |
arxiv-1126 | 0709.0511 | Double Clustering and Graph Navigability | <|reference_start|>Double Clustering and Graph Navigability: Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to meet strict criteria. Since such graphs nevertheless seem to appear in nature, it is of interest to understand why these criteria should be fulfilled. In this paper we present a simple method for constructing graphs based on a model where nodes vertices are ``similar'' in two different ways, and tend to connect to those most similar to them - or cluster - with respect to both. We prove that this leads to navigable networks for several cases, and hypothesize that it also holds in great generality. Enough generality, perhaps, to explain the occurrence of navigable networks in nature.<|reference_end|> | arxiv | @article{sandberg2007double,
title={Double Clustering and Graph Navigability},
author={Oskar Sandberg},
journal={arXiv preprint arXiv:0709.0511},
year={2007},
archivePrefix={arXiv},
eprint={0709.0511},
primaryClass={math.PR cs.DS math.CO}
} | sandberg2007double |
arxiv-1127 | 0709.0516 | Competition in Wireless Systems via Bayesian Interference Games | <|reference_start|>Competition in Wireless Systems via Bayesian Interference Games: We study competition between wireless devices with incomplete information about their opponents. We model such interactions as Bayesian interference games. Each wireless device selects a power profile over the entire available bandwidth to maximize its data rate. Such competitive models represent situations in which several wireless devices share spectrum without any central authority or coordinated protocol. In contrast to games where devices have complete information about their opponents, we consider scenarios where the devices are unaware of the interference they cause to other devices. Such games, which are modeled as Bayesian games, can exhibit significantly different equilibria. We first consider a simple scenario of simultaneous move games, where we show that the unique Bayes-Nash equilibrium is where both devices spread their power equally across the entire bandwidth. We then extend this model to a two-tiered spectrum sharing case where users act sequentially. Here one of the devices, called the primary user, is the owner of the spectrum and it selects its power profile first. The second device (called the secondary user) then responds by choosing a power profile to maximize its Shannon capacity. In such sequential move games, we show that there exist equilibria in which the primary user obtains a higher data rate by using only a part of the bandwidth. In a repeated Bayesian interference game, we show the existence of reputation effects: an informed primary user can bluff to prevent spectrum usage by a secondary user who suffers from lack of information about the channel gains. The resulting equilibrium can be highly inefficient, suggesting that competitive spectrum sharing is highly suboptimal.<|reference_end|> | arxiv | @article{adlakha2007competition,
title={Competition in Wireless Systems via Bayesian Interference Games},
author={Sachin Adlakha, Ramesh Johari and Andrea Goldsmith},
journal={arXiv preprint arXiv:0709.0516},
year={2007},
archivePrefix={arXiv},
eprint={0709.0516},
primaryClass={cs.GT}
} | adlakha2007competition |
arxiv-1128 | 0709.0518 | Rate Regions for the Partially-Cooperative Relay Broadcast Channel with Non-causal Side Information | <|reference_start|>Rate Regions for the Partially-Cooperative Relay Broadcast Channel with Non-causal Side Information: In this work, we consider a partially cooperative relay broadcast channel (PC-RBC) controlled by random parameters. We provide rate regions for two different situations: 1) when side information (SI) S^n on the random parameters is non-causally known at both the source and the relay and, 2) when side information S^n is non-causally known at the source only. These achievable regions are derived for the general discrete memoryless case first and then extended to the case when the channel is degraded Gaussian and the SI is additive i.i.d. Gaussian. In this case, the source uses generalized dirty paper coding (GDPC), i.e., DPC combined with partial state cancellation, when only the source is informed, and DPC alone when both the source and the relay are informed. It appears that, even though it can not completely eliminate the effect of the SI (in contrast to the case of source and relay being informed), GDPC is particularly useful when only the source is informed.<|reference_end|> | arxiv | @article{zaidi2007rate,
title={Rate Regions for the Partially-Cooperative Relay Broadcast Channel with
Non-causal Side Information},
author={A. Zaidi and L. Vandendorpe},
journal={arXiv preprint arXiv:0709.0518},
year={2007},
archivePrefix={arXiv},
eprint={0709.0518},
primaryClass={cs.IT math.IT}
} | zaidi2007rate |
arxiv-1129 | 0709.0522 | Qualitative Belief Conditioning Rules (QBCR) | <|reference_start|>Qualitative Belief Conditioning Rules (QBCR): In this paper we extend the new family of (quantitative) Belief Conditioning Rules (BCR) recently developed in the Dezert-Smarandache Theory (DSmT) to their qualitative counterpart for belief revision. Since the revision of quantitative as well as qualitative belief assignment given the occurrence of a new event (the conditioning constraint) can be done in many possible ways, we present here only what we consider as the most appealing Qualitative Belief Conditioning Rules (QBCR) which allow to revise the belief directly with words and linguistic labels and thus avoids the introduction of ad-hoc translations of quantitative beliefs into quantitative ones for solving the problem.<|reference_end|> | arxiv | @article{smarandache2007qualitative,
title={Qualitative Belief Conditioning Rules (QBCR)},
author={Florentin Smarandache, Jean Dezert},
journal={Proceedings of Fusion 2007 International Conference, Quebec City,
Canada, July 2007},
year={2007},
archivePrefix={arXiv},
eprint={0709.0522},
primaryClass={cs.AI}
} | smarandache2007qualitative |
arxiv-1130 | 0709.0566 | Discovering Patterns in Multi-neuronal Spike Trains using the Frequent Episode Method | <|reference_start|>Discovering Patterns in Multi-neuronal Spike Trains using the Frequent Episode Method: Discovering the 'Neural Code' from multi-neuronal spike trains is an important task in neuroscience. For such an analysis, it is important to unearth interesting regularities in the spiking patterns. In this report, we present an efficient method for automatically discovering synchrony, synfire chains, and more general sequences of neuronal firings. We use the Frequent Episode Discovery framework of Laxman, Sastry, and Unnikrishnan (2005), in which the episodes are represented and recognized using finite-state automata. Many aspects of functional connectivity between neuronal populations can be inferred from the episodes. We demonstrate these using simulated multi-neuronal data from a Poisson model. We also present a method to assess the statistical significance of the discovered episodes. Since the Temporal Data Mining (TDM) methods used in this report can analyze data from hundreds and potentially thousands of neurons, we argue that this framework is appropriate for discovering the `Neural Code'.<|reference_end|> | arxiv | @article{unnikrishnan2007discovering,
title={Discovering Patterns in Multi-neuronal Spike Trains using the Frequent
Episode Method},
author={K.P.Unnikrishnan (General Motors R&D Center, Warren, MI), Debprakash
Patnaik (Dept. Elecetrical Engineering, Indian Institute of Science,
Bangalore), P.S.Sastry (Dept. Elecetrical Engineering, Indian Institute of
Science, Bangalore)},
journal={arXiv preprint arXiv:0709.0566},
year={2007},
archivePrefix={arXiv},
eprint={0709.0566},
primaryClass={cs.DB q-bio.NC}
} | unnikrishnan2007discovering |
arxiv-1131 | 0709.0599 | On Universal Properties of Capacity-Approaching LDPC Ensembles | <|reference_start|>On Universal Properties of Capacity-Approaching LDPC Ensembles: This paper is focused on the derivation of some universal properties of capacity-approaching low-density parity-check (LDPC) code ensembles whose transmission takes place over memoryless binary-input output-symmetric (MBIOS) channels. Properties of the degree distributions, graphical complexity and the number of fundamental cycles in the bipartite graphs are considered via the derivation of information-theoretic bounds. These bounds are expressed in terms of the target block/ bit error probability and the gap (in rate) to capacity. Most of the bounds are general for any decoding algorithm, and some others are proved under belief propagation (BP) decoding. Proving these bounds under a certain decoding algorithm, validates them automatically also under any sub-optimal decoding algorithm. A proper modification of these bounds makes them universal for the set of all MBIOS channels which exhibit a given capacity. Bounds on the degree distributions and graphical complexity apply to finite-length LDPC codes and to the asymptotic case of an infinite block length. The bounds are compared with capacity-approaching LDPC code ensembles under BP decoding, and they are shown to be informative and are easy to calculate. Finally, some interesting open problems are considered.<|reference_end|> | arxiv | @article{sason2007on,
title={On Universal Properties of Capacity-Approaching LDPC Ensembles},
author={Igal Sason},
journal={arXiv preprint arXiv:0709.0599},
year={2007},
doi={10.1109/TIT.2009.2021305},
archivePrefix={arXiv},
eprint={0709.0599},
primaryClass={cs.IT math.IT}
} | sason2007on |
arxiv-1132 | 0709.0624 | On Faster Integer Calculations using Non-Arithmetic Primitives | <|reference_start|>On Faster Integer Calculations using Non-Arithmetic Primitives: The unit cost model is both convenient and largely realistic for describing integer decision algorithms over (+,*). Additional operations like division with remainder or bitwise conjunction, although equally supported by computing hardware, may lead to a considerable drop in complexity. We show a variety of concrete problems to benefit from such NON-arithmetic primitives by presenting and analyzing corresponding fast algorithms.<|reference_end|> | arxiv | @article{lürwer-brüggemeier2007on,
title={On Faster Integer Calculations using Non-Arithmetic Primitives},
author={Katharina L"urwer-Br"uggemeier and Martin Ziegler},
journal={arXiv preprint arXiv:0709.0624},
year={2007},
archivePrefix={arXiv},
eprint={0709.0624},
primaryClass={cs.DS}
} | lürwer-brüggemeier2007on |
arxiv-1133 | 0709.0670 | Using Data Compressors to Construct Rank Tests | <|reference_start|>Using Data Compressors to Construct Rank Tests: Nonparametric rank tests for homogeneity and component independence are proposed, which are based on data compressors. For homogeneity testing the idea is to compress the binary string obtained by ordering the two joint samples and writing 0 if the element is from the first sample and 1 if it is from the second sample and breaking ties by randomization (extension to the case of multiple samples is straightforward). $H_0$ should be rejected if the string is compressed (to a certain degree) and accepted otherwise. We show that such a test obtained from an ideal data compressor is valid against all alternatives. Component independence is reduced to homogeneity testing by constructing two samples, one of which is the first half of the original and the other is the second half with one of the components randomly permuted.<|reference_end|> | arxiv | @article{ryabko2007using,
title={Using Data Compressors to Construct Rank Tests},
author={Daniil Ryabko, Juergen Schmidhuber},
journal={Applied Mathematics Letters, 22:7, 1029-1032, 2009},
year={2007},
archivePrefix={arXiv},
eprint={0709.0670},
primaryClass={cs.DS cs.IT math.IT}
} | ryabko2007using |
arxiv-1134 | 0709.0674 | Simple Algorithmic Principles of Discovery, Subjective Beauty, Selective Attention, Curiosity & Creativity | <|reference_start|>Simple Algorithmic Principles of Discovery, Subjective Beauty, Selective Attention, Curiosity & Creativity: I postulate that human or other intelligent agents function or should function as follows. They store all sensory observations as they come - the data is holy. At any time, given some agent's current coding capabilities, part of the data is compressible by a short and hopefully fast program / description / explanation / world model. In the agent's subjective eyes, such data is more regular and more "beautiful" than other data. It is well-known that knowledge of regularity and repeatability may improve the agent's ability to plan actions leading to external rewards. In absence of such rewards, however, known beauty is boring. Then "interestingness" becomes the first derivative of subjective beauty: as the learning agent improves its compression algorithm, formerly apparently random data parts become subjectively more regular and beautiful. Such progress in compressibility is measured and maximized by the curiosity drive: create action sequences that extend the observation history and yield previously unknown / unpredictable but quickly learnable algorithmic regularity. We discuss how all of the above can be naturally implemented on computers, through an extension of passive unsupervised learning to the case of active data selection: we reward a general reinforcement learner (with access to the adaptive compressor) for actions that improve the subjective compressibility of the growing data. An unusually large breakthrough in compressibility deserves the name "discovery". The "creativity" of artists, dancers, musicians, pure mathematicians can be viewed as a by-product of this principle. Several qualitative examples support this hypothesis.<|reference_end|> | arxiv | @article{schmidhuber2007simple,
title={Simple Algorithmic Principles of Discovery, Subjective Beauty, Selective
Attention, Curiosity & Creativity},
author={Juergen Schmidhuber},
journal={arXiv preprint arXiv:0709.0674},
year={2007},
archivePrefix={arXiv},
eprint={0709.0674},
primaryClass={cs.AI cs.GR}
} | schmidhuber2007simple |
arxiv-1135 | 0709.0677 | On the Complexity of Protein Local Structure Alignment Under the Discrete Fr\'echet Distance | <|reference_start|>On the Complexity of Protein Local Structure Alignment Under the Discrete Fr\'echet Distance: We show that given $m$ proteins (or protein backbones, which are modeled as 3D polygonal chains each of length O(n)) the problem of protein local structure alignment under the discrete Fr\'{e}chet distance is as hard as Independent Set. So the problem does not admit any approximation of factor $n^{1-\epsilon}$. This is the strongest negative result regarding the protein local structure alignment problem. On the other hand, if $m$ is a constant, then the problem can be solved in polygnomial time.<|reference_end|> | arxiv | @article{zhu2007on,
title={On the Complexity of Protein Local Structure Alignment Under the
Discrete Fr\'echet Distance},
author={Binhai Zhu},
journal={arXiv preprint arXiv:0709.0677},
year={2007},
archivePrefix={arXiv},
eprint={0709.0677},
primaryClass={cs.CC cs.DS}
} | zhu2007on |
arxiv-1136 | 0709.0680 | Designing a Virtual Manikin Animation Framework Aimed at Virtual Prototyping | <|reference_start|>Designing a Virtual Manikin Animation Framework Aimed at Virtual Prototyping: In the industry, numerous commercial packages provide tools to introduce, and analyse human behaviour in the product's environment (for maintenance, ergonomics...), thanks to Virtual Humans. We will focus on control. Thanks to algorithms newly introduced in recent research papers, we think we can provide an implementation, which even widens, and simplifies the animation capacities of virtual manikins. In order to do so, we are going to express the industrial expectations as for Virtual Humans, without considering feasibility (not to bias the issue). The second part will show that no commercial application provides the tools that perfectly meet the needs. Thus we propose a new animation framework that better answers the problem. Our contribution is the integration - driven by need ~ of available new scientific techniques to animate Virtual Humans, in a new control scheme that better answers industrial expectations.<|reference_end|> | arxiv | @article{rennuit2007designing,
title={Designing a Virtual Manikin Animation Framework Aimed at Virtual
Prototyping},
author={Antoine Rennuit (IRCCyN), Alain Micaelli (LIST), Claude Andriot
(LIST), Franc{c}ois Guillaume, Nicolas Chevassus, Damien Chablat (IRCCyN),
Patrick Chedmail (IRCCyN)},
journal={Dans Laval Virtual - Laval Virtual, Laval : France (2004)},
year={2007},
archivePrefix={arXiv},
eprint={0709.0680},
primaryClass={cs.RO}
} | rennuit2007designing |
arxiv-1137 | 0709.0746 | Geometric Complexity Theory: Introduction | <|reference_start|>Geometric Complexity Theory: Introduction: These are lectures notes for the introductory graduate courses on geometric complexity theory (GCT) in the computer science department, the university of Chicago. Part I consists of the lecture notes for the course given by the first author in the spring quarter, 2007. It gives introduction to the basic structure of GCT. Part II consists of the lecture notes for the course given by the second author in the spring quarter, 2003. It gives introduction to invariant theory with a view towards GCT. No background in algebraic geometry or representation theory is assumed. These lecture notes in conjunction with the article \cite{GCTflip1}, which describes in detail the basic plan of GCT based on the principle called the flip, should provide a high level picture of GCT assuming familiarity with only basic notions of algebra, such as groups, rings, fields etc.<|reference_end|> | arxiv | @article{mulmuley2007geometric,
title={Geometric Complexity Theory: Introduction},
author={Ketan D. Mulmuley, Milind Sohoni},
journal={arXiv preprint arXiv:0709.0746},
year={2007},
number={TR-2007-16, comp. sci. dept., The University Of Chicago},
archivePrefix={arXiv},
eprint={0709.0746},
primaryClass={cs.CC}
} | mulmuley2007geometric |
arxiv-1138 | 0709.0748 | On P vs NP, Geometric Complexity Theory, and the Flip I: a high level view | <|reference_start|>On P vs NP, Geometric Complexity Theory, and the Flip I: a high level view: Geometric complexity theory (GCT) is an approach to the $P$ vs. $NP$ and related problems through algebraic geometry and representation theory. This article gives a high-level exposition of the basic plan of GCT based on the principle, called the flip, without assuming any background in algebraic geometry or representation theory.<|reference_end|> | arxiv | @article{mulmuley2007on,
title={On P vs. NP, Geometric Complexity Theory, and the Flip I: a high level
view},
author={Ketan D. Mulmuley},
journal={arXiv preprint arXiv:0709.0748},
year={2007},
number={TR-2007-13, comp. sci. dept., The University of Chicago},
archivePrefix={arXiv},
eprint={0709.0748},
primaryClass={cs.CC}
} | mulmuley2007on |
arxiv-1139 | 0709.0749 | Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem | <|reference_start|>Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem: This article describes a {\em nonstandard} quantum group that may be used to derive a positive formula for the plethysm problem, just as the standard (Drinfeld-Jimbo) quantum group can be used to derive the positive Littlewood-Richardson rule for arbitrary complex semisimple Lie groups. The sequel \cite{GCT8} gives conjecturally correct algorithms to construct canonical bases of the coordinate rings of these nonstandard quantum groups and canonical bases of the dually paired nonstandard deformations of the symmetric group algebra. A positive $#P$-formula for the plethysm constant follows from the conjectural properties of these canonical bases and the duality and reciprocity conjectures herein.<|reference_end|> | arxiv | @article{mulmuley2007geometric,
title={Geometric Complexity Theory VII: Nonstandard quantum group for the
plethysm problem},
author={Ketan D. Mulmuley},
journal={arXiv preprint arXiv:0709.0749},
year={2007},
number={TR-2007-14, comp. sci. dept., The University Of Chicago},
archivePrefix={arXiv},
eprint={0709.0749},
primaryClass={cs.CC}
} | mulmuley2007geometric |
arxiv-1140 | 0709.0751 | Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups | <|reference_start|>Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups: This article gives conjecturally correct algorithms to construct canonical bases of the irreducible polynomial representations and the matrix coordinate rings of the nonstandard quantum groups in GCT4 and GCT7, and canonical bases of the dually paired nonstandard deformations of the symmetric group algebra therein. These are generalizations of the canonical bases of the irreducible polynomial representations and the matrix coordinate ring of the standard quantum group, as constructed by Kashiwara and Lusztig, and the Kazhdan-Lusztig basis of the Hecke algebra. A positive ($#P$-) formula for the well-known plethysm constants follows from their conjectural properties and the duality and reciprocity conjectures in \cite{GCT7}.<|reference_end|> | arxiv | @article{mulmuley2007geometric,
title={Geometric Complexity Theory VIII: On canonical bases for the nonstandard
quantum groups},
author={Ketan D. Mulmuley},
journal={arXiv preprint arXiv:0709.0751},
year={2007},
number={TR-2007-15, comp. sci. dept., The University Of Chicago},
archivePrefix={arXiv},
eprint={0709.0751},
primaryClass={cs.CC}
} | mulmuley2007geometric |
arxiv-1141 | 0709.0787 | Sound Generation by a Turbulent Flow in Musical Instruments - Multiphysics Simulation Approach - | <|reference_start|>Sound Generation by a Turbulent Flow in Musical Instruments - Multiphysics Simulation Approach -: Total computational costs of scientific simulations are analyzed between direct numerical simulations (DNS) and multiphysics simulations (MPS) for sound generation in musical instruments. In order to produce acoustic sound by a turbulent flow in a simple recorder-like instrument, compressible fluid dynamic calculations with a low Mach number are required around the edges and the resonator of the instrument in DNS, while incompressible fluid dynamic calculations coupled with dynamics of sound propagation based on the Lighthill's acoustic analogy are used in MPS. These strategies are evaluated not only from the viewpoint of computational performances but also from the theoretical points of view as tools for scientific simulations of complicated systems.<|reference_end|> | arxiv | @article{kobayashi2007sound,
title={Sound Generation by a Turbulent Flow in Musical Instruments -
Multiphysics Simulation Approach -},
author={Taizo Kobayashi, Toshiya Takami, Kin'ya Takahashi, Ryota Mibu, Mutsumi
Aoyagi},
journal={arXiv preprint arXiv:0709.0787},
year={2007},
archivePrefix={arXiv},
eprint={0709.0787},
primaryClass={physics.comp-ph cs.CE physics.flu-dyn}
} | kobayashi2007sound |
arxiv-1142 | 0709.0883 | Liquid State Machines in Adbiatic Quantum Computers for General Computation | <|reference_start|>Liquid State Machines in Adbiatic Quantum Computers for General Computation: Major mistakes do not read<|reference_end|> | arxiv | @article{herman2007liquid,
title={Liquid State Machines in Adbiatic Quantum Computers for General
Computation},
author={Joshua Jay Herman},
journal={arXiv preprint arXiv:0709.0883},
year={2007},
archivePrefix={arXiv},
eprint={0709.0883},
primaryClass={cs.CC cs.NE}
} | herman2007liquid |
arxiv-1143 | 0709.0896 | Open Access does not increase citations for research articles from The Astrophysical Journal | <|reference_start|>Open Access does not increase citations for research articles from The Astrophysical Journal: We demonstrate conclusively that there is no "Open Access Advantage" for papers from the Astrophysical Journal. The two to one citation advantage enjoyed by papers deposited in the arXiv e-print server is due entirely to the nature and timing of the deposited papers. This may have implications for other disciplines.<|reference_end|> | arxiv | @article{kurtz2007open,
title={Open Access does not increase citations for research articles from The
Astrophysical Journal},
author={Michael J. Kurtz, Edwin A. Henneken},
journal={arXiv preprint arXiv:0709.0896},
year={2007},
archivePrefix={arXiv},
eprint={0709.0896},
primaryClass={cs.DL cs.CY}
} | kurtz2007open |
arxiv-1144 | 0709.0906 | A Greedy Randomized Adaptive Search Procedure for Technicians and Interventions Scheduling for Telecommunications | <|reference_start|>A Greedy Randomized Adaptive Search Procedure for Technicians and Interventions Scheduling for Telecommunications: The subject of the 5th challenge proposed by the French Society of Operations Research and Decision Analysis (ROADEF) consists in scheduling technicians and interventions for telecommunications (http://www.g-scop.inpg.fr/ChallengeROADEF2007/ or http://www.roadef.org/). We detail the algorithm we proposed for this challenge which is a Greedy Randomized Adaptative Search Procedure (GRASP). Computational results led us to the 1st position in the Junior category and to the 4th position in All category of the Challenge ROADEF 2007.<|reference_end|> | arxiv | @article{boussier2007a,
title={A Greedy Randomized Adaptive Search Procedure for Technicians and
Interventions Scheduling for Telecommunications},
author={Sylvain Boussier (LGI2P), Hideki Hashimoto, Michel Vasquez (LGI2P)},
journal={arXiv preprint arXiv:0709.0906},
year={2007},
archivePrefix={arXiv},
eprint={0709.0906},
primaryClass={cs.DM}
} | boussier2007a |
arxiv-1145 | 0709.0907 | Computability of probability measures and Martin-Lof randomness over metric spaces | <|reference_start|>Computability of probability measures and Martin-Lof randomness over metric spaces: In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show that any computable metric space with a computable probability measure is isomorphic to the Cantor space in a computable and measure-theoretic sense. We show that any computable metric space admits a universal uniform randomness test (without further assumption).<|reference_end|> | arxiv | @article{hoyrup2007computability,
title={Computability of probability measures and Martin-Lof randomness over
metric spaces},
author={Mathieu Hoyrup and Cristobal Rojas},
journal={arXiv preprint arXiv:0709.0907},
year={2007},
archivePrefix={arXiv},
eprint={0709.0907},
primaryClass={cs.IT math.IT}
} | hoyrup2007computability |
arxiv-1146 | 0709.0929 | Analysis of network by generalized mutual entropies | <|reference_start|>Analysis of network by generalized mutual entropies: Generalized mutual entropy is defined for networks and applied for analysis of complex network structures. The method is tested for the case of computer simulated scale free networks, random networks, and their mixtures. The possible applications for real network analysis are discussed.<|reference_end|> | arxiv | @article{gudkov2007analysis,
title={Analysis of network by generalized mutual entropies},
author={V. Gudkov and V. Montealegre},
journal={arXiv preprint arXiv:0709.0929},
year={2007},
doi={10.1016/j.physa.2008.01.005},
archivePrefix={arXiv},
eprint={0709.0929},
primaryClass={cond-mat.dis-nn cs.NI physics.comp-ph}
} | gudkov2007analysis |
arxiv-1147 | 0709.0961 | A New Distributed Topology Control Algorithm for Wireless Environments with Non-Uniform Path Loss and Multipath Propagation | <|reference_start|>A New Distributed Topology Control Algorithm for Wireless Environments with Non-Uniform Path Loss and Multipath Propagation: Each node in a wireless multi-hop network can adjust the power level at which it transmits and thus change the topology of the network to save energy by choosing the neighbors with which it directly communicates. Many previous algorithms for distributed topology control have assumed an ability at each node to deduce some location-based information such as the direction and the distance of its neighbor nodes with respect to itself. Such a deduction of location-based information, however, cannot be relied upon in real environments where the path loss exponents vary greatly leading to significant errors in distance estimates. Also, multipath effects may result in different signal paths with different loss characteristics, and none of these paths may be line-of-sight, making it difficult to estimate the direction of a neighboring node. In this paper, we present Step Topology Control (STC), a simple distributed topology control algorithm which reduces energy consumption while preserving the connectivity of a heterogeneous sensor network without use of any location-based information. We show that the STC algorithm achieves the same or better order of communication and computational complexity when compared to other known algorithms that also preserve connectivity without the use of location-based information. We also present a detailed simulation-based comparative analysis of the energy savings and interference reduction achieved by the algorithms. The results show that, in spite of not incurring a higher communication or computational complexity, the STC algorithm performs better than other algorithms in uniform wireless environments and especially better when path loss characteristics are non-uniform.<|reference_end|> | arxiv | @article{sethu2007a,
title={A New Distributed Topology Control Algorithm for Wireless Environments
with Non-Uniform Path Loss and Multipath Propagation},
author={Harish Sethu and Thomas Gerety},
journal={Ad Hoc Networks, May 2010, volume 8, issue 3, pages 280-294.},
year={2007},
archivePrefix={arXiv},
eprint={0709.0961},
primaryClass={cs.NI}
} | sethu2007a |
arxiv-1148 | 0709.0965 | The Induced Bounded-Degree Subgraph Problem and Stream Control in MIMO Networks | <|reference_start|>The Induced Bounded-Degree Subgraph Problem and Stream Control in MIMO Networks: In this report, we consider maximal solutions to the induced bounded-degree subgraph problem and relate it to issues concerning stream control in multiple-input multiple-output (MIMO) networks. We present a new distributed algorithm that completes in logarithmic time with high probability and is guaranteed to complete in linear time. We conclude the report with simulation results that address the effectiveness of stream control and the relative impact of receiver overloading and flexible interference suppression.<|reference_end|> | arxiv | @article{sethu2007the,
title={The Induced Bounded-Degree Subgraph Problem and Stream Control in MIMO
Networks},
author={Harish Sethu},
journal={arXiv preprint arXiv:0709.0965},
year={2007},
archivePrefix={arXiv},
eprint={0709.0965},
primaryClass={cs.NI}
} | sethu2007the |
arxiv-1149 | 0709.0974 | Finding Paths and Cycles in Graphs | <|reference_start|>Finding Paths and Cycles in Graphs: A polynomial time algorithm which detects all paths and cycles of all lengths in form of vertex pairs (start, finish).<|reference_end|> | arxiv | @article{gubin2007finding,
title={Finding Paths and Cycles in Graphs},
author={Sergey Gubin},
journal={arXiv preprint arXiv:0709.0974},
year={2007},
archivePrefix={arXiv},
eprint={0709.0974},
primaryClass={cs.DM cs.CC cs.DS math.CO}
} | gubin2007finding |
arxiv-1150 | 0709.0993 | The Description of Information in 4-Dimensional Pseudo-Euclidean Information Space | <|reference_start|>The Description of Information in 4-Dimensional Pseudo-Euclidean Information Space: This article is presented new method of description information systems in abstract 4-dimensional pseudo-Euclidean information space (4-DPIES) with using special relativity (SR) methods. This purpose core postulates of existence 4-DPIES are formulated. The theorem setting existence criteria of the invariant velocity of the information transference is formulated and proved. One more theorem allowed relating discrete parameters of information and continuous space-time treating and also row of supplementary theorems is formulated and proved. For description of dynamics and interaction of information, in article is introduced general parameter of information - generalized information emotion (GIE), reminding simultaneously on properties the mass and the charge. At performing calculation of information observable parameters in the information space is introduced continual integration methods of Feynman. The applying idea about existence of GIE as measures of the information inertness and the interaction carrier, and using continual integration methods of Feynman can be calculated probability of information process in 4-DPIES. In this frame presented approach has allowed considering information systems when interest is presented with information processes, their related with concrete definition without necessity. The relation between 4-DPIES and real systems parameters is set at modelling of matching between observable processes and real phenomena from information interpretation.<|reference_end|> | arxiv | @article{shro2007the,
title={The Description of Information in 4-Dimensional Pseudo-Euclidean
Information Space},
author={O. I. Shro},
journal={arXiv preprint arXiv:0709.0993},
year={2007},
archivePrefix={arXiv},
eprint={0709.0993},
primaryClass={cs.IT math.IT nlin.AO physics.soc-ph}
} | shro2007the |
arxiv-1151 | 0709.1023 | Constraint optimization and landscapes | <|reference_start|>Constraint optimization and landscapes: We describe an effective landscape introduced in [1] for the analysis of Constraint Satisfaction problems, such as Sphere Packing, K-SAT and Graph Coloring. This geometric construction reexpresses these problems in the more familiar terms of optimization in rugged energy landscapes. In particular, it allows one to understand the puzzling fact that unsophisticated programs are successful well beyond what was considered to be the `hard' transition, and suggests an algorithm defining a new, higher, easy-hard frontier.<|reference_end|> | arxiv | @article{krzakala2007constraint,
title={Constraint optimization and landscapes},
author={Florent Krzakala and Jorge Kurchan},
journal={Eur. Phys. J. B 64, 563-565 (2008)},
year={2007},
doi={10.1140/epjb/e2008-00052-x},
archivePrefix={arXiv},
eprint={0709.1023},
primaryClass={quant-ph cond-mat.stat-mech cs.CC nlin.AO}
} | krzakala2007constraint |
arxiv-1152 | 0709.1024 | Computational performance of a parallelized high-order spectral and mortar element toolbox | <|reference_start|>Computational performance of a parallelized high-order spectral and mortar element toolbox: In this paper, a comprehensive performance review of a MPI-based high-order spectral and mortar element method C++ toolbox is presented. The focus is put on the performance evaluation of several aspects with a particular emphasis on the parallel efficiency. The performance evaluation is analyzed and compared to predictions given by a heuristic model, the so-called Gamma model. A tailor-made CFD computation benchmark case is introduced and used to carry out this review, stressing the particular interest for commodity clusters. Conclusions are drawn from this extensive series of analyses and modeling leading to specific recommendations concerning such toolbox development and parallel implementation.<|reference_end|> | arxiv | @article{bouffanais2007computational,
title={Computational performance of a parallelized high-order spectral and
mortar element toolbox},
author={Roland Bouffanais, Vincent Keller, Ralf Gruber, Michel O. Deville},
journal={arXiv preprint arXiv:0709.1024},
year={2007},
archivePrefix={arXiv},
eprint={0709.1024},
primaryClass={cs.DC cs.PF}
} | bouffanais2007computational |
arxiv-1153 | 0709.1056 | A Sudoku Game for People with Motor Impairments | <|reference_start|>A Sudoku Game for People with Motor Impairments: Computer games are motivating and beneficial in learning different educational skills. Most people use their fingers, hands, and arms when using a computer game. However, for people with motor disabilities this task can be a barrier. We present a new Sudoku game for people whose motion is impaired, called Sudoku 4ALL. With this special interface a person can control the game with the voice or with a single switch. Our research aims to cautiously search for issues that might be appropriate for computational support and to build enabling technologies that increase individuals' functional independence in a game environment.<|reference_end|> | arxiv | @article{norte2007a,
title={A Sudoku Game for People with Motor Impairments},
author={Stephane Norte},
journal={arXiv preprint arXiv:0709.1056},
year={2007},
archivePrefix={arXiv},
eprint={0709.1056},
primaryClass={cs.HC cs.CY}
} | norte2007a |
arxiv-1154 | 0709.1074 | Johnson Type Bounds on Constant Dimension Codes | <|reference_start|>Johnson Type Bounds on Constant Dimension Codes: Very recently, an operator channel was defined by Koetter and Kschischang when they studied random network coding. They also introduced constant dimension codes and demonstrated that these codes can be employed to correct errors and/or erasures over the operator channel. Constant dimension codes are equivalent to the so-called linear authentication codes introduced by Wang, Xing and Safavi-Naini when constructing distributed authentication systems in 2003. In this paper, we study constant dimension codes. It is shown that Steiner structures are optimal constant dimension codes achieving the Wang-Xing-Safavi-Naini bound. Furthermore, we show that constant dimension codes achieve the Wang-Xing-Safavi-Naini bound if and only if they are certain Steiner structures. Then, we derive two Johnson type upper bounds, say I and II, on constant dimension codes. The Johnson type bound II slightly improves on the Wang-Xing-Safavi-Naini bound. Finally, we point out that a family of known Steiner structures is actually a family of optimal constant dimension codes achieving both the Johnson type bounds I and II.<|reference_end|> | arxiv | @article{xia2007johnson,
title={Johnson Type Bounds on Constant Dimension Codes},
author={Shu-Tao Xia and Fang-Wei Fu},
journal={arXiv preprint arXiv:0709.1074},
year={2007},
archivePrefix={arXiv},
eprint={0709.1074},
primaryClass={cs.IT math.IT}
} | xia2007johnson |
arxiv-1155 | 0709.1080 | On the Protocol Composition Logic PCL | <|reference_start|>On the Protocol Composition Logic PCL: A recent development in formal security protocol analysis is the Protocol Composition Logic (PCL). We identify a number of problems with this logic as well as with extensions of the logic, as defined in [DDMP05,HSD+05,He05,Dat05,Der06,DDMR07]. The identified problems imply strong restrictions on the scope of PCL, and imply that some currently claimed PCL proofs cannot be proven within the logic, or make use of unsound axioms. Where possible, we propose solutions for these problems.<|reference_end|> | arxiv | @article{cremers2007on,
title={On the Protocol Composition Logic PCL},
author={Cas Cremers},
journal={arXiv preprint arXiv:0709.1080},
year={2007},
archivePrefix={arXiv},
eprint={0709.1080},
primaryClass={cs.CR cs.LO}
} | cremers2007on |
arxiv-1156 | 0709.1099 | Multi-Sensor Fusion Method using Dynamic Bayesian Network for Precise Vehicle Localization and Road Matching | <|reference_start|>Multi-Sensor Fusion Method using Dynamic Bayesian Network for Precise Vehicle Localization and Road Matching: This paper presents a multi-sensor fusion strategy for a novel road-matching method designed to support real-time navigational features within advanced driving-assistance systems. Managing multihypotheses is a useful strategy for the road-matching problem. The multi-sensor fusion and multi-modal estimation are realized using Dynamical Bayesian Network. Experimental results, using data from Antilock Braking System (ABS) sensors, a differential Global Positioning System (GPS) receiver and an accurate digital roadmap, illustrate the performances of this approach, especially in ambiguous situations.<|reference_end|> | arxiv | @article{smaili2007multi-sensor,
title={Multi-Sensor Fusion Method using Dynamic Bayesian Network for Precise
Vehicle Localization and Road Matching},
author={Cherif Smaili (INRIA Lorraine - LORIA), Maan El Badaoui El Najjar
(INRIA Lorraine - LORIA), Franc{c}ois Charpillet (INRIA Lorraine - LORIA)},
journal={arXiv preprint arXiv:0709.1099},
year={2007},
archivePrefix={arXiv},
eprint={0709.1099},
primaryClass={cs.AI cs.RO}
} | smaili2007multi-sensor |
arxiv-1157 | 0709.1166 | An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation | <|reference_start|>An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation: Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting a sequence in up to K segments. We want segments to be as monotonic as possible and to alternate signs. We propose a quality metric for this problem using the l_inf norm, and we present an optimal linear time algorithm based on novel formalism. Moreover, given a precomputation in time O(n log n) consisting of a labeling of all extrema, we compute any optimal segmentation in constant time. We compare experimentally its performance to two piecewise linear segmentation heuristics (top-down and bottom-up). We show that our algorithm is faster and more accurate. Applications include pattern recognition and qualitative modeling.<|reference_end|> | arxiv | @article{lemire2007an,
title={An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation},
author={Daniel Lemire, Martin Brooks, Yuhong Yan},
journal={Daniel Lemire, Martin Brooks and Yuhong Yan, An Optimal Linear
Time Algorithm for Quasi-Monotonic Segmentation. International Journal of
Computer Mathematics 86 (7), 2009.},
year={2007},
doi={10.1080/00207160701694153},
number={NRC-00156},
archivePrefix={arXiv},
eprint={0709.1166},
primaryClass={cs.DB}
} | lemire2007an |
arxiv-1158 | 0709.1167 | Using RDF to Model the Structure and Process of Systems | <|reference_start|>Using RDF to Model the Structure and Process of Systems: Many systems can be described in terms of networks of discrete elements and their various relationships to one another. A semantic network, or multi-relational network, is a directed labeled graph consisting of a heterogeneous set of entities connected by a heterogeneous set of relationships. Semantic networks serve as a promising general-purpose modeling substrate for complex systems. Various standardized formats and tools are now available to support practical, large-scale semantic network models. First, the Resource Description Framework (RDF) offers a standardized semantic network data model that can be further formalized by ontology modeling languages such as RDF Schema (RDFS) and the Web Ontology Language (OWL). Second, the recent introduction of highly performant triple-stores (i.e. semantic network databases) allows semantic network models on the order of $10^9$ edges to be efficiently stored and manipulated. RDF and its related technologies are currently used extensively in the domains of computer science, digital library science, and the biological sciences. This article will provide an introduction to RDF/RDFS/OWL and an examination of its suitability to model discrete element complex systems.<|reference_end|> | arxiv | @article{rodriguez2007using,
title={Using RDF to Model the Structure and Process of Systems},
author={Marko A. Rodriguez, Jennifer H. Watkins, Johan Bollen, Carlos
Gershenson},
journal={InterJournal of Complex Systems, 2131, ISSN: 1081-0625, February
2008},
year={2007},
number={LAUR-07-5720},
archivePrefix={arXiv},
eprint={0709.1167},
primaryClass={cs.AI}
} | rodriguez2007using |
arxiv-1159 | 0709.1190 | Belief-Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions | <|reference_start|>Belief-Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions: We consider the general problem of finding the minimum weight $\bm$-matching on arbitrary graphs. We prove that, whenever the linear programming (LP) relaxation of the problem has no fractional solutions, then the belief propagation (BP) algorithm converges to the correct solution. We also show that when the LP relaxation has a fractional solution then the BP algorithm can be used to solve the LP relaxation. Our proof is based on the notion of graph covers and extends the analysis of (Bayati-Shah-Sharma 2005 and Huang-Jebara 2007}. These results are notable in the following regards: (1) It is one of a very small number of proofs showing correctness of BP without any constraint on the graph structure. (2) Variants of the proof work for both synchronous and asynchronous BP; it is the first proof of convergence and correctness of an asynchronous BP algorithm for a combinatorial optimization problem.<|reference_end|> | arxiv | @article{bayati2007belief-propagation,
title={Belief-Propagation for Weighted b-Matchings on Arbitrary Graphs and its
Relation to Linear Programs with Integer Solutions},
author={Mohsen Bayati, Christian Borgs, Jennifer Chayes, Riccardo Zecchina},
journal={SIAM J. Discrete Math. 2011, Vol 25, Issue 2, pp. 989-1011},
year={2007},
doi={10.1137/090753115},
archivePrefix={arXiv},
eprint={0709.1190},
primaryClass={cs.IT cs.AI math.IT}
} | bayati2007belief-propagation |
arxiv-1160 | 0709.1197 | An efficient algorithm finds noticeable trends and examples concerning the \vCerny conjecture | <|reference_start|>An efficient algorithm finds noticeable trends and examples concerning the \vCerny conjecture: A word w is called synchronizing (recurrent, reset, directed) word of a deterministic finite automaton (DFA) if w sends all states of the automaton on a unique state. Jan Cerny had found in 1964 a sequence of n-state complete DFA with shortest synchronizing word of length (n-1)^2. He had conjectured that it is an upper bound for the length of the shortest synchronizing word for any $n$-state complete DFA. The examples of DFA with shortest synchronizing word of length (n-1)^2 are relatively rare. To the Cerny sequence were added in all examples of Cerny, Piricka and Rosenauerova (1971), of Kari (2001) and of Roman (2004). By help of a program based on some effective algorithms, a wide class of automata of size less than 11 was checked. The order of the algorithm finding synchronizing word is quadratic for overwhelming majority of known to date automata. Some new examples of n-state DFA with minimal synchronizing word of length (n-1)^2 were discovered. The program recognized some remarkable trends concerning the length of the minimal synchronizing word. http://www.cs.biu.ac.il/~trakht/Testas.html<|reference_end|> | arxiv | @article{trahtman2007an,
title={An efficient algorithm finds noticeable trends and examples concerning
the \v{C}erny conjecture},
author={A.N. Trahtman},
journal={Lectures Notes in Computer Science, 4162(2006), 789-80},
year={2007},
archivePrefix={arXiv},
eprint={0709.1197},
primaryClass={cs.DM}
} | trahtman2007an |
arxiv-1161 | 0709.1201 | On the Proof Complexity of Deep Inference | <|reference_start|>On the Proof Complexity of Deep Inference: We obtain two results about the proof complexity of deep inference: 1) deep-inference proof systems are as powerful as Frege ones, even when both are extended with the Tseitin extension rule or with the substitution rule; 2) there are analytic deep-inference proof systems that exhibit an exponential speed-up over analytic Gentzen proof systems that they polynomially simulate.<|reference_end|> | arxiv | @article{bruscoli2007on,
title={On the Proof Complexity of Deep Inference},
author={Paola Bruscoli and Alessio Guglielmi},
journal={ACM Transactions on Computational Logic 10 (2:14) 2009, pp. 1-34},
year={2007},
doi={10.1145/1462179.1462186},
archivePrefix={arXiv},
eprint={0709.1201},
primaryClass={cs.CC cs.LO math.LO}
} | bruscoli2007on |
arxiv-1162 | 0709.1205 | Normalisation Control in Deep Inference via Atomic Flows | <|reference_start|>Normalisation Control in Deep Inference via Atomic Flows: We introduce `atomic flows': they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomic flows that correspond to complex reductions on derivations. This allows us to prove, for propositional logic, a new and very general normalisation theorem, which contains cut elimination as a special case. We operate in deep inference, which is more general than other syntactic paradigms, and where normalisation is more difficult to control. We argue that atomic flows are a significant technical advance for normalisation theory, because 1) the technique they support is largely independent of syntax; 2) indeed, it is largely independent of logical inference rules; 3) they constitute a powerful geometric formalism, which is more intuitive than syntax.<|reference_end|> | arxiv | @article{guglielmi2007normalisation,
title={Normalisation Control in Deep Inference via Atomic Flows},
author={Alessio Guglielmi and Tom Gundersen},
journal={Logical Methods in Computer Science, Volume 4, Issue 1 (March 31,
2008) lmcs:1081},
year={2007},
doi={10.2168/LMCS-4(1:9)2008},
archivePrefix={arXiv},
eprint={0709.1205},
primaryClass={math.LO cs.LO}
} | guglielmi2007normalisation |
arxiv-1163 | 0709.1207 | The P versus NP Brief | <|reference_start|>The P versus NP Brief: This paper discusses why P and NP are likely to be different. It analyses the essence of the concepts and points out that P and NP might be diverse by sheer definition. It also speculates that P and NP may be unequal due to natural laws.<|reference_end|> | arxiv | @article{franzen2007the,
title={The P versus NP Brief},
author={Mikael Franzen},
journal={arXiv preprint arXiv:0709.1207},
year={2007},
archivePrefix={arXiv},
eprint={0709.1207},
primaryClass={cs.CC}
} | franzen2007the |
arxiv-1164 | 0709.1211 | Likelihood ratios and Bayesian inference for Poisson channels | <|reference_start|>Likelihood ratios and Bayesian inference for Poisson channels: In recent years, infinite-dimensional methods have been introduced for the Gaussian channels estimation. The aim of this paper is to study the application of similar methods to Poisson channels. In particular we compute the Bayesian estimator of a Poisson channel using the likelihood ratio and the discrete Malliavin gradient. This algorithm is suitable for numerical implementation via the Monte-Carlo scheme. As an application we provide an new proof of the formula obtained recently by Guo, Shamai and Verdu\'u relating some derivatives of the input-output mutual information of a time-continuous Poisson channel and the conditional mean estimator of the input. These results are then extended to mixed Gaussian-Poisson channels.<|reference_end|> | arxiv | @article{reveillac2007likelihood,
title={Likelihood ratios and Bayesian inference for Poisson channels},
author={Anthony Reveillac},
journal={arXiv preprint arXiv:0709.1211},
year={2007},
archivePrefix={arXiv},
eprint={0709.1211},
primaryClass={cs.IT math.IT math.ST stat.TH}
} | reveillac2007likelihood |
arxiv-1165 | 0709.1227 | Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination | <|reference_start|>Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination: Recently, great efforts have been dedicated to researches on the management of large scale graph based data such as WWW, social networks, biological networks. In the study of graph based data management, node disjoint subgraph homeomorphism relation between graphs is more suitable than (sub)graph isomorphism in many cases, especially in those cases that node skipping and node mismatching are allowed. However, no efficient node disjoint subgraph homeomorphism determination (ndSHD) algorithms have been available. In this paper, we propose two computationally efficient ndSHD algorithms based on state spaces searching with backtracking, which employ many heuristics to prune the search spaces. Experimental results on synthetic data sets show that the proposed algorithms are efficient, require relative little time in most of the testing cases, can scale to large or dense graphs, and can accommodate to more complex fuzzy matching cases.<|reference_end|> | arxiv | @article{xiao2007efficient,
title={Efficient Algorithms for Node Disjoint Subgraph Homeomorphism
Determination},
author={Yanghua Xiao, Wentao Wu, Wei Wang and Zhengying He},
journal={In Proceeding of 13th International Conference on Database Systems
for Advanced Applications, 2008},
year={2007},
doi={10.1007/978-3-540-78568-2},
archivePrefix={arXiv},
eprint={0709.1227},
primaryClass={cs.DS cs.DB}
} | xiao2007efficient |
arxiv-1166 | 0709.1263 | Enumerating the Nash equilibria of rank 1-games | <|reference_start|>Enumerating the Nash equilibria of rank 1-games: A bimatrix game $(A,B)$ is called a game of rank $k$ if the rank of the matrix $A+B$ is at most $k$. We consider the problem of enumerating the Nash equilibria in (non-degenerate) games of rank 1. In particular, we show that even for games of rank 1 not all equilibria can be reached by a Lemke-Howson path and present a parametric simplex-type algorithm for enumerating all Nash equilibria of a non-degenerate game of rank 1.<|reference_end|> | arxiv | @article{theobald2007enumerating,
title={Enumerating the Nash equilibria of rank 1-games},
author={Thorsten Theobald},
journal={arXiv preprint arXiv:0709.1263},
year={2007},
archivePrefix={arXiv},
eprint={0709.1263},
primaryClass={cs.GT math.OC}
} | theobald2007enumerating |
arxiv-1167 | 0709.1272 | A Class of Parallel Tiled Linear Algebra Algorithms for Multicore Architectures | <|reference_start|>A Class of Parallel Tiled Linear Algebra Algorithms for Multicore Architectures: As multicore systems continue to gain ground in the High Performance Computing world, linear algebra algorithms have to be reformulated or new algorithms have to be developed in order to take advantage of the architectural features on these new processors. Fine grain parallelism becomes a major requirement and introduces the necessity of loose synchronization in the parallel execution of an operation. This paper presents an algorithm for the Cholesky, LU and QR factorization where the operations can be represented as a sequence of small tasks that operate on square blocks of data. These tasks can be dynamically scheduled for execution based on the dependencies among them and on the availability of computational resources. This may result in an out of order execution of the tasks which will completely hide the presence of intrinsically sequential tasks in the factorization. Performance comparisons are presented with the LAPACK algorithms where parallelism can only be exploited at the level of the BLAS operations and vendor implementations.<|reference_end|> | arxiv | @article{buttari2007a,
title={A Class of Parallel Tiled Linear Algebra Algorithms for Multicore
Architectures},
author={Alfredo Buttari, Julien Langou, Jakub Kurzak, Jack Dongarra},
journal={arXiv preprint arXiv:0709.1272},
year={2007},
number={Lapack working Note 191},
archivePrefix={arXiv},
eprint={0709.1272},
primaryClass={cs.MS cs.DC}
} | buttari2007a |
arxiv-1168 | 0709.1308 | Cirquent calculus deepened | <|reference_start|>Cirquent calculus deepened: Cirquent calculus is a new proof-theoretic and semantic framework, whose main distinguishing feature is being based on circuits, as opposed to the more traditional approaches that deal with tree-like objects such as formulas or sequents. Among its advantages are greater efficiency, flexibility and expressiveness. This paper presents a detailed elaboration of a deep-inference cirquent logic, which is naturally and inherently resource conscious. It shows that classical logic, both syntactically and semantically, is just a special, conservative fragment of this more general and, in a sense, more basic logic -- the logic of resources in the form of cirquent calculus. The reader will find various arguments in favor of switching to the new framework, such as arguments showing the insufficiency of the expressive power of linear logic or other formula-based approaches to developing resource logics, exponential improvements over the traditional approaches in both representational and proof complexities offered by cirquent calculus, and more. Among the main purposes of this paper is to provide an introductory-style starting point for what, as the author wishes to hope, might have a chance to become a new line of research in proof theory -- a proof theory based on circuits instead of formulas.<|reference_end|> | arxiv | @article{japaridze2007cirquent,
title={Cirquent calculus deepened},
author={Giorgi Japaridze},
journal={Journal of Logic and Computation 18 (2008), pp. 983-1028},
year={2007},
doi={10.1093/logcom/exn019},
archivePrefix={arXiv},
eprint={0709.1308},
primaryClass={cs.LO math.LO}
} | japaridze2007cirquent |
arxiv-1169 | 0709.1401 | A proof of strong normalisation using domain theory | <|reference_start|>A proof of strong normalisation using domain theory: Ulrich Berger presented a powerful proof of strong normalisation using domains, in particular it simplifies significantly Tait's proof of strong normalisation of Spector's bar recursion. The main contribution of this paper is to show that, using ideas from intersection types and Martin-Lof's domain interpretation of type theory one can in turn simplify further U. Berger's argument. We build a domain model for an untyped programming language where U. Berger has an interpretation only for typed terms or alternatively has an interpretation for untyped terms but need an extra condition to deduce strong normalisation. As a main application, we show that Martin-L\"{o}f dependent type theory extended with a program for Spector double negation shift.<|reference_end|> | arxiv | @article{coquand2007a,
title={A proof of strong normalisation using domain theory},
author={Thierry Coquand and Arnaud Spiwack},
journal={Logical Methods in Computer Science, Volume 3, Issue 4 (December
4, 2007) lmcs:1099},
year={2007},
doi={10.2168/LMCS-3(4:12)2007},
archivePrefix={arXiv},
eprint={0709.1401},
primaryClass={cs.LO cs.PL}
} | coquand2007a |
arxiv-1170 | 0709.1433 | The Rank-Width of Edge-Colored Graphs | <|reference_start|>The Rank-Width of Edge-Colored Graphs: Clique-width is a complexity measure of directed as well as undirected graphs. Rank-width is an equivalent complexity measure for undirected graphs and has good algorithmic and structural properties. It is in particular related to the vertex-minor relation. We discuss an extension of the notion of rank-width to edge-colored graphs. A C-colored graph is a graph where the arcs are colored with colors from the set C. There is not a natural notion of rank-width for C-colored graphs. We define two notions of rank-width for them, both based on a coding of C-colored graphs by edge-colored graphs where each edge has exactly one color from a field F and named respectively F-rank-width and F-bi-rank-width. The two notions are equivalent to clique-width. We then present a notion of vertex-minor for F-colored graphs and prove that F-colored graphs of bounded F-rank-width are characterised by a finite list of F-colored graphs to exclude as vertex-minors. A cubic-time algorithm to decide whether a F-colored graph has F-rank-width (resp. F-bi-rank-width) at most k, for fixed k, is also given. Graph operations to check MSOL-definable properties on F-colored graphs of bounded rank-width are presented. A specialisation of all these notions to (directed) graphs without edge colors is presented, which shows that our results generalise the ones in undirected graphs.<|reference_end|> | arxiv | @article{kante2007the,
title={The Rank-Width of Edge-Colored Graphs},
author={Mamadou Moustapha Kante and Michael Rao},
journal={Theory of Computing Systems 52(4):599-644(2013)},
year={2007},
doi={10.1007/s00224-012-9399-y},
archivePrefix={arXiv},
eprint={0709.1433},
primaryClass={cs.DM math.CO}
} | kante2007the |
arxiv-1171 | 0709.1441 | Information-theoretic analysis of MIMO channel sounding | <|reference_start|>Information-theoretic analysis of MIMO channel sounding: The large majority of commercially available multiple-input multiple-output (MIMO) radio channel measurement devices (sounders) is based on time-division multiplexed switching (TDMS) of a single transmit/receive radio-frequency chain into the elements of a transmit/receive antenna array. While being cost-effective, such a solution can cause significant measurement errors due to phase noise and frequency offset in the local oscillators. In this paper, we systematically analyze the resulting errors and show that, in practice, overestimation of channel capacity by several hundred percent can occur. Overestimation is caused by phase noise (and to a lesser extent frequency offset) leading to an increase of the MIMO channel rank. Our analysis furthermore reveals that the impact of phase errors is, in general, most pronounced if the physical channel has low rank (typical for line-of-sight or poor scattering scenarios). The extreme case of a rank-1 physical channel is analyzed in detail. Finally, we present measurement results obtained from a commercially employed TDMS-based MIMO channel sounder. In the light of the findings of this paper, the results obtained through MIMO channel measurement campaigns using TDMS-based channel sounders should be interpreted with great care.<|reference_end|> | arxiv | @article{baum2007information-theoretic,
title={Information-theoretic analysis of MIMO channel sounding},
author={Daniel S. Baum and Helmut B"olcskei},
journal={arXiv preprint arXiv:0709.1441},
year={2007},
archivePrefix={arXiv},
eprint={0709.1441},
primaryClass={cs.IT math.IT}
} | baum2007information-theoretic |
arxiv-1172 | 0709.1449 | Supervised secure entanglement sharing for faithful quantum teleportation via tripartite W states | <|reference_start|>Supervised secure entanglement sharing for faithful quantum teleportation via tripartite W states: We present a supervised secure entanglement sharing protocol via tripartite W states for faithful quantum teleportation. By guaranteeing a secure entanglement distribution in the charge of a third believed supervisor, quantum information of an unknown state of a 2-level particle can be faithfully teleported from the sender to the remote receiver via the Bell states distilled from the tripartite W states. We emphasize that reliable teleportation after our protocol between two communication parties depends on the agreement of the supervisor to cooperate via taking the W states as both the quantum channel and eavesdropping detector. The security against typical individual eavesdropping attacks is proved and its experimental feasibility is briefly illustrated.<|reference_end|> | arxiv | @article{li2007supervised,
title={Supervised secure entanglement sharing for faithful quantum
teleportation via tripartite W states},
author={Yue Li and Yu Liu},
journal={arXiv preprint arXiv:0709.1449},
year={2007},
archivePrefix={arXiv},
eprint={0709.1449},
primaryClass={quant-ph cs.CR}
} | li2007supervised |
arxiv-1173 | 0709.1500 | The Graver Complexity of Integer Programming | <|reference_start|>The Graver Complexity of Integer Programming: In this article we establish an exponential lower bound on the Graver complexity of integer programs. This provides new type of evidence supporting the presumable intractability of integer programming. Specifically, we show that the Graver complexity of the incidence matrix of the complete bipartite graph $K_{3,m}$ satisfies $g(m)=\Omega(2^m)$, with $g(m)\geq 17\cdot 2^{m-3}-7$ for every $m>3$ .<|reference_end|> | arxiv | @article{berstein2007the,
title={The Graver Complexity of Integer Programming},
author={Yael Berstein and Shmuel Onn},
journal={Annals of Combinatorics, 13:289--296, 2009},
year={2007},
archivePrefix={arXiv},
eprint={0709.1500},
primaryClass={math.CO cs.CC cs.DM math.AC}
} | berstein2007the |
arxiv-1174 | 0709.1516 | On Universal Prediction and Bayesian Confirmation | <|reference_start|>On Universal Prediction and Bayesian Confirmation: The Bayesian framework is a well-studied and successful framework for inductive reasoning, which includes hypothesis testing and confirmation, parameter estimation, sequence prediction, classification, and regression. But standard statistical guidelines for choosing the model class and prior are not always available or fail, in particular in complex situations. Solomonoff completed the Bayesian framework by providing a rigorous, unique, formal, and universal choice for the model class and the prior. We discuss in breadth how and in which sense universal (non-i.i.d.) sequence prediction solves various (philosophical) problems of traditional Bayesian sequence prediction. We show that Solomonoff's model possesses many desirable properties: Strong total and weak instantaneous bounds, and in contrast to most classical continuous prior densities has no zero p(oste)rior problem, i.e. can confirm universal hypotheses, is reparametrization and regrouping invariant, and avoids the old-evidence and updating problem. It even performs well (actually better) in non-computable environments.<|reference_end|> | arxiv | @article{hutter2007on,
title={On Universal Prediction and Bayesian Confirmation},
author={Marcus Hutter},
journal={Theoretical Computer Science, 384 (2007) pages 33-48},
year={2007},
archivePrefix={arXiv},
eprint={0709.1516},
primaryClass={math.ST cs.IT cs.LG math.IT stat.ML stat.TH}
} | hutter2007on |
arxiv-1175 | 0709.1647 | Unfolding Restricted Convex Caps | <|reference_start|>Unfolding Restricted Convex Caps: This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restrictions: the cap's faces are quadrilaterals, with vertices over an underlying integer lattice, and such that the cap convexity is ``radially monotone,'' a type of smoothness constraint. Extensions of Cauchy's arm lemma are used in the proof of non-overlap.<|reference_end|> | arxiv | @article{o'rourke2007unfolding,
title={Unfolding Restricted Convex Caps},
author={Joseph O'Rourke},
journal={arXiv preprint arXiv:0709.1647},
year={2007},
number={Smith Computer Science 086},
archivePrefix={arXiv},
eprint={0709.1647},
primaryClass={cs.CG}
} | o'rourke2007unfolding |
arxiv-1176 | 0709.1667 | Solving Constraint Satisfaction Problems through Belief Propagation-guided decimation | <|reference_start|>Solving Constraint Satisfaction Problems through Belief Propagation-guided decimation: Message passing algorithms have proved surprisingly successful in solving hard constraint satisfaction problems on sparse random graphs. In such applications, variables are fixed sequentially to satisfy the constraints. Message passing is run after each step. Its outcome provides an heuristic to make choices at next step. This approach has been referred to as `decimation,' with reference to analogous procedures in statistical physics. The behavior of decimation procedures is poorly understood. Here we consider a simple randomized decimation algorithm based on belief propagation (BP), and analyze its behavior on random k-satisfiability formulae. In particular, we propose a tree model for its analysis and we conjecture that it provides asymptotically exact predictions in the limit of large instances. This conjecture is confirmed by numerical simulations.<|reference_end|> | arxiv | @article{montanari2007solving,
title={Solving Constraint Satisfaction Problems through Belief
Propagation-guided decimation},
author={Andrea Montanari, Federico Ricci-Tersenghi and Guilhem Semerjian},
journal={Proceedings of the 45th Annual Allerton Conference on
Communication, Control, and Computing (Monticello, IL, USA), 352-359 (2007)},
year={2007},
archivePrefix={arXiv},
eprint={0709.1667},
primaryClass={cs.AI cond-mat.dis-nn cond-mat.stat-mech cs.CC}
} | montanari2007solving |
arxiv-1177 | 0709.1674 | Matrix-Lifting Semi-Definite Programming for Decoding in Multiple Antenna Systems | <|reference_start|>Matrix-Lifting Semi-Definite Programming for Decoding in Multiple Antenna Systems: This paper presents a computationally efficient decoder for multiple antenna systems. The proposed algorithm can be used for any constellation (QAM or PSK) and any labeling method. The decoder is based on matrix-lifting Semi-Definite Programming (SDP). The strength of the proposed method lies in a new relaxation algorithm applied to the method of Mobasher et al. This results in a reduction of the number of variables from $(NK+1)^2$ to $(2N+K)^2$, where $N$ is the number of antennas and $K$ is the number of constellation points in each real dimension. Since the computational complexity of solving SDP is a polynomial function of the number of variables, we have a significant complexity reduction. Moreover, the proposed method offers a better performance as compared to the best quasi-maximum likelihood decoding methods reported in the literature.<|reference_end|> | arxiv | @article{mobasher2007matrix-lifting,
title={Matrix-Lifting Semi-Definite Programming for Decoding in Multiple
Antenna Systems},
author={Amin Mobasher and Amir K. Khandani},
journal={arXiv preprint arXiv:0709.1674},
year={2007},
number={Technical report UW-E&CE #2007-06},
archivePrefix={arXiv},
eprint={0709.1674},
primaryClass={cs.IT math.IT}
} | mobasher2007matrix-lifting |
arxiv-1178 | 0709.1699 | Efficient Tabling Mechanisms for Transaction Logic Programs | <|reference_start|>Efficient Tabling Mechanisms for Transaction Logic Programs: In this paper we present efficient evaluation algorithms for the Horn Transaction Logic (a generalization of the regular Horn logic programs with state updates). We present two complementary methods for optimizing the implementation of Transaction Logic. The first method is based on tabling and we modified the proof theory to table calls and answers on states (practically, equivalent to dynamic programming). The call-answer table is indexed on the call and a signature of the state in which the call was made. The answer columns contain the answer unification and a signature of the state after the call was executed. The states are signed efficiently using a technique based on tries and counting. The second method is based on incremental evaluation and it applies when the data oracle contains derived relations. The deletions and insertions (executed in the transaction oracle) change the state of the database. Using the heuristic of inertia (only a part of the state changes in response to elementary updates), most of the time it is cheaper to compute only the changes in the state than to recompute the entire state from scratch. The two methods are complementary by the fact that the first method optimizes the evaluation when a call is repeated in the same state, and the second method optimizes the evaluation of a new state when a call-state pair is not found by the tabling mechanism (i.e. the first method). The proof theory of Transaction Logic with the application of tabling and incremental evaluation is sound and complete with respect to its model theory.<|reference_end|> | arxiv | @article{fodor2007efficient,
title={Efficient Tabling Mechanisms for Transaction Logic Programs},
author={Paul Fodor},
journal={arXiv preprint arXiv:0709.1699},
year={2007},
archivePrefix={arXiv},
eprint={0709.1699},
primaryClass={cs.LO cs.AI}
} | fodor2007efficient |
arxiv-1179 | 0709.1701 | Enrichment of Qualitative Beliefs for Reasoning under Uncertainty | <|reference_start|>Enrichment of Qualitative Beliefs for Reasoning under Uncertainty: This paper deals with enriched qualitative belief functions for reasoning under uncertainty and for combining information expressed in natural language through linguistic labels. In this work, two possible enrichments (quantitative and/or qualitative) of linguistic labels are considered and operators (addition, multiplication, division, etc) for dealing with them are proposed and explained. We denote them $qe$-operators, $qe$ standing for "qualitative-enriched" operators. These operators can be seen as a direct extension of the classical qualitative operators ($q$-operators) proposed recently in the Dezert-Smarandache Theory of plausible and paradoxist reasoning (DSmT). $q$-operators are also justified in details in this paper. The quantitative enrichment of linguistic label is a numerical supporting degree in $[0,\infty)$, while the qualitative enrichment takes its values in a finite ordered set of linguistic values. Quantitative enrichment is less precise than qualitative enrichment, but it is expected more close with what human experts can easily provide when expressing linguistic labels with supporting degrees. Two simple examples are given to show how the fusion of qualitative-enriched belief assignments can be done.<|reference_end|> | arxiv | @article{li2007enrichment,
title={Enrichment of Qualitative Beliefs for Reasoning under Uncertainty},
author={Xinde Li (ICRL), Xinhan Huang (ICRL), Florentin Smarandache (UNM),
Jean Dezert (ONERA)},
journal={arXiv preprint arXiv:0709.1701},
year={2007},
archivePrefix={arXiv},
eprint={0709.1701},
primaryClass={cs.AI}
} | li2007enrichment |
arxiv-1180 | 0709.1744 | Experiments with small helicopter automated landings at unusual attitudes | <|reference_start|>Experiments with small helicopter automated landings at unusual attitudes: This paper describes a set of experiments involving small helicopters landing automated landing at unusual attitudes. By leveraging the increased agility of small air vehicles, we show that it is possible to automatically land a small helicopter on surfaces pitched at angles up to 60 degrees. Such maneuvers require considerable agility from the vehicle and its avionics system, and they pose significant technical and safety challenges. Our work builds upon previous activities in human-inspired, high-agility flight for small rotorcraft. However, it was not possible to leverage manual flight test data to extract landing maneuvers due to stringent attitude and position control requirements. Availability of low-cost, local navigation systems requiring no on-board instrumentation has proven particularly important for these experiments to be successful.<|reference_end|> | arxiv | @article{bayraktar2007experiments,
title={Experiments with small helicopter automated landings at unusual
attitudes},
author={S. Bayraktar and E. Feron},
journal={arXiv preprint arXiv:0709.1744},
year={2007},
archivePrefix={arXiv},
eprint={0709.1744},
primaryClass={cs.RO}
} | bayraktar2007experiments |
arxiv-1181 | 0709.1771 | Variational local structure estimation for image super-resolution | <|reference_start|>Variational local structure estimation for image super-resolution: Super-resolution is an important but difficult problem in image/video processing. If a video sequence or some training set other than the given low-resolution image is available, this kind of extra information can greatly aid in the reconstruction of the high-resolution image. The problem is substantially more difficult with only a single low-resolution image on hand. The image reconstruction methods designed primarily for denoising is insufficient for super-resolution problem in the sense that it tends to oversmooth images with essentially no noise. We propose a new adaptive linear interpolation method based on variational method and inspired by local linear embedding (LLE). The experimental result shows that our method avoids the problem of oversmoothing and preserves image structures well.<|reference_end|> | arxiv | @article{lian2007variational,
title={Variational local structure estimation for image super-resolution},
author={Heng Lian},
journal={arXiv preprint arXiv:0709.1771},
year={2007},
archivePrefix={arXiv},
eprint={0709.1771},
primaryClass={cs.CV}
} | lian2007variational |
arxiv-1182 | 0709.1794 | Overlap-free words and spectra of matrices | <|reference_start|>Overlap-free words and spectra of matrices: Overlap-free words are words over the binary alphabet $A=\{a, b\}$ that do not contain factors of the form $xvxvx$, where $x \in A$ and $v \in A^*$. We analyze the asymptotic growth of the number $u_n$ of overlap-free words of length $n$ as $ n \to \infty$. We obtain explicit formulas for the minimal and maximal rates of growth of $u_n$ in terms of spectral characteristics (the lower spectral radius and the joint spectral radius) of certain sets of matrices of dimension $20 \times 20$. Using these descriptions we provide new estimates of the rates of growth that are within 0.4% and $0.03 %$ of their exact values. The best previously known bounds were within 11% and 3% respectively. We then prove that the value of $u_n$ actually has the same rate of growth for ``almost all'' natural numbers $n$. This ``average'' growth is distinct from the maximal and minimal rates and can also be expressed in terms of a spectral quantity (the Lyapunov exponent). We use this expression to estimate it. In order to obtain our estimates, we introduce new algorithms to compute spectral characteristics of sets of matrices. These algorithms can be used in other contexts and are of independent interest.<|reference_end|> | arxiv | @article{jungers2007overlap-free,
title={Overlap-free words and spectra of matrices},
author={Raphael M. Jungers, Vladimir Y. Protasov, Vincent D. Blondel},
journal={arXiv preprint arXiv:0709.1794},
year={2007},
archivePrefix={arXiv},
eprint={0709.1794},
primaryClass={cs.DM}
} | jungers2007overlap-free |
arxiv-1183 | 0709.1920 | Bandwidth selection for kernel estimation in mixed multi-dimensional spaces | <|reference_start|>Bandwidth selection for kernel estimation in mixed multi-dimensional spaces: Kernel estimation techniques, such as mean shift, suffer from one major drawback: the kernel bandwidth selection. The bandwidth can be fixed for all the data set or can vary at each points. Automatic bandwidth selection becomes a real challenge in case of multidimensional heterogeneous features. This paper presents a solution to this problem. It is an extension of \cite{Comaniciu03a} which was based on the fundamental property of normal distributions regarding the bias of the normalized density gradient. The selection is done iteratively for each type of features, by looking for the stability of local bandwidth estimates across a predefined range of bandwidths. A pseudo balloon mean shift filtering and partitioning are introduced. The validity of the method is demonstrated in the context of color image segmentation based on a 5-dimensional space.<|reference_end|> | arxiv | @article{bugeau2007bandwidth,
title={Bandwidth selection for kernel estimation in mixed multi-dimensional
spaces},
author={Aurelie Bugeau (IRISA), Patrick P'erez (IRISA)},
journal={arXiv preprint arXiv:0709.1920},
year={2007},
archivePrefix={arXiv},
eprint={0709.1920},
primaryClass={cs.CV}
} | bugeau2007bandwidth |
arxiv-1184 | 0709.1934 | CD(4) has bounded width | <|reference_start|>CD(4) has bounded width: We prove that the constraint languages invariant under a short sequence of J\'onsson terms (containing at most three non-trivial ternary terms) are tractable by showing that they have bounded width. This improves the previous result by Kiss and Valeriote and presents some evidence that the Larose-Zadori conjecture holds in the congruence-distributive case.<|reference_end|> | arxiv | @article{carvalho2007cd(4),
title={CD(4) has bounded width},
author={Catarina Carvalho, V'ictor Dalmau, Petar Markovi'c and Mikl'os
Mar'oti},
journal={arXiv preprint arXiv:0709.1934},
year={2007},
archivePrefix={arXiv},
eprint={0709.1934},
primaryClass={math.LO cs.CC}
} | carvalho2007cd(4) |
arxiv-1185 | 0709.1941 | Speeding up Simplification of Polygonal Curves using Nested Approximations | <|reference_start|>Speeding up Simplification of Polygonal Curves using Nested Approximations: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used between any two successive levels of resolution satisfies some conditions, the multiresolution algorithm MR will have a complexity lower than the complexity of A. In particular, we show that if A has a O(N2/K) complexity (the complexity of a reduced search dynamic solution approach), where N and K are respectively the initial and the final number of segments, the complexity of MR is in O(N).We experimentally compare the outcomes of MR with those of the optimal "full search" dynamic programming solution and of classical merge and split approaches. The experimental evaluations confirm the theoretical derivations and show that the proposed approach evaluated on 2D coastal maps either shows a lower complexity or provides polygonal approximations closer to the initial curves.<|reference_end|> | arxiv | @article{marteau2007speeding,
title={Speeding up Simplification of Polygonal Curves using Nested
Approximations},
author={Pierre-Franc{c}ois Marteau (VALORIA), Gildas G. M'enier (VALORIA)},
journal={Pattern Analysis & Applications (2008) 1-8},
year={2007},
doi={10.1007/s10044-008-0133-y},
archivePrefix={arXiv},
eprint={0709.1941},
primaryClass={cs.CG}
} | marteau2007speeding |
arxiv-1186 | 0709.1942 | Connecting Polygonizations via Stretches and Twangs | <|reference_start|>Connecting Polygonizations via Stretches and Twangs: We show that the space of polygonizations of a fixed planar point set S of n points is connected by O(n^2) ``moves'' between simple polygons. Each move is composed of a sequence of atomic moves called ``stretches'' and ``twangs''. These atomic moves walk between weakly simple ``polygonal wraps'' of S. These moves show promise to serve as a basis for generating random polygons.<|reference_end|> | arxiv | @article{damian2007connecting,
title={Connecting Polygonizations via Stretches and Twangs},
author={Mirela Damian, Robin Flatland, Joseph O'Rourke, Suneeta Ramaswami},
journal={arXiv preprint arXiv:0709.1942},
year={2007},
archivePrefix={arXiv},
eprint={0709.1942},
primaryClass={cs.CG cs.DM}
} | damian2007connecting |
arxiv-1187 | 0709.2016 | Distribution of PageRank Mass Among Principle Components of the Web | <|reference_start|>Distribution of PageRank Mass Among Principle Components of the Web: We study the PageRank mass of principal components in a bow-tie Web Graph, as a function of the damping factor c. Using a singular perturbation approach, we show that the PageRank share of IN and SCC components remains high even for very large values of the damping factor, in spite of the fact that it drops to zero when c goes to one. However, a detailed study of the OUT component reveals the presence ``dead-ends'' (small groups of pages linking only to each other) that receive an unfairly high ranking when c is close to one. We argue that this problem can be mitigated by choosing c as small as 1/2.<|reference_end|> | arxiv | @article{avrachenkov2007distribution,
title={Distribution of PageRank Mass Among Principle Components of the Web},
author={Konstantin Avrachenkov, Nelly Litvak, Kim Son Pham},
journal={arXiv preprint arXiv:0709.2016},
year={2007},
archivePrefix={arXiv},
eprint={0709.2016},
primaryClass={cs.NI cs.DS}
} | avrachenkov2007distribution |
arxiv-1188 | 0709.2065 | Toward Psycho-robots | <|reference_start|>Toward Psycho-robots: We try to perform geometrization of psychology by representing mental states, <<ideas>>, by points of a metric space, <<mental space>>. Evolution of ideas is described by dynamical systems in metric mental space. We apply the mental space approach for modeling of flows of unconscious and conscious information in the human brain. In a series of models, Models 1-4, we consider cognitive systems with increasing complexity of psychological behavior determined by structure of flows of ideas. Since our models are in fact models of the AI-type, one immediately recognizes that they can be used for creation of AI-systems, which we call psycho-robots, exhibiting important elements of human psyche. Creation of such psycho-robots may be useful improvement of domestic robots. At the moment domestic robots are merely simple working devices (e.g. vacuum cleaners or lawn mowers) . However, in future one can expect demand in systems which be able not only perform simple work tasks, but would have elements of human self-developing psyche. Such AI-psyche could play an important role both in relations between psycho-robots and their owners as well as between psycho-robots. Since the presence of a huge numbers of psycho-complexes is an essential characteristic of human psychology, it would be interesting to model them in the AI-framework.<|reference_end|> | arxiv | @article{khrennikov2007toward,
title={Toward Psycho-robots},
author={Andrei Khrennikov},
journal={Paladyn Volume 1, Number 2, 99-108, 2010},
year={2007},
doi={10.2478/s13230-010-0014-0},
archivePrefix={arXiv},
eprint={0709.2065},
primaryClass={cs.AI}
} | khrennikov2007toward |
arxiv-1189 | 0709.2074 | Generalized entropies and open random and scale-free networks | <|reference_start|>Generalized entropies and open random and scale-free networks: We propose the concept of open network as an arbitrary selection of nodes of a large unknown network. Using the hypothesis that information of the whole network structure can be extrapolated from an arbitrary set of its nodes, we use Renyi mutual entropies in different q-orders to establish the minimum critical size of a random set of nodes that represents reliably the information of the main network structure. We also identify the clusters of nodes responsible for the structure of their containing network.<|reference_end|> | arxiv | @article{gudkov2007generalized,
title={Generalized entropies and open random and scale-free networks},
author={V. Gudkov and V. Montealegre},
journal={arXiv preprint arXiv:0709.2074},
year={2007},
doi={10.1063/1.2828754},
archivePrefix={arXiv},
eprint={0709.2074},
primaryClass={cond-mat.dis-nn cs.NI physics.soc-ph}
} | gudkov2007generalized |
arxiv-1190 | 0709.2196 | Bregman Voronoi Diagrams: Properties, Algorithms and Applications | <|reference_start|>Bregman Voronoi Diagrams: Properties, Algorithms and Applications: The Voronoi diagram of a finite set of objects is a fundamental geometric structure that subdivides the embedding space into regions, each region consisting of the points that are closer to a given object than to the others. We may define many variants of Voronoi diagrams depending on the class of objects, the distance functions and the embedding space. In this paper, we investigate a framework for defining and building Voronoi diagrams for a broad class of distance functions called Bregman divergences. Bregman divergences include not only the traditional (squared) Euclidean distance but also various divergence measures based on entropic functions. Accordingly, Bregman Voronoi diagrams allow to define information-theoretic Voronoi diagrams in statistical parametric spaces based on the relative entropy of distributions. We define several types of Bregman diagrams, establish correspondences between those diagrams (using the Legendre transformation), and show how to compute them efficiently. We also introduce extensions of these diagrams, e.g. k-order and k-bag Bregman Voronoi diagrams, and introduce Bregman triangulations of a set of points and their connexion with Bregman Voronoi diagrams. We show that these triangulations capture many of the properties of the celebrated Delaunay triangulation. Finally, we give some applications of Bregman Voronoi diagrams which are of interest in the context of computational geometry and machine learning.<|reference_end|> | arxiv | @article{nielsen2007bregman,
title={Bregman Voronoi Diagrams: Properties, Algorithms and Applications},
author={Frank Nielsen, Jean-Daniel Boissonnat, Richard Nock},
journal={Discrete & Computational Geometry volume 44, pages281-307(2010)},
year={2007},
doi={10.1007/s00454-010-9256-1},
archivePrefix={arXiv},
eprint={0709.2196},
primaryClass={cs.CG}
} | nielsen2007bregman |
arxiv-1191 | 0709.2201 | A complete proof of The Graceful Tree Conjecture using the concept of Edge Degree | <|reference_start|>A complete proof of The Graceful Tree Conjecture using the concept of Edge Degree: We show the Graceful Tree Conjecture holds.<|reference_end|> | arxiv | @article{gilbert2007a,
title={A complete proof of The Graceful Tree Conjecture using the concept of
Edge Degree},
author={Jesse Gilbert},
journal={arXiv preprint arXiv:0709.2201},
year={2007},
archivePrefix={arXiv},
eprint={0709.2201},
primaryClass={cs.DM}
} | gilbert2007a |
arxiv-1192 | 0709.2224 | Self-similar dilatation structures and automata | <|reference_start|>Self-similar dilatation structures and automata: We show that on the boundary of the dyadic tree, any self-similar dilatation structure induces a web of interacting automata. This is a short version, for publication, of the paper arXiv:math/0612509v2<|reference_end|> | arxiv | @article{buliga2007self-similar,
title={Self-similar dilatation structures and automata},
author={Marius Buliga},
journal={Proceedings of the Sixth Congress of Romanian Mahematicians,
Bucharest 2007, vol. 1, 557-564},
year={2007},
archivePrefix={arXiv},
eprint={0709.2224},
primaryClass={math.MG cs.DM}
} | buliga2007self-similar |
arxiv-1193 | 0709.2225 | Improved Linear Parallel Interference Cancellers | <|reference_start|>Improved Linear Parallel Interference Cancellers: In this paper, taking the view that a linear parallel interference canceller (LPIC) can be seen as a linear matrix filter, we propose new linear matrix filters that can result in improved bit error performance compared to other LPICs in the literature. The motivation for the proposed filters arises from the possibility of avoiding the generation of certain interference and noise terms in a given stage that would have been present in a conventional LPIC (CLPIC). In the proposed filters, we achieve such avoidance of the generation of interference and noise terms in a given stage by simply making the diagonal elements of a certain matrix in that stage equal to zero. Hence, the proposed filters do not require additional complexity compared to the CLPIC, and they can allow achieving a certain error performance using fewer LPIC stages. We also extend the proposed matrix filter solutions to a multicarrier DS-CDMA system, where we consider two types of receivers. In one receiver (referred to as Type-I receiver), LPIC is performed on each subcarrier first, followed by multicarrier combining (MCC). In the other receiver (called Type-II receiver), MCC is performed first, followed by LPIC. We show that in both Type-I and Type-II receivers, the proposed matrix filters outperform other matrix filters. Also, Type-II receiver performs better than Type-I receiver because of enhanced accuracy of the interference estimates achieved due to frequency diversity offered by MCC.<|reference_end|> | arxiv | @article{srikanth2007improved,
title={Improved Linear Parallel Interference Cancellers},
author={T. Srikanth, K. Vishnu Vardhan, A. Chockalingam, and L. B. Milstein},
journal={arXiv preprint arXiv:0709.2225},
year={2007},
archivePrefix={arXiv},
eprint={0709.2225},
primaryClass={cs.IT cs.SC cs.SD cs.SE math.IT}
} | srikanth2007improved |
arxiv-1194 | 0709.2252 | Otiy: Loactors tracking nodes | <|reference_start|>Otiy: Loactors tracking nodes: We propose Otiy, a node-centric location service that limits the impact of location updates generate by mobile nodes in IEEE802.11-based wireless mesh networks. Existing location services use node identifiers to determine the locator (aka anchor) that is responsible for keeping track of a node's location. Such a strategy can be inefficient because: (i) identifiers give no clue on the node's mobility and (ii) locators can be far from the source/destination shortest path, which increases both location delays and bandwidth consumption. To solve these issues, Otiy introduces a new strategy that identifies nodes to play the role of locators based on the likelihood of a destination to be close to these nodes- i.e., locators are identified depending on the mobility pattern of nodes. Otiy relies on the cyclic mobility patterns of nodes and creates a slotted agenda composed of a set of predicted locations, defined according to the past and present patterns of mobility. Correspondent nodes fetch this agenda only once and use it as a reference for identifying which locators are responsible for the node at different points in time. Over a period of about one year, the weekly proportion of nodes having at least 50% of exact location predictions is in average about 75%. This proportion increases by 10% when nodes also consider their closeness to the locator from only what they know about the network.<|reference_end|> | arxiv | @article{boc2007otiy:,
title={Otiy: Loactors tracking nodes},
author={Mathias Boc, Anne Fladenmuller and Marcelo dias de Amorim},
journal={arXiv preprint arXiv:0709.2252},
year={2007},
archivePrefix={arXiv},
eprint={0709.2252},
primaryClass={cs.NI}
} | boc2007otiy: |
arxiv-1195 | 0709.2330 | Queueing for ergodic arrivals and services | <|reference_start|>Queueing for ergodic arrivals and services: In this paper we revisit the results of Loynes (1962) on stability of queues for ergodic arrivals and services, and show examples when the arrivals are bounded and ergodic, the service rate is constant, and under stability the limit distribution has larger than exponential tail.<|reference_end|> | arxiv | @article{gyorfi2007queueing,
title={Queueing for ergodic arrivals and services},
author={L. Gyorfi, G. Morvai},
journal={In Limit Theorems in Probability and Statistics, I. Berkes E.
Csaki, M. Csorgo (Eds.), pp. 127-141, J. Bolyai Mathematical Society, 2002},
year={2007},
archivePrefix={arXiv},
eprint={0709.2330},
primaryClass={math.PR cs.IT math.IT}
} | gyorfi2007queueing |
arxiv-1196 | 0709.2346 | Pushdown Compression | <|reference_start|>Pushdown Compression: The pressing need for eficient compression schemes for XML documents has recently been focused on stack computation [6, 9], and in particular calls for a formulation of information-lossless stack or pushdown compressors that allows a formal analysis of their performance and a more ambitious use of the stack in XML compression, where so far it is mainly connected to parsing mechanisms. In this paper we introduce the model of pushdown compressor, based on pushdown transducers that compute a single injective function while keeping the widest generality regarding stack computation. The celebrated Lempel-Ziv algorithm LZ78 [10] was introduced as a general purpose compression algorithm that outperforms finite-state compressors on all sequences. We compare the performance of the Lempel-Ziv algorithm with that of the pushdown compressors, or compression algorithms that can be implemented with a pushdown transducer. This comparison is made without any a priori assumption on the data's source and considering the asymptotic compression ratio for infinite sequences. We prove that Lempel-Ziv is incomparable with pushdown compressors.<|reference_end|> | arxiv | @article{albert2007pushdown,
title={Pushdown Compression},
author={Pilar Albert, Elvira Mayordomo, Philippe Moser, Sylvain Perifel},
journal={arXiv preprint arXiv:0709.2346},
year={2007},
archivePrefix={arXiv},
eprint={0709.2346},
primaryClass={cs.IT cs.CC math.IT}
} | albert2007pushdown |
arxiv-1197 | 0709.2401 | Bootstrapping Deep Lexical Resources: Resources for Courses | <|reference_start|>Bootstrapping Deep Lexical Resources: Resources for Courses: We propose a range of deep lexical acquisition methods which make use of morphological, syntactic and ontological language resources to model word similarity and bootstrap from a seed lexicon. The different methods are deployed in learning lexical items for a precision grammar, and shown to each have strengths and weaknesses over different word classes. A particular focus of this paper is the relative accessibility of different language resource types, and predicted ``bang for the buck'' associated with each in deep lexical acquisition applications.<|reference_end|> | arxiv | @article{baldwin2007bootstrapping,
title={Bootstrapping Deep Lexical Resources: Resources for Courses},
author={Timothy Baldwin},
journal={In Proceedings of the ACL-SIGLEX 2005 Workshop on Deep Lexical
Acquisition, Ann Arbor, USA, pp. 67-76},
year={2007},
archivePrefix={arXiv},
eprint={0709.2401},
primaryClass={cs.CL}
} | baldwin2007bootstrapping |
arxiv-1198 | 0709.2405 | New Complexity Bounds for Certain Real Fewnomial Zero Sets | <|reference_start|>New Complexity Bounds for Certain Real Fewnomial Zero Sets: Consider real bivariate polynomials f and g, respectively having 3 and m monomial terms. We prove that for all m>=3, there are systems of the form (f,g) having exactly 2m-1 roots in the positive quadrant. Even examples with m=4 having 7 positive roots were unknown before this paper, so we detail an explicit example of this form. We also present an O(n^{11}) upper bound for the number of diffeotopy types of the real zero set of an n-variate polynomial with n+4 monomial terms.<|reference_end|> | arxiv | @article{gomez2007new,
title={New Complexity Bounds for Certain Real Fewnomial Zero Sets},
author={Joel Gomez, Andrew Niles, and J. Maurice Rojas},
journal={arXiv preprint arXiv:0709.2405},
year={2007},
archivePrefix={arXiv},
eprint={0709.2405},
primaryClass={math.AG cs.CG}
} | gomez2007new |
arxiv-1199 | 0709.2410 | Distributed Decision Through Self-Synchronizing Sensor Networks in the Presence of Propagation Delays and Asymmetric Channels | <|reference_start|>Distributed Decision Through Self-Synchronizing Sensor Networks in the Presence of Propagation Delays and Asymmetric Channels: In this paper we propose and analyze a distributed algorithm for achieving globally optimal decisions, either estimation or detection, through a self-synchronization mechanism among linearly coupled integrators initialized with local measurements. We model the interaction among the nodes as a directed graph with weights (possibly) dependent on the radio channels and we pose special attention to the effect of the propagation delay occurring in the exchange of data among sensors, as a function of the network geometry. We derive necessary and sufficient conditions for the proposed system to reach a consensus on globally optimal decision statistics. One of the major results proved in this work is that a consensus is reached with exponential convergence speed for any bounded delay condition if and only if the directed graph is quasi-strongly connected. We provide a closed form expression for the global consensus, showing that the effect of delays is, in general, the introduction of a bias in the final decision. Finally, we exploit our closed form expression to devise a double-step consensus mechanism able to provide an unbiased estimate with minimum extra complexity, without the need to know or estimate the channel parameters.<|reference_end|> | arxiv | @article{scutari2007distributed,
title={Distributed Decision Through Self-Synchronizing Sensor Networks in the
Presence of Propagation Delays and Asymmetric Channels},
author={Gesualdo Scutari, Sergio Barbarossa, Loreto Pescosolido},
journal={arXiv preprint arXiv:0709.2410},
year={2007},
doi={10.1109/TSP.2007.909377},
archivePrefix={arXiv},
eprint={0709.2410},
primaryClass={cs.MA cs.DC}
} | scutari2007distributed |
arxiv-1200 | 0709.2445 | A Simple Characterization of Strategic Behaviors in Broadcast Channels | <|reference_start|>A Simple Characterization of Strategic Behaviors in Broadcast Channels: In this paper, we consider the problem of resource allocation among two competing users sharing a binary symmetric broadcast channel. We model the interaction between autonomous selfish users in the resource allocation and analyze their strategic behavior in manipulating the allocation outcome. We analytically show that users will improve their performance (i.e. gain higher allocated rates) if they have more information about the strategy of the competing user.<|reference_end|> | arxiv | @article{su2007a,
title={A Simple Characterization of Strategic Behaviors in Broadcast Channels},
author={Yi Su and Mihaela van der Schaar},
journal={arXiv preprint arXiv:0709.2445},
year={2007},
doi={10.1109/LSP.2007.910259},
archivePrefix={arXiv},
eprint={0709.2445},
primaryClass={cs.IT cs.GT math.IT}
} | su2007a |
Subsets and Splits