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

The Cellular Differential Evolution Based on Chaotic Local Search

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

作者： Ding, Qingfeng Zheng, Guoxin Shanghai Univ Key Lab Specialty Fiber Opt & Opt Access Networks Shanghai 200072 Peoples R China East China Jiaotong Univ Sch Elect & Elect Engn Nanchang 330013 Peoples R China

To avoid immature convergence and tune the selection pressure in the differential evolution (DE) algorithm, a new differential evolution algorithm based on cellular automata and chaotic local search (CLS) or ccDE is proposed. To balance the exploration and exploitation tradeoff of differential evolution, the interaction among individuals is limited in cellular neighbors instead of controlling parameters in the canonical DE. To improve the optimizing performance of DE, the CLS helps by exploring a large region to avoid immature convergence in the early evolutionary stage and exploiting a small region to refine the final solutions in the later evolutionary stage. What is more, to improve the convergence characteristics and maintain the population diversity, the binomial crossover operator in the canonical DE may be instead by the orthogonal crossover operator without crossover rate. The performance of ccDE is widely evaluated on a set of 14 bound constrained numerical optimization problems compared with the canonical DE and several DE variants. The simulation results show that ccDE has better performances in terms of convergence rate and solution accuracy than other optimizers.

关键词： CELL differentiation CHAOS theory STOCHASTIC convergence DIFFERENTIAL evolution (computer science) computer algorithms PERFORMANCE evaluation

来源：评论

学校读者我要写书评

暂无评论

Capturing Uncertainty Information and Categorical Characteristics for Network Payload Grouping in Protocol Reverse Engineering

引用

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

作者： Luo, Jian-Zhen Yu, Shun-Zheng Cai, Jun Sun Yat Sen Univ Sch Informat Sci & Technol Guangzhou 510275 Guangdong Peoples R China Guangdong Polytech Normal Univ Sch Elect & Informat Guangzhou 510665 Guangdong Peoples R China

As a promising tool to recover the specifications of unknown protocols, protocol reverse engineering has drawn more and more attention in research over the last decade. It is a critical task of protocol reverse engineering to extract the protocol keywords from network trace. Since the messages of different types have different sets of protocol keywords, it is an effective method to improve the accuracy of protocol keyword extraction by clustering the network payload of unknown traffic into clusters and analyzing each clusters to extract the protocol keywords. Although the classic algorithms such as K-means and EM can be used for network payload clustering, the quality of resultant traffic clusters was far from satisfactory when these algorithms are applied to cluster application layer traffic with categorical attributes. In this paper, we propose a novel method to improve the accuracy of protocol reverse engineering by applying a rough set-based technique for clustering the application layer traffic. This technique analyze multidimension uncertain information in multiple categorical attributes based on rough sets theory to cluster network payload, and apply the Minimum Description Length criteria to determine the optimal number of clusters. The experiments show that our method outperforms the existing algorithms and improves the results of protocol keyword extraction.

关键词： UNCERTAINTY (Information theory) REVERSE engineering TRAFFIC engineering ROUGH sets computer algorithms

来源：评论

学校读者我要写书评

暂无评论

Scheduling Method of Data-Intensive Applications in Cloud Computing Environments

引用

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

作者： Fu, Xiong Cang, Yeliang Zhu, Xinxin Deng, Song Nanjing Univ Posts & Telecommun Sch Comp Sci & Technol Nanjing 210023 Jiangsu Peoples R China Nanjing Univ Posts & Telecommun Inst Adv Technol Nanjing 210023 Jiangsu Peoples R China

The virtualization of cloud computing improves the utilization of resources and energy. And a cloud user can deploy his/her own applications and related data on a pay-as-you-go basis. The communications between an application and a data storage node, as well as within the application, have a great impact on the execution efficiency of the application. The locations of subtasks of an application and the data that transferred between the subtasks are the main reason why communication delay exists. The communication delay can affect the completion time of the application. In this paper, we take into account the data transmission time and communications between subtasks and propose a heuristic optimal virtual machine (VM) placement algorithm. Related simulations demonstrate that this algorithm can reduce the completion time of user tasks and ensure the feasibility and effectiveness of the overall network performance of applications when running in a cloud computing environment.

关键词： CLOUD computing computer scheduling VIRTUAL reality DATA transmission systems VIRTUAL machine systems computer algorithms

来源：评论

学校读者我要写书评

暂无评论

A New Hybrid Algorithm to Solve Winner Determination Problem in Multiunit Double Internet Auction

引用

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

作者： Ykhlef, Mourad Alqifari, Reem King Saud Univ Coll Comp & Informat Sci Dept Informat Syst Riyadh 11543 Saudi Arabia Coll Comp & Informat Sci Dept Informat Technol Riyadh 11543 Saudi Arabia

Solving winner determination problem in multiunit double auction has become an important E-business task. The main issue in double auction is to improve the reward in order to match the ideal prices and quantity and make the best profit for sellers and buyers according to their bids and predefined quantities. There are many algorithms introduced for solving winner in multiunit double auction. Conventional algorithms can find the optimal solution but they take a long time, particularly when they are applied to large dataset. Nowadays, some evolutionary algorithms, such as particle swarm optimization and genetic algorithm, were proposed and have been applied. In order to improve the speed of evolutionary algorithms convergence, we will propose a new kind of hybrid evolutionary algorithm that combines genetic algorithm (GA) with particle swarm optimization (PSO) to solve winner determination problem in multiunit double auction;we will refer to this algorithm as AUC-GAPSO.

关键词： computer algorithms PROBLEM solving INTERNET auctions ELECTRONIC commerce PARTICLE swarm optimization

来源：评论

学校读者我要写书评

暂无评论

Key Distribution and Changing Key Cryptosystem Based on Phase Retrieval Algorithm and RSA Public-Key Algorithm

引用

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

作者： Zhao, Tieyu Ran, Qiwen Yuan, Lin Chi, Yingying Ma, Jing Harbin Inst Technol Inst Opt Elect State Key Lab Tunable Laser Technol Res Harbin 150001 Peoples R China Zhejiang Normal Univ Coll Math Phys & Informat Engn Jinhua 321004 Peoples R China NE Normal Univ Sch Psychol Changchun 130024 Peoples R China

The optical image encryption has attracted more and more researchers' attention, and the various encryption schemes have been proposed. In existing optical cryptosystem, the phase functions or images are usually used as the encryption keys, and it is difficult that the traditional public-key algorithm (such as RSA, ECC, etc.) is used to complete large numerical key transfer. In this paper, we propose a key distribution scheme based on the phase retrieval algorithm and the RSA public-key algorithm, which solves the problem for the key distribution in optical image encryption system. Furthermore, we also propose a novel image encryption system based on the key distribution principle. In the system, the different keys can be used in every encryption process, which greatly improves the security of the system.

关键词： CRYPTOSYSTEMS INFORMATION retrieval algorithms computer algorithms PROBLEM solving

来源：评论

学校读者我要写书评

暂无评论

Impulsive-super-twisting control in reduced information environments

Impulsive-super-twisting control in reduced information envi...

引用

American Control Conference

作者： Fathi M. Aldukali Yuri B. Shtessel Alain Glumineau Franck Plestan Electrical and Computer Engineering Department The University of Alabama in Huntsville Hunsville 35899 USA LUNAM University Ecole Centrale de Nantes IRCCyN UMR CNRS 6597 France

ISBN: (纸本)9781467386838

The perturbed system with input-output dynamics of arbitrary and well defined relative degree is considered in a reduced information environment. The almost instantaneous convergence to the origin is achieved via impulsive control acting in a concert with continuous super-twisting controller. The impulsive actions are implemented in a piece-wise constant format. The efficacy of the proposed control algorithm is verified via simulations.

关键词： Reduced information environments Super-twisting sliding mode control Impulsive control computer algorithms Environments Impulsiveness Arbitrary systems input INPUT-OUTPUT Standing Orders simulating provenance

来源：评论

学校读者我要写书评

暂无评论

Stiffness rendering on soft tangible devices controlled through inverse FEM simulation

Stiffness rendering on soft tangible devices controlled thro...

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems

作者： Frederick Largilliere Eulalie Coevoet Mario Sanz-Lopez Laurent Grisoni Christian Duriez INRIA and University of Lille Computer Science and Control Laboratory (CRISTAL) joint with CNRS (UMR 9189) and Centrale Lille France

ISBN: (纸本)9781509037636

Haptic rendering of soft bodies is essential in medical simulations of procedures such as surgery or palpation. The most commonly used approach is to recreate the sense of touch using a specific design and control of a robotic arm. In this paper, we propose a new approach, based on soft-robotics technology. We create a tangible deformable device that allows users to "touch" soft tissues and perceive mechanical material properties, in a realistic manner. The device is able to dynamically provide user touch with different stiffness perceptions, thanks to actuators placed at the boundaries. We introduce a control algorithm, based on inverse Finite Element Analysis, which controls the actuators in order to recreate a desired stiffness that corresponds to the contact with soft tissues in the virtual environment. The approach uses antagonistic actuation principle to create a wide range of stiffness. We validate our algorithm and demonstrate the method using prototypes based on simple mechanisms.

关键词： stiffness soft parts Medical simulation actuators Touch computer algorithms Touch Perceptions Material properties Rendering Finite element method robotic arm Standing Orders Inverse

来源：评论

学校读者我要写书评

暂无评论

Weibo Information Propagation Dissemination Based on User Behavior Using ELM

引用

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

作者： Liu, Huilin Li, Yao Northeastern Univ Coll Informat Sci & Engn Shenyang 110819 Liaoning Peoples R China

Information dissemination prediction based on Weibo has been a hot topic in recent years. In order to study this, people always extract features and use machine learning algorithms to do the prediction. But there are some disadvantages. Aiming at these deficiencies, we proposed a new feature, the dependency between the Weibos involved in geographical locations and location of the user. We use ELM to predict behaviors of users. An information dissemination prediction model has also been proposed in this paper. Experimental results show that our proposed new feature is real and effective, and the model we proposed can accurately predict the scale of information dissemination. It also can be seen in the experimental results that the use of ELM significantly reduces the time, and it has a better performance than the traditional method based on SVM.

关键词： MACHINE learning PREDICTION theory computer algorithms GEOGRAPHICAL location codes

来源：评论

学校读者我要写书评

暂无评论

3D Visual SLAM Based on Multiple Iterative Closest Point

引用

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

作者： Li, Chunguang Tao, Chongben Liu, Guodong Jiangnan Univ Sch Internet Things Engn Wuxi 214122 Peoples R China Changzhou Inst Technol Sch Comp & Informat Engn Changzhou 213002 Peoples R China Suzhou Univ Sci & Technol Sch Elect & Informat Engn Suzhou 215009 Peoples R China

With the development of novel RGB-D visual sensors, data association has been a basic problem in 3D Visual Simultaneous Localization and Mapping (VSLAM). To solve the problem, a VSLAM algorithm based on Multiple Iterative Closest Point (MICP) is presented. By using both RGB and depth information obtained from RGB-D camera, 3D models of indoor environment can be reconstructed, which provide extensive knowledge for mobile robots to accomplish tasks such as VSLAM and Human-Robot Interaction. Due to the limited views of RGB-D camera, additional information about the camera pose is needed. In this paper, the motion of the RGB-D camera is estimated by a motion capture system after a calibration process. Based on the estimated pose, the MICP algorithm is used to improve the alignment. A Kinect mobile robot which is running Robot Operating System and the motion capture system has been used for experiments. Experiment results show that not only the proposed VSLAM algorithm achieved good accuracy and reliability, but also the 3D map can be generated in real time.

关键词： ITERATIVE methods (Mathematics) DATA analysis PROBLEM solving computer algorithms MAPPINGS (Mathematics)

来源：评论

学校读者我要写书评

暂无评论

A HYBRID ALGORITHM FOR OPTIMISING FACILITY LAYOUT

引用

SOUTH AFRICAN JOURNAL OF INDUSTRIAL ENGINEERING 2015年第1期26卷 120-134页

作者： Tasadduq, I. A. Imam, M. H. Ahmad, A. Umm Al Qura Univ Dept Comp Engn Mecca Saudi Arabia Umm Al Qura Univ Dept Civil Engn Mecca Saudi Arabia Univ Waterloo Syst Design Engn Waterloo ON N2L 3G1 Canada

Despite the reported effectiveness of analytical algorithms in facility layout planning, a detailed literature survey suggests a lack of new analytical methods in recent years. This paper focuses on open space facilities layout planning that involves modules with constant aspect ratios. We propose a construction-cum-improvement algorithm involving a novel combination of a boundary search-based heuristic placement and steepest descent-based analytical improvement. In the construction phase, the algorithm places a new module at the optimal location on the boundary of a previously constructed cluster of modules. In the improvement phase, the algorithm alternates between boundary search and steepest descent moves until it converges to a local optimum. Experiments with well-known test problems indicate that the proposed algorithm produced solutions superior both to published results and to those produced by VIP-PLANOPT, a popular, oft-cited and commercially available layout planning and optimisation software.

关键词： computer algorithms PLANT layout BUSINESS planning HEURISTIC algorithms computer software

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：