Computer Engineering Commons^™

Discovering Transcriptional Regulatory Rules From Gene Expression And Tf-Dna Binding Data By Decision Tree Learning, Jianhua Ruan, Weixiong Zhang

All Computer Science and Engineering Research

Background: One of the most promising but challenging task in the post-genomic era is to reconstruct the transcriptional regulatory networks. The goal is to reveal, for each gene that responds to a certain biological event, which transcription factors affect its transcription, and how several transcription factors coordinate to accomplish specific regulations. Results: Here we propose a supervised machine learning approach to address these questions. We build decision trees to associate the expression level of a gene with the transcription factor binding data of its promoter. From the decision trees, we extract regulatory rules that specify how the binding of a …

Cs 214: Object Oriented Programming, Roddy Keish

Computer Science & Engineering Syllabi

No abstract provided.

Cs 340: Programming Language Workshop In Java, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course is designed as a self-study in Java. You are expected to work independently to learn the Java language and solve a set of programming problems assigned to you using latest Java SDK available at http://java.sun.com or other software as approved by the instructor. There are no exams. We officially meet only once in a quarter. However, I will be available in the posted office hours for clarifications and general discussion of the programming assignments. Do not expect support in debugging badly documented code.

Teabag: A Debugger For Curry, Stephen Lee Johnson

Dissertations and Theses

This thesis describes TeaBag, which is a debugger for functional logic computations. TeaBag is an accessory of a virtual machine currently under development. A distinctive feature of this machine is its operational completeness of computations, which places novel demands on a debugger. This thesis describes the features of TeaBag, in particular the handling of non-determinism, the ability to control nondeterministic steps, to remove context information, to toggle eager evaluation, and to set breakpoints on both functions and terms. This thesis also describes TeaBag's architecture and its interaction with the associated virtual machine. Finally, some debugging sessions of defective programs are …

Qos Provisioning For Multi-Class Traffic In Wireless Networks, Mona El-Kadi Rizvi

Computer Science Theses & Dissertations

Physical constraints, bandwidth constraints and host mobility all contribute to the difficulty of providing Quality of Service (QoS) guarantees in wireless networks. There is a growing demand for wireless networks to support all the services that are available on wired networks. These diverse services, such as email, instant messaging, web browsing, video conferencing, telephony and paging all place different demands on the network, making QoS provisioning for wireless networks that carry multiple classes of traffic a complex problem. We have developed a set of admission control and resource reservation schemes for QoS provisioning in multi-class wireless networks.

We present three …

Variations On Particle Swarm Optimization And Their Experimental Evaluation On Maximum Satisfiability, Susan A Abdelshahid

Archived Theses and Dissertations

No abstract provided.

A Spatiotemporal Query Service For Mobile Users In Sensor Networks, Chenyang Lu, Guoliang Xing, Octav Chipara, Chien-Liang Fok, Sangeeta Bhattacharya

All Computer Science and Engineering Research

This paper presents MobiQuery, a spatiotemporal query service that allows mobile users to periodically gather information from their surrounding areas through a wireless sensor network. A key advantage of MobiQuery lies in its capability to meet stringent spatiotemporal performance constraints crucial to many applications. These constraints include query latency, data freshness and fidelity, and changing query areas due to user mobility. A novel just-in-time prefetching algorithm enables MobiQuery to main-tain robust spatiotemporal guarantees even when nodes op-erate under extremely low duty cycles. Furthermore, it sig-nificantly reduces the storage cost and network contention caused by continuous queries from mobile users. We …

Composing Systemic Aspects Into Component-Oriented Doc Middleware, Nanbor Wang

All Computer Science and Engineering Research

The advent and maturation of component-based middleware frameworks have sim-plified the development of large-scale distributed applications by separating system devel-opment and configuration concerns into different aspects that can be specified and com-posed at various stages of the application development lifecycle. Conventional component middleware technologies, such as J2EE [73] and .NET [34], were designed to meet the quality of service (QoS) requirements of enterprise applications, which focus largely on scalability and reliability. Therefore, conventional component middleware specifications and implementations are not well suited for distributed real-time and embedded (DRE) ap-plications with more stringent QoS requirements, such as low latency/jitter, timeliness, and …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 7, May 2004, 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.

Modified Art 2a Growing Network Capable Of Generating A Fixed Number Of Nodes, Ji He, Ah-Hwee Tan, Chew-Lim Tan

Research Collection School Of Computing and Information Systems

This paper introduces the Adaptive Resonance Theory under Constraint (ART-C 2A) learning paradigm based on ART 2A, which is capable of generating a user-defined number of recognition nodes through online estimation of an appropriate vigilance threshold. Empirical experiments compare the cluster validity and the learning efficiency of ART-C 2A with those of ART 2A, as well as three closely related clustering methods, namely online K-Means, batch K-Means, and SOM, in a quantitative manner. Besides retaining the online cluster creation capability of ART 2A, ART-C 2A gives the alternative clustering solution, which allows a direct control on the number of output …

Fusion And Perspective Correction Of Multiple Networked Video Sensors, Christopher E. Neely, John W. Lookwood

All Computer Science and Engineering Research

A network of adaptive processing elements has been developed that transforms and fuses video captured from multiple sensors. Unlike systems that rely on end-systems to process data, this system distributes the computation throughout the network in order to reduce overall network bandwidth. The network architecture is scalable because it uses a hierarchy of processing engines to perform signal processing. Nodes within the network can be dynamically reprogrammed in order to compose video from multiple sources, digitally transform camera perspectives, and adapt the video format to meet the needs of specific applications. A prototype has been developed using reconfigurable hardware that …

Run-Time Modification Of The Class Hierachy In A Live Java Development Environment, Joel R. Brandt

All Computer Science and Engineering Research

Class hierarchy design is central to object-oriented software development. How-ever, it is sometimes difficult for developers to anticipate all the implications of a design until implementation is underway. To support experimentation with different designs, we extend prior work on live development environments to allow run-time modification of the class hierarchy. The result is a more fluid object-oriented development process, in which immediate feedback from the executing program can be used to guide hierarchy design. This thesis presents a framework and developer support for run-time modification of class inheritance relations in JPie, a live visual programming environment for Java. Most notably, …

Automatic Determination Of Factors For Real-Time Garbage Collection, Tobias Mann, Ron K. Cytron

All Computer Science and Engineering Research

Several approaches to hard, real-time garbage collection have been recently proposed. All of these approaches require knowing certain statistical properties about a program's execution, such as the maximum extent of live storage, the rate of storage allocation, and the number of non-null object references. While these new approaches offer the possibility of guaranteed, reasonably bounded behavior for garbage collection, the determination of the required information may not be straight forward for the application programmer. In this paper we present evidence suggesting that the necessary factors can vary widely over the program's execution, indicating that an automatic, phased approach may be …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 6, April 2004, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Models, Composability, And Validity, Eric Werner Weisel

Computational Modeling & Simulation Engineering Theses & Dissertations

Composability is the capability to select and assemble simulation components in various combinations into simulation systems to satisfy specific user requirements. The defining characteristic of composability is the ability to combine and recombine components into different simulation systems for different purposes. The ability to compose simulation systems from repositories of reusable components has been a highly sought after goal among modeling and simulation developers. The expected benefits of robust, general composability include reduced simulation development cost and time, increased validity and reliability of simulation results, and increased involvement of simulation users in the process. Consequently, composability is an active research …

Static Analysis Of Memory-Accessing Gestures In Java, Christopher R. Hill

All Computer Science and Engineering Research

We propose the notion of Java-program gestures that are composed of a series of memory-accessing instructions. By finding patterns in gestures whose execution can be atomic, we can load them in an intelligent memory controller. This process can improve performance of the Java Virtual Machine, decrease code footprint, and reduce power consumption in hardware. In this thesis we formally define a language of gestures and introduce a method of detecting them statically at compile-time. We introduce a simple heuristic for reducing the number of gestures that must be loaded into the memory controller and show that finding the minimum number …

Design And Implementation Of A String Matching System For Network Intrusion Detection Using Fpga-Based Bloom Filters, Sarang Dharmapurikar, Michael Attig, John Lockwood

All Computer Science and Engineering Research

Modern Network Intrusion Detection Systems (NIDS) inspect the network packet payload to check if it conforms to the security policies of the given network. This process, of-ten referred to as deep packet inspection, involves detection of predefined signature strings or keywords starting at an arbitrary location in the payload. String matching is a computationally intensive task and can become a potential bottleneck without high-speed processing. Since the conventional software-implemented string matching algorithms have not kept pace with the increasing network speeds, special purpose hardware solutions have been introduced. In this paper we show how Bloom filters can be used effectively …

Service Oriented Computing Imperatives In Ad Hoc Wireless Settings, Rohan Sen, Radu Handorean, Gruia-Catalin Roman, Christopher Gill

All Computer Science and Engineering Research

Service oriented computing is a new paradigm that is gaining popularity in dis-tributed computing environments due to its emphasis on highly specialized, modular and platform-agnostic code facilitating interoperability of systems. It borrows concepts from more mature paradigms such as object-oriented and component computing. This results in a progression from object-oriented computing to component computing and finally to service oriented computing, a new paradigm for designing and delivering software. Just as an object encapsulates state and behavior at a fine level of granularity, a service offers similar encapsulation at a larger scale. This evolution raises the level of abstraction at which …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 5, March 2004, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 4, February 2004, 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.

Camrit: Control-Based Adaptive Middleware For Real-Time Image Transmission, Xiaorui Wang, Huang-Ming Huang, Venkita Subramonian, Chenyang Lu, Christopher Gill

All Computer Science and Engineering Research

Real-time image transmission is crucial to an emerging class of distributed embedded systems operating in open network environments. Examples include avionics mission re-planning over Link-16, security systems based on wireless camera networks, and online collaboration using camera phones. Meeting image transmission deadlines is a key chal-lenge in such systems due to unpredictable network condi-tions. In this paper, we present the design, modeling, and analysis of CAMRIT, a Control-based Adaptive Middleware framework for Real-time Image Transmission in distributed real-time embedded systems. CAMRIT features a distributed feedback control loop that meets image transmission dead-lines by dynamically adjusting the quality of image tiles. …

Bidirectional Lao* Algorithm (A Faster Approach To Solve Goal-Directed Mdps), Venkata Deepti Kiran Bhuma

University of Kentucky Master's Theses

Uncertainty is a feature of many AI applications. While there are polynomial-time algorithms for planning in stochastic systems, planning is still slow, in part because most algorithms plan for all eventualities. Algorithms such as LAO* are able to find good or optimal policies more quickly when the starting state of the system is known.

In this thesis we present an extension to LAO*, called BLAO*. BLAO* is an extension of the LAO* algorithm to a bidirectional search. We show that BLAO* finds optimal or ^_E-optimal solutions for goal-directed MDPs without necessarily evaluating the entire state space. BLAO* …

Creating A Video Device Application, Kevin Septor

Honors Theses

A video device, such as a webcam, has the capability to be used in many ways, including recording video and behaving like a security camera. A TV tuner card can also record video, and in addition be used for watching television. However, the video hardware and device driver the operating system uses to access it are only capable of delivering raw frames of video. A user space application is necessary for exploiting the capabilities of such a device beyond reading sequential frames of video. This research explores the desiderata in a powerful video device application, and introduces a program that …

Making Svg A Web Service In A Message-Based Mvc Architecture, Xiaohong Qiu, Shrideep Pallickara, Ahmet Uyar

Electrical Engineering and Computer Science - All Scholarship

We reformulate Scalable Vector Graphics browser in a Web Service architecture separating the rendering from the W3C DOM processing of events. We describe this in a message-based Model-View-Controller (M-MVC) architecture and implement it with a powerful publish-subscribe messaging infrastructure. A Web Services oriented architecture with services loosely coupled by the exchange of messages is becoming an increasingly important feature in the deployment of Internet applications. The broad applicability of this approach includes enterprise software, e-Learning, e-Science and e-Business. Our work provides a general framework for integrating Desktop and Web Service applications. We summarize the performance results from detailed tests of …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 3, January 2004, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Cs 302-01: Client Server Databases, Karen Meyer

Computer Science & Engineering Syllabi

No abstract provided.

Cs/Mth 317/517: Numerical Methods For Digital Computers - Ii, Ronald F. Taylor

Computer Science & Engineering Syllabi

Continuation of CS/MTH/316/516. Introduction to numerical methods used in the sciences. Methods for solving matrix eigenvalue problems, initial value and boundary value problem for ordinary differential equations (ODEs). Study of standard types of partial differential equations (PDEs) with applications. Solution techniques for systems of nonlinear equations. Discussion of sources of errors in numerical methods. Special topics and applications presented as schedule permits. 4 credit hours. Prerequisites: CS 316, MTH 233, 253, or 355. Programming course prerequisites: EGR 153 or CEG 220 or CS 241.

A Fast And Simple Algorithm For Computing M-Shortest Paths In State Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar

Electrical & Computer Engineering Faculty Research

We consider the problem of computing m shortest paths between a source node s and a target node t in a stage graph. Polynomial time algorithms known to solve this problem use complicated data structures. This paper proposes a very simple algorithm for computing all m shortest paths in a stage graph efficiently. The proposed algorithm does not use any complicated data structure and can be implemented in a straightforward way by using only array data structure. This problem appears as a sub-problem for planning risk reduced multiple k-legged trajectories for aerial vehicles.

An Information System For Streamlining Software Development Process, Serkan Nalbant

Turkish Journal of Electrical Engineering and Computer Sciences

In this paper an information system to be employed by software development organizations is proposed, which automates software development process. The proposed system aims to lower cost, improve schedule performance and enhance quality of the software projects by the means of automation and unifying of operational information. The characteristics of the proposed system are described. Furthermore, its use is illustrated via the explanation of an exemplary software system called PACE that serves as an information system for planning, controlling, measuring and improving software development process and projects. The relationship of PACE with Software Capability Maturity Model (CMM) is also provided.

An Agile Information Systems Development Method In Use, Mehmet Nafi̇z Aydin, Frank Harmsen, Kees Van Slooten, Robert Stegwee

Turkish Journal of Electrical Engineering and Computer Sciences

Recently, agile information systems development methods, agile methods in short, have got considerable attention from practitioners. One of the reasons seems that agile methods, to some degree, can be adaptable to different project situations. However, little empirical research has been conducted on this subject. The major goal of this research is to identify which aspects of agile methods are perceived as most critical and difficult to realize and how such aspects are adapted in practice. To reach this goal we studied the working practices concerning the adaptation of an agile method in the IT department of one of the leading …