ppxscal/embedding_network huggingface dataset:
A RDF-based Model for Expressing Spatio-Temporal Relations Between Web Sites
Authors: Sabin C. Buraga, Gabriel Ciobanu
Venue: Proceedings of the 3rd International Conference on Web Information Systems Engineering (2002)

The paper proposes a high-level model to representspatio-temporal relations between Web sites or fragmentsof Web sites in order to facilitate resource discovery,cataloging or describe information. This modelwill be based on the Resource Description Framework(RDF) recommendation of the World- Wide Web Consortium,a general purpose technology that enables thedescription of resources on the Web. The representationof the spatio-temporal relationships is expressed byan XML-based language.
Analysis of Memory Interference in Buffered Multiprocessor Systems in Presence of Hot Spots and Favorite Memories
Authors: Sajal K. Das, Sanjoy K. Sen
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

We present a discrete Markov chain model for analyzing the effect of memory interference in processor-memory interconnections of buffered multiprocessor systems. Each module is assumed to be one of the following three types-hot memory, favorite memory and memory which is neither hot nor favorite. The analytical solutions are restricted to 2/spl times/M and N/spl times/2 systems, where N and M are respectively the number of processors and memory modules. The general case is analyzed using simulation studies and compared with the analytic results. In all cases the main criterion of the system performance are the effective bandwidth, mean queue length and mean waiting time for a memory request. It is expected that increasing the number K of hot modules will improve the performance. We also estimate the asymptotic bandwidth and propose a heuristic to find an upper bound on K beyond which the bandwidth saturates.
Event Filtering Framework: Key Criteria and Design Trade-offs
Authors: Ehab S. Al-Shaer
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

Event filtering is an essential service to classify and disseminate events in distributed systems environment. This paper describes the design key criteria and challenges of developing high-performance event filtering for dynamic distributed applications such as automated monitoring in distributed systems. We also classify existing event filtering mechanisms according to the key criteria. In addition, we discuss the trade-offs of designing efficient and flexible event filtering mechanisms.
Subject Classification in the Oxford English Dictionary
Authors: Zarrin Langari, Frank Wm. Tompa
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

The oxford English Dictionary is a valuable source of lexical information and a rich testing ground for mining highly structured text.Each entry is organized into a hierarchy of senses, which include definitions, labels and cited quotations.Subject labels distinguish the subject classification of a sense, for example they signal how a word may be used in Anthropology, Music or Computing.Unfortunately subject labeling in the dictionary is incomplete. To overcome thisincompleteness, we attempt to classify the senses (i.e., definitions) in the dictionary by their subjects, using thecitations as an information guide.We report on four different approaches: K Nearest Neighbors, a standard classification technique; Term Weighting, an information retrieval method dealing with text; Naïve Bayes, a probabilistic method; and Expectation Maximization, An iterative probabilistic method.Experimental performance of these Methods is compared based on standard classification metrics.
The Behavior of Dynamic Relaxation in an Elastic Stroke Model for Character Recognition
Authors: Takeshi Nagasaki, Takayoshi Yamamoto, Masaki Nakagawa
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper presents an off-line handwritten character recognition method based on a dynamic system. The method employs rubber string models for standard character patterns (called an "Elastic Stroke Model") and matches them with the potential field made from an input pattern. The matching process is realized by a dynamic relaxation with DP algorithm which minimizes the dynamic energy of rubber and potential field. To study the effect of the local minimum problem inherent in the relaxation technique, we used an improved DP method implemented on a parallel machine to compute the global minimum. Some experiments are performed on the 10 sets of 46 categories from the Japanese set of Hiragana characters that come from the ETL8b2c database. As a result, it is shown that the local minimum has little influence on recognition rates in this method, and the elastic stroke model could absorb deformation of character patterns.
An Agglomerative Hierarchical Clustering Using Partial Maximum Array and Incremental Similarity Computation Method
Authors: Sung Young Jung, Taek-Soo Kim
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

As the tractable amount of data is growing in computer science area, fast clustering algorithm is being required because traditional clustering algorithms are not so feasible for very large and high dimensional data. Many studies have been reported for clustering of large database, but most of them circumvent this problem by using the approximation method to result in thedeterioration of accuracy. In this paper, we propose a new clustering algorithm by means of partial maximum array, which can realize the agglomerative hierarchical clustering with the same accuracy to the brute-force algorithm and has O(N 2 ) time complexity. And we alsopresent the incremental method of similarity computation which substitutes the scalar calculation for the time-consuming calculation of vector similarity. The experimental results show that clustering becomes significantly fast for large and high dimensional data.
Engineering Frameworks: A Prerequisite for the Design and Implementation of Distributed Enterprise Objects
Authors: Klaus-Peter Eckert, Peter Schoo
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

The paper presents the experiences made during the development of an application framework supporting the design, implementation and deployment of telecommunication services. It introduces the concepts of a TINA-C-compliant (Telecommunications Information Networking Architecture Consortium) environment as an example for a framework in an enterprise specific, vertical application domain. The paper shows the advantages of the definition of a supporting engineering framework including a set of related design patterns that allow to design application frameworks in a technology independent way. It presents the major concepts of a related middleware that has been designed as an ODP-compliant (Open Distributed Processing) distributed processing environment and that has been implemented in a heterogeneous CORBA 2 (Common Object Request Broker Architecture) environment. The presented work is a part of the research and development program of GMD FOKUS and builds the core of the Y middleware.
Discovering a system modernization decision framework: a case study in migrating to distributed object technology
Authors: Evan Wallace, Paul C. Clements, Kurt C. Wallnau
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

Many organizations face a serious challenge introducing new technologies into existing systems. Effective modernization requires knowing and articulating specific goals for the reengineering effort, conscious selection of technologies and technical approaches that can achieve those goals in the context of the class of system being upgraded, a staged migration plan, and an integration strategy to make in-hand components work under the newly adopted architecture. Although the study of reengineering is moving towards an engineering discipline, there are as yet no proven decision frameworks that allow an organization to rationally choose a modernization strategy. This paper provides an in-depth look at the engineering trade-offs made in modernizing a manufacturing engineering design system to use distributed object technology. From this case study, the outlines of a more general reengineering decision framework can be seen, and these are discussed.
Semi-Automatic Identification of Optic Disk by Image Processing for Quantitative Funduscopy
Authors: Wilian Flavio Rigo, Aurelio Paulo Batista Da Silva, Thomas W. Rauber
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

This paper describes the current state of research and development of a system for the partial automation of quantitative Funduscopy. Image processing techniques are used to segment the optic disk and estimate the parameters of the circumference associated with it. The global objective is to facilitate the diagnosis of pathologies like Systemic Arterial Hypertension and Diabetes Mellitus.
Multiscale Fractal Characterization of Three-Dimensional Gene Expression Data
Authors: Edson Tadeu M. Manoel, Luciano da Fontoura Costa, Johannes Streicher, Gerd B. Müller
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

Abstract. This article reports on the application of the recently introduced concept of multiscale fractal dimension (MFD) as a resource for quantifying three-dimensional gene expression patterns in embryonic development. While traditional fractal dimensions provide interesting possibilities for quantifying pattern complexity, as defined by the intensity in which the pattern interacts with its surrounding space, those approaches fail to take into account the important fact that natural objects are not perfectly self-similar. By expressing the fractal behavior explicitly in terms of the spatial scale, the MFD provides a more comprehensive and objective characterization of the complexity of natural data such as gene expression profiles. After presenting the MFD concept as well as a technique for its numerical estimation, the potential of this measure for objectively quantifying gene expression is discussed, and a complete example is provided regarding the three-dimensional expression of the myogenic marker gene Myf5 along successive somites in a mouse embryo. In this specific case, the adopted technique proved itself a useful means for identifying spatial variations of gene expression intensity.
Monadic Queries over Tree-Structured Data
Authors: Georg Gottlob, Christoph Koch
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widespread database query problem in the context of XML. Partly a survey of recent work done by the authors and their group on logical query languages for this problem and their expressiveness, this paper provides a number of new results related to the complexity of such languages over so-called axis relations (such as "child" or "descendant") which are motivated by their presence in the XPath standard or by their utility for data extraction (wrapping).
ACTISE: Advanced e-Commerce Technology Laboratories Integrated Services Environment - A User-Centric Office Framework for Knowledge Workers
Authors: Hung-Sheng Chiu, Tse-Ming Tsai, Han-Kuan Yu, Sheng-Hsiu Huang, Ping-Yao Liao, Hsin-Te Shih, Seng-cho Timothy Chou
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

This paper describes the design and implementation of a smart office task framework to automate system integration and to enable user centric application. To achieve the goal of implicit knowledge accumulation and inheritance, we developed a service framework at thebackend for integrating diverse systems seamlessly and an interface agent at the front for hiding complex efforts on manually binding different systems. ACT (Advanced e-Commerce Technology) laboratory adapted Web Services to wrap various existing systems into a general RMI format, utilized ontology to define and to integrate new functionalities semantically, and took advantage of agents to enable a user-centric office environment. The design rationale, application scenario, architecture, and future plan are presented.
Performance Analysis of Minimal Adaptive Wormhole Routing with Time-Dependent Deadlock Recovery
Authors: Fabrizio Petrini, Marco Vanneschi
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Deadlock recovery as a viable alternative to deadlock avoidance has recently gained an increasing consideration in the scientific community. In this paper we present a simple and efficient minimal adaptive wormhole routing algorithm that recovers from potential deadlocks. Rather than using a static or dynamic channel dependency graph, we remove from the network those packets that have stalled for more than a given timeout in a router. The experimental results, conducted on a 256 nodes bi-dimensional tones show that it is possible to find a timeout which is optimal for several communication patterns. Our algorithm provides good network latency, stable throughput above saturation and compares well with a deterministic and a minimal adaptive algorithm based on Duato's methodology with the same number of virtual channels.
Parallel 'Go with the Winners' Algorithms in the LogP Model
Authors: Marcus Peinado, Thomas Lengauer
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

We parallelize the 'Go with the winners' algorithm of Aldous and Vazirani and analyze the resulting parallel algorithm in the LogP-model. The main issues in the analysis are load imbalances and communication delays. The result of the analysis is a practical algorithm which, under reasonable assumptions, achieves linear speedup. Finally, we analyze our algorithm for a concrete application: generating models of amorphous chemical structures.
Efficient state assignment framework for asynchronous state graphs
Authors: Chantal Ykman-Couvreur, Bill Lin
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

This paper presents a new efficient state assignment framework for synthesizing asynchronous state graphs. This framework operates purely at the state graph level and is applicable to a broad class of behaviors. In this paper we focus the framework for solving the complete state coding problem. This method has been automated and applied to a large set of asynchronous circuits. It achieves significant improvements in terms of both circuit area and computation time.
Implementing interposition in CORBA Object Transaction Service
Authors: Ennio Grasso
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

One of the most important CORBA services defined by the OMG is the Object Transaction Service (OTS) which augments the CORBA object model with the notion of distributed transactions. The implementation design of the OTS is critical for the service to be really effective for applications. A good design suggests that the OTS should be part of the ORB (object request broker) itself rather than on top of it like normal CORBA objects. In this paper, we highlight the design implementation of the OTS within the Orbix product and describe how the interposition of transaction objects can be achieved by exploiting the hooks provided by the underlying ORB.
Evolution in Use of Groupware: Facilitating Tailoring to the Extreme
Authors: Robert Slagter, Margit Biemans, Henri ter Hofte
Venue: Proceedings of the Seventh International Workshop on Groupware (2001)

Abstract: Group work evolves, often leading to changing requirements on the technical support. To meet these new requirements groupware has to be modified. A system that allows end users to perform such modifications is called tailorable. This paper addresses the issue of facilitating end users in the most extreme form of tailoring: extending the set of functions of a groupware system. We have identified the services that form a groupware system and propose a building block method to construct tailorable groupware. Our component groupware architecture allows composition of groupware out of functional building blocks, and defines the rules for their composition. Furthermore, we describe how to support an end user in the process of tailoring a groupware application to suit evolution in use.
Profiling Optimized Code: A Profiling System for an HPF Compiler
Authors: Shaun Kaneshiro, Tatsuya Shindo
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

High Performance Fortran (HPF), a portable data-parallel language, is based on a high-level model which abstracts programming details away from the user. To achieve high performance, the HPF compiler must optimize the code, which may result in a significant change to the original code structure. Because the performances of the optimized and non-optimized codes differ, profiling HPF programs with compiler optimizations must be supported. This requires additional support in the compiler to report the profile data with respect to the original code as opposed to the transformed code. We developed a profiling system which maintains a history of code transformations, maps the original code to the optimized code, and reports profile data based on the original code. A version of the profiling system was successfully implemented for the Fujitsu HPF compiler and tested for several benchmarks on the Fujitsu AP1000 machine.
Automatic Reading of Cursive Scripts Using Human Knowledge
Authors: Myriam Coté, Mohamed Cheriet, Eric Lecolinet, Chin Y. Suen
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper presents a model for reading cursive script which has an architecture inspired by a reading model and which is based on perceptual concepts. We limit the scope of our study to the off-line recognition of isolated cursive words. First of all, we justify why we choose McClelland & Rumelhart's reading model as the inspiration for our system.Since a thorough description of our recognition method has been already done in a previous paper, a brief resumé of the method's behavior is presented and the main originalities of our model are underlined which are: development of a new technic for baseline extraction, choice of an architecture based on a reading model (hierarchical, parallel, with local representation and interactive activation mecanism), use of significant perceptual features in word recognition such as ascender and descender, creation of a fuzzy position concept dealing with the location uncertainty of features and letters, outside-in labeling process which mimics the human recognition process while reading, adaptability of the model to words of different lengths and from different languages. After this, we focus on the new updates added to the original system: a new baseline extraction module, a new feature extraction module, and a new generation, validation and hypotheses insertion process. After implementation of our method, new results have been obtained on real images and are discussed. We are concentrating now on validating the proposed model using a larger data base.
Automatic Array Alignment in Parallel Matlab Scripts
Authors: Igor Z. Milosavljevic, Marwan A. Jabri
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

We present the ParAL system which compiles Matlab scripts into C programs with calls to a parallel run-time library. The novel feature of the compiler is the optimisation of array alignment which reduces or eliminates unnecessary communication overheads. We have evaluated this technique on several Matlab codes. For comparison, the same applications were hand-coded using the PBLAS library. The aligned codes were on average 43% faster than the misaligned codes, with the speedup factor of almost 4 achieved in some cases. This opimisation technique enabled ordinary Matlab scripts to run at a similar speed as manually optimised PBLAS codes.
Secure Mediated Databases
Authors: K. Selçuk Candan, Sushil Jajodia, V. S. Subrahmanian
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

With the evolution of the information superhighway, there is now an immense amount of information available in a wide variety of databases. Furthermore, users often have the ability to access legacy software packages developed by external sources. However, sometimes both the information provided by a data source, as well as one or more of the functions available through a software package may be sensitive-in such cases, organizations require that access by users be controlled. HERMES (HEterogeneous Reasoning and MEdiator System) is a platform that has been developed at the University of Maryland within which mediators may be designed and implemented. HERMES has already been used for a number of applications. In this paper, we provide a formal model of security in mediated systems. We then develop techniques that are sound and complete and respect security constraints of packages/databases participating in the mediated system. The security constraints described an this paper have been implemented, and we describe the existing implementation.
A Design For Test Perspective on I/O Management
Authors: Kamran Zarrineh, Vivek Chickermane, Gareth Nicholls, Mike Palmer
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

The widespread adoption of hardware description languages (HDLs) and structured design for testability (DFT) methods in ASIC design flows has led to an increasing emphasis on technology independence. Many DFT techniques such as boundary scan design, I/O sharing between test and functional ports, I/O wrap testing etc., rely on an accurate I/O specification. This paper describes some novel technology independent solutions to the problem of I/O cell specification and synthesis of DFT structures that involve I/O cell transformations. The solution speed up behavioral simulation of the HDL specification while also providing accurate I/O models for test synthesis.
ULIXES: Building Relational Views over the Web
Authors: Paolo Atzeni, Alessandro Masci, Giansalvatore Mecca, Paolo Merialdo, Elena Tabet
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

The authors consider structured Web sites, those sites in which structures are so tight and regular that one can assimilate the site, from the logical viewpoint, to a conventional database. They have argued that, with respect to structured Web servers, it is possible to apply ideas from traditional database techniques, specifically with respect to design, query, and update. They focus on the querying process, which consists of associating a scheme with a server and then using this scheme to pose queries in a high level query language. To describe the scheme, they use a specific data model, called the ARANEUS Data Model (ADM). They call ADM a page oriented model, in the sense that the main construct of the model is that of a page scheme, used to describe the structure of sets of homogeneous pages in the server. ADM schemes are then offered to the user, who can query them using the ULIXES language, whose expressions produce relations as results. These are essentially relational views over Web data and can therefore be queried using any relational query language. It should be noted that the approach inherited some ideas from other proposals for query languages for the Web. However, these approaches are mainly based on a loose notion of structure, and tend to view the Web as a huge collection of unstructured objects, organized as a graph. In contrast, the approach explicitly considers structure, both in the information source (the Web) and in the derived information (the relational views).