Computer Engineering Commons^™

Ceg 770-01: Computer Engineering Mathematics, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 2350: Os Concepts And Usage, Prabhaker Mateti

Computer Science & Engineering Syllabi

Introduction to Linux and Windows systems. GUT and Windowing Systems. Files and Directories. Ownership and Sharing. Programs and Processes. System calls, Libraries. Loading. Dynamic linking. Command Line Shells. Scripting languages. Regular expressions. Clients and Servers. Web browser clients and servers. Secure shell, sftp. SSL/TSL. HTTPS. System Administration. 4 credit hours. 3 hours lectures, 2 hours labs. Prerequisites: CS 240 or CS 220 or equivalent.

A Survey Of Techniques And Challenges In Underwater Localization, Hwee-Pink Tan, Roee Diamant, Winston K. G. Seah, Marc Waldmeyer

Research Collection School Of Computing and Information Systems

Underwater Wireless Sensor Networks (UWSNs) are expected to support a variety of civilian and military applications. Sensed data can only be interpreted meaningfully when referenced to the location of the sensor, making localization an important problem. While global positioning system (GPS) receivers are commonly used in terrestrial WSNs to achieve this, this is infeasible in UWSNs as GPS signals do not propagate through water. Acoustic communications is the most promising mode of communication underwater. However, underwater acoustic channels are characterized by harsh physical layer conditions with low bandwidth, high propagation delay and high bit error rate. Moreover, the variable speed …

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

Pandaa: Physical Arrangement Detection Of Networked Devices Through Ambient-Sound Awareness, Zheng Sun, Aveek Purohit, Kaifei Chen, Shijia Pan, Trevor Pering, Pei Zhang

Zheng Sun

Future ubiquitous home environments can contain 10s or 100s of devices. Ubiquitous services running on these devices (i.e. localizing users, routing, security algorithms) will commonly require an accurate location of each device. In order to obtain these locations, existing techniques require either a manual survey, active sound sources, or estimation using wireless radios. These techniques, however, need additional hardware capabilities and are intrusive to the user. Non-intrusive, automatic localization of ubiquitous computing devices in the home has the potential to greatly facilitate device deployments.

This paper presents the PANDAA system, a zero-configuration spatial localization system for networked devices based on …

Pandaa: Physical Arrangement Detection Of Networked Devices Through Ambient-Sound Awareness, Zheng Sun, Aveek Purohit, Kaifei Chen, Shijia Pan, Trevor Pering, Pei Zhang

Aveek Purohit

Future ubiquitous home environments can contain 10s or 100s of devices. Ubiquitous services running on these devices (i.e. localizing users, routing, security algorithms) will commonly require an accurate location of each device. In order to obtain these locations, existing techniques require either a manual survey, active sound sources, or estimation using wireless radios. These techniques, however, need additional hardware capabilities and are intrusive to the user. Non-intrusive, automatic localization of ubiquitous computing devices in the home has the potential to greatly facilitate device deployments.

This paper presents the PANDAA system, a zero-configuration spatial localization system for networked devices based on …

On Co-Optimization Of Constrained Satisfiability Problems For Hardware Software Applications, Kunal Ganeshpure

Doctoral Dissertations 1896 - February 2014

Manufacturing technology has permitted an exponential growth in transistor count and density. However, making efficient use of the available transistors in the design has become exceedingly difficult. Standard design flow involves synthesis, verification, placement and routing followed by final tape out of the design. Due to the presence of various undesirable effects like capacitive crosstalk, supply noise, high temperatures, etc., verification/validation of the design has become a challenging problem. Therefore, having a good design convergence may not be possible within the target time, due to a need for a large number of design iterations.

Capacitive crosstalk is one of the …

Pandaa: A Physical Arrangement Detection Technique For Networked Devices Through Ambient-Sound Awareness, Zheng Sun, Aveek Purohit, Philippe De Wagter, Irina Brinster, Chorom Hamm, Pei Zhang

Zheng Sun

This demo presents PANDAA, a zero-configuration automatic spatial localization technique for networked devices based on ambient sound sensing. We will demonstrate that after initial placement of the devices, ambient sounds, such as human speech, music, footsteps, finger snaps, hand claps, or coughs and sneezes, can be used to autonomously resolve the spatial relative arrangement of devices, such as mobile phones, using trigonometric bounds and successive approximation.

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

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

Department of Computer Science and Engineering: 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

Department of Computer Science and Engineering: 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

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

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

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

Department of Computer Science and Engineering: 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

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

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

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.

Ceg 241-01: Computer Programming Ii, Bin Wang

Computer Science & Engineering Syllabi

No abstract provided.

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 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 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 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 242: Computer Programming Iii, Yong Pei

Computer Science & Engineering Syllabi

No abstract provided.

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 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 720-01: Computer Architecture, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

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.

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.