Computer Engineering Commons^™

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 142: Computer Programming - Ii, Haiyun Bian

Computer Science & Engineering Syllabi

Concepts introduced in CS 141 are developed in greater detail and depth with the Java programming language. Topics include object oriented programming, graphics, development of user interfaces and exception handling. Student must register for both lecture and one lab section. Prerequisite: CS 141

Cs 214: Visual Basic Programming, Michael Ondrasek

Computer Science & Engineering Syllabi

This course provides a general introduction to the fundamentals of object computer programming. Examples from and applications to a broad range of problems are given. No prior knowledge of programming is assumed. However, students should have a familiarity with programming concepts. The concepts covered will be applied in the Visual Basic programming language. 4 credit hours.

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 s and in Scheme.

Cs 884: Advanced Topics In Programming Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

The primary focus of this course is the design and specification of the Object-Oriented language Java.

Composable Distributed Access Control And Integrity Policies For Query-Based Wireless Sensor Networks, David W. Marsh

Theses and Dissertations

An expected requirement of wireless sensor networks (WSN) is the support of a vast number of users while permitting limited access privileges. While WSN nodes have severe resource constraints, WSNs will need to restrict access to data, enforcing security policies to protect data within WSNs. To date, WSN security has largely been based on encryption and authentication schemes. WSN Authorization Specification Language (WASL) is specified and implemented using tools coded in JavaTM. WASL is a mechanism{independent policy language that can specify arbitrary, composable security policies. The construction, hybridization, and composition of well{known security models is demonstrated and shown to preserve …

Tailoring Metallodielectric Structures For Superresolution And Superguiding Applications In The Visible And Near-Ir Ranges, Domenico De Ceglia, Maria Antonietta Vincenti, M. G. Cappeddu, Marco Centini, Neset Akozbek, Antonella D'Orazio, Joseph W. Haus, Mark J. Bloemer, Michael Scalora

Electrical and Computer Engineering Faculty Publications

We discuss propagation effects in realistic, transparent, metallodielectric photonic band gap structures in the context of negative refraction and super-resolution in the visible and near infrared ranges. In the resonance tunneling regime, we find that for transverse-magnetic incident polarization, field localization effects contribute to a waveguiding phenomenon that makes it possible for the light to remain confined within a small fraction of a wavelength, without any transverse boundaries, due to the suppression of diffraction. This effect is related to negative refraction of the Poynting vector inside each metal layer, balanced by normal refraction inside the adjacent dielectric layer: The degree …

Hardware Algorithm Implementation For Mission Specific Processing, Jason W. Shirley

Theses and Dissertations

There is a need to expedite the process of designing military hardware to stay ahead of the adversary. The core of this project was to build reusable, synthesizeable libraries to make this a possibility. In order to build these libraries, Matlab® commands and functions, such as Conv2, Round, Floor, Pinv, etc., had to be converted into reusable VHDL modules. These modules make up reusable libraries for the Mission Specific Process (MSP) which will support AFRL/RY. The MSP allows the VLSI design process to be completed in a mere matter of days or months using an FPGA or ASIC design, as …

Semantic Components: A Model For Enhancing Retrieval Of Domain- Specific Information, Susan Loucette Price

Dissertations and Theses

Despite the success of general Internet search engines, information retrieval remains an incompletely solved problem. Our research focuses on supporting domain experts when they search domain-specific libraries to satisfy targeted information needs. The semantic components model introduces a schema specific to a particular document collection. A semantic component schema consists of a two-level hierarchy, document classes and semantic components. A document class represents a document grouping, such as topic type or document purpose. A semantic component is a characteristic type of information that occurs in a particular document class and represents an important aspect of the document’s main topic. …

Integrating Temporal Difference Methods And Self‐Organizing Neural Networks For Reinforcement Learning With Delayed Evaluative Feedback, Ah-Hwee Tan, Ning Lu, Dan Xiao

Research Collection School Of Computing and Information Systems

This paper presents a neural architecture for learning category nodes encoding mappings across multimodal patterns involving sensory inputs, actions, and rewards. By integrating adaptive resonance theory (ART) and temporal difference (TD) methods, the proposed neural model, called TD fusion architecture for learning, cognition, and navigation (TD-FALCON), enables an autonomous agent to adapt and function in a dynamic environment with immediate as well as delayed evaluative feedback (reinforcement) signals. TD-FALCON learns the value functions of the state-action space estimated through on-policy and off-policy TD learning methods, specifically state-action-reward-state-action (SARSA) and Q-learning. The learned value functions are then used to determine the …

Multimodal News Story Clustering With Pairwise Visual Near-Duplicate Constraint, Xiao Wu, Chong-Wah Ngo, Alexander G. Hauptmann

Research Collection School Of Computing and Information Systems

Story clustering is a critical step for news retrieval, topic mining, and summarization. Nonetheless, the task remains highly challenging owing to the fact that news topics exhibit clusters of varying densities, shapes, and sizes. Traditional algorithms are found to be ineffective in mining these types of clusters. This paper offers a new perspective by exploring the pairwise visual cues deriving from near-duplicate keyframes (NDK) for constraint-based clustering. We propose a constraint-driven co-clustering algorithm (CCC), which utilizes the near-duplicate constraints built on top of text, to mine topic-related stories and the outliers. With CCC, the duality between stories and their underlying …

Extracting, Representing And Mining Semantic Metadata From Text: Facilitating Knowledge Discovery In Biomedicine, Cartic Ramakrishnan

Browse all Theses and Dissertations

The information access paradigm offered by most contemporary text information systems is a search-and-sift paradigm where users have to manually glean and aggregate relevant information from the large number of documents that are typically returned in response to keyword queries. Expecting the users to glean and aggregate information has lead to several inadequacies in these information systems. Owing to the size of many text databases, search-and-sift is a very tedious often requiring repeated keyword searches refining or generalizing queries terms. A more serious limitation arises from the lack of automated mechanisms to aggregate content across different documents to discover new …

Technology-Aided Participative Methods In Environmental Assessment: An International Perspective, Ainhoa Gonzalez, Alan Gilmer, Ronan Foley, John Sweeney, John Fry

Articles

Provisions for citizen involvement in the assessment of potential environmental effects of certain plans, programmes and projects are present in current legislation. An international survey revealed that public participation is common practice in European and some other countries worldwide. However, a number of issues are observed to affect public involvement in EIA/SEA processes and expert opinion differs when evaluating the effectiveness of existing participative methods. Results suggest that technology-aided methods can improve traditional participation processes. In particular, GIS has the potential to increase community knowledge and enhance involvement by communicating information more effectively. Variable accessibility to technology and data quality …

Analysis Of Information Remaining On Hand Held Devices Offered For Sale On The Second Hand, Andy Jones, Craig Valli, Iain Sutherland

Journal of Digital Forensics, Security and Law

The ownership and use of mobile phones, Personal Digital Assistants and other hand held devices is now ubiquitous both for home and business use. The majority of these devices have a high initial cost, a relatively short period before they become obsolescent and a relatively low second hand value. As a result of this, when the devices are replaced, there are indications that they tend to be discarded. As technology has continued to develop, it has led to an increasing diversity in the number and type of devices that are available, and the processing power and the storage capacity of …

Optimization In Multi-Agent Systems : Structures And Procedures, Ingo Stengel

Theses

The main advantage for the use of agent technology is in the capacity of agents to represent the interests of individual entities and to act autonomously on their behalf. In multi-agent systems this involves communication, coordination and negotiation.

The focus of this dissertation is to find ways to optimize multi-agent systems at different levels by taking into consideration their structure and the procedures used. As optimization depends to a large extent on the problem to be solved, group forming scenarios, in which self-interested agents compete to form and join groups, have been selected here for consideration. Optimization issues are discussed …

Concept Detection: Convergence To Local Features And Opportunities Beyond, Shih-Fu Chang, Junfeng He, Yu-Gang Jiang, Elie El Khoury, Chong-Wah Ngo, Akira Yanagawa, Eric Zavesky

Research Collection School Of Computing and Information Systems

No abstract provided.

Functorial Coalgebraic Logic: The Case Of Many-Sorted Varieties, Alexander Kurz, Daniela Petrişan

Engineering Faculty Articles and Research

Following earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This paper makes two contributions. First, a previous result characterizing those functors that have presentations is generalized from endofunctors on one-sorted varieties to functors between many-sorted varieties. This yields an equational logic for the presheaf semantics of higher-order abstract syntax. As another application, we show how the move to functors between many-sorted varieties allows to modularly combine syntax and proof systems of different logics. Second, we show how to associate …

Generation Of High-Repetition-Rate Pulses Utilizing Cascaded Single Mode Fiber And Semiconductor Optical Amplifier, Jianwei Wu, Hai-Bo Bao

Turkish Journal of Electrical Engineering and Computer Sciences

To generate high-repetition-rate optical pulses, a novel and simple device is demonstrated, in which the cascaded single mode fiber (SMF) with negative third order dispersion and semiconductor optical amplifier (SOA) are adopted. Numerical research results show that let an optical pulse with center wavelength in zero dispersion wavelength of optical fiber transit in SMF for generating an oscillation pulse. Subsequently, the followed SOA is provided for amplification. As a consequence, the high-repetition-rate optical pulses can be obtained.

A Study On The Reliability Of Polyester Insulators Blended With Borax, Aysel Ersoy, Yasi̇n Özcelep, Ayten Kuntman

Turkish Journal of Electrical Engineering and Computer Sciences

Tracking is the main factor which limits the safe working electric stress of insulation in power system applications. Polymer samples have been tested in laboratory conditions according to ASTM D2303 on accelerated inclined plane tracking test. In this paper, a model based on improved Weibull statistics is proposed for estimating the breakdown time of polymeric insulating materials with borax. The confidence intervals of the Weibull shape parameter and the Weibull scale parameter are determined for the borax concentration values using the Weibull 7++ program.

Recent Advances In Perfectly Matched Layers In Finite Element Applications, Özlem Özgün, Mustafa Kuzuoğlu

Turkish Journal of Electrical Engineering and Computer Sciences

We present a comparative evaluation of two novel and practical perfectly matched layer (PML) implementations to the problem of mesh truncation in the finite element method (FEM): locally-conformal PML, and multi-center PML techniques. The most distinguished feature of these methods is the simplicity and flexibility to design conformal PMLs over challenging geometries, especially those with curvature discontinuities, in a straightforward way without using artificial absorbers. These methods are based on specially- and locally-defined complex coordinate transformations inside the PML region. They can easily be implemented in a conventional FEM by just replacing the nodal coordinates inside the PML region by …

Modeling Timed Component-Based Real-Time Systems, Huang-Ming Huang, Christopher Gill

All Computer Science and Engineering Research

Component based middleware helps to facilitate software reuse by separating application-specific concerns into modular components that are shielded from the concerns of other components and from the common concerns addressed by underlying middleware services. In real-time systems, concerns such as invocation rates, execution latencies, deadlines, and concurrency semantics cross-cut multiple component and middleware abstractions. Thus, the verification of these systems must consider features of the application components (e.g., their execution latencies and relative invocation rates) and of the supporting middleware (e.g., concurrency and scheduling) together. However, existing approaches only address a sub-set of the features that must be modeled in …

Scheduling For Reliable Execution In Autonomic Systems, Terry Tidwell, Robert Glaubius, Christopher Gill, William D. Smart

All Computer Science and Engineering Research

Scheduling the execution of multiple concurrent tasks on shared resources such as CPUs and network links is essential to ensuring the reliable operation of many autonomic systems. Well known techniques such as rate-monotonic scheduling can offer rigorous timing and preemption guarantees, but only under assumptions (i.e., a fixed set of tasks with well-known execution times and invocation rates) that do not hold in many autonomic systems. New hierarchical scheduling techniques are better suited to enforce the more flexible execution constraints and enforcement mechanisms that are required for autonomic systems, but a rigorous foundation for verifying and enforcing concurrency and timing …

Partial Program Admission By Path Enumeration, Michael Wilson, Ron Cytron, Jon Turner

All Computer Science and Engineering Research

Real-time systems on non-preemptive platforms require a means of bounding the execution time of programs for admission purposes. Worst-Case Execution Time (WCET) is most commonly used to bound program execution time. While bounding a program's WCET statically is possible, computing its true WCET is difficult without significant semantic knowledge. We present an algorithm for partial program admission, suited for non-preemptive platforms, using dynamic programming to perform explicit enumeration of program paths. Paths - possible or not - are bounded by the available execution time and admitted on a path-by-path basis without requiring semantic knowledge of the program beyond its Control …

Practical Schedulability Analysis For Generalized Sporadic Tasks In Distributed Real-Time Systems, Yuanfang Zhang, Donald K. Krecker, Christopher Gill, Chenyang Lu, Guatam H. Thaker

All Computer Science and Engineering Research

Existing off-line schedulability analysis for real-time systems can only handle periodic or sporadic tasks with known minimum inter-arrival times. Modeling sporadic tasks with fixed minimum inter-arrival times is a poor approximation for systems in which tasks arrive in bursts, but have longer intervals between the bursts. In such cases, schedulability analysis based on the existing sporadic task model is pessimistic and seriously overestimates the task's time demand. In this paper, we propose a generalized sporadic task model that characterizes arrival times more precisely than the traditional sporadic task model, and we develop a corresponding schedulability analysis that computes tighter bounds …

Local Neighborhoods For Shape Classification And Normal Estimation, Cindy Grimm, William Smart

All Computer Science and Engineering Research

We introduce the concept of local neighborhoods, a generalization of the one-ring on a mesh to unlabeled 3D data points arising from sampling a 2D surface embedded in 3D. The local neighborhood supports both local shape classification and robust normal estimation. In particular, local neighborhoods out-perform traditional approaches in unevenly sampled, curved regions. We show that the local neighborhood can be used in place of a full mesh structure for applications such as smoothing, moving least-squares reconstruction, and parameterization. Longer version of paper submitted to CAGD

Financial Monte Carlo Simulation On Architecturally Diverse Systems, Naveen Singla, Michael Hall, Berkley Shands, Roger D. Chamberlain

All Computer Science and Engineering Research

Computational finance relies heavily on the use of Monte Carlo simulation techniques. However, Monte Carlo simulation is computationally very demanding. We demonstrate the use of architecturally diverse systems to accelerate the performance of these simulations, exploiting both graphics processing units and field-programmable gate arrays. Performance results include a speedup of 74× relative to an 8 core multiprocessor system (180× relative to a single processor core).

A Practical Schedulability Analysis For Generalized Sporadic Tasks In Distributed Real-Time Systems, Yuanfang Zhang, Donald K. Krecker, Christopher Gill, Chenyang Lu, Guatam H. Thakar

All Computer Science and Engineering Research

Existing off-line schedulability analysis for real-time systems can only handle periodic or sporadic tasks with known minimum inter-arrival times. Modeling sporadic tasks with fixed minimum inter-arrival times is a poor approximation for systems in which tasks arrive in bursts, but have longer intervals between the bursts. In such cases, schedulability analysis based on the existing sporadic task model is pessimistic and seriously overestimates the task's time demand. In this paper, we propose a generalized sporadic task model that characterizes arrival times more precisely than the traditional sporadic task model, and we develop a corresponding schedulability analysis that computes tighter bounds …

Reliable Data Collection From Mobile Users For Real-Time Clinical Monitoring, Octav Chipara, Christopher Brooks, Sangeeta Bhattacharya, Chenyang Lu

All Computer Science and Engineering Research

Real-time patient monitoring is critical to early detection of clinical patient deterioration in general hospital wards. A key challenge in such applications is to reliably deliver sensor data from mobile patients. We present an empirical analysis on the reliability of data collection from wireless pulse oximeters attached to users. We observe that most packet loss occur from mobile users to their first-hop relays. Based on this insight we developed the Dynamic Relay Association Protocol (DRAP), a simple and effective mechanism for dynamically discovering the right relays for wireless sensors attached to mobile users. DRAP enables highly reliable data collection from …

Real-Time Performance And Middleware On Multicore Linux Platforms, Yuanfang Zhang, Christopher Gill, Chenyang Lu

All Computer Science and Engineering Research

An increasing number of distributed real-time applications are running on multicore platforms. However, existing real-time middleware (e.g., Real-Time CORBA) lacks support for scheduling soft real-time tasks on multicore platforms while guaranteeing their time constraints will be satisfied. This paper makes three contributions to the state of the art in real-time system software for multicore platforms. First, it offers what is to our knowledge the first experimental analysis of real-time performance for vanilla Linux primitives on multicore platforms. Second, it presents MC-ORB, the first real-time object request broker (ORB), designed to exploit the features of multicore platforms, with admission control and …

Verification Of Component-Based Distributed Real-Time Systems, Huang-Ming Huang, Christopher Gill

All Computer Science and Engineering Research

Component-based software architectures enable reuse by separating application-specific concerns into modular components that are shielded from each other and from common concerns addressed by underlying services. Even so, concerns such as invocation rates, execution latencies, deadlines, and concurrency and scheduling semantics still cross-cut component boundaries in many real-time systems. Verification of these systems therefore must consider how composition of components relates to timing, resource utilization, and other properties. However, existing approaches only address a sub-set of the concerns that must be modeled in component-based distributed real-time systems, and a new more comprehensive approach is thus needed. To address that need, …