ppxscal/embedding_network huggingface dataset:
A Generalized Hilbert Matrix Problem and Confluent Chebyshev--Vandermonde Systems
Authors: Hao Lu
Venue: SIAM Journal on Matrix Analysis and Applications (1998)

This paper deals with fast solution of the generalized Hilbert matrix problem and confluent Chebyshev--Vandermonde systems. First, two methods for the generalized Hilbert matrix problem are presented. One is for the case where the points involved in the generalized Hilbert matrices satisfy a TH-relation introduced in the present paper, which include equidistant points, clustered points, and Chebyshev points. The approach is based on an O(n log n) fast multiplication of a Toeplitz plus Hankel matrix with a vector. The other method is to reduce the generalized Hilbert matrix problem to products of confluent Vandermonde-like matrices and dual confluent Vandermonde-like matrices with vectors by using J-matches and links of polynomials. Second, two strategies for confluent Chebyshev--Vandermonde systems are considered. Based on the result of the solution of confluent Vandermonde-like systems, the solution of confluent Chebyshev--Vandermonde systems for Chebyshev $\sigma$-points, i.e., the zeros of $T(\lambda)-\sigma$ with $|\sigma|O(n log n) algorithms for the systems. The solution of Chebyshev--Vandermonde systems is also reduced to the generalized Hilbert matrix problem by using J-matches, links of Chebyshev polynomials, and the inversion of a class of generalized Hilbert matrices. This yields an O(n log n) algorithm for Chebyshev--Vandermonde systems for another class of practical points. Third, the results obtained are applied to related problems, for example, confluent Chebyshev--Vandermonde systems for near Chebyshev $\sigma$-points, Hermite interpolation in terms of Chebyshev polynomials, and a class of generalized Hilbert systems. Finally, numerical examples show quite accurate results even for large systems of equations.
Evaluating Testing Methods by Delivered Reliability
Authors: Phyllis G. Frankl, Richard G. Hamlet, Bev Littlewood, Lorenzo Strigini
Venue: IEEE Transactions on Software Engineering (1998)

There are two main goals in testing software: 1) to achieve adequate quality (debug testing); the objective is to probe the software for defects so that these can be removed and 2) to assess existing quality (operational testing); the objective is to gain confidence that the software is reliable. The names are arbitrary, and most testing techniques address both goals to some degree. However, debug methods tend to ignore random selection of test data from an operational profile, while for operational methods this selection is all-important. Debug methods are thought, without any real proof, to be good at uncovering defects so that these can be repaired, but having done so they do not provide a technically defensible assessment of the reliability that results. On the other hand, operational methods provide accurate assessment, but may not be as useful for achieving reliability. This paper examines the relationship between the two testing goals, using a probabilistic analysis. We define simple models of programs and their testing, and try to answer theoretically the question of how to attain program reliability: Is it better to test by probing for defects as in debug testing, or to assess reliability directly as in operational testing, uncovering defects by accident, so to speak? There is no simple answer, of course. Testing methods are compared in a model where program failures are detected and the software changed to eliminate them. The "better" method delivers higher reliability after all test failures have been eliminated. This comparison extends previous work, where the measure was the probability of detecting a failure. Revealing special cases are exhibited in which each kind of testing is superior. Preliminary analysis of the distribution of the delivered reliability indicates that even simple models have unusual statistical properties, suggesting caution in interpreting theoretical comparisons.
Two Remarks on Blocking Sets and Nuclei in Planes of Prime Order
Authors: András Gács, Péter Sziklai, Tamás Szhonyi
Venue: Designs, Codes and Cryptography (1997)

In this paper we characterize a sporadic non-R&eacute;dei type blocking set of PG (2,7) having minimum cardinality, and derive an upper bound for the number of nuclei of sets in PG (2,q) having less than q+1 points. Our methods involve polynomials over finite fields, and work mainly for planes of prime order.
Perfect Mendelsohn Packing Designs with Block Size Five
Authors: F. E. Bennett, J. Yin, H. Zhang, R. J. R. Abel
Venue: Designs, Codes and Cryptography (1998)

A (v, k, 1) perfect Mendelsohn packing design (briefly (v, k, 1)-PMPD) is a pair (X, A) where X is a v-set (of points) and A is a collection of cyclically ordered k-subsets of X (called blocks) such that every ordered pair of points of X appears t-apart in at most one block of A for all t = 1, 2, &hellip;, k-1. If no other such packing has more blocks, the packing is said to be maximum and the number of blocks in a maximum packing is called the packing number, denoted by P(v, k, 1). The values of the function P(v, 5, 1) are determined here for all v &ge;5 with a few possible exceptions. This result is established by means of a result on incomplete perfect Mendelsohn designs which is of interest in its own right.
AutoStat: output statistical analysis for AutoMod users
Authors: John S. Carson,  II
Venue: Proceedings of the 28th conference on Winter simulation (1996)

AutoStat/sup TM/ is an extension package for AutoMod/sup TM/ and AutoSched/sup TM/ models that provides complete support for simulation model experimentation and statistical analysis of outputs. Within a menu-driven, point and click environment, AutoStat provides assistance for setting up runs, automated execution of runs and consolidation of outputs across replications and scenarios. AutoStat automatically sets random number seeds to achieve statistically independent replications; it also sets factor levels (input parameters) to realize desired scenarios, without having to modify the underlying model. AutoStat has a number of advanced features such as datafile factors, responses (or performance measures) read from custom user output files, and user-defined combination responses (linear combinations of other responses). AutoStat offers several statistical methods, including confidence intervals, a ranking and selection procedure, design of experiments, and warm-up determination. Outputs can be displayed and printed in tabular and graphical formats and exported to spreadsheet and other analysis software. AutoStat saves simulation modelers considerable time and automates the effort of setting up and making runs, managing the input and output files, consolidating results and conducting analyses.
A Scalable Parallel Interior Point Algorithm for Stochastic Linear Programmingand Robust Optimization
Authors: Dafeng Yang, Stavros A. Zenios
Venue: Computational Optimization and Applications (1997)

We present a computationally efficient implementation of an interior point algorithm for solving large-scale problems arising in stochastic linear programming and robust optimization. A matrix factorization procedure is employed that exploits the structure of the constraint matrix, and it is implemented on parallel computers. The implementation is perfectly scalable. Extensive computational results are reported for a library of standard test problems from stochastic linear programming, and also for robust optimization formulations. The results show that the codes are efficient and stable for problems with thousands of scenarios. Test problems with 130 thousand scenarios, and a deterministic equivalent linear programming formulation with 2.6 million constraints and 18.2 million variables, are solved successfully.
A generic architecture for intelligent instruction for simulation modelling software packages
Authors: Tajudeen A. Atolagbe, Vlatka Hlupic
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This paper describes an architecture for an intelligent interactive instructional simulation modelling environment. It revolves around the production of tutorial and courseware authoring for different simulation software packages with a generic user interface shell. The generic shell is a 'front end' which provides a uniform graphical user interface to diverse simulation modelling software tutorials. An object oriented perspective is combined with tutorial activities based on the task classification structure to form the interactions between objects. The development environment brings together objects that are functionally coherent and allows them to share common resources within the shell.
Architectural Synthesis of Digital Signal ProcessingAlgorithms Using &ldquo;IRIS&rdquo;
Authors: D. W. Trainor, R. F. Woods, J. V. McCanny
Venue: Journal of VLSI Signal Processing Systems (1997)

In this paper, we present the IRIS architectural synthesis system for high-performance digital signal processing. This tool allows non-specialists to automatically derive VLSI circuit architectures from high-level, algorithmic representations, and provides a quick route to silicon implementation. By incorporating a novel synthesis methodology, called the Modular Design Procedure, within the IRIS system, parameterised models of complex and innovative DSP hardware can be derived and automatically assembled to create new DSP systems. The nature of this synthesis methodology is such that designers can explore a large range of architectural alternatives, whilst considering all the architectural implications of using specific hardware to realise the circuit. The applicability of IRIS is demonstrated using the design examples of a second order Infinite Impulse Response filter and a one-dimensional Discrete Cosine Transform circuit.
Distributed interactive simulation: its past, present, and future
Authors: Deborah A. Fullford
Venue: Proceedings of the 28th conference on Winter simulation (1996)

In the mid 1980's the U.S. Department of Defense, Defense Advanced Research Projects Agency (DARPA) launched the SIMNET project, which gave birth to a technology era and networking protocol presently known as Distributed Interactive Simulation (DIS). The DIS Protocol is a widely used IEEE Standard. At first it was primarily used by the military for mission rehearsal, training, and weapon evaluations. Today, other areas, such as transportation, medical care, entertainment, Internet commerce, and manufacturing, are using DIS complaint siniulations to meet their needs. This paper will provide a detailed overview of DIS. It will focus on the fundamental concepts, such as peer to peer connectivity, protocol data units, and dead reckoning. It will also cover some advanced topics, such as smoothing for visualization and shared virtual environments. Finally, this paper will discuss the future of DIS. In particular, MaK will discuss the next generation DIS, otherwise known as the High Level Architecture (HLA), new protocols, and bandwidth reduction techniques.
One-time complete indexing of text: theory and practice
Authors: Raymond J. D'Amore, Clinton P. Mah
Venue: Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval (1985)

Indexing according to occurrences of selected word fragments, called &ldquo;n-grams&rdquo;, offers a significant alternative to keyword indexing and full text scanning methods in the design of information systems based on documents. Finite sets of n-grams can be selected to allow effective fixed indexing of all words, numbers, and special terms in text. The characteristics of such indexing can be modeled statistically and validated over a wide range of text. The model provides a descriptive and predictive tool for controlling precision and recall in searching and for scaling estimates of relevance to an adaptive reference noise distribution for a target collection. Special techniques such as partial inversion of index terms, probabilistic ordering of index terms, and various types of data compression allow n-gram indexing to be competitive in performance with other approaches.
OGDI: toward interoperability among geospatial databases
Authors: Gilles Clément, Christian Larouche, Denis Gouin, Paul Morin, Henry Kucera
Venue: ACM SIGMOD Record (1997)

The growth of the geomatics industry is stunted by the difficulty of obtaining and transforming suitable spatial data. This paper describes a remedy: the Open Geospatial Datastore Interface (OGDI), which permits application software to access a variety of spatial data products. The discussion compares the OGDI approach to other standards efforts and describes the characteristics and use of OGDI, which is in the public domain.
Object type oriented data modeling for VLSI data management
Authors: P. van der Wolf, T. G. R. van Leuken
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

A Data Management System (DMS) for VLSI design is presented that supports hierarchical decomposition, multiple levels of abstraction, concurrency control and design evolution. Our contribution is original in that we employ semantic data modeling techniques to derive a simple, yet powerful, data schema that represents the logical organization of VLSI design data. The resulting DMS provides an open framework for the integration of design tools and relieves the designer of the burden of organizing his design data.
Rotation Invariant Texture Features and Their Use in Automatic Script Identification
Authors: T. N. Tan
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1998)

This paper concerns the extraction of rotation invariant texture features and the use of such features in script identification from document images. Rotation invariant texture features are computed based on an extension of the popular multi-channel Gabor filtering technique, and their effectiveness is tested with 300 randomly rotated samples of 15 Brodatz textures. These features are then used in an attempt to solve a practical but hitherto mostly overlooked problem in document image processing¿the identification of the script of a machine printed document. Automatic script and language recognition is an essential front-end process for the efficient and correct use of OCR and language translation products in a multilingual environment. Six languages (Chinese, English, Greek, Russian, Persian, and Malayalam) are chosen to demonstrate the potential of such a texture-based approach in script identification.
Consistency Algorithms for Multi-Source Warehouse View Maintenance
Authors: Yue Zhuge, Hector Garcia-Molina, Janet L. Wiener
Venue: Distributed and Parallel Databases (1998)

A warehouse is a data repository containing integrated information for efficient querying and analysis. Maintaining the consistency of warehouse data is challenging, especially if the data sources are autonomous and views of the data at the warehouse span multiple sources. Transactions containing multiple updates at one or more sources, e.g., batch updates, complicate the consistency problem. In this paper we identify and discuss three fundamental transaction processing scenarios for data warehousing. We define four levels of consistency for warehouse data and present a new family of algorithms, the Strobe family, that maintain consistency as the warehouse is updated, under the various warehousing scenarios. All of the algorithms are incremental and can handle a continuous and overlapping stream of updates from the sources. Our implementation shows that the algorithms are practical and realistic choices for a wide variety of update scenarios.
Efficient Pose Clustering Using a Randomized Algorithm
Authors: Clark F. Olson
Venue: International Journal of Computer Vision (1997)

Pose clustering is a method to perform object recognition by determining hypothetical object poses and finding clusters of the poses in the space of legal object positions. An object that appears in an image will yield a large cluster of such poses close to the correct position of the object. If there are m model features and n image features, then there are O(m^3n^3) hypothetical poses that can be determined from minimal information for the case of recognition of three-dimensional objects from feature points in two-dimensional images. Rather than clustering all of these poses, we show that pose clustering can have equivalent performance for this case when examining only O(mn) poses, due to correlation between the poses, if we are given two correct matches between model features and image features. Since we do not usually know two correct matches in advance, this property is used with randomization to decompose the pose clustering problem into O(n^2) problems, each of which clusters O(mn) poses, for a total complexity of O(mn^3) . Further speedup can be achieved through the use of grouping techniques. This method also requires little memory and makes the use of accurate clustering algorithms less costly. We use recursive histograming techniques to perform clustering in time and space that is guaranteed to be linear in the number of poses. Finally, we present results demonstrating the recognition of objects in the presence of noise, clutter, and occlusion.
Bell and LaPadula axioms: a &ldquo;new&rdquo; paradigm for an &ldquo;old&rdquo; model
Authors: T. Y. Lin
Venue: Proceedings on the 1992-1993 workshop on New security paradigms (1993)

Ideally secure systems must, be provable secure, so they are all defined by mathematical models. Most of current systems are based on the Bell and LaPadula Model (BLM), however, many usages are not logically sound. In this paper, a new paradigm is proposed to reinterpret the BLM. BLM is treated as axioms to define the multilevel security, in the same spirit as Hilbert axioms to the Euc1idean geometry. Absolutely no violations are tolerated. So many usual trusted subjects are no longer admissible in this new BLM. Three layer architecture is proposed to accommodate such requirements.
Class Library Support for Workflow Environments and Applications
Authors: M. Papazoglou, A. Delis, A. Bouguettaya, M. Haghjoo
Venue: IEEE Transactions on Computers (1997)

Workflow systems are receiving increased attention as they intend to facilitate the operations of enterprises by coordinating and streamlining business activities. The need for automated support and operational models that allow workflow applications to coordinate units of work across multiple servers¿according to business defined rules and routes¿is becoming critical for the proper management of such activities. In this paper, we describe a Transaction-Oriented Workflow Environment (TOWE) for programming workflow activities. The novelty of our approach resides in the proposed unified abstraction, class libraries, to support workflow activities. The fundamental concept used in the TOWE system is based on the symbiosis of object-oriented programming and interprocess communication concepts. In TOWE, the concurrency abstractions are represented by process objects, active objects acting as processes, which involve asynchronous, location-independent, and application specific process invocations.
Note on Periodic Complementary Sets of Binary Sequences
Authors: Dragomiru Z. Dokovic
Venue: Designs, Codes and Cryptography (1998)

Denote by {PCS}^n_p resp. {ACS}^n_p the collection consisting of ordered p-tuples of binary sequences (i.e., sequences whose elements are &plusmn; 1), each having lengthn , such that the sum of their periodic resp. aperiodic auto-correlation functions is a delta function. We fill many open cases in the B&ouml;mer and Antweiler diagram [3] of the known cases where{PCS}^n_p exist for p &le; 12 and n &le; 50. In particular we show that {PCS}^{34}_2 exist, while it is well known [1] that {ACS}^{34}_2 do not.
SQTW: a mechanism for state-dependent parallel simulation. Description and experimental study
Authors: Alessandro Fabbri, Lorenzo Donatiello
Venue: Proceedings of the eleventh workshop on Parallel and distributed simulation (1997)

In this paper we address the problem of efficiently performing parallel discrete-event simulation in the case that events elaboration is dependent of other processes' local states. We propose a parallel simulation policy, called State Query Time Warp (SQTW), based on the Time Warp mechanism. We present experiments performed by means of a SQTW-based parallel simulator on a T-800 transputer machine for solving performance models based on state-dependent routing queueing network models. The experiments are used for assessing overheads and efficiency involved by SQTW; results show that high efficiency is achievable, and surprisingly reveal SQTW is able to globally reduce rollback overheads with respect to corresponding Time Warp simulations.
Accurate binding-time analysis for imperative languages: flow, context, and return sensitivity
Authors: Luke Hornof, Jacques Noyé
Venue: Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation (1997)

Since a binding-time analysis determines how an off-line partial evaluator will specialize a program, the accuracy of the binding-time information directly determines the degree of specialization. We have designed and implemented a binding-time analysis for an imperative language, and integrated it into our partial evaluator for C, called Tempo [9]. This binding-time analysis includes a number of new features, not available in any existing partial evaluator for an imperative language, which are critical when specializing existing programs such as operating system components [24, 25]. bull; Flow sensitivity. A different binding-time description is computed for each program point, allowing the same variable to be considered static at one program point and dynamic at another. bull; Context sensitivity. Each function call is analyzed with the context of the call site, generating multiple binding-time annotated instances of the same function definition. bull; Return sensitivity. A different binding-time description is computed for the side-effects and the return value of a function.
Lessons from on-line programming examinations
Authors: Denise M. Woit, David V. Mason
Venue: ACM SIGCSE Bulletin (1998)

We have been using a combination of conventional and on-line programming examinations for the past 3 years in our first year programming courses. We plan to continue using on-line components because of the positive feedback from both students and faculty. We describe the operational and pedagogical lessons we have learned, illustrating problems encountered and our solutions, in the hope that others considering on-line examinations may also benefit from our experiences.
Acyclic Complexes Related to Noncommutative SymmetricFunctions
Authors: F. Bergeron, D. Krob
Venue: Journal of Algebraic Combinatorics: An International Journal (1997)

In this paper, we show how to endow the algebra of noncommutative symmetric functions with a natural structure of cochain complex which strongly relies on the combinatorics of ribbons, and we prove that the corresponding complexes are acyclic.