ppxscal/embedding_network huggingface dataset:
Building a web thesaurus from web link structure
Authors: Zheng Chen, Shengping Liu, Liu Wenyin, Geguang Pu, Wei-Ying Ma
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Thesaurus has been widely used in many applications, including information retrieval, natural language processing, and question answering. In this paper, we propose a novel approach to automatically constructing a domain-specific thesaurus from the Web using link structure information. The proposed approach is able to identify new terms and reflect the latest relationship between terms as the Web evolves. First, a set of high quality and representative websites of a specific domain is selected. After filtering out navigational links, link analysis is applied to each website to obtain its content structure. Finally, the thesaurus is constructed by merging the content structures of the selected websites. The experimental results on automatic query expansion based on our constructed thesaurus show 20% improvement in search precision compared to the baseline.
A Decentralized Management System Based on Multi-Agent Model
Authors: Viktor V. Emelyanov
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

The aim of the paper is the development of the new approach to designing a decentralized management system which performs the exchanges of industrial resources based on the model of collective behavior of intelligent agents. The results of the construction of a multi-agent architecture for the management system are represented. The abstract intelligent agents underlay this model. Theirs interaction and activities determine a required intelligentbehavior of the whole multi-agent system. These agents realize the creation of some required types of resources and interchange by them for reaching of the global purpose of the production system. For the research of interacting agents the intelligent simulation tools were used. The work is supported by Russian Fund of Basic Research (grant 99-01-01136).
An adjoint discontinuous Galerkin method for conservation laws
Authors: Giovanni Cornetti, Gianmarco Manzini
Venue:  (1997)

A two-points numerical flux is presented in the framework of the discontinuous Galerkin method for scalar conservation laws and systems. In the scalar case, the numerical flux is proved to be Lipschitz continuous and monotone for a class of conservation laws. This allows to state the convergence to the unique entropy solution of the method with piecewise constant interpolation. The numerical flux is related to the adjoint problem: following this idea the method is extended to systems of conservation laws. No approximate Riemann solver is needed and the matrix which has to be diagonalized has a simpler structure than the Jacobian matrix. Numerical examples validate the theoretical results and show the convergence of the scheme when applied to systems of hyperbolic equations arising in fluid dynamics, such as the Shallow Water and the compressible Euler equations. EMAIL:: ian@microian.ian.pv.cnr.it KEYWORDS:: Discontinuous Galerkin method, Finite element method, Shock capturing, Monotone flux
Wrapping coarse-grained objects using standard infrastructure technology
Authors: H. A. Müller, K. Wong, M.-A. Storey
Venue: Proceedings of the International Conference on Software Maintenance (1997)

There are two basic approaches to migrating a particular subsystem: reengineering and wrapping. The author considers coarse-grained object wrapping. In wrapping, the original subsystem is essentially integrated into the new setting using infrastructure technologies. Legacy systems that have evolved over many years are notoriously difficult to decompose. Wrapping is most effective if the legacy system can be decomposed into a few large chunks where the number of communication paths among subsystems is minimized. The author discusses the use of infrastructure technology such as CORBA (Common Object Request Broker Architecture).
Software Requirements Specification Database Based on Requirements Frame Model
Authors: Atsushi Ohnishi
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

The author proposes a method to build a relational database of software requirements specifications (SRSs) from textual SRSs automatically. The author has been developing a requirements model named Requirements Frame and a text-base requirements language based on the model in order to improve the quality of SRSs. Since Requirements Frame can be transformed into relational data model, each of requirement sentences can be regarded as a tuple of a relational table. The author has been developing both a query language and a relational database management system for an SRS database. One of the features of the SRS DB system is to show an answer with a requirement sentence as an example/counter-example. This feature contributes to verify the SRS from a developer's own viewpoint. Another feature is to detect changed requirements in modification of the SRS. This feature contributes to effective maintenance of the SRS.
Automated and Portable Native Code Isolation
Authors: Grzegorz Czajkowsk, Laurent Daynès, Mario Wolczko
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

The coexistence of programs written in a safe language with user-supplied unsafe (native) code is convenient (e.g.,it enables direct access to operating system esources), but at the same time it is problematic (e.g.,it may decrease eliability and debuggability).This work aims at retaining most of the benefits of interfacing a safe language with native code while addressing its problems.It is carried out in the context of the Java¿ Native Interface (JNI).Our approach is to execute the native code in an operating system process different than that of the safe language application.A technique presented in this paper accomplishes thistransparently, automatically, and without sacrificing any of the JNI functionality.Nochanges to the Java virtual machine (JVM¿) or its runtime a e necessary.The resulting prototype does not depend on a particular implementation of the JVM, and is highly portable across hardware a chitectures and operating systems.This approach can be used to improve eliability of applications consisting of a mix of safe and native code and to facilitate debugging them.
Concepts and Notations for Concurrent Programming
Authors: Gregory R. Andrews, Fred B. Schneider
Venue:  (1982)

Much has been learned in the last decade about concurrent programming. This paper identifies the major concepts and describes some of the more important language notations for writing concurrent programs. The roles of processes, communication and syhchronization are discussed from both an operational and an axiomatic viewpoint. Language notations for expressing concurrent execution and for specifying process interaction are surveyed. Synchronization primitives based on shared variables and on message passing are described. Finally, three general classes of concurrent programming languages are identified and compared.
Polar varieties and computation of one point in each connected component of a smooth real algebraic set
Authors: Mohab Safey El Din, Éric Schost
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

Let f1, ldots, fs be polynomials in Q[X1, ..., Xn] that generate a radical ideal and let V be their complex zero-set. Suppose that V is smooth and equidimensional; then we show that computing suitable sections of the polar varieties associated to generic projections of V gives at least one point in each connected component of V ∩ Rn. We deduce an algorithm that extends that of Bank, Giusti, Heintz and Mbakop to non-compact situations. Its arithmetic complexity is polynomial in the complexity of evaluation of the input system, an intrinsic algebraic quantity and a combinatorial quantity.
Decision-Theoretic Control of Inference for Time-Critical Applications
Authors: Thomas Dean
Venue:  (1989)

Systems that operate successfully in the real world have to coordinate their behavior with the behavior of processes outside their immediate control. Since the decision making required for good performance takes time and expends computational resources, it is often useful for a system to reason about its decision-making capabilities. This paper surveys a number of approaches for designing systems capable of managing their computational resources so as to maximize the expected utility derived from decision making. In particular, we consider methods that enable a system to trade some measure of decision-making accuracy for speed in problem solving and planning. In some cases, the tradeoffs can be made at design time and compiled into a run-time system. Alternatively, general knowledge for making the tradeoffs can be built into the system enabling it to make the necessary tradeoffs at run time. We explore the issues involved in making both sorts of tradeoffs and provide directions for further research.
Graph Coloring Using Eigenvalue Decomposition
Authors: Bengt Aspvall, John R. Gilbert
Venue:  (1983)

Determining whether the vertices of a graph can be colored using $k$ different colors so that no two adjacent vertices receive the same color is a well-known NP-complete problem. Graph coloring is also of practical interest (for example, in estimating sparse Jacobians and in scheduling), and many heuristic algorithms have been developed. We present a heuristic algorithm based on the eigenvalue decomposition of the adjacency matrix of a graph. Eigenvectors point out ``bipartite-looking'''' subgraphs that are used to refine the coloring to a valid coloring. The algorithm optimally colors complete $k$-partite graphs and certain other classes of graphs with regular structure.
Selective Preemption Strategies for Parallel Job Scheduling
Authors: Rajkumar Kettimuthu, Vijay Subramani, Srividya Srinivasan, Thiagaraja Gopalasamy
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

Although theoretical results have been established regarding the utility of preemptive scheduling in reducing average job turn-around time, job suspension/restart is not much used in practice at supercomputer centers for parallel job scheduling. A number of questions remainunanswered regarding the practical utility of preemptive scheduling. We explore this issue through a simulation-based study, using job logs from a supercomputer center. We develop a tunable selective-suspension strategy, and demonstrate its effectiveness. We also present new insights into the effect of pre-emptive scheduling on different job classes and address the impact of suspensions on worst-case slowdown.
The abstraction and instantiation of string-matching programs
Authors: Torben Amtoft, Charles Consel, Olivier Danvy, Karoline Malmkjær
Venue: The essence of computation: complexity, analysis, transformation (2002)

We consider a naive, quadratic string matcher testing whether a pattern occurs in a text; we equip it with a cache mediating its access to the text; and we abstract the traversal policy of the pattern, the cache, and the text. We then specialize this abstracted program with respect to a pattern, using the off-the-shelf partial evaluator Similix.Instantiating the abstracted program with a left-to-right traversal policy yields the linear-time behavior of Knuth, Morris and Pratt's string matcher. Instantiating it with a right-to-left policy yields the linear-time behavior of Boyer and Moore's string matcher.
Failure Correlation in Software Reliability Models
Authors: Katerina Goseva-Popstojanova, Kishor Trivedi
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

Perhaps the most stringent restriction that is present in most software reliability models is the assumption of independence among successive software failures. Our research was motivated by the fact that although there are practical situations in which this assumption could be easily violated, much of the published literature on software reliability modeling does not seriously address this issue.In this paper, we present a software reliability modeling framework based on Markov renewal processes which naturally introduces dependence among successive software runs. The presented approach enables the phenomena of failure clustering to be precisely characterized and its effects on software reliability to be analyzed. Furthermore, it also provides bases for a more flexible and consistent model formulation and solution. The Markov renewal model presented in this paper can be related to the existing software reliability growth models, that is, a number of them can be derived as special cases under the assumption of failure independence.Our future research is focused on developing more specific and detailed models within this framework, as well as statistical inference procedures for performing estimations and predictions based on the experimental data.
@INGate: A Distributed Intelligent Network Approach to Bridge Switching and Packet Networks
Authors: Peter Hofmann, Markus Rebensburg, Dieter Rueffler, Plamen L. Simeonov
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

This paper presents the results of a joint project initiative, @INGate, in the area of Computer/Telephony Network Integration (CTNI) carried out by Siemens AG and the Technical University of Berlin. We propose a distributed intelligent network architecture (DINA) that elaborates a Unified Media Communications Service (UMCS) providing both messaging and telephony services along with network computing and service management throughout circuit switching and packet networks. The architecture comprises a series of interconnected and locally managed intelligent Service Nodes as InterWorking Units (IWU) between heterogenous networks allowing the user access to a Unified Media Store/Bus (UMS/B) via traditional PSTN/ISDN/GSM equipment such as telephones, pagers and fax machines on the one hand and networked computers and PDAs equipped with mail readers and Web browsers on the other hand to enable both on-line and off-line communication. The core of this architecture is the Network-Bridge Service Node (NB-SN), a distributed intelligent network element (DINE) consisting of a Channel Matrix Switch (CMS) and a Data Packet Switch (DPS) to link to fixed/mobile telephony and data networks correspondingly, several Resource Platforms (RPs) connected to Media Conversion Processors (MCPs) to perform media translation in required interchange formats, an Internet Gateway (IG) for IP telephony and data access (incl. customer service control and agent-based network computing) holding the subscribers' mailboxes and providing the Internet connectivity, and a Network-Bridge Service Node Controller (NB-SNC) to regulate the overall service logic and the above components. The NB-SN itself is managed along with other nodes in a distributed intelligent network (IN) by a TMN-compliant Operation, Administration and Maintenance Center (OAMC).
Cost-Based Abduction and Linear Constraint Satisfaction
Authors: Eugene Santos,  Jr.
Venue:  (1991)

Abduction is the problem of finding the best explanation for a given set of observations. Cost-based abduction approaches attempt to prove the observation by assuming some hypotheses. Hypotheses have associated ``costs'''' and the best proof is the one which assumes the least costly set. Previous approaches have formalized minimum cost-based abduction as a search problem. Heuristics were then sought to aid in the search for the best proof. However, efficient admissible heuristics seem to be difficult to find. In this paper, we present an approach to the problem from the standpoint of optimization. By using linear constraints to represent causal relationships, we provide a new framework capable of modeling cost-based abduction. Moreover, we are able to utilize the highly efficient optimization tools of operations research, thus yielding a computationally efficient method for solving cost-based abduction problems. 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
Multispace Search for Minimizing the Maximum Nodal Degree
Authors: Bin Du, Jun Gu, Wei Wang, Danny H. K. Tsang
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

Hajek and Sasaki showed that, for continuous traffic and packet radio network, the selection of paths that minimize the maximum nodal degree generates schedules of minimum-length. This result suggests that minimization of the maximum nodal degree provides good (although not necessarily optimal) performance in slotted networks with fixed-length packets. In this paper, we give a multispace search algorithm that interplays structural operations in conjunction with a local search algorithm for the minimization of the maximum nodal degree. Structural operations disturb the environment of forming local minima, which makes multispace search a very natural approach to the problem. Experimental results indicate that this method has improved local search in terms of the solution quality and its sensitivity to the initial random assignment.
Evaluation of ABR Congestion Control Protocols for ATM LAN and WAN
Authors: W. Melody Moh, Madhavi Hegde
Venue: Proceedings of the 1996 International Conference on Network Protocols (ICNP '96) (1996)

This paper evaluates and compares six rate-based congestion con- trol protocols for the ABR (Available Bit Rate) traffic over the ATM (Asynchronous Transfer Mode) networks. They include: (1) the EFCI-bit setting (2) the EFCI-bit setting with separate RM queues (3) the CI-bit setting in the backward direction (4) the CI-bit setting in the backward direction with separate RM queues (5) the CAPC2 ER (Explicit Rate) scheme (6) the EFCI-bit setting with utilization-based congestion indication Each scheme is simulated and compared in the LAN, WAN, and GFC (General Fairness Configuration) environments specified by the ATM Forum. Effects of varying VC (Virtual Circuits) number and changing end system-switch distance has been investigated. Their fairness is also compared using the GFC configuration. For each simulation run, we measure average queueing delay, maximum queue length, and network utilization. Traces of ACR (Allowed Cell Rate) and buffer queue length are also examined. We have found that the ER control scheme performs significantly better than the other five binary control schemes by its faster response to congestion, smoother regulation of bit rates, lower queueing delay, shorter buffer queue length, and fairness. Among the other five schemes, the CI-bit setting scheme performs better than the EFCI bit setting scheme. Providing separate RM queues has significantly improved the EFCI scheme in the WAN environment, but has little effect on the CI scheme. Link utilization-based congestion detection has suffered from either low utilization or an excess cell loss which is unacceptable in most data applications.
The Algorithm and Model of Trash: A Scheme Enforcing Equal Share
Authors: Yongxiang Zhao, Changjia Chen
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

As a stateless buffer management scheme, Trash algorithm is aimed to protect TCP friendly flows from non-responsible UDP through the fair allocation of network resources. The algorithm and it's theoretical model are discussed in this paper. In the model, all interested working parameters of the Trash can be easily derived from given system settings. Simulation shows that this model is an useful practical model in its precision and simplicity. Two related problems, trash control behavior and the relations between average queue lengths vs. loss rate of RED, are also studied and solved in this paper.
EuroWordNet Tools and Resources Report
Authors: Piek Vossen, Laura Bloksma, Paul Boersma, Felisa Verdejo, Julio Gonzalo, Horacio Rodriquez, Nicoletta Calzolari, Carol Peters, Eugenio Picchi, Simonetta Montemagni, Wim Peters
Venue:  (1998)

This deliverable gives an overview of the Tools and Resources used by each site to build their local wordnets. All sites have different resources and database and also the languages have different properties giving each one a very different starting point. Consequently, the partners apply different methodologies for building their wordnet. Attached to the general introduction are 4 documents describing the tools and resources for each site. These documents can be seen as catalogues of tools and resources that are available and/or have been used. Other builders of wordnets can use the documents to find out what tools and methods fit their situation best and how they can be obtained. TEL:: +39 50 560481
Implementation of Spectral Transformations in the Class of Fast Neural Networks
Authors: A. Yu. Dorogov
Venue: Programming and Computing Software (2003)

In the paper, the use of neural networks for the implementation of fast algorithms of spectral transformations is discussed. It is shown that the fast algorithms are particular cases of fast neural networks (FNNs). Methods for parametric tuning FNNs to a given system of basis functions are suggested. Neural network implementations of the fast Walsh and wavelet transformations and the fast Fourier, Vilenkin&ndash;Christiansen, and Haar transforms are constructed. The discussions are illustrated by examples.
Computing the multiplicative group of residue class rings
Authors: Florian Heß, Sebastian Pauli, Michael E. Pohst
Venue: Mathematics of Computation (2003)

Let k be a global field with maximal order 0k and let m0 be an ideal of 0k. We present algorithms for the computation of the multiplicative group (0k/m0)* of the residue class ring 0k/m0 and the discrete logarithm therein based on the explicit representation of the group of principal units. We show how these algorithms can be combined with other methods in order to obtain more efficient algorithms. They are applied to the computation of the ray class group Clkm modulo m = m0m∞, where m∞ denotes a formal product of real infinite places, and also to the computation of conductors of ideal class groups and of discriminants and genera of class fields.
Sun Certified Solaris 9 System and Network Administrator All-in-One Exam Guide, 1 edition
Authors: Pat Watters
Venue:  (2003)

:Get complete coverage of the material contained on all three exams required for the Solaris 9 System and Network Administrator certifications inside this single, comprehensive volume. Written by best-selling Solaris expert Paul Watters, this definitive, dual-purpose reference covers all the official objectives for these exams and details key features of the Solaris 9 operating system environment. You'll also get sample questions, test-taking tips, and real-world scenarios, making this book an ideal study tool and desk reference. 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
Communication Support for Reliable Distributed Computing
Authors: Kenneth P. Birman, Thomas A. Joseph
Venue:  (1986)

We describe a collection of communication primitives integrated with a mechanism for handling process failure and recovery. These primitives facilitate the implementation of fault-tolerant process groups, which can be used to provide distributed services in an environment subject to non-malicious crash failures.