ppxscal/embedding_network huggingface dataset:
New Quality Estimations in Random Testing
Authors: S. Mankefors, R. Torkar, A. Boklund
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

By re-formulating the issue of random testing into anequivalent problem we are able to introduce a new kindof quality estimations based on Monte Carlo integrationand the central limit theorem. This method also providesa limited but working "success theory" in the case of nodetected failures. In an empirical evaluation usinghundreds of billions of simulated tests we furthermorefind a very good match between the quality estimationspresented in this article and the true failure frequencies.Both simple modulus defects as well as seeded defects intwo extensively employed numerical routines were subjectto investigation in the empirical work.
Exploiting Routing Redundancy via Structured Peer-to-Peer Overlays
Authors: Ben Y. Zhao, Ling Huang, Jeremy Stribling, Anthony D. Joseph, John D. Kubiatowicz
Venue: Proceedings of the 11th IEEE International Conference on Network Protocols (2003)

Structured peer-to-peer overlays provide a natural infrastructure for resilient routing via efficient fault detection and precomputation of backup paths. These overlays can respond to faults in a few hundred milliseconds by rapidly shifting between alternate routes. In this paper, we present two adaptive mechanisms for structured overlays and illustrate their operation in the context of Tapestry, a fault-resilient overlay from Berkeley. We also describe a transparent, protocol-independent traffic redirection mechanism that tunnels legacy application traffic through overlays. Our measurements of a Tapestry prototype show it to be a highly responsive routing service, effective at circumventing a range of failures while incurring reasonable costin maintenance bandwidth and additional routing latency.
Beyond relative advantage: factors in end-user uptake of computer supported cooperative work
Authors: Susan Turner, Phil Turner
Venue: Advanced topics in end user computing (2003)

Researchers in Information Systems have produced a rich collection of metaanalyses and models of factors influencing the uptake of information technologies. In the domain of CSCW, however, these models have largely been neglected, and while there are many case studies, no systematic account of uptake has been produced. We use findings from Information Systems research to structure a meta-analysis of uptake issues as reported in Computer Supported Cooperative Work (CSCW) case studies, supplemented by a detailed re-examination of one of our own case studies from this perspective. This shows that while there are some factors that seem to be largely specific to CSCW introductions, many of the case study results are very similar to standard IS findings. We conclude by suggesting how the two communities of researchers might build on each other's work.
An Incremental Procedure for Improving Path Assignment in a Telecommunications Network
Authors: D. Allen, I. Ismail, J. Kennington, E. Olinick
Venue: Journal of Heuristics (2003)

A fundamental problem in the design and management of a telecommunications network is that of determining an optimal routing pattern for a given set of origin-destination demand pairs. In addition, reliability considerations may require provisioning a set of backup paths to protect the working traffic against network failures. In the literature, the problem of finding an optimal routing for a network with fixed link capacities and a list of point-to-point demands (origin-destination pairs), each with a set of candidate routing paths has been referred to as the path-assignment problem. There are three versions of this problem that correspond to the type of network protection required (no protection, dedicated protection, and shared protection). The solution to those models can be used to determine an initial design for a new network. Over time, however, changes in the demand pattern and/or upgrades to the network equipment may create a situation in which the working and/or backup paths are sub-optimal.For network managers who are reluctant to make wholesale changes to an established and reliable routing assignment, a complete modification to obtain an optimal assignment that uses fewer network resources is viewed as highly risky. This investigation presents a new procedure to take a given feasible, but sub-optimal design and improve it by making a series of incremental improvements each of which only changes a small number of path assignments. Network managers view this strategy as much less risky since only a few customers are affected by any one change. Test cases that require no protection, dedicated protection, and shared protection were examined in an empirical analysis. For all cases, near-optimal solutions were achieved irrespective of the quality of the given sub-optimal starting solutions.
Macro-op Scheduling: Relaxing Scheduling Loop Constraints
Authors: Ilhyun Kim, Mikko H. Lipasti
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

Ensuring back-to-back execution of dependent instructionsin a conventional out-of-order processor requiresscheduling logic that wakes up and selects instructions atthe same rate as they are executed. To sustain high performance,integer ALU instructions typically have single-cyclelatency, consequently requiring scheduling logic withthe same single-cycle latency. Prior proposals have advocatedthe use of speculation in either the wakeup or selectphases to enable pipelining of scheduling logic to achievehigher clock frequency. In contrast, this paper proposesmacro-op scheduling, which systematically removesinstructions with single-cycle latency from the machine bycombining them into macro-ops, and performs nonspeculativepipelined scheduling of multi-cycle operations. Macro-opscheduling also increases the effective size of the schedulingwindow by enabling multiple instructions to occupy asingle issue queue entry. We demonstrate that pipelined 2-cyclemacro-op scheduling performs comparably or evenbetter than atomic scheduling or prior proposals for select-freescheduling.
Constructing a Reproducible Testing Environment for Distributed Java Applications
Authors: J. Chen, K. Wang
Venue: Proceedings of the Third International Conference on Quality Software (2003)

Executions with internal nondeterministic choices makethe testing procedure non-repeatable. A natural solution isto artificially enforce and direct the execution to take the desiredpath so that a test can be reproduced. With geographicallydistributed processes and heterogenous platform architectures,distributed systems have raised new dimensionsof challenges to develop effective techniques for the reproducibletesting. In this paper, we discuss the architecturaland design issues on constructing an environment to automatesuch a testing for distributed Java applications. Ourfocus is on controlling the order of input and remote callevents in the application under test during the test procedure.The testing environment is by itself distributed anddoes not require code intrusion.
Selberg's integral and linear forms in zeta values
Authors: Tanguy Rivoal
Venue: Journal of Computational and Applied Mathematics (2003)

Using Selberg's integral, we present some new Euler-type integral representations of certain nearly poised hypergeometric series. These integrals are also shown to produce linear forms in odd and/or even zeta values that generalize previous work of the author.
A method for modelling and simulation of fractional systems
Authors: T. Poinot, J.-C. Trigeassou
Venue: Signal Processing (2003)

An original method for modelling and simulation of fractional systems is presented in this article. The basic idea is to model the fractional system by a state-space representation, where conventional integration is replaced by fractional one with the help of non-integer integrator. This operator is itself approximated by a N dimensional system composed of an integrator and of a phase-lead filter. This method is compared to other techniques like direct discretization of the fractional derivator and diffusive representation. Numerical simulations exhibit the general applicability and flexibility of this new approach to different types of fractional models and to non-conventional non-integer derivation with limited spectral range.
Analysis of the cross-cultural dimensions of national web portals
Authors: Sajjad Zahir, Brian Dobing, M. Gordon Hunter
Venue: Managing globally with information technology (2003)

When new technologies become available and cultures adopt them, the result can be convergence or divergence when cultures adopt technology in different ways that maintain or even further accentuate their differences. An analysis of full-service national web portals from different countries, typically offering a search engine, directories of links on a set of selected topics, news items (including weather, sports, entertainment, and stock market results), advertisements' and shopping, and free e-mail, shows evidence of both trends. While most national portals closely resemble the basic structure of Yahoo!, the original free full-service portal, there are also differences in appearance and features offered that can be attributed to cultural variations based on Hofstede's framework.
Application of Wavelets and Generalized Pencil-Of-Function Method for the Extraction of Noise Current Spectrum and Simulation of Simultaneous Switching Noise
Authors: Rohan Mandrekar, Madhavan Swaminathan, Sungjun Chun
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

In high performance systems, the voltage fluctuationnoise caused by the simultaneous switching of circuits isan important concern in relation to signal integrity andradiated emission related issues. For proper design of thePower Distribution System the noise current is requiredas an input for the simulation of the simultaneousswitching noise. This paper proposes a measurementbased approach to estimate the noise current spectrum ina functioning computer system. Its also discusses amethod for extracting the current signature needed tosimulate switching noise in the system. The proposedapproach is tested on a high speed functioning computersystem from Sun Microsystems. Using the current sourcedeveloped, simultaneous switching noise in the corepower distribution network of the system has beensimulated with good accuracy.
Projection Support Vector Machine Generators
Authors: Francisco J. González-Castaño, Ubaldo M. García-Palomares, Robert R. Meyer
Venue: Machine Learning (2004)

Large-scale Support Vector Machine (SVM) classification is a very active research line in data mining. In recent years, several efficient SVM generation algorithms based on quadratic problems have been proposed, including: Successive OverRelaxation (SOR), Active Support Vector Machines (ASVM) and Lagrangian Support Vector Machines (LSVM). These algorithms have been used to solve classification problems with millions of points. ASVM is perhaps the fastest among them. This paper compares a new projection-based SVM algorithm with ASVM on a selection of real and synthetic data sets. The new algorithm seems competitive in terms of speed and testing accuracy.
Analysis and development of blind adaptive beamforming algorithms
Authors: Thomas Edward Biedka
Venue:  (2003)

This dissertation presents a new framework for the development and analysis of blind adaptive algorithms. An adaptive algorithm is said to be &lsquo;blind&rsquo; if it does not require a known training sequence. The main focus is on application of these algorithms to adaptive antenna arrays in mobile radio communications. Adaptive antenna arrays can reduce the effects of cochannel interference, multipath fading, and background noise as compared to more conventional antenna systems. For these reasons, the use of adaptive antennas in wireless communication has received a great deal of attention in the literature. There are several reasons why the study of blind adaptive algorithms is important. First, it is common practice to switch to a blind mode once the training sequence has been processed in order to track a changing environment. Furthermore, the use of a blind algorithm can completely eliminate the need for a training sequence. This is desirable since the use of a training sequence reduces the number of bits available for transmitting information. The analysis framework introduced here is shown to include the well-known Constant Modulus Algorithm (CMA) and decision directed algorithm (DDA). New results on the behavior of the CMA and DDA are presented here, including analytic results on the convergence rate. Previous results have relied on Monte Carlo simulation. This framework is also used to propose a new class of blind adaptive algorithms that offer the potential for improved convergence rate.
An environment for computing topological entropy for skew-product transformations
Authors: Francisco Balibrea, Juan L. G. Guirao, Fernando L. Pelayo
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

The main objective of this paper is to introduce a specific software package for computing topological entropy of two-dimensional skew-product transformations. The Kneading Theory establishes the necessary background for this study is some particular cases. This is not only a hard but also a computationally expensive problem. The CAS Mathematica provides a suitable environment for implementing the algorithm associated to the rigorous computation of the topological entropy of the considered systems.
Path kernels and multiplicative updates
Authors: Eiji Takimoto, Manfred K. Warmuth
Venue: The Journal of Machine Learning Research (2003)

Kernels are typically applied to linear algorithms whose weight vector is a linear combination of the feature vectors of the examples. On-line versions of these algorithms are sometimes called "additive updates" because they add a multiple of the last feature vector to the current weight vector.In this paper we have found a way to use special convolution kernels to efficiently implement "multiplicative" updates. The kernels are defined by a directed graph. Each edge contributes an input. The inputs along a path form a product feature and all such products build the feature vector associated with the inputs.We also have a set of probabilities on the edges so that the outflow from each vertex is one. We then discuss multiplicative updates on these graphs where the prediction is essentially a kernel computation and the update contributes a factor to each edge. After adding the factors to the edges, the total outflow out of each vertex is not one any more. However some clever algorithms re-normalize the weights on the paths so that the total outflow out of each vertex is one again. Finally, we show that if the digraph is built from a regular expressions, then this can be used for speeding up the kernel and re-normalization computations.We reformulate a large number of multiplicative update algorithms using path kernels and characterize the applicability of our method. The examples include efficient algorithms for learning disjunctions and a recent algorithm that predicts as well as the best pruning of a series parallel digraphs.
Paracategories I: internal paracategories and saturated partial algebras
Authors: Claudio Hermida, Paulo Mateus
Venue: Theoretical Computer Science (2003)

Based on the monoid classifier Δ, we give an alternative axiomatization of Freyd's paracategories, which can be interpreted in any bicategory of partial maps. Assuming furthermore a free-monoid monad T in our ambient category, and coequalisers satisfying some exactness conditions, we give an abstract envelope construction, putting paramonoids (and paracategories) in the more general context of partial algebras. We introduce for the latter the crucial notion of saturation, which characterises those partial algebras which are isomorphic to the ones obtained from their enveloping algebras. We also set up a factorisation system for partial algebras, via epimorphisms and (monic) Kleene morphisms and relate the latter to saturation.
A query federation of UDDI registries
Authors: Pornpong Rompothong, Twittie Senivongse
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Cooperation between multiple service registries is a desirable feature for large-scale distributed systems where there are several instances of such registries housing advertisement entries for various businesses and services. By federating service registries, advertisement entries in one registry can be discovered by service consumers who query via other remote registries. This paper presents an extension for a query federation of UDDI registries within Web Service environment. This allows queries for businesses or services to be forwarded transparently to those extended UDDI nodes within a federation, and hence the search space is enlarged and the opportunity for the service consumers to discover more services that satisfy their requirements is increased. Query federation is governed by a federation policy with authentication and control of access to UDDI entries.
An integrated understander
Authors: Roger C. Schank, Michael Lebowitz, Lawrence Birnbaum
Venue: Computational Linguistics (1980)

A new type of natural language parser is presented. The idea behind this parser is to map input sentences into the deepest form of the representation of their meaning and inferences, as is appropriate. The parser is not distinct from an entire understanding system. It uses an integrated conception of inferences, scripts, plans, and other knowledge to aid in the parse. Furthermore, it does not attempt to parse everything it sees. Rather, it determines what is most interesting and concentrates on that, ignoring the rest.
On decomposing a hypergraph into k connected sub-hypergraphs
Authors: András Frank, Tamás Király, Matthias Kriesell
Venue: Discrete Applied Mathematics (2003)

By applying the matroid partition theorem of J. Edmonds (J. Res. Nat. Bur. Standards Sect. B 69 (1965) 67) to a hypergraphic generalization of graphic matroids, due to Lorea (Cahiers Centre Etudes Rech. Oper. 17 (1975) 289), we obtain a generalization of Tutte's disjoint trees theorem for hypergraphs. As a corollary, we prove for positive integers k and q that every (kq)-edge-connected hypergraph of rank q can be decomposed into k connected sub-hypergraphs, a well-known result for q = 2. Another by-product is a connectivity-type sufficient condition for the existence of k edge-disjoint Steiner trees in a bipartite graph.
Synchronizing asynchronous collaborative learners
Authors: Johan Lundin
Venue: Communities and Technologies (2003)

This paper addresses the issue of different levels of progress in asynchronous collaborative learning activities. The context for this research is organizations of distributed and mobile practitioners. When introducing collaborative learning parallel to daily work tasks we cannot assume that all participants have the same possibility to actively engage. Therefore the learners can be at different levels of progress in the collaborative learning activity. To facilitate collaborative activity the progress of the participants has to be synchronized in some way. The main problem addressed in this paper is the difficulty for participants to keep a common progress, to enable discussions, in asynchronous collaborative learning. To address this problem three methods for synchronization (synchronization points) are suggested: locked scenes, written instruction and collaborative production. The three methods were implemented and evaluated in an organization using a Net-scenario, the Net-scenario as a system and a methodology based on role-playing to initiate collaborative learning. This system was suitable to use in the evaluation since it can be used asynchronously as well as synchronously, supports distributed participants and is dependent on collaborative discussion concerning the content presented.
An efficient boosting algorithm for combining preferences
Authors: Yoav Freund, Raj Iyer, Robert E. Schapire, Yoram Singer
Venue: The Journal of Machine Learning Research (2003)

We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences arises in several applications, such as that of combining the results of different search engines, or the "collaborative-filtering" problem of ranking movies for a user based on the movie rankings provided by other users. In this work, we begin by presenting a formal framework for this general problem. We then describe and analyze an efficient algorithm called RankBoost for combining preferences based on the boosting approach to machine learning. We give theoretical results describing the algorithm's behavior both on the training data, and on new test data not seen during training. We also describe an efficient implementation of the algorithm for a particular restricted but common case. We next discuss two experiments we carried out to assess the performance of RankBoost. In the first experiment, we used the algorithm to combine different web search strategies, each of which is a query expansion for a given domain. The second experiment is a collaborative-filtering task for making movie recommendations.
A Two-Stage Equilibrium Model of the European Cross-Border Trade Regulation
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

We present a computable model that encompasses several proposals of the "Florence Regulatory Forum" initiated by the European Commission to deal with cross-border trade.Specifically, the model imbeds both the access to the network and congestion issues analysed by the Forum. Access charges reflect the mechanism devised by the Forum, and congestion at the interconnection is managed through the coordinated auction mechanism recently suggested by the European association of Transmission System Operators. The model allows for various domestic regulations of the less competitive part of market, and different degrees of competition in the more competitive market. We illustrate this flexibility on a stylised but extensive numerical example with the view of showing that the model behaves properly, and identifying policy issues to be studied in a more realistic case study.
Stimulating knowledge discovery and sharing
Authors: A. Agostini, S. Albolino, G. De Michelis, F. De Paoli, R. Dondi
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

Most of the available knowledge management systems pay little attention to two important aspects: the need of supporting emerging communities of interest together with the official organizational structure; and the need of cluing together knowledge associated with any kind of involved entity including people, communities, and informal knowledge. The MILK system enhances knowledge discovery and sharing by providing services addressing these aspects and supplying innovative interfaces and interaction styles. The goal of MILK is to become a familiar environment integrated in the every-day activities of dynamic modern workers. To meet the users' needs, the solution proposed by MILK roots in ethnographic analysis capturing the common practices within an organization.