Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (13560)
- Computer Sciences (13035)
- Electrical and Computer Engineering (7208)
- Artificial Intelligence and Robotics (4370)
- Operations Research, Systems Engineering and Industrial Engineering (4209)
-
- Numerical Analysis and Scientific Computing (3961)
- Systems Science (3944)
- Digital Communications and Networking (2154)
- Other Computer Engineering (1677)
- Computer and Systems Architecture (1618)
- Data Storage Systems (1552)
- Social and Behavioral Sciences (1438)
- Civil and Environmental Engineering (1327)
- Robotics (1248)
- Civil Engineering (1105)
- Mechanical Engineering (958)
- Electrical and Electronics (906)
- Information Security (742)
- Environmental Engineering (658)
- Other Civil and Environmental Engineering (646)
- Systems and Communications (639)
- Chemical Engineering (609)
- Materials Science and Engineering (606)
- Hydraulic Engineering (574)
- Law (536)
- Hardware Systems (514)
- Business (482)
- Legal Studies (468)
- Institution
-
- China Simulation Federation (3880)
- TÜBİTAK (3106)
- Wright State University (1814)
- University of Nebraska - Lincoln (1069)
- University of Texas at El Paso (858)
-
- Washington University in St. Louis (733)
- Technological University Dublin (731)
- California Polytechnic State University, San Luis Obispo (721)
- Brigham Young University (641)
- Old Dominion University (579)
- Embry-Riddle Aeronautical University (563)
- Singapore Management University (546)
- Universitas Indonesia (443)
- San Jose State University (439)
- Santa Clara University (415)
- Air Force Institute of Technology (413)
- Marquette University (412)
- University of South Carolina (320)
- California State University, San Bernardino (288)
- University of Central Florida (271)
- Portland State University (265)
- Chulalongkorn University (243)
- Al Iraqia University (235)
- Purdue University (218)
- University of South Florida (218)
- University of Arkansas, Fayetteville (207)
- University of Nevada, Las Vegas (191)
- New Jersey Institute of Technology (185)
- Nova Southeastern University (183)
- University of Dayton (166)
- Keyword
-
- Machine learning (439)
- Computer Science (385)
- Deep learning (347)
- Department of Computer Science and Engineering (319)
- Machine Learning (287)
-
- Engineering (274)
- Simulation (237)
- Robotics (231)
- Security (183)
- Artificial intelligence (173)
- Deep Learning (170)
- Optimization (170)
- Computer Engineering (168)
- Classification (163)
- College of Engineering and Computer Science (157)
- Newsletters (157)
- Science news (157)
- Technical writing (157)
- Cybersecurity (154)
- Artificial Intelligence (148)
- Computer vision (141)
- Computer Science and Engineering (136)
- Genetic algorithm (119)
- Blockchain (99)
- Internet (97)
- Virtual reality (97)
- Path planning (94)
- Data mining (93)
- Clustering (91)
- Privacy (91)
- Publication Year
- Publication
-
- Journal of System Simulation (3880)
- Turkish Journal of Electrical Engineering and Computer Sciences (3106)
- Computer Science & Engineering Syllabi (1312)
- Departmental Technical Reports (CS) (760)
- Theses and Dissertations (728)
-
- All Computer Science and Engineering Research (683)
- International Congress on Environmental Modelling and Software (629)
- Research Collection School Of Computing and Information Systems (511)
- Department of Electrical and Computer Engineering: Faculty Publications (496)
- Makara Journal of Technology (436)
- Electrical and Computer Engineering Faculty Research and Publications (389)
- Browse all Theses and Dissertations (342)
- Electronic Theses and Dissertations (341)
- Dissertations (340)
- Faculty Publications (321)
- Journal of Digital Forensics, Security and Law (299)
- Computer Science and Engineering Senior Theses (294)
- Master's Theses (289)
- Computer Engineering (282)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (242)
- Iraqi Journal for Computer Science and Mathematics (235)
- Master's Projects (220)
- School of Computing: Dissertations, Theses, and Student Research (206)
- Electrical and Computer Engineering Faculty Publications (204)
- Electrical & Computer Engineering Theses & Dissertations (193)
- Conference papers (178)
- Publications (169)
- BITs and PCs Newsletter (157)
- USF Tampa Graduate Theses and Dissertations (157)
- Journal of International Technology and Information Management (153)
- Publication Type
- File Type
Articles 24811 - 24840 of 25622
Full-Text Articles in Computer Engineering
An Architecture For Monitoring Visualization And Control Of Gigabit Networks, Guru Parulkar, Douglas Schmidt, Eileen Kraemer, Jonathan Turner, Anshul Kantawala
An Architecture For Monitoring Visualization And Control Of Gigabit Networks, Guru Parulkar, Douglas Schmidt, Eileen Kraemer, Jonathan Turner, Anshul Kantawala
All Computer Science and Engineering Research
We propose a network monitoring, visualization and control system (NMVC) that ensures adequate quality of service to network users while maintaining high network resource utilization. The main components of our system are a network probe, an endsystem probe, software network management agents that provide extensible multi-attribute event filtering for highly scalable data/event collection, network operation centers (NOCs) which can remotely install and (re)configure these agents, efficient online event ordering algorithms that can help synthesize and display a consistent view of network health, status and performance and a View Choreographer that allows management applications and administrators to specify the mapping of …
Enhancements To 4.4 Bsd Unix For Efficient Networked Multimedia In Project Mars, Milind M. Buddhikot, Xin Jane Chen, Dakang Wu, Guru M. Parulkar
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 …
Replication Of The First Controlled Experiment On The Usefulness Of Design Patterns: Detailed Description And Evaluation, Lutz Prechelt, Barbara Unger, Douglas Schmidt
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 …
Computational Detection Of Cpg Islands In Dna, Eric C. Rouchka, Richard Mazzarella, David J. States
Computational Detection Of Cpg Islands In Dna, Eric C. Rouchka, Richard Mazzarella, David J. States
All Computer Science and Engineering Research
Regions of DNA rich in CpG dinucleotides, also known as CpG islands, are often located upstream of the transcription start side in both tissue specific and housekeeping genes. Overall, CPG dinucleotides are observed at a density of 25% the expected level from base composition alone, partially due to 5-methylcytosine decay (Bird, 1993). Since CpG dinucleotides typically occur with low frequency, CpG islands can be distinguished statistically in the genome. Our method of detecting CpG islands involves a heuristic algorithm employing classic changepoint methods and log-likelihood statistics. A Java applet has been created to allow for user interaction and visualization of …
An Algorithm For Message Delivery In A Micromobility Environment, Amy L. Murphy, Gruia-Catalin Roman, George Varghese
An Algorithm For Message Delivery In A Micromobility Environment, Amy L. Murphy, Gruia-Catalin Roman, George Varghese
All Computer Science and Engineering Research
With recent advances in wireless communication and the ubiquity of laptops, mobile computing has become an important research area. An essential problem in mobile computing is the delivery of a message from a source to either a single mobile node, unicast, or to a group of mobile nodes, multicast. Standard solutions proposed for macromobility (Mobile IP) and micromobility (cellular phones) for the unicast problem rely on tracking the mobile node. Tracking solutions scale badly when mobile nodes move frequently, and do not generalize well to multicast delivery. Our paper proposes a new message delivery algorithm for micromobility based on a …
An Introduction To Mobile Unity, Gruia-Catalin Roman, Peter J. Mccann
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 …
Terabit Burst Switching, Jonathan S. Turner
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 …
The Agent Test, Michael N. Huhns, Munindar P. Singh
The Agent Test, Michael N. Huhns, Munindar P. Singh
Faculty Publications
The authors consider agents on the World Wide Web, including information retrieval agents. They propose a test for agenthood, involving communication in multi-agent systems.
Internet-Based Agents: Applications And Infrastructure, Munindar P. Singh, Michael N. Huhns
Internet-Based Agents: Applications And Infrastructure, Munindar P. Singh, Michael N. Huhns
Faculty Publications
Software agents are mitigating the complexity of modern information systems—technically by providing a locus for managing information subsets, and psychologically by providing an abstraction for human interaction with them.
Mobile Agents, Michael N. Huhns, Munindar P. Singh
Mobile Agents, Michael N. Huhns, Munindar P. Singh
Faculty Publications
A lot of agents are executing on the Web, and some of them are starting to move around. While most agents are static (existing as a single process or thread on one host), others can pick up and move their code and data to a new host where they resume executing.
Conversational Agents, Michael N. Huhns, Munindar P. Singh
Conversational Agents, Michael N. Huhns, Munindar P. Singh
Faculty Publications
When you build or buy an agent for the Web, you want it to perform as well as possible. Increasingly, this means your agent should take advantage not only of the Web's information resources, but also of all the other agents that might be operating there.
Agents Are Everywhere!, Michael N. Huhns, Munindar P. Singh
Agents Are Everywhere!, Michael N. Huhns, Munindar P. Singh
Faculty Publications
A decade ago this claim would have evoked images from the Cold War—and probably gotten this column classified! Today, it describes one of the hottest technical areas on the Internet.
Hierarchical Classification As An Aid To Browsing, John R. Rose, Caroline M. Eastman
Hierarchical Classification As An Aid To Browsing, John R. Rose, Caroline M. Eastman
Faculty Publications
An approach to browsing large chemical reaction databases is presented. The method that is described builds on earlier work in which unsupervised hierarchical classification was used to extract generalizations of reaction classes from reaction databases for use in reaction knowledge bases. The method described in this paper involves classification based on both semantic and topological features. It supports the creation of deep hierarchies in which succeeding levels represent increasing degrees of abstraction. The creation of a hierarchy allows the user to quickly locate interesting items or classes of items by performing a tree traversal as opposed to sequentially scanning a …
Design And Implementation Of High-Radix Arithmetic Systems Based On The Sdnr/Rns Data Representation, Paul Whyte
Design And Implementation Of High-Radix Arithmetic Systems Based On The Sdnr/Rns Data Representation, Paul Whyte
Theses : Honours
This project involved the design and implementation of high-radix arithmetic systems based on the hybrid SDNRIRNS data representation. Some real-time applications require a real-time arithmetic system. An SDNR/RNS arithmetic system provides parallel, real-time processing. The advantages and disadvantages of high-radix SDNR/RNS arithmetic, and the feasibility of implementing SDNR/RNS arithmetic systems in CMOS VLSI technology, were investigated in this project. A common methodological model, which included the stages of analysis, design, implementation, testing, and simulation, was followed. The combination of the SDNR and RNS transforms potential complex logic networks into simpler logic blocks. It was found that when constructing a SDNRIRNS …
Finding The Way : Navigation In Hypermedia, Janet Marsh Pine
Finding The Way : Navigation In Hypermedia, Janet Marsh Pine
Graduate Research Papers
If navigation is recognized as a fundamental problem experienced by hypermedia users, then navigation merits further investigation. This review will identify observed navigational problems, suspected causes, and proposed solutions. To investigate the problem, it is necessary to examine methods used to sequence hypermedia components and to identify the various schemes used for navigation.
Information resulting from the review of literature will serve as the basis for a project evaluating current multimedia software packages designed to develop reading skills. The findings will also provide the media specialist or professional educator with a framework for evaluation and subsequent utilization of multimedia learning …
A Method To Partially Suppress Is1 And Ma1 For Ds Ss Cdma Wireless Networks, Beata J. Wysocki, Tadeusz A. Wysocki
A Method To Partially Suppress Is1 And Ma1 For Ds Ss Cdma Wireless Networks, Beata J. Wysocki, Tadeusz A. Wysocki
Department of Electrical and Computer Engineering: Faculty Publications (to 2015)
We propose a method to partially suppress ISI and MAI for US SS CDMA schemes in wireless LANs. The method can be regarded as an alternative approach to combat ISI and in particular MAI by the use of advanced multiuser detection. Instead of using very sophisticated detectors, we propose introduction of a simple modification to the carrier waveform which results in very substaiitial reduction in cross-correlation belween users and an off-peak auto-correlation. The method can be applied to any DS SS CDMA scheme, but should be particularly useful in the case of short spreading signatures, as is the case of …
Ontologies For Agents, Michael N. Huhns, Munindar P. Singh
Ontologies For Agents, Michael N. Huhns, Munindar P. Singh
Faculty Publications
An ontology is a computational model of some portion of the world. It is often captured in some form of a semantic network-a graph whose nodes are concepts or individual objects and whose arcs represent relationships or associations among the concepts. This network is augmented by properties and attributes, constraints, functions, and rules that govern the behavior of the concepts. Formally, an ontology is an agreement about a shared conceptualization, which includes frameworks for modeling domain knowledge and agreements about the representation of particular domain theories. Definitions associate the names of entities in a universe of discourse (for example, classes, …
A Design In Interfacing The Mc68hc11 To The Amd Am29f010 Flash Memory Chips, David H. Hands
A Design In Interfacing The Mc68hc11 To The Amd Am29f010 Flash Memory Chips, David H. Hands
Theses : Honours
In many environments, motion, vibration and contamination to the Secondary Storage Devices such as hard drives can cause data to become unreadable or even lost. Elimination of these types of magnetic drives, incorporating its replacement with a Solid State Memory Storage Device would provide an invaluable solution for these type of environments. If a secondary storage system could replace these electro-mechanical disk drive systems incorporating a Solid State Secondary Storage Device such as the Flash Memory Integrated Chips, an increase in the speed of reading from milli-seconds to nano-seconds would transpire as well as providing a robust Secondary Storage Device. …
Assessment Methods For Virtual Laboratories In Civil Engineering Technology, Carol L. Considine, Vernon W. Lewis Jr.
Assessment Methods For Virtual Laboratories In Civil Engineering Technology, Carol L. Considine, Vernon W. Lewis Jr.
Engineering Technology Faculty Publications
Old Dominion University has developed an extensive distance learning system that includes 40 remote sites. A majority of the sites are located at community colleges. There are 30 sites in Virginia, three sites in North Carolina, one site in Washington State and one site in Arizona. In addition, there are four sites at Higher Education Centers in Virginia and one site at a local industrial facility. The Civil Engineering Technology curriculum requires three laboratory courses, which are a challenge in the distance learning environment because of the lack of laboratory equipment and computers at the broadcast sites. The three courses …
A Self-Consistent Power Relation For An Inverse Compton Scattering Theory, Robert A. Schill Jr.
A Self-Consistent Power Relation For An Inverse Compton Scattering Theory, Robert A. Schill Jr.
Electrical & Computer Engineering Faculty Research
In a self-consistent manner, the total power for linear inverse Compton scattering between a Gaussian electron beam colliding head on with a Gaussian laser beam is obtained. The theory is shown to agree with well-known limiting cases. Coupling among harmonic modes is explicitly shown in the resultant power relation. Even so, for the parameters of interest, harmonic modes are negligible compared to the fundamental mode. Total power calculations are of importance in detector calibration. The theory is applied using practical linear accelerator and laser parameters.
Measurement Of The Spectral Functions Of Vector Current Hadronic Tau Decays, R. Barate, M. Thulasidas
Measurement Of The Spectral Functions Of Vector Current Hadronic Tau Decays, R. Barate, M. Thulasidas
Research Collection School Of Computing and Information Systems
A measurement of the spectral functions of non-strange τ vector current final states is presented, using 124 358 τ pairs recorded by the ALEPH detector at LEP during the years 1991 to 1994. The spectral functions of the dominant two- and four-pion τ decay channels are compared to published results of e + e - annihilation experiments via isospin rotation. A combined fit of the pion form factor from τ decays and e + e - data is performed using different parametrizations. The mass and the width of the ρ ±(770) and the ρ 0(770) are separately determined in order …
Compositional Programming Abstractions For Mobile Computing, Peter J. Mccann, Gruia-Catalin Roman
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 …
Design And Implementation Of A New Connection Admission Control Algorithm Using A Multistate Traffic Source Model, Robert Engel
Design And Implementation Of A New Connection Admission Control Algorithm Using A Multistate Traffic Source Model, Robert Engel
All Computer Science and Engineering Research
This report develops a practical method for connection admission control in ATM networks. The method is based on a virtual cell loss probability criterion, is designed to handle heterogeneous traffic types and allows each traffic source to be described by an individual finite-state model with as many states as are needed to describe the source traffic. To make connection admission decisions with respect to individual links, an aggregate finite state model is computed from the individual models and used to estimate the virtual cell loss probabilities. To reduce the computational requirements for maintaining the aggregate traffic model, the aggregate model …
The Design And Performance Of A Real-Time Corba Event Service, Timothy H. Harrison, David L. Levine, Douglas C. Schmidt
The Design And Performance Of A Real-Time Corba Event Service, Timothy H. Harrison, David L. Levine, Douglas C. Schmidt
All Computer Science and Engineering Research
The CORBA Event Service provides a flexible model for asynchronous communication among objects.However, the standard CORBA Event Service specification lacks important features required by real-time applications. For instance, operational flight programs for fighter aircraft have complex real-time processing requirements. This paper describes the design and performance of an object-oriented, real-time implementation of the CORBA Event Service that is designed to meet these requirements. This paper makes three contributions to the design and performance measurement of object-oriented real-time systems. First, it illustrates how to extend the CORBA Event Service so that it is suitable for real-time systems. These extensions support periodic …
An Error Control Scheme For Large-Scale Multicast Applications, Christos Papadopoulos, Guru Parulkar, George Varghese
An Error Control Scheme For Large-Scale Multicast Applications, Christos Papadopoulos, Guru Parulkar, George Varghese
All Computer Science and Engineering Research
Retransmission based error control for large scale multicast applications is difficult because of two main problems: request implosion and lack of local recovery. Existing schemes (SRM, RMTP, TMTP, LBRRM) have good solutions to request implosion, but only approximate solutions (e.g., based on scoped multicast) for the local recovery problem. Our scheme achieves finer grain fault recovery by exploiting new forwarding services that allow us to create a dynamic hierarchy of receivers. We use a new paradigm, where routers provide a more refined form of multicasting (that may be useful to other applications), that enables local recovery. The new services, however, …
The Programmers' Playground Application Management System User Guide, William M. Shapiro, T. Paul Mccartney, E.F. Berkley Shands
The Programmers' Playground Application Management System User Guide, William M. Shapiro, T. Paul Mccartney, E.F. Berkley Shands
All Computer Science and Engineering Research
Application Management permits the advertising, launching, and configuring of distributed applications created using the Programmers' Playground. Applications can be documented and made available to end-users through the use of application pages on the World Wide Web. The launching and configuring of applications is performed by a brokerage system consisting of an applicatoin broker and one or more hierarchies of module launchers. This document describes how to setup and use the components of the Application Management system.
Exact Learning Of Discretized Geometric Concepts, Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldman, H. David Mathias
Exact Learning Of Discretized Geometric Concepts, Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldman, H. David Mathias
All Computer Science and Engineering Research
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the unioin of m axis-parallel boxes in d-dimensional discretized Euclidean space where each coordinate can have n discrete values. This algorithm receives at most md counterexamples and uses time and membership queries polynomial in m and log(n) for any constant d. Furthermore, all equivalence queries can be formulated as the union of O(mdlog(m)) axis-parallel boxes. Next, we show how to extend our algorithm to efficiently learn, from only equivalence queries, any discretized geometric concept generated from any number of halfspaces …
Dynamic Flow Switching: A New Communication Service For Atm Networks, Qiyong Bian, Kohei Shimoto, Jonathan Turner
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 …
Sequence Assembly Validation By Restriction Digest Fingerprint Comparison, Eric C. Rouchka, David J. States
Sequence Assembly Validation By Restriction Digest Fingerprint Comparison, Eric C. Rouchka, David J. States
All Computer Science and Engineering Research
DNA sequence analysis depends on the accurate assembly of fragment reads for the determination of a consensus sequence. Genomic sequences frequently contain repeat elements that may confound the fragment assembly process, and errors in fragment assembly, and errors in fragment assembly may seriously impact the biological interpretation of the sequence data. Validating the fidelity of sequence assembly by experimental means is desirable. This report examines the use of restriction digest analysis as a method for testing the fidelity of sequence assembly. Restriction digest fingerprint matching is an established technology for high resolution physical map construction, but the requirements for assembly …
Reducing Web Latencies Using Precomputed Hints, Girish P. Chandranmenon, George Varghese
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 …