A Context-aware and Intelligent Framework for the Secure Mission Critical Systems

Recent technological advancements in pervasive systems have shown the poten-tial to address challenges in the military domain. Research developments in mili-tary-based mission-critical systems have refined a lot as in autopilot, sensing true target behavior, battle damage conditions, acquiring and manipulating command control information. However, the application of pervasive systems in the military domain is still evolving. In this paper, an intelligent framework has been pro-posed for mission-critical systems to incorporate advanced heterogeneous com-munication protocols; service-oriented layered structure and context-aware infor-mation manipulation. The proposed framework addresses the limitation of “time-space” constraints in Mission-critical systems that have been improved signifi-cantly. This improvement is courtesy to enhancing situation-aware tactical capa-bilities such as localization, decision significance, strategic span, strategic inten-tions, resource coordination and profiling concerning the situation. A comprehen-sive use case model has been presented for a typical battle-field scenario followed by a comparison of the proposed framework with existing techniques. It is evi-dent from experiments and analyses that the proposed framework provides more effective and seamless interaction with contextual resources to improve tactical capabilities. This is the peer reviewed version of the following article: A Context-aware and Intelligent Framework for the Secure Mission Critical Systems, which has been published in final form in Transactions on Emerging Telecommunications Technologies. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Version

Secure Large Scale Penetration of Electric Vehicles in the Power Grid

As part of the approaches used to meet climate goals set by international environmental agreements, policies are being applied worldwide for promoting the uptake of Electric Vehicles (EV)s. The resulting increase in EV sales and the accompanying expansion in the EV charging infrastructure carry along many challenges, mostly infrastructure-related. A pressing need arises to strengthen the power grid to handle and better manage the electricity demand by this mobile and geo-distributed load. Because the levels of penetration of EVs in the power grid have recently started increasing with the increase in EV sales, the real-time management of en-route EVs, before they connect to the grid, is quite recent and not many research works can be found in the literature covering this topic comprehensively. In this dissertation, advances and novel ideas are developed and presented, seizing the opportunities lying in this mobile load and addressing various challenges that arise in the application of public charging for EVs. A Bilateral Decision Support System (BDSS) is developed here for the management of en-route EVs. The BDSS is a middleware-based MAS that achieves a win-win situation for the EVs and the power grid. In this framework, the two are complementary in a way that the desired benefit of one cannot be achieved without attaining that of the other. A Fuzzy Logic based on-board module is developed for supporting the decision of the EV as to which charging station to charge at. GPU computing is used in the higher-end agents to handle the big amount of data resulting in such a large scale system with mobile and geo-distributed nodes. Cyber security risks that threaten the BDSS are assessed and measures are applied to revoke possible attacks. Furthermore, the Collective Distribution of Mobile Loads (CDML), a service with ancillary potential to the power system, is developed. It comprises a system-level optimization. In this service, the EVs requesting a public charging session are collectively redistributed onto charging stations with the objective of achieving the optimal and secure operation of the power system by reducing active power losses in normal conditions and mitigating line congestions in contingency conditions. The CDML uses the BDSS as an industrially viable tool to achieve the outcomes of the optimization in real time. By participating in this service, the EV is considered as an interacting node in the system-wide communication platform, providing both enhanced self-convenience in terms of access to public chargers, and contribution to the collective effort of providing benefit to the power system under the large scale uptake of EVs. On the EV charger level, several advantages have been reported favoring wireless charging of EVs over wired charging. Given that, new techniques are presented that facilitate the optimization of the magnetic link of wireless EV chargers while considering international EMC standards. The original techniques and developments presented in this dissertation were experimentally verified at the Energy Systems Research Laboratory at FIU

Distributed Hybrid Simulation of the Internet of Things and Smart Territories

This paper deals with the use of hybrid simulation to build and compose heterogeneous simulation scenarios that can be proficiently exploited to model and represent the Internet of Things (IoT). Hybrid simulation is a methodology that combines multiple modalities of modeling/simulation. Complex scenarios are decomposed into simpler ones, each one being simulated through a specific simulation strategy. All these simulation building blocks are then synchronized and coordinated. This simulation methodology is an ideal one to represent IoT setups, which are usually very demanding, due to the heterogeneity of possible scenarios arising from the massive deployment of an enormous amount of sensors and devices. We present a use case concerned with the distributed simulation of smart territories, a novel view of decentralized geographical spaces that, thanks to the use of IoT, builds ICT services to manage resources in a way that is sustainable and not harmful to the environment. Three different simulation models are combined together, namely, an adaptive agent-based parallel and distributed simulator, an OMNeT++ based discrete event simulator and a script-language simulator based on MATLAB. Results from a performance analysis confirm the viability of using hybrid simulation to model complex IoT scenarios.Comment: arXiv admin note: substantial text overlap with arXiv:1605.0487

Development of a Full Mission Simulator for Pilot Training of Fighter Aircraft

With aircraft becoming more complex and avionics intensive and flight being almost autonomous based on waypoint navigation, software and displays becoming a significant component of the all glass cockpit of the modern day fighter aircraft, it is imperative that pilots are trained on missions using ground based full mission simulator (FMS) for routine flight as well as advanced missions. A flight simulator is as good as the real system only when it is able to mimic the physical system, both in terms of dynamics and layout so that the pilot gets the complete feel of the environment as encountered during actual sortie. The objective of this research paper is to provide a detailed insight into the various aspects of development of a FMS for pilot training with minimal maintenance operations for long hours of realistic flight training on ground. The approach followed by ADE in developing a FMS using a healthy mix of conventional flight simulation methodologies and novel approaches for various simulator sub-systems to tailor and meet the specific training needs, one presented. The FMS developed by ADE is presently being used by Indian Air Force for flight and mission critical training of squadron pilots

A Symbiotic Approach to Designing Cross-Layer QoS in Embedded Real-Time Systems

International audienceNowadays there is an increasing need for embedded systems to support intensive computing while maintaining traditional hard real-time and fault-tolerant properties. Extending the principle of multi-core systems, we are exploring the use of distributed processing units interconnected via a high performance mesh network as a way of supporting distributed real-time applications. Fault-tolerance can then be ensured through dynamic allocation of both computing and communication resources. We postulate that enhancing QoS (Quality of Service) for real-time applications entails the development of a cross-layer support of high-level requirements, thus requiring a deep knowledge of the underlying networks. In this paper, we propose a new simulation/emulation/experimentation framework, ERICA, for designing such a feature. ERICA integrates both a network simulator and an actual hardware network to allow implementation and evaluation of different QoS-guaranteeing mechanisms. It also supports real-software-in-the-loop, i.e. running of real applications and middleware over these networks. Each component can evolve separately or together in a symbiotic manner, also making teamwork more flexible. We present in more detail our discrete-event simulation approach and the in-silicon implementation with which we cross-check our solutions in order to bring real performance aspects to our work. We also discuss the challenges of running real-software-in-the-loop in a real-time context, i.e. how to bridge it with a network simulator, and how to deal with time consistency

병렬화 용이한 통계계산 방법론과 현대 고성능 컴퓨팅 환경에의 적용

학위논문 (박사) -- 서울대학교 대학원 : 자연과학대학 통계학과, 2020. 8. 원중호.Technological advances in the past decade, hardware and software alike, have made access to high-performance computing (HPC) easier than ever. In this dissertation, easily-parallelizable, inversion-free, and variable-separated algorithms and their implementation in statistical computing are discussed. The first part considers statistical estimation problems under structured sparsity posed as minimization of a sum of two or three convex functions, one of which is a composition of non-smooth and linear functions. Examples include graph-guided sparse fused lasso and overlapping group lasso. Two classes of inversion-free primal-dual algorithms are considered and unified from a perspective of monotone operator theory. From this unification, a continuum of preconditioned forward-backward operator splitting algorithms amenable to parallel and distributed computing is proposed. The unification is further exploited to introduce a continuum of accelerated algorithms on which the theoretically optimal asymptotic rate of convergence is obtained. For the second part, easy-to-use distributed matrix data structures in PyTorch and Julia are presented. They enable users to write code once and run it anywhere from a laptop to a workstation with multiple graphics processing units (GPUs) or a supercomputer in a cloud. With these data structures, various parallelizable statistical applications, including nonnegative matrix factorization, positron emission tomography, multidimensional scaling, and ℓ1-regularized Cox regression, are demonstrated. The examples scale up to an 8-GPU workstation and a 720-CPU-core cluster in a cloud. As a case in point, the onset of type-2 diabetes from the UK Biobank with 400,000 subjects and about 500,000 single nucleotide polymorphisms is analyzed using the HPC ℓ1-regularized Cox regression. Fitting a half-million variate model took about 50 minutes, reconfirming known associations. To my knowledge, the feasibility of a joint genome-wide association analysis of survival outcomes at this scale is first demonstrated.지난 10년간의 하드웨어와 소프트웨어의 기술적인 발전은 고성능 컴퓨팅의 접근장벽을 그 어느 때보다 낮추었다. 이 학위논문에서는 병렬화 용이하고 역행렬 연산이 없는 변수 분리 알고리즘과 그 통계계산에서의 구현을 논의한다. 첫 부분은 볼록 함수 두 개 또는 세 개의 합으로 나타나는 구조화된 희소 통계 추정 문제에 대해 다룬다. 이 때 함수들 중 하나는 비평활 함수와 선형 함수의 합성으로 나타난다. 그 예시로는 그래프 구조를 통해 유도되는 희소 융합 Lasso 문제와 한 변수가 여러 그룹에 속할 수 있는 그룹 Lasso 문제가 있다. 이를 풀기 위해 역행렬 연산이 없는 두 종류의 원시-쌍대 (primal-dual) 알고리즘을 단조 연산자 이론 관점에서 통합하며 이를 통해 병렬화 용이한 precondition된 전방-후방 연산자 분할 알고리즘의 집합을 제안한다. 이 통합은 점근적으로 최적 수렴률을 갖는 가속 알고리즘의 집합을 구성하는 데 활용된다. 두 번째 부분에서는 PyTorch와 Julia를 통해 사용하기 쉬운 분산 행렬 자료 구조를 제시한다. 이 구조는 사용자들이 코드를 한 번 작성하면 이것을 노트북 한 대에서부터 여러 대의 그래픽 처리 장치 (GPU)를 가진 워크스테이션, 또는 클라우드 상에 있는 슈퍼컴퓨터까지 다양한 스케일에서 실행할 수 있게 해 준다. 아울러, 이 자료 구조를 비음 행렬 분해, 양전자 단층 촬영, 다차원 척 도법, ℓ1-벌점화 Cox 회귀 분석 등 다양한 병렬화 가능한 통계적 문제에 적용한다. 이 예시들은 8대의 GPU가 있는 워크스테이션과 720개의 코어가 있는 클라우드 상의 가상 클러스터에서 확장 가능했다. 한 사례로 400,000명의 대상과 500,000개의 단일 염기 다형성 정보가 있는 UK Biobank 자료에서의 제2형 당뇨병 (T2D) 발병 나이를 ℓ1-벌점화 Cox 회귀 모형을 통해 분석했다. 500,000개의 변수가 있는 모형을 적합시키는 데 50분 가량의 시간이 걸렸으며 알려진 T2D 관련 다형성들을 재확인할 수 있었다. 이러한 규모의 전유전체 결합 생존 분석은 최초로 시도된 것이다.Chapter1Prologue 1 1.1 Introduction 1 1.2 Accessible High-Performance Computing Systems 4 1.2.1 Preliminaries 4 1.2.2 Multiple CPU nodes: clusters, supercomputers, and clouds 7 1.2.3 Multi-GPU node 9 1.3 Highly Parallelizable Algorithms 12 1.3.1 MM algorithms 12 1.3.2 Proximal gradient descent 14 1.3.3 Proximal distance algorithm 16 1.3.4 Primal-dual methods 17 Chapter 2 Easily Parallelizable and Distributable Class of Algorithms for Structured Sparsity, with Optimal Acceleration 20 2.1 Introduction 20 2.2 Unification of Algorithms LV and CV (g ≡ 0) 30 2.2.1 Relation between Algorithms LV and CV 30 2.2.2 Unified algorithm class 34 2.2.3 Convergence analysis 35 2.3 Optimal acceleration 39 2.3.1 Algorithms 40 2.3.2 Convergence analysis 41 2.4 Stochastic optimal acceleration 45 2.4.1 Algorithm 45 2.4.2 Convergence analysis 47 2.5 Numerical experiments 50 2.5.1 Model problems 50 2.5.2 Convergence behavior 52 2.5.3 Scalability 62 2.6 Discussion 63 Chapter 3 Towards Unified Programming for High-Performance Statistical Computing Environments 66 3.1 Introduction 66 3.2 Related Software 69 3.2.1 Message-passing interface and distributed array interfaces 69 3.2.2 Unified array interfaces for CPU and GPU 69 3.3 Easy-to-use Software Libraries for HPC 70 3.3.1 Deep learning libraries and HPC 70 3.3.2 Case study: PyTorch versus TensorFlow 73 3.3.3 A brief introduction to PyTorch 76 3.3.4 A brief introduction to Julia 80 3.3.5 Methods and multiple dispatch 80 3.3.6 Multidimensional arrays 82 3.3.7 Matrix multiplication 83 3.3.8 Dot syntax for vectorization 86 3.4 Distributed matrix data structure 87 3.4.1 Distributed matrices in PyTorch: distmat 87 3.4.2 Distributed arrays in Julia: MPIArray 90 3.5 Examples 98 3.5.1 Nonnegative matrix factorization 100 3.5.2 Positron emission tomography 109 3.5.3 Multidimensional scaling 113 3.5.4 L1-regularized Cox regression 117 3.5.5 Genome-wide survival analysis of the UK Biobank dataset 121 3.6 Discussion 126 Chapter 4 Conclusion 131 Appendix A Monotone Operator Theory 134 Appendix B Proofs for Chapter II 139 B.1 Preconditioned forward-backward splitting 139 B.2 Optimal acceleration 147 B.3 Optimal stochastic acceleration 158 Appendix C AWS EC2 and ParallelCluster 168 C.1 Overview 168 C.2 Glossary 169 C.3 Prerequisites 172 C.4 Installation 173 C.5 Configuration 173 C.6 Creating, accessing, and destroying the cluster 178 C.7 Installation of libraries 178 C.8 Running a job 179 C.9 Miscellaneous 180 Appendix D Code for memory-efficient L1-regularized Cox proportional hazards model 182 Appendix E Details of SNPs selected in L1-regularized Cox regression 184 Bibliography 188 국문초록 212Docto

Analysis domain model for shared virtual environments

The field of shared virtual environments, which also encompasses online games and social 3D environments, has a system landscape consisting of multiple solutions that share great functional overlap. However, there is little system interoperability between the different solutions. A shared virtual environment has an associated problem domain that is highly complex raising difficult challenges to the development process, starting with the architectural design of the underlying system. This paper has two main contributions. The first contribution is a broad domain analysis of shared virtual environments, which enables developers to have a better understanding of the whole rather than the part(s). The second contribution is a reference domain model for discussing and describing solutions - the Analysis Domain Model