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-701 | 0707.0978 | When Network Coding and Dirty Paper Coding meet in a Cooperative Ad Hoc Network | <|reference_start|>When Network Coding and Dirty Paper Coding meet in a Cooperative Ad Hoc Network: We develop and analyze new cooperative strategies for ad hoc networks that are more spectrally efficient than classical DF cooperative protocols. Using analog network coding, our strategies preserve the practical half-duplex assumption but relax the orthogonality constraint. The introduction of interference due to non-orthogonality is mitigated thanks to precoding, in particular Dirty Paper coding. Combined with smart power allocation, our cooperation strategies allow to save time and lead to more efficient use of bandwidth and to improved network throughput with respect to classical RDF/PDF.<|reference_end|> | arxiv | @article{fawaz2007when,
title={When Network Coding and Dirty Paper Coding meet in a Cooperative Ad Hoc
Network},
author={Nadia Fawaz (1), David Gesbert (1), Merouane Debbah (2) ((1) Eurecom
Institute, (2) Supelec)},
journal={arXiv preprint arXiv:0707.0978},
year={2007},
archivePrefix={arXiv},
eprint={0707.0978},
primaryClass={cs.IT math.IT}
} | fawaz2007when |
arxiv-702 | 0707.1008 | On Cognitive Interference Networks | <|reference_start|>On Cognitive Interference Networks: We study the high-power asymptotic behavior of the sum-rate capacity of multi-user interference networks with an equal number of transmitters and receivers. We assume that each transmitter is cognizant of the message it wishes to convey to its corresponding receiver and also of the messages that a subset of the other transmitters wish to send. The receivers are assumed not to be able to cooperate in any way so that they must base their decision on the signal they receive only. We focus on the network's pre-log, which is defined as the limiting ratio of the sum-rate capacity to half the logarithm of the transmitted power. We present both upper and lower bounds on the network's pre-log. The lower bounds are based on a linear partial-cancellation scheme which entails linearly transforming Gaussian codebooks so as to eliminate the interference in a subset of the receivers. Inter alias, the bounds give a complete characterization of the networks and side-information settings that result in a full pre-log, i.e., in a pre-log that is equal to the number of transmitters (and receivers) as well as a complete characterization of networks whose pre-log is equal to the full pre-log minus one. They also fully characterize networks where the full pre-log can only be achieved if each transmitter knows the messages of all users, i.e., when the side-information is "full".<|reference_end|> | arxiv | @article{lapidoth2007on,
title={On Cognitive Interference Networks},
author={Amos Lapidoth, Shlomo Shamai (Shitz), Michele A. Wigger},
journal={arXiv preprint arXiv:0707.1008},
year={2007},
doi={10.1109/ITW.2007.4313095},
archivePrefix={arXiv},
eprint={0707.1008},
primaryClass={cs.IT math.IT}
} | lapidoth2007on |
arxiv-703 | 0707.1025 | The star trellis decoding of Reed-Solomon codes | <|reference_start|>The star trellis decoding of Reed-Solomon codes: The new method for Reed-Solomon codes decoding is introduced. The method is based on the star trellis decoding of the binary image of Reed-Solomon codes.<|reference_end|> | arxiv | @article{fedorenko2007the,
title={The star trellis decoding of Reed-Solomon codes},
author={Sergei Fedorenko},
journal={arXiv preprint arXiv:0707.1025},
year={2007},
archivePrefix={arXiv},
eprint={0707.1025},
primaryClass={cs.IT math.IT}
} | fedorenko2007the |
arxiv-704 | 0707.1051 | Noisy Sorting Without Resampling | <|reference_start|>Noisy Sorting Without Resampling: In this paper we study noisy sorting without re-sampling. In this problem there is an unknown order $a_{\pi(1)} < ... < a_{\pi(n)}$ where $\pi$ is a permutation on $n$ elements. The input is the status of $n \choose 2$ queries of the form $q(a_i,x_j)$, where $q(a_i,a_j) = +$ with probability at least $1/2+\ga$ if $\pi(i) > \pi(j)$ for all pairs $i \neq j$, where $\ga > 0$ is a constant and $q(a_i,a_j) = -q(a_j,a_i)$ for all $i$ and $j$. It is assumed that the errors are independent. Given the status of the queries the goal is to find the maximum likelihood order. In other words, the goal is find a permutation $\sigma$ that minimizes the number of pairs $\sigma(i) > \sigma(j)$ where $q(\sigma(i),\sigma(j)) = -$. The problem so defined is the feedback arc set problem on distributions of inputs, each of which is a tournament obtained as a noisy perturbations of a linear order. Note that when $\ga < 1/2$ and $n$ is large, it is impossible to recover the original order $\pi$. It is known that the weighted feedback are set problem on tournaments is NP-hard in general. Here we present an algorithm of running time $n^{O(\gamma^{-4})}$ and sampling complexity $O_{\gamma}(n \log n)$ that with high probability solves the noisy sorting without re-sampling problem. We also show that if $a_{\sigma(1)},a_{\sigma(2)},...,a_{\sigma(n)}$ is an optimal solution of the problem then it is ``close'' to the original order. More formally, with high probability it holds that $\sum_i |\sigma(i) - \pi(i)| = \Theta(n)$ and $\max_i |\sigma(i) - \pi(i)| = \Theta(\log n)$. Our results are of interest in applications to ranking, such as ranking in sports, or ranking of search items based on comparisons by experts.<|reference_end|> | arxiv | @article{braverman2007noisy,
title={Noisy Sorting Without Resampling},
author={Mark Braverman, Elchanan Mossel},
journal={arXiv preprint arXiv:0707.1051},
year={2007},
archivePrefix={arXiv},
eprint={0707.1051},
primaryClass={cs.DS}
} | braverman2007noisy |
arxiv-705 | 0707.1053 | Exploration via design and the cost of uncertainty in keyword auctions | <|reference_start|>Exploration via design and the cost of uncertainty in keyword auctions: We present a deterministic exploration mechanism for sponsored search auctions, which enables the auctioneer to learn the relevance scores of advertisers, and allows advertisers to estimate the true value of clicks generated at the auction site. This exploratory mechanism deviates only minimally from the mechanism being currently used by Google and Yahoo! in the sense that it retains the same pricing rule, similar ranking scheme, as well as, similar mathematical structure of payoffs. In particular, the estimations of the relevance scores and true-values are achieved by providing a chance to lower ranked advertisers to obtain better slots. This allows the search engine to potentially test a new pool of advertisers, and correspondingly, enables new advertisers to estimate the value of clicks/leads generated via the auction. Both these quantities are unknown a priori, and their knowledge is necessary for the auction to operate efficiently. We show that such an exploration policy can be incorporated without any significant loss in revenue for the auctioneer. We compare the revenue of the new mechanism to that of the standard mechanism at their corresponding symmetric Nash equilibria and compute the cost of uncertainty, which is defined as the relative loss in expected revenue per impression. We also bound the loss in efficiency, as well as, in user experience due to exploration, under the same solution concept (i.e. SNE). Thus the proposed exploration mechanism learns the relevance scores while incorporating the incentive constraints from the advertisers who are selfish and are trying to maximize their own profits, and therefore, the exploration is essentially achieved via mechanism design. We also discuss variations of the new mechanism such as truthful implementations.<|reference_end|> | arxiv | @article{singh2007exploration,
title={Exploration via design and the cost of uncertainty in keyword auctions},
author={Sudhir Kumar Singh, Vwani P. Roychowdhury, Milan Bradonji'c, Behnam
A. Rezaei},
journal={arXiv preprint arXiv:0707.1053},
year={2007},
archivePrefix={arXiv},
eprint={0707.1053},
primaryClass={cs.GT}
} | singh2007exploration |
arxiv-706 | 0707.1057 | For-profit mediators in sponsored search advertising | <|reference_start|>For-profit mediators in sponsored search advertising: A mediator is a well-known construct in game theory, and is an entity that plays on behalf of some of the agents who choose to use its services, while the rest of the agents participate in the game directly. We initiate a game theoretic study of sponsored search auctions, such as those used by Google and Yahoo!, involving {\em incentive driven} mediators. We refer to such mediators as {\em for-profit} mediators, so as to distinguish them from mediators introduced in prior work, who have no monetary incentives, and are driven by the altruistic goal of implementing certain desired outcomes. We show that in our model, (i) players/advertisers can improve their payoffs by choosing to use the services of the mediator, compared to directly participating in the auction; (ii) the mediator can obtain monetary benefit by managing the advertising burden of its group of advertisers; and (iii) the payoffs of the mediator and the advertisers it plays for are compatible with the incentive constraints from the advertisers who do dot use its services. A simple intuition behind the above result comes from the observation that the mediator has more information about and more control over the bid profile than any individual advertiser, allowing her to reduce the payments made to the auctioneer, while still maintaining incentive constraints. Further, our results indicate 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 to coexist.<|reference_end|> | arxiv | @article{singh2007for-profit,
title={For-profit mediators in sponsored search advertising},
author={Sudhir Kumar Singh, Vwani P. Roychowdhury, Himawan Gunadhi, Behnam A.
Rezaei},
journal={arXiv preprint arXiv:0707.1057},
year={2007},
archivePrefix={arXiv},
eprint={0707.1057},
primaryClass={cs.GT}
} | singh2007for-profit |
arxiv-707 | 0707.1059 | Projection semantics for rigid loops | <|reference_start|>Projection semantics for rigid loops: A rigid loop is a for-loop with a counter not accessible to the loop body or any other part of a program. Special instructions for rigid loops are introduced on top of the syntax of the program algebra PGA. Two different semantic projections are provided and proven equivalent. One of these is taken to have definitional status on the basis of two criteria: `normative semantic adequacy' and `indicative algorithmic adequacy'.<|reference_end|> | arxiv | @article{bergstra2007projection,
title={Projection semantics for rigid loops},
author={Jan A. Bergstra and Alban Ponse},
journal={arXiv preprint arXiv:0707.1059},
year={2007},
number={PRG0604},
archivePrefix={arXiv},
eprint={0707.1059},
primaryClass={cs.PL}
} | bergstra2007projection |
arxiv-708 | 0707.1063 | High-resolution distributed sampling of bandlimited fields with low-precision sensors | <|reference_start|>High-resolution distributed sampling of bandlimited fields with low-precision sensors: The problem of sampling a discrete-time sequence of spatially bandlimited fields with a bounded dynamic range, in a distributed, communication-constrained, processing environment is addressed. A central unit, having access to the data gathered by a dense network of fixed-precision sensors, operating under stringent inter-node communication constraints, is required to reconstruct the field snapshots to maximum accuracy. Both deterministic and stochastic field models are considered. For stochastic fields, results are established in the almost-sure sense. The feasibility of having a flexible tradeoff between the oversampling rate (sensor density) and the analog-to-digital converter (ADC) precision, while achieving an exponential accuracy in the number of bits per Nyquist-interval per snapshot is demonstrated. This exposes an underlying ``conservation of bits'' principle: the bit-budget per Nyquist-interval per snapshot (the rate) can be distributed along the amplitude axis (sensor-precision) and space (sensor density) in an almost arbitrary discrete-valued manner, while retaining the same (exponential) distortion-rate characteristics. Achievable information scaling laws for field reconstruction over a bounded region are also derived: With N one-bit sensors per Nyquist-interval, $\Theta(\log N)$ Nyquist-intervals, and total network bitrate $R_{net} = \Theta((\log N)^2)$ (per-sensor bitrate $\Theta((\log N)/N)$), the maximum pointwise distortion goes to zero as $D = O((\log N)^2/N)$ or $D = O(R_{net} 2^{-\beta \sqrt{R_{net}}})$. This is shown to be possible with only nearest-neighbor communication, distributed coding, and appropriate interpolation algorithms. For a fixed, nonzero target distortion, the number of fixed-precision sensors and the network rate needed is always finite.<|reference_end|> | arxiv | @article{kumar2007high-resolution,
title={High-resolution distributed sampling of bandlimited fields with
low-precision sensors},
author={Animesh Kumar, Prakash Ishwar, and Kannan Ramchandran},
journal={arXiv preprint arXiv:0707.1063},
year={2007},
doi={10.1109/TIT.2010.2090194},
archivePrefix={arXiv},
eprint={0707.1063},
primaryClass={cs.IT math.IT}
} | kumar2007high-resolution |
arxiv-709 | 0707.1064 | The Effect of Noise Correlation in AF Relay Networks | <|reference_start|>The Effect of Noise Correlation in AF Relay Networks: In wireless relay networks, noise at the relays can be correlated possibly due to common interference or noise propagation from preceding hops. In this work we consider a parallel relay network with noise correlation. For the relay strategy of amplify-and-forward (AF), we determine the optimal rate maximizing relay gains when correlation knowledge is available at the relays. The effect of correlation on the performance of the relay networks is analyzed for the cases where full knowledge of correlation is available at the relays and when there is no knowledge about the correlation structure. Interestingly we find that, on the average, noise correlation is beneficial regardless of whether the relays know the noise covariance matrix or not. However, the knowledge of correlation can greatly improve the performance. Typically, the performance improvement from correlation knowledge increases with the relay power and the number of relays. With perfect correlation knowledge the system is capable of canceling interference if the number of interferers is less than the number of relays. For a dual-hop multiple access parallel network, we obtain closed form expressions for the maximum sum-rate and the optimal relay strategy. The relay optimization for networks with three hops is also considered. For any relay gains for the first stage relays, this represents a parallel relay network with correlated noise. Based on the result of two hop networks with noise correlation, we propose an algorithm for solving the relay optimization problem for three-hop networks.<|reference_end|> | arxiv | @article{gomadam2007the,
title={The Effect of Noise Correlation in AF Relay Networks},
author={Krishna S. Gomadam and Syed A. Jafar},
journal={arXiv preprint arXiv:0707.1064},
year={2007},
archivePrefix={arXiv},
eprint={0707.1064},
primaryClass={cs.IT math.IT}
} | gomadam2007the |
arxiv-710 | 0707.1083 | Delayed Correlations in Inter-Domain Network Traffic | <|reference_start|>Delayed Correlations in Inter-Domain Network Traffic: To observe the evolution of network traffic correlations we analyze the eigenvalue spectra and eigenvectors statistics of delayed correlation matrices of network traffic counts time series. Delayed correlation matrix D is composed of the correlations between one variable in the multivariable time series and another at a time delay \tau . Inverse participation ratio (IPR) of eigenvectors of D deviates substantially from the IPR of eigenvectors of the equal time correlation matrix C. We relate this finding to the localization and discuss its importance for network congestion control. The time-lagged correlation pattern between network time series is preserved over a long time, up to 100\tau, where \tau=300 sec. The largest eigenvalue \lambda_{max} of D and the corresponding IPR oscillate with two characteristic periods of 3\tau and 6\tau . The existence of delayed correlations between network time series fits well into the long range dependence (LRD) property of the network traffic. The ability to monitor and control the long memory processes is crucial since they impact the network performance. Injecting the random traffic counts between non-randomly correlated time series, we were able to break the picture of periodicity of \lambda_{max}. In addition, we investigated influence of the periodic injections on both largest eigenvalue and the IPR, and addressed relevance of these indicators for the LRD and self-similarity of the network traffic.<|reference_end|> | arxiv | @article{rojkova2007delayed,
title={Delayed Correlations in Inter-Domain Network Traffic},
author={Viktoria Rojkova, Mehmed Kantardzic},
journal={arXiv preprint arXiv:0707.1083},
year={2007},
archivePrefix={arXiv},
eprint={0707.1083},
primaryClass={cs.NI cs.IR}
} | rojkova2007delayed |
arxiv-711 | 0707.1095 | Better Algorithms and Bounds for Directed Maximum Leaf Problems | <|reference_start|>Better Algorithms and Bounds for Directed Maximum Leaf Problems: The {\sc Directed Maximum Leaf Out-Branching} problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this paper, we improve known parameterized algorithms and combinatorial bounds on the number of leaves in out-branchings. We show that \begin{itemize} \item every strongly connected digraph $D$ of order $n$ with minimum in-degree at least 3 has an out-branching with at least $(n/4)^{1/3}-1$ leaves; \item if a strongly connected digraph $D$ does not contain an out-branching with $k$ leaves, then the pathwidth of its underlying graph is $O(k\log k)$; \item it can be decided in time $2^{O(k\log^2 k)}\cdot n^{O(1)}$ whether a strongly connected digraph on $n$ vertices has an out-branching with at least $k$ leaves. \end{itemize} All improvements use properties of extremal structures obtained after applying local search and of some out-branching decompositions.<|reference_end|> | arxiv | @article{alon2007better,
title={Better Algorithms and Bounds for Directed Maximum Leaf Problems},
author={Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket
Saurabh},
journal={arXiv preprint arXiv:0707.1095},
year={2007},
archivePrefix={arXiv},
eprint={0707.1095},
primaryClass={cs.DS cs.DM}
} | alon2007better |
arxiv-712 | 0707.1099 | Worst-Case Interactive Communication and Enhancing Sensor Network Lifetime | <|reference_start|>Worst-Case Interactive Communication and Enhancing Sensor Network Lifetime: We are concerned with the problem of maximizing the worst-case lifetime of a data-gathering wireless sensor network consisting of a set of sensor nodes directly communicating with a base-station.We propose to solve this problem by modeling sensor node and base-station communication as the interactive communication between multiple correlated informants (sensor nodes) and a recipient (base-station). We provide practical and scalable interactive communication protocols for data gathering in sensor networks and demonstrate their efficiency compared to traditional approaches. In this paper, we first develop a formalism to address the problem of worst-case interactive communication between a set of multiple correlated informants and a recipient. We realize that there can be different objectives to achieve in such a communication scenario and compute the optimal number of messages and bits exchanged to realize these objectives. Then, we propose to adapt these results in the context of single-hop data-gathering sensor networks. Finally, based on this proposed formalism, we propose a clustering based communication protocol for large sensor networks and demonstrate its superiority over a traditional clustering protocol.<|reference_end|> | arxiv | @article{agnihotri2007worst-case,
title={Worst-Case Interactive Communication and Enhancing Sensor Network
Lifetime},
author={Samar Agnihotri and Pavan Nuggehalli},
journal={arXiv preprint arXiv:0707.1099},
year={2007},
archivePrefix={arXiv},
eprint={0707.1099},
primaryClass={cs.IT math.IT}
} | agnihotri2007worst-case |
arxiv-713 | 0707.1151 | Logic, Design & Organization of PTVD-SHAM; A Parallel Time Varying & Data Super-helical Access Memory | <|reference_start|>Logic, Design & Organization of PTVD-SHAM; A Parallel Time Varying & Data Super-helical Access Memory: This paper encompasses a super helical memory system's design, 'Boolean logic & image-logic' as a theoretical concept of an invention-model to 'store time-data' in terms of anticipating the best memory location ever for data/time. A waterfall effect is deemed to assist the process of potential-difference output-switch into diverse logic states in quantum dot computational methods via utilizing coiled carbon nanotubes (CCNTs) and carbon nanotube field effect transistors (CNFETs). A 'quantum confinement' is thus derived for a flow of particles in a categorized quantum well substrate with a normalized capacitance rectifying high B-field flux into electromagnetic induction. Multi-access of coherent sequences of 'qubit addressing' is gained in any magnitude as pre-defined for the orientation of array displacement. Briefly, Gaussian curvature of k<0 is debated in aim of specifying the 2D electron gas characteristics in scenarios where data is stored in short intervals versus long ones e.g. when k'>(k<0) for greater CCNT diameters, space-time continuum is folded by chance for the particle. This benefits from Maxwell-Lorentz theory in Minkowski's space-time viewpoint alike to crystal oscillators for precise data timing purposes and radar systems e.g., time varying self-clocking devices in diverse geographic locations. This application could also be optional for data depository versus extraction, in the best supercomputer system's locations, autonomously. For best performance in minimizing current limiting mechanisms including electromigration, a multilevel metallization and implant process forming elevated sources/drains for the circuit's staircase pyramidal construction, is discussed accordingly.<|reference_end|> | arxiv | @article{alipour2007logic,,
title={Logic, Design & Organization of PTVD-SHAM; A Parallel Time Varying &
Data Super-helical Access Memory},
author={P. B. Alipour},
journal={arXiv preprint arXiv:0707.1151},
year={2007},
archivePrefix={arXiv},
eprint={0707.1151},
primaryClass={cs.AR}
} | alipour2007logic, |
arxiv-714 | 0707.1176 | Expressing an NP-Complete Problem as the Solvability of a Polynomial Equation | <|reference_start|>Expressing an NP-Complete Problem as the Solvability of a Polynomial Equation: We demonstrate a polynomial approach to express the decision version of the directed Hamiltonian Cycle Problem (HCP), which is NP-Complete, as the Solvability of a Polynomial Equation with a constant number of variables, within a bounded real space. We first introduce four new Theorems for a set of periodic Functions with irrational periods, based on which we then use a trigonometric substitution, to show how the HCP can be expressed as the Solvability of a single polynomial Equation with a constant number of variables. The feasible solution of each of these variables is bounded within two real numbers. We point out what future work is necessary to prove that P=NP.<|reference_end|> | arxiv | @article{chermakani2007expressing,
title={Expressing an NP-Complete Problem as the Solvability of a Polynomial
Equation},
author={Deepak Chermakani},
journal={arXiv preprint arXiv:0707.1176},
year={2007},
archivePrefix={arXiv},
eprint={0707.1176},
primaryClass={cs.CC cs.DM}
} | chermakani2007expressing |
arxiv-715 | 0707.1193 | Singular curves and cusp points in the joint space of 3-RPR parallel manipulators | <|reference_start|>Singular curves and cusp points in the joint space of 3-RPR parallel manipulators: This paper investigates the singular curves in two-dimensional slices of the joint space of a family of planar parallel manipulators. It focuses on special points, referred to as cusp points, which may appear on these curves. Cusp points play an important role in the kinematic behavior of parallel manipulators since they make possible a nonsingular change of assembly mode. The purpose of this study is twofold. First, it reviews an important previous work, which, to the authors' knowledge, has never been exploited yet. Second, it determines the cusp points in any two-dimensional slice of the joint space. First results show that the number of cusp points may vary from zero to eight. This work finds applications in both design and trajectory planning.<|reference_end|> | arxiv | @article{zein2007singular,
title={Singular curves and cusp points in the joint space of 3-RPR parallel
manipulators},
author={Mazen Zein (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={International Conference On Robotics And Automation (2006) 1-6},
year={2007},
archivePrefix={arXiv},
eprint={0707.1193},
primaryClass={cs.RO}
} | zein2007singular |
arxiv-716 | 0707.1241 | Graph-Based Decoding in the Presence of ISI | <|reference_start|>Graph-Based Decoding in the Presence of ISI: We propose an approximation of maximum-likelihood detection in ISI channels based on linear programming or message passing. We convert the detection problem into a binary decoding problem, which can be easily combined with LDPC decoding. We show that, for a certain class of channels and in the absence of coding, the proposed technique provides the exact ML solution without an exponential complexity in the size of channel memory, while for some other channels, this method has a non-diminishing probability of failure as SNR increases. Some analysis is provided for the error events of the proposed technique under linear programming.<|reference_end|> | arxiv | @article{taghavi2007graph-based,
title={Graph-Based Decoding in the Presence of ISI},
author={Mohammad H. Taghavi, Paul H. Siegel},
journal={arXiv preprint arXiv:0707.1241},
year={2007},
doi={10.1109/TIT.2011.2110070},
archivePrefix={arXiv},
eprint={0707.1241},
primaryClass={cs.IT math.IT}
} | taghavi2007graph-based |
arxiv-717 | 0707.1266 | Building Decision Procedures in the Calculus of Inductive Constructions | <|reference_start|>Building Decision Procedures in the Calculus of Inductive Constructions: It is commonly agreed that the success of future proof assistants will rely on their ability to incorporate computations within deduction in order to mimic the mathematician when replacing the proof of a proposition P by the proof of an equivalent proposition P' obtained from P thanks to possibly complex calculations. In this paper, we investigate a new version of the calculus of inductive constructions which incorporates arbitrary decision procedures into deduction via the conversion rule of the calculus. The novelty of the problem in the context of the calculus of inductive constructions lies in the fact that the computation mechanism varies along proof-checking: goals are sent to the decision procedure together with the set of user hypotheses available from the current context. Our main result shows that this extension of the calculus of constructions does not compromise its main properties: confluence, subject reduction, strong normalization and consistency are all preserved.<|reference_end|> | arxiv | @article{blanqui2007building,
title={Building Decision Procedures in the Calculus of Inductive Constructions},
author={Fr'ed'eric Blanqui (INRIA Lorraine - LORIA), Jean-Pierre Jouannaud
(INRIA Futurs), Pierre-Yves Strub (INRIA Futurs)},
journal={Dans 16th EACSL Annual Conference on Computer Science and Logic -
CSL 2007 (2007)},
year={2007},
archivePrefix={arXiv},
eprint={0707.1266},
primaryClass={cs.LO}
} | blanqui2007building |
arxiv-718 | 0707.1288 | Espaces de repr\'esentation multidimensionnels d\'edi\'es \`a la visualisation | <|reference_start|>Espaces de repr\'esentation multidimensionnels d\'edi\'es \`a la visualisation: In decision-support systems, the visual component is important for On Line Analysis Processing (OLAP). In this paper, we propose a new approach that faces the visualization problem due to data sparsity. We use the results of a Multiple Correspondence Analysis (MCA) to reduce the negative effect of sparsity by organizing differently data cube cells. Our approach does not reduce sparsity, however it tries to build relevant representation spaces where facts are efficiently gathered. In order to evaluate our approach, we propose an homogeneity criterion based on geometric neighborhood of cells. The obtained experimental results have shown the efficiency of our method.<|reference_end|> | arxiv | @article{messaoud2007espaces,
title={Espaces de repr\'esentation multidimensionnels d\'edi\'es \`a la
visualisation},
author={Riadh Ben Messaoud and Kamel Aouiche and C'ecile Favre},
journal={arXiv preprint arXiv:0707.1288},
year={2007},
archivePrefix={arXiv},
eprint={0707.1288},
primaryClass={cs.DB}
} | messaoud2007espaces |
arxiv-719 | 0707.1295 | Efficient supervised learning in networks with binary synapses | <|reference_start|>Efficient supervised learning in networks with binary synapses: Recent experimental studies indicate that synaptic changes induced by neuronal activity are discrete jumps between a small number of stable states. Learning in systems with discrete synapses is known to be a computationally hard problem. Here, we study a neurobiologically plausible on-line learning algorithm that derives from Belief Propagation algorithms. We show that it performs remarkably well in a model neuron with binary synapses, and a finite number of `hidden' states per synapse, that has to learn a random classification task. Such system is able to learn a number of associations close to the theoretical limit, in time which is sublinear in system size. This is to our knowledge the first on-line algorithm that is able to achieve efficiently a finite number of patterns learned per binary synapse. Furthermore, we show that performance is optimal for a finite number of hidden states which becomes very small for sparse coding. The algorithm is similar to the standard `perceptron' learning algorithm, with an additional rule for synaptic transitions which occur only if a currently presented pattern is `barely correct'. In this case, the synaptic changes are meta-plastic only (change in hidden states and not in actual synaptic state), stabilizing the synapse in its current state. Finally, we show that a system with two visible states and K hidden states is much more robust to noise than a system with K visible states. We suggest this rule is sufficiently simple to be easily implemented by neurobiological systems or in hardware.<|reference_end|> | arxiv | @article{baldassi2007efficient,
title={Efficient supervised learning in networks with binary synapses},
author={Carlo Baldassi, Alfredo Braunstein, Nicolas Brunel, Riccardo Zecchina},
journal={PNAS 104, 11079-11084 (2007)},
year={2007},
doi={10.1073/pnas.0700324104},
archivePrefix={arXiv},
eprint={0707.1295},
primaryClass={q-bio.NC cond-mat.stat-mech cs.NE q-bio.QM}
} | baldassi2007efficient |
arxiv-720 | 0707.1304 | Un index de jointure pour les entrep\^ots de donn\'ees XML | <|reference_start|>Un index de jointure pour les entrep\^ots de donn\'ees XML: XML data warehouses form an interesting basis for decision-support applications that exploit heterogeneous data from multiple sources. However, XML-native database systems currently bear limited performances and it is necessary to research ways to optimize them. In this paper, we propose a new index that is specifically adapted to the multidimensional architecture of XML warehouses and eliminates join operations, while preserving the information contained in the original warehouse. A theoretical study and experimental results demonstrate the efficiency of our index, even when queries are complex.<|reference_end|> | arxiv | @article{mahboubi2007un,
title={Un index de jointure pour les entrep\^ots de donn\'ees XML},
author={Hadj Mahboubi and Kamel Aouiche and J'er^ome Darmont},
journal={arXiv preprint arXiv:0707.1304},
year={2007},
archivePrefix={arXiv},
eprint={0707.1304},
primaryClass={cs.DB}
} | mahboubi2007un |
arxiv-721 | 0707.1306 | S\'election simultan\'ee d'index et de vues mat\'erialis\'ees | <|reference_start|>S\'election simultan\'ee d'index et de vues mat\'erialis\'ees: Indices and materialized views are physical structures that accelerate data access in data warehouses. However, these data structures generate some maintenance overhead. They also share the same storage space. The existing studies about index and materialized view selection consider these structures separately. In this paper, we adopt the opposite stance and couple index and materialized view selection to take into account the interactions between them and achieve an efficient storage space sharing. We develop cost models that evaluate the respective benefit of indexing and view materialization. These cost models are then exploited by a greedy algorithm to select a relevant configuration of indices and materialized views. Experimental results show that our strategy performs better than the independent selection of indices and materialized views.<|reference_end|> | arxiv | @article{maiz2007s\'election,
title={S\'election simultan\'ee d'index et de vues mat\'erialis\'ees},
author={Nora Maiz and Kamel Aouiche and J'er^ome Darmont},
journal={arXiv preprint arXiv:0707.1306},
year={2007},
archivePrefix={arXiv},
eprint={0707.1306},
primaryClass={cs.DB}
} | maiz2007s\'election |
arxiv-722 | 0707.1364 | Report on Generic Case Complexity | <|reference_start|>Report on Generic Case Complexity: This article is a short introduction to generic case complexity, which is a recently developed way of measuring the difficulty of a computational problem while ignoring atypical behavior on a small set of inputs. Generic case complexity applies to both recursively solvable and recursively unsolvable problems.<|reference_end|> | arxiv | @article{gilman2007report,
title={Report on Generic Case Complexity},
author={Robert Gilman, Alexei G. Miasnikov, Alexey D. Myasnikov, Alexander
Ushakov},
journal={arXiv preprint arXiv:0707.1364},
year={2007},
archivePrefix={arXiv},
eprint={0707.1364},
primaryClass={cs.CC}
} | gilman2007report |
arxiv-723 | 0707.1372 | Computability Closure: Ten Years Later | <|reference_start|>Computability Closure: Ten Years Later: The notion of computability closure has been introduced for proving the termination of higher-order rewriting with first-order matching by Jean-Pierre Jouannaud and Mitsuhiro Okada in a 1997 draft which later served as a basis for the author's PhD. In this paper, we show how this notion can also be used for dealing with beta-normalized rewriting with matching modulo beta-eta (on patterns \`a la Miller), rewriting with matching modulo some equational theory, and higher-order data types (types with constructors having functional recursive arguments). Finally, we show how the computability closure can easily be turned into a reduction ordering which, in the higher-order case, contains Jean-Pierre Jouannaud and Albert Rubio's higher-order recursive path ordering and, in the first-order case, is equal to the usual first-order recursive path ordering.<|reference_end|> | arxiv | @article{blanqui2007computability,
title={Computability Closure: Ten Years Later},
author={Fr'ed'eric Blanqui (INRIA Lorraine - LORIA)},
journal={Dans Colloquium in honor of Jean-Pierre Jouannaud, 4600 (2007)},
year={2007},
archivePrefix={arXiv},
eprint={0707.1372},
primaryClass={cs.LO}
} | blanqui2007computability |
arxiv-724 | 0707.1432 | Sequential products in effect categories | <|reference_start|>Sequential products in effect categories: A new categorical framework is provided for dealing with multiple arguments in a programming language with effects, for example in a language with imperative features. Like related frameworks (Monads, Arrows, Freyd categories), we distinguish two kinds of functions. In addition, we also distinguish two kinds of equations. Then, we are able to define a kind of product, that generalizes the usual categorical product. This yields a powerful tool for deriving many results about languages with effects.<|reference_end|> | arxiv | @article{dumas2007sequential,
title={Sequential products in effect categories},
author={Jean-Guillaume Dumas (LJK), Dominique Duval (LJK), Jean-Claude Reynaud
(RC)},
journal={arXiv preprint arXiv:0707.1432},
year={2007},
archivePrefix={arXiv},
eprint={0707.1432},
primaryClass={math.CT cs.PL}
} | dumas2007sequential |
arxiv-725 | 0707.1452 | Clusters, Graphs, and Networks for Analysing Internet-Web-Supported Communication within a Virtual Community | <|reference_start|>Clusters, Graphs, and Networks for Analysing Internet-Web-Supported Communication within a Virtual Community: The proposal is to use clusters, graphs and networks as models in order to analyse the Web structure. Clusters, graphs and networks provide knowledge representation and organization. Clusters were generated by co-site analysis. The sample is a set of academic Web sites from the countries belonging to the European Union. These clusters are here revisited from the point of view of graph theory and social network analysis. This is a quantitative and structural analysis. In fact, the Internet is a computer network that connects people and organizations. Thus we may consider it to be a social network. The set of Web academic sites represents an empirical social network, and is viewed as a virtual community. The network structural properties are here analysed applying together cluster analysis, graph theory and social network analysis.<|reference_end|> | arxiv | @article{polanco2007clusters,,
title={Clusters, Graphs, and Networks for Analysing Internet-Web-Supported
Communication within a Virtual Community},
author={Xavier Polanco (INIST)},
journal={Advances in Knowledge Organization (2002) 364-371},
year={2007},
archivePrefix={arXiv},
eprint={0707.1452},
primaryClass={cs.AI cs.LG}
} | polanco2007clusters, |
arxiv-726 | 0707.1470 | Secrecy Capacity Region of Fading Broadcast Channels | <|reference_start|>Secrecy Capacity Region of Fading Broadcast Channels: The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The secrecy capacity region is first established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the Gaussian case of the Csiszar-Korner BCC model. The secrecy capacity results are then applied to give the ergodic secrecy capacity region for the fading BCC.<|reference_end|> | arxiv | @article{liang2007secrecy,
title={Secrecy Capacity Region of Fading Broadcast Channels},
author={Yingbin Liang, H. Vincent Poor and Shlomo Shamai (Shitz)},
journal={arXiv preprint arXiv:0707.1470},
year={2007},
doi={10.1109/ISIT.2007.4557401},
archivePrefix={arXiv},
eprint={0707.1470},
primaryClass={cs.IT math.IT}
} | liang2007secrecy |
arxiv-727 | 0707.1480 | IRVO: an Interaction Model for designing Collaborative Mixed Reality systems | <|reference_start|>IRVO: an Interaction Model for designing Collaborative Mixed Reality systems: This paper presents an interaction model adapted to mixed reality environments known as IRVO (Interacting with Real and Virtual Objects). IRVO aims at modeling the interaction between one or more users and the Mixed Reality system by representing explicitly the objects and tools involved and their relationship. IRVO covers the design phase of the life cycle and models the intended use of the system. In a first part, we present a brief review of related HCI models. The second part is devoted to the IRVO model, its notation and some examples. In the third part, we present how IRVO is used for designing applications and in particular we show how this model can be integrated in a Model-Based Approach (CoCSys) which is currently designed at our lab.<|reference_end|> | arxiv | @article{chalon2007irvo:,
title={IRVO: an Interaction Model for designing Collaborative Mixed Reality
systems},
author={Ren'e Chalon (ICTT), Bertrand T. David (ICTT)},
journal={Human Computer International 2005, U.S. CD (11/08/2005) 1-10},
year={2007},
archivePrefix={arXiv},
eprint={0707.1480},
primaryClass={cs.HC}
} | chalon2007irvo: |
arxiv-728 | 0707.1490 | Fast computing of velocity field for flows in industrial burners and pumps | <|reference_start|>Fast computing of velocity field for flows in industrial burners and pumps: In this work we present a technique of fast numerical computation for solutions of Navier-Stokes equations in the case of flows of industrial interest. At first the partial differential equations are translated into a set of nonlinear ordinary differential equations using the geometrical shape of the domain where the flow is developing, then these ODEs are numerically resolved using a set of computations distributed among the available processors. We present some results from simulations on a parallel hardware architecture using native multithreads software and simulating a shared-memory or a distributed-memory environment.<|reference_end|> | arxiv | @article{argentini2007fast,
title={Fast computing of velocity field for flows in industrial burners and
pumps},
author={Gianluca Argentini},
journal={arXiv preprint arXiv:0707.1490},
year={2007},
archivePrefix={arXiv},
eprint={0707.1490},
primaryClass={math.NA cs.MS}
} | argentini2007fast |
arxiv-729 | 0707.1501 | Random subgroups and analysis of the length-based and quotient attacks | <|reference_start|>Random subgroups and analysis of the length-based and quotient attacks: In this paper we discuss generic properties of "random subgroups" of a given group G. It turns out that in many groups G (even in most exotic of them) the random subgroups have a simple algebraic structure and they "sit" inside G in a very particular way. This gives a strong mathematical foundation for cryptanalysis of several group-based cryptosystems and indicates on how to chose "strong keys". To illustrate our technique we analyze the Anshel-Anshel-Goldfeld (AAG) cryptosystem and give a mathematical explanation of recent success of some heuristic length-based attacks on it. Furthermore, we design and analyze a new type of attacks, which we term the quotient attacks. Mathematical methods we develop here also indicate how one can try to choose "parameters" in AAG to foil the attacks.<|reference_end|> | arxiv | @article{myasnikov2007random,
title={Random subgroups and analysis of the length-based and quotient attacks},
author={Alexei G. Myasnikov, Alexander Ushakov},
journal={arXiv preprint arXiv:0707.1501},
year={2007},
archivePrefix={arXiv},
eprint={0707.1501},
primaryClass={math.GR cs.CR}
} | myasnikov2007random |
arxiv-730 | 0707.1515 | Properties of polynomial bases used in a line-surface intersection algorithm | <|reference_start|>Properties of polynomial bases used in a line-surface intersection algorithm: In [5], Srijuntongsiri and Vavasis propose the "Kantorovich-Test Subdivision algorithm", or KTS, which is an algorithm for finding all zeros of a polynomial system in a bounded region of the plane. This algorithm can be used to find the intersections between a line and a surface. The main features of KTS are that it can operate on polynomials represented in any basis that satisfies certain conditions and that its efficiency has an upper bound that depends only on the conditioning of the problem and the choice of the basis representing the polynomial system. This article explores in detail the dependence of the efficiency of the KTS algorithm on the choice of basis. Three bases are considered: the power, the Bernstein, and the Chebyshev bases. These three bases satisfy the basis properties required by KTS. Theoretically, Chebyshev case has the smallest upper bound on its running time. The computational results, however, do not show that Chebyshev case performs better than the other two.<|reference_end|> | arxiv | @article{srijuntongsiri2007properties,
title={Properties of polynomial bases used in a line-surface intersection
algorithm},
author={Gun Srijuntongsiri, Stephen A. Vavasis},
journal={arXiv preprint arXiv:0707.1515},
year={2007},
archivePrefix={arXiv},
eprint={0707.1515},
primaryClass={cs.NA cs.CG}
} | srijuntongsiri2007properties |
arxiv-731 | 0707.1527 | Programming Telepathy: Implementing Quantum Non-Locality Games | <|reference_start|>Programming Telepathy: Implementing Quantum Non-Locality Games: Quantum pseudo-telepathy is an intriguing phenomenon which results from the application of quantum information theory to communication complexity. To demonstrate this phenomenon researchers in the field of quantum communication complexity devised a number of quantum non-locality games. The setting of these games is as follows: the players are separated so that no communication between them is possible and are given a certain computational task. When the players have access to a quantum resource called entanglement, they can accomplish the task: something that is impossible in a classical setting. To an observer who is unfamiliar with the laws of quantum mechanics it seems that the players employ some sort of telepathy; that is, they somehow exchange information without sharing a communication channel. This paper provides a formal framework for specifying, implementing, and analysing quantum non-locality games.<|reference_end|> | arxiv | @article{tafliovich2007programming,
title={Programming Telepathy: Implementing Quantum Non-Locality Games},
author={Anya Tafliovich, Eric C.R. Hehner},
journal={arXiv preprint arXiv:0707.1527},
year={2007},
archivePrefix={arXiv},
eprint={0707.1527},
primaryClass={quant-ph cs.PL}
} | tafliovich2007programming |
arxiv-732 | 0707.1532 | Sorting and Selection in Posets | <|reference_start|>Sorting and Selection in Posets: Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs of objects are incomparable. This generalization is relevant in applications related to rankings in sports, college admissions, or conference submissions. It also has potential applications in biology, such as comparing the evolutionary fitness of different strains of bacteria, or understanding input-output relations among a set of metabolic reactions or the causal influences among a set of interacting genes or proteins. Our results improve and extend results from two decades ago of Faigle and Tur\'{a}n. A measure of complexity of a partially ordered set (poset) is its width. Our algorithms obtain information about a poset by queries that compare two elements. We present an algorithm that sorts, i.e. completely identifies, a width w poset of size n and has query complexity O(wn + nlog(n)), which is within a constant factor of the information-theoretic lower bound. We also show that a variant of Mergesort has query complexity O(wn(log(n/w))) and total complexity O((w^2)nlog(n/w)). Faigle and Tur\'{a}n have shown that the sorting problem has query complexity O(wn(log(n/w))) but did not address its total complexity. For the related problem of determining the minimal elements of a poset, we give efficient deterministic and randomized algorithms with O(wn) query and total complexity, along with matching lower bounds for the query complexity up to a factor of 2. We generalize these results to the k-selection problem of determining the elements of height at most k. We also derive upper bounds on the total complexity of some other problems of a similar flavor.<|reference_end|> | arxiv | @article{daskalakis2007sorting,
title={Sorting and Selection in Posets},
author={Constantinos Daskalakis (1), Richard M. Karp (1), Elchanan Mossel (1),
Samantha Riesenfeld (1), Elad Verbin (2) ((1) U.C. Berkeley, (2) Tel Aviv
University)},
journal={arXiv preprint arXiv:0707.1532},
year={2007},
archivePrefix={arXiv},
eprint={0707.1532},
primaryClass={cs.DS cs.DM}
} | daskalakis2007sorting |
arxiv-733 | 0707.1534 | An Architecture Framework for Complex Data Warehouses | <|reference_start|>An Architecture Framework for Complex Data Warehouses: Nowadays, many decision support applications need to exploit data that are not only numerical or symbolic, but also multimedia, multistructure, multisource, multimodal, and/or multiversion. We term such data complex data. Managing and analyzing complex data involves a lot of different issues regarding their structure, storage and processing, and metadata are a key element in all these processes. Such problems have been addressed by classical data warehousing (i.e., applied to "simple" data). However, data warehousing approaches need to be adapted for complex data. In this paper, we first propose a precise, though open, definition of complex data. Then we present a general architecture framework for warehousing complex data. This architecture heavily relies on metadata and domain-related knowledge, and rests on the XML language, which helps storing data, metadata and domain-specific knowledge altogether, and facilitates communication between the various warehousing processes.<|reference_end|> | arxiv | @article{darmont2007an,
title={An Architecture Framework for Complex Data Warehouses},
author={J'er^ome Darmont, Omar Boussaid, Jean-Christian Ralaivao and Kamel
Aouiche},
journal={arXiv preprint arXiv:0707.1534},
year={2007},
archivePrefix={arXiv},
eprint={0707.1534},
primaryClass={cs.DB}
} | darmont2007an |
arxiv-734 | 0707.1548 | Data Mining-based Materialized View and Index Selection in Data Warehouses | <|reference_start|>Data Mining-based Materialized View and Index Selection in Data Warehouses: Materialized views and indexes are physical structures for accelerating data access that are casually used in data warehouses. However, these data structures generate some maintenance overhead. They also share the same storage space. Most existing studies about materialized view and index selection consider these structures separately. In this paper, we adopt the opposite stance and couple materialized view and index selection to take view-index interactions into account and achieve efficient storage space sharing. Candidate materialized views and indexes are selected through a data mining process. We also exploit cost models that evaluate the respective benefit of indexing and view materialization, and help select a relevant configuration of indexes and materialized views among the candidates. Experimental results show that our strategy performs better than an independent selection of materialized views and indexes.<|reference_end|> | arxiv | @article{aouiche2007data,
title={Data Mining-based Materialized View and Index Selection in Data
Warehouses},
author={Kamel Aouiche and J'er^ome Darmont},
journal={arXiv preprint arXiv:0707.1548},
year={2007},
archivePrefix={arXiv},
eprint={0707.1548},
primaryClass={cs.DB}
} | aouiche2007data |
arxiv-735 | 0707.1558 | Autonomy with regard to an Attribute | <|reference_start|>Autonomy with regard to an Attribute: This paper presents a model of autonomy called autonomy with regard to an attribute applicable to cognitive and not cognitive artificial agents. Three criteria (global / partial, social / nonsocial, absolute / relative) are defined and used to describe the main characteristics of this type of autonomy. A software agent autonomous with regard to the mobility illustrates a possible implementation of this model.<|reference_end|> | arxiv | @article{sanchis2007autonomy,
title={Autonomy with regard to an Attribute},
author={Eric Sanchis (LGC)},
journal={arXiv preprint arXiv:0707.1558},
year={2007},
archivePrefix={arXiv},
eprint={0707.1558},
primaryClass={cs.MA}
} | sanchis2007autonomy |
arxiv-736 | 0707.1588 | A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels | <|reference_start|>A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels: In this correspondence, we propose a tight lower bound to the outage probability of discrete-input Nakagami-m block-fading channels. The approach permits an efficient method for numerical evaluation of the bound, providing an additional tool for system design. The optimal rate-diversity trade-off for the Nakagami-m block-fading channel is also derived and a tight upper bound is obtained for the optimal coding gain constant.<|reference_end|> | arxiv | @article{nguyen2007a,
title={A Tight Lower Bound to the Outage Probability of Discrete-Input
Block-Fading Channels},
author={Khoa D. Nguyen, Albert Guillen i Fabregas, Lars K. Rasmussen},
journal={arXiv preprint arXiv:0707.1588},
year={2007},
doi={10.1109/TIT.2007.907520},
archivePrefix={arXiv},
eprint={0707.1588},
primaryClass={cs.IT math.IT}
} | nguyen2007a |
arxiv-737 | 0707.1607 | Cactus Framework: Black Holes to Gamma Ray Bursts | <|reference_start|>Cactus Framework: Black Holes to Gamma Ray Bursts: Gamma Ray Bursts (GRBs) are intense narrowly-beamed flashes of gamma-rays of cosmological origin. They are among the most scientifically interesting astrophysical systems, and the riddle concerning their central engines and emission mechanisms is one of the most complex and challenging problems of astrophysics today. In this article we outline our petascale approach to the GRB problem and discuss the computational toolkits and numerical codes that are currently in use and that will be scaled up to run on emerging petaflop scale computing platforms in the near future. Petascale computing will require additional ingredients over conventional parallelism. We consider some of the challenges which will be caused by future petascale architectures, and discuss our plans for the future development of the Cactus framework and its applications to meet these challenges in order to profit from these new architectures.<|reference_end|> | arxiv | @article{schnetter2007cactus,
title={Cactus Framework: Black Holes to Gamma Ray Bursts},
author={Erik Schnetter, Christian D. Ott, Gabrielle Allen, Peter Diener, Tom
Goodale, Thomas Radke, Edward Seidel, John Shalf},
journal={arXiv preprint arXiv:0707.1607},
year={2007},
archivePrefix={arXiv},
eprint={0707.1607},
primaryClass={cs.DC}
} | schnetter2007cactus |
arxiv-738 | 0707.1618 | The Trade-offs with Space Time Cube Representation of Spatiotemporal Patterns | <|reference_start|>The Trade-offs with Space Time Cube Representation of Spatiotemporal Patterns: Space time cube representation is an information visualization technique where spatiotemporal data points are mapped into a cube. Fast and correct analysis of such information is important in for instance geospatial and social visualization applications. Information visualization researchers have previously argued that space time cube representation is beneficial in revealing complex spatiotemporal patterns in a dataset to users. The argument is based on the fact that both time and spatial information are displayed simultaneously to users, an effect difficult to achieve in other representations. However, to our knowledge the actual usefulness of space time cube representation in conveying complex spatiotemporal patterns to users has not been empirically validated. To fill this gap we report on a between-subjects experiment comparing novice users error rates and response times when answering a set of questions using either space time cube or a baseline 2D representation. For some simple questions the error rates were lower when using the baseline representation. For complex questions where the participants needed an overall understanding of the spatiotemporal structure of the dataset, the space time cube representation resulted in on average twice as fast response times with no difference in error rates compared to the baseline. These results provide an empirical foundation for the hypothesis that space time cube representation benefits users when analyzing complex spatiotemporal patterns.<|reference_end|> | arxiv | @article{kristensson2007the,
title={The Trade-offs with Space Time Cube Representation of Spatiotemporal
Patterns},
author={Per Ola Kristensson, Nils Dahlback, Daniel Anundi, Marius Bjornstad,
Hanna Gillberg, Jonas Haraldsson, Ingrid Martensson, Matttias Nordvall,
Josefin Stahl},
journal={arXiv preprint arXiv:0707.1618},
year={2007},
archivePrefix={arXiv},
eprint={0707.1618},
primaryClass={cs.HC cs.GR}
} | kristensson2007the |
arxiv-739 | 0707.1639 | Interface groups and financial transfer architectures | <|reference_start|>Interface groups and financial transfer architectures: Analytic execution architectures have been proposed by the same authors as a means to conceptualize the cooperation between heterogeneous collectives of components such as programs, threads, states and services. Interface groups have been proposed as a means to formalize interface information concerning analytic execution architectures. These concepts are adapted to organization architectures with a focus on financial transfers. Interface groups (and monoids) now provide a technique to combine interface elements into interfaces with the flexibility to distinguish between directions of flow dependent on entity naming. The main principle exploiting interface groups is that when composing a closed system of a collection of interacting components, the sum of their interfaces must vanish in the interface group modulo reflection. This certainly matters for financial transfer interfaces. As an example of this, we specify an interface group and within it some specific interfaces concerning the financial transfer architecture for a part of our local academic organization. Financial transfer interface groups arise as a special case of more general service architecture interfaces.<|reference_end|> | arxiv | @article{bergstra2007interface,
title={Interface groups and financial transfer architectures},
author={Jan A. Bergstra and Alban Ponse},
journal={arXiv preprint arXiv:0707.1639},
year={2007},
number={PRG0702},
archivePrefix={arXiv},
eprint={0707.1639},
primaryClass={cs.SE}
} | bergstra2007interface |
arxiv-740 | 0707.1644 | Fast and Simple Relational Processing of Uncertain Data | <|reference_start|>Fast and Simple Relational Processing of Uncertain Data: This paper introduces U-relations, a succinct and purely relational representation system for uncertain databases. U-relations support attribute-level uncertainty using vertical partitioning. If we consider positive relational algebra extended by an operation for computing possible answers, a query on the logical level can be translated into, and evaluated as, a single relational algebra query on the U-relation representation. The translation scheme essentially preserves the size of the query in terms of number of operations and, in particular, number of joins. Standard techniques employed in off-the-shelf relational database management systems are effective for optimizing and processing queries on U-relations. In our experiments we show that query evaluation on U-relations scales to large amounts of data with high degrees of uncertainty.<|reference_end|> | arxiv | @article{antova2007fast,
title={Fast and Simple Relational Processing of Uncertain Data},
author={Lyublena Antova, Thomas Jansen, Christoph Koch, Dan Olteanu},
journal={arXiv preprint arXiv:0707.1644},
year={2007},
archivePrefix={arXiv},
eprint={0707.1644},
primaryClass={cs.DB cs.PF}
} | antova2007fast |
arxiv-741 | 0707.1714 | Sampling Algorithms and Coresets for Lp Regression | <|reference_start|>Sampling Algorithms and Coresets for Lp Regression: The Lp regression problem takes as input a matrix $A \in \Real^{n \times d}$, a vector $b \in \Real^n$, and a number $p \in [1,\infty)$, and it returns as output a number ${\cal Z}$ and a vector $x_{opt} \in \Real^d$ such that ${\cal Z} = \min_{x \in \Real^d} ||Ax -b||_p = ||Ax_{opt}-b||_p$. In this paper, we construct coresets and obtain an efficient two-stage sampling-based approximation algorithm for the very overconstrained ($n \gg d$) version of this classical problem, for all $p \in [1, \infty)$. The first stage of our algorithm non-uniformly samples $\hat{r}_1 = O(36^p d^{\max\{p/2+1, p\}+1})$ rows of $A$ and the corresponding elements of $b$, and then it solves the Lp regression problem on the sample; we prove this is an 8-approximation. The second stage of our algorithm uses the output of the first stage to resample $\hat{r}_1/\epsilon^2$ constraints, and then it solves the Lp regression problem on the new sample; we prove this is a $(1+\epsilon)$-approximation. Our algorithm unifies, improves upon, and extends the existing algorithms for special cases of Lp regression, namely $p = 1,2$. In course of proving our result, we develop two concepts--well-conditioned bases and subspace-preserving sampling--that are of independent interest.<|reference_end|> | arxiv | @article{dasgupta2007sampling,
title={Sampling Algorithms and Coresets for Lp Regression},
author={Anirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, and Michael
W. Mahoney},
journal={arXiv preprint arXiv:0707.1714},
year={2007},
archivePrefix={arXiv},
eprint={0707.1714},
primaryClass={cs.DS}
} | dasgupta2007sampling |
arxiv-742 | 0707.1715 | Sources of Superlinearity in Davenport-Schinzel Sequences | <|reference_start|>Sources of Superlinearity in Davenport-Schinzel Sequences: A generalized Davenport-Schinzel sequence is one over a finite alphabet that contains no subsequences isomorphic to a fixed forbidden subsequence. One of the fundamental problems in this area is bounding (asymptotically) the maximum length of such sequences. Following Klazar, let Ex(\sigma,n) be the maximum length of a sequence over an alphabet of size n avoiding subsequences isomorphic to \sigma. It has been proved that for every \sigma, Ex(\sigma,n) is either linear or very close to linear; in particular it is O(n 2^{\alpha(n)^{O(1)}}), where \alpha is the inverse-Ackermann function and O(1) depends on \sigma. However, very little is known about the properties of \sigma that induce superlinearity of \Ex(\sigma,n). In this paper we exhibit an infinite family of independent superlinear forbidden subsequences. To be specific, we show that there are 17 prototypical superlinear forbidden subsequences, some of which can be made arbitrarily long through a simple padding operation. Perhaps the most novel part of our constructions is a new succinct code for representing superlinear forbidden subsequences.<|reference_end|> | arxiv | @article{pettie2007sources,
title={Sources of Superlinearity in Davenport-Schinzel Sequences},
author={Seth Pettie},
journal={arXiv preprint arXiv:0707.1715},
year={2007},
archivePrefix={arXiv},
eprint={0707.1715},
primaryClass={cs.DM}
} | pettie2007sources |
arxiv-743 | 0707.1716 | Numerical Calculation With Arbitrary Precision | <|reference_start|>Numerical Calculation With Arbitrary Precision: The vast use of computers on scientific numerical computation makes the awareness of the limited precision that these machines are able to provide us an essential matter. A limited and insufficient precision allied to the truncation and rounding errors may induce the user to incorrect interpretation of his/hers answer. In this work, we have developed a computational package to minimize this kind of error by offering arbitrary precision numbers and calculation. This is very important in Physics where we can work with numbers too small and too big simultaneously.<|reference_end|> | arxiv | @article{rodrigues2007numerical,
title={Numerical Calculation With Arbitrary Precision},
author={B.O.Rodrigues, L.A.C.P.da Mota and L.G.S.Duarte},
journal={arXiv preprint arXiv:0707.1716},
year={2007},
doi={10.1142/S0218301307009014},
archivePrefix={arXiv},
eprint={0707.1716},
primaryClass={cs.NA cs.MS}
} | rodrigues2007numerical |
arxiv-744 | 0707.1739 | On slow-fading non-separable correlation MIMO systems | <|reference_start|>On slow-fading non-separable correlation MIMO systems: In a frequency selective slow-fading channel in a MIMO system, the channel matrix is of the form of a block matrix. We propose a method to calculate the limit of the eigenvalue distribution of block matrices if the size of the blocks tends to infinity. We will also calculate the asymptotic eigenvalue distribution of $HH^*$, where the entries of $H$ are jointly Gaussian, with a correlation of the form $E[h_{pj}\bar h_{qk}]= \sum_{s=1}^t \Psi^{(s)}_{jk}\hat\Psi^{(s)}_{pq}$ (where $t$ is fixed and does not increase with the size of the matrix). We will use an operator-valued free probability approach to achieve this goal. Using this method, we derive a system of equations, which can be solved numerically to compute the desired eigenvalue distribution.<|reference_end|> | arxiv | @article{far2007on,
title={On slow-fading non-separable correlation MIMO systems},
author={Reza Rashidi Far, Tamer Oraby, Wlodzimierz Bryc and Roland Speicher},
journal={IEEE Trans. Information Theory, Vol. 54, No. 2, pp.544-553, Feb.
2008},
year={2007},
archivePrefix={arXiv},
eprint={0707.1739},
primaryClass={cs.IT math.IT}
} | far2007on |
arxiv-745 | 0707.1812 | A numerical study of heat island flows in an open domain: Stationary solutions | <|reference_start|>A numerical study of heat island flows in an open domain: Stationary solutions: We present two dimensional numerical simulations of a natural convection problem in an unbounded domain. A thermal stratification is applied in the vertical direction and the flow circulation is induced by a heat island located on the ground. For this problem, thermal perturbations are convected in the horizontal direction far from the heated element so that very elongated computational domains have to be used in order to compute accurate numerical solutions. To avoid this difficulty thermal sponge layers are added at the vertical boundaries. With this approach, stationary solutions at $Ra\le 10^5$ are investigated. Boussinesq equations are discretized with a second-order finite volume scheme on a staggered grid combined with a second-order projection method for the time integration.<|reference_end|> | arxiv | @article{dubois2007a,
title={A numerical study of heat island flows in an open domain: Stationary
solutions},
author={Thierry Dubois, Rachid Touzani},
journal={arXiv preprint arXiv:0707.1812},
year={2007},
archivePrefix={arXiv},
eprint={0707.1812},
primaryClass={math.NA cs.NA physics.class-ph}
} | dubois2007a |
arxiv-746 | 0707.1820 | Understanding the Properties of the BitTorrent Overlay | <|reference_start|>Understanding the Properties of the BitTorrent Overlay: In this paper, we conduct extensive simulations to understand the properties of the overlay generated by BitTorrent. We start by analyzing how the overlay properties impact the efficiency of BitTorrent. We focus on the average peer set size (i.e., average number of neighbors), the time for a peer to reach its maximum peer set size, and the diameter of the overlay. In particular, we show that the later a peer arrives in a torrent, the longer it takes to reach its maximum peer set size. Then, we evaluate the impact of the maximum peer set size, the maximum number of outgoing connections per peer, and the number of NATed peers on the overlay properties. We show that BitTorrent generates a robust overlay, but that this overlay is not a random graph. In particular, the connectivity of a peer to its neighbors depends on its arriving order in the torrent. We also show that a large number of NATed peers significantly compromise the robustness of the overlay to attacks. Finally, we evaluate the impact of peer exchange on the overlay properties, and we show that it generates a chain-like overlay with a large diameter, which will adversely impact the efficiency of large torrents.<|reference_end|> | arxiv | @article{hamra2007understanding,
title={Understanding the Properties of the BitTorrent Overlay},
author={Anwar Al Hamra (INRIA Sophia Antipolis / INRIA Rh^one-Alpes), Arnaud
Legout (INRIA Sophia Antipolis / INRIA Rh^one-Alpes), Chadi Barakat (INRIA
Sophia Antipolis / INRIA Rh^one-Alpes)},
journal={arXiv preprint arXiv:0707.1820},
year={2007},
archivePrefix={arXiv},
eprint={0707.1820},
primaryClass={cs.NI}
} | hamra2007understanding |
arxiv-747 | 0707.1824 | The Kinematics of Manipulators Built From Closed Planar Mechanisms | <|reference_start|>The Kinematics of Manipulators Built From Closed Planar Mechanisms: The paper discusses the kinematics of manipulators builts of planar closed kinematic chains. A special kinematic scheme is extracted from the array of these mechanisms that looks the most promising for the creation of different types of robotic manipulators. The structural features of this manipulator determine a number of its original properties that essentially simplify its control. These features allow the main control problems to be effectively overcome by application of the simple kinematic problems. The workspace and singular configurations of a basic planar manipulator are studied. By using a graphic simulation method, motions of the designed mechanism are examined. A prototype of this mechanism was implemented to verify the proposed approach.<|reference_end|> | arxiv | @article{slutski2007the,
title={The Kinematics of Manipulators Built From Closed Planar Mechanisms},
author={Leonid Slutski (CIM), Damien Chablat (IRCCyN), Jorge Angeles (CIM)},
journal={Proceedings of the IEEE/ASME International Conference on Advanced
Intelligent Mechatronics (19/08/1999) 531-536},
year={2007},
archivePrefix={arXiv},
eprint={0707.1824},
primaryClass={cs.RO}
} | slutski2007the |
arxiv-748 | 0707.1859 | On the Degrees of Freedom in Cognitive Radio Channels | <|reference_start|>On the Degrees of Freedom in Cognitive Radio Channels: After receiving useful peer comments, we would like to withdraw this paper.<|reference_end|> | arxiv | @article{devroye2007on,
title={On the Degrees of Freedom in Cognitive Radio Channels},
author={Natasha Devroye, Vahid Tarokh},
journal={arXiv preprint arXiv:0707.1859},
year={2007},
archivePrefix={arXiv},
eprint={0707.1859},
primaryClass={cs.IT math.IT}
} | devroye2007on |
arxiv-749 | 0707.1904 | Generalized Solution Concepts in Games with Possibly Unaware Players | <|reference_start|>Generalized Solution Concepts in Games with Possibly Unaware Players: Most work in game theory assumes that players are perfect reasoners and have common knowledge of all significant aspects of the game. In earlier work, we proposed a framework for representing and analyzing games with possibly unaware players, and suggested a generalization of Nash equilibrium appropriate for games with unaware players that we called generalized Nash equilibrium. Here, we use this framework to analyze other solution concepts that have been considered in the game-theory literature, with a focus on sequential equilibrium. We also provide some insight into the notion of generalized Nash equilibrium by proving that it is closely related to the notion of rationalizability when we restrict the analysis to games in normal form and no unawareness is involved.<|reference_end|> | arxiv | @article{rego2007generalized,
title={Generalized Solution Concepts in Games with Possibly Unaware Players},
author={Leandro C. Rego and Joseph Y. Halpern},
journal={arXiv preprint arXiv:0707.1904},
year={2007},
archivePrefix={arXiv},
eprint={0707.1904},
primaryClass={cs.GT}
} | rego2007generalized |
arxiv-750 | 0707.1912 | Throughput Scaling Laws for Wireless Networks with Fading Channels | <|reference_start|>Throughput Scaling Laws for Wireless Networks with Fading Channels: A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. It is assumed that each link can be active and transmit with a constant power P or remain silent. The objective is to maximize the throughput over the selection of active links. By deriving an upper bound and a lower bound, it is shown that in the case of Rayleigh fading (i) the maximum throughput scales like $\log n$ (ii) the maximum throughput is achievable in a distributed fashion. The upper bound is obtained using probabilistic methods, where the key point is to upper bound the throughput of any random set of active links by a chi-squared random variable. To obtain the lower bound, a decentralized link activation strategy is proposed and analyzed.<|reference_end|> | arxiv | @article{ebrahimi2007throughput,
title={Throughput Scaling Laws for Wireless Networks with Fading Channels},
author={Masoud Ebrahimi, Mohammad A. Maddah-Ali, and Amir K. Khandani},
journal={arXiv preprint arXiv:0707.1912},
year={2007},
doi={10.1109/TIT.2007.907518},
number={University of Waterloo Technical Report UW-ECE #2007-12},
archivePrefix={arXiv},
eprint={0707.1912},
primaryClass={cs.IT math.IT}
} | ebrahimi2007throughput |
arxiv-751 | 0707.1913 | Removing Manually-Generated Boilerplate from Electronic Texts: Experiments with Project Gutenberg e-Books | <|reference_start|>Removing Manually-Generated Boilerplate from Electronic Texts: Experiments with Project Gutenberg e-Books: Collaborative work on unstructured or semi-structured documents, such as in literature corpora or source code, often involves agreed upon templates containing metadata. These templates are not consistent across users and over time. Rule-based parsing of these templates is expensive to maintain and tends to fail as new documents are added. Statistical techniques based on frequent occurrences have the potential to identify automatically a large fraction of the templates, thus reducing the burden on the programmers. We investigate the case of the Project Gutenberg corpus, where most documents are in ASCII format with preambles and epilogues that are often copied and pasted or manually typed. We show that a statistical approach can solve most cases though some documents require knowledge of English. We also survey various technical solutions that make our approach applicable to large data sets.<|reference_end|> | arxiv | @article{kaser2007removing,
title={Removing Manually-Generated Boilerplate from Electronic Texts:
Experiments with Project Gutenberg e-Books},
author={Owen Kaser, Daniel Lemire},
journal={arXiv preprint arXiv:0707.1913},
year={2007},
number={Department of CSAS, UNBSJ Technical Report TR-07-001},
archivePrefix={arXiv},
eprint={0707.1913},
primaryClass={cs.DL cs.CL}
} | kaser2007removing |
arxiv-752 | 0707.1925 | A note on minimal matching covered graphs | <|reference_start|>A note on minimal matching covered graphs: A graph is called matching covered if for its every edge there is a maximum matching containing it. It is shown that minimal matching covered graphs contain a perfect matching.<|reference_end|> | arxiv | @article{mkrtchyan2007a,
title={A note on minimal matching covered graphs},
author={V. V. Mkrtchyan},
journal={Discrete Mathematics 306, (2006), pp. 452-455},
year={2007},
doi={10.1016/j.disc.2005.12.006},
archivePrefix={arXiv},
eprint={0707.1925},
primaryClass={cs.DM}
} | mkrtchyan2007a |
arxiv-753 | 0707.1926 | On trees with a maximum proper partial 0-1 coloring containing a maximum matching | <|reference_start|>On trees with a maximum proper partial 0-1 coloring containing a maximum matching: I prove that in a tree in which the distance between any two endpoints is even, there is a maximum proper partial 0-1 coloring such that the edges colored by 0 form a maximum matching.<|reference_end|> | arxiv | @article{mkrtchyan2007on,
title={On trees with a maximum proper partial 0-1 coloring containing a maximum
matching},
author={V. V. Mkrtchyan},
journal={Discrete Mathematics 306, (2006), pp. 456-459},
year={2007},
doi={10.1016/j.disc.2005.12.019},
archivePrefix={arXiv},
eprint={0707.1926},
primaryClass={cs.DM}
} | mkrtchyan2007on |
arxiv-754 | 0707.1954 | Bandlimited Field Reconstruction for Wireless Sensor Networks | <|reference_start|>Bandlimited Field Reconstruction for Wireless Sensor Networks: Wireless sensor networks are often used for environmental monitoring applications. In this context sampling and reconstruction of a physical field is one of the most important problems to solve. We focus on a bandlimited field and find under which conditions on the network topology the reconstruction of the field is successful, with a given probability. We review irregular sampling theory, and analyze the problem using random matrix theory. We show that even a very irregular spatial distribution of sensors may lead to a successful signal reconstruction, provided that the number of collected samples is large enough with respect to the field bandwidth. Furthermore, we give the basis to analytically determine the probability of successful field reconstruction.<|reference_end|> | arxiv | @article{nordio2007bandlimited,
title={Bandlimited Field Reconstruction for Wireless Sensor Networks},
author={A. Nordio, C.-F. Chiasserini, E. Viterbo},
journal={arXiv preprint arXiv:0707.1954},
year={2007},
archivePrefix={arXiv},
eprint={0707.1954},
primaryClass={cs.OH}
} | nordio2007bandlimited |
arxiv-755 | 0707.1957 | Moveability and Collision Analysis for Fully-Parallel Manipulators | <|reference_start|>Moveability and Collision Analysis for Fully-Parallel Manipulators: The aim of this paper is to characterize the moveability of fully-parallel manipulators in the presence of obstacles. Fully parallel manipulators are used in applications where accuracy, stiffness or high speeds and accelerations are required \cite{Merlet:97}. However, one of its main drawbacks is a relatively small workspace compared to the one of serial manipulators. This is due mainly to the existence of potential internal collisions, and the existence of singularities. In this paper, the notion of free aspect is defined which permits to exhibit domains of the workspace and the joint space free of singularity and collision. The main application of this study is the moveability analysis in the workspace of the manipulator as well as path-planning, control and design.<|reference_end|> | arxiv | @article{chablat2007moveability,
title={Moveability and Collision Analysis for Fully-Parallel Manipulators},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN)},
journal={12th CISM-IFTOMM Symposium (07/1998) 1-8},
year={2007},
archivePrefix={arXiv},
eprint={0707.1957},
primaryClass={cs.RO}
} | chablat2007moveability |
arxiv-756 | 0707.1981 | A Normalizing Intuitionistic Set Theory with Inaccessible Sets | <|reference_start|>A Normalizing Intuitionistic Set Theory with Inaccessible Sets: We propose a set theory strong enough to interpret powerful type theories underlying proof assistants such as LEGO and also possibly Coq, which at the same time enables program extraction from its constructive proofs. For this purpose, we axiomatize an impredicative constructive version of Zermelo-Fraenkel set theory IZF with Replacement and $\omega$-many inaccessibles, which we call \izfio. Our axiomatization utilizes set terms, an inductive definition of inaccessible sets and the mutually recursive nature of equality and membership relations. It allows us to define a weakly-normalizing typed lambda calculus corresponding to proofs in \izfio according to the Curry-Howard isomorphism principle. We use realizability to prove the normalization theorem, which provides a basis for program extraction capability.<|reference_end|> | arxiv | @article{moczydlowski2007a,
title={A Normalizing Intuitionistic Set Theory with Inaccessible Sets},
author={Wojciech Moczydlowski},
journal={Logical Methods in Computer Science, Volume 3, Issue 3 (August 16,
2007) lmcs:837},
year={2007},
doi={10.2168/LMCS-3(3:6)2007},
archivePrefix={arXiv},
eprint={0707.1981},
primaryClass={cs.LO}
} | moczydlowski2007a |
arxiv-757 | 0707.2006 | Working Modes and Aspects in Fully-Parallel Manipulator | <|reference_start|>Working Modes and Aspects in Fully-Parallel Manipulator: The aim of this paper is to characterize the notion of aspect in the workspace and in the joint space for parallel manipulators. In opposite to the serial manipulators, the parallel manipulators can admit not only multiple inverse kinematic solutions, but also multiple direct kinematic solutions. The notion of aspect introduced for serial manipulators in [Borrel 86], and redefined for parallel manipulators with only one inverse kinematic solution in [Wenger 1997], is redefined for general fully parallel manipulators. Two Jacobian matrices appear in the kinematic relations between the joint-rate and the Cartesian-velocity vectors, which are called the "inverse kinematics" and the "direct kinematics" matrices. The study of these matrices allow to respectively define the parallel and the serial singularities. The notion of working modes is introduced to separate inverse kinematic solutions. Thus, we can find out domains of the workspace and the joint space exempt of singularity. Application of this study is the moveability analysis in the workspace of the manipulator as well as path-planing and control. This study is illustrated in this paper with a RR-RRR planar parallel manipulator.<|reference_end|> | arxiv | @article{chablat2007working,
title={Working Modes and Aspects in Fully-Parallel Manipulator},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN)},
journal={Proceeding IEEE International Conference on Robotics and
Automation (05/1998) 1964-1969},
year={2007},
archivePrefix={arXiv},
eprint={0707.2006},
primaryClass={cs.RO}
} | chablat2007working |
arxiv-758 | 0707.2014 | On the error exponent of variable-length block-coding schemes over finite-state Markov channels with feedback | <|reference_start|>On the error exponent of variable-length block-coding schemes over finite-state Markov channels with feedback: The error exponent of Markov channels with feedback is studied in the variable-length block-coding setting. Burnashev's classic result is extended and a single letter characterization for the reliability function of finite-state Markov channels is presented, under the assumption that the channel state is causally observed both at the transmitter and at the receiver side. Tools from stochastic control theory are used in order to treat channels with intersymbol interference. In particular the convex analytical approach to Markov decision processes is adopted to handle problems with stopping time horizons arising from variable-length coding schemes.<|reference_end|> | arxiv | @article{como2007on,
title={On the error exponent of variable-length block-coding schemes over
finite-state Markov channels with feedback},
author={Giacomo Como, Serdar Yuksel, Sekhar Tatikonda},
journal={arXiv preprint arXiv:0707.2014},
year={2007},
archivePrefix={arXiv},
eprint={0707.2014},
primaryClass={cs.IT math.IT}
} | como2007on |
arxiv-759 | 0707.2017 | The Isoconditioning Loci of A Class of Closed-Chain Manipulators | <|reference_start|>The Isoconditioning Loci of A Class of Closed-Chain Manipulators: The subject of this paper is a special class of closed-chain manipulators. First, we analyze a family of two-degree-of-freedom (dof) five-bar planar linkages. Two Jacobian matrices appear in the kinematic relations between the joint-rate and the Cartesian-velocity vectors, which are called the ``inverse kinematics" and the "direct kinematics" matrices. It is shown that the loci of points of the workspace where the condition number of the direct-kinematics matrix remains constant, i.e., the isoconditioning loci, are the coupler points of the four-bar linkage obtained upon locking the middle joint of the linkage. Furthermore, if the line of centers of the two actuated revolutes is used as the axis of a third actuated revolute, then a three-dof hybrid manipulator is obtained. The isoconditioning loci of this manipulator are surfaces of revolution generated by the isoconditioning curves of the two-dof manipulator, whose axis of symmetry is that of the third actuated revolute.<|reference_end|> | arxiv | @article{chablat2007the,
title={The Isoconditioning Loci of A Class of Closed-Chain Manipulators},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN), Jorge Angeles (CIM)},
journal={Proceeding IEEE International Conference on Robotics and
Automation (05/1998) 1970-1976},
year={2007},
archivePrefix={arXiv},
eprint={0707.2017},
primaryClass={cs.RO}
} | chablat2007the |
arxiv-760 | 0707.2027 | Workspace and Assembly modes in Fully-Parallel Manipulators : A Descriptive Study | <|reference_start|>Workspace and Assembly modes in Fully-Parallel Manipulators : A Descriptive Study: The goal of this paper is to explain, using a typical example, the distribution of the different assembly modes in the workspace and their effective role in the execution of trajectories. The singular and non-singular changes of assembly mode are described and compared to each other. The non-singular change of assembly mode is more deeply analysed and discussed in the context of trajectory planning. In particular, it is shown that, according to the location of the initial and final configurations with respect to the uniqueness domains in the workspace, there are three different cases to consider before planning a linking trajectory.<|reference_end|> | arxiv | @article{wenger2007workspace,
title={Workspace and Assembly modes in Fully-Parallel Manipulators : A
Descriptive Study},
author={Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={Advances in Robot Kinematics and Computational Geometry (1998)
117-126},
year={2007},
archivePrefix={arXiv},
eprint={0707.2027},
primaryClass={cs.RO}
} | wenger2007workspace |
arxiv-761 | 0707.2034 | Conception Isotropique D'Une Morphologie Parall\`Ele : Application \`a L'Usinage | <|reference_start|>Conception Isotropique D'Une Morphologie Parall\`Ele : Application \`a L'Usinage: The aim of this paper is the isotropic design of a hybrid morphology dedicated to 3-axis machining applications. It is necessary to ensure the feasibility of continuous, singularity-free trajectories, as well as a good manipulability in position and velocity. We want to propose an alternative design to conventional serial machine-tools. We compare a serial PPP machine-tool (three prismatic orthogonal axes) with a hybrid architecture which we optimize only the first two axes. The critrerion used for the optimization is the conditioning of the Jacobian matrices. The optimum, namely isotropy, can be obtained which provides our architecture with excellent manipulability properties.<|reference_end|> | arxiv | @article{chablat2007conception,
title={Conception Isotropique D'Une Morphologie Parall\`Ele : Application \`a
L'Usinage},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN), Jorge Angeles (CIM)},
journal={3rd International Conference On Integrated Design and
Manufacturing in Mechanical Engineering (05/2000) 1-10},
year={2007},
archivePrefix={arXiv},
eprint={0707.2034},
primaryClass={cs.RO}
} | chablat2007conception |
arxiv-762 | 0707.2042 | A distributed Approach for Access and Visibility Task under Ergonomic Constraints with a Manikin in a Virtual Reality Environment | <|reference_start|>A distributed Approach for Access and Visibility Task under Ergonomic Constraints with a Manikin in a Virtual Reality Environment: This paper presents a new method, based on a multi-agent system and on digital mock-up technology, to assess an efficient path planner for a manikin for access and visibility task under ergonomic constraints. In order to solve this problem, the human operator is integrated in the process optimization to contribute to a global perception of the environment. This operator cooperates, in real-time, with several automatic local elementary agents. The result of this work validates solutions brought by digital mock-up and that can be applied to simulate maintenance task.<|reference_end|> | arxiv | @article{bidault2007a,
title={A distributed Approach for Access and Visibility Task under Ergonomic
Constraints with a Manikin in a Virtual Reality Environment},
author={Florence Bidault (IRCCyN), Damien Chablat (IRCCyN), Patrick Chedmail
(IRCCyN), Laurent Pino (IRCCyN)},
journal={Proceeding of the 10th IEEE International Workshop on Robot and
Human Communication (09/2001) 1-6},
year={2007},
archivePrefix={arXiv},
eprint={0707.2042},
primaryClass={cs.RO}
} | bidault2007a |
arxiv-763 | 0707.2090 | A Training based Distributed Non-Coherent Space-Time Coding Strategy | <|reference_start|>A Training based Distributed Non-Coherent Space-Time Coding Strategy: Unitary space-time modulation is known to be an efficient means to communicate over non-coherent Multiple Input Multiple Output (MIMO) channels. In this letter, differential unitary space-time coding and non-coherent space-time coding for the training based approach of Kim and Tarokh are addressed. For this approach, necessary and sufficient conditions for multi-group decodability are derived in a simple way assuming a Generalized Likelihood Ratio Test receiver and a unitary codebook. Extending Kim and Tarokh's approach for colocated MIMO systems, a novel training based approach to distributed non-coherent space-time coding for wireless relay networks is proposed. An explicit construction of two-group decodable distributed non-coherent space-time codes achieving full cooperative diversity for all even number of relays is provided.<|reference_end|> | arxiv | @article{rajan2007a,
title={A Training based Distributed Non-Coherent Space-Time Coding Strategy},
author={G. Susinder Rajan and B. Sundar Rajan},
journal={arXiv preprint arXiv:0707.2090},
year={2007},
archivePrefix={arXiv},
eprint={0707.2090},
primaryClass={cs.IT math.IT}
} | rajan2007a |
arxiv-764 | 0707.2126 | On complexity of special maximum matchings constructing | <|reference_start|>On complexity of special maximum matchings constructing: For bipartite graphs the NP-completeness is proved for the problem of existence of maximum matching which removal leads to a graph with given lower(upper)bound for the cardinality of its maximum matching.<|reference_end|> | arxiv | @article{kamalian2007on,
title={On complexity of special maximum matchings constructing},
author={R.R. Kamalian, V. V. Mkrtchyan},
journal={Discrete Mathematics, 2008, Vol 308/10 pp 1792-1800},
year={2007},
doi={10.1016/j.disc.2007.04.029},
archivePrefix={arXiv},
eprint={0707.2126},
primaryClass={cs.DM}
} | kamalian2007on |
arxiv-765 | 0707.2160 | Splay Trees, Davenport-Schinzel Sequences, and the Deque Conjecture | <|reference_start|>Splay Trees, Davenport-Schinzel Sequences, and the Deque Conjecture: We introduce a new technique to bound the asymptotic performance of splay trees. The basic idea is to transcribe, in an indirect fashion, the rotations performed by the splay tree as a Davenport-Schinzel sequence S, none of whose subsequences are isomorphic to fixed forbidden subsequence. We direct this technique towards Tarjan's deque conjecture and prove that n deque operations require O(n alpha^*(n)) time, where alpha^*(n) is the minimum number of applications of the inverse-Ackermann function mapping n to a constant. We are optimistic that this approach could be directed towards other open conjectures on splay trees such as the traversal and split conjectures.<|reference_end|> | arxiv | @article{pettie2007splay,
title={Splay Trees, Davenport-Schinzel Sequences, and the Deque Conjecture},
author={Seth Pettie},
journal={arXiv preprint arXiv:0707.2160},
year={2007},
archivePrefix={arXiv},
eprint={0707.2160},
primaryClass={cs.DS}
} | pettie2007splay |
arxiv-766 | 0707.2176 | Benefit of Delay on the Diversity-Multiplexing Tradeoffs of MIMO Channels with Partial CSI | <|reference_start|>Benefit of Delay on the Diversity-Multiplexing Tradeoffs of MIMO Channels with Partial CSI: This paper re-examines the well-known fundamental tradeoffs between rate and reliability for the multi-antenna, block Rayleigh fading channel in the high signal to noise ratio (SNR) regime when (i) the transmitter has access to (noiseless) one bit per coherence-interval of causal channel state information (CSI) and (ii) soft decoding delays together with worst-case delay guarantees are acceptable. A key finding of this work is that substantial improvements in reliability can be realized with a very short expected delay and a slightly longer (but bounded) worst-case decoding delay guarantee in communication systems where the transmitter has access to even one bit per coherence interval of causal CSI. While similar in spirit to the recent work on communication systems based on automatic repeat requests (ARQ) where decoding failure is known at the transmitter and leads to re-transmission, here transmit side-information is purely based on CSI. The findings reported here also lend further support to an emerging understanding that decoding delay (related to throughput) and codeword blocklength (related to coding complexity and delays) are distinctly different design parameters which can be tuned to control reliability.<|reference_end|> | arxiv | @article{sharif2007benefit,
title={Benefit of Delay on the Diversity-Multiplexing Tradeoffs of MIMO
Channels with Partial CSI},
author={Masoud Sharif and Prakash Ishwar},
journal={arXiv preprint arXiv:0707.2176},
year={2007},
archivePrefix={arXiv},
eprint={0707.2176},
primaryClass={cs.IT math.IT}
} | sharif2007benefit |
arxiv-767 | 0707.2182 | Design of Multistage Decimation Filters Using Cyclotomic Polynomials: Optimization and Design Issues | <|reference_start|>Design of Multistage Decimation Filters Using Cyclotomic Polynomials: Optimization and Design Issues: This paper focuses on the design of multiplier-less decimation filters suitable for oversampled digital signals. The aim is twofold. On one hand, it proposes an optimization framework for the design of constituent decimation filters in a general multistage decimation architecture. The basic building blocks embedded in the proposed filters belong, for a simple reason, to the class of cyclotomic polynomials (CPs): the first 104 CPs have a z-transfer function whose coefficients are simply {-1,0,+1}. On the other hand, the paper provides a bunch of useful techniques, most of which stemming from some key properties of CPs, for designing the proposed filters in a variety of architectures. Both recursive and non-recursive architectures are discussed by focusing on a specific decimation filter obtained as a result of the optimization algorithm. Design guidelines are provided with the aim to simplify the design of the constituent decimation filters in the multistage chain.<|reference_end|> | arxiv | @article{laddomada2007design,
title={Design of Multistage Decimation Filters Using Cyclotomic Polynomials:
Optimization and Design Issues},
author={Massimiliano Laddomada},
journal={arXiv preprint arXiv:0707.2182},
year={2007},
archivePrefix={arXiv},
eprint={0707.2182},
primaryClass={cs.OH}
} | laddomada2007design |
arxiv-768 | 0707.2185 | Mod\'elisation Dynamique d'un Robot Parall\`ele \`a 3-DDL : l'Orthoglide | <|reference_start|>Mod\'elisation Dynamique d'un Robot Parall\`ele \`a 3-DDL : l'Orthoglide: In this article, we propose a method for calculation of the inverse and direct dynamic models of the Orthoglide, a parallel robot with threedegrees of freedom in translation. These models are calculated starting from the elements of the dynamic model of the kinematic chain structure and equations of Newton-Euler applied to the platform. These models are obtained in explicit form having an interesting physical interpretation.<|reference_end|> | arxiv | @article{guegan2007mod\'elisation,
title={Mod\'elisation Dynamique d'un Robot Parall\`ele \`a 3-DDL : l'Orthoglide},
author={Sylvain Guegan (IRCCyN), Wisama Khalil (IRCCyN), Damien Chablat
(IRCCyN), Philippe Wenger (IRCCyN)},
journal={Conf\'erence Internationale Francophone d'Automatique (07/2002)
1-6},
year={2007},
archivePrefix={arXiv},
eprint={0707.2185},
primaryClass={cs.RO}
} | guegan2007mod\'elisation |
arxiv-769 | 0707.2191 | Word statistics in Blogs and RSS feeds: Towards empirical universal evidence | <|reference_start|>Word statistics in Blogs and RSS feeds: Towards empirical universal evidence: We focus on the statistics of word occurrences and of the waiting times between such occurrences in Blogs. Due to the heterogeneity of words' frequencies, the empirical analysis is performed by studying classes of "frequently-equivalent" words, i.e. by grouping words depending on their frequencies. Two limiting cases are considered: the dilute limit, i.e. for those words that are used less than once a day, and the dense limit for frequent words. In both cases, extreme events occur more frequently than expected from the Poisson hypothesis. These deviations from Poisson statistics reveal non-trivial time correlations between events that are associated with bursts of activities. The distribution of waiting times is shown to behave like a stretched exponential and to have the same shape for different sets of words sharing a common frequency, thereby revealing universal features.<|reference_end|> | arxiv | @article{lambiotte2007word,
title={Word statistics in Blogs and RSS feeds: Towards empirical universal
evidence},
author={R. Lambiotte, M. Ausloos and M. Thelwall},
journal={J. Informetrics 1 (2007) 277-286},
year={2007},
archivePrefix={arXiv},
eprint={0707.2191},
primaryClass={cs.IT math.IT}
} | lambiotte2007word |
arxiv-770 | 0707.2227 | Degeneracy study of the forward kinematics of planar 3-RPR parallel manipulators | <|reference_start|>Degeneracy study of the forward kinematics of planar 3-RPR parallel manipulators: This paper investigates two situations in which the forward kinematics of planar 3-RPR parallel manipulators degenerates. These situations have not been addressed before. The first degeneracy arises when the three input joint variables r1, r2 and r3 satisfy a certain relationship. This degeneracy yields a double root of the characteristic polynomial in t, which could be erroneously interpreted as two coalesce assembly modes. But, unlike what arises in non-degenerate cases, this double root yields two sets of solutions for the position coordinates (x, y) of the platform. In the second situation, we show that the forward kinematics degenerates over the whole joint space if the base and platform triangles are congruent and the platform triangle is rotated by 180 deg about one of its sides. For these "degenerate" manipulators, which are defined here for the first time, the forward kinematics is reduced to the solution of a 3rd-degree polynomial and a quadratics in sequence. Such manipulators constitute, in turn, a new family of analytic planar manipulators that would be more suitable for industrial applications.<|reference_end|> | arxiv | @article{wenger2007degeneracy,
title={Degeneracy study of the forward kinematics of planar 3-RPR parallel
manipulators},
author={Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN), Mazen Zein (IRCCyN)},
journal={Journal of Mechanical Design 129, 12 (12/2007) 1-6},
year={2007},
archivePrefix={arXiv},
eprint={0707.2227},
primaryClass={cs.RO}
} | wenger2007degeneracy |
arxiv-771 | 0707.2228 | Kinematic Analysis of a Family of 3R Manipulators | <|reference_start|>Kinematic Analysis of a Family of 3R Manipulators: The workspace topologies of a family of 3-revolute (3R) positioning manipulators are enumerated. The workspace is characterized in a half-cross section by the singular curves. The workspace topology is defined by the number of cusps that appear on these singular curves. The design parameters space is shown to be divided into five domains where all manipulators have the same number of cusps. Each separating surface is given as an explicit expression in the DH-parameters. As an application of this work, we provide a necessary and sufficient condition for a 3R orthogonal manipulator to be cuspidal, i.e. to change posture without meeting a singularity. This condition is set as an explicit expression in the DH parameters.<|reference_end|> | arxiv | @article{baili2007kinematic,
title={Kinematic Analysis of a Family of 3R Manipulators},
author={Maher Baili (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat
(IRCCyN)},
journal={Problems of Mechanics 15, 2 (07/2004) 27-32},
year={2007},
archivePrefix={arXiv},
eprint={0707.2228},
primaryClass={cs.RO}
} | baili2007kinematic |
arxiv-772 | 0707.2229 | The Computation of All 4R Serial Spherical Wrists With an Isotropic Architecture | <|reference_start|>The Computation of All 4R Serial Spherical Wrists With an Isotropic Architecture: A spherical wrist of the serial type with n revolute (R) joints is said to be isotropic if it can attain a posture whereby the singular values of its Jacobian matrix are all equal to sqrt(n/3). What isotropy brings about is robustness to manufacturing, assembly, and measurement errors, thereby guaranteeing a maximum orientation accuracy. In this paper we investigate the existence of redundant isotropic architectures, which should add to the dexterity of the wrist under design by virtue of its extra degree of freedom. The problem formulation, for, leads to a system of eight quadratic equations with eight unknowns. The Bezout number of this system is thus 2^8=256, its BKK bound being 192. However, the actual number of solutions is shown to be 32. We list all solutions of the foregoing algebraic problem. All these solutions are real, but distinct solutions do not necessarily lead to distinct manipulators. Upon discarding those algebraic solutions that yield no new wrists, we end up with exactly eight distinct architectures, the eight corresponding manipulators being displayed at their isotropic postures.<|reference_end|> | arxiv | @article{chablat2007the,
title={The Computation of All 4R Serial Spherical Wrists With an Isotropic
Architecture},
author={Damien Chablat (IRCCyN), Jorge Angeles (CIM)},
journal={Journal of Mechanical Design 125, 2 (06/2003) 275-280},
year={2007},
archivePrefix={arXiv},
eprint={0707.2229},
primaryClass={cs.RO}
} | chablat2007the |
arxiv-773 | 0707.2238 | A design oriented study for 3R Orthogonal Manipulators With Geometric Simplifications | <|reference_start|>A design oriented study for 3R Orthogonal Manipulators With Geometric Simplifications: This paper proposes a method to calculate the largest Regular Dextrous Workspace (RDW) of some types of three-revolute orthogonal manipulators that have at least one of their DH parameters equal to zero. Then a new performance index based on the RDW is introduced, the isocontours of this index are plotted in the parameter space of the interesting types of manipulators and finally an inspection of the domains of the parameter spaces is conducted in order to identify the better manipulator architectures. The RDW is a part of the workspace whose shape is regular (cube, cylinder) and the performances (conditioning index) are bounded inside. The groups of 3R orthogonal manipulators studied have interesting kinematic properties such as, a well-connected workspace that is fully reachable with four inverse kinematic solutions and that does not contain any void. This study is of high interest for the design of alternative manipulator geometries.<|reference_end|> | arxiv | @article{zein2007a,
title={A design oriented study for 3R Orthogonal Manipulators With Geometric
Simplifications},
author={Mazen Zein (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={Congr\`es international Conception et Mod\'elisation des
Syst\`emes M\'ecaniques (03/2007) 1-8},
year={2007},
archivePrefix={arXiv},
eprint={0707.2238},
primaryClass={cs.RO}
} | zein2007a |
arxiv-774 | 0707.2265 | Separable convex optimization problems with linear ascending constraints | <|reference_start|>Separable convex optimization problems with linear ascending constraints: Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. Under an ordering condition on the slopes of the functions at the origin, an algorithm that determines the optimum point in a finite number of steps is described. The optimum value is shown to be monotone with respect to a partial order on the constraint parameters. Moreover, the optimum value is convex with respect to these parameters. Examples motivated by optimizations for communication systems are used to illustrate the algorithm.<|reference_end|> | arxiv | @article{padakandla2007separable,
title={Separable convex optimization problems with linear ascending constraints},
author={Arun Padakandla and Rajesh Sundaresan},
journal={SIAM J. on Optim., vol. 20, no. 3, pp. 1185-1204, online version
19 August 2009},
year={2007},
doi={10.1137/07069729X},
archivePrefix={arXiv},
eprint={0707.2265},
primaryClass={cs.IT math.IT math.OC}
} | padakandla2007separable |
arxiv-775 | 0707.2270 | Design of a Spherical Wrist with Parallel Architecture: Application to Vertebrae of an Eel Robot | <|reference_start|>Design of a Spherical Wrist with Parallel Architecture: Application to Vertebrae of an Eel Robot: The design of a spherical wrist with parallel architecture is the object of this article. This study is part of a larger project, which aims to design and to build an eel robot for inspection of immersed piping. The kinematic analysis of the mechanism is presented first to characterize the singular configurations as well as the isotropic configurations. We add the design constraints related to the application, such as (i) the compactness of the mechanism, (ii) the symmetry of the elements in order to ensure static and dynamic balance and (iii) the possibility of the mechanism to fill the elliptic form of the ell sections.<|reference_end|> | arxiv | @article{chablat2007design,
title={Design of a Spherical Wrist with Parallel Architecture: Application to
Vertebrae of an Eel Robot},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN)},
journal={Proc. IEEE Int. Conf. Rob. and Automation (04/2005) 1-6},
year={2007},
archivePrefix={arXiv},
eprint={0707.2270},
primaryClass={cs.RO}
} | chablat2007design |
arxiv-776 | 0707.2275 | Passive Control Architecture for Virtual Humans | <|reference_start|>Passive Control Architecture for Virtual Humans: In the present paper, we introduce a new control architecture aimed at driving virtual humans in interaction with virtual environments, by motion capture. It brings decoupling of functionalities, and also of stability thanks to passivity. We show projections can break passivity, and thus must be used carefully. Our control scheme enables task space and internal control, contact, and joint limits management. Thanks to passivity, it can be easily extended. Besides, we introduce a new tool as for manikin's control, which makes it able to build passive projections, so as to guide the virtual manikin when sharp movements are needed.<|reference_end|> | arxiv | @article{rennuit2007passive,
title={Passive Control Architecture for Virtual Humans},
author={Antoine Rennuit (IRCCyN), Alain Micaelli (CEA/LIST), Xavier Merlhiot
(CEA/LIST), Claude Andriot (CEA/LIST), Franc{c}ois Guillaume, Nicolas
Chevassus, Damien Chablat (IRCCyN), Patrick Chedmail (IRCCyN)},
journal={Proceeding International Conference on Intelligent Robots ans
Systems (08/2005) 1-6},
year={2007},
archivePrefix={arXiv},
eprint={0707.2275},
primaryClass={cs.RO}
} | rennuit2007passive |
arxiv-777 | 0707.2291 | An Integrated Crosscutting Concern Migration Strategy and its Application to JHotDraw | <|reference_start|>An Integrated Crosscutting Concern Migration Strategy and its Application to JHotDraw: In this paper we propose a systematic strategy for migrating crosscutting concerns in existing object-oriented systems to aspect-based solutions. The proposed strategy consists of four steps: mining, exploration, documentation and refactoring of crosscutting concerns. We discuss in detail a new approach to aspect refactoring that is fully integrated with our strategy, and apply the whole strategy to an object-oriented system, namely the JHotDraw framework. The result of this migration is made available as an open-source project, which is the largest aspect refactoring available to date. We report on our experiences with conducting this case study and reflect on the success and challenges of the migration process, as well as on the feasibility of automatic aspect refactoring.<|reference_end|> | arxiv | @article{marin2007an,
title={An Integrated Crosscutting Concern Migration Strategy and its
Application to JHotDraw},
author={Marius Marin, Leon Moonen, Arie van Deursen},
journal={arXiv preprint arXiv:0707.2291},
year={2007},
number={TUD-SERG-2007-019},
archivePrefix={arXiv},
eprint={0707.2291},
primaryClass={cs.SE}
} | marin2007an |
arxiv-778 | 0707.2293 | Worm Epidemics in Wireless Adhoc Networks | <|reference_start|>Worm Epidemics in Wireless Adhoc Networks: A dramatic increase in the number of computing devices with wireless communication capability has resulted in the emergence of a new class of computer worms which specifically target such devices. The most striking feature of these worms is that they do not require Internet connectivity for their propagation but can spread directly from device to device using a short-range radio communication technology, such as WiFi or Bluetooth. In this paper, we develop a new model for epidemic spreading of these worms and investigate their spreading in wireless ad hoc networks via extensive Monte Carlo simulations. Our studies show that the threshold behaviour and dynamics of worm epidemics in these networks are greatly affected by a combination of spatial and temporal correlations which characterize these networks, and are significantly different from the previously studied epidemics in the Internet.<|reference_end|> | arxiv | @article{nekovee2007worm,
title={Worm Epidemics in Wireless Adhoc Networks},
author={Maziar Nekovee},
journal={Published in New J. Phys. 9 189, 2007},
year={2007},
doi={10.1088/1367-2630/9/6/189},
archivePrefix={arXiv},
eprint={0707.2293},
primaryClass={cs.NI cond-mat.stat-mech cs.CR physics.soc-ph}
} | nekovee2007worm |
arxiv-779 | 0707.2295 | Two polynomial algorithms for special maximum matching constructing in trees | <|reference_start|>Two polynomial algorithms for special maximum matching constructing in trees: For an arbitrary tree we investigate the problems of constructing a maximum matching which minimizes or maximizes the cardinality of a maximum matching of the graph obtained from original one by its removal and present corresponding polynomial algorithms.<|reference_end|> | arxiv | @article{kamalian2007two,
title={Two polynomial algorithms for special maximum matching constructing in
trees},
author={R.R. Kamalian, V. V. Mkrtchyan},
journal={arXiv preprint arXiv:0707.2295},
year={2007},
archivePrefix={arXiv},
eprint={0707.2295},
primaryClass={cs.DM}
} | kamalian2007two |
arxiv-780 | 0707.2341 | A Cultural Market Model | <|reference_start|>A Cultural Market Model: Social interactions and personal tastes shape our consumption behavior of cultural products. In this study, we present a computational model of a cultural market and we aim to analyze the behavior of the consumer population as an emergent phenomena. Our results suggest that the final market shares of cultural products dramatically depend on consumer heterogeneity and social interaction pressure. Furthermore, the relation between the resulting market shares and social interaction is robust with respect to a wide range of variation in the parameter values and the type of topology.<|reference_end|> | arxiv | @article{herdagdelen2007a,
title={A Cultural Market Model},
author={Amac Herdagdelen, Haluk Bingol},
journal={International Journal of Modern Physics C Vol. 19, No. 2, 271-282
(2008)},
year={2007},
doi={10.1142/S012918310801208X},
archivePrefix={arXiv},
eprint={0707.2341},
primaryClass={q-fin.GN cs.CY nlin.AO physics.soc-ph}
} | herdagdelen2007a |
arxiv-781 | 0707.2347 | Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm | <|reference_start|>Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm: We propose several new schedules for Strassen-Winograd's matrix multiplication algorithm, they reduce the extra memory allocation requirements by three different means: by introducing a few pre-additions, by overwriting the input matrices, or by using a first recursive level of classical multiplication. In particular, we show two fully in-place schedules: one having the same number of operations, if the input matrices can be overwritten; the other one, slightly increasing the constant of the leading term of the complexity, if the input matrices are read-only. Many of these schedules have been found by an implementation of an exhaustive search algorithm based on a pebble game.<|reference_end|> | arxiv | @article{boyer2007memory,
title={Memory efficient scheduling of Strassen-Winograd's matrix multiplication
algorithm},
author={Brice Boyer (LJK), Jean-Guillaume Dumas (LJK), Cl'ement Pernet (INRIA
Rh^one-Alpes / LIG Laboratoire d'Informatique de Grenoble), Wei Zhou
(Symbolic Computation Group)},
journal={(International Symposium on Symbolic and Algebraic Computation
2009), S\'eoul : Cor\'ee, R\'epublique de (2009)},
year={2007},
archivePrefix={arXiv},
eprint={0707.2347},
primaryClass={cs.MS}
} | boyer2007memory |
arxiv-782 | 0707.2376 | Tripartitions do not always discriminate phylogenetic networks | <|reference_start|>Tripartitions do not always discriminate phylogenetic networks: Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of non-treelike evolutionary events, like recombination, hybridization, or lateral gene transfer. In a recent series of papers devoted to the study of reconstructibility of phylogenetic networks, Moret, Nakhleh, Warnow and collaborators introduced the so-called {tripartition metric for phylogenetic networks. In this paper we show that, in fact, this tripartition metric does not satisfy the separation axiom of distances (zero distance means isomorphism, or, in a more relaxed version, zero distance means indistinguishability in some specific sense) in any of the subclasses of phylogenetic networks where it is claimed to do so. We also present a subclass of phylogenetic networks whose members can be singled out by means of their sets of tripartitions (or even clusters), and hence where the latter can be used to define a meaningful metric.<|reference_end|> | arxiv | @article{cardona2007tripartitions,
title={Tripartitions do not always discriminate phylogenetic networks},
author={Gabriel Cardona, Francesc Rossello, Gabriel Valiente},
journal={arXiv preprint arXiv:0707.2376},
year={2007},
archivePrefix={arXiv},
eprint={0707.2376},
primaryClass={q-bio.PE cs.CE cs.DM}
} | cardona2007tripartitions |
arxiv-783 | 0707.2432 | Pricing Asian Options for Jump Diffusions | <|reference_start|>Pricing Asian Options for Jump Diffusions: We construct a sequence of functions that uniformly converge (on compact sets) to the price of Asian option, which is written on a stock whose dynamics follows a jump diffusion, exponentially fast. Each of the element in this sequence solves a parabolic partial differen- tial equation (not an integro-differential equation). As a result we obtain a fast numerical approximation scheme whose accuracy versus speed characteristics can be controlled. We analyze the performance of our numerical algorithm on several examples.<|reference_end|> | arxiv | @article{bayraktar2007pricing,
title={Pricing Asian Options for Jump Diffusions},
author={Erhan Bayraktar, Hao Xing},
journal={arXiv preprint arXiv:0707.2432},
year={2007},
archivePrefix={arXiv},
eprint={0707.2432},
primaryClass={cs.CE}
} | bayraktar2007pricing |
arxiv-784 | 0707.2436 | On the Polyphase Decomposition for Design of Generalized Comb Decimation Filters | <|reference_start|>On the Polyphase Decomposition for Design of Generalized Comb Decimation Filters: Generalized comb filters (GCFs) are efficient anti-aliasing decimation filters with improved selectivity and quantization noise (QN) rejection performance around the so called folding bands with respect to classical comb filters. In this paper, we address the design of GCF filters by proposing an efficient partial polyphase architecture with the aim to reduce the data rate as much as possible after the Sigma-Delta A/D conversion. We propose a mathematical framework in order to completely characterize the dependence of the frequency response of GCFs on the quantization of the multipliers embedded in the proposed filter architecture. This analysis paves the way to the design of multiplier-less decimation architectures. We also derive the impulse response of a sample 3rd order GCF filter used as a reference scheme throughout the paper.<|reference_end|> | arxiv | @article{laddomada2007on,
title={On the Polyphase Decomposition for Design of Generalized Comb Decimation
Filters},
author={Massimiliano Laddomada},
journal={arXiv preprint arXiv:0707.2436},
year={2007},
doi={10.1109/TCSI.2008.920136},
archivePrefix={arXiv},
eprint={0707.2436},
primaryClass={cs.OH}
} | laddomada2007on |
arxiv-785 | 0707.2482 | Multiple-Description Lattice Vector Quantization | <|reference_start|>Multiple-Description Lattice Vector Quantization: In this thesis, we construct and analyze multiple-description codes based on lattice vector quantization.<|reference_end|> | arxiv | @article{ostergaard2007multiple-description,
title={Multiple-Description Lattice Vector Quantization},
author={Jan Ostergaard},
journal={Ph.D. Thesis, Delft University of Technology, ISBN
978-90-9021979-0, pp. 250, Gildeprint, June 2007},
year={2007},
archivePrefix={arXiv},
eprint={0707.2482},
primaryClass={cs.IT math.IT}
} | ostergaard2007multiple-description |
arxiv-786 | 0707.2506 | Mixed Integer Linear Programming For Exact Finite-Horizon Planning In Decentralized Pomdps | <|reference_start|>Mixed Integer Linear Programming For Exact Finite-Horizon Planning In Decentralized Pomdps: We consider the problem of finding an n-agent joint-policy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity (NEXP-hard in n >= 2). In this paper, we propose a new mathematical programming approach for the problem. Our approach is based on two ideas: First, we represent each agent's policy in the sequence-form and not in the tree-form, thereby obtaining a very compact representation of the set of joint-policies. Second, using this compact representation, we solve this problem as an instance of combinatorial optimization for which we formulate a mixed integer linear program (MILP). The optimal solution of the MILP directly yields an optimal joint-policy for the Dec-Pomdp. Computational experience shows that formulating and solving the MILP requires significantly less time to solve benchmark Dec-Pomdp problems than existing algorithms. For example, the multi-agent tiger problem for horizon 4 is solved in 72 secs with the MILP whereas existing algorithms require several hours to solve it.<|reference_end|> | arxiv | @article{aras2007mixed,
title={Mixed Integer Linear Programming For Exact Finite-Horizon Planning In
Decentralized Pomdps},
author={Raghav Aras (INRIA Lorraine - LORIA), Alain Dutech (INRIA Lorraine -
LORIA), Franc{c}ois Charpillet (INRIA Lorraine - LORIA)},
journal={Dans The International Conference on Automated Planning and
Scheduling (2007)},
year={2007},
archivePrefix={arXiv},
eprint={0707.2506},
primaryClass={cs.AI}
} | aras2007mixed |
arxiv-787 | 0707.2527 | Rate and Power Allocation for Discrete-Rate Link Adaptation | <|reference_start|>Rate and Power Allocation for Discrete-Rate Link Adaptation: Link adaptation, in particular adaptive coded modulation (ACM), is a promising tool for bandwidth-efficient transmission in a fading environment. The main motivation behind employing ACM schemes is to improve the spectral efficiency of wireless communication systems. In this paper, using a finite number of capacity achieving component codes, we propose new transmission schemes employing constant power transmission, as well as discrete and continuous power adaptation, for slowly varying flat-fading channels. We show that the proposed transmission schemes can achieve throughputs close to the Shannon limits of flat-fading channels using only a small number of codes. Specifically, using a fully discrete scheme with just four codes, each associated with four power levels, we achieve a spectral efficiency within 1 dB of the continuous-rate continuous-power Shannon capacity. Furthermore, when restricted to a fixed number of codes, the introduction of power adaptation has significant gains with respect to ASE and probability of no transmission compared to a constant power scheme.<|reference_end|> | arxiv | @article{gjendemsjø2007rate,
title={Rate and Power Allocation for Discrete-Rate Link Adaptation},
author={Anders Gjendemsj{o}, Geir E. {O}ien, Henrik Holm, Mohamed-Slim
Alouini, David Gesbert, Kjell J. Hole and P{aa}l Orten},
journal={arXiv preprint arXiv:0707.2527},
year={2007},
archivePrefix={arXiv},
eprint={0707.2527},
primaryClass={cs.IT math.IT}
} | gjendemsjø2007rate |
arxiv-788 | 0707.2562 | A Characterisation of First-Order Constraint Satisfaction Problems | <|reference_start|>A Characterisation of First-Order Constraint Satisfaction Problems: We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction problem is first-order definable: we show the general problem to be NP-complete, and give a polynomial-time algorithm in the case of cores. A slight modification of this algorithm provides, for first-order definable CSP's, a simple poly-time algorithm to produce a solution when one exists. As an application of our algebraic characterisation of first order CSP's, we describe a large family of L-complete CSP's.<|reference_end|> | arxiv | @article{larose2007a,
title={A Characterisation of First-Order Constraint Satisfaction Problems},
author={Benoit Larose, Cynthia Loten, Claude Tardif},
journal={Logical Methods in Computer Science, Volume 3, Issue 4 (November
6, 2007) lmcs:1097},
year={2007},
doi={10.2168/LMCS-3(4:6)2007},
archivePrefix={arXiv},
eprint={0707.2562},
primaryClass={cs.LO cs.CC}
} | larose2007a |
arxiv-789 | 0707.2630 | Multi-physics Extension of OpenFMO Framework | <|reference_start|>Multi-physics Extension of OpenFMO Framework: OpenFMO framework, an open-source software (OSS) platform for Fragment Molecular Orbital (FMO) method, is extended to multi-physics simulations (MPS). After reviewing the several FMO implementations on distributed computer environments, the subsequent development planning corresponding to MPS is presented. It is discussed which should be selected as a scientific software, lightweight and reconfigurable form or large and self-contained form.<|reference_end|> | arxiv | @article{takami2007multi-physics,
title={Multi-physics Extension of OpenFMO Framework},
author={Toshiya Takami, Jun Maki, Jun'ichi Ooba, Yuuichi Inadomi, Hiroaki
Honda, Ryutaro Susukita, Koji Inoue, Taizo Kobayashi, Rie Nogita, and Mutsumi
Aoyagi},
journal={AIP Conf. Proc. 963, 122-125 (2007)},
year={2007},
doi={10.1063/1.2835969},
archivePrefix={arXiv},
eprint={0707.2630},
primaryClass={cs.DC physics.comp-ph}
} | takami2007multi-physics |
arxiv-790 | 0707.2701 | A fixed point iteration for computing the matrix logarithm | <|reference_start|>A fixed point iteration for computing the matrix logarithm: In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical method calculates successive square roots. In this article, a new algorithm is presented that relies on the computation of successive matrix exponentials. Convergence of the method is demonstrated for a large class of initial matrices and favorable choices of the initial matrix are discussed.<|reference_end|> | arxiv | @article{schaller2007a,
title={A fixed point iteration for computing the matrix logarithm},
author={Gernot Schaller},
journal={arXiv preprint arXiv:0707.2701},
year={2007},
archivePrefix={arXiv},
eprint={0707.2701},
primaryClass={cs.NA cs.DS}
} | schaller2007a |
arxiv-791 | 0707.2718 | Animation of virtual mannequins, robot-like simulation or motion captures | <|reference_start|>Animation of virtual mannequins, robot-like simulation or motion captures: In order to optimize the costs and time of design of the new products while improving their quality, concurrent engineering is based on the digital model of these products, the numerical model. However, in order to be able to avoid definitively physical model, old support of the design, without loss of information, new tools must be available. Especially, a tool making it possible to check simply and quickly the maintainability of complex mechanical sets using the numerical model is necessary. Since one decade, our team works on the creation of tool for the generation and the analysis of trajectories of virtual mannequins. The simulation of human tasks can be carried out either by robot-like simulation or by simulation by motion capture. This paper presents some results on the both two methods. The first method is based on a multi-agent system and on a digital mock-up technology, to assess an efficient path planner for a manikin or a robot for access and visibility task taking into account ergonomic constraints or joint and mechanical limits. In order to solve this problem, the human operator is integrated in the process optimization to contribute to a global perception of the environment. This operator cooperates, in real-time, with several automatic local elementary agents. In the case of the second approach, we worked with the CEA and EADS/CCR to solve the constraints related to the evolution of human virtual in its environment on the basis of data resulting from motion capture system. An approach using of the virtual guides was developed to allow to the user the realization of precise trajectory in absence of force feedback. The result of this work validates solutions through the digital mock-up; it can be applied to simulate maintenability and mountability tasks.<|reference_end|> | arxiv | @article{chablat2007animation,
title={Animation of virtual mannequins, robot-like simulation or motion
captures},
author={Damien Chablat (IRCCyN)},
journal={3D Modelling Conferences - 3D Human (06/2006) 1-12},
year={2007},
archivePrefix={arXiv},
eprint={0707.2718},
primaryClass={cs.RO}
} | chablat2007animation |
arxiv-792 | 0707.2721 | A Framework to Illustrate Kinematic Behavior of Mechanisms by Haptic Feedback | <|reference_start|>A Framework to Illustrate Kinematic Behavior of Mechanisms by Haptic Feedback: The kinematic properties of mechanisms are well known by the researchers and teachers. The theory based on the study of Jacobian matrices allows us to explain, for example, the singular configuration. However, in many cases, the physical sense of such properties is difficult to explain to students. The aim of this article is to use haptic feedback to render to the user the signification of different kinematic indices. The framework uses a Phantom Omni and a serial and parallel mechanism with two degrees of freedom. The end-effector of both mechanisms can be moved either by classical mouse, or Phantom Omni with or without feedback.<|reference_end|> | arxiv | @article{zhang2007a,
title={A Framework to Illustrate Kinematic Behavior of Mechanisms by Haptic
Feedback},
author={Qinqin Zhang (IRCCyN, DIE), Damien Chablat (IRCCyN), Fouad Bennis
(IRCCyN), Wei Zhang (DIE)},
journal={Proceedings of Virtual Concept (25/11/2006) 1-6},
year={2007},
archivePrefix={arXiv},
eprint={0707.2721},
primaryClass={cs.RO}
} | zhang2007a |
arxiv-793 | 0707.2780 | On the ergodic sum-rate performance of CDD in multi-user systems | <|reference_start|>On the ergodic sum-rate performance of CDD in multi-user systems: The main focus of space-time coding design and analysis for MIMO systems has been so far focused on single-user systems. For single-user systems, transmit diversity schemes suffer a loss in spectral efficiency if the receiver is equipped with more than one antenna, making them unsuitable for high rate transmission. One such transmit diversity scheme is the cyclic delay diversity code (CDD). The advantage of CDD over other diversity schemes such as orthogonal space-time block codes (OSTBC) is that a code rate of one and delay optimality are achieved independent of the number of transmit antennas. In this work we analyze the ergodic rate of a multi-user multiple access channel (MAC) with each user applying such a cyclic delay diversity (CDD) code. We derive closed form expressions for the ergodic sum-rate of multi-user CDD and compare it with the sum-capacity. We study the ergodic rate region and show that in contrast to what is conventionally known regarding the single-user case, transmit diversity schemes are viable candidates for high rate transmission in multi-user systems. Finally, our theoretical findings are illustrated by numerical simulation results.<|reference_end|> | arxiv | @article{sezgin2007on,
title={On the ergodic sum-rate performance of CDD in multi-user systems},
author={Aydin Sezgin, Mohamad Charafeddine, Arogyaswami Paulraj},
journal={arXiv preprint arXiv:0707.2780},
year={2007},
doi={10.1109/ITW.2007.4313052},
archivePrefix={arXiv},
eprint={0707.2780},
primaryClass={cs.IT math.IT}
} | sezgin2007on |
arxiv-794 | 0707.2792 | Distributed Compression and Multiparty Squashed Entanglement | <|reference_start|>Distributed Compression and Multiparty Squashed Entanglement: We study a protocol in which many parties use quantum communication to transfer a shared state to a receiver without communicating with each other. This protocol is a multiparty version of the fully quantum Slepian-Wolf protocol for two senders and arises through the repeated application of the two-sender protocol. We describe bounds on the achievable rate region for the distributed compression problem. The inner bound arises by expressing the achievable rate region for our protocol in terms of its vertices and extreme rays and, equivalently, in terms of facet inequalities. We also prove an outer bound on all possible rates for distributed compression based on the multiparty squashed entanglement, a measure of multiparty entanglement.<|reference_end|> | arxiv | @article{avis2007distributed,
title={Distributed Compression and Multiparty Squashed Entanglement},
author={David Avis, Patrick Hayden, Ivan Savov},
journal={J. Phys. A 41 (2008) 115301},
year={2007},
doi={10.1088/1751-8113/41/11/115301},
archivePrefix={arXiv},
eprint={0707.2792},
primaryClass={quant-ph cs.IT math.IT}
} | avis2007distributed |
arxiv-795 | 0707.2833 | A Comparative Study between Two Three-DOF Parallel Kinematic Machines using Kinetostatic Criteria and Interval Analysis | <|reference_start|>A Comparative Study between Two Three-DOF Parallel Kinematic Machines using Kinetostatic Criteria and Interval Analysis: This paper addresses the workspace analysis of two 3-DOF translational parallel mechanisms designed for machining applications. The two machines features three fixed linear joints. The joint axes of the first machine are orthogonal whereas these of the second are parallel. In both cases, the mobile platform moves in the Cartesian $x-y-z$ space with fixed orientation. The workspace analysis is conducted on the basis of prescribed kinetostatic performances. Interval analysis based methods are used to compute the dextrous workspace and the largest cube enclosed in this workspace.<|reference_end|> | arxiv | @article{chablat2007a,
title={A Comparative Study between Two Three-DOF Parallel Kinematic Machines
using Kinetostatic Criteria and Interval Analysis},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN), Jean-Pierre Merlet
(INRIA Sophia Antipolis)},
journal={11th World Congress in Mechanism and Machine Science (04/2004) 1-6},
year={2007},
archivePrefix={arXiv},
eprint={0707.2833},
primaryClass={cs.RO}
} | chablat2007a |
arxiv-796 | 0707.2836 | Multimedia Capacity Analysis of the IEEE 80211e Contention-based Infrastructure Basic Service Set | <|reference_start|>Multimedia Capacity Analysis of the IEEE 80211e Contention-based Infrastructure Basic Service Set: We first propose a simple mathematical analysis framework for the Enhanced Distributed Channel Access (EDCA) function of the recently ratified IEEE 802.11e standard. Our analysis considers the fact that the distributed random access systems exhibit cyclic behavior. The proposed model is valid for arbitrary assignments of AC-specific Arbitration Interframe Space (AIFS) values and Contention Window (CW) sizes and is the first that considers an arbitrary distribution of active Access Categories (ACs) at the stations. Validating the theoretical results via extensive simulations, we show that the proposed analysis accurately captures the EDCA saturation performance. Next, we propose a framework for multimedia capacity analysis of the EDCA function. We calculate an accurate station- and AC-specific queue utilization ratio by appropriately weighing the service time predictions of the cycle time model for different number of active stations. Based on the calculated queue utilization ratio, we design a simple model-based admission control scheme. We show that the proposed call admission control algorithm maintains satisfactory user-perceived quality for coexisting voice and video connections in an infrastructure BSS and does not present over- or under-admission problems of previously proposed models in the literature.<|reference_end|> | arxiv | @article{inan2007multimedia,
title={Multimedia Capacity Analysis of the IEEE 802.11e Contention-based
Infrastructure Basic Service Set},
author={Inanc Inan, Feyza Keceli, Ender Ayanoglu},
journal={arXiv preprint arXiv:0707.2836},
year={2007},
archivePrefix={arXiv},
eprint={0707.2836},
primaryClass={cs.IT cs.MM math.IT}
} | inan2007multimedia |
arxiv-797 | 0707.2841 | The Virtual Manufacturing concept: Scope, Socio-Economic Aspects and Future Trends | <|reference_start|>The Virtual Manufacturing concept: Scope, Socio-Economic Aspects and Future Trends: The research area "Virtual Manufacturing (VM)'' is the use of information technology and computer simulation to model real world manufacturing processes for the purpose of analysing and understanding them. As automation technologies such as CAD/CAM have substantially shortened the time required to design products, Virtual Manufacturing will have a similar effect on the manufacturing phase thanks to the modelling, simulation and optimisation of the product and the processes involved in its fabrication. After a description of Virtual Manufacturing (definitions and scope), we present some socio-economic factors of VM and finaly some "hot topics'' for the future are proposed.<|reference_end|> | arxiv | @article{chablat2007the,
title={The Virtual Manufacturing concept: Scope, Socio-Economic Aspects and
Future Trends},
author={Damien Chablat (IRCCyN), Philippe D'epinc'e, Eric No"el,
Peer-Oliver Woelk (IFW)},
journal={Design Engineering Technical Conferences (09/2004) 1-6},
year={2007},
archivePrefix={arXiv},
eprint={0707.2841},
primaryClass={cs.RO}
} | chablat2007the |
arxiv-798 | 0707.2842 | A Classification of 3R Orthogonal Manipulators by the Topology of their Workspace | <|reference_start|>A Classification of 3R Orthogonal Manipulators by the Topology of their Workspace: A classification of a family of 3-revolute (3R) positining manipulators is established. This classification is based on the topology of their workspace. The workspace is characterized in a half-cross section by the singular curves. The workspace topology is defined by the number of cusps and nodes that appear on these singular curves. The design parameters space is shown to be divided into nine domains of distinct workspace topologies, in which all manipulators have similar global kinematic properties. Each separating surface is given as an explicit expression in the DH-parameters.<|reference_end|> | arxiv | @article{baili2007a,
title={A Classification of 3R Orthogonal Manipulators by the Topology of their
Workspace},
author={Maher Baili (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat
(IRCCyN)},
journal={Proc. IEEE Int. Conf. Rob. and Automation (04/2004) 1-6},
year={2007},
archivePrefix={arXiv},
eprint={0707.2842},
primaryClass={cs.RO}
} | baili2007a |
arxiv-799 | 0707.2886 | OA@MPS - a colourful view | <|reference_start|>OA@MPS - a colourful view: The open access agenda of the Max Planck Society, initiator of the Berlin Declaration, envisions the support of both the green way and the golden way to open access. For the implementation of the green way the Max Planck Society through its newly established unit (Max Planck Digital Library) follows the idea of providing a centralized technical platform for publications and a local support for editorial issues. With regard to the golden way, the Max Planck Society fosters the development of open access publication models and experiments new publishing concepts like the Living Reviews journals.<|reference_end|> | arxiv | @article{romary2007oa@mps,
title={OA@MPS - a colourful view},
author={Laurent Romary (MPDL)},
journal={Zeitschrift f\"ur Bibliothekswesen und Bibliographie (15/08/2007)
7 pages},
year={2007},
archivePrefix={arXiv},
eprint={0707.2886},
primaryClass={cs.DL}
} | romary2007oa@mps |
arxiv-800 | 0707.2921 | Covering a line segment with variable radius discs | <|reference_start|>Covering a line segment with variable radius discs: The paper addresses the problem of locating sensors with a circular field of view so that a given line segment is under full surveillance, which is termed as the Disc Covering Problem on a Line. The cost of each sensor includes a fixed component, and a variable component that is proportional to the field-of-view area. When only one type of sensor or, in general, one type of disc, is available, then a simple polynomial algorithm solves the problem. When there are different types of sensors in terms of fixed and variable costs, the problem becomes NP-hard. A branch-and-bound algorithm as well as an efficient heuristic are developed. The heuristic very often obtains the optimal solution as shown in extensive computational testing.<|reference_end|> | arxiv | @article{agnetis2007covering,
title={Covering a line segment with variable radius discs},
author={Alessandro Agnetis, Enrico Grande, Pitu B. Mirchandani, Andrea
Pacifici},
journal={arXiv preprint arXiv:0707.2921},
year={2007},
archivePrefix={arXiv},
eprint={0707.2921},
primaryClass={cs.DM cs.NA}
} | agnetis2007covering |
Subsets and Splits