ppxscal/embedding_network huggingface dataset:
Hybrid burst erasure correction of LDPC codes
Authors: Marc Fossorier
Venue: IEEE Communications Letters (2009)

In this letter, burst erasure correction of low density parity check codes based on a hybrid approach is presented. The proposed method preserves as much as possible the original low density representation and augments it by specific check sums judiciously selected.
An Online RFID Laboratory Learning Environment
Authors: Nabil Lehlou, Nebil Buyurgan, Justin R. Chimka
Venue: IEEE Transactions on Learning Technologies (2009)

Due to the increasing demand for RFID expertise and the existence of a knowledge gap between industry and academia in this domain, work has been stimulated to help spread understanding in this field and bridge the gap between theoretical examinations and industrial practices. Among the encouraged work, there is the Integrated Auto-ID Technology for Multidisciplinary Undergraduate Studies (I-ATMUS) project that involved developing an online learning environment for RFID technology with a remotely controllable laboratory system. Technological resources can now be accessed by learners through the Web technology to apply appropriate configurations to the system, conduct experiments using RFID technology, and perform statistical analysis on the acquired data. The developed educational tool was used by two sets of students, who showed improvements in their confidence, knowledge, and skills.
Modeling and Performance Evaluation of the AoE Protocol
Authors: Chuang He, Wenbi Rao
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 01 (2009)

This paper introduced a new IP-Storage protocol named Ata over Ethernet, then modeled and analyzed the performance of it by comparing with iSCSI. To prove the theoretical analysis, we tested both AoE and iSCSI under various system configurations, i.e., under different network layer parameters and physical layer parameters. We found that both of them can affect AoE performance at different levels. It shows that as to maximum performance throughput, AoE has its natural advantages to iSCSI. However, deficiency of AoE was also found, i.e., the CPU efficiency of AoE shows a poorer result than iSCSI.
An extension of MISEP for post-nonlinear-linear mixture separation
Authors: Zhan-Li Sun
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

Mutual information separation (MISEP) is a versatile independent component analysis (ICA) algorithm that can be used to handle linear and nonlinear mixtures. By incorporating the a priori information of mixtures, an extended MISEP method is proposed in this brief to recover the source signals from the post-nonlinear-linear (PNL-L) mixtures. One group of multilayer perceptrons and two linear networks are used as the unmixing system, and another group of multilayer perceptrons is used as the auxiliary network. The learning algorithm of the system parameters is obtained by maximizing the output entropy with the gradient ascent method. Experimental results demonstrate that the proposed method is effective and efficient for PNL-L mixture separation.
A trivariate Nakagami-m distribution with arbitrary covariance matrix and applications togeneralized-selection diversity receivers
Authors: Kostas Peppas, Nikos C. Sagias
Venue: IEEE Transactions on Communications (2009)

This paper deals with a trivariate Nakagami-m distribution derived from the diagonal elements of a Wishart matrix. For this distribution, infinite series representations for its probability density and cumulative distribution functions are derived having an arbitrary covariance matrix and integer-order fading parameters. Moreover, upper bounds on the error resulting from truncating the infinite series are obtained. Based on the derived formulas, the performance of triple-branch generalized-selection combining (GSC) receivers is analyzed. For this type of receivers, the outage and the average bit error probability for a variety of modulation schemes are analytically obtained. The performance of GSC receivers is compared to that of conventional selection and maximal-ratio diversity schemes. In order to check the accuracy and convergence of the derived formulas, various performance evaluation results are presented and compared to equivalent simulation ones.
High performance non-binary quasi-cyclic LDPC codes on euclidean geometries
Authors: Bo Zhou, Jingyu Kang, Ying Yu Tai, Shu Lin, Zhi Ding
Venue: IEEE Transactions on Communications (2009)

This paper presents algebraic methods for constructing high performance and efficiently encodable non-binary quasi-cyclic LDPC codes based on flats of finite Euclidean geometries and array masking. Codes constructed based on these methods perform very well over the AWGN channel. With iterative decoding using a Fast Fourier Transform based sum-product algorithm, they achieve significantly large coding gains over Reed-Solomon codes of the same lengths and rates decoded with either algebraic hard-decision Berlekamp-Massey algorithm or algebraic soft-decision Kötter-Vardy algorithm. Due to their quasi-cyclic structure, these non-binary LDPC codes on Euclidean geometries can be encoded using simple shift-registers with linear complexity. Structured non-binary LDPC codes have a great potential to replace Reed-Solomon codes for some applications in either communication or storage systems for combating mixed types of noise and interferences.
Passivity analysis of neural networks with time-varying delays
Authors: Shengyuan Xu, Wei Xing Zheng, Yun Zou
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

This brief considers the problem of passivity analysis for neural networks with both time-varying delays and norm-bounded parameter uncertainties. For two types of time-varying delays, delay-dependent passivity conditions are derived, respectively. These conditions are expressed in terms of linear matrix inequalities. An example is provided to show the less conservatism of the proposed conditions.
Synchronizing redundant cores in a dynamic DMR multicore architecture
Authors: Amit Golander, Shlomo Weiss, Ronny Ronen
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

We introduce the difficulties in processing context switches, exceptions, and interrupts in DMR architectures. We propose ways to address these problems in a dynamic DMR (DDMR) architecture, providing methods that assure both cores detect the event, synchronize it to the same instruction, perform a secure context switch, run correct interrupt service routines, and avoid process termination. DDMR uses a time-division multiplexing (TDM) ring architecture to dynamically connect pairs of cores. We enhance this protocol to include the different message types required to handle interrupts and exceptions. We also propose a more efficient address-based, rather than TDM-based, ring architecture.
Spurious-free dynamic range of a uniform quantizer
Authors: Mark S. Oude Alink, André B. J. Kokkeler, Eric A. M. Klumperink, Kenneth C. Rovers, Gerard J. M. Smit, Bram Nauta
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

Quantization plays an important role in many systems where analog-to-digital conversion and/or digital-to-analog conversion take place. If the quantization error is correlated with the input signal, then the spectrum of the quantization error will contain spurious peaks. Although analytical formulas describing this effect exist, numerical evaluation can take much effort. This brief provides approximations for the spurious-free dynamic range (SFDR) of a uniform quantizer with a single sinusoidal input, with and without additive Gaussian noise. It is shown that the SFDR increases by approximately 8 dB/bit, in case there is no noise. Generalizing this result to multitone inputs results in an additional 2 dB/bit per additional tone. Additive Gaussian noise decorrelates the sinusoid(s) and the quantization error, which results in a dramatic increase in SFDR.
Simulations of modular multipliers on FPGA
Authors: Yinan Kong, Braden Phillips
Venue: Proceedings of the IASTED Asian Conference on Modelling and Simulation (2007)

A diverse variety of algorithms and architectures for modular multiplication have been published. They were recently classified into four classes, i.e. Sum of Residues, Classical, Barrett and Montgomery. This paper provides timing and area results for FPGA implementations and a survey of the four different architectures and wordlengths.
Post processing wrapper generated tables for labeling anonymous datasets
Authors: Emdad Ahmed, Hasan M. Jamil
Venue: Proceeding of the eleventh international workshop on Web information and data management (2009)

A large number of wrappers generate tables without column names for human consumption because the meaning of the columns are apparent from the context and easy for humans to understand, but in emerging applications, labels are needed for autonomous assignment and schema mapping where machine try to understand the tables. Autonomous label assignment is critical in volume data processing where ad hoc mediation, extraction and querying is involved. We propose an algorithm Lads for Labeling Anonymous Datasets, which can holistically label tabular web document. The algorithm has been tested on anonymous datasets from a number of sites, e.g music, movie, political, demographic, athletic obtained through different search engines such as Google, Yahoo and MSN. The comparative probabilities of attributes being candidate labels are presented which seem to be very promising, achieved as high as 93% probability of assigning good label to anonymous attribute. To the best of our knowledge, this is the first of its kind for label assignment based on multiple search engines' recommendation.
Stress concentration of shrink fit assembly using finite element method
Authors: Martin Francis, Le Van Ngan, Champliaud Henri, Nguyen Hoa Ngan
Venue: Proceedings of the IASTED Asian Conference on Modelling and Simulation (2007)

Contact stress along the interface due to shrink fit assembly highly increases at the contact edge and can lead to premature fatigue failure. Accurate results in the contact edge region can be obtained using finite element method with either constraint equations or contact elements. Since the stress at contact tip does not converge when the element size decreases, the stress at an internal point near the contact edge was studied instead. It was observed that neglecting the friction is a conservative assumption and the corner radius has a negative effect on shrink fit contact stress. If friction is neglected, the constraint equation method is more effective than contact element method for avoiding non linear iterations.
Preserving and exploiting genetic diversity in evolutionary programming algorithms
Authors: Gang Chen, Chor Ping Low, Zhonghua Yang
Venue: IEEE Transactions on Evolutionary Computation (2009)

Evolution programming (EP) is an important category of evolutionary algorithms. It relies primarily on mutation operators to search for solutions of function optimization problems (FOPs). Recently a series of new mutation operators have been proposed in order to improve the performance of EP. One prominent example is the fast EP (FEP) algorithm which employs a mutation operator based on the Cauchy distribution instead of the commonly used Gaussian distribution. In this paper, we seek to improve the performance of EP via exploring another important factor of EP, namely, the selection strategy. Three selection rules R1-R3 have been presented to encourage both fitness diversity and solution diversity. Meanwhile, two solution exchange rules R4 and R5 have been introduced to further exploit the preserved genetic diversity. Simple theoretical analysis suggests that through the proper use of R1-R5, EP is more likely to find high-fitness solutions quickly. Our claim has been examined on 25 benchmark functions. Empirical evidence shows that our solution selection and exchange rules can significantly enhance the performance of EP.
A Secure Certificateless Authenticated Group Key Agreement Protocol
Authors: Manman Geng, Futai Zhang, Meng Gao
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 01 (2009)

We present an efficient authenticated group key agreement (AGKA) protocol in certificateless public key setting (CL-AGKA). The protocol only needs two communication rounds. In each protocol run, only four pairing computations are involved for each participant. The authentication in our protocol is realized using a signature scheme which is provably secure in the strongest security model for certificateless signature (CLS) schemes where the type I/II adversary is a super type I/II adversary. The security analysis shows our protocol satisfies Key authentication, Known session key security, Key compromise impersonation security, Perfect forward security, and Known session-specific temporary information security.
Antenna selection with superposition for 4 × 2 DSTTD systems
Authors: Jingon Joung, Ali H. Sayed, Yong H. Lee
Venue: IEEE Communications Letters (2009)

From 1820 4 × 4 binary matrices, 253 binary pre-processing matrices are designed for double space-time transmit diversity (DSTTD) systems with two 2 × 2 space-time block code (STBC) encoders. Among them, six matrices yielding the highest average minimum-post-processing SNR are proposed from numerical experimentation under uncorrelated channel conditions. The proposed preprocessing performs a superposition of the first and second (second and first) STBC symbols and a selection of two transmit antennas. Simulation results show that the proposed method provides 1.7 dB (1.8 dB) SNR improvement in uncorrelated (correlated) channel environment at 10-3 bit error rate over the conventional antenna shuffling method.
A robust design of simulated annealing approach for mixed-model sequencing
Authors: Hyung-Soo Cho, Chun-Hyun Paik, Hang-Mook Yoon, Ho-Gyun Kim
Venue: Computers and Industrial Engineering (2005)

The effectiveness of the solution method based on simulated annealing (SA) mainly depends on how to determine the SA-related parameters. A scheme as well as parameter values for defining an annealing schedule should be appropriately determined, since various schemes and their corresponding parameter values have a significant impact on the performance of SA algorithms. In this paper, based on robust design we propose a new annealing parameter design method for the mixed-model sequencing problem which is known to be NP-hard. To show the effectiveness of the proposed method, extensive computation experiments are conducted. It was found that the robust designed method outperforms the SA algorithm by McMullen and Frazier [McMullen, P.R., & Frazier, G.V. (2000). A simulated annealing approach to mixed-model sequencing with multiple objectives on a just-in-time line. IIE Transactions, 32, 679-686].
Closed-form expression for optimal two-user MIMO unitary precoding
Authors: Ali Jalali, David J. Love
Venue: IEEE Communications Letters (2009)

In this paper we investigate the problem of optimal unitary precoding for multiuser multiple-input multiple-output (MIMO) wireless communication systems. In the case that there exist two users, we derive a closed-form solution for the unitary precoder that maximizes the sum rate. To provide additional insight, the optimal precoder is also characterized in several asymptotic regimes. Monte Carlo simulation results are also provided.
Contraction theory and master stability function: linking two approaches to study synchronization of complex networks
Authors: Giovanni Russo, Mario Di Bernardo
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

In this brief, the contraction theory is applied to the synchronization of a network. The association between the contraction principle, the Lyapunov exponents of a system, and the master stability function of the network is pointed out. Novel sufficient criteria for the fulfillment of a synchronous state are derived.
Enhancement of a periodic table and generic visualization methods
Authors: Boris B. Leontyev
Venue: Proceedings of the 10th IASTED International Conference on Computers and Advanced Technology in Education (2007)

Paper aimed to streamline engineering of visualizations, it analyzes state of visualization studies and its implications for technology-based education. To formalize procedures of visualizations' development a three-layer architecture proposed. To classify visualizations numerically from technical point of view signature, including two new criteria, based on complexity of visualization for groups and Abstract Data Types with number of commands for periods, were introduced and defined. New subject areas for visualizations were covered, software tools and environments analyzed, tested and selected, generic ADTs discriminated. Result of use of interface program between ADTs and geometric programming language implementation of a visualization was given as example. Three representative visualizations with seven defined attributes were given as case studies of application of developed techniques. New tools can put visualization methods unequivocally into proper boxes in a periodic table of visualization methods, define it with greater precision, enhance it as well as visualization methods themselves.
Steady state analysis of coded cooperative networks with HARQ protocol
Authors: Stefano Tomasin, Marco Levorato, Michele Zorzi
Venue: IEEE Transactions on Communications (2009)

We consider a network with an arbitrary number of nodes, where transmission of data packet is enhanced by a medium access control protocol that allows cooperation among nodes and solves transmission failures by an automatic repeat request (ARQ) protocol. Nodes operate in half-duplex mode and may interfere with each other as no coordination is assumed. In this scenario, we first derive the outage probability for a given number of interfering nodes and then relate the interference level to the single node behavior. We analyze the network behavior with a steady state analysis that matches the number of interfering nodes with the number of ARQ retransmissions. Two alternatives for cooperation are considered: decode and forward (DF) cooperation and multiple input-single output (MISO) cooperation, where for each packet transmission either one node transmits at a given time or two cooperating nodes transmit simultaneously. In our steady state analysis we also include an opportunistic version of DF, where cooperation is activated only when the quality of the cooperator-destination link is better than that of the source-destination link. Moreover, we investigate cooperator selection based on its distance to the destination.
On decorrelation in dual-branch diversity systems
Authors: Sasan Haghani, Norman C. Beaulieu
Venue: IEEE Transactions on Communications (2009)

The performance of a dual-branch decorrelator receiver operating in correlated Rayleigh and Rician fading channels in conjunction with selection combining (SC) and switch-and-stay combining (SSC) is analyzed and compared to the performance of a conventional SC and SSC receiver. For each combining scheme, analytical expressions for the average bit error rate (BER) of several modulation techniques of practical interest, the mean output signal-to-noise ratio (SNR) and the outage probability are derived. It is shown that the decorrelator receiver has superior performance over the conventional receiver by as much as 2.83 dB in average SNR. The effects of modulation order, correlation coefficient and the severity of fading on the performance of the decorrelator receiver are studied.
Construction of near-optimum burst erasure correcting low-density parity-check codes
Authors: Enrico Paolini, Marco Chiani
Venue: IEEE Transactions on Communications (2009)

In this paper, a simple 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 of starting from the parity-check matrix of an LDPC code and developing an optimized parity-check matrix, with the same performance over the memoryless erasure channel, and suitable also for the iterative correction of single erasure bursts. The parity-check matrix optimization is performed by an algorithm called pivot searching and swapping (PSS) algorithm. It 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 to achieve a good performance over the memoryless erasure channel, then the code obtained after the application of the algorithm provides a good joint correction of independent erasures and single erasure bursts. Numerical results are provided in order to show the algorithm effectiveness when applied to different categories of LDPC codes.
A Solution of Video Semi-fragile Watermarking of Authentication Based on Binary Characteristic Strings
Authors: Hua Jiang, Huijiao Wang, Xin Wang
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

The binary characteristic string is calculated from I-frame by using the semi-fragile characteristic in this paper, and the binary watermarking is generated by using the characteristic string as the encryption key. This watermarking based on the content is embedded into I-frame, which is used to distinguish whether the video content remains unchanged or not. So the integrity of MPEG-4 videos' I-frame is protected and authenticated. The experimental results show that the solution is robust for the operations of saving content and is fragile for the operations of modification.
Pi coil: a new element for bandwidth extension
Authors: Saihua Lin, Dawei Huang, Simon Wong
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

This brief presents a new passive element called Pi coil for bandwidth extension. Its transfer function and detailed design tables are given. Based on ideal elements, the proposed Pi coil can achieve the largest bandwidth extension ratio compared to its counterpart, i.e., T coil, and other similar bandwidth-enhancing techniques. In addition, the input return loss (S11) is much improved by using this technique. On-chip implementation methods of the T coil and the Pi coil are also investigated in this brief.
Detection of motion-incoherent components in video streams
Authors: Vinod Pankajakshan, Gwenaël Doërr, Prabin Kumar Bora
Venue: IEEE Transactions on Information Forensics and Security (2009)

Motion coherency has recently been identified as a desirable property for watermarks embedded within video streams in order to withstand temporal frame averaging along the motion axis. Nevertheless, no tool has been proposed to easily evaluate the motion coherency of a given watermarking system. Today, this assessment relies on a computationally expensive procedure, namely, 1) embed a watermark, 2) perform temporal frame averaging, and 3) check for the presence of the watermark. In this article, a novel oracle is designed to detect whether a video stream contains any motion-incoherent component or not. Since such incoherence can be introduced by nonmotion-coherent watermarking algorithms, this tool has proven to be most valuable to distinguish watermarked from nonwatermarked content. The oracle relies on some features extracted from error frames after motion compensation. Experimental results demonstrate the efficiency of the proposed method with uncompressed and compressed video streams.