ppxscal/embedding_network huggingface dataset:
pSearch: information retrieval in structured overlays
Authors: Chunqiang Tang, Zhichen Xu, Mallik Mahalingam
Venue: ACM SIGCOMM Computer Communication Review (2003)

We describe an efficient peer-to-peer information retrieval system, pSearch; that supports state-of-the-art content- and semantic-based full-text searches. pSearch avoids the scalability problem of existing systems that employ centralized indexing, or index/query flooding. It also avoids the nondeterminism that is exhibited by heuristic-based approaches. In pSearch; documents in the network are organized around their vector representations (based on modern document ranking algorithms) such that the search space for a given query is organized around related documents, achieving both efficiency and accuracy.
Appreciation to 2000 referees
Venue: Operations Research (2001)

The Editorial Board would like to thank the following individuals who acted as referees for papers considered or published during the 2000 calendar year. Without their assistance, it would be impossible for INFORMS to publish a journal of high professional standards. 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
Numerical solution of dynamic optimization problems with flexible inequality constraints by iterative dynamic programming
Authors: Cheng-Liang Chen, Daim-Yuang Sun, Chia-Yuan Chang
Venue: Fuzzy Sets and Systems (2002)

A solution strategy for optimizing the dynamic systems with flexible inequality constraints is proposed. To apply fuzzy inference in solution, the flexible portion in the problem is treated as fuzzy constraints. After functional values are bounded in a region, the objective function of this problem can also be fuzzified easily. When the problem is formulated as a fuzzy dynamic optimization problem, the iterative dynamic programming integrated with fuzzy inference is adopted to find the solution. Two examples are employed, demonstrating the facility of the proposed algorithm.
Granulation and nearest neighborhoods: rough set approach
Authors: T. Y. Lin
Venue: Granular computing: an emerging paradigm (2001)

"Nearest" neighborhoods are informally used in many areas of AI and database. Mathematically, a "nearest" neighborhood system that maps each object p a unique crisp/fuzzy subset of data, representing the "nearest" neighborhood, is a binary relation between the object and data spaces. "Nearest" neighborhood consists of data that are semantically related to p, and represents an elementary granule(atoms) of the system under consideration. This paper examines "rough set theory" of these elementary granules. Applications to databases, fuzzy sets and pattern recognition are used to illustrate the idea.
Achieving k-anonymity privacy protection using generalization and suppression
Authors: Latanya Sweeney
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2002)

Often a data holder, such as a hospital or bank, needs to share person-specific records in such a way that the identities of the individuals who are the subjects of the data cannot be determined. One way to achieve this is to have the released records adhere to k- anonymity, which means each released record has at least (k-1) other records in the release whose values are indistinct over those fields that appear in external data. So, k- anonymity provides privacy protection by guaranteeing that each released record will relate to at least k individuals even if the records are directly linked to external information. This paper provides a formal presentation of combining generalization and suppression to achieve k-anonymity. Generalization involves replacing (or recoding) a value with a less specific but semantically consistent value. Suppression involves not releasing a value at all. The Preferred Minimal Generalization Algorithm (MinGen), which is a theoretical algorithm presented herein, combines these techniques to provide k-anonymity protection with minimal distortion. The real-world algorithms Datafly and µ-Argus are compared to MinGen. Both Datafly and µ-Argus use heuristics to make approximations, and so, they do not always yield optimal results. It is shown that Datafly can over distort data and µ-Argus can additionally fail to provide adequate protection.
The MSOM Society Student Paper Competition: Extended Abstracts of 2001 Winners
Venue: Manufacturing Service Operations Management (2001)

For the sixth year, the Manufacturing and Service Operations Management (MSOM) Society of INFORMS conducted a student paper competition. The goal of the competition is to recognize and reward promising young scholars who produce outstanding work in the area of Operations Management. The first prize was accompanied by a $400 honorarium. The second prize was accompanied by a $200 honorarium.
Fresh Breeze: a multiprocessor chip architecture guided by modular programming principles
Authors: Jack B. Dennis
Venue: ACM SIGARCH Computer Architecture News (2003)

It is well-known that multiprocessor systems are vastly more difficult to program than systems that support sequential programming models. In a 1998 paper[11] this author argued that six important principles for supporting modular software construction are often violated by the architectures proposed for multiprocessor computer systems. The Fresh Breeze project concerns the architecture and design of a multiprocessor chip that can achieve superior performance while honoring these six principles.The envisioned multiprocessor chip will incorporate three ideas that are significant departures from mainstream thinking about multiprocessor architecture: (1) Simultaneous multithreading has been shown to have performance advantages relative to contemporary superscalar designs. This advantage can be exploited through use of a programming model that exposes parallelism in the form of multiple threads of computation. (2) The value of a shared address space is widely appreciated. Through the use of 64-bit pointers, the conventional distinction between "memory" and the file system can be abolished. This can provide a superior execution environment in support of program modularity and software reuse, as well as supporting multi-user data protection and security that is consistent with modular software structure. (3) No memory update; cycle-free heap. Data items are created, used, and released, but never modified once created. The allocation, release, and garbage collection of fixed-size chunks of memory will be implemented by efficient hardware mechanisms. A major benefit of this choice is that the multiprocessor cache coherence problem vanishes: any object retrieved from the memory system is immutable. In addition, it is easy to prevent the formation of pointer cycles, simplifying the design of memory management support.
Aggregation operators in engineering design
Authors: Endre Pap
Venue: Aggregation operators: new trends and applications (2002)

Engineering design is conducted with incomplete and imperfect information, and in this paper there are presented some of the tools for decision making under risk and uncertainty and the application of these tools to engineering design. First it is presented an axiomatization of engineering design based on von Neumannn and Morgenstern axiomatization. Then it is given a general definition of decision making problem which enables to apply also fuzzy systems and nonadditive measures. Special attention is taken on different aggregation operators which can model the decision making in engineering design. A procedure for finding the global maximum as well as some procedures for identification of non-additive measure are presented.
Combinational equivalence checking through function transformation
Authors: Hee Hwan Kwak, In-Ho Moon, James H. Kukula, Thomas R. Shiple
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

Circuits can be simplified for combinational equivalence checking by transforming internal functions, while preserving their ranges. In this paper, we investigate how to effiectively apply the idea to improve equivalence checking. We propose new heuristics to identify groups of nets in a cut, and elaborate detailed aspects of the new equivalence checking method. With a given miter, we identify a group of nets in a cut and transform the function of each net into a more compact representation with less variables. These new compact parametric representations preserve the range of nets as well as of the cut. This transformation significantly reduces the size of intermediate BDDs and enables the verification to be conclusive for many designs which state-of-the-art equivalence checkers fail to verify. Iterative groupings and transformations are performed until no grouping is possible for a cut. Then we proceed to the next cut and continue until the compare point is reached. Our experimental results show the effiectiveness of our strategy and new grouping heuristics on the new method.
C++ for Game Programmers
Authors: Noel Llopis
Venue:  (2003)

:On the CD! The CD-ROM contains the source code for several programs that demonstrate the more complex concepts in the book. They are fully functional programs that show how all the different ideas interrelate and come together. MemoryMgr -- A fully implemented memory manager and a small test application. Plugins A simple Win32 application with plug-ins. The application displays the currently loaded plug-ins, and the plug-ins themselves add some menu entries to the main application. RTTI -- A custom runtime type information system, intended to work only with single inheritance. RTTIMulti A variation on the previous custom runtime type information system. It supports multiple inheritance at the cost of some extra performance. ObjectFactory -- A templatized object factory for game entities. Serialization -- A simple implementation that serializes a full game-entity tree to disk and loads it back. System Requirements All the programs were compiled using Visual Studio C++ 6.0 and were tested under Windows 2000. However, except for the plug-ins example, they should all be platform and compiler independent, so they should be easy to compile and run in your favorite environment. The executable for the plug-ins example program is also provided. You can experiment with it without having to compile it first.
Optimal embeddings of multiple graphs into a hypermesh
Authors: Sook-Yeon Kim, Kyung-Yong Chwa
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

A hypermesh, a versatile parallel architecture, is obtained from a 2-dimensional mesh by replacing each linear connection with a hyper-edge. We optimally embed multiple graphs into a hypermesh by a labeling strategy. This optimal embedding provides an optimal expansion, dilation and congestion at the same time. First, we label on an N-node graph G, possibly disconnected, such that this labeling makes it possible to optimally embed multiple copies of G into an N'/spl times/N' hypermesh when N' is divisible by N. Second, we show that many important classes of graphs have this labeling: for example, tree, cycle, mesh of trees and product graphs including mesh, torus, and hypercube. Third, we generalize these results to optimally embed multiple graphs into a multidimensional and possibly non-square hypermesh. This labeling strategy is applicable to the embeddings of other classes of graphs into a hypermesh.
On the divisor products and proper divisor products sequences
Authors: Liu Hongyan, Zhang Wenpeng
Venue: Smarandache notions (2002)

Let n be a positive integer, pd(n) denotes the product of all positive divisors of n, qd(n) denotes the product of all proper divisors of n. In this paper, we study the properties of the sequences {pd(n)} and {qd(n)}, and prove that the Makowski & Schinzel conjecture hold for the sequences {pd(n)} and {qd(n)}.
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Venue: International Conference on Principles and Practice of Declarative Programming (2001)

This volume contains the papers and abstracts presented at PPDP'01, the Third International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, held in Florence, Italy, September 5-7, 2001.Together with the Sixth International ACM SIGPLAN Conference on Functional Programming (ICFP) and a number of associated workshops, PPDP'01 has formed a federation of conferences known as Colloquium on Principles, Logics, and Implementations of high-level programming languages (PLI 2001). Previous PLI colloquia were held in Paris, in September 1999, and in Montr&eacute;al, in September 2000. These events are organised by SIGPLAN, ACM's Special Interest Group on Programming Languages.PPDP 2001 aims to stimulate research on the use of declarative methods in programming and on the design, implementation and application of programming languages that support such methods. Topics of interest include any aspect related to understanding, integrating and extending programming paradigms such as those for functional, logic, constraint and object-oriented programming; concurrent extensions and mobile computing; type theory; support for modularity; use of logical methods in the design of program development tools; program analysis and verification; abstract interpretation; development ofimplementation methods; and application of the relevant paradigms and associated methods in industry and education.A total of 40 submissions were received in response to the call for papers. The START conference management system was used for the handling of electronic submissions, for allocation of reviewing duties, and for filing of reviews. The program committee meeting was conducted electronically. Each paper was reviewed by at least three referees and 19 papers were selected for publication. In addition to the regular paper presentations, the scientific program included three invited talks, by Javier Esparza (University of Edinburgh), Andrew Gordon (Microsoft Research Cambridge), and Dave Schmidt (Kansas State University).
Expansions in series of varying Laguerre polynomials and some applications to molecular potentials
Authors: J. Sánchez-Ruiz, P. López-Artés, J. S. Dehesa
Venue: Journal of Computational and Applied Mathematics (2003)

The expansion of a large class of functions in series of linearly varying Laguerre polynomials, i.e., Laguerre polynomials whose parameters are linear functions of the degree, is found by means of the hypergeometric functions approach. This expansion formula is then used to obtain the Brown-Carlitz generating function (which gives a characterization of the exponential function) and the connection formula for these polynomials. Finally, these results are employed to connect the bound states of the quantum-mechanical potentials of Morse and Pöschl-Teller, which are frequently used to describe molecular systems.
Education for a technological world
Authors: David L. Sonnier, Stuart L. Hutton
Venue: Journal of Computing Sciences in Colleges (2003)

The "First Annual Deans Summit" met in October 2001 to address the issues of technological literacy. The meeting was described in the May 2002 (Volume 45) issue of IEEE Transactions on Education [1]. The concerns expressed in the article Partnerships Take the Lead: A Deans Summit on Education for a Technological World were hopefully well received by both technology and general educators as a challenge. This paper describes an ongoing effort to meet this challenge.
Stability of Multivariate Polynomials, Part 4: Conic Sets
Authors: V. L. Kharitonov, J. A. Torres-Muñoz
Venue: Multidimensional Systems and Signal Processing (2003)

Robust stability of conic sets of multivariate polynomials is the main topic of the paper. Stability and semistability conditions for a cone starting at the origin are obtained along with stability conditions for a cone of the form p( s) + K, where p( s) is a given polynomial and K is a cone starting at the origin. Some new results on convex directions for mulivariate polynomials are also presented.
The Problem of Estimation of Importance Factors as a Symmetric-Lexicographic Problem of Optimization
Authors: V. V. Podinovskii
Venue: Automation and Remote Control (2003)

It is shown that the problem of calculating the importance factors of objects on the basis of their interval paired comparisons, which is set up as a multicriteria problem of the minimization of equally important criteria that manifest themselves as multiplicative residuals of the system of inequalities for the required factors, comes to the sequence of a few problems of linear programming.
Measuring e-Commerce in Net-Enabled Organizations: An Introduction to the Special Issue
Authors: Detmar W. Straub, Donna L. Hoffman, Bruce W. Weber, Charles Steinfield
Venue: Information Systems Research (2002)

Clear and precise metrics are essential for evaluating phenomena such as e-commerce (?Net?-enablement) and the organizational use of networks and the Internet for commercial activities. Researchers require them for theory building and testing; practitioners require them for improving organizational processes. But for IS professionals to engage in the serious creation of metrics, it is critical to recognize:(1) that the phenomenon of net-enablement is an enduring change, probably led in the future by 'brick-cum-click'firms, (2) that some new and old measures need to be differentially applied, and (3) that the papers in this special issue are not the end of metrics creation, but just the beginning.
The LHAM log-structured history data access method
Authors: Peter Muth, Patrick O'Neil, Achim Pick, Gerhard Weikum
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2000)

Numerous applications such as stock market or medical information systems require that both historical and current data be logically integrated into a temporal database. The underlying access method must support different forms of &ldquo;time-travel&rdquo; queries, the migration of old record versions onto inexpensive archive media, and high insertion and update rates. This paper presents an access method for transaction-time temporal data, called the log-structured history data access method (LHAM) that meets these demands. The basic principle of LHAM is to partition the data into successive components based on the timestamps of the record versions. Components are assigned to different levels of a storage hierarchy, and incoming data is continuously migrated through the hierarchy. The paper discusses the LHAM concepts, including concurrency control and recovery, our full-fledged LHAM implementation, and experimental performance results based on this implementation. A detailed comparison with the TSB-tree, both analytically and based on experiments with real implementations, shows that LHAM is highly superior in terms of insert performance, while query performance is in almost all cases at least as good as for the TSB-tree; in many cases it is much better.
A case study of information-seeking behavior in 7-year-old children in a semistructured situation
Authors: Linda Z. Cooper
Venue: Journal of the American Society for Information Science and Technology (2002)

This article presents a case study of the information-seeking behavior of 7-year-old children in a semistructured situation in their school library media center. The study focuses on how young children who are in the process of learning to read cope with searching for information in a largely textual corpus, and how they make up for their deficit in textual experience. Children's search strategies are examined and discussed in the context of computer versus shelf searching, textual versus visual searching, and in comparison with adult search dimensions previously established.
On the Emulation of Software Faults by Software Fault Injection
Authors: Henrique Madeira, Diamantino Costa, Marco Vieira
Venue: Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8) (2000)

This paper presents an experimental study on the emulation of software faults by fault injection. In a first experiment, a set of real software faults has been compared with faults injected by a SWIFI tool (Xception) to evaluate the accuracy of the injected faults. Results revealed the limitations of Xception (and any other SWIFI tools) in the emulation of the different classes of software faults (about 44% of the software faults cannot be emulated). The use of field data about real faults was discussed and software metrics were suggested as an alternative to guide the injection process when field data is not available. In a second experiment, a set of rules for the injection of errors meant to emulate classes of software faults was evaluated. The fault triggers used seem to be the cause for the observed strong impact of the faults in the target system and in the program results. The results also show the influence in the fault emulation of aspects such as code size, complexity of data structures, and recursive versus sequential execution.
Approximating Subdifferentials by Random Sampling of Gradients
Authors: J. V. Burke, A. S. Lewis, M. L. Overton
Venue: Mathematics of Operations Research (2002)

Many interesting real functions on Euclidean space are differentiable almost everywhere. All Lipschitz functions have this property, but so, for example, does the spectral abscissa of a matrix (a non-Lipschitz function). In practice, the gradient is often easy to compute. We investigate to what extent we can approximate the Clarke subdifferential of such a function at some point by calculating the convex hull of some gradients sampled at random nearby points.
Models, relaxations and exact approaches for the capacitated vehicle routing problem
Authors: Paolo Toth, Daniele Vigo
Venue: Discrete Applied Mathematics (2002)

In this paper we review the exact algorithms based on the branch and bound approach proposed in the last years for the solution of the basic version of the vehicle routing problem (VRP), where only the vehicle capacity constraints are considered. These algorithms have considerably increased the size of VRPs that can be solved with respect to earlier approaches. Moreover, at least for the case in which the cost matrix is asymmetric, branch and bound algorithms still represent the state-of-the-art with respect to the exact solution. Computational results comparing the performance of different relaxations and algorithms on a set of benchmark instances are presented. We conclude by examining possible future directions of research in this field.