ppxscal/embedding_network huggingface dataset:
USING THE ucsc-report LaTeX STYLE FILE FOR UCSC TECHNICAL REPORTS
Authors: Kevin Karplus
Venue:  (1992)

This technical report describes how to use LaTeX to produce technical reports in the proper format for the UCSC Baskin Center for Computer Engineering and Informaiton Sciences series. The style file can also be used for various other reports and articles, including theses in a format acceptable to the UCSC Division of Graduate Studies. Two other style files are described: *ucletter* for business letters that generate University of California letterhead and *handout* for class handouts. The report itself is written using the *ucsc-report* style file, so that the .tex file can be used as an example file. The reader is expected to refer to Lamport''s manual [Lamport, 1986] and to the local guide [Computer Engineering, 1990] for details on how to use LaTeX.
The JONES Microprocessor: Design Details
Authors: David Mayhew
Venue:  (1987)

This technical report is no longer available.
State Inconsistency Issues in Local Area Network-Based Distributed Kernels
Authors: Samuel T. Chanson, K. Ravindran
Venue:  (1985)

State inconsistency is an inherent problem in distributed computing systems (DCS) because of the high degree of autonomy of the executing entities and the inherent delays and errors in communicating events among them. Thus any reliable DCS should provide means to recover from such errors. This paper discusses the state inconsistency issues and their solution techniques in local area network based distributed kernels. In particular, we deal with state inconsistencies due to i) failures of processes, machines and/or the network, ii) packet losses, iii) new machines joining or exiting from the network, and iv) processes or hosts migrating from one machine to another in the network. The solutions presented are mostly provided within the kernel itself and are transparent to the applications.
Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences.
Authors: Vlado Dancik, M. S. Paterson
Venue:  (1993)

Let f(n) be the expected length of a longest common subsequence of two random binary sequences of length n. It is known that the limit c=lim{n-<oo}f(n)/n exists. Improved upper bounds for c are given using a new method.
SIRIUS: An Approach for Data Warehouse Refreshment
Authors: Stella Gatziu, Athanasios Vavouras, Klaus R. Dittrich
Venue:  (1998)

Data warehouse refreshment incorporates issues on how to keep the data warehouse up-to-date. Until now, it has not received great attention and has only been investigated by applying techniques of materialized views. In this paper, we introduce the SIRIUS project which investigates a general approach for incremental data warehouse refresh such that only modifications of oper-ational data are propagated into the data warehouse. Our approach can be used with a wide variety of heterogeneous operational sources and independently of a particular database system used for the persistence of the data warehouse.
The Pica-B Computer
Authors: Harvey Abramson, Mark Fox, J. Peck, V. Manis, M. Gorlick
Venue:  (1979)

The Pica-B computer is a simple abstract machine designed to: \begin{enumerate} \item facilitate the portability of a simple single user operating environment written in BCPL. \item serve the pedagogic goal of providing a basis for teaching concepts of hardware and system architecture, systems programming and programming language design in a unified setting, and \item serve as a possible solution to the current and future software crisis caused by the advent of the micro-computer. \end{enumerate} The Pica-B is based on Richards'' Intcode machine but differs from it in the addition of an (interrupt) status register and a PDP-11 style memory map of I/O devices. The status register and hence interrupt and device handlers may be programmed in Pica-B code (an extention of Intcode) or in a version of BCPL with an added inline code facility, the so-called \underline{vile} command. An example is given of how interrupts and I/O are handled in Pica-B computer.
Human-Computer Interface Development: Concepts and Systems for its Management
Authors: H. R Hartson, Deborah Hix
Venue:  (1986)

Human-computer interface management, from a computer science viewpoint, focuses on the process of developing quality human computer interfaces, including their representation, design, implementation, execution, evaluation, and maintenance. This survey presents important concepts of interface management: dialogue independence, structural modeling, specification, rapid prototyping, holistic software engineering, control structures, and support environments, including User Interface Management System Tools. Several systems for human-computer interface management are presented to illustrate these concepts.
DECISION THEORETIC GENERALIZATIONS OF THE PAC MODEL FORNEURAL NET AND OTHER LEARNING APPLICATIONS
Authors: David Haussler
Venue:  (1990)

We describe a generalization of the PAC learning model that is based on statistical decision theory. In this model the learner receives randomly drawn examples, each example consisting of an instance x in X and an outcome y in Y , and tries to find a hypothesis h : X --< A , where h in H , that specifies the appropriate action a in A to take for each instance x , in order to minimize the expectation of a loss l(y,a). Here X, Y, and A are arbitrary sets, l is a real-valued function, and examples are generated according to an arbitrary joint distribution on X times Y . Special cases include the problem of learning a function from X into Y , the problem of learning the conditional probability distribution on Y given X (regression), and the problem of learning a distribution on X (density estimation). We give theorems on the uniform convergence of empirical loss estimates to true expected loss rates for certain hypothesis spaces H , and show how this implies learnability with bounded sample size, disregarding computational complexity. As an application, we give distribution-independent upper bounds on the sample size needed for learning with feedforward neural networks. Our theorems use a generalized notion of VC dimension that applies to classes of real-valued functions, adapted from Pollard''s work, and a notion of *capacity* and *metric dimension* for classes of functions that map into a bounded metric space. (Supersedes 89-30 and 90-52.) [Also in "Information and Computation", Vol. 100, No.1, September 1992]
Aslantest Testplan
Authors: Jeffrey G. Douglas
Venue:  (1993)

This following document outlines the testing plan for the Aslantest system, which is a symbolic execution tool for the formal specification language Aslan. Specific approaches are outlined for unit, integration, system and regression testing and some specific test cases are provided.
HSCT Configuration Design Space Exploration Using Aerodynamic Response Surface Approximations
Authors: Baker Chuck A., Grossman Bernard, Haftka Raphael T., Mason William H., Watson Layne T.
Venue:  (1999)

A method has been developed to generate and use polynomial approximations to the range and cruise drag components in a highly constrained, multidisciplinary design optimization of a High Speed Civil Transport configuration. The method improves optimization performance by eliminating the numerical noise present in the analyses through the use of response surface methodology. In our implementation, we fit quadratic polynomials within variable bounds to data gathered from a series of numerical analyses of different aircraft designs. Because the HSCT optimization process contains noise and suffers from a nonconvex design space even when noise is filtered out, multiple optimization runs are performed from different starting points with and without the response surface models in order to evaluate their effectiveness. It is shown that response surface methodology facilitates design space exploration, allowing improvements in terms of both convergence performance and computational effort when multiple starting points are required.
Efficient Retrieval for Browsing Large image Databases
Authors: Daniel Wu, Divyakant Agrawal, Amr El Abbadi, Ambuj Singh, Terrence R. Smith
Venue:  (1996)

The management of large image databases poses several interesting and challenging problems. These problems range from ingesting the data and extracting meta-data to the efficient storage and retrieval of the data. Of particular interest are the retrieval methods and user interactions with an image database during browsing. In image databases, the response to a given query is not an exact well-defined set, rather, the user poses a query and expects a set of responses that should contain many possible candidates from which the user chooses the answer set. We first present the browsing model in Alexandria, a digital library for maps and satellite images. Designed for content-based retrieval, the relevant information in an image is encoded in the form of a multi-% dimensional feature vector. Various techniques have been previously proposed for the efficient retrieval of such vectors by reducing the dimensionality of such vectors. We show that for even moderately large databases (in fact, only 1856 texture images), these approaches do not scale well for exact retrieval. However, as a browsing tool, these dimensionality reduction techniques hold much promise.
Randomly Sampling Molecules
Authors: L. A. Goldberg, M. Jerrum
Venue:  (1996)

We give the first polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an unlabelled connected multigraph with the given degree sequence. We also give the first polynomial-time algorithm for the following related problem: Given a molecular formula, select, uniformly at random, a structural isomer having the giver formula.
Conceptual Module Querying for Software Reengineering
Authors: Elisa Baniassad, Gail C. Murphy
Venue:  (1997)

Many tools have been built to analyze source. Most of these tools do not adequately support reengineering activities because they do not allow a software engineer to simultaneously perform queries about both the existing and the desired source structure. This paper introduces the conceptual module approach that overcomes this limitation. A conceptual module is a set of lines of source that are treated as a logical unit. We show how the approach simplifies the gathering of source information for reengineering tasks, and describe how a tool to support the approach was built as a front-end to existing source analysis tools.
Air Traffic Management Overview
Authors: Stavan M. Parikh, Matthew C. Elder
Venue:  (2001)

The Air Traffic Control (ATC) system manages air traffic from various sources throughout the United States National Airspace System (NAS). The mission of air traffic control is to promote the safe, orderly, and expeditious movement of aircraft. The Federal Aviation Administration (FAA) is responsible for providing the NAS infrastructure to enable air operations in the United States, 24 hours a day, 365 days a year. Air traffic control, the primary component of the NAS architecture, is a complex system comprising of many types of facilities, a plethora of hardware and software systems, and complicated interactions between humans and machines. There are two goals that must be met by the Air Traffic Control system: safety and efficiency. To ensure safety, minimum separation must be maintained between aircraft as they pass through the national airspace. Efficient air traffic control, however, requires that separation not be so great as to adversely affect the flow of traffic through the airspace. This document provides a summary of the air traffic management system together with pointers to other sources of more detailed information.
A Fast and Efficient Method Dispatching Statically Typed MultipleInheritance Object-Oriented Languages
Authors: Keung H Lee, Dennis G. Kafura
Venue:  (1989)

Inheritance is an invaluable mechanism for object-oriented programming. The benefits of inheritance have been well recognized over the last few years. However, these benefits typically come at the expense of run time overhead in time and space. While an efficient late binding mechanism based on indexing has been popularly used in supporting single inheritance, a mechanism for multiple inheritance which can provide a comparable efficiency has been sought. In this paper, we describe a late binding mechanism for statically typed object-oriented programming with multiple inheritance. Our technique, based on the partitioning of a multiple inheritance hierarchy, is a significant improvement in both space and time over existing techniques. The fast and efficient late binding mechanism called hierarchy partitioning is presented. An analysis of the predicted performance of the technique and a detailed comparison with other related work are also provided.
REAL-TIME ENVIRONMENTAL INFORMATION NETWORK AND ANALYSIS SYSTEM: PHASE V STATUS REPORT
Authors: P. E. Mantey, D. D.E. Long, J. J. Garcia-Luna, G. G. Langdon, A. T. Pang, D. M. Fernandez, H. G. Kolsky, E. C. Rosen, C. M. Wittenbrink, B. R. Gritton, W. A. Nuss
Venue:  (1997)

The Real-Time Environmental Information Network and Analysis System (REINAS) is a continuing engineering research and development program with the goal of designing, developing and testing an operational prototype system for data acquisition, data management, and visualization. This system is to support the real-time utilization of advanced instrumentation in environmental science. Current applications are in meteorology and oceanography; others envisioned include geophysics, hydrology, air pollution, etc. The REINAS project has been funded by a Department of Defense University Research Initiative through the Office of Naval Research. Participating institutions include the Naval Postgraduate School (NPS), the Monterey Bay Aquarium Research Institute (MBARI) and the Baskin Center for Computer Engineering and Information Sciences of the University of California, Santa Cruz (UCSC). The REINAS system has been designed for regional real-time environmental monitoring and analysis. It is a modern system, integrated into the Internet, for conducting interactive real-time coastal air/ocean science. The database design of REINAS is independent of specific database technology and is designed to support operational scientific needs throughput the entire scientific data life-cycle. During the previous phases a survey of available technologies was made, selections of the those to be used in the prototype system were made, and detailed architecture of REINAS and experimentation with subsystems for data collection, data management, processing, and visualization were started.
The Rapid Recovery of three-Dimensional Orientation from Line Drawings
Authors: R. A. Rensink
Venue:  (1992)

A computational theory is developed that explains how line drawings of polyhedral objects can be interpreted rapidly and in parallel at early levels of human vision. The key idea is that a time-limited process can correctly recover much of the three-dimensional structure of these objects when split into concurrent streams, each concerned with a single aspect of scene structure. The work proceeds in five stages. The first extends the framework of Marr to allow a process to be analyzed in terms of resource limitations. Two main concerns are identified: (i) reducing the amount of nonlocal information needed, and (ii) making effective use of whatever information is obtained. The second stage traces the difficulty of line interpretation to a small set of constraints. When these are removed, the remaining constraints can be grouped into several relatively independent sets. It is shown that each set can be rapidly solved by a separate processing stream, and that co-ordinating these streams can yield a low-complexity ``approximation'''' that captures much of the structure of the original constraints. In particular, complete recovery is possible in logarithmic time when objects have rectangular corners and the scene-to-image projection is orthographic. The third stage is concerned with making good use of the available information when a fixed time limit exists. This limit is motivated by the need to obtain results within a time independent of image content, and by the need to limit the propagation of inconsistencies. A minimal architecture is assumed, viz., a spatiotopic mesh of simple processors. Constraints are developed to guide the course of the process itself, so that candidate interpretations are considered in order of their likelihood. The fourth stage provides a specific algorithm for the recovery process, showing how it can be implemented on a cellular automaton. Finally, the theory itself is tested on various line drawings. It is shown that much of the three-dimensional structure of a polyhedral scene can indeed be recovered in very little time. It also is shown that the theory can explain the rapid interpretation of line drawings at early levels of human vision.
Giving a Compass to a Robot - Probabilistic Techniques for Simultaneous Localisation and Map Building (SLAM) in Mobile Robotics
Authors: R. W. Wenzel
Venue:  (2002)

An important feature of an autonomous mobile robotic system is its ability to accurately localize itself while simultaneously constructing a map of its environment. This problem is complicated because of its chicken-and-egg nature: in order to determine its location the robot needs to know the map, and in order to build an accurate map the robot must know where it is. In addition, a robust system must account for the noise in odometry and sensor readings. This project explores the probabilistic methods of solving the SLAM problem using Rao-Blackwellisation.
Adding Second Order Functions to Kahn Data Flow
Authors: S. G. Matthews
Venue:  (1991)

Gilles Kahn''s elegant model of deterministic concurrent computation using sequential processes connected by Unix style pipes [Ka74] has been used by Ashcroft, Wadge as the basis for the functional data flow programming language Lucid [W , A85] Kahn''s data flow model is "first order and so does not allow streams of processes for example. This has been reflected in Lucid by the restriction, until recently, to first order functions. In [Wa91] Wadge suggests a treatment for implementing higher order function definitions in Lucid using intentsional multi-dimensional algebras. This has unfortunately placed the Lucid cart before the Kahn data flow horse. Is there a natural extension to Kahn''s model which allows higher order functions, or can we only understand them in terms of a specific programming language such as Lucid? This report argues that higher order functions can be understood in terms of Kahn''s data flow model by constructing a treatment therein for second order functions. This construction provides new insights into obtaining a generalisation of Kahn Data Flow which allows second order functions. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Radio Communication in Locally Synchronous Broadcast Systems
Authors: L. Gasieniec, A. Pelc, D. Peleg
Venue:  (2000)

This paper studies the differences between two levels of synchronization in a distributed broadcast system (or a multiple access channel). In the globally synchronous model, all processors have access to a global clock. In the locally synchronous model, processors have local clocks ticking at the same rate, but each clock starts individually, when the processor wakes up. We consider the fundamental problem of waking up all of n processors of a completely connected broadcast system. Some processors wake up spontaneously, while others have to be woken up. Only wake processors can send messages; a sleeping processor is woken up upon hearing a message. The processors hear a message in a given round if and only if exactly one processor sends a message in that round. Our goal is to wake up all processors as fast as possible in the worst case, assuming an adversary controls which processors wake up and when. We analyze the problem in both the globally synchronous and locally synchronous models, with or without the assumption that n is known to the processors. We propose randomized and deterministic algorithms for the problem, as well as lower bounds in some of the cases. These bounds establish a gap between the globally synchronous and locally synchronous models.
Extended study on limit analysis of masonry wall with openings
Authors: A. Miyamura, A. DeStefano, Y. Kohama, T. Takada
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

The present study deals with limit analysis of masonry walls with rectangular openings subject to vertical and horizontal loading by means of the genetic algorithm (GA). Herein, an equivalent shear truss model whose structural parameters should be defined by typical failure patterns due to earthquake damages, such as shear diagonal crack opening, local panel rocking, bed joint sliding, full or partial overturning of an entire wall, is introduced to in-plane collapse analysis of a single masonry wall. By means of this truss model the limit analysis can be formulated as a searching problem for a collapse mode with minimum failure load among a set of elementary collapse modes and their combinations. Because this becomes a typical combinatorial optimization problem, the stochastic schemata exploiter (SSE), which is one of the GAs, is applied to the present problem.
How to give a good research talk
Authors: Simon L. Peyton Jones, John Hughes, John Launchbury
Venue: ACM SIGPLAN Notices (1993)

Giving a good research talk is not easy. We try to identify some things which we have found helpful, in the hope that they may be useful to you.