ppxscal/embedding_network huggingface dataset:
Customizing System Software Using OO Frameworks
Authors: Nayeem Islam
Venue: Computer (1997)

Today's applications have exploded in their diversity, but most operating systems are still general-purpose and inefficient. One of the benefits of using an OO approach is the ability to modify very small details of an operating system, which makes it easy to tailor the system to the application. There has been an explosion of applications over the last few years. The behavior of modern applications, such as multimedia packages, parallel applications, and groupware, is diverse. Yet the operating systems they run on are usually optimized for an "average" application. Designing a general-purpose operating system that provides the best performance for every application is difficult. My experience indicates that optimizing an operating system for the general case can result in mediocre performance for specialized applications, especially parallel applications. Therefore, I envision a customizable operating system built from components that will allow an optimal match between application behavior and hardware architecture. I propose an object-oriented operating system in which design frameworks support alternative implementations of key systems software services. The most challenging part of designing a framework is to make it reconfigurable. For example, a configuration rule might improve an application's performance by replacing some of the operating system's data structures with subclasses of those structures. I propose a reconfigurable framework that implements different policies, depending on the framework subclass used. There are other approaches to customization. Compilers can be used when there is considerable information about an application domain. Design patterns are a mechanism for specifying designs that are at a higher level than frameworks. Frameworks fall somewhere between a compiler-based approach and design patterns. In my approach, each framework separates implementation details from the subset design, which is expressed as a set of abstract classes and their interrelationships. To customize its support, the operating system uses hints supplied by the application and a monitoring system to select the subclasses that are best suited to the application. Here I illustrate the method with a parallel application.
A closed form formula for long-lived TCP connections throughput
Authors: Augustin Chaintreau, Danny DeVleeschauwer
Venue: Performance Evaluation (2002)

In this paper, we study the variation of the throughput achieved by TCP resulting from both the individual behavior of a connection and the interaction with all other connections sharing the same link. In particular, we calculate the tail distribution function (TDF) of the instantaneous throughput seen by one TCP connection in the additive increase multiplicative decrease (AIMD) framework. For the particular case that each TCP connection experiences the same round trip time (RTT) and under the many users approximation we prove that this TDF is given by a closed form formula that solely depends on the network parameters (number of sources, capacity and buffer size of the bottleneck link). This formula can then be used as a dimensioning tool, where throughput is guaranteed to each user to be "larger than a given value for at least a certain percentage of the time". In the context defined here, this formula plays the same role for the dimensioning of an IP router as the Erlang B formula does for the dimensioning of a PSTN switch.
A Reference Architecture for the Certification of E-Services in a Digital Government Infrastructure
Authors: F. Arcieri, G. Melideo, E. Nardelli, M. Talamo
Venue: Distributed and Parallel Databases (2002)

Certifying the execution of a service is a critical issue for an e-government infrastructure. In fact being able to document that an e-service was actually carried out, given the legal value that is often attached to data managed and exchanged by public administrations, is of the utmost importance. This is made more complex in cases, like it often happens in the public administration sector, where e-services are based on legacy systems managed by autonomous and independent organizations. In this paper we discuss the introduction, within the standard three tier architecture for e-services, of an architectural subsystem providing certification functions. This architecture features both physical and functional independence from the application level and is made up by new control components providing a highly efficient solution for certification requirements. Our solution has been successfully tested in real-world systems developed in Italy to support digital government functions.
I-CoPES: fast instruction code placement for embedded systems to improve performance and energy efficiency
Authors: Sri Parameswaran, Jörg Henkel
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

The ratio of cache hits to cache misses in a computer system is, to a large extent, responsible for its characteristics such as energy consumption and performance. In recent years energy efficiency has become one of the dominating design constraints, due to the rapid growth in market share for mobile computing/communication/internet devices.In this paper we present a novel fast constructive technique that relocates the instruction code in such a manner into the main memory that the cache is utilized more efficiently. The technique is applied as a pre-processing step, i.e. before the code is executed. It is applicable for embedded systems where the number and characteristics of tasks running on the system is know a priori. The technique does not impose any computational overhead to the system. As a result of applying our technique to a variety of real-world applications we measured (through simulation) that the number of cache misses drops significantly. Further, this reduces the energy consumption of a whole system (CPU, caches, buses, main memory) by up to 65% at an only slightly increased memory size of 13% on average.
Hamilton cycles in random subgraphs of pseudo-random graphs
Authors: Alan Frieze, Michael Krivelevich
Venue: Discrete Mathematics (2002)

Given an r-regular graph G on n vertices with a Hamilton cycle, order its edges randomly and insert them one by one according to the chosen order, starting from the empty graph. We prove that if the eigenvalue of the adjacency matrix of G with the second largest absolute value satisfies λ = o(r5/2/(n3/2(logn)3/2)),then for almost all orderings of the edges of G at the very moment τ* when all degrees of the obtained random subgraph Hτ* of G become at least two, Hτ* has a Hamilton cycle. As a consequence we derive the value of the threshold for the appearance of a Hamilton cycle in a random subgraph of a pseudo-random graph G, satisfying the above stated condition.
Creatures: Entertainment Software Agents with Artificial Life
Authors: Stephen Grand, Dave Cliff
Venue: Autonomous Agents and Multi-Agent Systems (1998)

We present a technical description of Creatures, a commercial home-entertainment software package. Creatures provides a simulated environment in which exist a number of synthetic agents that a user can interact with in real-time. The agents (known as &rsquo;&rsquo;creatures&lsquo;&lsquo;) are intended as sophisticated &rsquo;&rsquo;virtual pets&lsquo;&lsquo;. The internal architecture of the creatures is strongly inspired by animal biology. Each creature has a neural network responsible for sensory-motor coordination and behavior selection, and an &rsquo;&rsquo;artificial biochemistry&lsquo;&lsquo; that models a simple energy metabolism along with a &rsquo;&rsquo;hormonal&lsquo;&lsquo; system that interacts with the neural network to model diffuse modulation of neuronal activity and staged ontogenetic development. A biologically inspired learning mechanism allows the neural network to adapt during the lifetime of a creature. Learning includes the ability to acquire a simple verb&ndash;object language.Additionally, both the network architecture and details of the biochemistry for a creature are specified by a variable-length &rsquo;&rsquo;genetic&lsquo;&lsquo; encoding, allowing for evolutionary adaptation through sexual reproduction. Creatures, available on Windows95 platforms since late 1996, offers users an opportunity to engage with Artificial Life technologies. In addition to describing technical details, this paper concludes with a discussion of the scientific implications of the system.
Studying Recommendation Algorithms by Graph Analysis
Authors: Batul J. Mirza, Benjamin J. Keller, Naren Ramakrishnan
Venue: Journal of Intelligent Information Systems (2003)

We present a novel framework for studying recommendation algorithms in terms of the &lsquo;jumps&rsquo; that they make to connect people to artifacts. This approach emphasizes reachability via an algorithm within the implicit graph structure underlying a recommender dataset and allows us to consider questions relating algorithmic parameters to properties of the datasets. For instance, given a particular algorithm &lsquo;jump,&rsquo; what is the average path length from a person to an artifact? Or, what choices of minimum ratings and jumps maintain a connected graph? We illustrate the approach with a common jump called the &lsquo;hammock&rsquo; using movie recommender datasets.
Neural Networks-Extraordinary Variation
Authors: Hans Peter Graf, Leonardo M. Reyneri
Venue: IEEE Micro (1995)

This paper presents a summary of four research projects presented at MICRONEURO 94, covering a variety of different hardware implementations of Artificial Neural Networks. The first two works describe optical and optoelectronic implementations. A combination of optics and electronics is described in the first work. An optical input plane for a neural net has been built so thatwhole images with tens of thousands of pixels can be entered into a network in parallel. In the second work, an all-optical network is presented, where not only the communication, but also the calculations, are done optically by using optically nonlinear materials. The third work addresses the issue of on-chip learning in analog implementations, by comparing the required precision for different learning schemes. It is observed that traditional algorithms such as back-propagation require a high resolution in the computation. The fourth work describes a digital VLSI circuit implementing a self-organizing feature map, an unsupervised learning technique. Also in this example one of the major problems is the resolution of the computation.
Incomplete Star: An Incrementally Scalable Network Based on the Star Graph
Authors: S. Latifi, N. Bagherzadeh
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

Introduces a new interconnection network for massively parallel systems called theincomplete star graph. The authors describe unique ways of interconnecting and labelingthe nodes and routing point-to-point communications within this network. In addition,they provide an analysis of a special class of incomplete star graph called C/sup n/splminus/1/ graph and obtain the diameter and average distance for this network. For theC/sup n/spl minus/1/ graph, an efficient broadcasting scheme is presented. Furthermore,it is proven that a C/sup n/spl minus/1/ with N nodes (i.e. N=m(n/spl minus/1)!) isHamiltonian if m=4 or m=3k, and k/spl ne/2.
Unstructured Tree Search on SIMD Parallel Computers
Authors: G. Karypis, V. Kumar
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

We present new methods for load balancing of unstructured tree computations onlarge-scale SIMD machines, and analyze the scalability of these and other existingschemes. An efficient formulation of tree search on an SIMD machine consists of twomajor components: a triggering mechanism, which determines when the search spaceredistribution must occur to balance the search space over processors, and a scheme toredistribute the search space. We have devised a new redistribution mechanism and anew triggering mechanism. Either of these can be used in conjunction with triggering andredistribution mechanisms developed by other researchers. We analyze the scalability ofthese mechanisms and verify the results experimentally. The analysis and experimentsshow that our new load-balancing methods are highly scalable on SIMD architectures.Their scalability is shown to he no worse than that of the best load-balancing schemeson MIMD architectures. We verify our theoretical results by implementing the 15-puzzleproblem on a CM-2 SIMD parallel computer.
A Shape Analysis Model with Applications to a Character Recognition System
Authors: J. Rocha, T. Pavlidis
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

A method for the recognition of multifont printed characters is proposed, giving emphasis to the identification of structural descriptions of character shapes using prototypes. Noise and shape variations are modeled as series of transformations from groups of features in the data to features in each prototype. Thus, the method manages systematically the relative distortion between a candidate shape and its prototype, accomplishing robustness to noise with less than two prototypes per class, on average. The method uses a flexible matching between components and a flexible grouping of the individual components to be matched. A number of shape transformations are defined, including filling of gaps, so that the method handles broken characters. Also, a measure of the amount of distortion that these transformations cause is given. Classification of character shapes is defined as a minimization problem among the possible transformations that map an input shape into prototypical shapes. Some tests with hand-printed numerals confirmed the method's high robustness level.
Experiences with ALMA: architecture-level modifiability analysis
Authors: Nico Lassing, Perlof Bengtsson, Hans van Vliet, Jan Bosch
Venue: Journal of Systems and Software (2002)

Modifiability is an important quality for software systems, because a large part of the costs associated with these systems is spent on modifications. The effort, and therefore cost, that is required for these modifications is largely determined by a system's software architecture. Analysis of software architectures is therefore an important technique to achieve modifiability and reduce maintenance costs. However, few techniques for software architecture analysis currently exist. Based on our experiences with software architecture analysis of modifiability, we have developed ALMA, an architecture-level modifiability analysis method consisting of five steps. In this paper we report on our experiences with ALMA. We illustrate our experiences with examples from two case studies of software architecture analysis of modifiability. These case studies concern a system for mobile positioning at Ericsson Software Technology AB and a system for freight handling at DFDS Fraktarna. Our experiences are related to each step of the analysis process. In addition, we made some observations on software architecture analysis of modifiability in general.
A Constrained Generative Model Applied to Face Detection
Authors: Feraud Raphaël, Bernier Olivier, Collobert Daniel
Venue: Neural Processing Letters (1997)

A generative neural network model, constrained by non-face examples chosen by an iterative algorithm, is applied to face detection. To improve the generalization ability of the model, another constraint based on the minimum description length is added. This model is tested and compared with another state-of-the-art face detection system on a large image test set collected at CMU.
A Multilevel Systolic Approach for Fuzzy Inference Hardware
Authors: Luis de Salvador, Julio Gutiérrez
Venue: IEEE Micro (1995)

We describe a digital architecture to evaluate fuzzy inferences. This architecture is based on a novel systolic structure in the field of fuzzy processing that is called multilevel systolic approach. Its main features are: high throughput, perfomance independent of the fuzzy model size supported, high flexibility to resize the parameters of the design, max-min inference, and capability for a considerable amount of complex rules without loss of efficiency. The circuit development has been carried out by using a VHDL simulator, with ES2 1um standard cells, and its results has given a perfomace over 10 mega fuzzy logic rule base inferences per second.
Trinocular Active Range-Sensing
Authors: A. Blake, D. McCowen, H. R. Lo, P. J. Lindsey
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Trinocular active devices have the advantage of freedom from mechanical scanning and rapid image capture compared with more conventional active designs based on scanning laser stripes. Their efficient operation relies, however, on a good solution to the correspondence problem. This requires careful geometric design to take account of epipolar geometry and thorough modeling of image-measurement error. A design that, involves setting up the projector-camera geometry to be degenerate-so that depth computation is ill-conditioned-and then backing off a little is presented. This is called near-degenerate epipolar alignment. The result is that unambiguous stereo matching can, in principle, be guaranteed within a given working volume. This is in marked contrast with passive stereo in which ambiguity cannot be guaranteed, merely minimized statistically. The principles have proved to work well in laboratory tests, achieving unambiguous operation over a working volume of a 50-mm cube with a depth resolution of around 0.2 mm.
Agentsheets: A Medium for Creating Domain-Oriented Visual Languages
Authors: Alexander Repenning, Tamara Sumner
Venue: Computer (1995)

Visual programming languages strive to simplify the intricate process of programming by capitalizing on innate human perceptual skills. However, visual representations of general-purpose programming constructs provide little support to end-users in creating programs in specific problem domains. To empower end-users, visual languages need to be tailored toward the domains in which they will be used. End users must collaborate with language designers to create and maintain effective, domain-oriented visual programming languages. Agentsheets is a system that (1) supports visual language designers in developing domain-oriented languages consisting of constructs that are pertinent to end users, (2) stimulates an iterative design approach by facilitating the incremental modification of the look and behavior of domain-oriented languages, and (3) provides role-specific views containing specialized tools that support collaboration between end users and language designers.
Cyberprivacy in the New Millennium
Authors: Hal Berghel
Venue: Computer (2001)

E-mail is indispensable for most of us, but one penalty of its convenience is its negative impact on individual privacy.
Toward Web-Based Application Management Systems
Authors: Avigdor Gal, John Mylopoulos
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

As Web technology spreads, the number, variety, and sophistication of Web-based information services is literally exploding. While some effort has been put into managing a single, centrally controlled Web site, current Web technologies offer little help for managing Web-based applications in-the-large. This is partly due to the distributed, heterogeneous, and open nature of such applications. This paper proposes a generic framework for managing Web-based applications which addresses both semantic and managerial issues. Semantic issues are addressed through the inclusion of a domain model component in the framework which describes the kinds of information that are available. Management issues are treated through a framework which includes formally-defined notions for an information model, information base consistency, transactions, and concurrency control. Thus, the proposed management system provides a semantically robust environment for Web-based information services while allowing for Web source independence.
Improving Service While Controlling Costs
Venue: IEEE Software (1991)

The need for performance engineering is described in terms software managers can use to make the case to upper management. Performance engineering is defined as a method for constructing systems to meet performance objectives. As a development approach, it lies between the extremes of performance-driven development and fixing it later. Some successful applications of this approach are examined.
Energy Metric for Software Systems
Authors: Alexander Chatzigeorgiou, George Stephanides
Venue: Software Quality Control (2002)

Acknowledging the intense requirement for low power operation in most portable computing systems, this paper introduces the notion of energy efficient software design and proposes metrics, for evaluating software systems in terms of their energy consumption. Considering the sources of power consumption in every digital circuit, and the fact that power is primarily dependent on the executing software, appropriate energy measures are derived, which can be extracted from the flowgraph of a program. The proposed measures are computed by applying rules common to the existing hierarchical measures of other internal software attributes, and form the basis for the definition of a software energy metric. This metric can be used in order to determine the level of energy consumption of any software system more efficiently than existing assembly-parsing techniques, with only a limited penalty in accuracy. Application to different implementations of algorithms, drawn from matrix algebra and multimedia, demonstrates the efficiency of the proposed energy metric for comparison purposes, and as an indicator for quality improvement.
Embedding Binary X-Trees and Pyramids in Processor Arrays with Spanning Buses
Authors: Z. Guo, R. G. Melhem
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

We study the problem of network embeddings in 2-D array architectures in which eachrow and column of processors are interconnected by a bus. These architectures areespecially attractive if optical buses are used that allow simultaneous access by multipleprocessors through either wavelength division multiplexing or message pipelining, thusovercoming the bottlenecks caused by the exclusive access of buses. In particular, wedefine S-trees to include both binary X-trees and pyramids, and present two embeddingsof X-trees into 2-D processor arrays with spanning buses. The first embedding has theproperty that all neighboring nodes in X-trees are mapped to the same bus in the targetarray, thus allowing any two neighbors in the embedded S-trees to communicate witheach other in one routing step. The disadvantage of this embedding is its relatively highexpansion cost. In contrast, the second embedding has an expansion cost approachingunity, but does not map all neighboring nodes in X-trees to the same bus. Theseembeddings allow all algorithms designed for binary trees, pyramids, as well as X-trees to be executed on the target arrays.