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

Engineering Commons™

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

Computer Engineering

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 21751 - 21780 of 25653

Full-Text Articles in Engineering

A New Approach Using Temporal Radial Basis Function In Chronological Series, Mustapha Guezouri Jan 2008

A New Approach Using Temporal Radial Basis Function In Chronological Series, Mustapha Guezouri

Turkish Journal of Electrical Engineering and Computer Sciences

In this paper, we present an extended form of Radial Basis Function network called Temporal-RBF (T-RBF) network. This extended network can be used in decision rules and classification in Spatio-Temporal domain applications, like speech recognition, economic fluctuations, seismic measurements and robotics applications. We found that such a network complies with relative ease to constraints such as capacity of universal approximation, sensibility of node, local generalisation in receptive field, etc. For an optimal solution based on a probabilistic approach with a minimum of complexity, we propose two TRBF models (1 and 2). Application to the problem of Mackey-Glass time series has …

Go to article

Role Of Artificial Intelligence In The Reliability Evaluation Of Electric Power Systems, Chanan Singh, Lingfeng Wang Jan 2008

Role Of Artificial Intelligence In The Reliability Evaluation Of Electric Power Systems, Chanan Singh, Lingfeng Wang

Turkish Journal of Electrical Engineering and Computer Sciences

Every reliability analysis effort, in some way, involves searching the state space of the system for those states that represent the events of interest, typically failure of the system or a given node to meet the demand. This essentially translates into a search procedure to efficiently identify states to be examined and then using a mechanism to evaluate these states. Traditionally, reliability analysis methods are based either on an implicit or explicit enumeration process or Monte Carlo sampling. More recently, methods based on artificial intelligence have been investigated both as an alternative to Monte Carlo for the search process as …

Go to article

Dispersion Analysis Of The Adi-Fdtd And S-Fdtd Methods, Mehmet Kuşaf, Abdullah Y. Öztoprak Jan 2008

Dispersion Analysis Of The Adi-Fdtd And S-Fdtd Methods, Mehmet Kuşaf, Abdullah Y. Öztoprak

Turkish Journal of Electrical Engineering and Computer Sciences

Numerical dispersion performances of ADI-FDTD and S-FDTD methods have been compared. It has been shown that for time steps below the stability limits of the S-FDTD method it has much better dispersion performance compared with the ADI-FDTD method and that the S-FDTD method can be usefully employed for space increments in the order of \lambda/25 to \lambda/50.

Go to article

Power Distortion Issues In Wind Turbine Power Systems Under Transient States, Tadeusz Lobos, Jacek Rezmer, Tomasz Sikorski, Zbigniew Waclawek Jan 2008

Power Distortion Issues In Wind Turbine Power Systems Under Transient States, Tadeusz Lobos, Jacek Rezmer, Tomasz Sikorski, Zbigniew Waclawek

Turkish Journal of Electrical Engineering and Computer Sciences

In this paper time-frequency methods have been investigated for complex investigations of transient states in wind power plants. Application of parallel processing in time and frequency domain brought new findings in description of wind power plants working under transient conditions. Proposed algorithms represents standard Short-Time Fourier Transform (STFT) as well as alternative methods associated with Cohen's class: Choi-Williams Distribution (CWD) and Zhao-Atlas-Marks Distribution (ZAMD). In order to explore advantages and disadvantages of the method several experiments were performed using model of squirrel-cage induction machine connected directly to the grid. Investigated phenomena concerned power distortion caused by switching-on capacitor banks and …

Go to article

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

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

Go to article

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

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 …

Go to article

Software And Hardware Acceleration Of The Genomic Motif Finding Tool Phylonet, Justin Brown Jan 2008

Software And Hardware Acceleration Of The Genomic Motif Finding Tool Phylonet, Justin Brown

All Computer Science and Engineering Research

No abstract provided.

Go to article

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

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 …

Go to article

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 Jan 2008

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 …

Go to article

Deciding Joinability Modulo Ground Equations In Operational Type Theory, Adam Petcher, Aaron Stump Jan 2008

Deciding Joinability Modulo Ground Equations In Operational Type Theory, Adam Petcher, Aaron Stump

All Computer Science and Engineering Research

Operational Type Theory (OpTT) can be used to construct and check proofs related to programs, but the development of these proofs can be somewhat tedious. An algorithm is presented that can be used to automatically generate proofs of equality in OpTT. The algorithm takes as input a set of ground equations and two terms that should be tested for joinability modulo the supplied ground equations. The algorithm will equate the terms if and only if there exists an OpTT proof that can equate the two terms using only the proof rules related to evaluation under the operational semantics, symmetry, transitivity, …

Go to article

A Holistic Approach To Decentralized Structural Damage Localization Using Wireless Sensor Networks, Gregory Hackmann, Fei Sun, Nestor Castaneda, Chenyang Lu, Shirley Dyke Jan 2008

A Holistic Approach To Decentralized Structural Damage Localization Using Wireless Sensor Networks, Gregory Hackmann, Fei Sun, Nestor Castaneda, Chenyang Lu, Shirley Dyke

All Computer Science and Engineering Research

Wireless sensor networks (WSNs) have become an increasingly compelling platform for Structural Health Monitoring (SHM) applications, since they can be installed relatively inexpensively onto existing infrastructure. Existing approaches to SHM in WSNs typically address computing system issues or structural engineering techniques, but not both in conjunction. In this paper, we propose a holistic approach to SHM that integrates a decentralized computing architecture with the Damage Localization Assurance Criterion algorithm. In contrast to centralized approaches that require transporting large amounts of sensor data to a base station, our system pushes the execution of portions of the damage localization algorithm onto the …

Go to article

Defect-Tolerance And Testing For Configurable Nano-Crossbars, Mandar V. Joshi Jan 2008

Defect-Tolerance And Testing For Configurable Nano-Crossbars, Mandar V. Joshi

Masters Theses

"Moore's Law speculated a trend in computation technology in terms of number of transistors per unit area that would double roughly every two years. Even after 40 years of this prediction, current technologies have been following it successfully. There are however, certain physical limitations of current CMOS that would result in fundamental obstructions to continuation of Moore's Law. Although there is a debate amongst experts on how much time it would take for this to happen, it is certain that some entirely new paradigms for semiconductor electronics would be needed to replace CMOS and to delay the end of Moore's …

Go to article

Asynchronous Nanowire Crossbar Architecture For Manufacturability, Modularity And Robustness, Ravi Bonam Jan 2008

Asynchronous Nanowire Crossbar Architecture For Manufacturability, Modularity And Robustness, Ravi Bonam

Masters Theses

"This thesis spotlights the dawn of a promising new nanowire crossbar architecture, the Asynchronous crossbar architecture, in the form of three different articles. It combines the reduced size of the nanowire crossbar architecture with the clock-free nature of Null Conventional Logic, which are the primary advantages. The first paper explains the proposed architecture with illustrations, including the design of an optimized full adder. This architecture has an elementary structure termed as a Programmable Gate Macro Block (PGMB) which is analogous to a threshold gate in NCL. The other two papers concentrate on mapping and placement techniques which are important due …

Go to article

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

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 …

Go to article

Multi-Application Deployment In Integrated Sensing Systems Based On Quality Of Monitoring, Sangeeta Bhattacharya, Abusayeed Saifullah, Chenyang Lu, Gruia-Catalin Roman Jan 2008

Multi-Application Deployment In Integrated Sensing Systems Based On Quality Of Monitoring, Sangeeta Bhattacharya, Abusayeed Saifullah, Chenyang Lu, Gruia-Catalin Roman

All Computer Science and Engineering Research

No abstract provided.

Go to article

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

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

Go to article

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

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 …

Go to article

Reconfigurable Real-Time Middleware For Distributed Cyber-Physical Systems With Aperiodic Events, Yuanfang Zhang, Christopher Gill, Chenyang Lu Jan 2008

Reconfigurable Real-Time Middleware For Distributed Cyber-Physical Systems With Aperiodic Events, Yuanfang Zhang, Christopher Gill, Chenyang Lu

All Computer Science and Engineering Research

Different distributed cyber-physical systems must handle aperiodic and periodic events with diverse requirements. While existing real-time middleware such as Real-Time CORBA has shown promise as a platform for distributed systems with time constraints, it lacks flexible configuration mechanisms needed to manage end-to-end timing easily for a wide range of different cyber-physical systems with both aperiodic and periodic events. The primary contribution of this work is the design, implementation and performance evaluation of the first configurable component middleware services for admission control and load balancing of aperiodic and periodic event handling in distributed cyber-physical systems. Empirical results demonstrate the need for, …

Go to article

Transcriptome Analysis Of Alzheimer's Disease Identifies Links To Cardiovascular Disease, Monika Ray, Jianhua Ruan, Weixiong Zhang Jan 2008

Transcriptome Analysis Of Alzheimer's Disease Identifies Links To Cardiovascular Disease, Monika Ray, Jianhua Ruan, Weixiong Zhang

All Computer Science and Engineering Research

No abstract provided.

Go to article

Ceg 404/604-01: Wireless Sensor Networks, Bin Wang Jan 2008

Ceg 404/604-01: Wireless Sensor Networks, Bin Wang

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 860-01: Object-Oriented Programming, Krishnaprasad Thirunarayan Jan 2008

Ceg 860-01: Object-Oriented Programming, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course motivates the need for object-oriented programming, and studies, in detail, object-oriented programming techniques, languages, and technology. The lectures will focus on the foundations of OOP, while the student presentations will focus on the applications and extensions of Object Technology.

Go to article

Ceg 411/611-01: Microprocessor-Based System Design, Jack Jean Jan 2008

Ceg 411/611-01: Microprocessor-Based System Design, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

New Classes Of Codes For Cryptologists And Computer Scientists, Florentin Smarandache, W.B. Vasantha Kandasamy Jan 2008

New Classes Of Codes For Cryptologists And Computer Scientists, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

Historically a code refers to a cryptosystem that deals with linguistic units: words, phrases etc. We do not discuss such codes in this book. Here codes are message carriers or information storages or information transmitters which in time of need should not be decoded or read by an enemy or an intruder. When we use very abstract mathematics in using a specific code, it is difficult for non-mathematicians to make use of it. At the same time, one cannot compromise with the capacity of the codes. So the authors in this book have introduced several classes of codes which are …

Go to article

A Meta Analysis Of Critical Success Factors For Computer Technology Projects, Ross A. Baker Jan 2008

A Meta Analysis Of Critical Success Factors For Computer Technology Projects, Ross A. Baker

Theses

Project managers are continually in pursuit of a magic formula that will deliver a successful project. Companies arc interested in formulas for project success because billions of dollars arc wasted each year, in U.S.A. Information Technology projects alone. through poorly managed or failed projects. Failing projects arc not only bad for the individual project team members, but a failed project's impacts emanate outward to cause companies to decline or die. In addition, the targeted customers who receive inferior products, late products, or no products at all (due to project failures) are significantly impacted as well. Because failed computer technology projects …

Go to article

Cs 714-01: Machine Learning, Shaojun Wang Jan 2008

Cs 714-01: Machine Learning, Shaojun Wang

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 765-01: Foundations Of Neurocomputation, John C. Gallagher Jan 2008

Cs 765-01: Foundations Of Neurocomputation, John C. Gallagher

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.

Go to article

Cs 205-08: Introduction To Computers And Office Productivity Software, Kim Gros Jan 2008

Cs 205-08: Introduction To Computers And Office Productivity Software, Kim Gros

Computer Science & Engineering Syllabi

Focus on learning MS Office software applications including word processing (intermediate), spreadsheets, database 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.

Go to article

Cs 790-03: Services Science, Yong Pei Jan 2008

Cs 790-03: Services Science, Yong Pei

Computer Science & Engineering Syllabi

Service Science, Management, and Engineering (SSME), often referred to
as Services Science, is emerging as a distinct field of study. It
encompasses numerous areas relating to the increasing role of services
in the world economy. In this course we will focus primarily on
services computing, or the technical aspects of services science, and
secondarily on the allied economic, business, and organizational aspects

Go to article

Cs 142-01: Computer Programming - Ii, Michael Ondrasek Jan 2008

Cs 142-01: Computer Programming - Ii, Michael Ondrasek

Computer Science & Engineering Syllabi

The 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 handling runtime errors with an emphasis on program verification and testing. Students must register for both lecture and one laboratory section. 4 credit hours. Prerequisite: CS 141 (Computer Programming I) and MTH 127 (College Algebra) or equivalent.

Go to article

Cs 317-01: Numerical Methods Ii, Ronald F. Taylor Jan 2008

Cs 317-01: Numerical Methods Ii, Ronald F. Taylor

Computer Science & Engineering Syllabi

Continuation of CS/MTH/3161516. Introduction to numerical methods used in the sciences. Methods for solving matrix eigenvalue problems, initial value and boundary value problem for ordinary differential equations (ODEs). Study of standard types of partial differential equations (PDEs) with applications. Solution techniques for systems of nonlinear equations. Discussion of sources of error in numerical methods. Special topics and applications presented as schedule permits. Four credit hours.

Go to article

First Prev Next Last