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

Computer Engineering Commons™

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

Physical Sciences and Mathematics

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 10321 - 10350 of 13564

Full-Text Articles in Computer Engineering

A Study On Facility Planning Using Discrete Event Simulation: Case Study Of A Grain Delivery Terminal, Sarah M. Asio Jul 2011

A Study On Facility Planning Using Discrete Event Simulation: Case Study Of A Grain Delivery Terminal, Sarah M. Asio

Department of Industrial and Management Systems Engineering: Dissertations, Theses, and Student Research

The application of traditional approaches to the design of efficient facilities can be tedious and time consuming when uncertainty and a number of constraints exist. Queuing models and mathematical programming techniques are not able to capture the complex interaction between resources, the environment and space constraints for dynamic stochastic processes. In the following study discrete event simulation is applied to the facility planning process for a grain delivery terminal. The discrete event simulation approach has been applied to studies such as capacity planning and facility layout for a gasoline station and evaluating the resource requirements for a manufacturing facility. To …


A Reservation-Based Smart Parking System, Hongwei Wang Jul 2011

A Reservation-Based Smart Parking System, Hongwei Wang

School of Computing: Dissertations, Theses, and Student Research

In metropolitan areas, parking management influences drivers search time and cost for parking spaces, parking revenue, and traffic congestion. The wide deployment of wireless parking meters with sensing and communications capabilities allows the parking authority to monitor the state of each parking space in real time and optimize the parking management.

In this thesis, we study state-of-the-art parking policies in smart parking systems, and show that the smart parking system needs to be "smarter". Our design goals of the smart parking systems include: (1) simplify the operations of parking systems, (2) improve drivers' satisfaction, (3) increase parking revenue, and (4) …


A Hybrid Agent Architecture Integrating Desire, Intention And Reinforcement Learning, Ah-Hwee Tan, Yew-Soon Ong, Akejariyawong Tapanuj Jul 2011

A Hybrid Agent Architecture Integrating Desire, Intention And Reinforcement Learning, Ah-Hwee Tan, Yew-Soon Ong, Akejariyawong Tapanuj

Research Collection School Of Computing and Information Systems

This paper presents a hybrid agent architecture that integrates the behaviours of BDI agents, specifically desire and intention, with a neural network based reinforcement learner known as Temporal DifferenceFusion Architecture for Learning and COgNition (TD-FALCON). With the explicit maintenance of goals, the agent performs reinforcement learning with the awareness of its objectives instead of relying on external reinforcement signals. More importantly, the intention module equips the hybrid architecture with deliberative planning capabilities, enabling the agent to purposefully maintain an agenda of actions to perform and reducing the need of constantly sensing the environment. Through reinforcement learning, plans can also be …


Ceg 260-01: Digital Computer Hardware, Travis E. Doom Jul 2011

Ceg 260-01: Digital Computer Hardware, Travis E. Doom

Computer Science & Engineering Syllabi

Digital Computer Hardware. Topics include switching algebra and switching functions, logic design of combinational and sequential circuits using T1L, combinational logic design with MSI and LSI, busing, storage elements, and instrumentation. 3 hours lecture, 2 hours lab. Prerequisite: CS 241.


Cs 141: Computer Programming I, Vanessa Starkey Jul 2011

Cs 141: Computer Programming I, Vanessa Starkey

Computer Science & Engineering Syllabi

Introduction to use of computers as a problem-solving tool. Examples from and applications to a broad range of problems. Methodology for algorithm design and for structured modular implementation is stressed. Three hours lecture, two hours lab.


Cs 240: Computer Programming I, Vanessa Starkey Jul 2011

Cs 240: Computer Programming I, Vanessa Starkey

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced.
Emphasis is on problem solving and object oriented programming. This course provides a general introduction to the fundamentals of computer science and 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.


Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan Jul 2011

Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course will introduce fundamental concepts and paradigms underlying the design of modern multi-paradigm programming languages. For concreteness, we study the details of an object-oriented language (e.g. Java), and a functional language (e.g., scheme). The former is an exemplar of a language for programming-in-the-large, while the latter is an exemplar of programming-in-the-small. The overall goal is to enable comparison and evaluation of existing languages. 1he programming assignments will be coded in Java and in Scheme.


Cs 205: Introduction To Computers And Office Productivity Software, Amanda Hood Jul 2011

Cs 205: Introduction To Computers And Office Productivity Software, Amanda Hood

Computer Science & Engineering Syllabi

Focus on learning MS Office 2010 software applications including word processing (intermediate), spreadsheets, databases, and presentation graphics using a case study approach where critical thinking and problem solving skills are required. Computer concepts are integrated throughout the course to provide an understanding of the basics of computing, the latest technological advances and how they are used in industry. Ethics and issues encountered in business are discussed to challenge students on societal impact of technology.


Cs 242: Computer Programming Iii, Yong Pei Jul 2011

Cs 242: Computer Programming Iii, Yong Pei

Computer Science & Engineering Syllabi

No abstract provided.


Cs 415: Social Implications Of Computing, Leo Finkelstein Jul 2011

Cs 415: Social Implications Of Computing, Leo Finkelstein

Computer Science & Engineering Syllabi

CS 415 is a communication skills course using as its subject matter current salient issues associated with the social implications of computing. In addition to the course text, you will need to use certain reading materials in the library and elsewhere, and you will be responsible for using concepts and theories provided in class lectures and discussions.


Cs 766: Evolutionary Computation, John C. Gallagher Jul 2011

Cs 766: Evolutionary Computation, John C. Gallagher

Computer Science & Engineering Syllabi

This course explores evolutionary computation from a historical, theoretical, and application viewpoint. An overview of the most common evolutionary search techniques is presented. Specific topics include in the overview are: genetic algorithms, evolutionary programming, evolutionary strategies, and genetic programming. The fundamental issues driving the choice of problem representation and specific genetic operators are discussed. Various applications of evolutionary computation to problems in control, optimization, and pattern recognition are examined.


Ceg 220-01: Introduction To C Programming For Engineers, Dennis Kellermeier Jul 2011

Ceg 220-01: Introduction To C Programming For Engineers, Dennis Kellermeier

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. 4 credit hours. Prerequisite: MTH 229 (Calculus I) or EGR 101 (Engineering Mathematics). The course includes a scheduled laboratory section for which you must register.


Ceg 241-01: Computer Programming Ii, Bin Wang Jul 2011

Ceg 241-01: Computer Programming Ii, Bin Wang

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 720-01: Computer Architecture, Jack Jean Jul 2011

Ceg 720-01: Computer Architecture, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 730-01: Distributed Computing Principles, Soon M. Chung Jul 2011

Ceg 730-01: Distributed Computing Principles, Soon M. Chung

Computer Science & Engineering Syllabi

Communicating sequential processes, clients and servers, remote procedure calls, stub generation, weak and strong semaphores, split-binary semaphores, and distributed termination. 3 hours lecture and 2 hours lab.


Using The Web Infrastructure For Real Time Recovery Of Missing Web Pages, Martin Klein Jul 2011

Using The Web Infrastructure For Real Time Recovery Of Missing Web Pages, Martin Klein

Computer Science Theses & Dissertations

Given the dynamic nature of the World Wide Web, missing web pages, or "404 Page not Found" responses, are part of our web browsing experience. It is our intuition that information on the web is rarely completely lost, it is just missing. In whole or in part, content often moves from one URI to another and hence it just needs to be (re-)discovered. We evaluate several methods for a \justin- time" approach to web page preservation. We investigate the suitability of lexical signatures and web page titles to rediscover missing content. It is understood that web pages change over time …


Automatic High-Fidelity 3d Road Network Modeling, Jie Wang Jul 2011

Automatic High-Fidelity 3d Road Network Modeling, Jie Wang

Computational Modeling & Simulation Engineering Theses & Dissertations

Many computer applications such as racing games and driving simulations frequently make use of 3D high-fidelity road network models for a variety of purposes. However, there are very few existing methods for automatic generation of 3D realistic road networks, especially for those in the real world. On the other hand, vast road network GIS data have been collected in the past and used by a wide range of applications, such as navigation and evaluation. A method that can automatically produce 3D high-fidelity road network models from 2D real road GIS data will significantly reduce both the labor and time needed …


A Framework For Dynamic Traffic Monitoring Using Vehicular Ad-Hoc Networks, Mohammad Hadi Arbabi Jul 2011

A Framework For Dynamic Traffic Monitoring Using Vehicular Ad-Hoc Networks, Mohammad Hadi Arbabi

Computer Science Theses & Dissertations

Traffic management centers (TMCs) need high-quality data regarding the status of roadways for monitoring and delivering up-to-date traffic conditions to the traveling public. Currently this data is measured at static points on the roadway using technologies that have significant maintenance requirements. To obtain an accurate picture of traffic on any road section at any time requires a real-time probe of vehicles traveling in that section. We envision a near-term future where network communication devices are commonly included in new vehicles. These devices will allow vehicles to form vehicular networks allowing communication among themselves, other vehicles, and roadside units (RSUs) to …


Resizable, Scalable, Concurrent Hash Tables Via Relativistic Programming, Josh Triplett, Paul E. Mckenney, Jonathan Walpole Jun 2011

Resizable, Scalable, Concurrent Hash Tables Via Relativistic Programming, Josh Triplett, Paul E. Mckenney, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Presentation focusing on software synchronization, thread locking, transactional memory, and relativistic programming. Hash table algorithms are presented with examples of relativistic list insertion and removal, and related data structures. Existing approaches are compared to new methodologies and future work with relativistic data structures.


Resizable, Scalable, Concurrent Hash Tables, Josh Triplett, Paul E. Mckenney, Jonathan Walpole Jun 2011

Resizable, Scalable, Concurrent Hash Tables, Josh Triplett, Paul E. Mckenney, Jonathan Walpole

Computer Science Faculty Publications and Presentations

We present algorithms for shrinking and expanding a hash table while allowing concurrent, wait-free, linearly scalable lookups. These resize algorithms allow the hash table to maintain constant-time performance as the number of entries grows, and reclaim memory as the number of entries decreases, without delaying or disrupting readers.

We implemented our algorithms in the Linux kernel, to test their performance and scalability. Benchmarks show lookup scalability improved 125x over readerwriter locking, and 56% over the current state-of-the-art for Linux, with no performance degradation for lookups during a resize.

To achieve this performance, this hash table implementation uses a new concurrent …


Using Service Responsibility Tables To Supplement Uml In Analyzing E-Service Systems, Xin Tan, Steven Alter, Keng Siau Jun 2011

Using Service Responsibility Tables To Supplement Uml In Analyzing E-Service Systems, Xin Tan, Steven Alter, Keng Siau

Research Collection School Of Computing and Information Systems

This paper proposes using Service Responsibility Tables (SRTs) as a tool in analyzing e-service systems. First it discusses difficulties and deficiencies of using formal modeling languages such as UML in analyzing e-service systems. It proposes using SRTs as an informal language and lightweight analytical tool to be used by business professionals in analyzing e-service systems. SRTs are based on a service value chain framework but do not rely on abstract concepts and constructs, and therefore can be used by business professionals to supplement UML. We suggest a set of heuristics for transforming SRTs into two key UML diagrams, thereby illustrating …


Ios Mobile Device Forensics: Initial Analysis, Rita M. Barrios, Michael R. Lehrfeld May 2011

Ios Mobile Device Forensics: Initial Analysis, Rita M. Barrios, Michael R. Lehrfeld

Annual ADFSL Conference on Digital Forensics, Security and Law

The ability to recover forensic artifacts from mobile devices is proving to be an ever-increasing challenge for investigators. Coupling this with the ubiquity of mobile devices and the increasing complexity and processing power they contain results in a reliance on them by suspects. In investigating Apple’s iOS devices -- namely the iPhone and iPad -- an investigator’s challenges are increased due to the closed nature of the platforms. What is left is an extremely powerful and complex mobile tool that is inexpensive, small, and can be used in suspect activities. Little is known about the internal data structures of the …


Forensic Analysis Of Smartphones: The Android Data Extractor Lite (Adel), Felix Freiling, Michael Spreitzenbarth, Sven Schmitt May 2011

Forensic Analysis Of Smartphones: The Android Data Extractor Lite (Adel), Felix Freiling, Michael Spreitzenbarth, Sven Schmitt

Annual ADFSL Conference on Digital Forensics, Security and Law

Due to the ubiquitous use of smartphones, these devices become an increasingly important source of digital evidence in forensic investigations. Thus, the recovery of digital traces from smartphones often plays an essential role for the examination and clarification of the facts in a case. Although some tools already exist regarding the examination of smartphone data, there is still a strong demand to develop further methods and tools for forensic extraction and analysis of data that is stored on smartphones. In this paper we describe specifications of smartphones running Android. We further introduce a newly developed tool – called ADEL – …


Survey On Cloud Forensics And Critical Criteria For Cloud Forensic Capability: A Preliminary Analysis, Keyun Ruan, Ibrahim Baggili, Joe Carthy, Tahar Kechadi May 2011

Survey On Cloud Forensics And Critical Criteria For Cloud Forensic Capability: A Preliminary Analysis, Keyun Ruan, Ibrahim Baggili, Joe Carthy, Tahar Kechadi

Annual ADFSL Conference on Digital Forensics, Security and Law

In this paper we present the current results and analysis of the survey “Cloud forensics and critical criteria for cloud forensic capability” carried out towards digital forensic experts and practitioners. This survey was created in order to gain a better understanding on some of the key questions of the new field - cloud forensics - before further research and development. We aim to understand concepts such as its definition, the most challenging issues, most valuable research directions, and the critical criteria for cloud forensic capability.

Keywords: Cloud Forensics, Cloud Computing, Digital Forensics, Survey, Cloud Forensic Capability


Kindle Forensics: Acquisition & Analysis, Peter Hannay May 2011

Kindle Forensics: Acquisition & Analysis, Peter Hannay

Annual ADFSL Conference on Digital Forensics, Security and Law

The Amazon Kindle eBook reader supports a wide range of capabilities beyond reading books. This functionality includes an inbuilt cellular data connection known as Whispernet. The Kindle provides web browsing, an application framework, eBook delivery and other services over this connection. The historic data left by user interaction with this device may be of forensic interest. Analysis of the Amazon Kindle device has resulted in a method to reliably extract and interpret data from these devices in a forensically complete manner.

Keywords: forensics, digital forensics, kindle, mobile, embedded, ebook, ereader


Aacsb‐Accredited Schools’ Adoption Of Information Security Curriculum, Linda Lau, Cheryl Davis May 2011

Aacsb‐Accredited Schools’ Adoption Of Information Security Curriculum, Linda Lau, Cheryl Davis

Annual ADFSL Conference on Digital Forensics, Security and Law

The need to professionally and successfully conduct computer forensic investigations of incidents has never been greater. This has launched an increasing demand for a skilled computer security workforce (Locasto, et al., 2011). This paper examines the extent to which AACSB-accredited universities located in Virginia, Maryland and Washington, D.C. are working towards providing courses that will meet this demand. The authors conduct an online research of the information security courses and programs offered by the 27 AACSB-accredited business schools in the selected area.

The preliminary investigation revealed that eight of the 27 participating universities did not offer any courses in cybersecurity, …


Digital Forensics Investigation In A Collegiate Environment, Robert E. Johnston May 2011

Digital Forensics Investigation In A Collegiate Environment, Robert E. Johnston

Annual ADFSL Conference on Digital Forensics, Security and Law

Creating, building, managing a cost effective digital forensics lab including a team of qualified examiners can be a challenge for colleges [1] with multiple campuses in multiple towns, counties and states. Leaving such examination responsibilities to each of the campuses results in not only disparity in the results but more than likely excessive duplication of efforts as well as the potential for compromise of evidence. Centralizing the forensic efforts results in a team that is not subject to the political pressures of a campus and virtually eliminates the possibility of examiner favoritism. Learn what it takes to create a cost …


Backtrack In The Outback - A Preliminary Report On Cyber Security Evaluation Of Organisations In Western Australia, Craig Valli, Andrew Woodward, Peter Hannay May 2011

Backtrack In The Outback - A Preliminary Report On Cyber Security Evaluation Of Organisations In Western Australia, Craig Valli, Andrew Woodward, Peter Hannay

Annual ADFSL Conference on Digital Forensics, Security and Law

The authors were involved in extensive vulnerability assessment and penetration testing of over 15 large organisations across various industry sectors in the Perth CBD. The actual live testing involved a team of five people for approximately a four week period, and was black box testing. The scanning consisted of running network and web vulnerability tools, and in a few cases, exploiting vulnerability to establish validity of the tools. The tools were run in aggressive mode with no attempt made to deceive or avoid detection by IDS/IPS or firewalls. The aim of the testing was to determine firstly whether these organisations …


Creating Realistic Corpora For Security And Forensic Education, Kam Woods, Christopher A. Lee, Simson Garfinkel, David Dittrich, Adam Russell, Kris Kearton May 2011

Creating Realistic Corpora For Security And Forensic Education, Kam Woods, Christopher A. Lee, Simson Garfinkel, David Dittrich, Adam Russell, Kris Kearton

Annual ADFSL Conference on Digital Forensics, Security and Law

We present work on the design, implementation, distribution, and use of realistic forensic datasets to support digital forensics and security education. We describe in particular the “M57-Patents” scenario, a multi-modal corpus consisting of hard drive images, RAM images, network captures, and images from other devices typically found in forensics investigations such as USB drives and cellphones. Corpus creation has been performed as part of a scripted scenario; subsequently it is less “noisy” than real-world data but retains the complexity necessary to support a wide variety of forensic education activities. Realistic forensic corpora allow direct comparison of approaches and tools across …


Developing A Forensic Continuous Audit Model, Grover S. Kearns, Katherine J. Barker May 2011

Developing A Forensic Continuous Audit Model, Grover S. Kearns, Katherine J. Barker

Annual ADFSL Conference on Digital Forensics, Security and Law

Despite increased attention to internal controls and risk assessment, traditional audit approaches do not seem to be highly effective in uncovering the majority of frauds. Less than 20 percent of all occupational frauds are uncovered by auditors. Forensic accounting has recognized the need for automated approaches to fraud analysis yet research has not examined the benefits of forensic continuous auditing as a method to detect and deter corporate fraud. The purpose of this paper is to show how such an approach is possible. A model is presented that supports the acceptance of forensic continuous auditing by auditors and management as …