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

Physical Sciences and Mathematics Commons™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 53341 - 53370 of 58023

Full-Text Articles in Physical Sciences and Mathematics

Heraldry And Programming Languages: The Complexity Of Natural Languages Examined Through The Parsing Of The Heraldic Blazon, Hans A. Mersinger Jan 1998

Heraldry And Programming Languages: The Complexity Of Natural Languages Examined Through The Parsing Of The Heraldic Blazon, Hans A. Mersinger

Honors Theses, 1963-2015

The idea of programming computers to understand human speech and written text has been the dream, even the Holy Grail, of computer scientists and many others, since before the first computers where created. Computers in countless movies and television shows have been able to understand, and therefore interact with, the humans around them but until recently this possibility has been pure science fiction. By studying, and then attempting, the methods of parsing the heraldic language, one hopes to show some of the methods that are used to remove the ambiguity in natural languages that hamper their parsing. Given time, I …

Go to article

Mass Transfer With Chemical Reaction In The Process Of Ammonia Desorption From Aqueous Solutions Containing Carbon Dioxide, Wojciech M. Budzianowski Jan 1998

Mass Transfer With Chemical Reaction In The Process Of Ammonia Desorption From Aqueous Solutions Containing Carbon Dioxide, Wojciech M. Budzianowski

Wojciech Budzianowski

No abstract provided.

Go to article

Archiv Der Pharmazie, Philadelphia University Jan 1998

Archiv Der Pharmazie, Philadelphia University

Philadelphia University, Jordan

No abstract provided.

Go to article

Simulation And Fpga Implementation Of A Simple Computer, Philadelphia University Jan 1998

Simulation And Fpga Implementation Of A Simple Computer, Philadelphia University

Philadelphia University, Jordan

No abstract provided.

Go to article

Use Of Robot Simulations Can Enhance Integration, Lisa Meeden, Doug Blank Jan 1998

Use Of Robot Simulations Can Enhance Integration, Lisa Meeden, Doug Blank

Computer Science Faculty Research and Scholarship

No abstract provided.

Go to article

Innovation Through Competition, Doug Blank, Lisa Meeden Jan 1998

Innovation Through Competition, Doug Blank, Lisa Meeden

Computer Science Faculty Research and Scholarship

No abstract provided.

Go to article

Interactive Gradebook: The Missing (Hyper)Link, Doug Blank, George Holmes, Ryan Wells, Pawel Wolinksi Jan 1998

Interactive Gradebook: The Missing (Hyper)Link, Doug Blank, George Holmes, Ryan Wells, Pawel Wolinksi

Computer Science Faculty Research and Scholarship

This paper introduces the notion of the "interactive gradebook," a new niche where intelligent and interactive technologies can help educators teach and students learn.

Go to article

Definitional Interpreters For Higher-Order Programming Languages, John C. Reynolds Jan 1998

Definitional Interpreters For Higher-Order Programming Languages, John C. Reynolds

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

Abstract. Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language such as pure LISP). Examples include McCarthy’s definition of LISP, Landin’s SECD machine, the Vienna definition of PL/I, Reynolds ’ definitions of GEDANKEN, and recent unpublished work by L. Morris and C. Wadsworth. Such definitions can be classified according to whether the interpreter contains higher-order functions, and whether the order of application (i.e., call by value versus call by name) in the defined …

Go to article

Dynamic Management Of Heterogeneous Resources, Jerrell Watts, Marc Rieffel, Stephen Taylor Jan 1998

Dynamic Management Of Heterogeneous Resources, Jerrell Watts, Marc Rieffel, Stephen Taylor

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

This paper presents techniques for dynamic load balancing in heterogeneous computing environments. That is, the techniques are designed for sets of machines with varying processing capabilities and memory capacities. These methods can also be applied to homogenous systems in which the effective compute speed or memory availability is reduced by the presence of other programs running outside the target computation. To handle heterogeneous systems, a precise distinction is made between an abstract quantity of work, which might be measured as the number of iterations of a loop or the count of some data structure, and the utilization of resources, measured …

Go to article

Skew-Insensitive Parallel Algorithms For Relational Join, Khaled Alsabti, Sanjay Ranka Jan 1998

Skew-Insensitive Parallel Algorithms For Relational Join, Khaled Alsabti, Sanjay Ranka

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

Join is the most important and expensive operation in relational databases. The parallel join operation is very sensitive to the presence of the data skew. In this paper, we present two new parallel join algorithms for coarse grained machines which work optimally in presence of arbitrary amount of data skew. The first algorithm is sort-based and the second is hash-based. Both of these algorithms employ a preprocessing phase (prior to the redistribution phase) to equally partition the work among the processors. The proposed algorithms have been designed for memory resident-data. However, they can be extended to disk resident-data. These algorithms …

Go to article

Visual Interactive Modeling In A Java-Based Hierarchical Modeling And Simulation System, Robert G. Sargent, Thorsten Daum Jan 1998

Visual Interactive Modeling In A Java-Based Hierarchical Modeling And Simulation System, Robert G. Sargent, Thorsten Daum

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

The desired set of properties of a modern simulation system is presented. The portion of the Hierarchical Modeling And Simulation System-Java (HiMASS-j) used for specifying Hierarchical Control Flow Graph (HCFG) Models is described. The specification of HCFG Models in HiMASS-j is by visual interactive modeling through the use of graphical user interfaces and dialog boxes. HCFG Models are specified using two complementary hierarchical specification structures: one to specify the components that comprise a model and how these components are interconnected, and the other to specify the behaviors of individual atomic components. A simulation of a traffic intersection using HiMASS-j is …

Go to article

Verification And Validation Of Simulation Models, Robert G. Sargent Jan 1998

Verification And Validation Of Simulation Models, Robert G. Sargent

Electrical Engineering and Computer Science - All Scholarship

This paper discusses verification and validation of simulation models. The different approaches to deciding model validity are presented; how model verification and validation relate to the model development process are discussed; various validation techniques are defined; conceptual model validity, model verification, operational validity, and data validity are described; ways to document results are given; and a recommended procedure is presented.

Go to article

A Global Communication Optimization Technique Based On Data-Flow Analysis And Linear Algebra, Mahmut Kandemir, P. Banerjee, Alok Choudhary, J. Ramanujam Jan 1998

A Global Communication Optimization Technique Based On Data-Flow Analysis And Linear Algebra, Mahmut Kandemir, P. Banerjee, Alok Choudhary, J. Ramanujam

Electrical Engineering and Computer Science - All Scholarship

Reducing communication overhead is extremely important in distributed-memory message-passing architectures. In this paper, we present a technique to improve communication that considers data access patterns of the entire program. Our approach is based on a combination of traditional data-flow analysis and a linear algebra framework, and works on structured programs with conditional statements and nested loops but without arbitrary goto statements. The distinctive features of the solution are the accuracy in keeping communication set information, support for general alignments and distributions including block-cyclic distributions and the ability to simulate some of the previous approaches with suitable modifications. We also show …

Go to article

Clouds: A Decision Tree Classifier For Large Datasets, Khaled Alsabti, Sanjay Ranka, Vineet Singh Jan 1998

Clouds: A Decision Tree Classifier For Large Datasets, Khaled Alsabti, Sanjay Ranka, Vineet Singh

Electrical Engineering and Computer Science - All Scholarship

Classification for very large datasets has many practical applications in data mining. Techniques such as discretization and dataset sampling can be used to scale up decision tree classifiers to large datasets. Unfortunately, both of these techniques can cause a significant loss in accuracy. We present a novel decision tree classifier called CLOUDS, which samples the splitting points for numeric attributes followed by an estimation step to narrow the search space of the best split. CLOUDS reduces computation and I/O complexity substantially compared to state of the art classifiers, while maintaining the quality of the generated trees in terms of accuracy …

Go to article

Design, Implementation, And Evaluation Of Parallell Pipelined Stap On Parallel Computers, Alok Choudhary, Wei-Keng Liao, Donald Weiner, Pramod Varshney, Richard Linderman, Mark Linderman Jan 1998

Design, Implementation, And Evaluation Of Parallell Pipelined Stap On Parallel Computers, Alok Choudhary, Wei-Keng Liao, Donald Weiner, Pramod Varshney, Richard Linderman, Mark Linderman

Electrical Engineering and Computer Science - All Scholarship

Performance results are presented for the design and implementation of parallel pipelined space-time adaptive processing (STAP) algorithms on parallel computers. In particular, the issues involved in parallelization, our approach to parallelization, and performance results on an Intel Paragon are described. The process of developing software for such an application on parallel computers when latency and throughput are both considered together is discussed and tradeoffs considered with respect to inter and intratask communication and data redistribution are presented. The results show that not only scalable performance was achieved for individual component tasks of STAP but linear speedups were obtained for the …

Go to article

Adaptive Linkage Crossover, Ayed A. Salman, Kishan Mehrotra, Chilukuri K. Mohan Jan 1998

Adaptive Linkage Crossover, Ayed A. Salman, Kishan Mehrotra, Chilukuri K. Mohan

Electrical Engineering and Computer Science - All Scholarship

Problem-specific knowledge is often implemented in search algorithms using heuristics to determine which search paths are to be explored at any given instant. As in other search methods, utilizing this knowledge will more quickly lead a genetic algorithm (GA) towards better results. In many problems, crucial knowledge is not found in individual components, but in the interrelations between those components. For such problems, we develop an interrelation (linkage) based crossover operator that has the advantage of liberating GAs from the constraints imposed by the fixed representations generally chosen for problems. The strength of linkages between components of a chromosomal structure …

Go to article

A Multithreaded Message-Passing System For High Performance Distributed Computing Applications, Sung-Yong Park, Joohan Lee, Salim Hariri Jan 1998

A Multithreaded Message-Passing System For High Performance Distributed Computing Applications, Sung-Yong Park, Joohan Lee, Salim Hariri

Electrical Engineering and Computer Science - All Scholarship

High Performance Distributed Computing (HPDC) applications require low-latency and high-throughput communication services and HPDC applications have different Quality of Service (QOS) requirements (e.g., bandwidth requirement, flow/error control algorithms, etc.). The communication services provided by traditional message-passing systems are fixed and thus can not be changed to meet the requirements of different HPDC applications. NYNET (ATM wide area network testbed in New York state) Communication System (NCS) is a multithreaded message-passing system developed at Syracuse University that provides high-performance and flexible communication services. In this paper, we overview the general architecture of NCS and present how NCS communication services are implemented. …

Go to article

Steady State Memetic Algorithm For Partial Shape Matching, Ender Ozcan, Chilukuri K. Mohan Jan 1998

Steady State Memetic Algorithm For Partial Shape Matching, Ender Ozcan, Chilukuri K. Mohan

Electrical Engineering and Computer Science - All Scholarship

Shape matching techniques are important in machine intelligence, especially in applications such as robotics. Currently, there are three major approaches to shape recognition: statistical, syntactic and neural approaches. This paper presents a fourth approach: evolutionary algorithms. A steady state memetic algorithm is shown to be successful in matching shapes even when they are partially obscured, and even in the presence of noise in the input image.

Go to article

Integrating Security Into The Curriculum, Cynthia E. Irvine, Shiu-Kai Chin, Deborah Frincke Jan 1998

Integrating Security Into The Curriculum, Cynthia E. Irvine, Shiu-Kai Chin, Deborah Frincke

Electrical Engineering and Computer Science - All Scholarship

The number of skilled practitioners of computer security who are able to address the complexities of modern technology and are familiar with successful approaches to system security is very small. People want security but are faced with two difficulties. First, they do not know how to achieve it in the context of their enterprises. They may not even know of a way to translate organizational procedures into policies, much less implement a set of mechanisms to enforce those policies. Second, they have no way of knowing whether their chosen mechanisms are effective. The recent US Presidential Commission on Critical Infrastructure …

Go to article

Partial Shape Matching Using Genetic Algorithms, Ender Ozcan, Chilukuri K. Mohan Jan 1998

Partial Shape Matching Using Genetic Algorithms, Ender Ozcan, Chilukuri K. Mohan

Electrical Engineering and Computer Science - All Scholarship

Shape recognition is a challenging task when images contain overlapping, noisy, occluded, partial shapes. This paper addresses the task of matching input shapes with model shapes described in terms of features such as line segments and angles. The quality of matching is gauged using a measure derived from attributed shape grammars. We apply genetic algorithms to the partial shape-matching task. Preliminary results, using model shapes with 6 to 70 features each, are extremely encouraging.

Go to article

The Design And Evaluation Of A Virtual Distributed Computing Environment, Haluk Topcuoglu, Salim Hariri, Dongmin Kim, Yoonhee Kim, Xue Bing Jan 1998

The Design And Evaluation Of A Virtual Distributed Computing Environment, Haluk Topcuoglu, Salim Hariri, Dongmin Kim, Yoonhee Kim, Xue Bing

Electrical Engineering and Computer Science - All Scholarship

In this paper we present the Virtual Distributed Computing Environment (VDCE), a metacomputing environment currently being developed at Syracuse University. VDCE provides an efficient web-based approach for developing, evaluating and visualizing large-scale distributed applications that are based on predefined task libraries on diverse platforms. The VDCE task libraries relieve end-users of tedious task implementations and also support reusability. The VDCE software architecture is described in terms of three modules: a) the Application Editor, a user-friendly application development environment that generates the Application Flow Graph (AFG) of an application; b) the Application Scheduler, which provides an efficient task-to-resource mapping of AFG; …

Go to article

An Efficient Parallel Algorithm For High Dimensional Similarity Join, Khaled Alsabti, Sanjay Ranka, Vineet Singh Jan 1998

An Efficient Parallel Algorithm For High Dimensional Similarity Join, Khaled Alsabti, Sanjay Ranka, Vineet Singh

Electrical Engineering and Computer Science - All Scholarship

Multidimensional similarity join finds pairs of multi-dimensional points that are within some small distance of each other: The 6-k-d-B tree has been proposed as a data structure that scales better as the number of dimensions in-creases compared to previous data structures. We present a cost model of the E-k-d-B tree and use it to optimize the leaf size. We present novel parallel algorithms for the similarity join using the E-k-d-B tree. A load-balancing strategy based on equi-depth histograms is shown to work well for uniform or low-skew situations, whereas another based on weighted equi-depth histograms works far better for high-skew …

Go to article

Secure Delegation For Distributed Object Environments, Nataraj Nagaratnam, Doug Lea Jan 1998

Secure Delegation For Distributed Object Environments, Nataraj Nagaratnam, Doug Lea

Electrical Engineering and Computer Science - All Scholarship

SDM is a Secure Delegation Model for Java-based distributed object environments. SDM extends current Java security features to support secure remote method invocations that may involve chains of delegated calls across distributed objects. The framework supports a control API for application developers to specify mechanisms and security policies surrounding simple or cascaded delegation. Delegation may also be disabled and optionally revoked. These policies may be controlled explicitly in application code, or implicitly via administrative tools.

Go to article

A Problem Solving Environment For Network Computing, Salim Hariri, Haluk Topcuoglu, Wojtek Furmanski, Dongmin Kim, Yoonhee Kim Jan 1998

A Problem Solving Environment For Network Computing, Salim Hariri, Haluk Topcuoglu, Wojtek Furmanski, Dongmin Kim, Yoonhee Kim

Electrical Engineering and Computer Science - All Scholarship

The current advances in high-speed networks and WWW technologies have made network computing a cost-effective high performance computing environment. New software development models and problem solving environments must be developed to utilize the network computing environment efficiently. In this paper we present Virtual Distributed Computing Environment (VDCE), which provides a problem solving environment for high-performance distributed computing over wide-area networks. VDCE enables scientists to develop distributed applications without knowing the detailed architecture of the underlying resources. VDCE provides well-defined library functions that relieve end users from tedious task implementations and it supports software reusability. The VDCE software architecture consists of …

Go to article

Automatic Granularity Control For Load Balancing Of Concurrent Particle Simulations, Marc Rieffel, Stephen Taylor, Jerrell Watts Jan 1998

Automatic Granularity Control For Load Balancing Of Concurrent Particle Simulations, Marc Rieffel, Stephen Taylor, Jerrell Watts

Electrical Engineering and Computer Science - All Scholarship

This paper demonstrates the use of automatic granularity control as part of dynamic load balancing for irregular, particle-based simulations. Performance optimization techniques are considered in the context of a concurrent Direct Simulation Monte Carlo method used to study the rarefied gas flow inside three-dimensional plasma reactors. Several computational techniques are used to reduce the overall time to deliver realistic threedimensional results. The effectiveness of dynamic load balancing and granularity control are presented for large-scale simulations on distributed-memory multicomputers.

Go to article

Automatic Granularity Control For Load Balancing Of Concurrent Particle Simulations, Marc Rieffel, Stephen Taylor, Jerrell Watts Jan 1998

Automatic Granularity Control For Load Balancing Of Concurrent Particle Simulations, Marc Rieffel, Stephen Taylor, Jerrell Watts

Electrical Engineering and Computer Science - All Scholarship

This paper demonstrates the use of automatic granularity control as part of dynamic load balancing for irregular, particle-based simulations. Performance optimization techniques are considered in the context of a concurrent Direct Simulation Monte Carlo method used to study the rarefied gas flow inside three-dimensional plasma reactors. Several computational techniques are used to reduce the overall time to deliver realistic threedimensional results. The effectiveness of dynamic load balancing and granularity control are presented for large-scale simulations on distributed-memory multicomputers.

Go to article

Performance Enhancement Using Intra-Server Caching In A Continuous Media Server, Chutimet Srinilta, Alok Choudhary Jan 1998

Performance Enhancement Using Intra-Server Caching In A Continuous Media Server, Chutimet Srinilta, Alok Choudhary

Electrical Engineering and Computer Science - All Scholarship

Continuity of stream playback is the crucial constraint in designing a continuous media server. From a distributed memory architectural model developed earlier, we found that there were many points where the stream capacity of the server could be improved. The stream capacity was usually limited by the storage bottlenecks. Serving streams from memory cache eliminates disk accesses and data transfers between nodes which, in turn, helps relieve those bottlenecks. However, the capacity of the server ultimately depends on client access pattern. Client request assignment has an impact on cache hit ratio as well as workload distribution. It is also the …

Go to article

Strictly Level-Decreasing Logic Programs, Pascal Hitzler, Anthony K. Seda Jan 1998

Strictly Level-Decreasing Logic Programs, Pascal Hitzler, Anthony K. Seda

Computer Science and Engineering Faculty Publications

We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic programs, have both a highly intuitive declarative semantics, given as a unique supported model, and are computationally adequate in the sense that every partial recursive function can be represented by some sld-program P. Allowing for a safe use of cuts, an interpreter based on SLDNF-resolution, as implemented for example in standard Prolog systems, is shown to be sound and complete with respect to this class of programs. Furthermore, we study connections between topological …

Go to article

The Hermite Cubic Collocation Approximation To The Eigenvalues And The Eigenfuntions Of The Laplace Operator, Wayne R. Dyksen Jan 1998

The Hermite Cubic Collocation Approximation To The Eigenvalues And The Eigenfuntions Of The Laplace Operator, Wayne R. Dyksen

Department of Computer Science Technical Reports

No abstract provided.

Go to article

The Simple Genetic Algorithm And The Walsh Transform: Part Ii, The Inverse, Michael D. Vose, Alden H. Wright Jan 1998

The Simple Genetic Algorithm And The Walsh Transform: Part Ii, The Inverse, Michael D. Vose, Alden H. Wright

Computer Science Faculty Publications

This paper continues the development, begun in Part I, of the relationship between the simple genetic algorithm and the Walsh transform. The mixing scheme (comprised of crossover and mutation) is essentially “triangularized” when expressed in terms of the Walsh basis. This leads to a formulation of the inverse of the expected next generation operator. The fixed points of the mixing scheme are also determined, and a formula is obtained giving the fixed point corresponding to any starting population. Geiringer's theorem follows from these results in the special case corresponding to zero mutation.

Go to article

First Prev Next Last