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-5001 | 0809.4804 | On the Secure Degrees of Freedom of Wireless X Networks | <|reference_start|>On the Secure Degrees of Freedom of Wireless X Networks: Previous work showed that the X network with M transmitters, N receivers has MN/(M+N-1) degrees of freedom. In this work we study the degrees of freedom of the X network with secrecy constraints, i.e. the X network where some/all messages are confidential. We consider the $M \times N$ network where all messages are secured and show that N(M-1)/(M+N-1) degrees of freedom can be achieved. Secondly, we show that if messages from only M-1 transmitters are confidential, then MN/(M+N-1) degrees of freedom can be achieved meaning that there is no loss of degrees of freedom because of secrecy constraints. We also consider the achievable secure degrees of freedom under a more conservative secrecy constraint. We require that messages from any subset of transmitters are secure even if other transmitters are compromised, i.e., messages from the compromised transmitter are revealed to the unintended receivers. We also study the achievable secure degrees of freedom of the K user Gaussian interference channel under two different secrecy constraints where 1/2 secure degrees of freedom per message can be achieved. The achievable scheme in all cases is based on random binning combined with interference alignment.<|reference_end|> | arxiv | @article{gou2008on,
title={On the Secure Degrees of Freedom of Wireless X Networks},
author={Tiangao Gou, Syed A. Jafar},
journal={arXiv preprint arXiv:0809.4804},
year={2008},
archivePrefix={arXiv},
eprint={0809.4804},
primaryClass={cs.IT math.IT}
} | gou2008on |
arxiv-5002 | 0809.4807 | Secure Wireless Communications via Cooperation | <|reference_start|>Secure Wireless Communications via Cooperation: The feasibility of physical-layer-based security approaches for wireless communications in the presence of one or more eavesdroppers is hampered by channel conditions. In this paper, cooperation is investigated as an approach to overcome this problem and improve the performance of secure communications. In particular, a decode-and-forward (DF) based cooperative protocol is considered, and the objective is to design the system for secrecy capacity maximization or transmit power minimization. System design for the DF-based cooperative protocol is first studied by assuming the availability of global channel state information (CSI). For the case of one eavesdropper, an iterative scheme is proposed to obtain the optimal solution for the problem of transmit power minimization. For the case of multiple eavesdroppers, the problem of secrecy capacity maximization or transmit power minimization is in general intractable. Suboptimal system design is proposed by adding an additional constraint, i.e., the complete nulling of signals at all eavesdroppers, which yields simple closed-form solutions for the aforementioned two problems. Then, the impact of imperfect CSI of eavesdroppers on system design is studied, in which the ergodic secrecy capacity is of interest.<|reference_end|> | arxiv | @article{dong2008secure,
title={Secure Wireless Communications via Cooperation},
author={Lun Dong, Zhu Han, Athina P. Petropulu, H. Vincent Poor},
journal={arXiv preprint arXiv:0809.4807},
year={2008},
archivePrefix={arXiv},
eprint={0809.4807},
primaryClass={cs.IT math.IT}
} | dong2008secure |
arxiv-5003 | 0809.4812 | Control software analysis, Part I Open-loop properties | <|reference_start|>Control software analysis, Part I Open-loop properties: As the digital world enters further into everyday life, questions are raised about the increasing challenges brought by the interaction of real-time software with physical devices. Many accidents and incidents encountered in areas as diverse as medical systems, transportation systems or weapon systems are ultimately attributed to "software failures". Since real-time software that interacts with physical systems might as well be called control software, the long litany of accidents due to real-time software failures might be taken as an equally long list of opportunities for control systems engineering. In this paper, we are interested only in run-time errors in those pieces of software that are a direct implementation of control system specifications: For well-defined and well-understood control architectures such as those present in standard textbooks on digital control systems, the current state of theoretical computer science is well-equipped enough to address and analyze control algorithms. It appears that a central element to these analyses is Lyapunov stability theory, which translate into invariant theory in computer implementations.<|reference_end|> | arxiv | @article{feron2008control,
title={Control software analysis, Part I Open-loop properties},
author={Eric Feron and Fernando Alegre},
journal={arXiv preprint arXiv:0809.4812},
year={2008},
archivePrefix={arXiv},
eprint={0809.4812},
primaryClass={cs.SE}
} | feron2008control |
arxiv-5004 | 0809.4821 | On Fan Raspaud Conjecture | <|reference_start|>On Fan Raspaud Conjecture: A conjecture of Fan and Raspaud [3] asserts that every bridgeless cubic graph con-tains three perfect matchings with empty intersection. Kaiser and Raspaud [6] sug-gested a possible approach to this problem based on the concept of a balanced join in an embedded graph. We give here some new results concerning this conjecture and prove that a minimum counterexample must have at least 32 vertices.<|reference_end|> | arxiv | @article{fouquet2008on,
title={On Fan Raspaud Conjecture},
author={Jean-Luc Fouquet (LIFO), Jean-Marie Vanherpe (LIFO)},
journal={arXiv preprint arXiv:0809.4821},
year={2008},
archivePrefix={arXiv},
eprint={0809.4821},
primaryClass={cs.DM}
} | fouquet2008on |
arxiv-5005 | 0809.4822 | On normal odd partitions in cubic graphs | <|reference_start|>On normal odd partitions in cubic graphs: A normal partition of the edges of a cubic graph is a partition into trails (no repeated edge) such that each vertex is the end vertex of exactly one trail of the partition. We investigate this notion and give some results and problems.<|reference_end|> | arxiv | @article{fouquet2008on,
title={On normal odd partitions in cubic graphs},
author={Jean-Luc Fouquet (LIFO), Jean-Marie Vanherpe (LIFO)},
journal={Discussiones Mathematicae Graph Theory 29, 2 (2009) 293-312},
year={2008},
archivePrefix={arXiv},
eprint={0809.4822},
primaryClass={cs.DM}
} | fouquet2008on |
arxiv-5006 | 0809.4834 | Relevance Feedback in Conceptual Image Retrieval: A User Evaluation | <|reference_start|>Relevance Feedback in Conceptual Image Retrieval: A User Evaluation: The Visual Object Information Retrieval (VOIR) system described in this paper implements an image retrieval approach that combines two layers, the conceptual and the visual layer. It uses terms from a textual thesaurus to represent the conceptual information and also works with image regions, the visual information. The terms are related with the image regions through a weighted association enabling the execution of concept-level queries. VOIR uses region-based relevance feedback to improve the quality of the results in each query session and to discover new associations between text and image. This paper describes a user-centred and task-oriented comparative evaluation of VOIR which was undertaken considering three distinct versions of VOIR: a full-fledge version; one supporting relevance feedback only at image level; and a third version not supporting relevance feedback at all. The evaluation performed showed the usefulness of region based relevance feedback in the context of VOIR prototype.<|reference_end|> | arxiv | @article{torres2008relevance,
title={Relevance Feedback in Conceptual Image Retrieval: A User Evaluation},
author={Jose Torres, Luis Paulo Reis},
journal={arXiv preprint arXiv:0809.4834},
year={2008},
archivePrefix={arXiv},
eprint={0809.4834},
primaryClass={cs.IR}
} | torres2008relevance |
arxiv-5007 | 0809.4839 | M\'acajov\'a and \vSkoviera Conjecture on Cubic Graphs | <|reference_start|>M\'acajov\'a and \vSkoviera Conjecture on Cubic Graphs: A conjecture of M\'a\u{c}ajov\'a and \u{S}koviera asserts that every bridgeless cubic graph has two perfect matchings whose intersection does not contain any odd edge cut. We prove this conjecture for graphs with few vertices and we give a stronger result for traceable graphs.<|reference_end|> | arxiv | @article{fouquet2008m\'acajov\'a,
title={M\'acajov\'a and \v{S}koviera Conjecture on Cubic Graphs},
author={Jean-Luc Fouquet (LIFO), Jean-Marie Vanherpe (LIFO)},
journal={Discussionnes Mathematicae on Graph Theory 30, 2 (2010) xxx-yyy},
year={2008},
archivePrefix={arXiv},
eprint={0809.4839},
primaryClass={cs.DM}
} | fouquet2008m\'acajov\'a |
arxiv-5008 | 0809.4882 | Multi-Armed Bandits in Metric Spaces | <|reference_start|>Multi-Armed Bandits in Metric Spaces: In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of trials so as to maximize the total payoff of the chosen strategies. While the performance of bandit algorithms with a small finite strategy set is quite well understood, bandit problems with large strategy sets are still a topic of very active investigation, motivated by practical applications such as online auctions and web advertisement. The goal of such research is to identify broad and natural classes of strategy sets and payoff functions which enable the design of efficient solutions. In this work we study a very general setting for the multi-armed bandit problem in which the strategies form a metric space, and the payoff function satisfies a Lipschitz condition with respect to the metric. We refer to this problem as the "Lipschitz MAB problem". We present a complete solution for the multi-armed problem in this setting. That is, for every metric space (L,X) we define an isometry invariant which bounds from below the performance of Lipschitz MAB algorithms for X, and we present an algorithm which comes arbitrarily close to meeting this bound. Furthermore, our technique gives even better results for benign payoff functions.<|reference_end|> | arxiv | @article{kleinberg2008multi-armed,
title={Multi-Armed Bandits in Metric Spaces},
author={Robert Kleinberg, Aleksandrs Slivkins and Eli Upfal},
journal={arXiv preprint arXiv:0809.4882},
year={2008},
archivePrefix={arXiv},
eprint={0809.4882},
primaryClass={cs.DS cs.LG}
} | kleinberg2008multi-armed |
arxiv-5009 | 0809.4883 | Thresholded Basis Pursuit: An LP Algorithm for Achieving Optimal Support Recovery for Sparse and Approximately Sparse Signals from Noisy Random Measurements | <|reference_start|>Thresholded Basis Pursuit: An LP Algorithm for Achieving Optimal Support Recovery for Sparse and Approximately Sparse Signals from Noisy Random Measurements: In this paper we present a linear programming solution for sign pattern recovery of a sparse signal from noisy random projections of the signal. We consider two types of noise models, input noise, where noise enters before the random projection; and output noise, where noise enters after the random projection. Sign pattern recovery involves the estimation of sign pattern of a sparse signal. Our idea is to pretend that no noise exists and solve the noiseless $\ell_1$ problem, namely, $\min \|\beta\|_1 ~ s.t. ~ y=G \beta$ and quantizing the resulting solution. We show that the quantized solution perfectly reconstructs the sign pattern of a sufficiently sparse signal. Specifically, we show that the sign pattern of an arbitrary k-sparse, n-dimensional signal $x$ can be recovered with $SNR=\Omega(\log n)$ and measurements scaling as $m= \Omega(k \log{n/k})$ for all sparsity levels $k$ satisfying $0< k \leq \alpha n$, where $\alpha$ is a sufficiently small positive constant. Surprisingly, this bound matches the optimal \emph{Max-Likelihood} performance bounds in terms of $SNR$, required number of measurements, and admissible sparsity level in an order-wise sense. In contrast to our results, previous results based on LASSO and Max-Correlation techniques either assume significantly larger $SNR$, sublinear sparsity levels or restrictive assumptions on signal sets. Our proof technique is based on noisy perturbation of the noiseless $\ell_1$ problem, in that, we estimate the maximum admissible noise level before sign pattern recovery fails.<|reference_end|> | arxiv | @article{saligrama2008thresholded,
title={Thresholded Basis Pursuit: An LP Algorithm for Achieving Optimal Support
Recovery for Sparse and Approximately Sparse Signals from Noisy Random
Measurements},
author={V. Saligrama, M. Zhao},
journal={arXiv preprint arXiv:0809.4883},
year={2008},
archivePrefix={arXiv},
eprint={0809.4883},
primaryClass={cs.IT cs.LG math.IT}
} | saligrama2008thresholded |
arxiv-5010 | 0809.4916 | 16 Propositions to Reconsider the Organization of a Scientific Workshop | <|reference_start|>16 Propositions to Reconsider the Organization of a Scientific Workshop: Participating a scientific workshop is nowadays often an adventure because the number of participants do seldom exceed the number of talks. A half-day workshop is mostly finished at lunchtime, speakers are sometimes not present and unexcused, and a strict progression of the workshop offers little air for discussion. And when talks are re-scheduled on short notice in case that a speech is dropped out, attaining guests definitely wonder why the presenter is talking about something that does not match the previously announced talk. In this respect, we believe that the organization of a workshop in the classical sense must be reconsidered. It is not enough of compelling the presenters to pay the registration fee only and to let the participants being impassive or taken away mentally. With this work, we address several propositions to become implemented in the future workshop organization. With that, we hope to contribute to the identification of scientific workshops as a place of interaction.<|reference_end|> | arxiv | @article{schommer200816,
title={16 Propositions to Reconsider the Organization of a Scientific Workshop},
author={Christoph Schommer},
journal={arXiv preprint arXiv:0809.4916},
year={2008},
archivePrefix={arXiv},
eprint={0809.4916},
primaryClass={cs.CY cs.GL}
} | schommer200816 |
arxiv-5011 | 0809.4917 | Enhanced Energy-Aware Feedback Scheduling of Embedded Control Systems | <|reference_start|>Enhanced Energy-Aware Feedback Scheduling of Embedded Control Systems: Dynamic voltage scaling (DVS) is one of the most effective techniques for reducing energy consumption in embedded and real-time systems. However, traditional DVS algorithms have inherent limitations on their capability in energy saving since they rarely take into account the actual application requirements and often exploit fixed timing constraints of real-time tasks. Taking advantage of application adaptation, an enhanced energy-aware feedback scheduling (EEAFS) scheme is proposed, which integrates feedback scheduling with DVS. To achieve further reduction in energy consumption over pure DVS while not jeopardizing the quality of control, the sampling period of each control loop is adapted to its actual control performance, thus exploring flexible timing constraints on control tasks. Extensive simulation results are given to demonstrate the effectiveness of EEAFS under different scenarios. Compared with the optimal pure DVS scheme, EEAFS saves much more energy while yielding comparable control performance.<|reference_end|> | arxiv | @article{xia2008enhanced,
title={Enhanced Energy-Aware Feedback Scheduling of Embedded Control Systems},
author={Feng Xia, Longhua Ma, Wenhong Zhao, Youxian Sun, Jinxiang Dong},
journal={arXiv preprint arXiv:0809.4917},
year={2008},
archivePrefix={arXiv},
eprint={0809.4917},
primaryClass={cs.OH}
} | xia2008enhanced |
arxiv-5012 | 0809.4920 | Integrated Design and Implementation of Embedded Control Systems with Scilab | <|reference_start|>Integrated Design and Implementation of Embedded Control Systems with Scilab: Embedded systems are playing an increasingly important role in control engineering. Despite their popularity, embedded systems are generally subject to resource constraints and it is therefore difficult to build complex control systems on embedded platforms. Traditionally, the design and implementation of control systems are often separated, which causes the development of embedded control systems to be highly time-consuming and costly. To address these problems, this paper presents a low-cost, reusable, reconfigurable platform that enables integrated design and implementation of embedded control systems. To minimize the cost, free and open source software packages such as Linux and Scilab are used. Scilab is ported to the embedded ARM-Linux system. The drivers for interfacing Scilab with several communication protocols including serial, Ethernet, and Modbus are developed. Experiments are conducted to test the developed embedded platform. The use of Scilab enables implementation of complex control algorithms on embedded platforms. With the developed platform, it is possible to perform all phases of the development cycle of embedded control systems in a unified environment, thus facilitating the reduction of development time and cost.<|reference_end|> | arxiv | @article{ma2008integrated,
title={Integrated Design and Implementation of Embedded Control Systems with
Scilab},
author={Longhua Ma, Feng Xia, Zhe Peng},
journal={Sensors, 8(9): 5501-5515, 2008},
year={2008},
archivePrefix={arXiv},
eprint={0809.4920},
primaryClass={cs.OH}
} | ma2008integrated |
arxiv-5013 | 0809.4924 | Cross-Layer Adaptive Feedback Scheduling of Wireless Control Systems | <|reference_start|>Cross-Layer Adaptive Feedback Scheduling of Wireless Control Systems: There is a trend towards using wireless technologies in networked control systems. However, the adverse properties of the radio channels make it difficult to design and implement control systems in wireless environments. To attack the uncertainty in available communication resources in wireless control systems closed over WLAN, a cross-layer adaptive feedback scheduling (CLAFS) scheme is developed, which takes advantage of the co-design of control and wireless communications. By exploiting cross-layer design, CLAFS adjusts the sampling periods of control systems at the application layer based on information about deadline miss ratio and transmission rate from the physical layer. Within the framework of feedback scheduling, the control performance is maximized through controlling the deadline miss ratio. Key design parameters of the feedback scheduler are adapted to dynamic changes in the channel condition. An event-driven invocation mechanism for the feedback scheduler is also developed. Simulation results show that the proposed approach is efficient in dealing with channel capacity variations and noise interference, thus providing an enabling technology for control over WLAN.<|reference_end|> | arxiv | @article{xia2008cross-layer,
title={Cross-Layer Adaptive Feedback Scheduling of Wireless Control Systems},
author={Feng Xia, Longhua Ma, Chen Peng, Youxian Sun, Jinxiang Dong},
journal={Sensors, 8(7): 4265-4281, 2008},
year={2008},
archivePrefix={arXiv},
eprint={0809.4924},
primaryClass={cs.NI}
} | xia2008cross-layer |
arxiv-5014 | 0809.4929 | Performance-Aware Power Management in Embedded Controllers with Multiple-Voltage Processors | <|reference_start|>Performance-Aware Power Management in Embedded Controllers with Multiple-Voltage Processors: The goal of this work is to minimize the energy dissipation of embedded controllers without jeopardizing the quality of control (QoC). Taking advantage of the dynamic voltage scaling (DVS) technology, this paper develops a performance-aware power management scheme for embedded controllers with processors that allow multiple voltage levels. The periods of control tasks are adapted online with respect to the current QoC, thus facilitating additional energy reduction over standard DVS. To avoid the waste of CPU resources as a result of the discrete voltage levels, a resource reclaiming mechanism is employed to maximize the CPU utilization and also to improve the QoC. Simulations are conducted to evaluate the performance of the proposed scheme. Compared with the optimal standard DVS scheme, the proposed scheme is shown to be able to save remarkably more energy while maintaining comparable QoC.<|reference_end|> | arxiv | @article{xia2008performance-aware,
title={Performance-Aware Power Management in Embedded Controllers with
Multiple-Voltage Processors},
author={Feng Xia, Liping Liu, Longhua Ma, Youxian Sun, Jinxiang Dong},
journal={Information Technology Journal, 7(6): 942-947, 2008},
year={2008},
doi={10.3923/itj.2008.942.947},
archivePrefix={arXiv},
eprint={0809.4929},
primaryClass={cs.OH}
} | xia2008performance-aware |
arxiv-5015 | 0809.4983 | Poisson Homology in Degree 0 for some Rings of Symplectic Invariants | <|reference_start|>Poisson Homology in Degree 0 for some Rings of Symplectic Invariants: Let $\go{g}$ be a finite-dimensional semi-simple Lie algebra, $\go{h}$ a Cartan subalgebra of $\go{g}$, and $W$ its Weyl group. The group $W$ acts diagonally on $V:=\go{h}\oplus\go{h}^*$, as well as on $\mathbb{C}[V]$. The purpose of this article is to study the Poisson homology of the algebra of invariants $\mathbb{C}[V]^W$ endowed with the standard symplectic bracket. To begin with, we give general results about the Poisson homology space in degree 0, denoted by $HP_0(\mathbb{C}[V]^W)$, in the case where $\go{g}$ is of type $B_n-C_n$ or $D_n$, results which support Alev's conjecture. Then we are focusing the interest on the particular cases of ranks 2 and 3, by computing the Poisson homology space in degree 0 in the cases where $\go{g}$ is of type $B_2$ ($\go{so}_5$), $D_2$ ($\go{so}_4$), then $B_3$ ($\go{so}_7$), and $D_3=A_3$ ($\go{so}_6\simeq\go{sl}_4$). In order to do this, we make use of a functional equation introduced by Y. Berest, P. Etingof and V. Ginzburg. We recover, by a different method, the result established by J. Alev and L. Foissy, according to which the dimension of $HP_0(\mathbb{C}[V]^W)$ equals 2 for $B_2$. Then we calculate the dimension of this space and we show that it is equal to 1 for $D_2$. We also calculate it for the rank 3 cases, we show that it is equal to 3 for $B_3-C_3$ and 1 for $D_3=A_3$.<|reference_end|> | arxiv | @article{butin2008poisson,
title={Poisson Homology in Degree 0 for some Rings of Symplectic Invariants},
author={Fr'ed'eric Butin (ICJ)},
journal={arXiv preprint arXiv:0809.4983},
year={2008},
archivePrefix={arXiv},
eprint={0809.4983},
primaryClass={math-ph cs.SC math.MP math.RA}
} | butin2008poisson |
arxiv-5016 | 0809.4985 | On the Influence of Carrier Frequency Offset and Sampling Frequency Offset in MIMO-OFDM Systems for Future Digital TV | <|reference_start|>On the Influence of Carrier Frequency Offset and Sampling Frequency Offset in MIMO-OFDM Systems for Future Digital TV: This paper investigates the impact of carrier frequency offset (CFO) and sampling frequency offset (SFO) on the performance of different MIMO-OFDM schemes with high spectral efficiency for next generation of terrestrial digital TV. We analyze particularly orthogonal Alamouti scheme, and non-orthogonal (NO) schemes like VBLAST, linear dispersion (LD) code and Golden code. This analysis gives a global view on the best suitable MIMO-OFDM scheme with respect to CFO and SFO. We show that for high spectral efficiency, Alamouti is more sensitive to CFO and SFO. Moreover, we show that all studied MIMO-OFDM schemes are sensitive to CFO when it is greater than 1% of inter-carrier spacing. Their sensitivity due to SFO is less than that due to CFO.<|reference_end|> | arxiv | @article{nasser2008on,
title={On the Influence of Carrier Frequency Offset and Sampling Frequency
Offset in MIMO-OFDM Systems for Future Digital TV},
author={Youssef Nasser (IETR), Jean-Franc{c}ois H'elard (IETR), Matthieu
Crussi`ere (IETR)},
journal={International Symposium on Wireless and Pervasive Computing,
Gr\`ece (2008)},
year={2008},
archivePrefix={arXiv},
eprint={0809.4985},
primaryClass={cs.NI}
} | nasser2008on |
arxiv-5017 | 0809.4986 | Efficient MIMO-OFDM Schemes for Future Terrestrial Digital TV with Unequal Received Powers | <|reference_start|>Efficient MIMO-OFDM Schemes for Future Terrestrial Digital TV with Unequal Received Powers: This article investigates the effect of equal and unequal received powers on the performances of different MIMO-OFDM schemes for terrestrial digital TV. More precisely, we focus on three types of non-orthogonal schemes: the BLAST scheme, the Linear Dispersion (LD) code and the Golden code, and we compare their performances to that of Alamouti scheme. Using two receiving antennas, we show that for moderate attenuation on the second antenna and high spectral efficiency, Golden code outperforms other schemes. However, Alamouti scheme presents the best performance for low spectral efficiency and equal received powers or when one antenna is dramatically damaged. When three antennas are used, we show that Golden code offers the highest robustness to power unbalance at the receiving side<|reference_end|> | arxiv | @article{nasser2008efficient,
title={Efficient MIMO-OFDM Schemes for Future Terrestrial Digital TV with
Unequal Received Powers},
author={Youssef Nasser (IETR), Jean-Franc{c}ois H'elard (IETR), Matthieu
Crussi`ere (IETR), Oudomsack Pasquero (IETR)},
journal={IEEE International Conference on Communications, Chine (2008)},
year={2008},
archivePrefix={arXiv},
eprint={0809.4986},
primaryClass={cs.NI}
} | nasser2008efficient |
arxiv-5018 | 0809.4987 | Efficient 3D Space Time Space Block Code for Future Terrestrial Digital TV | <|reference_start|>Efficient 3D Space Time Space Block Code for Future Terrestrial Digital TV: This article introduces a 3D space-time-space block code for future terrestrial digital TV in single frequency networks. The proposed 3D code is based on a double layer structure designed for inter-cell and intra-cell space time coded transmissions. We show that this new structure is particularly efficient for SFN environments regardless of the location of the receiver. It is then suitable for fixed, portable and mobile receptions.<|reference_end|> | arxiv | @article{nasser2008efficient,
title={Efficient 3D Space Time Space Block Code for Future Terrestrial Digital
TV},
author={Youssef Nasser (IETR), Jean-Franc{c}ois H'elard (IETR), Matthieu
Crussi`ere (IETR), Oudomsack Pasquero (IETR)},
journal={Symposium on Signal Processing Advances in Wireless
Communications, Recife : Br\'esil (2008)},
year={2008},
archivePrefix={arXiv},
eprint={0809.4987},
primaryClass={cs.NI}
} | nasser2008efficient |
arxiv-5019 | 0809.4989 | Bit Error Rate Prediction of Coded MIMO-OFDM Systems | <|reference_start|>Bit Error Rate Prediction of Coded MIMO-OFDM Systems: Bit error rate (BER) prediction over channel realisations has emerged as an active research area. In this paper, we give analytical signal to interference and noise ratio (SINR) evaluation of MIMO-OFDM systems using an iterative receiver. Using this analytical SINR expression, we propose an accurate BER prediction method based on effective exponential SINR mapping (EESM) method. We show by simulations that our method is independent of the channel realisation and of the MIMO scheme. It is only dependent on the modulation and coding scheme.<|reference_end|> | arxiv | @article{nasser2008bit,
title={Bit Error Rate Prediction of Coded MIMO-OFDM Systems},
author={Youssef Nasser (IETR), Jean-Franc{c}ois H'elard (IETR), Matthieu
Crussi`ere (IETR)},
journal={IEEE Symposium on Signal Processing Advances in Wireless
Communications, Recife : Br\'esil (2008)},
year={2008},
archivePrefix={arXiv},
eprint={0809.4989},
primaryClass={cs.NI}
} | nasser2008bit |
arxiv-5020 | 0809.5005 | Simulated annealing for weighted polygon packing | <|reference_start|>Simulated annealing for weighted polygon packing: In this paper we present a new algorithm for a layout optimization problem: this concerns the placement of weighted polygons inside a circular container, the two objectives being to minimize imbalance of mass and to minimize the radius of the container. This problem carries real practical significance in industrial applications (such as the design of satellites), as well as being of significant theoretical interest. Previous work has dealt with circular or rectangular objects, but here we deal with the more realistic case where objects may be represented as polygons and the polygons are allowed to rotate. We present a solution based on simulated annealing and first test it on instances with known optima. Our results show that the algorithm obtains container radii that are close to optimal. We also compare our method with existing algorithms for the (special) rectangular case. Experimental results show that our approach out-performs these methods in terms of solution quality.<|reference_end|> | arxiv | @article{xu2008simulated,
title={Simulated annealing for weighted polygon packing},
author={Yi-Chun Xu, Ren-Bin Xiao and Martyn Amos},
journal={arXiv preprint arXiv:0809.5005},
year={2008},
archivePrefix={arXiv},
eprint={0809.5005},
primaryClass={cs.CG cs.AI}
} | xu2008simulated |
arxiv-5021 | 0809.5008 | Multi-Antenna Communication in Ad Hoc Networks: Achieving MIMO Gains with SIMO Transmission | <|reference_start|>Multi-Antenna Communication in Ad Hoc Networks: Achieving MIMO Gains with SIMO Transmission: The benefit of multi-antenna receivers is investigated in wireless ad hoc networks, and the main finding is that network throughput can be made to scale linearly with the number of receive antennas nR even if each transmitting node uses only a single antenna. This is in contrast to a large body of prior work in single-user, multiuser, and ad hoc wireless networks that have shown linear scaling is achievable when multiple receive and transmit antennas (i.e., MIMO transmission) are employed, but that throughput increases logarithmically or sublinearly with nR when only a single transmit antenna (i.e., SIMO transmission) is used. The linear gain is achieved by using the receive degrees of freedom to simultaneously suppress interference and increase the power of the desired signal, and exploiting the subsequent performance benefit to increase the density of simultaneous transmissions instead of the transmission rate. This result is proven in the transmission capacity framework, which presumes single-hop transmissions in the presence of randomly located interferers, but it is also illustrated that the result holds under several relaxations of the model, including imperfect channel knowledge, multihop transmission, and regular networks (i.e., interferers are deterministically located on grids).<|reference_end|> | arxiv | @article{jindal2008multi-antenna,
title={Multi-Antenna Communication in Ad Hoc Networks: Achieving MIMO Gains
with SIMO Transmission},
author={Nihar Jindal, Jeffrey G. Andrews, Steven Weber},
journal={arXiv preprint arXiv:0809.5008},
year={2008},
doi={10.1109/TCOMM.2010.120710.090793},
archivePrefix={arXiv},
eprint={0809.5008},
primaryClass={cs.IT math.IT}
} | jindal2008multi-antenna |
arxiv-5022 | 0809.5009 | Delay Constrained Scheduling over Fading Channels: Optimal Policies for Monomial Energy-Cost Functions | <|reference_start|>Delay Constrained Scheduling over Fading Channels: Optimal Policies for Monomial Energy-Cost Functions: A point-to-point discrete-time scheduling problem of transmitting $B$ information bits within $T$ hard delay deadline slots is considered assuming that the underlying energy-bit cost function is a convex monomial. The scheduling objective is to minimize the expected energy expenditure while satisfying the deadline constraint based on information about the unserved bits, channel state/statistics, and the remaining time slots to the deadline. At each time slot, the scheduling decision is made without knowledge of future channel state, and thus there is a tension between serving many bits when the current channel is good versus leaving too many bits for the deadline. Under the assumption that no other packet is scheduled concurrently and no outage is allowed, we derive the optimal scheduling policy. Furthermore, we also investigate the dual problem of maximizing the number of transmitted bits over $T$ time slots when subject to an energy constraint.<|reference_end|> | arxiv | @article{lee2008delay,
title={Delay Constrained Scheduling over Fading Channels: Optimal Policies for
Monomial Energy-Cost Functions},
author={Juyul Lee and Nihar Jindal},
journal={arXiv preprint arXiv:0809.5009},
year={2008},
archivePrefix={arXiv},
eprint={0809.5009},
primaryClass={cs.IT math.IT}
} | lee2008delay |
arxiv-5023 | 0809.5016 | Robustness of MIMO-OFDM Schemes for Future Digital TV to Carrier Frequency Offset | <|reference_start|>Robustness of MIMO-OFDM Schemes for Future Digital TV to Carrier Frequency Offset: This paper investigates the impact of carrier frequency offset (CFO) on the performance of different MIMO-OFDM schemes with high spectral efficiency for next generation of terrestrial digital TV. We show that all studied MIMO-OFDM schemes are sensitive to CFO when it is greater than 1% of inter-carrier spacing. We show also that the Alamouti scheme is the most sensitive MIMO scheme to CFO<|reference_end|> | arxiv | @article{nasser2008robustness,
title={Robustness of MIMO-OFDM Schemes for Future Digital TV to Carrier
Frequency Offset},
author={Youssef Nasser (IETR), Jean-Franc{c}ois H'elard (IETR), Matthieu
Crussi`ere (IETR)},
journal={IEEE Broadband Multimedia Symposium, \'Etats-Unis d'Am\'erique
(2008)},
year={2008},
archivePrefix={arXiv},
eprint={0809.5016},
primaryClass={cs.NI}
} | nasser2008robustness |
arxiv-5024 | 0809.5022 | Network coding meets TCP | <|reference_start|>Network coding meets TCP: We propose a mechanism that incorporates network coding into TCP with only minor changes to the protocol stack, thereby allowing incremental deployment. In our scheme, the source transmits random linear combinations of packets currently in the congestion window. At the heart of our scheme is a new interpretation of ACKs - the sink acknowledges every degree of freedom (i.e., a linear combination that reveals one unit of new information) even if it does not reveal an original packet immediately. Such ACKs enable a TCP-like sliding-window approach to network coding. Our scheme has the nice property that packet losses are essentially masked from the congestion control algorithm. Our algorithm therefore reacts to packet drops in a smooth manner, resulting in a novel and effective approach for congestion control over networks involving lossy links such as wireless links. Our experiments show that our algorithm achieves higher throughput compared to TCP in the presence of lossy wireless links. We also establish the soundness and fairness properties of our algorithm.<|reference_end|> | arxiv | @article{sundararajan2008network,
title={Network coding meets TCP},
author={Jay Kumar Sundararajan, Devavrat Shah, Muriel Medard, Michael
Mitzenmacher, Joao Barros},
journal={arXiv preprint arXiv:0809.5022},
year={2008},
doi={10.1109/INFCOM.2009.5061931},
archivePrefix={arXiv},
eprint={0809.5022},
primaryClass={cs.NI cs.IT math.IT}
} | sundararajan2008network |
arxiv-5025 | 0809.5023 | Asymptotic stability region of slotted-Aloha | <|reference_start|>Asymptotic stability region of slotted-Aloha: We analyze the stability of standard, buffered, slotted-Aloha systems. Specifically, we consider a set of $N$ users, each equipped with an infinite buffer. Packets arrive into user $i$'s buffer according to some stationary ergodic Markovian process of intensity $\lambda_i$. At the beginning of each slot, if user $i$ has packets in its buffer, it attempts to transmit a packet with fixed probability $p_i$ over a shared resource / channel. The transmission is successful only when no other user attempts to use the channel. The stability of such systems has been open since their very first analysis in 1979 by Tsybakov and Mikhailov. In this paper, we propose an approximate stability condition, that is provably exact when the number of users $N$ grows large. We provide theoretical evidence and numerical experiments to explain why the proposed approximate stability condition is extremely accurate even for systems with a restricted number of users (even two or three). We finally extend the results to the case of more efficient CSMA systems.<|reference_end|> | arxiv | @article{bordenave2008asymptotic,
title={Asymptotic stability region of slotted-Aloha},
author={Charles Bordenave, David McDonald, Alexandre Proutiere},
journal={arXiv preprint arXiv:0809.5023},
year={2008},
archivePrefix={arXiv},
eprint={0809.5023},
primaryClass={cs.IT math.IT}
} | bordenave2008asymptotic |
arxiv-5026 | 0809.5087 | Hybrid Neural Network Architecture for On-Line Learning | <|reference_start|>Hybrid Neural Network Architecture for On-Line Learning: Approaches to machine intelligence based on brain models have stressed the use of neural networks for generalization. Here we propose the use of a hybrid neural network architecture that uses two kind of neural networks simultaneously: (i) a surface learning agent that quickly adapt to new modes of operation; and, (ii) a deep learning agent that is very accurate within a specific regime of operation. The two networks of the hybrid architecture perform complementary functions that improve the overall performance. The performance of the hybrid architecture has been compared with that of back-propagation perceptrons and the CC and FC networks for chaotic time-series prediction, the CATS benchmark test, and smooth function approximation. It has been shown that the hybrid architecture provides a superior performance based on the RMS error criterion.<|reference_end|> | arxiv | @article{chen2008hybrid,
title={Hybrid Neural Network Architecture for On-Line Learning},
author={Yuhua Chen, Subhash Kak, Lei Wang},
journal={arXiv preprint arXiv:0809.5087},
year={2008},
archivePrefix={arXiv},
eprint={0809.5087},
primaryClass={cs.NE}
} | chen2008hybrid |
arxiv-5027 | 0809.5096 | Diversity Analysis of Bit-Interleaved Coded Multiple Beamforming | <|reference_start|>Diversity Analysis of Bit-Interleaved Coded Multiple Beamforming: In this paper, diversity analysis of bit-interleaved coded multiple beamforming (BICMB) is extended to the case of general spatial interleavers, removing a condition on their previously known design criteria and quantifying the resulting diversity order. The diversity order is determined by a parameter Qmax which is inherited from the convolutional code and the spatial de-multiplexer used in BICMB. We introduce a method to find this parameter by employing a transfer function approach as in finding the weight spectrum of a convolutional code. By using this method, several Qmax values are shown and verified to be identical with the results from a computer search. The diversity analysis and the method to find the parameter are supported by simulation results. By using the Singleton bound, we also show that Qmax is lower bounded by the product of the number of streams and the code rate of an encoder. The design rule of the spatial de-multiplexer for a given convolutional code is proposed to meet the condition on the maximum achievable diversity order.<|reference_end|> | arxiv | @article{park2008diversity,
title={Diversity Analysis of Bit-Interleaved Coded Multiple Beamforming},
author={Hong Ju Park and Ender Ayanoglu},
journal={arXiv preprint arXiv:0809.5096},
year={2008},
archivePrefix={arXiv},
eprint={0809.5096},
primaryClass={cs.IT math.IT}
} | park2008diversity |
arxiv-5028 | 0809.5145 | 3D MIMO Scheme for Broadcasting Future Digital TV in Single Frequency Networks | <|reference_start|>3D MIMO Scheme for Broadcasting Future Digital TV in Single Frequency Networks: This letter introduces a 3D space-time-space block code for future digital TV systems. The code is based on a double layer structure for inter-cell and intra-cell transmission mode in single frequency networks. Without increasing the complexity of the receiver, the proposed code is very efficient for different transmission scenarios.<|reference_end|> | arxiv | @article{nasser20083d,
title={3D MIMO Scheme for Broadcasting Future Digital TV in Single Frequency
Networks},
author={Youssef Nasser (IETR), Jean-Franc{c}ois H'elard (IETR), Matthieu
Crussi`ere (IETR)},
journal={Electronics Letters / IEE Electronics Letters 44, 13 (2008)
829-830},
year={2008},
archivePrefix={arXiv},
eprint={0809.5145},
primaryClass={cs.NI}
} | nasser20083d |
arxiv-5029 | 0809.5153 | On a new multivariate sampling paradigm and a polyspline Shannon function | <|reference_start|>On a new multivariate sampling paradigm and a polyspline Shannon function: In the monograph Kounchev, O. I., Multivariate Polysplines. Applications to Numerical and Wavelet Analysis, Academic Press, San Diego-London, 2001, and in the paper Kounchev O., Render, H., Cardinal interpolation with polysplines on annuli, Journal of Approximation Theory 137 (2005) 89--107, we have introduced and studied a new paradigm for cardinal interpolation which is related to the theory of multivariate polysplines. In the present paper we show that this is related to a new sampling paradigm in the multivariate case, whereas we obtain a Shannon type function $S(x) $ and the following Shannon type formula: $f(r\theta) =\sum_{j=-\infty}^{\infty}\int_{\QTR{Bbb}{S}^{n-1}}S(e^{-j}r\theta ) f(e^{j}\theta) d\theta .$ This formula relies upon infinitely many Shannon type formulas for the exponential splines arising from the radial part of the polyharmonic operator $\Delta ^{p}$ for fixed $p\geq 1$. Acknowledgement. The first and the second author have been partially supported by the Institutes partnership project with the Alexander von Humboldt Foundation. The first has been partially sponsored by the Greek-Bulgarian bilateral project BGr-17, and the second author by Grant MTM2006-13000-C03-03 of the D.G.I. of Spain.<|reference_end|> | arxiv | @article{kounchev2008on,
title={On a new multivariate sampling paradigm and a polyspline Shannon
function},
author={Ognyan Kounchev, Hermann Render},
journal={arXiv preprint arXiv:0809.5153},
year={2008},
archivePrefix={arXiv},
eprint={0809.5153},
primaryClass={math.NA cs.IT math.IT}
} | kounchev2008on |
arxiv-5030 | 0809.5154 | An Export Architecture for a Multimedia Authoring Environment | <|reference_start|>An Export Architecture for a Multimedia Authoring Environment: In this paper, we propose an export architecture that provides a clear separation of authoring services from publication services. We illustrate this architecture with the LimSee3 authoring tool and several standard publication formats: Timesheets, SMIL, and XHTML.<|reference_end|> | arxiv | @article{mikác2008an,
title={An Export Architecture for a Multimedia Authoring Environment},
author={Jan Mik'ac (INRIA Rh^one-Alpes / LIG Laboratoire d'Informatique de
Grenoble), C'ecile Roisin (INRIA Rh^one-Alpes / LIG Laboratoire
d'Informatique de Grenoble), Bao Le Duc (UPMC)},
journal={Dans DocEng'08 (2008) 28-31},
year={2008},
archivePrefix={arXiv},
eprint={0809.5154},
primaryClass={cs.MM}
} | mikác2008an |
arxiv-5031 | 0809.5173 | An algebraic approach to the set of intervals (a new approach of arithmetic of intervals) | <|reference_start|>An algebraic approach to the set of intervals (a new approach of arithmetic of intervals): In this paper we present the set of intervals as a normed vector space. We define also a four-dimensional associative algebra whose product gives the product of intervals in any cases. This approach allows to give a notion of divisibility and in some cases an euclidian division. We introduce differential calculus and give some applications.<|reference_end|> | arxiv | @article{goze2008an,
title={An algebraic approach to the set of intervals (a new approach of
arithmetic of intervals)},
author={Nicolas Goze, Elisabeth Remm},
journal={arXiv preprint arXiv:0809.5173},
year={2008},
archivePrefix={arXiv},
eprint={0809.5173},
primaryClass={cs.NA}
} | goze2008an |
arxiv-5032 | 0809.5182 | Perturbation-based Distributed Beamforming for Wireless Relay Networks | <|reference_start|>Perturbation-based Distributed Beamforming for Wireless Relay Networks: This paper deals with distributed beamforming techniques for wireless networks with half-duplex amplify-and-forward relays. Existing schemes optimize the beamforming weights based on the assumption that channel state information (CSI) is available at the relays. We propose to use adaptive beamforming based on deterministic perturbations and limited feedback (1-bit) from the destination to the relays in order to avoid CSI at the relays. Two scalable perturbation schemes are considered and practical implementation aspects are addressed. Simulation results confirm that the proposed techniques closely approach optimum performance and have satisfactory tracking properties in time-varying environments.<|reference_end|> | arxiv | @article{fertl2008perturbation-based,
title={Perturbation-based Distributed Beamforming for Wireless Relay Networks},
author={Peter Fertl, Ari Hottinen, and Gerald Matz},
journal={arXiv preprint arXiv:0809.5182},
year={2008},
doi={10.1109/GLOCOM.2008.ECP.743},
archivePrefix={arXiv},
eprint={0809.5182},
primaryClass={cs.IT math.IT}
} | fertl2008perturbation-based |
arxiv-5033 | 0809.5188 | Analysis and Performance Comparison of DVB-T and DTMB Systems for Terrestrial Digital TV | <|reference_start|>Analysis and Performance Comparison of DVB-T and DTMB Systems for Terrestrial Digital TV: Orthogonal frequency-division multiplexing (OFDM) is the most popular transmission technology in digital terrestrial broadcasting (DTTB), adopted by many DTTB standards. In this paper, the bit error rate (BER) performance of two DTTB systems, namely cyclic prefix OFDM (CP-OFDM) based DVB-T and time domain synchronous OFDM (TDS-OFDM) based DTMB, is evaluated in different channel conditions. Spectrum utilization and power efficiency are also discussed to demonstrate the transmission overhead of both systems. Simulation results show that the performances of the two systems are much close. Given the same ratio of guard interval (GI), the DVB-T outperforms DTMB in terms of signal to noise ratio (SNR) in Gaussian and Ricean channels, while DTMB behaves better performance in Rayleigh channel in higher code rates and higher orders of constellation thanks to its efficient channel coding and interleaving scheme.<|reference_end|> | arxiv | @article{liu2008analysis,
title={Analysis and Performance Comparison of DVB-T and DTMB Systems for
Terrestrial Digital TV},
author={Ming Liu (IETR), Matthieu Crussi`ere (IETR), Jean-Franc{c}ois
H'elard (IETR), Oudomsack Pasquero (IETR)},
journal={IEEE International Conference on Communications Systems (ICCS
2008), Guangzhou : Chine (2008)},
year={2008},
archivePrefix={arXiv},
eprint={0809.5188},
primaryClass={cs.NI}
} | liu2008analysis |
arxiv-5034 | 0809.5189 | A novel channel estimation based on spread pilots for terrestrial digital video broadcasting | <|reference_start|>A novel channel estimation based on spread pilots for terrestrial digital video broadcasting: In this paper, we propose a novel channel estimation technique based on spread pilots for digital video broadcasting. This technique consists in adding a linear preceding function before the OFDM modulation and dedicating one of the preceding sequence to transmit the pilot symbols for the channel estimation. The merits of this technique are its simplicity, its flexibility, and the gains in terms of spectral efficiency and useful bit rate obtained compared to the classical pilot based estimation schemes used in DVB standards. The performance evaluated over realistic channel models, shows the efficiency of this technique which turns out to be a promising channel estimation technique for the future terrestrial video broadcasting systems.<|reference_end|> | arxiv | @article{pasquero2008a,
title={A novel channel estimation based on spread pilots for terrestrial
digital video broadcasting},
author={Oudomsack Pierre Pasquero (IETR), Matthieu Crussi`ere (IETR), Youssef
Nasser (IETR), Jean-Franc{c}ois H'elard (IETR)},
journal={Broadband Multimedia Systems and Broadcasting, Las Vegas :
\'Etats-Unis d'Am\'erique (2008)},
year={2008},
archivePrefix={arXiv},
eprint={0809.5189},
primaryClass={cs.NI}
} | pasquero2008a |
arxiv-5035 | 0809.5191 | A Coded Bit-Loading Linear Precoded Discrete Multitone Solution for Power Line Communication | <|reference_start|>A Coded Bit-Loading Linear Precoded Discrete Multitone Solution for Power Line Communication: Linear precoded discrete multitone modulation (LP-DMT) system has been already proved advantageous with adaptive resource allocation algorithm in a power line communication (PLC) context. In this paper, we investigate the bit and energy allocation algorithm of an adaptive LP-DMT system taking into account the channel coding scheme. A coded adaptive LP-DMT system is presented in the PLC context with a loading algorithm which ccommodates the channel coding gains in bit and energy calculations. The performance of a concatenated channel coding scheme, consisting of an inner Wei's 4-dimensional 16-states trellis code and an outer Reed-Solomon code, in combination with the roposed algorithm is analyzed. Simulation results are presented for a fixed target bit error rate in a multicarrier scenario under power spectral density constraint. Using a multipath model of PLC channel, it is shown that the proposed coded adaptive LP-DMT system performs better than classical coded discrete multitone.<|reference_end|> | arxiv | @article{muhammad2008a,
title={A Coded Bit-Loading Linear Precoded Discrete Multitone Solution for
Power Line Communication},
author={Fahad Syed Muhammad (IETR), Jean-Yves Baudais (IETR),
Jean-Franc{c}ois H'elard (IETR), Matthieu Crussi`ere (IETR)},
journal={International Workshop on Signal Processing Advances in Wireless
Communications, Recife, Pernambuco : Brazil (2008)},
year={2008},
doi={10.1109/SPAWC.2008.4641669},
archivePrefix={arXiv},
eprint={0809.5191},
primaryClass={cs.IT math.IT}
} | muhammad2008a |
arxiv-5036 | 0809.5192 | 2D Linear Precoded OFDM for future mobile Digital Video Broadcasting | <|reference_start|>2D Linear Precoded OFDM for future mobile Digital Video Broadcasting: In this paper, we propose a novel channel estimation technique based on 2D spread pilots. The merits of this technique are its simplicity, its flexibility regarding the transmission scenarios, and the spectral efficiency gain obtained compared to the classical pilot based estimation schemes used in DVB standards. We derive the analytical expression of the mean square error of the estimator and show it is a function of the autocorrelation of the channel in both time and frequency domains. The performance evaluated over a realistic channel model shows the efficiency of this technique which turns out to be a promising channel estimation for the future mobile video broadcasting systems.<|reference_end|> | arxiv | @article{pasquero20082d,
title={2D Linear Precoded OFDM for future mobile Digital Video Broadcasting},
author={Oudomsack Pierre Pasquero (IETR), Matthieu Crussi`ere (IETR), Youssef
Nasser (IETR), Jean-Franc{c}ois H'elard (IETR)},
journal={Signal Processing Advances in Wireless Communications, Recife :
Br\'esil (2008)},
year={2008},
archivePrefix={arXiv},
eprint={0809.5192},
primaryClass={cs.NI}
} | pasquero20082d |
arxiv-5037 | 0809.5204 | A Distributed MAC Protocol for Cooperation in Random Access Networks | <|reference_start|>A Distributed MAC Protocol for Cooperation in Random Access Networks: WLAN is one of the most successful applications of wireless communications in daily life because of low cost and ease of deployment. The enabling technique for this success is the use of random access schemes for the wireless channel. Random access requires minimal coordination between the nodes, which considerably reduces the cost of the infrastructure. Recently, cooperative communication in wireless networks has been of increasing interest because it promises higher rates and reliability. An additional MAC overhead is necessary to coordinate the nodes to allow cooperation and this overhead can possibly cancel out the cooperative benefits. In this work, a completely distributed protocol is proposed that allows nodes in the network to cooperate via Two-Hop and Decode-and-Forward for transmitting their data to a common gateway node. It is shown that high throughput gains are obtained in terms of the individual throughput that can be guaranteed to any node in the network. These results are validated by Monte Carlo simulations.<|reference_end|> | arxiv | @article{böcherer2008a,
title={A Distributed MAC Protocol for Cooperation in Random Access Networks},
author={Georg B"ocherer and Alexandre de Baynast},
journal={arXiv preprint arXiv:0809.5204},
year={2008},
archivePrefix={arXiv},
eprint={0809.5204},
primaryClass={cs.IT math.IT}
} | böcherer2008a |
arxiv-5038 | 0809.5212 | Secrecy Capacity over Correlated Ergodic Fading Channel | <|reference_start|>Secrecy Capacity over Correlated Ergodic Fading Channel: We investigate the secrecy capacity of an ergodic fading wiretap channel in which the main channel is correlated with the eavesdropper channel. In this study, the full Channel State Information (CSI) is assumed, and thus the transmitter knows the channel gains of the legitimate receiver and the eavesdropper. By analyzing the resulting secrecy capacity we quantify the loss of the secrecy capacity due to the correlation. In addition, we study the asymptotic behavior of the secrecy capacity as Signal-to-Noise Ratio (SNR) tends to infinity. The capacity of an ordinary fading channel logarithmically increases with SNR. On the contrary, the secrecy capacity converges into a limit which can be an upper bound on the secrecy capacity over the fading wiretap channel. We find a closed form of the upper bound for the correlated Rayleigh wiretap channel which also includes the independent case as a special one. Our work shows that the upper bound is determined by only two channel parameters; the correlation coefficient and the ratio of the main to the eavesdropper channel gains that will be called PCC and CGR respectively. The analysis of the upper bound tells how the two channel parameters affect the secrecy capacity and leads to the conclusion that the excessively large signal power does not provide any advantage in the secrecy capacity, and the loss due to the correlation is especially serious in low CGR regime.<|reference_end|> | arxiv | @article{jeon2008secrecy,
title={Secrecy Capacity over Correlated Ergodic Fading Channel},
author={Hyoungsuk Jeon, Namshik Kim, Minki Kim, Hyuckjae Lee, and Jeongseok Ha},
journal={arXiv preprint arXiv:0809.5212},
year={2008},
archivePrefix={arXiv},
eprint={0809.5212},
primaryClass={cs.IT math.IT}
} | jeon2008secrecy |
arxiv-5039 | 0809.5217 | Linear Universal Decoding for Compound Channels: a Local to Global Geometric Approach | <|reference_start|>Linear Universal Decoding for Compound Channels: a Local to Global Geometric Approach: Over discrete memoryless channels (DMC), linear decoders (maximizing additive metrics) afford several nice properties. In particular, if suitable encoders are employed, the use of decoding algorithm with manageable complexities is permitted. Maximum likelihood is an example of linear decoder. For a compound DMC, decoders that perform well without the channel's knowledge are required in order to achieve capacity. Several such decoders have been studied in the literature. However, there is no such known decoder which is linear. Hence, the problem of finding linear decoders achieving capacity for compound DMC is addressed, and it is shown that under minor concessions, such decoders exist and can be constructed. This paper also develops a "local geometric analysis", which allows in particular, to solve the above problem. By considering very noisy channels, the original problem is reduced, in the limit, to an inner product space problem, for which insightful solutions can be found. The local setting can then provide counterexamples to disproof claims, but also, it is shown how in this problem, results proven locally can be "lifted" to results proven globally.<|reference_end|> | arxiv | @article{abbe2008linear,
title={Linear Universal Decoding for Compound Channels: a Local to Global
Geometric Approach},
author={Emmanuel Abbe and Lizhong Zheng},
journal={arXiv preprint arXiv:0809.5217},
year={2008},
archivePrefix={arXiv},
eprint={0809.5217},
primaryClass={cs.IT math.IT math.PR}
} | abbe2008linear |
arxiv-5040 | 0809.5238 | Mode Change Protocol for Multi-Mode Real-Time Systems upon Identical Multiprocessors | <|reference_start|>Mode Change Protocol for Multi-Mode Real-Time Systems upon Identical Multiprocessors: In this paper, we propose a synchronous protocol without periodicity for scheduling multi-mode real-time systems upon identical multiprocessor platforms. Our proposal can be considered to be a multiprocessor extension of the uniprocessor protocol called "Minimal Single Offset protocol".<|reference_end|> | arxiv | @article{nélis2008mode,
title={Mode Change Protocol for Multi-Mode Real-Time Systems upon Identical
Multiprocessors},
author={Vincent N'elis and Jo"el Goossens},
journal={arXiv preprint arXiv:0809.5238},
year={2008},
archivePrefix={arXiv},
eprint={0809.5238},
primaryClass={cs.OS}
} | nélis2008mode |
arxiv-5041 | 0809.5250 | The decline in the concentration of citations, 1900-2007 | <|reference_start|>The decline in the concentration of citations, 1900-2007: This paper challenges recent research (Evans, 2008) reporting that the concentration of cited scientific literature increases with the online availability of articles and journals. Using Thomson Reuters' Web of Science, the present paper analyses changes in the concentration of citations received (two- and five-year citation windows) by papers published between 1900 and 2005. Three measures of concentration are used: the percentage of papers that received at least one citation (cited papers); the percentage of papers needed to account for 20, 50 and 80 percent of the citations; and, the Herfindahl-Hirschman index. These measures are used for four broad disciplines: natural sciences and engineering, medical fields, social sciences, and the humanities. All these measures converge and show that, contrary to what was reported by Evans, the dispersion of citations is actually increasing.<|reference_end|> | arxiv | @article{lariviere2008the,
title={The decline in the concentration of citations, 1900-2007},
author={Vincent Lariviere, Yves Gingras, Eric Archambault},
journal={arXiv preprint arXiv:0809.5250},
year={2008},
archivePrefix={arXiv},
eprint={0809.5250},
primaryClass={physics.soc-ph cs.DL}
} | lariviere2008the |
arxiv-5042 | 0809.5266 | Checking Security Policy Compliance | <|reference_start|>Checking Security Policy Compliance: Ensuring compliance of organizations to federal regulations is a growing concern. This paper presents a framework and methods to verify whether an implemented low-level security policy is compliant to a high-level security policy. Our compliance checking framework is based on organizational and security metadata to support refinement of high-level concepts to implementation specific instances. Our work uses the results of refinement calculus to express valid refinement patterns and their properties. Intuitively, a low-level security policy is compliant to a high-level security policy if there is a valid refinement path from the high-level security policy to the low-level security policy. Our model is capable of detecting violations of security policies, failures to meet obligations, and capability and modal conflicts.<|reference_end|> | arxiv | @article{gowadia2008checking,
title={Checking Security Policy Compliance},
author={Vaibhav Gowadia, Csilla Farkas, Michiharu Kudo},
journal={arXiv preprint arXiv:0809.5266},
year={2008},
archivePrefix={arXiv},
eprint={0809.5266},
primaryClass={cs.CR}
} | gowadia2008checking |
arxiv-5043 | 0809.5275 | Coded Adaptive Linear Precoded Discrete Multitone Over PLC Channel | <|reference_start|>Coded Adaptive Linear Precoded Discrete Multitone Over PLC Channel: Discrete multitone modulation (DMT) systems exploit the capabilities of orthogonal subcarriers to cope efficiently with narrowband interference, high frequency attenuations and multipath fadings with the help of simple equalization filters. Adaptive linear precoded discrete multitone (LP-DMT) system is based on classical DMT, combined with a linear precoding component. In this paper, we investigate the bit and energy allocation algorithm of an adaptive LP-DMT system taking into account the channel coding scheme. A coded adaptive LPDMT system is presented in the power line communication (PLC) context with a loading algorithm which accommodates the channel coding gains in bit and energy calculations. The performance of a concatenated channel coding scheme, consisting of an inner Wei's 4-dimensional 16-states trellis code and an outer Reed-Solomon code, in combination with the proposed algorithm is analyzed. Theoretical coding gains are derived and simulation results are presented for a fixed target bit error rate in a multicarrier scenario under power spectral density constraint. Using a multipath model of PLC channel, it is shown that the proposed coded adaptive LP-DMT system performs better than coded DMT and can achieve higher throughput for PLC applications.<|reference_end|> | arxiv | @article{muhammad2008coded,
title={Coded Adaptive Linear Precoded Discrete Multitone Over PLC Channel},
author={Fahad Syed Muhammad (IETR), Jean-Yves Baudais (IETR),
Jean-Franc{c}ois H'elard (IETR), Matthieu Crussi`ere (IETR)},
journal={International Symposium on Power-Line Communications and Its
Applications, Jeju Island : Cor\'ee, R\'epublique de (2008)},
year={2008},
doi={10.1109/ISPLC.2008.4510410},
archivePrefix={arXiv},
eprint={0809.5275},
primaryClass={cs.IT math.IT}
} | muhammad2008coded |
arxiv-5044 | 0810.0033 | Complexity Classes as Mathematical Axioms | <|reference_start|>Complexity Classes as Mathematical Axioms: Treating a conjecture, P^#P != NP, on the separation of complexity classes as an axiom, an implication is found in three manifold topology with little obvious connection to complexity theory. This is reminiscent of Harvey Friedman's work on finitistic interpretations of large cardinal axioms.<|reference_end|> | arxiv | @article{freedman2008complexity,
title={Complexity Classes as Mathematical Axioms},
author={M. Freedman},
journal={arXiv preprint arXiv:0810.0033},
year={2008},
archivePrefix={arXiv},
eprint={0810.0033},
primaryClass={cs.CC math.GT}
} | freedman2008complexity |
arxiv-5045 | 0810.0052 | Planar Visibility Counting | <|reference_start|>Planar Visibility Counting: For a fixed virtual scene (=collection of simplices) S and given observer position p, how many elements of S are weakly visible (i.e. not fully occluded by others) from p? The present work explores the trade-off between query time and preprocessing space for these quantities in 2D: exactly, in the approximate deterministic, and in the probabilistic sense. We deduce the EXISTENCE of an O(m^2/n^2) space data structure for S that, given p and time O(log n), allows to approximate the ratio of occluded segments up to arbitrary constant absolute error; here m denotes the size of the Visibility Graph--which may be quadratic, but typically is just linear in the size n of the scene S. On the other hand, we present a data structure CONSTRUCTIBLE in O(n*log(n)+m^2*polylog(n)/k) preprocessing time and space with similar approximation properties and query time O(k*polylog n), where k<n is an arbitrary parameter. We describe an implementation of this approach and demonstrate the practical benefit of the parameter k to trade memory for query time in an empirical evaluation on three classes of benchmark scenes.<|reference_end|> | arxiv | @article{fischer2008planar,
title={Planar Visibility Counting},
author={Matthias Fischer, Matthias Hilbig, Claudius J"ahn, Friedhelm Meyer
auf der Heide and Martin Ziegler},
journal={arXiv preprint arXiv:0810.0052},
year={2008},
archivePrefix={arXiv},
eprint={0810.0052},
primaryClass={cs.CG cs.DS}
} | fischer2008planar |
arxiv-5046 | 0810.0068 | On the Index Coding Problem and its Relation to Network Coding and Matroid Theory | <|reference_start|>On the Index Coding Problem and its Relation to Network Coding and Matroid Theory: The \emph{index coding} problem has recently attracted a significant attention from the research community due to its theoretical significance and applications in wireless ad-hoc networks. An instance of the index coding problem includes a sender that holds a set of information messages $X=\{x_1,...,x_k\}$ and a set of receivers $R$. Each receiver $\rho=(x,H)\in R$ needs to obtain a message $x\in X$ and has prior \emph{side information} comprising a subset $H$ of $X$. The sender uses a noiseless communication channel to broadcast encoding of messages in $X$ to all clients. The objective is to find an encoding scheme that minimizes the number of transmissions required to satisfy the receivers' demands with \emph{zero error}. In this paper, we analyze the relation between the index coding problem, the more general network coding problem and the problem of finding a linear representation of a matroid. In particular, we show that any instance of the network coding and matroid representation problems can be efficiently reduced to an instance of the index coding problem. Our reduction implies that many important properties of the network coding and matroid representation problems carry over to the index coding problem. Specifically, we show that \emph{vector linear codes} outperform scalar linear codes and that vector linear codes are insufficient for achieving the optimum number of transmissions.<|reference_end|> | arxiv | @article{rouayheb2008on,
title={On the Index Coding Problem and its Relation to Network Coding and
Matroid Theory},
author={Salim Y. El Rouayheb, Alex Sprintson, Costas N. Georghiades},
journal={arXiv preprint arXiv:0810.0068},
year={2008},
archivePrefix={arXiv},
eprint={0810.0068},
primaryClass={cs.IT math.IT}
} | rouayheb2008on |
arxiv-5047 | 0810.0075 | Acerca del Algoritmo de Dijkstra | <|reference_start|>Acerca del Algoritmo de Dijkstra: In this paper we prove the correctness of Dijkstra's algorithm. We also discuss it and at the end we show an application.<|reference_end|> | arxiv | @article{salas2008acerca,
title={Acerca del Algoritmo de Dijkstra},
author={Alvaro Salas (Universidad de Caldas, Universidad Nacional de Colombia,
sede Manizales)},
journal={arXiv preprint arXiv:0810.0075},
year={2008},
archivePrefix={arXiv},
eprint={0810.0075},
primaryClass={cs.DS}
} | salas2008acerca |
arxiv-5048 | 0810.0135 | Occupancy distributions of homogeneous queueing systems under opportunistic scheduling | <|reference_start|>Occupancy distributions of homogeneous queueing systems under opportunistic scheduling: We analyze opportunistic schemes for transmission scheduling from one of $n$ homogeneous queues whose channel states fluctuate independently. Considered schemes consist of the LCQ policy, which transmits from a longest connected queue in the entire system, and its low-complexity variants that transmit from a longest queue within a randomly chosen subset of connected queues. A Markovian model is studied where mean packet transmission time is $n^{-1}$ and packet arrival rate is $\lambda<1$ per queue. Transient and equilibrium distributions of queue occupancies are obtained in the limit as the system size $n$ tends to infinity.<|reference_end|> | arxiv | @article{alanyali2008occupancy,
title={Occupancy distributions of homogeneous queueing systems under
opportunistic scheduling},
author={Murat Alanyali, Maxim Dashouk},
journal={arXiv preprint arXiv:0810.0135},
year={2008},
archivePrefix={arXiv},
eprint={0810.0135},
primaryClass={cs.PF cs.NI}
} | alanyali2008occupancy |
arxiv-5049 | 0810.0139 | Determining the Unithood of Word Sequences using a Probabilistic Approach | <|reference_start|>Determining the Unithood of Word Sequences using a Probabilistic Approach: Most research related to unithood were conducted as part of a larger effort for the determination of termhood. Consequently, novelties are rare in this small sub-field of term extraction. In addition, existing work were mostly empirically motivated and derived. We propose a new probabilistically-derived measure, independent of any influences of termhood, that provides dedicated measures to gather linguistic evidence from parsed text and statistical evidence from Google search engine for the measurement of unithood. Our comparative study using 1,825 test cases against an existing empirically-derived function revealed an improvement in terms of precision, recall and accuracy.<|reference_end|> | arxiv | @article{wong2008determining,
title={Determining the Unithood of Word Sequences using a Probabilistic
Approach},
author={Wilson Wong, Wei Liu, Mohammed Bennamoun},
journal={3rd International Joint Conference on Natural Language Processing
(IJCNLP), 2008, pages 103-110},
year={2008},
archivePrefix={arXiv},
eprint={0810.0139},
primaryClass={cs.AI}
} | wong2008determining |
arxiv-5050 | 0810.0154 | Optimization of sequences in CDMA systems: a statistical-mechanics approach | <|reference_start|>Optimization of sequences in CDMA systems: a statistical-mechanics approach: Statistical mechanics approach is useful not only in analyzing macroscopic system performance of wireless communication systems, but also in discussing design problems of wireless communication systems. In this paper, we discuss a design problem of spreading sequences in code-division multiple-access (CDMA) systems, as an example demonstrating the usefulness of statistical mechanics approach. We analyze, via replica method, the average mutual information between inputs and outputs of a randomly-spread CDMA channel, and discuss the optimization problem with the average mutual information as a measure of optimization. It has been shown that the average mutual information is maximized by orthogonally-invariant random Welch bound equality (WBE) spreading sequences.<|reference_end|> | arxiv | @article{kitagawa2008optimization,
title={Optimization of sequences in CDMA systems: a statistical-mechanics
approach},
author={Koichiro Kitagawa and Toshiyuki Tanaka},
journal={arXiv preprint arXiv:0810.0154},
year={2008},
archivePrefix={arXiv},
eprint={0810.0154},
primaryClass={cs.IT math.IT}
} | kitagawa2008optimization |
arxiv-5051 | 0810.0156 | Determining the Unithood of Word Sequences using Mutual Information and Independence Measure | <|reference_start|>Determining the Unithood of Word Sequences using Mutual Information and Independence Measure: Most works related to unithood were conducted as part of a larger effort for the determination of termhood. Consequently, the number of independent research that study the notion of unithood and produce dedicated techniques for measuring unithood is extremely small. We propose a new approach, independent of any influences of termhood, that provides dedicated measures to gather linguistic evidence from parsed text and statistical evidence from Google search engine for the measurement of unithood. Our evaluations revealed a precision and recall of 98.68% and 91.82% respectively with an accuracy at 95.42% in measuring the unithood of 1005 test cases.<|reference_end|> | arxiv | @article{wong2008determining,
title={Determining the Unithood of Word Sequences using Mutual Information and
Independence Measure},
author={Wilson Wong, Wei Liu, Mohammed Bennamoun},
journal={10th Conference of the Pacific Association for Computational
Linguistics (PACLING), 2007, pages 246-254},
year={2008},
number={CSSE-WWONG-13},
archivePrefix={arXiv},
eprint={0810.0156},
primaryClass={cs.AI}
} | wong2008determining |
arxiv-5052 | 0810.0200 | Distribution of complexities in the Vai script | <|reference_start|>Distribution of complexities in the Vai script: In the paper, we analyze the distribution of complexities in the Vai script, an indigenous syllabic writing system from Liberia. It is found that the uniformity hypothesis for complexities fails for this script. The models using Poisson distribution for the number of components and hyper-Poisson distribution for connections provide good fits in the case of the Vai script.<|reference_end|> | arxiv | @article{rovenchak2008distribution,
title={Distribution of complexities in the Vai script},
author={Andrij Rovenchak, J'an Mav{c}utek, Charles Riley},
journal={Glottometrics 18, 1-12 (2009)},
year={2008},
archivePrefix={arXiv},
eprint={0810.0200},
primaryClass={cs.CL}
} | rovenchak2008distribution |
arxiv-5053 | 0810.0264 | A Fast Generic Sequence Matching Algorithm | <|reference_start|>A Fast Generic Sequence Matching Algorithm: A string matching -- and more generally, sequence matching -- algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of comparisons (2n), and sublinear average-case behavior that is better than that of the fastest versions of the Boyer-Moore algorithm. The algorithm retains its efficiency advantages in a wide variety of sequence matching problems of practical interest, including traditional string matching; large-alphabet problems (as in Unicode strings); and small-alphabet, long-pattern problems (as in DNA searches). Since it is expressed as a generic algorithm for searching in sequences over an arbitrary type T, it is well suited for use in generic software libraries such as the C++ Standard Template Library. The algorithm was obtained by adding to the Knuth-Morris-Pratt algorithm one of the pattern-shifting techniques from the Boyer-Moore algorithm, with provision for use of hashing in this technique. In situations in which a hash function or random access to the sequences is not available, the algorithm falls back to an optimized version of the Knuth-Morris-Pratt algorithm.<|reference_end|> | arxiv | @article{musser2008a,
title={A Fast Generic Sequence Matching Algorithm},
author={David R. Musser, Gor V. Nishanov},
journal={arXiv preprint arXiv:0810.0264},
year={2008},
archivePrefix={arXiv},
eprint={0810.0264},
primaryClass={cs.DS}
} | musser2008a |
arxiv-5054 | 0810.0322 | Non-negative mixed finite element formulations for a tensorial diffusion equation | <|reference_start|>Non-negative mixed finite element formulations for a tensorial diffusion equation: We consider the tensorial diffusion equation, and address the discrete maximum-minimum principle of mixed finite element formulations. In particular, we address non-negative solutions (which is a special case of the maximum-minimum principle) of mixed finite element formulations. The discrete maximum-minimum principle is the discrete version of the maximum-minimum principle. In this paper we present two non-negative mixed finite element formulations for tensorial diffusion equations based on constrained optimization techniques (in particular, quadratic programming). These proposed mixed formulations produce non-negative numerical solutions on arbitrary meshes for low-order (i.e., linear, bilinear and trilinear) finite elements. The first formulation is based on the Raviart-Thomas spaces, and is obtained by adding a non-negative constraint to the variational statement of the Raviart-Thomas formulation. The second non-negative formulation based on the variational multiscale formulation. For the former formulation we comment on the affect of adding the non-negative constraint on the local mass balance property of the Raviart-Thomas formulation. We also study the performance of the active set strategy for solving the resulting constrained optimization problems. The overall performance of the proposed formulation is illustrated on three canonical test problems.<|reference_end|> | arxiv | @article{nakshatrala2008non-negative,
title={Non-negative mixed finite element formulations for a tensorial diffusion
equation},
author={K.B. Nakshatrala and A.J.Valocchi},
journal={arXiv preprint arXiv:0810.0322},
year={2008},
doi={10.1016/j.jcp.2009.05.039},
archivePrefix={arXiv},
eprint={0810.0322},
primaryClass={cs.NA}
} | nakshatrala2008non-negative |
arxiv-5055 | 0810.0326 | Collision Resolution by Exploiting Symbol Misalignment | <|reference_start|>Collision Resolution by Exploiting Symbol Misalignment: This paper presents CRESM, a novel collision resolution method for decoding collided packets in random-access wireless networks. In a collision, overlapping signals from several sources are received simultaneously at a receiver. CRESM exploits symbol misalignment among the overlapping signals to recover the individual packets. CRESM can be adopted in 802.11 networks without modification of the transmitter design; only a simple DSP technique is needed at the receiver to decode the overlapping signals. Our simulations indicate that CRESM has better BER performance than the simplistic Successive Interference Cancellation (SIC) technique that treats interference as noise, for almost all SNR regimes. The implication of CRESM for random-access networking is significant: in general, using CRESM to resolve collisions of up to n packets, network throughput can be boosted by more than n times if the transmitters are allowed to transmit more aggressively in the MAC protocol.<|reference_end|> | arxiv | @article{lu2008collision,
title={Collision Resolution by Exploiting Symbol Misalignment},
author={Lu Lu, Soung Chang Liew, Shengli Zhang},
journal={arXiv preprint arXiv:0810.0326},
year={2008},
archivePrefix={arXiv},
eprint={0810.0326},
primaryClass={cs.NI cs.IT math.IT}
} | lu2008collision |
arxiv-5056 | 0810.0328 | Efficient Defence against Misbehaving TCP Receiver DoS Attacks | <|reference_start|>Efficient Defence against Misbehaving TCP Receiver DoS Attacks: The congestion control algorithm of TCP relies on correct feedback from the receiver to determine the rate at which packets should be sent into the network. Hence, correct receiver feedback (in the form of TCP acknowledgements) is essential to the goal of sharing the scarce bandwidth resources fairly and avoiding congestion collapse in the Internet. However, the assumption that a TCP receiver can always be trusted (to generate feedback correctly) no longer holds as there are plenty of incentives for a receiver to deviate from the protocol. In fact, it has been shown that a misbehaving receiver (whose aim is to bring about congestion collapse) can easily generate acknowledgements to conceal packet loss, so as to drive a number of honest, innocent senders arbitrarily fast to create a significant number of non-responsive packet flows, leading to denial of service to other Internet users. We give the first formal treatment to this problem. We also give an efficient, provably secure mechanism to force a receiver to generate feedback correctly; any incorrect acknowledgement will be detected at the sender and cheating TCP receivers would be identified. The idea is as follows: for each packet sent, the sender generates a tag using a secret key (known to himself only); the receiver could generate a proof using the packet and the tag alone, and send it to the sender; the sender can then verify the proof using the secret key; an incorrect proof would indicate a cheating receiver. The scheme is very efficient in the sense that the TCP sender does not need to store the packet or the tag, and the proofs for multiple packets can be aggregated at the receiver. The scheme is based on an aggregate authenticator. In addition, the proposed solution can be applied to network-layer rate-limiting architectures requiring correct feedback.<|reference_end|> | arxiv | @article{chan2008efficient,
title={Efficient Defence against Misbehaving TCP Receiver DoS Attacks},
author={Aldar C-F. Chan},
journal={Computer Networks, 2011},
year={2008},
doi={10.1016/j.comnet.2011.08.004},
archivePrefix={arXiv},
eprint={0810.0328},
primaryClass={cs.CR cs.NI}
} | chan2008efficient |
arxiv-5057 | 0810.0332 | Enhanced Integrated Scoring for Cleaning Dirty Texts | <|reference_start|>Enhanced Integrated Scoring for Cleaning Dirty Texts: An increasing number of approaches for ontology engineering from text are gearing towards the use of online sources such as company intranet and the World Wide Web. Despite such rise, not much work can be found in aspects of preprocessing and cleaning dirty texts from online sources. This paper presents an enhancement of an Integrated Scoring for Spelling error correction, Abbreviation expansion and Case restoration (ISSAC). ISSAC is implemented as part of a text preprocessing phase in an ontology engineering system. New evaluations performed on the enhanced ISSAC using 700 chat records reveal an improved accuracy of 98% as compared to 96.5% and 71% based on the use of only basic ISSAC and of Aspell, respectively.<|reference_end|> | arxiv | @article{wong2008enhanced,
title={Enhanced Integrated Scoring for Cleaning Dirty Texts},
author={Wilson Wong, Wei Liu, Mohammed Bennamoun},
journal={IJCAI Workshop on Analytics for Noisy Unstructured Text Data
(AND), 2007, pages 55-62},
year={2008},
archivePrefix={arXiv},
eprint={0810.0332},
primaryClass={cs.AI}
} | wong2008enhanced |
arxiv-5058 | 0810.0372 | Optimizing Binary Code Produced by Valgrind (Project Report on Virtual Execution Environments Course - AVExe) | <|reference_start|>Optimizing Binary Code Produced by Valgrind (Project Report on Virtual Execution Environments Course - AVExe): Valgrind is a widely used framework for dynamic binary instrumentation and its mostly known by its memcheck tool. Valgrind's code generation module is far from producing optimal code. In addition it has many backends for different CPU architectures, which difficults code optimization in an architecture independent way. Our work focused on identifying sub-optimal code produced by Valgrind and optimizing it.<|reference_end|> | arxiv | @article{cabecinhas2008optimizing,
title={Optimizing Binary Code Produced by Valgrind (Project Report on Virtual
Execution Environments Course - AVExe)},
author={Filipe Cabecinhas and Nuno Lopes and Renato Crisostomo and Luis Veiga},
journal={arXiv preprint arXiv:0810.0372},
year={2008},
archivePrefix={arXiv},
eprint={0810.0372},
primaryClass={cs.PL cs.OS}
} | cabecinhas2008optimizing |
arxiv-5059 | 0810.0394 | Mobility Management Framework | <|reference_start|>Mobility Management Framework: This paper investigates mobility management strategies from the point of view of their need of signalling and processing resources on the backbone network and load on the air interface. A method is proposed to model the serving network and mobile node mobility in order to be able to compare the different types of mobility management algorithms. To obtain a good description of the network we calculate descriptive parameters from given topologies. Most mobility approaches derived from existing protocols are analyzed and their performances are numerically compared in various network and mobility scenarios. We developed a mobility management framework that is able to give general designing guidelines for the next generation mobility managements on given network, technology and mobility properties. With our model an operator can design the network and tune the parameters to obtain the optimal implementation of course revising existing systems is also possible. We present a vertical handover decision method as a special application of our model framework.<|reference_end|> | arxiv | @article{fulop2008mobility,
title={Mobility Management Framework},
author={Peter Fulop, Benedek Kovacs, Sandor Imre},
journal={arXiv preprint arXiv:0810.0394},
year={2008},
archivePrefix={arXiv},
eprint={0810.0394},
primaryClass={cs.PF cs.NI}
} | fulop2008mobility |
arxiv-5060 | 0810.0486 | Peer-review in the Internet age | <|reference_start|>Peer-review in the Internet age: The importance of peer-review in the scientific process can not be overestimated. Yet, due to increasing pressures of research and exponentially growing number of publications the task faced by the referees becomes ever more difficult. We discuss here a few possible improvements that would enable more efficient review of the scientific literature, using the growing Internet connectivity. In particular, a practical automated model for providing the referees with references to papers that might have strong relationship with the work under review, based on general network properties of citations is proposed.<|reference_end|> | arxiv | @article{sobkowicz2008peer-review,
title={Peer-review in the Internet age},
author={Pawel Sobkowicz},
journal={arXiv preprint arXiv:0810.0486},
year={2008},
archivePrefix={arXiv},
eprint={0810.0486},
primaryClass={physics.soc-ph cs.DL}
} | sobkowicz2008peer-review |
arxiv-5061 | 0810.0503 | On the Capacity of One-sided Two user Gaussian Fading Broadcast Channels | <|reference_start|>On the Capacity of One-sided Two user Gaussian Fading Broadcast Channels: In this paper, we investigate upper and lower bounds on the capacity of two-user fading broadcast channels where one of the users has a constant (non-fading) channel. We use the Costa entropy power inequality (EPI) along with an optimization framework to derive upper bounds on the sum-capacity and superposition coding to obtain lower bounds on the sum-rate for this channel. For this fading broadcast channel where one channel is constant, we find that the upper and lower bounds meet under special cases, and in general, we show that the achievable sum-rate comes within a constant of the outer bound.<|reference_end|> | arxiv | @article{jafarian2008on,
title={On the Capacity of One-sided Two user Gaussian Fading Broadcast Channels},
author={Amin Jafarian, Sriram Vishwanath},
journal={arXiv preprint arXiv:0810.0503},
year={2008},
archivePrefix={arXiv},
eprint={0810.0503},
primaryClass={cs.IT math.IT}
} | jafarian2008on |
arxiv-5062 | 0810.0532 | Three New Complexity Results for Resource Allocation Problems | <|reference_start|>Three New Complexity Results for Resource Allocation Problems: We prove the following results for task allocation of indivisible resources: - The problem of finding a leximin-maximal resource allocation is in P if the agents have max-utility functions and atomic demands. - Deciding whether a resource allocation is Pareto-optimal is coNP-complete for agents with (1-)additive utility functions. - Deciding whether there exists a Pareto-optimal and envy-free resource allocation is Sigma_2^p-complete for agents with (1-)additive utility functions.<|reference_end|> | arxiv | @article{de keijzer2008three,
title={Three New Complexity Results for Resource Allocation Problems},
author={Bart de Keijzer},
journal={arXiv preprint arXiv:0810.0532},
year={2008},
archivePrefix={arXiv},
eprint={0810.0532},
primaryClass={cs.MA cs.AI cs.CC cs.GT}
} | de keijzer2008three |
arxiv-5063 | 0810.0558 | The Ratio Index for Budgeted Learning, with Applications | <|reference_start|>The Ratio Index for Budgeted Learning, with Applications: In the budgeted learning problem, we are allowed to experiment on a set of alternatives (given a fixed experimentation budget) with the goal of picking a single alternative with the largest possible expected payoff. Approximation algorithms for this problem were developed by Guha and Munagala by rounding a linear program that couples the various alternatives together. In this paper we present an index for this problem, which we call the ratio index, which also guarantees a constant factor approximation. Index-based policies have the advantage that a single number (i.e. the index) can be computed for each alternative irrespective of all other alternatives, and the alternative with the highest index is experimented upon. This is analogous to the famous Gittins index for the discounted multi-armed bandit problem. The ratio index has several interesting structural properties. First, we show that it can be computed in strongly polynomial time. Second, we show that with the appropriate discount factor, the Gittins index and our ratio index are constant factor approximations of each other, and hence the Gittins index also gives a constant factor approximation to the budgeted learning problem. Finally, we show that the ratio index can be used to create an index-based policy that achieves an O(1)-approximation for the finite horizon version of the multi-armed bandit problem. Moreover, the policy does not require any knowledge of the horizon (whereas we compare its performance against an optimal strategy that is aware of the horizon). This yields the following surprising result: there is an index-based policy that achieves an O(1)-approximation for the multi-armed bandit problem, oblivious to the underlying discount factor.<|reference_end|> | arxiv | @article{goel2008the,
title={The Ratio Index for Budgeted Learning, with Applications},
author={Ashish Goel, Sanjeev Khanna, Brad Null},
journal={arXiv preprint arXiv:0810.0558},
year={2008},
archivePrefix={arXiv},
eprint={0810.0558},
primaryClass={cs.DS}
} | goel2008the |
arxiv-5064 | 0810.0567 | Reed-Solomon Subcodes with Nontrivial Traces: Distance Properties and Soft-Decision Decoding | <|reference_start|>Reed-Solomon Subcodes with Nontrivial Traces: Distance Properties and Soft-Decision Decoding: Reed-Solomon (RS) codes over GF$(2^m)$ have traditionally been the most popular non-binary codes in almost all practical applications. The distance properties of RS codes result in excellent performance under hard-decision bounded-distance decoding. However, efficient and implementable soft decoding for high-rate (about 0.9) RS codes over large fields (GF(256), say) continues to remain a subject of research with a promise of further coding gains. In this work, our objective is to propose and investigate $2^m$-ary codes with non-trivial binary trace codes as an alternative to RS codes. We derive bounds on the rate of a $2^m$-ary code with a non-trivial binary trace code. Then we construct certain subcodes of RS codes over GF($2^m$) that have a non-trivial binary trace with distances and rates meeting the derived bounds. The properties of these subcodes are studied and low-complexity hard-decision and soft-decision decoders are proposed. The decoders are analyzed, and their performance is compared with that of comparable RS codes. Our results suggest that these subcodes of RS codes could be viable alternatives for RS codes in applications.<|reference_end|> | arxiv | @article{thangaraj2008reed-solomon,
title={Reed-Solomon Subcodes with Nontrivial Traces: Distance Properties and
Soft-Decision Decoding},
author={Andrew Thangaraj and Safitha J Raj},
journal={arXiv preprint arXiv:0810.0567},
year={2008},
archivePrefix={arXiv},
eprint={0810.0567},
primaryClass={cs.IT math.IT}
} | thangaraj2008reed-solomon |
arxiv-5065 | 0810.0674 | Packing multiway cuts in capacitated graphs | <|reference_start|>Packing multiway cuts in capacitated graphs: We consider the following "multiway cut packing" problem in undirected graphs: we are given a graph G=(V,E) and k commodities, each corresponding to a set of terminals located at different vertices in the graph; our goal is to produce a collection of cuts {E_1,...,E_k} such that E_i is a multiway cut for commodity i and the maximum load on any edge is minimized. The load on an edge is defined to be the number of cuts in the solution crossing the edge. In the capacitated version of the problem the goal is to minimize the maximum relative load on any edge--the ratio of the edge's load to its capacity. Multiway cut packing arises in the context of graph labeling problems where we are given a partial labeling of a set of items and a neighborhood structure over them, and, informally, the goal is to complete the labeling in the most consistent way. This problem was introduced by Rabani, Schulman, and Swamy (SODA'08), who developed an O(log n/log log n) approximation for it in general graphs, as well as an improved O(log^2 k) approximation in trees. Here n is the number of nodes in the graph. We present the first constant factor approximation for this problem in arbitrary undirected graphs. Our approach is based on the observation that every instance of the problem admits a near-optimal laminar solution (that is, one in which no pair of cuts cross each other).<|reference_end|> | arxiv | @article{barman2008packing,
title={Packing multiway cuts in capacitated graphs},
author={Siddharth Barman and Shuchi Chawla},
journal={arXiv preprint arXiv:0810.0674},
year={2008},
archivePrefix={arXiv},
eprint={0810.0674},
primaryClass={cs.DS}
} | barman2008packing |
arxiv-5066 | 0810.0693 | Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies | <|reference_start|>Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies: A central problem in quantum computational complexity is how to prevent entanglement-assisted cheating in multi-prover interactive proof systems. It is well-known that the standard oracularization technique completely fails in some proof systems under the existence of prior entanglement. This paper studies two constructions of two-prover one-round interactive proof systems based on oracularization. First, it is proved that the two-prover one-round interactive proof system for PSPACE by Cai, Condon, and Lipton still achieves exponentially small soundness error in the existence of prior entanglement between dishonest provers (and more strongly, even if dishonest provers are allowed to use arbitrary no-signaling strategies). It follows that, unless the polynomial-time hierarchy collapses to the second level, two-prover systems are still advantageous to single-prover systems even when only malicious provers can use quantum information. Second, it is proved that the two-prover one-round interactive proof system obtained by oracularizing a three-query probabilistically checkable proof system becomes sound in a weak sense even against dishonest entangled provers with the help of a dummy question. As a consequence, every language in NEXP has a two-prover one-round interactive proof system of perfect completeness, albeit with exponentially small gap between completeness and soundness, in which each prover responds with only two bits. In other words, it is NP-hard to approximate within an inverse-polynomial the value of a classical two-prover one-round game, even when provers are entangled and each sends a two-bit answer to a verifier.<|reference_end|> | arxiv | @article{ito2008oracularization,
title={Oracularization and Two-Prover One-Round Interactive Proofs against
Nonlocal Strategies},
author={Tsuyoshi Ito, Hirotada Kobayashi, Keiji Matsumoto},
journal={arXiv preprint arXiv:0810.0693},
year={2008},
archivePrefix={arXiv},
eprint={0810.0693},
primaryClass={quant-ph cs.CC cs.CR}
} | ito2008oracularization |
arxiv-5067 | 0810.0745 | Stackelberg Contention Games in Multiuser Networks | <|reference_start|>Stackelberg Contention Games in Multiuser Networks: Interactions among selfish users sharing a common transmission channel can be modeled as a non-cooperative game using the game theory framework. When selfish users choose their transmission probabilities independently without any coordination mechanism, Nash equilibria usually result in a network collapse. We propose a methodology that transforms the non-cooperative game into a Stackelberg game. Stackelberg equilibria of the Stackelberg game can overcome the deficiency of the Nash equilibria of the original game. A particular type of Stackelberg intervention is constructed to show that any positive payoff profile feasible with independent transmission probabilities can be achieved as a Stackelberg equilibrium payoff profile. We discuss criteria to select an operating point of the network and informational requirements for the Stackelberg game. We relax the requirements and examine the effects of relaxation on performance.<|reference_end|> | arxiv | @article{park2008stackelberg,
title={Stackelberg Contention Games in Multiuser Networks},
author={Jaeok Park and Mihaela van der Schaar},
journal={EURASIP Journal on Advances in Signal Processing, vol. 2009,
Article ID 305978, 15 pages, 2009},
year={2008},
doi={10.1155/2009/305978},
archivePrefix={arXiv},
eprint={0810.0745},
primaryClass={cs.GT cs.NI}
} | park2008stackelberg |
arxiv-5068 | 0810.0747 | A New Upper Bound on the Capacity of a Class of Primitive Relay Channels | <|reference_start|>A New Upper Bound on the Capacity of a Class of Primitive Relay Channels: We obtain a new upper bound on the capacity of a class of discrete memoryless relay channels. For this class of relay channels, the relay observes an i.i.d. sequence $T$, which is independent of the channel input $X$. The channel is described by a set of probability transition functions $p(y|x,t)$ for all $(x,t,y)\in \mathcal{X}\times \mathcal{T}\times \mathcal{Y}$. Furthermore, a noiseless link of finite capacity $R_{0}$ exists from the relay to the receiver. Although the capacity for these channels is not known in general, the capacity of a subclass of these channels, namely when $T=g(X,Y)$, for some deterministic function $g$, was obtained in [1] and it was shown to be equal to the cut-set bound. Another instance where the capacity was obtained was in [2], where the channel output $Y$ can be written as $Y=X\oplus Z$, where $\oplus$ denotes modulo-$m$ addition, $Z$ is independent of $X$, $|\mathcal{X}|=|\mathcal{Y}|=m$, and $T$ is some stochastic function of $Z$. The compress-and-forward (CAF) achievability scheme [3] was shown to be capacity achieving in both cases. Using our upper bound we recover the capacity results of [1] and [2]. We also obtain the capacity of a class of channels which does not fall into either of the classes studied in [1] and [2]. For this class of channels, CAF scheme is shown to be optimal but capacity is strictly less than the cut-set bound for certain values of $R_{0}$. We also evaluate our outer bound for a particular relay channel with binary multiplicative states and binary additive noise for which the channel is given as $Y=TX+N$. We show that our upper bound is strictly better than the cut-set upper bound for certain values of $R_{0}$ but it lies strictly above the rates yielded by the CAF achievability scheme.<|reference_end|> | arxiv | @article{tandon2008a,
title={A New Upper Bound on the Capacity of a Class of Primitive Relay Channels},
author={Ravi Tandon, Sennur Ulukus},
journal={arXiv preprint arXiv:0810.0747},
year={2008},
archivePrefix={arXiv},
eprint={0810.0747},
primaryClass={cs.IT cs.AI math.IT}
} | tandon2008a |
arxiv-5069 | 0810.0753 | Definition and Implementation of a Points-To Analysis for C-like Languages | <|reference_start|>Definition and Implementation of a Points-To Analysis for C-like Languages: The points-to problem is the problem of determining the possible run-time targets of pointer variables and is usually considered part of the more general aliasing problem, which consists in establishing whether and when different expressions can refer to the same memory address. Aliasing information is essential to every tool that needs to reason about the semantics of programs. However, due to well-known undecidability results, for all interesting languages that admit aliasing, the exact solution of nontrivial aliasing problems is not generally computable. This work focuses on approximated solutions to this problem by presenting a store-based, flow-sensitive points-to analysis, for applications in the field of automated software verification. In contrast to software testing procedures, which heuristically check the program against a finite set of executions, the methods considered in this work are static analyses, where the computed results are valid for all the possible executions of the analyzed program. We present a simplified programming language and its execution model; then an approximated execution model is developed using the ideas of abstract interpretation theory. Finally, the soundness of the approximation is formally proved. The aim of developing a realistic points-to analysis is pursued by presenting some extensions to the initial simplified model and discussing the correctness of their formulation. This work contains original contributions to the issue of points-to analysis, as it provides a formulation of a filter operation on the points-to abstract domain and a formal proof of the soundness of the defined abstract operations: these, as far as we now, are lacking from the previous literature.<|reference_end|> | arxiv | @article{soffia2008definition,
title={Definition and Implementation of a Points-To Analysis for C-like
Languages},
author={Stefano Soffia},
journal={arXiv preprint arXiv:0810.0753},
year={2008},
archivePrefix={arXiv},
eprint={0810.0753},
primaryClass={cs.PL}
} | soffia2008definition |
arxiv-5070 | 0810.0763 | Errorless Codes for Over-loaded CDMA with Active User Detection | <|reference_start|>Errorless Codes for Over-loaded CDMA with Active User Detection: In this paper we introduce a new class of codes for over-loaded synchronous wireless CDMA systems which increases the number of users for a fixed number of chips without introducing any errors. In addition these codes support active user detection. We derive an upper bound on the number of users with a fixed spreading factor. Also we propose an ML decoder for a subclass of these codes that is computationally implementable. Although for our simulations we consider a scenario that is worse than what occurs in practice, simulation results indicate that this coding/decoding scheme is robust against additive noise. As an example, for 64 chips and 88 users we propose a coding/decoding scheme that can obtain an arbitrary small probability of error which is computationally feasible and can detect active users. Furthermore, we prove that for this to be possible the number of users cannot be beyond 230.<|reference_end|> | arxiv | @article{pad2008errorless,
title={Errorless Codes for Over-loaded CDMA with Active User Detection},
author={Pedram Pad, Mahdi Soltanolkotabi, Saeed Hadikhanlou, Arash Enayati,
and Farokh Marvasti},
journal={arXiv preprint arXiv:0810.0763},
year={2008},
archivePrefix={arXiv},
eprint={0810.0763},
primaryClass={cs.IT math.IT}
} | pad2008errorless |
arxiv-5071 | 0810.0764 | A New Method for Constructing Large Size WBE Codes with Low Complexity ML Decoder | <|reference_start|>A New Method for Constructing Large Size WBE Codes with Low Complexity ML Decoder: In this paper we wish to introduce a method to reconstruct large size Welch Bound Equality (WBE) codes from small size WBE codes. The advantage of these codes is that the implementation of ML decoder for the large size codes is reduced to implementation of ML decoder for the core codes. This leads to a drastic reduction of the computational cost of ML decoder. Our method can also be used for constructing large Binary WBE (BWBE) codes from smaller ones. Additionally, we explain that although WBE codes are maximizing the sum channel capacity when the inputs are real valued, they are not necessarily appropriate when the input alphabet is binary. The discussion shows that when the input alphabet is binary, the Total Squared Correlation (TSC) of codes is not a proper figure of merit.<|reference_end|> | arxiv | @article{faraji2008a,
title={A New Method for Constructing Large Size WBE Codes with Low Complexity
ML Decoder},
author={Mohammad Javad Faraji, Pedram Pad, and Farokh Marvasti},
journal={arXiv preprint arXiv:0810.0764},
year={2008},
archivePrefix={arXiv},
eprint={0810.0764},
primaryClass={cs.IT math.IT}
} | faraji2008a |
arxiv-5072 | 0810.0785 | Novel Bounds on the Capacity of the Binary Deletion Channel | <|reference_start|>Novel Bounds on the Capacity of the Binary Deletion Channel: We present novel bounds on the capacity of the independent and identically distributed binary deletion channel. Four upper bounds are obtained by providing the transmitter and the receiver with genie-aided information on suitably-defined random processes. Since some of the proposed bounds involve infinite series, we also introduce provable inequalities that lead to more manageable results. For most values of the deletion probability, these bounds improve the existing ones and significantly narrow the gap with the available lower bounds. Exploiting the same auxiliary processes, we also derive, as a by-product, a couple of very simple lower bounds on the channel capacity, which, for low values of the deletion probability, are almost as good as the best existing lower bounds.<|reference_end|> | arxiv | @article{fertonani2008novel,
title={Novel Bounds on the Capacity of the Binary Deletion Channel},
author={Dario Fertonani and Tolga M. Duman},
journal={arXiv preprint arXiv:0810.0785},
year={2008},
archivePrefix={arXiv},
eprint={0810.0785},
primaryClass={cs.IT math.IT}
} | fertonani2008novel |
arxiv-5073 | 0810.0800 | Condition Numbers of Gaussian Random Matrices | <|reference_start|>Condition Numbers of Gaussian Random Matrices: Let $G_{m \times n}$ be an $m \times n$ real random matrix whose elements are independent and identically distributed standard normal random variables, and let $\kappa_2(G_{m \times n})$ be the 2-norm condition number of $G_{m \times n}$. We prove that, for any $m \geq 2$, $n \geq 2$ and $x \geq |n-m|+1$, $\kappa_2(G_{m \times n})$ satisfies $ \frac{1}{\sqrt{2\pi}} ({c}/{x})^{|n-m|+1} < P(\frac{\kappa_2(G_{m \times n})} {{n}/{(|n-m|+1)}}> x) < \frac{1}{\sqrt{2\pi}} ({C}/{x})^{|n-m|+1}, $ where $0.245 \leq c \leq 2.000$ and $ 5.013 \leq C \leq 6.414$ are universal positive constants independent of $m$, $n$ and $x$. Moreover, for any $m \geq 2$ and $n \geq 2$, $ E(\log\kappa_2(G_{m \times n})) < \log \frac{n}{|n-m|+1} + 2.258. $ A similar pair of results for complex Gaussian random matrices is also established.<|reference_end|> | arxiv | @article{chen2008condition,
title={Condition Numbers of Gaussian Random Matrices},
author={Zizhong Chen and Jack Dongarra},
journal={arXiv preprint arXiv:0810.0800},
year={2008},
archivePrefix={arXiv},
eprint={0810.0800},
primaryClass={cs.NA}
} | chen2008condition |
arxiv-5074 | 0810.0830 | Stiffness Analysis Of Multi-Chain Parallel Robotic Systems | <|reference_start|>Stiffness Analysis Of Multi-Chain Parallel Robotic Systems: The paper presents a new stiffness modelling method for multi-chain parallel robotic manipulators with flexible links and compliant actuating joints. In contrast to other works, the method involves a FEA-based link stiffness evaluation and employs a new solution strategy of the kinetostatic equations, which allows computing the stiffness matrix for singular postures and to take into account influence of the internal forces. The advantages of the developed technique are confirmed by application examples, which deal with stiffness analysis of the Orthoglide manipulator.<|reference_end|> | arxiv | @article{pashkevich2008stiffness,
title={Stiffness Analysis Of Multi-Chain Parallel Robotic Systems},
author={Anatoly Pashkevich (IRCCyN), Damien Chablat (IRCCyN), Philippe Wenger
(IRCCyN)},
journal={9th IFAC Workshop on Intelligent Manufacturing Systems, France
(2008)},
year={2008},
archivePrefix={arXiv},
eprint={0810.0830},
primaryClass={cs.RO physics.class-ph}
} | pashkevich2008stiffness |
arxiv-5075 | 0810.0852 | Evaluation of Authors and Journals | <|reference_start|>Evaluation of Authors and Journals: A method is presented for evaluating authors on the basis of citations. It assigns to each author a citation score which depends upon the number of times he is cited, and upon the scores of the citers. The scores are found to be the components of an eigenvector of a normalized citation matrix. The same method can be applied to citation of journals by other journals, to evaluating teams in a league [1], etc.<|reference_end|> | arxiv | @article{keller2008evaluation,
title={Evaluation of Authors and Journals},
author={Joseph B. Keller},
journal={arXiv preprint arXiv:0810.0852},
year={2008},
archivePrefix={arXiv},
eprint={0810.0852},
primaryClass={math.HO cs.IR physics.soc-ph}
} | keller2008evaluation |
arxiv-5076 | 0810.0870 | Cognitive Radio with Partial Channel State Information at the Transmitter | <|reference_start|>Cognitive Radio with Partial Channel State Information at the Transmitter: In this paper, we present the cognitive radio system design with partial channel state information known at the transmitter (CSIT).We replace the dirty paper coding (DPC) used in the cognitive radio with full CSIT by the linear assignment Gel'fand-Pinsker coding (LA-GPC), which can utilize the limited knowledge of the channel more efficiently. Based on the achievable rate derived from the LA-GPC, two optimization problems under the fast and slow fading channels are formulated. We derive semianalytical solutions to find the relaying ratios and precoding coefficients. The critical observation is that the complex rate functions in these problems are closely related to ratios of quadratic form. Simulation results show that the proposed semi-analytical solutions perform close to the optimal solutions found by brute-force search, and outperform the systems based on naive DPC. Asymptotic analysis also shows that these solutions converge to the optimal ones solved with full CSIT when the K-factor of Rician channel approaches infinity. Moreover, a new coding scheme is proposed to implement the LA-GPC in practice. Simulation results show that the proposed practical coding scheme can efficiently reach the theoretical rate performance.<|reference_end|> | arxiv | @article{lin2008cognitive,
title={Cognitive Radio with Partial Channel State Information at the
Transmitter},
author={Pin-Hsun Lin, Shih-Chun Lin, Chung-Pi Lee, and Hsuan-Jung Su},
journal={IEEE Transactions on Wireless Communications, vol. 9, no. 11, pp.
3402-3413, Nov. 2010},
year={2008},
doi={10.1109/TWC.2010.092410.090725},
archivePrefix={arXiv},
eprint={0810.0870},
primaryClass={cs.IT math.IT}
} | lin2008cognitive |
arxiv-5077 | 0810.0874 | Software Engineering & Systems Design Nature | <|reference_start|>Software Engineering & Systems Design Nature: The main problems of Software Engineering appear as a result of incompatibilities. For example, the quality of organization of the production process depends on correspondence with existent resources and on a common understanding of project goals by all team members. Software design is another example. Its successfulness rides on the architecture's conformity with a project's concepts. This is a point of great nicety. All elements should create a single space of interaction. And if the laws of such a space are imperfect, missequencing comes and the concept of a software system fails. We must do our best for this not to happen. To that end, having a subtle perception of systems structures is essential. Such knowledge can be based only on a fresh approach to the logical law.<|reference_end|> | arxiv | @article{sorudeykin2008software,
title={Software Engineering & Systems Design Nature},
author={Kirill A Sorudeykin},
journal={arXiv preprint arXiv:0810.0874},
year={2008},
archivePrefix={arXiv},
eprint={0810.0874},
primaryClass={cs.SE}
} | sorudeykin2008software |
arxiv-5078 | 0810.0877 | Bias-Variance Techniques for Monte Carlo Optimization: Cross-validation for the CE Method | <|reference_start|>Bias-Variance Techniques for Monte Carlo Optimization: Cross-validation for the CE Method: In this paper, we examine the CE method in the broad context of Monte Carlo Optimization (MCO) and Parametric Learning (PL), a type of machine learning. A well-known overarching principle used to improve the performance of many PL algorithms is the bias-variance tradeoff. This tradeoff has been used to improve PL algorithms ranging from Monte Carlo estimation of integrals, to linear estimation, to general statistical estimation. Moreover, as described by, MCO is very closely related to PL. Owing to this similarity, the bias-variance tradeoff affects MCO performance, just as it does PL performance. In this article, we exploit the bias-variance tradeoff to enhance the performance of MCO algorithms. We use the technique of cross-validation, a technique based on the bias-variance tradeoff, to significantly improve the performance of the Cross Entropy (CE) method, which is an MCO algorithm. In previous work we have confirmed that other PL techniques improve the perfomance of other MCO algorithms. We conclude that the many techniques pioneered in PL could be investigated as ways to improve MCO algorithms in general, and the CE method in particular.<|reference_end|> | arxiv | @article{rajnarayan2008bias-variance,
title={Bias-Variance Techniques for Monte Carlo Optimization: Cross-validation
for the CE Method},
author={Dev Rajnarayan and David Wolpert},
journal={arXiv preprint arXiv:0810.0877},
year={2008},
archivePrefix={arXiv},
eprint={0810.0877},
primaryClass={cs.NA cs.LG}
} | rajnarayan2008bias-variance |
arxiv-5079 | 0810.0882 | Asymptotic Eigenvalue Moments of Wishart-Type Random Matrix Without Ergodicity in One Channel Realization | <|reference_start|>Asymptotic Eigenvalue Moments of Wishart-Type Random Matrix Without Ergodicity in One Channel Realization: Consider a random matrix whose variance profile is random. This random matrix is ergodic in one channel realization if, for each column and row, the empirical distribution of the squared magnitudes of elements therein converges to a nonrandom distribution. In this paper, noncrossing partition theory is employed to derive expressions for several asymptotic eigenvalue moments (AEM) related quantities of a large Wishart-type random matrix $\bb H\bb H^\dag$ when $\bb H$ has a random variance profile and is nonergodic in one channel realization. It is known the empirical eigenvalue moments of $\bb H\bb H^\dag$ are dependent (or independent) on realizations of the variance profile of $\bb H$ when $\bb H$ is nonergodic (or ergodic) in one channel realization. For nonergodic $\bb H$, the AEM can be obtained by i) deriving the expression of AEM in terms of the variance profile of $\bb H$, and then ii) averaging the derived quantity over the ensemble of variance profiles. Since the AEM are independent of the variance profile if $\bb H$ is ergodic, the expression obtained in i) can also serve as the AEM formula for ergodic $\bb H$ when any realization of variance profile is available.<|reference_end|> | arxiv | @article{hwang2008asymptotic,
title={Asymptotic Eigenvalue Moments of Wishart-Type Random Matrix Without
Ergodicity in One Channel Realization},
author={Chien-Hwa Hwang},
journal={arXiv preprint arXiv:0810.0882},
year={2008},
archivePrefix={arXiv},
eprint={0810.0882},
primaryClass={cs.IT math.IT}
} | hwang2008asymptotic |
arxiv-5080 | 0810.0883 | Asymptotic Performance of Linear Receivers in MIMO Fading Channels | <|reference_start|>Asymptotic Performance of Linear Receivers in MIMO Fading Channels: Linear receivers are an attractive low-complexity alternative to optimal processing for multi-antenna MIMO communications. In this paper we characterize the information-theoretic performance of MIMO linear receivers in two different asymptotic regimes. For fixed number of antennas, we investigate the limit of error probability in the high-SNR regime in terms of the Diversity-Multiplexing Tradeoff (DMT). Following this, we characterize the error probability for fixed SNR in the regime of large (but finite) number of antennas. As far as the DMT is concerned, we report a negative result: we show that both linear Zero-Forcing (ZF) and linear Minimum Mean-Square Error (MMSE) receivers achieve the same DMT, which is largely suboptimal even in the case where outer coding and decoding is performed across the antennas. We also provide an approximate quantitative analysis of the markedly different behavior of the MMSE and ZF receivers at finite rate and non-asymptotic SNR, and show that while the ZF receiver achieves poor diversity at any finite rate, the MMSE receiver error curve slope flattens out progressively, as the coding rate increases. When SNR is fixed and the number of antennas becomes large, we show that the mutual information at the output of a MMSE or ZF linear receiver has fluctuations that converge in distribution to a Gaussian random variable, whose mean and variance can be characterized in closed form. This analysis extends to the linear receiver case a well-known result previously obtained for the optimal receiver. Simulations reveal that the asymptotic analysis captures accurately the outage behavior of systems even with a moderate number of antennas.<|reference_end|> | arxiv | @article{kumar2008asymptotic,
title={Asymptotic Performance of Linear Receivers in MIMO Fading Channels},
author={K. Raj Kumar, G. Caire and A. L. Moustakas},
journal={arXiv preprint arXiv:0810.0883},
year={2008},
doi={10.1109/TIT.2009.2027493},
archivePrefix={arXiv},
eprint={0810.0883},
primaryClass={cs.IT math.IT}
} | kumar2008asymptotic |
arxiv-5081 | 0810.0906 | A linear time algorithm for L(2,1)-labeling of trees | <|reference_start|>A linear time algorithm for L(2,1)-labeling of trees: An L(2,1)-labeling of a graph $G$ is an assignment $f$ from the vertex set $V(G)$ to the set of nonnegative integers such that $|f(x)-f(y)|\ge 2$ if $x$ and $y$ are adjacent and $|f(x)-f(y)|\ge 1$ if $x$ and $y$ are at distance 2, for all $x$ and $y$ in $V(G)$. A $k$-L(2,1)-labeling is an assignment $f:V(G)\to\{0,..., k\}$, and the L(2,1)-labeling problem asks the minimum $k$, which we denote by $\lambda(G)$, among all possible assignments. It is known that this problem is NP-hard even for graphs of treewidth 2, and tree is one of a very few classes for which the problem is polynomially solvable. The running time of the best known algorithm for trees had been $\mO(\Delta^{4.5} n)$ for more than a decade, however, an $\mO(n^{1.75})$-time algorithm has been proposed recently, which substantially improved the previous one, where $\Delta$ is the maximum degree of $T$ and $n=|V(T)|$. In this paper, we finally establish a linear time algorithm for L(2,1)-labeling of trees.<|reference_end|> | arxiv | @article{hasunuma2008a,
title={A linear time algorithm for L(2,1)-labeling of trees},
author={Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno},
journal={arXiv preprint arXiv:0810.0906},
year={2008},
archivePrefix={arXiv},
eprint={0810.0906},
primaryClass={cs.DS}
} | hasunuma2008a |
arxiv-5082 | 0810.1018 | A simple constant-probability RP reduction from NP to Parity P | <|reference_start|>A simple constant-probability RP reduction from NP to Parity P: The proof of Toda's celebrated theorem that the polynomial hierarchy is contained in $\P^{# P}$ relies on the fact that, under mild technical conditions on the complexity class $C$, we have $\exists C \subset BP \cdot \oplus C$. More concretely, there is a randomized reduction which transforms nonempty sets and the empty set, respectively, into sets of odd or even size. The customary method is to invoke Valiant's and Vazirani's randomized reduction from NP to UP, followed by amplification of the resulting success probability from $1/\poly(n)$ to a constant by combining the parities of $\poly(n)$ trials. Here we give a direct algebraic reduction which achieves constant success probability without the need for amplification. Our reduction is very simple, and its analysis relies on well-known properties of the Legendre symbol in finite fields.<|reference_end|> | arxiv | @article{moore2008a,
title={A simple constant-probability RP reduction from NP to Parity P},
author={Cristopher Moore and Alexander Russell},
journal={arXiv preprint arXiv:0810.1018},
year={2008},
archivePrefix={arXiv},
eprint={0810.1018},
primaryClass={cs.CC}
} | moore2008a |
arxiv-5083 | 0810.1103 | Channel and Multiuser Diversities in Wireless Systems: Delay-Energy Tradeoff | <|reference_start|>Channel and Multiuser Diversities in Wireless Systems: Delay-Energy Tradeoff: We consider a communication system with multi-access fading channel. Each user in the system requires certain rate guarantee. Our main contribution is to devise a scheduling scheme called "Opportunistic Super-position Coding" that satisfies the users' rate requirements. Using mean-field analysis, i.e., when the number of users go to infinity, we analytically show that the energy required to guarantee the required user rate can be made as small as required at the cost of a higher delay ("delay-energy tradeoff"). We explicitly compute the delay under the proposed scheduling policy and discuss how delay differentiation can be achieved. We extend the results to multi-band multi-access channel. Finally, all the results can be generalized in a straightforward fashion to broadcast channel due to the AWGN multiaccess-broadcast duality.<|reference_end|> | arxiv | @article{chaporkar2008channel,
title={Channel and Multiuser Diversities in Wireless Systems: Delay-Energy
Tradeoff},
author={Prasanna Chaporkar, Kimmo Kansanen, Ralf R. M"uller},
journal={arXiv preprint arXiv:0810.1103},
year={2008},
archivePrefix={arXiv},
eprint={0810.1103},
primaryClass={cs.IT math.IT}
} | chaporkar2008channel |
arxiv-5084 | 0810.1105 | Low-Density Parity-Check Codes Which Can Correct Three Errors Under Iterative Decoding | <|reference_start|>Low-Density Parity-Check Codes Which Can Correct Three Errors Under Iterative Decoding: In this paper, we give necessary and sufficient conditions for low-density parity-check (LDPC) codes with column-weight three to correct three errors when decoded using hard-decision message-passing decoding. Additionally, we give necessary and sufficient conditions for column-weight-four codes to correct three errors in four iterations of hard-decision message-passing decoding. We then give a construction technique which results in codes satisfying these conditions. We also provide numerical assessment of code performance via simulation results.<|reference_end|> | arxiv | @article{chilappagari2008low-density,
title={Low-Density Parity-Check Codes Which Can Correct Three Errors Under
Iterative Decoding},
author={Shashi Kiran Chilappagari, Anantha Raman Krishnan, Bane Vasic, Michael
W. Marcellin},
journal={arXiv preprint arXiv:0810.1105},
year={2008},
archivePrefix={arXiv},
eprint={0810.1105},
primaryClass={cs.IT math.IT}
} | chilappagari2008low-density |
arxiv-5085 | 0810.1106 | On the expressiveness of single-pass instruction sequences | <|reference_start|>On the expressiveness of single-pass instruction sequences: We perceive programs as single-pass instruction sequences. A single-pass instruction sequence under execution is considered to produce a behaviour to be controlled by some execution environment. Threads as considered in basic thread algebra model such behaviours. We show that all regular threads, i.e. threads that can only be in a finite number of states, can be produced by single-pass instruction sequences without jump instructions if use can be made of Boolean registers. We also show that, in the case where goto instructions are used instead of jump instructions, a bound to the number of labels restricts the expressiveness.<|reference_end|> | arxiv | @article{bergstra2008on,
title={On the expressiveness of single-pass instruction sequences},
author={J.A. Bergstra, C.A. Middelburg},
journal={Theory of Computing Systems, 50(2):313--328, 2012},
year={2008},
doi={10.1007/s00224-010-9301-8},
number={PRG0813},
archivePrefix={arXiv},
eprint={0810.1106},
primaryClass={cs.PL}
} | bergstra2008on |
arxiv-5086 | 0810.1119 | Gaussian Belief Propagation for Solving Systems of Linear Equations: Theory and Application | <|reference_start|>Gaussian Belief Propagation for Solving Systems of Linear Equations: Theory and Application: The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. In this contribution, we develop a solution based upon Gaussian belief propagation (GaBP) that does not involve direct matrix inversion. The iterative nature of our approach allows for a distributed message-passing implementation of the solution algorithm. We address the properties of the GaBP solver, including convergence, exactness, computational complexity, message-passing efficiency and its relation to classical solution methods. We use numerical examples and applications, like linear detection, to illustrate these properties through the use of computer simulations. This empirical study demonstrates the attractiveness (e.g., faster convergence rate) of the proposed GaBP solver in comparison to conventional linear-algebraic iterative solution methods.<|reference_end|> | arxiv | @article{shental2008gaussian,
title={Gaussian Belief Propagation for Solving Systems of Linear Equations:
Theory and Application},
author={Ori Shental, Danny Bickson, Paul H. Siegel, Jack K. Wolf and Danny
Dolev},
journal={arXiv preprint arXiv:0810.1119},
year={2008},
archivePrefix={arXiv},
eprint={0810.1119},
primaryClass={cs.IT math.IT}
} | shental2008gaussian |
arxiv-5087 | 0810.1132 | Maximally Radio-Disjoint Multipath Routing for Wireless Multimedia Sensor Networks | <|reference_start|>Maximally Radio-Disjoint Multipath Routing for Wireless Multimedia Sensor Networks: In wireless sensor networks, bandwidth is one of precious resources to multimedia applications. To get more bandwidth, multipath routing is one appropriate solution provided that inter-path interferences are minimized. In this paper, we address the problem of interfering paths in the context of wireless multimedia sensor networks and consider both intra-session as well as inter-session interferences. Our main objective is to provide necessary bandwidth to multimedia applications through non-interfering paths while increasing the network lifetime. To do so, we adopt an incremental approach where for a given session, only one path is built at once. Additional paths are built when required, typically in case of congestion or bandwidth shortage. Interference awareness and energy saving are achieved by switching a subset of sensor nodes in a {\em passive state} in which they do not take part in the routing process. Despite the routing overhead introduced by the incremental approach we adopt, our simulations show that this can be compensated by the overall achieved throughput and the amount of consumed energy per correctly received packet especially for relatively long sessions such as multimedia ones. This is mainly due to the fact that a small number of non-interfering paths allows for better performances than a large number of interfering ones.<|reference_end|> | arxiv | @article{maimour2008maximally,
title={Maximally Radio-Disjoint Multipath Routing for Wireless Multimedia
Sensor Networks},
author={Moufida Maimour (CRAN)},
journal={Fourth ACM International Workshop on Wireless Multimedia
Networking and erformance Modeling, Vancouver : Canada (2008)},
year={2008},
archivePrefix={arXiv},
eprint={0810.1132},
primaryClass={cs.NI}
} | maimour2008maximally |
arxiv-5088 | 0810.1139 | Load Repartition for Congestion Control in Multimedia Wireless Sensor Networks with Multipath Routing | <|reference_start|>Load Repartition for Congestion Control in Multimedia Wireless Sensor Networks with Multipath Routing: Wireless sensor networks hold a great potential in the deployment of several applications of a paramount importance in our daily life. Video sensors are able to improve a number of these applications where new approaches adapted to both wireless sensor networks and video transport specific characteristics are required. The aim of this work is to provide the necessary bandwidth and to alleviate the congestion problem to video streaming. In this paper, we investigate various load repartition strategies for congestion control mechanism on top of a multipath routing feature. Simulations are performed in order to get insight into the performances of our proposals.<|reference_end|> | arxiv | @article{maimour2008load,
title={Load Repartition for Congestion Control in Multimedia Wireless Sensor
Networks with Multipath Routing},
author={Moufida Maimour (CRAN), Congduc Pham (LIUPPA), Julien Amelot (CRAN)},
journal={3rd International Symposium on Wireless Pervasive Computing, ISWPC
2008, Santorini : Gr\`ece (2008)},
year={2008},
doi={10.1109/ISWPC.2008.4556156},
archivePrefix={arXiv},
eprint={0810.1139},
primaryClass={cs.NI}
} | maimour2008load |
arxiv-5089 | 0810.1151 | Periodic Single-Pass Instruction Sequences | <|reference_start|>Periodic Single-Pass Instruction Sequences: A program is a finite piece of data that produces a (possibly infinite) sequence of primitive instructions. From scratch we develop a linear notation for sequential, imperative programs, using a familiar class of primitive instructions and so-called repeat instructions, a particular type of control instructions. The resulting mathematical structure is a semigroup. We relate this set of programs to program algebra (PGA) and show that a particular subsemigroup is a carrier for PGA by providing axioms for single-pass congruence, structural congruence, and thread extraction. This subsemigroup characterizes periodic single-pass instruction sequences and provides a direct basis for PGA's toolset.<|reference_end|> | arxiv | @article{bergstra2008periodic,
title={Periodic Single-Pass Instruction Sequences},
author={Jan A. Bergstra and Alban Ponse},
journal={arXiv preprint arXiv:0810.1151},
year={2008},
archivePrefix={arXiv},
eprint={0810.1151},
primaryClass={cs.PL}
} | bergstra2008periodic |
arxiv-5090 | 0810.1186 | On-the-fly Macros | <|reference_start|>On-the-fly Macros: We present a domain-independent algorithm that computes macros in a novel way. Our algorithm computes macros "on-the-fly" for a given set of states and does not require previously learned or inferred information, nor prior domain knowledge. The algorithm is used to define new domain-independent tractable classes of classical planning that are proved to include \emph{Blocksworld-arm} and \emph{Towers of Hanoi}.<|reference_end|> | arxiv | @article{chen2008on-the-fly,
title={On-the-fly Macros},
author={Hubie Chen, Omer Gimenez},
journal={arXiv preprint arXiv:0810.1186},
year={2008},
archivePrefix={arXiv},
eprint={0810.1186},
primaryClass={cs.AI}
} | chen2008on-the-fly |
arxiv-5091 | 0810.1187 | Interference Alignment for Secrecy | <|reference_start|>Interference Alignment for Secrecy: This paper studies the frequency/time selective $K$-user Gaussian interference channel with secrecy constraints. Two distinct models, namely the interference channel with confidential messages and the one with an external eavesdropper, are analyzed. The key difference between the two models is the lack of channel state information (CSI) about the external eavesdropper. Using interference alignment along with secrecy pre-coding, it is shown that each user can achieve non-zero secure Degrees of Freedom (DoF) for both cases. More precisely, the proposed coding scheme achieves $\frac{K-2}{2K-2}$ secure DoF {\em with probability one} per user in the confidential messages model. For the external eavesdropper scenario, on the other hand, it is shown that each user can achieve $\frac{K-2}{2K}$ secure DoF {\em in the ergodic setting}. Remarkably, these results establish the {\em positive impact} of interference on the secrecy capacity region of wireless networks.<|reference_end|> | arxiv | @article{koyluoglu2008interference,
title={Interference Alignment for Secrecy},
author={Onur Ozan Koyluoglu, Hesham El Gamal, Lifeng Lai, and H. Vincent Poor},
journal={arXiv preprint arXiv:0810.1187},
year={2008},
doi={10.1109/TIT.2011.2132430},
archivePrefix={arXiv},
eprint={0810.1187},
primaryClass={cs.IT math.IT}
} | koyluoglu2008interference |
arxiv-5092 | 0810.1197 | Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes | <|reference_start|>Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes: In this paper, a simple, general-purpose and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented. The design method consists in starting from the parity-check matrix of an LDPC code and developing an optimized parity-check matrix, with the same performance on the memory-less erasure channel, and suitable also for the iterative correction of single bursts of erasures. The parity-check matrix optimization is performed by an algorithm called pivot searching and swapping (PSS) algorithm, which executes permutations of carefully chosen columns of the parity-check matrix, after a local analysis of particular variable nodes called stopping set pivots. This algorithm can be in principle applied to any LDPC code. If the input parity-check matrix is designed for achieving good performance on the memory-less erasure channel, then the code obtained after the application of the PSS algorithm provides good joint correction of independent erasures and single erasure bursts. Numerical results are provided in order to show the effectiveness of the PSS algorithm when applied to different categories of LDPC codes.<|reference_end|> | arxiv | @article{paolini2008construction,
title={Construction of Near-Optimum Burst Erasure Correcting Low-Density
Parity-Check Codes},
author={E. Paolini and M. Chiani},
journal={arXiv preprint arXiv:0810.1197},
year={2008},
archivePrefix={arXiv},
eprint={0810.1197},
primaryClass={cs.IT math.IT}
} | paolini2008construction |
arxiv-5093 | 0810.1199 | Une grammaire formelle du cr\'eole martiniquais pour la g\'en\'eration automatique | <|reference_start|>Une grammaire formelle du cr\'eole martiniquais pour la g\'en\'eration automatique: In this article, some first elements of a computational modelling of the grammar of the Martiniquese French Creole dialect are presented. The sources of inspiration for the modelling is the functional description given by Damoiseau (1984), and Pinalie's & Bernabe's (1999) grammar manual. Based on earlier works in text generation (Vaillant, 1997), a unification grammar formalism, namely Tree Adjoining Grammars (TAG), and a modelling of lexical functional categories based on syntactic and semantic properties, are used to implement a grammar of Martiniquese Creole which is used in a prototype of text generation system. One of the main applications of the system could be its use as a tool software supporting the task of learning Creole as a second language. -- Nous pr\'esenterons dans cette communication les premiers travaux de mod\'elisation informatique d'une grammaire de la langue cr\'eole martiniquaise, en nous inspirant des descriptions fonctionnelles de Damoiseau (1984) ainsi que du manuel de Pinalie & Bernab\'e (1999). Prenant appui sur des travaux ant\'erieurs en g\'en\'eration de texte (Vaillant, 1997), nous utilisons un formalisme de grammaires d'unification, les grammaires d'adjonction d'arbres (TAG d'apr\`es l'acronyme anglais), ainsi qu'une mod\'elisation de cat\'egories lexicales fonctionnelles \`a base syntaxico-s\'emantique, pour mettre en oeuvre une grammaire du cr\'eole martiniquais utilisable dans une maquette de syst\`eme de g\'en\'eration automatique. L'un des int\'er\^ets principaux de ce syst\`eme pourrait \^etre son utilisation comme logiciel outil pour l'aide \`a l'apprentissage du cr\'eole en tant que langue seconde.<|reference_end|> | arxiv | @article{vaillant2008une,
title={Une grammaire formelle du cr\'eole martiniquais pour la g\'en\'eration
automatique},
author={Pascal Vaillant},
journal={Actes de la 10eme conference annuelle sur le Traitement
Automatique des Langues Naturelles (TALN 2003), p. 255-264. Batz-sur-mer,
France, 10-14 juin 2003},
year={2008},
archivePrefix={arXiv},
eprint={0810.1199},
primaryClass={cs.CL}
} | vaillant2008une |
arxiv-5094 | 0810.1207 | A Layered Grammar Model: Using Tree-Adjoining Grammars to Build a Common Syntactic Kernel for Related Dialects | <|reference_start|>A Layered Grammar Model: Using Tree-Adjoining Grammars to Build a Common Syntactic Kernel for Related Dialects: This article describes the design of a common syntactic description for the core grammar of a group of related dialects. The common description does not rely on an abstract sub-linguistic structure like a metagrammar: it consists in a single FS-LTAG where the actual specific language is included as one of the attributes in the set of attribute types defined for the features. When the lang attribute is instantiated, the selected subset of the grammar is equivalent to the grammar of one dialect. When it is not, we have a model of a hybrid multidialectal linguistic system. This principle is used for a group of creole languages of the West-Atlantic area, namely the French-based Creoles of Haiti, Guadeloupe, Martinique and French Guiana.<|reference_end|> | arxiv | @article{vaillant2008a,
title={A Layered Grammar Model: Using Tree-Adjoining Grammars to Build a Common
Syntactic Kernel for Related Dialects},
author={Pascal Vaillant},
journal={Proceedings of the Ninth International Workshop on Tree Adjoining
Grammars and Related Formalisms (TAG+9 2008), p. 157-164. Tuebingen,
Baden-Wurttemberg, Germany, 6-8 June 2008},
year={2008},
archivePrefix={arXiv},
eprint={0810.1207},
primaryClass={cs.CL}
} | vaillant2008a |
arxiv-5095 | 0810.1212 | Analyse spectrale des textes: d\'etection automatique des fronti\`eres de langue et de discours | <|reference_start|>Analyse spectrale des textes: d\'etection automatique des fronti\`eres de langue et de discours: We propose a theoretical framework within which information on the vocabulary of a given corpus can be inferred on the basis of statistical information gathered on that corpus. Inferences can be made on the categories of the words in the vocabulary, and on their syntactical properties within particular languages. Based on the same statistical data, it is possible to build matrices of syntagmatic similarity (bigram transition matrices) or paradigmatic similarity (probability for any pair of words to share common contexts). When clustered with respect to their syntagmatic similarity, words tend to group into sublanguage vocabularies, and when clustered with respect to their paradigmatic similarity, into syntactic or semantic classes. Experiments have explored the first of these two possibilities. Their results are interpreted in the frame of a Markov chain modelling of the corpus' generative processe(s): we show that the results of a spectral analysis of the transition matrix can be interpreted as probability distributions of words within clusters. This method yields a soft clustering of the vocabulary into sublanguages which contribute to the generation of heterogeneous corpora. As an application, we show how multilingual texts can be visually segmented into linguistically homogeneous segments. Our method is specifically useful in the case of related languages which happened to be mixed in corpora.<|reference_end|> | arxiv | @article{vaillant2008analyse,
title={Analyse spectrale des textes: d\'etection automatique des fronti\`eres
de langue et de discours},
author={Pascal Vaillant, Richard Nock and Claudia Henry},
journal={Verbum ex machina: Actes de la 13eme conference annuelle sur le
Traitement Automatique des Langues Naturelles (TALN 2006), p. 619-629.
Louvain (Leuven), Belgique, 10-13 avril 2006},
year={2008},
archivePrefix={arXiv},
eprint={0810.1212},
primaryClass={cs.CL cs.IR}
} | vaillant2008analyse |
arxiv-5096 | 0810.1226 | Traffic Dynamics of Computer Networks | <|reference_start|>Traffic Dynamics of Computer Networks: Two important aspects of the Internet, namely the properties of its topology and the characteristics of its data traffic, have attracted growing attention of the physics community. My thesis has considered problems of both aspects. First I studied the stochastic behavior of TCP, the primary algorithm governing traffic in the current Internet, in an elementary network scenario consisting of a standalone infinite-sized buffer and an access link. The effect of the fast recovery and fast retransmission (FR/FR) algorithms is also considered. I showed that my model can be extended further to involve the effect of link propagation delay, characteristic of WAN. I continued my thesis with the investigation of finite-sized semi-bottleneck buffers, where packets can be dropped not only at the link, but also at the buffer. I demonstrated that the behavior of the system depends only on a certain combination of the parameters. Moreover, an analytic formula was derived that gives the ratio of packet loss rate at the buffer to the total packet loss rate. This formula makes it possible to treat buffer-losses as if they were link-losses. Finally, I studied computer networks from a structural perspective. I demonstrated through fluid simulations that the distribution of resources, specifically the link bandwidth, has a serious impact on the global performance of the network. Then I analyzed the distribution of edge betweenness in a growing scale-free tree under the condition that a local property, the in-degree of the "younger" node of an arbitrary edge, is known in order to find an optimum distribution of link capacity. The derived formula is exact even for finite-sized networks. I also calculated the conditional expectation of edge betweenness, rescaled for infinite networks.<|reference_end|> | arxiv | @article{fekete2008traffic,
title={Traffic Dynamics of Computer Networks},
author={Attila Fekete},
journal={arXiv preprint arXiv:0810.1226},
year={2008},
archivePrefix={arXiv},
eprint={0810.1226},
primaryClass={cs.NI cond-mat.stat-mech}
} | fekete2008traffic |
arxiv-5097 | 0810.1234 | On Resource Allocation in Fading Multiple Access Channels - An Efficient Approximate Projection Approach | <|reference_start|>On Resource Allocation in Fading Multiple Access Channels - An Efficient Approximate Projection Approach: We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave utility function of average transmission rates on the information theoretic capacity region of the multiple-access channel. Our policies does not require queue-length information. We consider several different scenarios. First, we address the utility maximization problem in a nonfading channel to obtain the optimal operating rates, and present an iterative gradient projection algorithm that uses approximate projection. By exploiting the polymatroid structure of the capacity region, we show that the approximate projection can be implemented in time polynomial in the number of users. Second, we consider resource allocation in a fading channel. Optimal rate and power allocation policies are presented for the case that power control is possible and channel statistics are available. For the case that transmission power is fixed and channel statistics are unknown, we propose a greedy rate allocation policy and provide bounds on the performance difference of this policy and the optimal policy in terms of channel variations and structure of the utility function. We present numerical results that demonstrate superior convergence rate performance for the greedy policy compared to queue-length based policies. In order to reduce the computational complexity of the greedy policy, we present approximate rate allocation policies which track the greedy policy within a certain neighborhood that is characterized in terms of the speed of fading.<|reference_end|> | arxiv | @article{parandehgheibi2008on,
title={On Resource Allocation in Fading Multiple Access Channels - An Efficient
Approximate Projection Approach},
author={Ali ParandehGheibi, Atilla Eryilmaz, Asuman Ozdaglar, Muriel Medard},
journal={arXiv preprint arXiv:0810.1234},
year={2008},
doi={10.1109/TIT.2010.2053902},
number={LIDS report 2787},
archivePrefix={arXiv},
eprint={0810.1234},
primaryClass={cs.IT cs.NI math.IT math.OC}
} | parandehgheibi2008on |
arxiv-5098 | 0810.1248 | Resource Allocation in Multiple Access Channels | <|reference_start|>Resource Allocation in Multiple Access Channels: We consider the problem of rate allocation in a Gaussian multiple-access channel, with the goal of maximizing a utility function over transmission rates. In contrast to the literature which focuses on linear utility functions, we study general concave utility functions. We present a gradient projection algorithm for this problem. Since the constraint set of the problem is described by exponentially many constraints, methods that use exact projections are computationally intractable. Therefore, we develop a new method that uses approximate projections. We use the polymatroid structure of the capacity region to show that the approximate projection can be implemented by a recursive algorithm in time polynomial in the number of users. We further propose another algorithm for implementing the approximate projections using rate-splitting and show improved bounds on its convergence time.<|reference_end|> | arxiv | @article{parandehgheibi2008resource,
title={Resource Allocation in Multiple Access Channels},
author={Ali ParandehGheibi, Atilla Eryilmaz, Asuman Ozdaglar, Muriel Medard},
journal={arXiv preprint arXiv:0810.1248},
year={2008},
archivePrefix={arXiv},
eprint={0810.1248},
primaryClass={cs.IT cs.NI math.IT math.OC}
} | parandehgheibi2008resource |
arxiv-5099 | 0810.1253 | Dynamic Rate Allocation in Fading Multiple-access Channels | <|reference_start|>Dynamic Rate Allocation in Fading Multiple-access Channels: We consider the problem of rate allocation in a fading Gaussian multiple-access channel (MAC) with fixed transmission powers. Our goal is to maximize a general concave utility function of transmission rates over the throughput capacity region. In contrast to earlier works in this context that propose solutions where a potentially complex optimization problem must be solved in every decision instant, we propose a low-complexity approximate rate allocation policy and analyze the effect of temporal channel variations on its utility performance. To the best of our knowledge, this is the first work that studies the tracking capabilities of an approximate rate allocation scheme under fading channel conditions. We build on an earlier work to present a new rate allocation policy for a fading MAC that implements a low-complexity approximate gradient projection iteration for each channel measurement, and explicitly characterize the effect of the speed of temporal channel variations on the tracking neighborhood of our policy. We further improve our results by proposing an alternative rate allocation policy for which tighter bounds on the size of the tracking neighborhood are derived. These proposed rate allocation policies are computationally efficient in our setting since they implement a single gradient projection iteration per channel measurement and each such iteration relies on approximate projections which has polynomial-complexity in the number of users.<|reference_end|> | arxiv | @article{parandehgheibi2008dynamic,
title={Dynamic Rate Allocation in Fading Multiple-access Channels},
author={Ali ParandehGheibi, Atilla Eryilmaz, Asuman Ozdaglar, Muriel Medard},
journal={arXiv preprint arXiv:0810.1253},
year={2008},
archivePrefix={arXiv},
eprint={0810.1253},
primaryClass={cs.IT cs.NI math.IT math.OC}
} | parandehgheibi2008dynamic |
arxiv-5100 | 0810.1260 | Rate and Power Allocation in Fading Multiple Access Channels | <|reference_start|>Rate and Power Allocation in Fading Multiple Access Channels: We consider the problem of rate and power allocation in a fading multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a utility function defined over average transmission rates. In contrast with the literature, which focuses on the linear case, we present results for general concave utility functions. We consider two cases. In the first case, we assume that power control is possible and channel statistics are known. In this case, we show that the optimal policies can be obtained greedily by maximizing a linear utility function at each channel state. In the second case, we assume that power control is not possible and channel statistics are not available. In this case, we define a greedy rate allocation policy and provide upper bounds on the performance difference between the optimal and the greedy policy. Our bounds highlight the dependence of the performance difference on the channel variations and the structure of the utility function.<|reference_end|> | arxiv | @article{parandehgheibi2008rate,
title={Rate and Power Allocation in Fading Multiple Access Channels},
author={Ali ParandehGheibi, Atilla Eryilmaz, Asuman Ozdaglar, Muriel Medard},
journal={arXiv preprint arXiv:0810.1260},
year={2008},
archivePrefix={arXiv},
eprint={0810.1260},
primaryClass={cs.IT cs.NI math.IT math.OC}
} | parandehgheibi2008rate |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.