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

Physical Sciences and Mathematics Commons™

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

Computer Sciences

PDF

2000

Institution
Keyword
Publication
Publication Type

Articles 31 - 60 of 372

Full-Text Articles in Physical Sciences and Mathematics

Semi-Regular Mesh Extraction From Volumes, Z. J. Wood, M. Desbrun, P. Schroder, D. Breen Oct 2000

Semi-Regular Mesh Extraction From Volumes, Z. J. Wood, M. Desbrun, P. Schroder, D. Breen

Computer Science and Software Engineering

We present a novel method to extract iso-surfaces from distance volumes. It generates high quality semi-regular multiresolution meshes of arbitrary topology. Our technique proceeds in two stages. First, a very coarse mesh with guaranteed topology is extracted. Subsequently an iterative multi-scale force-based solver refines the initial mesh into a semi-regular mesh with geometrically adaptive sampling rate and good aspect ratio triangles. The coarse mesh extraction is performed using a new approach we call surface wavefront propagation. A set of discrete iso-distance ribbons are rapidly built and connected while respecting the topology of the iso-surface implied by the data. Subsequent multi-scale …

Go to article

Robotic System Sensitivity To Neural Network Learning Rate: Theory, Simulation, And Experiments, Christopher M. Clark, James K. Mills Oct 2000

Robotic System Sensitivity To Neural Network Learning Rate: Theory, Simulation, And Experiments, Christopher M. Clark, James K. Mills

Computer Science and Software Engineering

Selection of neural network learning rates to obtain satisfactory performance from neural network controllers is a challenging problem. To assist in the selection of learning rates, this paper investigates robotic system sensitivity to neural network (NN) learning rate. The work reported here consists of experimental and simulation results. A neural network controller module, developed for the purpose of experimental evaluation of neural network controller performance of a CRS Robotics Corporation A460 robot, allows testing of NN controllers using real-time iterative learning. The A460 is equipped with a joint position proportional, integral, and derivative (PID) controller. The neural network module supplies …

Go to article

Classes Of Logic Programs Which Possess Unique Supported Models, Anthony K. Seda, Pascal Hitzler Oct 2000

Classes Of Logic Programs Which Possess Unique Supported Models, Anthony K. Seda, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Logic programming is concerned with the use of logic as a programming language. The main manifestation of this computing paradigm is in the various versions of Prolog which are now available, in which computation is viewed as deduction from sets of Horn clauses, although there is also growing interest in the related form known as answer set programming, see [10]. The reference [1] contains a good survey of the growth of logic programming over the last twenty-five years both as a stand-alone programming language and as a software component of large information systems. One advantage a logic program P has …

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 17, Number 2, October 2000, College Of Engineering And Computer Science, Wright State University Oct 2000

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 17, Number 2, October 2000, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Go to article

Performance Analysis Of Mobile Agents For Filtering Data Streams On Wireless Networks, David Kotz, George Cybenko, Robert S. Gray, Guofei Jiang, Ronald A. Peterson, Martin O. Hofmann, Daria A. Chacon, Kenneth R. Whitebread Oct 2000

Performance Analysis Of Mobile Agents For Filtering Data Streams On Wireless Networks, David Kotz, George Cybenko, Robert S. Gray, Guofei Jiang, Ronald A. Peterson, Martin O. Hofmann, Daria A. Chacon, Kenneth R. Whitebread

Computer Science Technical Reports

Wireless networks are an ideal environment for mobile agents, since their mobility allows them to move across an unreliable link to reside on a wired host, next to or closer to the resources that they need to use. Furthermore, client-specific data transformations can be moved across the wireless link and run on a wired gateway server, reducing bandwidth demands. In this paper we examine the tradeoffs faced when deciding whether to use mobile agents in a data-filtering application where numerous wireless clients filter information from a large data stream arriving across the wired network. We develop an analytical model and …

Go to article

Mol: Method Of Lines Application, John R. Rice, Mikel Luján Oct 2000

Mol: Method Of Lines Application, John R. Rice, Mikel Luján

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Side Collision Warning System For Transit Buses, Sue Mcneil, David Duggins, Christoph Mertz, Arne Suppe, Chuck Thorpe Oct 2000

Side Collision Warning System For Transit Buses, Sue Mcneil, David Duggins, Christoph Mertz, Arne Suppe, Chuck Thorpe

Research Collection School Of Computing and Information Systems

Transit buses are involved in many more accidents than other vehicles. Collision warning systems (CWS) are therefore placed most efficiently on these buses. In our project, we investigate their operating environment and available technologies to develop performance specifications for such CWS. The paper discusses our findings of transit buses driving through very cluttered surroundings and being involved in many different types of accidents where currently available CWS no not work effectively. One of the focuses of our work is pedestrians around the bus and their detection.

Go to article

Editorial, Sanjay Kumar Madria, Mukesh Mohania, Bharat Bhargava Oct 2000

Editorial, Sanjay Kumar Madria, Mukesh Mohania, Bharat Bhargava

Computer Science Faculty Research & Creative Works

No abstract provided.

Go to article

A Formal Semantics For Spki, Jon Howell, David Kotz Oct 2000

A Formal Semantics For Spki, Jon Howell, David Kotz

Dartmouth Scholarship

We extend the logic and semantics of authorization due to Abadi, Lampson, et al. to support restricted delegation. Our formal model provides a simple interpretation for the variety of constructs in the Simple Public Key Infrastructure (SPKI), and lends intuition about possible extensions. We discuss both extensions that our semantics supports and extensions that it cautions against.

Go to article

End-To-End Authorization, Jon Howell, David Kotz Oct 2000

End-To-End Authorization, Jon Howell, David Kotz

Dartmouth Scholarship

Many boundaries impede the flow of authorization information, forcing applications that span those boundaries into hop-by-hop approaches to authorization. We present a unified approach to authorization. Our approach allows applications that span administrative, network, abstraction, and protocol boundaries to understand the end-to-end authority that justifies any given request. The resulting distributed systems are more secure and easier to audit. \par We describe boundaries that can interfere with end-to-end authorization, and outline our unified approach. We describe the system we built and the applications we adapted to use our unified authorization system, and measure its costs. We conclude that our system …

Go to article

The Cracker Patch Choice: An Analysis Of Post Hoc Security Techniques, Crispin Cowan, Heather Hinton, Calton Pu, Jonathan Walpole Oct 2000

The Cracker Patch Choice: An Analysis Of Post Hoc Security Techniques, Crispin Cowan, Heather Hinton, Calton Pu, Jonathan Walpole

Computer Science Faculty Publications and Presentations

It has long been known that security is easiest to achieve when it is designed in from the start. Unfortunately, it has also become evident that systems built with security as a priority are rarely selected for wide spread deployment, because most consumers choose features, convenience, and performance over security. Thus security officers are often denied the option of choosing a truly secure solution, and instead must choose among a variety of post hoc security adaptations. We classify security enhancing methods, and compare and contrast these methods in terms of their effectiveness vs. cost of deployment. Our analysis provides practitioners …

Go to article

Studies Related To The Design And Implementation Of A Magnetic Suspension And Balance System, Syed Adeel Akhtar Jafri Oct 2000

Studies Related To The Design And Implementation Of A Magnetic Suspension And Balance System, Syed Adeel Akhtar Jafri

Electrical & Computer Engineering Theses & Dissertations

This thesis presents studies related to the magnetic suspension and balance system (MSBS) of the Princeton/ONR High Reynolds Number Testing Facility (HRTF). The main motivation for developing the MSBS is to provide interference free aero/hydrodynamic testing of submersible models, which will lead to more accurate measurements. From the controls point of view, the main specification of the MSBS is to robustly control the position of a submersible model in five degrees of freedom (DOF), including three translational as well as pitching and yawing positions. The MSBS should not only regulate the submersible model's position but should also allow for small …

Go to article

Clustering Irregular Shapes Using High-Order Neurons, H. Lipson, Hava Siegelmann Sep 2000

Clustering Irregular Shapes Using High-Order Neurons, H. Lipson, Hava Siegelmann

Hava Siegelmann

This article introduces a method for clustering irregularly shaped data arrangements using high-order neurons. Complex analytical shapes are modeled by replacing the classic synaptic weight of the neuron by high-order tensors in homogeneous coordinates. In the first- and second-order cases, this neuron corresponds to a classic neuron and to an ellipsoidalmetric neuron. We show how high-order shapes can be formulated to follow the maximum-correlation activation principle and permit simple local Hebbian learning. We also demonstrate decomposition of spatial arrangements of data clusters, including very close and partially overlapping clusters, which are difficult to distinguish using classic neurons. Superior results are …

Go to article

On Reconfiguring Tree Linkages: Trees Can Lock, Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried Toussaint, Sue Whitesides Sep 2000

On Reconfiguring Tree Linkages: Trees Can Lock, Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried Toussaint, Sue Whitesides

Computer Science: Faculty Publications

It has recently been shown that any simple (i.e. nonintersecting) polygonal chain in the plane can be reconfigured to lie on a straight line, and any simple polygon can be reconfigured to be convex. This result cannot be extended to tree linkages: we show that there are trees with two simple configurations that are not connected by a motion that preserves simplicity throughout the motion. Indeed, we prove that an N-link tree can have 2Ω(N) equivalence classes of configurations.

Go to article

Semantic Web And Information Brokering: Opportunities, Commercialization, And Challenges, Amit P. Sheth Sep 2000

Semantic Web And Information Brokering: Opportunities, Commercialization, And Challenges, Amit P. Sheth

Kno.e.sis Publications

From the chairs' report published in SIGMOD record: The keynote address entitled 'Semantic Web and Information Brokering: Opportunities, Early Commercializations, and Challenges' was delivered by Amit Sheth (University of Georgia and Taalee Corp). Sheth characterized semantics as the next step in the evolution of the WWW and stressed the importance of semantically organized information for supporting ubiquitous, powerful, accurate and efficient access to this information. Sheth also reviewed proposals for semantic interoperability frameworks such as the DAML(DARPA Agent Mark-Up Language), the Oingo family of tools for defining concepts and extracting knowledge from large databases, as well as several scenarios on …

Go to article

Optically Simulating A Quantum Associative Memory, Dan A. Ventura, John C. Howell, John A. Yeazell Sep 2000

Optically Simulating A Quantum Associative Memory, Dan A. Ventura, John C. Howell, John A. Yeazell

Faculty Publications

This paper discusses the realization of a quantum associative memory using linear integrated optics. An associative memory produces a full pattern of bits when presented with only a partial pattern. Quantum computers have the potential to store large numbers of patterns and hence have the ability to far surpass any classical neural network realization of an associative memory. In this work two 3-qubit associative memories will be discussed using linear integrated optics. In addition, corrupted, invented and degenerate memories are discussed.

Go to article

Pushpush And Push-1 Are Np-Hard In 2d, Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke Sep 2000

Pushpush And Push-1 Are Np-Hard In 2d, Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke

Computer Science: Faculty Publications

We prove that two pushing-blocks puzzles are intractable in 2D. One of our constructions improves an earlier result that established intractability in 3D [OS99] for a puzzle inspired by the game PushPush. The second construction answers a question we raised in [DDO00] for a variant we call Push-1. Both puzzles consist of unit square blocks on an integer lattice; all blocks are movable. An agent may push blocks (but never pull them) in attempting to move between given start and goal positions. In the PushPush version, the agent can only push one block at a time, and moreover when a …

Go to article

Distributed Development And Deployment Of Ontologies For Knowledge-Based Systems, Sameh El-Ansary Sep 2000

Distributed Development And Deployment Of Ontologies For Knowledge-Based Systems, Sameh El-Ansary

Archived Theses and Dissertations

No abstract provided.

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 17, Number 1, September 2000, College Of Engineering And Computer Science, Wright State University Sep 2000

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 17, Number 1, September 2000, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A fourteen page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Go to article

Motion-Based Video Representation For Scene Change Detection, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang, Roland T. Chin Sep 2000

Motion-Based Video Representation For Scene Change Detection, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang, Roland T. Chin

Research Collection School Of Computing and Information Systems

We present a new ly developed scheme for automatical ly partitioning videos into scenes. A scene is general ly referred to as a group of shots taken place in the same site. In this paper, we first propose a motion annotation algorithm based on the analysis of spatiotemporal image volumes. The algorithm characterizes the motions within shots by extracting and analyzing the motion trajectories encoded in the temporal slices of image volumes. A motion-based keyframe computing and selection strategy is thus proposed to compactly represent the content of shots. With these techniques, we further present a scene change detection algorithm …

Go to article

Exception Handling In Workflow Systems, Zongwei Luo, Amit P. Sheth, Krzysztof J. Kochut, John A. Miller Sep 2000

Exception Handling In Workflow Systems, Zongwei Luo, Amit P. Sheth, Krzysztof J. Kochut, John A. Miller

Kno.e.sis Publications

In this paper, defeasible workflow is proposed as a framework to support exception handling for workflow management. By using the “justified” ECA rules to capture more contexts in workflow modeling, defeasible workflow uses context dependent reasoning to enhance the exception handling capability of workflow management systems. In particular, this limits possible alternative exception handler candidates in dealing with exceptional situations. Furthermore, a case-based reasoning (CBR) mechanism with integrated human involvement is used to improve the exception handling capabilities. This involves collecting cases to capture experiences in handling exceptions, retrieving similar prior exception handling cases, and reusing the exception handling experiences …

Go to article

Validation And Verification Of Formal Specifications In Object-Oriented Software Engineering, Steven A. Thomson Sep 2000

Validation And Verification Of Formal Specifications In Object-Oriented Software Engineering, Steven A. Thomson

Theses and Dissertations

The use of formal specifications allows for a software system to be defined with stringent mathematical semantics and syntax via such tools as propositional calculus and set theory. There are many perceived benefits garnered from formal specifications, such as a thorough and in-depth understanding of the domain and system being specified and a reduction in user requirement ambiguity. Probably the greatest benefit of formal specifications, and that which is least capitalized upon, is that mathematical proof procedures can be used to test and prove internal consistency and syntactic correctness in an effort to ensure comprehensive validation and verification (V&V). The …

Go to article

A Support Vector Method For Clustering, Asa Ben-Hur, David Horn, Hava Siegelmann, Vladimir Vapnik Aug 2000

A Support Vector Method For Clustering, Asa Ben-Hur, David Horn, Hava Siegelmann, Vladimir Vapnik

Hava Siegelmann

We present a novel method for clustering using the support vector machine approach. Data points are mapped to a high dimensional feature space, where support vectors are used to define a sphere enclosing them. The boundary of the sphere forms in data space a set of closed contours containing the data. Data points enclosed by each contour are defined as a cluster. As the width parameter of the Gaussian kernel is decreased, these contours fit the data more tightly and splitting of contours occurs. The algorithm works by separating clusters according to valleys in the underlying probability distribution, and thus …

Go to article

Knowledge Discovery In Biological Databases : A Neural Network Approach, Qicheng Ma Aug 2000

Knowledge Discovery In Biological Databases : A Neural Network Approach, Qicheng Ma

Dissertations

Knowledge discovery, in databases, also known as data mining, is aimed to find significant information from a set of data. The knowledge to be mined from the dataset may refer to patterns, association rules, classification and clustering rules, and so forth. In this dissertation, we present a neural network approach to finding knowledge in biological databases. Specifically, we propose new methods to process biological sequences in two case studies: the classification of protein sequences and the prediction of E. Coli promoters in DNA sequences. Our proposed methods, based oil neural network architectures combine techniques ranging from Bayesian inference, coding theory, …

Go to article

Oral History Interview With Peter C. Patton, Philip L. Frana Aug 2000

Oral History Interview With Peter C. Patton, Philip L. Frana

Philip L Frana

In this oral history Peter Patton, Chief Technology Officer at Lawson Software in St. Paul, MN, and former Director of Academic Computing at the University of Minnesota, talks about his education at Harvard, his involvement in the development of PLATO courses in the humanities, and his perspectives on the software industry and patenting. Patton also shares his experience with IBM 650, CDC 6600, and Cray installations on several university campuses, his role in Project Safeguard, and his design of the Hennepin Justice ...

Go to article

On The Effectiveness Of Probabilistic Packet Marking For Ip Traceback Under Denial Of Service Attack, Kihong Park, Heejo Lee Aug 2000

On The Effectiveness Of Probabilistic Packet Marking For Ip Traceback Under Denial Of Service Attack, Kihong Park, Heejo Lee

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Computer-Aided Synthesis Of Higher Pairs Via Configuration Space Manupulation, Min-Ho Kyung, Elisha Sacks Aug 2000

Computer-Aided Synthesis Of Higher Pairs Via Configuration Space Manupulation, Min-Ho Kyung, Elisha Sacks

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Performance Analysis Of Mobile Agents For Filtering Data Streams On Wireless Networks, David Kotz, Guofei Jiang, Robert Gray, George Cybenko, Ronald A. Peterson Aug 2000

Performance Analysis Of Mobile Agents For Filtering Data Streams On Wireless Networks, David Kotz, Guofei Jiang, Robert Gray, George Cybenko, Ronald A. Peterson

Dartmouth Scholarship

Wireless networks are an ideal environment for mobile agents, because their mobility allows them to move across an unreliable link to reside on a wired host, next to or closer to the resources they need to use. Furthermore, client-specific data transformations can be moved across the wireless link, and run on a wired gateway server, with the goal of reducing bandwidth demands. In this paper we examine the tradeoffs faced when deciding whether to use mobile agents to support a data-filtering application, in which numerous wireless clients filter information from a large data stream arriving across the wired network. We …

Go to article

Telemip: Telecommunications-Enhanced Mobile Ip Architecture For Fast Intradomain Mobility, Subir Das, Archan Misra, Prathima Agrawal, Sajal K. Das Aug 2000

Telemip: Telecommunications-Enhanced Mobile Ip Architecture For Fast Intradomain Mobility, Subir Das, Archan Misra, Prathima Agrawal, Sajal K. Das

Research Collection School Of Computing and Information Systems

This article first surveys existing protocols for supporting IP mobility and then proposes an extension to the mobile IP architecture, called TeleMIP. Our architecture attempts to achieve smaller handoff latency by localizing the scope of most location update messages within an administrative domain or a geographical region. TeleMIP is intended for use in evolving third-generation wireless networks, and introduces a new logical entity, called the mobility agent, which provides a mobile node with a stable point of attachment in a foreign network. While the MA is functionally similar to conventional foreign agents, it is located at a higher level in …

Go to article

Computational Geometry Column 39, Joseph O'Rourke Aug 2000

Computational Geometry Column 39, Joseph O'Rourke

Computer Science: Faculty Publications

The resolution of a decades-old open problem is described: polygonal chains cannot lock in the plane.

Go to article

First Prev Next Last