ppxscal/embedding_network huggingface dataset:
Solution of Nonlinear Least-Square Problems on a Multiprocessor
Authors: Thomas F. Coleman, Paul Plassmann
Venue:  (1988)

In this paper we describe algorithms for solving nonlinear least-squares problems on a message-passing multiprocessor. We demonstrate new parallel algorithms, including an efficient parallel algorithm for determining the Levenberg-Marquardt parameter and a new row-oriented QR factorization algorithm. Experimental results obtained on an Intel iPSC hypercube are presented and compared with sequential MINPACK code executed on a single processor. These experimental results show that essentially full efficiency is obtained for problems where the row size is sufficiently larger than the number of processors. These algorithms have the advantage of involving only simple data movements and consequently are not constrained to the hypercube architecture.
Dynamic Multicast Trees
Authors: Jorge A. Cobb
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

We present a family of protocols to build a multicast tree in a network of processes. No processing or storage overhead is required for processes not included in the tree. The overhead of processes in the tree consists solely of the periodic exchange of a pair of messages with their parent in the tree. To choose the processes that constitute the tree, we take advantage of the existing unicast routing tables. In addition, our protocol family distinguishes itself from other protocols in three ways. First, the protocols are proven correct. Second, the integrity of the multicast tree is preserved as the tree adapts to changes in the unicast routing table. Third, the protocols are self-stabilizing, i.e., they tolerate all transient faults.
Transparent Management of Replicated WWW Document Clusters
Authors: Henning Pagnia, Oliver Theel, Hans Schupp
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

It is commonly agreed that many problems of today's Internet stem from the fact that its communication links are permanently overloaded. We propose a seamlessly integratable architecture which naturally extends the currently existing World Wide Web (WWW) infra-structure by allowing users to transparently access nearby copies of replicated WWW documents. The underlying basic idea is to aggregate closely related WWW documents into document clusters. These clusters serve as the unit for replication, meaning that all documents of a cluster are identically managed and retrieved. The benefits of this approach are reduced response times for document retrieval as well as network-wide lowered bandwidth requirements for servicing such retrieval requests. The paper describes the overall architecture of our approach and the functioning of the individual components. Additionally, details of our prototype implementation are presented together with a preliminary performance assessment based on experimental measurements.
Synthesis Experiments and Performance Metrics for Evaluating the Quality of IP Blocks and Megacells
Authors: T. Bautista, A. Núñez
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

A complete quantitative evaluation of the quality of more than one hundred implementations of SPARC processor core and its related circuitry, synthesized from VHDL descriptions, is presented in this paper as a demonstration example for selecting benchmark circuits, synthesis experiments with different tools and technologies, and performance metrics, for evaluating the quality of IP blocks and megacells. The methodology of the experiments conducted for these circuits can be applied to a wide range of other benchmark candidate circuits. The synthesis experiments are designed to fully explore the synthesis space and to analyze the impact of every synthesis step on the final design quality obtained.
Fuzzy kernel-stable coalitions between rational agents
Authors: Bastian Blankenburg, Matthias Klusch, Onn Shehory
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

A large variety of solutions exists for the problem of coalition formation among autonomous agents, at the theoretical level within game theory, and at the practical, algorithmic level, within multi-agent systems. However, one major underlying assumption of algorithmic solutions suggested to date is that the values of the coalitions are known and are certain at the time of coalition formation negotiation. In many practical cases such as in open, dynamically changing environments this assumption does not hold. In this paper we propose an algorithmic solution to the coalition formation problem that overcomes this limitation of previous solutions. Our solution supports fuzzy coalition values and allows agents to form stable coalition configurations. For this, we combine concepts from the theory of fuzzy sets with the game-theoretic stability concept of the Kernel to deduce the new concept of a fuzzy Kernel. We further provide a low-complexity algorithm for forming fuzzy Kernel stable coalitions among agents.
Multiple positive solutions of a discrete difference system
Authors: Jian-Ping Sun, Wan-Tong Li
Venue: Applied Mathematics and Computation (2003)

This paper is concerned with the following system Δ2u1(k) + f1(k, u1(k), u2(k)) = 0, k ∈ [0,T], Δ2u2(k) + f2(k, u1(k), u2(k)) = 0, k ∈ [0,T], u1(0) = u1(T + 2) = 0 = u2(0) = u2(T + 2). By using Leggett-Williams fixed point theorem, sufficient conditions are obtained for the existence of three positive solutions to the above system.
How to prevent type flaw attacks on security protocols
Authors: James Heather, Gavin Lowe, Steve Schneider
Venue: Journal of Computer Security (2003)

A type flaw attack on a security protocol is an attack where a field that was originally intended to have one type is subsequently interpreted as having another type. A number of type flaw attacks have appeared in the academic literature. In this paper we prove that type flaw attacks can be prevented using a simple technique of tagging each field with some information indicating its intended type.
Multiagent diffusion and distributed optimization
Authors: Kwok Ching Tsui, Jiming Liu
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Distributed problem solving by a multiagent system represents a promising approach to solving complex computational problems. However, many multiagent systems require certain degree of planning, coordination and negotiation to achieve the given goal. This paper presents a multiagent framework for tackling global optimization tasks inspired by diffusion in nature. The framework is designed for situations where agent communication must be kept to a minimal. Hence, complicated coordination and negotiation is not possible. Distributed agents in this framework share the common goal of finding the global optimal solution. They cooperate to achieve this common goal by sharing and updating a common belief that captures their estimation of the whereabouts of the optimal solution. To facilitate this, agents are naturally organized in families with a parent and its offsprings as members. This paper also presents an algorithm called Evolutionary Diffusion Optimization, which is implemented base on the proposed agent framework. Experimental results on some benchmark problems are presented together with performance comparison with a simulated annealing algorithm.
On a one-dimensional optimization problem derived from the efficiency analysis of Newton-PCG-like algorithms
Authors: Ping Zhong, Naiyang Deng
Venue: Journal of Computational and Applied Mathematics (2002)

The Newton-PCG (preconditioned conjugate gradient) like algorithms are usually very efficient. However, their efficiency is mainly supported by the numerical experiments. Recently, a new kind of Newton-PCG-like algorithms is derived in (J. Optim. Theory Appl. 105 (2000) 97; Superiority analysis on truncated Newton method with preconditioned conjugate gradient technique for optimization, in preparation) by the efficiency analysis. It is proved from the theoretical point of view that their efficiency is superior to that of Newton's method for the special cases where Newton's method converges with precise Q-order 2 and α(≥ 2), respectively. In the process of extending such kind of algorithms to the more general case where Newton's method has no fixed convergence order, the first is to get the solutions to the one-dimensional optimization problems with many different parameter values of α. If these problems were solved by numerical method one by one, the computation cost would reduce the efficiency of the Newton-PCG algorithm, and therefore is unacceptable. In this paper, we overcome the difficulty by deriving an analytic expression of the solution to the one-dimensional optimization problem with respect to the parameter α.
HyTech : The Cornell HYbrid TECHnology Tool
Authors: Thomas A. Henzinger, Pei Ho
Venue:  (1995)

This paper is addressed to potential users of HyTech, the Cornell Hybrid Technology Tool, an automatic tool for analyzing hybrid systems. We review the formal technologies that have been incorporated into HyTech, and we illustrate the use of HyTech with three nontrivial case studies.
Negotiation in information systems action research
Authors: N. F. , . Jr. Kock, R. J. McQueen, M. Baker, A. Rouse
Venue: Proceedings of the 1996 Information Systems Conference of New Zealand (ISCNZ '96) (1996)

The paper discusses the gradual negotiation process involved in the resolution of the initiative dilemma of IS action research. This dilemma occurs when the researcher faces the decision to either take the initiative to define an opportunity for generating knowledge, and then try to find possible client organisations, or to leave this initiative to client organisations and tackle problems proposed by them. The first option may lead to the definition of a research project that does not meet the interests of client organisations, while the second may lead to a research topic beyond the researcher's area of interest or area of expertise. The dilemma is resolved through a process of negotiation. The paper proposes two models to explain this negotiation process and to resolve this dilemma: a model of the overall negotiation process, and a model of the cyclical information exchange that supports this process.
A Work ow Management Systems Architecture that Support Ad-Hoc Recoveries
Authors: Jian Tang, Xuemin Xing
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

Ad-hoc recovery is a phenomenon that occurs in work ow applications when an agent needs to alter the control flow prescribed in the original definition. It is usually caused by unpredictable reasons, such as an unexpected output of some individual tasks, events or exceptions due to the changing environment, etc. Due to its irregularity in nature, ad-hoc recovery in general cannot be dealt with by using pre-defined exception handler. On the other hand, since it allows changes without following a particular pattern, it offers greater flexibility than many existing work flow products do. In this paper, we introduce the concepts relating to ad-hoc recovery, and suggests approaches to supporting this phenomenon in practical applications. We concentrate on the architectural aspects at the work flow management system level, and describe functionalities of the main components and their interactions.
Expressing Constraints for Data Display Specification: A Visual Approach
Authors: Isabel F. Cruz
Venue:  (1993)

In this paper we introduce a constraint-based language that has a visual syntax and allows the declarative specification of the display of data. Other features of the proposed language include: (1) simplicity and genericity of the basic constructs; (2) ability to specify a variety of displays (graphs, bar charts, pie charts, etc.); (3) compatibility with the object-oriented framework of the database language DOODLE. We provide the syntax and the semantics of the language, and examples of applications that demonstrate the expressiveness of our language.
PC Help Desk in a Book
Authors: Mark Edward Soper
Venue:  (2002)

:Each year, thousands of harmless PCs suffer the pain and humiliation of buggy Windows installations, bad cable connections, mismanaged system resources, viruses, and slow Internet connections. All too often, these downtrodden PCs end up being scrapped before their time by owners who just can't care for them any longer. The real travesty is that with a little love, these wounded PCs could become useful members of society. That's where PC HelpDesk in a Book comes in. Using a unique, medical dictionary approach, this book walks users through the symptoms to diagnose and treat the problem. End-users will be armed to perform cost-effective upgrades, repair fouled Windows installations, and squeeze out a little more performance from a slow Internet connection in lieu of purchasing a new computer.
QOS provisioning in micro-cellular networks supporting multimedia traffic
Authors: M. Naghshineh, A. S. Acampora
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

We introduce an adaptive call admission control mechanism for wireless/mobile networks supporting multimedia traffic, and discuss a number of resource sharing schemes which can be used to allocate wireless bandwidth to different classes of traffic. The adaptive call admission control reacts to changing new call arrival rates, and the resource sharing mechanism reacts to rapidly changing traffic conditions in every radio cell due to mobility of mobile users. In addition, we have provided an analytical methodology which shows that the combination of the call admission control and the resource sharing schemes guarantees a predefined quality-of-service to each class of traffic. One major advantage of our approach is that it can be performed in a distributed fashion removing any bottlenecks that might arise due to frequent invocation of network call control functions.
Statistical Phrases in Automated Text Categorization
Authors: Maria F Caropreso, Stan Matwin, Fabrizio Sebastiani
Venue:  (2000)

In this work we investigate the usefulness of {\em $n$-grams} for document indexing in text categorization (TC). We call $n$-gram a set $t_k$ of $n$ word stems, and we say that $t_k$ occurs in a document $d_j$ when a sequence of words appears in $d_j$ that, after stop word removal and stemming, consists exactly of the $n$ stems in $t_k$, in some order. Previous researches have investigated the use of $n$-grams (or some variant of them) in the context of specific learning algorithms, and thus have not obtained general answers on their usefulness for TC. In this work we investigate the usefulness of $n$-grams in TC independently of any specific learning algorithm. We do so by applying feature selection to the pool of all $\alpha$-grams ($\alpha\leq n$), and checking how many $n$-grams score high enough to be selected in the top $\sigma$ $\alpha$-grams. We report the results of our experiments, using several feature selection functions and varying values of $\sigma$, performed on the {\sf Reuters-21578} standard TC benchmark. We also report results of making actual use of the selected $n$-grams in the context of a linear classifier induced by means of the Rocchio method.
Metro: measuring error on simplified surfaces
Authors: Paolo Cignoni, Claudio Rocchini, Roberto Scopigno
Venue:  (1996)

This paper presents a new tool, Metro, designed to compensate for a deficiency in many simplification methods proposed in literature. Metro allows one to compare the difference between a pair of surfaces (e.g. a triangulated mesh and its simplified representation) by adopting a surface sampling approach. It has been designed as a highly general tool, and it does no assuption on the particular approach used to build the simplified representation. It returns both numerical results (meshes areas and volumes, maximum and mean error, etc.) and visual results, by coloring the input surface according to the approximation error. EMAIL:: r.scopigno@cnuce.cnr.it
An Exterior Newton Method for Convex Quadratic Programming
Authors: Thomas F. Coleman, Jianguo Liu
Venue:  (1997)

We propose an exterior Newton method for convex quadratic programming problems.
A Framework for Analyzing Configurations of Deployable Software Systems
Authors: Dennis Heimbigner, Richard S. Hall, Alexander L. Wolf
Venue: Proceedings of the 5th International Conference on Engineering of Complex Computer Systems (1999)

Configuring and deploying a large software system is complicated when the system is composed of components and when there are numerous possible configurations for the system. In such a scenario, it is difficult for end-users to specify and install an appropriate configuration for their specific environment. Defining all valid configurations of a software system is challenging, and can be addressed through a concise specification that can generate all of the possible configurations. The Deployable Software Description (DSD), part of the University of Colorado Software Dock project, is one such specification format. But using the DSD runs the risk that the set of generated configurations includes some that are invalid with respect to constraints defined independently of the DSD. This paper describes a framework to support the analysis of DSD specifications to help developers detect potentially invalid configurations.This analysis assumes that the system components are annotated with properties, and an analysis tool is provided that takes a specific configuration and analyzes it for conflicts with respect to some set of constraints. Using the DSD, we can enumerate and analyze configurations to verify their validity. The results can be used to modify the DSD to avoid future generation of invalid configurations.
Admission Control for Wireless Networks with Heterogeneous Traffic using Event Based Resource Estimation
Authors: Jelena Misic, Samuel T. Chanson, Frederick S. Lai
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

In this paper a new distributed adaptive admission control algorithm for wireless cellular networks with heterogeneous traffic is proposed. The resources needed for handoff calls are estimated by calculating the probability of visiting particular cells during the call lifetime based on the call duration and residence time statistics. This information is then communicated to the base stations in the S surrounding rings. The amount of reserved resources is updated at handoffs and call termination which involves simple arithmetic operations only. The admission algorithm also maintains the tuning parameters by which hard constraints on handoff dropping probabilities can be met. We have also derived the QoS bounds for homogeneous traffic.
Trace Theory and Systolic Computations
Authors: Martin Rem
Venue:  (1987)

No Abstract.
Constraint-based facial animation
Authors: Zs Ruttkay
Venue:  (1999)

Constraints have been traditionally used for computer animation applications to define side conditions for generating synthesized motion according to a standard, usually physically realistic, set of motion equations. The case of facial animation is very different, as no set of motion equations for facial expressions is available. In this paper we discuss a facial animation editor, which uses numerical constraints for two roles: to declare the mimic repertoire of synthetic faces and other requirements a facial animation has to meet, and to aid the animator in the process of composing a specific animation fulfilling the requirements. The editor is thus also a `motion sculpturing` tool, which lifts the task of creating facial animation from the control data manipulation level to the conceptual design level. The major aid of the editor is to repair inconsistencies due to changes made by the user, and revise changes for which no good repair is possible. Also, reuse of constrained animations, especially expressions, is supported. The main machinery behind these services is interval propagation, which, if using certain type of linear inequalities to express the character- as well as the animation-specific requirements, can produce quickly the interval of feasible values for each control variable. If a solution (usually, repair) has to be produced, it is generated by selecting the best one from a restricted set of acceptable solutions, based on user-defined or automatically generated criteria for the choices.
Weakly-Connected Dominating Sets and Sparse Spanners in Wireless Ad Hoc Networks
Authors: Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

A set S is dominating if each node in the graph G =(V,E) is either in S or adjacent to at least one of thenodes in S. The subgraph weakly induced by S is the graphG' = (V,E') such that each edge in E' has at least one endpoint in S. The set S is a weakly-connected dominating set(WCDS) of G if S is dominating and G' is connected. G'is a sparse spanner if it has linear edges. In this paper, wepresent two distributed algorithms for finding a WCDS inO(n) time. The first algorithm has an approximation ratioof 5, and requires O(n log n) messages. The second algorithmhas a larger approximation ratio, but it requires onlyO(n) messages. The graph G' generated by the second algorithmforms a sparse spanner with a topological dilationof 3, and a geometric dilation of 6.
InterActions: Multidatabase Support for Planning Applications
Authors: Marian H. Nodine
Venue:  (1991)

Multidatabases attempt to provide a unified method of accessing information currently stored in multiple, autonomous, existing databases. This paper describes a global transaction model, {\em InterActions}, that supports access to a multidatabase. An InterAction is a unit of work that accomplishes a specific, coherent task. Unlike traditional transactions, an InterAction is not assumed to be atomic. Instead, it allows the user to define for the InterAction not only the steps that it takes to accomplish its task, but also the extent to which the InterAction must be isolated from other InterActions. It also allows the user to define what to do when the underlying multidatabase evolves in some way that affets the InterAction. This paper presents a set of requirements for tasks that access and/or update information in a multidatabase. A model for defining these tasks, called InterActions, is presented. This includes specifying a language for defining InterActions, and shows how to map an InterAction specification onto a set of transactions on the local databases that form the multidatabase. In addition, it presents a definition for correct operation of a multidatabase that supports InterActions. Also, this paper presents insights into how to implement synchronization, commit, and recovery algorithms for InterActions in a multidatabase.
System Refinement in VDM-SL
Authors: Paul Mukherjee
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

We introduce the concept of the system specification as a way of specifying properties not normally associated with model-based specifications. This idea is extended by defining a notion of refinement between systems, and also data refinement between systems. These refinement criteria are contrasted with the conventional case. The use of these refinement techniques is demonstrated by specifying a problem of competing resources, then refining it to remove the possibilities of deadlock and livelock.
Two-Dimensional Turing Machines With Uninitialized Workspaces
Authors: Robert C. Melville
Venue:  (1980)

NO SUPPLIED 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