This paper presents novel reconfigurable semi-systolic array architecture for the Smith-Waterman with an affine gap penalty algorithm to align protein sequences optimized for shorter database sequences. This architecture has been modified to enable hardware reuse rather than replicating processing elements of the semi-systolic array in multiple FPGAs. The proposed hardware architecture and the previously published conventional one are described at the Register Transfer Level (RTL) using VHDL language and implemented using the FPGA technology. The results show that the proposed design has significant higher normalized speedup (up to 125%) over the conventional one for query sequence lengths less than 512 residues. According to the UniProtKB/TrEMBL protein database (release 2015_05) statistics, the largest number of sequences (about 80%) have sequence length less than 512 residues that makes the proposed design outperforms the conventional one in terms of speed and area in this sequence lengths range.

View full abstract

Research into closed-form Gaussian sum smoother has provided an attractive approach for tracking in clutter, joint detection and tracking (in clutter), and multiple target tracking (in clutter) via the probability hypothesis density (PHD). However, Gaussian sum smoother with nonlinear target model has particular nonlinear expressions in the backward smoothed density that are different from the other filters and smoothers. In order to extend the closed-form solution of linear Gaussian sum smoother to nonlinear model, two closed-form approximations for nonlinear Gaussian sum smoother are proposed, which use Gaussian particle approximation and unscented transformation approximation, separately. Since the estimated target number of PHD smoother is not stable, a heuristic approximation method is added. At last, the Bernoulli smoother and PHD smoother are simulated using Gaussian particle approximation and unscented transformation approximation, and simulation results show that the two proposed algorithms can obtain smoothed tracks with nonlinear models, and have better performance than filter.

View full abstract

The alternating direction implicit (ADI) method is proposed for low-rank solution of projected generalized continuous-time algebraic Lyapunov equations. The low-rank solution is expressed by Cholesky factor that is similar to that of Cholesky factorization for linear system of equations. The Cholesky factor is represented in a real form so that it is useful for balanced truncation of sparsely connected RLC networks. Moreover, we show how to determine the shift parameters which are required for the ADI iterations, where Krylov subspace method is used for finding the shift parameters that reduce the residual error quickly. In the illustrative examples, we confirm that the real Cholesky factor certainly provides low-rank solution of projected generalized continuous-time algebraic Lyapunov equations. Effectiveness of the shift parameters determined by Krylov subspace method is also demonstrated.

View full abstract

This paper presents efficient and easily implementable methods for the characteristic analysis and tolerance analysis of nonlinear resistive circuits using integer programming. In these methods, the problem of finding all characteristic curves or all solution sets (regions of possible operating points) is formulated as a mixed integer programming problem, and it is solved by a high-performance integer programming solver such as CPLEX. It is shown that the proposed methods can easily be implemented without making complicated programs, and that all characteristic curves or all solution sets are obtained by solving mixed integer programming problems several times. Numerical examples are given to confirm the effectiveness of the proposed methods.

View full abstract

Recently, Park and Lee suggested a new framework for realizing Identity-Based Encryption (IBE) trapdoor called ‘two-equation-revocation’, and proposed a new IBE system that makes use of a Map-To-Point hash function. In this paper, we present a variant of the PL system by giving a simple way to remove the Map-To-Point hash function from the PL system. Our variant is proven to be secure under non-standard security assumptions, which results in the degradation of security. Instead, our variant can have several efficiency advantages over the PL system: (1) it provides receiver's anonymity, (2) it has no correctness error, (3) it has shorter ciphertext, and (4) it has faster encryption. As a result, (when not considering security assumptions and security losses) our variant is as efficient as the Boneh-Boyen and Sakai-Kasahara IBE systems that are considered as being the most practical ones.

View full abstract

A projective Reed-Muller (PRM) code, obtained by modifying a Reed-Muller code with respect to a projective space, is a doubly extended Reed-Solomon code when the dimension of the related projective space is equal to 1. The minimum distance and the dual code of a PRM code are known, and some decoding examples have been presented for low-dimensional projective spaces. In this study, we construct a decoding algorithm for all PRM codes by dividing a projective space into a union of affine spaces. In addition, we determine the computational complexity and the number of correctable errors of our algorithm. Finally, we compare the codeword error rate of our algorithm with that of the minimum distance decoding.

View full abstract

Glial cells include several types of cells such as astrocytes, and oligodendrocytes apart from the neurons in the brain. In particular, astrocytes are known to be important in higher brain function and are therefore sometimes simply called glial cells. An astrocyte can transmit signals to other astrocytes and neurons using ion concentrations. Thus, we expect that the functions of an astrocyte can be applied to an artificial neural network. In this study, we propose a multi-layer perceptron (MLP) with a pulse glial chain. The proposed MLP contains glia (astrocytes) in a hidden layer. The glia are connected to neurons and are excited by the outputs of the neurons. The excited glia generate pulses that affect the excitation thresholds of the neurons and their neighboring glia. The glial network provides a type of positional relationship between the neurons in the hidden layer, which can enhance the performance of MLP learning. We confirm through computer simulations that the proposed MLP has better learning performance than a conventional MLP.

View full abstract

We propose a novel multiple kernel learning (MKL) method using a collaborative representation constraint, called CR-MKL, for fusing the emotion information from multi-level features. To this end, the similarity and distinctiveness of multi-level features are learned in the kernels-induced space using the weighting distance measure. Our method achieves better performance than existing methods by using the voiced-level and unvoiced-level features.

View full abstract

Wheeze is a general sign for obstructive airway diseases whose clinical diagnosis mainly depends on auscultating or X-ray imaging with subjectivity or harm. Therefore, this paper introduces an automatic, noninvasive method to detect wheeze which consists of STFT decomposition, preprocessing of the spectrogram, correlation-coefficients calculating and duration determining. In particular, duration determining takes the Haas effect into account, which facilitates us to achieve a better determination. Simulation result shows that the sensibility (SE), the specificity (SP) and the accuracy (AC) are 88.57%, 97.78% and 93.75%, respectively, which indicates that this method could be an efficient way to detect wheeze.

View full abstract

In distributed storage systems, codes with lower repair locality are much more desirable due to their superiority in reducing the disk I/O complexity of each repair process. Motivated partially by both codes with information (r,δ₁)_c locality and codes with cooperative (r,l) locality, we propose the concept of codes with information (r,l,δ) locality in this paper. For a linear code C with information (r,l,δ) locality, values at arbitrary l information coordinates of an information set I can be recovered by connecting any of δ existing pairwise disjoint local repair sets with size no more than r, where a local repair set of l coordinates is defined as the set of some other coordinates by which one can recover the values at these l coordinates. We derive a lower bound on the codeword length n for [n,k,d] linear codes with information (r,l,δ) locality. Furthermore, we indicate its tightness for some special cases. Particularly, some existing results can be deduced from our bound by restriction on parameters.

View full abstract

We propose a cooperative spectrum sensing scheme based on sub-Nyquist sampling in cognitive radios. Our main purpose is to understand the uncertainty caused by sub-Nyquist sampling and to present a sensing scheme that operates at low sampling rates. In order to alleviate the aliasing effect of sub-Nyquist sampling, we utilize cooperation among secondary users and the sparsity order of channel occupancy. The simulation results show that the proposed scheme can achieve reasonable sensing performance even at low sampling rates.

View full abstract

This letter considers a unified tone mapping operation (TMO) for HDR images. The unified TMO can perform tone mapping for various HDR image formats with a single common operation. The integer TMO which can realize unified tone mapping by converting an input HDR image into an intermediate format is proposed. This method can be executed efficiently with low memory and low performance processor. However, only floating-point HDR image formats have been considered in the method. In other words, a long-integer which is one of the HDR image formats has not been considered in the method. This letter applies the method to a long-integer format, and confirm its performance. The experimental results show the proposed method is effective for an integer format in terms of the resources such as the computational cost and the memory cost.

View full abstract