OpenRaiser/Intern-Atlas huggingface dataset:
Wireless Sensor/Actuator Network Design for Mobile Control Applications
Venue: arXiv cs.NI 2008
Year: 2008

Wireless sensor/actuator networks (WSANs) are emerging as a new generation of sensor networks. Serving as the backbone of control applications, WSANs will enable an unprecedented degree of distributed and mobile control. However, the unreliability of wireless communications and the real-time requirements of control applications raise great challenges for WSAN design. With emphasis on the reliability issue, this paper presents an application-level design methodology for WSANs in mobile control applications. The solution is generic in that it is independent of the underlying platforms, environment, control system models, and controller design. To capture the link quality characteristics in terms of packet loss rate, experiments are conducted on a real WSAN system. From the experimental observations, a simple yet efficient method is proposed to deal with unpredictable packet loss on actuator nodes. Trace-based simulations give promising results, which demonstrate the effectiveness of the proposed approach.
Co-ordinate Interleaved Distributed Space-Time Coding for Two-Antenna-Relays Networks
Venue: arXiv cs.IT 2008
Year: 2008

Distributed space time coding for wireless relay networks when the source, the destination and the relays have multiple antennas have been studied by Jing and Hassibi. In this set-up, the transmit and the receive signals at different antennas of the same relay are processed and designed independently, even though the antennas are colocated. In this paper, a wireless relay network with single antenna at the source and the destination and two antennas at each of the R relays is considered. A new class of distributed space time block codes called Co-ordinate Interleaved Distributed Space-Time Codes (CIDSTC) are introduced where, in the first phase, the source transmits a T-length complex vector to all the relays and in the second phase, at each relay, the in-phase and quadrature component vectors of the received complex vectors at the two antennas are interleaved and processed before forwarding them to the destination. Compared to the scheme proposed by Jing-Hassibi, for $T \geq 4R$, while providing the same asymptotic diversity order of 2R, CIDSTC scheme is shown to provide asymptotic coding gain with the cost of negligible increase in the processing complexity at the relays. However, for moderate and large values of P, CIDSTC scheme is shown to provide more diversity than that of the scheme proposed by Jing-Hassibi. CIDSTCs are shown to be fully diverse provided the information symbols take value from an appropriate multi-dimensional signal set.
SPAM over Internet Telephony and how to deal with it
Venue: arXiv cs.CR 2008
Year: 2008

In our modern society telephony has developed to an omnipresent service. People are available at anytime and anywhere. Furthermore the Internet has emerged to an important communication medium. These facts and the raising availability of broadband internet access has led to the fusion of these two services. Voice over IP or short VoIP is the keyword, that describes this combination. The advantages of VoIP in comparison to classic telephony are location independence, simplification of transport networks, ability to establish multimedia communications and the low costs. Nevertheless one can easily see, that combining two technologies, always brings up new challenges and problems that have to be solved. It is undeniable that one of the most annoying facet of the Internet nowadays is email spam. According to different sources email spam is considered to be 80 to 90 percent of the email traffic produced. The threat of so called voice spam or Spam over Internet Telephony (SPIT) is even more fatal, for the annoyance and disturbance factor is much higher. As instance an email that hits the inbox at 4 p.m. is useless but will not disturb the user much. In contrast a ringing phone at 4 p.m. will lead to a much higher disturbance. From the providers point of view both email spam and voice spam produce unwanted traffic and loss of trust of customers into the service. In order to mitigate this threat different approaches from different parties have been developed. This paper focuses on state of the art anti voice spam solutions, analyses them and reveals their weak points. In the end a SPIT producing benchmark tool will be introduced, that attacks the presented anti voice spam solutions. With this tool it is possible for an administrator of a VoIP network to test how vulnerable his system is.
Fast Arithmetics Using Chinese Remaindering
Venue: arXiv cs.DS 2008
Year: 2008

In this paper, some issues concerning the Chinese remaindering representation are discussed. Some new converting methods, including an efficient probabilistic algorithm based on a recent result of von zur Gathen and Shparlinski \cite{Gathen-Shparlinski}, are described. An efficient refinement of the NC$^1$ division algorithm of Chiu, Davida and Litow \cite{Chiu-Davida-Litow} is given, where the number of moduli is reduced by a factor of $\log n$.
A new generalization of the proportional conflict redistribution rule stable in terms of decision
Venue: arXiv cs.AI 2008
Year: 2008

In this chapter, we present and discuss a new generalized proportional conflict redistribution rule. The Dezert-Smarandache extension of the Demster-Shafer theory has relaunched the studies on the combination rules especially for the management of the conflict. Many combination rules have been proposed in the last few years. We study here different combination rules and compare them in terms of decision on didactic example and on generated data. Indeed, in real applications, we need a reliable decision and it is the final results that matter. This chapter shows that a fine proportional conflict redistribution rule must be preferred for the combination in the belief function theory.
A probabilistic key agreement scheme for sensor networks without key predistribution
Venue: arXiv cs.CR 2008
Year: 2008

The dynamic establishment of shared information (e.g. secret key) between two entities is particularly important in networks with no pre-determined structure such as wireless sensor networks (and in general wireless mobile ad-hoc networks). In such networks, nodes establish and terminate communication sessions dynamically with other nodes which may have never been encountered before, in order to somehow exchange information which will enable them to subsequently communicate in a secure manner. In this paper we give and theoretically analyze a series of protocols that enables two entities that have never encountered each other before to establish a shared piece of information for use as a key in setting up a secure communication session with the aid of a shared key encryption algorithm. These protocols do not require previous pre-distribution of candidate keys or some other piece of information of specialized form except a small seed value, from which the two entities can produce arbitrarily long strings with many similarities.
Experts Fusion and Multilayer Perceptron Based on Belief Learning for Sonar Image Classification
Venue: arXiv cs.CV 2008
Year: 2008

The sonar images provide a rapid view of the seabed in order to characterize it. However, in such as uncertain environment, real seabed is unknown and the only information we can obtain, is the interpretation of different human experts, sometimes in conflict. In this paper, we propose to manage this conflict in order to provide a robust reality for the learning step of classification algorithms. The classification is conducted by a multilayer perceptron, taking into account the uncertainty of the reality in the learning stage. The results of this seabed characterization are presented on real sonar images.
Generalized proportional conflict redistribution rule applied to Sonar imagery and Radar targets classification
Venue: arXiv cs.CV 2008
Year: 2008

In this chapter, we present two applications in information fusion in order to evaluate the generalized proportional conflict redistribution rule presented in the chapter \cite{Martin06a}. Most of the time the combination rules are evaluated only on simple examples. We study here different combination rules and compare them in terms of decision on real data. Indeed, in real applications, we need a reliable decision and it is the final results that matter. Two applications are presented here: a fusion of human experts opinions on the kind of underwater sediments depict on sonar image and a classifier fusion for radar targets recognition.
Existence of a polyhedron which does not have a non-overlapping pseudo-edge unfolding
Venue: arXiv cs.CG 2008
Year: 2008

There exists a surface of a convex polyhedron P and a partition L of P into geodesic convex polygons such that there are no connected "edge" unfoldings of P without self-intersections (whose spanning tree is a subset of the edge skeleton of L).
A chain dictionary method for Word Sense Disambiguation and applications
Venue: arXiv cs.CL 2008
Year: 2008

A large class of unsupervised algorithms for Word Sense Disambiguation (WSD) is that of dictionary-based methods. Various algorithms have as the root Lesk's algorithm, which exploits the sense definitions in the dictionary directly. Our approach uses the lexical base WordNet for a new algorithm originated in Lesk's, namely "chain algorithm for disambiguation of all words", CHAD. We show how translation from a language into another one and also text entailment verification could be accomplished by this disambiguation.
L2 Orthogonal Space Time Code for Continuous Phase Modulation
Venue: arXiv cs.IT 2008
Year: 2008

To combine the high power efficiency of Continuous Phase Modulation (CPM) with either high spectral efficiency or enhanced performance in low Signal to Noise conditions, some authors have proposed to introduce CPM in a MIMO frame, by using Space Time Codes (STC). In this paper, we address the code design problem of Space Time Block Codes combined with CPM and introduce a new design criterion based on L2 orthogonality. This L2 orthogonality condition, with the help of simplifying assumption, leads, in the 2x2 case, to a new family of codes. These codes generalize the Wang and Xia code, which was based on pointwise orthogonality. Simulations indicate that the new codes achieve full diversity and a slightly better coding gain. Moreover, one of the codes can be interpreted as two antennas fed by two conventional CPMs using the same data but with different alphabet sets. Inspection of these alphabet sets lead also to a simple explanation of the (small) spectrum broadening of Space Time Coded CPM.
MultiKulti Algorithm: Migrating the Most Different Genotypes in an Island Model
Venue: arXiv cs.NE 2008
Year: 2008

Migration policies in distributed evolutionary algorithms has not been an active research area until recently. However, in the same way as operators have an impact on performance, the choice of migrants is due to have an impact too. In this paper we propose a new policy (named multikulti) for choosing the individuals that are going to be sent to other nodes, based on multiculturality: the individual sent should be as different as possible to the receiving population. We have checked this policy on different discrete optimization problems, and found that, in average or in median, this policy outperforms classical ones like sending the best or a random individual.
On Information Rates of the Fading Wyner Cellular Model via the Thouless Formula for the Strip
Venue: arXiv cs.IT 2008
Year: 2008

We apply the theory of random Schrödinger operators to the analysis of multi-users communication channels similar to the Wyner model, that are characterized by short-range intra-cell broadcasting. With $H$ the channel transfer matrix, $HH^\dagger$ is a narrow-band matrix and in many aspects is similar to a random Schrödinger operator. We relate the per-cell sum-rate capacity of the channel to the integrated density of states of a random Schrödinger operator; the latter is related to the top Lyapunov exponent of a random sequence of matrices via a version of the Thouless formula. Unlike related results in classical random matrix theory, limiting results do depend on the underlying fading distributions. We also derive several bounds on the limiting per-cell sum-rate capacity, some based on the theory of random Schrödinger operators, and some derived from information theoretical considerations. Finally, we get explicit results in the high-SNR regime for some particular cases.
A Computer Verified Theory of Compact Sets
Venue: arXiv cs.LO 2008
Year: 2008

Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and displaying images with a computer. In this paper, I build upon existing work about complete metric spaces to define compact sets as the completion of the space of finite sets under the Hausdorff metric. This definition allowed me to quickly develop a computer verified theory of compact sets. I applied this theory to compute provably correct plots of uniformly continuous functions.
A Non-differential Distributed Space-Time Coding for Partially-Coherent Cooperative Communication
Venue: arXiv cs.IT 2008
Year: 2008

In a distributed space-time coding scheme, based on the relay channel model, the relay nodes co-operate to linearly process the transmitted signal from the source and forward them to the destination such that the signal at the destination appears as a space time block code. Recently, a code design criteria for achieving full diversity in a partially-coherent environment have been proposed along with codes based on differential encoding and decoding techniques. For such a set up, in this paper, a non-differential encoding technique and construction of distributed space time block codes from unitary matrix groups at the source and a set of diagonal unitary matrices for the relays are proposed. It is shown that, the performance of our scheme is independent of the choice of unitary matrices at the relays. When the group is cyclic, a necessary and sufficient condition on the generator of the cyclic group to achieve full diversity and to minimize the pairwise error probability is proved. Various choices on the generator of cyclic group to reduce the ML decoding complexity at the destination is presented. It is also shown that, at the source, if non-cyclic abelian unitary matrix groups are used, then full-diversity can not be obtained. The presented scheme is also robust to failure of any subset of relay nodes.
Differential Transmit Diversity Based on Quasi-Orthogonal Space-Time Block Code
Venue: arXiv cs.IT 2008
Year: 2008

By using joint modulation and customized constellation set, we show that Quasi-Orthogonal Space-Time Block Code (QO-STBC) can be used to form a new differential space-time modulation (DSTM) scheme to provide full transmit diversity with non-coherent detection. Our new scheme can provide higher code rate than existing DSTM schemes based on Orthogonal STBC. It also has a lower decoding complexity than the other DSTM schemes, such as those based on Group Codes, because it only requires a joint detection of two complex symbols. We derive the design criteria for the customized constellation set and use them to construct a constellation set that provides a wide range of spectral efficiency with full diversity and maximum coding gain.
Unitary Differential Space-Time Modulation with Joint Modulation
Venue: arXiv cs.IT 2008
Year: 2008

We develop two new designs of unitary differential space-time modulation (DSTM) with low decoding complexity. Their decoder can be separated into a few parallel decoders, each of which has a decoding search space of less than sqrt(N) if the DSTM codebook contains N codewords. Both designs are based on the concept of joint modulation, which means that several information symbols are jointly modulated, unlike the conventional symbol-by-symbol modulation. The first design is based on Orthogonal Space-Time Block Code (O-STBC) with joint constellation constructed from spherical codes. The second design is based on Quasi-Orthogonal Space-Time Block Code (QO-STBC) with specially designed pair-wise constellation sets. Both the proposed unitary DSTM schemes have considerably lower decoding complexity than many prior DSTM schemes, including those based on Group Codes and Sp(2) which generally have a decoding search space of N for a codebook size of N codewords, and much better decoding performance than the existing O-STBC DSTM scheme. Between two designs, the proposed DSTM based on O-STBC generally has better decoding performance, while the proposed DSTM based on QO-STBC has lower decoding complexity when 8 transmit antennas.
Achieving Near-Capacity at Low SNR on a Multiple-Antenna Multiple-User Channel
Venue: arXiv cs.IT 2008
Year: 2008

We analyze the sensitivity of the capacity of a multi-antenna multi-user system to the number of users being served. We show analytically that, for a given desired sum-rate, the extra power needed to serve a subset of the users at low SNR (signal-to-noise ratio) can be very small, and is generally much smaller than the extra power needed to serve the same subset at high SNR. The advantages of serving only subsets of the users are many: multi-user algorithms have lower complexity, reduced channel-state information requirements, and, often, better performance. We provide guidelines on how many users to serve to get near-capacity performance with low complexity. For example, we show how in an eight-antenna eight-user system we can serve only four users and still be approximately 2 dB from capacity at very low SNR.
Beamforming Matrix Quantization with Variable Feedback Rate
Venue: arXiv cs.IT 2008
Year: 2008

We propose an improved beamforming matrix compression by Givens Rotation with the use of variable feedback rate. The variable feedback rate means that the number of bits used to represent the quantized beamforming matrix is based on the value of the matrix. Compared with the fixed feedback rate scheme, the proposed method has better performance without additional feedback bandwidth.
On Computing the Vertex Centroid of a Polyhedron
Venue: arXiv cs.CG 2008
Year: 2008

Let $\mathcal{P}$ be an $\mathcal{H}$-polytope in $\mathbb{R}^d$ with vertex set $V$. The vertex centroid is defined as the average of the vertices in $V$. We prove that computing the vertex centroid of an $\mathcal{H}$-polytope is #P-hard. Moreover, we show that even just checking whether the vertex centroid lies in a given halfspace is already #P-hard for $\mathcal{H}$-polytopes. We also consider the problem of approximating the vertex centroid by finding a point within an $ε$ distance from it and prove this problem to be #P-easy by showing that given an oracle for counting the number of vertices of an $\mathcal{H}$-polytope, one can approximate the vertex centroid in polynomial time. We also show that any algorithm approximating the vertex centroid to \emph{any} ``sufficiently'' non-trivial (for example constant) distance, can be used to construct a fully polynomial approximation scheme for approximating the centroid and also an output-sensitive polynomial algorithm for the Vertex Enumeration problem. Finally, we show that for unbounded polyhedra the vertex centroid can not be approximated to a distance of $d^{{1/2}-δ}$ for any fixed constant $δ>0$.
Consistent Newton-Raphson vs. fixed-point for variational multiscale formulations for incompressible Navier-Stokes
Venue: arXiv cs.NA 2008
Year: 2008

The following paper compares a consistent Newton-Raphson and fixed-point iteration based solution strategy for a variational multiscale finite element formulation for incompressible Navier-Stokes. The main contributions of this work include a consistent linearization of the Navier-Stokes equations, which provides an avenue for advanced algorithms that require origins in a consistent method. We also present a comparison between formulations that differ only in their linearization, but maintain all other equivalences. Using the variational multiscale concept, we construct a stabilized formulation (that may be considered an extension of the MINI element to nonlinear Navier-Stokes). We then linearize the problem using fixed-point iteration and by deriving a consistent tangent matrix for the update equation to obtain the solution via Newton-Raphson iterations. We show that the consistent formulation converges in fewer iterations, as expected, for several test problems. We also show that the consistent formulation converges for problems for which fixed-point iteration diverges. We present the results of both methods for problems of Reynold's number up to 5000.
Comparative Study of Open-loop Transmit Diversity Schemes for Four Transmit Antennas in Coded OFDM Systems
Venue: arXiv cs.IT 2008
Year: 2008

We compare four open-loop transmit diversity schemes in a coded Orthogonal Frequency Division Multiplexing (OFDM) system with four transmit antennas, namely cyclic delay diversity (CDD), Space-Time Block Code (STBC, Alamouti code is used) with CDD, Quasi-Orthogonal STBC (QO-STBC) and Minimum-Decoding-Complexity QOSTBC (MDC-QOSTBC). We show that in a coded system with low code rate, a scheme with spatial transmit diversity of second order can achieve similar performance to that with spatial transmit diversity of fourth order due to the additional diversity provided by the phase shift diversity with channel coding. In addition, we also compare the decoding complexity and other features of the above four mentioned schemes, such as the requirement for the training signals, hybrid automatic retransmission request (HARQ), etc. The discussions in this paper can be readily applied to future wireless communication systems, such as mobile systems beyond 3G, IEEE 802.11 wireless LAN, or IEEE 802.16 WiMAX, that employ more than two transmit antennas and OFDM.
Separability in the Ambient Logic
Venue: arXiv cs.LO 2008
Year: 2008

The \it{Ambient Logic} (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured data. We study some basic questions concerning the discriminating power of AL, focusing on the equivalence on processes induced by the logic $(=_L>)$. As underlying calculi besides MA we consider a subcalculus in which an image-finiteness condition holds and that we prove to be Turing complete. Synchronous variants of these calculi are studied as well. In these calculi, we provide two operational characterisations of $_=L$: a coinductive one (as a form of bisimilarity) and an inductive one (based on structual properties of processes). After showing $_=L$ to be stricly finer than barbed congruence, we establish axiomatisations of $_=L$ on the subcalculus of MA (both the asynchronous and the synchronous version), enabling us to relate $_=L$ to structural congruence. We also present some (un)decidability results that are related to the above separation properties for AL: the undecidability of $_=L$ on MA and its decidability on the subcalculus.
Conceptualization of seeded region growing by pixels aggregation. Part 1: the framework
Venue: arXiv cs.CV 2008
Year: 2008

Adams and Bishop have proposed in 1994 a novel region growing algorithm called seeded region growing by pixels aggregation (SRGPA). This paper introduces a framework to implement an algorithm using SRGPA. This framework is built around two concepts: localization and organization of applied action. This conceptualization gives a quick implementation of algorithms, a direct translation between the mathematical idea and the numerical implementation, and an improvement of algorithms efficiency.