ppxscal/embedding_network huggingface dataset:
Application of Bayesian trained RBF networks to nonlinear time-series modeling
Authors: Erhard Rank
Venue: Signal Processing (2003)

We examine Bayesian learning of a regularization factor and the noise level of radial basis function (RBF) networks in the framework of nonlinear time-series prediction and system modeling. A Bayesian trained RBF network is applied in an autonomous recursive prediction model (oscillator model) for regenerating time-series generated by the Lorenz system and speech signals. The oscillator model is able to capture the invariant measures of the Lorenz system for high enough SNR, and to reproduce the voiced part of speech signals.
Monitoring of distributed Java applications
Authors: Marian Bubak, Włodzimierz Funika, Roland Wismüller, Piotr Mȩtel, Rafał Orłowski
Venue: Future Generation Computer Systems (2003)

The paper presents an approach to distributed Java monitoring based on an extension to the on-line monitoring interface specification that defines relationships between a monitoring system and on-line tools used to support the development of Java applications. The extension aims at defining a standard for an open interface that supports on-line software development tools. The paper also presents the implementation ideas on building a monitoring infrastructure based on the specification. This comprises the architecture of the infrastructure, the mechanism of interaction with the Java virtual machine, and sample scenarios of interactions between the tool and the monitoring system. The infrastructure provides a uniform monitoring support for different kinds of tools, like debuggers or performance analysers.
An Active Network Approach to Efficient Network Management
Authors: Raz Danny, Shavitt Yuval
Venue:  (1999)

Active networks is a framework where network elements, primarily routers and switches, are programmable. Programs that are injected into the network are executed by the network elements to achieve higher flexibility and to present new capabilities. This work describes a novel active network architecture which primarily addresses the management challenges of modern complex networks. Its primary component is an active engine that is attached to any IP router to form an active node. The active engine we designed and implemented executes programs that arrive from the network and monitors and controls the router actions. The design is based on standards (Java, SNMP, ANEP over UDP), and can be easily deployed in todays IP networks. The contribution of this paper is the introduction of novel architectural features such as: isolation of the active mechanism, the session concept, the ability of active session to control non-active packets, and blind addressing. Implementing these ideas, we built a system that enables the safe execution and rapid deployment of new distributed management applications in the network layer. This system can be gradually integrated in todays IP networks, and allows smooth migration from IP to active networking.
Image compression and denoising via nonseparable wavelet approximation
Authors: En-Bing Lin, Yi Ling
Venue: Journal of Computational and Applied Mathematics (2003)

It was shown in (Acta Math. Sci. 22 (1) (2002) 19) that two-dimensional nonseparable scaling function interpolation has better convergence results than scalar wavelet systems in some cases based on several experimental results. In this paper, we present applications of two-dimensional nonseparable wavelet approximation. The algorithms are developed by using two-dimensional nonseparable scaling function interpolation to perform image compression and image denoising. Comparing with the separable counterparts, our results show that there are some improvements and advantages of two-dimensional nonseparable scaling function interpolation.
Toward a Portable Parallel Library for Space-Time Adaptive Methods
Authors: James M. Lebak, Robert C. Durie, Adam W. Bojancyk
Venue:  (1996)

Space-time adaptive processing (STAP) refers to a class of methods for detecting targets using an array of sensors. The output of the array is weighted using data collected from the sensors over a given period of time. An optimal method of calculating weights exists; however, this method is usually computationally impractical. Therefore, various heuristic methods are used that approximate the optimal method. These heuristics use many of the same operations and are computationally demanding. We are in the process of constructing a portable, parallel library of subroutines useful for constructing STAP heuristics. As a first step in this process, we implemented one STAP heuristic, higher-order post-Doppler processing, using three different parallel methods on the IBM SP2 and the Intel Paragon: these methods characterize different parallel approaches to the STAP problem. From implementing these algorithms, we have been able to identify components for our parallel library. We propose models for some of the components and give preliminary timing results for the parallel methids.
Computer Networks and Internets, 4 edition
Authors: Douglas E. Comer, Ralph E. Droms
Venue:  (2003)

:The Second Edition of this best-selling text continues to answer the question, "How do computer networks and internets operate?" Douglas Comer, a leading computer networking authority, provides a self-contained tour from the lowest levels of data transmission wiring through the highest levels of application software, explaining how facilities and services are used and extended in the next level. Finally, the text explains how applications use reliable stream transfer to provide high-level services. Computer Networks and Internets is appropriate for use by undergraduate students, as well as graduate students and professionals with little or no background in networking or operating systems. The text uses analogies and examples to define concepts instead of sophisticated mathematical proofs.
Scheduling to Minimize Average Stretch
Authors: Gehrke Johannes E., Muthukrishnan S., Rajaraman Rajmohan, Shaheen Anthony
Venue:  (1999)

We consider the classical problem of online preemptive job scheduling on uniprocessor and multiprocessor machines. For a given job, we measure the quality of service provided by an algorithm by the stretch of the job, which is defined as the ratio of the amount of time that the job spends in the system to the processing time of the job. For a given sequence of jobs, we measure the performance of an algorithm by the average stretch achieved by the algorithm over all the jobs in the sequence. We first prove that no on-line algorithm can achieve a competitive ratio that is smaller than 1.03. The main contribution of this paper is to show that the shortest remaining processing time algorithm (SRPT) is O(1)-competitive with respect to average stretch for both uniprocessors as well as multiprocessors. For uniprocessors, we prove that SRPT is 2-competitive. We also establish an essentially matching lower bound on the competitve ratio of SRPT on uniprocessors. For multiprocessors, we show that the competitive ratio of SRPT is at most 14.
Tool Support for Fine-Grained Software Inspection
Authors: Paul Anderson, Thomas Reps, Tim Teitelbaum, Mark Zarins
Venue: IEEE Software (2003)

Software inspection reduces the number of defects early in the software life cycle. Cost savings are realized because errors are significantly more expensive to eliminate with each successive development phase. An important part of the inspection process is a detailed inspection of the source code; this inspection usually follows a checklist. While many tools are available to manage the inspectionprocess, few tools support detailed code analysis. Recent advances in research on static program analysis can be used to address this aspect of software inspection. We describe a software tool, named CodeSurfer, that reveals fine-grained details of the semantics of the program being analyzed. CodeSurfer statically analyzes the entire program and produces a dependence-graph representation of the program. The tool's utility is illustrated with inspection examples taken from NASA's Formal Inspection Guidebook.
Probability of Miscorrection for Reed-Solomon Codes
Authors: Isaac Sofair
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

The decoder fails to correct an erroneous message to its original untainted version when the number of errors exceeds half the number of appended Reed-Solomon characters. In most cases, the Reed-Solomon algorithm can detect the presence of an excess of errors through built-in filters. However, in a few cases, the message may be corrected to a different code word in which case it is said to be miscorrected. This paper derives a general expression for the probability of miscorrection of an n -character message with a t -error correcting Reed-Solomon code that utilizes a maximum 2m -character set \math where \math given e errors. 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
Embedding Graphs in Books: A Layout Problem With Applications to VLSI Design
Authors: R F K Chung., Thomson F Leighton, L A Rosenberg
Venue:  (1985)

We study the graph-theoretic problem of embedding a graph in a book with its vertices in a line along the spine of the book and its edges on the pages in such a way that edges residing on the same page do not cross. The problem abstracts layout problems arising in the routing of multilayer printed circuit boards and in the design of fault-tolerant processor arrays. In devising an embedding, one strives to minimize both the number of pages used and the ``cutwidth'''' of the edges on each page. Our main results (1) present optimal embeddings of a variety of families of graphs; (2) exhibit situations where one can achieve small pagenumber only at the expense of large cutwidth; and (3) establish bounds on the minimum pagenumber of a graph based on various structural properties of the graph. Notable in the last category are proofs that (a) every $n$-vertex $d$-valent graph can be embedded using $0(dn ^{1/2})$ pages, and (b) for every $d<2$ and all large $n$, there are $n$-vertex $d$-valent graphs whose pagenumber is at least \[ \Omega \left ( \frac {n ^{1/2 - 1/d}}{log^2 n} \right ). \]
Generalised coinduction
Authors: F. Bartels
Venue:  (2000)

Final coalgebras of a functor F are suited for an abstract description of infinite datatypes and dynamical systems. Functions into such a domain are specified by coinductive definitions. The format these specifications take when their justification is directly based on finality is called the coiteration schema here. In applications it often turns out to be too rigid to allow for a convenient description of the functions under consideration. Thus, generalisations or variations are desired. We introduce a generic λ-coiteration schema that can be instantiated by a distributive law λ of some functor T over F and show that - under mild assumptions on the underlying category - one obtains principles which uniquely characterise arrows into the carrier of a final F-coalgebra as well. Certain instances of λ-coiteration can be shown to specify arrows that fail to be coiterative. Examples are the duals of primitive recursion and course-of-value iteration, which are known extensions of coiteration. One can furthermore obtain schemata justifying recursive specifications that involve operators such as arithmetic operations on power series, regular operators for languages, or parallel and sequential composition of processes. Next, the same type of distributive law λ is used to generalise coinductive proof techniques. To this end, we introduce the notion of a λ-bisimulation relation, many instances of which are weaker than the conventional definition of a bisimulation. It specialises e.g. to what could be called bisimulation up-to-equality or bisimulation up-to-context for contexts built from operators of the type mentioned above. We give a proof showing that every λ-bisimulation only contains pairs of bisimilar states. This principle leads to simpler proofs through the use of less complex relations.
Faster Shortest-Path Algorithms for Planar Graphs
Authors: Philip Klein, Satish Rao, Monika Rauch, Sairam Subramanian
Venue:  (1994)

We give a linear-time algorithm for single-source shortest paths in planar graphs with nonnegative edge-lengths. Our algorithm also yields a linear-time algorithm for maximum flow in a planar graph with the source and sink on the same face. The previous best algorithms for these problems required $\Omega(n \sqrt{\log n})$ time where $n$ is the number of nodes in the input graph. For the case where negative edge-lengths are allowed, we give an algorithm requiring $O(n^{4/3} \log nL)$ time, where $L$ is the absolute value of the most negative length. Previous algorithms for shortest paths with negative edge-lengths required $\Omega(n^{3/2})$ time. Our shortest-path algorithm yields an $O(n^{4/3} \log n)$-time algorithm for finding a perfect matching in a planar bipartite graph. A similar improvement is obtained for maximum flow in a directed planar graph.
Consistency Requirements of Distributed Shared Memory for Dijkstra's Mutual Exclusion Algorithm
Authors: Jerzy Brzezinski, Dariusz Wawrzyniak
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

As is well known any algorithm correct in asynchronous shared memory setting (physically shared memory) can be directly applied in distributed shared memory (DSM) systems if the latter guarantees strong consistency (atomic or sequential) of replicas. Generally, however, in DSM systems, weaker consistency models (causal, processor, PRAM, etc.) are often considered to improve the performance. Weakening consistency model may however imply the incorrectness of the algorithm. Therefore, we face a consistency requirement problem, the problem of finding the weakest consistency model of DSM that is sufficient and necessary for algorithm correctness.In the paper, we consider a reliable DSM environment and present a complex consistency model comprising three elementary models: sequential consistency, coherence and PRAM consistency. This complex model is then applied to Dijsktra's algorithm for mutual exclusion of n processes; one of the first solutions to a fundamental problem in both centralized and distributed operating systems.In the resulting algorithm, coherence and PRAM consistency are associated with some write operations performed at shared memory locations. As concurrent execution of write operations with weaker consistency models is more efficient when compared to the execution of strongly consistent operations, the proposed solution reduces synchronization delay (mutual exclusion over-head) and thereby increases system throughput.The presented model is proven sufficient for algorithm correctness. Moreover, the algorithm is shown to be optimal in the sense that further relaxation of any write operations semantics violates progress (liveness) or safety of the algorithm.
A Data Model and A Query Language for Object-Oreinted Databases
Authors: Manojit Sarkar, Steve Reiss
Venue:  (1992)

We present an object-oriented data model, and a powerful declarative query language. The data model eliminates the object-versus-values dichotomy by representing all entities as objects. This is achieved at no loss of modeling power, or performance. The data model provides for private ownership of objects by other objects. The operational part of the data model is also simple. We present a rule-based query language called OQL (Object Query Language) based on the data model. OQL creates and manipulates objects without explicitly referring to object identifiers. It is statically typed, and capable of creating new objects of arbitrary types. It can express recursive queries, eliminate duplicates, manipulate mixture of tuple-valued, set-valued and list-valued objects, and express queries involving inheritance trees. We present an object-algebra, an assignment operator, and a REPEAT-UNTIL loop construct which are used to implement OQL. Reduction of OQL to algebra, assignment operation, and loop construct, and reduction of algebra, assignment operation, and loop construct to OQL are also discussed.
Estimation of aggregate effective bandwidth for traffic admission in ATM networks
Authors: Z. Dziong, B. Shukhman, L. G. Mason
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

A framework for adaptive bandwidth management in ATM based networks is presented. The central concept of this approach is an adaptive estimation of the aggregate effective bandwidth required by connections carried on each link of the network. To achieve reliable results the estimation process takes into account both the traffic source declarations and the connection superposition process measurements on the network links. This is done in an optimization framework provided by estimation theory. In the paper the authors concentrate on evaluation of a bandwidth reserved for possible estimation error. For this purpose they use the error covariance matrix from a linear two state Kalman filter applied for the system state estimation. The bandwidth reserved for the estimation error provides that the source parameter declarations can be more relaxed and that the source policing can be less stringent.
An Exact Duality Theory for Semidefinite Programming and its Complexity Implications
Authors: Motakuri Ramana
Venue:  (1995)

In this paper, we present a new and more complete duality for Semidefinite Programming (SDP), with the following features: \begin{itemize} \item This dual is an explicit semidefinite program, whose number of variables and the coefficient bitlengths are polynomial in those of the primal. \item If the Primal is feasible, then it is bounded if and only if the dual is feasible. \item The duality gap, \ie the difference between the primal and the dual objective function values, is zero whenever the primal is feasible and bounded. Also, in this case, the dual attains its optimum \item It yields a precise Farkas Lemma for semidefinite feasibility systems, \ie characterization of the {\it infeasibility} of a semidefinite inequality in terms of the {\it feasibility} of another polynomial size semidefinite inequality. \end{itemize} Note that the standard duality for Linear Programming satisfies all of the above features, but no such duality theory was previously known for SDP, without Slater-like conditions being assumed. Then we apply the dual to derive certain complexity results for Semidefinite Programming Problems. The decision problem of Semidefinite Feasibility (SDFP), \ie that of determining if a given semidefinite inequality system is feasible, is the central problem of interest. The complexity of SDFP is unknown, but we show the following: 1) In the Turing machine model, SDFP is not NP-Complete unless NP=Co-NP; 2) In the real number model of Blum, Shub and Smale\cite{bss}, SDFP is in NP$\cap$Co-NP. We then give polynomial reductions from the following problems to SDFP: 1) Checking whether an SDP is bounded; 2) Checking whether a feasible and bounded SDP attains the optimum; 3) Checking the optimality of a feasible solution.
Formalizations Of Substitution Of Equals For Equals
Authors: David Gries, Fred B. Schneider
Venue:  (1998)

Inference rule "substitution of equals for equals" has been formalized in terms of simple substitution (which performs a replacement even though a free occurrence of a variable is captured), contextual substitution (which prevents such capture), and function application. We show that in connection with pure first-order predicate calculus, the function-application and no-capture versions of the inference rule are the same and are weaker than the capture version. We discuss the deductive apparatus needed for the no-capture version to be as powerful as the capture version.
Parametrically Described Regular Semigroup Interconnection Networks for Large-Scale Multicomputers
Authors: O. Monakhov, E. Monakhova
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

We propose a new topology for multicomputer networks: Parametrically described, Regular, and based on Semigroups (PRS) networks (or R,(N, u, g) graphs with the order N, the degree v, the girth g, and the number of equivalence classes s). Many classes of networks such as hypercubes, circulants, cube-connected cycles, etc. are shown to be special cases of the proposed network. Here, we explore the basic structure, topological properties, optimization of parameters and synthesis of optimal networks having the minimal diameter for the given parameters of the graph. Correspondingly, we examine the optimal characteristics with respect to transit delays and structural survival in such networks. The PRS networks reaching thelower bounds on the diameter were synthesized. In some cases, we found that the new network has a better diameter than classes of networks described in the literature provided they have the same vertex and edge complexity.
Direct Manipulation of Parallel Coordinates
Venue: Proceedings of the International Conference on Information Visualisation (2000)

This paper introduces two novel techniques to manipulate parallel coordinates. Both techniques are dynamic in nature as they encourage one to experiment and discover new information through interacting with a data set. The first technique, polyline averaging, makes it possible to dynamically summarize a set of polylines and can hence replace computationally much more demanding methods, such as hierarchical clustering. The other new technique interactively visualizes correlation coefficients between polyline subsets, helping the user to discover new information in the data set. Both techniques are implemented in a Java-based parallel coordinate browser. In conclusion, examples of the use of these techniques in visual data mining are also explored.
Beginning of define a body of knowledge for safety practitioners
Authors: Clive Boughton
Venue: Proceedings of the seventh Australian workshop conference on Safety critical systems and software 2002 - Volume 15 (2003)

The Australian scene with respect to safety critical systems learning is relatively empty except for a few pockets of expertise. As to certification it seems there are no providers except through overseas links. On a world wide perspective, only the UK, USA and Germany are somewhat better in that there are several learning centres but only two providers of any form of certification appropriate to functional safety practitioners or engineers. Most safety critical systems specialists and courses reside in the USA or the UK.Within industry world wide there seems to be a great deal of ignorance about evaluating, constructing, managing and maintaining, software-based safety critical systems. This is especially so in Australia. The Australian Computer Society National Technical Committee on Safety-Critical Systems (ACS-SCSC) has known of the general ignorance and lack of skills within Australia for some time and so, has recently embarked on a program to set up a new (software) safety critical systems course so that it is more accessible, affordable and appealing to a broader audience than most of the current offerings.It is proposed that a new (software) safety critical systems course be made available via the vehicle of a specialist subject within the Certified Member of the Australian Computer Society (CMACS) offerings. In part, such a course is intended to make the broader Australian IT industry more aware of the importance of software safety issues within today's IT developments.