ppxscal/embedding_network huggingface dataset:
Visualization of large volumes of information using different representations
Authors: M. B. Carmo, J. D. Cunha
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

The visualization of large volumes of information requires mechanisms to reduce the amount of information to be displayed. In this paper, we propose a technique to combine the usage of filters (like the degree-of-interest function) with different, scale-dependent representations. This eliminates the need to create new representations or to use graphical attributes to show the degree of interest of each object. This approach is specially useful when the number of variables is large or the information density is too high. The method can be complemented with zoom mechanisms and distortion of the position of the objects in space, taking advantage of the reduction of the area occupied by those objects with less interest to increase the area available for those with a higher degree of interest, normally located near the focus.
BRUCE: A Graphics System with Hidden Line and Hidden Surface Algorithms
Authors: Keith Vetter, Christopher Roche
Venue:  (1986)

Accurately representing the physical world by computer is a topic which has direct benefits to fields like chemistry and architecture, and is a source of much research in computer science. This paper examines the steps necessary to develop and implement a graphical system that will allow for the modeling of physical world objects. In particular, this is a description of BRUCE: a graphical system that will describe a world of three dimensional polyhedra, implementing algorithms for hidden line and hidden surface removal. This paper also deals with the problems incurred along the way and suggestions for further improvement of BRUCE.
A semidefinite bound for mixing rates of Markov chains
Authors: Nabil Kahale
Venue:  (1995)

We study the method of bounding the spectral gap of a reversible Markov chain by establishing canonical paths between the states. We provide examples where improved bounds can be obtained by allowing variable length functions on the edges. We give a simple heuristic for computing good length functions. Further generalization using multicommodity flow yields a bound which is an invariant of the Markov chain, and which can be computed at an arbitrary precision in polynomial time via semidefinite programming. We show that, for any reversible Markov chain on n states, this bound is off by a factor of at most O(log^2), and that this is tight.
Enhancing Requirements and Change Management through Process Modeling and Measurement
Authors: Luigi Lavazza, Giuseppe Valetto
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

We present a methodology that aims at improving the effectiveness of requirements management in software development and maintenance. In particular, we address quantitative assessment of the impact of requirements changes, and quantitative estimation of costs of the development activities that must be carried out to accomplish those changes. Our approach is based on enhanced traceability and process measurement. Traceability relations are derived from an integrated view of the process and product models adopted within the software development organization. Hence, traceability spans over all the software life cycle and its products. Moreover, through proper measurement, the elements in the process and product models are quantitatively characterized, thus achieving a sound basis for different kinds of sophisticated analysis concerning the impact of requirements changes, their cost over the development process, and the sensitivity of the product to changes.
boxenv.sty: A LaTeX style file for formatting Box expressions
Authors: M. Jonge
Venue:  (1999)

Box is a language independent mark-up language. It is designed for use within a generic pretty-print framework to connect source language dependent front-ends to target language dependent back-ends. A front-end translates a term over a language to Box to describe its intended layout. Back-ends translate Box terms to arbitrary output formats. The tool box2latex is a back-end that generates LaTeX code using specialized LaTeX commands and environments defined in the style file boxenv.sty. This style file is required in order to process the generated document by LaTeX. This paper describes how to integrate the generated LaTeX files within your documents, and it describes the low-level interface and implementation of the boxenv.sty style file. 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
The Hexagonal Resistive Network and the Circular Approximation
Authors: David I. Feinstein
Venue:  (1988)

No abstract available. 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
Computing Dense Clusters On-line for Information Organization
Authors: J. Aslam, K. Pelekhov, Daniela Rus
Venue:  (1997)

We present and analyze the off-line star algorithm for clustering static information systems and the on-line star algorithm for clustering dynamic information systems. These algorithms partition a document collection into a number of clusters that is naturally induced by the collection. We show a lower bound on the accuracy of the clusters produced by these algorithms. We use the random graph model to show that both star algorithms produce correct clusters in time Theta(V + E). Finally, we provide data from extensive experiments.
J2EE Web Services
Authors: Richard Monson-Haefel
Venue:  (2003)

"J2EE(TM) Web Services is written in the tradition of the great books people have come to expect from author Richard Monson-Haefel. More than a complete and concise Web services reference, this essential guide is the way for J2EE developers to quickly master Web services architecture and development." -Floyd Marinescu, Author, EJB Design Patterns; Director, TheServerSide.comWeb services are revolutionizing the way enterprises conduct business, as they allow disparate applications to communicate and exchange business data. Now, Java 2, Enterprise Edition (J2EE(TM)) delivers a complete Web services platform. But how do you make sense of the sea of acronyms in this emerging area? Richard Monson-Haefel comes to the rescue with this essential guide for Java developers who need to understand J2EE APIs for Web services and the Web services standards.J2EE(TM) Web Services is a comprehensive guide to developing and deploying Web services using J2EE technology. Concentrating on standards sanctioned by the Web Services Interoperability Organization (WS-I) for maximum interoperability, the author delves into Web-service standards and the J2EE 1.4 Web-service APIs and components with clear and engaging discussions.Key topics covered include: XML (eXtensible Markup Language) and XML Schema SOAP (Simple Object Access Protocol) WSDL (Web Services Description Language) UDDI (Universal Description, Discovery, and Integration) JAX-RPC (Java API for XML-based RPC) SAAJ (SOAP with Attachments API for Java) JAXR (Java API for XML Registries) JAXP (Java API for XML Processing)The appendices complement this wealth of information with coverage of XML regular expressions, Base 64 encoding, DTDs (document type definitions), SOAP Messages with Attachments (SwA), RCP/Encoded SOAP messaging, and references to other resources. In short, this accessible reference will give Java developers the tools they need to use J2EE technologies and APIs to integrate both enterprise applications and Web-based applications.
High Precision Logic Form Transformation
Authors: Vasile Rus
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

This paper presents few extensions to the logic form representation and a method for transforming WordNet glosses into logic forms using a set of high-precision rules combined with a set of high recall heuristics. An almost 3% increase in POS tagging accuracy is achieved over state-of-the art results at the expense of user intervention on only 7.52% of words. We apply a nearest neighbor solution to parser switching that leads to 6.43% increase in exact sentence accuracy for glosses. Logic Forms are derived with an accuracy of 89.46%.
A linear-time algorithm for computing the diameters of the incomplete WK-recursive networks
Authors: Min-Yang Su, Gen-Huey Chen, Dyi-Rong Duh
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

The WK-recursive networks, which were originally proposed by Vecchia and Sanges, have suffered from the rigorous restriction on the number of nodes. Like the other incomplete networks, the incomplete WK-recursive networks have been proposed to relieve this restriction. In this paper, it is first shown that the structures of the incomplete WK-recursive networks are conveniently represented with multistage graphs. This representation can provide a uniform look at the incomplete WK-recursive networks. With its help, a linear-time algorithm using the prune-and-search technique is presented for computing the diameters of the incomplete WK-recursive networks.
Removal of Translation Bias when Using Subspace Methods
Authors: W. James MacLean
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

Given estimates of the motion field (optic flow) from an image sequence, it is possible to recover translational direction, ~ T , using a variety of techniques. One such technique, known as "subspace methods," generates constraints which are perpendicular to ~ T , so that two distinct constraints allow a solution for ~ T . In practice many constraints are used in a least-squares solution, but it has been observed that the recovered estimates for ~ T are biased towards the optical axis. While the cause of the bias is well known, previous attempts to remove it have been awed. This paper outlines a new method which removes the bias. The technique is simple to apply and computationally efficient.
Defining interaction protocols using a commitment-based agent communication language
Authors: Nicoletta Fornara, Marco Colombetti
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We propose a method for the definition of interaction protocols to be used in open multiagent systems. Starting from the assumption that language is the fundamental component of every interaction, we first propose a semantics for Agent Communication Languages based on the notion of social commitment, and then use it to define the meaning of a set of basic communicative acts. Second, we propose a verifiable and application-independent method for the definition of interaction protocols, whose main component is the specification of an interaction diagram specifying which actions may be performed by agents under given conditions. Interaction protocols fully rely on the application-independent meaning of communicative acts. We also propose a set of soundness conditions that can be used to verify whether a protocol is reasonable. Finally, our approach is exemplified by the definition of an interaction protocol for English auctions.
A general packet replication scheme for multicasting in interconnection networks
Authors: S. C. Liew
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

Multicasting in broadband packet switches and metropolitan networks can be achieved by first replicating the packets and then routing them to their destinations. This paper studies a very simple but general replication scheme that can be applied to arbitrary interconnection-network topologies. The replication process of a packet adapts itself according to the network topology and the traffic condition. Hot spots of replication activities are diffused by this scheme which automatically moves part of the replication efforts to less active network regions. The scheme can potentially be used in networks (e.g., the Manhattan-street network) in which multicasting were thought to be inherently difficult. Fundamental issues and critical problem areas are laid out, and solutions addressing them are proposed. The performance of the replication algorithm and its implementation (logic diagram level) in the shuffle-exchange copy network are investigated in detail. It is found that the performance of the algorithm improves with the increase of network dimensions.
Implementing the SCAN language by neural networks
Authors: R. Brause
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

The real-time encryption of pictures is an important subject for many applications, e.g. television broadcast stations, network security, etc. The paper shows how the previously introduced SCAN encryption method can be easily implemented using binary neural network autoassociative memory.
Rule Generation With the Pattern Repository
Authors: Richard Relue, Xindong Wu
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

Efficient algorithms for mining frequent patterns are crucial to many tasks in data mining. Since the Apriori algorithm was proposed in 1994, there have been several methods developed to improve its performance. However, most still adopt its candidate set generation-and-test approach. In addition, many methods do not generate all frequent patterns, making them inadequate to derive all association rules.The calculation of association rules from raw itemsets using Apriori is an intractable problem. By using a new structure called a Pattern Repository, the same rules can be derived in linear-time proportional to the number of unique items found. If the selected rules are all we need, the calculation can give results in real-time. In addition, the calculation can easily be divided into subsets for distributed processing and large datasets can be stored on disk that adds to the I/O overhead, but still offers a linear time calculation of rules.
Computing Envelopes in Four Dimensions with Applications
Authors: K P Agarwal, Boris Aronov, Micha Sharir
Venue:  (1994)

Let ${\cal F}$ be a collection of $n$ $d$-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vertices, edges, and $2$-faces of the lower envelope (i.e., pointwise minimum) of ${\cal F}$ in expected time $O(n^{d+\varepsilon})$, for any $\varepsilon<0$. For $d=3$, by combining this algorithm with the point location technique of Preparata and Tamassia, we can compute, in randomized expected time $O(n^{3+\varepsilon})$, for any $\varepsilon<0$, a data structure of size $O(n^{3+\varepsilon})$ that, given any query point $q$, can determine in $O(\log^{2}n)$ time the function(s) of ${\cal F}$ that attain the envelope at $q$. As a consequence, we obtain improved algorithmic solutions to many problems in computational geometry, including (a) computing the width of a point set in 3-space, (b) computing the biggest stick in a simple polygon in the plane, and (c) computing the smallest-width annulus covering a planar point set. The solutions to these problems run in randomized expected time $O(n^{17/11+\varepsilon})$, for any $\varepsilon<0$, improving previous solutions that run in time $O(n^{8/5+\varepsilon})$. We also present data structures for (i) performing nearest-neighbor and related queries for fairly general collections of objects in 3-space and for collections of moving objects in the plane, and (ii) performing ray-shooting and related queries among $n$ spheres or more general objects in 3-space. Both of these data structures require $O(n^{3+\varepsilon})$ storage and preprocessing time, for any $\varepsilon < 0$, and support polylogarithmic-time queries. These structures improve previous solutions to these problems.
A Software Quality Perspective on the Evolution of ISO 9001: 1994 To ISO 9001:2000
Authors: A. J. Walker
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

The paper explores the implications of the ISO 9001:2000 Committee Draft in terms of its evolution from ISO 9001:1994. This review is undertaken using the business process model applied in ISO/IEC 12207 Software Lifecycle Processes. An analysis reveals there is only a moderate overlap between ISO 9001:1994 and the ISO/IEC 12207 process models. The gaps in the coverage are significant and account in part for the reluctance of the software development community to apply ISO 9001:1994. The emerging version of ISO 9001:2000 is examined in the light of ISO/IEC 12207. While the overlap between the process model of ISO/IEC 12207 and ISO 9001:2000 is improved (when compared to ISO 9001:1994), nevertheless there are inconsistencies needing to be addressed - the most noteworthy is the lack of commitment in ISO 9001:2000 to a true process orientation.
Computational database technology for component mode synthesis
Authors: M. Nyström, K. Orsborn
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The present work show how object relational database management system technology can be used to support an finite element analysis process that includes component mode synthesis using the Craig-Bampton method for calculating reduced mass and stiffness matrices. A general high-level model for accessing matrix data that is independent of matrix representation is presented. The model makes it possible to develop numerical operations on the matrix data independent of the underlying representation. The model is also used to express the calculations of the reduced stiffness and mass matrices in a declarative query language and thereby letting the database decide how to execute the operations and manage the memory.
50 Fast PhotoShop 7 Techniques with Cdrom, 1 edition
Authors: Gregory Georges
Venue:  (2002)

:50 Fast Photoshop "X" Techniques for is an immensely useful book for anyone wanting to take advantage of the very latest release of the world's top digital imaging tool, Adobe Photoshop.The techniques are valuable to both pros and hobbyists alike - they enable everyone to enjoy successful creation of fine art images and prints! The step-by-step and richly illustrated collection of awesome techniques are easily accessible and understandable to users on every level.This is a new kind of Photoshop book-one that can help both casual users through professional users save time while creating professional quality images and effects!
Computer-based safety critical systems in defence: Def (Aust) 5679
Authors: Tony Cant
Venue: Proceedings of the seventh Australian workshop conference on Safety critical systems and software 2002 - Volume 15 (2003)

The Australian Defence Standard Def (Aust) 5679, entitled "The Procurement of Safety-Critical Computer-Based Systems", was developed by the Australian Defence Science and Technology Organisation (DSTO), and published by the Land Engineering Agency in August 1998. It describes a systematic approach to the development of the Safety Case for a computer-based system. This paper gives a brief overview of Def (Aust) 5679, and describes plans for further technical revision.
COPE: A Cooperative Programming Environment
Authors: James E. Archer,  Jr., Richard W. Conway
Venue:  (1981)

NO SUPPLIED
A General Predictive Performance Model for Wavefront Algorithms on Clusters of SMPs
Authors: Adolfy Hoisie, Olaf Lubeck, Harvey Wasserman, Fabrizio Petrini, Hank Alme
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

We propose and validate a closed-end, analytical, general, predictive performance model for applications based on wavefront algorithms on clusters of SMPs. Wavefront algorithms are ubiquitous in parallel computing, since they represent a means of enabling parallelism in computations that contain recurrences. Our particular interest in wavefront algorithms derives from their use in discrete ordinates neutral particle transport computations representative of ASCI, but other important uses are well known The proposed model captures the tradeoff between processor utilization and communication requirements characteristics of wavefront algorithms. The general model can predict the performance of this class of applications on distributed architectures with a network of lower dimensionality compared to that of an MPP, of which clusters of SMPs are one example. We validate the model using a compact-application from the ASCI workload on a large-scale cluster of SGI Origin 2000s in existence at the Los Alamos National Laboratory. The proposed model validates well on all clusters configurations utilized.
TRMCS in TCOZ
Authors: Jing Liu, Jin Song Dong, Jing Sun
Venue: Proceedings of the 10th International Workshop on Software Specification and Design (2000)

The design of complex systems requires powerful mechanisms for modeling data, state, communication, and real-time behaviour; as well as for structuring and decomposing systems in order to control local complexity. Timed Communicating Object Z (TCOZ) builds on Object-Z's strengths in modeling complex data and state, and on Timed CSP's strengths in modeling process control and real-time interactions. In this paper, we demonstrate the TCOZ approach to the design and verification of the Teleservices and Remote Medical Care System.
An Approach to Limit the WYNOT Problem
Authors: G. Antoniol, A. Cimitile, M. Tortorella, G. Casazza
Venue: Proceedings of the International Conference on Software Maintenance (ICSM'00) (2000)

Software evolution in a cooperative environment, where a pool of maintainers/developers contribute to the overall system changes, is challenging due to several factors, such as the poor communication among individuals and the high number of produced changes. Conflicting or contradictory changes, unforeseen or unexpected dependencies may result in a non-working system. We propose a strategy aimed to reduce the risk of conflicting changes in a maintenance cooperative environment. To evaluate the feasibility of our approach and to attempt to estimate the size of the code to be scrutinized per single changed line, we developed a number of tools and tested our approach on 30 release of DDD software system. The preliminary results are encouraging: potentially impacted LOCS per single changed LOC is on the average less than 4.
Webs of Archived Distributed Computations for Asynchronous Collaboration
Authors: K. M Chandy, Adam Rifkin, Joseph Kiniry, Daniel Zimmerman
Venue:  (1997)

We identify the mechanisms needed to construct archivable webs of distributed asynchronous collaborations and experiments. The distinguishing feature of our approach is that the component tools, software, data, and even participants are distributed over a worldwide network. We perform a requirements analysis of an infrastructure that supports such applications, and present the Caltech Infospheres Infrastructure as a prototype that satisfies the requirements identified. In describing this prototype, we highlight the useful mechanisms provided, present an algorithm for using the lnfospheres Infrastructure to perform asynchronous global snapshots for archiving, and suggest future areas of exploration.