ppxscal/embedding_network huggingface dataset:
Compiler-Controlled Cache Mapping Rules
Authors: A R Wagner
Venue:  (1995)

The gap between memory speed and CPU speed in current RISC machines is often bridged with one or more levels of set-associative cache. In programs which operate on dense matrices, performance is often limited by memory reference times, rather than the apparent arithmetic complexity. Attempts to improve performance by blocking the loops of the code may fail to achieve the promised speed, because the submatrices which they try to maintain in cache exhibit self-interference. That is, many distinct cache lines of some or all of the submatrices map into the same cache association set. This can cause essentially every reference to such cache lines to produce a cache miss. A new cache design is presented. This design allows the compiler to program the mappings used to select cache association sets from virtual addresses, allowing a different mapping to be used for each array. It is shown how instructions to program such mappings can be inserted into straightforward loop blocking code to allocate the cache so that distinct arrays referenced during the innermost loop nests occupy different areas of the cache, and that these array blocks are mapped in such a way that no array exhibits self interference. These blocks then remain co-resident in the cache during such loops. Any compiler which automatically "blocks" loops for increased locality can easily generate the proposed instructions.\\ {\bf Index terms and phrases:} Cache, Dense matrix computation, Programmable Cache Mapping, Loop blocking, IBM RS/6000.
Dynamic Location Management with Variable Size Location Areas
Authors: Ajit Pal, Digvijay Singh Khati
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

This paper introduces a dynamic location management algorithm with variable size location areas(LAs), which helps in reducing location update(LU) cost and hence total location management cost. Basically there are two types of location management strategies - Static and Dynamic. In the static strategy (used in GSM), LAs consist of static and arbitrarily defined collections of cells, which do not take into account individual subscriber's mobility pattern and hence these LAs remain same for all the subscribers. Since mobility pattern of an individualsubscriber may differ significantly, this approach is far from optimal. Proposed location management algorithm uses the mobility history of individual subscribers to dynamically form individualized LAs based on his previous movements from cell to cell. It defines the size ofLAs based on subscriber's speed and call arrival probability. An activity-based mobility model is developed to test the proposed algorithm and the performance of this algorithm is compared with other algorithms, like fixed location strategy, grid-based location management strategy and dynamic location management algorithm. Overall, the proposed algorithm incurred significantlylower location management cost, in terms of signalingmessages generated, as compared to all other algorithms.
Stabilization of biped dynamic walking using gyroscopic couple
Authors: T. C. F. Wong, Y. S. Hung
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

This paper presents a new strategy for dynamic walking machine where a gyroscope mounted on top of the biped is processed to achieve balancing both in the coronal and sagittal planes. A gait is devised and simulation results are provided to show the feasibility of proposed balancing method.
A Multicast User Directory Service for Synchronous Rendezvous
Authors: Eve M. Schooler
Venue:  (1996)

No abstract available.
Reliability Prediction and Sensitivity Analysis Based on Software Architecture
Authors: Swapna S. Gokhale, Kishor S. Trivedi
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

Prevalent approaches to characterize the behavior ofmonolithic applications are inappropriate to model modernsoftware systems which are heterogeneous, and are builtusing a combination of components picked off the shelf,those developed in-house and those developed contractually.Development of techniques to characterize the behaviorof such component-based software systems based ontheir architecture is then absolutely essential. Earlier effortsin the area of architecture-based analysis have focusedon the development of composite models which are quitecumbersome due to their inherent largeness and stiffness.In this paper we develop an accurate hierarchical model topredict the performance and reliability of component-basedsoftware systems based on their architecture. This modelaccounts for the variance of the number of visits to eachmodule, and thus provides predictions closer to those providedby a composite model. The approach developed inthis paper enables the identification of performance and reliabilitybottlenecks. We also develop expressions to analyzethe sensitivity of the performance and reliability predictionsto the changes in the parameters of individual modules. Inaddition, we demonstrate how the hierarchical model couldbe used to assess the impact of changes in the workload onthe performance and reliability of the application. We illustratethe performance and reliability prediction as well assensitivity analysis techniques with examples.
QuickBooks 2003 for Dummies
Authors: Stephen L. Nelson
Venue:  (2003)

:You're the expert at your business, but what if that business is not financial management? If bookkeeping baffles you, here's the book you need to keep. It shows you exactly how to use QuickBooks 2003 to track accounts receivable and payable, set up online banking and bill paying, monitor inventory, print checks, manage the money -- and save some, too! The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
An Empirical Text Categorizing Computational Model Based on Stylistic Aspects
Authors: S. E. Michos, E. Stamatatos, N. Fakotakis, G. Kokkinakis
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

The presented work is strongly motivated by the need of categorizing unrestricted texts in terms of functional style (FS) in order to attain a satisfying outcome in style processing. Towards this aim, it is given a three-level description of FS that comprises: (a) the basic categories of FS, (b) the main features that characterize each one of the above categories, and (c) the linguistic identifiers that act as style markers in texts for the identification of the above features. Special emphasis is put on the problems that faced the computational implementation of the aforementioned findings as well as the selection of the most appropriate stylometrics (i.e., stylistic scores) to achieve better results on text categorization. This approach is language independent, empirically-driven, and can be used in various applications including grammar and style checking, natural language generation, style verification in real-world texts, and recognition of style shift between adjacent portions of text.
Interoperation of Mobile IPv6 and Protocol Independent Multicast Dense Mode
Authors: Christian Bettstetter, Anton Riedl, Gerhard Geβler
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

This paper discusses different approaches of providing multicast traffic for mobile hosts. Mobile IPv6 is used for mobility support. The network employs Protocol Independent Multicast Dense Mode (PIM-DM) for multicast routing and Multicast Listener Discovery (MLD) to collect multicast group membership information. We identify and analyze interoperation problems concerning membership control for mobile hosts and efficient multicast packet transfer from/to mobile hosts. We discuss four multicast delivery mechanisms for mobile senders and receivers, and compare them using criteria such as join delay, routing optimality, protocol overhead, network bandwidth, and system load. In particular, we suggest timer optimizations for MLD to support highly mobile receivers.
Replicating Software Engineering Experiments: Addressing the Tacit Knowledge Problem
Authors: Forrest Shull, Victor Basili, Jeffrey Carver, José C. Maldonado, Guilherme Horta Travassos, Manoel Mendonça, Sandra Fabbri
Venue: Proceedings of the 2002 International Symposium on Empirical Software Engineering (2002)

Recently the awareness of the importance of replicating studies has been growing in the empirical software engineering community. The results of any one study cannot simply be extrapolated to all environments because there are many uncontrollable sources of variation between different environments.In our work, we have reasoned that the availability of laboratory packages for experiments can encourage better replications and complementary studies. However, even with effectively specified laboratory packages, transfer of experimental know-how can still be difficult. Acooperation between Brazilian and American researchers addressing effective running of replications was formed in 1999. One of the specific issues being addressed is the problem of transferring tacit knowledge.We discuss what we learned about the tacit knowledge transfer problem and the evolution of laboratory packages in the description of a replication performed in Brazil using a PBR laboratory package.; also how further issues will be addressed.
Gathering and Using Time Measurements in Distributed Systems
Authors: A M Dietz
Venue:  (1996)

It is often necessary to measure time in distributed computer systems. For example, timestamps are used for measuring the intervals between events (like banking transactions). They are also used for ordering events, as in the generation of transaction logs and debug traces. Perhaps their most common use is in performance evaluation, capacity planning, and the detection of unpredicted delays or bottlenecks. Measuring and using time in a distributed environment presents some unique challenges. This thesis illuminates these problems and presents techniques for the proper measurement and use of time. The first challenge is the clocks themselves. Chapter 3 describes the tradeoff between keeping clocks synchronized and keeping them accurate. The inaccuracies of networked workstation clocks are examined, and two statistical techniques are described for collecting time measurements in spite of these insufficiencies. The second challenge is synchronization. There is often a need to order events occurring on several processors, and to measure the time intervals between those events. Chapter 4 is a workload characterization of message-passing in distributed applications. In the course of this work, a method for generating global event traces was developed to get a system-wide view of message traffic. The message traffic was found to have characteristics similar to those observed in network packet traffic. The third challenge is performance prediction. Programmers need tools to help them understand the interactions between components of a system, and to project the execution time of prospective designs and configurations. Also, operating systems need fast tools to aid scheduling decisions and adaptation of software. We present a technique called benchmark blending that combines the speed of analytic models with the flexibility of benchmarks. Benchmark blending weaves time measurements with modeling techniques to create analytic models that%3A 1) quickly and accurately predict execution time, 2) implicitly incorporate much of the underlying system complexity, and 3) provide programmers with the needed insight to build efficient applications. We conclude that time measurements are a necessary part of building and studying distributed systems. Their use presents some challenges. This thesis presents solutions for three of those challenges%3A clock instability, global event descriptions, and performance prediction.
Multiple-Valued Logic Minimization by Genetic Algorithms
Authors: Yutaka Hata, Kiyoshi Hayase, Takahiro Hozumi, Naotake Kamiura, Kazuharu Yamato
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

This paper describes an approach to minimize multiple-valued logic expressions by genetic algorithms. We encode a multiple-valued logic expression as a "chromosome" whose length allows to change and corresponds to the number of implicants of the expression. Our fitness function evaluates the following three items:1.How may outputs does the logic expression represent correctly?2. How many implicants the logic expression requires?3. How many connections does the logic expression requires?Our method employ the fitness function and minimize sum-of-products expressions, where sum refers TSUM or MAX and product refers to MIN of set literals or window literals. The simulation results show that our method derive good results for some arithmetic functions and intend to avoid the local minimal solution, compared to neural-computing-based method.Keywords, multiple-Valued logic, Genetic Algorithms, minimization
A Motion-Compensated Filter for Ultrasound Image Sequences
Authors: Lee Markosien
Venue:  (1996)

Medical ultrasound images are an important diagnostic tool for physicians, but suffer from low image intensity, dropouts, and noise in the form of speckle. I propose a new method for filtering ultrasound image sequences which is based on a motion-compensated temporal filter. The key contribution is a new method for detecting and tracking image features which is fully automatic. Applying this algorithm in a motion-compensated temporal filter demonstrates its worth. The tracking and filtering algorithms together run at speeds approaching real-time on a standard scientific workstation. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Application of dynamic models to the detection of imperfections in plate structures
Authors: A. Samartín, C. Moreno
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper is part of research project aimed to simulate the dynamic input and output of experimental nondestructive tests in order to detect structural imperfections in structures composed by steel thin plates. The considered imperfections are divided into two classes. Cracks, related with the structural safety, that are typically penetrating a significant part of the plate thickness and micro cracks or superficial imperfections more connected to the structural protection to the environment, i.e. with the deterioration of protective paintings. Bending Kirchhoff thin plate models have been applied to detect cracks of the first class. The models used to identify micro cracks are membrane structures models under the superficial Rayleigh waves excitation.Geometry and crack position can be detected quite accurately if comparison between first derivatives (mode rotations) of the natural modes of Kirchhoff thin sane and cracked plates is made. Rayleigh waves excitation models seem to be a very promising technique for imperfections detection. However, mathematical as well as numerical difficulties arise in treatment of the generation of these Rayleigh waves. They are related to the dispersion problems appearing during the time history analysis by finite differences and to the computation of the large number of finite elements on the spatial coordinates.
Design of Local Communication for Cooperation in Distributed Mobile Robot Systems
Authors: T. Arai, E. Yoshida
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

This paper presents a novel design methodology of local communication system for cooperation in distributed mobile robot systems. Our goal is to design a local communication system so as to transmit task information to necessary robots in minimum time without excessive propagation. In this paper, we propose a layered methodology, i.e. design from spatial and temporal aspects based on analysis of information diffusion by local communication between robots. The spatial design gives the optimal communication area minimizing transmission time for various cooperative tasks. In the temporal design, we derive the information announcing time to prevent excessive information diffusion. Finally, the simulations and experiments demonstrate that the design methodology is effective in constructing an efficient local communication system.
On wavelength translation in all-optical networks
Authors: M. Kovacevic, A. Acampora
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

In this paper we study the benefits of wavelength translation in all-optical networks providing clear channel circuit-switching among users. We first establish approximate analytical models for a static-routing circuit-switched network with an arbitrary topology, both with and without wavelength translation. We then study performance of the non-blocking centralized switch, the mesh-torus network and the ring network, using the analytical models and simulation results. It is shown that the analytical models match the simulation results very well in the case of the centralized switch and the mesh network. The results of our study also show that the benefits of wavelength translation are marginal for the centralized switch and the ring network. On the other hand, the results show that wavelength translation can significantly improve performance of a large mesh network.
Detecting Static Objects in Busy Scenes
Authors: Jia Wang, Wei Ooi
Venue:  (1999)

Detecting static objects in scenes containing significant number of moving objects has several applications in video surveillance. One example is the detection of suspicious packages which is left unattended in an airport terminal or railway station. This paper outlines an approach to automatically detect static objects from a video sequence of a busy scene. Our approach consists of two phase : foreground object extraction and object matching. In the first phase, we find the foreground objects in current video frame, using an image of a background as reference. In the object matching phase, we try to match the objects with objects that appears before in previous frames. Matching is done based on three parameter : shape and position, intensity and edge. Temporary occluded of objects is also handled. We built a system based on our approach. Preliminary experiments shows that our system are able to identify static objects in a busy scene in real time.
Random generation of dags for graph drawing
Authors: Guy Melancon, I. Dutour, M. Bousquet-Melou
Venue:  (2000)

The Graph Drawing community uses test suites for comparing layout quality and efficiency. Those suites often claim to collect randomly generated graphs, although in most cases randomness is a loosely defined notion. We propose a simple algorithm for generating acyclic digraphs with a given number of vertices uniformly at random. Applying standard combinatorial techniques, we describe the overall shape and average edge density of an acyclic digraph. The usefulness of our algorithm resides in the possibility of controlling edge density of the generated graphs. We have used our technique to build a large test suite of acyclic digraphs with various edge density and number of vertices ranging from 10 to 1000.
Performance Guarantees for Cluster-Based Internet Services
Authors: Chang Li, Gang Peng, Kartik Gopalan, Tzi-cker Chiueh
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

As web-based transactions become an essential elementof everyday corporate and commerce activities, it becomesincreasingly important that the performance of web-basedservices be predictable and guaranteed even in the presenceof wildly fluctuating input loads. In this paper, we proposea general implementation framework to provide qualityof service (QoS) guarantee for cluster-based Internet services,such as E-commerce or directory service. We describethe design, implementation, and evaluation of a webrequest distribution system called Gage, which can provideevery subscriber with distinct guarantee on the number ofgeneric web requests that are serviced per second regardlessof the total input loads at run time. Gage is one of the firstsystems that can support QoS guarantee involving multiplesystem resources, i.e., CPU, disk, and network. The front-endrequest distribution server of Gage distributes incomingrequests among a cluster of back-end web server nodesso as to maintain per-subscriber QoS guarantee and loadbalance among the back-end servers. Each back-end webserver node includes a Gage module, which performs distributedTCP splicing and detailed resource usage accounting.Performance evaluation of the fully operational Gageprototype demonstrates that the proposed architecture canindeed provide the guaranteed request throughput for differentclasses of web accesses, even in the presence of excessiveinput loads. The additional performance overhead associatedwith QoS support in Gage is merely 3.06%.
EAGLES Synopsis and Comparison of Morphosyntactic Phenomena Encoded in Lexicons and Corpora. A Common Proposal and Applications to European Languages
Authors: Monica Monachini, Nicoletta Calzolari
Venue:  (1996)

The objective of the present document is to propose a common core set of morphosyntactic destinctions to be encoded in lexicons of the European languages. Computational lexicons represent an area where a pressing need is felt for the provision of basic large-scale resources which must be actually reusable, interchangeable, shareable and also integrable in a multilingual environment. In terms of cost and effort it is quite expensive to produce such resources in detail. In the construction of large-scale resources and in the definition of annotation strategies, reusability is an essential require to pursue (Calzolari 1994). If we want to produce and exchange Natural Language resources which are effectively shareable, and possibly usable by the same set of basic tools, with results of processing which are really comparable and integrable, we should aim at designing and producing these resources according to a common set of consensual and broadly agreed specifications, i.e. standards (Calzolari and Zampolli 1994): TEL:: +39 50 560481
A Distributed Implementation of a Task Pool
Authors: Peter H. Hofstee, Johan J. Lukkien, Jan L. A. Van de Snepscheut
Venue:  (1991)

No abstract available.