ppxscal/embedding_network huggingface dataset:
he San Francisco project: an object-oriented framework approach to building business applications
Authors: Kathy Bohrer, Verlyn Johnson, Anders Nilsson, Bradley Rubin
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

The San Francisco project is developing several shareable frameworks in Java. The frameworks include an infrastructure for distributed object applications, business objects that are common across multiple domains, and domain specific frameworks that contain a subset of the objects and business logic that are needed to build a commercial application. The goal is to simplify the move to distributed and easily customizable applications by providing developers with an object-oriented infrastructure and a starter set of well-designed object framework code for their applications. The paper provides an overview of the frameworks that are being developed.
An Open Framework for Integrated Qualification Management Portals
Authors: Michael Fuchs, Claudio Muscogiuri, Claudia Niederée, Matthias Hemmje
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Systematic and individual qualification improvement in a professional context is a challenging task, which is based on a complex knowledge supply chain. Human as well asvirtual actors contribute to this supply chain and have to be supported by adequate system services.The authors believe that a qualification management portal that integrates support for all qualification-related activities like course production, content provision, teaching, and learning, into an open system enables the flexibility, responsiveness, and community-orientation that is necessary for modern qualification support. The coupling of the involved processes and roles enables synergies and innovative communication opportunities.A flexible, extensible, and standard-compliant framework for such integrated qualification management portals has been developed in the eQualification project. By integrating user-friendly and task-oriented application authoring tools for qualification portal design and evolution into the Web application itself, users are empowered to act as application co-designers.
Dynamic Software Architecture Slicing
Authors: Taeho Kim, Yeong-Tae Song, Lawrence Chung, Dung T. Huynh
Venue: 23rd International Computer Software and Applications Conference (1999)

Software architectural design is becoming increasingly important in software engineering, as being manifested through various recent developments in the field such as the component based software engineering paradigm and the distributed and collaborative computing paradigm.Abstraction is such a mechanism as the key concept underpinning software architecture, namely hiding the immense amount of details. Despite its long recognized benefits, however, abstraction can also pose difficulties with the understanding and analysis of software architecture since one architecture can result in potentially an infinite number of different system behaviors. In order to alleviate such difficulties, we introduce the notion of dynamic software architecture slicing (DSAS), a methodology for using the notion, and an algorithm to generate dynamic software architecture slice. We demonstrate the feasibility and the expected benefits of the approach by using an illustrative example.
The emulation problem on trees
Authors: Daw-Jong Shyu, Biing-Feng Wang, Chuan-Yi Tang
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

In this paper, an optimal emulation for trees is proposed. Besides, as an extension of the proposed emulation for trees, optimal emulations for X-trees, m-ary trees, and pyramids are also proposed.
A Runtime Composite Service Creation and Deployment Infrastructure and its Applications in Internet Security, E-Commerce, and Software Provisioning
Authors: David Mennie, Bernard Pagurek
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

The creation of composite services from service components at runtime can be achieved using several different techniques. In the first approach, a new common interface is constructed at runtime which allows the functionality of two or more components to be accessed from a single entity while the service components themselves remain distinct and potentially distributed within in a network. In the second approach, a new composite service is formed where all of the functionality of the service components is housed within a single new service. In the third approach, a new composite service is formed where all the functionality of the service components is extracted and re-assembled into the body of a single new service. This paper describes the design of an infrastructure to support the runtime creation of composite services. An application to create user-defined security associations dynamically and deploy them between any two points in the Internet is presented to exemplify the need for dynamic service composition techniques. Some other potential applications in e-commerce and software provisioning are also discussed.
Oracle Parallel Warehouse Server
Authors: Gary Hallmark
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Oracle is the leading supplier of data warehouse servers, yet little has been published about Oracle's parallel warehouse architecture. After a brief review of Oracle's market, performance, and platform strengths, we present two novel features of the Oracle parallel database architecture. First, the data flow model achieves scalability while using a fixed number of threads that is independent of the complexity of the query plan. Second, a new "load shipping" architecture combines the best aspects of data shipping and function shipping, and runs on shared everything, shared disk, and shared nothing hardware.
Quantitative Analysis on Caching Effect of I-Structure Data in Frame-Based Multithreaded Processing
Authors: Hyong-Shik Kim, Soonhoi Ha, Chu Shik Jhon
Venue: Proceedings of the international Conference on Parallel Processing (1997)

Since long latency due to remote memory access could be tolerated by rapidly switching to another thread in multithreaded processing, caching I-structure data is expected to have less beneficial effect on the performance than caching ordinary data. In this paper, we show that caching I-structure data could improve the overall performance in spite of latency tolerating property of multithreading. Our quantitative analysis reveals that the most important caching effect of I-structure data in frame-based multithreading is the enhancement of frame parallelism. It reduces the idle time due to latency by lowering latency sensitivity and at the same time decreases the thread processing time by exploiting more processors.
A Psychomotor Method for Tracking Handwriting
Authors: Stefan Jaeger
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper proposes a model for tracking handwriting based on curvature minimization. Aiming at recovering stroke sequences from words written in the past, the problem is formulated as a graph theoretical question. The solution does not require mathematical functions. In particular, loops are considered elementary basic strokes and are not approximated with functions. Recovering stroke sequences is equivalent to ordering the edges of a graph, which can be derived in a straightforward manner from the scanned binary word image. This paper does not deal with any special recognition method. However, an important aim is to provide a mechanism for deriving temporal information to help to improve off-line recognition methods. The most important advantages of this method over methods proposed so far are: a single global principle (global optimization of curvature), implicit modeling of retraced strokes and simplicity.
Reviving Pacbase COBOL-Generated Code
Authors: Jean-Philippe Bernardy
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

We have migrated a large scale application from Pacbase to COBOL. The technique is to apply, in an iterative fashion, a set of small transformation patterns on Pacbase COBOL-output. Thus, equivalence with the Pacbase code is easily verified.
Devising Best Practices for Customization of a Multi-Agent Production Planning Technology
Authors: Philippos Koutsakas, Adamantios Koumpis
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

In the paper we report on our experiences related to the provision of a best practices and customization guide for the application of Multi-agent technologies in the production management field.
The Dreaming Knowledge Base
Authors: Pierluigi Assogna
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

The paper presents the early stage of an experiment in knowledge management, calledDreaming Knowledge Base, that is built upon the analogy between the self-organizing functions of knowledge performed by dreams, and the structuring of an organizational KB.The requirements in terms of knowledge, imposed by the context on a complex social organization, are analyzed, concluding that the structure of knowledge is a complex fractal-like system in itself.Then the analogy of genetics and memetics is considered, introducing the concept of theholomeme, that is the holonic representation of memes and of their groupings in our minds, and their role in the structuring of knowledge.A person's knowledge evolves partly during daytime under the control of conscience, and even more during sleep, in the dreaming process: the extended connections between holomemes are created mostly unconsciously, with self-organizing processes.The experiment consists in exploring the use of automatic processes that create and reinforce extended connections between documents and holomemes (structured in an ontology), during the "dream time" of a Knowledge Base that follows a circadian cycle.The issue that is being addressed is that of introducing chaotic behaviors in the dream-likephase.The KB users are involved in validating the results of the self-organization. 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
An Interaction-Based Approach for Structuring Coordination Activities
Authors: Lars Taxén
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

In this contribution we present a theoretical approach which has been utilized to inform the coordination of the development of complex systems. Coordination is regarded as a form of human activity in which individual and social aspects as well as technical ones need to be considered. We analyze human activity from an interaction point of view in which various types of signs mediate the relation between individual cognition and phenomena in the environment. The sign-mediated interaction is apprehended as having a connectional, conceptual and linguistic facet. From a cognitive and semiotic analysis of these facets, we conjecture that the following constittuents are fundamental for human activity: intersubjectivity, experimental learning, contextuality, spatiality, temporality, stabilizing core and tool usage. These constituents are employed in structuring human activity from a coordination point of view as activity domains. A framework for articulating activity domains is described. This framework, which includes information system support, is currently used to coordinate the software integration of the 3 rd generation mobile systems at the Ericsson company. We report on some result from this usage. The result indicate that the theoretical approach is relevant for practical purposes.
A Structured Approach to Handling On-Line Interface Upgrades
Authors: Cliff B. Jones, Alexander B. Romanovsky, Ian Welch
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

The integration of complex systems out of existing systems is an active area of research and development. There are many practical situations in which the interfaces of the component systems, for example belonging to separate organisations, are changed dynamically and without notification. In this paper we propose an approach to handling such upgrades in a structured and disciplined fashion. All interface changes are viewed as abnormal events and general fault tolerance mechanisms (exception handling, in particular) are applied to dealing with them. The paper outlines general ways of detecting such interface upgrades and recovering after them. An Internet Travel Agency is used as a case study.
Improving Collective I/O Performance Using Threads
Authors: Phillip M. Dickens, Rajeev Thakur
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Massively parallel computers are increasingly being used to solve large, I/O intensive applications in many different fields. For such applications, the I/O requirements quite often present a significant obstacle in the way of achieving good performance, and an important area of current research is the development of techniques by which these costs can be reduced. One such approach is collective I/O, where the processors cooperatively develop an I/O strategy that reduces the number, and increases the size, of I/O requests, making a much better use of the I/O subsystem. Collective I/O has been shown to significantly reduce the cost of performing I/O in many large, parallel applications, and for this reason serves as an important base upon which we can explore other mechanisms which can further reduce these costs. One promising approach is to use threads to perform the collective I/O in the background while the main thread continues with other computation in the foreground. In this paper, we explore the issues associated with implementing collective I/O in the background using threads.The most natural approach is to simply spawn off an I/O thread to perform the collective I/O in the background while the main thread continues with other computation. However, our research demonstrates that this approach is frequently the worst implementation option, often performing much more poorly than just executing collective I/O completely in the foreground. To improve the performance of thread-based collective I/O, we developed an alternate approach where part of the collective I/O operation is performed in the background, and part is performed in the foreground. We demonstrate that this new technique can significantly improve the performance of thread-based collective I/O, providing up to an 80% improvement over sequential collective I/O (where there is no attempt to overlap computation with I/O). Also, we discuss one very important application of this research which is the implementation of the split-collective parallel I/O operations defined in MPI 2.0.
Periodic Retrieval of Videos from Disk Arrays
Authors: Banu Özden, Rajeev Rastogi, Abraham Silberschatz
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

A growing number of applications need access to video data stored in digital form on secondary storage devices (e.g., video-on-demand, multimedia messaging). As a result, video servers that are responsible for the storage and retrieval, at fixed rates, of hundreds of videos from disks are becoming increasingly important. Since video data tends to be voluminous, several disks are usually used in order to store the videos. A challenge is to devise schemes for the storage and retrieval of videos that distribute the workload evenly across disks, reduce the cost of the server and at the same time, provide good response times to client requests for video data. In this paper, we present schemes that retrieve videos periodically from disks in order to provide better response times to client requests. We present two schemes that stripe videos across multiple disks in order to distribute the workload uniformly among them. For the two striping schemes, we show that the problem of retrieving videos periodically is equivalent to that of scheduling periodic tasks on a multiprocessor. For the multiprocessor scheduling problems, we present and compare schemes for computing start times for the tasks, if it is determined that they are scheduleable.
Dealing with Denial-of-Service Attacks in Agent-enabled Active and Programmable Infrastructures
Authors: Stamatis Karnouskos
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

Denial of Service (DoS) attacks is a well-known problem with victims even among prestigious commercial sites. Such attacks in traditional networking are difficult to recognize and to handle. An active infrastructure that can dynamically respond to event-triggered requests can deal better with recognition and handling of DoS attacks. We present here a DoS attack response system architecture and we demonstrate via an application scenario its dynamicity and flexibility in dealing with this kind of attacks. The approach is based on agent-enabled active programmable infrastructures and makes heavy use of the mobile agent technology in order to asynchronously respond to critical situations. Finally we comment on the pros and cons of our approach and discuss future directions that could be followed.
Robust Anisotropic Diffusion to Produce Clear Statistical Parametric Map from Noisy fMRI
Authors: Hae Yong Kim, Zang Hee Cho
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

Functional magnetic resonance imaging (fMRI) uses MRI to noninvasively map areas of increased neuronal activity in human brain without the use of an exogenous contrast agent. Low signal-to-noise ratio of fMRI images makes it necessary to use sophisticated image processing techniques, such as statistical parametric map (SPM), to detect activated brain areas. This paper presents a new technique to obtain clear SPM from noisy fMRI data. It is based on the robust anisotropic diffusion. A direct application of the anisotropic diffusion to fMRI does not work, mainly due to the lack of sharp boundaries between activated and non-activated regions. To overcome this difficulty, we propose to calculate SPM from noisy fMRI, compute diffusion coefficients in the SPM space, and then perform the diffusion in fMRI images using the coefficients previously computed. These steps are iterated until the convergence. Experimental results using the new technique yielded surprisingly sharp and noiseless SPMs.
Functional Trees for Classification
Authors: Joao Gama
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

The design of algorithms that explore multiple representation languages and explore different search space has an intuitive appeal.In this context of classification problems, algorithmsthat generate multivariate trees are able to explore multiplerepresentation languages by using decision test based on acombination of attributes.The same applies to models threesalgorithms, in regression domains, but using linear models atleaf nodes.In this paper we study where to use combinations of attributes in decision tree learning.We present an algorithm for multivariate tree learning that combines a univariate decision tree with a discriminant function by means of constructiveinduction.This algorithm is able to use decision nodes with multivariate tests, and leaf nodes that predict a class using adiscrimnant. Multivariate decision nodes are built when growing the tree, while functional leaves are built when pruning the tree.Functional trees can be seen as a generalization of multivariate trees.Our algorithm was compared against to its components and two simplified versions using 30 benchmark datasets. The experimental evaluation shows that our algorithm has clear Advantages with respect to the generalization ability and model sizes at statistically significant.
Tioga-2: A Direct Manipulation Database Visualization Environment
Authors: Alexander Aiken, Jolly Chen, Michael Stonebraker, Allison Woodruff
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

This paper reports on user experience with Tioga, a DBMS-centric visualization tool developed at Berkeley. Based on this experience, we have designed Tioga-2 as a direct manipulation system that is more powerful and much easier to program. A detailed design of the revised system is presented, together with an extensive example of its application.
Complex Query Decorrelation
Authors: Praveen Seshadri, Hamid Pirahesh, T. Y. Cliff Leung
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

Complex queries used in decision support applications use multiple correlated subqueries and table expressions, possibly across several levels of nesting. It is usually inefficient to directly execute a correlated query; consequently, algorithms have been proposed to decorrelate the query, i.e., to eliminate the correlation by rewriting the query. This paper explains the issues involved in decorrelation, and surveys existing algorithms. It presents an efficient and flexible algorithm called magic decorrelation which is superior to existing algorithms both in terms of the generality of application, and the efficiency of the rewritten query. The algorithm is described in the context of its implementation in the Starburst Extensible Database System, and its performance is compared with other decorrelation techniques. The paper also explains why magic decorrelation is not merely applicable, but crucial in a parallel database system.
Efficient Identification of Traitors in Fingerprinted Multimedia Contents
Authors: M. Fernández, Miguel Soriano
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

In a fingerprinting scheme a different set of marks is embedded in each copy of a digital object, in order to deter illegal redistribution. A group of dishonest users, called traitors, collude to create a pirate copy that hides their identities, by putting together different parts of their copies. If the sets to be embedded are the codewords of an error correcting code then efficient algorithms can be used to trace the guilty. In this paper we present a tracing algorithm that taking advantage of soft-decision decoding techniques finds all possibly identifiable traitors.
Comparing Two Approaches to Modelling Decentralised Manufacturing Control Systems with UML Capsules
Authors: Robert W. Brennan, S. Olsen, Martyn Fletcher, Douglas H. Norrie
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

In this paper, we describe two orthogonal methodologies for building decentralised manufacturing control systems. The fundamental building block of these control systems is the UML capsule stereotype that can be used to design object-oriented software systems that areopen, agile, have capacity to manage real-time tasks and so can provide varying degrees of intelligence' within a 21 st century manufacturing environment. We also evaluate the merits of these two viewpoints using a discrete-event simulation experimental test bed.