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 53701 - 53730 of 58015

Full-Text Articles in Physical Sciences and Mathematics

Comprehensive Analysis Of Joints From Patient Clinical Data, Chandrajit L. Bajaj, Fausto Bernardini, Steven M. Cutchin, Kwunnan Lin, Elisha Sacks Mar 1997

Comprehensive Analysis Of Joints From Patient Clinical Data, Chandrajit L. Bajaj, Fausto Bernardini, Steven M. Cutchin, Kwunnan Lin, Elisha Sacks

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Scientific Computing Via The World Wide Web: The Net//Ellpack Pse Server, Shahani Markus, Sanjiva Weerawarana, Elias N. Houstis, John R. Rice Mar 1997

Scientific Computing Via The World Wide Web: The Net//Ellpack Pse Server, Shahani Markus, Sanjiva Weerawarana, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Multiagent Systems To Support Networked Scientific Computing, Anupam Joshi, N. Ramakrishnan, Elias N. Houstis Mar 1997

Multiagent Systems To Support Networked Scientific Computing, Anupam Joshi, N. Ramakrishnan, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Of Periods, Quasiperiods, Repetitions And Covers, Alberto Apostolico, Dany Breslauer Mar 1997

Of Periods, Quasiperiods, Repetitions And Covers, Alberto Apostolico, Dany Breslauer

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Net-Centric Design And Analysis Of Information Systems, Timothy R. Schmoyer Mar 1997

Net-Centric Design And Analysis Of Information Systems, Timothy R. Schmoyer

Theses and Dissertations

This thesis presents a unique methodology merging state of the art Internet and distributed database technology to support distributed simulations with programming language and platform independence. Standardized models of Command, Control, Communications, Computers, and Intelligence (C4I) systems using Integrated Definition (IDEF) models and executable simulation objects are placed in database repositories which can be accessed and implemented over a distributed simulation network using the Common Object Request Broker Architecture (CORBA). The CORBA distributed simulation network accesses heterogeneous distributed databases, performs distributed processes, and supports portability and reuse of simulation objects and interoperability across operating systems and programming languages.

Go to article

Analyzing And Improving Stochastic Network Security: A Multicriteria Prescriptive Risk Analysis Model, David L. Lyle Mar 1997

Analyzing And Improving Stochastic Network Security: A Multicriteria Prescriptive Risk Analysis Model, David L. Lyle

Theses and Dissertations

This research optimized two measures of network security by hardening components and improving their reliability. A common measure of effectiveness (MOE) for networks is statistical reliability, which ignores the effects of hostile actions. A new MOE which includes hostile actions was developed. Both measures require component reliability functions, derived using fault trees. Fuzzy Logic and Monte Carlo simulation were used to quantify uncertainty. Results from the model are compared to traditional Risk Assessment results.

Go to article

Teaching Ethical And Social Issues In Cs1 And Cs2, Kay G. Schulze, Frances Grodzinsky Mar 1997

Teaching Ethical And Social Issues In Cs1 And Cs2, Kay G. Schulze, Frances Grodzinsky

School of Computer Science & Engineering Faculty Publications

The discussion of whether ethical and social issues of computing should be explored in undergraduate computer science education has resulted in most academic institutions and educators agreeing that they are important topics that must be included. Further support has been provided by Curricula '91 [16], the CSAC/CSAB accreditation [2] and ImpactCS [12]. Many books [7, 8, 9, 10] and papers [6, 14] have discussed what topics should be covered and what techniques can be used either in a dedicated course or in modules across the curriculum. However, explicit detailed examples that have worked successfully, particularly in lower level computer science …

Go to article

Computer Access For Students With Disabilities: An Adaptive Technology Laboratory, Frances Grodzinsky Mar 1997

Computer Access For Students With Disabilities: An Adaptive Technology Laboratory, Frances Grodzinsky

School of Computer Science & Engineering Faculty Publications

Adaptive technology, which permits equity of access, has helped to reassure people with disabilities that they can attempt a university education with minimal accommodation.

Go to article

Post-Surgical Passive Response Of Local Environment To Primary Tumor Removal, J. A. Adam, C. Bellomo Mar 1997

Post-Surgical Passive Response Of Local Environment To Primary Tumor Removal, J. A. Adam, C. Bellomo

Mathematics & Statistics Faculty Publications

Prompted by recent clinical observations on the phenomenon of metastasis inhibition by an angiogenesis inhibitor, a mathematical model is developed to describe the post-surgical response of the local environment to the “surgical” removal of a spherical tumor in an infinite homogeneous domain. The primary tumor is postulated to be a source of growth inhibitor prior to its removal at t = 0; the resulting relaxation wave arriving from the disturbed (previously steady) state is studied, closed form analytic solutions are derived, and the asymptotic speed of the pulse is estimated to be about 2 × 10−4 cm/sec for the …

Go to article

Cascade Artmap: Integrating Neural Computation And Symbolic Knowledge Processing, Ah-Hwee Tan Mar 1997

Cascade Artmap: Integrating Neural Computation And Symbolic Knowledge Processing, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

This paper introduces a hybrid system termed cascade adaptive resonance theory mapping (ARTMAP) that incorporates symbolic knowledge into neural-network learning and recognition. Cascade ARTMAP, a generalization of fuzzy ARTMAP, represents intermediate attributes and rule cascades of rule-based knowledge explicitly and performs multistep inferencing. A rule insertion algorithm translates if-then symbolic rules into cascade ARTMAP architecture. Besides that initializing networks with prior knowledge can improve predictive accuracy and learning efficiency, the inserted symbolic knowledge can be refined and enhanced by the cascade ARTMAP learning algorithm. By preserving symbolic rule form during learning, the rules extracted from cascade ARTMAP can be compared …

Go to article

Object Matching Using The Dynamic Programming Algorithm, Rhoda Baggs Koss Mar 1997

Object Matching Using The Dynamic Programming Algorithm, Rhoda Baggs Koss

Theses and Dissertations

A new algorithm for matching objects between images is developed and investigated. Affine transformations, i.e. those with translation, rotation, scaling and shearing between images are considered. Steps along the way include segmentation of the 2 images (referred to as the reference and inspected images), contour tracing of each segment/object in each image, the creation of objects via a new object representation scheme known as length codes (developed in [3]), and the application of the new dynamic warping algorithm. New original concepts include the use of the dynamic warping algorithm on sequences of length codes in order to determine the k …

Go to article

An Introduction To Algorithmic Information Theory: Its History And Some Examples, George Markowsky Mar 1997

An Introduction To Algorithmic Information Theory: Its History And Some Examples, George Markowsky

Computer Science Faculty Research & Creative Works

The goal of this paper is to provide a simple introduction to Algorithmic Information Theory (AIT) that will highlight some of the main ideas without presenting too many details. More technical treatments of these ideas can be found in References [1], [2], [3] and [4], which are listed at the end of the paper. The main ideas of Algorithmic Information Theory will be presented using English as the underlying programming language. The presentation illustrates the fact that the same arguments can be expressed in any other reasonable language and that the main results have a robust universality across all reasonable …

Go to article

On The Power Of Multi-Objects, Prasad Jayanti, Sanjay Khanna Feb 1997

On The Power Of Multi-Objects, Prasad Jayanti, Sanjay Khanna

Computer Science Technical Reports

In the standard ``single-object'' model of shared-memory computing, it is assumed that a process accesses at most one shared object in each of its steps. In this paper, we consider a more powerful variant---the ``multi-object'' model---in which each process may access *any* finite number of shared objects atomically in each of its steps. We present results that relate the synchronization power of a type in the multi-object model to its synchronization power in the single-object model. Although the types fetch&add and swap have the same synchronization power in the single-object model, Afek, Merritt, and Taubenfeld showed that their synchronization powers …

Go to article

Peak-To-Mean Power Control And Error Correction For Ofdm Transmission Using Golay Sequences And Reed-Muller Codes, James A. Davis, J Jedwab Feb 1997

Peak-To-Mean Power Control And Error Correction For Ofdm Transmission Using Golay Sequences And Reed-Muller Codes, James A. Davis, J Jedwab

Department of Math & Statistics Faculty Publications

A coding scheme for OFDM transmission is proposed, exploiting a previously unrecognised connection between pairs of Golay complementary sequences and second-order Reed-Muller codes. The scheme solves the notorious problem of power control in OFDM systems by maintaining a peak-to-mean envelope power ratio of at most 3dB while allowing simple encoding and decoding at high code rates for binary, quaternary or higher-phase signalling together with good error correction.

Go to article

Agdb: A Debugger For Agent Tcl, Melissa Hirschl, David Kotz Feb 1997

Agdb: A Debugger For Agent Tcl, Melissa Hirschl, David Kotz

Computer Science Technical Reports

The Agent Tcl language is an extension of Tcl/Tk that supports distributed programming in the form of transportable agents. AGDB is a debugger for the Agent Tcl language. AGDB mixes of traditional and distributed debugging facilities. Traditional debugging features include breakpoints (line-specific, conditional, and once-only), watch conditions and variables, and interrupts. Distributed-debugging features address issues inherent in distributed programming such as migration and communication. These capabilities make debugging distributed programs difficult because they add complexities like race conditions to the set of problems a program can encounter. This paper discusses how AGDB uses distributed debugging features to debug agents.

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 2, February 1997, College Of Engineering And Computer Science, Wright State University Feb 1997

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 2, February 1997, 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.

Go to article

Automatic Video Pause Detection Filter, Xiaowen Liu, Charles B. Owen, Fillia S. Makedon Feb 1997

Automatic Video Pause Detection Filter, Xiaowen Liu, Charles B. Owen, Fillia S. Makedon

Computer Science Technical Reports

Increasing interest in multimedia research has been drawn upon the development of video indexing and content-based image retrieval techniques. In this report, we proposed several pause detection algorithms, which instead of searching for significant visual transitions, the algorithms detect significant pauses in video streams. A realization of the algorithms was implemented using ImageTcl toolkit developed at Dartmouth Experimental Visualization Laboratory. In addition to proposing and studying the effectiveness of the pause detection algorithms, another major goal will be to incorporate our algorithms into ImageTcl and test the stability and applicability of the ImageTcl environment. Priliminary experiments showed relatively good results …

Go to article

Asml: Automatic Site Markup Language 1.03, Charles B. Owen, Fillia Makedon, Glen Frank, Michael Kenyon Feb 1997

Asml: Automatic Site Markup Language 1.03, Charles B. Owen, Fillia Makedon, Glen Frank, Michael Kenyon

Computer Science Technical Reports

Creation of large and complex World Wide Web sites is hampered by the "page at a time" approach of many tools and the programming knowledge and custom software development required for automated solutions. This report describes the development of the Automatic Site Markup Language (ASML). ASML is a new markup language designed to produce large, complicated web sites which can include dynamic content. ASML extends HTML with new, high-level features while still preserving complete compatibility with common browser and server technologies. It has powerful indexing and searching facilities, and enables the automatic translation of document formats. Most importantly, ASML provides …

Go to article

Active Gateway: A Facility For Video Conferencing Traffic Control, Shunge Li, Bharat Bhargava Feb 1997

Active Gateway: A Facility For Video Conferencing Traffic Control, Shunge Li, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Sampling And Reconstructing Manifolds Using Alpha-Shapes, Fausto Bernardini, Chandrajit L. Bajaj Feb 1997

Sampling And Reconstructing Manifolds Using Alpha-Shapes, Fausto Bernardini, Chandrajit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Softlab: A Virtual Laboratory Framework For Computational Science, A. C. Catlin, M. G. Gaitatzes, Elias N. Houstis, Z. Ma, S. Markus, Nien-Hwa Wang, S. Weerawarana Feb 1997

Softlab: A Virtual Laboratory Framework For Computational Science, A. C. Catlin, M. G. Gaitatzes, Elias N. Houstis, Z. Ma, S. Markus, Nien-Hwa Wang, S. Weerawarana

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Some Relationships Between Foies And Sigma 1 1 Arity Hierarchies, Guozhu Dong, Limsoon Wong Feb 1997

Some Relationships Between Foies And Sigma 1 1 Arity Hierarchies, Guozhu Dong, Limsoon Wong

Kno.e.sis Publications

No abstract provided.

Go to article

Dynamic Correlations In Porous Media, J.C. Lee Feb 1997

Dynamic Correlations In Porous Media, J.C. Lee

Faculty Publications

When binary liquid mixtures are infused into various random porous media, past experiment have shown that different media affect the dynamic correlations of concentration fluctuations in different ways. Vycor glasses of relatively small pore size and dilute gels allow the exponential bulk mode to remain in the final ensemble average, but Vycor glasses of vary large pore size do not. We take this to mean that the relaxation time of the bulk mode is spatialIy homogeneous in the two former media but heterogeneous in the latter media. Thus we search for a heterogeneous dynamic mode with an Ising model. We …

Go to article

Inductive Neural Logic Network And The Scm Algorithm, Ah-Hwee Tan, Loo-Nin Teow Feb 1997

Inductive Neural Logic Network And The Scm Algorithm, Ah-Hwee Tan, Loo-Nin Teow

Research Collection School Of Computing and Information Systems

Neural Logic Network (NLN) is a class of neural network models that performs both pattern processing and logical inferencing. This article presents a procedure for NLN to learn multi-dimensional mapping of both binary and analog data. The procedure, known as the Supervised Clustering and Matching (SCM) algorithm, provides a means of inferring inductive knowledge from databases. In contrast to gradient descent error correction methods, pattern mapping is learned by an inductive NLN using fast and incremental clustering of input and output patterns. In addition, learning/encoding only takes place when both the input and output match criteria are satisfied in a …

Go to article

Studies Of Qcd In E+E- → Hadrons At Ecm = 130 And 136 Gev, D. Buskulic, M. Thulasidas Feb 1997

Studies Of Qcd In E+E- → Hadrons At Ecm = 130 And 136 Gev, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

Studies of QCD in e+e−→e+e−→ Hadrons at Ecm=Ecm=} 130 and 136 GeV The ALEPH Collaboration An analysis of the properties of hadronic final states produced in electron-positron annihilation at centre-of-mass energies of 130 and 136 GeV is presented. The measurements are based on a data sample of 5.7 pb−1pb−1 collected in November 1995 with the \Aleph detector at LEP. Inclusive charged particle distributions, jet rates and event-shape distributions are measured and the results are compared with the predictions of QCD-based models. From the measured distributions quantities are determined for which the dependence on the centre-of-mass energy can be predicted by …

Go to article

On The Classification Of Computable Languages, John Case, Efim Kinber, Arun Sharma, Frank Stephan Feb 1997

On The Classification Of Computable Languages, John Case, Efim Kinber, Arun Sharma, Frank Stephan

School of Computer Science & Engineering Faculty Publications

A one-sided classifier converges to 1 on every set inside a given class and outputs infinitely often a 0 on every set outside the class. A two-sided classifier converges in the first case to 1 and in the second to 0. This paper considers one-sided and two-sided classifiers dealing with computable sets as input. It provides theorems from which the classifiability of natural examples can be assessed and investigates the relations of the types of classification to inductive learning theory and structural complexity theory in terms of Turing degrees. Furthermore, it deals with the special cases of classification from positive …

Go to article

Minimizing Channel Density With Movable Terminals, Ronald I. Greenberg, Jau-Der Shih Feb 1997

Minimizing Channel Density With Movable Terminals, Ronald I. Greenberg, Jau-Der Shih

Computer Science: Faculty Publications and Other Works

We give algorithms to minimize density for VLSI channel routing problems with terminals that are movable subject to certain constraints. The main cases considered are channels with linear order constraints, channels with linear order constraints and separation constraints, channels with movable modules containing fixed terminals, and channels with movable modules and terminals. In each case, we improve previous results for running time and space by a factor of L/\lgn and L, respectively, where L is the channel length, and n is the number of terminals.

Go to article

An Efficient Scheme For A Distributed Video Retrieval System For Remote Users, Fillia Makedon, James Matthews, Charles Owen, Samuel Rebelsky Feb 1997

An Efficient Scheme For A Distributed Video Retrieval System For Remote Users, Fillia Makedon, James Matthews, Charles Owen, Samuel Rebelsky

Computer Science Technical Reports

The new era of digital video and multimedia technologies has created the potential for large libraries of digital video. With this new technology come the challenges of creating usable means by which such large and diverse depositories of digital information (digital libraries) can be efficiently queried and accessed so that (a) the response is fast, (b) the communication over the Internet is minimal and (c) the retrieval is characterized by high precision and recall. In this paper we discuss how existing digital video editing tools, together with data compression techniques, can be combined to create a fast, accurate and cost …

Go to article

Ua66/3/2 Computer Science Alumni Newsletter, Vol. 10, Wku Computer Science Feb 1997

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

WKU Administration Documents

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

Go to article

Transportable Information Agents, Daniela Rus, Robert Gray, David Kotz Feb 1997

Transportable Information Agents, Daniela Rus, Robert Gray, David Kotz

Dartmouth Scholarship

Transportable agents are autonomous programs. They can move through a heterogeneous network of computers under their own control, migrating from host to host. They can sense the state of the network, monitor software conditions, and interact with other agents or resources. The network-sensing tools allow our agents to adapt to the network configuration and to navigate under the control of reactive plans. In this paper we describe the design and implementation of the navigation system that gives our agents autonomy. We also discuss the intelligent and adaptive behavior of autonomous agents in distributed information-gathering tasks.

Go to article

First Prev Next Last