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 54631 - 54660 of 58034

Full-Text Articles in Physical Sciences and Mathematics

Hart's Critics On Defeasible Concepts And Ascriptivism, Ronald P. Loui Jan 1995

Hart's Critics On Defeasible Concepts And Ascriptivism, Ronald P. Loui

All Computer Science and Engineering Research

Hart's "Ascription of Responsibility and Rights" is where we find perhaps the first clear pronouncement of defeasibility and the technical introduction of the term. The paper has been criticised, disavowed, and never quite fully redeemed. Its lurid history is now being used as an excuse for dismissing the importance of defeasibility. Quite to the contrary, Hart's introduction of defeasibility has uniformly been regarded as the most agreeable part of the paper. The critics' wish that defeasibility could be better expounded along the lines of a Wittgensteinian game-theoretic semantics has largely been fulfilled. Even the most contentious part of the paper, …

Go to article

Synchronized Data Objects, Marin Bezic Jan 1995

Synchronized Data Objects, Marin Bezic

All Computer Science and Engineering Research

Synchronized Data Objects (SDOs) are presented as a method of encapsulating, in the datatype definition, synchronization protocols that are used to control information exchange. SDOs are presented in the context of I/O abstraction, a programming model that seeks to separate communication from computation in order to support dynamic end-user configuration of distrivuted applications. SDOs can be used to implement a variety of synchronization paradigms, including remote invalidation, demand-driven data streams, remote procedure call, and promises. An implementation of SDOs is described in the context of The Programmers' Playground, a distributed application development environment that supports the I/O abstraction programming model. …

Go to article

Design Of A Tool For Rapid Prototyping Of Communication Protocols, Aniruddha Gokhale, Ron Cytron, George Varghese Jan 1995

Design Of A Tool For Rapid Prototyping Of Communication Protocols, Aniruddha Gokhale, Ron Cytron, George Varghese

All Computer Science and Engineering Research

We present a new tool for automatically generating prototypes of communication protocols on a wide variety of platforms. Our goal is to reduce design time, enhance portability, and accommodate optimizations automatically. Users of the tool are required to provide an abstract implementation of the protocol in C++ without worrying about the underlying operating system specific system calls. Instead, the user employs high-level interface functions provided by the tool to interact with the underlying operating system. Users also need not worry about complex packet formats that involve fields of various bit and byte lengths. Instead, they use simple C/C++ struct declarations …

Go to article

A Trainable, Single-Pass Algorithm For Column Segmentation, Son Sylwester, Sharad C. Seth Jan 1995

A Trainable, Single-Pass Algorithm For Column Segmentation, Son Sylwester, Sharad C. Seth

CSE Conference and Workshop Papers

Column Segmentation logically precedes OCR in the document analysis process. The trainable algorithm described here, XYCUT, relies on horizontal and vertical binary profiles to produce an XY- tree representing the column structure of a page of a technical document in a single pass through the bit image. Training against ground truth adjusts a single, resolution independent, parameter using only local information and guided by an edit distance function. The algorithm correctly segments the page image for a (fairly) wide range of parameter values, although small, local and repairable errors may be made, an effect measured by a repair cost function.

Go to article

Approximation Algorithms: Good Solutions To Hard Problems, Ran Libeskind-Hadas Jan 1995

Approximation Algorithms: Good Solutions To Hard Problems, Ran Libeskind-Hadas

All HMC Faculty Publications and Research

Consider a computer network represented by an undirected graph where the vertices represent computer nodes and the edges represent links between the nodes. Since some of the links in the network may become faulty, link testing devices are placed at some of the nodes. A tester at a particular node can test all links incident to that node. Since the testers are expensive, however, we wish to deploy the minimum number of these devices such that every link is incidient to at least one node containing a tester. In graph theoretic terms, a vertex cover is a subset of the …

Go to article

A Comprehensive, Automated Approach To Determining Sea Ice Thickness From Sar Data, Donna Haverkamp, Leen-Kiat Soh, Costas Tsatsoulis Jan 1995

A Comprehensive, Automated Approach To Determining Sea Ice Thickness From Sar Data, Donna Haverkamp, Leen-Kiat Soh, Costas Tsatsoulis

School of Computing: Faculty Publications

This paper documents an approach to sea ice classification through a combination of methods, both algorithmic and heuristic. The resulting system is a comprehensive technique, which uses dynamic local thresholding as a classification basis and then supplements that initial classification using heuristic geophysical knowledge organized in expert systems. The dynamic local thresholding method allows separation of the ice into thickness classes based on local intensity distributions. Because it utilizes the data within each image, it can adapt to varying ice thickness intensities to regional and seasonal charges and is not subject to limitations caused by using predefined parameters.

Go to article

Scheduling Of Parallel Jobs On Dynamic, Heterogenous Networks, Dan Clark, Jeremy Casas, Steve Otto, Robert Prouty, Jonathan Walpole Jan 1995

Scheduling Of Parallel Jobs On Dynamic, Heterogenous Networks, Dan Clark, Jeremy Casas, Steve Otto, Robert Prouty, Jonathan Walpole

Computer Science Faculty Publications and Presentations

In using a shared network of workstations for parallel processing, it is not only important to consider heterogeneity and differences in processing power between the workstations but also the dynamics of the system as a whole. In such a computing environment where the use of resources vary as other applications consume and release resources, intelligent scheduling of the parallel jobs onto the available resources is essential to maximize resource utilization. Despite this realization, however, there are few systems available that provide an infrastructure for the easy development and testing of these intelligent schedulers. In this paper, an infrastructure is presented …

Go to article

Set-Theoretic Reconstructability Of Elementary Cellular Automata, Martin Zwick, Hui Shu Jan 1995

Set-Theoretic Reconstructability Of Elementary Cellular Automata, Martin Zwick, Hui Shu

Systems Science Faculty Publications and Presentations

Set-theoretic reconstructability analysis is used to characterize the structures of the mappings of elementary cellular automata. The minimum complexity structure for each ECA mapping, indexed by parameter σ, is more effective than the λ parameter of Langton as a predictor of chaotic dynamics.

Go to article

Towards An Ontology Of Problems, Martin Zwick Jan 1995

Towards An Ontology Of Problems, Martin Zwick

Systems Science Faculty Publications and Presentations

Systems theory offers a language in which one might formulate a metaphysics (or more specifically an ontology) of problems. This proposal is based upon a conception of systems theory shared by von Bertalanffy, Wiener, Boulding, Rapoport, Ashby, Klir, and others, and expressed succinctly by Bunge, who considered game theory, information theory, feedback control theory, and the like to be attempts to construct an "exact and scientific metaphysics." Our prevailing conceptions of "problems" are concretized yet also fragmented and in fact dissolved by the standard reductionist model of science, which cannot provide a general framework for analysis. The idea of a …

Go to article

Using Neural Networks For Aerodynamic Parameter Modeling, Gerald E. Peterson, William E. Bond, Roger Germann, Barry Streeter, James Urnes Jan 1995

Using Neural Networks For Aerodynamic Parameter Modeling, Gerald E. Peterson, William E. Bond, Roger Germann, Barry Streeter, James Urnes

Computer Science Faculty Research & Creative Works

Neural networks are being developed at McDonnell Douglas Corporation to provide an onboard model of an aircraft's aerodynamics to support advanced flight control systems. These flight control systems, constructed using neural networks and advanced controllers, have the potential to reduce flight control development costs and to improve inflight performance. Neural networks are useful in this situation because they can compactly represent the data and operate in real-time

Go to article

Using Fuzzy Set Theory: Exploring How Generalties Can Pinpoint Where To Look For The Answers, Cosmin Radu, Ralph W. Wilkerson Jan 1995

Using Fuzzy Set Theory: Exploring How Generalties Can Pinpoint Where To Look For The Answers, Cosmin Radu, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

No abstract provided.

Go to article

Using Taguchi''S Method Of Experimental Design To Control Errors In Layered Perceptrons, William E. Bond, Gerald E. Peterson, Daniel C. St. Clair, Stephen R. Aylward Jan 1995

Using Taguchi''S Method Of Experimental Design To Control Errors In Layered Perceptrons, William E. Bond, Gerald E. Peterson, Daniel C. St. Clair, Stephen R. Aylward

Computer Science Faculty Research & Creative Works

A significant problem in the design and construction of an artificial neural network for function approximation is limiting the magnitude and the variance of errors when the network is used in the field. Network errors can occur when the training data does not faithfully represent the required function due to noise or low sampling rates, when the network's flexibility does not match the variability of the data, or when the input data to the resultant network is noisy. This paper reports on several experiments whose purpose was to rank the relative significance of these error sources and thereby find neural …

Go to article

Adaptive Resonance Theory (Art): An Introduction, Lucien G. Heins, Daniel R. Tauritz Jan 1995

Adaptive Resonance Theory (Art): An Introduction, Lucien G. Heins, Daniel R. Tauritz

Computer Science Faculty Research & Creative Works

No abstract provided.

Go to article

Relaxing Synchronization In Distributed Simulated Annealing, Bruce M. Mcmillin, Chul-Eui Hong Jan 1995

Relaxing Synchronization In Distributed Simulated Annealing, Bruce M. Mcmillin, Chul-Eui Hong

Computer Science Faculty Research & Creative Works

This paper presents a cost error measurement scheme and relaxed synchronization method, for simulated annealing on a distributed memory multicomputer, which predicts the amount of cost error that an algorithm will tolerate. An adaptive error control method is developed and implemented on an Intel iPSC/2

Go to article

A Multithreaded Message Passing Environment For Atm Lan/Wan, Rajesh Yadav, Rajashekar Reddy, Salim Hariri, Geoffrey C. Fox Jan 1995

A Multithreaded Message Passing Environment For Atm Lan/Wan, Rajesh Yadav, Rajashekar Reddy, Salim Hariri, Geoffrey C. Fox

Northeast Parallel Architecture Center

Large scale High Performance Computing and Communication (HPCC) applications (e.g. Video-on-Demand, and HPDC) would require storage and processing capabilities which are beyond existing single computer systems. The current advances in networking technology (e.g. ATM) have made high performance network computing an attractive computing environment for such applications. However, using only high speed network is not sufficient to achieve high performance distributed computing environment unless some hardware and software problems have been resolved. These problems include the limited communication bandwidth available to the application, high overhead associated with context switching, redundant data copying during protocol processing and lack of support to …

Go to article

Nonrecursive Incremental Evaluation Of Datalog Queries, Guozhu Dong, Jianwen Su, Rodney Topor Jan 1995

Nonrecursive Incremental Evaluation Of Datalog Queries, Guozhu Dong, Jianwen Su, Rodney Topor

Kno.e.sis Publications

We consider the problem of repeatedly evaluating the same (computationally expensive) query to a database that is being updated between successive query requests. In this situation, it should be possible to use the difference between successive database states and the answer to the query in one state to reduce the cost of evaluating the query in the next state. We use nonrecursive Datalog (which are unions of conjunctive queries) to compute the differences, and call this process “incremental query evaluation using conjunctive queries”. After formalizing the notion of incremental query evaluation using conjunctive queries, we give an algorithm that constructs, …

Go to article

Aras: Asynchronous Risc Architecture Simulator, Chia-Hsing Chien, Mark A. Franklin, Tienyo Pan, Prithvi Prabhu Jan 1995

Aras: Asynchronous Risc Architecture Simulator, Chia-Hsing Chien, Mark A. Franklin, Tienyo Pan, Prithvi Prabhu

All Computer Science and Engineering Research

In this paper, an asynchronous pipeline instruction simulator, ARAS is presented. With this simulator, one can design selected instruction pipelines and check their performance. Performance measurements of the pipeline configuration are obtained by simulating the execution of benchmark programs on the machine architectures developed. Depending on the simulation results obtained by using ARAS, the pipeline configuration can be altered to improve its performance. Thus, one can explore the design space of aynchronous pipeline architectures.

Go to article

Pac Learing Of One-Dimensional Patterns, Paul W. Goldberg, Sally A. Goldman, Stephen D. Scott Jan 1995

Pac Learing Of One-Dimensional Patterns, Paul W. Goldberg, Sally A. Goldman, Stephen D. Scott

All Computer Science and Engineering Research

Developing the ability to recognize a landmark from a visual image of a robot's current location is a fundamental problem in robotics. We consider the problem of PAC-learning the concept class of geometric patterns where the target geometric pattern is a configuration of k points on the real line. Each instance is a configuration of n points on the real line, where it is labeled according to whether or not it visually resembles the target pattern. To capture the notion of visual resemblance we use the Hausdorff metric. Informally, two geometric patterns P and Q resemble each othe runder the …

Go to article

Formal Specification Of A Dynamically Configurable Distributed System, Ram Sethuraman, Kenneth J. Goldman Jan 1995

Formal Specification Of A Dynamically Configurable Distributed System, Ram Sethuraman, Kenneth J. Goldman

All Computer Science and Engineering Research

The Programmers' Playground is a programming environment that supports end-user construction of distributed multimedia applications. The system implements a new programming model that is based, in part, upon ideas from the formal I/O automaton model of Lynch and Tuttle. Important features of The Programmers' Playground are a separation of communication and computation and graphical support for dynamic reconfiguration. This paper provides a formal specification of the Playground programming model and runtime system in terms of the I/O automaton model on which it is based. Exploiting the compositionality properties of the I/O automaton model, the formal specification is describd as a …

Go to article

Redesigning The Bsd Callout And Timer Facilities, Adam M. Costello, George Varghese Jan 1995

Redesigning The Bsd Callout And Timer Facilities, Adam M. Costello, George Varghese

All Computer Science and Engineering Research

We describe a new implementation of the BSD callout and timer facilities. Current BSD kernels take time proportional to the number of outstanding timers to set or cancel timers. Our implementation takes constant time to start, stop, and maintain timers; this leads to a highly scalable design that can support thousands of outstanding timers without much overhead. Unlike the existing implementation, our routines are guaranteed to lock out interrupts only for a small, bounded amount of time. We also extend the setitimer() interface to allow a process to have multiple outstanding timers, thereby reducing the need for users to maintain …

Go to article

User Interface Applications Of A Multi-Way Constraint Solver, T. Paul Mccartney Jan 1995

User Interface Applications Of A Multi-Way Constraint Solver, T. Paul Mccartney

All Computer Science and Engineering Research

Constraints are widely recognized as a useful tool for user interface constructino. Through constraints, relationships among user interface components can be defined declaratively, leaving the task of relationship management to a constraint solver. Multi-way constraint solvers supporting constraint hierarchies provide a means to specify preferential constraint relationships with a dynamically changing computation flow, making them especially well suited to interactive user interfaces. However, previous such constraint solvers lack the ability to enforce inequalities or to effectively handle cyclic constraint relationships. These deficiencies limit the problems that could be solved using a constraint-based approach. This paper presents a new algorithm called …

Go to article

A General Matrix Iterative Model For Dynamic Load Balancing, Mark A. Franklin, Vasudha Govindan Jan 1995

A General Matrix Iterative Model For Dynamic Load Balancing, Mark A. Franklin, Vasudha Govindan

All Computer Science and Engineering Research

Effective load balancing algorithms are crucial in fully realizing the performance potential of parallel computer systems. This paper proposes a general matrix iterative model to represent a range of dynamic load balancing algorithms. The model and associated performance measures are used to evaluate and compare vairous load balancing algorithms and derive optimal algorithms and associated parameters for a given application and multiprocessor system. The model is parameterized to represent three load balancing algorithms - the random strategy, diffusion and complete redistribution algorithms. The model is validated by comparing the results with measured performance on a realistic workload. The parallel N-body …

Go to article

A Survey Of Network Signaling, Dakang Wu Jan 1995

A Survey Of Network Signaling, Dakang Wu

All Computer Science and Engineering Research

Abstract Network signaling is the process of transferring control information among components of a communication network to establish, maintain, and release connections, and to pass the network management information. The rapid evolution in the field of telecommunications has led to the rapid evolution of network signaling. In this paper, we review the evolution of network signaling. We emphasize the concepts and protocols used in modern fast packet switching networks especially in emerging ATM networks.

Go to article

Distributed Radiological Multimedia Conferencing, Naeem Bari Jan 1995

Distributed Radiological Multimedia Conferencing, Naeem Bari

All Computer Science and Engineering Research

Distributed Radiological Multimedia Conference (DRMC) is a collaborative imaging/multimedia conferencing tool which allows geographically separated physicians to confer over a shared projection radiograph. DRMC utilizes the advantages of high bandwidth and scalability offered by the new Asynchronous Transfer Mode (ATM) network technology. This application is customized for the high quality of displayed images and rapid response to user requests. It allows conferees to: share a common radiograph; each possess an independently controlled globally visible cursor; be able to point to and outline areas on the image to bring it to the other conferees' attention; and see and hear each other …

Go to article

Load Balance Properties Of Distributed Data Layouts For Clustered Mod Servers, Milind M. Buddhikot, Guru Parulkar Jan 1995

Load Balance Properties Of Distributed Data Layouts For Clustered Mod Servers, Milind M. Buddhikot, Guru Parulkar

All Computer Science and Engineering Research

Large scale storage servers that provide location transparent, interactive access to hundreds or thousands of concurrent, independent clients will be important components of hte furture information super-highway infrastructure. Two key requirements of such servers are as follows: support high parallelism and concurrency in data access to allow large number of access to the same or different data. Second, support independent interactive playout control operations such as fast-forward, rewind, slow-play, pause, resume, random access etc. with minimal latency. This paper assumes a distributed storage server architecture consisting of several high performance storage nodes interconnected by a high speed desk area network …

Go to article

Reliable Fifo Load Balancing Over Multiple Fifo Channels, Hari Adieseshu, Gurudatta M. Parulkar, George Varghese Jan 1995

Reliable Fifo Load Balancing Over Multiple Fifo Channels, Hari Adieseshu, Gurudatta M. Parulkar, George Varghese

All Computer Science and Engineering Research

Link striping algorithms are often used to overcome transmission bottlenecks in computer networks. However, traidtional striping algorithms suffer from two major disadvantages. They provide inadequate load sharing in the presence of variable length packets, and may result in non-FIFO delivery of data. We describe a new family of link striping algorithms that solve both problems. Our scheme applies to packets at any layer (physical, data, link, network, and transport) that work over multiple FIFO channels. We deal with variable sized packets by showing how a class of fair queueing algorithms can be converted into load sharing algorithms. Our transformation results …

Go to article

An Interactive Model Of Teaching, H. David Mathias Jan 1995

An Interactive Model Of Teaching, H. David Mathias

All Computer Science and Engineering Research

Previous teaching models in the learning theory community have been batch models. That is, in these models the teacher has generated a single set of helpful examples to present to the learner. In this paper we present an interactive model in which the learner has the ability to ask queries as in the query learning model of Angluin [1]. We show that this model is at least as powerful as previous teaching models. We also show that anything learnable with queries, even by a randomized learner, is teachable in our model. In all previous teaching models, all classes shown to …

Go to article

Time Variability While Training A Parallel Neural Net Network, Tina L. Seawell, Barry L. Kalman Jan 1995

Time Variability While Training A Parallel Neural Net Network, Tina L. Seawell, Barry L. Kalman

All Computer Science and Engineering Research

The algorithmic analysis, data collection, and statistical analysis required to isolate the cause of time variability observed while an Elman style recurrent neural network is trained in parallel on a twenty processor SPARCcenter 2000 is described in detail. Correlations of system metrics indicate the operating system scheduler or an interaction of kernel processes is the most probable explanation for the variability.

Go to article

Automatic Pcb Inspection Systems, M. Moganti, Fikret Erçal Jan 1995

Automatic Pcb Inspection Systems, M. Moganti, Fikret Erçal

Computer Science Faculty Research & Creative Works

There are more than 50 process steps required to fabricate a printed circuit board (PCB). To ensure quality, human operators simply inspect the work visually against prescribed standards. The decisions made by this labor intensive, and therefore costly, procedure often also involve subjective judgements. Automatic inspection systems remove the subjective aspects and provide fast, quantitative dimensional assessments. Machine vision may answer the manufacturing industry's need to improve product quality and increase productivity. The major limitation of existing inspection systems is that all the algorithms need a special hardware platform to achieve the desired real-time speeds. This makes the systems extremely …

Go to article

Graduate Bulletin, 1995-1996 (1995), Moorhead State University Jan 1995

Graduate Bulletin, 1995-1996 (1995), Moorhead State University

Graduate Bulletins (Catalogs)

No abstract provided.

Go to article

First Prev Next Last