ppxscal/embedding_network huggingface dataset:
Lower Bound Sifting for MDDs
Authors: Dragan Jankovic, Wolfgang Günther, Rolf Drechsler
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

Decision Diagrams (DDs) are a data structure for the representation and manipulation of discrete logic functions often applied in VLSI CAD. Common DDs to represent Boolean functions are Binary Decision Diagrams (BDDs). Multiple-valued logic functions can be represented by Multiple-valued Decision Diagrams (MDDs). The efficiency of a DD representation strongly depends on the variable ordering; the size may vary from linear to exponential. Finding a good ordering is an NP-hard problem that has received considerable attention resulting in many minimization methods.Sifting is the most popular heuristic for dynamic DD minimization. In this paper we give lower bounds for sifting of MDDs. Based on them, both lower bound sifting for MDD minimization and lower bound group sifting for BDD minimization are proposed. By the computation of good lower bounds large parts of the search, space can be pruned resulting in very fast computations. This is demonstrated by experimental results.
Emulation of Software Faults by Educated Mutations at Machine-Code Level
Authors: João Durães, Henrique Madeira
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

This paper proposes a new technique to emulatesoftware faults by educated mutations introduced at themachine-code level and presents an experimental study onthe accuracy of the injected faults. The proposed methodconsists of finding key programming structures at themachine code-level where high-level software faults canemulated. The main advantage of emulating softwarefaults at the machine-code level is that software faults caninjected even when the source code of the targetapplication is not available, which is very important forthe evaluation of COTS components or for the validationsoftware fault tolerance techniques in COTS basedsystems. The technique was evaluated using several realprograms and different types of faults and, additionally, itincludes our study on the key aspects that may impact onthe technique accuracy. The portability of the technique isalso addressed. The results show that classes of faultssuch as assignment, checking, interface, and simplealgorithm faults can be directly emulated using thistechnique.
Configurable Complete Exchanges in 2D Torus-Connected Networks
Authors: Young-Joo Suh, Kang G. Shin, Syungog An
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

Complete exchange communications are found necessary in many important parallel algorithms. This paper presents algorithms for complete exchange for 2D torus-connected multiprocessors. The proposed algorithms are unique in that they are configurable while trading the time for message startups against larger message sizes. At one extreme, the algorithm minimizes the number of message startups at the expense of increased message-transmission time. At the other extreme, the message-transmission time is reduced at the expense of increased number of message startups. The algorithms are structured such that intermediate solutions are feasible, i.e., the number of message startups can be increased slightly and the message-transmission time is correspondingly reduced. The ability to configure these algorithms makes the proposed algorithms distinct from others and leads to efficient portable implementation of complete exchange algorithms.
First Order C-Cubes for the Interpretation of Petri Nets: An Application to Dynamic Scence Understanding
Authors: Charles Castel, Laurent Chaudron, Catherine Tessier
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

The symbolic level of a dynamic scene interpretation system is presented. This symbolic level is based on plan prototypes represented by Petri nets whose interpretation is expressed thanks to 1st order constrained cubes, and on a reasoning aiming at instantiating the plan prototypes with objects delivered by the numerical processing of sensor data. An example on real world data is given.
Heterogeneous Autonomy under Evolutionary Situation
Authors: Kinji Mori
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

Requirements for systems have been rapidly changed and the heterogeneous systems with the different requirement levels have been globally connected from devices level to world-wide level. In this trend of requirements and technologies, the autonomous decentralized systems (ADS) are expected to adapt themselves to the changing environments through convolution of heterogeneity and autonomy of the systems. Here, the requirements of the systems, and the technologies for the ADS on the biological analogy are discussed.
Toward Generic Timing Tests for Distributed Multimedia Software Systems
Authors: Shing chi Cheung, Samuel T. Chanson, Zhendong Xu
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

While multimedia software applications are becoming popular, few works exist on testing this important class of software, especially with respect to its temporal properties.Traditional software testing techniques mainly deal with unctional correctness and cannot be directlyapplied to testing timing properties.In this paper, we present a ramework or testing the generic temporal relations of media objects in distributed multimedia software systems (DMSS). The temporal relations are based on Allen's basic binary temporal relations between two objects and extended to cover multiple number of objects in different streams.We have developed techniques or test case generation and test result analysis based on a distributed tester architecture.A prototype system has been built to test a DEC HPAS multimediapresentation system which is a typical multimedia system supporting W3C's SMIL standard.Detailed discussion on practical issues and illustration with a number of actual tests are given.Experimental results have shown that our framework is effective in detecting timing errors.The techniques and methodology are general and can be applied to other DMSS with only minor modification.
A Framework for Consistent, Replicated Web Objects
Authors: A. M. Kermarrec, I. Kuz, M. Van Steen, A. S. Tanenbaum
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

Despite the extensive use of caching techniques, the Web is overloaded. While the caching techniques currently used help some, it would be better to use different caching and replication strategies for different Web pages, depending on their characteristics. We propose a framework in which such strategies can be devised independently per Web document.A Web document is constructed as a worldwide, scalable distributed Web object. Depending on the coherence requirements for that document, the most appropriate caching or replication strategy can subsequently be implemented and encapsulated by the Web object. Coherence requirements are formulated from two different perspectives: that of the Web object, and that of clients using the Web object. We have developed a prototype in Java to demonstrate the feasibility of implementing different strategies for different Web objects.
ebXML Simplified: A Guide to the New Standard for Global E-Commerce
Authors: Eric Chiu
Venue:  (2002)

:ebXML is the new standard for business-to-business (B2B) data exchange and the cornerstone of the next generation of B2B applications. This emerging e-commerce standard lever-ages the flexibility of XML to build an e-commerce infrastructure. Written specifically for technology, business, and sales professionals, this book offers a thorough introduction to ebXML, explaining how you can apply it to meet your business needs. Chiu explores the technical building blocks of ebXML, including EDI, XML, and Web services. He then presents an inside look at the architecture and core components of ebXML, including its design conventions and major specifications. Finally, he shows you how to apply all of this information in order to meet real-world project requirements and manage stakeholder expectations. With its complete introduction to ebXML, this book covers everything you'll need to make strategic decisions concerning implementation. 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
Task decomposition testing and metrics for concurrent programs
Authors: Chi-Ming Chung, T. K. Shih, Ying-Hong Wang, Wei-Chuan Lin, Ying-Feng Kou
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

Software testing and metrics are two important approaches to assure the reliability and quality of software. The emergence of concurrent programming in recent years introduces new testing problems and difficulties that cannot be solved by testing techniques for traditional sequential programs. One of the difficult tasks is that concurrent programs can have many instances of execution for the same set of input data. Many concurrent program testing methodologies propose to solve controlled execution and determinism. There are few discussions of concurrent software testing from the inter-task viewpoints. Yet, the common characteristics of concurrent programming are explicit identification of the large grain parallel computation units (tasks), and the explicit inter-task communication via rendezvous-style mechanisms. In this paper, we focus on testing concurrent programs through task decomposition. We propose four testing criteria to test a concurrent program. The programmer can choose an appropriate testing strategy depending on the properties of the concurrent program. Associated with the strategies, four equations are provided to measure the complexity of concurrent programs.
Data Visualization Tools for 3SAT Instances
Authors: Juan Manuel García-Ortegón, Jose Torres-Jiménez
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

We present a set of data visualization tools that could lead to a better understandingOf the conditions that make of SAT instance a hard one.The visualization techniqueIncluded in this work are used to make evident the relationship between theSAT-variables in function of their distribution, signs and combinations of signs in the Clauses.Using this information, the user may identify patterns associated with the harness ofa SAT instance which gives a move flexible measurement of the instance's harness than just the relationship between the number clauses (M) and the number of variables (N), itcould be even possible to use the developed data visualization tools to determine if a specific solution method is best suitable for a specific SAT instance.
PARK: A Paused-And-Run K-Stream Multimedia Synchronization Control Scheme
Authors: Chung-Ming Huang, Hsu-Yang Kung, Jiong-Liang Yang
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

In the paper, we propose the Pause-And-Run approach for k-stream (PARK) multimedia presentations over Internet to achieve reliable transmission of continuous media. Main characteristics of the PARK approach are as follows. (i) To achieve reliable transmission of continuous media, PARK adopts TCP instead of UDP. (ii) Since the slow-start scheme is embedded in TCP, a novel flow adaptation scheme is proposed to reduce the overhead of the network and end hosts. The server adapts its transmission rates to the buffer situation of the client and prevents the client's buffers from overflow and underflow as much as possible. (iii) With the provision of multiple-stream synchronization and the multi-level adaptation control, the client achieves smooth multimedia presentations and achieves graceful presentation degradation when the resources are insufficient.
Characterizing multicast orderings using concurrency control theory
Authors: P. A. Jensen, N. R. Soparkar, A. G. Mathur
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

Coordinating distributed executions is achieved by two widely used approaches: process groups and transactions. Typically, the two represent a trade-off in terms of the degrees of consistency and performance. By applying transaction concurrency control techniques to characterize and design process group multicast orderings, we aim to provide aspects of both ends of the trade-off. In particular, we propose a framework in which each message multicast is regarded as a transaction. Appropriate message ordering protocols are devised and shown to be correct using a variant of concurrency control theory. Also, we are able do incorporate certain aspects of application semantics for which existing process group approaches are inadequate. Finally, our framework provides a means to characterize the performance of orderings to allow a comparison of different ordering protocols.
On the Feasibility of Voice Input to an On-Line Computer Processing System
Authors: Howard A. Elder
Venue:  (1969)

An on-line digital computer processing system is considered in which an ordinary telephone is the complete terminal device, input to the computer being provided as a sequence of spoken words, and output to the user being audio responses from the machine. The feasibility of implementing such a system with a FORTRAN-LIKE algebraic compiler as the object processor is considered. Complete details of a specific word recognition program are given. This technique depends on three simplifying restrictions, namely, a ``small'''' vocabulary set, ``known'''' speakers, and a ``moment of silence'''' between each input word. Experimental results are presented giving error rates for different experimental conditions as well as the machine resources required to accomodate several users at a time. The results show that at this time it is both economically and logically feasible to handle at least 40 users at a time with an IBM 360/65 computer. 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
A Software Tool for Real-Time Low-Level Vision
Authors: D. Goldman, N. Bourbakis
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

This paper presents a software tool-methodology, called ORASIS, for near real-time and real-time user driven segmentation of color images or sequence of images (video) by using a low cost approach (a low cost camera and a PC). The segmentation approach used here is based on fuzzy-like reasoning and a color reflection. The ORASIS tool-methodology provides a human- like perception modeling in combination with fast smoothing, region growing and edge detection. Results on several images are provided to demonstrate the tool's adaptive segmentation capabilities based on the user's requests.
On Characterizing Optimal Buffer Control Policies in ATM Nodes
Authors: Sridhar Seshadri
Venue:  (1994)

This paper attempts to answer the following questions related to buffer management schemes for high speed integrated services networks: ($i$) given the pattern of cell arrivals from different classes of traffic, can buffer control significantly influence the effect of cell loss ($ii$) given a performance measure in terms of cell loss, how are some or all of the characteristics of an optimal buffer control policy described and ($iii$) would an end-to-end buffer control policy (that is, a policy that is exercised over the entire network) be significantly different from one meant for controlling a single node. The basic approach to answering these questions is to impute a cost of losing cells which may vary between classes of applications and to minimize this cost over the finite or infinite time horizons. We provide a complete characterization of optimal buffer control for a single node for minimizing linear, concave and convex cost functions of cell loss. For the end-to-end problem, we show for the simple case when there is no cross traffic in the network, the intuitive approach of controlling only the first node in the series is sufficient. For the general multi-node problem, we present insights into the nature of optimal policies. Then, using a dynamic programming formulation for a two-node network, we construct a simple heuristic that significantly outperforms a control based on static rules.
The Restructured Core wordnets in EuroWorddNet: Subset1
Authors: Piek Vossen, Laura Bloksma, Salvator Climent, Maria A Marti, Gabriel Oreggioni, Gerard Escudero, German Rigau, Horacio Rodriguez, Adriana Roventini, Francesca Bertagna, Antonietta Alonge, Carol Peters, Wim Peters
Venue:  (1998)

This deliverable describes the First Subset for Nouns and Verbs in Dutch, Italian, Spanish and English. These First Subsets represent the cores of the wordnets: including the most important meanings on which the order meanings depend. The data are described in terms of tables that specify the synsets, entries, senses and relations, and by comparison with the top ontology distribution and the Parole lexicons. Furthermore, we have carried out two comparisons of the fragments. An in-depth comparison has been carried out for 18 semantic clusters, using the Polaris tool. An overall comparison has been carried out using a graph-matching toolkit developed by FUE. Finally, this deliverable describes the work done for updating the Inter-Lingual-Index (ILI) that interconnects the different wordnets. The conclusions of the overviews and comparison are being used to guide the final building phase in Euro-WordNet. TEL:: +39 50 560481
Flow analysis: games and nets
Authors: Chris Hankin, Rajagopal Nagarajan, Prahladavaradan Sampath
Venue: The essence of computation: complexity, analysis, transformation (2002)

This paper presents a graph-based formulation of control-flow analysis using results from game semantics and proof-nets. Control-flow analysis aims to give a conservative prediction of the flow of control in a program. In our analysis, terms are represented by proof-nets and control-flow analysis amounts to the analysis of computation paths in the proof-net. We focus on a context free analysis known in the literature as 0-CFA, and develop an algorithm for the analysis. The algorithm for 0-CFA performs dynamic transitive closure of a graph that is based on the judgement associated with the proof-net. Correctness of the algorithm relies on the correspondence between proof-nets and certain kinds of strategies in game semantics.
An accurate model for analyzing wireless TCP performance with the coexistence of Non-TCP traffic
Authors: Fei Hu, Neeraj K. Sharma, Jim Ziobro
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

Our work reported in this paper attempts to develop a detailed analytical model of the TCP congestion control algorithm in wide-cum-wireless environments with regular TCP traffic that could coexist with other exogenous connections such as voice and video traffic. Thus our model is unlike previous models that did not explicitly consider the impact of non-TCP traffic on the referenced TCP connection. We think that it is extremely difficult and also unnecessary to try to use a single closed-form model to accurately describe the TCP performance. Based on an approximated fluid model, we deduce the TCP throughput performance with arbitrary connection size and the coexistence of non-TCP traffic. Most previous literature on TCP models focused on steady-state TCP congestion control behavior. However, a wealth of evidence suggests that many popular TCP connections are short, often below 30 KB. This paper examines how well our proposed model could capture the behavior of short TCP connections with wireless error losses. The simulation results show that our hybrid method approximates the throughput performance of an arbitrary-sized TCP connection with wireless losses much better than other proposed models. In addition, the throughput performance of multiple TCP connections is analyzed and simulated. Based on our analysis results, we make some suggestions for TCP performance enhancement for overcoming the serious effect from wireless losses.
Weighted fuzzy averages in fuzzy environment: part II. Generalized weighted fuzzy expected values in fuzzy environment
Authors: G. Sirbiladze, A. Sikharulidze
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2003)

The weighted fuzzy expected value (WFEV) of the population for a sampling distribution was introduced in. In the notion of WFEV is generalized for any fuzzy measure on a finite set (WFEVg). The latter paper also describes the notions of weighted fuzzy expected intervals WFEI and WFEIg which are an interval extension of WFEV and WFEVg, respectively, when due to "scarce" data the fuzzy expected value (FEV) does not exist, but the fuzzy expected interval (FEI) does. In this paper, The generalizations GWFEVg and GWFEIg of WFEVg and WFEIg, respectively, are introduced for any fuzzy measure space. Furthermore, the generalized weighted fuzzy expected value is expressed in terms of two monotone expectation (ME)4 values with respect to the Lebesgue measure on [0,1]. The convergence of iteration processes is provided by an appropriate choice of a "weight" function. In the interval extension (GWFEIg) the so-called combinatorial interval extension of a function 5 is successfully used, which is clearly illustrated by examples. Several examples of the use of the new weighted averages are discussed. In many cases these averages give better estimations than classical estimators of central tendencies such as mean, median or the fuzzy "classical" estimators FEV, FEI and ME.
On the Arithmetic-Geometric Mean Inequality and Its Relationship to Linear Programming, Matrix Scaling, and Gordan''s Theorem
Authors: Bahman Kalantari
Venue:  (1998)

It is a classical inequality that the minimum of the ratio of the (weighted) arithmetic mean to the geometric mean of a set of positive variables is equal to one, and is attained at the center of the positivity cone. While there are numerous proofs of this fundamental homogeneous inequality, in the presence of an arbitrary subspace, and/or the replacement of the arithmetic mean with an arbitrary linear form, the new minimization is a nontrivial problem. We prove a generalization of this inequality, also relating it to linear programming, to the diagonal matrix scaling problem, as well as to Gordan''s theorem. Linear programming is equivalent to the search for a nontrivial zero of a linear or positive semidefinite quadratic form over the nonnegative points of a given subspace. The goal of this paper is to present these intricate, surprising, and significant relationships, called {\it scaling dualities}, and via an elementary proof. Also, to introduce two conceptually simple polynomial-time algorithms that are based on the scaling dualities, significant bounds, as well as Nesterov and Nemirovskii''s machinery of self-concordance. The algorithms are simultaneously applicable to linear programming, to the computation of a separating hyperplane, to the diagonal matrix scaling problem, and to the minimization of the arithmetic-geometric mean ratio over the positive points of an arbitrary subspace. The scaling dualities, the bounds, and the algorithms are special cases of a much more general theory on convex programming, developed by the author. For instance, via the scaling dualities semidefinite programming is a problem dual to a generalization of the classical trace-determinant ratio minimization over the positive definite points of a given subspace of the Hilbert space of symmetric matrices.