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

Computer Engineering Commons™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 9901 - 9930 of 13038

Full-Text Articles in Computer Engineering

A Novel Malware Target Recognition Architecture For Enhanced Cyberspace Situation Awareness, Thomas E. Dube Sep 2011

A Novel Malware Target Recognition Architecture For Enhanced Cyberspace Situation Awareness, Thomas E. Dube

Theses and Dissertations

The rapid transition of critical business processes to computer networks potentially exposes organizations to digital theft or corruption by advanced competitors. One tool used for these tasks is malware, because it circumvents legitimate authentication mechanisms. Malware is an epidemic problem for organizations of all types. This research proposes and evaluates a novel Malware Target Recognition (MaTR) architecture for malware detection and identification of propagation methods and payloads to enhance situation awareness in tactical scenarios using non-instruction-based, static heuristic features. MaTR achieves a 99.92% detection accuracy on known malware with false positive and false negative rates of 8.73e-4 and 8.03e-4 respectively. …


Extracting Forensic Artifacts From Windows O/S Memory, James S. Okolica, Gilbert L. Peterson Aug 2011

Extracting Forensic Artifacts From Windows O/S Memory, James S. Okolica, Gilbert L. Peterson

AFIT Documents

Memory analysis is a rapidly growing area in both digital forensics and cyber situational awareness (SA). Memory provides the most accurate snapshot of what is occurring on a computer at a moment in time. By combining it with event and network logs as well as the files present on the filesystem, an analyst can re-create much of what has occurred and is occuring on a computer. The Compiled Memory Analysis Tool (CMAT) takes either a disk image of memory from a Windows operating system or an interface into a virtual machine running a Windows operating system and extracts forensic artifacts …


Measuring Robustness Of Feature Selection Techniques On Software Engineering Datasets, Huanjing Wang, Taghi Khoshgoftaar, Randall Wald Aug 2011

Measuring Robustness Of Feature Selection Techniques On Software Engineering Datasets, Huanjing Wang, Taghi Khoshgoftaar, Randall Wald

Computer Science Faculty Publications

Feature Selection is a process which identifies irrelevant and redundant features from a high-dimensional dataset (that is, a dataset with many features), and removes these before further analysis is performed. Recently, the robustness (e.g., stability) of feature selection techniques has been studied, to examine the sensitivity of these techniques to changes in their input data. In this study, we investigate the robustness of six commonly used feature selection techniques as the magnitude of change to the datasets and the size of the selected feature subsets are varied. All experiments were conducted on 16 datasets from three real-world software projects. The …


Classification For Mass Spectra And Comprehensive Two-Dimensional Chromatograms, Xue Tian Aug 2011

Classification For Mass Spectra And Comprehensive Two-Dimensional Chromatograms, Xue Tian

School of Computing: Dissertations, Theses, and Student Research

Mass spectra contain characteristic information regarding the molecular structure and properties of compounds. The mass spectra of compounds from the same chemically related group are similar. Classification is one of the fundamental methodologies for analyzing mass spectral data. The primary goals of classification are to automatically group compounds based on their mass spectra, to find correlation between the properties of compounds and their mass spectra, and to provide a positive identification of unknown compounds.

This dissertation presents a new algorithm for the classification of mass spectra, the most similar neighbor with a probability-based spectrum similarity measure (MSN-PSSM). Experimental results demonstrate …


Molecular Dynamics Simulation Based On Hadoop Mapreduce, Chen He Jul 2011

Molecular Dynamics Simulation Based On Hadoop Mapreduce, Chen He

School of Computing: Dissertations, Theses, and Student Research

Molecular Dynamics (MD) simulation is a computationally intensive application used in multiple fields. It can exploit a distributed environment due to inherent computational parallelism. However, most of the existing implementations focus on performance enhancement. They may not provide fault-tolerance for every time-step.

MapReduce is a framework first proposed by Google for processing huge amounts of data in a distributed environment. The simplicity of the programming model and fault- tolerance for node failure during run-time make it very popular not only for commercial applications but also in scientific computing.

In this thesis, we develop a novel communication-free and each time-step fault- …


Network Security: A Review Of Salient Security Aspects Of The Universal Mobile Telecommunication System (Umts), F. Imran, M. Hussain Jul 2011

Network Security: A Review Of Salient Security Aspects Of The Universal Mobile Telecommunication System (Umts), F. Imran, M. Hussain

International Conference on Information and Communication Technologies

Wireless communication is known as key to global development. Wireless and mobile communication is gaining more importance in our life. Protecting information is one the aspects which we need to focus on the wireless networks. Universal mobile telecommunication system (UMTS) is evolution of the third generation mobile communication system. It was built on the success of global system for mobile communication (GSM). Universal mobile telecommunication system's security is also built on global system for mobile communication (GSM). The paper reviews the literature of the security aspects of the Universal mobile telecommunication system. A critical evaluation of the proposed solutions is …


Networks - Ii: Modified On Demand Transmission Power Control For Wireless Sensor Networks, Mirza M Yasir Masood, Ghufran Ahmed, Noor M. Khan Jul 2011

Networks - Ii: Modified On Demand Transmission Power Control For Wireless Sensor Networks, Mirza M Yasir Masood, Ghufran Ahmed, Noor M. Khan

International Conference on Information and Communication Technologies

On Demand Transmission Power Control (ODTPC) is a well known transmission power control strategy that is used to reduce high power consumption in wireless sensor networks (WSNs). In this paper, we propose an extension to ODTPC and thus, a modified version of ODTPC is proposed named MODTPC. Simulation results show that performance of MODTPC is better than ODTPC in terms of efficiency and energy saving.


Network Security: A Secure Architecture For Open Source Voip Solutions, Fahad Sattar, M. Hussain, Kashif Nisar Jul 2011

Network Security: A Secure Architecture For Open Source Voip Solutions, Fahad Sattar, M. Hussain, Kashif Nisar

International Conference on Information and Communication Technologies

Voice over IP “VoIP” is a form of voice speech that uses data networks, for transmission of voice traffic over IP-based networks to transmit voice signals. The signal is correctly encoded at one end of the communication channel, sent as packets through the data network, then decoded at the receiving end and transformed back into a voice signal. It has a potential and offering a choice to the traditional telephony systems due to its high resource utilization and cost efficiency. Meanwhile, Wireless Local Area Networks (WLANs) have become an ever present networking technology that has been deployed around the world. …


Real-Time Divisible Load Scheduling For Cluster Computing, Anwar Mamat Jul 2011

Real-Time Divisible Load Scheduling For Cluster Computing, Anwar Mamat

School of Computing: Dissertations, Theses, and Student Research

Cluster computing has become an important paradigm for solving large-scale problems. However, as the size of a cluster increases, so does the complexity of resource management and maintenance. Therefore, automated performance control and re- source management are expected to play critical roles in sustaining the evolution of cluster computing. The current cluster scheduling practice is similar in sophistication to early supercomputer batch scheduling algorithms, and no consideration is given to desired quality-of-service (QoS) attributes. To fully avail the power of computational clusters, new scheduling algorithms that provides high performance, QoS assurance, fault-tolerance, energy savings and streamlined management of the cluster …


Networks - I: Interference Mitigation In 4g System Using Smart Antenna, Asad Ali Siddiqui, Muhammad Mazhar Manzoor, Aamir Ijaz, Adnan Umar Khan, Imran Ahmed Awan, Sangita Lal Chand Jul 2011

Networks - I: Interference Mitigation In 4g System Using Smart Antenna, Asad Ali Siddiqui, Muhammad Mazhar Manzoor, Aamir Ijaz, Adnan Umar Khan, Imran Ahmed Awan, Sangita Lal Chand

International Conference on Information and Communication Technologies

Emerging trends of mobile communication and ever growing demand of mobile users with high speed data requirements and migrating towards 4G, Co-Channel interference and multipath in urban/dense urban environment will limit the capacity of the network. Smart antenna is now recognized by its higher user capacity in 4G wireless networks by efficiently reducing multipath and co-channel interference. Smart Antenna use adaptive beam forming algorithms in a dynamic environment continuously adjusting the weight of antenna arrays for creating a beam to track desired users automatically, and minimize interference from other users by placing nulls in their directions. This research work provides …


Artificial Intelligence – I: A Preliminary Framework For Human-Agent Communication In Electronic Negotiations, Moez Ur Rehman, Nosheen Riaz Jul 2011

Artificial Intelligence – I: A Preliminary Framework For Human-Agent Communication In Electronic Negotiations, Moez Ur Rehman, Nosheen Riaz

International Conference on Information and Communication Technologies

Electronic negotiations are business negotiations conducted via electronic means using information and communications technologies (ICT). Two dominant types of electronic negotiation systems are automated negotiation systems for software agents and negotiation support systems (NSSs) for humans. However, the integration of two types for human-agent negotiations is an important task. In this paper, an extended communication model for human-agent business negotiations is presented. For this purpose, the underlying communication models of automated negotiations and NSSs are analyzed. The extended communication model is based on a common negotiation ontology which captures the negotiation agenda and paves the way for such hybrid communication, …


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) …


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.


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 …


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 …


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 …


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.