ppxscal/embedding_network huggingface dataset:
Control-Sensitive Feature Selection for Lazy Learners
Authors: Fedro Domingos
Venue: Artificial Intelligence Review (1997)

High sensitivity to irrelevant features is arguably the main shortcoming of simple lazy learners. In response to it, many feature selection methods have been proposed, including forward sequential selection (FSS) and backward sequential selection (BSS). Although they often produce substantial improvements in accuracy, these methods select the same set of relevant features everywhere in the instance space, and thus represent only a partial solution to the problem. In general, some features will be relevant only in some parts of the space; deleting them may hurt accuracy in those parts, but selecting them will have the same effect in parts where they are irrelevant. This article introduces RC, a new feature selection algorithm that uses a clustering-like approach to select sets of locally relevant features (i.e., the features it selects may vary from one instance to another). Experiments in a large number of domains from the UCI repository show that RC almost always improves accuracy with respect to FSS and BSS, often with high significance. A study using artificial domains confirms the hypothesis that this difference in performance is due to RC&lsquo;s context sensitivity, and also suggests conditions where this sensitivity will and will not be an advantage. Another feature of RC is that it is faster than FSS and BSS, often by an order of magnitude or more.
Estimating The Support Of A Scaling Vector
Authors: Wasin So, Jianzhong Wang
Venue: SIAM Journal on Matrix Analysis and Applications (1997)

An estimate is given for the support of each component function of a compactly supported scaling vector satisfying a matrix refinement equation with finite number of terms. The estimate is based on the highest and lowest degrees of each polynomial in the corresponding matrix symbol. Only basic techniques from matrix theory are involved in the derivation.
Shadow Prices in Infinite-Dimensional Linear Programming
Authors: H. Edwin Romeijn, Robert L. Smith
Venue: Mathematics of Operations Research (1998)

We consider the class of linear programs that can be formulated with infinitely many variables and constraints but where each constraint has only finitely many variables. This class includes virtually all infinite horizon planning problems modeled as infinite stage linear programs. Examples include infinite horizon production planning under time-varying demands and equipment replacement under technological change. We provide, under a regularity condition, conditions that are both necessary and sufficient for strong duality to hold. Moreover we show that, under these conditions, the Lagrangean function corresponding to any pair of primal and dual optimal solutions forms a linear support to the optimal value function, thus extending the shadow price interpretation of an optimal dual solution to the infinite dimensional case. We illustrate the theory through an application to production planning under time-varying demands and costs where strong duality is established.
A Number Theoretic Conjecture and the Existence of S&ndash;Cyclic Steiner Quadruple Systems
Authors: Helmut Siemon
Venue: Designs, Codes and Cryptography (1998)

In their survey article on cyclic Steiner Quadruple Systems SQS(v) M. J. Grannel and T. S. Griggs advanced the conjecture (cf. [8, p. 412]) that their necessary condition for the existence of S-cyclic SQS(v) (cf. [7, p. 51]) is also sufficient. Some years prior to that E. K&ouml;hler [10] used a graph theoretical method to construct S-cyclic SQS(v). This method was extended in [17]-[20] and eventually used to reduce the conjecture of Grannel and Griggs to a number theoretic claim (cf. also [21], research problem 146). The main purpose of the present paper is to attack this claim. For the long intervals we have to distinguish four cases. The proof of cases I&ndash;III can be accomplished by a thorough study of how the multiples of a certain set belonging to the first column of a certain matrix (the elements of which are essentially the vertices of a graph corresponding to SQS(2p)) are distributed over the columns. The proof is by contradiction. Case IV is most difficult to treat and could only be dealt with by very deep lying means. We have to use an asymptotic formula on the number of lattice points (x,y) with xy &equiv; 1 mod p (we speak of 1-points) in a rectangle and this formula shows that the 1-points are equidistributed. But even so our claim could not be proved for all intervals of admissible length. Intervals [a,b] with ^p&mdash;_m+1 <a <b < ^p&minus;_m for some m and 3&radic;4 p <b&minus;a <p ^11&minus;15 could not be covered. In the last section we discuss some conclusions which would follow from the non-existence of complete intervals.
A simulation of the evacuation of American citizens with an object-oriented, animated model
Authors: Jeffrey E. Sumner, Eric A. Zahn
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This paper highlights a model developed by TASC, Inc. under contract to the Defense Advanced Research Projects Agency (DARPA). This project models and simulates an evacuation of American citizens and other important foreign nationals from a destabilized foreign country by utilizing available U.S. military resources. This project demonstrates how different evacuation plans can quickly be compared analytically through computer simulation. The software chosen for the simulation and analysis is the Integrated Model Development Environment (IMDE), an object-oriented discrete-event simulation package. The implementation of the model features reconfigurable mission plans and detailed simulation-independent animations. This model was demonstrated at the 1995 Joint Warfare Interoperability Demonstration (JWID).
Locality and Adjacency Stability Constraints for MorphologicalConnected Operators
Authors: José Crespo, Ronald W. Schafer
Venue: Journal of Mathematical Imaging and Vision (1997)

This paper investigates two constraints for the connected operator class. For binary images, connected operators are those that treat grains and pores of the input in an all or nothing way, and therefore they do not introduce discontinuities. The first constraint, called connected-component (c.c.) locality, constrains the part of the input that can be used for computing the output of each grain and pore. The second, called adjacency stability, establishes an adjacency constraint between connected components of the input set and those of the output set. Among increasing operators, usual morphological filters can satisfy both requirements. On the other hand, some (non-idempotent) morphological operators such as the median cannot have the adjacency stability property. When these two requirements are applied to connected and idempotent morphological operators, we are lead to a new approach to the class of filters by reconstruction. The important case of translation invariant operators and the relationships between translation invariance and connectivity are studied in detail. Concepts are developed within the binary (or set) framework; however, conclusions apply as well to flat non-binary (gray-level) operators.
Lambda-dropping: transforming recursive equations into programs with block structure
Authors: Olivier Danvy, Ulrik P. Schultz
Venue: ACM SIGPLAN Notices (1997)

Lambda-lifting a functional program transforms it into a set of recursive equations. We present the symmetric transformation: lambda-dropping. Lambda-dropping a set of recursive equations restores block structure and lexical scope.For lack of scope, recursive equations must carry around all the parameters that any of their callees might possibly need. Both lambda-lifting and lambda-dropping thus require one to compute a transitive closure over the call graph: bull; for lambda-lifting: to establish the Def/Use path of each free variable (these free variables are then added as parameters to each of the functions in the call path); bull; for lambda-dropping: to establish the Def/Use path of each parameter (parameters whose use occurs in the same scope as their definition do not need to be passed along in the call path).Without free variables, a program is scope-insensitive. Its blocks are then free to float (for lambda-lifting) or to sink (for lambda-dropping) along the vertices of the scope tree.We believe lambda-lifting and lambda-dropping are interesting per se, both in principle and in practice, but our prime application is partial evaluation: except for Malmkj aelig;r and Oslash;rb aelig;k's case study presented at PEPM '95, most polyvariant specializers for procedural programs operate on recursive equations. To this end, in a pre-processing phase, they lambda-lift source programs into recursive equations, As a result, residual programs are also expressed as recursive equations, often with dozens of parameters, which most compilers do not handle efficiently. Lambda-dropping in a post-processing phase restores their block structure and lexical scope thereby significantly reducing both the compile time and the run time of residual programs.
Off-Line, Handwritten Numeral Recognition by Perturbation Method
Authors: Thien M. Ha, Horst Bunke
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

This paper presents a new approach to off-line, handwritten numeral recognition. From the concept of perturbation due to writing habits and instruments, we propose a recognition method which is able to account for a variety of distortions due to eccentric handwriting. We tested our method on two worldwide standard databases of isolated numerals, namely, CEDAR and NIST, and obtained 99.09 percent and 99.54 percent correct recognition rates at no-rejection level, respectively. The latter result was obtained by testing on more than 170,000 numerals.
Closing the gap between simulation combat computer systems
Authors: Roger D. Smith
Venue: Proceedings of the 28th conference on Winter simulation (1996)

As simulations have evolved, interoperability between them has emerged as a fundamental technique for increasing their applicability and minimizing the cost of development and maintenance. From totally independent systems, through manual interfaces, automated interfaces, messaging standards, control standards, and architectural standards - the field has been transformed from a set of independent programs into a loose confederation working together to maximize each others contributions. The next step in this evolution is the inclusion of real-world combat computers in the simulation federations, particularly command and control computers. This paper will define the steps that must be taken to support this integration with a large number of simulation systems. It will explore interoperability projects that are taking place within the simulation and C41 system communities, describing architectures such as the simulation High Level Architecture, the Modular Reconfigurable C41 Interface, the Defense Information Infrastructure Common Operating Environment, and the Joint Military Command and Information System. Interoperability methods for the generic integration of systems built to a common architecture will be proposed and some argument given to its viability.
On generating a hierarchy for GSPN analysis
Authors: Peter Buchholz, Peter Kemper
Venue: ACM SIGMETRICS Performance Evaluation Review (1998)

This paper examines the (semi) automatic generation of a hierarchical structure for generalized stochastic Petri nets (GSPNs). The idea is to partition a GSPN automatically into a set of components with asynchronous communication. Net level results obtained by invariant computation for these subnets are used to define a macro description of the internal state. This yields a hierarchical structure which is exploited in several efficient analysis algorithms. These algorithms include reachability set/graph generation, structured numerical analysis techniques and approximation techniques based on decomposition and aggregation. A GSPN model of an existing production cell and its digital control is analyzed to demonstrate usefulness of the approach.
Determinant of the Sum of a Symmetric and a Skew-Symmetric Matrix
Authors: Natália Bebiano, Chi-Kwong Li
Venue: SIAM Journal on Matrix Analysis and Applications (1997)

The set of all possible determinant values of the sum of a (complex) symmetric matrix and a skew-symmetric matrix with prescribed singular values is determined. This set can also be viewed as the best containment region for the determinant of a square matrix $X$ in terms of the singular values of its symmetric and skew-symmetric parts. The technique is extended to study the principal minors of $X$. Similar problems for real matrices are considered.
Systematic realisation of control flow analyses for CML
Authors: Kirsten L. Solberg Gasser, Flemming Nielson
Venue: Proceedings of the second ACM SIGPLAN international conference on Functional programming (1997)

We present a methodology for the systematic realisation of control flow analyses and illustrate it for Concurrent ML. We start with an abstract specification of the analysis that is next proved semantically sound with respect to a traditional small-step operational semantics; this result holds for terminating w well as non-terminating programs. The analysis is defined coinductively and it is shown that all programs have a least analysis result (that is indeed the best one). To realise the analysis we massage the specification in three stages: (i) to explicitly record reachability of subexpressions, (ii) to be defined in a syntax-directed manner, and (iii) to generate a set of constraints that subsequently can be solved by standard techniques. We prove equivalence results between the different versions of the analysis; in particular it follows that the least solution to the constraints generated will be the least analysis result also to the initial specification.
Learning bias and phonological-rule induction
Authors: Daniel Gildea, Daniel Jurafsky
Venue: Computational Linguistics (1996)

A fundamental debate in the machine learning of language has been the role of prior knowledge in the learning process. Purely nativist approaches, such as the Principles and Parameters model, build parameterized linguistic generalizations directly into the learning system. Purely empirical approaches use a general, domain-independent learning rule (Error Back-Propagation, Instance-based Generalization, Minimum Description Length) to learn linguistic generalizations directly from the data.In this paper we suggest that an alternative to the purely nativist or purely empiricist learning paradigms is to represent the prior knowledge of language as a set of abstract learning biases, which guide an empirical inductive learning algorithm. We test our idea by examining the machine learning of simple Sound Pattern of English (SPE)-style phonological rules. We represent phonological rules as finite-state transducers that accept underlying forms as input and generate surface forms as output. We show that OSTIA, a general-purpose transducer induction algorithm, was incapable of learning simple phonological rules like flapping. We then augmented OSTIA with three kinds of learning biases that are specific to natural language phonology, and that are assumed explicitly or implicitly by every theory of phonology: faithfulness (underlying segments tend to be realized similarly on the surface), community (similar segments behave similarly), and context (phonological rules need access to variable in their context). These biases are so fundamental to generative phonology that they are left implicit in many theories. But explicitly modifying the OSTIA algorithm with these biases allowed it to learn more compact, accurate, and general transducers, and our implementation successfully learns a number of rules from English and German. Furthermore, we show that some of the remaining errors in our augmented model are due to implicit biases in the traditional SPE-style rewrite system that are not similarly represented in the transducer formalism, suggesting that while transducers may be formally equivalent to SPE-style rules, they may not have identical evaluation procedures.Because our biases were applied to the learning of very simple SPE-style rules, and to a non-psychologically-motivated and nonprobabilistic theory of purely deterministic transducers, we do not expect that our model as implemented has any practical use as a phonological learning device, nor is it intended as a cognitive model of human learning. Indeed, because of the noise and nondeterminism inherent to linguistic data, we feel strongly that stochastic algorithms for language induction are much more likely to be a fruitful research direction. Our model is rather intended to suggest the kind of biases that may be added to other empiricist induction models, and the way in which they may be added, in order to build a cognitively and computationally plausible learning model for phonological rules.
Characteristic Sets for Polynomial Grammatical Inference
Authors: Colin De La Higuera
Venue: Machine Learning (1997)

When concerned about efficient grammatical inference two issues are relevant: the first one is to determine the quality of the result, and the second is to try to use polynomial time and space. A typical idea to deal with the first point is to say that an algorithm performs well if it infers {\it in\ the\ limit} the correct language. The second point has led to debate about how to define polynomial time: the main definitions of polynomial inference have been proposed by Pitt and Angluin. We return in this paper to a definition proposed by Gold that requires a characteristic set of strings to exist for each grammar, and this set to be polynomial in the size of the grammar or automaton that is to be learned, where the size of the sample is the sum of the lengths of all strings it includes. The learning algorithm must also infer correctly as soon as the characteristic set is included in the data. We first show that this definition corresponds to a notion of teachability as defined by Goldman and Mathias. By adapting their teacher/learner model to grammatical inference we prove that languages given by context-free grammars, simple deterministic grammars, linear grammars and nondeterministic finite automata are not identifiable in the limit from polynomial time and data.
A comparison between standardized time series and overlapping batched means
Authors: David Goldsman, Marc S. Meketon
Venue: Proceedings of the 17th conference on Winter simulation (1985)

We study several methods for estimating the variance of the sample mean from a stationary stochastic process. Particular emphasis is placed on comparing the recently introduced methods of standardized time series and overlapping batched means. Comparison criteria include estimator bias and variance.
Unification of budgeting and placement
Authors: Majid Sarrafzadeh, David Knol, Gustavo Tellez
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

In this paper we present a novel formulation for thenet-based timing-driven placement problem.The new formulationperforms budgeting (net delay upper bounds) andplacement modification simultaneously thus alleviates theproblem of going back-and-forth between budgeting andplacement.An algorithm to accomplished the proposedtask is presented.The proposed algorithm uses a simulatedannealing approach and a modified graph-based simplexmethod.A general formulation of timing-sriven placementis presented.It is proved that both net-based andpath-based approaches to timing-driven placement are specialcases of a more general formulation.The proposed algorithmhas been incorporated into a (timing-driven) placementpackage.Experiments on MCNC benchmarks showstrong results.The proposed algorithm offers 54% to 68%reduction over the longest path compared with the existingalgorithms.
Transmission policies and traffic management in multimedia wireless networks
Authors: Anthony Burrell, Harold P. Stern, P. Papantoni-Kazakos
Venue: Wireless Networks (1997)

We consider multimedia wireless networks in environments where traffic characterizations and traffic rates are generally time-varying. For such networks we propose a CDMA transmission policy, in conjunction with a moving boundaries concept induced by a traffic monitoring high-level protocol. The proposed transmission/traffic management technique is analyzed and numerically evaluated.
A performance analysis model for distributed simulations
Authors: David B. Cavitt, C. Michael Overstreet, Kurt J. Maly
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Distributed simulation has proved to be a cost effective technique for studying and understanding complex real world systems. Many distributed simulations need to incorporate hundreds or even thousands of processors, across both local and wide area networks. As the size and complexity of distributed simulations increase so do the demands on the hardware and software resources that provide simulation services, causing performance bottlenecks that limit the effectiveness of distributed simulation. Different abstractions of performance are needed depending on who is analyzing the distributed simulation and for what reason. This paper proposes a framework for identifying the factors affecting performance and provides a technique for associating the performance factors with high-level system metrics that describe the behavior of the physical and logical resources and services used in the design and implementation of distributed simulations. Dynamic and static analysis of the performance information provides feedback on the execution of the simulation and can provide meaningful information as a guide in making decisions about the configuration and control of the available hardware and software resources for distributed simulation exercises.
IOTA: a full text information retrieval system
Authors: Y. Chiaramella, B. Defude, M. F. Bruandet, D. Kerkouba
Venue: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval (1986)

IOTA is a prototype of an Information Retrieval System which can manage a corpus made of highly structured, full text documents. The first version presented here has intelligent capabilities related to heuristic pattern matching procedures for processing natural language queries, which involve an automatically built thesaurus. The paper emphazises the overall principles of query processing and gives hints about the underlying techniques used while constructing the thesaurus and automatically indexing highly structured documents.
Deleting the rightmost bottommost leaf of a heap
Authors: Alan F. Lewit
Venue: 3C ON-LINE (1997)

I am presently teaching a sophomore level course in Data Structures and I am using an excellent text by Thomas A. Standish. In a section entitled An Application - Heaps and Priority Queues, a strategy is offered for fetching the value of the highest priority item at the root of a tree and replacing the roots value with the value of the rightmost leaf on the bottom row. After the value of this rightmost leaf is obtained and placed in the root, that node is deleted.