OpenRaiser/Intern-Atlas huggingface dataset:
Characterizations of generalized entropy functions by functional equations
Venue: arXiv cs.IT 2010
Year: 2010

We shall show that a two-parameter extended entropy function is characterized by a functional equation. As a corollary of this result, we obtain that the Tsallis entropy function is characterized by a functional equation, which is a different form used in \cite{ST} i.e., in Proposition \ref{prop01} in the present paper. We also give an interpretation of the functional equation giving the Tsallis entropy function, in the relation with two non-additive properties.
Performance of Interference Alignment in Clustered Wireless Ad Hoc Networks
Venue: arXiv cs.IT 2010
Year: 2010

Spatial interference alignment among a finite number of users is proposed as a technique to increase the probability of successful transmission in an interference limited clustered wireless ad hoc network. Using techniques from stochastic geometry, we build on the work of Ganti and Haenggi dealing with Poisson cluster processes with a fixed number of cluster points and provide a numerically integrable expression for the outage probability using an intra-cluster interference alignment strategy with multiplexing gain one. For a special network setting we derive a closed-form upper bound. We demonstrate significant performance gains compared to single-antenna systems without local cooperation.
High Precision HalfWave Rectifier Circuit In Dual Phase Output Mode
Venue: arXiv cs.OH 2010
Year: 2010

This paper present high precision halfwave rectifier circuit in dual phase output mode by 0.5 micrometer CMOS technology, plus or minus 1.5 V low voltage, it has received input signal and sent output current signal, respond in high frequency. The main structure compound with CMOS inverter circuit, common source circuit, and current mirror circuit. Simulation and confirmation quality of working by PSpice program, then it able to operating at maximum frequency about 100 MHz, maximum input current range about 400 μAp p, high precision output signal, low power dissipation, and uses a little transistor.
High Precision MultiWave Rectifier Circuit Operating in Low Voltage 1.5 Volt Current Mode
Venue: arXiv cs.OH 2010
Year: 2010

This article is present high precision multiwave rectifier circuit operating in low voltage plus or minus 1.5 Volt current modes by CMOS technology 0.5 \mum, receive input and give output in current mode, respond at high frequency period. The structure compound with high speed current comparator circuit, current mirror circuit, and CMOS inverter circuit. PSpice program used for confirmation the performance of testing. The PSpice program shows operating of circuit is able to working at maximum input current 400 \muAp p, maximum frequency responding 200 MHz, high precision and low power losses, and non-precision zero crossing output signal.
Speech Recognition by Machine, A Review
Venue: arXiv cs.CL 2010
Year: 2010

This paper presents a brief survey on Automatic Speech Recognition and discusses the major themes and advances made in the past 60 years of research, so as to provide a technological perspective and an appreciation of the fundamental progress that has been accomplished in this important area of speech communication. After years of research and development the accuracy of automatic speech recognition remains one of the important research challenges (e.g., variations of the context, speakers, and environment).The design of Speech Recognition system requires careful attentions to the following issues: Definition of various types of speech classes, speech representation, feature extraction techniques, speech classifiers, database and performance evaluation. The problems that are existing in ASR and the various techniques to solve these problems constructed by various research workers have been presented in a chronological order. Hence authors hope that this work shall be a contribution in the area of speech recognition. The objective of this review paper is to summarize and compare some of the well known methods used in various stages of speech recognition system and identify research topic and applications which are at the forefront of this exciting and challenging field.
An Improved Approach to High Level Privacy Preserving Itemset Mining
Venue: arXiv cs.DB 2010
Year: 2010

Privacy preserving association rule mining has triggered the development of many privacy preserving data mining techniques. A large fraction of them use randomized data distortion techniques to mask the data for preserving. This paper proposes a new transaction randomization method which is a combination of the fake transaction randomization method and a new per transaction randomization method. This method distorts the items within each transaction and ensures a higher level of data privacy in comparison to the previous approaches. The pertransaction randomization method involves a randomization function to replace the item by a random number guarantying privacy within the transaction also. A tool has also been developed to implement the proposed approach to mine frequent itemsets and association rules from the data guaranteeing the antimonotonic property.
Turbo Receiver Design for Phase Noise Mitigation in OFDM Systems
Venue: arXiv cs.IT 2010
Year: 2010

This paper addresses the issue of phase noise in OFDM systems. Phase noise (PHN) is a transceiver impairment resulting from the non-idealities of the local oscillator. We present a case for designing a turbo receiver for systems corrupted by phase noise by taking a closer look at the effects of the common phase error (CPE). Using an approximate probabilistic framework called variational inference (VI), we develop a soft-in soft-out (SISO) algorithm that generates posterior bit-level soft estimates while taking into account the effect of phase noise. The algorithm also provides an estimate of the phase noise sequence. Using this SISO algorithm, a turbo receiver is designed by passing soft information between the SISO detector and an outer forward error correcting (FEC) decoder that uses a soft decoding algorithm. It is shown that the turbo receiver achieves close to optimal performance.
A Distributed Data Storage Scheme for Sensor Networks
Venue: arXiv cs.CR 2010
Year: 2010

We present a data storage scheme for sensor networks that achieves the targets of encryption and distributed storage simultaneously. We partition the data to be stored into numerous pieces such that at least a specific number of them have to be brought together to recreate the data. The procedure for creation of partitions does not use any encryption key and the pieces are implicitly secure. These pieces are then distributed over random sensors for storage. Capture or malfunction of one or more (less than a threshold number of sensors) does not compromise the data. The scheme provides protection against compromise of data in specific sensors due to physical capture or malfunction.
A Tight Bound on the Performance of a Minimal-Delay Joint Source-Channel Coding Scheme
Venue: arXiv cs.IT 2010
Year: 2010

An analog source is to be transmitted across a Gaussian channel in more than one channel use per source symbol. This paper derives a lower bound on the asymptotic mean squared error for a strategy that consists of repeatedly quantizing the source, transmitting the quantizer outputs in the first channel uses, and sending the remaining quantization error uncoded in the last channel use. The bound coincides with the performance achieved by a suboptimal decoder studied by the authors in a previous paper, thereby establishing that the bound is tight.
On Optimum End-to-End Distortion in Wideband MIMO Systems
Venue: arXiv cs.IT 2010
Year: 2010

This paper presents the impact of frequency diversity on the optimum expected end-to-end distortion (EED) in an outage-free wideband multiple-input multiple-output (MIMO) system. We provide the closed-form expression of optimum asymptotic expected EED comprised of the optimum distortion exponent and the multiplicative optimum distortion factor for high signal-to-noise ratio (SNR). It is shown that frequency diversity can improve EED though it has no effect on ergodic capacity. The improvement becomes slight when the frequency diversity order is greater than a certain number. The lower bounds related to infinite frequency diversity are derived. The results for outage-free systems are the bounds for outage-suffering systems and they are instructive for system design.
An Explicit Nonlinear Mapping for Manifold Learning
Venue: arXiv cs.CV 2010
Year: 2010

Manifold learning is a hot research topic in the field of computer science and has many applications in the real world. A main drawback of manifold learning methods is, however, that there is no explicit mappings from the input data manifold to the output embedding. This prohibits the application of manifold learning methods in many practical problems such as classification and target detection. Previously, in order to provide explicit mappings for manifold learning methods, many methods have been proposed to get an approximate explicit representation mapping with the assumption that there exists a linear projection between the high-dimensional data samples and their low-dimensional embedding. However, this linearity assumption may be too restrictive. In this paper, an explicit nonlinear mapping is proposed for manifold learning, based on the assumption that there exists a polynomial mapping between the high-dimensional data samples and their low-dimensional representations. As far as we know, this is the first time that an explicit nonlinear mapping for manifold learning is given. In particular, we apply this to the method of Locally Linear Embedding (LLE) and derive an explicit nonlinear manifold learning algorithm, named Neighborhood Preserving Polynomial Embedding (NPPE). Experimental results on both synthetic and real-world data show that the proposed mapping is much more effective in preserving the local neighborhood information and the nonlinear geometry of the high-dimensional data samples than previous work.
Analytical shape determination of fiber-like objects with Virtual Image Correlation
Venue: arXiv cs.CV 2010
Year: 2010

This paper reports a method allowing for the determination of the shape of deformed fiber-like objects. Compared to existing methods, it provides analytical results including the local slope and curvature which are of first importance, for instance, in beam mechanics. The presented VIC (Virtual Image Correlation) method consists in looking for the best correlation between the image of the fiber-like object and a virtual beam image, using an algorithm close to the Digital Image Correlation method developed in experimental solid mechanics. The computation only involves the part of the image in the vicinity of the fiber: the method is thus insensitive to the picture background and the computational cost remains low. Two examples are reported: the first proves the precision of the method, the second its ability to identify a complex shape with multiple loops.
A General Euclidean Geometric Representation for the Classical Detection Theory
Venue: arXiv cs.IT 2010
Year: 2010

We propose an Euclidean geometric representation for the classical detection theory. The proposed representation is so generic that can be employed to almost all communication problems. The hypotheses and observations are mapped into R^N in such a way that a posteriori probability of an hypothesis given an observation decreases exponentially with the square of the Euclidean distance between the vectors corresponding to the hypothesis and the observation.
Detecting Botnets Through Log Correlation
Venue: arXiv cs.AI 2010
Year: 2010

Botnets, which consist of thousands of compromised machines, can cause significant threats to other systems by launching Distributed Denial of Service (SSoS) attacks, keylogging, and backdoors. In response to these threats, new effective techniques are needed to detect the presence of botnets. In this paper, we have used an interception technique to monitor Windows Application Programming Interface (API) functions calls made by communication applications and store these calls with their arguments in log files. Our algorithm detects botnets based on monitoring abnormal activity by correlating the changes in log file sizes from different hosts.
Note on sampling without replacing from a finite collection of matrices
Venue: arXiv cs.IT 2010
Year: 2010

This technical note supplies an affirmative answer to a question raised in a recent pre-print [arXiv:0910.1879] in the context of a "matrix recovery" problem. Assume one samples m Hermitian matrices X_1, ..., X_m with replacement from a finite collection. The deviation of the sum X_1+...+X_m from its expected value in terms of the operator norm can be estimated by an "operator Chernoff-bound" due to Ahlswede and Winter. The question arose whether the bounds obtained this way continue to hold if the matrices are sampled without replacement. We remark that a positive answer is implied by a classical argument by Hoeffding. Some consequences for the matrix recovery problem are sketched.
On Touching Triangle Graphs
Venue: arXiv cs.DM 2010
Year: 2010

In this paper, we consider the problem of representing graphs by triangles whose sides touch. As a simple necessary condition, we show that pairs of vertices must have a small common neighborhood. On the positive side, we present linear time algorithms for creating touching triangle representations for outerplanar graphs, square grid graphs, and hexagonal grid graphs. We note that this class of graphs is not closed under minors, making characterization difficult. However, we present a complete characterization of the subclass of biconnected graphs that can be represented as triangulations of some polygon.
An Immuno-Inspired Approach to Misbehavior Detection in Ad Hoc Wireless Networks
Venue: arXiv cs.NI 2010
Year: 2010

We propose and evaluate an immuno-inspired approach to misbehavior detection in ad hoc wireless networks. Node misbehavior can be the result of an intrusion, or a software or hardware failure. Our approach is motivated by co-stimulatory signals present in the Biological immune system. The results show that co-stimulation in ad hoc wireless networks can both substantially improve energy efficiency of detection and, at the same time, help achieve low false positives rates. The energy efficiency improvement is almost two orders of magnitude, if compared to misbehavior detection based on watchdogs. We provide a characterization of the trade-offs between detection approaches executed by a single node and by several nodes in cooperation. Additionally, we investigate several feature sets for misbehavior detection. These feature sets impose different requirements on the detection system, most notably from the energy efficiency point of view.
Energy Optimization across Training and Data for Multiuser Minimum Sum-MSE Linear Precoding
Venue: arXiv cs.IT 2010
Year: 2010

This paper considers minimum sum mean-squared error (sum-MSE) linear transceiver designs in multiuser downlink systems with imperfect channel state information. Specifically, we derive the optimal energy allocations for training and data phases for such a system. Under MMSE estimation of uncorrelated Rayleigh block fading channels with equal average powers, we prove the separability of the energy allocation and transceiver design optimization problems. A closed-form optimum energy allocation is derived and applied to existing transceiver designs. Analysis and simulation results demonstrate the improvements that can be realized with the proposed design.
Memory Allocation in Distributed Storage Networks
Venue: arXiv cs.IT 2010
Year: 2010

We consider the problem of distributing a file in a network of storage nodes whose storage budget is limited but at least equals to the size file. We first generate $T$ encoded symbols (from the file) which are then distributed among the nodes. We investigate the optimal allocation of $T$ encoded packets to the storage nodes such that the probability of reconstructing the file by using any $r$ out of $n$ nodes is maximized. Since the optimal allocation of encoded packets is difficult to find in general, we find another objective function which well approximates the original problem and yet is easier to optimize. We find the optimal symmetric allocation for all coding redundancy constraints using the equivalent approximate problem. We also investigate the optimal allocation in random graphs. Finally, we provide simulations to verify the theoretical results.
A New Class of TAST Codes With A Simplified Tree Structure
Venue: arXiv cs.IT 2010
Year: 2010

We consider in this paper the design of full diversity and high rate space-time codes with moderate decoding complexity for arbitrary number of transmit and receive antennas and arbitrary input alphabets. We focus our attention to codes from the threaded algebraic space-time (TAST) framework since the latter includes most known full diversity space-time codes. We propose a new construction of the component single-input single-output (SISO) encoders such that the equivalent code matrix has an upper triangular form. We accomplish this task by designing each SISO encoder to create an ISI-channel in each thread. This, in turn, greatly simplifies the QR-decomposition of the composite channel and code matrix, which is essential for optimal or near-optimal tree search algorithms, such as the sequential decoder.
Research Challenges for Enterprise Cloud Computing
Venue: arXiv cs.DC 2010
Year: 2010

Cloud computing represents a shift away from computing as a product that is purchased, to computing as a service that is delivered to consumers over the internet from large-scale data centers - or "clouds". This paper discusses some of the research challenges for cloud computing from an enterprise or organizational perspective, and puts them in context by reviewing the existing body of literature in cloud computing. Various research challenges relating to the following topics are discussed: the organizational changes brought about by cloud computing; the economic and organizational implications of its utility billing model; the security, legal and privacy issues that cloud computing raises. It is important to highlight these research challenges because cloud computing is not simply about a technological improvement of data centers but a fundamental change in how IT is provisioned and used. This type of research has the potential to influence wider adoption of cloud computing in enterprise, and in the consumer market too.
Universal Secure Error-Correcting Schemes for Network Coding
Venue: arXiv cs.IT 2010
Year: 2010

This paper considers the problem of securing a linear network coding system against an adversary that is both an eavesdropper and a jammer. The network is assumed to transport n packets from source to each receiver, and the adversary is allowed to eavesdrop on μarbitrarily chosen links and also to inject up to t erroneous packets into the network. The goal of the system is to achieve zero-error communication that is information-theoretically secure from the adversary. Moreover, this goal must be attained in a universal fashion, i.e., regardless of the network topology or the underlying network code. An upper bound on the achievable rate under these requirements is shown to be n-μ-2t packets per transmission. A scheme is proposed that can achieve this maximum rate, for any n and any field size q, provided the packet length m is at least n symbols. The scheme is based on rank-metric codes and admits low-complexity encoding and decoding. In addition, the scheme is shown to be optimal in the sense that the required packet length is the smallest possible among all universal schemes that achieve the maximum rate.
Approximate Privacy: PARs for Set Problems
Venue: arXiv cs.CR 2010
Year: 2010

In previous work (arXiv:0910.5714), we introduced the Privacy Approximation Ratio (PAR) and used it to study the privacy of protocols for second-price Vickrey auctions and Yao's millionaires problem. Here, we study the PARs of multiple protocols for both the disjointness problem (in which two participants, each with a private subset of {1,...,k}, determine whether their sets are disjoint) and the intersection problem (in which the two participants, each with a private subset of {1,...,k}, determine the intersection of their private sets). We show that the privacy, as measured by the PAR, provided by any protocol for each of these problems is necessarily exponential (in k). We also consider the ratio between the subjective PARs with respect to each player in order to show that one protocol for each of these problems is significantly fairer than the others (in the sense that it has a similarly bad effect on the privacy of both players).
Positioning based information technique in cooperative MIMO-OFDM systems
Venue: arXiv cs.NI 2010
Year: 2010

Future Communication networks are tending towards a diverse wireless networking world where the positioning information (PI) could be helpful in different techniques like the dynamic resource allocation. On the other hand, the PI could be widely used for cooperative techniques in the relay and/or routing selection process. In this paper, we propose to use the PI in the selection of the relays and then to apply an efficient double layer distributed space time block code (DLSTBC) scheme between the different relays. Using the amplify and forward (AF) technique, we show that the proposed code is very efficient whatever the transmitted power is. Moreover, we show that the relay selection process based on PI yields very powerful results when compared to the random relay selection (RS) process
HYMAD: Hybrid DTN-MANET Routing for Dense and Highly Dynamic Wireless Networks
Venue: arXiv cs.NI 2010
Year: 2010

In this paper we propose HYMAD, a Hybrid DTN-MANET routing protocol which uses DTN between disjoint groups of nodes while using MANET routing within these groups. HYMAD is fully decentralized and only makes use of topological information exchanges between the nodes. We evaluate the scheme in simulation by replaying real life traces which exhibit this highly dynamic connectivity. The results show that HYMAD outperforms the multi-copy Spray-and-Wait DTN routing protocol it extends, both in terms of delivery ratio and delay, for any number of message copies. Our conclusion is that such a Hybrid DTN-MANET approach offers a promising venue for the delivery of elastic data in mobile ad-hoc networks as it retains the resilience of a pure DTN protocol while significantly improving performance.
New Multi-step Worm Attack Model
Venue: arXiv cs.CR 2010
Year: 2010

The traditional worms such as Blaster, Code Red, Slammer and Sasser, are still infecting vulnerable machines on the internet. They will remain as significant threats due to their fast spreading nature on the internet. Various traditional worms attack pattern has been analyzed from various logs at different OSI layers such as victim logs, attacker logs and IDS alert log. These worms attack pattern can be abstracted to form worms' attack model which describes the process of worms' infection. For the purpose of this paper, only Blaster variants were used during the experiment. This paper proposes a multi-step worm attack model which can be extended into research areas in alert correlation and computer forensic investigation.