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

Osiris: A Malware Behavior Capturing System Implemented at Virtual Machine Monitor Layer

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

作者： Cao, Ying Miao, Qiguang Liu, Jiachen Li, Weisheng Xidian Univ Sch Comp Sci & Technol Xian 710071 Shaanxi Peoples R China Chongqing Univ Posts & Telecommun Coll Comp Sci & Technol Chongqing Peoples R China

To perform behavior based malware analysis, behavior capturing is an important prerequisite. In this paper, we present Osiris system which is a tool to capture behaviors of executable files in Windows system. It collects API calls invoked not only by main process of the analysis file, but also API calls invoked by child processes which are created by main process, injected processes if process injection happens, and service processes if the main process creates services. By modifying the source code of Qemu, Osiris is implemented at the virtual machine monitor layer and has the following advantages. First, it does not rewrite the binary code of analysis file or interfere with its normal execution, so that behavior data are obtained more stealthily and transparently. Second, it employs a multi-virtual machine framework to simulate the network environment for malware analysis, so that network behaviors of a malware are stimulated to a large extend. Third, besides network environment, it also simulates most common host events to stimulate potential malicious behaviors of a malware. The experimental results show that Osiris automates the malware analysis process and provides good behavior data for the following detection algorithm.

关键词： OSIRIS (Electronic computer system) MALWARE (computer software) VIRTUAL machine systems computer algorithms CHILD psychology

来源：评论

学校读者我要写书评

暂无评论

Setting up alternating least squares and iterative majorization algorithms for solving various matrix optimization problems

引用

COMPUTATIONAL STATISTICS & DATA ANALYSIS 2002年第1期41卷 157-170页

作者： Kiers, HAL Univ Groningen Heymans Inst DPMG NL-9712 TS Groningen Netherlands

A general procedure is described for setting up monotonically convergent algorithms to solve some general matrix optimization problems, if desired, subject to a wide variety of constraints. An overview is given of a number of ready-made building blocks (derived in earlier publications) from which concrete algorithms are set-up with little effort. These algorithms are based on alternating least squares (block relaxation) and iterative majorization. It is demonstrated how the construction of an algorithm for a particular problem that falls in one of the classes of optimization problems under study, reduces to a simple combination of tools. Also, a procedure is reviewed for setting up a weighted least squares algorithm for any problem for which an unweighted least squares solution is available. All procedures are illustrated by means of examples. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： LEAST squares computer algorithms MATHEMATICAL optimization

来源：评论

学校读者我要写书评

暂无评论

A survey of local search methods for graph coloring

引用

computerS & OPERATIONS RESEARCH 2006年第9期33卷 2547-2562页

作者： Galinier, P Hertz, A Ecole Polytech CRT Montreal PQ H3T 2A7 Canada Ecole Polytech Gerad Montreal PQ H3T 2A7 Canada

Tabucol is a tabu search algorithm that tries to determine whether the vertices of a given graph can be colored with a fixed number k of colors such that no edge has both endpoints with the same color. This algorithm was proposed in 1987, one year after Fred Glover's article that launched tabu search. While more performing local search algorithms have now been proposed, Tabucol remains very popular and is often chosen as a subroutine in hybrid algorithms that combine a local search with a population based method. In order to explain this unfailing success, we make a thorough survey of local search techniques for graph coloring problems, and we point out the main differences between all these techniques. (c) 2005 Elsevier Ltd. All rights reserved.

关键词： computer algorithms algorithms computer science computer programming

来源：评论

学校读者我要写书评

暂无评论

Communication-computation tradeoff in distributed consensus optimization for MPC-based coordinated control under wireless communications

引用

JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS 2017年第9期354卷 3654-3677页

作者： Gautam, Ajay Veluvolu, Kalyana C. Soh, Yeng Chai Korea Univ Technol & Educ Sch Elect Elect & Commun Engn Cheonan Si Chungnam South Korea Kyungpook Natl Univ Sch Elect Engn Daegu South Korea Nanyang Technol Univ Sch Elect & Elect Engn 50 Nanyang Ave Singapore Singapore

This paper presents an analysis of the tradeoff between repeated communications and computations for a fast distributed computation of global decision variables in a model-predictive-control (MPC)-based coordinated control scheme. We consider a coordinated predictive control problem involving uncertain and constrained subsystem dynamics and employ a formulation that presents it as a distributed optimization problem with sets of local and global decision variables where the global variables are allowed to be optimized over a longer time interval. Considering a modified form of the dual-averaging -based distributed optimization scheme, we explore convergence bounds under ideal and non-ideal wireless communications and determine the optimal choice of communication cycles between computation steps in order to speed up the convergence per unit time of the algorithm. We apply the algorithm for a class of dynamic-policy based stochastic coordinated control problems and illustrate the results with a simulation example. (C) 2017 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.

关键词： WIRELESS communication systems MATHEMATICAL optimization PREDICTIVE control computer algorithms PROBLEM solving

来源：评论

学校读者我要写书评

暂无评论

Terrestrial photogrammetry of weather images acquired in uncontrolled circumstances

引用

JOURNAL OF ATMOSPHERIC AND OCEANIC TECHNOLOGY 2003年第12期20卷 1790-1803页

作者： Rasmussen, EN Davies-Jones, R Holle, RL Cooperat Inst Mesoscale Meteorol Studies Norman OK USA NOAA Natl Severe Storms Lab Norman OK 73069 USA

This paper describes an accurate automated technique of terrestrial photogrammetry that is applied to weather images obtained in uncontrolled circumstances such as unknown focal length and 3D camera orientation ( azimuth and tilt of the optical axis, and roll about this axis), principal point unmarked on the image, and undetermined lens horizon. With the possible exception of the principal point, these quantities are deduced rapidly by a computer algorithm, with input consisting of accurate azimuth and elevation angles of landmarks that appear in the image. The algorithm works for wide-angle as well as for telephoto images and is more accurate than previous methods, which are based on assumptions of small angles and zero roll. Results are insensitive to the exact position of the principal point for telephoto images. For wide-angle photography, the principal point can be determined only if there is a sufficient number of accurately measured landmarks with diverse azimuth and elevation angles. If all the landmarks have low elevation angles, the principal point is impossible to determine and must be assumed to lie at the intersection of the diagonals of the uncropped image. The algorithm also provides the azimuth and elevation angle of any object, given the position of its image in the photograph. A photogrammetric search technique is described for finding an entity, which is visible in one camera's photography, in the simultaneous image obtained from a different direction by a second camera. Once the same object has been identified in both images, its 3D position is determined by triangulation.

关键词： ground photogrammetry Optic axis Angle azimuth terrestrial photogrammetry Image computer algorithms triangulation landmarks search technique Angle of elevation

来源：评论

学校读者我要写书评

暂无评论

Active control of an innovative seat suspension system with acceleration measurement based friction estimation

引用

JOURNAL OF SOUND AND VIBRATION 2016年第0期384卷 28-44页

作者： Ning, Donghong Sun, Shuaishuai Li, Hongyi Du, Haiping Li, Weihua Univ Wollongong Sch Elect Comp & Telecommun Engn Wollongong NSW 2522 Australia Univ Wollongong Sch Mech Mat & Mechatron Engn Wollongong NSW 2522 Australia Bohai Univ Coll Informat Sci & Technol Jinzhou 121013 Liaoning Peoples R China

In this paper, an innovative active seat suspension system for vehicles is presented. This seat suspension prototype is built with two low cost actuators each of which has one rotary motor and one gear reducer. A H-infinity controller with friction compensation is designed for the seat suspension control system where the friction is estimated and compensated based on the measurement of seat acceleration. This principal aim of this research was to control the low frequency vibration transferred or amplified by the vehicle (chassis) suspension, and to maintain the passivity of the seat suspension at high frequency (isolation vibration) while taking into consideration the trade-off between the active seat suspension cost and its high frequency performance. Sinusoidal excitations of 1-4.5 Hz were applied to test the active seat suspension both when controlled and when uncontrolled and this is compared with a well-tuned passive heavy duty vehicle seat suspension. The results indicate the effectiveness of the proposed control algorithm within the tested frequencies. Further tests were conducted using the excitations generated from a quarter-car model under bump and random road profiles. The bump road tests indicate the controlled active seat suspension has good transient response performance. The Power Spectral Density (PSD) method and ISO 2631-1 standards were applied to analyse the seat suspension's acceleration under random road conditions. Although some low magnitude and high frequency noise will inevitably be introduced by the active system, the weighted-frequency Root Mean Square (RMS) acceleration shows that this may not have a large effect on ride comfort. In fact, the ride comfort is improved from being an 'a little uncomfortable' to a 'not uncomfortable' level when compared with the well-tuned passive seat suspension. This low cost active seat suspension design and the proposed controller with the easily measured feedback signals are very practical for real appl

关键词： Chassis Device Component active control Pavement condition ride comfort acceleration measurement Suspended load seat low frequency vibration Suspension System computer algorithms

来源：评论

学校读者我要写书评

暂无评论

Fast Consensus Tracking of Multiagent Systems with Diverse Communication Delays and Input Delays

引用

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

作者： Yang, Chun-xi Hong, Wei-xing Huang, Ling-yun Wang, Hua Kunming Univ Sci & Technol Fac Chem Engn Minist Educ Kunming 650500 Peoples R China Kunming Univ Sci & Technol Fac Met & Energy Engn Kunming 650500 Peoples R China Kunming Univ Sci & Technol Fac Land Resource Engn Minist Educ Kunming 650500 Peoples R China Kunming Univ Sci & Technol Engn Res Ctr Met Energy Conservat & Emiss Reduct Minist Educ Kunming 650500 Peoples R China

The consensus tracking problem for discrete-time multiagent systems with input and communication delays is studied. A sufficient condition is obtained over a directed graph based on the frequency-domain analysis. Furthermore, a fast decentralized consensus tracking conditions based on increment PID algorithm are discussed for improving convergence speed of the multiagent systems. Based on this result, genetic algorithm is introduced to construct increment PID based on genetic algorithm for obtaining optimization consensus tracking performance. Finally, a numerable example is given to compare convergence speed of three tracking algorithms in the same condition. Simulation results show the effectiveness of the proposed algorithm.

关键词： MULTIAGENT systems TIME delay systems SIMULATION methods & models PID controllers computer algorithms

来源：评论

学校读者我要写书评

暂无评论

Learning to Win by Reading Manuals in a Monte-Carlo Framework

引用

JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH 2012年第1期43卷 661-704页

作者： Branavan, S. R. K. Silver, David Barzilay, Regina MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA UCL Dept Comp Sci London WC1E 6BT England

Domain knowledge is crucial for effective performance in autonomous control systems. Typically, human effort is required to encode this knowledge into a control algorithm. In this paper, we present an approach to language grounding which automatically interprets text in the context of a complex control application, such as a game, and uses domain knowledge extracted from the text to improve control performance. Both text analysis and control strategies are learned jointly using only a feedback signal inherent to the application. To effectively leverage textual information, our method automatically extracts the text segment most relevant to the current game state, and labels it with a task-centric predicate structure. This labeled text is then used to bias an action selection policy for the game, guiding it towards promising regions of the action space. We encode our model for text analysis and game playing in a multi-layer neural network, representing linguistic decisions via latent variables in the hidden layers, and game action quality via the output layer. Operating within the Monte-Carlo Search framework, we estimate model parameters using feedback from simulated games. We apply our approach to the complex strategy game Civilization II using the official game manual as the text guide. Our results show that a linguistically-informed game-playing agent significantly outperforms its language-unaware counterpart, yielding a 34% absolute improvement and winning over 65% of games when playing against the built-in AI of Civilization.

关键词： domain knowledge Frameworks Civilization text processing mining Activity spaces Learning texts control performance feedback signal computer algorithms

来源：评论

学校读者我要写书评

暂无评论

Extra processors versus future information in optimal deadline scheduling

引用

THEORY OF COMPUTING SYSTEMS 2004年第3期37卷 323-341页

作者： Koo, CY Lam, TW Ngan, TW To, KK Univ Maryland Dept Comp Sci College Pk MD 20742 USA Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China Rice Univ Dept Comp Sci Houston TX 77005 USA

This paper is concerned with the design of online scheduling algorithms that exploit extra resources. In particular, it studies how to make use of multiple processors to counteract the lack of future information in online deadline scheduling. Our results extend the previous work that are primarily based on using a faster,processor to obtain a performance guarantee. The challenge arises from the fact that jobs are sequential in nature and cannot be executed on more than one processor at the same time. Thus, a faster processor can speed up a job while multiple unit-speed processors cannot.

关键词： PRODUCTION scheduling ONLINE algorithms ONLINE data processing computer algorithms ELECTRONIC data processing OPERATIONS research

来源：评论

学校读者我要写书评

暂无评论

Collaborative Approach Based on Heuristic Algorithm and MILP Model To Assignment and Sequencing of Oil Derivative Batches in Pipeline Networks

引用

INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH 2017年第9期56卷 2492-2514页

作者： Polli, Helton L. Magatao, Leandro Magatao, Suelen N. B. Neves, Flavio, Jr. Arruda, Lucia V. R. Sollve Optimizat & Technol BR-80220060 Curitiba Parana Brazil Fed Univ Technol Parana UTFPR Grad Program Elect & Comp Engn CPGEI BR-80230901 Curitiba Parana Brazil

This paper presents a collaborative approach to the assignment and sequencing of batches in pipeline networks. The approach is based on the integration of a heuristic algorithm with a mixed integer linear programming (MILP) model. The pipeline-scheduling problem is solved using a hierarchical decomposition [Ind. Eng. Chem. Res. 2015, 54, 5077], but a new collaborative approach is proposed for assignment/sequencing tasks. At a first step, the proposed heuristic algorithm (assignment module) determines priorities for sending batches in order to respect deadlines. The algorithm encompasses an analysis of production and demand plans, inventories, and input and output of products in terminals, trying to use resources, namely tanks and pipelines, in an optimized form. This algorithm is used in cooperation with a proposed MILP sequencing model, winch allows overcoming computation difficulties previously indicated by a traditional scheduling approach that tried to aggregate into the same monolithic MILP model assignment and sequencing decisions [Ind. Eng. Chem. Res. 2012, S1, 4591]. The proposed assignment/sequencing collaborative approach can be used to define operational batches with their volumes and routes in pipeline networks. Thus, the lot-sizing problem of batches in pipeline networks is addressed within the proposed paper. Tests were made in pipeline networks of different topologies. First, a small, but representative pipeline network is proposed and a data set for this network is made available for reproducibility purposes. Second, tests are made in a real-world pipeline network and results have been attained in computational times from seconds to few minutes.

关键词： HEURISTIC programming ARTIFICIAL intelligence computer algorithms computer programming METAHEURISTIC algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：