ppxscal/embedding_network huggingface dataset:
Highly accurate and efficient evaluation of randomising set index functions
Authors: Hans Vandierendonck, Koen De Bosschere
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2003)

Randomising set index functions can reduce the number of conflict misses in data caches by spreading the cache blocks uniformly over all sets. Typically, the randomisation functions compute the exclusive ors of several address bits. Not all randomising set index functions perform equally well, which calls for the evaluation of many set index functions. This paper discusses and improves a technique that tackles this problem by predicting the miss rate incurred by a randomisation function, based on profiling information. A new way of looking at randomisation functions is used, namely the null space of the randomisation function. The members of the null space describe pairs of cache blocks that are mapped to the same set. This paper presents an analytical model of the error made by the technique and uses this to propose several optimisations to the technique. The technique is then applied to generate a conflict-free randomisation function for the SPEC benchmarks.
Implementation of Multiple-Valued Multiplier on GF(3m) Using Current Mode CMOS
Authors: Hyeon Kyeong Seong, Jai Seok Choi, Boo Sik Shin, Heung Soo Kim
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

In this paper, the multiplication algorithm of two polynomials on finite fields GF(3m) is presented. The 3-valued multiplier of the serial-in/parallel-out modular structures on GF(33) to be performed and presented multiplication algorithm is implemented by current-mode CMOS. The current-mode CMOS 3-valued multiplier is implemented two GF(3) multipliers and two GF(3) adders. Performances of the proposed circuits are evaluated using Pspice simulations with 2.0µm standard CMOS device parameters; 20µA unit current level and 3.3V VDD supply voltage.
Multimedia and Interactive Digital TV: Managing the Opportunities Created by Digital Convergence
Authors: Margherita Pagani
Venue:  (2003)

:Addressing the issues that managers in the multimedia industry have confronted while developing and implementing this innovative technology, this book focuses on the latest research and findings in digital television technologies. Covered are the major issues surrounding digital convergence including the digital metamarket and new digital media devices and their potential for IT convergence at the macro level. Also addressed are multimedia and interactive digital television and the economic implications of these technologies. Additionally, the managerial implications of interactive digital television are covered, including branding strategies for digital television channels and the critical role of content media management.Author Biography: Margherita Pagani, is currently the coordinator of TV-LAB Research Laboratory on Digital Television and the I-LAB Research Center on Digital Economy. She is also a professor in the Graduate Business School at Bocconi University.
Redesigning Legacy Systems into the Object-Oriented Paradigm
Authors: W. Eric Wong, J. Jenny Li
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

Object-oriented languages support many modern programming paradigms such as information hiding, inheritance, polymorphism, and dynamic binding. As a result, software systems implemented in OO languages are more reusable and reliable than those in non-OO. Many legacy software systems were created before OO programming became popular and needed to be redesigned and updated to OO programs. The process of abstracting OO designs fromthe procedural source code was often done manually or with limited assistance from program structural diagrams. Most reengineering focuses on the functionality of the original program, and the OO redesign often results in a completely new design based on the designers' understanding of the original program. Such an approach is not sufficient, for it not only takes time and effort for designers to become familiar with the original program, but the approach itself is also mistake-prone due to the human involvement. This paper presents a computer-aided semi-automatic method that abstracts OO designs from the original procedural source code. More specifically, it is a method for OO redesign based on program structural diagrams, visualization, and execution slice. We conducted a case study by applying this method to an inventory management software system. Results indicate that our method can effectively and efficiently abstract an appropriate OO design out of the original C code as well as regenerate part of the system in C++ code based on this new OO design.
A k-Nearest Neighbour Method for Managing the Evolution of a Learning Base
Authors: Jean-Luc Henry
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

A character recognition system with continuous learning seeks to constantly enhance its baserepresentation models in order to provide the best recognition rate.The method we arepresenting enables the system to enhance its base with models, which are performant inrecognition.This method also enables to get rid of models regularly doubtable in efficiency when it comes to interpretation of the characters studied.This rule is similar to the one used in the "Death by suffocation" game of life of Conway.We based ourselves on the theory of k-nearest neighbours to develop a new approach we named å -adaptive neighbourhood.It makes an adjustment of classes possible, according to confidence rate in each model of the learning base.These rates which are practically represented as weights are taken into account by the stage of the recognition system during the character recognition phase.The use of weight as a model selection factor, useful for recognition, enables the system to manage the evolution of the learning base.
Translation of binary regular expressions into nondeterministic &#x025B;-free automata with O(n log n)transitions
Authors: Viliam Geffert
Venue: Journal of Computer and System Sciences (2003)

We show that every regular expression of size n over a fixed alphabet of s symbols can be converted into a nondeterministic ε-free finite-state automaton with O(sn log n) transitions (edges). In case of binary regular languages, this improves the previous known conversion from O(n(log n)2) transitions to O(n log n). For the general case with no bound on cardinality of the input alphabet, our conversion yields a better constant factor in the O(n(log n)2) term. The number of states is bounded by O(n).
The Maestro Group Manager: A Structuring Tool For Applications With Multiple Quality of Service Requirements
Authors: Ken Birman, Roy Friedman, Mark Hayden
Venue:  (1997)

{\em Maestro} is a tool for managing sets of protocol stacks that satisfy varied quality of service or security requirements. Intended primarily for multimedia groupware settings, it permits a single application to efficiently operate over multiple side-by-side protocol stacks, each specialized to a different communication stream. Maestro can also be used to manage other sorts of external protocol stacks, for example to orchestrate connection setups that require coordinated actions at all endpoints in a multicast group. Our tools are fault-tolerant and secure; they can safely distribute session keys or handle delicate synchronization tasks that would otherwise complicate the managed stacks and potentially interfere with their quality-of-service objectives. Moreover, Maestro can automatically track subgroup membership on the basis of ``properties'''', facilitating its use by developers who prefer not to work directly with multicast communication interfaces.
The Diogenes Design Methodology: An Algorithmic Step Toward Efficient Configuration Circuitry
Authors: Arnold Rosenberg, Judson Knott
Venue:  (1986)

DIOGENES is a methodology for designing fault-tolerant VLSI processor arrays. The methodology views the desired array as an undirected graph, with vertices representing processing elements (PEs) and edges representing communication links; the design process operates in two stages: First, the graph representing the desired array is {\em embedded in a book}; then, the book-embedding is converted to an efficient fault-tolerant layout of the array. We describe here one step in the second stage. Specifically, we present here an efficient algorithm that takes a given book-embedding and finds that ``rotation'''' of the embedding that minimizes the number of control bits per PE needed to configure the array to its fault-free format. We illustrate the need for the algorithm by analyzing natural book-embeddings of complete $d$-ary trees and of X-trees. In the case of complete $d$-ary trees, the optimal rotation of the studied book-embeddings requires 2 control bits per PE, while a randomly chosen rotation requires, with probability approaching 1, $log~ _ 2 (d+4)$ control bits. In the case of X-trees, experiments suggest that the algorithm saves approximately one control bit per PE.
Remote Belief: Preserving Volition for Loosely Coupled Processes
Authors: Nuh Aydin, Paolo A. G. Sivilotti
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Knowledge has proven to be a useful and fundamentalformalism for reasoning about distributed systems. The applicationof this formalism, however, entails a loss of volitionon the part of processes about which something isknown. This loss of volition is often not appropriate inloosely coupled distributed systems. In this paper, we generalizethe formal characterization of knowledge into oneof belief. Belief has the advantage of allowing processes tomaintain volition. We examine some of the similarities andsurprising differences between knowledge and belief. Wealso present some examples of distributed applications thatare more conveniently characterized with belief rather thanknowledge.
Models to Promote Effective System Change
Authors: David W. Bustard, Zhonglin He, Raymond Oakes
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

Computing systems are complex, both in their composition and in the way that they evolve over time. To help manage this complexity, models can be used to highlight the significant elements and attributes of a system, and summarise key processes in its operation and evolution. The purpose of this paper is to present a set of such models for debate. Most of these are at the highest levels of system description and are therefore generally applicable across a range of development techniques. Consequently they provide a framework within which specific system development techniques can be described and assessed. The models are discussed with respect to an experimental methodology, BASE, being developed at the University of Ulster. Two significant aspects of this approach are (i) placing the production or enhancement of computing systems in the context of "business improvement"; and (ii) emphasising the need to make change with respect to a "vision" of where improvement is leading. The business analysis part of BASE is built on Soft Systems Methodology. The discussion is illustrated using examples from an IT System Review undertaken within the Department of Education for Northern Ireland.
Positional Sequencing by Hybridization
Authors: S. Hannenhalli, Pavel P. Pevzner, Herbert F. Lewis, Steven S. Skiena
Venue:  (1995)

Sequencing By Hybridization (SBH) is a promising alternative to the classical DNA sequencing approaches. However, the resolving power of SBH is rather low: with 64 Kb sequencing chips unknown DNA fragments only as long as 200 bp can be reconstructed in a single SBH experiment. To improve the resolving power of SBH Broude {\em et. al.}, 1994\nocite{Broude94} recently suggested {\em positional SBH} (PSBH) allowing (with additional experimental work) to measure approximate positions of every $1$-tuple in a target DNA fragment. We study the {\em positional eulerian path} problem motivated by PSBH. The input to the positional eulerian path problem is an eulerian graph $G(V,E)$ in which every edge has an associated range of integers and the problem is to find an eulerian path $e_1, \1dots, e_{|E|}$ in $G$ such that the range of $e_i$ contains $i$. We show that positional eulerian path problem is NP-complete even when the maximum out-degree (in-degree) of any vertex in the graph is 2. On the positive note we present polynomial algorithms to solve a special case of PSBH (bounded PSBH), where the range of the allowed positions for any edge is bounded by a constant (it corresponds to accurate experimental measurements of positions in PSBH). Moreover, if the positions of every $1$-tuple in an unknown DNA fragment of length $n$ are measured with $0(\log n)$ error, then our algorithm runs in polynomial time. We also present an estimate of the resolving power of PSBH for more realistic case when positions are measured with $\Theta(n)$ error.
MOBY - A Mobile Peer-to-Peer Service and Data Network
Authors: Tzvetan Horozov, Ananth Grama, Venu Vasudevan, Sean Landis
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

This paper describes the design and implementation of MOBY, a network for mobile peer-to-peer exchange of services and data. Constraints on computing power of mobile devices, limited hardware, networking, and software resources, and ad-hoc nature of mobile clients pose considerable challenges from the points of view of supporting performance goals, ease of service integration, and adaptation. These challenges are addressed in MOBY by dynamic service location and client mapping, surrogates for mobile clients, and standardized interfaces built upon off-the-shelf software components.
Many-valuedness and uncertainty
Authors: E. Orlowska
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

A generalisation of modal information logics to many-valued modal logics is presented. Information logics are the formalisms for reasoning about uncertain knowledge discovered from incomplete information. In these logics an analysis of information that has the form of descriptions of objects in terms of their properties can be carried on and relationships among objects based on their common properties (referred to as information relations) can be represented and discussed. In the proposed many-valued information logics both properties of objects and relationships among the objects are assumed to be many-valued. A relationship between the calculus of information relations and Aristotelian syllogistic is outlined.
Quartz: A QoS Architecture for Open Systems
Authors: Frank Siqueira, Vinny Cahill
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

This paper describes an architecture that provides support for quality of service (QoS) specification and enforcement in heterogeneous distributed computing systems. The Quartz QoS architecture has been designed to overcome various limitations of previous QoS architectures that have constrained their use in heterogeneous systems. These limitations include dependencies on specific platforms and the fact that their functionality is often limited by design to one particular area of application. Quartz is able to accommodate differences among diverse computing platforms and areas of application by adopting a flexible and extensible platform-independent design, which allows its internal components to be rearranged dynamically in order to adapt the architecture to the surrounding environment. Further significant problems found in other QoS architectures, such as the lack of flexibility and expressiveness in the specification of QoS requirements and limited support for resource adaptation, are also addressed by Quartz. This paper describes the motivations for and design of Quartz in detail, presents a prototype implementation of Quartz and an analysis of its design based on experience with a number of applications that use this prototype.
Towards a Software Engineering Approach to Web Site Development
Authors: Francesco Coda, Carlo Ghezzi, Giovanni Vigna, Franca Garzotto
Venue: Proceedings of the 9th international workshop on Software specification and design (1998)

The World Wide Web (WWW) has become "the" global infrastructure for delivering information and services. The demands and expectations of information providers and consumers are pushing WWW technology towards higher-level quality of presentation, including active contents and improved usability of the hypermedia distributed infrastructure. This technological evolution, however, is not supported by adequate Web design methodologies. Web site development is usually carried out without following a well-defined process and lacks suitable tool support. In addition, Web technologies are quite powerful but rather low-level and their semantics is often left largely unspecified. As a consequence, understanding the conceptual structure of a complex Web site and managing its evolution are complex and difficult tasks. The approach we advocate here is based on sound software engineering principles. The Web site development process goes through requirements analysis, design, and implementation in a high-level language. We define an object-oriented modeling framework, called WOOM, which provides constructs and abstractions for a high-level implementation of a Web site. An important feature of WOOM is that it clearly separates the data that are presented through the site from the context in which the user accesses such data. This feature not only enhances separation of concerns in the design stage, but also favors its subsequent evolution. The paper provides a view of the approach and of its current prototype implementation.
Where's the Schema? A Taxonomy of Patterns for Software Exchange
Authors: Dean Jin, James R. Cordy, Thomas R. Dean
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

Program comprehension tools extract, organize and analyze information about the design and implementation of software systems. Before tools can exchange information, they must share, at some level, the organization for the data exchanged. That is, they must share a schema. In this paper we examine the various ways in which schemas are represented and used in tools. Schema use is classified according to how and where a schema is defined, leading to the identification of four patterns of exchange. We examine these exchange patterns and discuss how each has been used in existing tool integration technologies. An evaluation of each exchange pattern against the requirements for a standard exchange format reveal the pattern of schema use that is most suitable for integrating tools.
Atomicity of Transaction Processing in Heterogeneous Autonomous Decentralized System
Authors: Isao Kaji, Kinji Mori
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

The requirements to integrate the heterogeneous applications are newly emerging. When integrating heterogeneous systems, it is necessary not to violate their respective characteristics, and also the complex works should be reduced. The recursive model on the basis of ADS concept has been proposed for the integration, where the attached system is regarded as one autonomous subsystem for the other. When a transaction is processed among the heterogeneous systems, it is better for the transaction to be guaranteed from the different points of view. The atomicity for the transaction processing under this model is categorized to the three levels, that is, the Global Atomic Action, the Semi-global Atomic Action and the Local Atomic Action. The integration of the heterogeneous systems is evaluated through the assurance level, which is measured how much the transaction processing is additionally improved by the integration. The realization and design techniques for their atomic actions are proposed, and the effectiveness of these techniques is demonstrated by the simulation, in which the tradeoff between the assurance level and the response time is balanced.
Deliberate evolution in multi-agent systems
Authors: F. M.T. Brazier, Catholijn M. Jonker, Jan Treur, N. J.E. Wijngaards
Venue:  (1998)

This paper presents an architecture for an agent capable of deliberation about the creation of new agents, and of actually creating a new agent in the multi-agent system, on the basis of this deliberation. After its creation the new agent participates fully in the running multi-agent system. The agent architecture is based on an existing generic agent model, and includes explicit formal conceptual representations of both structures of agents and (behavioural) properties of agents that can be used as requirements. Moreover, to support the deliberation process the agent has explicit knowledge of relations between structure and properties of agents. To actually create a new agent at run-time on the basis of the results of deliberation, the agent executes a creation action in the material world, which leads to a world state update to include the new agent, after which the new agent functions within the multi-agent system. This approach enables the design of evolution processes in societies of agents for which the evolution is not a merely material process which takes place in isolation from the mental worlds of the agents, but allows for interaction between mental and material processes. A combined mind-matter approach results in which the agents in a society can deliberatively influence the direction of the evolution, comparable to the potential offered by genetic engineering. The architecture has been designed using the compositional development method DESIRE, and has been tested in a prototype implementation. It is discussed how the approach introduced here can be used as a basis for automatic evolution of multi-agent systems for Electronic Commerce.
Multiple-Valued Decision Diagrams with Symmetric Variable Nodes
Authors: D. M. Miller, N. Muranaka
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

Symmetry is an important property of logic functions. In this paper, we introduce symmetric variable nodes, and investigate how they can be used to advantage in decision diagrams. We consider totally-symmetric and partially-symmetric functions as well as functions with partial symmetries. The identification of symmetric variable nodes is investigated as is the uniqueness of the resulting representation. A principal advantage of the new node type is that it often reduces the depth of the decision diagram. We consider the effect this has on the circuits that can be directly identified from decision diagrams.
A Frequency Selective Silicon Vibration Sensor with Direct Electrostatic Stiffness Modulation
Authors: Dirk Scheibner, Jürgen Wibbeler, Jan Mehner, Birgit Brämer, Thomas Gessner, Wolfram Dötzel
Venue: Analog Integrated Circuits and Signal Processing (2003)

In the field of industrial machinery an increasing demand for low cost vibration measurement equipment exists. The described frequency selective structures represent a low-cost alternative to the commonly used wide band accelerometers. To continuously cover a wide frequency range with a small number of resonators the sensor structures possess a resonance frequency tuning capability. Electrostatic forces applied to the seismic mass lead to a softening of the system and thus a lowering of the resonance frequency. Experimental results gained from fabricated test structures demonstrate the suitability of the tuning principle for wide range resonance tuning and the obtained linearity of the sensor behaviour. By grouping eight cells with stepped base frequencies and overlapping tuning ranges into an array one decade from 1 to 10 kHz is continuously covered with tuning voltages below 40 V.