ppxscal/embedding_network huggingface dataset:
A monitoring system for multithreaded applications
Authors: Bartosz Baliś, Marian Bubak, Włodzimierz Funika, Roland Wismüller
Venue: Future Generation Computer Systems (2003)

Multithreading is an efficient solution for parallel programming, however, multithreaded applications development is rather poorly supported by specialized tools. This paper presents an analysis which has led to a concept of building an autonomous monitoring system for multithreaded programs on top of which various tools can be based. Many problems specific to monitoring multithreaded programs are presented, as well as the ideas to solve them. Specifically, we focus on efficiency, scalability and portability of the monitoring system.
Optimization Methods for Radiation Therapy Plans
Authors: Weldon A. Lodwick, Steve McCourt, Francis Newman, Stephen Humphries
Venue:  (1997)

We develop and apply a variety of optimization methods to obtain, in three dimensions, optimal beam angles and intensities in radiation treatment of benign and malignant tumors. Thus, flexible and fast algorithms, graphics, and human interaction using computed tomography scans in three dimensional treatment problems are incorporated in the development of the methods and in the computational experiments that are reported. We use MATLAB as a means to demonstrate the viability of our optimization methods to aid oncology clinics in three dimensional treatment plans.
GIVE: a general interactive visualization environment
Authors: Yang Xubo, Cai Wenli, Shi Jiaoying
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

We present a data flow based software platform called GIVE (General Interactive Visualization Environment). GIVE owns a data flow kernel, a visual programming interface and an extensible module library. It greatly enhances the efficiency of building visualization programs. GIVE has the following distinctive features: it introduces control nodes and procedure nodes into traditional data flow architecture, so it can support complex ViSC application: it is a well opened environment, supported by two efficient interactive tools-GIVE/ME (Module Extender) and GIVE/DE (Data Extender)-which enables users to extend modules and data types into the system freely and conveniently; and it has a module library composed of varieties of modules. We first introduce several concepts of the data flow architecture, then describe the designation of GIVE, and finally discuss the implementation of GIVE.
A Characterization of Graphs With Interval Two-Step Graphs
Authors: J. R Lundgren, Sarah K. Merz, J. S. Maybee, Craig W. Rasmussen
Venue:  (1995)

One of the intriguing open problems on competition graphs is determining what digraphs have interval competition graphs. This problem originated in the work of Cohen [5,6] on food webs. In this paper we consider this problem for the class of loopless symmetric digraphs. The competition graph of a symmetric digraph D is the two-step graph of the underlying graph H of D, denoted S_2(H). The two-step graph is also known as the neighborhood graph, and has been studied recently by Brigham and Dutton [4] and Boland, Brigham and DUTTON [1,2]. This work was motivated by a paper of Raychaudhuri and Roberts [20] where they investigated symmetric digraphs with a loop at each vertex. Under these assumption, the competition graph is the square of the underlying graph H without loops. Here we will first consider forbidden subgraph characterizations of graphs with interval two-step graphs. Second, we will characterize a large class of graphs with interval two-step graphs using the Gilmore-Hoffman characterization of interval graphs.
MAC Level Access Protocol for Continuous Media Applications on Hybrid-Fiber-Coax (HFC) Networks
Authors: Meng-Huang Lee, Chin-Hai Chou, Shin-Hung Chang, Bor-Guang Chang
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

In this paper, admission control issue is considered in the MAC level access protocol design for supporting the continuous media applications on HFC network. We treat service admission requests and interactive requests the different priority level requests. In addition, the number of contention mini-slots of upstream channel for these two priority levels are not fixed. The head-end checks the system resources and dynamically allocates the contention mini-slots for the service admission requests. For example, if there is not enough system resource to admit a new service request, the contention mini-slots for the service admission requests will be decreased and more contention mini-slots will be allocated to the interactive requests. A set of simulation scenarios is presented to show that the proposed scheme is suitable for continuous media applications.
Observations on the Evolution of an Industrial OO Framework
Authors: Michael Mattsson, Jan Bosch
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

Recently an approach for identifying potential modules for restructuring in large software systems using product release history was presented [4]. In this study we have adapted the original approach to better suit object-oriented frameworks and applied it to an industrial black-box framework product in the telecommunication domain. Our study shows that using historical information as a way of identifying structural shortcomings in an object-oriented system is viable and useful. The study thereby strengthens the suggested approach in [4] and demonstrates that the approach is adaptable and useful for object-oriented systems. The usefulness of the original approach has been validated through this study too.
K-NN Algorithm Based on Neural Similarity
Authors: Beatrice Lazzerini, Francesco Marcelloni
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

The aim of this paper is to present a k-nearest neighbour (k-NN) classifier based on a neural model of the similarity measure between data. After a preliminary phase of supervised learningfor similarity determination, we use the neural similarity measure to guide the k-NN rule. Experiments on both synthetic and real-world data show that the similarity-based k-NN ruleoutperforms the Euclidean distance-based k-NN rule.
OS Support for Portable Bulk Synchronous Parallel Programs
Authors: Abdelsalam Heddaya, Amr Fahmy
Venue:  (1994)

Abstract For parallel programs to become portable, they must be executable with uniform efficiency on a variety of hardware platforms, which is not the case at present. In 1990, Valiant proposed Bulk-Synchronous Parallelism (BSP) as a model on which portable parallel programs can be built. We argue that shared-memory BSP is efficiently implementable on a wide variety of parallel hardware, and that BSP forms a useful basis for providing an even higher level programming interface based on Sequential Consistency (SC). A list of memory and thread management features needed to support BSP and SC parallel programs are given, under the assumption that the parallel computer is space-shared among multiple parallel task, rather than time-shared. Known techniques to realize efficiently the most important of these features are sketched.
An Adaptive Organizational Policy for Multi Agent Systems - AASMAN
Authors: Shaheen Fathima, Garimella Uma
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

Several formalisms for implementing organizational policies that assign specific roles to each of the agents in a MAS have been proposed like the contract net protocol, the social reasoning mecahnism and the distributed computational economy. However as no single organization is appropriate in all situations, organization self design has been proposed to allow an organization of problem solvers to adapt itself to a dynamically changing environment. In this paper we propose an adaptive organizational framework that exploits the negotiation mechanism of the contract net protocol, social laws of the social reasoning mechanism, market economy feature of the distributed computational economy and organization self design and integrates these features to not only meet the needs of time constrained non time critical applications where computational load on the organization cannot be predicted ahead of time but also to utilize the available system resources efficiently. We also introduce the notion of 'decommitments' and 'penalties' in this approach which was not present in the original contract net protocol.
A Reflective Model for Mobile Software Objects
Authors: Ophir Holder, Israel Ben-Shaul
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

Mobile software objects are autonomous computational entities that travel in large-scale and widely-distributed heterogeneous systems, and whose functionality can be attached to diverse computing environments. An object model that supports mobile objects should have special characteristics such as mutability of object's structure and semantics to facilitate adjustment to different environments, self-containment of objects to allow their migration as autonomous units, and extensive support for security. In this paper we discuss the requirements and design guidelines of such a model, and present MROM, a reflective model based on these guidelines. We also discuss MROM's implementation and present a component interoperability framework that was built on top of it, as an example application of the model.
Decreasing Isosurface Complexity via Discrete Fitting
Authors: Claudio Montani, R. Scateni, Roberto Scopigno
Venue:  (1995)

Since the introduction of techniques for isosurface extraction from volumetric datasets, one of the hardest problems has been to reduce the number of generated triangles (or polygons). This paper presents an algorithm that considerably reduces the number of triangles generated by a Marching Cubes algorithm, while presenting very close or shorter running times. The algorithm first assumes discretization of the dataset space and replaces cell edge interpolation by midpoint selection. Under these assumptions the extracted surfaces are composed of polygons lying within a finite number of incidences, thus allowing simple merging of the output facets into large coplanar triangular facets. Lastly, the vertices which survived the decimation process are located on their exact positions and normals are computed. An experimental evaluation of the proposed approach on datasets relevant to biomedical imaging and chemical modeling is reported. TEL:: +39 050 593451 EMAIL:: montani@iei.pi.cnr.it
A Divide-and-Conquer Approach to Shortest Paths in Planar Layered Digraphs
Authors: S. Sairam, Roberto Tamassia, Jeffery S Vitter
Venue:  (1992)

Computing shortest paths in a directed graph has received considerable attention in the sequential RAM model of computation. However, developing a polylog-time parallel algorithm that is close to the sequential optimal in terms of the total work done remains an elusive goal. We present a first step in this direction by showing that for an $n$-node planar layered digraph with nonnegative edge-weights the shortest path between any two vertices can be computed in $O(\log^3n)$ time with $n$ processors in a CREW PRAM. A CRCW version of our algorithm runs in time $O(\log^2 n \log \log )$ and uses~$n\log n/\log \log n$ processors. Our results make use of the existence of special kinds of separators in planar layered digraphs, called one-way separators, to implement a divide-and-conquer solution.
Automated TES modeling of compressed video
Authors: R. R. Jelenkovic, B. Melamed
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

TES (transform-expand-sample) is a versatile class of stationary stochastic processes which can model arbitrary marginals, a wide variety of autocorrelation functions, and a broad range of sample path behaviors. TES models include one set of parameters for exact fitting of the empirical distribution (histogram), and another for approximating the empirical autocorrelation function. The former is easy to determine algorithmically, but the latter involves a hard heuristic search on a large parametric function space. This paper describes an algorithmic procedure which largely automates TES modeling. The algorithm is cast in a nonlinear programming setting with the objective of minimizing a weighted square distance between the empirical autocorrelation function and its candidate TES-model counterpart. It combines a brute-force search with a steepest-descent nonlinear programming technique, and it performs well owing to the simplicity of the constraints and the nice local behavior of the objective function. Finally, we illustrate the efficacy of our approach via two examples from the domain of VBR (variable bit rate) compressed video.
Link Contention-Constrained Scheduling and Mapping of Tasks and Messages to a Network of Heterogeneous Processors
Authors: Yu-Kwong Kwok, Ishfaq Ahmad
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

In this paper, we consider the problem of scheduling and mapping precedence-constrained tasks to a network of heterogeneous processors. In such systems, processors are usually physically distributed, implying that the communication cost is considerably higher than in tightly coupled multiprocessors. Therefore, scheduling and mapping algorithms for such systems must schedule the tasks as well as the communication traffic by treating both the processors and communication links as important resources.We propose an algorithm that achieves these objectives and adapts its tasks scheduling and mapping decisions according to the given network topology. Just like tasks, messages are also scheduled and mapped to suitable links during the minimization of the finish times of tasks. Heterogeneity of processors is exploited by scheduling critical tasks to the fastest processors. Our extensive experimental study has demonstrated that the proposed algorithm is efficient, robust, and yields consistent performance over a wide range of scheduling parameters.
Spoken Language Translator: First-Year Report
Authors: et al,  M-S. Agnas, Bjorn Gamback
Venue:  (1994)

This document is the first-year report for a project whose long-term goal is the construction of a practically useful system capable of translating continuous spoken language within a restricted domain. The main deliverable resulting from the first year is a prototype, the Spoken Language Translator (SLT), which can translate queries from spoken English to spoken Swedish in the domain of air travel planning. The system was developed by SRI International, the Swedish Institute of Computer Science, and Telia Research AB. Most of it is constructed from previously existing pieces of software, which have been adapted for use in the speech translation task with as few changes as possible. The main components are connected together in a pipelined sequence as follows. The input signal is processed by SRI''s DECIPHER(TM), a speaker-independent continuous speech recognition system. It produces a set of speech hypotheses which is passed to the English-language processor, the SRI Core Language Engine (CLE), a general natural- language processing system. The CLE grammar associates each speech hypothesis with a set of possible logical-form-like representations, typically producing 5 to 50 logical forms per hypothesis. A preference component is then used to give each of them a numerical score reflecting its linguistic plausibility. When the preference component has made its choice, the highest-scoring logical form is passed to the transfer component, which uses a set of simple non-deterministic recursive pattern-matching rules to rewrite it into a set of possible corresponding Swedish representations. The preference component is now invoked again, to select the most plausible transferred logical form. The result is fed to a second copy of the CLE, which uses a Swedish- language grammar and lexicon developed at SICS to convert the form into a Swedish string and an associated syntax tree. Finally, the string and tree are passed to the Telia Prophon speech synthesizer, which utilizes polyphone synthesis to produce the spoken Swedish utterance. The system''s current performance figures, measured on previously unseen test data, are as follows. For sentences of length 12 words and under, 65% of all utterances are such that the top-scoring speech hypothesis is an acceptable one. If the speech hypothesis is correct, then a translation is produced in 80% of the cases; and 90% of all translations produced are acceptable. Nearly all incorrect translations are incorrect due to their containing errors in grammar or naturalness of expression, with errors due to divergence in meaning between the source and target sentences accounting for less than 1% of all translations. Making fairly conservative extrapolations from the current SLT prototype, we believe that simply continuing the basic development strategy could within three to five years produce an enhanced version, which recognized about 90% of the short sentences (12 words or less) in a specific domain, and produced accepta
Testing satisfiability
Authors: Noga Alon, Asaf Shapira
Venue: Journal of Algorithms (2003)

Let φ be a set of general boolean functions on n variables, such that each function depends on exactly k variables, and each variable can take a value from [1, d]. We say that φ is ε-far from satisfiable, if one must remove at least εnk functions in order to make the set of remaining functions satisfiable. Our main result is that if φ is ε-far from satisfiable, then most of the induced, sets of functions, on sets of variables of size c(k, d)/ε2, are not satisfiable, where c(k, d) depends only on k and d. Using the above claim, we obtain similar results for k-SAT and k-NAEQ-SAT.Assume we relax the decision problem of whether an instance of one of the above mentioned problems is satisfiable or not, to the problem of deciding whether an instance is satisfiable or ε-far from satisfiable. While the above decision problems are NP-hard, our result implies that we can solve their relaxed versions, that is, distinguishing between satisfiable and ε-far from satisfiable instances, in randomized constant time.From the above result we obtain as a special case, previous results of Alon and Krivelevich, and of Czumaj and Sohler, concerning testing of graphs and hypergraphs colorability. We also discuss the difference between testing with one-sided and two-sided error.
Polynomial Expansions over GF(3) based on Fastest Transformation
Authors: Bogdan J. Falkowski, Cheng Fu
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

A new fastest Linearly Independent (LI) transformsover GF(3) and its corresponding polynomial expansionshave been introduced. The number of required additionsand multiplications in new LI transform is advantageouswhen compared with ternary Reed-Muller transform,which was previously known as the most efficienttransform over GF(3). This paper discusses variousproperties of these fastest LI transforms and theircorresponding polynomial expansions over GF(3) as wellas their comparison with ternary Reed-Muller transformand its implementation in hardware.
Can P and NP Manufacture Randomness?
Authors: Lane A. Hemachandra
Venue:  (1986)

This paper studies how Kolmogorov complexity dictates the structure of standard deterministic and nondeterministic classes. We completely characterize, in Kolmogorov terms, when $P^{NP[\log]}= P^{NP}$, where [log] indicates that $O(\log n)$ oracle calls are made. We give a Kolmogorov characterization of P=NP that links the work of Adleman and Krentel. Briefly stated, complexity classes collapse unless they can manufacture randomness. A $\Delta^{p}_{2}$ machine is a P machine with an NP oracle. The series of replies the NP oracle makes is called the pronouncement. We show that $P^{NP[\log]}= P^{NP}$ if and only if each $\Delta^{p}_{2}$ language is accepted by some $\Delta^{p}_{2}$ machine with Kolmogorov simple pronouncements. (i.e., $(\forall P_{i}) (\exists c) (\forall x) [Pronouncements_{P_{i}}$ SAT $(x) \in K[c \log n, n^{c} | x]])$. Turning to functions, we show that: $P^{NP[\log]}F = P^{NP}F$ if and only if all $\Delta^{p}_{2}$ machines have Kolmogorov simple pronouncements. Since $P^{NP[\log]}F = P^{NP}F \Longleftrightarrow$ P=NP (Krentel), the above gives an alternate Kolmogorov characterization of the P=NP question, which complements Adleman''s classic characterization. Our key technique is an oracle-based divide and conquer over a tree of potential pronouncements. The results generalize to many other classes, including truth-table classes and counting classes. Thus, Kolmogorov complexity dictates the structure of the classes that are at the center of our understanding of feasible computation.
Probabilistic structured query methods
Authors: Kareem Darwish, Douglas W. Oard
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Structured methods for query term replacement rely on separate estimates of term tes of replacement probabilities. Statistically significantfrequency and document frequency to compute a weight for each query term. This paper reviews prior work on structured query techniques and introduces three new variants that leverage estima improvements in retrieval effectiveness are demonstrated for cross-language retrieval and for retrieval based on optical character recognition when replacement probabilities are used to estimate both term frequency and document frequency.
A Wearable Public Key Infrastructure (WPKI)
Authors: N. P. Smart, Henk L. Muller
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

We describe the design and implementation of public key infrastructure for the Bristol University Cyberjacket and three initial applications. The first one removes the need for the user to remember passwords, the second application provides an authentic record that a meeting took place; the third provides an authentic record of a conversation. The wearable public key infrastructure (WPKI) we develop uses very small communication, whilst also providing a balanced and low computational overhead on both the ¿client¿ and ¿server¿ sides.
On optimal placement of erasure nodes on a dual bus network
Authors: S. Ray, S. Mukherjee
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

Erasure node placement on the distributed and queue dual bus (DQDB) network is a well investigated problem. For general traffic conditions, achieving maximum throughput by placing a minimum number of erasure nodes optimally is known as the optimal placement of erasure nodes. To date, all the solutions proposed are either of exponential time complexity of generate suboptimal placement or work under impractical assumptions. The authors present a polynomial time algorithm that obtains optimal placement of erasure nodes for general traffic conditions. They derive a closed form expression for maximum achievable throughput and show that several bounds proposed in the literature can be obtained as special cases from the method.
Towards model checking interpreted systems
Authors: A. Lomuscio, F. Raimondi, M. J. Sergot
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We show how it is possible to pair the NuSMV model checker with Akka, a software platform used to check validity of propositional modal formulas, to verify static properties of multi-agent systems formalised on interpreted systems semantics.