A new method for simulating the folding pathway of RNA secondary structure using the modified ant colony algorithmis *** a given RNA sequence,the set of all possible stems is obtained and the energy of each stem iscal...
详细信息
A new method for simulating the folding pathway of RNA secondary structure using the modified ant colony algorithmis *** a given RNA sequence,the set of all possible stems is obtained and the energy of each stem iscalculated and stored at the initial ***,a more realistic formula is used to compute the energy ofmulti-branch loop in the following *** a folding pathway is simulated,including such processes as constructionof the heuristic information,the rule of initializing the pheromone,the mechanism of choosing the initial andnext stem and the strategy of updating the pheromone between two different *** by testing RNA sequences withknown secondary structures from the public databases,we analyze the experimental data to select appropriate values *** measure indexes show that our procedure is more consistent with phylogenetically proven structures thansoftware RNAstructure sometimes and more effective than the standard Genetic Algorithm.
Traditional supervised text classifiers require a large number of manually labeled documents, which are often expensive to obtain. Recently, dataless text classification has attracted more attention, since it only req...
详细信息
The traditional RBAC model already cannot express the complicated secure access control constraint of the workflow. Based on the traditional RBAC model, a new conditioned RBAC model named as CMWRBSAC is proposed on th...
详细信息
In this paper, a novel approach for surveillance video cropping is presented. The basic idea is to obtain a trajectory that a small sub-window can take through the video, selecting the most important regions of the vi...
详细信息
In this paper, a novel approach for surveillance video cropping is presented. The basic idea is to obtain a trajectory that a small sub-window can take through the video, selecting the most important regions of the video for display on a smaller monitor. In this framework, the video content is firstly modeled by whether image frames change at each pixel. Then a shortest path algorithm is used to find the globally optimal trajectory for a cropping window. After that a second shortest path formulation is employed to find good cuts from one trajectory to another, improving the coverage of interesting events in the video content. Finally, additional techniques are demonstrated to improve the quality and efficiency of the algorithm, and results are shown on surveillance videos from PETS 2006.
To represent and reason with interval-value information of applications in description logic, based on interval-fuzzy set the classical des cription logic ALCN is extended to the fuzzy description logic IFALCN. Its...
详细信息
Histological image classification plays a crucial role in cancer diagnosis. However, the acquisition of well-labeled histological images is prohibitively expensive, and obtaining rare abnormal samples is challenging. ...
详细信息
ISBN:
(纸本)9798350358780
Histological image classification plays a crucial role in cancer diagnosis. However, the acquisition of well-labeled histological images is prohibitively expensive, and obtaining rare abnormal samples is challenging. Therefore, applying few-shot learning methods to histological image classification tasks holds significant clinical value. Nevertheless, existing research predom-inantly relies on coarse-grained image classification approaches based on natural image datasets, which struggle to address the fine-grained challenges encountered in histological image classification, such as intra-class diversity and inter-class similarity. To tackle this issue, this study proposes a novel few-shot fine-grained classification method for histological images, named 'Category-Aware Feature Map Reconstruction Network.' This method employs channel weights to localize the differences between inter-class and intra-class regions, composed of intra-class channel weights and inter-class channel weights, collectively referred to as category-aware weights. Specifically, intra-class channel weights indicate the matching degree of salient regions within the support set of a particular class, while inter-class channel weights represent the degree of containing distinct information between classes. The category-aware weights are utilized to transform the support feature maps and query feature maps, generating feature maps that capture differentiating details between categories. Finally, the distance between the transformed query feature map and support feature map is calculated to achieve probabilistic predictions for the categories. On a histological few-shot dataset, this method achieves an accuracy of 90.23% using ResNet-12 as the feature extractor, surpassing the baseline model by 5.24% and outperforming other few-shot methods by at least 10% in the 5-way 10-shot experimental setting. The proposed method exhibits exceptional performance on histological image few-shot datasets, playing a
The satisfiability(SAT) problem is an important problem of automated reasoning. In the past decades, many methods of SAT are proposed, such as method based on resolution, method based on tableau and method based on ex...
详细信息
The rapid developments of chip-based technology have greatly improved human genetics and made routine the access of thousands of single nucleotide polymorphisms (SNPs) contributing to an informatics challenge. The cha...
详细信息
ISBN:
(纸本)9781450328104
The rapid developments of chip-based technology have greatly improved human genetics and made routine the access of thousands of single nucleotide polymorphisms (SNPs) contributing to an informatics challenge. The characterization and interpretation of genes and gene-gene interactions that affect the susceptibility of common, complex multifactorial diseases is a computational and statistical challenge in genome-wide association studies (GWAS). Various methods have been proposed, but they have dificulty to be directly applied to GWAS caused by excessive search space and intensive computational burden. In this paper, we propose an ant colony optimization (ACO) based algorithm by combining the pheromone updating rule with the heuristic information. We tested power performance of our algorithm by conducting suficient experiments including a wide range of simulated datasets experiments and a real genome-wide dataset experiment. Experimental results demonstrate that our algorithm is time efficient and gain good performance in the term of the power of prediction accuracy. Copyright 2014 ACM.
With the complexity of the functions of modern buildings, the problem of vertical traffic in buildings is becoming more and more prominent. As the only vertical transportation, the elevator is a necessary prerequisite...
详细信息
The past decade has witnessed the rapid development of search engines, which has become an indispensable part of everyday life. However, people are no longer satisfied with accessing to ordinary information, and they ...
详细信息
暂无评论