ppxscal/embedding_network huggingface dataset:
The Technological Change of Reality Opportunities and Dangers
Authors: Wolfgang Bibel
Venue:  (1988)

This essay discusses the trade-off between the opportunities and the dangers involved in technological change mainly from the perspective of Artificial Intelligence technology. In order to lay the foundation for the discussion, the symptoms of general unease which are associated with current technological progress, the concept of reality, and the field of Artificial Intelligence are very briefly discussed. In the main body of the essay, the dangers are contrasted with the potential benefits of such high technology. Besides discussing more well known negative and positive aspects we elaborate on the disadvantages of executive systems and the advantages of legislative systems. It is argued that only the latter might enable the re-establishment of the feedback-mechanism which proved so successful in earlier phases of evolution.
Improving Three Layer Neural Net Convergence
Authors: M. Alder, Sok G Lim, P. Hadingham, Y. Attikiouzel
Venue:  (1991)

Abstract unavailable.
What is the attraction to computing?
Authors: Vicki L. Almstrum
Venue: Communications of the ACM (2003)

The strongest motivators include a sense of accomplishment from solving problems and programming; the weakest include being captivated by the Web and a passion for playing computer games.
Seismic hazard assessment in the State of Kuwait
Authors: A. W. Sadek
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

This paper presents the seismic hazard assessment for the State of Kuwait. In the present study, historical and instrumental seismicity data in the Kuwait area and its vicinity are compiled to form the base earthquake catalogue covering the period from 860 to 2000 and including events with magnitudes ranging between 2 and 8. Accessory events such as fore and after shocks were removed from the catalogue by applying appropriate spatial and temporal filters. Seismic zones characterization was performed assuming an exponential model for magnitude distribution and a Poisson time occurrence model. Probabilistic seismic hazard analysis employed herein is based on Cornell's methodology.
Real-time Head Detection
Authors: Dunstan Philip, Sok G Lim, Mike Alder
Venue:  (1995)

This paper describes a syntactic approach to the classification of moving objects in front of a video camera. The implementation of syntactic pattern recognition techniques is examined for a real-time system, focusing on the detection of human heads in front of a video camera. In particular, I will be describing the technique used to classify objects between heads and non-heads, the results achieved, and the implications of the real-time property of this system. In a syntactic approach the higher level information of an image is extracted from the lower level structure of that image. The techniques used by this application to extract the higher level of information from the lower level structure of the image is discussed in this paper. This paper also examines how a quadratic neural network may be used as both a classifier, and as a tool for modelling data. In this system quadratic neural networks are used both to model the lower level structure of the images from the video camera, and as a tool for classifying the objects in front of the video camera.
A Performance Study of Isotach Version 1.0
Authors: Robert G. Bartholet
Venue:  (1999)

The Isotach version 1.0 prototype implements isotach logical time on a cluster of Intel-based personal computers linked with a Myrinet local area network. A performance study was conducted on this unoptimized version of the prototype to determine Isotach''s performance characteristics, look for problems in the software and hardware design, and discover ways to optimize the system. Tests were conducted using custom developed programs and the Communications Analysis and Simulation Tool (CAST), a network benchmarking tool developed by the U.S. Navy and used at their request. In order to give us a baseline, we also performed tests on Fast Messages 1.1, a messaging layer known to provide good performance. CAST measurements were not as accurate as our custom developed tests due to software overhead in the tool. We explain the reasons for this overhead, and show that CAST accuracy is degraded on networks with sub-millisecond latencies. Our performance study measured throughput, latency, server performance under contention, effects of isochron size, and effects of token traffic on non-isotach traffic. The all- software Isotach version 1.0 prototype exceeded many of its performance goals. We expect performance to improve even more when custom-built hardware components replace software. Limitations in the design of the Isotach prototype were discovered, and recommendations were made to improve performance in future Isotach systems.
A Sound and Sometimes Complete Query Evaluation Algorithm for Relational Databases with Null Values
Authors: Raymond Reiter
Venue:  (1983)

This paper presents a sound and, in certain cases, complete method for evaluating queries in relational databases with null values where these nulls represent existing but unknown individuals. The soundness and completeness results are proved relative to a formalization of such databases as suitable theories of first order logic.
An evolutionary approach to synthetic biology: zen in the art of creating life
Authors: Thomas S. Ray
Venue: Advances in evolutionary computing: theory and applications (2003)

Our concepts of biology, evolution, and complexity are constrained by having observed only a single instance of life, life on Earth. A truly comparative biology is needed to extend these concepts. Because we cannot observe life on other planets, we are left with the alternative of creating artificial life forms on Earth. I will discuss the approach of inoculating evolution by natural selection into the medium of the digital computer. This is not a physical/chemical medium, it is a logical/informational medium. Thus these new instances of evolution are not subject to the same physical laws as organic evolution (e.g., the laws of thermodynamics), and therefore exist in what amounts to another universe, governed by the "physical laws" of the logic of the computer. This exercise gives us a broader perspective on what evolution is and what it does.An evolutionary approach to synthetic biology consists of inoculating the process of evolution by natural selection into an artificial medium. Evolution is then allowed to find the natural forms of living organisms in the artificial medium. These are not models of life, but independent instances of life. This essay is intended to communicate a way of thinking about synthetic biology that leads to a particular approach: to understand and respect the natural form of the artificial medium, to facilitate the process of evolution in generating forms that are adapted to the medium, and to let evolution find forms and processes that naturally exploit the possibilities inherent in the medium. Examples are cited of synthetic biology embedded in the computational medium, where in addition to being an exercise in experimental comparative evolutionary biology, it is also a possible means of harnessing the evolutionary process for the production of complex computer software.
The Parallel Image Processing System PIPS
Authors: Hans Burkhardt, Andreas Bieniek, Rudolf Klaus, Michael Nolle, Gerald Schreiber, Hanns Schulz-Mirbach
Venue:  (1994)

PIPS is a parallel image processing system developed at the TU Ham-burg-Har-burg^1. The structure of PIPS is highly modular and hierarchical. The scope of the PIPS functionality reaches from basic low level services up to high end user interfaces. PIPS is based on the message passing principle and is therefore portable to most distributed memory architectures. A wide range of library functions, along with implementations of many typical image processing algorithms, make it easy to integrate new parallel algorithms into PIPS. Using the high end interfaces the user views the parallel system as a powerful coprocessor attached to the host machine.
Coordinating Heterogeneous Time-Based Media Between Independent Applications
Authors: Scott Flinn
Venue:  (1995)

This report discusses the requirements and design of an event scheduler that facilitates the synchronization of independent, heterogeneous media streams. The work is motivated by the synchronization requirements of multiple, periodic, logically independent auditory streams, but extends naturally to include time-based media of arbitrary type. The scheduler design creates a framework within which existing synchronization techniques are composed to coordinate the presentation activities of cooperating or independent application programs. The scheduler is especially effective for the presentation of repetitive sequences, and guarantees long term synchronization with a hardware clock, even when scheduler capacity is temporarily exceeded on platforms lacking real time system support. The implementations of the scheduler and of several application programs, class libraries and other tools designed to use or support it are described in detail.
Reuse Level Metrics
Authors: William Frakes, Carol Terry
Venue:  (1994)

Reuse level is an abstract metric that can be applied to any reusable asset. This paper presents extensions to the reuse level metric, defines the metric formally, and discusses an implementation of the abstract metric for C in an enhanced version of the rl program.
Query Composition: Why Does It Have to Be So Hard?
Authors: Lucy T Nowell, Deborah Hix, Eric D. Labow
Venue:  (1993)

Project Envision, a large research effort at Virginia Tech, focuses on developing a user centered multimedia database from the computer science literature with full-text searching and full-content retrieval capabilities. User interviews indicate that people have trouble composing queries. Widely available boolean retrieval systems present problems with both syntax and logic. Natural language queries for vector space retrieval systems are easier to compose but users complain that they do not understand the matching principles used; users also complain that they have too little control over the search and fear being overwhelmed by an enormous retrieval set. We describe the Envision query window which has as a usability goal making query composition easy while increasing user control. Results of formative usability evaluation and subsequent redesign are discussed.
Model Analysis in a Model Development Environment
Authors: Robert L. Moose, Richard E. Nance
Venue:  (1987)

The Model Analyzer is a utility that renders automated and semi-automated support of the model development process. A prototype of this tool, demonstrating the capability for diagnostic analysis of non-executable model representations, is described from both a user and designer perspective. Key concepts affecting design decisions are discussed in the context of an underlying theory of model representation an analysis. The importance of world-view-independent model representation is stressed as a precursor to the early employment of model diagnosis and analysis. An example serves to illustrate the capability of the current prototype and the importance of the design concepts and the UNIX, utilities yacc and lex in the Analyzer development.
Credibility Assessment of Simulation Results: The State of the Art
Authors: Osman Balci
Venue:  (1986)

The purpose of this paper is to provide a state-of-the-art survey of credibility assessment of simulation results and suggest some future research directions. A hierarchy of the credibility assessment is introduced and the state-of-the-art survey is presented with respect to this hierarchy. A glossary is provided to alleviate the lack of standard terminology. The future research calls upon looking at the global picture when conducting a simulation study and being concerned with all of the eleven credibility assessment stages not just model validation and programmed model verification.
Adaptive Receiver Notification for Non-Dedicated Workstation Clusters
Authors: Michael Schmitt, Max Ibel, Anurag Acharya, Klaus Schauser
Venue:  (1998)

Efficient communication in a NOW environment can be a challenging task. Depending on the application, the architecture of the nodes and the characteristics of other processes running on the nodes, different communication mechanisms can be appropriate. In this paper, we evaluate an adaptive strategy which provides several communication mechanisms and selects between them depending on the current situation. We focus on strategies for receiver notification under varying load conditions. Previous research has shown that in a non-dedicated environment, spin-block strategies can avoid scheduling anomalies which can cause several orders of magnitude of performance degradation. However, reseach on these strategies have focused on fixed spin-delay. We investigate an adaptive strategy that uses run-time information to select the spin-delay in an online manner. Our strategy achieves provides better performance than static spin-block strategies on workstation clusters with varying load.
On the Reusability of Query Optimization Algorithms
Authors: Don S. Batory
Venue:  (1988)

We tackle the problem of software reusability in this paper as it pertains to an important class of nonrecursive query optimization algorithms. We demonstrate reusability can be achieved by 1) imposing standardized interfaces and 2) expressing algorithms in a DBMS implementation-independent manner. The former is accomplished by generalizing the notion of query graphs, and the latter is accomplished by standardizing algorithm definitions in terms of query graph rewrite rules. Demonstrating algorithm reusability is an essential step toward a building-blocks technology for extensible database systems.
OPTIMAL SIZING OF HIGH SPEED CLOCK NETWORKS BASED ON DISTRIBUTED RC AND LOSSY TRANSMISSION LINE MODELS
Authors: Qing Zhu, Wayne W.M. Dai, Joe G. Xi
Venue:  (1993)

We have proposed an efficient measure to reduce the clock skew by assigning the clock network with variable branch widths. This measure has long been used for ``H'''' clock tree. This paper formulates the optimal sizing of a general clock network as an optimization problem which minimizes the clock skew in a feasible set of widths. This feasible set of branch widths is decided by the process technology and routing resources. The skew minimization problem is turned into a least-squares estimation problem, and a modified Gauss-Marquardt''s method is then used to determine the optimal widths of clock branches. This optimization method combines the best features of the methods based on Taylor series and methods based on gradients. An efficient algorithm is also proposed that assigns the good initial widths especially for a clock tree which let the later optimization process converge much more quickly. Our method is very flexible and can handle the general clock network including loops. The clock network can exhibit distributed RC and lossy transmission line behaviors. The method employs a scattering-parameters based delay macromodel to evaluate the timing of the clock network during the optimization process. The major objective of our sizing method is to minimize the skew, but as a by-product that the largest path delay is also reduced.
The origins of digital computing in Europe
Authors: Seymour Goodman
Venue: Communications of the ACM (2003)

Retracing the paths of influential, but often isolated, computer pioneers.
Using data mining techniques to analyze correspondences between user and scientific knowledge in an agricultural environment
Authors: D. Sánchez, J. M. Serrano, M. A. Vila, V. Aranda, J. Calero, G. Delgado
Venue: Enterprise information systems IV (2003)

The incorporation of technology is recognized as one of the main factors affecting the future evolution of agriculture. In this context, a big effort is being devoted to the development of systems to manage knowledge about the different aspects of cultivation, to be employed for decision-making purposes. An important problem here is that in many occasions, information and knowledge employed to make decisions about a certain topic come from different sources. This is actually the case in the soil setting with scientist and user knowledge. The fusion of information is needed in order to facilitate the analysis, comparison and exploitation of knowledge coming from different sources. One particular case is that of having two different classifications (partitions) of the same set of objects. A first step to integrate them is to study their possible correspondence. In this paper we introduce several kinds of possible correspondences between partitions, and we propose the use of data mining techniques to measure its accuracy. For that purpose, partitions are represented as relational tables, and correspondences are identified with association rules and approximate dependencies. The accuracies of the former are then measured by means of accuracy measures of the latter, and some results relating accuracy values to correspondence cases are shown. Finally, we provide some examples of application of our proposal in a real-world problem, the integration of user and scientific classification of soils, that is of primary interest for decision making in agricultural environments.
Specification Languages: Understanding Their Role in Simulation Model Development
Authors: C. M Overstreet, Richard E. Nance, Osman Balci, Lynne F. Barger
Venue:  (1987)

Current software specification techniques and specification languages are reviewed, emphasizing research activities in software specification languages. Alternate software life cycle models are described and compared to a simulation life cycle model. The importance of constructing a model specification before creating a programmed model is emphasized. Disadvantages in using simulation programming languages as model specification languages are discussed. The multiple uses which are made of a model specification are presented; these uses correspond to the alternate uses made of a requirements specification for general software. To evaluate where specification tools for general software will be effective for simulation modeling, both areas where the simulation life cycle corresponds to a general software life cycle and areas in which they differ are characterized. Important
A survey of Bayesian data mining
Authors: Stefan Arnborg
Venue: Data mining: opportunities and challenges (2003)

This chapter reviews the fundamentals of inference, and gives a motivation for Bayesian analysis. The method is illustrated with dependency tests in data sets with categorical data variables, and the Dirichlet prior distributions. Principles and problems for deriving causality conclusions are reviewed, and illustrated with Simpson's paradox. The selection of decomposable and directed graphical models illustrates the Bayesian approach. Bayesian and EM classification is shortly described. The material is illustrated on two cases, one in personalization of media distribution, one in schizophrenia research. These cases are illustrations of how to approach problem types that exist in many other application areas.
Fast Ray Tracing Using K-d Trees
Authors: Donald S. Fussell, K. R. Subramanian
Venue:  (1988)

A hierarchical search structure for ray tracing based on k-d trees is introduced. This data structure can handle the variety of surfaces commonly used in computer graphics. Algorithms to build and traverse this binary data structure are described. Only regions through which a ray travels are interrogated and the search proceeds along the path of the ray starting from its origin. The algorithm also ensures that no object is interrogated more than once in the search for intersection. Benchmarking results indicate that when used with axis-aligned bounding parallelepipeds, this method of ray tracing is one of the fastest known.
Optimization in Aircraft Design
Authors: Susan L. Burgee, Layne T. Watson, Anthony A. Giunta, Vladimir Balabanov, Bernard Grossman, Robert T. Haftka, William H. Mason
Venue:  (1995)

A parallel variable-complexity modeling approach, permitting the efficient use of emerging parallel computing in multidisciplinary optimization (MDO) technology, is presented for the particular instance of High Speed Civil Transport (HSCT) design. In this method simple analyses are used to limit the approximation domain based on the D-optimality criterion through the use of a genetic alogorithm. At the D-optimal points, a refined analysis is performed. The optimization code is composed of a sequence of analysis cycles between aerodynamic and structural calculations. Results for coarse grained parallelization of the aerodynamic and structural codes on an Intel Paragon are presented for an example HSCT design problem involving only two variables. The full HSCT design problem employs twenty-eight design variables.
Optimization of Memory Hierarchies in Multi-programmed Computer Systems with Fixed Cost Constraint
Authors: Samuel T. Chanson, Prem S Sinha
Venue:  (1978)

This paper presents, using queuing theory and optimization techniques, a methodology for estimating the optimal capacities and speeds of the memory levels in a computer system memory hierarchy operating in the multiprogrammed environment. Optimality is with respect to mean system response time under a fixed cost constraint. It is assumed that the number of levels in the hierarchy as well as the capacity of the lowest level are known. The effect of the storage management strategy is characterized by the hit ratio function which, together with the device technology cost functions are assumed to be representable by power functions. It is shown that as the arrival rate of processes and/or the number of active processes in the system increase, the optimal solution deviates considerably from that under a uniprogrammed environment.
Simulated Annealing for Profile and Fill Reduction of Sparse Matrices
Authors: Robert R. Lewis
Venue:  (1993)

Simulated annealing can minimize both profile and fill of sparse matrices. We applied these techniques to a number of sparse matrices from the Harwell-Boeing Sparse Matrix Collection. We were able to reduce profile typically to about 80% of that attained by conventional profile minimization techniques (and sometimes much lower), but fill reduction was less successful (85% at best). We present a new algorithm that significantly speeds up profile computation during the annealing process. Simulated annealing is, however, still much more time-consuming than conventional techniques and is therefore likely to be useful only in situations where the same sparse matrix is being used repeatedly. 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
Note on the End Game in Homotopy Zero Curve Tracking
Authors: Maria Sosonkina, Layne T. Watson, David E. Stewart
Venue:  (1995)

Homotopy algorithms to solve a nonlinear system of equations f(x)=0 involve tracking the zero curve of a homotopy map p(a,theta,x) from theta=0 until theta=1. When the algorithm nears or crosses the hyperplane theta=1, an "end game" phase is begun to compute the solution x(bar) satisfying p(a,theta,x(bar))=f(x(bar))=0. This note compares several end game strategies, including the one implemented in the normal flow code FIXPNF in the homotopy software package HOMPACK.
On the Cell Probe Complexity of Polynomial Evaluation
Authors: Per Bro Miltersen
Venue:  (1994)

We consider the cell probe complexity of the polynomial evaluation problem with preprocessing of coefficients, for polynomials of degree at most n over a finite field K. We show that the trivial cell probe algorithm for the problem is optimal if K is sufficiently large compared to n. As an application, we give a new proof of the fact that P != ncr - TIME (o (log n/ log log n) ).