In TCM (Traditional Chinese Medicine) theory, the cold-and-hot property of food is considered as an important information to guide people's daily diet and keep them healthy. But the classification of this property...
详细信息
Simple Tabular Reduction algorithms (STR) work well to establish Generalized Arc Consistency (GAC) on positive table constraints. However, the existing STR algorithms are useless for negative table constraints. In thi...
详细信息
Identification of transcription factor binding sites from the upstream regions of genes is a highly important and unsolved problem. In this paper, we propose a novel framework for using evolutionary algorithm to solve...
详细信息
ISBN:
(纸本)0769525288
Identification of transcription factor binding sites from the upstream regions of genes is a highly important and unsolved problem. In this paper, we propose a novel framework for using evolutionary algorithm to solve this challenging issue. Under this framework, we use two prevalent evolutionary algorithms: Genetic, Algorithm (GA) and Particle Swarm Optimization (PSO) to find unknown sites in a collection of relatively long intergenic sequences that are suspected of being bound by the same factor. This paper represents binding sites motif to position weight matrix (PWM) and introduces how to code PWM to genome for GA and how to code it to particle for PSO. We apply these two algorithms to 5 different yeast Saccharomyces Cerevisiae transcription factor binding sites and CRP binding sites. The results on Saccharomyces Cerevisiae show that it can find the correct binding sites motifs, and the result on CRP shows that these two algorithms can achieve more accuracy than MEME and Gibbs Sampler.
Image registration is a vital research branch in medical image processing and analysis. In this paper, we proposed a new framework for rigid medical image registration. It can also be regarded as a pre-processing of n...
详细信息
Image registration is a vital research branch in medical image processing and analysis. In this paper, we proposed a new framework for rigid medical image registration. It can also be regarded as a pre-processing of non-rigid image registration algorithms. The interest of the algorithm lies in its simplicity and high e±ciency. In the registration algorithm, we firstly segmented the reference image and °oat image into two parts: tissue parts and background parts. Then the centers of the two images were located through performing distance transform on the two segmented tissue images. Finally, we detected the longest radius of the two tissue regions, by which we determined the rotating angle. We tested the registration algorithm on dozens of medical images, and the experimental results show us that the algorithm is competent for medical image registration.
A voting-mechanism-based fuzzy neural network system is proposed in this paper. When constructing the network structure, a generalized class cover problem is presented and its two solving algorithm, an improved greedy...
详细信息
作者:
Chen, KeHan, XiaosongLi, XiaoranLiang, YanchunXu, DongGuan, RenchuJilin University
Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry College of Software Changchun China Jilin University
Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry College of Computer Science and Technology Changchun China Zhuhai College of Science and Technology
Zhuhai Laboratory of Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education School of Computer Science Zhuhai China University of Missouri
Christopher S. Bond Life Sciences Center Department of Electrical Engineering and Computer Science Columbia United States
Drug-Drug Interaction (DDI) task plays a crucial role in clinical treatment and drug development. Recently, deep learning methods have been successfully applied for DDI prediction. However, training deep learning mode...
详细信息
Ideal interpolation is a generalization of the univariate Hermite interpolation. It is well known that every univariate Hermite interpolant is a pointwise limit of some Lagrange ***, a counterexample provided by Shekh...
详细信息
Ideal interpolation is a generalization of the univariate Hermite interpolation. It is well known that every univariate Hermite interpolant is a pointwise limit of some Lagrange ***, a counterexample provided by Shekhtman Boris shows that, for more than two variables,there exist ideal interpolants that are not the limit of any Lagrange interpolants. So it is natural to consider: Given an ideal interpolant, how to find a sequence of Lagrange interpolants(if any) that converge to it. The authors call this problem the discretization for ideal interpolation. This paper presents an algorithm to solve the discretization problem. If the algorithm returns "True", the authors get a set of pairwise distinct points such that the corresponding Lagrange interpolants converge to the given ideal interpolant.
Time Delay Neural Network (TDNN) is a well-performing structure for deep neural network-based speaker recognition systems. In this paper we introduce a novel structure, named Crossed-Time Delay Neural Network (CTDNN) ...
详细信息
The proxy cache for streaming media is the important method to economize the resources of the Internet. The cache policies influence the effect for proxy cache. In this paper, based on the client's request rate, c...
详细信息
Three kinds of constrained traveling salesman problems (TSP) arising from application problems, namely the open route TSP, the end-fixed TSP, and the path-constrained TSP, are proposed. The corresponding approaches ba...
详细信息
Three kinds of constrained traveling salesman problems (TSP) arising from application problems, namely the open route TSP, the end-fixed TSP, and the path-constrained TSP, are proposed. The corresponding approaches based on modified genetic algorithms (GA) for solving these constrained TSPs are presented. Numerical experiments demonstrate that the algorithm for the open route TSP shows its advantages when the open route is required, the algorithm for the end-fixed TSP can deal with route optimization with constraint of fixed ends effectively, and the algorithm for the path-constraint could benefit the traffic problems where some cities cannot be visited from each other.
暂无评论