This paper presents new solution methods and results based on a refined binary particle swarm optimization (RBPSO) for solving the generation/pumping scheduling problem within the power system operation with pumped-storage units. The proposed RBPSO approach combines a basic particle swarm optimization (PSO) with binary encoding/decoding techniques. Complete solution algorithms and encoding/deco...

Multifrequency steady-state visual evoked potentials (SSVEPs) have been developed to extend the capability of SSVEP-based brain-machine interfaces (BMIs) complex applications that large numbers targets. Even though various multifrequency stimulation methods introduced, decoding algorithms for SSVEP are still in early development. The recently canonical correlation analysis (MFCCA) was shown be ...

The Transmitter Identification Information (TII) provides unambiguous identification of each transmitter in a Digital Audio Broadcast (DAB) and Digital Multimedia Broadcast (DMB) network. Recent researches showed that some useful services, such as location and automatic emergency alert, can be efficiently implemented with the assistance of TII. However many DAB/DMB receivers do not have the TII...

In this paper, we study the problem of low-rank matrix sensing where the goal is to reconstruct a matrix exactly using a small number of linear measurements. Existing methods for the problem either rely on measurement operators such as random element-wise sampling which cannot recover arbitrary low-rank matrices or require the measurement operator to satisfy the Restricted Isometry Property (RI...

m-of-n codes can be used for carrying data over selftimed on-chip interconnect links. Such codes can be chosen to have low redundancy, but the costs of encoding/decoding data is high. The key to enabling the cost-effective use of m-of-n codes is to find a suitable mapping of the binary data to the code. This paper presents a new method for selecting suitable mappings through the decomposition o...

This paper is concerned with a class of low-rate codes constructed from Hadamard code arrays. A recursive encoding principle is employed to introduce an interleaving gain. Very simple trellis codes with only two or four states are sufficient for this purpose, and the decoding cost involved in the trellis part is typically negligible. Both simulation and analytical results are provided to demons...

Discrete-time all-analog-processing joint source-channel coding with Maximum Likelihood (ML) and Minimum Mean Square Error (MMSE) detections are employed in fast fading Rayleigh channel. Co-operative communication achieves spatial diversity using single antenna devices. Spatial diversity improves the performance of analog joint source-channel coding in wireless fading channels. In the case of d...

This article presents a modification of the CFS code based signature scheme. By producing two (or more generally i) signatures in parallel, we show that it is possible to protect this scheme from “one out of many” decoding attacks. With this modification, and at the cost of slightly larger signatures, it is possible to use smaller parameters for the CFS signature, thus making this new Parallel-...

26 Abstract— DNA computing was proposed [1] as a method of solving a group of inflexible computational tribulations in which the computing time can grow up exponentially with respect to the problem size. A DNA can also be used as a next generation Digital Information Storage Medium that has tremendous storage capacity and low maintenance cost. This process of artificial manufacturing and decodi...

We propose a perceptron-style algorithm for fast discriminative training of structured latent variable model, and analyzed its convergence properties. Our method extends the perceptron algorithm for the learning task with latent dependencies, which may not be captured by traditional models. It relies on Viterbi decoding over latent variables, combined with simple additive updates. Compared to e...