Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Security of Data (2)
- Code Generation (1)
- Computational Argumentation (1)
- Conflict Resolution (1)
- Data Dissemination (1)
-
- Data Items (1)
- Data Structures (1)
- Dempster's Combination Rule (1)
- Developers (1)
- Differential equations, Partial (1)
- Economics (1)
- Evidence Based Decision Making (1)
- Flexible AC Transmission Systems (1)
- Flexible AC transmission systems (1)
- HIL (1)
- Localization (1)
- Message Authentification (1)
- Metadata (1)
- Military Communication (1)
- Misuse Cases (1)
- Mobile Ad Hoc Networks (1)
- Mobile Agents (1)
- Mobile Computing (1)
- Mobile Peer to Peer Computing (1)
- Mobile Radio (1)
- Model-Driven Engineering (1)
- Multi-Agent Systems (1)
- Optical Fibre Networks (1)
- Pharmaceutical industry (1)
- Power (1)
Articles 1 - 16 of 16
Full-Text Articles in Physical Sciences and Mathematics
Pas: Predicate-Based Authentication Services Against Powerful Passive Adversaries, Sriram Chellappan, Xiaole Bai, Wenjun Gu, Xun Wang, Dong Xuan, Bin Ma
Pas: Predicate-Based Authentication Services Against Powerful Passive Adversaries, Sriram Chellappan, Xiaole Bai, Wenjun Gu, Xun Wang, Dong Xuan, Bin Ma
Computer Science Faculty Research & Creative Works
Securely authenticating a human user without assistance from any auxiliary device in the presence of powerful passive adversaries is an important and challenging problem. Passive adversaries are those that can passively monitor, intercept, and analyze every part of the authentication procedure, except for an initial secret shared between the user and the server. In this paper, we propose a new secure authentication scheme called predicate-based authentication service (PAS). In this scheme, for the first time, the concept of a predicate is introduced for authentication. We conduct analysis on the proposed scheme and implement its prototype system. Our analytical data and …
A Systematic Framework For Structured Object-Oriented Security Requirements Analysis In Embedded Systems, Sojan Markose, Xiaoqing Frank Liu, Bruce M. Mcmillin
A Systematic Framework For Structured Object-Oriented Security Requirements Analysis In Embedded Systems, Sojan Markose, Xiaoqing Frank Liu, Bruce M. Mcmillin
Computer Science Faculty Research & Creative Works
The primary goal of this paper is to develop a structured objectoriented security requirements analysis methodology for the elicitation and analysis of security requirements in embedded systems. There are several approaches to elicit, analyze and specify security requirements in embedded systems ranging from formal mathematical models for proof of certain security properties to informal methods that are easily understood. Applicability of formal security models is limited because they are complex and it is time consuming to develop. On the other hand, informal security requirements analysis methods are not integrated with conceptual models in requirements analysis, and although both external and …
Implementation And Analysis Of Practical Algorithm For Data Security, Willi Ballenthin, F. Kacani, Julia Albath, Sanjay Kumar Madria
Implementation And Analysis Of Practical Algorithm For Data Security, Willi Ballenthin, F. Kacani, Julia Albath, Sanjay Kumar Madria
Computer Science Faculty Research & Creative Works
In this paper, we present a complete implementation of the Practical Algorithm for Data Security (PADS) proposed by Albath et al., an end-to-end security scheme employing symmetric key encryption. The implementation takes full advantage of the modular design of the TinyOS environment. The simplicity of the algorithm allows for efficient implementation in hardware, a requirement for resource constrained devices. The protocol adds only four bytes of data per packet, on par with industry standards. Simulation and empirical results of the scheme are also provided. The analysis shows that the Practical Algorithm for Data Security is superior to standard security schemes.
Secure Communications Over Hybrid Military Networks, Vamsi Paruchuri, Arjan Durresi, Sriram Chellappan
Secure Communications Over Hybrid Military Networks, Vamsi Paruchuri, Arjan Durresi, Sriram Chellappan
Computer Science Faculty Research & Creative Works
Stealthiness can be described as a disposition to be sly and to do things surreptitiously. This paper presents a new architecture for flexible and secure networking in battlefields that enables stealthy and covert communication in the presence of node mobility. Our architecture is based on the combination of optical (fiber) and wireless links. Our objective is to be able to carry on undeterred communication without the attack/eavesdropping nodes being able to detect the presence of any communication. This objective is not only crucial for successful completion of the operation, but also for the safety of our mobile nodes, by not …
Localizing Sensor Networks In Un-Friendly Environments, Sriram Chellappan, Vamsi Paruchuri, Dylan Mcdonald, Arjan Durresi
Localizing Sensor Networks In Un-Friendly Environments, Sriram Chellappan, Vamsi Paruchuri, Dylan Mcdonald, Arjan Durresi
Computer Science Faculty Research & Creative Works
In this paper, we study the issue of defending against a wireless sensor network (WSN) that has been deployed by a malicious enemy agent in an area of interest to us. While there can be many approaches to defend against maliciously deployed WSNs, we propose the design of a localization centric approach. Specifically, the problem we address is: given an enemy deployed WSN in an area of interest to us, how can we determine locations of the sensors without co-operating with the sensors themselves during localization. In our approach, we employ a physically mobile agent called the localizer (e.g., a …
Who Can Help Me With This Source Code Change, Huzefa Kagdi, Maen Hammad, Jonathan I. Maletic
Who Can Help Me With This Source Code Change, Huzefa Kagdi, Maen Hammad, Jonathan I. Maletic
Computer Science Faculty Research & Creative Works
An approach to recommend a ranked list of developers to assist in performing software changes to a particular file is presented. The ranking is based on change expertise, experience, and contributions of developers, as derived from the analysis of the previous commits involving the specific file in question. The commits are obtained from a software system's version control repositories (e.g., Subversion). The basic premise is that a developer who has substantially contributed changes to specific files in the past is likely to best assist for their current or future change. Evaluation of the approach on a number of open source …
An Open Framework For Highly Concurrent Real-Time Hardware-In-The-Loop Simulation, Ryan C. Underwood, Bruce M. Mcmillin, Mariesa Crow
An Open Framework For Highly Concurrent Real-Time Hardware-In-The-Loop Simulation, Ryan C. Underwood, Bruce M. Mcmillin, Mariesa Crow
Computer Science Faculty Research & Creative Works
Hardware-in-the-loop (HIL) real-time simulation is becoming a significant tool in prototyping complex, highly available systems. The HIL approach permits testing of hardware prototypes of components that would be extremely costly or difficult to test in the deployed environment. In power system simulation, key issues are the ability to wrap the systems of equations (such as Partial Differential Equations) describing the deployed environment into real-time software models, provide low synchronization overhead between the hardware and software, and reduce reliance on proprietary platforms. This paper introduces an open source HIL simulation framework that can be ported to any standard Unix-like system on …
Automated Code Generation For Industrial-Strength Systems, Thomas Weigert, Frank Weil, Aswin Van Den Berg, Paul Dietz, Kevin Marth
Automated Code Generation For Industrial-Strength Systems, Thomas Weigert, Frank Weil, Aswin Van Den Berg, Paul Dietz, Kevin Marth
Computer Science Faculty Research & Creative Works
Model-driven engineering proposes to develop software systems by first creating an executable model of the system design and then transforming this model into an implementation. This paper discusses the design of an automatic code generation system that transforms such models into product implementations for highly reliable, industrial-strength systems. It provides insights, practical considerations, and lessons learned when developing code generators for applications that must conform to the constraints imposed by real-world, high-performance systems. Automatic code generation has played a large part in dramatically increasing both the quality and the reliability of software for these systems.
Transactional Agents For Pervasive Computing, Machigar Ongtang, A. R. Hurson, Yu Jiao
Transactional Agents For Pervasive Computing, Machigar Ongtang, A. R. Hurson, Yu Jiao
Computer Science Faculty Research & Creative Works
Pervasive computing enables seamless integration of computing technology into everyday life to make upto- date information and services proactively available to the users based on their needs and behaviors. We aim to develop a transaction management scheme as a pertinent component for such environment supported by either structured or ad hoc networks. We propose Transactional Agents for Pervasive COmputing (TAPCO), which utilizes a dynamic hierarchical meta data structure that captures the semantic contents of the underlying heterogeneous data sources. Mobile agents process the transactions collaboratively, to preserve ACID properties without violating local autonomy of the data sources. TAPCO is simulated …
Security Property Violation In Cps Through Timing, Han Tang, Bruce M. Mcmillin
Security Property Violation In Cps Through Timing, Han Tang, Bruce M. Mcmillin
Computer Science Faculty Research & Creative Works
Security in a cyber-physical system (CPS) is not well understood. Interactions between components in the cyber and physical domains lead to unintended information flow. This paper makes use of formal information flow models to describe leakage in a model CPS, the Cooperating FACTS Power System. Results show that while a casual observer cannot ascertain confidential internal information, when application semantics, including timing, are considered, this confidentiality is lost. Model checking is used to verify the result. The significance of the paper is in showing an example of the complex interactions that occur between the Cyber and Physical domains and their …
Incorporation Of Evidences Into An Intelligent Computational Argumentation Network For A Web-Based Collaborative Engineering Design System, Xiaoqing Frank Liu, Ekta Khudkhudia, Ming-Chuan Leu
Incorporation Of Evidences Into An Intelligent Computational Argumentation Network For A Web-Based Collaborative Engineering Design System, Xiaoqing Frank Liu, Ekta Khudkhudia, Ming-Chuan Leu
Computer Science Faculty Research & Creative Works
Conflicts among the stakeholders are unavoidable in the process of collaborative engineering design. Resolution of these conflicts is a challenging task. In our previous research, a web based intelligent collaborative system was developed which provides decision-making support, using computational argumentation techniques. Enhancements were done to this system to incorporate the priorities of the stakeholders and to detect arguments that self conflict. As an effort to make this system more effective and more objective in the process of decision making, we develop a method to assess the effect of evidences in the argumentation network, using Dempster-Shafer theory of evidence and fuzzy …
Updated Data Dissemination For Applications With Time Constraints In Mobile Ad Hoc Networks, Takahiro Hara, Sanjay Kumar Madria
Updated Data Dissemination For Applications With Time Constraints In Mobile Ad Hoc Networks, Takahiro Hara, Sanjay Kumar Madria
Computer Science Faculty Research & Creative Works
In our previous work, we proposed few updated data dissemination methods to refresh old replicas efficiently in mobile ad hoc networks. These methods disseminate updated data items every time when owners of original data items update the items or every time two mobile hosts are newly connected with each other and this causes heavy traffic in the entire network. In this paper, we assume applications that periodically execute read operations with strict deadlines to data items and propose few alternative updated data dissemination methods. These methods reduces the traffic for data dissemination while keeping a high success ratio for read …
Economic-Based Incentive Schemes For Dynamic Data Management In Mobile P2p Computing, Sanjay Kumar Madria, Anirban Mondal
Economic-Based Incentive Schemes For Dynamic Data Management In Mobile P2p Computing, Sanjay Kumar Madria, Anirban Mondal
Computer Science Faculty Research & Creative Works
Data management in mobile peer to peer (M-P2P) systems needs dynamic data management due to mobility and fragile wireless connection connecting resource constraint devices. Traditional methods of data management and services in mobile P2P environment generally assume all peers to cooperate. Since peer activities in M-P2P are not generally monitored, users assume that they are free to use the resources anyway they like. Under this feeling of freedom, a subset of users (free riders) begins to consume much more resources available on M-P2P than they wish to contribute. In addition, due to the dynamic nature of moving hosts, topology changes …
Garuda: Achieving Effective Reliability For Downstream Communication In Wireless Sensor Networks, Seung Jong Park, Ramanuja Vedantham, Raghupathy Sivakumar, Ian F. Akyildiz
Garuda: Achieving Effective Reliability For Downstream Communication In Wireless Sensor Networks, Seung Jong Park, Ramanuja Vedantham, Raghupathy Sivakumar, Ian F. Akyildiz
Computer Science Faculty Research & Creative Works
There exist several applications of sensor networks where the reliability of data delivery can be critical. Although the redundancy inherent in a sensor network might increase the degree of reliability, it by no means can provide any guaranteed reliability semantics. In this paper, we consider the problem of reliable sink-to-sensors data delivery. We first identify several fundamental challenges that need to be addressed and are unique to the environment of wireless sensor networks. We then propose a scalable framework for reliable downstream data delivery that is specifically designed to both address and leverage the characteristics of the wireless sensor networks …
Energy Efficient Correlated Data Aggregation For Wireless Sensor Networks, Seung Jong Park, Raghupathy Sivakumar
Energy Efficient Correlated Data Aggregation For Wireless Sensor Networks, Seung Jong Park, Raghupathy Sivakumar
Computer Science Faculty Research & Creative Works
Data aggregations from Sensors to a sink in wireless sensor networks (WSNs) are typically characterized by correlation along the spatial, semantic, and temporal dimensions. Exploiting such correlation when performing data aggregation can result in considerable improvements in the bandwidth and energy performance of WSNs. For the sensors-to-sink data delivery, we first explore two theoretical solutions: the shortest path tree (SPT) and the minimum spanning tree (MST) approaches. To approximate the optimal solution (MST) in case of perfect correlation among data, we propose a new aggregation which combines the minimum dominating set (MDS) with the shortest path tree (SPT) in order …
Web-Based Service Exchange System For Agents And Humans Alike, Evens Jean, Machigar Ongtang, A. R. Hurson
Web-Based Service Exchange System For Agents And Humans Alike, Evens Jean, Machigar Ongtang, A. R. Hurson
Computer Science Faculty Research & Creative Works
Semantic Web research aims at bridging the gap between how humans and agents process information readily available on the Internet. One of the great challenges to this goal lies in the fact that humans, contrary to agents, can extract the meaning of words based on its context. This work introduces a service exchange system for the Web that allows agents to intelligently process information, as would humans. This is achieved by the use of thesauri to help agents resolve semantic heterogeneity in the information being processed. The framework for the exchange system has been realized under the aglet platform on …