ppxscal/embedding_network huggingface dataset:
Mapping Service Components to EJB Business Objects
Authors: Giacomo Piccinelli, Wolfgang Emmerich, Anthony Finkelstein
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: The emerging trends for e-business engineering revolve around specialisation and cooperation. Successful companies focus on their core competencies and rely on a network of business partners for the support services required to compose a comprehensive offer for their customers. Modularity is crucial for a flexible e-business infrastructure, but related requirements seldom reflect on the design and operational models of business information systems. Software components are widely used for the implementation of e-business applications, with proven benefits in terms of system development and maintenance. We propose a service-oriented componentisation of e-business systems as a way to close the gap with the business models they support. Blurring the distinction between external services and internal capabilities, we propose a homogeneous model for the definition of e-business applications components and present a process-based technique for component modelling. We finally present an Enterprise Java Beans extension that implements the model.
Document Clustering and Cluster Topic Extraction in Multilingual Corpora
Authors: Joaquim Ferreira da Silva, João Mexia, Carlos Agra Coelho, José Gabriel Pereira Lopes
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

A statistics-based approach for clustering documents and for extracting cluster topics is described. Relevant (meaningful) Expressions (REs) automatically extracted from corpora are used as clustering base features. These features are transformed and its number is strongly reduced in order to obtain a small set of document classificationfeatures. This is achieved on the basis of PrincipalComponents Analysis. Model-Based Clustering Analysis finds thebest number of clusters. Then, the most important REs are extracted from each cluster and taken as document cluster topics.
An Efficient Processing of Queries with Joins and Aggregate Functions in Data Warehousing Environment
Authors: Jin-Ho Kim, Yun-Ho Kim, Sang-Wook Kim, Sooho Ok
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

It is very important to process efficiently expensive queries including joins and/or aggregate functions in data warehousing environment since there resides enormous volume of data and the processing of these queries takes much time. In this paper, we propose a new method for processing the queries including both joins and aggregate functions. The proposed method performs grouping dimension tables with group-by conditions at first and then processes joins by using bitmap join indices. This allows to process aggregate functions by accessing fact tables only, thus it can reduce the serious performance degradation of existing methods. In order to show the superiority of the proposed method, we develop a cost model for both the proposed and the existing ones, and perform extensive simulations based on the TPC-H benchmark
Business Component Framework and Modeling Method for Component-Based Application Architecture
Authors: Jun Ginbayashi, Rieko Yamamoto, Keiji Hashimoto
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

A new, component-based application architecture, ComponentAA, is proposed for developing business application systems. The architecture enables an application system to be considered as a collected or "medium-grained" reusable software components. ComponentAA is made up of an effective combination of frameworks, patterns, and methodology. A set of component frameworks and their accompanying usage patterns can be used with Enterprise JavaBeans to develop business systems, based on the architecture. Each one of the frameworks has its own purpose and is designed to be reusable for a reasonably wide variety of application systems. Also, an object-oriented modeling method is provided to analyze and design business systems using the component-based architecture. These technologies have been examined and proved effective in several actual development projects for over a year.
A Parallel Priority Data Structure with Applications
Authors: Gert Stølting Brodal, Jesper Larsson Träff, Cristos D. Zaroliagis
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Presents a parallel priority data structure that improves the running time of certain algorithms for problems that lack a fast and work-efficient parallel solution. As a main application, we give a parallel implementation of Dijkstra's (1959) algorithm which runs in O(n) time while performing O(m log n) work on a CREW PRAM. This is a logarithmic factor improvement for the running time compared with previous approaches. The main feature of our data structure is that the operations needed in each iteration of Dijkstra's algorithm can be supported in O(1) time.
Randomized Initialization Protocols for Packet Radio Networks
Authors: Tatsuya Hayashi, Koji Nakano, Stephan Olariu
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

The main contribution of this work is to propose efficient randomized leader election and initialization protocols for Packet Radio Networks (PRN, for short). As a result of the initialization protocol, the n stations of a PRN are assigned distinct integer IDs from1 to n. The results include protocols to: (1) initialize the single-channel PRN with the collision detection (CD) capability in O(n) rounds with probability at least 1 - 1/2n ; (2) initialize the k-channel PRN with CD capability in O( n/k ) rounds with probability at least 1 - 1/n , whenever k = n/3 log n ; (3) elect a leader on the single-channel PRN with no CD in O((log n)2 ) broadcast rounds with probability at least 1 -1/n ; (4) initialize the single-channel PRN with no CD in O(n) rounds with probability at least 1 - 1/2vn ; (5) initialize the k-channel PRN with no CD in O( n/k ) broadcast rounds with probability at least 1 - 1/n , whenever k = n/4(log n)2.
The MaBE Project: An Agent-Based Environment for Business Networks
Authors: Alexander Hämmerle, Georg Weichhart, Kurt Fessl
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

The MaBE (Multiagent Business Environment) project is a R&D project in the 5th framework program of the European Union. Its primary objective is the development of an open, agent-based environment to enable dynamic and automated combination of multiple, complementary and alternative services between different users and providers along the whole value chain. The industrial grounding is ensured by user requirements from industrial end-users in the project, all being league players in their respective business areas. In this paper we motivate our research objectives and describe the basic concepts of the project, highlighting the holonic aspects.
Sampling-Based Selectivity Estimation for Joins Using Augmented Frequent Value Statistics
Authors: Peter J. Haas, Arun N. Swami
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

We compare empirically the cost of estimating the selectivity of a star join using the sampling-based t-cross procedure to the cost of computing the join and obtaining the exact answer. The relative cost of sampling can be excessive when a join attribute value exhibits "heterogeneous skew." To alleviate this problem, we propose Algorithm TCM, a modified version of t-cross that incorporates "augmented frequent value" (AFV) statistics. We provide a sampling-based method for estimating AFV statistics that does not require indexes on attribute values, requires only one pass though each relation, and uses an amount of memory much smaller than the size of a relation. Our experiments show that the use of estimated AFV statistics can reduce the relative cost of sampling by orders of magnitude. We also show that use of estimated AFV statistics can reduce the relative error of the classical System R selectivity formula.
Analyzing the Interestingness of Association Rules from the Temporal Dimension
Authors: Bing Liu, Yiming Ma, Ronnie Lee
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Rule discovery is one of the central tasks of data mining. Existing research has produced many algorithms for the purpose. These algorithms, however, often generate too manyrules. In the past few years, rule interestingness techniques were proposed to help the user find interesting rules. These techniques typically employ the dataset as a whole to mine rules, and then filter and/or rank the discovered rules in various ways. In this paper, we argue that this is insufficient. These techniques are unable to answer a question that is of criticalimportance to the application of rules, i.e., can the rules be trusted? In practice, the users are always concerned with the question. They want to know whether the rules indeed represent some true and stable (or reliable)underlying relationships in the domain. If a rule is not stable, does it show any systematic pattern such as a trend? Before any rule can be used, these questions must be answered. This paper proposes a technique to use statistical methods to analyze rules from the temporal dimension to answer these questions. Experimental results show that the proposed technique is very effective.
The Application of Case-Based Reasoning to Early Web Project Cost Estimation
Authors: Emilia Mendes, Nile Mosley, Steve Counsell
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Literature shows that over the years numerous techniques for estimating development effort have been suggested, derived from late project measures. However, to the successful management of software projects, estimates are necessary throughout the whole development life cycle.The objective of this paper is twofold. First, we describe the application of case-based reasoning (CBR) for estimating Web hypermedia development effort using measures collected at different stages in the development cycle. Second, we compare the prediction accuracy ofthose measures, obtained using different CBR configurations.Contrary to the expected, late measures did not show statistically significant better predictions than early measures.
Towards Declarative XML Querying
Authors: Mengchi Liu, Tok Wang Ling
Venue: Proceedings of the 3rd International Conference on Web Information Systems Engineering (2002)

How to extract data from XML documents is an importantissue for XML research and development. However,how to view XML documents determines how they can bequeried. In this paper, we first describe a natural way toview XML documents as in complex object data models sothat we can easily comprehend XML data from databasepoint of view. We then illustrate how to use logical variablesto extract data from XML documents. We also describea rule-based declarative query language for XML.We demonstrate that our rule-based language provides auniform framework that is advantageous over other XMLquery languages including XQuery in the following ways.First, it provides a natural way for separating querying andresult constructing using the body and the head respectively.Second, several rules can be used for the same query so thatcomplex queries can be expressed in a simple and naturalway. Also, its use of logical variables and rules makes manyfunctions and operators in XQuery and XPath unnecessaryor definable constructively. Finally, it provides a naturaland direct support for recursion as in deductive databasesand has logical foundations that have played a significantrole in database research in the past.
Plan Tracking Knowledge Base
Authors: Dick B. Simmons, Ching-Seh Wu
Venue: 24th International Computer Software and Applications Conference (2000)

Creating project plans is a key management activity. Software project managers spend a lot of their time manually gathering data to track software project compliance to plans. This paper describes a knowledge base framework that is created by computer tools that gather information from project files. The framework provides facts to intelligent agents to help managers track compliance to plans. The plan-tracking framework is an extension of the PAMPA tool knowledge base structure.
Data parallel fault simulation
Authors: Minesh B. Amin, Bapiraju Vinnakota
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

Fault simulation is a compute intensive problem. Data parallel simulation on multiple processors is one method to reduce fault simulation time. We discuss a novel technique to partition the fault set for data parallel fault simulation. When applied statically, the technique can scale well for up to eight processors. The fault set partitioning technique is simple, can itself be parallelized, and can be implemented with extreme ease. Therefore, the technique can be used on a low cost parallel resource, such as a network of workstations.
Abstraction, concurrency, and communal computing in SequenceL
Authors: Daniel E. Cooke
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

SequenceL is a new computer language that provides declarative constructs for nonscalar processing. In SequenceL, a problem solver provides little in the way of iterative/recursive details in a problem solution. Instead, the problem solver describes the solution directly by specifying, via a metastructure, the data products which will hold results useful in solving the problem. SequenceL is a small language (i.e., there are a small number of language constructs), and it is not domain dependent.
Assurance of Transactions in Allied Heterogeneous Systems by Autonomous Decentralized System Techniques
Authors: Hideo Hanamura, Kinji Mori
Venue: The 3rd IEEE International Symposium on High-Assurance Systems Engineering (1998)

Autonomous Decentralized System(ADS) has been designed for high flexibility to realize the on-line properties of on-line maintenance, on-line expansion and fault tolerance. However, users' needs are increasingly varied and quickly change today. To satisfy those needs a homogeneous system such as a conventional ADS has limits in its capability to provide adequate services through heterogeneous application systems which are consist of different properties and quality data. Thus the integration of heterogeneous systems are required. This paper presents the techniques for the integration of the heterogeneous systems in ADS based on DF architecture and discusses atomic actions on the DF, then shows the effectiveness of the allying techniques in implementation.
Large Scale Simulation of Parallel Molecular Dynamics
Authors: Pierre-Eric Bernard, Thierry Gautier, Denis Trystram
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

This paper aims to describe the implementation of TAKAKAW, an efficient parallel application for the simulation of molecular dynamics designed to handle large proteins in biology. The implementation is based on the multi-threading parallel programming environment, called ATHAPASCAN 1 which allows to implement and evaluate easily several load-balancing strategies. Some experiments run on one of the largest molecule ever simulated (a hydrated β-galactosidase with 413039 atoms) show the interest of such a parallel programming environment.Keywords. Load balancing - Threads - Parallel Molecular Dynamics
A Genetic Algorithm Based Routing Method Using Two QoS Parameters
Authors: Leonard Barolli, Akio Koyama, Kazunori Matsumoto, Takuo Suganuma, Norio Shiratori
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

In order to support multimedia communication over high speed networks, it is necessary to develop routing algorithms which use for routing more than one QoS parameter. This is because new services such as video on demand and remote meeting systems require better QoS. However, the problem of QoS routing is difficult and to find a feasible route with two independent path constraints is NP-complete. Therefore, QoS routing algorithms for high speed networks must be adaptive, flexible, and intelligent for efficient network management. In this paper, we propose a QoS routing method based on Genetic Algorithm (GA). The proposed method uses two QoS parameters for routing. The simulation results show that proposed method has a better performance than a routing algorithm with only one QoSparameter and a conventional method.
Indiscernibility Degree of Objects for Evaluating Simplicity of Knowledge in the Clustering Procedure
Authors: Shoji Hirano, Shusaku Tsumoto
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

This paper presents a new, rough sets-based clusteringmethod that enables evaluation of simplicity of classification knowledge during the clustering procedure. The method iteratively refines equivalence relations so that they become more simple set of relations that give adequately coarse classification to the objects. At each step ofiteration, importance of the equivalence relation is evaluated on the basis of the newly introduced measure, indiscernibility degree. An indiscernibility degree is defined as a ratio of equivalence relations that classify the two objects into the same equivalence class. If an equivalence relation hasability to discern the two objects that have high indiscernibility degree, it is considered to perform too fine classification and then modified to regard them as indiscernible objects. The refinement is repeated decreasing the threshold level ofindiscernibility degree, and finally simple clusters can beobtained. Experimental results on the artificial data showed that iterative refinement of equivalence relation lead tosuccessful generation of coarse clusters that can be representedby simple knowledge.
How Much Does Network Contention Affect Distributed Shared Memory Performance?
Authors: Donglai Dai, Dhabaleswar K. Panda
Venue: Proceedings of the international Conference on Parallel Processing (1997)

Most of recent research on distributed shared memory (DSM) systems have focused on either careful design of node controllers or cache coherence protocols. While evaluating these designs, simplified models of networks (constant latency or average latency based on the network size) are typically used. Such models completely ignore network contention. To help network designers to design better networks for DSM systems, in this paper, we focus on two goals: 1) to isolate and quantify the impact of network link contention and network interface contention on the overall performance of DSM applications and 2) to study the impact of critical architectural parameters on these two categories of network contention. We achieve these goals by evaluating a set of SPLASH2 benchmarks on a DSM simulator using three network models. For an 8x8 wormhole system, our results show that network contention can degrade performance up to 59.8%. Out of this, up to 7.2% is caused by network interface contention alone. The study indicates that network contention becomes dominant for DSM systems using small caches, wide cache line sizes, low degrees of associativity, high processing node speeds, high memory speeds, low network speeds, or small network link widths.
Compunication: From Concept to Practice
Authors: Wen Gao
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

This paper is addressing the compunication technology as well as our effort in this area. Compunication is a new growing area which basically is a baby made of computing and communication technologies. Compunication technology is driven by application and information industry. Compunication is not a simply integration between computing and communication. The marriage will bring cheap/fast communication and powerful multimedia computing, networking abilities to us in a single device. 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
A Theory of Window-Based Unicast Congestion Control
Authors: Nishanth R. Sastry, Simon S. Lam
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

This work presents a comprehensive theoretical framework for window-based congestion control protocols that are designed to converge to fairness and efficiency. We first derive a sufficient condition for convergence to fairness. Using this, we show how fair window increase/decrease policies can be constructed from suitable pairs of monotonically non-decreasing functions. We show that well-studied protocols such as TCP, GAIMD and Binomial congestion control can be constructed using this method. Thus we provide a common framework for the analysis of such window-based protocols. To validate our approach, we present experimental results for a new TCP-friendly protocol, LOG, designed using this framework with the objective of reconciling the smoothness requirement of streaming media-like applications with the need for a fast dynamic response to congestion.
Approximate Queries and Representations for Large Data Sequences
Authors: Hagit Shatkay, Stanley B. Zdonik
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

Many new database application domains such as experimental sciences and medicine are characterized by large sequences as their main form of data. Using approximate representation can significantly reduce the required storage and search space. A good choice of representation, can support a broad new class of approximate queries, needed in these domains. These queries are concerned with application-dependent features of the data as opposed to the actual sampled points. We introduce a new notion of generalized approximate queries and a general divide and conquer approach that supports them. This approach uses families of real-valued functions as an approximate representation. We present an algorithm for realizing our technique, and the results of applying it to medical cardiology data.
Concurrent timing optimization of latch-based digital systems
Authors: Hong-Yean Hsieh, Wentai Liu, Ralph K. Cavin,  III, C. Thomas Gray
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

Many techniques have been proposed to optimize digital system timing. Each technique can be advantageous in particular applications, however they are most often applied individually rather than concurrently. The framework presented here allows for concurrent timing optimization using retiming, intentional clock skew, and wave pipelining for latch-based designed systems with single or multi-phase clocking. This optimization is formulated as a mixed integer linear program. Our integrated framework also includes a new optimization technique called resynchronization which allows for the insertion of latches in the shortest paths and thus avoids race conditions. Our work has been applied to several designs and is able to significantly reduce the clock period.