ppxscal/embedding_network huggingface dataset:
A Generic Framework for Efficient Subspace Clustering of High-Dimensional Data
Authors: Hans-Peter Kriegel, Peer Kroger, Matthias Renz, Sebastian Wurst
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Subspace clustering has been investigated extensively since traditional clustering algorithms often fail to detect meaningful clusters in high-dimensional data spaces. Many recently proposed subspace clustering methods suffer from two severe problems: First, the algorithms typically scale exponentially with the data dimensionality and/or the subspace dimensionality of the clusters. Second, for performance reasons, many algorithms use a global density threshold for clustering, which is quite questionable since clusters in subspaces of significantly different dimensionality will most likely exhibt significantly varying densities. In this paper, we propose a generic framework to overcome these limitations. Our framework is based on an efficient filter-refinement architecture that scales at most quadratic w.r.t. the data dimensionality and the dimensionality of the subspace clusters. It can be applied to any clustering notions including notions that are based on a local density threshold. A broad experimental evaluation on synthetic and real-world data empirically shows that our method achieves a significant gain of runtime and quality in comparison to state-of-the-art subspace clustering algorithms.
Efficient similarity search in high-dimensional data spaces
Authors: Alexander Thomassian
Venue:  (2004)

Similarity search in high-dimensional data spaces is a popular paradigm for many modern database applications, such as content based image retrieval, time series analysis in financial and marketing databases, and data mining. Objects are represented as high-dimensional points or vectors based on their important features. Object similarity is then measured by the distance between feature vectors and similarity search is implemented via range queries or k-Nearest Neighbor (k-NN) queries. Implementing k-NN queries via a sequential scan of large tables of feature vectors is computationally expensive. Building multi-dimensional indexes on the feature vectors for k-NN search also tends to be unsatisfactory when the dimensionality is high. This is due to the poor index performance caused by the dimensionality curse. Dimensionality reduction using the Singular Value Decomposition method is the approach adopted in this study to deal with high-dimensional data. Noting that for many real-world datasets, data distribution tends to be heterogeneous, dimensionality reduction on the entire dataset may cause a significant loss of information. More efficient representation is sought by clustering the data into homogeneous subsets of points, and applying dimensionality reduction to each cluster respectively, i.e., utilizing local rather than global dimensionality reduction. The thesis deals with the improvement of the efficiency of query processing associated with local dimensionality reduction methods, such as the Clustering and Singular Value Decomposition (CSVD) and the Local Dimensionality Reduction (LDR) methods. Variations in the implementation of CSVD are considered and the two methods are compared from the viewpoint of the compression ratio, CPU time, and retrieval efficiency. An exact k-NN algorithm is presented for local dimensionality reduction methods by extending an existing multi-step k-NN search algorithm, which is designed for global dimensionality reduction method. Experimental results show that the new method requires less CPU time than the approximate method proposed for CSVD at a comparable level of accuracy. Optimal subspace dimensionality reduction has the intent of minimizing total CPU cost or the number of pages accessed with an multi-dimensional index. The problem is complicated in that each cluster has a different number of dimensions. A hybrid method is presented combining the best features of the CSVD and LDR methods to find optimal subspace dimensionalities for clusters generated by local dimensionality reduction methods. The experiments show that the proposed method works well for both real-world datasets and synthetic datasets.
To be, or not to be: is that the question?
Authors: Richard E. Nance
Venue: ACM SIGSIM Simulation Digest (1984)

To elaborate on my paraphrase of the famous line of the Danish prince, I suggest that we pause to consider (perhaps reconsider) the proposed exercise in simulation language standardization. My intent is not to be obstructive, and I beg the indulgence of those of you who are already muttering about "the same old tired arguments against standardization." My purpose is to identify three fundamental questions regarding language standardization, to share with you my answers to these questions, and to explore the rationale emanating from these answers. If the questions are irrelevant, inappropriate, or inconsequential, please accept my apologies. If the questions are relevant, appropriate, and of consequence and, more important, the answers seem meaningful, then perhaps we can perceive clearer directions toward the improvement of simulation methodology.
Supervised learning of an abstract context model for an intelligent environment
Authors: Oliver Brdiczka, Patrick Reignier, James L. Crowley
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

This paper addresses the problem of supervised learning in intelligent environments. An intelligent environment perceives user activity and offers a number of services according to the perceived information about the user. An abstract context model in the form of a situation network is used to represent the intelligent environment, its occupants and their activities. The context model consists of situations, roles played by entities and relations between these entities. The objective is to adapt the system services, which are associated to the situations of the model, to the changing needs of the user. For this, a supervisor gives feedback by correcting system services that are found to be inappropriate to user needs. The situation network can be developed by exchanging the system service-situation association, by splitting the situation, or by learning new roles. The situation split is interpreted as a replacement of the former situation by sub-situations whose number and characteristics are determined using conceptual or decision tree algorithms. Different algorithms have been tested on a context model within the SmartOffice environment of the PRIMA research group. The decision tree algorithm (ID3) has been found to give the best results.
Evolutionary game theory and multi-agent reinforcement learning
Authors: Karl Tuyls, Ann Nowé
Venue: The Knowledge Engineering Review (2005)

In this paper we survey the basics of reinforcement learning and (evolutionary) game theory, applied to the field of multi-agent systems. This paper contains three parts. We start with an overview on the fundamentals of reinforcement learning. Next we summarize the most important aspects of evolutionary game theory. Finally, we discuss the state-of-the-art of multi-agent reinforcement learning and the mathematical connection with evolutionary game theory.
Towards a Metamorphic Testing Methodology for Service-Oriented Software Applications
Authors: W. K. Chan, S. C. Cheung, Karl. R. P. H. Leung
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

Web services have been increasingly used to integrate and build business applications over the Internet in the recent years. Once a Web service is published and deployed, other applications can discover and invoke it. A component Web service usually provides clients with single and simple functionality, but complex Web-based applications and business communities often involve different kinds and numbers of Web services to achieve their objectives. This puts forward to a challenge: how to automatically compose component Web services to form a new composite Web service? In this paper we study the issue of composing Web services with combination of Ontology, Web services and agent technology. We present a goal-driven and ontology-based architecture in which (1) user's goal is decomposed to subgoals; (2) the information in the goal and Web services are annotated with domain specific ontology; (3) AI technology and theory of reasoning about action are used to compose Web services. We also present a composing algorithm to show an application
Consistency Checks for Particle Filters
Authors: F. van der Heijden
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

An "inconsistent” particle filter produces—in a statistical sense—larger estimation errors than predicted by the model on which the filter is based. Two test variables are introduced that allow the detection of inconsistent behavior. The statistical properties of the variables are analyzed. Experiments confirm their suitability for inconsistency detection.
Recent developments on Flash memory reliability
Authors: D. Ielmini, A. S. Spinelli, A. L. Lacaita
Venue: Microelectronic Engineering (2005)

article-72-abstract
Evaluating the performance of latent semantic indexing
Authors: Pakinee Suwannajan
Venue:  (2005)

Information Retrieval (IR) has emerged in various fields such as the Web, bibliography systems, and digital libraries. Data indexing and retrieval are parts of IR and have been of interest to computer information scientists in the past years. One of the most popular IR models is the vector space model. It was developed to solve many problems associated with exact lexical matching. The vector space model employs linear algebra tools to find the similarity between a document and a query. Latent Semantic Indexing (LSI), a widely used variant of the vector space model, was designed to overcome problems arising from synonymy and polysemy. It is often claimed in the literature that LSI outperforms the vector space model. We discovered that LSI's performance is better than that of the vector space model only in some cases, specifically when the amount of information that a query shares with the relevant documents is greater than the amount that that query shares with the non-relevant documents. We also studied the capability of LSI in solving synonymy and polysemy problems. While synonyms are words that have the same meaning, a polyseme is a single word that has multiple meanings. We discovered that LSI can distinguish between two synonymous words only when they both appear in the same or similar contexts. For polysemy, LSI outperforms the vector space model only when two contexts that use different meanings of a polyseme share at least some information.
A Fast Analysis for Thread-Local Garbage Collection with Dynamic Class Loading
Authors: Richard Jones, Andy C. King
Venue: Proceedings of the Fifth IEEE International Workshop on Source Code Analysis and Manipulation (2005)

Long-running, heavily multi-threaded, Java server applications make stringent demands of garbage collector (GC) performance. Synchronisation of all application threads before garbage collection is a significant bottleneck for JVMs that use native threads. We present a new static analysis and a novel GC framework designed to address this issue by allowing independent collection of threadlocal heaps. In contrast to previous work, our solution safely classifies objects even in the presence of dynamic class loading, requires neither write-barriers that may do unbounded work, nor synchronisation, nor locks during thread-local collections; our analysis is sufficiently fast to permit its integration into a high-performance, productionquality virtual machine.
What hath got Roth
Authors: Paul Roth
Venue: ACM SIGSIM Simulation Digest (1973)

A great deal of our consciousness is affected by symbols. Symbols are useful as stimuli to provoke connotation or identification. Mnemonics and achronyms are widely used forms of symbolism and they reach the epitome of penetration in the area of computer languages.
Review of "Theory of Modeling and Simulation, by Bernard P. Zeigler", Wiley-Interscience Publication, John Wiley & Sons, 1976
Authors: Harold Joseph Highland
Venue: ACM SIGSIM Simulation Digest (1977)

Simulation to many outside our field is the 'tool of last resort,' when all else fails ...... To many in the simulation field, we are conent in our modeling and simulation techniques primarily because, through experience, we have found that they work, at least most of the time. On the other hand, many computer scientist has looked askance at simulation since it is not a true hard science discipline; consider, for example, the many papers in which simulation is still considered an art. 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
Finding Maximal Frequent Itemsets over Online Data Streams Adaptively
Authors: Daesu Lee, Wonsuk Lee
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Due to the characteristics of a data stream, it is very important to confine the memory usage of a data mining process regardless of the amount of information generated in the data stream. For this purpose, this paper proposes a CP-tree (Compressed-prefix tree)that can be effectively used in finding either frequent or maximal frequent itemsets over an online data stream. Unlike a prefix tree, a node of a CP-tree can maintain the information of several itemsets together. Based on this characteristic, the size of a CP-tree can be flexibly controlled by merging or splitting nodes. In this paper, a mining method employing a CP-tree is proposed and an adaptive memory utilization scheme is also presented in order to maximize the mining accuracy of the proposed method for confined memory space at all times. Finally, the performance of the proposed method is analyzed by a series of experiments to identify its various characteristics.
OMWSC- An Ontology-Based Model for Web Services Composition
Authors: Jiangang Ma, Yanchun Zhang, Minglu Li
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

Web services have been increasingly used to integrate and build business applications over the Internet in the recent years. Once a Web service is published and deployed, other applications can discover and invoke it. A component Web service usually provides clients with single and simple functionality, but complex Web-based applications and business communities often involve different kinds and numbers of Web services to achieve their objectives. This puts forward to a challenge: how to automatically compose component Web services to form a new composite Web service? In this paper we study the issue of composing Web services with combination of Ontology, Web services and agent technology. We present a goal-driven and ontology-based architecture in which (1) user's goal is decomposed to subgoals; (2) the information in the goal and Web services are annotated with domain specific ontology; (3) AI technology and theory of reasoning about action are used to compose Web services. We also present a composing algorithm to show an application.
Signaling Vulnerabilities in Wiretapping Systems
Authors: Micah Sherr, Eric Cronin, Sandy Clark, Matt Blaze
Venue: IEEE Security and Privacy (2005)

Many law enforcement wiretap systems are vulnerable to simple, unilateral countermeasures that exploit the unprotected in-band signals passed between the telephone network and the collection system. This article describes the problem as well as some remedies and workarounds.
Motion Deblurring for Optical Character Recognition
Authors: Xing Yu Qi, Li Zhang, Chew Lim Tan
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper investigates the problem of blurring caused by motion during image capture of text documents. Motion blurring prevents proper optical character recognition of the document text contents. One area ofsuch applications is fo deblur name card images obtained from handheld cameras. In this paper, a complete motion deblurring procedure for document images has been proposed. The method handles both uniform linear motion blur and uniform acceleration motion blur. Experiments on synthetic and real-life blurred images prove the feasibility and reliability of this algorithm provided that the motion is not too irregular. The restoration procedure consumes only small amount of computation time.
16.447 TFlops and 159-Billion-dimensional Exact-diagonalization for Trapped Fermion-Hubbard Model on the Earth Simulator
Authors: Susumu Yamada, Toshiyuki Imamura, Masahiko Machida
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

In order to study a possibility of superfluidity in trapped atomic Fermi gases loaded on optical lattices, we implement an exact diagonalization code for the trapped Hubbard model on the Earth Simulator. Comparing two diagonalization algorithms, we find that the performance of the preconditioned conjugate gradient (PCG) method is 1.5 times superior to the conventional Lanczos one since the PCG method can conceal the communication overhead much more efficiently. Consequently, the PCG method shows 16.447 TFlops (50.2% of the peak) on 512 nodes. On the other hand, we succeed in solving a 159-billion-dimensional matrix by using the conventional Lanczos method. To our knowledge, this dimension is a world-record. Numerical results reveal that an unconventional type of superfluidity specific to the confined system develops under repulsive interaction.
Directions for security and privacy for semantic e-business applications
Authors: Bhavani Thuraisingham
Venue: Communications of the ACM (2005)

Developing secure semantic e-business applications requires focusing first on securing the Semantic Web, knowledge management, and e-business processes.
Isomorph-Free Exhaustive Generation of Designs with Prescribed Groups of Automorphisms
Authors: Petteri Kaski
Venue: SIAM Journal on Discrete Mathematics (2005)

We develop an algorithm framework for isomorph-free exhaustive generation of designs admitting a group of automorphisms from a prescribed collection of pairwise nonconjugate groups, where each prescribed group has a large index relative to its normalizer in the isomorphism-inducing group. We demonstrate the practicality of the framework by producing a complete classification of the Steiner triple systems of order $21$ admitting a nontrivial automorphism group. The number of such pairwise nonisomorphic designs is $62336617$, where $958$ of the designs are anti-Pasch. We also develop consistency checking methodology for gaining confidence in the correct operation of the algorithm implementation.
Come to where the action is
Authors: Glenna James
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1979)

When Eliza Doolittle sang (My Fair Lady) of being sick of words, she claimed there wasn't one she hadn't heard. Well, Eliza, there is one I've heard (read) for too often: 'utilize'. 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
Hybrid Optimization Algorithm for the Definition of MLP Neural Network Architectures and Weights
Authors: A. P. S. Lins, T. B. Ludermir
Venue: Proceedings of the Fifth International Conference on Hybrid Intelligent Systems (2005)

This paper proposes improvements in the Yamazaki method for the simultaneous optimization of Multilayer Perceptron network weights and architectures. The main objective is to propose a set of modifications, with respective validations, aimed at creating a more efficient optimization process. The optimization hybrid algorithm is based on the simulated annealing and tabu search algorithms as well as the Yamazaki method. The modifications are carried out in the implementation criteria, such as the neighbor generation mechanism and cooling schedule. One of the main points of this paper is the creation of a new neighbor generation mechanism aimed at increasing the search space. Experimental results, using two different data sets (wine and gases), show that the optimization hybrid algorithm obtained the lowest value of the average classification error and obtained a substantial gain in execution time (reduced by an average of 46.72%).
Mutually Independent Hamiltonian Cycles in Hypercubes
Authors: Chao-Ming Sun, Cheng-Kuan Lin, Hua-Min Huang
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

A hamiltonian cycle C of G is described as \left\langle {\mu _1 ,\mu _2 ,....,\mu _n (G),\mu _1 )} \right\rangleto emphasize theorder of nodes in C. Thus, \mu _1 is the beginning node and ui is the i-th node in C. Two hamiltonian cycles of G beginning at u, C1 = \left\langle {\mu _1 ,\mu _2 ,....,\mu _n (G),\mu _1 )} \right\rangle and C2 = \left\langle {\mu _1 ,\mu _2 ,....,\mu _n (G),\mu _1 )} \right\rangle , are independent if u = \mu _1 = \mu _1, and \mu _1\ne \mu _1 for 1 \le i \le n(G). A set of hamiltonian cycles \{ C_1 ,C_2 ,...,C_k \} of G are mutually independent if any two different hamiltonian cycles are independent. The mutually independent hamiltonianicity of graph G, IHC(G), is the maximum integer k such that for any node u of G there exist k-mutually independent hamiltonian cycles of G starting at u. Let Q_nbe the n-dimensional hypercube. We prove that IHC(Q_n) = n - 1 if n\in {1, 2, 3} and IHC(Q_n) = n if n \ge 4.
Recent Advances and New Avenues in Hardware-Level Reliability Support
Authors: Ravishankar K. Iyer, Nithin M. Nakka, Zbigniew T. Kalbarczyk, Subhasish Mitra
Venue: IEEE Micro (2005)

The issue of transient (or soft) errors is one of the major concerns in designing and implementing the current generation of highly integrated digital systems. The continuous pushing of the processor performance envelope and the deployment of computer systems in complex mission- and life-critical applications has further increased the significance and impact of transient errors. In hardware, these errors have been handled at the device, circuit and architectural-level employing information redundancy, space redundancy, time redundancy or a combination of them. This paper analyzes techniques developed at the circuit- and the architectural-level, both in experimental academic research and industry. Based on past studies an observation is made that most low-level errors do not translate to errors in the outcome of the application, which is the primary concern of the user. Therefore, an alternative paradigm called application-aware runtime checking is proposed. In this approach the application is analyzed either statically or through dynamic profiling to extract its reliability-sensitive characteristics. Based on extracted application properties, hardware checkers/modules are devised and embedded in a processor-level framework to enable runtime error detection and recovery. The architecture of the Illinois Reliability and Security Engine is presented as a possible implementation of such a framework.