ppxscal/embedding_network huggingface dataset:
Semi-automatic update of applications in response to library changes
Authors: Kingsum Chow, David Notkin
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

Software libraries provide leverage largely because they are used by many applications. As Parnas (1972, 1979), Lampson (1984) and others have noted, stable interfaces to libraries isolate the application from changes in the libraries. That is, as long as there is no change in a library's syntax or semantics, applications can use updated libraries simply by importing and linking the new version. However, libraries are indeed changed from time to time and the tedious job of adapting the application source to the library interface changes becomes a burden to multitudes of programmers. The paper introduces an approach and a toolset intended to reduce these costs. Specifically, in the authors' approach, a library maintainer annotates changed functions with rules that are used to generate tools that will update the applications that use the updated libraries. Thus, in exchange for a small added amount of work by the library maintainer, costs for each application maintainer can be reduced. They present the basic approach, describe the tools that support the approach, and discuss the strengths and limitation of the approach.
Coupling of Design Patterns: Common Practices and Their Benefits
Authors: William B. McNatt, James M. Bieman
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

Object-oriented (OO) design patterns define collections of interconnected classes that serve a particular purpose. A design pattern is a structural unit in a system built out of patterns, not unlike the way a function is a structural unit in a procedural program or a class is a structural unit in an OO system designed without patterns. When designers treat patterns as structural units, they become concerned with issues such as coupling and cohesion at a new level of abstraction. We examine the notion of pattern coupling to classify how designs may include coupled patterns. We find many examples of coupled patterns; this coupling may be "tight" or "loose", and provides both benefits and costs. We qualitatively assess the goodness of pattern coupling in terms of effects on maintainability, factorability, and reusability when patterns are coupled in various ways.
Domain Analysis and Modeling for Concurrent Engineering in Plant Monitoring and Operations
Authors: Satoshi Kumagai, Shuzo Kishima, Kiyoshi Itoh
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

In the area of plant monitoring and operations, concurrency stems from various kinds of actions taken by different participants with different missions or roles. In developing a system for supporting it, a key issue is to identify the specifics of concurrency in the business process. By applying the framework of domain analysis, modeling and engineering, a domain model to specify the process is developed. The authors' method consists of SPECgram (Sy stem PErspective Capture Diagram) and CARDgram (Collaborative Action-Reaction Diagram). SPECgram identifies the structure of the domain with the focus on the relationship between the plant and the business process for monitoring and operating it. CARDgram specifies resources shared by the agents and the nature of "cooperation" among them. Agents cooperate by recognizing the missions and actions of the other agents. This "mission traversable" cooperation among the agents is also modeled.
Domain Theory and Differential Calculus (Functions of one Variable)
Authors: Abbas Edalat, André Lieutier
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

A data-type for differential calculus is introduced, which is based on domain theory. We define the integral and also the derivative of a Scott continuous function on the domain of intervals, and present a domain-theoretic generalization of the fundamental theorem of calculus. We then construct a domain for differentiable real valued functions of a real variable. The set of classical C1 functions, equipped with its C1 norm, is embedded into the set of maximal elements of this domain, which is a countably based bounded complete continuous domain. This gives a data type for differential calculus. The construction can be generalized to Ck and C¿ functions. As an immediate application, we present a domain-theoretic generalization of Picard's theorem, which provides a data type for solving differential equations.
Adaptive Broadcast Protocols to Support Power Conservant Retrieval by Mobile Users
Authors: Anindya Datta, Aslihan Celik, Jeong G. Kim, Debra E. VanderMeer, Vijay Kumar
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Mobile computing has the potential for managing information globally. Data management issues in mobile computing have received some attention in recent times, and the design of adaptive broadcast protocols has been posed as an important problem. Such protocols are employed by database servers to decide on the content of broadcasts dynamically, in response to client mobility and demand patterns. In this paper we design such protocols and also propose efficient retrieval strategies that may be employed by clients to download information from broadcasts. The goal is to design cooperative strategies between server and client to provide access to information in such a way as to minimize energy expenditure by clients. We evaluate the performance of our protocols analytically.
Dependency Derivation in Industrial Process Data
Authors: Daniel Gillblad, Anders Holst
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

In many industrial processes, finding dependencies and the creation of dependency graphs can increase the understanding of the system significantly. This knowledge can then be used for further optimization and variable selection. Most of the measured attributes in these cases come in the form of time series. There are several ways of determining correlation between series, most of them suffering from specific problems when applied to real-world data. Here, awell performing measure based on the mutual information rate is derived and discussed with results from both synthetic and real data.
Interpreting XML Documents via an RDF Schema Ontology
Authors: Michel C. A. Klein
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Many business documents are represented in XML. However, XML only describes the structure of data, not its meaning. The meaning of data is required for advanced automatedprocessing, as is envisaged in the "Semantic Web". Ontologies are often used to describe the meaning of data items. Many ontology languages, however, depend on the RDF data model and cannot describe XML data directly. This paper presents a procedure that can be used to turn XML documents into RDF statements via an RDF-Schema specification. This allows semantic annotation of XML documents via external RDF-Schema ontologies. This proceduremakes the data in XML documents available for the Semantic Web.
An Interactive System for the Visualization and Measurement Extraction in Medical Images
Authors: Matheus Machado de Carvalho, Ricardo Melo Czekster, Isabel Harb Manssour
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

The visualization of medical images, e.g. Computed Tomography (CT) and Magnetic Resonance Imaging (MRI), and the utilization of measurement tools to define distances, areas and volumes are very important to health professionals. The quantitative analysis of spatial relations among structures is useful for medical diagnosis. This work describes a visualization system that provides interactive measurement tools. MRI images acquired from a phantom were used to increase system accuracy.
Integrating Adaptive On-Chip Storage Structures for Reduced Dynamic Power
Authors: Steve Dropsho, Alper Buyuktosunoglu, Rajeev Balasubramonian, David H. Albonesi, Sandhya Dwarkadas, Greg Semeraro, Grigorios Magklis, Michael L. Scott
Venue: Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques (2002)

Energy efficiency in microarchitectures has become a necessity. Significant dynamic energy savings can be realized for adaptive storage structures such as caches, issue queues, and register files by disabling unnecessary storage resources. Prior studies have analyzed individual structures and their control. A common theme to these studies is exploration of the configuration space and use of system IPC as feedback to guide reconfiguration. However, when multiple structures adapt in concert, the number of possible configurations increases dramatically, and assigning causal effects to IPC change becomes problematic. To overcome this issue, we introduce designs that are reconfigured solely on local behavior. We introduce a novel cache design that permits direct calculation of efficient configurations. For buffer and queue structures, limited histogramming permits precise resizing control. When applying thesetechniques we show energy savings of up to 70% on the individual structures, and savings averaging 30% overall for the portion of energy attributed to these structures with an average of 2.1% performance degradation.
Allocation of Protection Domains in Dynamic WDM Mesh Networks
Authors: Pin-Han Ho, H. T. Mouftah
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

In this paper, we solve the survivable routing problem in dynamic WDM mesh networks under the framework of Short Leap Shared Protection (SLSP). A novel algorithm called Cascaded Diverse Routing (CDR) is proposed. We also demonstrate a novel approach to solving the diverse routing problem in networks with dynamic traffic for the purpose of shared protection, called Iterative Two-Step-Approach (ITSA). Simulation is conducted using four different networks (22-, 30-, 79-, 100-node) for a comparison between ordinary shared protection schemes and the SLSP scheme. Simulation results show that the best performance can be achieved with well-designed diameter of protection domains for every connection request according to the size and topology of the network.
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
Authors: Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these algorithms. Parallel branch-and- bound algorithm implementations can be divided in two types based on whether a central or a distributed control scheme is used. Central control schemes have reduced scalability because of bottleneck problems frequently encountered. In order to solve problem cases that cannot be solved with sequential branch-and-bound algorithm, distributed control schemes are necessary. However, compared to central control schemes, higher efficiency is not always achieved through the use of a distributed control scheme. In this paper, a mixed control scheme is proposed, changing between the two different types of control schemes during execution. In addition, a dynamic load balancing strategy is applied in the distributed control scheme. Performance evaluation for three different cases is carried out: central, distributed, and mixed control scheme. Several TSP instances from the TSPLIB are experimentally solved, using up to 101 workstations. The results of these experiments show that the mixed control scheme is one of the most promising control schemes and furthermore, the hybrid selection rule, which was introduced in our previous work, has an advantage in parallel branch-and-bound algorithms.
The Asymptotic Order of the Random k -SAT Threshold
Authors: Dimitris Achlioptas, Cristopher Moore
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

Form a random k-SAT formula on n variables by selecting uniformly and independently m = rn clauses out of all 2^k (_k^n ) possible k-clauses. The Satisfiability Threshold Conjecture asserts that for each k there exists a constant rk such that as n tends to infinity, the probability that the formula is satisfiable tends to 1 if r rk. It has long been known that 2 k/k 2k. We prove that rk > 2k - 1 ln 2 - dk, where dk ¿ (1 + ln 2)/2. Our proof also allows a blurry glimpse of the "geometry" of the set of satisfying truth assignments.
A high-performance asynchronous SCSI controller
Authors: Kenneth Y. Yun, David L. Dill
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

We describe the design of a high performance asynchronous SCSI (small computer systems interface) controller data path and the associated control circuits. The data path is an asynchronous pipeline and the control circuits for the data path are built out of extended burst-mode machines. This design is functionally compatible with a widely used commercial SCSI controller and was simulated correctly with respect to all of the applicable test vectors used for the commercial design. The technology used for this design is a 0.8 /spl mu/m CMOS standard cell. The performance is limited by the SCSI specification, not the design itself, and the area is competitive with the commercial design. This design improves the data transfer throughput by up to 2.5 times from previous work by incorporating a FIFO and a distributed control scheme based on extended burst-mode state machines.
Multidimensional Network Performance with Unidirectional Links
Authors: James R. Anderson, Seth Abraham
Venue: Proceedings of the international Conference on Parallel Processing (1997)

A stochastic analysis of multidimensional networks with unidirectional links between nodes is presented, which is more accurate than previous models and valid for the hypercube. The results are reconciled with those of previous researchers who have reported conflicting conclusions. In addition to the classic constraints of constant link width, pin-out, and bisection width, a new constraint, constant maximum throughput, is introduced. This constraint dramatizes the performance and cost trade-offs between different network topologies.
A Priority Ceiling Protocol with Dynamic Adjustment of Serialization Order
Authors: Kwok-Wa Lam, Sang Hyuk Son, Sheung-lun Hung
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

The difficulties of providing a guarantee of meeting transaction deadlines in hard real-time database systems lie in the problems of priority inversion and of deadlocks. Priority inversion and deadlock problems ensue when concurrency control protocols are adapted in priority-driven scheduling. The blocking delay due to priority inversion can be unbounded, which is unacceptable in the mission-critical real-time applications. Some priority ceiling protocols have been proposed to tackle these two problems. However, they are too conservative in scheduling transactions for the single-blocking and deadlock-free properties, leading to many unnecessary transaction blockings. In this paper, we analyze the unnecessary transaction blocking problem inherent in these priority ceiling protocols and investigate the conditions for allowing a higher priority transaction to preempt a lower priority transaction using the notion of dynamic adjustment of serialization order. A new priority ceiling protocol is proposed to solve the unnecessary blocking problem, thus enhancing schedulability. We also devise the worst-case schedulability analysis for the new protocol which provides a better schedulability condition than other protocols.
Dynamic Programming Optimisation for On-line Signature Verificatio
Authors: Ronny Martens, Luc J. M. Claesen
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

In this paper, we focus on the use of the Dynamic Time Warping (DTW) technique in the signature verification area. The DTW-algorithm originates from the field of speech recognition, where it is a highly appreciated component of speaker specific isolated word recognisers. A few years ago the DTW-algorithm has been successfully introduced in the area of on-line signature verification. The characteristics of speech recognition and signature verification are however rather different. Starting from these dissimilarities, our objective is to extract an alternative DTW-approach that is better suited to the signature verification problem.
Temporal Logic with Forgettable Past
Authors: François Laroussinie, Nicolas Markey, Ph. Schnoebelen
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

We investigate NLTL, a linear-time temporal logic with forgettable past. NLTL can be exponentially more succinct than LTL +Past (which in turn can be more succinct than LTL). We study satisfiability and model checking for NLTL and provide optimal automata-theoretic algorithms for these EXPSPACE-complete problems.
Control unit synthesis targeting low-power processors
Authors: Chuan-Yu Wang, Kaushik Roy
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

With demands for reliability and further integration, reducing power consumption becomes a critical concern in today's processor design. Considering the different techniques to minimize power consumption and promote system's reliability, reducing switching activity of CMOS circuits is a promising area to be explored. Motivated by these, we propose two optimization schemes which can be incorporated into processor's control unit synthesis to lower power dissipation. The first one, a low-power decoding scheme, utilizes graph embedding and logic minimization techniques to refine the decoding structure in processor's control unit. To get further optimization for those control units in nanoprogrammed or microprogrammed architecture, the second scheme is proposed to optimally assign ZERO or ONE to the don't-care bits distributed in nanocontrol memory or control memory, to significantly reduce switching activity within the control unit and/or on the path from control unit to data processing unit. To achieve these two goals efficiently, we have used pseudo-Boolean programming to optimize the synthesis parameters. Based on a subset of 8086 instruction set, experimental results show that 15.8 percent improvement is obtained by properly encoding instruction opcodes, and 4.9 to 16.6 percent improvement can be obtained from a optimal don't-care bits assignment.
Smart-pixel array processors based on optimal cellular neural networks for space sensor applications
Authors: Wai-Chi Fang, Bing J. Sheu, Holger Venus, Rainer Sandau
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

A smart-pixel cellular neural network with hardware annealing capability, digitally programmable synaptic weights, and multisensor parallel interface has been under development for advanced space sensor applications. The smart-pixel CNN architecture is a programmable multi-dimensional array of optoelectronic neurons which are locally connected with their local neurons and associated active-pixel sensors. Integration of the neuroprocessor in each processor node of a scalable multiprocessor system offers orders-of-magnitude computing performance enhancements for on-board real-time intelligent multisensor processing and control tasks of advanced small satellites. The smart-pixel CNN operation theory, architecture, design and implementation, and system applications are investigated in detail. The VLSI implementation feasibility was illustrated by a prototype smart-pixel 5/spl times/5-neuroprocessor array chip of active dimensions 1380 /spl mu/m/spl times/746 /spl mu/m in a 2-/spl mu/m CMOS technology.
A Parametrized Branch-and-Bound Strategy for Scheduling Precedence-Constrained Tasks on a Multiprocessor System
Authors: Jan Jonsson, Kang G. Shin
Venue: Proceedings of the international Conference on Parallel Processing (1997)

In this paper we experimentally evaluate the performance of a parametrized branch-and-bound (B&B) algorithm for scheduling real-time tasks on a multiprocessor system. The objective of the B&B algorithm is to minimize the maximum task lateness in the system. We show that a last-in-first-out (LIFO) vertex selection rule clearly outperforms the commonly used least-lower-bound (LLB) rule for the scheduling problem. We also present a new adaptive lower-bound cost function that greatly improves the performance of the B&B algorithm when parallelism in the application cannot be fully exploited on the multiprocessor architecture. Finally, we evaluate a set of heuristic strategies, one of which generates near-optimal results with performance guarantees and another of which generates approximate results without performance guarantees.
Linear Aggressive Prefetching: A Way to Increase the Performance of Cooperative Caches
Authors: Toni Cortes, Jesús Labarta
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Cooperative caches offer huge amounts of caching memory that is not always used as well as it could be. We might find blocks in the cache that have not been requested for many hours. These blocks will hardly improve the performance of the system while the buffers they occupy could be better used to speed-up the I/O operations. In this paper, we present a family of simple prefetching algorithms that increase the file-system performance significantly. Furthermore, we also present a way to make any simple prefetching algorithm into an aggressive one that controls its aggressiveness not to flood the cache unnecessarily. All these algorithms and mechanisms have proven to increase the performance of two state-of-the-art parallel/distributed file systems: PAFS and xFS.
Index Selection for OLAP
Authors: Himanshu Gupta, Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

On-line analytical processing (OLAP) is a recent and important application of database systems. Typically, OLAP data is presented as a multidimensional "data cube." OLAP queries are complex and can take many hours or even days to run, if executed directly on the raw data. The most common method of reducing execution time is to precompute some of the queries into summary tables (subcubes of the data cube) and then to build indexes on these summary tables. In most commercial OLAP systems today, the summary tables that are to be precomputed are picked first, followed by the selection of the appropriate indexes on them. A trial-and-error approach is used to divide the space available between the summary tables and the indexes. This two-step process can perform very poorly. Since both summary tables and indexes consume the same resource-space-their selection should be done together for the most efficient use of space. The authors give algorithms that automate the selection of summary tables and indexes. In particular, they present a family of algorithms of increasing time complexities, and prove strong performance bounds for them. The algorithms with higher complexities have better performance bounds. However, the increase in the performance bound is diminishing, and they show that an algorithm of moderate complexity can perform fairly close to the optimal.