Digital Commons Network^™

Implications Of Test-Driven Development: A Test Study, Reid Kaufmann, David S. Janzen

Computer Science and Software Engineering

A Spring 2003 experiment examines the claims that test-driven development or test-first programming improves software quality and programmer confidence. The results indicate support for these claims and inform larger future experiments.

A Framework For Management Of Concurrent Xml Markup, Alex Dekhtyar, Ionut E. Iacob

Computer Science and Software Engineering

The problem of concurrent markup hierarchies in XML encodings of documents has attracted attention of a number of humanities researchers in recent years. The key problem with using concurrent hierarchies to encode documents is that markup in one hierarchy is not necessarily well-formed with respect to the markup in another hierarchy. Previously proposed solutions to this problem rely on the XML expertise of the editors and their ability to maintain correct DTDs for complex markup languages. In this paper, we approach the problem of maintenance of concurrent XML markup from the Computer Science perspective. We propose a framework that allows …

Validating Digital Signatures Without Ttp’S Time-Stamping And Certificate Revocation, Jianying Zhou, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

In non-repudiation services where digital signatures usually serve as irrefutable cryptographic evidence for dispute resolution, trusted time-stamping and certificate revocation services, although very costly in practice, must be available, to prevent big loss due to compromising of the signing key. In [12], a new concept called intrusion-resilient signature was proposed to get rid of trusted time-stamping and certificate revocation services and a concrete scheme was presented. In this paper, we put forward a new scheme that can achieve the same effect in a much more efficient way. In our scheme, forward-secure signature serves as a building block that enables signature …

Security Remarks On A Group Signature Scheme With Member Deletion, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng

Research Collection School Of Computing and Information Systems

A group signature scheme allows a group member of a given group to sign messages on behalf of the group in an anonymous and unlinkable fashion. In case of a dispute, however, a designated group manager can reveal the signer of a valid group signature. Based on the Camenisch-Michels group signature scheme, Kim, Lim and Lee proposed the first group signature scheme with a member deletion procedure at ICISC 2000. Their scheme is very efficient in both communication and computation aspects. Unfortunately, their scheme is insecure. In this paper, we first identify an effective way that allows any verifier to …

Variations Of Diffie-Hellman Problem, Feng Bao, Robert H. Deng, Huafei Zhu

Research Collection School Of Computing and Information Systems

This paper studies various computational and decisional Diffie-Hellman problems by providing reductions among them in the high granularity setting. We show that all three variations of computational Diffie-Hellman problem: square Diffie-Hellman problem, inverse Diffie-Hellman problem and divisible Diffie-Hellman problem, are equivalent with optimal reduction. Also, we are considering variations of the decisional Diffie-Hellman problem in single sample and polynomial samples settings, and we are able to show that all variations are equivalent except for the argument DDH ⇐ SDDH. We are not able to prove or disprove this statement, thus leave an interesting open problem. Keywords: Diffie-Hellman problem, Square Diffie-Hellman …

Multi-Agent Coalition Via Autonomous Price Negotiation In A Real-Time Web Environment, Hoong Chuin Lau, Wei Sian Lim

Research Collection School Of Computing and Information Systems

In e-marketplaces, customers specify job requests in real-time and agents form coalitions to service them. This paper proposes a protocol for self-interested agents to negotiate prices in forming successful coalitions. We propose and experiment with two negotiation schemes: one allows information sharing while the other does not.

Making The Key Agreement Protocol In Mobile Ad Hoc Network More Efficient, Gang Yao, Kui Ren, Feng Bao, Robert H. Deng, Dengguo Feng

Research Collection School Of Computing and Information Systems

Mobile ad hoc networks offer convenient infrastructureless communications over the shared wireless channel. However, the nature of mobile ad hoc networks makes them vulnerable to security attacks, such as passive eavesdropping over the wireless channel and denial of service attacks by malicious nodes. To ensure the security, several cryptography protocols are implemented. Due to the resource scarcity in mobile ad hoc networks, the protocols must be communication efficient and need as less computational power as possible. Broadcast communication is an important operation for many application in mobile ad hoc networks. To securely broadcast a message, all the members in the …

An Efficient Public-Key Framework, Jianying Zhou, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

Public-key certificates play an important role in binding the public key with the identity of the owner of the corresponding private key. A certificate might be revoked before its scheduled expiry date by the issuing CA. Efficient and timely distribution of certificate revocation information is a big challenge facing the PKI providers. Existing certificate revocation schemes place a considerable processing, communication, and storage overheads on the CA as well as the relying parties. To improve the current situation, we propose a revocation-free public-key framework, in which the maximum lifetime of a certificate is divided into short periods and the certificate …

Adaptive Parallel Framework Algorithm (Apfa) For Environmental Engineering Applications, Lianghua Zhou

Civil & Environmental Engineering Theses & Dissertations

This research proposes a new framework methodology for integrating environmental computer applications in flexible, open and adaptively and reusable manners so that the resulting application framework could be used to effectively, flexibly and rapidly handle various environmental problems and issues. Research also demonstrates the framework algorithm with a case study. The proposed algorithm is referred as Adaptive Parallel Framework Algorithm (APF A). Core concept of the APF A is based on a parallelism, "many-to-one" mode to communicate among environmental applications, and takes advantages of a loosely coupled technology that helps archiving the required flexibility, extensibility and usability of integrated systems. …

Semantic Web In Action: Ontology-Driven Information Search, Integration And Analysis, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Trust Negotiation For Authentication And Authorization In Healthcare Information Systems, Charles D. Knutson, Kent E. Seamons, Tore L. Sundelin, David K. Vawdrey

Faculty Publications

The expanding availability of health information in an electronic format is strategic for industry-wide efforts to improve the quality and reduce the cnst of health care. The implementation of electronic medical record systems has been hindered by inadequate security provisions. This paper describes the use of frust negotiation as a framework for providing authentication and access control services in healthcare information systems. nust negotiation enables two parties with no pre-existing relationship to establish the trust necessary to perform sensitive transactions via the mutual disclosure of attributes contained within digital credentials. An extension of this system, surrogate irusf negoikiion is introduced …

Motion Planning For Multiple Mobile Robots Using Dynamic Networks, Christopher M. Clark, Stephen M. Rock, Jean-Claude Latombe

Computer Science and Software Engineering

A new motion planning framework is presented that enables multiple mobile robots with limited ranges of sensing and communication to maneuver and achieve goals safely in dynamic environments. To combine the respective advantages of centralized and de-centralized planning, this framework is based on the concept of centralized planning within dynamic robot networks. As the robots move in their environment, localized robot groups form networks, within which world models and robot goals can be shared. Whenever a network is formed, new information then becomes available to all robots in this network. With this new information, each robot uses a fast, centralized …

Ontological Approaches For Semantic Interoperability, Michael A. Zang, Jens G. Pohl

Collaborative Agent Design (CAD) Research Center

This paper provides a basic description of the concept of an ontology. It then describes how ontologies are structured and employed in the context of interfaces between software based information systems. This usage is discussed in the context of three successive levels of semantic interoperability between two example systems. The paper goes on to suggest that the interfaces between information systems should perhaps be viewed and implemented as systems themselves. The paper concludes by providing a brief summary of what was discussed.

Proceedings Of The 2003 Onr Decision-Support Workshop Series: Developing The New Infostructure, Collaborative Agent Design Research Center

Collaborative Agent Design (CAD) Research Center

In August of 1998 the Collaborative Agent Design Research Center (CADRC) of the California Polytechnic State University in San Luis Obispo (Cal Poly), approached Dr. Phillip Abraham of the Office of Naval Research (ONR) with the proposal for an annual workshop focusing on emerging concepts in decision-support systems for military applications. The proposal was considered timely by the ONR Logistics Program Office for at least two reasons. First, rapid advances in information systems technology over the past decade had produced distributed, collaborative computer-assistance capabilities with profound potential for providing meaningful support to military decision makers. Indeed, some systems based on …

Index Selection For Embedded Control Applications Using Description Logics, Lubomir Stanchev, Grant Weddell

Computer Science and Software Engineering

We consider the problem of automated index selection for embedded control programs (ECPs). Such systems have the property that the transaction types, which can consist of queries and updates, are predefined and can be classified as either critical or non-critical. In this paper, we focus on the critical part of the transaction workload for ECPs. More precisely, our problem input consists of a set of critical transaction types and a database schema. The goal is to find a minimum number of extended indices that enable every critical operation to be performed efficiently. The proposed solution is novel in that it …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 1, September 2003, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Context-Aware Semantic Association Ranking, Boanerges Aleman-Meza, Christian Halaschek-Wiener, I. Budak Arpinar, Amit P. Sheth

Kno.e.sis Publications

Discovering complex and meaningful relationships, which we call Semantic Associations, is an important challenge. Just as ranking of documents is a critical component of today's search engines, ranking of relationships will be essential in tomorrow's semantic search engines that would support discovery and mining of the Semantic Web. Building upon our recent work on specifying types of Semantic Associations in RDF graphs, which are possible to create through semantic metadata extraction and annotation, we discuss a framework where ranking techniques can be used to identify more interesting and more relevant Semantic Associations. Our techniques utilize alternative ways of specifying the …

Improving Requirements Tracing Via Information Retrieval, Jane Huffman Hayes, Alex Dekhtyar, James Osborne

Computer Science and Software Engineering

This paper presents an approach for improving requirements tracing based on framing it as an information retrieval (IR) problem. Specifically, we focus on improving recall and precision in order to reduce the number of missed traceability links as well as to reduce the number of irrelevant potential links that an analyst has to examine when performing requirements tracing. Several IR algorithms were adapted and implemented to address this problem. We evaluated our algorithms by comparing their results and performance to those of a senior analyst who traced manually as well as with an existing requirements tracing tool. Initial results suggest …

Aggregated Causal Maps: An Approach To Elicit And Aggregate The Knowledge Of Multiple Experts, S. Nadkarni, Fiona Fui-Hoon Nah

Research Collection School Of Computing and Information Systems

This paper presents a systematic procedure to elicit and aggregate the knowledge of multiple individual experts and represent it in the form of an Aggregated Causal Map (ACM). This procedure differs from existing methods in two ways. First, unlike other methods, this method does not rely on group interaction in eliciting knowledge of multiple experts, and, therefore, is not fraught with biases associated with group dynamics. Second, this method uses both the idiographic and nomothetic approaches while existing methods focus on nomothetic approaches to knowledge elicitation. We draw on the strengths of both approaches by using the idiographic approach to …

A Browser For Incremental Programming, Andrew P. Black

Computer Science Faculty Publications and Presentations

Much of the elegance and power of Smalltalk comes from its programming environment and tools. First introduced more than 20 years ago, the Smalltalk browser enables programmers to “home in” on particular methods using a hierarchy of manually-defined classifications. By its nature, this classification scheme says a lot about the desired state of the code, but little about the actual state of the code as it is being developed. We have extended the Smalltalk browser with dynamically computed virtual categories that dramatically improve the browser’s support for incremental programming. We illustrate these improvements by example, and describe the algorithms used …

E-Ducation, J. Erickson, Keng Siau

Research Collection School Of Computing and Information Systems

Most educators are convinced Internet technology will sharply alter the educational landscape of the future, but considerable uncertainly still exists as to exactly how the classroom will evolve over the next decade. Many of the relevant technologies in development are a direct result of the Internet2 Project [1], a collaboration of more than 200 universities working closely with private industry and the National Science Foundation to build and promote an advanced network using state-of-the-art technology and applications. But how the classroom evolves depends not only on advanced Internet2 technologies, which are discussed later in the article, but also on issues …

Enhancing The Cs Curriculum With With Aspect-Oriented Software Development (Aosd) And Early Experience, Konstantin Läufer, George K. Thiruvathukal, Tzilla Elrad

Computer Science: Faculty Publications and Other Works

Aspect-oriented software development (AOSD) is evolving as an important step beyond existing software development approaches such as object-oriented development. An aspect is a module that captures a crosscutting concern, behavior that cuts across different units of abstraction in a software application; expressed as a module, such behavior can be enabled and disabled transparently and non-invasively, without changing the application code itself. Increasing industry demand for expertise in AOSD gives rise to the pedagogical challenge of covering this methodology and its foundations in the computer science curriculum. We present our curricular initiative to incorporate a novel course in AOSD in the …

Programming Language Trends : An Empirical Study, Yaofei Chen

Dissertations

Predicting the evolution of software engineering technology trends is a dubious proposition. The recent evolution of software technology is a prime example; it is fast paced and affected by many factors, which are themselves driven by a wide range of sources. This dissertation is part of a long term project intended to analyze software engineering technology trends and how they evolve. Basically, the following questions will be answered: How to watch, predict, adapt to, and affect software engineering trends?

In this dissertation, one field of software engineering, programming languages, will be discussed. After reviewing the history of a group of …

Design And Evaluation Of A List Gathering Tool In A Web-Based Collaborative Environment, Yuanqiong Wang

Dissertations

This research focuses on how to build a "list" structure to combine individual items of information into some sort of structure that converts the individual items of information into a structure of knowledge relative to the problem. Software was designed to provide relationships among and comparisons of the contributions in a "list" structure, so that individual members of a group process will be able to understand the contributions of information made by the group as a whole.

A List Gathering Tool was designed and implemented, which is one component in a Web-based Social Decision Support System (SDSS) Toolkit. Then, a …

Design And Evaluation Of A Voting Tool In A Collaborative Environment, Zheng Li

Dissertations

This dissertation researchdesigned, implemented, and evaluated a Web-based Dynamic Voting Toolfor small group decision-making in a collaborative environment.

In this dissertation, theliterature on voting tools in current GDSS research is presented. Variousvoting theories and methods are analyzed, and the advantages and weaknessesare compared, so as to gain a better understanding of how to apply thesedifferent voting methods to diverse decision-making situations. A briefoverview of scaling theories is also given, with an emphasis on Thurstone'sLaw.

The basic features of someweb-based voting tool implementations are reviewed along with a discussionof the pros and cons of Intemet voting. A discussion of Human DynamicVoting …

Face Recognition Using Principal Component Analysis, Timothy Kevin Larkin

Theses

Current methods of face recognition use linear methods to extract features. This causes potentially valuable nonlinear features to be lost. Using a kernel to extract nonlinear features should lead to better feature extraction and, therefore, lower error rates. Kernel Principal Component Analysis (KPCA) will be used as the method for nonlinear feature extraction. KPCA will be compared with well known linear methods such as correlation, Eigenfaces, and Fisherfaces.

An Experimental Study On Network Intrusion Detection Systems, Peng Fu

Theses

A signature database is the key component of an elaborate intrusion detection system. The efficiency of signature generation for an intrusion detection system is a crucial requirement because of the rapid appearance of new attacks on the World Wide Web. However, in the commercial applications, signature generation is still a manual process, which requires professional skills and heavy human effort. Knowledge Discovery and Data Mining methods may be a solution to this problem. Data Mining and Machine Learning algorithms can be applied to the network traffic databases, in order to automatically generate signatures.

The purpose of this thesis and the …

Context-Aware Semantic Association Ranking, Boanerges Aleman-Meza, Chris Halaschek, I. Budak Arpinar, Amit P. Sheth

Kno.e.sis Publications

Discovering complex and meaningful relationships, which we call Semantic Associations, is an important challenge. Just as ranking of documents is a critical component of today's search engines, ranking of relationships will be essential in tomorrow's semantic search engines that would support discovery and mining of the Semantic Web. Building upon our recent work on specifying types of Semantic Associations in RDF graphs, which are possible to create through semantic metadata extraction and annotation, we discuss a framework where ranking techniques can be used to identify more interesting and more relevant Semantic Associations. Our techniques utilize alternative ways of specifying the …

Bear: An Open-Source Virtual Secure Coprocessor Based On Tcpa, Rich Macdonald, Sean Smith, John Marchesini, Omen Wild

Computer Science Technical Reports

This paper reports on our ongoing project to use TCPA to transform a desktop Linux machine into a virtual secure coprocessor: more powerful but less secure than higher-end devices. We use TCPA hardware and modified boot loaders to protect fairly static components, such as a trusted kernel; we use an enforcer module---configured as Linux Security Module---to protected more dynamic system components; we use an encrypted loopback filesystem to protect highly dynamic components. All our code is open source and available under GPL from http://enforcer.sourceforge.net/

Secure Remote Control And Configuration Of Fpx Platform In Gigabit Ethernet Environment, Haoyu Song

All Computer Science and Engineering Research

Because of its flexibility and high performance, reconfigurable logic functions implemented on the Field-programmable Port Extender (FPX ) are well suited for implementing network processing such as packet classification, filtering and intrusion detection functions. This project focuses on two key aspects of the FPX system. One is providing a Gigabit Ethernet interface by designing logic for a FPGA which is located on a line card. Address Resolution Protocol (ARP) packets are handled in hardware and Ethernet frames are processed and transformed into cells suitable for standard FPX application. The other effort is to provide a secure channel to enable remote …