ppxscal/embedding_network huggingface dataset:
A Client-Server Oriented Algorithm for Virtually Synchronous Group Membership in WANs
Authors: Idit Keidar, Jeremy Sussman, Keith Marzullo, Danny Dolev
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

We describe a novel scalable group membership service designed explicitly for wide area networks. Our membership service is scalable in the number of groups supported, in the number of members in each group, and in the topology, each group spans. Our service also supplies the hooks needed to provide clients with full virtual synchrony semantics. Our service attains, on average, a low message overhead by agreeing on membership within a single message round. Furthermore, our service avoids notifying the application of obsolete membership views when the network is unstable, yet it converges when the network has stabilized.
Optimizing User-Level Communication Patterns on the Fujitsu AP3000
Authors: Jeremy Dawson, Peter Strazdins
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

In this paper, we present techniques and algorithms to improve the performance of various communication patterns on message-passing platforms where, for reasons of safety, user-level communications must be buffered in (special) memory on both the send and the receive. These algorithms can not only minimize message copying but over-lap the copying to/from the special memory with the actual transfer, enabling full bandwidth to be achieved. These patterns include tree broadcast and reductions, (ring-based) multiple broadcasts and reductions, pipelined broadcast and buffered point-to-point sends. In each case, the messages may have a simple stride. All of these patterns are used in dense linear algebra applications, although they are also used in many other contexts.These algorithms are implemented and their performance evaluated on the Fujitsu AP3000, a message passing multicomputer having many characteristics of the cluster model. Some aspects, such as the performance characteristics of the special memory, are specific to the AP3000; however, the algorithms still apply to any platform using a similar mode of user level communications. Worthwhile performance increases are obtained, especially for patterns involving moderate-large number of processors.
Reasonable Conclusions in Fuzzy Reasoning
Authors: B. Lazzerini, F. Marcelloni
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

In this paper; we consider fuzzy implication operators which are extensions of the two-valued logic implication operator and are non-decreasing with respect to their second argument. Firstly, we analyze some features of these operators in regard to fuzzy reasoning with one rule. Then, as regards approximate reasoning with multiple rules, we demonstrate that, for an inference process using Sup-T-composition in the context of Compositional Rule of Inference (CRI), necessary condition to infer a reasonable conclusion is that minimum be used as aggregation operator. Finally, when minimum is used as aggregation operator we provide a sufficient condition to obtain a reasonable inference result.
Speed Up Your Site: Web Site Optimization
Authors: Andrew King, Jakob Nielsen
Venue:  (2003)

:User patience is a time bomb on the web. It starts ticking each time someone opens one of your pages. You only have a few seconds to get compelling content onto the screen. Fail, and you can kiss your customers and profits goodbye. You can't count on fast connections either. Most of your customers are still sucking content through a 56K straw. You have to serve up greased lightning or they'll bail. That's why you picked up this book. You'll learn how to cut file sizes in half. You'll trim HTML, XHTML, CSS, graphics, JavaScript, multimedia, and bandwidth costs. Real-world examples illustrate techniques with percentage savings. After reading this book, you'll know how to make your pages literally "pop" onto the screen.
MOSYS A Methodology for Automatic Object Identification from System Specification
Authors: L. B. Becker, C. E. Pereira, O. P. Dias, I. M. Teixeira, J. P. Teixeira
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

This paper presents a new approach to the automatic identification of objects/classes from a system specification. The methodology is aimed at the development of Distributed Real-Time Systems (DRTS), specially those conceived for industrial automation applications.UML is used as the modeling language in conjunction with an extended version of traditional DFD (E-DFD), that conveys information on flow type (data or control) and on process complexity and timing constraints. E-DFDs are mapped into a graph and a tool is used to carry out an automatic graph partition, which allows the identification of a set of objects that constitute, from the design and test points of view, the 'best-fitted' architecture. To validate the proposed methodology, a case study is presented and analyzed, comparing two design strategies.
DQS's experience with SRE
Authors: W. W. Everett, J. M. Gobat
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

This is an experience report on the application of software reliability engineering (SRE) in developing the Data Quality System (DQS). DQS is a knowledge-based software system developed by Lucent Technologies. It was developed to synchronize data spread among several disparate databases. The first application of DQS was to telecommunications network databases. Because the development of DQS was a large custom software development project, SRE was employed to assist in measuring product quality and readiness for production use. In this report, we first describe what we wanted to accomplish in applying SRE methods in the DQS project. The AT&T best current practice outlined the prerequisites for applying SRE during testing. We describe how we addressed these prerequisites in the DQS project. In particular, we discuss specifics on: what assumptions were made regarding an operational profile; how test cases were selected to conform to operational profile usage; and how test log forms were designed and used to collect failure data and to manage the test effort itself. Next, we share the results of reliability growth modeling during the system testing and field trials. Finally, we highlight what we learned in our initial implementation of SRE and what plans were recommended for subsequent implementations.
A lower bound on the weight hierarchies of product codes
Authors: Hans Georg Schaathun, Wolfgang Willems
Venue: Discrete Applied Mathematics (2003)

The weight of a code is the number of coordinate positions where not all codewords are zero. The rth minimum weight dr is the least weight of an r-dimensional subcode. Wei and Yang conjectured a formula for the minimum weights of some product codes, and this conjecture has recently been proved in two different ways. In this self-contained paper, we give a further generalisation, with a new proof which also covers the old results.
Algorithms for Information Conversion Based on Controlled Two-Place Operations
Authors: B. V. Izotov, A. A. Moldovyan, N. A. Moldovyan
Venue: Cybernetics and Systems Analysis (2003)

To increase efficiency of modern information-protection systems, a new approach to design of fast encryption algorithms is proposed based on controlled two-place operations. Models, design, and mathematical features of controlled two-place operations are considered. Principles of application of such operations to iterative cryptoschemes are discussed.
Metacomputing in a High Performance Computing Center
Authors: Michael M. Resch
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

The High Performance Computing Center Stuttgart (HLRS) is operating a number of supercomputers together with industry. This has led to the creation of a computing and networking environment that is unique in Europe for its variety and capability. Providing supercomputing capacity to both research and industry the HLRS has faced the need of offering not only seamless access to single computers. There is also a growing interest in coupling of applications that can best be done on coupled computing systems. Out of that need HLRS has developed, a number of tools that support distributed computing and metacomputing in various ways. In addition, the HLRS is involved in a number of projects that foster metacomputing. This paper summarizes the activities of the HLRS in the field of metacomputing. Its focus is on a concept for metacomputing in engineering applications. In order to overcome the problem of communication in distributed supercomputers a special software PACX-MPI was developed. The package is used in several projects - both in industrial and research environments. Some promising results are available so far which were achieved during Supercomputing'99 in Portland Oregon. The ever more important visualization of results is handled by COVISE - a package developed at HLRS for collaborative visualization and computing.
Proximity Drawings of Outerplanar Graphs (Preliminary Version)
Authors: William Lenhart, Giuseppe Liotta
Venue:  (1996)

A proximity drawing of a graph is one in which pairs of adjacent vertices are drawn relatively close together according to some proximity measure while pairs of non-adjacent vertices are drawn relatively far apart. The fundamental question concerning proximity drawability is: Given a graph G and a definition of proximity, is it possible to construct a proximity drawing of G? We consider this question for outerplanar graphs with respect to an infinite family of proximity drawings called beta-drawings. These drawings include as special cases the well-known Gabriel drawings (when beta = 1), and relative neighborhood drawings (when beta = 2). We first show that all biconnected outerplanar graphs are beta-drawable for all values of beta such that beta is in the interval [1,2]. As a side effect, this result settles in the affirmative a conjecture by Lubiw and Sleumer, that any biconnected outerplanar graph admits a Gabriel drawing. We then show that there exist biconnected outerplanar graphs that do not admit any convex $\beta$-drawing for beta in the interval [1,2]. We also provide upper bounds on the maximum number of biconnected components sharing the same cut-vertex in a $\beta$-drawable connected outerplanar graph. This last result is generalized to arbitrary connected planar graphs and is the first non-trivial characterization of connected $\beta$-drawable graphs. Finally, a weaker definition of proximity drawings is applied and we show that all connected outerplanar graphs are drawable under this definition.
Lightweight Validation of Natural Language Requirements: A Case Study
Authors: Vincenzo Gervasi, Bashar Nuseibeh
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

In this paper, we report on our experiences of using lightweight formal methods for the partial validation of natural language requirements documents. We describe a case study based on part of NASA's specification of the Node Control Software of the International Space Station, and apply to it our method of checking properties on models obtained by shallow parsing of natural language requirements. These experiences support our position that it is feasible and useful to perform automated analysis of requirements expressed in natural language. Indeed, we identified a number of errors in our case study that were also independently discovered and corrected by NASA's IV&V Facility in a subsequent version of the same document. The paper describes the techniques we used, the errors we found, and reflects on the lessons learned.
Slack Stealing Job Admission Control Scheduling
Authors: Alia Atlas, Azer Bestavros
Venue:  (1998)

Abstract In this paper, we present Slack Stealing Job Admission Control (SSJAC)---a methodology for scheduling periodic firm-deadline tasks with variable resource requirements, subject to controllable Quality of Service (QoS) constraints. In a system that uses Rate Monotonic Scheduling, SSJAC augments the slack stealing algorithm of Thuel et al with an admission control policy to manage the variability in the resource requirements of the periodic tasks. This enables SSJAC to take advantage of the 31% of utilization that RMS cannot use, as well as any utilization unclaimed by jobs that are not admitted into the system. Using SSJAC, each task in the system is assigned a resource utilization threshold that guarantees the minimal acceptable QoS for that task (expressed as an upper bound on the rate of missed deadlines). Job admission control is used to ensure that (1) only those jobs that will complete by their deadlines are admitted, and (2) tasks do not interfere with each other, thus a job can only monopolize the slack in the system, but not the time guaranteed to jobs of other tasks. We have evaluated SSJAC against RMS and Statistical RMS (SRMS). Ignoring overhead issues, SSJAC consistently provides better performance than RMS in overload, and, in certain conditions, better performance than SRMS. In addition, to evaluate optimality of SSJAC in an absolute sense, we have characterized the performance of SSJAC by comparing it to an inefficient, yet optimal scheduler for task sets with harmonic periods.
A Mobile Guide System for Visually Disabled Persons
Authors: Koichi Goto, Hiroshi Matsubara, Shuichi Myojo
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

This paper presents a new mobile guide system for visually disabled persons. The system utilizes the latest technologies such as data-carriers, mobile communication and portable computers. Data-carriers are embedded at many places in the station such as floors, platforms and walls. Coded data recorded in data-carriers are transferred to users via a reader installed in the cane of the user. The data are interpreted by a portable computer, which generates appropriate guide messages utilizing geographical information and user's personal data stored in it beforehand. Guide messages are finally conveyed orally to the user via a portable speaker.
A Meshalkin theorem for projective geometries
Authors: Matthias Beck, Thomas Zaslavsky
Venue: Journal of Combinatorial Theory Series A (2003)

Let M be a family of sequences (a1,..., ap) where each ak is a flat in a projective geometry of rank n (dimension n- 1) and order q, and the sum of ranks, r(a1)+ ... + r(ap), equals the rank of the join a1 ∨ ... ∨ ap. We prove upper bounds on |M| and corresponding LYM inequalities assuming that (i) all joins are the whole geometry and for each k < p the set of all ak's of sequences in M contains no chain of length l, and that (ii) the joins are arbitrary and the chain condition holds for all k. These results are q-analogs of generalizations of Meshalkin's and Erdös's generalizations of Sperner's theorem and their LYM companions, and they generalize Rota and Harper's q-analog of Erdös's generalization.
Acting Uncertainty: Discrete Bayesian Models for Mobile-Robot Navigation
Authors: A. Cassandra, L. Kaelbling, J. Kurien
Venue:  (1996)

Discrete Bayesian models have been used to model uncertainty for mobile-robot navigation, but the question of how actions should be chosen remains largely unexplored. This paper presents the optimal solution to the problem, formulated as a partially observable Markov decision process. Since solving for the optimal control policy is intractable, in general, it goes on to explore a variety of heuristic control strategies. The control strategies are compared experimentally, both in simulation and in runs on a robot.
Generating hierarchical summaries for web searches
Authors: Dawn J. Lawrie, W. Bruce Croft
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Hierarchies provide a means of organizing, summarizing and accessing information. We describe a method for automatically generating hierarchies from small collections of text, and then apply this technique to summarizing the documents retrieved by a search engine.
Coherence-Based Coordinated Checkpointing for Software Distributed Shared Memory Systems
Authors: Angkul Kongmunvattana, Santipong Tanchatchawal, Nian-Feng Tzeng
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Fault-tolerant techniques that can cope with system failures in software distributed shared memory (SDSM) are essential for creating productive and highly available parallel computing environments on clusters of workstations. In this paper, we propose a new, efficient coordinated checkpointing technique, called coherence-based coordinated checkpointing (CCC), for SDSM. Our CCC minimizes both the checkpointing overhead during failure-free execution and the cost of recovery from failures by leveraging existing coherence information maintained by SDSM. In the presence of system failures, it allows SDSM to recover from the most recent checkpoint, saving the re-computation time.We have performed experiments on a cluster of eight Sun Ultra-5 workstations, comparing our CCC technique against both simple coordinated checkpointing (SCC) and incremental coordinated checkpointing (ICC) techniques by actually implementing these techniques in TreadMarks, a state-of-the-art SDSM system. The experimental results demonstrate that our CCC technique consistently outperforms both SCC and ICC techniques. In particular, our technique increases the execution time slightly by 0.5% to 4% for a 2-minute checkpointing interval during failure-free execution, while SCC and ICC techniques result in the execution time overhead of 4% to 100% and 3% to 64%, respectively, for the same checkpointing interval.
Copy Protection for High-Definition Baseband Video
Authors: David A. Barr
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

A copy protection (CP) system is proposed for transmission of high-definition (HD) baseband video signals among consumer electronic (CE) products in the home. An encryption technique adds fluctuating pseudo-random amplitude-offsets to the components of the video signal to be protected, thereby disrupting the entertainment value of intercepted signals. The decryption technique subtracts equivalent offsets regenerated by legitimate receiving devices, thereby restoring the signal.The value of each offset remains constant for the duration of each horizontal scan line so that simple analog voltage summing/differencing circuits can be used for encryption/decryption of analog video signals. The same simple encryption/decryption algorithms can be used for digital implementations to protect digital transmissions. Arguments are presented regarding why a CP system for baseband HD video is needed to ensure forward compatible access to premium content by emerging categories of HD-capable CE products. Prototype hardware implementing the analog encryption/decryption techniques has been successfully demonstrated. 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
Dynamic Social Knowledge: A Cognitive Multi-Agent System Cooperation Strategy
Authors: Augusto C. P. L. da Costa, Guilherme Bittencourt
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

The adopted cooperation strategy is one of the most important aspects to make an agent community achieve a common goal. Basically there are two kinds of cooperation strategies for cognitive multi-agent systems: contract net protocol and negotiation. Contract net protocol requires a small amount of knowledge about the other agents in the community, but it is not possible to persuade another agent to perform a given task or to join some agents in an agent group to perform a given task during a cooperation process. On the other hand, negotiation allows an agent to communicate directly with another agent. This direct communication allows agreements when the optimal solution is not available, but the required amount of social knowledge and the communication overhead needed to update it is much greater than in the contract net protocol. In this paper, a new cooperation strategy for open cognitive autonomous multi-agent systems, called Dynamic Social Knowledge is proposed. This strategy combines the advantages of both, contract net protocol and negotiation, and makes an intensive use of rule-based reasoning.
The Intelligent Automatic Support System of Machine Building Products Principal Designer
Authors: A .. M. Dvoryankin, V. A. Kamaev, A .. V. Kizim
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

Within the framework of research program "Scientific high school studies on priority directions of science and technology (technicians)" in VSTU is conducted work on creation machine building products principal designer (PD) intelligent automatic support system (PD IASS). PDIASS is automating complex of project procedures on initial stages of designing different technical systems (TS). Obtained results described in paper.
A Probability-Based Approach of Transaction Consistency in Mobile Environments
Authors: Huaizhong Lin, Chu Chen, Bo Zhou
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

In mobile distributed databases, the communications between sites only provide weakconnectivity. To improve the efficiency of transaction processing in mobile computers, lazyreplication is used extensively. But this approach either don't guarantee serializability andconsistency as needed by applications or impose restrictions on placement of data and which data objects can be updated. The shortcomings make it difficult for lazy replication to be adaptive to the dynamic changes of network connection and configuration in mobile environments. In the paper, we propose a probability-based approach, which guarantees serializability and consistency. We adopt the quality of service specification and achieve transaction consistency dynamically through the collaboration between applicationsand systems. Probability-based approach is flexible and adaptive to mobile computingenvironments. The experimental results suggest that probability-based approach outperformordinary lazy replication.
Helena Rasiowa-a view of the academic trajectory and the influence upon Polish and international scientific community
Authors: G. Malinowski
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

The death of H. Rasiowa was a big loss for both, the Polish and the international scientific community. The life of Professor Rasiowa was passionately devoted to the development of logic, algebra and computer science and brought the fruits already reckoned among the results of the highest importance. The influence of her personality goes far beyond Poland and the group of logicians, mathematicians and computer scientists.
Generalized Forchheimer Equation for Two-Phase Flow Based on Hybrid Mixture Theory
Authors: Lynn S Bennethum, Tizian Giorgi
Venue:  (1996)

In this paper, we derive a Forchheimer-type equation for two-phase flow through an isotropic porous medium using hybrid mixture theory. Hybrid mixture theory consists of classical mixture theory applied to a multiphase system with volume averaged equations. It applies to media in which the characteristic length of each phase is "small" relative to the extent of the mixture. The derivation of a Forchheimer equation for single phase flow has been obtained elsewhere. These results are extended to include multiphase swelling materials which have non-negligible interfacial thermodynamic properties.