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

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

来源：评论

学校读者我要写书评

暂无评论

An Implementation of Block Conjugate Gradient Algorithm on CPU-GPU Processors

An Implementation of Block Conjugate Gradient Algorithm on C...

引用

Hardware-Software Co-Design for High Performance Computing (Co-HPC)

作者： Hao Ji Masha Sosonkina Yaohang Li Department of Computer Science Old Dominion University Norfolk VA Department of Modeling Simulation Visualization Engineering Old Dominion University Norfolk VA

In this paper, we investigate the implementation of the Block Conjugate Gradient (BCG) algorithm on CPU-GPU processors. By analyzing the performance of various matrix operations in BCG, we identify the main performance bottleneck in constructing new search direction matrices. Replacing the QR decomposition by eigendecomposition of a small matrix remedies the problem by reducing the computational cost of generating orthogonal search directions. Moreover, a hybrid (offload) computing scheme is designed to enables the BCG implementation to handle linear systems with large, sparse coefficient matrices that cannot fit in the GPU memory. The hybrid scheme offloads matrix operations to GPU processors while helps hide the CPU-GPU memory transaction overhead. We compare the performance of our BCG implementation with the one on CPU with Intel Xeon Phi coprocessors using the automatic offload mode. With sufficient number of right hand sides, the CPU-GPU implementation of BCG can reach speedup of 2.61 over the CPU-only implementation, which is significantly higher than that of the CPU-Intel Xeon Phi implementation.

关键词： Sparse matrices Graphics processing units Matrix decomposition Data transfer Clocks Coprocessors

来源：评论

学校读者我要写书评

暂无评论

Generative Adversarial Network for Improving Deep Learning Based Malware Classification

Generative Adversarial Network for Improving Deep Learning B...

引用

simulation Winter Conference

作者： Yan Lu Jiang Li Department of Modeling Simulation and Visualization Engineering Old Dominion University Norfolk VA USA Department of Electrical and Computer Engineering Old Dominion University Norfolk VA USA

ISBN: (数字)9781728132839

ISBN: (纸本)9781728120522

The generative adversarial network (GAN) had been successfully applied in many domains in the past, the GAN network provides a new approach for solving computer vision, object detection and classification problems by learning, mimicking and generating any distribution of data. One of the difficulties in deep learning-based malware detection and classification tasks is lacking of training malware samples. With insufficient training data the classification performance of the deep model could be compromised significantly. To solve this issue, in this paper, we propose a method which uses the Deep Convolutional Generative Adversarial Network (DCGAN) to generate synthetic malware samples. Our experiment results show that by using the DCGAN generated adversarial synthetic malware samples, the classification accuracy of the classifier - a 18-layer deep residual network is significantly improved by approximately 6%.

关键词： Generative adversarial networks Machine learning Data models Computational modeling Trojan horses Gallium nitride

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Optimized surgical tool for pectus bar extraction

Optimized surgical tool for pectus bar extraction

引用

Annual International Conference of the IEEE engineering in Medicine and Biology Society (EMBC)

作者： Krzysztof J. Rechowicz Frederic D. McKenzie Sebastian Y. Bawab Robert Obermeyer Modeling Simulation and Visualization Department Old Dominion University Norfolk VA USA Mechanical Engineering Department Old Dominion University Norfolk VA USA Norfolk VA USA

Surgeons on a daily basis improve or rescue human lives. Therefore, they should be provided with the most optimal tools so their skills are fully utilized. In this paper, we present such an optimized tool for surgeons who employ the Nuss procedure to correct pectus excavatum - a congenital chest wall deformity. The Nuss procedure is a minimally invasive procedure that results in the placement of a metal bar inside the chest cavity. The bar is removed after approximately two years. Surgeons have been reporting that the currently available tools for the bar extraction do not provide the most optimal functionality. Therefore, we have proposed an optimized and improved design of the tool for the bar extraction. The improved design tool is further analyzed using finite element techniques. Additionally, we have built a physical prototype to ensure that the new tool to seamlessly integrate with the bar and to further evaluate by the surgeons who routinely practice the Nuss procedure. In order to validate in the future the final design, we have manufactured wax models that will serve as the patterns in the casting process of metal prototypes. They should provide enough strength to withstand stresses present in the bar straightening process.

关键词： Surgery Solid modeling Three dimensional displays Stress Metals Prototypes Safety

来源：评论

学校读者我要写书评

暂无评论

Blockchain and PUF-based secure key establishment protocol for cross-domain digital twins in industrial Internet of Things architecture

引用

Journal of Advanced Research 2024年 62卷 155-163页

作者： Mahmood, Khalid Shamshad, Salman Saleem, Muhammad Asad Kharel, Rupak Das, Ashok Kumar Shetty, Sachin Rodrigues, Joel J.P.C. School of Psychology and Computer Science University of Central Lancashire Preston United Kingdom Graduate School of Intelligent Data Science National Yunlin University of Science and Technology Yunlin 64002 Taiwan Department of Software Engineering The University of Lahore Lahore 54590 Pakistan Department of Computer Science University of Sahiwal Punjab Sahiwal 57000 Pakistan Center for Security Theory and Algorithmic Research International Institute of Information Technology Hyderabad 500 032 India Department of Modeling Simulation and Visualization Engineering Virginia Modeling Analysis and Simulation Center and Center for Cybersecurity Education and Research Old Dominion University Suffolk 23435 VA United States COPELABS Lusófona University Campo Grande 376 Lisbon 1749-024 Portugal

Introduction: The Industrial Internet of Things (IIoT) is a technology that connects devices to collect data and conduct in-depth analysis to provide value-added services to industries. The integration of the physical and digital domains is crucial for unlocking the full potential of the IIoT, and digital twins can facilitate this integration by providing a virtual representation of real-world entities. Objectives: By combining digital twins with the IIoT, industries can simulate, predict, and control physical behaviors, enabling them to achieve broader value and support industry 4.0 and 5.0. Constituents of cooperative IIoT domains tend to interact and collaborate during their complicated operations. Methods: To secure such interaction and collaborations, we introduce a blockchain-based cross-domain authentication protocol for IIoT. The blockchain maintains only each domain's dynamic accumulator, which accumulates crucial materials derived from devices, decreasing the overhead. In addition, we use the on-chain accumulator to effectively validate the unlinkable identities of cross-domain IIoT devices. Results: The implementation of the concept reveals the fact that our protocol is efficient and reliable. This efficiency and reliability of our protocol is also substantiated through comparison with state-of-the-art literature. In contrast to related protocols, our protocol exhibits a minimum 22.67% increase in computation cost efficiency and a 16.35% rise in communication cost efficiency. Conclusion: The developed protocol guarantees data transfer security across the domain and thwarts IoT devices from potential physical attacks. Additionally, in order to protect privacy, anonymity and unlinkability are also guaranteed. © 2024

关键词： Digital twins Industrial Internet of Things (IIoT) Key agreement Mutual authentication Physically Unclonable Functions (PUFs)

来源：评论

学校读者我要写书评

暂无评论

An Education of simulation Discussion

An Education of Simulation Discussion

引用

simulation Winter Conference

作者： Andrew J. Collins Ying Thaviphoke James F. Leathrum David Sturrock Department of Engineering Management and Systems Engineering Old Dominion University Norfolk VA USA Department of Modeling Simulation and Visualization Engineering Old Dominion University Norfolk VA USA Simio LLC Sewickley PA USA

ISBN: (数字)9781728132839

ISBN: (纸本)9781728120522

This paper takes three different viewpoints on the problems faced in the development of modeling and simulation (M&S) educational material. Two educational environments - academic and commercial - are discussed. The paper starts with a discussion on the establishment of the undergraduate M&S engineering program at Old Dominion University. The paper then explores the education in a commercial environment, discussing the challenges and possible connections between the two environments. The associated issues which have arisen in the M&S community, especially the accessibility problem, are discussed through the outcomes of a workshop. There is a strong relationship between M&S education and the ease of determining M&S usefulness (i.e., the evidence of success in M&S applications). This paper advocates for detailed case studies to be developed and used within the M&S classrooms. The more case studies (both successful and non-successful), the better the chance to understand different types of complex problems.

关键词： modeling Accreditation Industries Government Computer aided instruction Programming

来源：评论

学校读者我要写书评

暂无评论

Leveraging GPUs in Ab initio nuclear physics calculations

Leveraging GPUs in Ab initio nuclear physics calculations

引用

2013 IEEE 37th Annual Computer Software and Applications Conference, COMPSAC 2013

作者： Oryspayev, Dossay Potter, Hugh Maris, Pieter Sosonkina, Masha Vary, James P. Binder, Sven Calci, Angelo Langhammer, Joachim Roth, Robert U.S. DOE Ames Laboratory Iowa State University Ames IA 50011 United States Department of Physics and Astronomy Iowa State University Ames IA 50011 United States Department of Modeling Simulation and Visualization Engineering Old Dominion University Norfolk VA 23529 United States Institut fur Kernphysik Technische Universiẗat Darmstadt 64289 Darmstadt Germany

ISBN: (纸本)9780769549798

This paper describes initial steps to leverage accelerators, such as GPUs, in ab initio nuclear physics calculations. Specifically, parallel nuclear structure calculations performed by the MFDn package are considered with selected stages adapted for GPUs. This paper outlines the necessary steps to make MFDnutilize GPUs in its matrix construction stage. The experiments are presented to compare the multithreaded CPU-based version of this phase with the newly designedGPU-based version. Four-to ten-fold speedups were observed for the code executing on GPUs. © 2013 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：