Computer Sciences Commons^™

Intelligent Computational Argumentation For Evaluating Performance Scores In Multi-Criteria Decision Making, Xiaoqing Frank Liu, Rubal Wanchoo, Ravi Santosh Arvapally

Computer Science Faculty Research & Creative Works

Multi-Criteria decision making (MCDM), is a discipline aimed at assisting multiple stakeholders in contemplating a decision paradigm in an uncertain environment. the decision analysis to be performed involves numerous alternative positions assessed under varied criterion. a performance score is assigned for each alternative in terms of every criterion, and it represents satisfaction of the criteria by that alternative. in real applications, performance scores are sometimes hard to determine, and they are often subjective. We have developed an intelligent computational argumentation approach for dealing with the problem of uncertainty in resolving the subjective scores. in this approach, an argumentation tree is …

Investigating Impact Of Quorum Construction On Data Processing In Mobile Ad Hoc Networks, Takahiro Hara, Sanjay K. Madria, Shojiro Nishio

Computer Science Faculty Research & Creative Works

In a mobile ad hoc network (MANET), since mobility of mobile hosts causes frequent network partitioning, consistency management of data operations on replicas becomes a crucial issue. in our previous work, we have defined several consistency levels for MANET applications and designed protocols to achieve these consistency levels. These protocols are mainly based on a dynamic quorum system to cope with network partitioning and node and network failures. in this paper, we further investigate the impact of quorum construction on the system performance through simulation studies. Specifically, we change the number of mobile hosts that replicate data items, and which …

Enforcing Information Flow Security Properties In Cyber-Physical Systems: A Generalized Framework Based On Compensation, Thoshitha T. Gamage, Bruce M. Mcmillin, Thomas P. Roth

Computer Science Faculty Research & Creative Works

This paper presents a general theory of event compensation as an information flow security enforcement mechanism for Cyber-Physical Systems (CPSs). The fundamental research problem being investigated is that externally observable events in modern CPSs have the propensity to divulge sensitive settings to adversaries, resulting in a confidentiality violation. This is a less studied yet emerging concern in modern system security. A viable method to mitigate such violations is to use information flow security based enforcement mechanisms since access control based security models cannot impose restrictions on information propagation. Further, the disjoint nature of security analysis is not appropriate for systems …

Computer Software And Applications, Xiaoqing (Frank) Liu, Carl K. Chang, T. Ming Jiang

Computer Science Faculty Research & Creative Works

No abstract provided.

A Framework For Automated Enrichment Of Functionally Significant Inverted Repeats In Whole Genomes, Cyriac Kandoth, Fikret ErçAl, Ronald L. Frank

Computer Science Faculty Research & Creative Works

Background: RNA transcripts from genomic sequences showing dyad symmetry typically adopt hairpin-like, cloverleaf, or similar structures that act as recognition sites for proteins. Such structures often are the precursors of non-coding RNA (ncRNA) sequences like microRNA (miRNA) and small-interfering RNA (siRNA) that have recently garnered more functional significance than in the past. Genomic DNA contains hundreds of thousands of such inverted repeats (IRs) with varying degrees of symmetry. But by collecting statistically significant information from a known set of ncRNA, we can sort these IRs into those that are likely to be functional.

Results: A novel method was developed to …

Interference-Aware Multipath Routing And Link Rate Control In Multihop Wireless Networks, Maggie X. Cheng, Xuan Gong

Computer Science Faculty Research & Creative Works

In multihop wireless networks, end-to-end throughput is often hard to predict and is even harder to optimize due to the effect of interference. to date there is no precise result other than asymptotic bounds for this question: if there is no routing information given, what is the maximum throughput of a network using uncoordinated transmission such as IEEE 802.11 MAC? This paper attempts to address this question for a given network with specific traffic demand. in this paper we use a cross-layer design scheme to optimize network performance. the paper includes a basic linear programming model, from which the routing …

Cycle Life Prediction Of Battery-Supercapacitor Hybrids Using Artificial Neural Networks, Thomas Weigert, Q. Tian, K. Lian

Computer Science Faculty Research & Creative Works

The cycle life of batteries and battery-supercapacitor hybrid systems was predicted using artificial neural networks. The presented techniques are able to predict the cycle life of a device based on a short (around 4% of the average cycle life) initial segment of the discharge curve. the prediction showed good performance with a correlation coefficient above 0.95. We were able to improve the predication further by considering readily available measurements of the device and usage. ©The Electrochemical Society.

Exploring Query Optimization In Programming Codes By Reducing Run-Time Execution, Venkata Krishna Suhas Nerella, Swetha Surapaneni, Sanjay Kumar Madria, Thomas Weigert

Computer Science Faculty Research & Creative Works

Object querying is an abstraction of operations over collections, whereas manual implementations are performed at low level which forces the developers to specify how a task must be done. Some object-oriented languages allow the programmers to express queries explicitly in the code, which are optimized using the query optimization techniques from the database domain. in this regard, Java Query Language has been developed that allows object querying and performs the query optimization at run-time. Therefore, only one problem is how to reduce the task of query optimization at run-time as much as possible within the Java Query Language system. in …

Event Coverage In Sparse Mobile Sensor Networks, Mark Snyder, Sriram Chellappan

Computer Science Faculty Research & Creative Works

Autonomous mobile sensors are employed with ever-increasing frequency, in applications ranging from search and rescue, detection of forest fires, and battlefield surveillance. in this paper, we consider a representative surveillance problem wherein a sparse number of mobile sensors are expected to cover events of interest in a deployment field. Each event appears for a certain time and then disappears. Furthermore, the location of each event and its duration is unknown. in this paper, we design a sensor movement strategy based on efficient traversal in the network to fulfill two objectives: maximizing event detection and minimizing detection delay. Analysis and simulations …

Directed Coverage In Wireless Sensor Networks: Concept And Quality, Xiaole Bai, Lei Ding, Jin Teng, Sriram Chellappan, Changqing Xu, Dong Xuan

Computer Science Faculty Research & Creative Works

In this paper, we introduce a new type of coverage for wireless sensor networks, called Directed Coverage (D-Coverage). Basically, D-Coverage is the coverage provided by a sensor network monitoring an area between two boundaries, through which the intruder attempts to penetrates the area. We also study how to measure the quality of D-Coverage. Our first evaluation approach is a projection-Based simple approach, while our second approach is a more comprehensive Markov chain-based approach. Our evaluation approaches can accurately evaluate the quality and provide good guidelines for sensor network deployment and run-time repair. ©2009 IEEE.

Recursive Decomposition Of Progress Graphs, David A. Cape, Bruce M. Mcmillin, Benjamin W. Passer, Mayur Thakur

Computer Science Faculty Research & Creative Works

Search of a state transition system is traditionally how deadlock detection for concurrent programs has been accomplished. This paper examines an approach to deadlock detection that uses geometric semantics involving the topo-logical notion of dihomotopy to partition the state space into components; after that the reduced state space is exhaustively searched. Prior work partitioned the state space inductively. in this paper we show that a recursive technique provides greater reduction of the size of the state transition system and therefore more efficient deadlock detection. If the preprocessing can be done efficiently, then for large problems we expect to see more …

Privacy Preserving Portable Health Record (P³Hr), Pavan Roy Marupally, Vamsi Paruchuri, Sriram Chellappan

Computer Science Faculty Research & Creative Works

Personal health records (PHRs) offer significant potential to stimulate transformational changes in health care delivery and self-care by patients. There is a gap between today's personal health records (PHRs) and what patients say they want and need from this electronic tool for managing their health information. Current barriers to PHR adoption among patients include cost, concerns that information is not protected or private, inconvenience, design shortcomings, and the inability to share information across organizations. We propose a novel architecture to bridge the gap based on Privacy Preserving Portable Health Record(P³HR), a device that incorporates a smart card into …

Protein Secondary Structure Prediction Using Parallelized Rule Induction From Coverings, Leong Lee, Cyriac Kandoth, Jennifer Leopold, Ronald L. Frank

Computer Science Faculty Research & Creative Works

Protein 3D structure prediction has always been an important research area in bioinformatics. In particular, the prediction of secondary structure has been a well-studied research topic. Despite the recent breakthrough of combining multiple sequence alignment information and artificial intelligence algorithms to predict protein secondary structure, the Q3 accuracy of various computational prediction algorithms rarely has exceeded 75%. In a previous paper [1], this research team presented a rule-based method called RT-RICO (Relaxed Threshold Rule Induction from Coverings) to predict protein secondary structure. The average Q3 accuracy on the sample datasets using RT-RICO was 80.3%, an improvement over comparable computational methods. …

Angular Mobility Assisted Coverage In Directional Sensor Networks, Cyriac Kandoth, Sriram Chellappan

Computer Science Faculty Research & Creative Works

In this paper, we consider the issue of angular mobility assisted coverage enhancement in directional camera sensor networks. in our model, each sensor can visually capture (i.e. sense) events within a sector in its field of view and can also rotate about a fixed axis to enhance its coverage. the problem we particularly address is how to enhance blanket coverage leveraging angular mobility of the sensors in the network starting from an arbitrary initial deployment. the core idea of our algorithm, called the Face Away algorithm, is to use the known directions of neighboring sensors to find the direction with …

A System For Detecting Xml Similarity In Content And Structure Using Relational Database, Waraporn Viyanon, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

In this paper, we describe a system incorporating an improved technique that detects the similarity of two XML documents based on content and structure similarity using keys. the technique consists of three major components: A subtree generator and validator, a key generator, and similarity components that compare content and structure of the XML documents. First, an XML document is stored in a relational database and extracted into small subtrees using leaf-node parents. the leaf-node parents are considered as a root of a subtree which is then recursively traversed bottom-up for matching. Second, a possible key(s) is identified in order to …

The Security Implication Of Multiple Observers In A Distributed System, Derek P. Ditch, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

Confidentiality is an often overlooked, yet crucial point in the security analysis of a system. infrastructures take for granted that confidentiality is maintained through obfuscation by dissemination of information. This dissemination does indeed maintain the confidentiality of the system when only a small portion of the information can be obtained by an outside observer. However, when multiple observers collaboratively make observations, the confidential information can be revealed or even just partially revealed. If a team of attackers on a system can deduce enough information to successfully perform a crippling attack, the system could not be considered secure. This paper will …

Model-Checking Bndc Properties In Cyber-Physical Systems, Ravi Akella, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

In Cyber-physical systems, which are the integrations of computational and physical processes, it is hard to realize certain security properties. Fundamentally, physically observable behavior leads to violations of confidentiality. We focus on analyzing certain non-interference-based security properties to ensure that interactions between the cyber and physical processes preserve confidentiality. a considerable barrier to this analysis is representing the physical system's interactions. in this paper, these physical system properties are encoded into a discrete event system and the combined Cyber-physical system is described using the process algebra SPA. the model checker, CoPS shows BNDC (Bisimulation based Non-Deducibility on Compositions) properties, which …

Dihomotopic Reduction Used In Deadlock Detection, David A. Cape, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

Deadlock detection for concurrent programs has traditionally been accomplished by symbolic methods or by search of a state transition system. We examine an approach that uses geometric semantics involving the topological notion of dihomotopy to partition the state-space into components, after which the reduced state-space is exhaustively searched. Prior work partitioned the state-space inductively, but in this paper, we show that a recursive technique provides greater reduction of the size of the state transition system. as a result, we expect to see more efficient deadlock detection and eventually more efficient verification of some temporal properties for large problems if the …

Design Of Soa Based Web Service Systems Using Qfd For Satisfaction Of Quality Of Service Requirements, Xiaoqing Frank Liu, Lianzhang Zhu

Computer Science Faculty Research & Creative Works

Service-Oriented Architecture (SOA) is a loosely coupled architecture designed to meet business needs of an organization. It is becoming a trend for system development and integration where systems group functionality around business processes. Although SOA does not require Web services, Web services are based on accepted standards and drive SOA to the mainstream. There are at least two challenges with quality management of SOA based Web service systems. One of them is how to link explicitly its technical capability with customers' needs to satisfy customers' functional and nonfunctional requirements. the second is how to determine targets of Web service technical …

On Transport Protocol Performance Measurement Over 10gbps High Speed Optical Networks, Yixin Wu, Suman Kumar, Seung Jong Park

Computer Science Faculty Research & Creative Works

With the integration of IP and optical technology, fast optical network (of the order of 10Gbps) has emerged to support international research cooperation such as massive scientific data transfer and next generation Internet related research. Therefore, it is important to analyze the measurement issues to guide the high-speed transport protocol research for high-speed optical network of the order of 10Gbps. The objectives of this paper are as follows: i) determine the suitability of TCP parameters such as Jumbo Frame size, TCP sender and receiver buffer sizes; ii) evaluate TCP performance measurement tools and emulation tools over 10Gbps high speed optical …

Working Session: Using Eye-Tracking To Understand Program Comprehension, Yann Gaël Guéhéneuc, Huzefa Kagdi, Jonathan I. Maletic

Computer Science Faculty Research & Creative Works

The working session focuses on the use of eye-tracking technology to assess, understand, and evaluate tools and techniques for program comprehension. an introduction to the technology and tools of eye-tracking will be presented. a discussion of how these tools augment existing evaluation mechanism in the context of program comprehension will follow. Research directions and open problems will be a main topic. © 2009 IEEE.

Contribution Based Priority Assessment In A Web-Based Intelligent Argumentation Network For Collaborative Software Development, Xiaoqing Frank Liu, Maithili Satyavolu, Ming-Chuan Leu

Computer Science Faculty Research & Creative Works

Decision making is an important aspect in a collaborative software development process which involves a complex process of conflict resolution. the priority of the participants plays a vital role in conflict resolution as the decision-making process involves many participants from multiple perspectives. the priority assessment methods used in the process so far are usually static in nature, i.e., the priorities of the participants remain constant throughout the decision-making process. in order to make the collaborative system closer to real world scenarios, we incorporate dynamic priority assessment into a web-Based collaborative system based on intelligent computational argumentation, which was developed in …

Complexities Of Information Security In Cyber-Physical Power Systems, Bruce Mcmillin

Computer Science Faculty Research & Creative Works

Cyber-Physical Power Systems consist of significant cyber components that mange the physical electric power infrastructure under distributed control of power electronics devices. This represents a departure from more centralized SCADA-type control. NERC Critical Infrastructure Protection standards emphasize the need to protect the power infrastructure from both cyber and physical attacks. Complex interactions between the cyber and physical worlds introduce new vulnerabilities that go beyond those found in the purely computer world. in this paper, some of these new vulnerabilities are described and a direction is suggested to determine and mitigate these vulnerabilities. © 2009 IEEE.

Secure Hierarchical Data Aggregation In Wireless Sensor Networks, Julia Albath, Sanjay Madria

Computer Science Faculty Research & Creative Works

Communication in wireless sensor networks uses the majority of a sensor's limited energy. using aggregation in wireless sensor network reduces the overall communication cost. Security in wireless sensor networks entails many different challenges. Traditional end-to-end security is not suitable for use with in-network aggregation. a corrupted sensor has access to the data and can falsify results. Additively homomorphic encryption allows for aggregation of encrypted values, with the result being the same as the result when unencrypted data was aggregated. using public key cryptography, digital signatures can be used to achieve integrity. We propose a new algorithm using homomorphic encryption and …

Node Security In Hierarchical Sensor Networks: Distribution Of Functions Versus Keys, Biswajit Panja, Sanjay Madria

Computer Science Faculty Research & Creative Works

Secure communication involving cluster heads in a sensor network is vital as they are responsible for data aggregation and for taking important decisions in their groups. in this article, we propose a scheme for secure communication via such nodes in a sensor network. in our approach, the base station provides a function to the cluster head of each group, which is used to compute the key for the secure communication with the base station. the protocol is first elucidated for a fixed cluster head in each group and later it is extended for dynamic cluster heads. Each function is computed …

T-Plausibility: Semantic Preserving Text Sanitization, Wei Jiang, Mummoorthy Murugesan, Chris Clifton, Luo Si

Computer Science Faculty Research & Creative Works

Text documents play significant roles in decision making and scientific research. Under federal regulations, documents (e.g., pathology records) containing personally identifiable information cannot be shared freely, unless properly sanitized. Generally speaking, document sanitization consists of finding and hiding personally identifiable information. The first task has received much attention from the research community, but the main strategy for the second task has been to simply remove personal identifiers and very sensitive information (e.g., diseases and treatment). It is not hard to see that if important information (e.g., diagnoses and personal medical histories) is completely removed from pathology records, these records are …

Joint Routing And Link Rate Allocation Under Bandwidth And Energy Constraints In Sensor Networks, Maggie Cheng, Xuan Gong, Lin Cai

Computer Science Faculty Research & Creative Works

In sensor networks, both energy and bandwidth are scarce resources. in the past, many energies efficient routing algorithms have been devised in order to maximize network lifetime, in which wireless link bandwidth has been optimistically assumed to be sufficient. This article shows that ignoring the bandwidth constraint can lead to infeasible routing solutions. as energy constraint affects how data should be routed, link bandwidth also affects not only the routing topology but also the allowed data rate on each link. in this paper, we discuss the sufficient condition on link bandwidth that makes a routing solution feasible, then provide mathematical …

Consistency Management Strategies For Data Replication In Mobile Ad Hoc Networks, Takahiro Hara, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

In a mobile ad hoc network, data replication drastically improves data availability. However, since mobile hosts' mobility causes frequent network partitioning, consistency management of data operations on replicas becomes a crucial issue. In such an environment, the global consistency of data operations on replicas is not desirable by many applications. Thus, new consistency maintenance based on local conditions such as location and time need to be investigated. This paper attempts to classify different consistency levels according to requirements from applications and provides protocols to realize them. We report simulation results to investigate the characteristics of these consistency protocols in a …

Incentive Based Routing Protocol For Mobile Peer To Peer Networks, Anil Jade, Sanjay Kumar Madria, Mark Linderman

Computer Science Faculty Research & Creative Works

Incentive models are becoming increasingly popular in Mobile Peer to Peer Networks (M-P2P) as these models entice node participation in return for a virtual currency to combat free riding and to effectively manage constraint resources in the network. Many routing protocols proposed are based on best effort data traffic policy, such as the shortest route selection (hop minimization). Using virtual currency to find a cost effective optimal route from the source to the destination, while considering Quality of Service (QoS) aspects such as bandwidth and service capacity constraints for data delivery, remains a challenging task due to the presence of …

Em Enforcing Information Flow Properties Using Compensating Events, Thoshitha T. Gamage, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

Deeply embedded infrastructures are pervasive systems that have significant cyber and physical components, interacting with each other in complex ways. These interactions can violate a system's security policy leading to unintended information flow. Execution Monitor (EM) enforceability is the concept of monitoring a system during runtime for any security policy violations and terminating the execution if such violations occur. EM enforceable mechanisms require that the properties being enforced be restricted to safety properties. Information flow properties are considered non-EM enforceable because they cannot be defined using safety properties. to bridge this gap, prior work has presented a monitor that predicts …