Computer Sciences Commons^™

Schema Matching And Data Extraction Over Html Tables, Cui Tao

Theses and Dissertations

Data on the Web in HTML tables is mostly structured, but we usually do not know the structure in advance. Thus, we cannot directly query for data of interest. We propose a solution to this problem for the case of mostly structured data in the form of HTML tables, based on document-independent extraction ontologies. The solution entails elements of table location and table understanding, data integration, and wrapper creation. Table location and understanding allows us to locate the table of interest, recognize attributes and values, pair attributes with values, and form records. Data-integration techniques allow us to match source records …

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 …

Demonstration Of A Typical Ontology-Based Collaborative Agents System: Seaway, Anthony Wood, Jens G. Pohl

Collaborative Agent Design (CAD) Research Center

In San Luis Obispo we have seventy-seven SEAWAY systems which are being prepared for fielding, and we are deep into the design of the follow on version. So, we are discussing a decision support system which is operational. Before we explore SEAWAY, we probably ought to talk about defining decision making problems and applying decision support.

In the case where the senior decision maker has poor decision skills, even the best decision support will make only the most marginal of difference. However, good decision support can make a huge difference if you have just an adequate decision process and adequate …

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 …

High-Throughput 3d Homology Detection Via Nmr Resonance Assignment, Christopher James Langmead, Bruce Randall Donald

Computer Science Technical Reports

One goal of the structural genomics initiative is the identification of new protein folds. Sequence-based structural homology prediction methods are an important means for prioritizing unknown proteins for structure determination. However, an important challenge remains: two highly dissimilar sequences can have similar folds --- how can we detect this rapidly, in the context of structural genomics? High-throughput NMR experiments, coupled with novel algorithms for data analysis, can address this challenge. We report an automated procedure, called HD, for detecting 3D structural homologies from sparse, unassigned protein NMR data. Our method identifies 3D models in a protein structural database whose geometries …

An Improved Nuclear Vector Replacement Algorithm For Nuclear Magnetic Resonance Assignment, Christopher James Langmead, Bruce Randall Donald

Computer Science Technical Reports

We report an improvement to the Nuclear Vector Replacement (NVR) algorithm for high-throughput Nuclear Magnetic Resonance (NMR) resonance assignment. The new algorithm improves upon our earlier result in terms of accuracy and computational complexity. In particular, the new NVR algorithm assigns backbone resonances without error (100% accuracy) on the same test suite examined in [Langmead and Donald J. Biomol. NMR 2004], and runs in $O(n^{5/2} \log {(cn)})$ time where $n$ is the number of amino acids in the primary sequence of the protein, and $c$ is the maximum edge weight in an integer-weighted bipartite graph.

Using Departmental Surveys To Assess Computing Culture: Quantifying Gender Differences In The Classroom, Lisa Meeden, Doug Blank, Deepak Kumar

Computer Science Faculty Research and Scholarship

Male and female students often hold different views of the culture within the same computer science department. These differences may, in part, account for why women are underrepresented in computer science. We found that surveying students about their views of our departments' environments was an important first step in evaluating the cultures of our own departments, in determining what issues needed to be addressed, and in determining how to address them. Our survey results revealed some problems in our classroom and lab environments, and showed that there are gender differences in students' perceptions of our departments. We describe a set …

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 …

The Challenges Of Case Design Integration In The Telecommunication Application Domain, Luiz Fernando Capretz

Electrical and Computer Engineering Publications

The magnitude of the problems facing the telecommunication software industry is presently at a point at which software engineers should become deeply involved. This paper presents a research project on advanced telecommunication technology carried out in Europe, called BOOST (Broadband Object-Oriented Service Technology). The project involved cooperative work among telecommunication companies, research centres and universities from several countries. The challenges to integrate CASE tools to support software development within the telecommunication application domain are discussed. A software process model that encourages component reusability, named the X model, is described as part of a software life cycle model for the telecommunication …

Dynamic Traffic Grooming Algorithms For Reconfigurable Sonet Over Wdm Networks, Shu Zhang, Byrav Ramamurthy

School of Computing: Faculty Publications

The emergence of wavelength-division multiplexing (WDM) technology provides the capability for increasing the bandwidth of synchronous optical network (SONET) rings by grooming low-speed traffic streams onto different high-speed wavelength channels. Since the cost of SONET add–drop multiplexers (SADM) at each node dominates the total cost of these networks, how to assign the wavelength, groom the traffic, and bypass the traffic through the intermediate nodes has received a lot of attention from researchers recently. Moreover, the traffic pattern of the optical network changes from time to time. How to develop dynamic reconfiguration algorithms for traffic grooming is an important issue. In …

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 …

Detecting Patterns Of Fraudulent Behavior In Forensic Accounting, Boris Kovalerchuk, Evgenii Vityaev

All Faculty Scholarship for the College of the Sciences

Often evidence from a single case does not reveal any suspicious patterns to aid investigations in forensic accounting and other forensic fields. In contrast, correlation of sets of evidence from several cases with suitable background knowledge may reveal suspicious patterns. Link Discovery (LD) has recently emerged as a promising new area for such tasks. Currently LD mostly relies on deterministic graphical techniques. Other relevant techniques are Bayesian probabilistic and causal networks. These techniques need further development to handle rare events. This paper combines first-order logic (FOL) and probabilistic semantic inference (PSI) to address this challenge. Previous research has shown this …

One-Layer Neural-Network Controller With Preprocessed Inputs For Autonomous Underwater Vehicles, Sarangapani Jagannathan, Gustavo Galan

Electrical and Computer Engineering Faculty Research & Creative Works

Navigating, guiding, and controlling autonomous underwater vehicles (AUVs) are challenging and difficult tasks compared to the autonomous surface-level operations. Controlling the motion of such vehicles require the estimation of unknown hydrodynamic forces and moments and disturbances acting on these vehicles in the underwater environment. in this paper, a one-layer neural-network (NN) controller with preprocessed input signals is designed to control the vehicle track along a desired trajectory, which is specified in terms of desired position and attitude. in the absence of unknown disturbances and modeling errors, it is shown that the tracking error system is asymptotically stable. in the presence …

Interactive Level-Set Smoothing For Photo Editing, Thomas C. Howard, Bryan S. Morse

Faculty Publications

This paper presents an interactive image-smoothing tool based on properties and manipulation of image level sets. This tool uses PDE-based level-set smoothing to preserve edge sharpness while smoothing noise and jagged contours. Unlike existing approaches using PDEs, the duration and areas of application are controlled interactively with immediate feedback to the user. Interaction issues are addressed, and parameters for adjusting the PDE are automatically estimated based on image characteristics.

Target Sets: A Tool For Understanding And Predicting The Behavior Of Interacting Q-Learners, Nancy Fulda, Dan A. Ventura

Faculty Publications

Reinforcement learning agents that interact in a common environment frequently affect each others’ perceived transition and reward distributions. This can result in convergence of the agents to a sub-optimal equilibrium or even to a solution that is not an equilibrium at all. Several modifications to the Q-learning algorithm have been proposed which enable agents to converge to optimal equilibria under specified conditions. This paper presents the concept of target sets as an aid to understanding why these modifications have been successful and as a tool to assist in the development of new modifications which are applicable in a wider range …

Continuity Of Semantic Operators In Logic Programming And Their Approximation By Artificial Neural Networks, Pascal Hitzler, Anthony K. Seda

Computer Science and Engineering Faculty Publications

One approach to integrating first-order logic programming and neural network systems employs the approximation of semantic operators by feedforward networks. For this purpose, it is necessary to view these semantic operators as continuous functions on the reals. This can be accomplished by endowing the space of all interpretations of a logic program with topologies obtained from suitable embeddings. We will present such topologies which arise naturally out of the theory of logic programming, discuss continuity issues of several well-known semantic operators, and derive some results concerning the approximation of these operators by feedforward neural networks.

Faster Algorithms For K-Median Problem On Trees With Smaller Heights, Rahul Shah

Department of Computer Science Technical Reports

No abstract provided.

Quasaq: A Database-Centric Approach To Enabling End-To-End Qos Control For Multimedia Repositories, Yi-Cheng Tu, Sunil Prabhakar, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

Capacitated Network Revenue Management Through Shadow Pricing, Mustapha Bouhtou, Madiagne Diallo, Laura Wynter

Research Collection School Of Computing and Information Systems

In this paper, we analyze a method that links Lagrange multipliers from a resource allocation problem to the problem of revenue or profit maximization. This technique, first proposed in the transportation science literature by [7] has important implications for telecommunication network pricing. Indeed, the framework provides a generalization of telecommunication resource allocation/shadow price-based schemes such as those of [6] and [9], in that it permits the optimization of the shadow prices themselves, through a computationally simple procedure. We analyze the extent to which revenue can be maximized on a network that uses shadow-price-based prices, and how to deal with cases …

Dynamic Sociometry In Particle Swarm Optimization, Mark Richards, Dan A. Ventura

Faculty Publications

The performance of Particle Swarm Optimization is greatly affected by the size and sociometry of the swarm. This research proposes a dynamic sociometry, which is shown to be more effective on some problems than the standard star and ring sociometries. The performance of various combinations of swarm size and sociometry on six different test functions is qualitatively analyzed.

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 …

Modular Verification Of Timed Circuits Using Automatic Abstraction, Eric G. Mercer, Chris Myers, Hao Zheng

Faculty Publications

The major barrier that prevents the application of formal verification to large designs is state explosion. This paper presents a new approach for verification of timed circuits using automatic abstraction. This approach partitions the design into modules, each with constrained complexity. Before verification is applied to each individual module, irrelevant information to the behavior of the selected module is abstracted away. This approach converts a verification problem with big exponential complexity to a set of subproblems, each with small exponential complexity. Experimental results are promising in that they indicate that our approach has the potential of completing much faster while …

Interorganizational Systems And Competitive Advantages – Lessons From History, Keng Siau

Research Collection School Of Computing and Information Systems

Global business constantly faces radical transformations stemming from advances in information technology (IT). The concept of gaining competitive advantages by linking information systems across organizations (e.g., supply chain integration) has taken on an overtone of dogma in many business circles. Such electronic linkages are known as Interorganizational Systems (IOS). Lately, the growing importance and easy accessibility of the Internet have propelled IOS to a new height. Undoubtedly, IOS can have a great impact on organizational performance and industry structure. However, IT such as the Internet is readily available to all companies, and most IOS concepts can be easily replicated. Followers …

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 …

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 …

Ssm: Fast Construction Of The Optimized Segment Support Map, Kok-Leong Ong, Wee-Keong Ng, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Computing the frequency of a pattern is one of the key operations in data mining algorithms. Recently, the Optimized Segment Support Map (OSSM) was introduced as a simple but powerful way of speeding up any form of frequency counting satisfying the monotonicity condition. However, the construction cost to obtain the ideal OSSM is high, and makes it less attractive in practice. In this paper, we propose the FSSM, a novel algorithm that constructs the OSSM quickly using a FP-Tree. Given a user-defined segment size, the FSSM is able to construct the OSSM at a fraction of the time required by …