ppxscal/embedding_network huggingface dataset:
Distributed Management for Software Maintenance in a Wide-Area Railway System
Authors: Fumio Kitahara, Humihiro Katano, Tsutomu Ono, Yoshiki Kakumoto, Kuniyuki Kikuchi, Manabu Shinomoto
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

In a large-scale real-time control system, functions of subsystems differ slightly although they seem to be identical. Functions change when hardware is replaced or when the function itself is upgraded. If the standard system is generated by merging the differences and is installed then to each subsystem, subsystems become different with maintenance being carried out in each subsystem to fit its operational conditions. Furthermore, subsystems are distributed in a wide area. Software maintenance therefore becomes very difficult. This paper describes a distributed management for software maintenance in the Tokyo metropolitan-area railway system. This management has two phases: generating programs for making maintenance easy and executing programs for increasing the reliability of the system. There it contributes to the effectiveness of maintenance and increases the reliability of the total system.
Power management for energy-aware communication systems
Authors: Curt Schurgers, Vijay Raghunathan, Mani B. Srivastava
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2003)

System-level power management has become a key technique to render modern wireless communication devices economically viable. Despite their relatively large impact on the system energy consumption, power management for radios has been limited to shutdown-based schemes, while processors have benefited from superior techniques based on dynamic voltage scaling (DVS). However, similar scaling approaches that trade-off energy versus performance are also available for radios. To utilize these in radio power management, existing packet scheduling policies have to be thoroughly rethought to make them energy-aware, essentially opening a whole new set of challenges the same way the introduction of DVS did to CPU task scheduling. We use one specific scaling technique, dynamic modulation scaling (DMS), as a vehicle to outline these challenges, and to introduce the intricacies caused by the nonpreemptive nature of packet scheduling and the time-varying wireless channel.
SONET/SDH ring assignment with capacity constraints
Authors: Olivier Goldschmidt, Alexandre Laugier, Eli V. Olinick
Venue: Discrete Applied Mathematics (2003)

We consider the problem of interconnecting a set of customer sites using bidirectional SONET rings of equal capacity. Each site is assigned to exactly one ring and a special ring, called the federal ring, interconnects the other rings together. The objective is to minimize the total cost of the network subject to a ring capacity limit where the capacity of a ring is determined by the total bandwidth required between sites assigned to the same ring plus the total bandwidth request between these sites and sites assigned to other rings.We present exact, integer-programming based solution techniques and fast heuristic algorithms for this problem. We compare the results from applying the heuristic algorithms with those produced by the exact methods for real-world as well as randomly generated problem instances. We show that two of the heuristics find solutions that cost at most twice that of an optimal solution. Empirical evidence indicates that in practice the algorithms perform much better than their theoretical bound and often find optimal solutions.
Hierarchical planning in a mobile robot for map learning and navigation
Authors: Cristina Urdiales, Antonio Bandera, Eduardo Pérez, Alberto Poncela, Francisco Sandoval
Venue: Autonomous robotic systems: soft computing and hard computing methodologies and applications (2003)

This chapter focuses on autonomous navigation for mobile robots. We propose a hybrid layered architecture, which is used to navigate in totally or partially explored environments using sonar sensors. Our architecture relies on a hierarchical representation of the environment, which has both a metric and a topological level, which is based on the metric level. High level planning layers work at the topological level deliberatively, while low level navigation layers operate at the metric level reactively. The main advantage of the proposed scheme is that it can operate in both known and unknown environments rapidly and efficiently.
Performance, Reliability and Queueing Analysis of Fault-Tolerant Computer Systems
Authors: F V Nicola
Venue:  (1986)

Fault-tolerant computer systems are characterized by their ability to continue functioning in the presence of a component (or a subsystem) failure, possibly with a degraded performance. Models and techniques are developed for the evaluation of separate and combined measures of performance and reliability in such systems. Changes in the structure of the system due to failures, repair and/or degradation are modelled as a continuous-time Markov or semi-Markov process, referred to as the structure-state process. Associated with each structure state is a service rate (or a performance measure) and a discipline for service-preemption interaction upon entering that state. The execution of a task on a fault-tolerant system is considered. Transform solutions are derived, and techniques are developed to obtain the distribution of the task completion time which yields job-oriented measures. When all structure states are of the preemptive-resume type, i.e., work conserving system behaviour, then the cumulative service (or cumulative performance measure) until a given time and the completion time of a given task are dual measures, so that the distribution of any one of them can be obtained from the other. The cumulative performance measure can be specialized to obtain other system-oriented measures. In addition to delays incurred by the task due to failures, repair and/or degradation, there are queueing delays if congestion should occur. Exact queueing analysis of fault-tolerant systems is considered, under the assumption that the behaviour of the system is independent of the queue length. An algorithm is given to determine the steady-state distribution of the number of tasks in the system. The M/G/1 queue with mixed types of Poisson interruptions and a particular queue-dependent behaviour is studied, and the steady-state average queue length is derived. As an important application, the modelling of checkpointing and recovery strategies in a transactional system is considered. These models are characterized by a queue-dependent system behaviour. Markovian queueing models are developed under successively more realistic assumptions. Performance measures are obtained analytically whenever possible, otherwise efficient numerical techniques are employed. Different models are validated and compared by means of simulations.
On normalisation
Authors: Femke Raamsdonk, Paula Severi
Venue:  (1995)

Using a characterisation of strongly normalising $\lambda$-terms, we give new and simple proofs of the following: all developments and superdevelopments are finite, a certain rewrite strategy is perpetual, a certain rewrite strategy is maximal and thus perpetual, simply typed $\lambda$-calculus is strongly normalising.
Continuous Field Visualization with Multi-Resolution Textures
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

A method of using a texture mapping approach to color scales is described, for the purpose of visualizing continuous field scalar quantities. The technique is most appropriate where high gradients are present in the data, or where geometric surfaces are projected to significant screen area. The use of texture mapping takes advantage of widely available 3D display systems for interactive visualization system design. The technique yields a significant reduction in visualization artifacts caused by color interpolation. Multiple resolution textures are shown to improve visualizations of high dynamic range data.
A Study on the Ray-Tracing Acceleration Technique Based on the ZF-Buffer Algorithm
Venue: Proceedings of the International Conference on Information Visualisation (2000)

In this work, we propose ZF-buffer algorithm in order to accelerate the intersection test of ray tracing. ZF-buffer is used in the preprocessing of ray tracing and records the pointer that points to a parent face of a depth value (z value) of an object determined in Z-buffer. As a result, the face that intersects with the first ray can be determined easily by using the pointer stored in F-buffer. Though ZF-buffer and vista-buffer resemble each other, the difference between the two methods is that what ZF-buffer records is not bounding volume but the pointer of a displayable face. We applied the ZF-buffer algorithm for the first ray to Utah teapot, which consists of 9216 polygons. By comparing the elapse time of our method with vista-buffer algorithm, we can acquire improvement in speed that it is 3 times faster than vista-buffer algorithm. We also try to apply our method to reflective objects.
Resource Control for Database Extensions
Authors: Grzegorz Czajkowski, Tobias Mayr, Praveen Seshadri, Thorsten von Eicken
Venue:  (1998)

While object-relational database servers can be extended with user-defined functions (UDFs), the security of the server may be compromised by these extensions. The use of Java to implement the UDFs is promising because it addresses some security concerns. However, it still permits interference between different users through the uncontrolled consumption of resources. In this paper, we explore the use of a Java resource management mechanism (JRes) to monitor resource consumption and enforce usage constraints. JRes enhances the security of the server in the presence of extensions allowing for (i) detection and neutralization of denial-of-service attacks aimed at resource monopolization, (ii) monitoring resource consumption which enables precise billing of users relying on UDFs, and (iii) obtaining feedback that can be used for adaptive query optimization. The feedback can be utilized either by the UDFs themselves or by the database system to dynamically modify the query execution plan. Both models have been prototyped in the Cornell Predator database system. We describe the implementation techniques, and present experiments that demonstrate the effects of the adaptive behavior facilitated by JRes. We conclude that, minimally, a database system supporting extensions should have a built-in resource monitoring and controlling mechanism. Moreover, in order to fully exploit information provided by the resource control mechanisms, both the query optimizer and the UDFs themselves should have access to this information.
Sequence comparison using a relational database approach
Authors: A. Bergholz, J. A. Schenk, S. Heymann, J. C. Freytag
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

A variety of heterogenous data sources is available in the field of molecular biology. The authors focus lies on the biological sequence data, i.e. data maintained in collections like EMBL or SWISS-PROT. They propose a relational model based on an entity-relationship approach for this discourse world. This is the foundation of a flexible architecture useful for a variety of purposes, e.g. for sequence comparison. They present their first application system within this architecture, the sequence analysis tool NNSAT. The description of this system is accompanied by a short review of the data model and a section on the problem of sequence comparison in which they propose a small modification of the Needleman and Wunsch (1970) alignment method.
The appropriate total ranking method using DEA for multiple categorized purposes
Authors: Hiroshi Noguchi, Masaru Ogawa, Hiroaki Ishii
Venue: Journal of Computational and Applied Mathematics (2002)

When one expects to figure out the total ranking of objects from collected data, it is a familiar method to compare the weighted sum of the selection number of rank vote, after determining the weights in a selected rank. Green et al. (European J. Oper. Res. 90(3) (1996) 461), using data envelopment analysis and cross-evaluation, proposed a procedure to order the objects from the ranking of one categorized data. But, they have not taken care of about making the weight of a certain rank 0, and the value of the difference between ranks becomes 0. In actual applications, making the weight of a certain rank 0 means that we throw away the corresponding part of the obtained rank voting data. Further, giving the same weight to different ranks destroys its original ranking character. And then, in this paper, we show that the total ordinal rank of objects may produce a different result according to the difference of the weights between ranks. Consequently, we explain that their ordering is not appropriate to applications. And, we propose a new ordering to solve the weights of ranks by considering feasible solutions' region of the constraint set in LP. Also, we would like to propose such a method that, if extended, it can be applied more widely not only when the selected category is for a single purpose but also when it is for multiple purposes, especially with an example taken from the personal development issue at a corporation.
A Ternary Systolic Product-Sum Circuit for GF(3**m) using Neuron MOSFETs
Authors: Noriaki Muranaka, Shigenobu Arai, Shigeru Imanishi, D. Michael Miller
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

In this paper, we present a ternary systolic product-sum computation circuit for GF(3**m) using voltage-mode neuron MOSFETs. The required subcircuits are discussed which together form a basic cell. The overall design which connects basic cells in a systolic manner, thereby making effective use of pipelining, is shown. SPICE simulations of the central part of the basic cell are presented which demonstrate its proper behaviour. The ternary circuit for GF(3**2) is compared to the binary circuit for GF(2**3) and is shown to be superior both in terms of the number of transistors and the number of connections.
A complete equational axiomatization for MPA with string iteration
Authors: Luca Aceto, Jan F Groote
Venue:  (1997)

We study equational axiomatizations of bisimulation equivalence for the language obtained by extending Milner''s basic CCS with string iteration. String iteration is a variation on the original binary version of the Kleene star operation $p^* q$ obtained by restricting the first argument to be a non-empty sequence of atomic actions. We show that, for every positive integer $k$, bisimulation equivalence over the set of processes in this language with loops of length at most $k$ is finitely axiomatizable, provided that the set of actions is finite. We also offer an infinite equational theory that completely axiomatizes bisimulation equivalence over the whole language. We prove that this result cannot be improved upon by showing that no finite equational axiomatization of bisimulation equivalence over basic CCS with string iteration can exist, unless the set of actions is empty.
On visualisation of statistical data
Authors: F. Hussain, M. Sarfraz
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

In many applications a need often arises to represent numerical data to give greater visual impact. Whether the data consists of demographic information or forms a listing of financial business trends, their interpretation and meaning is simpler to comprehend through a pictorial representation. The requirement in practice is such that visualisation needs to take place on-the-fly. This implies that the process of transforming static data into a diagrammatic form needs to be dynamic. Whereas most authors have addressed the scenario by employing cubic interpolation to the given set of data points, we discuss the suitability of using a quadratic approach. We introduce the general quadrature spline, its attractions, and its limitations, together with some thoughts as to how the conic (quadratic) spline could be adapted to meet most needs.
Hybrid Real-Time Task Scheduling Upon Multiprocessor Platforms Using Server Techniques
Authors: Dania A. El-Kebbe
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

A predictable real-time control scheme for manufacturing systems underlying real-time constraints is proposed. The preemptive scheduling of systems consisting of hybrid (periodic and aperiodic) tasks on a platform comprised of several uniform multiprocessors is considered. Based on resource augmentation techniques, the Total Bandwidth Server on uniform multiprocessors, is developed. The predictability and the performance of the system are proved through schedulability analysis techniques and simulation studies respectively.
A Technique for Logic Design of Voltage-Mode Pass Transistor Based Multi-Valued Multiple-Output Logic Circuits
Authors: Hafiz Md. Hasan Babu, Md. Rafiqul Islam, Amin Ahsan Ali, Mohammad Musa Salehin Akon
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

An approach for designing multi-valued logic circuitsis proposed in this paper. We also describe a systematicmethod for implementing a set of binary logic functions,as multi-valued logic functions, and the heuristicalgorithms for different stages of the design process areprovided along with it. Experimental results are includedfor a number of benchmark functions and the proposedmethod has been found to be quite efficient, in terms ofnumber of transistors, in the implementation of some ofthese functions. The proposed circuits are essentiallyvoltage-mode circuits with multi-valued outputs and inthe case of implementing multiple-output binary logicfunctions this approach produces circuits with reducednumber of output pins. The circuits described here arealso suitable to be implemented in VLSI technology sincethey are composed of simple enhancement / depletionmode MOS transistors and pass transistors.
Clock Snooping and its Application in on-the-fly Data Race Detection
Authors: Koen de Bosschere, Michiel Ronsse
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

In this paper, we describe clock snooping, a novel logical clock update technique that improves the performance of classical logical clocks (scalar clocks, vector clocks, as well as matrix clocks). The basic idea of clock snooping is that logical clocks will not only get updated with information piggybacked on communication messages, but that processes can explicitly request the current value of the clock of another process, and use that information to resynchronize its own clock. The usefulness of this concept is shown in our on-the-fly race detection software.
How Accurate is Gaussian Elimination?
Authors: Nicholas J. Higham
Venue:  (1989)

J.H. Wilkinson put Gaussian elimination (GE) on a sound numerical footing in the 1960''s when he showed that with partial pivoting the method is stable in the sense of yielding a small backward error. He also derived bounds proportional to the condition number $\kappa(A)$ for the forward error $\| x \hat{x} \|$, where $\hat{x}$ is the computed solution to $Ax = b$. More recent work has furthered our understanding of GE, largely through the use of componentwise rather than normwise analysis. We survey what is known about the accuracy of GE in both the forward and backward error senses. Particular topics include: classes of matrix for which it is advantageous not to pivot; how to estimate or compute the backward error; iterative refinement in single precision; and how to compute efficiently a bound on the forward error. Key Words: Gaussian elimination, partial pivoting, rounding error analysis, backward error, forward error, condition number, iterative refinement in single precision, growth factor, componentwise bounds, condition estimator.
A Resource Management Framework for Adaptive Middleware
Authors: Hector A. Duran, Gordon S. Blair
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

In this paper, we introduce a reflective resource management framework that offers facilities for resource awareness and dynamic reallocation of resources for an adaptive middleware platform
On Emotion Recognition of Faces and of Speech Using Neural Networks, Fuzzy Logic and the ASSESS System
Authors: W. A. Fellenz, J. G. Taylor, R. Cowie, E. Douglas-Cowie, F. Piat, S. Kollias, C. Orovas, B. Apolloni
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

We propose a framework for the processing of face image sequences and speech, using different dynamic techniques to extract appropriate features for emotion recognition. The features will be used by a hybrid classification procedure, employing neural network techniques and fuzzy logic, to accumulate the evidence for the presence of an emotional expression of the face and the speaker's voice.
Constructing Consistent Fuzzy Surfaces from Fuzzy Data
Authors: Weldon A. Lodwick, Jorge Santos
Venue:  (2001)

Given fuzzy data describing a 3-dimensional entity such as terrain, we develop methods to construct surfaces that are consistent with the uncertainty in the data and surface model itself. In particular, surfaces generated by higher alpha-cut values of the fuzzy data are contained within the surfaces generated by lower alpha-cut values of the fuzzy data. Moreover, the smoothness and continuity conditions of the surface generating method is maintained by each surface. We demonstrated the ideas by developing two and three demensional surfaces from fuzzy data for cubic splines and digital terrain models generated from triangulation.
Visualization and Information: A Building Design Perspective
Authors: Dino Bouchlaghem
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

Virtual reality (VR) packages offer good visualization capabilities but inadequate facilities for either internal data management or data exchange with other packages. The potential usefulness of VR packages for industrial and business applications is limited by their lack of support for the manipulation of specialist information. Their generic nature cannot retain the complex semantics and syntax of industrial information. Within the iterative process of building design and visualization, support is required for construction industry data, which is ordered in a complex and domain specific manner. Improved transfer of data from specialist building design tools to virtual reality has been investigated in previous research, but in this paper it is argued that data transfer is not enough. Virtual reality techniques need to become available within the specialist buildings design tools and alter the interface to such applications.
Learning subjective probabilities from a small data set
Authors: Claudio Moraga, Chongfu Huang
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

A method to learn subjective probabilities fromsparse data is discussed. The method is based onthe principle of Information Diffusion and exhibitsa complexity O(n logn). A way of generatingfamilies of Information Diffusion functions isdiscussed. Applications on real data and varyingnumber of samples are shown.