ppxscal/embedding_network huggingface dataset:
Cost-Efficient Load Distribution Using Multicasting
Authors: Jefferson L. Tan
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

Multicasting is a cost-efficient method to send one message to members of a group of hosts with only one transmission. This paper suggests that the multicast address may be used in load balancing or load sharing to carry information about the capability of nodes and what capability migrating tasks require. This can make it unnecessary to gather state information about other nodes, which is required by many load sharing or load balancing algorithms. Simulation experiments are ongoing using colored Petri nets, and prototyping should eventually be attempted, but results are not yet available. However, since possible benefits can be imagined using single-transmission, multicast messages as against probing for or gathering state information, this paper describes the approach with load sharing and load balancing algorithms and lightly touches on other possible applications. (Note that without adequate data, the paper does not include comparisons with existing solutions.) 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
Coordinated Exception Handling in Distributed Object Systems: From Model to System Implementation
Authors: Jie Xu, Alexander Romanovsky, Brian Randell
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

Exception handling in concurrent and distributed programs is a difficult task though it is often necessary. In many cases traditional exception mechanisms for sequential programs are no longer appropriate. One major difficulty is that the process of handling an exception may need to involve multiple concurrent components that are cooperating in pursuit of some global goal. Another complication is that several exceptions may be raised concurrently in different nodes of a distributed environment. Existing proposals and actual concurrent languages either ignore these difficulties or only cope with a limited form of them. This paper attempts a general solution, developed especially for distributed object systems, starting from a conceptual model, together with algorithms for coordinating concurrent components and resolving multiple exceptions, through to an actual system implementation. An industrial production cell is chosen as a case study to demonstrate the usefulness of the proposed model and algorithms. A system that supports coordinated atomic actions and exception resolution is implemented in distributed Ada 95 and examined through several performance-related experiments.
Comparing Keyword Extraction Techniques for WEBSOM Text Archives
Authors: Arnulfo P. Azcarraga, Teddy N. Yap Jr.
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

The WEBSOM methodology for building very large text archives has a very slow method for extracting meaningful unit labels. This is because the method computes for the relative frequencies of all the words of all the documents associated to each unit and then compares these to the relative frequencies of all the words of all the other units of the map. Since maps may have more than 100,000 units and the archive may contain up to 7 million documents, the existing WEBSOM method is not practical. A fast alternative method is based on the distribution of weights in the weight vectors of the trained map, plus a simple manipulation of the random projection matrix used for input data compression. Comparisons made using a WEBSOM archive of the Reuters text collection reveal that a high percentage of keywords extracted using this method match the keywords extracted for the same map units using the original WEBSOM method.
Computing power series solutions of a nonlinear PDE system
Authors: E. Hubert, N. Le Roux
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

This paper presents a new algorithm to compute the power series solutions of a significant class of nonlinear systems of partial differential equations. The algorithm is very different from previous algorithms to perform this task. Those relie on differentiating iteratively the differential equations to get coefficients of the power series, one at a time. The algorithm presented here relies on using the linearisation of the system and the associated recurrences. At each step the order up to which the power series solution is known is doubled. The algorithm can be seen as belonging to the family of Newton iteration methods.
Independence of Each Axiom in a Set of Axioms and Complete Sets of Axioms of Boolean Algebra
Authors: Tomoko Ninomiya, Masao Mukaidono
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

We investigate fundamental properties of axioms ofBoolean algebra in detail by using the Method ofIndeterminate Coefficients. Three axioms, one of thecomplementary laws, one of the distributive laws and oneof the least element (a), greatest element (b) and theabsorption laws are essential for the algebra becausethose are independent form all other axioms of Booleanalgebra. Then we research candidates, including thosethree axioms and other smaller size of axioms, forcomplete sets of axioms of Boolean algebra, and we canshow some of those candidates are indeed complete sets ofaxioms of the algebra.
Web Services Development with Delphi
Authors: Peter Darakhvelidze, Evgeny Markov
Venue:  (2002)

:Intended for professional developers working in Delphi who are looking for a way to move into the sphere of new programming technology for e-business, this guide discusses specific Delphi tools and technologies and enables developers to take advantage of the RAD technique with the new version of Delphi for creating Web services. Emphasis is given to the development of data processing using the XML and SOAP protocol and to the creation of Web services based on its capabilities. Also covered are all aspects of working with databasesdata presentation; local, client-server, and distributed systems; and technologies of accessing data, from BDE to dbExpress and dbGO.
A framework for classifying denial of service attacks
Authors: Alefiya Hussain, John Heidemann, Christos Papadopoulos
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

Launching a denial of service (DoS) attack is trivial, but detection and response is a painfully slow and often a manual process. Automatic classification of attacks as single- or multi-source can help focus a response, but current packet-header-based approaches are susceptible to spoofing. This paper introduces a framework for classifying DoS attacks based on header content, and novel techniques such as transient ramp-up behavior and spectral analysis. Although headers are easily forged, we show that characteristics of attack ramp-up and attack spectrum are more difficult to spoof. To evaluate our framework we monitored access links of a regional ISP detecting 80 live attacks. Header analysis identified the number of attackers in 67 attacks, while the remaining 13 attacks were classified based on ramp-up and spectral analysis. We validate our results through monitoring at a second site, controlled experiments, and simulation. We use experiments and simulation to understand the underlying reasons for the characteristics observed. In addition to helping understand attack dynamics, classification mechanisms such as ours are important for the development of realistic models of DoS traffic, can be packaged as an automated tool to aid in rapid response to attacks, and can also be used to estimate the level of DoS activity on the Internet.
Convergence Refinement
Authors: Murat Demirbas, Anish Arora
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

Refinement tools such as compilers do not necessarily preserve fault-tolerance. That is, given a fault-tolerant program in a high-level language as input, the output of a compiler in a lower-level language will not necessarily be fault-tolerant. In this paper, we identify a type of refinement, namely "convergence refinement", that preserves the fault-tolerance property of stabilization. We illustrate the use of convergence refinement by presenting the first formal design of Dijkstra's little-understood 3-state stabilizing token-ring system. Our designs begin with simple, abstract token-ring systems that are not stabilizing, and then add an abstract"wrapper" to the systems so as to achieve stabilization. The system and the wrapper are then refined to obtain a concrete token-ring system, while preserving stabilization. Infact, the two are refined independently, which demonstrates that convergence refinement is amenable for "graybox" design of stabilizing implementations, i.e., design of system stabilization based solely on system specification and without knowledge of system implementation details.
Argumentation based decision making for autonomous agents
Authors: Antonis Kakas, Pavlos Moraitis
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper presents an argumentation based framework to support the decision making of an agent within a modular architecture for agents. The proposed argumentation framework is dynamic, with arguments and their strength depending on the particular context that the agent finds himself, thus allowing the agent to adapt his decisions in a changing environment. In addition, in order to enable the agent to operate within an open environment where the available information may be incomplete we have integrated abduction within this argumentation framework. This is particular useful when the agent finds himself in a dilemma and hence needs additional information to resolve this. We have also developed, motivated by work in Cognitive Psychology, within the same framework an argumentation based personality theory for agents thus incorporating a dimension of individuality in the decisions of the agent.
The Essential Guide to User Interface Design: An Introduction to GUI Design Principles and Techniques, 2 edition
Authors: Wilbert O. Galitz
Venue:  (2002)

:Well-designed graphical user interfaces (GUIs) for business systems can greatly increase user productivity, but designing them can be difficult and time consuming. This book walks developers through the basics of good interface design, using real-world examples from systems that are proven successes.* Galitz is an internationally recognized consultant, author, and instructor with many years of experience with information systems and user interface design* Written especially for developers who may be designing user interfaces for the first time, but also extremely useful for any developer involved in GUI or Web site design* Revised to reflect the profound enhancements in interface design, specifically how Web page design has revolutionized interface design* New information covers a variety of platforms, both traditional and Web-based
Process Decomposition Through Locality of Reference
Authors: Anne M. Rogers, Keshav Pingali
Venue:  (1988)

In the context of sequential computers, it is common practice to exploit temporal locality of reference through devices such as caches and virtual memory. In the context of multiprocessors, we believe that it is equally important to exploit spatial locality of reference. We are developing a system which, given a sequential program and its domain decomposition, performs process decomposition so as to enhance spatial locality of reference. We describe an application of this method generating code from shared-memory programs for the (distributed memory) Intel iPSC/2.
Hypermedia Support for Collaboration in Requirements Analysis
Authors: Kenji Takahashi, Colin Potts, Vinay Kumar, Kenji Ota, Jeffrey D. Smith
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

We describe a model and system to support collaboration in requirements analysis with hypermedia technologies. The hypermedia support approaches the issues in communication, agreement, and traceability management, which are critical in the early phase in requirements analysis. Our approach consists of (1) an extension of the Inquiry Cycle model, a cyclic model of requirements analysis, for the collaborative work, and (2) comprehensive interaction media that fully utilizes WWW (World Wide Web) and Internet technologies. In this paper, we review the lessons learnt from experiences in applying the Inquiry Cycle model and Tuiqiao, a hypertext tool based on the model, to collaborative work in requirements analysis of a telephone directory service. We then propose an extension of the model and discuss the design of EColabor, a networked hypermedia system for requirements analysis. EColabor is based on the extended Inquiry Cycle model and implemented with the web and Internet technologies, including distributed version control and audio/video conferencing.
On Local Register Allocation
Authors: Martin Farach, Vincenzo Liberatore
Venue:  (1997)

In this paper, we consider the problem of Local Register Allocation (LRA): given a sequence of instructions (basic block) and a number of general purpose registers, find the schedule of variables in registers that minimizes the total traffic between CPU and the memory system. Local register allocation has been studied for more than thirty years in the theory and compiler communities. It was not known if LRA is NP-hard, but no subexponential time algorithm was known. Furthermore, the most popular heuristics in use in compilers can perform arbitrarily poorly in the worst case. In this paper, we present the following results: We show that the Local Register Allocation problem is NP-hard. We show that a variant of the furthest-first heuristic achieves a good approximation ratio. We give a 2-approximation algorithm for LRA. We report the experimental performance of a branch-and-bound algorithm and both approximation algorithms on standard benchmarks.
Implementation Techniques and an Object Group Service for CORBA-Based Applications in the Field of Parallel Processing
Authors: Markus Aleksy, Axel Korthaus
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

In this paper, we examine the suitability of CORBA-based solutions for meeting application requirements in the field of distributed parallel programming. We outline concepts defined within CORBA, which are helpful for the development of parallel applications, and we describe which programming techniques are at hand for this purpose. Subsequently, we present an Object Group Service, which facilitates the development of CORBA-based, distributed and parallel software applications. Moreover, we introduce some basic ideas of how the Unified Modeling Language (UML) can be used for modeling parallel applications.
Practical code coverage for Verilog
Authors: Tsu-Hua Wang, Chong Guan Tan
Venue: Proceedings of the 4th IEEE International Verilog HDL Conference (1995)

The ability to detect sections of code that have not been executed in a program or design has always been desired by hardware designers, since unexecuted code is clearly untested code. Unfortunately, there have been virtually no practical mechanisms for doing so. Given the combinatorial number of input possibilities for even a moderate design, exhaustive coverage obviously exceeds the capabilities of simulators. However, this does not mean that there cannot be useful heuristics, short of full coverage, that provide valuable feedback to hardware designers. This paper discusses a number of such practical approaches explored in a joint research project between Sun Microsystems and Chronologic Simulation. In addition to discussing the various intermediate approaches explored, the paper also discusses one approach that appears both practical and useful and its utility in uncovering untested sections in several Sun designs.
Improvement of Panorama-Based Annotation Overlay Using Omnidirectional Vision and Inertial Sensors
Authors: Masakatsu Kourogi, Yoichi Muraoka, Takeshi Kurata, Katsuhiko Sakaue
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

Annotation overlay on live video frames is an essential feature of augmented reality (AR), and is a well-suited application for wearable computers. A novel method of annotation overlay and its real-time implementation is presented. This method uses a set of panoramic images captured by omnidirectional vision at various points of environment and annotations attached on the images. The method overlays the annotations according to the image alignment between the input frames and the panoramic images, it uses inertial sensors not only to produce robust results of image registration but also to improve processing throughput and delay.
Beyond Year 2000 Remediation: the Compliance Verification - A Case Study
Authors: Michelangelo Interesse, Roberto Dabbicco
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

One of the biggest problems attracting the attention of the whole Information Systems world since more than a year ago is the "Millenium Bug", as it is usually referred to. Though a number of solutions, in terms of processes, techniques and tools, have been proposed till now, none of them guarantees 100% effectiveness. Moreover, the actual effort and time due for the remediation activities are growing up more than expected, while the time to the year 2000 is winding down. Aware of that, many institutions and companies are setting up contingency plans to handle anomalies when they will appear, next year. At the same time, governments (and insurance companies) are beginning to encourage new initiatives aimed to lower the risks.One of the most relevant of them is the Independent Verification and Validation of the processes applied and, more specifically, the Year 2000 Compliance Verification of the Information Systems.In this paper, the process and tools for the Y2K Netsiel Compliance Verification Service are briefly described. Moreover, the results obtained on a real case application in terms of elapsed time and defects found are shown.
Encapsulation and information hiding as the keys to enhanced hypermedia development and maintenance
Authors: Wilfried Lemahieu
Venue: Data Knowledge Engineering (2003)

This paper presents a solution to the maintenance problem in hypermedia by applying object-oriented techniques to both the hypermedia data model and the hypermedia system's actual implementation. First, the primary concepts of the "MESH" (Maintainable, End user friendly, Structured Hypermedia) approach are discussed briefly. These consist of a conceptual data model, a navigation paradigm and an implementation framework. Thereafter, it is shown how the object-oriented concepts of encapsulation and information hiding result in a hypermedia system consisting of self-contained, independently coded nodes. Intranode maintenance is separated entirely from internode maintenance: the hyperbase's link structure can be updated without affecting node content, whereas an individual node's multimedia content can be reorganized without necessitating updates to links or link anchors.
Automated Language Processing
Authors: Gerard Salton
Venue:  (1968)

This study covers recent developments in automatic text processing, including syntactic, semantic, and statistical language analysis methods. The emphasis is on applications in the areas of machine translation, information retrieval, and question answering. Recent on-line text processing methods, using man-machine interaction are covered in some detail, as are certain simple, syntactic analysis methods incorporated into a number of experimental information retrieval systems. An evaluation is made of the syntactic analysis methods, and their importance in a retrieval environmentt is discussed. 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
Linux Application Development for the Enterprise
Authors: Satya Sai Kolachina
Venue:  (2003)

:About the AuthorSatya Sai Kolachina has 16 years of experience in the software development industry working at many Fortune 500 companies, and has designed and planned complex systems for a variety of industry sectors. He resides in Hanover Park, IL and is the author of C++ Builder 6: Developer's Guide.
A geometric proof of confluence by decreasing diagrams
Authors: Jan W Klop, Vincent Oostrom, Roel Vrijer
Venue:  (2000)

The criterion for confluence using decreasing diagrams is a generalization of several well-known confluence criteria in abstract rewriting, such as the strong confluence lemma. We give a new proof of the decreasing diagram theorem based on a geometric study of infinite reduction diagrams, arising from unsuccessful attempts to obtain a confluent diagram by tiling with elementary diagrams.
Inverse optimization in high-speed networks
Authors: András Faragó, Áron Szentesi, Balázs Szviatovszki
Venue: Discrete Applied Mathematics (2003)

A general approach is presented for handling the following inverse optimization problem: given solutions to each member of a family of combinatorial optimization tasks on a common underlying set, find a positive linear objective function (weighting) on the common underlying set that simultaneously makes each solution optimal in its own optimization task. Our motivation stems from the inverse shortest path problem that is made practically important in high-speed telecommunication networks by the Asynchronous Transfer Mode Forum's Private Network-Network Interface architecture, in which route finding can be based on administrative weights. Different variants of the problem are investigated, including uniqueness requirements and reserve routes.
First Order Predicate Logic Without Negation is NP-Complete
Authors: Dexter Kozen
Venue:  (1977)

Techniques developed in the study of the complexity of finitely presented algebras are used to show that the problem of deciding validity of positive sentences in the language of first order predicate logic with equality is $\leq_{\log}$-complete for NP. 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 Study of the Effects of Minimization on the Fault Detection Capabilities of Test Suites
Authors: Gregg Rothermel, Mary Jean Harrold, Jeffery Ostrin, Christie Hong
Venue: Proceedings of the International Conference on Software Maintenance (1998)

Test suite minimization techniques attempt to reduce the cost of saving and reusing tests during software maintenance, by eliminating redundant tests from test suites. A potential drawback of these techniques is that in minimizing a test suite, they might reduce the ability of that test suite to reveal faults in the software. A recent study showed that minimization can reduce test suite size without significantly reducing the fault detection capabilities of test suites. To further investigate this issue, we performed an experiment in which we compared the costs and benefits of minimizing test suites of various sizes for several programs. In contrast to the previous study, our results reveal that the fault-detection capabilities of test suites can be severely compromised by minimization.