ppxscal/embedding_network huggingface dataset:
Theoretic Framework of Network Feedback Control with Long Delays
Authors: B. G. Kim, S. S. Joo, H. H. Lee
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

It is well known that feedback control may be difficult in a network with long propagation delays (with large bandwidth-delay products). The focus of this article is to provide a theoretical framework of various feedback-based congestion control techniques. Two broad classes of control algorithms are presented: source- and switch (network)-intelligence models. In a source-intelligence model, traffic sources adjust their transmission rates according to congestion information provided by the network. Theoretical models based on queuing theory and delay differential equations are presented. In a network-intelligence model, network switches evaluate appropriate transmission rates of sources. It is believed that any reactive control in a network with long delays is not effective. A control theoretic framework is presented, which attempts to exercise a degree of prediction of traffic patterns in the near future. Algorithms predicting the future input rates and the topological distribution of sources are presented. Finally, a unified approach combining both source- and network-intelligence models may be of interest for further study.
Many Birds With One Stone: Multi-Objective Approximation Algorithms
Authors: R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, H. B. Hunt,  III
Venue:  (1992)

We study network-design problems with multiple design objectives. In particular, we look at two cost measures to be minimized simultaneously: the total cost of the network and the maximum degree of any node in the network. Our main result can be roughly stated as follows: given an integer $b$, we present approximation algorithms for a variety of network-design problems on an $n$-node graph in which the degree of the output network is $O(b \log (\frac{n}{b}))$ and the cost of this network is $O(\log n)$ times that of the minimum-cost degree-$b$-bounded network. These algorithms can handle costs on nodes as well as edges. Moreover, we can construct such networks so as to satisfy a variety of connectivity specifications including spanning trees, Steiner trees and generalized Steiner forests. The performance guarantee on the cost of the output network is nearly best-possible unless $NP = \tilde{P}$. We also address the special case in which the costs obey the triangle inequality. In this case, we obtain a polynomial-time approximation algorithm with a stronger performance guarantee. Given a bound $b$ on the degree, the algorithm finds a degree-$b$-bounded network of cost at most a constant time optimum. There is no algorithm that does as well in the absence of triangle inequality unless $P = NP$. We also show that in the case of spanning networks, we can simultaneously approximate within a constant factor yet another objective: the maximum cost of any edge in the network, also called the bottleneck cost of the network. We extend our algorithms to find TSP tours and $k$-connected spanning networks for any fixed $k$ that simultaneously approximate all these three cost measures.
Equational Axiomatization of Bicoercibility for Polymorphic Types
Authors: Jerzy Tiuryn
Venue:  (1995)

Abstract Two polymorphic types \sigma and \tau are said to be bicoercible if there is a coercion from \sigma to \tau and conversely. We give a complete equational axiomatization of bicoercible types and prove that the relation of bicoercibility is decidable.
A modified cellular automata model of nucleotide interactions and non-enzymatic transcription of DNA
Authors: J. Hilke, J. Reggia, R. Navarro-Gonzalez, J. Lohn
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

An important stage in the development of living systems on Earth was the formation of RNA-like molecules capable of self-transcripting and self-replicating. In this paper, the authors attempt to develop a simple, flexible and accurate computer model of nucleotide interactions that lead to the non-enzymatic transcription of an oligonucleotide that acts as a template to catalyze the formation of a suite of oligonucleotides. The authors' computer model is cellular automata based and allows nucleotides to experience random movement and interact locally to associate with a template and/or oligomerize with other nucleotides according to a set of rules. To test the simulation method, results were compared to specific laboratory experimental results. The hypotheses were that the best set of rules developed would be able to produce results which were: 1. More similar to the laboratory experiment's results than random rules; 2. More similar to the laboratory experiment's results than a set of rules which is chemically realistic but has random probabilities; and 3. Statistically similar to the laboratory experiment's results. The test for determining whether the results were statistically similar was done using a regression analysis. At the a=0.05 level: the first two hypothesis were supported, and the third hypothesis has not yet been statistically supported.
Service Matching and Collaboration for Electronic Commerce
Authors: Shunsuke Yura, Kazuhiro Kiwata, Atsushi Nakano, Tomotaka Uchihashi, Atsushi Kanai
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

We propose a software architecture for one-stop services of electronic commerce (EC). Users currently have trouble using multiple EC services because they are provided independently. Therefore a mediator that combines EC services and provides one-stop services to users would be useful. Service matching and service collaboration are important issues in the mediator because they are the main difficulties for users. The proposed architecture provides solutions to these issues. Multiple service assignment provides suitable combinations of EC services, flow division enables efficient execution of the combined EC services, and dynamic alternative service assignment enables flexible failure avoidance during the execution of combined services. These features make the proposed architecture a suitable mediator for EC services.
Influence of subsoil on tuning base isolation devices for civil structures
Authors: A. Baratta, I. Corbi
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The proper calibration of structural isolator devices should be carefully approached taking into account both the dynamical characteristics of the superstructure and the frequency content of the expected disturbance. To this purpose, in the paper one deepens some theoretical and practical features relevant to the problem of properly approaching the design of a base isolation device. The proposed procedure, developed on the basis of the knowledge of soil properties, is shown to be effective and flexible.
An XML-Based Lightweight C++ Fact Extractor
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

A lightweight fact extractor is presented that utilizes XML tools, such as XPath and XSLT, to extract static information from C++ source code programs. The source code is first converted into an XML representation, srcML, to facilitate the use of a wide variety of XML tools. The method is deemed lightweight because only a partial parsing of the source is done. Additionally, the technique is quite robust and can be applied to incomplete andnon-compile-able source code. The trade off to this approach is that queries on some low level details cannot be directly addressed. This approach is applied to a fact extractor benchmark as comparison with other, abet heavier weight, fact extractors. Fact extractors are widely used to support understanding tasks associated with maintenance, reverse engineeringand various other software engineering tasks.
The Design of Domino: A Knowledge-Based Information Retrieval Processor for Office Environments
Authors: C J Lusth, W B Ballard
Venue:  (1984)

In the context of designing an English-language interface for medium-sized, computer-based office files, we have built a general retrieval module called ``Domino'''' which recognizes a simple but powerful query language of our design. Having incorporated several language features often found in modern programming languages, but seldom in query languages, we believe many of the ideas behind our retrieval processing and query language will prove useful to other projects aimed at a more natural interface for office database applications. Some of the novel features of Domino are (1) facilities to access text-edited files, as opposed to more restrictive database structures, (2) certain non-standard, high-powered primitive operations, and (3) capabilities for ``macro'''' specifications by users, wherein arbitrarily complex operations can be entered once, either before or during a session, and subsequently accessed in a single step, at any meaningful place within a query, just as though they had been supplied by the initial retrieval processor. In this paper we summarize the design of our knowledge-based retrieval processor, provide a complete and formal account of our query language, compare our methods of retrieval against those of conventional systems, and mention future work we have planned for.
Explicitly B-preinvex functions
Authors: Xin Min Yang, Xiao Qi Yang, Kok Lay Teo
Venue: Journal of Computational and Applied Mathematics (2002)

This paper introduces a new class of functions, to be referred to as explicitly B-preinvex functions. Some properties of explicitly B-preinvex functions are established, e.g., any local minimum of an explicitly B-preinvex function is also a global one and the summation of two functions, which are both B-preinvex and explicitly B-preinvex, is also a B-preinvex function and an explicitly B-preinvex function. Furthermore, it is shown that the explicit B-preinvexity, together with the intermediate-point B-preinvexity, implies B-preinvexity, while the explicit B-preinvexity, together with a lower semicontinuity, implies the B-preinvexity.
Challenges in Building Scalable Network Centric Real-Time Information Dissemination Systems
Authors: Scott Arthur Moody
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

As the DoD strives for a new Network Centric Warfare (NCW[1]) capability, a multitude of technical and organizational challenges are being faced. In large part, NCW can be classified as a collective large-scale information dissemination system that operates at multitudes of levels and will be implemented using different distributed technologies and architectural styles. This paper classifies the use of these different distributed technologies as layers of informationabstractions and highlights their varied architectural uses as they are driven by latency, scalability, reconfiguration and seamless programming requirements. For example, the following technologies are contrasted: Peer to Peer and mobile networks, Web Services, Content-based Routing, and Real-Time CORBA, while addressing distributed Security and Fault Tolerance issues. Unique challenges for when and how these technologies can be used, as well as their attributes for addressing scalability are highlighted. These technologychallenges are classified and contrasted using the models based on the Siena project [2] which has been extended for the real-time community and termed Siena+RT. These requirements are described in context of the Boeing Phantom Works [8] XIS (eXtensible InfoSphere) Scalability Testbed Framework. XIS is a set of hierarchal distributed technologies developed to support the diverse real-time requirements for collection and dissemination of information throughout a global information grid.
Predicate Transformers and Higher Order Logic
Authors: R. J.R. Back
Venue:  (1992)

Predicate transformers are formalized in higher order logic. This gives a basis for mechanized reasoning about total correctness and refinement of programs. The notions of program variables and logical variables are explicated in the formalization. We show how to describe common program constructs, such as assignment statements, sequential and conditional composition, iteration, recursion, blocks and procedures with parameters, axe described as predicate transformers in this framework. We also describe some specification oriented constructs, such as assert statements, guards and nondeterministic assignments. The monotonicity of these constructs over the lattice of predicates is proved, as well as the monotonicity of the statement constructors with respect to the refinement ordering on predicate transformers.
An Accelerated Interior Point Method Whose Running Time Depends Only on $A$
Authors: Stephen A. Vavasis, Yinyu Ye
Venue:  (1993)

We propose a ``layered-step'''' interior point (LIP) algorithm for linear programming. This algorithm follows the central path, either with short steps or with a new type of step called a ``layered least squares'''' (LLS) step. The algorithm returns the exact global minimum after a finite number of steps-in particular, after $O(n^{3.5}c(A))$ iterations, where $c(A)$ is a function of the coefficient matrix. The LLS steps can be thought of as accelerating a path-following interior point method whenever near-degeneracies occur. One consequence of the new method is a new characterization of the central path: we show that it composed of at most $n^2$ alternating straight and curved segments. If the LIP algorithm is applied to integer data, we get as another corollary a new proof of a well-known theorem by Tardos that linear programming can be solved in strongly polynomial time provided that $A$ contains small-integer entries.
Application of Lempel--Ziv factorization to the approximation of grammar-based compression
Authors: Wojciech Rytter
Venue: Theoretical Computer Science (2003)

We introduce new type of context-free grammars, AVL-grammars, and show their applicability to grammar-based compression. Using this type of grammars we present O(n log |Σ|) time and O(log n)-ratio approximation of minimal grammar-based compression of a given string of length n over an alphabet Σ and O(k log n) time transformation of LZ77 encoding of size k into a grammar-based encoding of size O(k log n). A preliminary version of this paper has been presented in Rytter (Combinatorial Pattern Matching, Lecture Notes in Computer Science, vol. 2373, Springer, Berlin, June 2000, pp. 20-31), independently of Charikar et al. (STOC, 2002), where grammar-based approximation has been attacked with different construction and a more complicated type of grammars (α-balanced grammars for α ≤ 1 - ½ √2). The AVL-grammar is a very natural and simple tool for grammar based compression, it is a straightforward extension of the classical AVL-tree.
On the Role of Static Analysis during Software Maintenance
Authors: Anneliese von Mayrhauser, Steve Lang
Venue: Proceedings of the 7th International Workshop on Program Comprehension (1999)

Since Weiser's study [10], static analysis tools, specifically data flow and slicing tools are considered useful for software maintenance. To investigate this further, we conducted an observational study with professional programmers performing a debugging and an enhancement task.
A Collaborative Environment for Algorithm Animation on the WWW
Authors: Luis D Lejter
Venue:  (1997)

On this paper we extend Mocha, an algorithm animation system for the World Wide Web to incorporate a Computer Supported Collaborative Learning environment. Mocha uses a distributed model based on a client-server architecture that leverages existing network, multimedia and algorithm animation technologies. Collaborative Mocha provides an extensible framework suitable for developing collaborative pedagogical tools based on algorithm animation. By using existing technologies Mocha takes advantage of current developments in internet technologies and simplifies the development of new tools. Our CSCL for Mocha features a synchronous collaborative environment, providing a WYSIWIS (What you see is what I see) experience. We cover different aspects of the collaboration environment like awareness, embodiment, visualization, persistence and history, etc. We describe a shared geometric whiteboard prototype suitable for learning concepts in computational geometry. This prototype can be accessed from any java enabled web browser. Keywords: algorithm animation, computer supported collaborative learning (CSCL), World Wide Web (WWW), computer supported collaborative work (CSCW). 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
Symmetry and Similarity in Distributed Systems
Authors: Ralph E. Johnson, Fred B. Schneider
Venue:  (1985)

Similarity is introduced as a model-independent characterization of symmetry. It can be used to decide when a concurrent system has a solution to the selection problem. It can also be used to compare different models of parallel computation, including differences in scheduling policy and instruction set, and the consequences of using randomization.
Linksys Networks: The Official Guide, 2 edition
Authors: Kathy Ivens, Larry Seltzer
Venue:  (2003)

:The exclusive guide to the popular Linksys line of networking products! Now you can share high-speed Internet access, voice, video, and data in your home or business using Linksys connectivity solutions and this one-stop guide. This authoritative resource shows you how to build a network easily and affordably step-by-step. Learn how to select hardware, set up both wired and wireless networks, secure your network with firewalls, use anti-virus software, and much more. You'll also find helpful troubleshooting tips plus advice on getting technical support. Here's all the guidance you need to: Size up the advantages and disadvantages of Ethernet, wireless, electric, and telephone wire networks Choose the best hardware and components to fit your budget Install your network -- and even mix wired Ethernet and wireless technologies Secure both your computer and your Internet access device Get tips and tricks for increasing system performance and minimizing lag time Share a single Internet connection -- so that everyone on your network can be online simultaneously Kathy Ivens is the author or co-author of more than 40 computer books on a variety of topics including home networking. She is a senior contributing editor for Windows & .NET Magazine and is the author of QuickBooks 2002: The Official Guide, Windows 2000: The Complete Reference and many other bestselling computing resources. Larry Seltzer writes frequently for several computer and business publications, including Fortune Small Business, PC Magazine, and ZDNet, and consults on design and testing issues. He has been Technical Director in charge of product testing at PC Week and PC Magazine and has also worked in corporate and commercial software development. He is also the author of Admin 911: Windows 2000 Terminal Services.
Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast
Authors: Marcos K Aguilera, Sam Toueg, Borislav Deianov
Venue:  (1999)

Uniform Reliable Broadcast (URB) is a communication primitive that requires that if a process delivers a message, then all correct processes also deliver this message. A recent PODC paper [HR99] uses Knowledge Theory to determine what failure detectors are necessary to implement this primitive in asynchronous systems with process crashes and lossy links that are fair. In this paper, we revisit this problem using a different approach, and provide a result that is simpler, more intuitive, and, in a precise sense, more general.
Logic expressions of monotonic multiple-valued functions
Authors: K. Nakashima, Y. Nakamura, N. Takagi
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

This paper presents some fundamental properties of multiple-valued logic functions monotonic with respect to a partial-ordering relation which is introduced in the set of truth values and does not necessarily have the greatest or least element. Two kinds of necessary and sufficient conditions for monotonic p-valued functions are given with the proofs. Their logic formulas using unary operators defined in the partial-ordering relation and a simplification method for those logic formulas are also given. These results include our former results for p-valued functions monotonic with respect to the ambiguity relation which is a partial-ordering relation with the greatest element.
An Exploratory Case Study of the Maintenance Effectiveness of Traceability Models
Authors: Alessandro Bianchi, Giuseppe Visaggio, Anna Rita Fasolino
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

Analysis of the role of traceability models in software maintenance and comprehension is an important research issue. An exploratory case study evaluating the relationship between the granularity of the traceability model adopted and the effectiveness of the maintenance process is presented in this paper. Two maintenance effectiveness aspects were taken into account: efficiency and accuracy. The analysis was carried out in an object-oriented environment, with the support of an integrated platform of software tools. The preliminary results show that some aspects of the effectiveness of the maintenance process can be improved by modifying the degree of granularity of the model. These results encourage further research into this topic, while some additional side effects that emerged from the study will also be investigated.
Customizing AOSE methodologies by reusing AOSE features
Authors: Thomas Juan, Leon Sterling, Maurizio Martelli, Viviana Mascardi
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Future large-scale software development projects will require engineering support for a diverse range of software quality attributes, such as privacy and openness. It is not feasible to create one monolithic methodology to support all possible quality attributes. Instead, we expect AOSE methodologies to be created and reused in a modular way. A modular approach enables developers to build custom project-specific methodologies from AOSE features in the same way applications are built from reusable off-the-shelf components.In this paper, we provide a conceptual framework for creating and reusing modular methodologies. This conceptual framework is based on the concept of an AOSE feature, which performs one or more development activities, such as analysis, and addresses one or more quality attributes, such as privacy. An AOSE feature encapsulates software engineering techniques, models, supporting CASE tools and development knowledge such as design patterns.We illustrate the applicability of our approach by modularizing four existing methodologies, Prometheus, ROADMAP, CaseLP and the conventional OO approach, into AOSE features.
Handling Large Search Space in Pattern-Based Reverse Engineering
Authors: Jörg Niere, Jörg P. Wadsack, Lothar Wendehals
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

Large industrial legacy systems are challenges of reverse-engineering activities. Reverse-engineering approaches use text-search tools based on regular expressions or work on graph representations of programs, such as abstract syntax graphs. Analyzing large legacy systems often fail because of the large search space. Our approach to handle large searchspace in pattern-based reverse engineering is to allow imprecise results in means of false positives. We use the theory of fuzzy sets to express impreciseness and present our approachon the example of recovering associations.