ppxscal/embedding_network huggingface dataset:
How Many Squares Can a Binary Sequence Contain?
Authors: A. S. Fraenkel, J. Simpson
Venue:  (1997)

All our words (strings) are over a fixed alphabet. A square is a subword of the form uu = u2, where u is a nonempty word. Two squares are distinct if they are of different shape, not just translates of each other. A word u is primitive if u cannot be written in the form u = vj for some j ? 2. A square u2 with u primitive is primitive rooted. Let M(n) denote the maximum number of distinct squares, P(n) the number of distinct primitive rooted squares in a word of length n. We prove: no position in any word can be the beginning of the rightmost occurrence of more than two squares, from which we deduce M(n) 0, and P(n) = n-o(n) for infinitely many n.
GCODE: A Revised Standard for a Graph Representation for Functional Programs
Authors: M. S. Joy, T. H. Axford
Venue:  (1990)

The data structures used in the authors'' functional language graph reduction implementations are described, together with a standard notation for representing the graphs in a textual format. The graphs employed are compatible with the intermediate-level functional language FLIC and with the functional languages in use at Birmingham and Warwick. The textual format is designed to be transmittable easily across networks.
Unlanguage Grammars and Their Uses
Authors: R. A. Fraley
Venue:  (1977)

A new technique is presented for using context free grammars for the definition of programming languages. Rather than accumulating a number of specialized statement formats, generalized productions specify the format of all statements. A sample unlanguage grammar is presented, and the use of this grammar is described. Some of the difficulties in parsing the language are described.
The Simulation Model Development Environment: An Overview
Authors: Osman Balci, Richard E. Nance
Venue:  (1992)

The purpose of this paper is to provide an overview of the Simulation Model Development Environment (SMDE) that has been under development since 1983. The SMDE architecture is composed of four layers: (0) Hardware and Operating System, (1) Kernel SMDE, (2) Minimal SMDE, and (3) SMDEs. Following the incremental development software engineering life cycle, SMDE software components are identified. Guided by the principles enunciated by the Conical Methodology, evolutionary prototyping approaches have been used to develop the following minimal SMDE tools: Premodels Manager, Assistance Manager, Model Generator, Model Analyzer, Model Translator, and Model Verifier. The Model Generator has been the most critically important tools, and five prototypes have been developed.
EXPLOITING MULTIPLE I/O STREAMS TO PROVIDE HIGH DATA-RATES
Authors: Luis Cabrera, Darrell D. E. Long
Venue:  (1991)

We present an I/O architecture, called Swift, that addresses the problem of data-rate mismatches between the requirements of an application, the maximum data-rate of the storage devices, and the 6ata-rate of the interconnection medium. The goal of Swift is to support integrated continuous multimedia in general purpose distributed systems. In installations with a high-speed interconnection medium, Swift will provide high data-rate transfers by using multiple slower storage devices in parallel. The data-rates obtained with this approach scale well when using multiple storage devices and multiple interconnections. Swift has the flexibility to use any appropriate storage technology, including disk arrays. The ability to adapt to technological advances will allow Swift to provide for ever increasing I/O demands. To address the problem of partial failures, Swift stores data redundantly. Using the UNIX operating system, we have constructed a simplified prototype of the Swift architecture. Using a single Ethernet-based local-area network and three servers, the prototype provides data-rates that are almost three times as fast as access to the local SCSI disk in the case of writes. When compared to NFS, the Swift prototype provides double the data-rate for reads and eight times the data-rate for writes. The data-rate of our prototype scales almost linearly in the number of servers and the number of network segments. Its performance is shown to be limited by the speed of the Ethernet-based local-area network. We also constructed a simulation model to show how the Swift architecture can exploit storage, communication, and processor advances, and to locate the components that will limit I/O performance. In a simulated gigabit/second token ring local-area network the data-rates are seen to scale proportionally to the size of the transfer unit and to the number of storage agents.
MISC: A SIMD ASSOCIATIVE ARCHITECTURE FOR KNOWLEDGE PROCESSING
Authors: James D. Roberts
Venue:  (1995)

Massively parallel processing is generally considered necessary to meet the long-range goals of artificial intelligence. Current commercial machines are optimized for numeric calculations, however, and custom machines are generally restricted to a single application or AI methodology. The MISC architecture extends SIMD architecture to better serve AI applications while retaining a general-purpose core. MISC is perhaps unique in its features resulting from an emphasis on search pruning and matching complex objects. These include multiple small arrays, high bandwidth access to large memory, an enhanced mesh communication network, and multiple special-function units. Analysis of the interaction between algorithm, architecture, and implementation technology demonstrates substantial speed improvement and cost-effectiveness. This paper discusses the MISC architecture and principles for the evolution of existing machines towards additional applications in knowledge processing. 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
Power Issues Related To Branch Prediction
Authors: Dharmesh Parikh, Kevin Skadron, Yan Zhang, Marco Barcella, Mircea R. Stan
Venue:  (2001)

This paper explores the role of branch predictor organization in power/energy/performance tradeoffs for processor design. We find that as a general rule, to reduce overall energy consumption in the processor it is worthwhile to spend more power in the branch predictor if this results in more accurate predictions that improve running time. Two techniques, however, provide substantial reductions in power dissipation without harming accuracy. Banking reduces the portion of the branch predictor that is active at any one time. And a new on-chip structure, the prediction probe detector (PPD), can use pre-decode bits to entirely eliminate unnecessary predictor and BTB accesses. Despite the extra power that must be spent accessing the PPD, it reduces local predictor power and energy dissipation by about 45% and overall processor power and energy dissipation by 5--6%.
Internet technology as a business tool
Authors: Sebastián Bruque
Venue: Enterprise information systems IV (2003)

Since the beginnings of the computing era people have suggested that the implementation of Information Technology (IT) would have a positive effect on firm performance. Indicators like productivity, profitability and market share could be improved by these tools. Among these technologies, firms can now use TCP/IP or Internet technologies for strategic purposes but, until now, their real effects have been unclear. In this work we try to provide some evidence about the impact of the Internet on competitive advantage in a Spanish Industry. Also, we give some insights that can help to understand the role of the Internet as a competitive weapon in modern firms.
FAST AND INCREMENTAL ROUTABILITY CHECK OF A TOPOLOGICAL ROUTING USING A CUT-BASED ENCODING
Authors: Man Yu, Wayne W. Dai
Venue:  (1997)

Many performance-driven routing algorithms do not consider outability. Routing trees are built assuming that there are no other wires. The main reason for this is that it is NP-hard to guarantee routability. Even checking for routability is a time-consuming process. This limits the usefulness of many performance-driven routing algorithms because unroutable designs are useless. Previous online routability checking is not fast enough for the many iterative improvement steps in a performance-driven routing algorithm. This paper provides such an algorithm. We propose a versatile topological routing encoding that not only allows an efficient routability check, but also provides proximity information for crosstalk and manufacturability analysis. Our routing model is applicable to a wide range of technologies, including PCB, MCM and standard cell ASIC. It allows rectilinear, octilinear or Euclidean wiring metric and arbitrary-shaped obstacles. It is gridless and supports variable wire width and spacing. Our algorithm is fast enough to be integrated into any iterative improvement schemes such as simulated annealing. Our basic observation is that the placement of obstacles is fixed but rerouting is very frequent. So we emphasize on an efficient rerouting and routability check step but pushes the complexity to building a data structure that depends only on the placement of the obstacles.
Bundling: A new Construction Paradigm for Persistent Systems ?
Authors: Andreas Geppert, Klaus R. Dittrich
Venue:  (1997)

Over the past years, successful research efforts have been devoted to implementation aspects of database management systems. This research has mainly considered the implementation of single DBMS-components and techniques for selected DBMS-tasks (e.g., query optimization, transaction management). Nevertheless, the systematic construction of DBMSs as a whole has been considered only scarcely. Urgent problems such as domain-specific architecture models for DBMSs or DBMS-construction processes have received attention only recently. Such problems gain ever more importance as the trend is towards functionally more and more powerful persistent systems. Since it is apparent that all the requirements that might be posed to a DBMS can no longer be satisfied by a single, monolithic system, database technology must provide for a "construction theory" that allows to assemble adequate systems out of reusable components in a cost-effective way. Thus, our belief is that in the long term, DBMSs will be constructed by putting together components. This approach-called "rebundling- relies on reuse of adequate components, which are stored in repositories. The process that identifies and extracts these reusable components (out of virtual or real systems) is called "unbundling". In this paper, we first view the prerequisites and characteristics of unbundling and rebundling from a software engineering point of view. We then sketch how DBMSs can be constructed following the bundling paradigm, survey recent work in database technology related to un- and rebundling, and identify open problems. We then leverage unbundling to general heterogeneous, distributed persistent systems whose behavior is defined by processes. In this kind of system, bundability is an even more important requirement, because the components often are entire applications that cannot be rewritten. Using a scenario, we show how bundling can be applied for this kind of information systems.
INCREMENTAL, BOTTOM-UP, WELL-FOUNDED DEDUCTION (EXTENDED ABSTRACT)
Authors: Brian W. Beach
Venue:  (1990)

In this paper we describe an algorithm, called AFP, for the bottom-up execution of logic programs well suited to data-driven applications, where incremental updates to the base relations are propagated through the program to produce updated answers without completely re-executing the program. We show that AFP conforms to the well-founded semantics for general logic programs and that it terminates in polynomial time for DATALOG programs with negation. AFP is based on a modified formulation of well-founded negation that does not rely on computing sets of false atoms, avoiding the instantiation of the entire Herbrand base. AFP solves the two major problems in incremental bottom-up computation, recursion through negation and self-supporting conclusions, by using a counting technique over a two-dimensional representation of time to detect and stop such loops. Its feasibility has been verified with an implementation in Prolog. 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
Balanced Min and Max Cuts Under the Triangle Inequality
Authors: Teofilo F. Gonzalez, Toshio Murayama
Venue:  (1969)

The balanced {\em k-Min-Cut (k-Max-Cut)} problem consists of partitioning the $n$ vertices of an edge weighted complete (undirected) graph into $k$ equally-sized sets so as to minimize (maximize) the sum of the weights of the edges joining vertices in different subsets. We concentrate on the $(k,t)$-Max-Cut and $(k,t)$-Min-Cut problems defined over complete graphs that satisfy the triangle inequality as well as on a restricted class of these graphs. We establish a bound for the objective function value of an optimal partition for the $(k,t)$-Min-Cut and $(k,t)$-Max-Cut problems, and give problem instances that asymptotically achieve this bound. The existence of this small bound is important because it implies that any feasible solution is a near-optimal approximation to the $(k,t)$-Max-Cut and $(k,t)$-Min-Cut problems, for reasonable values of $k$. This shows that in a dynamic environment where the weights change, vertices are added and/or deleted, etc., any feasible solution is a reasonably good solution. We also present a characterization of an optimal partition for the one-dimensional version of our partitioning problems, and present a simple $O(n \log n)$ time algorithm to generate an optimal partition. For some restricted versions of these problems we present $O(n)$ time algorithms, and for other versions we establish a robust $\Omega(n \log n)$ lower bound for the time required to compute an optimal partition.
Efficient and Effective Clustering Methods for Spatial Data Mining
Authors: Raymond T. Ng, Jiawei Han
Venue:  (1994)

Spatial data mining is the discovery of interesting relationships and characteristics that may exist implicitly in spatial databases. In this paper, we explore whether clustering methods have a role to play in spatial data mining. To this end, we develop a new clustering method called CLARANS which is based on randomized search. We also develop two spatial data mining algorithms that use CLARANS. Our analysis and experiments show that with the assistance of CLARANS, these two algorithms are very effective and can lead to discoveries that are difficult to find with current spatial data mining algorithms. Furthermore, experiments conducted to compare the performance of CLARANS with that of existing clustering methods show that CLARANS is the most efficient.
Logging and Post-Mortem Analysis of Workflow Executions based onEvent Histories
Authors: Andreas Geppert, Dimitrios Tombros
Venue:  (1997)

Workflow execution logging and post-mortem analysis of workflow executions are important tasks of a workflow management system. In this paper, we show how both tasks are addressed in EvE, a prototypical distributed system implementing event-driven workflow execution. Essentially, both tasks benefit from the concept of an event history as it is present in active database systems. By using event-based workflow execution, the work flow log actually corresponds to the event history, and post-mortem analysis is accom plished through querying the event history. In our approach, an analysis of the required information has led to the design and development of a workflow analysis query service.
Numerical Experiments with Preconditioning by Gram Matrix Approximation for Non-Linear Elliptic Equations
Authors: G. Juncu, C. Popa
Venue:  (1996)

The paper analyses the numerical performances of the Gram matrix approximations preconditioning for solving non-linear elliptic equations. The two problems considered in this sense are the following: the Plateau problem and the general pseudohomogeneous model of the catalytic chemical reactor.The standard piecewise linear test and trial finite element discretization functions were used.The Gram matrix approximations tested were: Incomplete Choleski Decomposition and Multigrid Iteration.
The Weight of the Greedy Graph Spanner
Authors: H. Regev
Venue:  (1995)

We calculate a near-optimal upper bound on the weight of a graph spanner produced by the (so called) Greedy Spanner algorithm on a weighted graph. Our upper bound is independent of the magnitude of the weights in the graph, and it matches the known lower bound up to a O(log(n)) for n-vertex graphs. We also update the bound on the size of the spanner, and bound above the weight of any non-MST edge in the graph, which allows for a modification of the Greedy algorithm. 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
Grid generation using finite Fourier series
Authors: T. Ohkami, S. Goto
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

This paper shows an algebraic grid generation by interpolation functions using finite Fourier series. The region defined in physical domain is mapped into computational domain of rectangular grid generated by the proposed method, and partial differential equation is calculated numerically on the regularly-interval orthogonal grid in the transformed computational domain. Finite difference analysis and finite element analysis are performed on the mapped plane. The validity of the proposed method is examined for numerical problems with curvilinear boundary shape.
Determining Initial States for Time-Parallel Simulations
Authors: Jain J. Wang, Marc Abrams
Venue:  (1992)

In this paper, we propose a time-parallel simulation method which uses a pre-simulation to identify recurrent states. Also, an approximation technique is suggested for approximate Markovian modeling for queueing networks to extend the class of simulation models which can be simulated efficiently using our time-parallel simulation. A central server system and a virtual circuit of a packet-switched data communication network modeled by closed queueing networks are experimented with the proposed time-parallel simulation. Experiment results suggest that the proposed approach can exploit massive parallelism while yielding accurate results.
Extracting Salient Curves from Images: An Analysis of the Saliency Network
Authors: T. D. Alter, R. Basri
Venue:  (1996)

The Saliency Network proposed by Shashua and Ullman is a well-known approach to the problem of extracting salient curves from images while performing gap completion. This paper analyzes the Saliency Network. The Saliency Network is attractive for several reasons. First, the network generally prefers long and smooth curves over short or wiggly ones. While computing saliencies, the network also fills in gaps with smooth completions and tolerates noise. Finally, the network is locally connected, and its size is proportional to the size of the image. Nevertheless, our analysis reveals certain weaknesses with the method. In particular, we show cases in which the most salient element does not lie on the perceptually most salient curve. Furthermore, in some cases the saliency measure changes its preferences when curves are scaled uniformly. Also, we show that for certain fragmented curves the measure prefers large gaps over a few small gaps of the same total size. In addition, we analyze the time complexity required by the method. We show that the number of steps required for convergence in serial implementations is quadratic in the size of the network, and in parallel implementations is linear in the size of the network. We discuss problems due to coarse sampling of the range of possible orientations. We show that with proper sampling the complexity of the network becomes at least cubic in the size of the network. Finally, we consider the possibility of using the Saliency Network for grouping. We show that the Saliency Network recovers the most salient curve efficiently, but it has problems with identifying any salient curve other than the most salient one.
Back to the Future: A Retroactive Study of Aspect Evolution in Operating System Code
Authors: Kiczales Yvonne Coady and Gregor
Venue:  (2002)

The FreeBSD operating system more than doubled in size between version 2 and version 4. Many changes to primary modularity are easy to spot at a high-level. For example, new device drivers account for 38% of the growth. Not surprisingly, changes to crosscutting concerns are more difficult to track. In order to better understand how an aspect-oriented implementation would have fared during this evolution, we introduced several aspects to version 2 code, and then rolled them forward into their subsequent incarnations in versions 3 and 4 respectively. This paper describes the impact evolution had on these concerns, and provides a comparative analysis of the changes required to evolve the original versus aspect-oriented implementations. Our results show that for the concerns we chose, the aspect-oriented implementation facilitated evolution in four key ways: (1) changes were better localized, (2) configurability was more explicit, (3) redundancy was reduced, and (4) extensibility aligned with an aspect was more modular. Additionally, we found the aspect-oriented implementation had negligible impact on performance.
WORST-CASE QUADRATIC LOSS BOUNDS FOR ON-LINE PREDICTION OF LINEAR FUNCTIONS BY GRADIENT DESCENT
Authors: Nicolo Cesa-Bianchi, Philip M. Long, Manfred K. Warmuth
Venue:  (1993)

In this paper we study the performance of gradient descent when applied to the problem of on-line linear prediction in arbitrary inner product spaces. We show worst-case bounds on the sum of the squared prediction errors under various assumptions concerning the amount of a priori information about the sequence to predict. The algorithms we use are variants and extensions of on-line gradient descent. Whereas our algorithms always predict using linear functions as hypotheses, none of our results requires the data to be linearly related. In fact, the bounds proved on the total prediction loss are typically expressed as a function of the total loss of the best fixed linear predictor with bounded norm. All the upper bounds are tight to within constants. Matching lower bounds are provided in some cases. Finally, we apply our results to the problem of on-line prediction for classes of smooth functions.
Generalization from a Single View in Face Recognition
Authors: M. Lando, S. Edelman
Venue:  (1995)

We describe a computational model of face recognition, which generalizes from single views of faces by taking advantage of prior experience with other faces, seen under a wider range of viewing conditions. The model represents face images by vectors of activities of graded overlapping receptive fields (RFs). It relies on high spatial frequency information to estimate the viewing conditions, which are then used to normalize (via a transformation specific for faces), and identify, the low spatial frequency representation of the input. The class-specific transformation approach allows the model to replicate a series of psychophysical findings on face recognition, and constitutes an advance over current face recognition methods, which are incapable of generalization from a single example.