ppxscal/embedding_network huggingface dataset:
The Asymptotic Complexity of Merging Networks
Authors: Per B Miltersen, M. S. Paterson, Jun Tarui
Venue:  (1992)

Let M(m, n) be the minimum number of comparators in a comparator network that merges two ordered chains x_1 2 x_2 2 . . . 2 x_m and y_1 2 y_2 . . . 2 y_n, where n 3 m. Batcher''s odd-even merge yields the following upper bound: M(m, n) 2 (m + n)/2. log_2 (m + 1) + O (n), e.g., M (n, n) 2 n log_2 n + O(n). Floyd (for M(n, n)), and then Yao and Yao (for M(m, n)) have shown the following lower bounds: M(m, n) 3 n /2. log_2 (m + 1); M (n, n) 3 n /2. log_2 n + O (n). We prove a new lower bound that matches the upper bound asymptotically: M (m, n) 3 (m + n)/2. log_2 (m + 1) - O (m), e.g., M (n, n) 3 n log_2 n - O (n). Our proof technique extends to give similarly tight lower bounds for the size of monotone Boolean circuits for merging, and for the size of switching networks capable of realizing the set of permutations that arise from merging.
Note Recognition in Polyphonic Music using Neural Networks
Authors: Tim Shuttleworth, R. G. Wilson
Venue:  (1993)

This report describes the initial results of work toward the development of a system for the automatic transcription of polyphonic musical works where the input to the system is a digital sound waveform representation (such as the data stored on a Compact Disc), and the output is a symbolic, score-like representation of the work being performed. A lowlevel representation of the music signal is discussed (the Multiresolution Fourier Transform). A method of finding the beat of a piece of music is described, as is some preliminary work on pitch tracking through use of the frequency centroid. One of the major differences between this work and that previously published is that is an emphasis on the use of higher level structural properties of music. Possible methods of integrating high- and low-level musical knowledge are discussed, and in particular the Hidden Markov Model paradigm, previously found in work on speech recognition, is introduced in a music recognition context. Finally there is some discussion of future directions for this work.
Campus pertal strategies
Authors: David L. Eisler
Venue: Designing portals: opportunities and challenges (2003)

This chapter is designed to assist campuses and their leaders in determining whether to pursue a portal project. For those universities that choose to create portals, a series of strategies and approaches are presented to guide and assist in the success of the effort. This material is provided from the perspective that campus portals can provide a new way to connect with students, faculty, alumni and the community. Strategies are presented to determine whether to undertake a portal project, and the campus readiness for this effort. Nine different approaches to campus portals are presented, together with suggestions on project organization. Project success factors are developed together with potential planning pitfalls for campus portal projects. Finally future approaches for portals are discussed with thoughts for portal acceptance on campus.
Revision in ACMS
Authors: Alex Kean
Venue:  (1991)

The motivation for creating truth maintenance systems is two fold. First, it is used for the abduction process of generating explanation; and second, to perform the necessary {\em bookkeeping} of revision of the knowledge based. The process of revision is defined as addition and deletion of knowledge from the knowledge base. A logical scheme for tracking conclusions in an assumption based clause management system (ACMS) for the purpose of abduction and revision is proposed. As a consequence, an incremental deletion scheme is derived. A protocol for assumption revision is demonstrated by a backtrack search example. The proposed ACMS is the first truth maintenance system that employs incremental deletion as part of its capability.
A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions
Authors: Raimund Seidel
Venue:  (1981)

Finding the convex hull of a finite set of points is important not only for practical applications but also for theoretical reasons: a number of geometrical problems, such as constructing Voronoi diagrams or intersecting hyperspheres, can be reduced to the convex hull problem, and a fast convex hull algorithm yields fast algorithms for these other problems. .br This thesis deals with the problem of constructing the convex hull of a finite point set in $R^{d}$. Mathematical properties of convex hulls are developed, in particular, their facial structure, their representation, bounds on the number of faces, and the concept of duality. The main result of this thesis is an $O(n \log n + n^{\lfloor(d+1)/2\rfloor})$ algorithm for the construction of the convex hull of $n$ points in $R^{d}$. It is shown that this algorithm is worst case optimal for even $d \geq 2$.
On Finite Covering of Infinite Spaces for Protocol Test Selection
Authors: Masaaki Mori, Son T. Vuong
Venue:  (1993)

The core of the protocol test selection problem lies in how to derive a finite test suite from an infinite set of possible execution sequences (protocol behaviors). This paper presents two promising approaches to this problem : (i) the metric based topological approach, and (ii) the formal language theoretic approach ; both aim at producing finite coverings of an infinite set of execution sequences. The former approach makes use of the property of compactness of metric space, which guarantees the infinite metric space can be fully covered by a finite number of open "balls" (subspaces). The latter approach relies on the property that the Parikh mapping of a set of all execution sequences can be represented by a finite union of linear sets. Two simple protocol examples are given to elucidate the formal language theoretic approach.
Practical Minimal Perfect Hashing Functions for Large Databases
Authors: Edward A. Fox, Lenwood S. Heath, Qi Chen, Amjad M. Daoud
Venue:  (1990)

We describe the first practical algorithms for finding minimal perfect hash functions that have been used to access very large databases (i.e., having over 1 million keys). This method extends earlier work wherein an 0(n-cubed) algorithm was devised, building upon prior work by Sager that described an 0(n-to the fourth) algorithm. Our first linear expected time algorithm makes use of three key insights: applying randomness whereever possible, ordering our search for hash functions based on the degree of the vertices in a graph that represents word dependencies, and viewing hash value assignment in terms of adding circular patterns of related words to a partially filled disk. Our second algorithm builds functions that are slightly more complex, but does not build a word dependency graph and so approaches the theoretical lower bound on function specification size. While ultimately applicable to a wide variety of data and file access needs, these algorithms have already proven useful in aiding our work in improving the performance of CD-ROM systems and our construction of a Large External Network Database (LEND) for semantic networks and hypertext/hypermedia collections. Virginia Disc One includes a demonstration of a minimal perfect hash function running on a PC to access a 130,198 word list on that CD-ROM. Several other microcomputer, minicomputer, and parallel processor versions and applications of our algorithm have also been developed. Tests including those wiht a French word list of 420,878 entries and a library catalog key set with over 3.8 million keys have shown that our methods work with very large databases.
Reasoning About Knowledge Using Extensional Logics
Authors: Erann Gat, David P. Miller
Venue:  (1987)

When representing statements about knowledge in a extensional logic, it occasionally happens that undesired conclusions arise. Such extraneous conclusions are often the result of substitution of equals for equals or existential instantiation within intensional operators such as Know. In the past, efforts at solving this problem have centered on modifications to the logic. In this thesis, I propose a solution that leaves the logic intact and changes the representation of the statements instead. The solution presented here has four main points: 1) Only propositions can be known. 2) Relations rather than functions should be used to describe objects. 3) Temporal reasoning is often necessary to represent many real-world problems. 4) In cases where more than one label can apply to the same object, an agent''s knowledge about labels must be explicitly represented. When these guidelines are followed, statements about knowledge can be represented in standard first-order predicate logic in such a way that extraneous conclusions cannot be drawn. Standard first-order theorem provers (like Prolog) can then be used to solve problems which involve reasoning about knowledge.
The Power of Small Coalitions in Graphs
Authors: D. Peleg
Venue:  (1995)

This paper considers the question of the influence of a coalition of vertices, seeking to gain control (or majority) in local neighborhoods in a general graph. Say that a vertex v is controlled by the coalition M if the majority of its neighbors are from M. We ask how many vertices (as a function of |M|) can M control in this fashion. Upper and lower bounds are provided for this problem, as well as for cases where the majority is computed over larger neighborhoods (either neighborhoods of some fixed radius r ? 1, or all neighborhoods of radii up to r). In particular, we look also at the case where the coalition must control all vertices outside itself, and derive bounds for its size. 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
Dynamical analysis of composite steel decks floors subjected to rhythmic load actions
Authors: J. G. S. da Silva, F. J. da C. P. Soeiro, P. C. G. da S. Vellasco, S. A. L. de Andrade, R. Werneck
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

The even more competitive world market trends have forced structural engineers to develop minimum weight and labour cost solutions. A direct consequence of this new design trend is a considerable increase in problems related to unwanted floor vibrations. This phenomenon is very frequent in a wide range of structures subjected to rhythmic dynamical load actions. These load actions are generally caused by human rhythmic activities such as: musical and or sporting events, dance or even gymnastics. The main objective of this paper is to study the structural behaviour of commonly used composite floors subjected to rhythmic dynamical load actions identifying the occurrence of unwanted vibrations that could cause human discomfort or, in extreme cases, structural failure.
Reformulation of Boundary Value Problems in ``Standard'''' Form
Authors: Uri Ascher, Robert D. Russell
Venue:  (1980)

Boundary value problems in ODE''s arising in various applications are frequently not in the ``standard'''' form required by the currently existing software. However, many problems can be converted to such a form, thus enabling the practitioner to take advantage of the availability and reliability of this general purpose software. Here, various conversion devices are surveyed.
Model Based Multiresolution Motion Analysis
Authors: James Beacom, Roland Wilson
Venue:  (1997)

A model based multiresolution motion analysis technique is presented. The projection onto the image plane of the motion of a point in three space is used in a derivative based optical flow formulation. This can then be solved using the method of least squares to compute the six parameters describing the motion of the body (three rotational and three translational components) initially at a high scale and then refined with increasing resolution. These may be calculated due to prior knowledge of the depth of points in the scene from an explicit volumetric model of the object being viewed. This is specified at a single resolution and then extrapolated through scale. This enables the creation of a texture mapped approximation of the input frames at each scale to be used in the coarse-to-fine estimation of the motion parameters. The object is assumed not to deform through time.
The Impact of Lookahead on Conservative Simulation
Authors: Jain J. Wang, Marc Abrams
Venue:  (1995)

This paper studies the impact on the performance of conservative simulation for both open and closed models. For open models, we derive an upper bound on the performance improvement due to the lookahead. We show that the benefit of lookahead diminishes as the simulation length increases. For closed models, on the other hand, the performance improvement converges to a constant as the simulation length increases.
An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix Multiplications
Authors: Artur Czumaj
Venue:  (1992)

This paper considers the computation of matrix chain products of the form M1 x M2 x ... M(n-1). The order in which the matrices are multiplied affects the number of operations. The best sequential algorithm for computing an optimal order of matrix multiplication runs in O (n log n) time while the best known parallel NC algorithm runs in O (log^2 n) time using n^6/log^6 n processors. This paper presents the first approximating optimal parallel algorithm for this problem and for the problem of finding a near-optimal triangulation of a convex polygon. The algorithm runs in O (log n) time using n /logn processors on a CREW PRAM, and O ( log log n) time using n / log log n processors on a weak CRCW PRAM. It produces an order of matrix multiplications and a partition of polygon which differ from the optimal ones at most 0.1547 times.
BORG: A RECONFIGURABLE PROTOTYPING BOARD USING FIELD-PROGRAMMABLE GATE ARRAYS
Authors: Pak K. Chan, Martine D.F. Schlag, Marcelo Martin
Venue:  (1991)

Field-Programmable Gate Arrays (FPGA) provide a medium to accelerate the process of prototyping digital designs. For designs with multiple FPGAs that need to be connected together, the bottleneck is now the process of wire-wrapping, bread-boarding, or (worse) the construction of a printed circuit board, which cannot be carried out until all FPGA designs are routed. It is because locking or preassigning I/O blocks often prevent FPGA placement/routers from completing the routing.\\ We exploit the reprogrammability of FPGAs and use them for routing. To experiment with the idea, we constructed a PC-based prototyping board that contains two ``user'''' FPGAs, two routing FPGAs, and an FPGA that serves as glue logic to the PC bus. To facilitate the design process using the new prototyping board, we developed algorithms and tools that automatically configure the routing FPGAs. We describe the options that we have examined during the development of this board, and how we arrive at some design decisions. The toolset, user FPGAs, and the routing FPGAs and the reprogammability of the FPGAs serve to further reduce the time/cost of constructing prototypes using FPGAs.
Dynamic Resource Allocation Using Views
Authors: M. Choy, A. Singh
Venue:  (1999)

Conflicting requests to shared resources arise naturally and frequently in distributed systems. The resolution of these conflicts in a fair and timely manner is important. We consider a general model in which processes request repeatedly and asynchronously for arbitrary subsets of resources. Our solution to this dynamic problem first computes a collection of process-specific local views that capture the conflicts for each process, and then resolves the conflicts on these views using existing algorithms. We specify the requirements on local views, and present an algorithm satisfying the requirements. The time and message complexities of the composite algorithm for dynamic conflict resolution depend minimally on global parameters and offer a significant improvement over existing algorithms.
PRODUCING AN ACCURATE CALL-STACK TRACE IN THE OCCASIONAL ABSENCE OFFRAME POINTERS
Authors: Max Copperman
Venue:  (1992)

An interactive debugger should be able to provide a call-stack trace, listing active subroutines in reverse order of their invocations. This facility relies on information provided by code within each called routine. This paper describes alternative ways to support this facility in the circumstance that this code is optimized away. (supersedes 90-62)
Recognition by Prototypes
Authors: R. Basri
Venue:  (1995)

A scheme for recognizing 3D objects from single 2D images under orthographic projection is introduced. The scheme proceeds in two stages. In the first stage, the categorization stage, the image is compared to prototype objects. For each prototype, the view that most resembles the image is recovered, and, if the view is found to be similar to the image, the class identity of the object is determined. In the second stage, the identification stage, the observed object is compared to the individual models of its class, where classes are expected to contain objects with relatively similar shapes. For each model, a view that matches the image is sought. If such a view is found, the object''s specific identity is determined. The advantage of categorizing the object before it is identified is twofold. First, the image is compared to a smaller number of models, since only models that belong to the object''s class need to be considered. Second, the cost of comparing the image to each model in a class is very low, because correspondence is computed once for the whole class. More specifically, the correspondence and object pose computed in the categorization stage to align the prototype with the image are reused in the identification stage to align the individual models with the image. As a result, identification is reduced to a series of simple template comparisons. The paper concludes with an algorithm for constructing optimal prototypes for classes of objects. 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
Model Generation Issues in a Simulation Support Environment
Authors: Osman Balci, Richard E. Nance, Emory J Derrick, Ernest H. Page, John L. Bishop
Venue:  (1990)

No longer available as a technical report. Contact authors re reprints of published article.
Supporting the Construction and Use of Spatio-Temporal Domains In Scientific Databases
Authors: Terrence R. Smith, Jianwen Su, Michael F. Worboys
Venue:  (1993)

A modeling and database system (MDBS) provides computational support that facilitates the iterative development of scientific models in data-intensive and computationally intensive applications in various areas of scientific application. We describe and exemplify core elements of an MDBS that is based both upon a simple characterization of scientific activity and upon the results of joint research with a group of EOS earth scientists. The MDBS that we describe is focused in particular on the representation and manipulation of large numbers of complex, spatio-temporal entities. The main contributions of the current paper are an advanced and comprehensive data model and a high-level database and modeling language (MDBL). The data model is based on a simple characterization of scientific activity that captures the essence of scientific modeling and database activities in terms of four fundamental sets of activities. These activities are defined in relation to large lattices of representational domains (R-domains) that are employed to organize scientific knowledge, data and algorithms. The data model separates the specification and representation of R-domains of elements, and allows multiple representations that are explicitly controlled by the user. Datasets and transformations are organized in terms of an extensible lattice of abstract and concrete R-domains. In particular, the data model allows the easy definition and manipulation of large numbers of domains of spatio-temporal elements. We present many examples of such domains from our applications. MDBL is a high-level, largely declarative language that is also based on our characterization of science and provides easy expression of the four classes of scientific activities in relation to R-domains. MDBL permits the easy integration of modules that support scientific modeling and database activities. We are currently applying the data model and languages to several EOS earth-science applications.
Maximum performance efficiency approaches for estimating best practice costs
Authors: Marvin D. Troutt, Donald W. Gribbin, Murali S. Shanker, Aimao Zhang
Venue: Data mining: opportunities and challenges (2003)

Data mining is increasingly being used to gain competitive advantage. In this chapter, we propose a principle of maximum performance efficiency (MPE) as a contribution to the data-mining toolkit. This principle seeks to estimate optimal or boundary behavior, in contrast to techniques like regression analysis that predict average behavior. This MPE principle is explained in the context of activity-based costing situation. Specifically, we consider the activity-based costing situation in which multiple activities generate a common cost pool. Individual cost drivers are assigned to the respective activities, but allocation of the cost pool to the individual activities is regarded as impractical or expensive. Our study focuses on published data from a set of property tax collection offices, called Rates Departments, for the London metropolitan area. We define what may be called benchmark or most efficient average costs per unit of driver. The MPE principle is then used to estimate the best practice cost rates. A validation approach for this estimation method is developed in terms of what we call normal-like-or-better performance effectiveness. Extensions to time-series data on a single unit, and marginal cost-oriented basic cost models are also briefly described. In conclusion, we discuss potential data-mining applications and considerations.
Perfect Zero-Knowledge Arguments for NP Using any One-Way Permutation
Authors: M. Naor, R. Ostrovsky, R. Venkatesan, M. Yung
Venue:  (1996)

``Zero-knowledge arguments'''' is a cryptographic primitive which allows one polynomial-time player to convince another polynomial-time player of the validity of an NP statement, without revealing any additional information (in the information-theoretic sense). Here the security achieved is on-line : in order to cheat and validate a false theorem, the prover must break a cryptographic assumption on-line during the conversation, while the verifier cannot find (ever) any information unconditionally. Despite their practical and theoretical importance, it was only known how to implement zero-knowledge arguments based on specific algebraic assumptions. In this paper, we show a general construction, which can be based on any one-way permuation.