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-1401
0710.2674
Linguistic Information Energy
<|reference_start|>Linguistic Information Energy: In this treatment a text is considered to be a series of word impulses which are read at a constant rate. The brain then assembles these units of information into higher units of meaning. A classical systems approach is used to model an initial part of this assembly pro...
arxiv
@article{ford2007linguistic, title={Linguistic Information Energy}, author={James Ford}, journal={arXiv preprint arXiv:0710.2674}, year={2007}, archivePrefix={arXiv}, eprint={0710.2674}, primaryClass={cs.CL cs.IT math.IT} }
ford2007linguistic
arxiv-1402
0710.2705
Fingerprinting with Minimum Distance Decoding
<|reference_start|>Fingerprinting with Minimum Distance Decoding: This work adopts an information theoretic framework for the design of collusion-resistant coding/decoding schemes for digital fingerprinting. More specifically, the minimum distance decision rule is used to identify 1 out of t pirates. Achievable rates, ...
arxiv
@article{lin2007fingerprinting, title={Fingerprinting with Minimum Distance Decoding}, author={Shih-Chun Lin, Mohammad Shahmohammadi, Hesham El Gamal}, journal={IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 4, NO. 1, MARCH 2009 pp.59-69}, year={2007}, doi={10.1109/TIFS.2008.2012201...
lin2007fingerprinting
arxiv-1403
0710.2716
Cost and Effects of Pinning Control for Network Synchronization
<|reference_start|>Cost and Effects of Pinning Control for Network Synchronization: In this paper, the problem of pinning control for synchronization of complex dynamical networks is discussed. A cost function of the controlled network is defined by the feedback gain and the coupling strength of the network. An interes...
arxiv
@article{li2007cost, title={Cost and Effects of Pinning Control for Network Synchronization}, author={Rong Li, Zhisheng Duan and Guanrong Chen}, journal={arXiv preprint arXiv:0710.2716}, year={2007}, archivePrefix={arXiv}, eprint={0710.2716}, primaryClass={cs.NI} }
li2007cost
arxiv-1404
0710.2732
Probabilistic communication complexity over the reals
<|reference_start|>Probabilistic communication complexity over the reals: Deterministic and probabilistic communication protocols are introduced in which parties can exchange the values of polynomials (rather than bits in the usual setting). It is established a sharp lower bound $2n$ on the communication complexity of ...
arxiv
@article{grigoriev2007probabilistic, title={Probabilistic communication complexity over the reals}, author={Dima Grigoriev (IRMAR)}, journal={arXiv preprint arXiv:0710.2732}, year={2007}, number={07-60}, archivePrefix={arXiv}, eprint={0710.2732}, primaryClass={cs.CC} }
grigoriev2007probabilistic
arxiv-1405
0710.2736
L2 norm performance index of synchronization and optimal control synthesis of complex networks
<|reference_start|>L2 norm performance index of synchronization and optimal control synthesis of complex networks: In this paper, the synchronizability problem of dynamical networks is addressed, where better synchronizability means that the network synchronizes faster with lower-overshoot. The L2 norm of the error vec...
arxiv
@article{liu2007l2, title={L2 norm performance index of synchronization and optimal control synthesis of complex networks}, author={Chao Liu, Zhisheng Duan and Guanrong Chen and Lin Huang}, journal={arXiv preprint arXiv:0710.2736}, year={2007}, archivePrefix={arXiv}, eprint={0710.2736}, pr...
liu2007l2
arxiv-1406
0710.2782
Effective linkage learning using low-order statistics and clustering
<|reference_start|>Effective linkage learning using low-order statistics and clustering: The adoption of probabilistic models for the best individuals found so far is a powerful approach for evolutionary computation. Increasingly more complex models have been used by estimation of distribution algorithms (EDAs), which ...
arxiv
@article{emmendorfer2007effective, title={Effective linkage learning using low-order statistics and clustering}, author={Leonardo Emmendorfer and Aurora Pozo}, journal={arXiv preprint arXiv:0710.2782}, year={2007}, archivePrefix={arXiv}, eprint={0710.2782}, primaryClass={cs.NE cs.AI} }
emmendorfer2007effective
arxiv-1407
0710.2848
Consistency of trace norm minimization
<|reference_start|>Consistency of trace norm minimization: Regularization by the sum of singular values, also referred to as the trace norm, is a popular technique for estimating low rank rectangular matrices. In this paper, we extend some of the consistency results of the Lasso to provide necessary and sufficient cond...
arxiv
@article{bach2007consistency, title={Consistency of trace norm minimization}, author={Francis Bach (WILLOW Project - Inria/Ens)}, journal={arXiv preprint arXiv:0710.2848}, year={2007}, archivePrefix={arXiv}, eprint={0710.2848}, primaryClass={cs.LG} }
bach2007consistency
arxiv-1408
0710.2852
Generating models for temporal representations
<|reference_start|>Generating models for temporal representations: We discuss the use of model building for temporal representations. We chose Polish to illustrate our discussion because it has an interesting aspectual system, but the points we wish to make are not language specific. Rather, our goal is to develop theo...
arxiv
@article{blackburn2007generating, title={Generating models for temporal representations}, author={Patrick Blackburn (INRIA Lorraine - LORIA), S'ebastien Hinderer (INRIA Lorraine - LORIA)}, journal={Dans Recent Advances in Natural Language Processing (2007) 69-75}, year={2007}, archivePrefix={arXiv...
blackburn2007generating
arxiv-1409
0710.2887
Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems - Report on the Workshop ICOOOLPS'2006 at ECOOP'06
<|reference_start|>Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems - Report on the Workshop ICOOOLPS'2006 at ECOOP'06: ICOOOLPS'2006 was the first edition of ECOOP-ICOOOLPS workshop. It intended to bring researchers and practitioners both from academia and industry together,...
arxiv
@article{ducournau2007implementation,, title={Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems - Report on the Workshop ICOOOLPS'2006 at ECOOP'06}, author={Roland Ducournau (LIRMM), Etienne Gagnon, Chandra Krintz (RACE LAB), Philippe Mulet, Jan Vitek (S3L), Olivie...
ducournau2007implementation,
arxiv-1410
0710.2889
An efficient reduction of ranking to classification
<|reference_start|>An efficient reduction of ranking to classification: This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most that of the binary classifier regret, improving a recent result of Ba...
arxiv
@article{ailon2007an, title={An efficient reduction of ranking to classification}, author={Nir Ailon and Mehryar Mohri}, journal={arXiv preprint arXiv:0710.2889}, year={2007}, archivePrefix={arXiv}, eprint={0710.2889}, primaryClass={cs.LG cs.IR} }
ailon2007an
arxiv-1411
0710.2970
A generic attack to ciphers
<|reference_start|>A generic attack to ciphers: In this paper, we present a generic attack for ciphers, which is in essence a collision attack on the secret keys of ciphers .<|reference_end|>
arxiv
@article{li2007a, title={A generic attack to ciphers}, author={An-Ping Li}, journal={arXiv preprint arXiv:0710.2970}, year={2007}, archivePrefix={arXiv}, eprint={0710.2970}, primaryClass={cs.CR} }
li2007a
arxiv-1412
0710.2988
Using Description Logics for Recognising Textual Entailment
<|reference_start|>Using Description Logics for Recognising Textual Entailment: The aim of this paper is to show how we can handle the Recognising Textual Entailment (RTE) task by using Description Logics (DLs). To do this, we propose a representation of natural language semantics in DLs inspired by existing representa...
arxiv
@article{bedaride2007using, title={Using Description Logics for Recognising Textual Entailment}, author={Paul Bedaride (INRIA Lorraine - Loria)}, journal={Dans 19th European Summer School in Logic, Language and Information (2007) 11-21}, year={2007}, archivePrefix={arXiv}, eprint={0710.2988}, ...
bedaride2007using
arxiv-1413
0710.3027
Classical Capacities of Averaged and Compound Quantum Channels
<|reference_start|>Classical Capacities of Averaged and Compound Quantum Channels: We determine the capacity of compound classical-quantum channels. As a consequence we obtain the capacity formula for the averaged classical-quantum channels. The capacity result for compound channels demonstrates, as in the classical se...
arxiv
@article{bjelakovic2007classical, title={Classical Capacities of Averaged and Compound Quantum Channels}, author={Igor Bjelakovic and Holger Boche}, journal={arXiv preprint arXiv:0710.3027}, year={2007}, archivePrefix={arXiv}, eprint={0710.3027}, primaryClass={quant-ph cs.IT math-ph math.IT ...
bjelakovic2007classical
arxiv-1414
0710.3170
Fast Intrinsic Mode Decomposition of Time Series Data with Sawtooth Transform
<|reference_start|>Fast Intrinsic Mode Decomposition of Time Series Data with Sawtooth Transform: An efficient method is introduced in this paper to find the intrinsic mode function (IMF) components of time series data. This method is faster and more predictable than the Empirical Mode Decomposition (EMD) method devise...
arxiv
@article{lu2007fast, title={Fast Intrinsic Mode Decomposition of Time Series Data with Sawtooth Transform}, author={Louis Yu Lu}, journal={arXiv preprint arXiv:0710.3170}, year={2007}, archivePrefix={arXiv}, eprint={0710.3170}, primaryClass={cs.NA} }
lu2007fast
arxiv-1415
0710.3178
Modeling Context, Collaboration, and Civilization in End-User Informatics
<|reference_start|>Modeling Context, Collaboration, and Civilization in End-User Informatics: End-user informatics applications are Internet data web management automation solutions. These are mass modeling and mass management collaborative communal consensus solutions. They are made and maintained by managerial, profe...
arxiv
@article{maney2007modeling, title={Modeling Context, Collaboration, and Civilization in End-User Informatics}, author={George A. Maney}, journal={arXiv preprint arXiv:0710.3178}, year={2007}, archivePrefix={arXiv}, eprint={0710.3178}, primaryClass={cs.OH} }
maney2007modeling
arxiv-1416
0710.3185
Fuzzy Modeling of Electrical Impedance Tomography Image of the Lungs
<|reference_start|>Fuzzy Modeling of Electrical Impedance Tomography Image of the Lungs: Electrical Impedance Tomography (EIT) is a functional imaging method that is being developed for bedside use in critical care medicine. Aiming at improving the chest anatomical resolution of EIT images we developed a fuzzy model ba...
arxiv
@article{tanaka2007fuzzy, title={Fuzzy Modeling of Electrical Impedance Tomography Image of the Lungs}, author={Harki Tanaka, Neli Regina Siqueira Ortega, Mauricio Stanzione Galizia, Joao Batista Borges Sobrinho, and Marcelo Britto Passos Amato}, journal={arXiv preprint arXiv:0710.3185}, year={2007}, ...
tanaka2007fuzzy
arxiv-1417
0710.3246
Bloom maps
<|reference_start|>Bloom maps: We consider the problem of succinctly encoding a static map to support approximate queries. We derive upper and lower bounds on the space requirements in terms of the error rate and the entropy of the distribution of values over keys: our bounds differ by a factor log e. For the upper bou...
arxiv
@article{talbot2007bloom, title={Bloom maps}, author={David Talbot and John Talbot}, journal={arXiv preprint arXiv:0710.3246}, year={2007}, archivePrefix={arXiv}, eprint={0710.3246}, primaryClass={cs.DS cs.IT math.IT} }
talbot2007bloom
arxiv-1418
0710.3279
Resource Allocation for Delay Differentiated Traffic in Multiuser OFDM Systems
<|reference_start|>Resource Allocation for Delay Differentiated Traffic in Multiuser OFDM Systems: Most existing work on adaptive allocation of subcarriers and power in multiuser orthogonal frequency division multiplexing (OFDM) systems has focused on homogeneous traffic consisting solely of either delay-constrained da...
arxiv
@article{tao2007resource, title={Resource Allocation for Delay Differentiated Traffic in Multiuser OFDM Systems}, author={Meixia Tao, Ying-Chang Liang and Fan Zhang}, journal={arXiv preprint arXiv:0710.3279}, year={2007}, doi={10.1109/ICC.2006.255331}, archivePrefix={arXiv}, eprint={0710.3...
tao2007resource
arxiv-1419
0710.3283
Effects of Non-Identical Rayleigh Fading on Differential Unitary Space-Time Modulation
<|reference_start|>Effects of Non-Identical Rayleigh Fading on Differential Unitary Space-Time Modulation: This paper has been withdrawn by the author.<|reference_end|>
arxiv
@article{tao2007effects, title={Effects of Non-Identical Rayleigh Fading on Differential Unitary Space-Time Modulation}, author={Meixia Tao}, journal={arXiv preprint arXiv:0710.3283}, year={2007}, archivePrefix={arXiv}, eprint={0710.3283}, primaryClass={cs.PF cs.IT math.IT} }
tao2007effects
arxiv-1420
0710.3285
Nontraditional Scoring of C-tests
<|reference_start|>Nontraditional Scoring of C-tests: In C-tests the hypothesis of items local independence is violated, which doesn't permit to consider them as real tests. It is suggested to determine the distances between separate C-test items (blanks) and to combine items into clusters. Weights, inversely proportio...
arxiv
@article{tamara2007nontraditional, title={Nontraditional Scoring of C-tests}, author={Tretjakova Tamara}, journal={arXiv preprint arXiv:0710.3285}, year={2007}, archivePrefix={arXiv}, eprint={0710.3285}, primaryClass={cs.CY cs.CL} }
tamara2007nontraditional
arxiv-1421
0710.3305
Automatic Methods for Analyzing Non-Repudiation Protocols with an Active Intruder
<|reference_start|>Automatic Methods for Analyzing Non-Repudiation Protocols with an Active Intruder: Non-repudiation protocols have an important role in many areas where secured transactions with proofs of participation are necessary. Formal methods are clever and without error, therefore using them for verifying such...
arxiv
@article{klay2007automatic, title={Automatic Methods for Analyzing Non-Repudiation Protocols with an Active Intruder}, author={Francis Klay (FT R&D), Judson Santiago (DIMAP - UFRN), Laurent Vigneron (INRIA Lorraine - LORIA / LIFC)}, journal={arXiv preprint arXiv:0710.3305}, year={2007}, archiveP...
klay2007automatic
arxiv-1422
0710.3332
Model and Program Repair via SAT Solving
<|reference_start|>Model and Program Repair via SAT Solving: We consider the following \emph{model repair problem}: given a finite Kripke structure $M$ and a specification formula $\eta$ in some modal or temporal logic, determine if $M$ contains a substructure $M'$ (with the same initial state) that satisfies $\eta$. T...
arxiv
@article{attie2007model, title={Model and Program Repair via SAT Solving}, author={Paul C. Attie and Jad Saklawi}, journal={arXiv preprint arXiv:0710.3332}, year={2007}, archivePrefix={arXiv}, eprint={0710.3332}, primaryClass={cs.LO} }
attie2007model
arxiv-1423
0710.3375
On the Capacity of Interference Channels with One Cooperating Transmitter
<|reference_start|>On the Capacity of Interference Channels with One Cooperating Transmitter: Inner and outer bounds are established on the capacity region of two-sender, two-receiver interference channels where one transmitter knows both messages. The transmitter with extra knowledge is referred to as being cognitive....
arxiv
@article{maric2007on, title={On the Capacity of Interference Channels with One Cooperating Transmitter}, author={I. Maric, A. Goldsmith, G. Kramer, S. Shamai}, journal={arXiv preprint arXiv:0710.3375}, year={2007}, archivePrefix={arXiv}, eprint={0710.3375}, primaryClass={cs.IT math.IT} }
maric2007on
arxiv-1424
0710.3427
Error Correction Capability of Column-Weight-Three LDPC Codes
<|reference_start|>Error Correction Capability of Column-Weight-Three LDPC Codes: In this paper, we investigate the error correction capability of column-weight-three LDPC codes when decoded using the Gallager A algorithm. We prove that the necessary condition for a code to correct $k \geq 5$ errors is to avoid cycles ...
arxiv
@article{chilappagari2007error, title={Error Correction Capability of Column-Weight-Three LDPC Codes}, author={Shashi Kiran Chilappagari and Bane Vasic}, journal={arXiv preprint arXiv:0710.3427}, year={2007}, archivePrefix={arXiv}, eprint={0710.3427}, primaryClass={cs.IT math.IT} }
chilappagari2007error
arxiv-1425
0710.3439
Utility-Based Wireless Resource Allocation for Variable Rate Transmission
<|reference_start|>Utility-Based Wireless Resource Allocation for Variable Rate Transmission: For most wireless services with variable rate transmission, both average rate and rate oscillation are important performance metrics. The traditional performance criterion, utility of average transmission rate, boosts the aver...
arxiv
@article{zhang2007utility-based, title={Utility-Based Wireless Resource Allocation for Variable Rate Transmission}, author={Xiaolu Zhang, Meixia Tao and Chun Sum Ng}, journal={arXiv preprint arXiv:0710.3439}, year={2007}, archivePrefix={arXiv}, eprint={0710.3439}, primaryClass={cs.NI} }
zhang2007utility-based
arxiv-1426
0710.3443
DPA on quasi delay insensitive asynchronous circuits: formalization and improvement
<|reference_start|>DPA on quasi delay insensitive asynchronous circuits: formalization and improvement: The purpose of this paper is to formally specify a flow devoted to the design of Differential Power Analysis (DPA) resistant QDI asynchronous circuits. The paper first proposes a formal modeling of the electrical sig...
arxiv
@article{bouesse2007dpa, title={DPA on quasi delay insensitive asynchronous circuits: formalization and improvement}, author={G.F. Bouesse (TIMA), M. Renaudin (TIMA), S. Dumont (TIMA), F. Germain}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)}, year={2007}...
bouesse2007dpa
arxiv-1427
0710.3502
Using Synchronic and Diachronic Relations for Summarizing Multiple Documents Describing Evolving Events
<|reference_start|>Using Synchronic and Diachronic Relations for Summarizing Multiple Documents Describing Evolving Events: In this paper we present a fresh look at the problem of summarizing evolving events from multiple sources. After a discussion concerning the nature of evolving events we introduce a distinction be...
arxiv
@article{afantenos2007using, title={Using Synchronic and Diachronic Relations for Summarizing Multiple Documents Describing Evolving Events}, author={Stergos D. Afantenos, V. Karkaletsis, P. Stamatopoulos and C. Halatsis}, journal={arXiv preprint arXiv:0710.3502}, year={2007}, doi={10.1007/s10844-...
afantenos2007using
arxiv-1428
0710.3519
P-matrix recognition is co-NP-complete
<|reference_start|>P-matrix recognition is co-NP-complete: This is a summary of the proof by G.E. Coxson that P-matrix recognition is co-NP-complete. The result follows by a reduction from the MAX CUT problem using results of S. Poljak and J. Rohn.<|reference_end|>
arxiv
@article{foniok2007p-matrix, title={P-matrix recognition is co-NP-complete}, author={Jan Foniok}, journal={arXiv preprint arXiv:0710.3519}, year={2007}, archivePrefix={arXiv}, eprint={0710.3519}, primaryClass={cs.CC} }
foniok2007p-matrix
arxiv-1429
0710.3535
JANUS: an FPGA-based System for High Performance Scientific Computing
<|reference_start|>JANUS: an FPGA-based System for High Performance Scientific Computing: This paper describes JANUS, a modular massively parallel and reconfigurable FPGA-based computing system. Each JANUS module has a computational core and a host. The computational core is a 4x4 array of FPGA-based processing element...
arxiv
@article{belletti2007janus:, title={JANUS: an FPGA-based System for High Performance Scientific Computing}, author={F. Belletti, M. Cotallo, A. Cruz, L. A. Fern'andez, A. Gordillo, M. Guidetti, A. Maiorano, F. Mantovani, E. Marinari, V. Mart'in-Mayor, A. Mu~noz-Sudupe, D. Navarro, G. Parisi, S. P'erez-Gavir...
belletti2007janus:
arxiv-1430
0710.3536
Common Beliefs and Public Announcements in Strategic Games with Arbitrary Strategy Sets
<|reference_start|>Common Beliefs and Public Announcements in Strategic Games with Arbitrary Strategy Sets: We provide an epistemic analysis of arbitrary strategic games based on possibility correspondences. We first establish a generic result that links true common beliefs (and, respectively, common knowledge) of play...
arxiv
@article{apt2007common, title={Common Beliefs and Public Announcements in Strategic Games with Arbitrary Strategy Sets}, author={Krzysztof R. Apt and Jonathan A. Zvesper}, journal={arXiv preprint arXiv:0710.3536}, year={2007}, archivePrefix={arXiv}, eprint={0710.3536}, primaryClass={cs.GT}...
apt2007common
arxiv-1431
0710.3561
Stationary probability density of stochastic search processes in global optimization
<|reference_start|>Stationary probability density of stochastic search processes in global optimization: A method for the construction of approximate analytical expressions for the stationary marginal densities of general stochastic search processes is proposed. By the marginal densities, regions of the search space th...
arxiv
@article{berrones2007stationary, title={Stationary probability density of stochastic search processes in global optimization}, author={Arturo Berrones}, journal={J. Stat. Mech. (2008) P01013}, year={2007}, doi={10.1088/1742-5468/2008/01/P01013}, archivePrefix={arXiv}, eprint={0710.3561}, ...
berrones2007stationary
arxiv-1432
0710.3603
On a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling
<|reference_start|>On a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling: Vertex colouring is a well-known problem in combinatorial optimisation, whose alternative integer programming formulations have recently attracted considerable attention. This paper briefly ...
arxiv
@article{burke2007on, title={On a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling}, author={Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, and Hana Rudova}, journal={Annals of Operations Research (2010) 179(1), 105-130}, year={2007}, doi=...
burke2007on
arxiv-1433
0710.3621
Numerical removal of water-vapor effects from THz-TDS measurements
<|reference_start|>Numerical removal of water-vapor effects from THz-TDS measurements: One source of disturbance in a pulsed T-ray signal is attributed to ambient water vapor. Water molecules in the gas phase selectively absorb T-rays at discrete frequencies corresponding to their molecular rotational transitions. This...
arxiv
@article{withayachumnankul2007numerical, title={Numerical removal of water-vapor effects from THz-TDS measurements}, author={Withawat Withayachumnankul, Bernd M. Fischer, Samuel P. Mickan, Derek Abbott}, journal={Proceedings of the Royal Society A: Mathematical, Physical & Engineering Sciences, vol. 464...
withayachumnankul2007numerical
arxiv-1434
0710.3642
On the Complexity of Spill Everywhere under SSA Form
<|reference_start|>On the Complexity of Spill Everywhere under SSA Form: Compilation for embedded processors can be either aggressive (time consuming cross-compilation) or just in time (embedded and usually dynamic). The heuristics used in dynamic compilation are highly constrained by limited resources, time and memory...
arxiv
@article{bouchez2007on, title={On the Complexity of Spill Everywhere under SSA Form}, author={Florent Bouchez (LIP), Alain Darte (LIP), Fabrice Rastello (LIP)}, journal={ACM SIGPLAN Notices Issue 7, Volume 42 (2007) 103 - 112}, year={2007}, doi={10.1145/1254766.1254782}, archivePrefix={arXiv}, ...
bouchez2007on
arxiv-1435
0710.3757
Inferring the conditional mean
<|reference_start|>Inferring the conditional mean: Consider a stationary real-valued time series $\{X_n\}_{n=0}^{\infty}$ with a priori unknown distribution. The goal is to estimate the conditional expectation $E(X_{n+1}|X_0,..., X_n)$ based on the observations $(X_0,..., X_n)$ in a pointwise consistent way. It is well...
arxiv
@article{morvai2007inferring, title={Inferring the conditional mean}, author={Gusztav Morvai, Benjamin Weiss}, journal={Theory Stoch. Process. 11 (2005), no. 1-2, pp. 112--120}, year={2007}, archivePrefix={arXiv}, eprint={0710.3757}, primaryClass={math.PR cs.IT math.IT} }
morvai2007inferring
arxiv-1436
0710.3760
Guessing the output of a stationary binary time series
<|reference_start|>Guessing the output of a stationary binary time series: The forward prediction problem for a binary time series $\{X_n\}_{n=0}^{\infty}$ is to estimate the probability that $X_{n+1}=1$ based on the observations $X_i$, $0\le i\le n$ without prior knowledge of the distribution of the process $\{X_n\}$....
arxiv
@article{morvai2007guessing, title={Guessing the output of a stationary binary time series}, author={Gusztav Morvai}, journal={Foundations of statistical inference (Shoresh, 2000), 207--215, Contrib. Statist., Physica, Heidelberg, 2003}, year={2007}, archivePrefix={arXiv}, eprint={0710.3760}, ...
morvai2007guessing
arxiv-1437
0710.3764
Design of a Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata
<|reference_start|>Design of a Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata: This paper presents the design of a novel distributed algorithm d-IRA for the reachability analysis of linear hybrid automata. Recent work on iterative relaxation abstraction (IRA) is leveraged to distribute the co...
arxiv
@article{jha2007design, title={Design of a Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata}, author={Sumit Kumar Jha}, journal={arXiv preprint arXiv:0710.3764}, year={2007}, archivePrefix={arXiv}, eprint={0710.3764}, primaryClass={cs.LO} }
jha2007design
arxiv-1438
0710.3773
Limitations on intermittent forecasting
<|reference_start|>Limitations on intermittent forecasting: Bailey showed that the general pointwise forecasting for stationary and ergodic time series has a negative solution. However, it is known that for Markov chains the problem can be solved. Morvai showed that there is a stopping time sequence $\{\lambda_n\}$ suc...
arxiv
@article{morvai2007limitations, title={Limitations on intermittent forecasting}, author={Gusztav Morvai and Benjamin Weiss}, journal={Statist. Probab. Lett. 72 (2005), no. 4, 285--290}, year={2007}, archivePrefix={arXiv}, eprint={0710.3773}, primaryClass={math.PR cs.IT math.IT} }
morvai2007limitations
arxiv-1439
0710.3775
On classifying processes
<|reference_start|>On classifying processes: We prove several results concerning classifications, based on successive observations $(X_1,..., X_n)$ of an unknown stationary and ergodic process, for membership in a given class of processes, such as the class of all finite order Markov chains.<|reference_end|>
arxiv
@article{morvai2007on, title={On classifying processes}, author={Gusztav Morvai and Benjamin Weiss}, journal={Bernoulli 11 (2005), no. 3, pp. 523--532}, year={2007}, archivePrefix={arXiv}, eprint={0710.3775}, primaryClass={math.PR cs.IT math.IT} }
morvai2007on
arxiv-1440
0710.3777
A Deterministic Approach to Wireless Relay Networks
<|reference_start|>A Deterministic Approach to Wireless Relay Networks: We present a deterministic channel model which captures several key features of multiuser wireless communication. We consider a model for a wireless network with nodes connected by such deterministic channels, and present an exact characterization ...
arxiv
@article{avestimehr2007a, title={A Deterministic Approach to Wireless Relay Networks}, author={A. S. Avestimehr, S. N. Diggavi, D. N. C. Tse}, journal={arXiv preprint arXiv:0710.3777}, year={2007}, archivePrefix={arXiv}, eprint={0710.3777}, primaryClass={cs.IT cs.DM math.IT math.PR} }
avestimehr2007a
arxiv-1441
0710.3779
Testing D-Sequences for their Randomness
<|reference_start|>Testing D-Sequences for their Randomness: This paper examines the randomness of d-sequences, which are decimal sequences to an arbitrary base. Our motivation is to check their suitability for application to cryptography, spread-spectrum systems and use as pseudorandom sequence.<|reference_end|>
arxiv
@article{gangasani2007testing, title={Testing D-Sequences for their Randomness}, author={Sumanth Kumar Reddy Gangasani}, journal={arXiv preprint arXiv:0710.3779}, year={2007}, archivePrefix={arXiv}, eprint={0710.3779}, primaryClass={cs.CR} }
gangasani2007testing
arxiv-1442
0710.3781
Wireless Network Information Flow
<|reference_start|>Wireless Network Information Flow: We present an achievable rate for general deterministic relay networks, with broadcasting at the transmitters and interference at the receivers. In particular we show that if the optimizing distribution for the information-theoretic cut-set bound is a product distri...
arxiv
@article{avestimehr2007wireless, title={Wireless Network Information Flow}, author={A. S. Avestimehr, S. N. Diggavi, D. N. C. Tse}, journal={arXiv preprint arXiv:0710.3781}, year={2007}, archivePrefix={arXiv}, eprint={0710.3781}, primaryClass={cs.IT cs.DM math.IT math.PR} }
avestimehr2007wireless
arxiv-1443
0710.3789
Frequency Analysis of Decoupling Capacitors for Three Voltage Supplies in SoC
<|reference_start|>Frequency Analysis of Decoupling Capacitors for Three Voltage Supplies in SoC: Reduction in power consumption has become a major criterion of design in modern ICs. One such scheme to reduce power consumption by an IC is the use of multiple power supplies for critical and non-critical paths. To mainta...
arxiv
@article{abubakr2007frequency, title={Frequency Analysis of Decoupling Capacitors for Three Voltage Supplies in SoC}, author={Mohd Abubakr}, journal={arXiv preprint arXiv:0710.3789}, year={2007}, archivePrefix={arXiv}, eprint={0710.3789}, primaryClass={cs.AR} }
abubakr2007frequency
arxiv-1444
0710.3802
A Posteriori Equivalence: A New Perspective for Design of Optimal Channel Shortening Equalizers
<|reference_start|>A Posteriori Equivalence: A New Perspective for Design of Optimal Channel Shortening Equalizers: The problem of channel shortening equalization for optimal detection in ISI channels is considered. The problem is to choose a linear equalizer and a partial response target filter such that the combinati...
arxiv
@article{venkataramani2007a, title={A Posteriori Equivalence: A New Perspective for Design of Optimal Channel Shortening Equalizers}, author={Raman Venkataramani, M. Fatih Erden}, journal={arXiv preprint arXiv:0710.3802}, year={2007}, archivePrefix={arXiv}, eprint={0710.3802}, primaryClass...
venkataramani2007a
arxiv-1445
0710.3804
Random subcubes as a toy model for constraint satisfaction problems
<|reference_start|>Random subcubes as a toy model for constraint satisfaction problems: We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the solution space of the random k-satisfiability and k-c...
arxiv
@article{mora2007random, title={Random subcubes as a toy model for constraint satisfaction problems}, author={Thierry Mora and Lenka Zdeborova}, journal={J. Stat. Phys. 131, n. 6 (2008), 1121-1138}, year={2007}, doi={10.1007/s10955-008-9543-x}, archivePrefix={arXiv}, eprint={0710.3804}, ...
mora2007random
arxiv-1446
0710.3817
A Note on Comparison of Error Correction Codes
<|reference_start|>A Note on Comparison of Error Correction Codes: Use of an error correction code in a given transmission channel can be regarded as the statistical experiment. Therefore, powerful results from the theory of comparison of experiments can be applied to compare the performances of different error correct...
arxiv
@article{djonin2007a, title={A Note on Comparison of Error Correction Codes}, author={Dejan V. Djonin}, journal={arXiv preprint arXiv:0710.3817}, year={2007}, archivePrefix={arXiv}, eprint={0710.3817}, primaryClass={cs.IT math.IT math.ST stat.TH} }
djonin2007a
arxiv-1447
0710.3824
Deterministic Secure Positioning in Wireless Sensor Networks
<|reference_start|>Deterministic Secure Positioning in Wireless Sensor Networks: Properly locating sensor nodes is an important building block for a large subset of wireless sensor networks (WSN) applications. As a result, the performance of the WSN degrades significantly when misbehaving nodes report false location an...
arxiv
@article{delaët2007deterministic, title={Deterministic Secure Positioning in Wireless Sensor Networks}, author={Sylvie Dela"et (LRI), Partha Sarathi Mandal (INRIA Futurs), Mariusz Rokicki (LRI), S'ebastien Tixeuil (INRIA Futurs, LIP6)}, journal={arXiv preprint arXiv:0710.3824}, year={2007}, archiv...
delaët2007deterministic
arxiv-1448
0710.3861
Optimal encoding on discrete lattice with translational invariant constrains using statistical algorithms
<|reference_start|>Optimal encoding on discrete lattice with translational invariant constrains using statistical algorithms: In this paper will be presented methodology of encoding information in valuations of discrete lattice with some translational invariant constrains in asymptotically optimal way. The method is ba...
arxiv
@article{duda2007optimal, title={Optimal encoding on discrete lattice with translational invariant constrains using statistical algorithms}, author={Jarek Duda}, journal={arXiv preprint arXiv:0710.3861}, year={2007}, archivePrefix={arXiv}, eprint={0710.3861}, primaryClass={cs.IT math.IT} }
duda2007optimal
arxiv-1449
0710.3888
Cooperative Multi-Cell Networks: Impact of Limited-Capacity Backhaul and Inter-Users Links
<|reference_start|>Cooperative Multi-Cell Networks: Impact of Limited-Capacity Backhaul and Inter-Users Links: Cooperative technology is expected to have a great impact on the performance of cellular or, more generally, infrastructure networks. Both multicell processing (cooperation among base stations) and relaying (c...
arxiv
@article{shamai2007cooperative, title={Cooperative Multi-Cell Networks: Impact of Limited-Capacity Backhaul and Inter-Users Links}, author={Shlomo Shamai, Oren Somekh, Osvaldo Simeone, Amichai Sanderovich, Benjamin M. Zaidel, H. Vincent Poor}, journal={In the Proceedings of the Joint Workshop on Coding ...
shamai2007cooperative
arxiv-1450
0710.3901
A recursive linear time modular decomposition algorithm via LexBFS
<|reference_start|>A recursive linear time modular decomposition algorithm via LexBFS: A module of a graph G is a set of vertices that have the same set of neighbours outside. Modules of a graphs form a so-called partitive family and thereby can be represented by a unique tree MD(G), called the modular decomposition tr...
arxiv
@article{corneil2007a, title={A recursive linear time modular decomposition algorithm via LexBFS}, author={Derek Corneil and Michel Habib and Christophe Paul and Marc Tedder}, journal={arXiv preprint arXiv:0710.3901}, year={2007}, archivePrefix={arXiv}, eprint={0710.3901}, primaryClass={cs.D...
corneil2007a
arxiv-1451
0710.3916
Optimized Design of Survivable MPLS over Optical Transport Networks Optical Switching and Networking
<|reference_start|>Optimized Design of Survivable MPLS over Optical Transport Networks Optical Switching and Networking: In this paper we study different options for the survivability implementation in MPLS over Optical Transport Networks in terms of network resource usage and configuration cost. We investigate two app...
arxiv
@article{bigos2007optimized, title={Optimized Design of Survivable MPLS over Optical Transport Networks. Optical Switching and Networking}, author={Wojtek Bigos (IRISA), St'ephane Gosselin (IRISA), Bernard Cousin (IRISA), Morgane Le Foll (IRISA), Hisao Nakajima (IRISA)}, journal={Optical Switching and N...
bigos2007optimized
arxiv-1452
0710.3917
Heuristic Solution to Protect Communications in WDM Networks using P-cycles
<|reference_start|>Heuristic Solution to Protect Communications in WDM Networks using P-cycles: Optical WDM mesh networks are able to transport huge amount of information. The use of such technology however poses the problem of protection against failures such as fibre cuts. One of the principal methods for link protec...
arxiv
@article{drid2007heuristic, title={Heuristic Solution to Protect Communications in WDM Networks using P-cycles}, author={Hamza Drid (IRISA), Bernard Cousin (IRISA), Miklos Molnar (IRISA)}, journal={Workshop on Traffic Engineering, Protection and Restoration for Futur Generation Internet, Oslo : Norv\`eg...
drid2007heuristic
arxiv-1453
0710.3918
Dependable k-coverage algorithms for sensor networks
<|reference_start|>Dependable k-coverage algorithms for sensor networks: Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same time high sensor redundancy offers the possibility of increasing network ...
arxiv
@article{gyula2007dependable, title={Dependable k-coverage algorithms for sensor networks}, author={Simon Gyula (IRISA), Miklos Molnar (IRISA), Laszlo Gonczy (IRISA), Bernard Cousin (IRISA)}, journal={Dans Instrumentation and Measurement Technology Conference Proceedings - IEEE Instrumentation and Measu...
gyula2007dependable
arxiv-1454
0710.3928
Message passing for the coloring problem: Gallager meets Alon and Kahale
<|reference_start|>Message passing for the coloring problem: Gallager meets Alon and Kahale: Message passing algorithms are popular in many combinatorial optimization problems. For example, experimental results show that {\em survey propagation} (a certain message passing algorithm) is effective in finding proper $k$-c...
arxiv
@article{ben-shimon2007message, title={Message passing for the coloring problem: Gallager meets Alon and Kahale}, author={Sonny Ben-Shimon and Dan Vilenchik}, journal={DMTCS Proceedings of the 13th Annual Conference on Analysis of Algorithms (AofA'07), Juan-les-pins, France, 2007. pp. 217--226.}, year...
ben-shimon2007message
arxiv-1455
0710.3955
On the Behavior of the Distributed Coordination Function of IEEE 80211 with Multirate Capability under General Transmission Conditions
<|reference_start|>On the Behavior of the Distributed Coordination Function of IEEE 80211 with Multirate Capability under General Transmission Conditions: The aim of this paper is threefold. First, it presents a multi-dimensional Markovian state transition model characterizing the behavior of the IEEE 802.11 protocol a...
arxiv
@article{daneshgaran2007on, title={On the Behavior of the Distributed Coordination Function of IEEE 802.11 with Multirate Capability under General Transmission Conditions}, author={F. Daneshgaran, Massimiliano Laddomada, F. Mesiti, M. Mondin}, journal={arXiv preprint arXiv:0710.3955}, year={2007}, ...
daneshgaran2007on
arxiv-1456
0710.3961
On a New Type of Information Processing for Efficient Management of Complex Systems
<|reference_start|>On a New Type of Information Processing for Efficient Management of Complex Systems: It is a challenge to manage complex systems efficiently without confronting NP-hard problems. To address the situation we suggest to use self-organization processes of prime integer relations for information processi...
arxiv
@article{korotkikh2007on, title={On a New Type of Information Processing for Efficient Management of Complex Systems}, author={Victor Korotkikh and Galina Korotkikh}, journal={arXiv preprint arXiv:0710.3961}, year={2007}, archivePrefix={arXiv}, eprint={0710.3961}, primaryClass={cs.CC} }
korotkikh2007on
arxiv-1457
0710.3974
Distributed source coding in dense sensor networks
<|reference_start|>Distributed source coding in dense sensor networks: We study the problem of the reconstruction of a Gaussian field defined in [0,1] using N sensors deployed at regular intervals. The goal is to quantify the total data rate required for the reconstruction of the field with a given mean square distorti...
arxiv
@article{kashyap2007distributed, title={Distributed source coding in dense sensor networks}, author={Akshay Kashyap, Luis Alfonso Lastras-Monta~no, Cathy Xia, Zhen Liu}, journal={arXiv preprint arXiv:0710.3974}, year={2007}, archivePrefix={arXiv}, eprint={0710.3974}, primaryClass={cs.IT math...
kashyap2007distributed
arxiv-1458
0710.3979
Toward Trusted Sharing of Network Packet Traces Using Anonymization: Single-Field Privacy/Analysis Tradeoffs
<|reference_start|>Toward Trusted Sharing of Network Packet Traces Using Anonymization: Single-Field Privacy/Analysis Tradeoffs: Network data needs to be shared for distributed security analysis. Anonymization of network data for sharing sets up a fundamental tradeoff between privacy protection versus security analysis...
arxiv
@article{yurcik2007toward, title={Toward Trusted Sharing of Network Packet Traces Using Anonymization: Single-Field Privacy/Analysis Tradeoffs}, author={William Yurcik, Clay Woolam, Greg Hellings, Latifur Khan, Bhavani Thuraisingham}, journal={arXiv preprint arXiv:0710.3979}, year={2007}, archiv...
yurcik2007toward
arxiv-1459
0710.4031
On the critical exponent of generalized Thue-Morse words
<|reference_start|>On the critical exponent of generalized Thue-Morse words: For certain generalized Thue-Morse words t, we compute the "critical exponent", i.e., the supremum of the set of rational numbers that are exponents of powers in t, and determine exactly the occurrences of powers realizing it.<|reference_end|>
arxiv
@article{blondin-massé2007on, title={On the critical exponent of generalized Thue-Morse words}, author={Alexandre Blondin-Mass'e, Srecko Brlek, Amy Glen, S'ebastien Labb'e}, journal={Discrete Mathematics and Theoretical Computer Science 9 (2007) 293-304}, year={2007}, archivePrefix={arXiv}, ep...
blondin-massé2007on
arxiv-1460
0710.4046
Bit-interleaved coded modulation in the wideband regime
<|reference_start|>Bit-interleaved coded modulation in the wideband regime: The wideband regime of bit-interleaved coded modulation (BICM) in Gaussian channels is studied. The Taylor expansion of the coded modulation capacity for generic signal constellations at low signal-to-noise ratio (SNR) is derived and used to de...
arxiv
@article{martinez2007bit-interleaved, title={Bit-interleaved coded modulation in the wideband regime}, author={Alfonso Martinez, Albert Guillen i Fabregas, Giuseppe Caire, and Frans Willems}, journal={arXiv preprint arXiv:0710.4046}, year={2007}, archivePrefix={arXiv}, eprint={0710.4046}, ...
martinez2007bit-interleaved
arxiv-1461
0710.4051
On the capacity achieving covariance matrix for Rician MIMO channels: an asymptotic approach
<|reference_start|>On the capacity achieving covariance matrix for Rician MIMO channels: an asymptotic approach: The capacity-achieving input covariance matrices for coherent block-fading correlated MIMO Rician channels are determined. In this case, no closed-form expressions for the eigenvectors of the optimum input c...
arxiv
@article{dumont2007on, title={On the capacity achieving covariance matrix for Rician MIMO channels: an asymptotic approach}, author={Julien Dumont (IGM-LabInfo), W. Hachem (LTCI), Samson Lasaulce, Philippe Loubaton (IGM-LabInfo), Jamal Najim (LTCI)}, journal={IEEE Transactions on Information Theory 56, ...
dumont2007on
arxiv-1462
0710.4076
Some information-theoretic computations related to the distribution of prime numbers
<|reference_start|>Some information-theoretic computations related to the distribution of prime numbers: We illustrate how elementary information-theoretic ideas may be employed to provide proofs for well-known, nontrivial results in number theory. Specifically, we give an elementary and fairly short proof of the follo...
arxiv
@article{kontoyiannis2007some, title={Some information-theoretic computations related to the distribution of prime numbers}, author={Ioannis Kontoyiannis}, journal={arXiv preprint arXiv:0710.4076}, year={2007}, archivePrefix={arXiv}, eprint={0710.4076}, primaryClass={cs.IT math.IT math.NT ...
kontoyiannis2007some
arxiv-1463
0710.4105
A Note on the Secrecy Capacity of the Multi-antenna Wiretap Channel
<|reference_start|>A Note on the Secrecy Capacity of the Multi-antenna Wiretap Channel: Recently, the secrecy capacity of the multi-antenna wiretap channel was characterized by Khisti and Wornell [1] using a Sato-like argument. This note presents an alternative characterization using a channel enhancement argument. Thi...
arxiv
@article{liu2007a, title={A Note on the Secrecy Capacity of the Multi-antenna Wiretap Channel}, author={Tie Liu and Shlomo Shamai (Shitz)}, journal={arXiv preprint arXiv:0710.4105}, year={2007}, archivePrefix={arXiv}, eprint={0710.4105}, primaryClass={cs.IT math.IT} }
liu2007a
arxiv-1464
0710.4117
From the entropy to the statistical structure of spike trains
<|reference_start|>From the entropy to the statistical structure of spike trains: We use statistical estimates of the entropy rate of spike train data in order to make inferences about the underlying structure of the spike train itself. We first examine a number of different parametric and nonparametric estimators (som...
arxiv
@article{gao2007from, title={From the entropy to the statistical structure of spike trains}, author={Yun Gao, Ioannis Kontoyiannis and Elie Bienenstock}, journal={In Proceedings of the 2006 International Symposium on Information Theory, Seattle, WA, July 2006}, year={2007}, archivePrefix={arXiv}, ...
gao2007from
arxiv-1465
0710.4180
A quick search method for audio signals based on a piecewise linear representation of feature trajectories
<|reference_start|>A quick search method for audio signals based on a piecewise linear representation of feature trajectories: This paper presents a new method for a quick similarity-based search through long unlabeled audio streams to detect and locate audio clips provided by users. The method involves feature-dimensi...
arxiv
@article{kimura2007a, title={A quick search method for audio signals based on a piecewise linear representation of feature trajectories}, author={Akisato Kimura, Kunio Kashino, Takayuki Kurozumi, Hiroshi Murase}, journal={IEEE Transactions on Audio, Speech and Language Processing, Vol.16, No.2, pp.396-4...
kimura2007a
arxiv-1466
0710.4182
Beyond Feedforward Models Trained by Backpropagation: a Practical Training Tool for a More Efficient Universal Approximator
<|reference_start|>Beyond Feedforward Models Trained by Backpropagation: a Practical Training Tool for a More Efficient Universal Approximator: Cellular Simultaneous Recurrent Neural Network (SRN) has been shown to be a function approximator more powerful than the MLP. This means that the complexity of MLP would be pro...
arxiv
@article{ilin2007beyond, title={Beyond Feedforward Models Trained by Backpropagation: a Practical Training Tool for a More Efficient Universal Approximator}, author={Roman Ilin, Robert Kozma, Paul J. Werbos}, journal={arXiv preprint arXiv:0710.4182}, year={2007}, archivePrefix={arXiv}, eprint=...
ilin2007beyond
arxiv-1467
0710.4187
Universal coding for correlated sources with complementary delivery
<|reference_start|>Universal coding for correlated sources with complementary delivery: This paper deals with a universal coding problem for a certain kind of multiterminal source coding system that we call the complementary delivery coding system. In this system, messages from two correlated sources are jointly encode...
arxiv
@article{kimura2007universal, title={Universal coding for correlated sources with complementary delivery}, author={Akisato Kimura, Tomohiko Uyematsu, Shigeaki Kuzuoka}, journal={IEICE Transactions on Fundamentals, Vol.E90-A, No.9, pp.1840-1847, September 2007}, year={2007}, doi={10.1093/ietfec/e90...
kimura2007universal
arxiv-1468
0710.4231
Analyzing covert social network foundation behind terrorism disaster
<|reference_start|>Analyzing covert social network foundation behind terrorism disaster: This paper addresses a method to analyze the covert social network foundation hidden behind the terrorism disaster. It is to solve a node discovery problem, which means to discover a node, which functions relevantly in a social net...
arxiv
@article{maeno2007analyzing, title={Analyzing covert social network foundation behind terrorism disaster}, author={Yoshiharu Maeno, and Yukio Ohsawa}, journal={International Journal of Services Sciences Vol.2, pp.125-141 (2009)}, year={2007}, doi={10.1504/IJSSCI.2009.024936}, archivePrefix={ar...
maeno2007analyzing
arxiv-1469
0710.4255
Analysis of a Mixed Strategy for Multiple Relay Networks
<|reference_start|>Analysis of a Mixed Strategy for Multiple Relay Networks: In their landmark paper Cover and El Gamal proposed different coding strategies for the relay channel with a single relay supporting a communication pair. These strategies are the decode-and-forward and compress-and-forward approach, as well a...
arxiv
@article{rost2007analysis, title={Analysis of a Mixed Strategy for Multiple Relay Networks}, author={P. Rost and G. Fettweis}, journal={arXiv preprint arXiv:0710.4255}, year={2007}, archivePrefix={arXiv}, eprint={0710.4255}, primaryClass={cs.IT math.IT} }
rost2007analysis
arxiv-1470
0710.4261
Survivable MPLS Over Optical Transport Networks: Cost and Resource Usage Analysis
<|reference_start|>Survivable MPLS Over Optical Transport Networks: Cost and Resource Usage Analysis: In this paper we study different options for the survivability implementation in MPLS over Optical Transport Networks (OTN) in terms of network resource usage and configuration cost. We investigate two approaches to th...
arxiv
@article{bigos2007survivable, title={Survivable MPLS Over Optical Transport Networks: Cost and Resource Usage Analysis}, author={Wojtek Bigos (FT R&D), Bernard Cousin (IRISA), St'ephane Gosselin (FT R&D), Morgane Le Foll (FT R&D), Hisao Nakajima (FT R&D)}, journal={IEEE Journal on Selected Areas in Comm...
bigos2007survivable
arxiv-1471
0710.4272
An approximation trichotomy for Boolean #CSP
<|reference_start|>An approximation trichotomy for Boolean #CSP: We give a trichotomy theorem for the complexity of approximately counting the number of satisfying assignments of a Boolean CSP instance. Such problems are parameterised by a constraint language specifying the relations that may be used in constraints. If...
arxiv
@article{dyer2007an, title={An approximation trichotomy for Boolean #CSP}, author={Martin Dyer, Leslie Ann Goldberg and Mark Jerrum}, journal={arXiv preprint arXiv:0710.4272}, year={2007}, archivePrefix={arXiv}, eprint={0710.4272}, primaryClass={cs.CC} }
dyer2007an
arxiv-1472
0710.4318
Differential invariants of a Lie group action: syzygies on a generating set
<|reference_start|>Differential invariants of a Lie group action: syzygies on a generating set: Given a group action, known by its infinitesimal generators, we exhibit a complete set of syzygies on a generating set of differential invariants. For that we elaborate on the reinterpretation of Cartan's moving frame by Fel...
arxiv
@article{hubert2007differential, title={Differential invariants of a Lie group action: syzygies on a generating set}, author={Evelyne Hubert}, journal={arXiv preprint arXiv:0710.4318}, year={2007}, doi={10.1016/j.jsc.2008.08.003}, archivePrefix={arXiv}, eprint={0710.4318}, primaryClass...
hubert2007differential
arxiv-1473
0710.4410
A Multi-level Blocking Distinct Degree Factorization Algorithm
<|reference_start|>A Multi-level Blocking Distinct Degree Factorization Algorithm: We give a new algorithm for performing the distinct-degree factorization of a polynomial P(x) over GF(2), using a multi-level blocking strategy. The coarsest level of blocking replaces GCD computations by multiplications, as suggested by...
arxiv
@article{brent2007a, title={A Multi-level Blocking Distinct Degree Factorization Algorithm}, author={Richard Brent, Paul Zimmermann (INRIA Lorraine - LORIA)}, journal={Contemporary Mathematics 461 (2008) 47-58}, year={2007}, number={INRIA Tech. Report RR-6331, Oct. 2007}, archivePrefix={arXiv}, ...
brent2007a
arxiv-1474
0710.4486
Non-linear estimation is easy
<|reference_start|>Non-linear estimation is easy: Non-linear state estimation and some related topics, like parametric estimation, fault diagnosis, and perturbation attenuation, are tackled here via a new methodology in numerical differentiation. The corresponding basic system theoretic definitions and properties are p...
arxiv
@article{fliess2007non-linear, title={Non-linear estimation is easy}, author={Michel Fliess (INRIA Futurs), C'edric Join (INRIA Futurs, CRAN), Hebertt Sira-Ramirez}, journal={Int. J. Modelling Identification and Control 4, 1 (2008) 12-27}, year={2007}, doi={10.1504/IJMIC.2008.020996}, archiveP...
fliess2007non-linear
arxiv-1475
0710.4499
Remarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language
<|reference_start|>Remarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language: In 2002 Jurdzinski and Lorys settled a long-standing conjecture that palindromes are not a Church-Rosser language. Their proof required a sophisticated theory about computation graphs of 2-stack automata. We pre...
arxiv
@article{dunlaing2007remarks, title={Remarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language}, author={Colm O. Dunlaing and Natalie Schluter}, journal={arXiv preprint arXiv:0710.4499}, year={2007}, number={TCDMATH 07-10}, archivePrefix={arXiv}, eprint={0710...
dunlaing2007remarks
arxiv-1476
0710.4508
A Numerical Algorithm for Zero Counting I: Complexity and Accuracy
<|reference_start|>A Numerical Algorithm for Zero Counting I: Complexity and Accuracy: We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(n D kappa(f)) iterations where n is the number of polynomials (as well as the dimension of the ambient sp...
arxiv
@article{cucker2007a, title={A Numerical Algorithm for Zero Counting. I: Complexity and Accuracy}, author={Felipe Cucker, Teresa Krick, Gregorio Malajovich and Mario Wschebor}, journal={Journal of Complexity 24 Issues 5-6, pp 582-605 (Oct-Dec 2008)}, year={2007}, doi={10.1016/j.jco.2008.03.001}, ...
cucker2007a
arxiv-1477
0710.4516
The predictability of letters in written english
<|reference_start|>The predictability of letters in written english: We show that the predictability of letters in written English texts depends strongly on their position in the word. The first letters are usually the least easy to predict. This agrees with the intuitive notion that words are well defined subunits in ...
arxiv
@article{schürmann2007the, title={The predictability of letters in written english}, author={Thomas Sch"urmann and Peter Grassberger}, journal={Fractals, Vol. 4, No. 1 (1996) 1-5}, year={2007}, doi={10.1142/S0218348X96000029}, archivePrefix={arXiv}, eprint={0710.4516}, primaryClass={phys...
schürmann2007the
arxiv-1478
0710.4596
Discrete differential geometry of tetrahedrons and encoding of local protein structure
<|reference_start|>Discrete differential geometry of tetrahedrons and encoding of local protein structure: Local protein structure analysis is informative to protein structure analysis and has been used successfully in protein structure prediction and others. Proteins have recurring structural features, such as helix c...
arxiv
@article{morikawa2007discrete, title={Discrete differential geometry of tetrahedrons and encoding of local protein structure}, author={Naoto Morikawa}, journal={arXiv preprint arXiv:0710.4596}, year={2007}, archivePrefix={arXiv}, eprint={0710.4596}, primaryClass={math.CO cs.CG math.MG q-bi...
morikawa2007discrete
arxiv-1479
0710.4629
Space-Efficient Bounded Model Checking
<|reference_start|>Space-Efficient Bounded Model Checking: Current algorithms for bounded model checking use SAT methods for checking satisfiability of Boolean formulae. These methods suffer from the potential memory explosion problem. Methods based on the validity of Quantified Boolean Formulae (QBF) allow an exponent...
arxiv
@article{katz2007space-efficient, title={Space-Efficient Bounded Model Checking}, author={Jacob Katz, Ziyad Hanna, Nachum Dershowitz}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)}, year={2007}, doi={10.1109/DATE.2005.276}, archivePrefix={arXiv}, ...
katz2007space-efficient
arxiv-1480
0710.4630
CAFFEINE: Template-Free Symbolic Model Generation of Analog Circuits via Canonical Form Functions and Genetic Programming
<|reference_start|>CAFFEINE: Template-Free Symbolic Model Generation of Analog Circuits via Canonical Form Functions and Genetic Programming: This paper presents a method to automatically generate compact symbolic performance models of analog circuits with no prior specification of an equation template. The approach ta...
arxiv
@article{mcconaghy2007caffeine:, title={CAFFEINE: Template-Free Symbolic Model Generation of Analog Circuits via Canonical Form Functions and Genetic Programming}, author={Trent Mcconaghy, Tom Eeckelaert, Georges Gielen}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne ...
mcconaghy2007caffeine:
arxiv-1481
0710.4632
Hardware Support for Arbitrarily Complex Loop Structures in Embedded Applications
<|reference_start|>Hardware Support for Arbitrarily Complex Loop Structures in Embedded Applications: In this paper, the program control unit of an embedded RISC processor is enhanced with a novel zero-overhead loop controller (ZOLC) supporting arbitrary loop structures with multiple-entry/exit nodes. The ZOLC has been...
arxiv
@article{kavvadias2007hardware, title={Hardware Support for Arbitrarily Complex Loop Structures in Embedded Applications}, author={Nikolaos Kavvadias, Spiridon Nikolaidis}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)}, year={2007}, archivePrefix={arXi...
kavvadias2007hardware
arxiv-1482
0710.4633
Nano-Sim: A Step Wise Equivalent Conductance based Statistical Simulator for Nanotechnology Circuit Design
<|reference_start|>Nano-Sim: A Step Wise Equivalent Conductance based Statistical Simulator for Nanotechnology Circuit Design: New nanotechnology based devices are replacing CMOS devices to overcome CMOS technology's scaling limitations. However, many such devices exhibit non-monotonic I-V characteristics and uncertain...
arxiv
@article{sukhwani2007nano-sim:, title={Nano-Sim: A Step Wise Equivalent Conductance based Statistical Simulator for Nanotechnology Circuit Design}, author={Bharat Sukhwani, Uday Padmanabhan, Janet M. Wang}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)}, ye...
sukhwani2007nano-sim:
arxiv-1483
0710.4634
A Probabilistic Collocation Method Based Statistical Gate Delay Model Considering Process Variations and Multiple Input Switching
<|reference_start|>A Probabilistic Collocation Method Based Statistical Gate Delay Model Considering Process Variations and Multiple Input Switching: Since the advent of new nanotechnologies, the variability of gate delay due to process variations has become a major concern. This paper proposes a new gate delay model t...
arxiv
@article{kumar2007a, title={A Probabilistic Collocation Method Based Statistical Gate Delay Model Considering Process Variations and Multiple Input Switching}, author={Y. Satish Kumar, Jun Li, Claudio Talarico, Janet Wang}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagn...
kumar2007a
arxiv-1484
0710.4635
OS Debugging Method Using a Lightweight Virtual Machine Monitor
<|reference_start|>OS Debugging Method Using a Lightweight Virtual Machine Monitor: Demands for implementing original OSs that can achieve high I/O performance on PC/AT compatible hardware have recently been increasing, but conventional OS debugging environments have not been able to simultaneously assure their stabili...
arxiv
@article{takeuchi2007os, title={OS Debugging Method Using a Lightweight Virtual Machine Monitor}, author={Tadashi Takeuchi}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)}, year={2007}, archivePrefix={arXiv}, eprint={0710.4635}, primaryClass={cs.O...
takeuchi2007os
arxiv-1485
0710.4636
Why Systems-on-Chip Needs More UML like a Hole in the Head
<|reference_start|>Why Systems-on-Chip Needs More UML like a Hole in the Head: Let's be clear from the outset: SoC can most certainly make use of UML; SoC just doesn't need more UML, or even all of it. The advent of model mappings, coupled with marks that indicate which mapping rule to apply, enable a major simplificat...
arxiv
@article{mellor2007why, title={Why Systems-on-Chip Needs More UML like a Hole in the Head}, author={Stephen J. Mellor, John R. Wolfe, Campbell Mccausland}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)}, year={2007}, archivePrefix={arXiv}, eprint={071...
mellor2007why
arxiv-1486
0710.4637
The Accidental Detection Index as a Fault Ordering Heuristic for Full-Scan Circuits
<|reference_start|>The Accidental Detection Index as a Fault Ordering Heuristic for Full-Scan Circuits: We investigate a new fault ordering heuristic for test generation in full-scan circuits. The heuristic is referred to as the accidental detection index. It associates a value ADI (f) with every circuit fault f. The h...
arxiv
@article{pomeranz2007the, title={The Accidental Detection Index as a Fault Ordering Heuristic for Full-Scan Circuits}, author={Irith Pomeranz, Sudhakar M. Reddy}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)}, year={2007}, archivePrefix={arXiv}, ep...
pomeranz2007the
arxiv-1487
0710.4638
Buffer Insertion for Bridges and Optimal Buffer Sizing for Communication Sub-System of Systems-on-Chip
<|reference_start|>Buffer Insertion for Bridges and Optimal Buffer Sizing for Communication Sub-System of Systems-on-Chip: We have presented an optimal buffer sizing and buffer insertion methodology which uses stochastic models of the architecture and Continuous Time Markov Decision Processes CTMDPs. Such a methodology...
arxiv
@article{kallakuri2007buffer, title={Buffer Insertion for Bridges and Optimal Buffer Sizing for Communication Sub-System of Systems-on-Chip}, author={Sankalp S. Kallakuri, Alex Doboli, Eugene A. Feinberg}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)}, yea...
kallakuri2007buffer
arxiv-1488
0710.4639
Modeling the Non-Linear Behavior of Library Cells for an Accurate Static Noise Analysis
<|reference_start|>Modeling the Non-Linear Behavior of Library Cells for an Accurate Static Noise Analysis: In signal integrity analysis, the joint effect of propagated noise through library cells, and of the noise injected on a quiet net by neighboring switching nets through coupling capacitances, must be considered i...
arxiv
@article{forzan2007modeling, title={Modeling the Non-Linear Behavior of Library Cells for an Accurate Static Noise Analysis}, author={Cristiano Forzan, Davide Pandini}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)}, year={2007}, archivePrefix={arXiv}, ...
forzan2007modeling
arxiv-1489
0710.4640
FORAY-GEN: Automatic Generation of Affine Functions for Memory Optimizations
<|reference_start|>FORAY-GEN: Automatic Generation of Affine Functions for Memory Optimizations: In today's embedded applications a significant portion of energy is spent in the memory subsystem. Several approaches have been proposed to minimize this energy, including the use of scratch pad memories, with many based on...
arxiv
@article{issenin2007foray-gen:, title={FORAY-GEN: Automatic Generation of Affine Functions for Memory Optimizations}, author={Ilya Issenin, Nikil Dutt}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)}, year={2007}, archivePrefix={arXiv}, eprint={0710...
issenin2007foray-gen:
arxiv-1490
0710.4641
UML 20 - Overview and Perspectives in SoC Design
<|reference_start|>UML 20 - Overview and Perspectives in SoC Design: The design productivity gap requires more efficient design methods. Software systems have faced the same challenge and seem to have mastered it with the introduction of more abstract design methods. The UML has become the standard for software systems...
arxiv
@article{schattkowsky2007uml, title={UML 2.0 - Overview and Perspectives in SoC Design}, author={Tim Schattkowsky}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)}, year={2007}, archivePrefix={arXiv}, eprint={0710.4641}, primaryClass={cs.SE} }
schattkowsky2007uml
arxiv-1491
0710.4642
Modeling and Propagation of Noisy Waveforms in Static Timing Analysis
<|reference_start|>Modeling and Propagation of Noisy Waveforms in Static Timing Analysis: A technique based on the sensitivity of the output to input waveform is presented for accurate propagation of delay information through a gate for the purpose of static timing analysis (STA) in the presence of noise. Conventional ...
arxiv
@article{nazarian2007modeling, title={Modeling and Propagation of Noisy Waveforms in Static Timing Analysis}, author={Shahin Nazarian, Massoud Pedram, Emre Tuncer, Tao Lin, Amir H. Ajami}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)}, year={2007}, doi={...
nazarian2007modeling
arxiv-1492
0710.4643
Generic Pipelined Processor Modeling and High Performance Cycle-Accurate Simulator Generation
<|reference_start|>Generic Pipelined Processor Modeling and High Performance Cycle-Accurate Simulator Generation: Detailed modeling of processors and high performance cycle-accurate simulators are essential for today's hardware and software design. These problems are challenging enough by themselves and have seen many ...
arxiv
@article{reshadi2007generic, title={Generic Pipelined Processor Modeling and High Performance Cycle-Accurate Simulator Generation}, author={Mehrdad Reshadi, Nikil Dutt}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)}, year={2007}, doi={10.1109/DATE.2005...
reshadi2007generic
arxiv-1493
0710.4644
Cycle Accurate Binary Translation for Simulation Acceleration in Rapid Prototyping of SoCs
<|reference_start|>Cycle Accurate Binary Translation for Simulation Acceleration in Rapid Prototyping of SoCs: In this paper, the application of a cycle accurate binary translator for rapid prototyping of SoCs will be presented. This translator generates code to run on a rapid prototyping system consisting of a VLIW pr...
arxiv
@article{schnerr2007cycle, title={Cycle Accurate Binary Translation for Simulation Acceleration in Rapid Prototyping of SoCs}, author={Jurgen Schnerr, Oliver Bringmann, Wolfgang Rosenstiel}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)}, year={2007}, a...
schnerr2007cycle
arxiv-1494
0710.4645
At-Speed Logic BIST for IP Cores
<|reference_start|>At-Speed Logic BIST for IP Cores: This paper describes a flexible logic BIST scheme that features high fault coverage achieved by fault-simulation guided test point insertion, real at-speed test capability for multi-clock designs without clock frequency manipulation, and easy physical implementation ...
arxiv
@article{cheon2007at-speed, title={At-Speed Logic BIST for IP Cores}, author={B. Cheon, E. Lee, L.-T. Wang, X. Wen, P. Hsu, J. Cho, J. Park, H. Chao, S. Wu}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)}, year={2007}, archivePrefix={arXiv}, eprint=...
cheon2007at-speed
arxiv-1495
0710.4646
Fast Dynamic Memory Integration in Co-Simulation Frameworks for Multiprocessor System on-Chip
<|reference_start|>Fast Dynamic Memory Integration in Co-Simulation Frameworks for Multiprocessor System on-Chip: In this paper is proposed a technique to integrate and simulate a dynamic memory in a multiprocessor framework based on C/C++/SystemC. Using host machine's memory management capabilities, dynamic data proce...
arxiv
@article{villa2007fast, title={Fast Dynamic Memory Integration in Co-Simulation Frameworks for Multiprocessor System on-Chip}, author={O. Villa, P. Schaumont, I. Verbauwhede, M. Monchiero, G. Palermo}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)}, year={2...
villa2007fast
arxiv-1496
0710.4649
Stochastic Power Grid Analysis Considering Process Variations
<|reference_start|>Stochastic Power Grid Analysis Considering Process Variations: In this paper, we investigate the impact of interconnect and device process variations on voltage fluctuations in power grids. We consider random variations in the power grid's electrical parameters as spatial stochastic processes and pro...
arxiv
@article{ghanta2007stochastic, title={Stochastic Power Grid Analysis Considering Process Variations}, author={Praveen Ghanta, Sarma Vrudhula, Rajendran Panda, Janet Wang}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)}, year={2007}, archivePrefix={arXiv},...
ghanta2007stochastic
arxiv-1497
0710.4652
Locality-Aware Process Scheduling for Embedded MPSoCs
<|reference_start|>Locality-Aware Process Scheduling for Embedded MPSoCs: Utilizing on-chip caches in embedded multiprocessor-system-on-a-chip (MPSoC) based systems is critical from both performance and power perspectives. While most of the prior work that targets at optimizing cache behavior are performed at hardware ...
arxiv
@article{kandemir2007locality-aware, title={Locality-Aware Process Scheduling for Embedded MPSoCs}, author={Mahmut Kandemir, Guilin Chen}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)}, year={2007}, archivePrefix={arXiv}, eprint={0710.4652}, prim...
kandemir2007locality-aware
arxiv-1498
0710.4653
Simultaneous Reduction of Dynamic and Static Power in Scan Structures
<|reference_start|>Simultaneous Reduction of Dynamic and Static Power in Scan Structures: Power dissipation during test is a major challenge in testing integrated circuits. Dynamic power has been the dominant part of power dissipation in CMOS circuits, however, in future technologies the static portion of power dissipa...
arxiv
@article{sharifi2007simultaneous, title={Simultaneous Reduction of Dynamic and Static Power in Scan Structures}, author={Shervin Sharifi, Javid Jaffari, Mohammad Hosseinabady, Ali Afzali-Kusha, Zainalabedin Navabi}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)...
sharifi2007simultaneous
arxiv-1499
0710.4654
Modeling Interconnect Variability Using Efficient Parametric Model Order Reduction
<|reference_start|>Modeling Interconnect Variability Using Efficient Parametric Model Order Reduction: Assessing IC manufacturing process fluctuations and their impacts on IC interconnect performance has become unavoidable for modern DSM designs. However, the construction of parametric interconnect models is often hamp...
arxiv
@article{li2007modeling, title={Modeling Interconnect Variability Using Efficient Parametric Model Order Reduction}, author={Peng Li, Frank Liu, Xin Li, Lawrence T. Pileggi, Sani R. Nassif}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)}, year={2007}, a...
li2007modeling
arxiv-1500
0710.4655
A Fast Diagnosis Scheme for Distributed Small Embedded SRAMs
<|reference_start|>A Fast Diagnosis Scheme for Distributed Small Embedded SRAMs: This paper proposes a diagnosis scheme aimed at reducing diagnosis time of distributed small embedded SRAMs (e-SRAMs). This scheme improves the one proposed in [A parallel built-in self-diagnostic method for embedded memory buffers, A para...
arxiv
@article{wang2007a, title={A Fast Diagnosis Scheme for Distributed Small Embedded SRAMs}, author={Baosheng Wang, Yuejian Wu, Andre Ivanov}, journal={Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)}, year={2007}, archivePrefix={arXiv}, eprint={0710.4655}, pri...
wang2007a