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

A Hybrid Recommender System Based on User-Recommender Interaction

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-11页

作者： Zhang, Heng-Ru Min, Fan He, Xu Xu, Yuan-Yuan Southwest Petr Univ Sch Comp Sci Chengdu 610500 Peoples R China Minnan Normal Univ Lab Granular Comp Zhangzhou 363000 Peoples R China

Recommender systems are used to make recommendations about products, information, or services for users. Most existing recommender systems implicitly assume one particular type of user behavior. However, they seldom consider user-recommender interactive scenarios in real-world environments. In this paper, we propose a hybrid recommender system based on user-recommender interaction and evaluate its performance with recall and diversity metrics. First, we define the user-recommender interaction. The recommender system accepts user request, recommends N items to the user, and records user choice. If some of these items favor the user, she will select one to browse and continue to use recommender system, until none of the recommended items favors her. Second, we propose a hybrid recommender system combining random and k-nearest neighbor algorithms. Third, we redefine the recall and diversity metrics based on the new scenario to evaluate the recommender system. Experiments results on the well-known MovieLens dataset show that the hybrid algorithm is more effective than nonhybrid ones.

关键词： RECOMMENDER systems (Information filtering) INFORMATION filtering systems computer algorithms computer users INFORMATION technology

来源：评论

学校读者我要写书评

暂无评论

Optimal Ascent Guidance for Air-Breathing Launch Vehicle Based on Optimal Trajectory Correction

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2013年第1期2013卷 1-11页

作者： Lu, Xuefang Wang, Yongji Liu, Lei Huazhong Univ Sci & Technol Sch Automat Key Lab Minist Educ Image Proc & Intelligent Cont Wuhan 430074 Peoples R China

An optimal guidance algorithm for air-breathing launch vehicle is proposed based on optimal trajectory correction. The optimal trajectory correction problem is a nonlinear optimal feedback control problem with state inequality constraints which results in a nonlinear and nondifferentiable two-point boundary value problem (TPBVP). It is difficult to solve TPBVP on-board. To reduce the on-board calculation cost, the proposed guidance algorithm corrects the reference trajectory in every guidance cycle to satisfy the optimality condition of the optimal feedback control problem. By linearizing the optimality condition, the linear TPBVP is obtained for the optimal trajectory correction. The solution of the linear TPBVP is obtained by solving linear equations through the Simpson rule. Considering the solution of the linear TPBVP as the searching direction for the correction values, the updating step size is generated by linear search. Smooth approximation is applied to the inequality constraints for the nondifferentiable Hamiltonian. The sufficient condition for the global convergence of the algorithm is given in this paper. Finally, simulation results show the effectiveness of the proposed algorithm.

关键词： AIRBREATHING launch vehicles computer algorithms FEEDBACK control systems OPTIMAL control theory BOUNDARY value problems HAMILTONIAN systems

来源：评论

学校读者我要写书评

暂无评论

An Optimization Algorithm with Novel RFA-PSO Cooperative Evolution: Applications to Parameter Decision of a Snake Robot

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-12页

作者： Gao, Qin Wang, Zhelong Li, Hongyi Dalian Univ Technol Sch Control Sci & Engn Dalian 116024 Peoples R China Chinese Acad Sci Shenyang Inst Automat State Key Lab Robot Shenyang 110000 Peoples R China

The success to design a hybrid optimization algorithm depends on how to make full use of the effect of exploration and exploitation carried by agents. To improve the exploration and exploitation property of the agents, we present a hybrid optimization algorithm with both local and global search capabilities by combining the global search property of rain forest algorithm (RFA) and the rapid convergence of PSO. Originally two kinds of agents, RFAAs and PSOAs, are introduced to carry out exploration and exploitation, respectively. In order to improve population diversification, uniform distribution and adaptive range division are carried out by RFAAs in flexible scale during the iteration. A further improvement has been provided to enhance the convergence rate and processing speed by combining PSO algorithm with potential guides found by both RFAAs and PSOAs. Since several contingent local minima conditions may happen to PSO, special agent transformation is suggested to provide information exchanging and cooperative coevolution between RFAAs and PSOAs. Effectiveness and efficiency of the proposed algorithm are compared with several algorithms in the various benchmark function problems. Finally, engineering design optimization problems taken from the gait control of a snake-like robot are implemented successfully by the proposed RFA-PSO.

关键词： computer algorithms PROCESS optimization PARAMETER estimation DECISION making APPLICATION software

来源：评论

学校读者我要写书评

暂无评论

List-Based Simulated Annealing Algorithm for Traveling Salesman Problem

引用

COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE 2016年第1期2016卷 1-13页

作者： Zhan, Shi-hua Lin, Juan Zhang, Ze-jun Zhong, Yi-wen Fujian Agr & Forestry Univ Coll Comp & Informat Sci Fuzhou 350002 Peoples R China Fujian Agr & Forestry Univ Ctr Modern Educ Technol & Informat Management Fuzhou 350002 Peoples R China

Simulated annealing (SA) algorithm is a popular intelligent optimization algorithm which has been successfully applied in many fields. Parameters' setting is a key factor for its performance, but it is also a tedious work. To simplify parameters setting, we present a list-based simulated annealing (LBSA) algorithm to solve traveling salesman problem (TSP). LBSA algorithm uses a novel list-based cooling schedule to control the decrease of temperature. Specifically, a list of temperatures is created first, and then the maximum temperature in list is used by Metropolis acceptance criterion to decide whether to accept a candidate solution. The temperature list is adapted iteratively according to the topology of the solution space of the problem. The effectiveness and the parameter sensitivity of the list-based cooling schedule are illustrated through benchmark TSP problems. The LBSA algorithm, whose performance is robust on a wide range of parameter values, shows competitive performance compared with some other state-of-the-art algorithms.

关键词： SIMULATED annealing (Mathematics) computer algorithms TRAVELING salesman problem (Mathematics) PARAMETERS (Statistics) PERFORMANCE evaluation

来源：评论

学校读者我要写书评

暂无评论

Subjective Evaluation: A Comparison of Several Statistical Techniques

引用

APPLIED ARTIFICIAL INTELLIGENCE 2018年第1期32卷 85-95页

作者： Mittal, Himani Devi, M. Syamala Panjab Univ Dept Comp Sci & Applicat Chandigarh India

Evaluation of subjective examinations using computerized tools has been a topic of research for more than four decades. Several statistical and mathematical techniques have been proposed by various researchers. In this research work, the several methods proposed earlier like Latent Semantic Analysis (LSA), Generalized Latent Semantic Analysis (GLSA), Bilingual Evaluation Understudy (BLEU), and Maximum Entropy (MaxEnt) are compared on common input data. The techniques are implemented using Java programming language, MatLab, and other open source tools. Experiments have been conducted and developed prototypes are tested using a database of 4500 answers with approximately 50 questions of computer science. Comparison of these techniques on a common database is not available in the literature as far as the authors' review is concerned. The database used for testing is collected by conducting tests of students of graduate level in the field of computer science. The pros and cons of each technique on the basis of experiments are discussed in the paper.

关键词： SEMANTICS MAXIMUM entropy method JAVA (computer program language) PARTICLE swarm optimization computer algorithms

来源：评论

学校读者我要写书评

暂无评论

Seismic control of civil structures utilizing semi-active MR braces

引用

computer-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING 2003年第1期18卷 31-44页

作者： Hiemenz, GJ Choi, YT Wereley, NM Univ Maryland Dept Aerosp Engn Smart Struct Lab College Pk MD 20742 USA

This paper presents the feasibility and effectiveness of magnetorheological (MR) braces in earthquake hazard mitigation. In doing so, a nondimensional variable, beta, which is the ratio of the yield force of the MR damper to forcing input (the product of a characteristic mass of the building and the seismic acceleration) is used to design the MR damper preventing the locked damper motion that may worsen seismic response of the building. Front this theoretical analysis, the activation gap of the damper as an important design parameter to prevent the locked damper motion is chosen. Based on this analysis, the MR damper is fabricated by modifying the commercial MR damper of Lord Corporation, SD-1000-1. Then, a three-story building with MR braces is constructed and its dynamic equation is theoretically derived. In order to investigate semi-active control methods to MR braces, three different control algorithms are formulated and evaluated both numerically and experimentally. The results show that control of the building with semi-actively controlled MR braces is very effective.

关键词： dynamic equation Braces DAMPER design parameter Buildings computer algorithms

来源：评论

学校读者我要写书评

暂无评论

Real-Time Multifault Rush Repairing Strategy Based on Utility Theory and Multiagent System in Distribution Networks

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2016年第1期2016卷 1-12页

作者： Zhao Hao Zhang Jing Lu Zhi-gang Yang Li-jun Cheng Hui-lin Yanshan Univ Key Lab Power Elect Energy Conservat & Motor Driv Qinhuangdao Shi 066004 Hebei Peoples R China State Grid Jinzhou Cty Elect Power Supply Co Jinzhou 052200 Hebei Peoples R China State Grid Shijiazhuang Power Supply Co Shijiazhuang 050000 Hebei Peoples R China

The problem of multifault rush repair in distribution networks (DNs) is a multiobjective dynamic combinatorial problem with topology constraints. The problem consists of archiving an optimal faults' allocation strategy to squads and an admissible multifault rush repairing strategy with coordinating switch operations. In this article, the utility theory is introduced to solve the first problem and a new discrete bacterial colony chemotaxis (DBCC) algorithm is proposed for the second problem to determine the optimal sequence for each squad to repair faults and the corresponding switch operations. The above solution is called the two-stage approach. Additionally, a double mathematical optimization model based on the fault level is proposed in the second stage to minimize the outage loss and total repairing time. The real-time adjustment multiagent system (RA-MAS) is proposed to provide facility to achieve online multifault rush repairing strategy in DNs when there are emergencies after natural disasters. The two-stage approach is illustrated with an example from a real urban distribution network and the simulation results show the effectiveness of the two-stage approach.

关键词： MULTIAGENT systems REAL-time computing UTILITY theory computer algorithms MATHEMATICAL optimization

来源：评论

学校读者我要写书评

暂无评论

DYNAMIC DISPLAY OF PERSONALIZED SOFTWARE FUNCTIONS

引用

APPLIED ARTIFICIAL INTELLIGENCE 2012年第5期26卷 466-502页

作者： Mohapatra, Prateeti Michel, Howard Univ Chicago Flash Ctr Computat Sci Chicago IL 60637 USA Univ Massachusetts Dartmouth MA USA

Generalized software packages endowed with a large spectrum of functionalities are often underutilized because users are not always aware of all the functionalities. It is hence desirable to display personalized information about the package. Though popular in web-based applications, personalization as a field of research in the design of generalized software packages is rare. This article develops a semi-Markov model of user navigation and an adaptive dynamic programming formulation to select high-utility software functions (states) for dynamically displaying them to a user. The personalization algorithm considers the interests of the software designers, the past users, and the current user. Frequency of visit to a state and the holding time in the state together determines the utility of the state. The personalization algorithm considers the interests of the software designers, the past users, and the current user. The algorithm is built in a demo package of ActiveX Servers and Controls. Graduate students tested the package. Pareto analysis and tests of hypothesis conducted on the test results indicate that the users did utilize the information on the displayed personalized software functions.

关键词： computer software computer algorithms MARKOV processes PARETO analysis DYNAMIC programming GENERALIZATION SPECTRUM analysis

来源：评论

学校读者我要写书评

暂无评论

Convergence analysis of discrete-time consensus algorithm with both self and transmission delays

引用

JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS 2016年第11期353卷 2467-2481页

作者： Chen, Yao Li, Fangfei Hou, Bo Tan, Shaolin Zhu, Henghui Hong Kong Polytech Univ Dept Comp Kowloon Hong Kong Peoples R China SUNY Stony Brook Dept Appl Math & Stat Stony Brook NY 11794 USA Tsinghua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China Hunan Univ Coll Elect & Informat Engn Changsha 410082 Hunan Peoples R China Boston Univ Div Syst Engn Boston MA 02215 USA

Multi-agent systems (MAS) are ubiquitous in the real world, typical examples include sensor networks, group robots, and birds flock. Consensus is one of the most typical dynamical behaviors of MAS which implies the states of a group reach some identical value or trajectory asymptotically. It has been widely demonstrated that discrete-time MAS can realize consensus when there does not exist information delay from any node to itself, however, the phenomenon of self delay is possible to occur in cases like sensor aging, actuator delay, or computation incapacity. To characterize such a behavior, this paper introduces an MAS model with dynamically changing topologies by considering both self and transmission delays. Moreover, a simple consensus criterion for such a model is proposed. To prove the correctness of such a criterion, we propose a novel method which is based on the intrinsic relationship between joint and sequential connectivity, it should be noted that such a method does not rely on the widely used Wolfowitz's theorem for convergence of infinite products of stochastic matrices. (C) 2016 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.

关键词： STOCHASTIC convergence DISCRETE-time systems computer algorithms MULTIAGENT systems SENSOR networks

来源：评论

学校读者我要写书评

暂无评论

algorithms for monitoring real-time properties

引用

ACTA INFORMATICA 2018年第4期55卷 309-338页

作者： Basin, David Klaedtke, Felix Zalinescu, Eugen Swiss Fed Inst Technol Inst Informat Secur Dept Comp Sci Zurich Switzerland NEC Europe Ltd Heidelberg Germany Tech Univ Munich Inst Informat Munich Germany

Real-time logics are popular specification languages for reasoning about systems intended to meet timing constraints. Numerous formalisms have been proposed with different underlying time models that can be characterized along two dimensions: dense versus discrete time and point-based versus interval-based. We present monitoring algorithms for the past-only fragment of metric temporal logics that differ along these two dimensions, analyze their complexity, and compare them on a class of formulas for which the point-based and the interval-based settings coincide. Our comparison reveals similarities and differences between the monitoring algorithms and highlights key concepts underlying our and prior monitoring algorithms. For example, point-based algorithms are conceptually simpler and more efficient than interval-based ones as they are invoked only at time points occurring in the monitored trace and their reasoning is limited to just those time points.

关键词： computer algorithms REAL-time computing REASONING (Logic) DISCRETE-time systems METRIC system

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：