ppxscal/embedding_network huggingface dataset:
Modeling and Querying Moving Objects
Authors: A. Prasad Sistla, Ouri Wolfson, Sam Chamberlain, Son Dao
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

In this paper we propose a data model for representing moving objects in database systems. It is called the Moving Objects Spatio-Temporal (MOST) data model. We also propose Future Temporal Logic (FTL) as the query language for the MOST model, and devise an algorithm for processing FTL queries in MOST.
Hierarchically Organized Neural Net Agents for Distributed Web Information Retrieval
Authors: Yong S. Choi, Suk I. Yoo, Jaeho Lee
Venue: 23rd International Computer Software and Applications Conference (1999)

Agent-based information retrieval systems have gained great attentions due to the proliferation of readily available but overwhelming information on the Web. In this paper, we present a neural network based multi-agent, especially hierarchically organized, information retrieval systems. The motivation is based on our experience with our experimental system called Hierarchically Organized Multi-agent Information Retrieval System (HOMIRS) and an analysis of the tradeoff between multi-agent coordination overhead and the benefits of the hierarchical organization of agents. We first introduce our neural network based information retrieval system and then present experimental results with HOMIRS.
Alias Analysis for Fortran90 Array Slices
Authors: K. Gopinath, R. Seshadri
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Most alias analyses produce approximate results in the presence of array slices. This may lead to inefficient code which is of concern, especially, in languages like Fortran90. The authors present an overview of a static alias analysis that gives accurate results in the presence of array slices in Fortran90.
Dynamic minimization of OKFDDs
Authors: Rolf Drechsler, Bernd Becker
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

We present methods for the construction of small Ordered Kronecker Functional Decision Diagrams (OKFDDs). OKFDDs are a generalization of Ordered Binary Decision Diagrams (OBDDs) and Ordered Functional Decision Diagrams (OFDDs) as well. Our approach is based on dynamic variable ordering and decomposition type choice. For changing the decomposition type we use a new method. We briefly discuss the implementation of PUMA, our OKFDD package. The quality of our methods in comparison with sifting and interleaving for OBDDs is demonstrated based on experiments performed with PUMA.
Mobile Learning in Personnel Training of University Teachers
Authors: Pauliina Seppälä, Janne Sariola, Heikki Kynäslahti
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

In this article, we will discuss why mobile learning is being introduced to the academic teaching environment? We will also report experiences of a pilot project undertaken in connection with personnel training at the University of Helsinki The aim of the The UniWapproject is to develop the educational use of mobile technology and to find pedagogical applications beneficial for higher education. The project deals with the WAP technology to be tested, piloted and completed in order to facilitate teaching and learning at the university. An environment of activities has been developed in order to provide services for flexible teaching and studying
A Semi-Automatic Surface Reconstruction Framework Based on T-Surfaces and Isosurface Extraction Methods
Authors: Edilberto Strauss, Walter Jiménez, Gilson Giraldi, Rodrigo Silva, Antonio A. F. Oliveira
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

Abstract. In this paper we present a new approach which integrates the T-Surfaces model and isosurface generation methods in a general framework for surface reconstruction in 3D medical images. T-Surfaces is a deformable model based on a triangulation of the image domain, a discrete surface model and an image threshold. Two types of isosurface generation methods are considered: the continuation ones and the marching ones. The former is usefulduring the reparameterization of T-Surfaces while the later is suitable to initialize the model closer the boundary. Specifically, in a first stage, the T-Surfaces grid and the threshold are used to define a coarser image resolution. This field is thresholded to get a 0-1 function which is processed by a marching method to generate polygonal surfaces whose interior may contain the desired objects. If a polygonal surface involves more than one object, then the resolution is increased in that region and the marching applied again. Next, we apply T-Surfaces to improved the result. If the obtained topology remains incorrect, we enable the user to modify the topology by an interactive method based on the T-Surfaces framework. Finally, we demonstrate the utility of diffusion methods for our approach.
Classification through Maximizing Density
Authors: Hui Wang, Ivo Düntsch, David A. Bell, Dayou Liu
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

This paper presents a novel method for classification, which makes use of the models builtby the lattice machine (LM) [1,3 ]. The LM approximates data resulting in, as a model of data, a set of hyper tuples that are equilabelled, supported and maximal . The method presentedin this paper uses the LM model of data to classify new data with a view to maximising the density of the model. Experiments show that this method, when used with the LM, outperforms the C2 algorithm in [3 ] and it is comparable to the C5.0 classification algorithm.
Faxed Document Image Restoration Using Gray Level Representation
Authors: Masami Oguro
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper describes an image restoration algorithm for degraded faxed images, for example, salt-and-pepper noise and the partial omission of figures. Removing these types of degradation is paramount to achieving high performance FAX OCR systems. Some observations that enable effective restoration of FAX degradation are: (1)the contour shapes of figures may be preserved microscopically, (2) degradation characteristics can be estimated by utilizing the distribution of neighboring pixel values, and (3) the ununiformity of sensor sensitivity causes similar degradation in vertical bands. The proposed method based on these observations comprises the following steps: producing gray level images, restoring based on local pixel distribution, and restoring based on vertical specification. The experimental results based on actual faxed documents show the effectiveness of the method. 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
Electronic Payment in Mobile Environment
Authors: Zheng Huang, Kefei Chen
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

On-line electronic payment system has been criticized mostly for its cost inefficiency and its inconvenience. However, with the fast development of mobile technology, the world has been changed. People nowadays like to carry their mobile phone with them. It is very convenientfor them to connect to the Internet anytime and anywhere and the cost of mobile communication is dropping very fast. This paper introduces an electronic payment system that implements Brands' restrictive blinding signature into the user's mobile phone or user's PDA. The system is very efficient and offers multi-party security as well as unconditional privacy of payments. Our system has some features of on-line system, so it can prevent Double-Spending from happening.
A Virtual Memory Model for Parallel Supercomputers
Authors: Veronica L. M. Reis, Isaac D. Scherson
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

A model for virtual memory in a distributed memory parallel computer is proposed. It uses a novel parallel computing operating system framework and leads to the definition of two strategies for implementing parallel virtual memory. Careful analysis and simulation results indicate that dynamic page allocation performs better for applications that exhibit some locality of reference of public data and for applications whose data space does not fit in the physical memory available. Static page allocation is more efficient in cases of poor locality and small data space (no virtual memory needed).
Image Segmentation by Analysis of Scale-Space
Authors: Marco António Garcia de Carvalho, Michel Couprie, Roberto de Alencar Lotufo
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

We present a technique in image segmentation based on a hierarchical analysis of scale-space. The image hierarchy is the tree of critical lakes and provides a set of nested partitions. We analyze the scale-space from fine to coarse levels according to specific attributes.
Autonomous Real-Time Navigation Based on Work Load Situation in Demand-Oriented Information Service System
Authors: Teruyoshi Zenmyo, Hélène Arfaoui, Kinji Mori
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

In information service systems, the user's demand and service contents are continuously changing depending on economical and social circumstances. Demand-oriented information service system is thus a proposition made to cope with continuously changing conditions of utilization and provision in current information systems. The faded information field (FIF), sustained by push/pull mobile agent technology, is such a distributed architecture that brings adaptability and real-time to the system through a balanced selective replication of the information. When the users' demand changes, the information environment is restructured so that the same response time to services for all unspecified users can be achieved whatever the demand volume. However, once the structure is fixed, it is still necessary to permit to the user's Pull mobile agents to autonomously adapt to the rapidly changing load conditions. In this paper, we propose an autonomous real-time navigation technology in order to permit to the pull mobile agents to decide step-by-step of their navigation behaviors in case of overload in the information environment. Effectiveness of the proposed technique has been confirmed by simulation.
Analyzing the Real-Time Properties of a U.S. Navy Signal Processing System
Authors: Steve Goddard, Kevin Jeffay
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

The state of the art in verifying the real-time requirements of applications developed using general processing graph models relies on simulation or off-line scheduling. We extend the state of the art by presenting analytical methods that support the analysis of cyclic processing graphs executed with on-line schedulers. We show that it is possible to compute the latency inherent in a processing graph independent of the hardware hosting the application. We also show how to compute the real-time execution rate of each node in the graph. Using the execution rate of each node and the time it takes per execution on a given processor, the resulting CPU utilization can be computed, as shown here for the Directed Low Frequency Analysis and Recording (DIFAR) acoustic signal processing application from the Airborne Low Frequency Sonar (ALFS) system of the SH-60B LAMPS MK III anti-submarine helicopter.
Enhanced Multi-Version Data Broadcast Schemes for Time-Constrained Mobile Computing Systems
Authors: Hei-Wing Leung, Joe Chun-Hung Yuen, Kam-yiu Lam, Edward Chan
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

In this paper, we study the data dissemination problem in time-constrained mobile computing systems (TCMCS) in which maximizing data currency (minimizing staleness) and meetingtransaction deadlines are of equal importance as providing consistent data items to transactions. We first investigate what are the performance problems of the multi-version data (MV) broadcast technique when it is used for TCMCS. Then, we propose various enhancements to resolve the problems. In order to further reduce the probability of missing deadlines, we introduce a prioritized on-demand broadcast scheme, which is integrated with the data broadcast mechanism for disseminating data items to time-constrained transactions. The performance characteristics of the proposed strategies have been studied through extensive simulation.
Towards Formal Modeling of e-Contracts
Authors: Olivera Marjanovic, Zoran Milosevic
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: The emerging B2B technologies allow for more automated management of e-contracts including contract drafting, negotiation and monitoring. As technology infrastructure becomes available for electronic exchange of contracts and contract-related messages, the IT community is becoming more interested in modeling of contracts as governance structures for many inter-organisational interactions. This paper presents our initial ideas for formal modeling of e-contracts. This includes specification of deontic constraints and verification of deontic consistency associated with roles in a contract, precise modeling of temporal constraints/estimates and verification of temporal consistency of an e-contract, and finally scheduling of the required actions. The paper also introduces visualisation concepts such as role windows and time maps and describes how they could be used as decision support tools during contract negotiation.
Building Dependable Distributed Applications Using AQUA
Authors: Jennifer Ren, Michel Cukier, Paul Rubel, William H. Sanders, David E. Bakken, David A. Karr
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

Building dependable distributed systems using ad hoc methods is a challenging task. Without proper support, an application programmer must face the daunting requirement of having to provide fault tolerance at the application level, in addition to dealing with the complexities of the distributed application itself. This approach requires a deep knowledge of fault tolerance on the part of the application designer, and has a high implementation cost. What is needed is a systematic approach to providing dependability to distributed applications. Proteus, part of the AQuA architecture, fills this need, and provides facilities to make a standard distributed CORBA application dependable, with minimal changes to an application. Furthermore, it permits applications to specify, either directly or via the Quality Objects (QuO) infrastructure, the level of dependability they expect of a remote object, and will attempt to configure the system to achieve the requested dependability level. Our previous papers have focused on the architecture and implementation of Proteus. This paper describes how to construct dependable applications using the AQuA architecture, by describing the interface that a programmer is presented with and the graphical monitoring facilities that it provides.
Federation Management for the OMG-Trader
Authors: Gazanfer Ercan, Naima Aghoutane, Volker Tschammer, Horst Herzog
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

Interworking traders allow their clients' requests and their servers' advertisements to go across the boundaries of trading communities. Interworking is accomplished via trader links. The OMG and the ISO/ODP committee have published a paper which specifies asymmetrical links for trader interworking. Symmetrical links, however, provide more quality of service than asymmetrical links and, thus, facilitate trader interworking significantly. This paper discusses both symmetrical and asymmetrical links and presents a federation manager which solves most of the problems caused by asymmetrical links.
A Visual Authoring System for Animated Multimedia Homepage
Authors: Shih-Fang Chuang, Chorng-Shiuh Koong, Jyi-Sheng Tyan, Deng-Jyi Chen
Venue: 24th International Computer Software and Applications Conference (2000)

The WWW has become a powerful media for knowledge displacement and acquisitions for Internet users. For Internet content providers, Homepage is the common way to let users to know where the contents are placed. Currently, there are many Homepage design tools available for content providers to make their Web pages, FrontPage Express, Flash, HotDog, ... to name a few. While making an animated multimedia Homepage, most of these design tools have to use their extended programming features such as combing part of the code of JavaScript, or java program to achieve this goal. For general users, especially for the non-computer professional users, to write java program to make an animated multimedia Homepage is not an easy job. In this paper, a visual authoring system for general users to make an animated multimedia Homepage is proposal. Based on this tool, users can create an animated multimedia Homepage at their fingertip without writing any program or code. The proposed authoring tool has been technology transferred to the Best Wise International Computing Cooperation for product development. Examples shown in this paper are created based on the WebFace Maker. (A product of the Best Wise International Computing Co.), which is a product developed using the proposed technology.
Application Integration in the Boeing Enterprise
Authors: James H. Illback, Jon Sholberg
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

Today's e-Commerce world has suddenly created huge application integration requirements within large enterprises. For Boeing, additional demands are often imperative when they work with suppliers and partners to create a virtual enterprise that contains unique integration requirements. The fast moving, electronic world can only be managed and exploited properly if application integration is founded on a robust architecture. This paper traces a successful implementation of such an architecture, as well as presenting the way it is evolving to solve these new future challenges.
Workload Design: Selecting Representative Program-Input Pairs
Authors: Lieven Eeckhout, Hans Vandierendonck, Koenraad De Bosschere
Venue: Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques (2002)

Having a representative workload of the target domain of a microprocessor is extremely important throughout its design. The composition of a workload involves two issues: (i) which benchmarks to select and (ii) which input data sets to select per benchmark. Unfortunately, it is impossible to select a huge number of benchmarks and respective input sets due to the large instruction counts per benchmark and due to limitations on the available simulation time. In this paper, we use statistical data analysis techniques such as principal components analysis (PCA) and cluster analysis to efficiently explore the workload space. Within this workload space, different input data sets for a given benchmark can be displayed, a distance can be measured between program-input pairs that gives us an idea about their mutual behavioral differences and representative input data sets can be selected for the given benchmark. This methodology is validated by showing that program-input pairs that are close to each other in this workload space indeed exhibit similar behavior. The final goal is to select a limited set of representative benchmark-input pairs that span the complete workload space. Next to workload composition, there are a number of other possible applications, namely getting insight in the impact of input data sets on program behavior and profile-guided compiler optimizations.
Architecting Cross-Organisational B2B Interactions
Authors: Karsten Schulz, Zoran Milosevic
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

Process orientation is used increasingly as an approach to streamlining formerly inefficient business procedures and workflow management systems are frequently deployed IT systems to support this. The large number of workflow management systems available in the market and a growing demand for workflow systems demonstrates this trend. However in a world of electronic interconnectivity, the concepts for process automation within a single organisation need to be extended to support co-operation with customers and partners in different organisations. Current workflow standards bodies provide limited support to enable this interconnectivity. They provide interfaces and data structures for interoperability but they do not address various aspects of the confidentiality of internal structures of process; those that bring a competitive edge. The paper outlines our approach for dealing with these inter-organisational aspects. We propose a model for tiering business processes into organisations' private business processes and shared business processes that interconnect them. Private business processes can expose interaction points and shared processes can link to these points so that an overall business process may span two or more organisations. The interaction points can selectively expose information about an organisation's processes, process tasks and roles. The paper also presents how these modelling ideas can be supported by a corresponding architecture and describes a prototype that implements key ideas of the architecture.
ServerNet Deadlock Avoidance and Fractahedral Topologies
Authors: Robert W. Horst
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

This paper examines the problems of deadlock avoidance in multistage networks, and proposes a new class of scalable topologies for constructing large networks without introducing loops that could cause deadlocks. The new topologies, called "fractahedrons," are deadlock-free and reduce the maximum link contention compared to other networks. The use of fractahedral topologies is illustrated by various configurations of 6-port ServerNet routers. The properties of fractahedral networks are compared with networks configured as a mesh, hypercube or fat tree.
Evaluating Cooperation in Group Work
Authors: Luis A. Guerrero, Rosa Alarcón, César A. Collazos, José A. Pino, David A. Fuller
Venue: Proceedings of the 6th International Workshop on Groupware (2000)

Several researchers in the area of cooperative work take as a success criterion the quality of the group outcome. Nevertheless, recent findings are giving more importance to the quality of the "cooperation process" itself. This paper presents the design of a software tool that allow us to capture information concerned with the group work. Besides revealing the final quality of the group outcome, this information permits us to verify the presence of a cooperation indicator, which in turn allows us to determine the quality of the work process. An experiment is described, and the obtained data is discussed, comparing the quality of the collaboration process with the quality of the results obtained by the groups.