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 53881 - 53910 of 58006

Full-Text Articles in Physical Sciences and Mathematics

Reducing Web Latencies Using Precomputed Hints, Girish P. Chandranmenon, George Varghese Jan 1997

Reducing Web Latencies Using Precomputed Hints, Girish P. Chandranmenon, George Varghese

All Computer Science and Engineering Research

Current network technology is bandwidth-rich but latency-poor; thus round-trip delays will dominate access latency for web traffic. We describe four new techniques that reduce the round-trips needed for web accesses. The techniques are based on the paradigm of preprocessing a web page to collect information about links and inline data in the page. Stored Address Binding almost always eliminates the DNS lookup (which can cost seconds) at the start of a transaction. In Informed Server Proxying, a server tells its client that it has cached pages referenced in a page the client just retrieved; this allows the client to retrieve …


Cappucino: An Extensible Planning Tool For Constraint-Based Atm Network Design, Inderjeet Singh, Jonathan S. Turner Jan 1997

Cappucino: An Extensible Planning Tool For Constraint-Based Atm Network Design, Inderjeet Singh, Jonathan S. Turner

All Computer Science and Engineering Research

Cappuccino is a planning tool for topological design of ATM networks. It uses a novel constraint-based approach to ATM network design. Extensibility of the tool is a basic design goal and the tool provides an open interface to incorporate new algorithms.


Dynamic Flow Switching: A New Communication Service For Atm Networks, Qiyong Bian, Kohei Shimoto, Jonathan Turner Jan 1997

Dynamic Flow Switching: A New Communication Service For Atm Networks, Qiyong Bian, Kohei Shimoto, Jonathan Turner

All Computer Science and Engineering Research

This paper presents a new communication service for ATM networks that provides one-way, adjustable rate, on-demand communication channels. The proposed dynamic flow service is designed to operate within a multi-service cell switched network that supports both conventional switched virtual circuits and IP packet routing and is designed to complement those services. It is particularly well suited to applications that transmit substantial amounts of data (a few tens of kilobytes or more) in fairly short time periods (up to a few seconds). Much of the current world-wide web traffic falls within this domain. Like IP packet networks, the new service permits …


Replication Of The First Controlled Experiment On The Usefulness Of Design Patterns: Detailed Description And Evaluation, Lutz Prechelt, Barbara Unger, Douglas Schmidt Jan 1997

Replication Of The First Controlled Experiment On The Usefulness Of Design Patterns: Detailed Description And Evaluation, Lutz Prechelt, Barbara Unger, Douglas Schmidt

All Computer Science and Engineering Research

Advocates of software design patterns claim that using design patterns improves communication between software developers. The controled experiment that we describe in this report tests the hypothesis that software maintainers of well-structured, well-documented software containing design patterns can make changes (1) faster and (2) with less errors if the use of patterns is explicitly documented in the software. The experiment was performed with 22 participants of a university course on C++ and design patterns; it is similar to a previous experiment performed in Karlsruhe. For one of the two experiment tasks the experiment finds that both hypotheses appear to be …


Enhancements To 4.4 Bsd Unix For Efficient Networked Multimedia In Project Mars, Milind M. Buddhikot, Xin Jane Chen, Dakang Wu, Guru M. Parulkar Jan 1997

Enhancements To 4.4 Bsd Unix For Efficient Networked Multimedia In Project Mars, Milind M. Buddhikot, Xin Jane Chen, Dakang Wu, Guru M. Parulkar

All Computer Science and Engineering Research

Cluster based architectures that employ high performance inexpensive Personal Computers (PCs) interconnected by high speed commodity interconnect have been recognized as a cost-effective way of building high performance scalable Multimedia-On-Demand (MOD) storage servers [4, 5, 7, 9]. Typically, the PCs in these architectures run operating systems such as UNIX that have traditionally been optimized for interactive computing. They do not provide fast disk-to-network data paths and guaranteed CPU and storage access. This paper reports enhancements to the 4.4 BSD UNIX system carried out to rectify these limitations in the context of our Project Massively-parallel And Real-time Storage (MARS) [7]. We …


An Introduction To Mobile Unity, Gruia-Catalin Roman, Peter J. Mccann Jan 1997

An Introduction To Mobile Unity, Gruia-Catalin Roman, Peter J. Mccann

All Computer Science and Engineering Research

Traditionally, a distributed system has been viewed as a collection of fixed computational elements connected by a static network. Prompted by recent advances in wireless communications rechnology, the emerging field of mobile computing is challenging these assumptions by providing mobile hosts with connectivity that may change over time, raising the possibility that hosts may be called upon to operate while only weakly connected to or while completely disconnected from other hosts. We define a concurrent mobile system as one where independently executing coponents may migrate through some space during the course of the computation, and where the pattern of connectivity …


Compositional Programming Abstractions For Mobile Computing, Peter J. Mccann, Gruia-Catalin Roman Jan 1997

Compositional Programming Abstractions For Mobile Computing, Peter J. Mccann, Gruia-Catalin Roman

All Computer Science and Engineering Research

Recent advances in wireless networking technology and the increasing demand for ubiquitous, mobile connectivity demonstrate the importance of providing reliable systems for managing reconfiguration and disconnection of components. Design of such systems requires tools and techniques appropriate to the task. Many formal models of computation, including UNITY, are not adequate for expressing reconfiguration and disconnection and are therefore inappropriate vehicles for investigating the impact of mobility on the construction of modular and composable systems. Algebraic formalisms such as the pi-calculus have been proposed for modeling mobility. This paper addresses the question of whether UNITY, a state-based formalism with a foundation …


Terabit Burst Switching, Jonathan S. Turner Jan 1997

Terabit Burst Switching, Jonathan S. Turner

All Computer Science and Engineering Research

This report summarizes the results of an architectural study on Terabit Burst Switching. The purpose of this study was to explore alternative architectures for very high performance switching for data communication, using a combination of optical and electronic technologies. We explore two alternative implementations of the burst switching concept in detail, one using a hybrid architecture with an electronic core, and an integrated architecture using an all optical data path. We also briefly discuss an approach using optical TDM. Our results show that using the hybrid architecture, it is feasible to construct systems with aggregate capacities of tens of terabits …


Privacy Issues Dealing With Technology : A Review Of The Literature, Kimberly S. Mccoy Jan 1997

Privacy Issues Dealing With Technology : A Review Of The Literature, Kimberly S. Mccoy

Graduate Research Papers

The sophisticated applications of technology are expanding everyday. Unfortunately, so are the many concerns individuals in society are having about their right to privacy. The actual regulations dealing with one's right to privacy has not expand as rapidly as the applications of technology. Individuals using various types of technology are under the assumption their activities are private; however, this is not the case. It does not seem to matter if you are using a computer for communications work, school, or in the "privacy" of your own home, there is absolutely no privacy when dealing with this type of technology.

This …


Software Reuse: Architecture, Process And Organization For Business Success, Ivar Jacobson, Martin Griss, Patrik Jonsson Dec 1996

Software Reuse: Architecture, Process And Organization For Business Success, Ivar Jacobson, Martin Griss, Patrik Jonsson

Martin L Griss

No abstract provided.


Constraint Satisfaction Methods For Generating Valid Cuts, John Hooker Dec 1996

Constraint Satisfaction Methods For Generating Valid Cuts, John Hooker

John Hooker

No abstract provided.


Computer System For Simulating Physical Processes Using Multiple Integer State Vectors Us:5594671, Hudong Chen, Peter Churchill, Robert Iannucci, Kim Molvig, Gregory Papadopoulos, Stephen Remondi, Christopher Teixeira, Kenneth Traub Dec 1996

Computer System For Simulating Physical Processes Using Multiple Integer State Vectors Us:5594671, Hudong Chen, Peter Churchill, Robert Iannucci, Kim Molvig, Gregory Papadopoulos, Stephen Remondi, Christopher Teixeira, Kenneth Traub

Robert A Iannucci

No abstract provided.


An Analysis Of Surface Area Estimates Of Binary Volumes Under Three Tilings, Erik G. Learned-Miller Dec 1996

An Analysis Of Surface Area Estimates Of Binary Volumes Under Three Tilings, Erik G. Learned-Miller

Erik G Learned-Miller

In this paper, we first review local counting methods for perimeter estimation of piecewise smooth binary figures on square, hexagonal, and triangular grids. We verify that better perimeter estimates, using local counting algorithms, can be obtained using hexagonal or triangular grids. We then compare surface area estimates using local counting techniques for binary three-dimensional volumes under the three semi-regular polyhedral tilings: the cubic, truncated octahedral, and rhombic dodecahedral tilings. It is shown that for surfaces of random orientation with a uniform distribution, the expected error of surface area estimates is smaller for the truncated octahedral and rhombic dodecahedral tilings than …


Aphasic Sentence Comprehension As A Resource Deficit: A Computational Approach, Henk J. Haarmann, Marcel Adam Just, Patricia A. Carpenter Dec 1996

Aphasic Sentence Comprehension As A Resource Deficit: A Computational Approach, Henk J. Haarmann, Marcel Adam Just, Patricia A. Carpenter

Marcel Adam Just

No abstract provided.


On Unifying Time And Uncertainty: The Probabilistic Temporal Network, Joel D. Young Dec 1996

On Unifying Time And Uncertainty: The Probabilistic Temporal Network, Joel D. Young

Theses and Dissertations

Complex real-world systems consist of collections of interacting processes/events. These processes change over time in response to both internal and external stimuli as well as to the passage of time. Many domains such as real-time systems diagnosis, (mechanized) story understanding, planning and scheduling, and financial forecasting require the capability to model complex systems under a unified framework to deal with both time and uncertainty. Existing uncertainty representations and existing temporal models already provide rich languages for capturing uncertainty and temporal information, respectively. Unfortunately, these partial solutions have made it extremely difficult to unify time and uncertainty in a way that …


Student Modeling In An Intelligent Tutoring System, Jeremy E. Thompson Dec 1996

Student Modeling In An Intelligent Tutoring System, Jeremy E. Thompson

Theses and Dissertations

This thesis explores a new approach to modeling the student in an intelligent tutoring system (ITS), by providing a student model which learns new solutions from the student. A prototype of the new approach to ITS is demonstrated in the Euclidean geometry domain. Complete C++, CLIPS, and Tcl/Tk code listings are included in the appendices for reference. Adaptable multiple software agents were targeted for implementation, based on current literature. However, the student model is found to be maintainable without multiple software agents, while still allowing for tracking several possible solution paths when monitoring student solutions. This capability contradicts previous research …


Reverse Engineering Of Computer-Based Navy Systems, Lonnie R. Welch, Guohui Yu, Binoy Ravindran, Franz J. Kurfess, Jorge Henriques, Mark Wilson, Antonio L. Samuel, Michael W. Masters Dec 1996

Reverse Engineering Of Computer-Based Navy Systems, Lonnie R. Welch, Guohui Yu, Binoy Ravindran, Franz J. Kurfess, Jorge Henriques, Mark Wilson, Antonio L. Samuel, Michael W. Masters

Computer Science and Software Engineering

The financial pressure to meet the need for change in computer-based systems through evolution rather than through revolution has spawned the discipline of reengineering. One driving factor of reengineering is that it is increasingly becoming the case that enhanced requirements placed on computer-based systems are overstressing the processing resources of the systems. Thus, the distribution of processing load over highly parallel and distributed hardware architectures has become part of the reengineering process for computer-based Navy systems.

This paper presents an intermediate representation (IR) for capturing features of computer-based systems to enable reengineering for concurrency. A novel feature of the IR …


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 10, December 1996, College Of Engineering And Computer Science, Wright State University Dec 1996

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 10, December 1996, 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.


Cross-Input Amortization Captures The Diffuse Adversary, Neal E. Young Dec 1996

Cross-Input Amortization Captures The Diffuse Adversary, Neal E. Young

Computer Science Technical Reports

Koutsoupias and Papadimitriou recently raised the question of how well deterministic on-line paging algorithms can do against a certain class of adversarially biased random inputs. Such an input is given in an on-line fashion; the adversary determines the next request probabilistically, subject to the constraint that no page may be requested with probability more than a fixed $\epsilon>0$. In this paper, we answer their question by estimating, within a factor of two, the optimal competitive ratio of any deterministic on-line strategy against this adversary. We further analyze randomized on-line strategies, obtaining upper and lower bounds within a factor of …


Secure Outsourcing Of Some Computations, Mikhail J. Atallah, Konstantinos N. Pantazopoulos, Eugene H. Spafford Dec 1996

Secure Outsourcing Of Some Computations, Mikhail J. Atallah, Konstantinos N. Pantazopoulos, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.


Low-Threat Security Patches And Tools, Mohd A. Bashar, Ganesh Krishnan, Markus G. Kuhn, Eugene H. Spafford, Samuel S. Wagstaff Jr Dec 1996

Low-Threat Security Patches And Tools, Mohd A. Bashar, Ganesh Krishnan, Markus G. Kuhn, Eugene H. Spafford, Samuel S. Wagstaff Jr

Department of Computer Science Technical Reports

No abstract provided.


Searching For Ephemeral Subsequences In Strings, Alberto Apostolico, Mikhail J. Attalah Dec 1996

Searching For Ephemeral Subsequences In Strings, Alberto Apostolico, Mikhail J. Attalah

Department of Computer Science Technical Reports

No abstract provided.


Safe Structural Conformance For Java, Konstantin Laufer, Gerald Baumgartner, Vincent F. Russo Dec 1996

Safe Structural Conformance For Java, Konstantin Laufer, Gerald Baumgartner, Vincent F. Russo

Department of Computer Science Technical Reports

No abstract provided.


Misplaced Trust: Kerberos 4 Session Keys, Bryn Dole, Steve Lodin, Eugene H. Spafford Dec 1996

Misplaced Trust: Kerberos 4 Session Keys, Bryn Dole, Steve Lodin, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.


Towards The Determination Of The Optimal P-Cyclic Ssor, A. Hadjidimos, D. Noutsos, M. Tzoumas Dec 1996

Towards The Determination Of The Optimal P-Cyclic Ssor, A. Hadjidimos, D. Noutsos, M. Tzoumas

Department of Computer Science Technical Reports

No abstract provided.


On The Approximate Pattern Occurrences In A Text, Mireille Régnier, Wojciech Szpankowski Dec 1996

On The Approximate Pattern Occurrences In A Text, Mireille Régnier, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Entropy Computations Via Analytic Depoissonization, Philippe Jacquet, Wojciech Szpankowski Dec 1996

Entropy Computations Via Analytic Depoissonization, Philippe Jacquet, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


On Asymptotics Of Certain Recurrences Arising In Multi-Alphabet Universal Coding, Wojciech Szpankowski Dec 1996

On Asymptotics Of Certain Recurrences Arising In Multi-Alphabet Universal Coding, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Knowledge Discovery In Computational Science: A Case Study In Algorithm Selection, N. Ramakrishnan, John R. Rice Dec 1996

Knowledge Discovery In Computational Science: A Case Study In Algorithm Selection, N. Ramakrishnan, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


The Purdue Pse Kernel: Towards A Kernel For Building Pses, Sanjiva Weerawarana, Elias N. Houstis, John R. Rice, Ann C. Catlin, Margaret G. Gaitatzes, Shahani Markus, Tzveten T. Drashansky Dec 1996

The Purdue Pse Kernel: Towards A Kernel For Building Pses, Sanjiva Weerawarana, Elias N. Houstis, John R. Rice, Ann C. Catlin, Margaret G. Gaitatzes, Shahani Markus, Tzveten T. Drashansky

Department of Computer Science Technical Reports

No abstract provided.