ppxscal/embedding_network huggingface dataset:
Building a network infrastructure for global competitiveness
Authors: Lias, J. L.Jr
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

The paper provides a strategic impact analysis of communications technology on a nations' global competitiveness. Global competitiveness and its definition is described, along with communications architectures, technologies and economics that have a direct impact on national competitiveness. It is shown that enhancing the communications needs of business workers can fundamentally shift the global competitive position of a nation. The technologies and architectures required to enable the satisfaction of these communications needs are analyzed. Technology and architectural evolution required to provide a business worker oriented service offering from PTTs and communications service providers is also presented.
Empirical development of an exponential probabilistic model for text retrieval: using textual analysis to build a better model
Authors: Jaime Teevan, David R. Karger
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Much work in information retrieval focuses on using a model of documents and queries to derive retrieval algorithms. Model based development is a useful alternative to heuristic development because in a model the assumptions are explicit and can be examined and refined independent of the particular retrieval algorithm. We explore the explicit assumptions underlying the naïve framework by performing computational analysis of actual corpora and queries to devise a generative document model that closely matches text. Our thesis is that a model so developed will be more accurate than existing models, and thus more useful in retrieval, as well as other applications. We test this by learning from a corpus the best document model. We find the learned model better predicts the existence of text data and has improved performance on certain IR tasks.
Quorum-Based Locking Protocol for Replicas in Object-Based Systems
Authors: Katsuya Tanaka, Makoto Takizawa
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

We discuss how to lock replicated objects by extending the quorum concept and perform methods on replicas in a nested invocation. Each method is issued to a quorum. If a pair of methods are compatible, their quorums may not intersect in our protocol even if one of the methods is an update type. If a method t is invoked on multiple replicas and each instance of t invokes another update method u, u is performed multiple times on replicas and then the replicas get inconsistent, i.e. redundant invocation. In addition, since each instance issues a request to its own quorum, more number of the replicas are locked than the quorum number, i.e. quorum explosion. We discuss how to resolve the redundant invocations and quorum explosion.
Towards a Distributed Platform for Resource-Constrained Devices
Authors: Alan Messer, Ira Greenberg, Philippe Bernadat, Dejan Milojicic, Deqing Chen, T. J. Giuli, Xiaohui Gu
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

Many visions of the future predict a world with pervasive computing, where computing services and resources permeate the environment. In these visions, people will want to execute a service on any available device without worrying about whether the servicehas been tailored for the device. We believe that it will be difficult to create services that can execute well on the wide variety of devices that are being developed because of problems with diversity and resource constraints.We believe that these problems can be greatly reduced by using an ad-hoc distributed platform to transparently offload portions of a service from a resource-constrained device to a nearby server. We have implemented a preliminary prototype and emulator to study this approach. Our experiments show the beneficial use of nearby resources to relieve both memory and processing constraints, when it is appropriate to do so. We believe that this approach will reduce the burden on developers by masking more device details.
Complete and Independent Sets of Axioms of Boolean Algebra
Authors: Tomoko Ninomiya, Masao Mukaidono
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

We investigate fundamental properties of axioms ofBoolean algebra in detail by using the method ofindeterminate coefficients, which uses multiple-valuedlogic. We can prove that four axioms, one of thecommutative laws, one of the complementary laws, oneof the distributive laws and one of the least element(a),greatest element(b) and the absorption laws areindependent from others in the set of fundamentalaxioms of Boolean algebra. Then we researchcandidates, including those four axioms and othersmaller number of axioms and prove all of thosecandidates are indeed complete and independent sets ofaxioms of the algebra.
Normal Forms for Fuzzy Logic Functions
Authors: Irina Perfilieva
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

Three types of normal forms are introduced for fuzzylogic functions: disjunctive, conjunctive and additive.Disjunctive and conjunctive normal forms are consideredin two variants: infinite and finite. It is shownthat infinite normal forms are universal representationformulas whereas finite normal forms are universal approximationformulas for any L-valued function whereL is a support set of any complete BL-algebra. Theadditive normal form "lies" in the middle of the twoothers. For all of them the estimation of the quality ofapproximation is suggested.
Distributed arithmetic-based architectures for high speed IIR filter design
Authors: Ching-Long Su, Yin-Tsung Hwang
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

Dedicated VLSI has been considered as an effective method to realize the DSP algorithms which require massive amount of computations. To speed up the computing, parallel processing and pipelining techniques are often employed. However, for those recursive algorithms where the available computing concurrency is very limited, these design tactics do not help. Previous results suggest a Look-ahead transform method applied to the algorithm first to create the parallelism at the cost of drastically increased hardware complexity. In this paper, we present a Distributed Arithmetic based scheme to solve the problem without resorting to the expensive look-ahead methods. In contrast to the conventional "bit-parallel word-serial" computing paradigm, the new scheme features a "bit-serial word-parallel" approach. In this scheme, instead of waiting the entire data word available from the previous recursion, current recursion's computation can start as soon as the LSB from the previous recursion is obtained. This means the initiation interval between two successive input data is reduced from the delay of computing one word to the delay of computing one bit. To illustrate the merits of this new scheme, we present a DA based VLSI design for an IIR filter. The design is implemented using a 0.8 /spl mu/m SPDM technology and can achieve high throughput rate operation for real time applications.
A Schema Analysis and Reconciliation Tool Environment for Heterogeneous Databases
Authors: Silvana Castano, Valeria de Antonellis
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

To support the development of uniform query interfaces over distributed and heterogeneous databases, tools for the analysis and reconciliation of database conceptual schemas are required. The paper presents the ARTEMIS tool environment developed to support the analyst in the process of analyzing and reconciling sets of heterogeneous data schemas. Schema analysis in ARTEMIS is performed according to the concept of affinity, while schema reconciliation is performed interactively on clusters of elements with affinity, based on unification rules. Issues on expected tool interaction and on experimentation and applicability of ARTEMIS are discussed.
Predictable Memory Utilization in the Ravenscar-Java Profile
Authors: Jagun Kwon, Andy Wellings, Steve King
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

In this paper, we present the Ravenscar-Java profile from the perspective of memory utilization. This restricted programming model removes language features with high overheads and complex semantics, on which it is hard to perform various static analyses. Several classes in the RTSJ are refined, and a few new classes are added, which all result in a compact, yet powerful and predictable computational model for the development of software-intensive high integrity real-time systems. We provide rationales behind the decisions we have made on the use of memory areas and other language features that can have an effect on the predictability of memory utilization. After that, some analysis approaches are discussed in terms of how they can be developed and beneficially used.
Invariance property: higher-order extension and application to Gaussian random variables
Authors: L. Cheded
Venue: Signal Processing (2003)

Ever since its introduction by Bussgang, the invariance property of Gaussian random variables has found numerous applications, for example, in statistical signal processing and digital communications. This property was later generalized using two different deterministic models for the zero-memory nonlinearity (ZMN): a Taylor series model with constant and structured (i.e. ZMN-based) coefficients and a general power series model with constant but totally unstructured coefficients. In this paper, we adopt a random power series model for the ZMN that generalizes all previous ones and then use it to address the higher-order extension of the invariance property of both non-Gaussian and Gaussian random variables. With this general model, the invariance is then shown to apply to both deterministic and random ZMNs. Moreover, our introduction of the helpful concept of a modified ZMN allows us to avoid using multi-dimensional techniques by casting our higher-order extension Work in the same framework as that used for the derivations of the original first-order invariance property. A further contributioh of this paper is made in the realm of Gaussian random variables where a new statistical equivalence between the ZMN and an MSE-optimal linear mapping is established, hence revealing that the Gaussianity of the two random variables used ensures an exact statistical linearization of the ZMN.
First Order Expressibility as a New Complexity Measure
Authors: Neil Immerman
Venue:  (1980)

NO SUPPLIED
An iterative method for solving semismooth equations
Authors: Xiaojiao Tong, Dong-Hui Li, Liqun Qi
Venue: Journal of Computational and Applied Mathematics (2002)

In this paper, we combine trust region technique with line search technique to develop an iterative method for solving semismooth equations. At each iteration, a trust region subproblem is solved. The solution of the trust region subproblem provides a descent direction for the norm of a smoothing function. By using a backtracking line search, a steplength is determined. The proposed method shares advantages of trust region methods and line search methods. Under appropriate conditions, the proposed method is proved to be globally and superlinearly convergent. In particular, we show that after finitely many iterations, the unit step is always accepted and the method reduces to a smoothing Newton method.
Mastering JSP, 1 edition
Authors: Todd Cook, Charles Mohnike
Venue:  (2002)

:Server-Side Development Is Easier Than You Think Not so long ago, anyone who knew HTML, even casually, was considered to have a special skill. Now, if you don't at least dabble in server-side web development, you're already behind. Fortunately, Mastering JSP is a great way to build the skills you need today. Inside, you'll learn to design and develop a wide range of JSP-based web applications, beginning with a basic, dynamically generated website. From there you'll build apps that read from and write to databases, create your own custom tags, and process and present XML. Throughout, you're helped by detailed, completely illuminated examples. Coverage includes: Making a servlet configurable Using JavaBeans inside Java Server Pages Building basic JavaBeans for storing user preferences and utility functions Recovering source code from binary class files Building a basic database application Handling exceptions and using asserts Redirecting error output to a file Scanning error logs using a servlet Using a pop-up menu to avoid troublesome actions Displaying XML files using XSLT and JSP Making a servlet-based watermarking application Providing dynamic authentication with roles, permissions, and access Building a Model-View Controller application Improving prototyping with ResultSets using a custom class Abstracting data access code using Java Objects Creating a custom tag to handle client-side JavaScript Abstracting data access SQL using meta-data, JavaBeans, and EJB Featured on the CD The enclosed CD contains a fully functional copy of MySQL Database Server, along with JBuilder 6 Enterprise Trial, Tomcat Server, MMMySQL JDBC Driver, JBoss Server, JODE, and Struts. You also get all the source code used in the book. About the Author Author, consultant, and educator Todd Cook attended California State University at Chico, UC-Irvine, and other schools, studying classical and modern languages and software development. He speaks French and German and has worked in the U.S. and abroad, serving as a consultant for Sun Microsystems, the Los Angeles World Airports, and a range of scientific companies.
Sample Complexity for Learning Recurrent Perceptron Mappings
Authors: B. DasGupta, E. Sontag
Venue:  (1995)

Recurrent perceptron classifies generalize the classical perceptron model. They take into account those correlations and dependences among input coordinates which arise from linear digital filtering. This paper provides tight bounds on sample complexity associated to the fitting of such models to experimental data. (This research was supported in part by US Air Force Grant AFOSR-94-0293)
An extension of the exemplar-based random-walk model to separable-dimension stimuli
Authors: Andrew L. Cohen, Robert M. Nosofsky
Venue: Journal of Mathematical Psychology (2003)

An extension of Nosofsky and Palmeri's (Psychol. Rev. 104 (1997a) 266) exemplar-based random-walk (EBRW) model of categorization is presented as a model of the time course of categorization of separable-dimension stimuli. Nosofsky and Palmeri (1997a) assumed that the perceptual encoding of all stimuli was identical. However, in the current model, we assume as in Lamberts (J. Exp. Psychol: General 124 (1995) 161) that the inclusion of individual stimulus dimension into the similarity calculations is a stochastic process with the probability of inclusion based or the perceptual salience of the dimensions. Thus, the exemplars that enter into the random-walk changes dynamically during the time course of processing. This model is implemented as a Markov chain. Its predictions are compared with alternative models in a speeded categorization experiment with separable-dimension stimuli.
Empirical Performance Analysis of Computer-Supported Code-Reviews
Authors: Fevzi Belli, Radu Crisan
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

Checklist-based code-reviews have been generally accepted as valuable means for software development and management. In order to overcome such shortcomings of manual reviewing techniques as high costs and lack of systematization, we have already developed and implemented a knowledge-based approach for semi-automation of some steps of individual code-reviews based on checklists.The aim of this paper is to evaluate the performance of our approach for code-reviews. Therefore, two independent groups of reviewers were analyzing the same piece of code (conventional C-programs developed in the automotive industry for gear unit control), where one of the groups deployed the semi-automated approach and the other group used the traditional manual technique. The resulting empirical data were analyzed by means of software metrics and software reliability modeling. Metrics specific to review processes, e.g. average review rate, average preparation rate, etc. were adapted for our knowledge-based methodology in order to capture the particularities of our approach. The results of these empirical investigations are compared with other methods (e.g. statistical, plan-based, scenario-based) for reviews' computer support.
Consistency and Conflict in Terminology in Software Engineering Standards
Authors: Terry Rout
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

The results of a study of consistency of terminology in a group of Standards and related documents dealing with software engineering are presented. A lack of consistent definition of some key terms is identified. Possible strategies to address the problem are suggested; such steps would lead in the longer term to a more coherent and understandable set of documents.
A reliable ordered delivery protocol for interconnected local area networks
Authors: D. A. Agarwal, L. E. Moser, P. M. Melliar-Smith, R. K. Budhia
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

We present-the Totem multiple-ring protocol, a novel reliable ordered multicast protocol for multiple interconnected local-area networks. The protocol exhibits excellent performance and maintains a consistent network-wide total order of messages despite network partitioning and remerging, or processor failure and recovery with stable storage intact. The Totem protocol is designed for fault-tolerant distributed systems, which replicate data to guard against failures and must ensure that replicated data remain consistent despite failures. The network-wide total order of messages provided by Totem simplifies the maintenance of consistency of replicated data, and, thus, eases the development of fault-tolerant distributed systems
Refinement Calculus, Lattices and Higher Order Logic
Authors: R. J.R. Back
Venue:  (1992)

We show how to describe refinement calculus in a lattice theoretic framework. The predicate transformer lattice is built by pointwise extensions from the truth value lattice. A simple but very powerful statement language characterizes the monotonic predicate transformer lattice. We show how to formalize the calculus in higher order logic. We also show how to express data refinement in this framework. A theorem of data refinement with stuttering is proved, to illustrate the algebraic nature of reasoning in this framework.
Optimal Parallel Randomized Algorithms for Computational Geometry II
Authors: H J Reif, Sandeep Sen
Venue:  (1990)

We present further applications of random sampling techniques which have been used for deriving efficient parallel algorithms by Reif and Sen [25]. In this paper we present an optimal parallel randomized algorithm for computing intersection of half-spaces in three dimensions. Because of well-known reductions, our methods also yield equally efficient algorithms for fundamental problems like the convex hull in three dimensions, Voronoi diagram of point sites on a plane and Euclidean minimal spanning tree. Our algorithms run in time $T~=~O(log~n)$ for worst-case inputs and uses $P~=~O(n)$ processors in a CREW PRAM model where $n$ is the input size. They are randomized in the sense that they use a total of only $O(log^2~n)$ random bits and terminate in the claimed time bound with probability $1~-~n^{- \alpha}$ for any fixed $\alpha~<~0$. They are also optimal in $P~ \cdot ~ T$ product since the sequential time bound for all these problems is $\Omega (n~log~n)$. The best known deterministic parallel algorithms for 2-D Voronoi-diagram and 3-D Convex hull run in $O(log^2~n)$ and $O(log^2~n~log^*~n)$ time respectively while using $O(n)$ processors.
Independent Component Analysis of Textures
Authors: Roberto Manduchi, Javier Portilla
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

A common method for texture representation is to use the marginal probability densities over the outputs of a set of multi-orientation, multi-scale filters as a description of the texture. We propose a technique, based on Independent Components Analysis, for choosing the set of filters that yield the most informative marginals, meaning that the product over the marginals most closely approximates the joint probability density function of the filter outputs. The algorithm is implemented using a steerable filter space. Experiments involving both texture classification and synthesis show that compared to Principal Components Analysis, ICA provides superior performance for modeling of natural and synthetic textures.
QNAUT: approximately analyzing networks of PH PH 1 K queues
Authors: B. R. Haverkort
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

With QNAUT we can perform the (approximate) analysis of possibly large, open networks of PHPH1 and PHPH1K queues. Since up till now there are no exact means available to study such queueing networks (QNs), the approach supported by QNAUT is currently the best alternative. Starting point of our approach is the analysis of large open QNs as proposed by W. Whitt (known as QNA) in which large QNs are decomposed into individual GIG1 queues, characterized by the first and second moments of the service and interarrival time distributions. In order to come to this decomposition, the first- and second-order traffic (flows) equations need to be solved. The first-order equations are well-known and also normally solved when addressing Jackson networks, however, the second-order equations require the investigation of the joint effect of interarrival time variability, queue utilization and service time variability. Once solved, the latter equations provide the second moments of the job streams between queues. On the basis of these results, individual nodes can then be analyzed using the Kramer and Langenbach-Belz approximation for GIG1 queues.
Visualizing Human Consciousness Content Using Java3D/X3D and Psychological Techniques
Venue: Proceedings of the International Conference on Information Visualisation (2000)

This paper describes a new approach to visualizing the contents of human consciousness that combines the Twin VR technology with relevant psychological methods. The Twin VR technology is based on the use of two dynamically connected virtual environments: the first one serves for the elicitation of required information and the second for its visualization. A prototype VRGrid system is presented as a practical implementation of this approach. The system allows eliciting and visualizing some personal conceptual models in the context of Personal Construct Psychology (PCP). Several aspects of the development of the prototype using emerging technologies such as Java 3D and X3D (Extensible 3D) are discussed.