ppxscal/embedding_network huggingface dataset:
Improving Predictability of Transaction Execution Timesin Real-time Databases
Authors: Rajeev Rastogi, S. Seshadri, Philip Bohannon, Dennis Leinbaugh, Avi Silberschatz, S. Sudarshan
Venue: Real-Time Systems (2000)

We present a design for multi-version concurrency control and recovery in a main memory database, and describe logical and physical versioning schemes that allow read-only transactions to execute without obtaining data item locks or system latches. Our schemes enable a system to provide the guarantee that updaters will never interfere with read-only transactions, and read-only transactions will not be delayed due to data contention. Consequently, transaction executions become more predictable&mdash;this partially alleviates a major problem in real-time database system (RTDBS) scheduling, namely, significant unpredictability in transaction execution times. As a result, in addition to a transaction's deadline, a more accurate estimate of its execution time can also be taken into account, thus facilitating better scheduling decisions. Our contributions include several space saving techniques for the main-memory implementation, including improved methods for logical aging of data items and the introduction of physical aging for low-level structures. Some of these schemes have been implemented on a widely-used software platform within Lucent, and the full scheme is implemented in the Dal&iacute; main-memory storage manager.
The paradigms of programming
Authors: Robert W. Floyd
Venue: Communications of the ACM (1979)

Today I want to talk about the paradigms of programming, how they affect our success as designers of computer programs, how they should be taught, and how they should be embodied in our programming languages.
Optimal Control of Parabolic Differential Equations with Two Point Boundary State Constraints
Authors: Gengsheng Wang
Venue: SIAM Journal on Control and Optimization (2000)

This paper deals with the necessary conditions of optimality for some optimal control problems governed by some parabolic differential equations involving monotone graphs. The two point boundary (time variable) state constraints are discussed. Some analyses on the state equations are given.
Designing an emergent culture of negotiation in collaborative virtual communities: the case of the DomeCityMOO
Authors: Elaine M. Raybourn
Venue: ACM SIGGROUP Bulletin (2000)

In Beyond Culture, anthropologist Edward T. Hall indicated that "culture is the total communication framework" comprised of words, actions, nonverbal behaviors, the handling of time, space, and materials, world view, beliefs, and attitudes passed over time from generation to generation. Culture often serves as a perceptual filter with which we determine that which is important to us, and that which is not. In many ways, it is necessary to unlearn the lessons of culture in order to effectively communicate with others whom we perceive to be different from ourselves. Some readers might recall the 'golden rule' which states--treat others the way you would like to be treated. In fact, when engaging in an intercultural interaction, this rule is precisely what one wants to avoid. It is more useful to consider the following as a rule of thumb--treat others as they would have you treat them, not as you would like to be treated. To this end, effective intercultural communication cannot successfully occur without collaboration, the co-creation of meaning, and negotiation. I define intercultural communication as the exchange, and co-creation, of information and meanings by individuals or groups when at least one party perceives itself to be different from others. Collaborative virtual environments (CVE) offer unique opportunities to begin anew--and experiment with unlearning the lessons, or biases, of culture to ultimately foster more equitable communication.
Auditable metering with lighweight security
Authors: Matthew K. Franklin, Dahlia Malkhi
Venue: Journal of Computer Security (1998)

In this work we suggest a new mechanism for metering the popularity of Web sites: the compact metering scheme. Our approach does not rely on client authentication or on a third party. Instead, we suggest the notion of a timing function, a computation that can be performed incrementally, whose output is compact, and whose result can be used to efficiently verify the effort spent with high degree of confidence. We use the difficulty of computing a timing function to leverage the security of a metering method by involving each client in computing the timing function (for some given input) upon visiting a Web site, and recording the result of the computation along with the record of the visit. Thus, to forge client visits requires a known investment of computational resources, which grows proportionally to the amount of fraud, and is infeasible for visit counts commonly found in the World Wide Web (WWW). The incremental nature of the timing function is used to create a new measure of client accesses, namely their duration. This paper describes the foundations of the timing scheme and its deployment in the WWW.
Prototype for wrapping and visualizing geo-referenced data in a distributed environment using XML technology
Authors: Jianting Zhang, Muhammad Javed, Amir Shaheen, Le Gruenwald
Venue: Proceedings of the 8th ACM international symposium on Advances in geographic information systems (2000)

This paper proposes a prototype for integration and visualization of geo-referenced information (GRI) in a distributed environment in general and World Wide Web in particular. This prototype adopts a three-tier architecture and includes three main components: GRI wrapper for distributed GRI web sites, GRI integration mediator and client side visualization interface. In this prototype, XML is used as a communication protocol between distributed web sites that provide GRI and the mediator, and between the mediator and clients. Java Servlets are written to translate data in distributed websites into XML documents. Data in distributed websites can be stored in a flat file, relational database, object-oriented database or object-relational database. Java Servlet in the mediator server retrieves data from related distributed websites in an XML format upon a request from the client side, parses the retrieved XML documents, performs merge or other operations on the retrieved XML documents to build a new XML document and sends it to the client side. When the client side gets the requested data from the mediator server, it will parse the returned XML document and draw it inside the browser window by using a Java applet.
Sharing serendipity in the workplace
Authors: Phillip Jeffrey, Andrew McGrath
Venue: Proceedings of the third international conference on Collaborative virtual environments (2000)

The Forum is a collaborative working environment that consists of two shared spaces: a space for informal interaction (Contact Space), and a workspace for synchronous meetings using audioconferencing support (Meeting Space). It is designed to enable people, who should meet each other to do so naturally, providing an environment for richer online interactions. This paper discusses three evaluations of the Forum Contact Space: a conceptual evaluation, a prototype evaluation, and an ethnographic evaluation. Each evaluation was undertaken to improve the Contact Space usability, examine whether it supports chance encounters, and learn from participant feedback, areas for improvement of future Forum versions. The conceptual evaluation using focus groups showed group discrepancies regarding how the Contact Space would be beneficial for producing chance encounters. In the prototype evaluation, the findings suggest that chance encounters were produced and that the Concept Space was perceived as an environment for supporting group cohesiveness. A common theme from the findings of the ethnographic evaluation was the division of the Contact Space and its related parts into two tools: a core tool; and a peripheral tool, dependent on whether it was active. As groups are increasingly distributed over geographical distances, the benefits of a shared virtual space for communication and interaction are being realised.
Port Scans and Ping Sweeps Explained
Authors: Lawrence Teo
Venue: Linux Journal (2000)

Lawrence Teo explains two common network probes and what can be done to detect them.
Display procedures
Authors: William M. Newman
Venue: Communications of the ACM (1971)

Although the use of structured display files is widespread in interactive computer graphics, these structures present a number of problems which tend to restrict their generality and usefulness. This paper discusses some of these problems, and suggests an alternative approach to display system design which avoids the use of structured display files. This technique employs display procedures to generate information for display. By including transformations within calls to these procedures it is possible both to simplify the specification of pictures and to speed up their generation. Display procedures permit picture elements to be defined conditionally and also facilitate the processing of inputs from pointing devices. The paper is illustrated by examples from a version of the EULER language in which display procedures were implemented.
The synthesis of solids bounded by many faces
Authors: I. C. Braid
Venue: Communications of the ACM (1975)

A technique is presented which allows a class of solid objects to be synthesized and stored using a computer. Synthesis begins with primitive solids like a cube, wedge, or cylinder. Any solid can be moved, scaled, or rotated. Solids may also be added together or subtracted. Two algorithms to perform addition are described. For practical designers, the technique has the advantage that operations are concise, readily composed, and are given in terms of easily imagined solids. Quite short sequences of operations suffice to build up complex solids bounded by many faces.
Core Web3D
Authors: Aaron E. Walsh, Mikaël Bourges-Sévenier
Venue:  (2000)

The technology, tools, and bandwidth are here: Use them now with Core Web3D! The Web developer's guide to state-of-the-art 3D on the Internet Integrate Web3D into any Web site-without getting buried in code Covers VRML97, Java 3D, and hot new MPEG-4 and X3D technologiesForewords by Dave Raggett, HTML Architect for the World Wide Web Consortium; Mark Pesce and Tony Parisi, Co-inventors of VRML and past Directors of the Web3D ConsortiumThe Web developer's guide to 3D on the Internet...Finally, the technology, tools, bandwidth, and computing power are in place to smoothly deliver compelling 3D content over the Web. And now there's a book that helps Web developers leverage 3D-without getting overwhelmed by code!Core Web3D unveils a suite of technologies that make it possible to deliver remarkable 3D content over the Web: VRML97, Java 3D, MPEG-4, as well as the exciting new X3D (Extensible 3D using XML), which promises to deliver interoperable, lightweight Internet and broadcast 3D.3D experts Aaron E. Walsh and Mikaël Bourges-Sévenier demonstrate how Web3D delivers key advances over previous technologies, including international standardization, interoperability, browser ubiquity, fourth-generation APIs, and visual authoring tools.Discover how to integrate Web3D technologies seamlessly into any Web site, by repurposing, modifying, and customizing existing Web3D content-getting great results without reinventing the wheel.Core Web3D is the perfect guide for every Web developer working with media-rich sites.EVERY CORE SERIES BOOK: DEMONSTRATES practical techniques used by professional developers FEATURES robust, thoroughly tested sample code and realistic examples FOCUSES on the cutting-edge technologies you need to master today PROVIDES expert advice that will help you build superior softwareCore Web3D delivers: Comprehensive introduction to VRML97, Java 3D, MPEG-4/BIFS, and X3D Detailed guidance on repurposing existing Web3D code to your specific needs Hands-on coverage of the hot new MPEG-4/BIFS standard and the future X3D standard Straight-from-the-hip comparisons of Web3D technologies
A technique for counting ones in a binary computer
Authors: Peter Wegner
Venue: Communications of the ACM (1960)

Standard methods of counting binary ones on a computer with a 704 type instruction code require an inner loop which is carried out once for each bit in the machine word. Program 1 (written in SAP language for purposes of illustration) is an example of such a standard program.
Type-base flow analysis: from polymorphic subtyping to CFL-reachability
Authors: Jakob Rehof, Manuel Fähndrich
Venue: ACM SIGPLAN Notices (2001)

We present a novel approach to scalable implementation of type-based flow analysis with polymorphic subtyping. Using a new presentation of polymorphic subytping with instantiation constraints, we are able to apply context-free language (CFL) reachability techniques to type-based flow analysis. We develop a CFL-based algorithm for computing flow-information in time O(n sup3;), where n is the size of the typed program. The algorithm substantially improves upon the best previously known algorithm for flow analysis based on polymorphic subtyping with complexity O(n8). Our technique also yields the first demand-driven algorithm for polymorphic subtype-based flow-computation. It works directly on higher-order programs with structured data of finite type (unbounded data structures are incorporated via finite approximations), supports context-sensitive, global flow summariztion and includes polymorphic recursion.
Building Oracle XML applications
Authors: Steve Muench
Venue:  (2000)

XML (Extensible Markup Language)has emerged as the industry standard for describing data for e-commerce, particularly for business-to-business exchange. Oracle Corporation supports XML in a wide range of products, and the company describes Oracle8i, its "Internet database" as "the first XML-enabled database." XML is a key part of the company's e-business strategy. Building Oracle XML Applications gives both Java and PL/SQL developers a rich and detailed look at the range of available Oracle XML technologies. The book shows how to combine the power of XML and XSLT with the speed, functionality, and reliability of the Oracle database to build flexible applications. The author delivers nearly 800 pages of entertaining text, helpful and time-saving hints, and extensive examples that developers can put to use immediately to build custom XML applications. Products covered include: XSQL pages and the XSQL servletJDeveloperXSLT ProcessorXML ParserinterMediaAdvanced Queuing The accompanying CD-ROM contains JDeveloper 3.1, an integrated development environment for Java developers.
Design and evaluation of a real-time mobile telemedicine system for ambulance transport
Authors: Yan Xiao, David Gagliano, Marian LaMonte, Peter Hu, Wade Gaasch, Ruwani Gunawadane, Colin Mackenzie
Venue: Journal of High Speed Networks (2000)

A mobile telemedicine system was designed, implemented, and tested for real-time diagnosis during ambulance transport. The system uses multiple public wireless cellular phones to transmit video and patient biosignals from a moving ambulance to a hospital and delivers to the desktop computer of the receiving physician. The mobile unit on the ambulance is turn-key operated and has an image selection controller for paramedics to send images at specific times and to capture images at high frame rates. The mobile telemedicine system was installed on two ambulances and was successfully used in diagnosing acute ischemic stroke during the transport of six patients. Using the system, stroke specialists were able to remotely conduct neurological examinations which required evaluation of facial expressions and movement of arms and legs. Questionnaires completed by four users (two paramedics and two stroke specialists) of the mobile telemedicine system indicated that (1) the system did not intrude into the privacy of the patient or the paramedics, (2) it was easy to use, (3) it was adequate for conducting clinical examinations, and (4) it conveyed critical clinical information.
A Recurrent Neural Network for N-Stage Optimal Control Problems
Authors: Li-Zhi Liao
Venue: Neural Processing Letters (1999)

A recurrent neural network is introduced for the N-stage optimal control problem. The new neural network is based on a reformulation of the original optimal control problem and the gradient method. The simulation results on two examples indicate that the new neural network is quite effective.
Document language models, query models, and risk minimization for information retrieval
Authors: John Lafferty, Chengxiang Zhai
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

We present a framework for information retrieval that combines document models and query models using a probabilistic ranking function based on Bayesian decision theory. The framework suggests an operational retrieval model that extends recent developments in the language modeling approach to information retrieval. A language model for each document is estimated, as well as a language model for each query, and the retrieval problem is cast in terms of risk minimization. The query language model can be exploited to model user preferences, the context of a query, synonomy and word senses. While recent work has incorporated word translation models for this purpose, we introduce a new method using Markov chains defined on a set of documents to estimate the query models. The Markov chain method has connections to algorithms from link analysis and social networks. The new approach is evaluated on TREC collections and compared to the basic language modeling approach and vector space models together with query expansion using Rocchio. Significant improvements are obtained over standard query expansion methods for strong baseline TF-IDF systems, with the greatest improvements attained for short queries on Web data.
A conversation and commentary on from Millwrights to Shipwrights
Authors: Jack Jobst
Venue: ACM Journal of Computer Documentation (JCD) (2000)

Through their mutual dialog, the authors answer and explore seven questions about the audience,goals, assumptions, impact, and educational value of R.John Brockmann s 1998 history of technical communication in the United States.
Supporting cognitive models as users
Authors: Frank E. Ritter, Gordon D. Baxter, Gary Jones, Richard M. Young
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2000)

Cognitive models are computer programs that simulate human performance of cognitive skills. They have been useful to HCI by predicting task times, by assisting users, and by acting as surrogate users. If cognitive models could interact with the same interfaces that users do, the models would be easier to develop and would be easier to apply as interface testers. This approach can be encapsulated as a cognitive model interface management system (CMIMS), which is analogous to and based on a user interface management system (UIMS). We present five case studies using three different UIMSes. These show how models can interact with interfaces using an interaction mechanism that is designed to apply to all interfaces generated within a UIMS. These interaction mechanisms start to support and constrain performance in the same ways that human performance is supported and constrained by interaction. Most existing UIMSes can and should be extended to create CMIMSes, and models can and should use CMIMSes to look at larger and more complex tasks. CMIMSes will help to further exploit the synergy between the disciplines of cognitive modeling and HCI by supporting cognitive models as users.
Multiphase sorting
Authors: Harold H. Manker
Venue: Communications of the ACM (1963)

With a limited number of tape drives available for sorting, the polyphase technique of merging provides faster sorting than the conventional balanced method of merging. This paper is an attempt to describe the polyphase method used in the IBM 1401 Sort 2 program for a computer system with four tape drives available.
On the arithmetic power of context-free languages
Authors: Albert Goldfain
Venue: Proceedings of the sixth annual CCSC northeastern conference on The journal of computing in small colleges (2001)

Our research focuses on characterizing the computational limits of context-free languages based on a non-classical definition of &ldquo;computation&rdquo;. In our study we identify a computation as a process of recognizing a string of a's and b's in which the number b's is a function of the number of a's. We feel that this ability to &ldquo;compute&rdquo; arithmetic functions in this sense is a fundamental property that should be examined for all models of computation. Our poster presents a proof of what we have called the Arithmetic Power Theorem for Context-Free Languages that we state as follows: Arithmetic Power Theorem for Context-Free Languages: A language L of the form L=ai bf(i) is context-free only if f(i)= &THgr;(i) or f(i) = &THgr;(1). Our approach in proving this theorem was directed towards a reformulation of our question based on subsets of L that we called pumping sets. The notion of a pumping set is a generalization, and in many ways is an extension, of the well-known Pumping Lemma that exposes the ability to &ldquo;pump&rdquo; a given string in a context-free language into another string in the same language via replication. Pumping sets are not found in the standard textbooks on computational theory [1][2][3] and to our knowledge are absent from the existing research on context-free grammars. However, the study of sets of pumped strings (known as paired loops) has yielded interesting results in the area of slender languages [4]. We define a pumping set as follows: A pumping set of a derivation is the set of all strings obtained by replicating a path between two occurrences of some non-terminal in the derivation tree. This is illustrated in the following example: We call the derivation in the definition of pumping set a generator of a pumping set. It was necessary to establish several properties which would allow us to use pumping sets to characterize the ability of a production rule in a grammar (or a sequence of such rules) to affect the growth of b's in the strings of our language L.
Application of constraint-based heuristics in collaborative design
Authors: Juan Antonio Carballo, Stephen W. Director
Venue: Proceedings of the 38th annual Design Automation Conference (2001)

Significant acceleration of todays complex collaborative design processes can be achieved if team members are able to apply search heuristics that consider the simultaneous effect of all design constraints. We present the Active approach to Design Process Management (ADPM), whereby designers receive constraint-based feedback that enables them to apply these search heuristics effectively. To evaluate ADPM, we developed a design process evaluation environment called TeamSim. Evaluation results suggest that ADPM can reduce costly design iterations at the expense of extra, less costly, verification tool executions.