This paper presents an initial baseline model of factors that give rise to an attacker. It explores the impact of successful rate of attack and social learning on the decision to become an attacker. The model utilizes...
详细信息
The rate and sophistication of cyber-attacks are ever increasing forcing organizations to test their systems and assess their risks for specific situations (e.g., data breach). simulation is an emerging field in testi...
详细信息
Modern high-performance computing system designers are becoming increasingly aware of the energy requirements for computing while needing to lower the operational costs and raise reliability. At the same time, high-pe...
详细信息
The first undergraduate degree program in modeling and simulationengineering recently was implemented at Old Dominion University. The program awards the Bachelor of Science Degree in modeling and simulation Engineeri...
详细信息
ISBN:
(纸本)9781467397414
The first undergraduate degree program in modeling and simulationengineering recently was implemented at Old Dominion University. The program awards the Bachelor of Science Degree in modeling and simulationengineering and was designed to meet the ABET accreditation requirements for general engineering programs. This paper describes the design and implementation of a continuous improvement process for the program. The department mission statement and the program educational objectives are presented. The student outcomes are stated and an assessment process for evaluating student achievement is described. Finally, the continuous improvement process for the program is presented. Recommendations from the initial ABET accreditation visit are summarized.
Optimization problems are often highly constrained and evolutionary algorithms（EAs）are effective methods to tackle this kind of problems. To further improve search efficiency and convergence rate of EAs, this paper ...
详细信息
Optimization problems are often highly constrained and evolutionary algorithms（EAs）are effective methods to tackle this kind of problems. To further improve search efficiency and convergence rate of EAs, this paper presents an adaptive double chain quantum genetic algorithm（ADCQGA） for solving constrained optimization problems. ADCQGA makes use of doubleindividuals to represent solutions that are classified as feasible and infeasible solutions. Fitness（or evaluation） functions are defined for both types of solutions. Based on the fitness function, three types of step evolution（SE） are defined and utilized for judging evolutionary individuals. An adaptive rotation is proposed and used to facilitate updating individuals in different *** further improve the search capability and convergence rate, ADCQGA utilizes an adaptive evolution process（AEP）, adaptive mutation and replacement techniques. ADCQGA was first tested on a widely used benchmark function to illustrate the relationship between initial parameter values and the convergence rate/search capability. Then the proposed ADCQGA is successfully applied to solve other twelve benchmark functions and five well-known constrained engineering design problems. Multi-aircraft cooperative target allocation problem is a typical constrained optimization problem and requires efficient methods to tackle. Finally, ADCQGA is successfully applied to solving the target allocation problem.
Capturing and retaining the attention of students while learning complex topics like modeling and simulation is a critical task. In discrete-event simulation (DES), educators rely on examples like queueing systems in ...
详细信息
We present an error-controlled mesh refinement procedure for needle insertion simulation and apply it to the simulation of electrode implantation for deep brain stimulation, including brain shift. Our approach enables...
详细信息
Eye tracking has traditionally been used to measure the visual attention of users while performing a task or to aide disabled persons in performing hands-free interactions. The increased accuracy and reduced cost of e...
详细信息
Due to the open and shared nature, wireless communication systems are vulnerable to jamming attacks. Beamforming is a promising technique to counteract the impact of jamming attacks. However, when the location of the ...
详细信息
ISBN:
(纸本)9781509052530
Due to the open and shared nature, wireless communication systems are vulnerable to jamming attacks. Beamforming is a promising technique to counteract the impact of jamming attacks. However, when the location of the desired signal is close to that of the jamming signal, the performance of the traditional anti-jamming beamformer that uses isotropic antenna elements is significantly degraded due to the indistinguishable signals and interferences in the space domain. In this paper, an enhanced countermeasure method for jamming attacks has been proposed by using the polarized beamforming with a planar array. By integrating both polarization and space information, the proposed beamformer is able to suppress the interference that is close to the desired signal. The beamformer is designed using the Linearly Constrained Minimum Variance (LCMV) criterion. The analytical expression of the steering vectors is derived for far-field propagation. The Bit Error Rate (BER) performance of the proposed jamming defense system is examined. simulation results show a significant performance improvement of the proposed anti-jamming system even when the desired signals and interferences are coming from the same direction.
A practical transportation problem for finding the "departure" time at "all source nodes" in order to arrive at "some destination nodes" at specified time for both FIFO(i.e., First In Fir...
详细信息
A practical transportation problem for finding the "departure" time at "all source nodes" in order to arrive at "some destination nodes" at specified time for both FIFO(i.e., First In First Out) and Non-FIFO "Dynamic " Networks is considered in this study. Although shortest path(SP) for dynamic networks have been studied/documented by various researchers, contributions from this present work consists of a sparse matrix storage scheme for efficiently storing large scale sparse network's connectivity, a concept of Time Delay Factor(TDF) combining with a "general piecewise linear function" to describe the link cost as a function of time for Non-FIFO links' costs, and Backward Dijkstra SP Algorithm with simple heuristic rules for rejecting unwanted solutions during the backward search algorithm. Both small-scale(academic) networks as well as largescale(real-life) networks are investigated in this work to explain and validate the proposed dynamic algorithms. Numerical results obtained from this research work have indicated that the newly proposed dynamic algorithm is reliable, and efficient. Based on the numerical results, the calculated departure time at the source node(s), for a given/specified arrival time at the destination node(s), can be non-unique, for some Non-FIFO networks' connectivity.
暂无评论