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

An improved fruit fly optimization algorithm for solving traveling salesman problem

Frontiers of Information Technology & Electronic engineering 2017年第10期18卷 1525-1533页

作者： Lan HUANG Gui-chao WANG Tian BAI Zhe WANG College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering (Jilin University) Ministry of Education Changchun 130012 China

The traveling salesman problem(TSP), a typical non-deterministic polynomial(NP) hard problem, has been used in many engineering applications. As a new swarm-intelligence optimization algorithm, the fruit fly optimization algorithm(FOA) is used to solve TSP, since it has the advantages of being easy to understand and having a simple implementation. However, it has problems, including a slow convergence rate for the algorithm, easily falling into the local optimum, and an insufficient optimization precision. To address TSP effectively, three improvements are proposed in this paper to improve FOA. First, the vision search process is reinforced in the foraging behavior of fruit flies to improve the convergence rate of FOA. Second, an elimination mechanism is added to FOA to increase the diversity. Third, a reverse operator and a multiplication operator are proposed. They are performed on the solution sequence in the fruit fly's smell search and vision search processes, respectively. In the experiment, 10 benchmarks selected from TSPLIB are tested. The results show that the improved FOA outperforms other alternatives in terms of the convergence rate and precision.

关键词： Traveling salesman problem Fruit fly optimization algorithm Elimination mechanism Vision search Operator

来源：评论

学校读者我要写书评

暂无评论

Simultaneous Prediction for Multiple key Performance Indicators in Semiconductor Wafer Fabrication

引用

Chinese Journal of Electronics 2016年第6期25卷 1159-1165页

作者： CAO Zhengcai LIU Xuelian HAO Jinghua LIU Min College of Information Science and Technology Beijing University of Chemical Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Department of Automation Tsinghua University

The prediction and key factors identification for lot Cycle time(CT) and Equipment utilization(EU) which remain the key performance indicators(KPI)are vital for multi-objective optimization in semiconductor manufacturing industry. This paper proposes a prediction methodology which predicts CT and EU simultaneously and identifies their key factors. Bayesian neural network(BNN) is used to establish the simultaneous prediction model for Multiple key performance indicators(MKPI),and Bayes theorem is key solution in model complexity controlling. The closed-loop structure is built to keep the stability of MKPI prediction model and the weight analysis method is the basis of identifying the key factors for CT and EU. Compared with Artificial neural network(ANN)and Selective naive Bayesian classifier(SNBC), the simulation results of the prediction method of BNN are proved to be more feasible and effective. The prediction accuracy of BNN has been obviously improved than ANN and SNBC.

关键词： Prediction for MKPI Cycle time Equipment utilization BNN key factors identification

来源：评论

学校读者我要写书评

暂无评论

A NEW CASCADING FAILURE MODEL WITH DELAY TIME IN CONGESTED COMPLEX NETWORKS

引用

Journal of Systems Science and Systems engineering 2009年第3期18卷 369-381页

作者： Jian WANG Yanheng LIU Yu JIAO College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

Cascading failures often occur in congested complex networks. Cascading failures can be expressed as a three-phase process： generation, diffusion, and dissipation of congestion. Different from the betweenness centrality, a congestion function is proposed to represent the extent of congestion on a given node. Inspired by the restart process of a node, we introduce the concept of ＂delay time,＂ during which the overloaded node Cannot receive or forward any traffic, so an intergradation between permanent removal and nonremoval is built and the flexibility of the presented model is demonstrated. Considering the connectivity of a network before and after cascading failures is not cracked because the overloaded node are not removed from network permanently in our model, a new evaluation function of network efficiency is also proposed to measure the damage caused by cascading failures. Finally, we investigate the effects of network structure and size, delay time, processing ability, and traffic generation speed on congestion propagation. Cascading processes composed of three phases and some factors affecting cascade propagation are uncovered as well.

关键词： Complex networks cascading failures congestion effects propagation model

来源：评论

学校读者我要写书评

暂无评论

Neural Explainable Recommender Model Based on Attributes and Reviews

引用

Journal of Computer Science & Technology 2020年第6期35卷 1446-1460页

作者： Yu-Yao Liu Bo Yang Hong-Bin Pei Jing Huang Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012China College of Computer Science and Technology Jilin UniversityChangchun 130012China

Explainable recommendation, which can provide reasonable explanations for recommendations, is increasingly important in many fields. Although traditional embedding-based models can learn many implicit features, resulting in good performance, they cannot provide the reason for their recommendations. Existing explainable recommender methods can be mainly divided into two types. The first type models highlight reviews written by users to provide an explanation. For the second type, attribute information is taken into consideration. These approaches only consider one aspect and do not make the best use of the existing information. In this paper, we propose a novel neural explainable recommender model based on attributes and reviews (NERAR) for recommendation that combines the processing of attribute features and review features. We employ a tree-based model to extract and learn attribute features from auxiliary information, and then we use a time-aware gated recurrent unit (T-GRU) to model user review features and process item review features based on a convolutional neural network (CNN). Extensive experiments on Amazon datasets demonstrate that our model outperforms the state-of-the-art recommendation models in accuracy of recommendations. The presented examples also show that our model can offer more reasonable explanations. Crowd-sourcing based evaluations are conducted to verify our model's superiority in explainability.

关键词： recommender system explainable recommendation review usefulness attribute usefulness

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Clustering Algorithm for Mining Communities in Signed Networks

引用

Journal of Computer Science & Technology 2007年第2期22卷 320-328页

作者：杨博刘大有 College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

Signed network is an important kind of complex network, which includes both positive relations and negative relations. Communities of a signed network are defined as the groups of vertices, within which positive relations are dense and between which negative relations are also dense. Being able to identify communities of signed networks is helpful for analysis of such networks. Hitherto many algorithms for detecting network communities have been developed. However, most of them are designed exclusively for the networks including only positive relations and are not suitable for signed networks. So the problem of mining communities of signed networks quickly and correctly has not been solved satisfactorily. In this paper, we propose a heuristic algorithm to address this issue. Compared with major existing methods, our approach has three distinct features. First, it is very fast with a roughly linear time with respect to network size. Second, it exhibits a good clustering capability and especially can work well with complex networks without well-defined community structures. Finally, it is insensitive to its built-in parameters and requires no prior knowledge.

关键词： complex network signed network community clustering graph theory

来源：评论

学校读者我要写书评

暂无评论

Modal extension rule

引用

Progress in Natural Science:Materials International 2005年第6期15卷 550-558页

作者： WU Xia*, SUN Jigui, LIN Hai and FENG Shasha(College of Computer Science and Technology, Jilin University, Changchun 130012, China key laboratory for symbolic computation and knowledge engineering, Jilin University, Changchun 130012, China) College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory for Symbolic Computation and Knowledge Engineering Jilin University Changchun 130012 China

Modal logics are good candidates for a formal theory of agents. The efficiency of reasoning method in modal logics is very important, because it determines whether or not the reasoning method can be widely used in systems based on agent. In this paper, we modify the extension rule theorem proving method we presented before, and then apply it to P-logic that is translated from modal logic by functional transformation. At last, we give the proof of its soundness and completeness.

关键词： theorem proving extension rule modal logics functional transformation.

来源：评论

学校读者我要写书评

暂无评论

NADARAYA-WATSON ESTIMATORS FOR REFLECTED STOCHASTIC PROCESSES

引用

Acta Mathematica Scientia 2024年第1期44卷 143-160页

作者：韩月才张丁文 School of Mathematics Jilin UniversityChangchun130012China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun130012China

We study the Nadaraya-Watson estimators for the drift function of two-sided reflected stochastic differential *** estimates,based on either the continuously observed process or the discretely observed process,are *** certain conditions,we prove the strong consistency and the asymptotic normality of the two *** method is also suitable for one-sided reflected stochastic differential *** results demonstrate that the performance of our estimator is superior to that of the estimator proposed by Cholaquidis et al.(Stat Sin,2021,31:29-51).Several real data sets of the currency exchange rate are used to illustrate our proposed methodology.

关键词： reflected stochastic differential equation discretely observed process continuously observed process Nadaraya-Watson estimator asymptotic behavior

来源：评论

学校读者我要写书评

暂无评论

Image registration based on pseudo-polar FFT and analytical fourier-mellin transform

Image registration based on pseudo-polar FFT and analytical ...

引用

International Conference on Intelligent Computing, ICIC 2005

作者： Guo, Xiaoxin Xu, Zhiwen Lu, Yinan Liu, Zhanhui Pang, Yunjie College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Qianjin Street 2699 Changchun 130012 China

ISBN: (纸本)9783540282266

This paper proposes a novel registration algorithm based on Pseudo-Polar Fast Fourier Transform (FFT) and Analytical Fourier-Mellin Transform (AFMT) for the alignment of images differing in translation, rotation angle, and uniform scale factor. The proposed algorithm employs the AFMT of the Fourier magnitude to determine all the geometric transformation parameters with its property of the invariance to translation and rotation. Besides, the proposed algorithm adopt a fast high accuracy conversion from Cartesian to polar coordinates based on the pseudo-polar FFT and the conversion from the pseudo-polar to the polar grid, which involves only ID interpolations, and obtain a more significant improvement in accuracy than the conventional method using cross-correlation. Experiments show that the algorithm is accurate and robust regardless of white noise. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Image processing

来源：评论

学校读者我要写书评

暂无评论

A randomized diversification strategy for solving satisfiability problem with long clauses

引用

Science China(Information Sciences) 2017年第9期60卷 121-131页

作者： Jian GAO Ruizhi LI Minghao YIN College of Computer Science Northeast Normal University College of Information Science and Technology Dalian Maritime University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University

Satisfiability problem(SAT) is a central problem in artificial intelligence due to its computational complexity and usefulness in industrial applications. Stochastic local search(SLS) algorithms are powerful to solve hard instances of satisfiability problems, among which CScore SAT is proposed for solving SAT instances with long clauses by using greedy mode and diversification mode. In this paper, we present a randomized variable selection strategy to improve efficiency of the diversification mode, and thus propose a new SLS *** perform a number of experiments to evaluate the new algorithm comparing with the recently proposed algorithms, and show that our algorithm is comparative with others for solving random instances near the phase transition threshold.

关键词： SAT local search randomized diversification strategy phase transition long clause

来源：评论

学校读者我要写书评

暂无评论

Efficient Image Transmission Schemes over Zigbee-Based Image Sensor Networks

引用

Chinese Journal of Electronics 2016年第2期25卷 284-289页

作者： TAO Dan YANG Guangwei CHEN Houjin WU Hao LIU Pingping School of Electronic and Information Engineering Beijing Jiaotong University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University College of Computer Science and Technology Jilin University

Image transmission is one of the biggest challenges in wireless sensor networks because of the limited resource on sensor nodes. We proposed two image transmission schemes driven by reliability and real time considerations in order to transfer JPEG images over Zigbee-based sensor networks. By adding two bytes counter in the header of data packet, we can easily solve the repeated data reception problem caused by retransmission mechanism in traditional Zigbees network layer. We proposed an efficient retransmission and acknowledgment mechanism in Zigbees application layer. By classifying different data reception response events, we can provide data packets with differential responses and ensure that image packets can be transferred quickly even with large maximum number of retransmission. Practical results show the effectiveness of our solutions to make image transmission over Zigbee-based sensor networks efficient.

关键词： Image sensor networks Image transmission Retransmission and acknowledgment mechanism Zigbee

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：