ppxscal/embedding_network huggingface dataset:
Designed sampling with crossover operators
Authors: Akiko Aizawa
Venue: Advances in evolutionary computing: theory and applications (2003)

Experimental design and evolutionary computation are different types of optimization techniques, both based on the same expectation that the achievement of a target system is improved by identifying and recombining the promising sub-components. Although the close relationship between the two techniques has long been recognized in the evolutionary computation community, past studies mostly focused on either analytical or comparative aspects of the issues. The present chapter is an attempt to combine experimental design and evolutionary computation into a single search strategy using a specific type of recombination function called a deterministic crossover operator. We first provide a brief overview of the traditional methods for experimental design as well as their connections to evolutionary computation. Then, "fair" and "greedy" sampling strategies are formulated, assuming the solution space is decomposed into two uniquely determined sub-spaces with a given deterministic crossover operator. Based on this formulation, a genetic-based implementation of fair and greedy sampling is also presented, with some illustrative experimental results.
Extending the Vocabulary Available for Cross-Disciplinary Searching of Earth Science Data
Authors: J. C. French, W. N. Martin, L. M. Olsen
Venue:  (2002)

This paper discusses the development of a prototype search assistant designed to aid cross-disciplinary searching of Earth science data. The goal of the project is to provide aids to help searchers overcome the vocabulary problem: the vocabulary used by the searchers is not the same as that used by the indexers. The work was motivated by vocabulary issues existing in the EOS Data Gateway (EDG) at the time this work began. (The EDG is the interface for searching and ordering Earth science data products from NASA and affiliated centers.) We describe the status of the project and give examples of the techniques that we are using. We also discuss the way in which we are implementing a new search paradigm, multiple viewpoints, within our prototype.
Bayesian Estimation and the Kalman Filter
Authors: Allen L. Barker, Donald E. Brown, Worthy N. Martin
Venue:  (1994)

In this tutorial article we give a Bayesian derivation of a basic state estimation result for discrete-time Markov process models with independent process and measurement noise and measurements not affecting the state. We then list some properties of Gaussian random vectors and show how the Kalman filtering algorithm follows from the general state estimation result and a linear-Gaussian model definition. We give some illustrative examples including a probabilistic Turing machine, dynamic classification, and tracking a moving object.
Strong Inapproximability of the Basic k-Spanner Problem
Authors: M. Elkin, D. Peleg
Venue:  (1999)

This paper studies the approximability of the sparse k-spanner problem. An O(logn)-ratio approximation algorithm is known for the problem for k = 2. For larger values of k, the problem admits only a weaker O(n1/k)-approximation ratio algorithm [24]. On the negative side, it is known that the k-spanner problem is weakly inapproximable, namely, it is NP-hard to approximate the problem with ratio O(logn), for every k ? 2 [19]. This lower bound is tight for k = 2 but leaves a considerable gap for small constants k < 2. This paper considerably narrows the gap by presenting a strong (or Class III [18]) inapproximability result for the problem for any constant k < 2, namely, showing that the problem is inapproximable within a ratio of O(2loge n), for any fixed 0 > e > 1, unless NP I DTIME(npolylog &#x00A0;n). Hence the k-spanner problem exhibits a ``jump'''' in its inapproximability once the required stretch is increased from k = 2 to k = 2+e. This hardness result extends into a result of O(2loge n)-inapproximability for the k-spanner problem for k = logm n and 0 > e > 1-m, for any 0 > m > 1. This result is tight, in view of the O(2log1-m n)-approximation ratio for the problem, implied by the algorithm of [24] for the case k = logm n. To the best of our knowledge, this is the first example for a set of Class III problems for which the upper and lower bounds ``converge'''' in this sense. Our main result implies also the same hardness for some other variants of the problem whose strong inapproximability was not known before, such as the uniform k-spanner problem, the unit-weight k-spanner problem, the ``all-server'''' k-spanner problem for any constant k and the augmentation k-spanner problem for k = 3.
Data mining in information technology and banking performance
Authors: Yao Chen, Joe Zhu
Venue: Data mining: opportunities and challenges (2003)

Information technology (IT) has become the key enabler of business process expansion if an organization is to survive and continue to prosper in a rapidly changing business environment while facing competition in a global marketplace. In the banking industry, a large amount of IT budgets are spent with the expectation that the investment will result in higher productivity and improved financial performance. However, bank managers make decisions on how to spend large IT budgets without accurate performance measurement systems on the business value of IT. A survey on managing technology in the banking industry found that 55% of the 188 senior executives surveyed stated that the returns on their investments in IT were either good or excellent. However, 50% of the senior executives also stated that they did not have any formal systems in place to measure the return on investment. This illustrates a need for a proper data-mining technique that can examine the impact of IT investment on banking performance. It has been recognized that the link between IT investment and banking performance is indirect, due to the effect of mediating and moderating variables. This chapter presents a methodology that measures the efficiency of IT utilization and the impact of IT on banking performance when intermediate measures are present. A set of banks is used to illustrate how we (1) characterize the indirect impact of IT on banking performance, (2) identify the best practice of two principal value-added stages related to IT investment and profit generation, and (3) improve the financial performance of banking.
Effective and Efficient Automatic Database Selection
Authors: James C. French, Allison L. Powell, Jamie Callan
Venue:  (1999)

We examine a class of database selection algorithms that require only document frequency information. The CORI algorithm is an instance of this class of algorithms. In previous work, we showed that CORI is more effective than gGlOSS when evaluated against a relevance-based standard. In this paper, we introduce a family of other algorithms in this class and examine components of these algorithms and of the CORI algorithm to begin identifying the factors responsible for their performance. We establish that the class of algorithms studied here is more effective and efficient than gGlOSS and is applicable to a wider variety of operational environments. In particular, this methodology is completely decoupled from the database indexing technology so is as useful in heterogeneous environments as in homogeneous environments.
USING DATA STRIPING IN A LOCAL AREA NETWORK
Authors: Luis Cabrera, Darrell D. E. Long
Venue:  (1992)

We use the technique of storing the data of a single object across several storage servers, called data striping, to achieve high transfer data rates in a local area network. Using parallel paths to data allows a client to transfer data to and from storage at a higher rate than that supported by a single storage server. We have imple- mented a network data service, called Swift, that uses data striping. Swift exhibits the expected scaling property in the number of storage servers connected to a network and in the number of interconnection networks present in the system. We have also simulated a version of Swift to explore the limits of possible future configurations. We observe that the system can evolve to support very high speed interconnection networks as well as large numbers of storage servers. Since Swift is a distributed system made up of independently replaceable components, any component that limits the performance can either be *replaced* by a faster component when it becomes available or can be *replicated* and used in parallel. This should allow the system to incorporate and exploit emerging storage and networking technologies.
Record/replay for nondeterministic program executions
Authors: Michiel Ronsse, Koen De Bosschere, Mark Christiaens, Jacques Chassin de Kergommeaux, Dieter Kranzlmüller
Venue: Communications of the ACM (2003)

Controlling the nondeterministic features within multithreaded and highly responsive applications enables the continued use of all traditional software development techniques.
The GeoSim Interface Library (GIL): Programmer''s Manual, Version1.0.1
Authors: David T. Hines, James M.A. Begole, Colin A. Klipsch, Clifford A. Shaffer
Venue:  (1994)

The GeoSim Interface Library (GIL) is a small, easy to use set of functions for building a graphical user interface. It was originally designed to support the user interface needs of Project GeoSim, a computer-aided education project for introductory geography classes. The original design for GIL was driven by the need to develop easy to use software that was portable to a variety of computing environments. It was used by a team of programmers engaged in rapid prototyping and frequent change to their user interfaces. GIL is freely available via anonymous FTP, gopher or Mosaic (or any other World Wide Web client) from geosim.cs.vt.edu, url http://geosim.cs.vt.edu.
Image Matching Based On The Co-occurrence Matrix
Authors: Hsing Hseu, Abhir Bhalerao, R. G. Wilson
Venue:  (1999)

In this work, the Gray Level Co-occurrence Matrices (GLCM) and cross-correlation are compared in an image matching process. First, three images are generated in different noise environments to simulate the images being derived from different sensors. Then, a Laplacian Pyramid is used as a high-pass filter. Finally, correlation of GLCM and cross-correlation are compared. Mutual information(MI) of GLCM is also included to evaluate the framework of the GLCM.
A Study of the Performance Simulation of a File Server Configured Micro-LAN
Authors: Paul Roth, Ilan Katz
Venue:  (1987)

This report describes the development of a simulation-based performance evaluation techniques for micro-LAN systems. The objective of the simulation is to predict network performance characteristics such as response time and CPU utilization, under varying traffic conditions and different LAN configurations. A model is developed which reliably predicts file-server network performance. The general applicability of this model provides LAN users with a powerful tool for predicting and analyzing system behavior.
Compact Deterministic Distributed Dictionaries
Authors: K. Gilon, D. Peleg
Venue:  (1993)

This paper handles the problem of designing a deterministic dictionary structure in a distributed system. The structure is required to be compact (namely, store only a single copy of each data item) and memory balanced, and to have efficient access protocols. Several structures are presented, achieving near-optimal performance with respect to memory requirements and communication complexity.
The complexity of choosing an H-colouring (nearly) uniformly at random
Authors: L. A. Goldberg, S. Kelk, M. Paterson
Venue:  (2001)

Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. They considered the family of "cautious" ergodic Markov chains with uniform stationary distribution and showed that, for every fixed connected "nontrivial" graph H, every such chain mixes slowly. In this paper, we give a complexity result for the problem. Namely, we show that for any fixed graph H with no trivial components, there is unlikely to be any Polynomial Almost Uniform Sampler (PAUS) for H-colourings. We show that if there were a PAUS for the H-colouring problem, there would also be a PAUS for sampling independent sets in bipartite graphs and, by the self-reducibility of the latter problem, there would be a Fully-Polynomial Randomised Approximation Scheme (FPRAS) for #BIS - the problem of counting independent sets in bipartite graphs. Dyer, Goldberg, Greenhill and Jerrum have shown that #BIS is complete in a certain logically-defined complexity class. Thus, a PAUS for sampling H-colourings would give an FPRAS for the entire complexity class. In order to achieve our result we introduce the new notion of sampling-preserving reduction which seems to be more useful in certain settings than approximation-preserving reduction.
An Empirical Study of the Object-Oriented Paradigm and Software Reuse
Authors: John A. Lewis, Sallie M. Henry, Dennis G. Kafura, Robert S. Schulman
Venue:  (1992)

This paper describes the preliminary results of a controlled experiment designed to evaluate the impact of the object-oriented paradigm on software reuse. The experiment concludes that (1) the object-oriented paradigm substantially improves productivity, although a significant part of this improvement is due to the effect of reuse, (2) reuse without regard to language paradigm improves productivity, (3) language differences are far more important when programmers reuse than when they do not, and (4) the object-oriented paradigm has a particular affinity to the reuse process.
Successive Orthogonal Projections for Exact Computation of Minimal Norm Solution of Inconsistent and Rank-Defficient Least-Squares
Authors: C. Popa
Venue:  (1996)

In the present paper we present a direct method for computation of the minimal norm solution of generally (inconsistent and rank-defficient) least-squares problems.The method is based on the classical Kaczmarz''s iterative algorithm to which we attach a set of new directions for projection.The practical construction of these new directions together with comments concerning computational aspects are also presented ,in the last section of the paper. 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
Optimization of Phoneme-Based Codebook in a DHMM System
Authors: Yaxin Zhang, Roberto Togneri, Christopher J.S. deSilva, Mike Alder
Venue:  (1994)

A phoneme-based Gaussian mixture VQ codebook can improve the conventional DHMM system performance significantly. In this paper, an optimization method for the phoneme-based VQ codebook is proposed. The experimental results shown that the optimized phoneme-based VQ codebookleads to both the improvement of system performance and the reduction of system complexity.
The next generation of internet portals
Authors: Ali Jafari
Venue: Designing portals: opportunities and challenges (2003)

Today's portals bring together existing technologies in useful, innovative ways, but they don't scratch the surface of what is possible. The constant build-up of information and resources on the World Wide Web demands a smarter more advanced portal technology that offers dynamic, personalized, customized, and intelligent services. This chapter discusses next-generation portals and the requirement that they come to know their users and understand their individual interests and preferences. It describes a new generation of portals that have a level of autonomy, making informed, logical decisions and performing useful tasks on behalf of their members. The chapter highlights the role of artificial intelligence in framing the next generation of portal technology and in developing their capabilities for learning about their users.
New technology - great opportunities
Authors: Ilia Bider, Maxim Khomyakov
Venue: Enterprise information systems IV (2003)

Full exploitation of a new computer technology, Internet in particularly, is impossible to achieve without redesigning the business to align it with the new technology. One of the most important tasks of such redesign is reengineering of business processes. Implementation of more effective processes is impossible without a proper computer support. A computer system that is aimed to support business processes, e.g., workflow management system, possesses a number of properties that are different from the properties of traditional business information systems. The modeling techniques widely used for traditional system development might not be appropriate for the development of computerized support for business processes, new modeling techniques should be considered for this end. A possible approach to creating such a technique is presented in the paper. It is based on defining interactions without explicit communication. Interaction is realized via active relationships that can propagate changes from one object to another. Based on this idea, which comes from the previous research work of the authors, the paper discusses the issues of introducing "harnesses" on the interactive behavior, finding the right place for the end-users in the model, and modeling distribution of tasks between different users.
A History of Discrete Event Simulation Programming Languages
Authors: Richard E. Nance
Venue:  (1993)

The history of simulation programming languages is organized as a progression in periods of similar developments. The five periods, spanning 1955-1986, are labeled: The Period of Search (1955-1960); The Advent (1961-1965); The Formative Period (1966-1970); The Expansional Period (1971-1978); and The Period of Consolidation and Regeneration (1979-1986). The focus is on recognizing the people and places that have made important contributions in addition to the nature of the contribution. A balance between comprehensive and in-depth treatment has been reached by providing more detailed description of those languages which have or have had major use. Over 30 languages are mentioned, and numerous variations are described in the major contributors. A concluding summary notes the concepts and techniques either originating with simulation programming languages or given significant visibility by them. 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
On Pseudo-Similar Vertices in Trees
Authors: David G. Kirkpatrick, Maria M. Klawe, D. G. Corneil
Venue:  (1981)

Two dissimilar vertices $u$ and $v$ in a graph $G$ are said to be pseudo-similar if $G \backslash u \cong G \backslash v$. A characterization theorem is presented for trees (later extended to forests and block-graphs) with strictly pseudo-similar (i.e. pseudo-similar but dissimilar) vertices. It follows from this characterization that it is not possible to have three or more mutually strictly pseudo-similar vertices in trees. Furthermcre, pseudo-similarity combined with an extension of pseudo-similarity to include the removal of first neighbourhoods of vertices is sufficient to imply similarity in trees. Neither of these results holds if we replace trees by arbitrary graphs.
Globally Convergent Homotopy Methods for Large Scale Engineering Optimization
Authors: Layne T. Watson
Venue:  (1989)

Probability-one homotopy methods are a class of algorithms for solving nonlinear systems of equations that are accurate, robust, and converge from an arbitrary starting point almost surely. These new globally convergent homotopy techniques have been successfully applied to solve Brouwer fixed point problems, polynomial systems of equations, discretizations of non- linear two-point boundary value problems based on shooting, finite differences, collocation, and finite elements, and finite difference, collocation, and Galerkin approximations to nonlinear partial differential equations. This paper surveys the basic theory of globally convergent homotopy algorithms, describes some computer algorithms and mathematical software, applies homotopy theory to unconstrained and constrained optimization, and presents two realistic engineering applications (optimal design of composite laminated plates and fuel-optimal orbital satellite maneuvers ).
Analytical Modeling of Set-Associative Cache Behaviour
Authors: John S. Harper, Darren J. Kerbyson, Graham R. Nudd
Venue:  (1998)

Cache behavior is complex and inherently unstable, yet is a critical factor affecting program performance. A method of evaluating cache performance is required, both to give quantitative predictions of miss-ratio, and information to guide optimization of cache use. Traditional cache simulation gives accurate predictions of miss-ratio, but little to direct optimization. Also, the simulation time is usually far greater than the program execution time. Several analytical models have been developed, but concentrate mainly on direct-mapped caches, often for specific types of algorithm, or to give qualitative predictions. In this work novel analytical models of cache phenomena are presented, applicable to numerical codes consisting mostly of array operations in looping constructs. Set-associative caches are considered, through an extensive hierarchy of cache reuse and interference effects, including numerous forms of temporal and spatial locality. Models of each effect are given, which, when combined, predict the overall miss-ratio. An advantage is that the models also indicate sources of cache interference. The accuracy of the models is validated through example program fragments. The predicted miss-ratios are compared with simulations, and shown typically to be within fifteen percent. The evaluation time of the models is shown to be independent of the problem size, typically several orders of magnitude faster than simulation.
Techniques for Accurate, Accelerated Processor Simulation: Analysis of Reduced Inputs and Sampling
Authors: Jr Haskins, K. Skadron, AJ KleinOsowski, D. J. Lilja
Venue:  (2002)

Detailed execution-driven simulation is an important tool for computer architecture research. It is desirable to drive these simulations with standard benchmark programs that are commonly used to evaluate existing computer systems, such as the SPEC2000 suite. Unfortunately, simulating these benchmark programs to completion using full-detail, cycle-accurate simulation on the designated reference input sets results in intractably long simulation durations. This study evaluates and compares two techniques for combating long simulation times: reduced inputs and sampling. Our objective is to assess the ability of each to reduce simulation running times, while simultaneously minimizing the difference in the results generated by using these techniques relative to the results generated by simulating the benchmark programs to completion using the reference inputs. With the reduced input technique, new input sets are carefully generated by hand to produce run-time characteristics of the benchmark programs that are comparable to the overall characteristics produced when the programs are run with the standard inputs. Sampling, on the other hand, simulates only a small fraction of the program''s overall execution in full, cycle-accurate detail using the reference inputs.