Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Access Protocols (2)
- Argonne Model for Universal Solvent Extraction (AMUSE); Computer programming; Radioactive wastes – Purification; Reactor fuel reprocessing; Separation (Technology); Software engineering; System analysis; Systems engineering; Transmutation (Chemistry) (2)
- Biomedical Visualization (2)
- Cardiovascular (2)
- Closed Loop Systems (2)
-
- Digital libraries (2)
- Educational Computer Game (2)
- Fly-Through (2)
- Internet (2)
- Logistics (2)
- Lyapunov Methods (2)
- Metadata (2)
- Navigation (2)
- Neural Network (2)
- Optimisation (2)
- Power Transmission Control (2)
- , Neural networks (NNs) (1)
- Accident investigations (1)
- Ad Hoc Networks (1)
- Ad Hoc Wireless Network (1)
- Adaptive Control (1)
- Adaptive Neural Network (NN) Controller (1)
- Adaptive Replication (1)
- Adaptive-Critic NN Controller (1)
- Aircraft accidents & safety (1)
- Alpha-bearing wastes; Argonne Model for Universal Solvent Extraction (AMUSE); Computer programming; Separation (Technology); Software engineering; System analysis; Systems engineering; Transuranium elements – Separation; Uranium Recovery by Extraction (UREX) (1)
- Anytime algorithms (1)
- Approximation (1)
- Archival forensics (1)
- Archive Ingest and Handling Test (AIHT) (1)
- Publication
-
- Computer Science & Engineering Syllabi (165)
- All Computer Science and Engineering Research (21)
- Computer Science and Engineering Faculty Publications (11)
- Research Collection School Of Computing and Information Systems (10)
- Electrical and Computer Engineering Faculty Research & Creative Works (9)
-
- Computer Science Faculty Publications (4)
- Computer Science Faculty Research & Creative Works (3)
- Faculty Publications (3)
- Separations Campaign (TRP) (3)
- Publications (2)
- All Faculty Reports - School of Engineering and Computer Science (1)
- CGU Faculty Publications and Research (1)
- Computer Science Faculty Publications and Presentations (1)
- Electrical & Computer Engineering Faculty Publications (1)
- Engineering Faculty Articles and Research (1)
- Engineering Management & Systems Engineering Faculty Publications (1)
- Engineering Technology Faculty Publications (1)
- Faculty Publications, Computer Science (1)
- WKU Archives Records (1)
Articles 1 - 30 of 240
Full-Text Articles in Engineering
Loss Aware Rate Allocations In H.263 Coded Video Transmissions, Xiao Su, Benjamin Wah
Loss Aware Rate Allocations In H.263 Coded Video Transmissions, Xiao Su, Benjamin Wah
Faculty Publications
For packet video, information loss and bandwidth limitation are two factors that affect video playback quality. Traditional rate allocation approaches have focused on optimizing video quality under bandwidth constraint alone. However, in the best-effort Internet, packets carrying video data are susceptible to losses, which need to be reconstructed at the receiver side. In this paper, we propose loss aware rate allocations in both group-of-block (GOB) level and macroblock level, given that certain packets are lost during transmissions and reconstructed using simple interpolation methods at the receiver side. Experimental results show that our proposed algorithms can produce videos of higher quality …
Architecture And Execution Model For A Survivable Workflow Transaction Infrastructure, Haraldur D. Thorvaldsson, Kenneth J. Goldman
Architecture And Execution Model For A Survivable Workflow Transaction Infrastructure, Haraldur D. Thorvaldsson, Kenneth J. Goldman
All Computer Science and Engineering Research
We present a novel architecture and execution model for an infrastructure supporting fault-tolerant, long-running distributed applications spanning multiple administrative domains. Components for both transaction processing and persistent state are replicated across multiple servers, en-suring that applications continue to function correctly de-spite arbitrary (Byzantine) failure of a bounded number of servers. We give a formal model of application execution, based on atomic execution steps, linearizability and a sep-aration between data objects and transactions that act on them. The architecture is designed for robust interoperability across domains, in an open and shared Internet computing infrastructure. A notable feature supporting cross-domain applications is …
A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau, Xiaomin Jia, Wee Chong Wan
A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau, Xiaomin Jia, Wee Chong Wan
Research Collection School Of Computing and Information Systems
Presently, most tabu search designers devise their applications without considering the potential of design and code reuse, which consequently prolong the development of subsequent applications. In this paper, we propose a software solution known as Tabu Search Framework (TSF), which is a generic C++ software framework for tabu search implementation. The framework excels in code recycling through the use of a well- designed set of generic abstract classes that clearly define their collaborative roles in the algorithm. Additionally, the framework incorporates a centralized process and control mechanism that enhances the search with intelligence. This results in a generic framework that …
Roadmap Query For Sensor Network Assisted Navigation In Dynamic Environments, Sangeeta Bhattacharya, Nuzhet Atay, Gazihan Alankus, Chenyang Lu, O. Burchan Bayazit, Gruia-Catalin Roman
Roadmap Query For Sensor Network Assisted Navigation In Dynamic Environments, Sangeeta Bhattacharya, Nuzhet Atay, Gazihan Alankus, Chenyang Lu, O. Burchan Bayazit, Gruia-Catalin Roman
All Computer Science and Engineering Research
Autonomous mobile entity navigation through dynamic and unknown environments is an essential part of many mission critical applications like search and rescue and fire fighting. The dynamism of the environment necessitates the mobile entity to constantly maintain a high degree of awareness of the changing environment. This criteria makes it difficult to achieve good navigation performance by using just on-board sensors and existing navigation methods and motivates the use of wireless sensor networks (WSNs) to aid navigation. In this paper, we present a novel approach that integrates a roadmap based navigation algorithm with a novel network query protocol called Roadmap …
Group Scheduling In Selinux To Mitigate Cpu-Focused Denial Of Service Attacks, Armando Migliaccio, Terry Tidwell, Christopher Gill, Tejasvi Aswathanarayana, Douglas Niehaus
Group Scheduling In Selinux To Mitigate Cpu-Focused Denial Of Service Attacks, Armando Migliaccio, Terry Tidwell, Christopher Gill, Tejasvi Aswathanarayana, Douglas Niehaus
All Computer Science and Engineering Research
Popular security techniques such as public-private key encryption, firewalls, and role-based access control offer significant protec-tion of system data, but offer only limited protection of the computations using that data from significant interference due to accident or adversarial attack. However, in an increasing number of modern systems, ensuring the reliable execution of system activities is every bit as important as ensuring data security. This paper makes three contributions to the state of the art in protection of the execution of system activities from accidental or adversarial interference. First, we consider the motivating problem of CPU-focused denial of service attacks, and …
Minimum Power Configuration For Wireless Communication In Sensor Networks, Guoliang Xing, Chenyang Lu, Ying Zhang, Qingfeng Huang, Robert Pless
Minimum Power Configuration For Wireless Communication In Sensor Networks, Guoliang Xing, Chenyang Lu, Ying Zhang, Qingfeng Huang, Robert Pless
All Computer Science and Engineering Research
This paper proposes the Minimum Power Configuration (MPC) approach to power management in wireless sensor networks. In contrast to earlier research that treats different radio states (transmission/reception/idle) in isolation, MPC integrates them in a joint optimization problem that depends on both the set of active nodes and the transmission power. We propose four approximation algorithms with provable performance bounds and two practical routing protocols. Simulations based on realistic radio models show that the MPC approach can conserve more energy than existing minimum power routing and topology control protocols. Furthermore, it can flexibly adapt to network workload and radio platforms.
The Screech Owl Reasoner - Scalable Approximate Abox Reasoning With Owl, Pascal Hitzler, Denny Vrandecic
The Screech Owl Reasoner - Scalable Approximate Abox Reasoning With Owl, Pascal Hitzler, Denny Vrandecic
Computer Science and Engineering Faculty Publications
We present a preliminary version of the approximate OWL reasoning system SCREECH. It builds on the KAON2 system and performs OWL ABox reasoning in an approximate manner. It trades soundness of reasoning for efficiency, with resulting polynomial worst-case data complexity. It has been developed for use in time-critical applications where quick response time is more important than a full guarantee of correctness of answers. The theoretical background for the system is explained in [Hitzler and Vrandecic, 2005] and is being presented at the conference.
End-To-End Scheduling Strategies For Aperiodic Tasks In Middleware, Yuanfang Zhang, Chenyang Lu, Christopher Gill, Patrick Lardieri, Gautum Thaker
End-To-End Scheduling Strategies For Aperiodic Tasks In Middleware, Yuanfang Zhang, Chenyang Lu, Christopher Gill, Patrick Lardieri, Gautum Thaker
All Computer Science and Engineering Research
Many mission-critical distributed real-time applicationsmust handle aperiodic tasks with hard end-to-end dead-lines. Existing middleware such as RT-CORBA lacksschedulability analysis and run-time scheduling mecha-nisms that can provide real-time guarantees to aperiodictasks. This paper makes the following contributions to thestate of the art for end-to-end aperiodic scheduling in mid-dleware. First, we compare two approaches to aperiodicscheduling, the deferrable server and the aperiodic utiliza-tion bound, using representative workloads. Numerical re-sults show that the deferrable server analysis is less pes-simistic than the aperiodic utilization bounds when appliedoffline. Second, we propose a practical approach to tuningdeferrable servers for end-to-end tasks. Third, we describedeferrable server mechanisms …
Context Aware Service Oriented Computing In Mobile Ad Hoc Networks, Radu Handorean, Gruia-Catalin Roman, Christopher Gill
Context Aware Service Oriented Computing In Mobile Ad Hoc Networks, Radu Handorean, Gruia-Catalin Roman, Christopher Gill
All Computer Science and Engineering Research
These days we witness a major shift towards small, mobile devices, capable of wireless communication. Their communication capabilities enable them to form mobile ad hoc networks and share resources and capabilities. Service Oriented Computing (SOC) is a new emerging paradigm for distributed computing that has evolved from object-oriented and component-oriented computing to enable applications distributed within and across organizational boundaries. Services are autonomous computational elements that can be described, published, discovered, and orchestrated for the purpose of developing applications. The application of the SOC model to mobile devices provides a loosely coupled model for distributed processing in a resource-poor and …
Mobiquery: A Spatiotemporal Query Service For Mobile Users In Sensor Networks, Guoliang Xing, Sangeeta Bhattacharya, Chenyang Lu, Octav Chipara, Chien-Liang Fok, Gruia-Catalin Roman
Mobiquery: A Spatiotemporal Query Service For Mobile Users In Sensor Networks, Guoliang Xing, Sangeeta Bhattacharya, Chenyang Lu, Octav Chipara, Chien-Liang Fok, Gruia-Catalin Roman
All Computer Science and Engineering Research
This paper presents MobiQuery, a spatiotemporal query service that allows mobile users to periodically collect sensor data from the physical environment through wireless sensor networks. A salient feature of \MQ is that it can meet stringent spatiotemporal performance constraints, including query latency, data freshness, and changing areas of interest due to user mobility. We present three just-in-time prefetching protocols that enable MobiQuery to achieve desired spatiotemporal performance despite low node duty cycles, while significantly reducing communication overhead. We validate our approach through both theoretical analysis and extensive simulations under realistic settings including varying user movement patterns and location errors.
Ceg 434/634: Concurrent Software Design, Natsuhiko Futamura
Ceg 434/634: Concurrent Software Design, Natsuhiko Futamura
Computer Science & Engineering Syllabi
This course provides an introduction to concurrent program design in the UNIX environment. Classical problems of synchronization, concurrency , and their solutions are examined through the course projects and through readings on operating system design.
Ceg 433/633: Operating Systems, Prabhaker Mateti
Ceg 433/633: Operating Systems, Prabhaker Mateti
Computer Science & Engineering Syllabi
The management of resources in multi-user computer systems. Emphasis is on problems of file-system design, process scheduling, memory allocation, protection, and tools needed for solutions. Course projects use the CIC++ language and include the design of portions of an operating system. 4 credit hours.
Ceg 499/699: Mobile Computing, Yong Pei
Ceg 499/699: Mobile Computing, Yong Pei
Computer Science & Engineering Syllabi
This senior/graduate course provides an in-depth study of networking protocol and system design in the area of wireless networking and mobile computing. It will help CEG students establish a solid foundation in wireless networking architecture, protocols, fundamental concepts and principles, network congestion control and flow control design. It will also introduce students to a few hot topics in wireless networking and mobile computing research.
The course will start with a review over fundamental design challenges, architectural principles and philosophy for the Internet and heterogeneous networks. The focus will then move on to an in-depth examination of wireless networking protocols, and …
Ceg 320/520: Computer Organization And Assembly Language Programming, Travis E. Doom
Ceg 320/520: Computer Organization And Assembly Language Programming, Travis E. Doom
Computer Science & Engineering Syllabi
Terminology and understanding of functional organizations and sequential operatio of a digital computer. Program structure, and machine and assembly language topics including addressing, stacks, argument pasing, arithmetic operations, traps, and input/output. Macros, modularization, linkers, and debuggers are used. Three hours lecture, two hours lab. Prerequisite: CS 242, CEO 260.
Ceg 460/660: Introduction To Software Computer Engineering, John A. Reisner
Ceg 460/660: Introduction To Software Computer Engineering, John A. Reisner
Computer Science & Engineering Syllabi
This course introduces established practices for engineering large-scale software systems. Emphasis is placed on both the technical and managerial aspects of software engineering, and the software development process. This includes techniques for requirements elicitation, analysis, design, testing, and project management. The course emphasizes object-oriented development with the Unified Modeling Language (UML). Hands-on experience is provided through individual homework problems and a group project.
Ceg 210: Pc Networking I, Chris P. Fickert
Ceg 210: Pc Networking I, Chris P. Fickert
Computer Science & Engineering Syllabi
The objective of the course is to provide an introduction to PC networking hardware, concepts, and technologies with a focus on hardware configuration and LAN administration using in-class, hands-on exercises with Novell NetWare.
Ceg 770: Computer Engineering Mathematics, Yong Pei
Ceg 770: Computer Engineering Mathematics, Yong Pei
Computer Science & Engineering Syllabi
Computer Engineering and Science students need proficiency in relevant applied mathematics to be able to discover and model difficult real-world computer engineering and science problems. The relationship of these problems to mathematical theory will be discussed. This course provides an introduction to linear and nonlinear programming, probability and stochastic process, and queueing theory. In addition to mathematical theory, appropriate applications will be presented.
Ceg 760: Advanced Software Computer Engineering, Thomas C. Hartrum
Ceg 760: Advanced Software Computer Engineering, Thomas C. Hartrum
Computer Science & Engineering Syllabi
This course covers advanced topics in software engineering. Aspects of problem specification, design, verification, and evaluation are discussed. We will focus on design methods, including software patterns and software architecture, plus some advanced topics involving formal methods of software specification or evaluation using software metrics. Students will participate in team projects to apply the methods discussed.
Ceg 220: Introduction To C Programming For Engineers I, Ronald F. Taylor
Ceg 220: Introduction To C Programming For Engineers I, Ronald F. Taylor
Computer Science & Engineering Syllabi
This course provides a general introduction to computers as a problem-solving tool using the C programming language. Emphasis is on algorithms and techniques useful to engineers. Topics include data representation, debugging, and program verification. Some programming assignments may involve complex arithmetic and trigonometric and exponential functions. 4 credit hours. Prerequisite: MTH 229 (Calculus I) or EGR 101 (Engineering Mathematics).
Ceg 453/653: Design Of Computing Systems, Jack Jean
Ceg 453/653: Design Of Computing Systems, Jack Jean
Computer Science & Engineering Syllabi
No abstract provided.
Ceg 260: Digital Computer Hardware Switching Circuits, Eric Matson
Ceg 260: Digital Computer Hardware Switching Circuits, Eric Matson
Computer Science & Engineering Syllabi
We will discuss and cover basic digital, combinational and sequential logic systems. Labs will be used to gain valuable practical experience in implementing elementary circuits and logic designs.
Ceg 498: Design Experience, Thomas C. Hartrum
Ceg 498: Design Experience, Thomas C. Hartrum
Computer Science & Engineering Syllabi
CEG 498 (Design Experience) is a summative computer engineering design project course that builds upon previous engineering, science, mathematics and communications course work. CEG 498 projects are a minimum of two quarters in length and must be completed in groups of at least three students. Projects are selected under the guidance of the course instructor and are tailored to both student interest and formal classroom preparation. Students are evaluated both on their individual contributions as recorded in a graded engineering journals and on the quality of their collective efforts as reflected in group generated products.
Ceg 333: Introduction To Unix, Travis E. Doom
Ceg 333: Introduction To Unix, Travis E. Doom
Computer Science & Engineering Syllabi
Introduction to the use of UNIX and UNIX tools as a problem-solving environment. Emphasis on the shell, files and directories, editing files, user process management, compiling, and debugging. Prerequisite: CS 241.
Ceg/Ee 260: Digital Computer Hardware Switching Circuits, Jack Jean
Ceg/Ee 260: Digital Computer Hardware Switching Circuits, Jack Jean
Computer Science & Engineering Syllabi
No abstract provided.
Cs 141: Computer Programming I, Eric Maston
Cs 141: Computer Programming I, Eric Maston
Computer Science & Engineering Syllabi
This course provides a general introduction to the fundamentals of computer programming.
Examples from and applications to a broad range of problems are given. No prior knowledge of
programming is assumed. The concepts covered will be applied to the Java programming language. (Students must register for both lecture and one laboratory section.)
Cs 141: Computer Programming I, Ronald F. Taylor
Cs 141: Computer Programming I, Ronald F. Taylor
Computer Science & Engineering Syllabi
This course provides a general introduction to the fundamentals of computer programming.
Examples from and applications to a broad range of problems are given. No prior knowledge of programming is
assumed. The concepts covered will be applied to the Java programming language. Students must register for both
lecture and one laboratory section. 4 credit hours. Prerequisite: MTH 127 (College Algebra) or equivalent.
Cs 205: Computer Literacy And Office Automation, Ann Tirpack
Cs 205: Computer Literacy And Office Automation, Ann Tirpack
Computer Science & Engineering Syllabi
To understand basic computer operations and the principal components of a computer and connected peripheral devices. To understand and examine current operating systems, software utilities, device drivers and application software. To define and understand current storage technology and learn about logical file storage and
management.
To become proficient in using:
-Windows
-Word Processing Applications
-Spreadsheet Applications
-Database Applications
-Presentation Graphics Applications
To understand the basics of e-mail. To introduce networking concepts including the Internet and its components and web browser basics. To learn ways to protect your data and avoid computer disasters.
Cs 206: Advanced Concepts/Techniques And Software Productivity Tools, John P. Herzog
Cs 206: Advanced Concepts/Techniques And Software Productivity Tools, John P. Herzog
Computer Science & Engineering Syllabi
By the end of this course, the students will have a greater depth of understanding in the areas of spreadsheets, databases, and presentation software using Microsoft Excel Access and PowerPoint.
Cs 205-07: Computer Literacy And Office Automation, John P. Herzog
Cs 205-07: Computer Literacy And Office Automation, John P. Herzog
Computer Science & Engineering Syllabi
Basic computer terminology, word processing, spreadsheets, databases, and graphics.
Cs 209: Computer Programming For Business Ii, Dennis Kellermeier
Cs 209: Computer Programming For Business Ii, Dennis Kellermeier
Computer Science & Engineering Syllabi
CS 209 is the second 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.