ppxscal/embedding_network huggingface dataset:
The PROMOTE&reg; Prototype: A Meta2Model Based Process Oriented KMS
Authors: Dimitris Karagiannis, Robert Woitsch
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

This article introduces the EC-project PROMOTE¯ (IST-1999-11658) [1], [2], [3] where an overall framework for process-oriented knowledge management, starting at modelling knowledge intensive business processes in a web-environment and focusing on the knowledge management process such as identification, access, storage, distribution and evaluation where knowledge is being developed.The main focus of this text is the analysis of requirements of such a process oriented model based knowledge management system (KMS) and the system architecture of the PROMOTE¯ prototype.The application scenario "Quality Management for Software Development" is introduced to depict the realisation of the KMS.
From MSC and UML to SDL
Authors: Stephan Bourduas, Ferhat Khendek, Daniel Vincent
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

UML and MSC are widely used by software practitioners. SDL is an ITU standard language fortelecommunications software specification. It has a formal semantics, and is supported by several commercial tools, which allow for simulation and validation of SDL design specifications as well as automatic code generation from these specifications. In order to take advantages of the SDL available tools and still use the very popular notations such as UML and MSC, we have developed an approach for specifying distributed systems in UML and MSC. MSCs are used to specify the behavior (scenarios) of the distributed system under consideration. UML, more precisely Class Diagrams and Object Diagrams, are used to specify the architecture of the system. By architecture, we mean the different components of the system and their interconnections. The MSC and UML specifications are translated automatically into a full SDL specification. In this paper, we introduce our distributed systemspecification style in UML and its automatic translation into an SDL architecture.
Two-Level Caching of Composite Object Views of Relational Databases
Authors: Catherine Hamon, Arthur M. Keller
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

We describe a two-level client-side cache for composite objects mapped as views of a relational database. A semantic model, the Structural Model, is used to specify joins on the relational database that are useful for defining composite objects. The lower level of the cache contains the tuples from each relation that have already been loaded into memory. These tuples are linked together from relation to relation according to the joins of the structural model. This level of the cache is shared among all applications using the data on this client. The higher level of the cache contains composed objects of data extracted from the lower level cache. This level of the cache uses the object schema of a single application, and the data is copied from the lower level cache for convenient access by the application. This two-level cache is designed as part of the Penguin system, which supports multiple applications, each with its own object schema, to share data stored in a common relational database.
A Directional and Parametrized Transition Detection Algorithm Based on Morphological Residues
Authors: Silvio Jamil Ferzoli Guimarães, Neucimar Jerônimo Leite, Michel Couprie, Arnaldo de Albuquerque Araújo
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

The boundary identification represents an interesting and difficult problem in image processing,mainly if two at zones are separated by a gradual transition. The most common operators workvery well for sharp edges, but fail for gradual transitions. In this work, we have done a characterization for gradient by a study of the opening residues. This characterization is useful to identify and classify sharp and gradual transitions between two consecutive at zones according to a size criterion.
H-Mine: Hyper-Structure Mining of Frequent Patterns in Large Databases
Authors: Jian Pei, Jiawei Han, Hongjun Lu, Shojiro Nishio, Shiwei Tang, Dongqing Yang
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Methods for efficient mining of frequent patterns have been studied extensively by many researchers. However, the previously proposed methods still encounter someperformance bottlenecks when mining databases with different data characteristics, such as dense vs. sparse, long vs. short patterns, memory-based vs. disk-based, etc.In this study, we propose a simple and novel hyper-linkeddata structure, H-struct , and a new mining algorithm, H-mine ,which takes advantage of this data structure anddynamically adjusts links in the mining process. A distinct feature of this method is that it has very limitedand precisely predictable space overhead and runs really fast in memory-based setting. Moreover, it ca be scaled up to very large databases by database partitioning, and whenthe data set becomes dense,(conditional)FP-trees can be constructed dynamically as part of the mining process. Our study shows that H-mine has high performance in various kinds of data, outperforms the previously developedalgorithms in different settings, and is highly scalable in mining large databases. This study also proposes a new datamining methodology, space-preserving mining ,which mayhave strong impact in the future development of efficient and scalable data mining methods.
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
Authors: Guy Even, Zvi Lotker, Dana Ron, Shakhar Smorodinsky
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

Motivated by a frequency assignment problem in cellular networks, we introduce and study a new coloring problem that we call Minimum Conflict-Free Coloring (Min-CF-Coloring). In its general form, the input of the Min-CF-coloring problem is a set system (X; S), where each S\varepsilon S is a subset of X. The output is a coloring \chi of the sets in S that satisfies the following constraint: for every x\varepsilon X there exists a color i and a unique set S\varepsilon S, such that x\varepsilon S and \chi(S) = i. The goal is to minimize the number of colors used by the coloring \chi.Min-CF-coloring of general set systems is not easier than the classic graph coloring problem. However, in view of our motivation, we consider set systems induced by simple geometric regions in the plane. In particular, we study disks (both congruent and non-congruent), axis-parallel rectangles (with a constant ratio between the smallest and largest rectangle) regular hexagons (with a constant ratio between the smallest and largest hexagon), and general congruent centrally-symmetric convex regions in the plane. In all cases we have coloring algorithms that use O(log n) colors (where n is the number of regions). For rectangles and hexagons we obtain a constant-ratio approximation algorithm when the ratio between the largest and smallest rectangle (hexagon) is a constant. We also show that, even in the case of unit disks, \Theta (\log n) colors may be necessary.
STR: A Simple and Efficient Algorithm for R-Tree Packing
Authors: Scott T. Leutenegger, J. M. Edgington, Mario A. Lopez
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

In this paper we present the results from an extensive comparison study of three R-tree packing algorithms, including a new easy to implement algorithm. The algorithms are evaluated using both synthetic and actual data from various application domains including VLSI design, GIS (tiger), and computational fluid dynamics. Our studies also consider the impact that various degrees of buffering have on query performance. Experimental results indicate that none of the algorithms is best for all types of data. In general, our new algorithm requires up to 50\% fewer disk accesses than the best previously proposed algorithm for point and region queries on uniformly distributed or mildly skewed point and region data, and approximately the same for highly skewed point and region data.
An Observational Theory of Integration Testing for Component-Based Software Development
Authors: Hong Zhu, Xudong He
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

Integration testing plays a crucial role in component-based software development. In complementary to the existing works on the selection of test cases and measurement of test adequacy in integration testing, this paper focuses on questions about how to observe the behaviours of a large and complicated system during dynamic testing. We first analyse the structure of white-box integration testing and propose a family of integration testing methods. We then discuss and formalise the requirements of proper uses of test drivers and component stubs in incremental integration. Finally, we propose a set of axioms for integration testing of concurrent systems.
An adaptive sequential prefetching scheme in shared-memory multiprocessors
Authors: Myoung Kwon Tcheun, Hyunsoo Yoon, Seung Ryoul Maeng
Venue: Proceedings of the international Conference on Parallel Processing (1997)

The sequential prefetching scheme is a simple hardware controlled scheme, which exploits the sequentiality of memory accesses to predict which blocks will be read in the near future. We analyze the relationship between the sequentiality of application programs and the effectiveness of sequential prefetching on shared-memory multiprocessors. Also, we propose a simple hardware scheme which selects the prefetching degree on each miss by adding a small table (PDS: Prefetching Degree Selector) to the sequential prefetching scheme. This scheme could prefetch consecutive blocks aggressively for applications with high sequentiality and conservatively for applications with low sequentiality.
Dependency-Spheres: A Global Transaction Context for Distributed Objects and Messages
Authors: Stefan Tai, Thomas A. Mikalsen, Isabelle Rouvellou, Stanley M. Sutton Jr.
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: Many enterprise systems employ both object-oriented middleware (OOM) and message-oriented middleware (MOM). However, support for the integration of object and messaging services, in particular for transaction processing across object and messaging components, is very limited. In this paper, we introduce the concept of Dependency-Spheres (D-Spheres), a global transaction context for distributed objects and messages. A D-Sphere integrates standard distributed object transactions and conditional asynchronous messages in one single unit-of-work. It is a new service for transaction processing that enhances two-phase-commit ACID transactions with pre-commit message delivery, concurrent evaluations of transaction-critical message conditions, and message compensation support for recovery. D-Spheres enrich standard OOM and MOM services, uniquely providing for an increased level of reliability for their use in combination in enterprise systems.
Implicit Test Sequences Compaction for Decreasing Test Application Cos
Authors: Roberto Bevacqua, Luca Guerrazzi, Fabrizio Ferrandi, Franco Fummi
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

Test pattern storage is an important problem affecting all Design for Testability (DfT) techniques based on scan-path. Test compaction is the key idea to reduce this problem, but in case of partial-scan test compaction would concern the concatenation and overlapping of test sequences instead of test vectors. Unfortunately, standard sequential TPGs do not show sufficient capabilities in test sequences compaction. Thus, the paper presents an innovative compaction strategy for test sequences based on implicit techniques. Preliminary results show that the use of the presented technique can sensibly reduce the amount of test patterns which must be stored and applied.
Providing Location Estimation within a Metropolitan Area Based on a Mobile Phone Network
Authors: Joseph Kee-Yin Ng, Stephen Ka Chun Chan, Kenny Ka Ho Kan
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Although location estimation algorithms based on signal attenuation may not be the most promising approach for providing location services, signal strength is the only common attribute available among various kind of mobile network. Together with the fact that the cell layout in metropolitan areas like Hong Kong is different from other smaller cities, this paper is an investigation and a revisit in search of a set of location estimation algorithms based on signal attenuation. With the technical support from a local mobile operator, we have constructed and conducted several real world experiments for our investigation and results are promising.
Physical Database Design for Data Warehouses
Authors: Wilburt Labio, Dallan Quass, Brad Adelberg
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Data warehouses collect copies of information from remote sources into a single database. Since the remote data is cached at the warehouse, it appears as local relations to the users of the warehouse. To improve query response time, the warehouse administrator will often materialize views defined on the local relations to support common or complicated queries. Unfortunately, the requirement to keep the views consistent with the local relations creates additional overhead when the remote sources change. The warehouse is often kept only loosely consistent with the sources: it is periodically refreshed with changes sent from the source. When this happens, the warehouse is taken off-line until the local relations and materialized views can be updated. Clearly, the users would prefer as little down time as possible. Often the down time can be reduced by adding carefully selected materialized views or indexes to the physical schema. This paper studies how to select the sets of supporting views and of indexes to materialize to minimize the down time. We call this the view index selection (VIS) problem. We present an A* search based solution to the problem as well as rules of thumb. We also perform additional experiments to understand the space-time tradeoff as it applies to data warehouses.
Document Input According to Recognition Accuracy of Handwritten Characters
Authors: Sueki Matsumura, Tomonori Kobayashi, Osamu Nakamura, Kenji Ogura
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Character recognition techniques are expected to be used for document input. Their recognition accuracy is however not always high for handwritten characters. Since the confirmation-correction input mode, used currently, becomes inefficient when there are many recognition errors, input methods relying solely on this mode are not suitable for document input when recognition accuracy is low. This paper proposes a document input method that selects the optimum input mode based on character recognition accuracy. This method automatically selects the optimum input mode using the relation between recognition accuracy and input efficiency and can increase overall input speed (the number of inputted characters per unit time) for any accuracy. Experimental results using handwritten documents verify that with this method input speed increases as a whole in comparison with input methods using a single input mode.
Hardware for fast global operations on multicomputers
Authors: Douglas V. Hall, Michael A. Driscoll
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

The results presented show that the addition of a secondary network with a wide-tree topology and one or more coordination processors to a message-passing-only multicomputer can speed up synchronization, broadcasting, global reduction, and other collective communication operations by two or three orders of magnitude. While the idea of a secondary network is in itself not new, modeling and simulation show that our system is faster, more cost effective, and more versatile than any others we have found. As as direct evidence of this latter point, our system is applicable to workstation cluster multicomputers as well as to "Big Iron" type multicomputers. Although our system provides a large performance gain for global operations, it increases overall system cost by only 2-3%.
Knowledge Discovery from Diagrammatically Represented Data
Authors: Michael Anderson
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Knowledge discover from diagrammatic data can be facilitated by a language that permits queries on such data.Such a language (diagrammatic SQL) is being developed to expedite the development of an autonomous artificially intelligent agent with a capacity to deal with diagrammatic information.This language is described and examples of how it can be used to facilitatediagrammatic data mining are detaled
Database Extensions for Complex Domains
Authors: Samuel DeFazio, Jagannathan Srinivasan
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

Future versions of the Oracle Server will provide an open and extensible framework for supporting complex data domains including, but not limited to, text, image, spatial, video, and OLAP. This framework encompasses features for defining, storing, updating, indexing, and retrieving complex forms of data with full transaction semantics. The underpinning for these features is an extended Oracle Server that is an object-relational database management system (ORDBMS).
Partitioning regular grid applications with irregular boundaries for cache-coherent multiprocessors
Authors: Yang Zeng, Santosh G. Abraham
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

We consider the problem of partitioning applications that operate on a regular grid but have irregular boundaries for a cache-coherent multiprocessor. Domain decomposition techniques such as RSB have commonly been used to reduce interprocessor communication in message passing multiprocessors. We apply these partitioning algorithms on cache-coherent multiprocessors to reduce cache-coherency traffic. We find that the actual cache-coherency traffic is approximately double the estimated true coherency traffic, primarily due to false-sharing and the consequent false coherency traffic. We devise two techniques that eliminate false sharing traffic in partitions produced using the common domain decomposition algorithms. In our compensation algorithm, we modify the partition produced by the domain decomposition to ensure that all the nodes on a cache line are assigned to the same processor. In our coalescing algorithm, nodes belonging to the same cache line are coalesced into a single node and the weights on nodes and arcs adjusted to represent the overall computation and communication costs of the coalesced nodes. This coalesced graph is partitioned using a domain decomposition algorithm and then the coalesced nodes in the partition are expanded. Our experimental results using an Indian Ocean circulation application on the KSR1 multiprocessor demonstrate that compensation reduces coherency traffic by as much as 55% and execution time by up to 18% and that graph coalescing reduces coherency traffic by up to 74%.
Creating Ensembles of Classifiers
Authors: Nitesh V. Chawla, Steven Eschrich, Lawrence O. Hall
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Ensembles of classifiers offer promise in increasing overall classification accuracy. The availability of extremely large datasets has opened avenues for application of distributed and/or parallel learning to efficiently learn models of them. In this paper, distributed learningis done by training classifiers on disjoint subsets of the data. We examine a random partitioning method to create disjoint subsets and propose a more intelligent way of partitioning into disjointsubsets using clustering. It was observed that the intelligent method of partitioning generally performs better than random partitioning for our datasets. In both methods a significant gain in accuracy may be obtained by applying bagging to each of the disjoint subsets, creating multiple diverse classifiers. The significance of our finding is that a partition strategy for even small/moderate sized datasets when combined with bagging can yield better performancethan applying a single learner using the entire dataset.
Beating a finite automaton in the big match
Authors: Lance Fortnow, Peter Kimmel
Venue: Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge (1998)

We look at the Big Match game, a variation of the repeated Matching Pennies game where if the first player plays tails the game ends with the first player receiving the last round's payoff. We study this game when the second player is implemented as a finite automation. We show several results including: &bull; If the first player knows the number of states of the second player's automaton then he can achieve the maximum score with a deterministic polynomial-time algorithm. &bull; If a deterministic first player does not know the number of states of the second player then he can not guarantee himself more than the minimum score. &bull; If we allow player one to run in probabilistic polynomial-time then he still cannot achieve the maximum score but he can get arbitrarily close. &bull; In a slight variation of the Big Match, the first player cannot have an even close to dominant strategy.
A Collaborative Framework for a Digital Library
Authors: Nieves R. Brisaboa, María J. Durán, Miguel R. Penabad, Ángeles S. Places
Venue: Proceedings of the 6th International Workshop on Groupware (2000)

The expansion that digital libraries are having nowadays through the Web suggests that their usefulness could be increased by converting them into meeting places for specialists, where they can share opinions and information. With new functionalities, digital libraries will really become collaborative frameworks for specialized workgroups. An advantage of this framework is that the researchers will feel more comfortable using a system with "human presence" than using a system where they are isolated, and their research will usually be more productive. The article presents a virtual library that stores data, transcribed texts and digitized pages of historic Spanish documents from the 16th-18th centuries. The main Web page is the unique entry point for this digital library that offers, besides the classical features of searching and browsing documents, added services like a bulletin board, chat, information about other members, and mail boxes.
Developing Reusable and Robust Language Processing Components for Information Systems using GATE
Authors: Kalina Bontcheva, Hamish Cunningham, Diana Maynard, Valentin Tablan, Horacio Saggion
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

In this paper we present GATE, an architecture and a graphical development environment which enables users to develop and deploy HLT applications in a robust fashion. GATE also provides reusable, extendable, and customisable language processing modules (e.g., part of speech tagger, named entity recognition grammars), which combined with the extensive document format support (e.g., XML, HTML), form a useful toolset for building HLT-augmented information systems.