ppxscal/embedding_network huggingface dataset:
Context-Sensitive Distributed Software Development for Ubiquitous Computing Environments
Authors: Stephen S. Yau, Fariaz Karim
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

Ubiquitous computing represents the next wave of distributed computing, which focus on integrating computers with various wearable, mobile, and sensor devices, thus making computing and communication essentially transparent to the users. This type of environments mainly consists of myriad of embedded computing nodes interacting in transparent fashion to provide different services to the users. In addition to being resource-constrained, applications in these environments are context-sensitive and often operate in mobile ad hoc networks. Although different types of context-sensitive applications with diverse focus have been developed for ubiquitous computing environments, no general methods are available for developing application software for the above environments. In this paper, the development of context-sensitive distributed software for ubiquitous computing environments is presented.
Indexing OODB Instances based on Access Proximity
Authors: Chee Yong Chan, Cheng Hian Goh, Beng Chin Ooi
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Queries in object-oriented databases (OODBs) may be asked with respect to different class scopes: a query may either request for object-instances which belong exclusively to a given class c, or those which belong to any class in the hierarchy rooted at c. To facilitate retrieval of objects both from a single class as well as from multiple classes in a class hierarchy, we propose a multi-dimensional class-hierarchy index called the /spl chi/-tree. The /spl chi/-tree dynamically partitions the data space using both the class and indexed attribute dimensions by taking into account the semantics of the class dimension as well as access patterns of queries. Experimental results show that it is an efficient index.
Adaptive routing in Clos networks
Authors: Peter A. Franaszek, Christos J. Georgiou, Chung-Sheng Li
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

We describe a method of controlling a three-stage Clos nonblocking switch where "speculative" self-routing over the Clos fabric is augmented with reservations over a control network that connects controllers in the input and output stages of the switch. The effect is that most connections succeed over the speculative path while those subject to contention are processed over the control network. We present simulation result which indicate that the inclusion of a control network yields significant benefits under heavily nonuniform traffic conditions.
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
Authors: Josee Desharnais, Radha Jagadeesan, Vineet Gupta, Prakash Panangaden
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

We observe that equivalence is not a robust concept in the presence of numerical information ¿ such as probabilities ¿ in the model. We develop a metric analogue of weak bisimulation in the spirit of our earlier work on metric analogues for strong bisimulation. We give a fixed point characterization of the metric. This makes available coinductive reasoning principles and allows us to prove metric analogues of the usual algebraic laws for process combinators. We also show that quantitative properties of interest are continuous with respect to the metric, which says that if two processes are close in the metric then observable quantitative properties of interest are indeed close. As an important example of this we show that nearby processes have nearby channel capacities ¿ a quantitative measure of their propensity to leak information.
Scalable Versioning in Distributed Databases with Commuting Updates
Authors: H. V. Jagadish, Inderpal Singh Mumick, Michael Rabinovich
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

We present a multiversioning scheme for a distributed system with the workload consisting of read-only transactions and update transactions, (most of) which commute on individual nodes. The scheme introduces a version advancement protocol that is completely asynchronous with user transactions, thus allowing the system to scale to very high transaction rates and frequent version advancements. Moreover, the scheme never creates more than three copies of a data item. Combined with existing techniques to avoid global concurrency control for commuting transactions that execute in a particular version, our multiversioning scheme results in a protocol where no user transaction on a node can be delayed by any activity (either version advancement or another transaction) occurring on another node. Non-commuting transactions are gracefully handled. Our technique is of particular value to distributed recording systems where guaranteeing global serializability is often desirable, but rarely used because of the high performance cost of running distributed transactions. Examples include calls on a telephone network, inventory management in a "point-of-sale'' system, operations monitoring systems in automated factories, and medical information management systems.
An Implementation Scheme of Multidimensional Arrays for MOLAP
Authors: Tatsuo Tsuji, Atsuo Isshiki, Teruhisa Hochin, Ken Higuchi
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Multidimensional arrays used in MOLAP are often sparse. They also suffer from the problem that the time consumed insequential access to array elements heavily depends on the dimension along which the elements are accessed. This problem would be alleviated by dividing the whole array into the set of the same sized smaller subarrays called "chunks". These chunks are also sparse and they are compressed. However these compressed chunks are usually arranged in the predetermined order of the dimensions. This would produce further dimension dependency in accessing array elements. In this paper, by introducing the notion of a "chunk container", we resolve the problem of this further dimension dependency.
Improving the Quality of Technical Data for Developing Case Based Reasoning Diagnostic Software for Aircraft Maintenance
Authors: Richard Heider
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Summary form only given. Time spent by airline maintenance operators to solve engine failures and the related costs (flight delays or cancellations) are a major concern to SNECMA which manufacture engines for civilian aircraft such as BOEING 737s and Airbus A340s. The use of an intelligent diagnostic software contributes to improving customer support and reduces the cost of ownership by improving troubleshooting accuracy and reducing airplane downtime. However, classical rule based or model based expert systems are costly to develop and maintain. Our goal has been to improve the development of troubleshooting systems through case based reasoning (CBR) and data mining. These technologies reason from past cases, whose solution is known, rather than rules. New problems are solved by searching for similar problem solving experiences and by adapting the solutions that worked in the past, Our second objective was to acquire the capacity to produce systems which match the quality standard in the aeronautic industry in the given time frame. We aim at both assuring the quality of the core data mining and CBR software as well as the quality of the technical information that is fed into the system (case knowledge).
Character String Extraction by Multi-stage Relaxation
Authors: Hiroyuki Hase, Toshiyuki Shinokawa, Masaaki Yoneda, Mitsuru Sakai, Hiroshi Maruyama
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

An extraction algorithm for character strings is proposed. We first obtain a set of eight-connected components from a document image. For the components, we apply a relaxation method. The method makes mutual connections between components increase or decrease depending on the state of the neighboring components. While applying the relaxation method several times, the process proceeds from a local connection to a global connection, and finally character strings are extracted. We call this process multi-stage relaxation. The advantages of this algorithm are that it does not need to nominate character components from an image beforehand, it is adaptive for character size and font, and it can also cope with a document which includes strings with various orientations. In our experiments we use a color image of a magazine cover and a monochromatic image of a graph. For the color image, the multi-stage relaxation was executed for each binary image obtained by color segmentation. Lastly, we show the results of the experiments and discuss the effectiveness of our method.
Robust Similarity Measures for Mobile Object Trajectories
Authors: Michail Vlachos, Dimitrios Gunopulos, George Kollios
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

We investigate techniques for similarity analysis of spatio-temporal trajectories for mobile objects. Such kind of data may contain a great amount of outliers, which degrades the performance of Euclidean and Time Warping Distance. Therefore, here we propose the use of non-metric distance functions based on the Longest Common Subsequence (LCSS), in conjunction with a sigmoidal matching function. Finally, we compare these new methods to various Lp Norms and also to Time Warping distance (for real and synthetic data) and we present experimental results that validate the accuracy and efficiency of our approach, especially under the strong presence of noise.
Automatic extraction of the control flow machine and application to evaluating coverage of verification vectors
Authors: Yatin V. Hoskote, Dinos Moundanos, Jacob A. Abraham
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

Simulation is still the primary, although inadequate, resource for verifying the conformity of a design to its functional specification. Fortunately, most errors in the early stages of design involve only the control flow in the circuit. We define the functional coverage of a given sequence of verification vectors as the amount of control behavior exercised by them. We present a novel technique for automatically extracting the control flow of a design on the basis of the underlying mathematical model. Significantly, this extraction is independent of the circuit description style. The Extracted Control Flow Machine (ECFM) is then used for estimation of functional coverage and to provide information that will help the designer improve the quality of his or her tests.
Internet Procurement of Formosa Plastics
Authors: Joyce Lien Tai, Ray M. Yang
Venue: 24th International Computer Software and Applications Conference (2000)

Trade Van designed an Internet procurement system for Formosa Plastics Group. A year and half after this system deployed, 4000 suppliers use this system to do business with Formosa Plastics. Formosa Plastics has benefited from this system by reducing 20% to 30% purchase cost.
Signal propagation in high-speed MCM circuits
Authors: C. Truzzi, E. Beyne, E. Ringoot, J. Peeters
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

This paper describes the analysis of the propagation of digital signal on a thin-film multichip module (MCM) substrate populated with CMOS integrated circuits. Timing analyses and circuit simulations were performed during the design of an MCM consisting of 4 bare 0.7-/spl mu/m CMOS ASIC's (100 pins, 64 mm/sup 2/, standard cell technology) transmitting signals at 200 Mbit/s on a 5-layer thin-film substrate (1-by-1 inch, 2 interconnection layers). This paper addresses mainly two problems related to the design of microsystems where trade-offs must be found between high frequency and high density requirements: 1) an accurate description of the chip-to-chip, propagation of the signals, including the combined influence of active devices (drivers and receivers) and coupled, lossy interconnection lines: 2) an accurate overview of the way parameters from different domains (geometrical, electrical and technological) interact with each other and affect together the signal propagation. It is shown how the results of such analyses can help solving trade-offs between different requirements and taking decisions during the system design phase.
Recognizing depth-first-search trees in parallel
Authors: Jia-Shung Wang, Biing-Feng Wang, Chen-Hsing Peng
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Consider that T. is a given spanning tree of an undirected graph G which contains a vertices and m (/spl ges/n-1) edges. In this paper, we propose an O(m/p+log m)-time parallel algorithm using p processors on the EREW PRAM model to determine whether T is a depth-first-search tree of G. Our algorithm is optimal in time complexity and speed-up.
Dynamic Client-Side Scheduling in a Real-Time CORBA System
Authors: W. Feng
Venue: 23rd International Computer Software and Applications Conference (1999)

CORBA allows objects to communicate, independent of the specific techniques, languages, and platforms used to implement the objects. However, due to the multilevel software layering needed to provide this independence, CORBA cannot support real-time applications since it lacks essential quality-of-service (QoS) features. Recent work on real-time CORBA includes an offline scheduled, hard, real-time system based on rate-monotonic scheduling and an online scheduled, best-effort, real-time system based on the earliest-deadline-first algorithm. The former provides QoS guarantees at the expense of run-time scheduling flexibility while the latter provides the complement. In this paper, we propose an approach which provides the advantages of both, that is, QoS guarantees and run-time scheduling flexibility.
The Impact of Timing on Linearizability in Counting Networks
Authors: Marios Mavronicolas, Marina Papatriantafilou, Philippas Tsigas
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Counting networks form a new class of distributed, low-contention data structures, made up of interconnected balancers and are suitable for solving a variety of multiprocessor synchronization problems that can be expressed as counting problems. A linearizable counting network guarantees that the order of the values it returns respects the real-time order they were requested. Linearizability significantly raises the capabilities of the network, but at a possible price in network size or synchronization support. In this work we further pursue the systematic study of the impact of timing on linearizability for counting networks, along a research line recently initiated by Lynch et al.We consider two basic timing models, the instantaneous balancer model, in which the transition of a token from an input to an output port of a balancer is modeled as an instantaneous event, and the periodic balancer model, where balancers send out tokens at a fixed rate. We also consider lower and upper bounds on the delays incurred by wires connecting the balancers.We present necessary and sufficient conditions for linearizability in the form of precise inequalities that involve timing parameters and identify structural parameters of the counting network, which may be of more general interest. Our results significantly extend and strengthen previous impossibility and possibility results on linearizability in counting networks.
Hypothesis-Driven Understanding Processes During Corrective Maintenance of Large Scale Software
Authors: Anneliese von Mayrhauser, A. Marie Vans
Venue: Proceedings of the International Conference on Software Maintenance (1997)

This paper reports on an empirical study of software understanding during corrective maintenance of large-scale software with professional maintenance programmers. Hypotheses are key drivers in program understanding and influence the direction program understanding can take. This paper reports on the types of hypotheses programmers make, how they resolve them, and the strategies and comprehension processes they tend to use.
WebCMS: A Web-Based Course Management System
Authors: Ong Siew Siew, John Shepherd
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

This paper describes the development of and initial experiences with WebCMS (a web-based course management system), a learning management system developed in the School of Computer Science and Engineering (CSE) at the University of New South Wales (UNSW). The system was developed to facilitate existing CSE practices and over-come limitations of existing CSE course management tools, but has evolved into a generic on-line course management platform. It also provides some insight into what can be achieved towards on-line learning by a single programmer using a collection of open-source tools.
SQL3 Update
Authors: Jim Melton
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

The third major generation of the standard for the SQL database language, known as SQL3, is nearing completion. Many significant new features have been added to SQL, both in areas traditionally addressed by SQL and in pursuit of adding object technology to the language. The standard has been partitioned into a number of distinct parts, each of which may progress at its own rate. Publication of SQL3 as a replacement for the current version of the standard, SQL-92, is expected no sooner than 1998.
Limits on Speculative Module-Level Parallelism in Imperative and Object-Oriented Programs on CMP Platforms
Authors: Fredrik Warg, Per Stenström
Venue: Proceedings of the 2001 International Conference on Parallel Architectures and Compilation Techniques (2001)

Abstract: This paper considers program modules, e.g. procedures, functions, and methods as the basic method to exploit speculative parallelism in existing codes. We analyze how much inherent and exploitable parallelism exist in a set of C and Java programs on a set of chip-multiprocessor architecture models, and identify what inherent program features, as well as architectural deficiencies, that limit the speedup. Our data complement previous limit studies by indicating that the programming style - object-oriented versus imperative - does not seem to have any noticeable impact on the achievable speedup. Further, we show that as few as eight processors are enough to exploit all of the inherent parallelism. However, memory-level data dependence resolution and thread management mechanisms of recent CMP proposals may impose overheads that severely limit the speedup obtained.
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Authors: Frank K. H. A. Dehne, David Hutchinson, Anil Maheshwari, Wolfgang Dittrich
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Block-wise access to data is a central theme in the design of efficient {\em external memory} (EM) algorithms. A second important issue, when more than one disk is present, is fully parallel disk I/O. In this paper we present a {\em deterministic simulation} technique which transforms parallel algorithms into (parallel) external memory algorithms. Specifically, we present a {\em deterministic} simulation technique which transforms {\em Coarse Grained Multicomputer} (CGM) algorithms into external memory algorithms for the {\em Parallel Disk Model}. Our technique optimizes block-wise data access and parallel disk I/O and, at the same time, utilizes {\em multiple processors} connected via a communication network or shared memory.We obtain new improved parallel external memory algorithms for a large number of problems including sorting, permutation, matrix transpose, several geometric and GIS problems including 3D convex hulls (2D Voronoi diagrams), and various graph problems. All of the (parallel) external memory algorithms obtained via simulation are analyzed with respect to the computation time, communication time and the number of I/O's. Our results answer to the challenge posed by the ACM working group on storage I/O for large-scale computing
Design and Implementation of a Real-time Multimedia Presentation System using RTP
Authors: Sridevi Palacharla, Ahmed Karmouch, Samy A. Mahmoud
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

A new class of protocols like RTP, RTSP and RSVP are tailoring today's packet networks for streaming real-time multimedia data that once carried only non- real-time traffic. Multimedia networking is now possible with the existing network infrastructure. We describe a real-time Multimedia Presentation System for media-on-demand over the Internet. It uses RTP and is capable of real-time video/audio transmission. Our system consists of servers that maintain video/ audio clips and clients that retrieve and present them to the users. It provides VCR like control features for user interactivity during playback. This paper describes the system architecture, the communication protocols along with media synchronization and dynamic QoS control mechanisms.
DSDT: Durable Scripts Containing Database Transactions
Authors: Betty Salzberg, Dimitri Tombroff
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

DSDT is a proposed method for creating durable scripts which contain short ACID transactions as components. Workflow scripts are an example. The context of the script is made durable by writing a log record whenever an event occurs which cannot be replayed. Log checkpoints are used to minimize recovery time. DSDT can be written in stand-alone mode communicating with DBMSs by transactional remote procedure calls and maintaining its own logging system or it can be made part of a DBMS by modifying the DBMS transaction manager source code. DSDT provides a panic button (signal-exit) and the ability to specify what action should be taken on restart after system failure. The programmer can also specify actions such as "compensation" transactions to be taken after another signal (signal-cancel) arrives. DSDT enables most extended transaction models to be expressed in scripts modulo the guarantees of compensation. Recovery after system failure is shown to be correct.
A Version Numbering Scheme with a Useful Lexicographical Order
Authors: Arthur M. Keller, Jeffrey D. Ullman
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

We describe a numbering scheme for versions with alternatives that has a useful lexicographical ordering. The version hierarchy is a tree. By inspection of the version numbers, we can easily determine whether one version is an ancestor of another. If so, we can determine the version sequence between these two versions. If not, we can determine the most recent common ancestor to these two versions (i.e., the least upper bound, lub). Sorting the version numbers lexicographically results in a version being followed by all descendants and preceded by all its ancestors. We use a representation of nonnegative integers that is self delimiting and whose lexicographical ordering matches the ordering by value.