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

3rd IEEE International Conference on Intelligent Systems

作者： Wei, Jin-Mao Wang, Shu-Qin Wang, Jing You, Jun-Ping Institute of Computational Intelligence Northeast Normal University Open Symbol Computation and Knowledge Engineering Laboratory of State Education Jilin University Changchun Jilin 130024 China School of Mathematics and Statistics Northeast Normal University Changchun Jilin 130024 China

ISBN: (纸本)9781424401956

Structural similarity computation plays a crucial role in many applications such as in searching similar documents, in comparing chemical compounds, in finding genetic similarities, etc. We propose in this paper to use structural information content (SIC) for measuring structural information, considering both the nodes and edges of trees. We utilize a binary encoding approach for assigning the weights of different layer nodes and determining if some tree is a subtree of another tree. By defining a fast kernel and recursively computing SICs, we evaluate the structural information similarities of data trees to pattern trees. In the paper, we present the algorithm for calculating SICs with computation complexity of O(n), and use simple examples to instantiate the performance of the proposed method..

关键词： structural information content structural similarity structural pattern analysis web mining

来源：评论

学校读者我要写书评

暂无评论

3D reconstruction using particle swarm optimization

引用

Journal of computational Information Systems 2007年第2期3卷 541-547页

作者： Li, Wenhui Han, Dongfeng Key Laboratory of Symbol Computation and Knowledge Engineering College of Computer Science and Technology Jilin University Changchun 130012 China

A new 3D reconstruction algorithm based on particle swarm optimization (PSO) is proposed. This is the first time to introduce PSO to the multi-views problem. The proposed algorithm designs a scheme to represent the 3D parameters using a particle. Then the PSO algorithm is used to search the solution space and optimizes the fitness function. Finally, the algorithm can efficiently get the correct solution with less time and less complexity. Additionally, some details of implement are discussed which influence the performance of the algorithm. Experiments and comparisons are given in real data. The accuracy of the recovered solution is compared to the existing algorithms and outperformed them.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Temporal texture synthesis algorithm using genetic algorithm

引用

Journal of computational Information Systems 2006年第2期2卷 847-853页

作者： Meng, Yu Li, Wenhui Guo, Wu Wang, Yan Wang, Tianzhu Key Laboratory of Symbol Computation and Knowledge Engineering College of Computer Science and Technology Jilin University Changchun 130012 China

Texture synthesis is a very active research area in computer vision and graphics, and temporal texture synthesis is one subset of it. A new temporal texture synthesis algorithm is presented, in which genetic algorithm is introduced into the processes of synthesizing videos. In the algorithm, by analyzing and processing a finite source video clip, infinite video sequences that are played smoothly in vision can be obtained. Comparing with many existing temporal texture synthesis algorithms, this algorithm can get high-quality video results without complicated pre-processing of source video while it improves the efficiency of synthesis. This paper analyzes to determine the population size and the Max number of generations which influence the speed and quality of synthesis.

关键词： Computer vision

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithm with affinity propagation

Genetic algorithm with affinity propagation

引用

2010 IEEE International Conference on Information and Automation, ICIA 2010

作者： Wu, Chunguo Gao, Hao Yu, Lianjiang Liang, Yanchun Xiang, Rongwu College of Computer Science and Technology Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry Jilin University Changchun 130012 China School of Basic Courses Shenyang Pharmaceutical University Shenyang 110016 China

ISBN: (纸本)9781424457021

Classical genetic algorithm suffers heavy pressure of fitness evaluation for time-consuming optimization problems, e.g., aerodynamic design optimization, qualitative model learning in bioinformatics. To address this problem, we present a combination between genetic algorithms and clustering methods. Specifically, the clustering method used in this paper is affinity propagation. The numerical experiments demonstrate that the proposed method performs promisingly for well-known benchmark problems in the term of optimization accuracy. ©2010 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

An ontology-based schema matching on deep web

引用

Journal of computational Information Systems 2010年第4期6卷 1077-1084页

作者： Zhang, Aiqi Zuo, Wanli Wang, Ying Ji, Wenyan Peng, Tao Key Laboratory of Symbol Computation and Knowledge Engineering College of Computer Science and Technology Jilin University Changchun 130012 China

A large number of techniques have been implemented mostly based on abundance of data statistics and they usually do not harness the semantic relationships between attributes. This paper proposes a novel ontology-based schema matching approach. First, a core domain ontology has been built through analyzing pages from numerous domains. Then a two-step schema-matching process is presented to identify the correct matches between schema attributes and ontology information from the semantic perspective and this process can handle not only simple matches but also complex matches. Within the matching process, the ontology is real-time updated to make the subsequent matching processes easier. Finally, 100 interfaces about four different domains in the UIUC dataset are used for evaluating our approach and the experimental results show that it can improve the accuracy and the efficiency of schema matching among multiple interfaces. Copyright © 2010 Binary Information Press.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

SVM classifier-guided for domain-specific resource discovery based on HTML tag tree

引用

Journal of computational Information Systems 2007年第3期3卷 981-986页

作者： Peng, Tao Zuo, Wanli Zhang, Changli Wang, Dong Key Laboratory of Symbol Computation and Knowledge Engineering College of Computer Science and Technology Jilin University Changchun 130012 China

In designing a focused crawler, the choice of strategy for prioritizing unvisited URLs is vital. The text surrounding a link or the link context on the HMTL page is a good summary of the target page. This paper investigates some alternative methods and advocates that the link-context derived from reference page's HTML tag tree can provide a wealth of illumination for domain-specific web resource discovery guided by SVM classifier with uneven margins, which is particularly helpful for small training datasets. Little work has been done to utilize the beneficial link context information about the seed URLs. In order that crawler can acquire enough illumination from link-context, we initially look for some referring pages by traversing backward from seed URLs. The method collects this kind of resources beforehand and then uses it to steer resource discovery. A comprehensive experiment has been conducted using multiple crawls over 10 topics covering thousands of pages allowing us to derive statistically strong results.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Using improved particle swarm optimization to tune PID controllers in cooperative collision avoidance systems

引用

Frontiers of Information Technology & Electronic engineering 2017年第9期18卷 1385-1395页

作者： Xing-chen WU Gui-he QIN Ming-hui SUN He YU Qian-yi XU College of Computer Science and Technology Jilin University Changchun 130012 China MOE Key Laboratory of Symbol Computation and Knowledge Engineering Changchun 130012 China Department of Measurement and Controlling Engineering Changchun University Changchun 130012 China

The introduction ofproportional-integral-dorivative （PID） controllers into cooperative collision avoidance systems （CCASs） has been hindered by difficulties in their optimization and by a lack of study of their effects on vehicle driving stability, comfort, and fuel economy. In this paper, we propose a method to optimize PID controllers using an improved particle swarm optimization （PSO） algorithm, and to bettor manipulate cooperative collision avoidance with other vehicles. First, we use PRESCAN and MATLAB/Simulink to conduct a united simulation, which constructs a CCAS composed of a PID controller, maneuver strategy judging modules, and a path planning module. Then we apply the improved PSO algorithm to optimize the PID controller based on the dynamic vehicle data obtained. Finally, we perform a simulation test of performance before and after the optimization of the PID controller, in which vehicles equipped with a CCAS undertake deceleration driving and steering under the two states of low speed （≤50 km/h） and high speed （≥100 km/h） cruising. The results show that the PID controller optimized using the proposed method can achieve not only the basic functions of a CCAS, but also improvements in vehicle dynamic stability, riding comfort, and fuel economy.

关键词： Cooperative collision avoidance system （CCAS） Improved particle swarm optimization （PSO） PID controller Vehicle comfort Fuel economy

来源：评论

学校读者我要写书评

暂无评论

Checking linearizability with fine-grained traces 16

Checking linearizability with fine-grained traces

引用

31st Annual ACM Symposium on Applied Computing, SAC 2016

作者： Long, Zhenyue Zhang, Yu State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China Laboratory of Symbol Computation and Knowledge Zhuhai College Jilin University China Information Center Guangdong Power Grid Co. Ltd. China

ISBN: (纸本)9781450337397

Linearizability is an important correctness criterion for concurrent objects and automatic checking of linearizability often involves searching a sequential witness in an exponentially growing space of traces. We present two acceleration techniques for checking linearizability based on fine-grained traces: one is based on speculation of linearization points, and the other is to separate read-only methods from the enumeration of serial witnesses. We have applied them to checking linearizability of eight different algorithms and the experiment shows that both can offer significant speed-up, allowing us to explore further on error analysis of concurrent objects based on fine-grained traces. © 2016 ACM.

关键词： fine-grained trace automatic verification linearizability

来源：评论

学校读者我要写书评

暂无评论

Diagnosis of breast cancer tumor based on ICA and LS-SVM

Diagnosis of breast cancer tumor based on ICA and LS-SVM

引用

2006 International Conference on Machine Learning and Cybernetics

作者： Wang, Chao-Yong Wu, Chun-Guo Liang, Yan-Chun Guo, Xin-Chen Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China Department of Fundamental Sciences Jilin Teacher's Institute of Engineering and Technology Changchun 130021 China Key Laboratory of Information Science and Engineering Beijing Jiaotong University Railway Ministry Beijing 100044 China

ISBN: (纸本)1424400619

An efficient method for the diagnosis of breast cancer tumor is proposed based on Independent Component Analysis (ICA) and Least Square Support Vector Machine (LS-SVM). In order to save the expense of detection, firstly, variables are selected based on the theory of statistics. Then the ICA is introduced in a concise way and followed by extracting the ICA component from these selected variables. Finally the processed data are classified by the LS-SVM. Experimental and analytical results show that in the diagnosis of breast cancer tumor the proposed method is superior to the classical B-P algorithm. © 2006 IEEE.

关键词： Biomedical engineering

来源：评论

学校读者我要写书评

暂无评论

Extracting attributes from deep web interface using instances

Extracting attributes from deep web interface using instance...

引用

2009 WRI World Congress on Computer Science and Information engineering, CSIE 2009

作者： Hao, Liang Fei, Ren Wanli, Zuo Fengling, He Junhua, Wang College of Computer Science and Technology Jilin University Changchun 130012 China Department of Information Changchun Taxation College Changchun 130117 China Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun 130012 China

ISBN: (纸本)9780769535074

There is myriad high quality information in the Deep Web and the feasible method to access the Deep Web is through the query interface of the Deep Web. It's necessary to extract abundant attributes and semantic relation description from the query interface. Automatic extracting attributes from the query interface and automatically translating a query is a solvable way for addressing the current limitations in accessing Deep Web data sources. We design a framework to automatically extract the attributes and instances from the query interface using the WordNet as a kind of ontology technique to enrich the semantic description of the attributes. Each attribute is extended into a candidate attribute set in the form of a hierarchy tree. At the same time, the hierarchy tree generated by ontology describes the semantic relation of the attributes in the same query interface. We carry out our experiments in the real-world domain. The results of the experiments showed the validation of query translation framework. © 2008 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：