ppxscal/embedding_network huggingface dataset:
Kolmogorov's Structure Functions with an Application to the Foundations of Model Selection
Authors: Nikolai K. Vereshchagin, Paul M. B. Vitányi
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

In 1974 Kolmogorov proposed a non-probabilistic approach to statistics, an individual combinatorial relation between the data and its model. We vindicate, for the first time, the rightness of the original "structure function", proposed by Kolmogorov: minimizing the data-to-model code length (finding the ML estimator or MDL estimator), in a class of contemplated models of prescribed maximal (Kolmogorov) complexity, always results in a model of best fit (expressed as minimal randomness deficiency). We show that both the structure function and the minimum randomness deficiency function can assume all shapes over their full domain (improving an old result of L.A. Levin and both an old and a recent one of V.V. Vyugin). We determine the (un)computability properties of the various functions and "algorithmic sufficient statistic."
New Features for Chinese Character Recognition
Authors: Torsten Caesar
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

The wide range of shape variations for Chinese characters requires an adequate representation of the discriminating features for classification. For the recognition of Latin characters or numerals pixel values of a normalized raster image are proper features to reach very good recognition rates. But Chinese characters require a much higher resolution of the normalized raster image to enable a discrimination of complex shaped characters which leads to a feature space dimensionality of prohibitive computational effort for classification. Therefore feature extraction algorithms are needed which capture the discriminative characteristics of character shapes in a compact form. Several algorithms were proposed in the past and many of them are based on the contour data. This paper also introduces a contour based approach which is very time efficient and overcomes the problem of vanishing lines during anisotropic size normalization.
Estimating the size of an Estelle specification for a communication protocol
Authors: S. J. Huang, R. Lai
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

Existing software size models estimate the size of an implementation of a software system usually in terms of the number of lines of code. The main drawback of these models is that there is a wide margin of uncertainty, as the actual size depends on the type of application and the software development method adopted. To address this drawback, the authors focus their work on the formal communication protocol development, and present a size model for estimating the size of an Estelle specification of a communication protocol from its informal specification.
Incremental Learning with Support Vector Machines
Authors: Stefan Rüping
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Support Vector Machines (SVMs) have become a popular tool for machine learning with large amounts of high dimensional data. In this paper an approach for incremental learning with Support Vector Machines is presented, that improves the existing approach of [3 ]. Also, some insight into the interpretability of support vectors s given.
Using NLP to Efficiently Visualize Text Collections with SOMs
Authors: James Henderson, Paola Merlo, Ivan Petroff, Gerold Schneider
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Self-Organizing Maps (SOMs) are a good method to cluster and visualize large collections of text documents, but they are computationally expensive. In this paper, we investigate ways to use natural language parsing of the texts to remove unimportant terms from the usual bag-of-words rep-resentation, to improve efficiency. We find that reducing the document representation to just the heads of noun and verb phrases does indeed reduce the heavy computational cost without degrading the quality of the map, while more severe reductions which focus on subject and object noun phrases degrade map quality.
Dependency Analysis and Visualization as Tools to Prolong System Life
Authors: Dave McComb, Simon Robe, Simon Hoare, Stew Crawford-Hines
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

This paper describes our experience using dependency analysis and visualization as a tool toidentify intervention points for migrating applications to environments where they can live out their natural lives, less dependent of the vagaries of platform obsolescence. The first part of the paper describes our methodology and deliverables. The second part presents case studies on applying this approach to commercially installed applications.
Classification with Degree of Membership: A Fuzzy Approach
Authors: Wai-Ho Au, Keith C. C. Chan
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

algorithms adopt either a decision tree based approach or an approach that requires users to provide some user-specifiedthresholds to guide the search for interesting rules. In this paper, we propose a new approach based on the use of an objective interestingness measure todistinguish interesting rules from uninteresting ones. Using linguistic terms to represent the revealed regularities and exceptions, this approach s especially useful when the discovered rules are presented to human experts for examination because of the affinity with thehuman knowledge representation. The use of fuzzy technique allows the predict on of attribute values to be associated with degree of membership. Our approach s, therefore, able to deal with the cases that an object can belong to more than one class. For example, a person can suffer from cold and fever to certain extent at the same time. Furthermore, our approach is more resilient to noise and missing data values because of the use of fuzzy technique. To evaluate the performance of our approach, we tested it using several real-life databases. The experimental results show that it can be very effective at data mining tasks. In fact, when compared to popular data mining algorithms, our approach can be better ableto uncover useful rules hidden in databases.
The modal logic of probability
Authors: Aviad Heifetz, Philippe Mongin
Venue: Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge (1998)

The present paper offers a novel axiomatization of the probability concept in terms of modal logic. The structures we axiomatize consist of a measurable space of possible worlds, and for each possible world, a probability measure on the space and a valuation function. Roughly speaking, these structures can be seen as probabilistic refinements of the familiar Kripke structures of modal logic. Leaving aside measurability restrictions, the difference between the two kinds of structures is simply that in a <i>probability structure</i> each world is mapped to a probability measure instead of a set. Conversely, a Kripke structure can be seen as an impoverishment of a probability structure, in which only supports (i.e., minimal closed sets of probability one) are considered. Similarly to Kripke structures, probability structures admit of various conceptual interpretations, but this paper was motivated by earlier work in epistemic logic and the foundations of decision theory and game theory, so we will be exclusively concerned here with the interpretation of probability as a measure of subjective belief.
Wireless Java RMI
Authors: Stefano Campadello, Oskari Koskimies, Kimmo E. E. Raatikainen, Heikki Helin
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

Due to its high protocol overhead, both in data traffic and in round-trips, Java RMI is poorly suited for communication over slow wireless links. However, its performance can be enhanced without breaking compatibility with Java RMI specification, and with minimal changes to existing software and network hosts. The paper analyzes the reasons for the poor performance of Java RMI, outlines a solution based on mediator technology and evaluates the performance of a prototype implementing the solution.
Techniques for Synchronizing Distributed Participants in a Net-Scenario
Authors: Johan Lundin, Farshad Taghizadeh
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

This paper describe techniques to facilitate communication and learning among people, who are participating in a distributed role-play. The distributed and asynchronous setting poses new problems for collaborative role-playing. We present three techniques for a facilitator to guide participants through a story. This to allow them to work as a group even though theyaccess the role-play distributed and asynchronously. The three techniques presented are: Synchronizing points, Providing written instructions and Through peer pressure. We describe the techniques and present our insights from the evaluation.
Extended Faceted Taxonomies for Web Catalogs
Authors: Yannis Tzitzikas, Nicolas Spyratos, Panos Constantopoulos, Anastasia Analyti
Venue: Proceedings of the 3rd International Conference on Web Information Systems Engineering (2002)

Indexing and retrieval in Web catalogs can benefit fromusing faceted taxonomies. A faceted taxonomy consists of aset of facets, where each facet consists of a predefined setof terms structured by a subsumption relation. We proposetwo extensions of faceted taxonomies, which allow inferringconjunctions of terms that are valid in the underlyingdomain. We give a model-theoretic interpretation to theseextended faceted taxonomies and we provide mechanismsfor inferring the valid conjunctions of terms. This inferenceservice can be exploited for preventing errors during the indexingprocess and for dynamically generating navigationtrees that are suitable for browsing through the Web.The proposed scheme has several advantages by comparisonto the hierarchical classification schemes that arecurrently employed by Web catalogs, namely: (a) conceptualclarity: it is easier to understand; (b) compactness:ittakes less space; and (c) scalability: the update operationscan be formulated easier and be performed more efficiently.
Multi-phase array redistribution: modeling and evaluation
Authors: S. D. Kaushik, Chua-Huang Huang, J. Ramanujam, P. Sadayappan
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Array redistribution is used in languages such as High Performance Fortran to allow programmers to dynamically change the distribution of arrays across processors. Distributed-memory implementations of several scientific applications require array redistribution. In this paper, efficient methods for performing array redistribution are presented. Precise closed forms for determining the processors involved in the communication and the data elements to be communicated are developed for two special cases of array redistribution involving block-cyclically distributed arrays. The general array redistribution problem involving block-cyclically distributed arrays can be expressed in terms of these special cases. Using the closed forms, a cost model for estimating the communication overhead for array redistribution is developed. A multi-phase approach for reducing the communication cost of array redistribution is presented. Experimental results on the Cray T3D to evaluate the multi-phase approach are provided.
Performance measurements of a concurrent production system architecture without global synchronization
Authors: José N. Amaral, Joydeep Ghosh
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

The use of the serializability criterion of correctness allows the elimination of global synchronization in production system machines. We present an extensive performance evaluation of a concurrent production system architecture that is based on serializability and takes advantage of modern associative memory devices to allow parallel production firing, concurrent matching, and overlap among matching, selection, and firing of productions. We study the cost effectiveness of associative memory components, and verify the conjecture that bus bandwidth is not a limitation in the architecture. A parallel machine that does global synchronization before every production firing is used as a reference for the comparative studies.
Security Assurance Efforts in Engineering Java 2 SE (JDK 1.2)
Authors: Li Gong, Satya Dodda
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

With the release of Java 2 SE (Standard Edition, also commonly known as JDK 1.2), Java technology has matured such that it is increasingly deployed as part of the information infrastructure in today's economy and for mission-critical applications. These applications require a high degree of assurance of the underlying technologies, including JDK 1.2. This paper outlines the JDK 1.2 software development process and the special efforts to increase the quality assurance of the security features.
XFolders: A Flexible Workflow System Based on Electronic Circulation Folders
Authors: Stefania Castellani, François Pacull
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

We present a flexible light-weight document-centered workflow system, called XFolders, that breaks physical and organisational boundaries allowing users across distributed virtual organizations to flexibly collaborate and share documents. The paradigm underlying XFolders is the well known, and widely adopted, internal office circulation envelope. We show how XFolders combines the simplicity of this metaphor with the power and the benefits of today's networked computers, in terms of speed, distance bridging and support. In particular, we show how in XFolders documents can be migrated across organizations hidden by firewalls and how we deal with scalability and dynamicity issues.
Media Asset Management: Managing Complex Data as a Re-Engineering Exercise
Authors: Peter DeVries
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Building a media asset management application involves the storing, searching, and retrieving of complex data. How this data is managed can be viewed from two perspectives-in terms of the internal representation required to allow for high-speed searching and transferring of these items between systems, but also from the end-user perspective. This paper focuses on the perspective that media asset management is a re-engineering exercise whose fundamental goal is to eliminate the file system and its underlying classification model. The paper discusses the following topics: folder/director classification schemes; file system security; cross platform file transfers; traditional searching techniques and constraints; the data characteristics of a media asset management solution; an architectural mapping of elements required to manage complex data, including source, proxy, and metadata; a media asset management approach to classification including business semantics; content based search algorithms; and the feasibility of a database replacing the file system.
Efficient communication using total-exchange
Authors: Satish Rao, Torsten Suel, Thanasis Tsantilas, Mark Goudreau
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

A central question in parallel computing is to determine the extent to which one can write parallel programs using a high-level, general-purpose, and architecture-independent programming language and have them executed on a variety of parallel and distributed architectures without sacrificing efficiency. A large body of research suggests that, at least in theory, general-purpose parallel computing is indeed possible provided certain conditions are met: an excess of logical parallelism in the program, and the ability of the target architecture to efficiently realize balanced communication patterns. The canonical example of a balanced communication pattern is an h-relation, in which each processor is the origin and destination of at most h messages. A plethora of protocols has been designed for routing h-relations in a variety of networks. The goal has been to minimize the value of h while guaranteeing delivery of the messages within a time constant factor from optimal. In this paper we describe protocols that meet the most stringent efficiency requirement, namely delivery of messages within time that is a lower order additive term from the best achievable. Such protocols are called 1-optimal. While these protocols achieve 1-optimality only for heavily loaded networks, that is, for large values of h, they are remarkable for their simplicity in that they only use the total-exchange communication primitive. The total-exchange can be realized in many networks using very simple, contention-free, and extremely efficient schemes. The technical contribution of this paper is a protocol to route random h-relations in an N-processor network using /sup h///sub N/(1+o(1))+O(log log N) total-exchange rounds with high probability. Using message duplication, we can improve the bound to /sup h///sub N/(1+o(1))+O(log*N). This improves upon the /sup h///sub N/(1+o(1))+O(log N) bound of Gerbessiotis and Valiant. While our theoretical improvements are modest, our experimental results show an improvement over the protocol of A. Gerebessiotis and L.G. Valiant.
Data Mining: Where is it Heading? (Panel)
Authors: Jiawei Han
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Data mining is a promising field in which research and development activities are flourishing. It is also a young field with vast, unexplored territories. How can we contribute significantly to this fast expanding, multi-disciplinary field? This panel will bring database researchers together to share different views and insights on the issues in the field. 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
Enabling the Collaborative Construction and Reuse of Knowledge through a Virtual Reference Environment
Authors: J. Alfredo Sánchez, Alberto García, Carlos Proal, Lourdes Fernández
Venue: Proceedings of the Seventh International Workshop on Groupware (2001)

Abstract: This paper analyzes some of the factors that prevent knowledge construction and reuse in traditional library settings and describes VRef, an environment designed to provide users with the functionality of digital libraries in the areas of collaboration and social construction of knowledge. VRef makes it possible for users to post their information needs to a virtual space accessible to all system users. Information needs are addressed by reference librarians or by automated agents that use knowledge about problems solved successfully in the past. Whereas reference librarians have pre-assigned roles in this interaction, other users may volunteer their expertise and participate in the solution of open questions. The interaction among users playing different roles is recorded so successful responses form a valuable knowledge repository that can be reused and enriched by users and their agents. VRef facilitates the transition from the traditional reference desk on to the more dynamic role of a digital reference librarian.
Towards an MDA-Oriented Methodology
Authors: Marie-Pierre Gervais
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

With the introduction of the Model Driven Architecture by the OMG, modeling technology seems to take the step on the middleware technology for distributed applications development. The MDA recommends to separate the business from their technical aspects in the development of applications. Modeling techniques offer tools providing abstraction that enables the isolation of business concerns from their technical achievement. EDOC Profile is an example of such tools as it provides a modeling framework. It makes use of the RM-ODParchitectural framework that provides conceptual tools. These tools, so useful are, remain insufficient in the sense that they do not provide any process to guide the software designers in the modeling step, i.e., they are not methodological tools.We present in this paper a methodology based on the RM-ODP that falls under the MDA initiative. We describe its principles by illustrating them with an example. Then we provide the research directions enabling to get a fully compliant MDA methodology.
Image Categorization Using Texture Features
Authors: Aya Soffer
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

A method for finding all images from the same category as a given query image (termed categorization) using texture features is presented. The hypothesis that two images that are similar in texture are likely to belong to the same category, is examined. A new texture feature termed NxM-gram is presented. It is based on the N-gram technique that is commonly used for text similarity. The process of computing an image profile in terms of its NxM-grams is described.Results of experiments on images from various categories are presented. The NxM-gram method with three different similarity measures is compared to the results of categorization using other well known texture features and grey level distribution features. The results show that for our test images texture features are suitable for image categorization, and NxM-gram based methods are the best overall choice of texture feature for this task.
Improving Communication through Mobile Technologies: Which Possibilities?
Authors: Monica Divitini, Ove Kristian Haugalokken, Per-Arne Norevik
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

This paper discusses the potentialities in using mobile technologies to improve communication among students and among students and teachers. The discussion is based on the results of a questionnaire on the actual usage of mobile technologies by students and on students' interest in adopting them in the educational context.
Object-Oriented Evolutionary Database Design for Software Metrics Data
Authors: Raymond A. Paul, Tosiyasu L. Kunii, Yoshihisa Shinagawa, Arif Ghafoor
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

In this paper we present an approach to manage evolutionary changes that take place over time in an object-oriented software metrics database schema. Our framework is based on Entity-Relation (E-R) model and uses a recursive graph structure, known as R-graph, to support the views of software quality and risk. The fundamental mechanism for abstracting views is the introduction of two semantic operators for the R-graph. These operators are proposed based on graph-based predicates and Petri-net based predicate formalism for view abstraction.
Efficient Parallel Algorithms for Optimally Locating a k-Leaf Tree in a Tree Network
Authors: Shan-Chyun Ku, Wei Kuan Shih, Biing-Feng Wang
Venue: Proceedings of the international Conference on Parallel Processing (1997)

In this paper, an efficient parallel algorithm is proposed for finding a k-tree core of a tree network. The proposed algorithm performs on the EREW PRAM in O(log n log* n) time using O(n) work.