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

123rd ASEE Annual Conference and Exposition

作者： Chandramouli, Viswanathan Hixon, Emily Zhou, Chenn Q. Moreland, John Wang, Jichao Teegavarapu, Rameh Behera, Pradeep K. Fox, James Forrest Purdue University Calumet United States Center for Innovation through Visualization and Simulation Purdue University Northwest United States Boca RatonFL United States University of the District of Columbia United States Department of Civil Engineering University of Kentucky LexingtonKY United States

来源：评论

学校读者我要写书评

暂无评论

Polarized beamforming for enhanced countermeasure of wireless jamming attacks

Polarized beamforming for enhanced countermeasure of wireles...

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Ali Aldarraji Liang Hong Sachin Shetty Department of Electrical and Computer Engineering Tennessee State University Nashville Tennessee Department of Modeling Simulation and Visualization Engineering Old Dominion University Norfolk Virginia

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.

关键词： Jamming Array signal processing Interference Planar arrays Wireless communication Bit error rate

来源：评论

学校读者我要写书评

暂无评论

Reducing the data communication delay in wireless sensor networks

Reducing the data communication delay in wireless sensor net...

引用

IEEE International Conference on Intelligent Computer Communication and Processing (ICCP)

作者： Doina Bein Bharat B. Madan Department of Computer Science California State University Fullerton Fullerton USA Simulation & Visualization Engineering Old Dominion University Norfolk USA

ISBN: (纸本)9781509039005

We study the problem of delay efficient scheduling of data communicated by sensor nodes for sensor fusion in wireless sensor networks. We model the sensor network as a tree in which sensor nodes collaboratively observe an event and transmit their measurements to intermediate sensor nodes that lie along the path the root of the tree. The root node functions as the sensor data fusion center that is responsible for aggregating distributed measurements, while internal tree nodes perform dual functionality - as local routers and as intermediate data fusion nodes. We are interested in two problems - one for minimizing the sum of the end-to-end delays of sensors, and the other for minimizing the maximum end-to-end delay of a sensor. Since these problems are computationally hard, we approach these problems by minimizing the average delay and the maximum delay one hop at a time. We provide low complexity, distributed optimal solutions for both these problems. Further, we show through simulations that by minimizing the delay hop by hop, we can achieve good delay performance relative to the global problem of minimizing the sum of the end-to-end delays.

关键词： Delays Wireless sensor networks Interference Wireless communication Clustering algorithms Schedules

来源：评论

学校读者我要写书评

暂无评论

Backward Dijkstra Algorithms for Finding the Departure Time Based on the Specified Arrival Time for Real-Life Time-Dependent Networks

Backward Dijkstra Algorithms for Finding the Departure Time ...

引用

2016 Workshop 1

作者： Gelareh Bakhtyar Vi Nguyen Mecit Cetin Duc Nguyen Department of Civil and Environmental Engineering Old Dominion University Department of Mechanical and Aerospace Engineering Old Dominion University Department of Modeling Simulation and Visualization Engineering Old Dominion University

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.

关键词： Backward Dijkstra Dynamic Networks Piece-Wise Linear Function Specified Arrival Time

来源：评论

学校读者我要写书评

暂无评论

Collaborative virtual environment for engineering laboratory 29

Collaborative virtual environment for engineering laboratory

引用

29th European Conference on Modelling and simulation, ECMS 2015

作者： Ren, Shuo McKenzie, Frederic D. Department of Modeling Simulation and Visualization Engineering NorfolkVA United States

ISBN: (纸本)9780993244001

In recent years, virtual environments have played a key role in engineering education. The use of virtual environments as learning tools continues to grow on account of the capabilities of providing learners with more interactive and immersive learning experiences than most of the conventional learning methods. This paper aims to introduce the related background and recent research work on the topic of the collaborative virtual environment (CVE) and then presents a solution of implementing a web-based 3D virtual engineering laboratory in a collaborative setting. This will allow users to create their own avatars in the virtual world and work collaboratively over the network. Such a method may also be beneficial for distance learning. © ECMS Valeri M. Mladenov, Petia Georgieva, Grisha Spasov, Galidiya Petrova (Editors).

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Backward Dijkstra Algorithms for Finding the Departure Time Based on the Specified Arrival Time for Real-Life Time-Dependent Networks

引用

Journal of Applied Mathematics and Physics 2016年第1期4卷 1-7页

作者： Gelareh Bakhtyar Vi Nguyen Mecit Cetin Duc Nguyen Department of Civil and Environmental Engineering Old Dominion University Norfolk USA Department of Mechanical and Aerospace Engineering Old Dominion University Norfolk VA USA Department of Modeling Simulation and Visualization Engineering Old Dominion University Norfolk VA USA

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 piece- wise 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 large- scale (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.

关键词： Backward Dijkstra Dynamic Networks Piece-Wise Linear Function Specified Arrival Time

来源：评论

学校读者我要写书评

暂无评论

Optimal maximum likelihood estimates fusion in distributed network of sensors

Optimal maximum likelihood estimates fusion in distributed n...

引用

IEEE International Conference on Intelligent Computer Communication and Processing (ICCP)

作者： Bharat Madan Doina Bein Dept. of Modeling Simulation & Visualization Engineering Old Dominion University Norfolk USA Department of Computer Science California State University Fullerton Fullerton USA

ISBN: (纸本)9781509039005

A distributed network of sensors leverages its performance by aggregating information gathered by individual sensors through the process of sensor data fusion. Estimating parameters using a centralized scheme entails transporting data from multiple sensors to a centralized fusion center, leading to high network bandwidth consumption. Additionally, fusing raw sensor data from sensors with different sensing modalities may not be feasible. We propose an alternative approach in which each sensor first individually estimates the unknown parameters based solely on its own sensor data. Since sensors may not have a-priori knowledge of the probability distribution of the unknown parameters, each sensor independently computes its individual maximum likelihood estimates. Individual estimates along with their sufficient statistics are then communicated to the fusion center, which treats these estimates as observations to compute the optimum aggregated maximum likelihood estimates by maximizing the new likelihood function of these observations. The proposed technique offers two significant advantages: (i) Since each sensor computes its individual estimates based solely on its own sensed data, it is easily applicable to sensor networks having multi-modal sensors, and (ii) As compared to raw sensor data, communicating estimates and their sufficient statistics to the fusion center requires substantially less network bandwidth. Performance of the aggregated estimates is evaluated through simulations and by computing the Cramer-Rao lower bound.

关键词： Maximum likelihood estimation Sensor fusion Bandwidth Sensor phenomena and characterization Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Controlling the Error on Target Motion through Real-time Mesh Adaptation: Applications to Deep Brain Stimulation

arXiv

引用

arXiv 2017年

作者： Bui, Huu Phuoc Tomar, Satyendra Courtecuisse, Hadrien Audette, Michel Cotin, Stéphane Bordas, Stéphane P.A. Institute of Computational Engineering University of Luxembourg Faculty of Sciences Communication and Technology Luxembourg University of Strasbourg CNRS ICube Strasbourg France Department of Modeling Simulation and Visualization Engineering Old Dominion University Norfolk United States Inria Nancy-Grand Est Villers-lès-Nancy France Institute of Mechanics and Advanced Materials School of Engineering Cardiff University United Kingdom Intelligent Systems for Medicine Laboratory University of Western Australia Perth Australia

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 to control the error in the computation of the displacement and stress fields around the needle tip and needle shaft by suitably refining the mesh, whilst maintaining a coarser mesh in other parts of the domain. We demonstrate through academic and practical examples that our approach increases the accuracy of the displacement and stress fields around the needle without increasing the computational expense. This enables real-time simulations. The proposed methodology has direct implications to increase the accuracy and control the computational expense of the simulation of percutaneous procedures such as biopsy, brachytherapy, regional anesthesia, or cryotherapy and can be essential to the development of robotic guidance. Copyright © 2017, The Authors. All rights reserved.

关键词： Finite element method

来源：评论

学校读者我要写书评

暂无评论

Java Computer Animation for Effective Learning of the Cholesky Algorithm with Transportation Engineering Applications

引用

Journal of Software Engineering and Applications 2016年第10期9卷 491-500页

作者： Ivan Makohon Duc T. Nguyen Mecit Cetin Modeling Simulation & Visualization Engineering (MSVE) Department Old Dominion University Norfolk VA USA CEE and MSVE Department Old Dominion University Norfolk VA USA Civil & Environmental Engineering (CEE) Department Old Dominion University Norfolk VA USA

In this paper, the well-known Cholesky Algorithm (for solving simultaneous linear equations, or SLE) is re-visited, with the ultimate goal of developing a simple, user-friendly, attractive, and useful Java visualization and Animation Graphical User Inter-face (GUI) software as an additional teaching tool for students to learn the Cholesky factorization in a step-by-step fashion with computer voice and animation. A demo video of the Cholesky Decomposition (or factorization) animation and result can be viewed online from the website: http://***/~imako001/cholesky/demo/***. The software tool developed from this work can be used for both students and their instructors not only to master this technical subject, but also to provide a dynamic/valuable tool for obtaining the solutions for homework assignments, class examinations, self-assessment studies, and other coursework related activities. Various transportation engineering applications of SLE are cited. Engineering educators who have adopted “flipped classroom instruction” can also utilize this Java visualization and Animation software for students to “self-learning” these algorithms at their own time (and at their preferable locations), and use valuable class-meeting time for more challenging (real-life) problems’ discussions. Statistical data for comparisons of students’ performance with and without using the developed Java computer animation are also included.

关键词： Cholesky Algorithm Shortest Path Linear Programming Traffic Flows Decomposition/Factorization Java visualization/Animation Statistical Data

来源：评论

学校读者我要写书评

暂无评论

An accredited engineering curriculum for modeling and simulation 27

An accredited engineering curriculum for modeling and simula...

引用

27th European Modeling and simulation Symposium, EMSS 2015

作者： McKenzie, Frederic D. Modeling Simulation and Visualization Engineering Department Old Dominion University NorfolkVA United States

ISBN: (纸本)9788897999485

The Accreditation Board for Engineering and Technology (ABET) is an internationally known organization for recognizing engineering programs that work towards student attainment in learning outcomes that conform to engineering disciplines and have a process for measuring attainment and continuous improvement. There are eight general criteria to be satisfied that include student outcomes, educational objectives, curriculum, facilities and faculty. Additionally, there may be program-specific requirements depending on the particular discipline. The modeling and simulation (M&S) engineering (M&SE) program at Old Dominion University satisfies the program criteria for general engineering in the ABET Engineering Accreditation Commission and declares detailed discipline-specific student outcomes to ensure unambiguous definition of a pioneering program in order to set a standard that can be utilized as a template for future up-and-coming M&SE programs. This paper presents the curriculum and programspecific outcomes that have been incorporated into our continuous improvement process for student attainment of our M&S engineering program outcomes.

关键词： Curricula

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：