58 research outputs found
DevOps for Trustworthy Smart IoT Systems
ENACT is a research project funded by the European Commission under its H2020 program. The project consortium consists of twelve industry and research member organisations spread across the whole EU. The overall goal of the ENACT project was to provide a novel set of solutions to enable DevOps in the realm of trustworthy Smart IoT Systems. Smart IoT Systems (SIS) are complex systems involving not only sensors but also actuators with control loops distributed all across the IoT, Edge and Cloud infrastructure. Since smart IoT systems typically operate in a changing and often unpredictable environment, the ability of these systems to continuously evolve and adapt to their new environment is decisive to ensure and increase their trustworthiness, quality and user experience. DevOps has established itself as a software development life-cycle model that encourages developers to continuously bring new features to the system under operation without sacrificing quality. This book reports on the ENACT work to empower the development and operation as well as the continuous and agile evolution of SIS, which is necessary to adapt the system to changes in its environment, such as newly appearing trustworthiness threats
Network Security Automation
L'abstract è presente nell'allegato / the abstract is in the attachmen
Extending the Exposure Score of Web Browsers by Incorporating CVSS
When browsing the Internet, HTTP headers enable both clients and servers send extra data in their requests or responses such as the User-Agent string. This string contains information related to the sender’s device, browser, and operating system. Yet its content differs from one browser to another. Despite the privacy and security risks of User-Agent strings, very few works have tackled this problem. Our previous work proposed giving Internet browsers exposure relative scores to aid users to choose less intrusive ones. Thus, the objective of this work is to extend our previous work through: first, conducting a user study to identify its limitations. Second, extending the exposure score via incorporating data from the NVD. Third, providing a full implementation, instead of a limited prototype. The proposed system: assigns scores to users’ browsers upon visiting our website. It also suggests alternative safe browsers, and finally it allows updating the back-end database with a click of a button. We applied our method to a data set of more than 52 thousand unique browsers. Our performance and validation analysis show that our solution is accurate and efficient. The source code and data set are publicly available here [4].</p
Recent Advances in Social Data and Artificial Intelligence 2019
The importance and usefulness of subjects and topics involving social data and artificial intelligence are becoming widely recognized. This book contains invited review, expository, and original research articles dealing with, and presenting state-of-the-art accounts pf, the recent advances in the subjects of social data and artificial intelligence, and potentially their links to Cyberspace
A Scalable Edge-Centric System Design for Camera Networks to aid Situation Awareness Applications
The ubiquity of cameras in our environment coupled with advances in computer vision and machine learning has enabled several novel applications combining sensing, processing, and actuation. Often referred to as situation awareness applications, they span a variety of domains including safety (e.g., surveillance), retail (e.g., drone delivery), and transportation (e.g., assisted/autonomous driving). There is a perfect storm of technology enablers that have come together making it a ripe time for realizing a smart camera system at the edge of the network to aid situation awareness applications. There are two types of smart camera systems, live processing at ingestion time and post-mortem video analysis. Live processing features a more timely response when the queries are known ahead of time. At the same time, post-mortem analysis fits the exploratory analysis where the queries (or the parameters of queries) are not known in advance. Various situation awareness applications can benefit from either type of the smart camera system or even both. There is prior art which are mostly standalone techniques to facilitate camera processing. For example, efficient live camera processing frameworks feature the partition of the video analysis tasks and the placement of these tasks across Edge and Cloud. Databases for building efficient query processing systems on archived videos feature modern techniques (e.g., filters) for accelerating video analytics.
This dissertation research has been looking into both types of smart camera systems (i.e., live processing at ingestion time and postmortem exploratory video analysis) for various situation awareness applications. Precisely, this dissertation seeks to fill the void left by prior art by asking these questions:
1. What are the necessary system components for a geo-distributed camera system and how best to architect them for scalability?
2. Given the limited resource capacity of the edge, how best to orchestrate the resources for live camera processing at video ingestion time?
3. How best to leverage traditional database management optimization techniques for post-mortem video analysis?
To aid various situation awareness applications, this dissertation proposes a “Scalable-by-Design” approach to designing edge-centric systems for camera networks, efficient resource orchestration for live camera processing at ingestion time, and a postmortem video engine featuring reuse for exploratory video analytics in a scalable edge-centric system for camera networks.Ph.D
Law and Policy for the Quantum Age
Law and Policy for the Quantum Age is for readers interested in the political and business strategies underlying quantum sensing, computing, and communication. This work explains how these quantum technologies work, future national defense and legal landscapes for nations interested in strategic advantage, and paths to profit for companies
An ASP-Based Approach to Scheduling Pre-operative Assessment Clinic
The problem of scheduling Pre-Operative Assessment Clinic (PAC) consists of assigning patients to a day for the exams needed before a surgical procedure, taking into account patients with different priority levels, due dates, and operators availability. Realizing a satisfying schedule is of upmost importance for a clinic, since delay in PAC can cause delay in the subsequent phases, causing a decrease in patients’ satisfaction. In this paper, we divide the problem in two sub-problems: In the first sub-problem patients are assigned to a day taking into account a default list of exams; then, in the second sub-problem, having the actual list of exams needed by each patient, we use the results of the first sub-problem to assign a starting time to each exam. We first present a mathematical formulation for both problems. Then, we present solutions based on Answer Set Programming (ASP): The first solution is a genuine ASP encoding of the sub-problems, while the second introduces domain-specific optimizations. Experiments show that both solutions provide satisfying results in short time, while the second is able to prove optimality faster
Collected Papers (on Neutrosophic Theory and Applications), Volume VIII
This eighth volume of Collected Papers includes 75 papers comprising 973 pages on (theoretic and applied) neutrosophics, written between 2010-2022 by the author alone or in collaboration with the following 102 co-authors (alphabetically ordered) from 24 countries: Mohamed Abdel-Basset, Abduallah Gamal, Firoz Ahmad, Ahmad Yusuf Adhami, Ahmed B. Al-Nafee, Ali Hassan, Mumtaz Ali, Akbar Rezaei, Assia Bakali, Ayoub Bahnasse, Azeddine Elhassouny, Durga Banerjee, Romualdas Bausys, Mircea Boșcoianu, Traian Alexandru Buda, Bui Cong Cuong, Emilia Calefariu, Ahmet Çevik, Chang Su Kim, Victor Christianto, Dae Wan Kim, Daud Ahmad, Arindam Dey, Partha Pratim Dey, Mamouni Dhar, H. A. Elagamy, Ahmed K. Essa, Sudipta Gayen, Bibhas C. Giri, Daniela Gîfu, Noel Batista Hernández, Hojjatollah Farahani, Huda E. Khalid, Irfan Deli, Saeid Jafari, Tèmítópé Gbóláhàn Jaíyéolá, Sripati Jha, Sudan Jha, Ilanthenral Kandasamy, W.B. Vasantha Kandasamy, Darjan Karabašević, M. Karthika, Kawther F. Alhasan, Giruta Kazakeviciute-Januskeviciene, Qaisar Khan, Kishore Kumar P K, Prem Kumar Singh, Ranjan Kumar, Maikel Leyva-Vázquez, Mahmoud Ismail, Tahir Mahmood, Hafsa Masood Malik, Mohammad Abobala, Mai Mohamed, Gunasekaran Manogaran, Seema Mehra, Kalyan Mondal, Mohamed Talea, Mullai Murugappan, Muhammad Akram, Muhammad Aslam Malik, Muhammad Khalid Mahmood, Nivetha Martin, Durga Nagarajan, Nguyen Van Dinh, Nguyen Xuan Thao, Lewis Nkenyereya, Jagan M. Obbineni, M. Parimala, S. K. Patro, Peide Liu, Pham Hong Phong, Surapati Pramanik, Gyanendra Prasad Joshi, Quek Shio Gai, R. Radha, A.A. Salama, S. Satham Hussain, Mehmet Șahin, Said Broumi, Ganeshsree Selvachandran, Selvaraj Ganesan, Shahbaz Ali, Shouzhen Zeng, Manjeet Singh, A. Stanis Arul Mary, Dragiša Stanujkić, Yusuf Șubaș, Rui-Pu Tan, Mirela Teodorescu, Selçuk Topal, Zenonas Turskis, Vakkas Uluçay, Norberto Valcárcel Izquierdo, V. Venkateswara Rao, Volkan Duran, Ying Li, Young Bae Jun, Wadei F. Al-Omeri, Jian-qiang Wang, Lihshing Leigh Wang, Edmundas Kazimieras Zavadskas
A Model-based Approach for Designing Cyber-Physical Production Systems
The most recent development trend related to manufacturing is called "Industry 4.0". It proposes to transition from "blind" mechatronics systems to Cyber-Physical Production Systems (CPPSs). Such systems are capable of communicating with each other, acquiring and transmitting real-time production data. Their management and control require a structured software architecture, which is tipically referred to as the "Automation Pyramid". The design of both the software architecture and the components (i.e., the CPPSs) is a complex task, where the complexity is induced by the heterogeneity of the required functionalities. In such a context, the target of this thesis is to propose a model-based framework for the analysis and the design of production lines, compliant with the Industry 4.0 paradigm. In particular, this framework exploits the Systems Modeling Language (SysML) as a unified representation for the different viewpoints of a manufacturing system. At the components level, the structural and behavioral diagrams provided by SysML are used to produce a set of logical propositions about the system and components under design. Such an approach is specifically tailored towards constructing Assume-Guarantee contracts. By exploiting reactive synthesis techniques, contracts are used to prototype portions of components' behaviors and to verify whether implementations are consistent with the requirements. At the software level, the framework proposes a particular architecture based on the concept of "service". Such an architecture facilitates the reconfiguration of components and integrates an advanced scheduling technique, taking advantage of the production recipe SysML model. The proposed framework has been built coupled with the construction of the ICE Laboratory, a research facility consisting of a full-fledged production line. Such an approach has been adopted to construct models of the laboratory, to virtual prototype parts of the system and to manage the physical system through the proposed software architecture
Branching strategies for mixed-integer programs containing logical constraints and decomposable structure
Decision-making optimisation problems can include discrete selections, e.g. selecting a route, arranging non-overlapping items or designing a network of items. Branch-and-bound (B&B), a widely applied divide-and-conquer framework, often solves such problems by considering a continuous approximation, e.g. replacing discrete variable domains by a continuous superset. Such approximations weaken the logical relations, e.g. for discrete variables corresponding to Boolean variables. Branching in B&B reintroduces logical relations by dividing the search space. This thesis studies designing B&B branching strategies, i.e. how to divide the search space, for optimisation problems that contain both a logical and a continuous structure.
We begin our study with a large-scale, industrially-relevant optimisation problem where the objective consists of machine-learnt gradient-boosted trees (GBTs) and convex penalty functions. GBT functions contain if-then queries which introduces a logical structure to this problem. We propose decomposition-based rigorous bounding strategies and an iterative heuristic that can be embedded into a B&B algorithm. We approach branching with two strategies: a pseudocost initialisation and strong branching that target the structure of GBT and convex penalty aspects of the optimisation objective, respectively. Computational tests show that our B&B approach outperforms state-of-the-art solvers in deriving rigorous bounds on optimality.
Our second project investigates how satisfiability modulo theories (SMT) derived unsatisfiable cores may be utilised in a B&B context. Unsatisfiable cores are subsets of constraints that explain an infeasible result. We study two-dimensional bin packing (2BP) and develop a B&B algorithm that branches on SMT unsatisfiable cores. We use the unsatisfiable cores to derive cuts that break 2BP symmetries. Computational results show that our B&B algorithm solves 20% more instances when compared with commercial solvers on the tested instances.
Finally, we study convex generalized disjunctive programming (GDP), a framework that supports logical variables and operators. Convex GDP includes disjunctions of mathematical constraints, which motivate branching by partitioning the disjunctions. We investigate separation by branching, i.e. eliminating solutions that prevent rigorous bound improvement, and propose a greedy algorithm for building the branches. We propose three scoring methods for selecting the next branching disjunction. We also analyse how to leverage infeasibility to expedite the B&B search. Computational results show that our scoring methods can reduce the number of explored B&B nodes by an order of magnitude when compared with scoring methods proposed in literature. Our infeasibility analysis further reduces the number of explored nodes.Open Acces
- …