Computer Engineering Commons^™

Cassava Pulp As A Biofuel Feedstock Of An Enzymatic Hydrolysis Proces, Djuma’Ali Djuma’Ali, Nonot Soewarno, Sumarno Sumarno, Dyah Primarini, Wahono Sumaryono

Makara Journal of Technology

Cassava pulp, a low cost solid byproduct of cassava starch industry, has been proposed as a high potential ethanolic fermentation substrate due to its high residual starch level, low ash content and small particle size of the lignocellulosic fibers. As the economic feasibility depends on complete degradation of the polysaccharides to fermentable glucose, the comparative hydrolytic potential of cassava pulp by six commercial enzymes were studied. Raw cassava pulp (12% w/v, particle sizeμm) hydrolyzed by both commercial pectinolytic (1) and amylolytic (2) enzymes cocktail, yielded 70.06% DE. Hydrothermal treatment of cassava pulp enhanced its susceptibility to enzymatic cleavageas compared to …

Alos/Palsar Image Processing Using Dinsar And Log Ratio For Flood Early Detection In Jakarta Based On Land Subsidences, Dodi Sudiana, Mia Rizkinia

Makara Journal of Technology

Flood that occurred in Jakarta is not only influenced by rainfall, urban planning system and drainage alone, but also may be involved land subsidence (LS). LS is possible in because Jakarta stands on top of layers of sediments and the presence of ground water consumption in very large quantities. In this research, the Advanced Land Observing Satellite (ALOS)/Phased Array type L-band Synthetic Aperture Radar (PALSAR) data was processed to determine the level of LS in Jakarta area and its relation to flood potential area. Differential interferometry method (DInSAR) was performed on two PALSAR data with different acquisition years, i.e. 2007 …

Estimating Correlation Under Interval Uncertainty, Ali Jalal-Kamali, Vladik Kreinovich

Departmental Technical Reports (CS)

In many engineering situations, we are interested in finding the correlation ρ between different quantities x and y based on the values x_i and y_i of these quantities measured in different situations i. Measurements are never absolutely accurate; it is therefore necessary to take this inaccuracy into account when estimating the correlation ρ. Sometimes, we know the probabilities of different values of measurement errors, but in many cases, we only know the upper bounds Δ_xi and Δ_yi on the corresponding measurement errors. In such situations, after we get the measurement results X_i and Y_{i …}

Measuring Stability Of Threshold-Based Feature Selection Techniques, Huanjing Wang, Taghi Khoshgoftaar

Computer Science Faculty Publications

Feature selection has been applied in many domains, such as text mining and software engineering. Ideally a feature selection technique should produce consistent out- puts regardless of minor variations in the input data. Re- searchers have recently begun to examine the stability (robustness) of feature selection techniques. The stability of a feature selection method is defined as the degree of agreement between its outputs to randomly-selected subsets of the same input data. This study evaluated the stability of 11 threshold-based feature ranking techniques (rankers) when applied to 16 real-world software measurement datasets of different sizes. Experimental results demonstrate that AUC …

Visko: Semantic Web Support For Information And Science Visualization, Nicholas Del Rio, Paulo Pinheiro Da Silva

Departmental Technical Reports (CS)

Constraint Problems: Computability Is Equivalent To Continuity, Martine Ceberio, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, we would like to compute the set of all possible values that satisfy given constraints. It is known that even for computable (constructive) constraints, computing such set is not always algorithmically possible. One reason for this algorithmic impossibility is that sometimes, the dependence of the desired set on the parameters of the problem is not continuous, while all computable functions of real variables are continuous. In this paper, we show that this discontinuity is the only case when the desired set cannot be computed. Specifically, we provide an algorithm that computes such a set for all …

Detecting Suspicious Behavior With Low-Cost Sensors, Ahren Alexander Reed

Master's Theses

A proof of concept is created that demonstrates how low-cost sensors and a simple software solution can be used to proactively detect IED placement. The main goal is to detect suspicious behavior; Specifically we derive requirements that loitering, meandering, improper location and object placement shall be detected. Current methods being used to detect Improvised Explosive Devices (IEDs) are costly in terms of equipment and risk to life, and many are retroactive; IED detection occurs long after explosives are placed. A prototype system is explored with the quality attributes of being low-cost, proactive and using simple software methods. A wireless sensor …

Construction Of An Np Problem With An Exponential Lower Bound, Roman V. Yampolskiy

Faculty and Staff Scholarship

In this paper we present a Hashed-Path Traveling Salesperson Problem (HPTSP), a new type of problem which has the interesting property of having no polynomial time solutions. Next we show that HPTSP is in the class NP by demonstrating that local information about sub-routes is insufficient to compute the complete value of each route. As a consequence, via Ladner"s theorem, we show that the class NPI is non-empty.

Signquote: A Remote Testing Facility For Eliciting Signed Qualitative Feedback, Jerry Schnepp, Rosalee Wolfe, Brent Shiver, John Mcdonald, Jorge Toro

Visual Communications and Technology Education Faculty Publications

Sign synthesis is still an evolving technology and improving it requires the elicitation of qualitative feedback from users. Current options for acquiring qualitative feedback are limited. Face-toface tests conducted in sign language are expensive. On the other hand, remote tests do not use the preferred language of the test participants. A new tool, SignQUOTE, (Signed Qualitative Usability Online Testing Environment) is a configurable, cross platform remote testing system based entirely on sign language. It includes an innovative method for capturing qualitative feedback in sign language via webcam. In a comparison study, participants viewed animations of American Sign Language and gave …

Electrostatically Tunable Meta-Atoms Integrated With In Situ Fabricated Mems Cantilever Beam Arrays, Ronald A. Coutu Jr., Peter J. Collins, Elizabeth A. Moore, Derrick Langley, Matthew E. Jussaume, Lavern A. Starman

Electrical and Computer Engineering Faculty Research and Publications

Two concentric split ring resonators (SRRs) or meta-atoms designed to have a resonant frequency of 14 GHz are integrated with microelectromechanical systems cantilever arrays to enable electrostatic tuning of the resonant frequency. The entire structure was fabricated monolithically to improve scalability and minimize losses from externally wire-bonded components. A cantilever array was fabricated in the gap of both the inner and outer SRRs and consisted of five evenly spaced beams with lengths ranging from 300 to 400 μm. The cantilevers pulled in between 15 and 24 V depending on the beam geometry. Each pulled-in beam increased the SRR gap capacitance …

Investigating The Effects Of Learning Speeds On Xpilot Agent Evolution, Gary Parker, Phil Fritzsche

Computer Science Faculty Publications

In this paper we present a comparison of the effects of varying play speeds on a genetic algorithm in the space combat game Xpilot. Xpilot-AI, an Xpilot add-on designed for testing learning systems, is used to evolve the controller for an Xpilot combat agent at varying frames per second to determine an optimal speed for learning. The controller is a rule-based system modified to work with a genetic algorithm that learns numeric parameters for the agent’s rule base. The goal of this research is to increase the quality and speed of standard learning algorithms in Xpilot as well as determine …

Fitness Biasing For The Box Pushing Task, Gary Parker, Jim O'Connor

Computer Science Faculty Publications

Anytime Learning with Fitness Biasing has been shown in previous works to be an effective tool for evolving hexapod gaits. In this paper, we present the use of Anytime Learning with Fitness Biasing to evolve the controller for a robot learning the box pushing task. The robot that was built for this task, was measured to create an accurate model. The model was used in simulation to test the effectiveness of Anytime Learning with Fitness Biasing for the box pushing task. This work is the first step in new research where an automated system to test the viability of Fitness …

Using Cyclic Genetic Algorithms To Learn Gaits For An Actual Quadruped Robot, Gary Parker, William T. Tarimo

Computer Science Faculty Publications

It is a difficult task to generate optimal walking gaits for mobile legged robots. Generating and coordinating an optimal gait involves continually repeating a series of actions in order to create a sustained movement. In this work, we present the use of a Cyclic Genetic Algorithm (CGA) to learn near optimal gaits for an actual quadruped servo-robot with three degrees of movement per leg. This robot was used to create a simulation model of the movement and states of the robot which included the robot’s unique features and capabilities. The CGA used this model to learn gaits that were optimized …

Towards Interval Techniques For Model Validation, Jaime Nava, Vladik Kreinovich

Departmental Technical Reports (CS)

Most physical models are approximate. It is therefore important to find out how accurate are the predictions of a given model. This can be done by validating the model, i.e., by comparing its predictions with the experimental data. In some practical situations, it is difficult to directly compare the predictions with the experimental data, since models usually contain (physically meaningful) parameters, and the exact values of these parameters are often not known. One way to overcome this difficulty is to get a statistical distribution of the corresponding parameters. Once we substitute these distributions into a model, we get statistical predictions …

Propagating Range (Uncertainty) And Continuity Information Through Computations: From Real-Valued Intervals To General Sets, Vladik Kreinovich

Departmental Technical Reports (CS)

One of the main problems of interval computations is to find an enclosure Y that contains the range f(X₁, ..., X_n) of a given function f(x₁, ..., x_n) over given intervals X₁, ..., X_n. Most of the techniques for estimating this range are based on propagating the range through computations. Specifically, we follow the computations of f(x₁, ..., x_n) step-by-step: we start with ranges X₁, ..., X_n of the inputs, and then we sequentially compute the enclosures for the ranges of …

Ceg 361/561-01: Introduction To Software Testing, John A. Reisner

Computer Science & Engineering Syllabi

This course covers software testing strategies, along with established best practices, so students team how to test their software in a complete and systematic (vice ad-hoc) manner. Particular attention is paid to planning, writing, and executing software tests, along with associated documentation, (i.e., a software test plan), which includes documented results. Various projects are assigned, designed to illustrate various challenges associated with software testing, and to reinforce the strategies and techniques used to overcome these challenges.

Ceg 702-01: Advanced Communication Networks, Bin Wang

Computer Science & Engineering Syllabi

This is a graduate level course on advanced computer communication and networking technologies. The course involves both a reading/lecture/discussion component and a project component. We will read papers on various aspects of advanced computer networking: LAN/WAN technologies, congestion/flow control, self-similar traffic analysis, queuing theory, link scheduling, routing, internetworking, multicast, wireless technologies, quality of services, and peer-to-peer networks. Various technical and research issues involved will be studied in depth.

Ceg 724-01: Computer Vision I, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

This course covers basic algorithms for low-level and mid-level vision. The algorithm; deal with edge detection and image segmentation, feature detection and matching, and image alignment. Also covered in the course are structure from motion, dense motion estimation, and stereo depth percepti011

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.

Ceg 260-01: Digital Computer Hardware And Switching Circuits, John C. Gallagher

Computer Science & Engineering Syllabi

This course covers the design and analysis of basic digital circuits for computation. Topics will Include number systems, basic Boolean algebra, combinational circuit design and analysis, basic Medium Scale Integration (MSI) components, basic memory devices, basic sequential circuits, and binary arithmetic. At the end of this course you should be able to design, optimize, and Implement combinational logic for a variety of applications. You should also be familiar with basic MSI components and sequential circuit concepts In preparation for more advanced study of computer architecture, sequential circuit analysis, design, and optimization.

Ceg 402/602-01: Introduction To Computer Communication, Bin Wang

Computer Science & Engineering Syllabi

This course provides an introduction to basic concepts of communication networks, different types of networks, protocols over different layers, and network applications through lectures, labs, homework, and reading on relevant materials. You will
•Understand networking principles, protocols, and technologies.
•Understand some design and performance issues involved in providing a network service.
•Acquire background for supporting e-commerce, e-government, and e-education.
•Gain hands-on experience with programming techniques for network protocols.
•Obtain background for original research in computer networks.

Cs 208: Computer Programming For Business I, David M. Hutchison

Computer Science & Engineering Syllabi

CS 208 Is the first In a sequence of two programming classes required for MIS majors. This course will Introduce students to the basic concepts of programming. Examples are from business applications and display graphics and emphasis Is on problem solving with the computer as a tool.

Cs/Mth 316/516: Survey Of Numerical Methods For Computational Science, Michael Linger

Computer Science & Engineering Syllabi

Introduction to numerical methods used in the sciences and engineering. Included will be methods for interpolation, data smoothing, integration, differentiation, and solution of systems of linear and nonlinear equations. Discussion of sources of error in numerical methods. Applications to science, engineering and applied mathematics are an integral part of the course. Special topics presented as schedule permits. Four hours lecture.

Cs 400/600: Data Structures And Software Design, Meilin Liu

Computer Science & Engineering Syllabi

This is a fundamental course for students majoring in Computer Science. Students will learn: basic algorithm analysis techniques; asymptotic complexity; big-0 and big-Omega notations; efficient algorithms for discrete structures including lists, trees, stacks, and graphs; fundamental computing algorithms including sorting, searching, and hashing techniques.

Cs 340: Programming Language Workshop In Python, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course is designed as a self-study in Python. You are expected to learn the language and solve a set of programming problems assigned to you from Budd's text using Python available from http://www.python.org. There are no exams. We officially meet only once in the quarter. However, I will be available in the posted office hours for clarifications and discussions about the programming problems.

Cs/Mth 410/610-01: Theoretical Foundations Of Computing, Sarah Gothard

Computer Science & Engineering Syllabi

Turing machines; partial-recursive functions; equivalence of computing paradigms; Church-Turing thesis; undecidability; intractability. Four hours lecture.

Cs 214: Visual Basic Programming, Eric Saunders

Computer Science & Engineering Syllabi

This course will cover the fundamentals of object-oriented computer programming; with an emphasis on design, structure, debugging, and testing. Visual Basic 2010 will be used for developing programs.

Cs 400/600: Date Structures And Algorithms, Keke Chen

Computer Science & Engineering Syllabi

This course will cover the introduction to the fundamentals of algorithm design and analysis, the implementation of classical data structures and control structures, and the basic problem solving techniques.

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 780: Compiler Design And Construction I, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course deals with the theory and practice of compiler design. Topics emphasized are scanning and parsing. If time permits, semantic analysis will also be covered.