检索结果-内蒙古大学图书馆

12th IEEE International Conference on E-Business engineering, ICEBE 2015

作者： Wang, Xu Ouyang, Jihong College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

ISBN: (纸本)9781467380027

A novel method to measure the graph similarity is proposed, where the labels, in-degrees, and out-degrees of the vertices in the graph are comprehensively considered in order to conquer the high complexity and information loss in the measurement process. In this proposal, the graph is decomposed into a generalized tree and its similarity can be measured by computing the cost of the node sequence triples in the generalized tree. The proposed method decreases the computational complexity to O(n2) in comparison with the other available graph similarity methods. An example is provided to illustrate that the method is feasible and effective. © 2015 IEEE.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Simulating the Folding Pathway of RNA Secondary Structure Using the Modified Ant Colony Algorithm

引用

Journal of Bionic engineering 2010年第4期7卷 382-389页

作者： Jun Yu~(1,2),Changhai Zhang~(1,2),Yuanning Liu~(1,2),Xin Li~(1,2) 1.College of Computer Science and Technology,Jilin University,Changchun 130012,P.R.China 2.key laboratory of symbolic computation and knowledge engineering (Ministry of Education,China) Jilin University,Changchun 130012,P.R.China [a] College of Computer Science Technology Jilin University Changchun 130012 P. R. China [b] Key Laboratory of Symbolic Computation Knowledge Engineering (Ministry of Education China) Jilin University Changchun 130012 P. R. China

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.

关键词： RNA secondary structure folding pathway ant colony algorithm

来源：评论

学校读者我要写书评

暂无评论

A pseudo label based dataless naive bayes algorithm for text classification with seed words 27

A pseudo label based dataless naive bayes algorithm for text...

引用

27th International Conference on computational Linguistics, COLING 2018

作者： Li, Ximing Yang, Bo College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China

ISBN: (纸本)9781948087506

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 requires very few seed words of categories that are much cheaper. In this paper, we develop a pseudo-label based dataless Naive Bayes (PL-DNB) classifier with seed words. We initialize pseudo-labels for each document using seed word occurrences, and employ the expectation maximization algorithm to train PL-DNB in a semi-supervised manner. The pseudo-labels are iteratively updated using a mixture of seed word occurrences and estimations of label posteriors. To avoid noisy pseudo-labels, we also consider the information of nearest neighboring documents in the pseudo-label update step, i.e., preserving local neighborhood structure of documents. We empirically show that PL-DNB outperforms traditional dataless text classification algorithms with seed words. Especially, PL-DNB performs well on the imbalanced dataset. © 2018 COLING 2018 - 27th International Conference on computational Linguistics, Proceedings. All rights reserved.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

A conditioned secure access control model based on multi-weighted roles in workflow system

A conditioned secure access control model based on multi-wei...

引用

5th International Conference on Control and Automation, ICCA'05

作者： Zhang, Jian Sun, Jigui Li, Niya Hu, Chengquan College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University China

ISBN: (纸本)0780391381

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 the basis of multi-weighted roles. A conditioned RBAC strategy is discussed on the basis of dynamic role assignment. A new concept of workflow access authorization is defined on the basis of roles with multi-weights, including the hierarchy weight, the degree weight and the sequence weight. Furthermore, in order to solve the problems of the sequence constraint of cooperative activating task by multi-roles and multi-users, a sort algorithm based on token and a sort algorithm based on weighted roles synthesis are presented respectively. Finally, an example is given to show the work processes of these algorithms. This model can express complicated workflow secure access control constraint. © 2005 IEEE.

关键词： Security systems

来源：评论

学校读者我要写书评

暂无评论

A globally optimal approach for surveillance video cropping

A globally optimal approach for surveillance video cropping

引用

作者： Liu, Jin Shi, Xiaohu Zhang, Yu College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education 130012 Changchun China

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.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

Interval-valued fuzzy description logic IFALCN - Preliminary results

Interval-valued fuzzy description logic IFALCN - Preliminary...

引用

2010 IEEE International Conference on Intelligent Computing and Intelligent Systems, ICIS 2010

作者： Huo, Linlin Ouyang, Jihong Liu, Dayou Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun China

ISBN: (纸本)9781424465835

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' syntax, semantics and fuzzy tableau algorithm are presented in detail. Our work enhances the expressiveness and reasoning ability of ALCN. IFALCN is the generalization of fuzzy ALCN based on single value and more expressive than the latter and can conform to human cognition better. ©2010 IEEE.

关键词： Fuzzy sets

来源：评论

学校读者我要写书评

暂无评论

An Efficient Method for Calculating Qualitative Spatial Relations

引用

电子学报(英文版) 2009年第1期18卷 42-46页

作者： WANG Shengsheng LIU Dayou College of Computer Science and Technology Key Laboratory of Symbolic Computing and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

Qualitative spatial relations are widely used in geospatial ontologies, geospatial (semantic) web services, spatial description logics etc. Methodology to obtain qualitative spatial relations (especially complex spatial relations) from Geographical information system (GIS) has not been studied in previous literatures. An efficient method for calculating complex qualitative spatial relations is discussed here. First, the multi-granularities approximate representation of spatial objects is proposed, it is designed for GIS object types (such as polygon), and requires less process time. Then some algorithms for calculating complex spatial relations based on the multi-granularities approximate representation are given. Finally, this method is implemented and used to obtain topology and direction relations from world map. The analysis and test results show that this method supports complex and integrated spatial relations and requires less process time than traditional method. This method is suitable for obtaining spatial relations for geospatial ontologies and other applications.

关键词：空间关系计算地理信息系统地理本体信息系统设计网络服务描述逻辑空间对象

来源：评论

学校读者我要写书评

暂无评论

Few-Shot Fine-Grained Classification of Histological Images 1

Few-Shot Fine-Grained Classification of Histological Images

引用

1st IEEE International Conference on Medical Artificial Intelligence, MedAI 2023

作者： Jiang, Yingdong Huang, Jing Jin, Zihe Shen, Leqi Zhang, Ziyi College of Software Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education ChangChun China College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education ChangChun China College of Computer Science and Technology Jilin University ChangChun China

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

关键词： Computer aided diagnosis

来源：评论

学校读者我要写书评

暂无评论

Solving SAT problem with Boolean algebra

Solving SAT problem with Boolean algebra

引用

International Conference on Frontier of Computer Science and Technology

作者： Xu, Youjun Ouyang, Dantong Ye, Yuxin He, Jialiang College of Computer Science and Technology China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University Changchun China

ISBN: (纸本)9780769541396

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 extension rule. Based on the study of extension rule, we And that the SAT problem can be solved with hitting set algorithms. If we can find a hitting set of a clause set, and if there is not any pair of complementary literals in the hitting set, the clause set is satisfiable. Algorithm BHS based on Boolean algebra proposed by Jiang is an efficient hitting set algorithm. SSBF proposed in this paper is a revised algorithm of BHS that can be used to judge the satisfiability of a clause set. The test result shows that SSBF is an efficient algorithm. © 2010 IEEE.

关键词： Boolean algebra

来源：评论

学校读者我要写书评

暂无评论

A new epistasis detecting algorithm based on ant colony optimization 14

A new epistasis detecting algorithm based on ant colony opti...

引用

6th International Conference on Internet Multimedia Computing and Service, ICIMCS 2014

作者： Zhou, Zhihui Liu, Guixia Su, Lingtao Han, Liang Yan, Lun College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

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.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：