Computer Sciences Commons^™

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.

Adaptive Critic Neural Network Force Controller For Atomic Force Microscope-Based Nanomanipulation, Qinmin Yang, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

Automating the task of nanomanipulation is extremely important since it is tedious for humans. This paper proposes an atomic force microscope (AFM) based force controller to push nano particles on the substrates. A block phase correlation-based algorithm is embedded into the controller for the compensation of the thermal drift which is considered as the main external uncertainty during nanomanipulation. Then, the interactive forces and dynamics between the tip and the particle, particle and the substrate are modeled and analyzed. Further, an adaptive critic NN controller based on adaptive dynamic programming algorithm is designed and the task of pushing nano particles …

Viz: A Visual Analysis Suite For Explaining Local Search Behavior, Steven Halim, Roland H. C. Yap, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algorithms are heuristic-based, it is hard to understand how to improve or tune them. We propose an interactive visualization tool, VIZ, meant for understanding the behavior of local search. VIZ uses animation of abstract search trajectories with other visualizations which are also animated in a VCR-like fashion to graphically playback the algorithm behavior. It combines generic visualizations applicable on arbitrary algorithms with algorithm and problem specific visualizations. We use a variety of techniques such as …

Two-Instant Reallocation In Two-Echelon Spare Parts Inventory Systems, Huawei Song, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

In this paper, we study the problem of deciding when and how to perform reallocation of existing spare parts in a multi-echelon reparable item inventory system. We present a mathematical model that solves the problem when there are two reallocation instants, in response to the open challenge post by Cao and Silver(2005) to consider two or more possible reallocations within a replenishment cycle.

Fault Arrangements And Their Effect On The Performance Of Wireless Sensor Networks, Dwayne Sayone Blai

Electrical & Computer Engineering Theses & Dissertations

Wireless sensor networks face many reliability challenges. The networks are deployed in open, hostile environments, making them easily susceptible to network failure. As a result, there are countless faults that can occur in sensor networks, from component failure to outside attacks. Outside attacks take place when an adversary gains control over a node or set of nodes in the network. Outside attackers can destroy a network in numerous ways such as random attacks, clustering attacks, search-based attacks, etc. The method and strategy used in each of these attacks directly affects the network's reliability. Understanding how these adversaries are positioned is …

Development And Testing Of A High-Speed Real-Time Kinematic Precise Dgps Positioning System Between Two Aircraft, Christopher J. Spinelli

Theses and Dissertations

This research involves the design, implementation, and testing of a high-speed, real-time kinematic, precise differential GPS positioning system for use in airborne applications such as automated aerial-refueling and close formation flying. Although many of the current ambiguity resolution techniques use the residuals from the least squares position estimation to determine the true ambiguity set, this thesis presents a novel approach to the ambiguity resolution problem, called the minimum indicator. Instead of assuming the ambiguity set with the lowest residuals is the true set, other special characteristics of the residuals are examined. This increases the confidence that the algorithm has selected …

An Instance-Based Structured Object Oriented Method For Co-Analysis/Co-Design Of Concurrent Embedded Systems, Matt Ryan, Xiaoqing Frank Liu, Bruce M. Mcmillin, Ying Cheng, Sule Simsek

Computer Science Faculty Research & Creative Works

The current object-oriented class-based approaches to hardware/software co-analysis/co-design of embedded systems are limited in their abilities to properly capture the structure of individual instances of hardware and software components and their interactions. This paper discusses a methodology to extend a structured objectoriented hardware/software co-design methodology based on the High Order Object-oriented Modeling Technique (HOOMT) to incorporate instance-based object and behavioral models. The instance-based structured object-oriented methodology will enable description of a system's structure based on individual instances of hardware and software components and specification of the interactions among them. In addition, lattices are introduced to specify the concurrent behavior of …

Query-Based Multicontexts For Knowledge Base Browsing: An Evaluation, Julien Tane, Philipp Cimiano, Pascal Hitzler

Computer Science and Engineering Faculty Publications

In [7], we introduced the query-based multicontext theory, which allows to define a virtual space of views on ontological data. Each view is then materialised as a formal context. While this formal context can be visualised in a usual formal concept analysis framework such as Conexp or ToscanaJ, [7] also briefly described how the approach allowed the creation of a novel navigation framework for knowledge bases. The principle of this navigation is based on supporting the user in defining pertinent views. The purpose of this article is to discuss the benefits of the browsing interface. This discussion is performed, …

Neural Network Based Decentralized Excitation Control Of Large Scale Power Systems, Wenxin Liu, Ganesh K. Venayagamoorthy, Donald C. Wunsch, David A. Cartes, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

This paper presents a neural network (NN) based decentralized excitation controller design for large scale power systems. The proposed controller design considers not only the dynamics of generators but also the algebraic constraints of the power flow equations. The control signals are calculated using only local signals. The transient stability and the coordination of the subsystem controllers can be guaranteed. NNs are used to approximate the unknown/imprecise dynamics of the local power system and the interconnections. All signals in the closed loop system are guaranteed to be uniformly ultimately bounded (UUB). Simulation results with a 3-machine power system demonstrate the …

Gaussian Mixture Models And Neural Networks For Automatic Speaker Identification, Usha Gayatri Chalkapally

Electrical & Computer Engineering Theses & Dissertations

Automatic Speaker Recognition is the process of automatically recognizing who is speaking on the basis of individual information contained in speech signals. This technique of Automatic Speaker Recognition makes it possible to use the speaker's voice to verify their identity and control access to services such as voice dialing, banking by telephone, telephone shopping, database access services, information services, voice mail, security control for confidential information areas, and remote access to computers.

In this thesis, the techniques of Gaussian Mixture Models and Neural Networks for Automatic Speaker Identification are presented. Algorithms for Speaker Identification using Gaussian Mixture Models were developed, …

An Operational Model For Mobile Sensor Cloud Management, Indrajeet Kalyankar

Electrical & Computer Engineering Theses & Dissertations

Mobile sensors provide a safe, cost effective method for gathering information in hazardous environments. When the hazardous environment is either unexplored, such as the surface of Mars, or unanticipated, such as the result of chemical contamination, it is desirable for a system to gather information with a minimal amount of outside control (localization, decision control, etc.) and prepositioned sensors. If one takes a look at the number of the sensors deployed on a scale, at the lower end is the sole, multipurpose sensor unit. The upper end deals with hordes of inexpensive, expendable sensors. In the middle, a cluster of …

An Adaptive Algorithm To Identify Ambiguous Prostate Capsule Boundary Lines For Three-Dimensional Reconstruction And Quantitation, Rania Yousry Hussein

Electrical & Computer Engineering Theses & Dissertations

Currently there are few parameters that are used to compare the efficiency of different methods of cancerous prostate surgical removal. An accurate assessment of the percentage and depth of extra-capsular soft tissue removed with the prostate by the various surgical techniques can help surgeons determine the appropriateness of surgical approaches. Additionally, an objective assessment can allow a particular surgeon to compare individual performance against a standard. In order to facilitate 3D reconstruction and objective analysis and thus provide more accurate quantitation results when analyzing specimens, it is essential to automatically identify the capsule line that separates the prostate gland tissue …

Learning As A Nonlinear Line Of Attraction For Pattern Association, Classification And Recognition, Ming-Jung Seow

Electrical & Computer Engineering Theses & Dissertations

Development of a mathematical model for learning a nonlinear line of attraction is presented in this dissertation, in contrast to the conventional recurrent neural network model in which the memory is stored in an attractive fixed point at discrete location in state space. A nonlinear line of attraction is the encapsulation of attractive fixed points scattered in state space as an attractive nonlinear line, describing patterns with similar characteristics as a family of patterns.

It is usually of prime imperative to guarantee the convergence of the dynamics of the recurrent network for associative learning and recall. We propose to alter …

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.

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 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 466/666: Formal Languages And Automata, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course introduces the theory of formal languages and automata. The primary focus is on the two methods of defining languages: using generators (e.g., grammars/regular expressions) and using recognizers (e.g., finite state machines). Along with presenting the fundamentals, this course will develop and examine relationships among the various specification methods for the regular languages and the context-free languages, in detail. Overall, we plan to cover the first seven chapters of the text book.

Cs 241: Computer Science Ii, Eric Maston

Computer Science & Engineering Syllabi

This course is the second in the Introduction to Computer Science (24X) series. It focuses on object oriented concepts and an introduction to data structures.

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 765: Foundations Of Neurocomputation, Mateen M. Rizki

Computer Science & Engineering Syllabi

This course is designed to help you develop a solid understanding of neural network algorithms and architectures. At the end of this course you should be able to read and critically evaluate most neural network papers published in major journals, (e.g. IEEE Transaction on Neural Networks, Neural Networks, and Neural Computation). In addition, you should be able to implement a broad range of network architectures and learning algorithms for a variety of applications.

Ceg 460/660-01: 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 partnered project.

Ceg 720-01: Computer Architecture, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course will introduce fundamental concepts and paradigms underlying the design of modern programming languages. For concreteness, we study the details of an object-oriented language (e.g. Java), and a functional language (e.g., Scheme). The overall goal is to enable comparison and evaluation of existing languages. The programming assignments will be coded in Java 5 and in Scheme.

Ceg 220-01: Introduction To C Programming For Engineers, Robert Helt

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

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 TTL, combinational logic design with MSI and LSI, busing, storage elements, and instrumentation. 3 hours lecture, 2 hours lab. Prerequisite: CS 241.

Ceg 333-01: Introduction To Unix, Eric Maston

Computer Science & Engineering Syllabi

Introduction to the use of UNIX and UNIX tools as a computing environment. Emphasis on the shell, files and directories, editing files, user process management, compiling, debugging and other tools such as document development.

Cs 240: Computer Science - I, Ronald F. Taylor

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced. Emphasis is on structured programming and stepwise refinement. For CS/CEG majors with familiarity of a high-level programming language. Prerequisite: MTH 130 (Precalculus) or MPL 5. 4 credit hours.

Socio-Economic Impacts Of Computer Viruses In Tanzania, M Victor

Tanzania Journal of Engineering and Technology (TJET)

This paper reports on a research project conducted with an objective of identifying and assessing various approaches used by different computer users (Management, System Administrators and end users) in Tanzania to combat computer viruses (CVs), and to assess users' awareness level on CVs. Specifically, the study aimed at assessing the awareness level on CVs to the Tanzanian business community; analyze the socio -economic impact caused by CVs in Tanzania and; assess existing methods, capacity and limitations on controlling CVs in Tanzania. Data was collected using both questionnaires and interview from financial institutions such as NBC and BOT, and telecommunications sector …

A Short Tutorial On Reconstructability Analysis, Martin Zwick

Complex Systems Faculty Publications and Presentations

This talk will present the basic ideas of Reconstructability Analysis. RA is a general modeling methodology developed in the systems community since the early 60s (pioneered by Ross Ashby) for exploratory (data mining, machine learning) and confirmatory modeling. RA is based in graph theory, set theory, information theory, and statistics. It is applicable to qualitative (nominal) and, via binning, to quantitative (continuous) data, with both statistical & non-statistical applications. It overlaps and augments more widely known methods, e.g., log-linear modeling and Bayesian networks.

Keywords: Reconstructability Analysis, Log-Linear Modeling, categorical data, multivariate statistics, exploratory modeling, confirmatory modeling

Apparatus And Method For Using Adaptive Algorithms To Exploit Sparsity In Target Weight Vectors In An Adaptive Channel Equalizer, Richard K. Martin, Robert C. Williamson, William A. Sethares

AFIT Patents

An apparatus and method is disclosed for using adaptive algorithms to exploit sparsity in target weight vectors in an adaptive channel equalizer. An adaptive algorithm comprises a selected value of a prior and a selected value of a cost function. The present invention comprises algorithms adapted for calculating adaptive equalizer coefficients for sparse transmission channels. The present invention provides sparse algorithms in the form of a Sparse Least Mean Squares (LMS) algorithm and a Sparse Constant Modulus Algorithm (CMA) and a Sparse Decision Directed (DD) algorithm.