检索结果-南通市图书馆

Distrust Prediction in Signed Social Network

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2019年第1期28卷 188-194页

作者： SHEN Pengfei liu shufen HAN Lu College of Computer Science and Technology Jilin University

In social networks, the most studies focus on the trust prediction, but distrust cannot get enough attention. The distinct characteristics of distrust relations present challenges to traditional relation *** relations are very sparse in social network,and negative interaction data is too little. We embark on the problem to investigate the distrust prediction with only network topology. After achieving seven social distrusting-inducing factors, we adopt machine learning and optimization methods to model the prediction *** framework of Distrust prediction in Signed social network(DP-SSN) is proposed, which can predict distrust relations without any interaction data. Empirically, we perform extensive experiments on real-world data to corroborate the effectiveness of the proposed framework.

关键词： Signed network Machine learning Data mining Social networks

An Effective Biogeography-Based Optimization Algorithm for Flow Shop Scheduling with Intermediate Buffers

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2018年第6期27卷 1141-1150页

作者： liu shufen WANG Pengfei YAO Zhilin College of Computer Science and Technology Jilin University

This paper proposes an Effective biogeography-based optimization(EBBO) algorithm for solving the flow shop scheduling problem with intermediate buffers to minimize the Total flow time(TFT). Discrete job permutations are used to represent individuals in the EBBO so the discrete problem can be solved directly. The NEH heuristic and NEH-WPT heuristic are used for population initialization to guarantee the diversity of the solution. Migration and mutation rates are improved to accelerate the search process. An improved migration operation using a two-points method and mutation operation using inverse rules are developed to prevent illegal solutions. A new local search algorithm is proposed for embedding into the EBBO algorithm to enhance local search *** simulations and comparisons demonstrated the superiority of the proposed EBBO algorithm in solving the flow shop scheduling problem with intermediate buffers with the TFT criterion.

关键词： Flow shop scheduling Intermediate buffer Total flow time(TFT) Biogeography-based optimization algorithm Local search algorithm

A Matching Algorithm Based on Association Rules in Ontology Based Publish/Subscribe System

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2015年第1期24卷 65-70页

作者： liu shufen CHI Meng YAO Zhilin College of Computer Science and Technology Jilin University

In this paper, we introduce association rules into the event matching process, and propose a matching algorithm based on association rules in ontologybased publish/subscribe system. The algorithm discovers association rules from subscriptions, and then integrates these association rules into the arrived events. These integrated association rules guide the event matching process,which can greatly improve efficiency by reducing unnecessary matching processes. To solve the available problem of integrating the association rules into the ontology-based publish/subscribe system, we also show an approach of transforming the subscriptions into a format that can apply the data mining algorithm and an approach of integrating the association rule into the events. The results show that the algorithm achieves performance improvement of matching efficiency by using comparison.

关键词： Association rules Ontology matching Publish/subscribe system.

A Hybrid Approach to Maximize Lifetime in Connected Directional Sensor Networks with Adjustable Sensing Ranges

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2018年第1期27卷 159-167页

作者： liu shufen GAO Sihua HAN Lu College of Computer Science and Technology Jilin University

A directional sensor network consists of numerous small sensor nodes that have limited battery power and operate within a restricted sensing range angle. Coverage and connectivity, as two important issues,are widely studied in directional sensor networks. Different from conventional directional sensor nodes in previous studies, those in the present study could adjust their sensing ranges within a range of several values. This paper addresses the Connected adjusted-ranges directional cover(CARDC) problem. The purpose is to organize the directional sensor nodes into a group of connected covers, and assign activities to them, thereby maximizing the network lifetime. We propose a hybrid approach that combines column generation with a genetic algorithm to solve the CARDC problem. The genetic algorithm is utilized to settle the auxiliary problem of column generation, which has the ability to efficiently provide attractive columns for the master problem. Compared with pure integer linear programming formulations, the proposed genetic algorithm significantly improves the speed of column generation method, especially in large-scale networks. The effect variety of number of directions, number of power levels,and communication range on the network lifetime are also investigated.

关键词： Directional sensor networks(DSNs) Coverage and connectivity Column generation Genetic algorithm

An Optimized Supply Chain Network Model Based on Modified Genetic Algorithm

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2017年第3期26卷 468-476页

作者： ZHANG Yikun liu shufen ZHANG Xinjia College of Computer Science and Technology Jilin University

For complex multi-source,multi-product,multi-stage Supply chain network(SCN)design problem,we propose an optimization supply chain network *** consider cash conversion cycle as an objective to this model and utilize a modified genetic algorithm to solve the *** describe the structure of supply chain network,we propose a new encoding method and a genetic algorithm with modified genetic *** use the Pareto approach to obtain the set of Pareto-optimal *** order to evaluate the performance of the modified genetic algorithm and validate the model,we conduct comparisons with standard genetic algorithm and the simulated annealing genetic *** results show that the modified genetic algorithm achieved better CPU time and the accuracy of the Pareto-optimal solutions than the alternative algorithms and the model was effective.

关键词： Supply chain network(SCN) Genetic algorithm Multi-objective optimization Cash conversion cycle

An Improved Biogeography-Based Optimization Algorithm for Blocking Flow Shop Scheduling Problem

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2018年第2期27卷 351-358页

作者： liu shufen WANG Pengfei ZHANG Jiachen College of Computer Science and Technology Jilin University

To solve the blocking flow shop scheduling with maximum completion time(i.e. makespan) criterion,we proposed an Improved biogeography-based optimization algorithm(IBBO). The framework of basic BBO algorithm is used in the IBBO algorithm, and the introduction of the NEH algorithm make IBBO algorithm with certain quality and diversity. The migration operation based on the insert rules and the mutation operation based on swap rules are presented to avoid the occurrence of illegal solution of the blocking flow shop problem. An insertneighborhood search algorithm was used to strengthen the local search ability of the IBBO. The computational results show the effectiveness of the proposed IBBO algorithm in solving the blocking flow shop scheduling with maximum completion time criterion.

关键词： Blocking flow shop Biogeography-based optimization Makespan Insert-neighborhood search algorithm

Pheromone Model Selection in Ant Colony Optimization for the Travelling Salesman Problem

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2017年第2期26卷 223-229页

作者： liu shufen LENG Huang HAN Lu College of Computer Science and Technology Jilin University

As a meta-heuristic approach,Ant colony optimization(ACO) has many *** the algorithm selection of pheromone models is the top *** pheromone models that don’t suffer negative biases is a natural *** for the travelling salesman problem,the first order pheromone is widely *** come across travelling salesman problem,we study the reasons for the success of ant colony optimization from the perspective of pheromone models,and unify different order pheromone *** tests,we have introduced the concept of sample locations and the similarity coefficient to pheromone *** first order pheromone model and the second order pheromone model are compared and are further *** illustrate that the second order pheromone model has better global search ability and diversity of population than the *** appropriate-scale travelling salesman problems,the second order model performs better than the first order pheromone model.

关键词： Ant colony optimization(ACO) Pheromone model selection The travelling salesman problem

Self-adaptive Processing and Forecasting Algorithm for Univariate Linear Time Series

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2017年第6期26卷 1147-1153页

作者： liu shufen GU Songyuan PENG Jun College of Computer Science and Technology Jilin University

As the Box-Jenkins method could not grasp the non-stationary characteristics of time series exactly, nor identify the optimal forecasting model order quickly and precisely, a self-adaptive processing and forecasting algorithm for univariate linear time series is proposed. A self-adaptive series characteristic test framework which employs varieties of statistic tests is constructed to solve the problem of inaccurate identification and inadequate processing for non-stationary characteristics of time series. To achieve favorable forecasts, an optimal forecasting model building algorithm combined with model filter and candidate model pool is proposed, in which a univariate linear time series forecasting model is built. Experimental data demonstrates that the proposed algorithm outperforms the comparative method in all forecasting performance statistics.

关键词： Time series Self-adaptivity Unit root Autoregressive moving average(ARMA)

Quantitative Verification of Knowledge Precondition for Open System

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2016年第2期25卷 227-233页

作者： XU Weifeng liu shufen WANG Xiaoyan College of Computer Science and Technology Jilin University

A quantitative verification method is proposed to quantitatively verify knowledge precondition of actions and plans. Probability epistemic game structure(PEGS) is proposed to model knowledge preconditions in open systems, an extension of concurrent game structure with probabilistic transition. We introduce a probability operator P-λinto Alternating temporal epistemic logic(ATEL) and define a Probability alternating-time temporal epistemic logic(PATEL) for quantitatively model checking the properties of PEGS. We designed an algorithm to compute the probability aiming at model checking verification problems of PATEL based on DTMC and *** convert a portion of the PATEL verification problems into PATL problems by defining the knowledge formulas Ka φ, EA sφ and CA sφ as atomic propositions. We study a train controller using PRISM-games to demonstrate the applicability of above quantitative verification method.

关键词： Quantitative verification Knowledge precondition Alternating-time temporal logic(ATL) Open system