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

Digital Commons Network™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 45601 - 45630 of 46165

Full-Text Articles in Entire DC Network

On The Analysis Of The Tail Queue Length And Waiting Time Distributions Of A Gi/Gi/C Queue, John S. Sadowsky, Wojciech Szpankowski Nov 1989

On The Analysis Of The Tail Queue Length And Waiting Time Distributions Of A Gi/Gi/C Queue, John S. Sadowsky, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


The Internet Worm Incident, Eugene H. Spafford Nov 1989

The Internet Worm Incident, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.


Experimental Facility For Kernel Extensions To Support Distributed Database Systems, Bharat Bhargava, Enrique Mafla, John Riedl Nov 1989

Experimental Facility For Kernel Extensions To Support Distributed Database Systems, Bharat Bhargava, Enrique Mafla, John Riedl

Department of Computer Science Technical Reports

No abstract provided.


The Display And Manipulation Of Temporal Information, Steve B. Cousins, Michael G. Kahn Washington University In St. Louis, Mark E. Frisse Washington University In St. Louis Nov 1989

The Display And Manipulation Of Temporal Information, Steve B. Cousins, Michael G. Kahn Washington University In St. Louis, Mark E. Frisse Washington University In St. Louis

All Computer Science and Engineering Research

Because medical data have complex temporal features, special techniques are required for storing, retrieving, and displaying clinical data from electronic databases. One significant problem caused by the temporal nature of medical data has been called the temporal granularity problem. The temporal granularity problem is said to occur when the set of facts relevant to a specific problem changes as the time scale changes. We argue that what is needed to deal with changes in the relevant time scale are temporal granularity heuristics. One heuristic that we have explored is that, for any level of problem abstraction, and for each type …


An Extended Transaction Model For Multidatabase Systems, Yungho Leu, Ahmed K. Elmagarmid, Marek Rusinkiewicz Nov 1989

An Extended Transaction Model For Multidatabase Systems, Yungho Leu, Ahmed K. Elmagarmid, Marek Rusinkiewicz

Department of Computer Science Technical Reports

No abstract provided.


Ua66/3/2 Computer Science Alumni Newsletter, Vol. 5, Wku Computer Science Nov 1989

Ua66/3/2 Computer Science Alumni Newsletter, Vol. 5, Wku Computer Science

WKU Administration Documents

Newsletter created by WKU Computer Science for the alumni of the program.


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, November 1989, College Of Engineering And Computer Science, Wright State University Nov 1989

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, November 1989, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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


Transaction Accessibility And Integrity Issues In Heterogeneous Distributed Database Systems, Weimin Du, Ahmed K. Elmagarmid, Marek Rusinkiewicz Oct 1989

Transaction Accessibility And Integrity Issues In Heterogeneous Distributed Database Systems, Weimin Du, Ahmed K. Elmagarmid, Marek Rusinkiewicz

Department of Computer Science Technical Reports

No abstract provided.


A Hierarchical Approach To Concurrency Control For Multidatabases, Ahmed K. Elmagarmid, Yunhho Leu Oct 1989

A Hierarchical Approach To Concurrency Control For Multidatabases, Ahmed K. Elmagarmid, Yunhho Leu

Department of Computer Science Technical Reports

No abstract provided.


Polygon Nesting And Robustness, Chanderjit Bajaj, Tamai Dey Oct 1989

Polygon Nesting And Robustness, Chanderjit Bajaj, Tamai Dey

Department of Computer Science Technical Reports

No abstract provided.


Parallel (//) Ellpack Pde Solving System, Elias N. Houstis, John R. Rice, N. P. Chrisochoides, H. C. Karathansis, P. N. Papachiou, E. A. Vavalis, K. Wang Oct 1989

Parallel (//) Ellpack Pde Solving System, Elias N. Houstis, John R. Rice, N. P. Chrisochoides, H. C. Karathansis, P. N. Papachiou, E. A. Vavalis, K. Wang

Department of Computer Science Technical Reports

No abstract provided.


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, October 1989, College Of Engineering And Computer Science, Wright State University Oct 1989

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, October 1989, 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.


Optical Machine Recognition Of Lower-Case Greek Characters Of Any Size, Ivan X. D. D'Cunha Oct 1989

Optical Machine Recognition Of Lower-Case Greek Characters Of Any Size, Ivan X. D. D'Cunha

Electrical & Computer Engineering Theses & Dissertations

An algorithm utilizing a syntactic approach and a criterion based on normalized moments is defined for the reliable, automatic, machine recognition of handwritten and printed Greek characters of any size and font. In this approach a binary image of the character in question is obtained initially; its skeleton is then produced by utilizing a standard thinning algorithm. The classification process then incorporates the topological features of the characters such as existence of closed curves, number of intersections, number and location of free ends, axial symmetry, and the criteria derived from normalized moments to uniquely identify each pattern. Experiments conducted demonstrated …


Design Considerations For Distributed Scientific Software Systems, Paul E. Buis Sep 1989

Design Considerations For Distributed Scientific Software Systems, Paul E. Buis

Department of Computer Science Technical Reports

No abstract provided.


Virtual Memory For Diskless Desktop Workstations, Douglas E. Comer, James Griffioen Sep 1989

Virtual Memory For Diskless Desktop Workstations, Douglas E. Comer, James Griffioen

Department of Computer Science Technical Reports

No abstract provided.


Analysis Of Digital Tries With Markovian Dependency, P. Jacquet, Wojciech Szpankowski Sep 1989

Analysis Of Digital Tries With Markovian Dependency, P. Jacquet, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, September 1989, College Of Engineering And Computer Science, Wright State University Sep 1989

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, September 1989, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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


A Mathematical Treatment Of Defeasible Reasoning And Its Implementation, Guillermo R. Simari, R. P. Loui Sep 1989

A Mathematical Treatment Of Defeasible Reasoning And Its Implementation, Guillermo R. Simari, R. P. Loui

All Computer Science and Engineering Research

We present a mathematical approach to defeasible reasoning. This approach is based on the notion of specificity introduced by Poole and the theory of warrant presented by Pollock. We combine the ideas of the two. This main contribution of this paper is a precise well-defined system which exhibits correct behavior when applied to the benchmark examples in the literature. We prove that an order relation can be introduced among equivalence classes under the equi-specificity relation. We also prove a theorem that ensures the termination of the process of finding the justified facts. Two more lemmas define a reduced search space …


Axon: Application-Oriented Lightweight Transport Protocol Design, James P.G. Sterbenz, Gurudatta M. Parulkar Sep 1989

Axon: Application-Oriented Lightweight Transport Protocol Design, James P.G. Sterbenz, Gurudatta M. Parulkar

All Computer Science and Engineering Research

This paper describes the application-oriented lightweight transport protocol for object transfer (ALTP-OT) in the Axon host communication architecture for distributed applications. The Axon Project is investigating an integrated design of host architecture, operating systems, and communication protocols to allow the utilization of the high band-width provided by the next generation of communication networks. ALTP-OT provides the end-to-end transport of segment and message objects for interprocess communication across a very high speed internetwork, supporting demanding applications such as scientific visualization and imaging. ALTP-OT uses rate-based flow control specifically oriented to the transfer of objects directly between application memory spaces. This document …


Axon: A High Speed Communication Architecture For Distributed Applications, James P.G. Sterbenz, Gurudatta M. Parulkar Sep 1989

Axon: A High Speed Communication Architecture For Distributed Applications, James P.G. Sterbenz, Gurudatta M. Parulkar

All Computer Science and Engineering Research

There are two complementary trends in the computer and communication fields. Increasing processor power and memory availability allow more demanding applications, such as scientific visualization and imaging. Advances in network performance and functionality have the potential for supporting programs requiring high bandwidth and predictable performance. However, the bottleneck in increasingly in the host-network interface, and thus the ability to deliver high performance communication capability to applications has not kept up with the advances in computer and network speed. We have proposed a new architecture that meets these challenges called Axon, whose novel aspects include: an integrated design of hardware, operating …


Ampliative Inference, Computation, And Dialectic, R. P. Loui Sep 1989

Ampliative Inference, Computation, And Dialectic, R. P. Loui

All Computer Science and Engineering Research

There are three theses here: • Non-computationally conceived inference merely expands notation. This includes induction as well as deduction, and thus both deserve the adjective non-ampliative. Deriving entailments merely expands shorthand. All of the familiar formalisms for reasoning do just this. • There now exist examples of formalism for reasoning that do something else. They are deliberative, and to say in what way they are deliberative requires reference to the process through which they compute their entailments. • The original ampliative/non-ampliative terminology best survives as referring to this new distinction. Viewed formally, all other attempted distinctions either presume deduction to …


Pattern Classification In Dynamic Environments: Tagged Feature-Class Representation And The Classifiers, Qiuming Zhu Sep 1989

Pattern Classification In Dynamic Environments: Tagged Feature-Class Representation And The Classifiers, Qiuming Zhu

Computer Science Faculty Publications

he classifiers characterized by a tagged feature-class representation, a univariate discrimination approach, a cooperative classification scheme, and a logic-based learning strategy are discussed. Neither of the classifiers bears the constraints to the fixed sets of features and classes. Concepts of the tagged feature-class representation and the properties of feature matching in the dynamic environment are studied. Experimental tests and results of the classifiers are illustrated.


Efficient Interconnection Schemes For Vlsi And Parallel Computation, Ronald I. Greenberg Sep 1989

Efficient Interconnection Schemes For Vlsi And Parallel Computation, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

This thesis is primarily concerned with two problems of interconnecting components in VLSI technologies. In the first case, the goal is to construct efficient interconnection networks for general-purpose parallel computers. The second problem is a more specialized problem in the design of VLSI chips, namely multilayer channel routing. In addition, a final part of this thesis provides lower bounds on the area required for VLSI implementations of finite-state machines. This thesis shows that networks based on Leiserson's fat-tree architecture are nearly as good as any network built in a comparable amount of physical space. It shows that these "universal" networks …


Implementing Object Support In The Raid Distributed Database System, Bharat Bhargava, Prasun Dewar, James G. Mullen, Jagannathan Srinivasan Aug 1989

Implementing Object Support In The Raid Distributed Database System, Bharat Bhargava, Prasun Dewar, James G. Mullen, Jagannathan Srinivasan

Department of Computer Science Technical Reports

No abstract provided.


A Model For Adaptable Systems For Transaction Processing, Bharat Bhargava, John Riedl Aug 1989

A Model For Adaptable Systems For Transaction Processing, Bharat Bhargava, John Riedl

Department of Computer Science Technical Reports

No abstract provided.


Host-Network Interface Architecture For Gigabit Communications, James P. G. Sterbenz Aug 1989

Host-Network Interface Architecture For Gigabit Communications, James P. G. Sterbenz

All Computer Science and Engineering Research

There are two complementary trends in the computer and communications fields. Increasing processor power and memory availability allow more demanding applications, such as scientific visualizations and imaging. Advances in network performance and functionality have the potential for supporting applications requiring high bandwidth communications. However, the bottleneck is increasingly in the host-network interface, and thus the ability to deliver high performance communications capability to applications has not kept up with the advance in computer and network speed. We have proposed a new architecture that meets these challenges, called Axon. The Axon thesis is that an essential requirement for the support of …


An O(H^6) Quintic Spline Collocation Method For Second Order Two-Point Boundary Value Problems, M. Irodotou-Ellina, Elias N. Houstis, S. B. Kim Aug 1989

An O(H^6) Quintic Spline Collocation Method For Second Order Two-Point Boundary Value Problems, M. Irodotou-Ellina, Elias N. Houstis, S. B. Kim

Department of Computer Science Technical Reports

No abstract provided.


Expert System For Interpreting An Organizational Climate Survey Supporting Guided Development, Thabet Birro Aug 1989

Expert System For Interpreting An Organizational Climate Survey Supporting Guided Development, Thabet Birro

Theses and Dissertations

This project has lead to the development of a prototype, diagnostic, rule-based expert system to analyze data gathered with an organizational climate survey conducted in high technology firms. The development process followed an investigative look at the field of expert systems. The project was implemented using Level5 shell (by Level 5 research Inc.) in PC/MS-DOS environment.


Algebraic And Numerical Techniques For Offsets And Blends, Christoph M. Hoffmann Jul 1989

Algebraic And Numerical Techniques For Offsets And Blends, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.


A Paradigm For Concurrency Control In Heterogeneous Distributed Database Systems, Weimin Du, Ahmed K. Elmagarmid Jul 1989

A Paradigm For Concurrency Control In Heterogeneous Distributed Database Systems, Weimin Du, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.