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

Engineering Commons™

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

Physical Sciences and Mathematics

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 34951 - 34980 of 40908

Full-Text Articles in Engineering

Buckets: Smart Objects For Digital Libraries, Michael L. Nelson Jan 2001

Buckets: Smart Objects For Digital Libraries, Michael L. Nelson

Computer Science Faculty Publications

Current discussion of digital libraries (DLs) is often dominated by the merits of the respective storage, search and retrieval functionality of archives, repositories, search engines, search interfaces and database systems. While these technologies are necessary for information management, the information content is more important than the systems used for its storage and retrieval. Digital information should have the same long-term survivability prospects as traditional hardcopy information and should be protected to the extent possible from evolving search engine technologies and vendor vagaries in database management systems. Information content and information retrieval systems should progress on independent paths and make limited …

Go to article

Meta-Genetic Programming: Co-Evolving The Operators Of Variation, Bruce Edmonds Jan 2001

Meta-Genetic Programming: Co-Evolving The Operators Of Variation, Bruce Edmonds

Turkish Journal of Electrical Engineering and Computer Sciences

The standard Genetic Programming approach is augmented by co-evolving the genetic operators. To do this the operators are coded as trees of indefinite length. In order for this technique to work, the language that the operators are defined in must be such that it preserves the variation in the base population. This technique can varied by adding further populations of operators and changing which populations act as operators for others, including itself, thus to provide a framework for a whole set of augmented GP techniques. The technique is tested on the parity problem. The pros and cons of the technique …

Go to article

Fuzzy Modeling Approach For Integrated Assessments Using Cultural Theory, Adnan Yazici, Fred E. Petry, Curt Pendergraft Jan 2001

Fuzzy Modeling Approach For Integrated Assessments Using Cultural Theory, Adnan Yazici, Fred E. Petry, Curt Pendergraft

Turkish Journal of Electrical Engineering and Computer Sciences

It has already been noted that the accurate prediction of societal responses requires the use of a formal model based on some social or cultural taxonomy. One such taxonomic candidate is Cultural Theory (CT). CT argues that all societies, irrespective of time or place, are informed by their underlying worldviews, which must be more or less Hierarchic, more or less Individualistic, more or less Egalitarian, and more or less Fatalistic. This approach appears to have a potential for cross-temporal and spatial comparisons that makes it a particularly attractive instrument for a study of the human dimensions of global climate change. …

Go to article

An Integrated Design-Object Modeling Environment -- Pluggable Metamodel Mechanism --, Masaharu Yoshioka, Takayuki Sekiya, Tetsuo Tomiyama Jan 2001

An Integrated Design-Object Modeling Environment -- Pluggable Metamodel Mechanism --, Masaharu Yoshioka, Takayuki Sekiya, Tetsuo Tomiyama

Turkish Journal of Electrical Engineering and Computer Sciences

We propose a new integrated computational environment to support design object modeling, during engineering design process that requires a variety of design object models, such as a geometric model, a control model, and a finite element model. To integrate multiple design object models, we have developed a mechanism called a metamodel mechanism that maintains consistency among various models. The metamodel mechanism represents relationships among concepts used in these models and is useful, for example, to conduct concurrent engineering practices. In this framework, we formalize a design process as operations to the metamodel. This paper expands the concept of the metamodel …

Go to article

Bag Distributed Real-Time Operating System And Task Migration, Beki̇r Tevfi̇k Akgün Jan 2001

Bag Distributed Real-Time Operating System And Task Migration, Beki̇r Tevfi̇k Akgün

Turkish Journal of Electrical Engineering and Computer Sciences

BAG is a distributed operating system designed for real-time applications which is run on a distributed real-time system. The heterogeneously distributed BAG system consists of nodes which have VME-bus chassis, different types of processor modules, and an interconnection network. The operating system has three main parts having distributed properties: task migration, load balancing and a distributed file system. Heterogeneous task migration is based on the extended finite state machine (EFSM) programming model. The EFMS model has also eased the implementation of the migration mechanism. The load balancing algorithm is centralized in one node. But the overall system will be a …

Go to article

All-Optical Networking, Altan Koçyi̇ği̇t, Demeter Gökişik, Semi̇h Bi̇lgen Jan 2001

All-Optical Networking, Altan Koçyi̇ği̇t, Demeter Gökişik, Semi̇h Bi̇lgen

Turkish Journal of Electrical Engineering and Computer Sciences

A survey of recent literature on all optical networking is presented. Starting from multiplexing techniques and topological features, network design and performance issues are reviewed. Particular attention is devoted to Wavelength Division Multiplexing (WDM) networks. Static and dynamic solutions of the routing and wavelength assignment (RWA) problem are considered. Issues of current research are summarized.

Go to article

Avalanche And Bit Independence Properties For The Ensembles Of Randomly Chosen N \Times N S-Boxes, Işil Vergi̇li̇, Melek D. Yücel Jan 2001

Avalanche And Bit Independence Properties For The Ensembles Of Randomly Chosen N \Times N S-Boxes, Işil Vergi̇li̇, Melek D. Yücel

Turkish Journal of Electrical Engineering and Computer Sciences

Cryptographic test methods such as avalanche, strict avalanche and bit independence criteria, which measure the degree of security of the s-boxes of substitution-permutation networks, are applied to randomly generated ensembles of ( n \times n \) s-boxes. Statistical analysis of experimental data directs the work towards defining ``relative errors'' and examining the avalanche and strict avalanche criteria within ``relative error ranges''. Histograms of relative errors in each ensemble are evaluated, and combining the results of different ensembles corresponding to different values of the s-box size, variations of maximum relative errors versus the size of the s-box are depicted. Some predictions …

Go to article

Performance Evaluation Of Safer K-64 And S-Boxes Of The Safer Family, Ekrem Aras, Melek D. Yücel Jan 2001

Performance Evaluation Of Safer K-64 And S-Boxes Of The Safer Family, Ekrem Aras, Melek D. Yücel

Turkish Journal of Electrical Engineering and Computer Sciences

If the characteristics of s-boxes of the SAFER family of ciphers are examined for the criteria of strict avalanche, bit independence, and XOR table distribution, experiments show that the ``exponentiating'' s-box has a weakness for an input difference of 128 (=10000000_{2}) and the ``logarithm-taking'' s-box has a weakness for an input difference of 253 (=11111101_{2}). However, since these experiments are performed by isolating the s-boxes from the general structure, they do not necessarily indicate a weakness in the overall algorithm. We propose a quick and rough test method, called the avalanche weight distribution criterion, to evaluate the overall performance of …

Go to article

A More Efficient Design And Implementation Of Cal Programs In Natural Science Using Object-Oriented Technology, Jurgen Friedrich Jan 2001

A More Efficient Design And Implementation Of Cal Programs In Natural Science Using Object-Oriented Technology, Jurgen Friedrich

Turkish Journal of Electrical Engineering and Computer Sciences

With the amount and complexity of science topics and applications increasing, the need for appropriate and effective science education is constantly growing. Computer-based education is very promising to help both teachers and learners in their difficult task, which involves complex psychological processes. This complexity is reflected in high demands on the design and implementation methods used to create computer-assisted learning (CAL) programs. Due to their concepts, flexibility, maintainability and extended library resources, object-oriented technology (OOT) is very suitable to producing this type of pedagogical tool. The introduced approach is demonstrated by a basketball simulation program for instruction in Newtonian mechanics …

Go to article

Ota-C Based Proportional-Integral-Derivative (Pid) Controller And Calculating Optimum Parameter Tolerances, Cevat Erdal, Ali̇ Toker, Cevdet Acar Jan 2001

Ota-C Based Proportional-Integral-Derivative (Pid) Controller And Calculating Optimum Parameter Tolerances, Cevat Erdal, Ali̇ Toker, Cevdet Acar

Turkish Journal of Electrical Engineering and Computer Sciences

Proportional-integral-derivative (PID) controllers are one of the most important control elements used in the process control industry. In practice, operational amplifiers are generally used in analog controllers. On the other hand, the operational transconductance amplifiers recently developed, which have some positive properties compared to operational amplifiers, are not used in analog controller design at present. Furthermore, the optimum parameter tolerances for the proposed PID circuit by the use of parameter sensitivities are determined. These tolerances keep the relative error at the output of the controller due to parameter variations in the tolerance region.

Go to article

Local Search And Encoding Schemes For Soft Constraint Minimization Problems, Michael P. Moran, Weixiong Zhang Jan 2001

Local Search And Encoding Schemes For Soft Constraint Minimization Problems, Michael P. Moran, Weixiong Zhang

All Computer Science and Engineering Research

Soft constraint minimization problems (SCMPs) contain hard constraints that cannot be violated and soft constraints that may be violated but carry penalties if not satisfied. In this paper, we first extend local search, WalkSAT in particular, to SCMPs and study the existing SAT encoding schemes for SCMPs. We propose a general encoding method called k-encoding. We then investigate the effects of local search neiborhood structures introduced by encoding schemes and analyze the anytime performance of extended WalkSAT using different encoding methods. Our experimental results on various graph coloring problems show that a direct extension of WalkSAT is most effective, and …

Go to article

Fuzzycast: Media Broadcasting For Multiple Asynchronous Receivers, Marcel Waldvogel, Wei Deng, Ramaprabhu Janakiraman Jan 2001

Fuzzycast: Media Broadcasting For Multiple Asynchronous Receivers, Marcel Waldvogel, Wei Deng, Ramaprabhu Janakiraman

All Computer Science and Engineering Research

When using an on-demand media streaming system on top of a network with Multicast support, it is sometimes more efficient to use broadcast to distribute popular content. There has been a lot of research in broadcasting on-demand content to multiple, asynchronous receivers. In this paper, we propose a family of novel, practical techniques for broadcasting on-demand media, which achieve lowest known server/network bandwidth usage and I/O efficient client buffer management, while retaining the simplicity of a frame-based single channel scheme.

Go to article

A Proposal For A Scalable Internet Multicast Architecture, Sherlia Shi Jan 2001

A Proposal For A Scalable Internet Multicast Architecture, Sherlia Shi

All Computer Science and Engineering Research

We propose a new network and system architecture for multicast in the Internet. Our main objectives are to find a cost-effective way to scale to a large number of multicast groups whose members are geographically dispersed, and to enable small and less capable devices to participate in group communications. In order to preserve the efficiency of data distribution gained by multicast, while avoiding the control complexity previously exhibited by IP multicast, we propose the use of an overlay network for multicast services. We construct "virtual" multicast trees, which consist of unicast connections joining multicast servers in the network. These servers …

Go to article

Aggregated Hierarchical Multicast For Active Networks, Tilman Wolf, Sumi Y. Choi Jan 2001

Aggregated Hierarchical Multicast For Active Networks, Tilman Wolf, Sumi Y. Choi

All Computer Science and Engineering Research

Active Networking is the basis for a range of new and innovative applications that make use of computational resources inside network routers. One such application is Aggregated Hierarchical Multicast, which aims at implementing efficient many-to-many communication. In certain scenarios it is possible to transmit less accurate, aggregated data and thus achieve better scalability. Using Active Networks, this aggregation computation can be done transparently by network routers without end system support. We present how aggregated data streams can be structured in a hierarchical fashion to allow easy access of data at the desired aggregation level. We introduce two application examples to …

Go to article

Dres: Internet Resource Management Using Deferred Reservations, Samphel Norden Jan 2001

Dres: Internet Resource Management Using Deferred Reservations, Samphel Norden

All Computer Science and Engineering Research

In this proposal, we consider the problem of resource reservation for Integrated Services (IntServ) and Differentiated Services (DiffServ) networks. Current approaches for resource reservation in INtegrated Service Networks adopt an all-or-nothing approach, where partially acquired resources must be released if resources are not available at all routers on the chosen path. Furthermore, under high load, end-systems must retry requests repeatedly leading to inefficient allocation and increased traffic. We propose a new approach called Deferred REServation (DERS) that substantially improves performance (reduces the overall cell rejection probability and increases link utilization) over the all-or-nothing reservation approach. Call admissibility is increased by …

Go to article

A Distributed Annotation System, Robin Dowell Jan 2001

A Distributed Annotation System, Robin Dowell

All Computer Science and Engineering Research

One goal of any genome project is the elucidation of hte primary sequence of DNA contained within a given species. While the availability ot the primary sequence itself is valuable, it does not reach its full potential until i has been annotated. Generally defined, annotation is descriptive information or commentary added to text, in this case genomic sequence. Without a mechanism for collecting, recording, and disseminating community-based annotation, a valuable source of information is severely diminshed. In this report I outline the design and implementation of a Distributed Annotation System (DAS). DAS allowes sequence annotations to be decentralized among multiple …

Go to article

Layered Protocol Wrappers For Internet Packet Processing In Reconfigurable Hardware, Florian Braun, John Lockwood, Marcel Waldvogel Jan 2001

Layered Protocol Wrappers For Internet Packet Processing In Reconfigurable Hardware, Florian Braun, John Lockwood, Marcel Waldvogel

All Computer Science and Engineering Research

The ongoing increases of line speed in the Internet backbone combined with the need for increased functionality of network devices presents a major challenge. These demands call for the use of reprogrammable hardware to provide the required flexible, high-speed functionality, at all network layers. The Field Programmable Port Extender (FPX) provides such an environment for development of networking components in reprogrammable hardware. We present a framework to streamline and simplify networking applications that process ATM cells, AAL5 frames, Internet Protocol (IP) packets and UDP datagrams directly in hardware.

Go to article

Phase Transitions And Backbones Of Constraint Minimization Problems, Weixiong Zhang Jan 2001

Phase Transitions And Backbones Of Constraint Minimization Problems, Weixiong Zhang

All Computer Science and Engineering Research

Many real-world problems involve constraints that cannot be all satisfied. The goal toward an overconstrained problem is to find solutions minimizing the total number of constraints violated. We call such a problem constraint minimization problem (CMP). We study the behavior of the phase transitions and backbones of CMP. We first investigate the relationship between the phase transitions of Boolean satisfiability, or precisely 3-SAT (a well-studied NP-complete decision problem), and the phase transitions of MAX 3-SAT (an NP-hard optimization problem). To bridge the gap between the easy-hard-easy phase transitions of 3-SAT, in which solutions of bounded quality, e.g., solutions with at …

Go to article

Routing In Overlay Multicast Networks, Sherlia Y. Shi, Jonathan S. Turner Jan 2001

Routing In Overlay Multicast Networks, Sherlia Y. Shi, Jonathan S. Turner

All Computer Science and Engineering Research

Multicast servises can be provided either as a basic network service or as an application-layer service. Higher level multicast implementations often provide more sophisticated features, and since they don't require network supoprt for multicast, they can provide multicast services, where no network layer support is available. Overlay multicast networks offer an intermediate option, potentially combining the flexibility and advanced features of application layer multicast with the greater efficiency of network layer multicast. Overlay multicast networks play an important role in the Internet. Indeed, since Internet Service Providers have been slow to enable IP multicast in their networks, Internet multicast is …

Go to article

Evaluation Of Motion-Jpeg2000 For Video Processing, Wei Yu, Ruibiao Qiu, Jason Fritts Jan 2001

Evaluation Of Motion-Jpeg2000 For Video Processing, Wei Yu, Ruibiao Qiu, Jason Fritts

All Computer Science and Engineering Research

The new ISO/ITU-T standard for still image coding, JPEG2000, has been shown to provide superior coding efficiency to the previous standard, JPEG. Because of the superb performance of JPEG2000, it is reasonable to argue that Motion-JPEG2000, the corresponding moving picture coding standard of JPEG2000, has equally outstanding performance. However, there has not been a sufficient performance evaluation of Motion-JPEG2000. To this end, we have studied the potential of Motion-JPEG2000 for video processing. Our experiments show that Motion-JPEG2000 provides high compression performance, strong error resilience, and good perceptual image quality. Together with a rich set of features inherited from JPEG2000, Motion-JPEG2000 …

Go to article

Placing Servers For Session-Oriented Services, Sumi Choi, Yuval Shavitt Jan 2001

Placing Servers For Session-Oriented Services, Sumi Choi, Yuval Shavitt

All Computer Science and Engineering Research

The provisioning of dynamic forms of services is becoming the main stream of today's network. In this paper, we focus on services assisted by network servers and different forms of associated sessions. We identify two types of services: transparent, where the session is unaware of the server location, and configurable, where the sessions need to be configured to use their closest server. For both types we formalize the problem of optimally placing network servers and introduce approximated solutions. We present simulation result of approximations and heuristics. We also solve the location problem optimally for a special topology. We show, through …

Go to article

Embedding Images In Non-Flat Spaces, Robert Pless Jan 2001

Embedding Images In Non-Flat Spaces, Robert Pless

All Computer Science and Engineering Research

Multi-dimensional scaling is an analysis tool which transforms pairwise distances between points to an embedding of points in space which are consistent with those distances. Two recent techniques in statistical patter recognition, locally linear embedding (LLE) and Isomap, give a mechanism for finding the structure underlying point sets for which comparisons or distances are only meaningful between nearby points. We give a direct method to extend the embedding algorithm to new topologies, finding the optimal embedding of points whose geodesic distance on a surface mathes the given pairwise distance measurements. Surfaces considered include spheres, cylinders, tori, and their higher dimensional …

Go to article

Relationship Between Two Generalized Images For Discrete And Differential Camera Motions, Robert Pless Jan 2001

Relationship Between Two Generalized Images For Discrete And Differential Camera Motions, Robert Pless

All Computer Science and Engineering Research

The recent popularity of catadioptic and multi-camera imaging systems indicates a need to create formal models for general, non-perspective camera geometries. Development of algorithmic tools for interpreting images from a generalized camera model will lead to a better understanding of how to design camera systems for particular tasks. Here we define the corollary to epi-polar constraints for standard cameras - the relationship between two images of a scene taken by generalized cameras from viewpoints related by discrete or differential motions.

Go to article

Formal Specification And Design Of Mobile Systems, Gruia-Catalin Roman, Christine Julien, Qingfeng Huang Jan 2001

Formal Specification And Design Of Mobile Systems, Gruia-Catalin Roman, Christine Julien, Qingfeng Huang

All Computer Science and Engineering Research

Termination detection, a classical problem in distributed computing, is revisited in the new setting provided by the emerging mobile computing technology. A simple solution tailored for use in ad hoc networks is employed as a vehicle for demonstrating the applicability of formal requirements and design strategies to the new field of mobile computing. The approach is based on well understood techniquest in specification refinement, but the methodology is tailored to mobile applications and helps designers address novel concerns such as the mobility of hosts, transient interactions, and specific coordination constructs. The proof logic and programming notation of Mobile UNITY provide …

Go to article

Parbit: A Tool To Transform Bitfiles To Implement Partial Reconfiguration Of Field Programmable Gate Arrays (Fpgas), Edson L. Horta, John W. Lockwood Jan 2001

Parbit: A Tool To Transform Bitfiles To Implement Partial Reconfiguration Of Field Programmable Gate Arrays (Fpgas), Edson L. Horta, John W. Lockwood

All Computer Science and Engineering Research

Field Programmable Gate Arrays (FPGAs) can be partially reconfigured to implement Dynamically loadable Hardware Plugin (DHP) modules. A tool called PARBIT has been developed that transforms FPGA configuration bitfiles to enable DHP modules. With this tool it is possible to define a partial reconfigurable area inside the FPGA and download it into a specified region of the FPGA device. One or more DHPs, with different sizes can be implemented using PARBIT.

Go to article

The Smart Port Card: An Embedded Unix Processor Architecture For Network Management And Active Networking, John D. Dehart, William D. Richard, Edward W. Spitznagel, David E. Taylor Jan 2001

The Smart Port Card: An Embedded Unix Processor Architecture For Network Management And Active Networking, John D. Dehart, William D. Richard, Edward W. Spitznagel, David E. Taylor

All Computer Science and Engineering Research

This paper describes the architecture of the Smart Port Card (SPC) designed for use with the Washington University Gigabit Switch. The SPC uses an embedded Intel Pentium processor running open-source NetBSD to support network management and active networking applications. The SPC physically connects between a switch port and a normal link adapter, allowing cell streams to be processed as they enter or leave the switch. In addition to the hardware architecture, this paper describes current and future applications for the SPC.

Go to article

Synthesizable Design Of A Multi-Module Memory Controller, Sarang Dharmapurikar, John W. Lockwood Jan 2001

Synthesizable Design Of A Multi-Module Memory Controller, Sarang Dharmapurikar, John W. Lockwood

All Computer Science and Engineering Research

Random Access Memory (RAM) is a common resources needed by networking hardware modules. Synchronous Dynamic RAM (SDRAM) provides a cost effective solution for such data storage. As the packet processing speeds in the hardware increase memory throughput can be a bottleneck to achieve overall high performance. Typically there are multiple hardware modules which perform different operations on the packet payload and hence all try to access the common packet buffer simultaneously. This gives rise to a need for a memory controller which arbitrates between the memory requests made by different modules and maximizes the memory throughput. This paper discusses the …

Go to article

Relying On Safe Distance To Ensure Consistent Group Membership In Ad Hoc Networks, Qingfeng Huang, Christine Julien, Gruia-Catalin Roman, Ali Hazemi Jan 2001

Relying On Safe Distance To Ensure Consistent Group Membership In Ad Hoc Networks, Qingfeng Huang, Christine Julien, Gruia-Catalin Roman, Ali Hazemi

All Computer Science and Engineering Research

The design of ad hoc mobile applications often requires the availability of a consistent view of the application state among the participating hosts. Such views are important because they simplify both the programming and verification tasks. Essential to constructing a consitent view is the ability to know what hosts are within proximity of each other, i.e., form a group in support of the particular application. In this paper we propose a protocol that allows hosts within communication range to maintain a consistent view of the group membership despite movement and frequent disconnections. The novel features of this protocol are its …

Go to article

Scalable Ip Lookup For Programmable Routers, David E. Taylor, John W. Lockwood, Todd Sproull, David B. Parlour Jan 2001

Scalable Ip Lookup For Programmable Routers, David E. Taylor, John W. Lockwood, Todd Sproull, David B. Parlour

All Computer Science and Engineering Research

Continuing growth in optical link speeds places increasing demands on the performance of Internet routers, while deployment of embedded and distributed network services imposes new demands for flexibility and programmability. IP adress lookup has become a significant performance bottleneck for the highest performance routers. New commercial products utilize dedicated Content Addressable Memory (CAM) devides to achieve high lookup speeds. This paper describes an efficient, scalable lookup engine design, able to achieve high-performance with the use of a small portion of a reconfigurable logic device and a commodity Random Access Memory (RAM) device. Based on Eatherton's Tree Bitmap algorithm [1] the …

Go to article

Legends As A Device For Interacting With Visualizations, Mihail E. Tudoreanu, Eileen Kraemer Jan 2001

Legends As A Device For Interacting With Visualizations, Mihail E. Tudoreanu, Eileen Kraemer

All Computer Science and Engineering Research

Users and developers of visualization tools must deal with the problem of specifying what information to show and how to represent it. Typically, the user's focus of interest will change over time, and the specifications must change with the user's interests. Techniques for the simple, direct, and intuitive creation and refinement of these specifications can be useful. In this paper we show how legends, a natural element of graphical displays, may be used as a direct and unobstrusive interaction device through which users may interactively specify new visualizations and animations.

Go to article

First Prev Next Last