Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons™

Open Access. Powered by Scholars. Published by Universities.®

Engineering

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 15631 - 15660 of 17307

Full-Text Articles in Computer Sciences

Cs 241: Introduction To Computer Science Ii, Praveen Kakumanu Oct 2005

Cs 241: Introduction To Computer Science Ii, Praveen Kakumanu

Computer Science & Engineering Syllabi

This course is the second in the three course sequence "Introduction to Computer Science" offered by the Computer Science department, WSU. It focuses on tools for building abstract data types (using structure and class concepts in C++) and Object-Oriented Programming. We also begin the study of data structures in this course.


Integration Of The Shel Model With The Flight Operational Quality Assurance (Foqa) Program, James T. Schultz, Scott Forn, Marian C. Schultz Oct 2005

Integration Of The Shel Model With The Flight Operational Quality Assurance (Foqa) Program, James T. Schultz, Scott Forn, Marian C. Schultz

Publications

The SHEL Model has been used to explore relationships between liveware, environmental, hardware and software factors. This study attempts to integrate Flight Operational Quality Assurance (FOQA) program data with the SHEL model. Aircraft record data that can be used to monitor the human interface within the entire system, plus identify faults and potential failures within the system before a major accident or incident occurs. These data have existed for over four decades, and FOQA offers a way to both analyze and act upon them. The relationships between the SHEL model and FOQA data can help to ensure our nation's skies …


Structured Object-Oriented Co-Analysis/Co-Design Of Hardware/Software For The Facts Powers System, Matt Ryan, Sojan Markose, Xiaoqing Frank Liu, Bruce M. Mcmillin Sep 2005

Structured Object-Oriented Co-Analysis/Co-Design Of Hardware/Software For The Facts Powers System, Matt Ryan, Sojan Markose, Xiaoqing Frank Liu, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

There are several approaches to the hardware/software design in embedded systems, ranging from the traditional sequential methods which focus on the determination of the hardware architecture prior to software design, to newer object-oriented approaches that attempt to apply software engineering methods to hardware design without a systematic process. This paper discusses a structured object-oriented methodology for the integrated co-analysis and co-design of hardware/software systems using an extended high order object-oriented modeling technique (HOOMT). This methodology offers a uniform method for hardware and software developers to jointly develop the specifications for and partitioning of the hardware and software components of a …


A Motion Planning Processor On Reconfigurable Hardware, Nuzhet Atay, Burchan Bayazit Sep 2005

A Motion Planning Processor On Reconfigurable Hardware, Nuzhet Atay, Burchan Bayazit

All Computer Science and Engineering Research

Motion planning algorithms enable us to find feasible paths for moving objects. These algorithms utilize feasibility checks to differentiate valid paths from invalid ones. Unfortunately, the computationally expensive nature of such checks reduces the effectiveness of motion planning algorithms. However, by using hardware acceleration to speed up the feasibility checks, we can greatly enhance the performance of the motion planning algorithms. Of course, such acceleration is not limited to feasibility checks; other components of motion planning algorithms can also be accelerated using specially designed hardware. A Field Programmable Gate Array (FPGA) is a great platform to support such an acceleration. …


The Open Network Laboratory (A Resource For High Performance Networking Research), John Dehart, Fred Kuhns, Jyoti Parwatikar, Jonathan Turner, Ken Wong Sep 2005

The Open Network Laboratory (A Resource For High Performance Networking Research), John Dehart, Fred Kuhns, Jyoti Parwatikar, Jonathan Turner, Ken Wong

All Computer Science and Engineering Research

The Open Network Laboratory (ONL) is a remotely accessible network testbed designed to enable network researchers to conduct experiments using high performance routers and applications. ONL™s Remote Laboratory Interface (RLI) allows users to easily configure a network topology, initialize and modify the routers™ routing tables, packet classification tables and queuing parameters. It also enables users to add software plugins to the embedded processors available at each of the routers™ ports, enabling the introduction of new functionality. The routers provide a large number of built-in counters to track various aspects of system usage, and the RLI software makes these available through …


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 1, September 2005, College Of Engineering And Computer Science, Wright State University Sep 2005

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 1, September 2005, 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.


Solving Generalized Open Constraint Optimization Problem Using Two-Level Multi-Agent Framework, Hoong Chuin Lau, Lei Zhang, Chang Liu Sep 2005

Solving Generalized Open Constraint Optimization Problem Using Two-Level Multi-Agent Framework, Hoong Chuin Lau, Lei Zhang, Chang Liu

Research Collection School Of Computing and Information Systems

The Open Constraint Optimization Problem (OCOP) refers to the COP where constraints and variable domains can change over time and agents' opinions have to be sought over a distributed network to form a solution. The openness of the problem has caused conventional approaches to COP such as branch-and-bound to fail to find optimal solutions. OCOP is a new problem and the approach to find an optimal solution (minimum total cost) introduced in [1] is based on an unrealistic assumption that agents are willing to report their options in nondecreasing order of cost. In this paper, we study a generalized OCOP …


Operator State Estimation For Adaptive Aiding In Uninhabited Combat Air Vehicles, Christopher A. Russell Sep 2005

Operator State Estimation For Adaptive Aiding In Uninhabited Combat Air Vehicles, Christopher A. Russell

Theses and Dissertations

This research demonstrated the first closed-loop implementation of adaptive automation using operator functional state in an operationally relevant environment. In the Uninhabited Combat Air Vehicle (UCAV) environment, operators can become cognitively overloaded and their performance may decrease during mission critical events. This research demonstrates an unprecedented closed-loop system, one that adaptively aids UCAV operators based on their cognitive functional state A series of experiments were conducted to 1) determine the best classifiers for estimating operator functional state, 2) determine if physiological measures can be used to develop multiple cognitive models based on information processing demands and task type, 3) determine …


Partial Adjustable Autonomy In Multi-Agent Environment And Its Application To Military Logistics, Hoong Chuin Lau, Lucas Agussurja, Ramesh Thangarajoo Sep 2005

Partial Adjustable Autonomy In Multi-Agent Environment And Its Application To Military Logistics, Hoong Chuin Lau, Lucas Agussurja, Ramesh Thangarajoo

Research Collection School Of Computing and Information Systems

In a rapidly changing environment, the behavior and decision-making power of agents may have to be adaptive with respect to a fluctuating autonomy. In this paper, a centralized fuzzy approach is proposed to sense changes in environmental conditions and translate them to changes in agent autonomy. A distributed coalition formation scheme is then applied to allow agents in the new autonomy to renegotiate to establish schedule consistency. The proposed framework is applied to a real-time logistics control of a military hazardous material storage facility under peace-to-war transition.


Quantified Model Of Cobit For Corporate It Governance, M. Sibghatullah Siddiqui, Dr. Syed Jamal Hussain Aug 2005

Quantified Model Of Cobit For Corporate It Governance, M. Sibghatullah Siddiqui, Dr. Syed Jamal Hussain

International Conference on Information and Communication Technologies

Now organizations are more concerned about the appropriate IT governance. The growing dependency on IT due to the increasing volume of business process automation further challenges the role of Information System Auditor. IT Governance Institute has developed COBIT1 as a model for this purpose [1][2]. The model proposed in this research quantifies the COBIT by developing matrices for all four domains of COBIT; hence it provides a quantitative approach for better implementation of corporate IT governance through effective audit and control.


Poster Session A: A Multi-Priority Application Framework For Mobile Ad Hoc Networks, M. Ibrahim Channa, Ahsan Chaudhry, Kashif Sharif, Irum Memon Aug 2005

Poster Session A: A Multi-Priority Application Framework For Mobile Ad Hoc Networks, M. Ibrahim Channa, Ahsan Chaudhry, Kashif Sharif, Irum Memon

International Conference on Information and Communication Technologies

The fast spread of small wireless computers has enabled the design and deployment of wireless Ad Hoc networks. Typical applications proposed for such networks include both Real Time and Non-Real Time applications. We propose an architecture that provides a complete framework for Real Time applications and Best Effort traffic. The proposed architecture comprises of an Ad Hoc Routing Protocol for route setup and route repair, a Bandwidth Allocation and Reservation Scheme for Real Time traffic, and a MAC layer protocol that provides traffic differentiation. The Admission Control module is used to admit or reject a new Real Time flow request …


Secured Network Model For Management Information System Based On Ip Security (Ipsec) Encryption Using Multilayered Approach Of Network Security, Dr. Amir Hassan Pathan, Muniza Irshad Aug 2005

Secured Network Model For Management Information System Based On Ip Security (Ipsec) Encryption Using Multilayered Approach Of Network Security, Dr. Amir Hassan Pathan, Muniza Irshad

International Conference on Information and Communication Technologies

Secured flow of information through the network and play important role in the management information systems. In this paper I describe Secured Network Model For Corporate & Business Organization In Based On Network Level IP Security (IPSec) Encryption & Its Physical Layout Using Multilayered Approach. I have four important considerations for adoption of secured network model as secured network model for management information system.


G-Value Decoding Of Greedy Codes, Khalil Ahmad Aug 2005

G-Value Decoding Of Greedy Codes, Khalil Ahmad

International Conference on Information and Communication Technologies

Error-correcting codes are widely used to increase the reliability of transmission of information over various forms of communication channels. Codes with a given minimum distance d can be constructed by a greedy algorithm [2]. In this paper, I proposed a new algorithm for the allocation of g-values to the binary vectors. Hamming (7, 4, 3) code can be generated by the application of greedy algorithm on the binary vectors of length 7 arranged in B-ordering. This code is used to demonstrate a new decoding technique for linear codes in addition to the schemes already known for decoding such as Syndrome …


Keynote: Role Of Values & Culture In Information Technology, Prof. Dr. Anis Ahmad Aug 2005

Keynote: Role Of Values & Culture In Information Technology, Prof. Dr. Anis Ahmad

International Conference on Information and Communication Technologies

It is no longer unusual to see, in a remote town in northern area in Pakistan, a practically non-literate wagon driver calling from his Nokia cell phone his uncle in Dubai or in Karachi. He enjoys sharing with him about his success in business and the settlement of family disputes. While he is driving on dangerous curvy roads and having this conversation, in the back seat of the wagon a comparatively young person is playing games on his cell phone. All this was unimaginable a quarter of a century ago.


Cut-And-Solve: A Linear Search Strategy For Combinatorial Optimization Problems, Sharlee Climer, Weixiong Zhang Aug 2005

Cut-And-Solve: A Linear Search Strategy For Combinatorial Optimization Problems, Sharlee Climer, Weixiong Zhang

All Computer Science and Engineering Research

Branch-and-bound and branch-and-cut use search trees to identify optimal solutions. In this paper, we introduce a linear search strategy which we refer to as cut-and-solve and prove optimality and completeness for this method. This search is different from traditional tree searching as there is no branching. At each node in the search path, a relaxed problem and a sparse problem are solved and a constraint is added to the relaxed problem. The sparse problems provide incumbent solutions. When the constraining of the relaxed problem becomes tight enough, its solution value becomes no better than the incumbent solution value. At this …


Efficient And Effective Schemes For Streaming Media Delivery, Cheng Huang Aug 2005

Efficient And Effective Schemes For Streaming Media Delivery, Cheng Huang

All Computer Science and Engineering Research

The rapid expansion of the Internet and the increasingly wide deployment of wireless networks provide opportunities to deliver streaming media content to users at anywhere, anytime. To ensure good user experience, it is important to battle adversary effects, such as delay, loss and jitter. In this thesis, we first study efficient loss recovery schemes, which require pure XOR operations. In particular, we propose a novel scheme capable of recovering up to 3 packet losses, and it has the lowest complexity among all known schemes. We also propose an efficient algorithm for array codes decoding, which achieves significant throughput gain and …


Spawn: Service Provision In Ad-Hoc Wireless Networks, Radu Handorean, Gruia-Catalin Roman, Rohan Sen, Gregory Hackmann, Christopher Gill Aug 2005

Spawn: Service Provision In Ad-Hoc Wireless Networks, Radu Handorean, Gruia-Catalin Roman, Rohan Sen, Gregory Hackmann, Christopher Gill

All Computer Science and Engineering Research

The increasing ubiquity of wireless mobile computing platforms has opened up the potential for unprecedented levels of communication, coordination and collaboration among mobile computing devices, most of which will occur in an ad hoc, on-demand manner. This paper describes SPAWN, a middleware supporting service provision in ad-hoc wireless networks. The aim of SPAWN is to provide the software resources on mobile devices that facilitate electronic collaboration. This is achieved by applying the principles of service oriented computing (SOC), an emerging paradigm that has seen success in wired settings. SPAWN is an adaptation and extension of the Jini model of SOC …


Knowledge Representation, Organization, And Formalization For Simulation Modeling Of Discrete Manufacturing System, Jung Hung Ma Aug 2005

Knowledge Representation, Organization, And Formalization For Simulation Modeling Of Discrete Manufacturing System, Jung Hung Ma

All-Inclusive List of Electronic Theses and Dissertations

Simulation is an useful tool that helps managers making decision by designing models for real systems. It helps companies to study behaviors of real systems hy analyzing computer models and improve the systems based on the experiments' results. However, cross-domain knowledge requirement and lack of tools facilitate modeling are the main reasons that make industries hesitate to use simulation to assist making decision. This research is an attempt to develop robust knowledge representations for discrete manufacturing system and conceptual simulation model. A modeling methodology was proposed to utilize these knowledge representations (KRs) for developing conceptual simulation models from application domain …


Evaluation Of Time-Varying Availability In Multi-Echelon Inventory System With Combat Damage, Hoong Chuin Lau, Huawei Song Aug 2005

Evaluation Of Time-Varying Availability In Multi-Echelon Inventory System With Combat Damage, Hoong Chuin Lau, Huawei Song

Research Collection School Of Computing and Information Systems

The models for multi-echelon inventory systems in existing literatures predominantly address failures due to reliability in peacetime. In wartime or even peacetime operational scenarios, unexpected combat damage can cause a large number of systems to be heavily damaged, to the extent that they become irreparable. In this paper, we study a multi-echelon spare parts support system under combat damage, discuss the replenishment policy and propose an approximate method to evaluate the time-varying system performance operational availability considering the effect of passivation. Experiments show our model works well and efficiently against simulation.


Tuning Tabu Search Strategies Via Visual Diagnosis, Steven Halim, Wee Chong Wan, Hoong Chuin Lau Aug 2005

Tuning Tabu Search Strategies Via Visual Diagnosis, Steven Halim, Wee Chong Wan, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

While designing working metaheuristics can be straightforward, tuning them to solve the underlying combinatorial optimization problem well can be tricky. Several tuning methods have been proposed but they do not address the new aspect of our proposed classification of the metaheuristic tuning problem: tuning search strategies. We propose a tuning methodology based on Visual Diagnosis and a generic tool called Visualizer for Metaheuristics Development Framework(V-MDF) to address specifically the problem of tuning search (particularly Tabu Search) strategies. Under V-MDF, we propose the use of a Distance Radar visualizer where the human and computer can collaborate to diagnose the occurrence of …


Dispatching Vehicles In A Mega Container Terminal, Ebru K. Bish, Frank Y. Chen, Thin Yin Leong, Barry L. Nelson, Jonathan W. C. Ng, David Simchi-Levi Aug 2005

Dispatching Vehicles In A Mega Container Terminal, Ebru K. Bish, Frank Y. Chen, Thin Yin Leong, Barry L. Nelson, Jonathan W. C. Ng, David Simchi-Levi

Research Collection School Of Computing and Information Systems

We consider a container terminal discharging and uploading containers to and from ships. The discharged containers are stored at prespecified storage locations in the terminal yard. Containers are moved between the ship area and the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to dispatch vehicles to the containers so as to minimize the total time it takes to serve a ship, which is the total time it takes to discharge all containers from the ship and upload new containers onto the ship. We develop easily implementable heuristic algorithms …


A Collision Detection Chip On Reconfigurable Hardware, Nuzhet Atay, John W. Lockwood, Burchan Bayazit Jul 2005

A Collision Detection Chip On Reconfigurable Hardware, Nuzhet Atay, John W. Lockwood, Burchan Bayazit

All Computer Science and Engineering Research

Collision detection algorithms check the intersection between two given surfaces or volumes. They are computationally-intensive and the capabilities of conventional processors limit their performance. Hardware acceleration of these algorithms can greatly benefit the systems that need collision detection to be performed in real-time. A Field Programmable Gate Array (FPGA) is a great platform to achieve such acceleration. An FPGA is a collection of digital gates which can be reprogrammed at run time, i.e., it can be used as a CPU that reconfigures itself for a given task. In this paper, we present an FPGA based collision detection chip. The chip …


Ua1b2/1/5 Oral History, Paula Trafton, Charles Anderson Jul 2005

Ua1b2/1/5 Oral History, Paula Trafton, Charles Anderson

WKU Administration Documents

Interview conducted by Paula Trafton with Charles Anderson, retired Vice President for Information Technology.


Establishing Public Confidence In The Viability Of Fingerprint Biometric Technology, Nathan Alan Green Jul 2005

Establishing Public Confidence In The Viability Of Fingerprint Biometric Technology, Nathan Alan Green

Theses and Dissertations

The most common personal authentication techniques used for identity management employ a secret PIN or password that must be remembered. The challenge, for a given user, is that a multitude of such codes must be recalled over the course of the day for transactions involving distinct computer applications. Password mania prevails. Fingerprint biometric technology is an ideal alternate solution to this password recall problem. In spite of their availability for nearly thirty years, fingerprint biometric systems still remain uncommon in public sectors of industry such as education, government, and technology. Technology has improved sufficiently that false acceptance and rejection rates …


Real-Time Power Aware Routing In Wireless Sensor Networks, Octav Chipara, Zhimin He, Guoliang Xing, Qin Chen, Xiaorui Wang, Chenyang Lu, John Stankovic, Tarek Abdelzaher Jul 2005

Real-Time Power Aware Routing In Wireless Sensor Networks, Octav Chipara, Zhimin He, Guoliang Xing, Qin Chen, Xiaorui Wang, Chenyang Lu, John Stankovic, Tarek Abdelzaher

All Computer Science and Engineering Research

Many mission-critical wireless sensor network applications must resolve the inherent conflict between the tight resource constraints on each sensor node, particularly in terms of energy, with the need to achieve desired quality of service such as end-to-end real-time performance. To address this challenge we propose the Real-time Power-Aware Routing (RPAR) protocol. RPAR achieves required communication delays at minimum energy cost by dynamically adapting the transmission power and routing decisions based on packet deadlines. RPAR integrates a geographic forwarding policy cognizant of deadlines, power, and link quality with new algorithms for on-demand power adaptation and efficient neighborhood discovery. Simulations based on …


Power Transmission Control Using Distributed Max-Flow, Bruce M. Mcmillin, Austin Armbruster, Mariesa Crow, Michael R. Gosnell Jul 2005

Power Transmission Control Using Distributed Max-Flow, Bruce M. Mcmillin, Austin Armbruster, Mariesa Crow, Michael R. Gosnell

Computer Science Faculty Research & Creative Works

Existing maximum flow algorithms use one processor for all calculations or one processor per vertex in a graph to calculate the maximum possible flow through a graph's vertices. This is not suitable for practical implementation. We extend the max-flow work of Goldberg and Tarjan to a distributed algorithm to calculate maximum flow where the number of processors is less than the number of vertices in a graph. Our algorithm is applied to maximizing electrical flow within a power network where the power grid is modeled as a graph. Error detection measures are included to detect problems in a simulated power …


Dream: A Theoretical Analysis, Xueying Qi Jul 2005

Dream: A Theoretical Analysis, Xueying Qi

Computer Science Theses & Dissertations

A Mobile Ad-hoc Network (MANET, for short) is a collection of mobile nodes deployed in support of a short-lived special-purpose operation. Examples include search-and-rescue missions, law-enforcement, multimedia classrooms, and among many others. Unlike cellular or satellite networks, MANET do not rely on any form of pre-existing infrastructure. The mobility of nodes combined with the lack of infrastructure makes routing in MANET notoriously difficult. It was recently suggested that routing in MANET can use to advantage geographic information that the nodes may acquire either by endowing them with a GPS chip or simply by using known localization algorithms. Distance Routing Effect …


Non-Linear And Linear Transformations Of Features For Robust Speech Recognition And Speaker Identification, Saurabh Prasad Jul 2005

Non-Linear And Linear Transformations Of Features For Robust Speech Recognition And Speaker Identification, Saurabh Prasad

Electrical & Computer Engineering Theses & Dissertations

Automatic speech recognizers perform poorly when training and test data are systematically different in terms of noise and channel characteristics. One manifestation of such differences is variations in the probability density functions (pdfs) between training and test features. Consequently, both automatic speech recognition and automatic speaker identification may be severely degraded. Previous attempts to mm1m1ze this problem include Cepstral Mean and Variance Normalization and transforming all speech features to a uni-variate Gaussian pdf. In this thesis, two techniques are presented for non-linearly scaling speech features to fit them to a target pdf - the first is based on the principles …


Fine-Tuning Of Mass-Spring Model Properties For Simulating Realistic Soft Body Deformation, Sylva A. Girtelschmid Jul 2005

Fine-Tuning Of Mass-Spring Model Properties For Simulating Realistic Soft Body Deformation, Sylva A. Girtelschmid

Computational Modeling & Simulation Engineering Theses & Dissertations

Obtaining a well behaved soft-tissue model is one of the most challenging and important tasks in the development of surgical simulation systems. Achieving both accurate and real-time deformation response from a soft-tissue model becomes more difficult as the complexity of the represented anatomy and the degree of deformation increases. One common approach to modeling deformable objects is the Mass-Spring (MS) system method. Mass-Spring systems are attractive to real-time applications due to their relatively low computational requirement and ease of implementation. However, their parameter determination is typically done manually, which becomes tedious when accurate approximation to real-world objects is desired. This …


Cs 208: Computer Programming For Business I, Dennis Kellermeier Jul 2005

Cs 208: Computer Programming For Business I, Dennis Kellermeier

Computer Science & Engineering Syllabi

CS 208 is the first of a two quarter sequence in programming for business students. It is required for Management Information Science majors. The courses are designed to help students achieve a high degree of facility in intermediate level programming. This course assumes students have never written a program before.