ppxscal/embedding_network huggingface dataset:
Interactive Art for Zen: 'Unconscious Flow'
Venue: Proceedings of the International Conference on Information Visualisation (2000)

In face-to-face communications, the occasional need for intentional lies is something with which everyone can identify. For example, when we get mad, circumstances may force us to put on a big smile instead of expressing our anger; when we feel miserable, good manners may dictate that we greet others warmly. In short, to abide by social norms, we may consciously lie. On the other hand, if we consider the signs that our bodies express as communications (body language), we can say that the body does not lie even when the mind does. Considering this phenomenon, we propose a means of ¿touching the heart¿ in a somewhat Japanese way by measuring the heartbeat of the ¿honest¿ body and using other technologies to develop a new code of non-verbal communications from a hidden dimension in society. We call this ¿Meditation art¿ or ¿Zen Art.¿¿Zen¿ is Buddhism style meditation.
Implementing an Experience Factory: Maintenance and Evolution of the Software and Systems Development Process
Authors: B. Chatters
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

The ways in which software and systems are developed need to evolve and be maintained to keep pace with technology changes. ICL has developed an "Engineering Process Improvement Framework" to deploy world class engineering practices. The framework is an implementation of an experience factory. A repository to encourage knowledge sharing is at its core, implemented on the company's Intranet. The framework contains a toolkit to enable projects to create specific engineering process descriptions, known as engineering definitions, which are placed in the repository for knowledge sharing and as objects for potential reuse by other projects. The approach defined by a project is assessed and calibrated against an evolving definition of best practices prior to implementation, leading to the identification of risks and actions to be managed by the project. The effectiveness of the framework is reviewed and measured against the business objectives and project closure reports are published in the repository.
Software Architecture Directed Behaviour Analysis
Authors: Jeff Magee, Jeff Kramer, Dimitra Giannakopoulou
Venue: Proceedings of the 9th international workshop on Software specification and design (1998)

A Software Architecture is the overall structure of a system in terms of its constituent components and their interconnections. In this position paper, we discuss an approach to using architectural description for the behavioural analysis of distributed software systems and some of the issues which arise in providing tool support. The approach is based on the use of finite state automata to specify behaviour and Compositional Reachability Analysis to check composite system models. The architecture description of a system is used directly to generate the model used for analysis.
Market-Driven Symbolic Execution of Models of Manufacturing Enterprises
Authors: Tomasz Janowski, Zheng Hongjun, Gustavo Gimenez Lugo
Venue: Proceedings of the Second IEEE International Conference on Formal Engineering Methods (1998)

We apply formal description techniques (FDT) to model, compose and give operational meaning to the class of reactive systems representing manufacturing enterprises. The enterprise pursues its activities by means of resources and processes that execute concurrently on the resources, subject to internal (resource) and external (market) constraints. Some modelling techniques are familiar for reactive systems, other are specific to this domain: modelling management decisions, product transfer during one-to-one (one supplier one consumer) synchronisation, marketing and many-to-one (many suppliers one consumer) synchronisation. The paper is a novel application of FDTs, also a contribution to the semantics of enterprise engineering.
Identifying Reasons for Software Changes Using Historic Databases
Authors: Audris Mockus, Lawrence G. Votta
Venue: Proceedings of the International Conference on Software Maintenance (ICSM'00) (2000)

Large-scale software products must constantly change in order to adapt to a changing environment. Studies of historic data from legacy software systems have identified three specific causes of this change: adding new features; correcting faults; and restructuring code to accommodate future changes. Our hypothesis is that a textual description field of a change is essential to understanding why that change was performed. In addition, we expect that difficulty, size, and interval would vary strongly across different types of changes. To test these hypotheses we have designed a program, which automatically classifies maintenance activity based on a textual description of changes. Developer surveys showed that the automatic classification was in agreement with developer opinions. Tests of the classifier on a different product found that size and interval for different types of changes did not vary across two products. We have found strong relationships between the type and size of a change and the time required to carry it out. We also discovered a relatively large amount of perfective changes in the system we examined. From the study we have arrived at several suggestions on how to make version control data useful in diagnosing the state of a software project, without significantly increasing the overhead for the developer using the change management system.
Load Balancing to Improve Dependability and Performance for Program Objects in Distributed Real-Time Co-Operation over the Internet
Authors: Allan K. Y. Wong, Tharam S. Dillon
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

The aim of this project is to improve the fault-tolerant data communication setup that we proposed previously. From the verification tests for this setup, which integrates two basic schemes, we observed that performance could be very sluggish sometimes, due to time constraints imposed by problematic routing among communicating objects and possible message retransmissions. These constraints, if not relaxed, would restrict the possibility of building useful object-based real-time systems over the Internet.The two schemes in the extant setup are namely a) consecutive message transmissions to improve the communication reliability, and b) adaptive buffer management to prevent message losses at the reception side due to buffer overflow. Careful analyses of the previous test data have revealed that inclusion of load balancing would make the setup more responsive.With this motivation in mind, a load-balancing model is proposed in this paper. The different experiments in this project involved both local and remote Internet sites. The preliminary test results indicate that the proposed load balancing scheme can indeed enhance system responsiveness by relaxing time constraints. Therefore, further work and deeper investigations in the same direction are worthwhile.
On the Computational Power of Analog Neural Networks
Authors: DasGupta Bhaskar, Schnitger Georg
Venue:  (1999)

We survey the computational power of analog neural networks.
Manhattan World: Compass Direction from a Single Image by Bayesian Inference
Authors: James M. Coughlan, A. L. Yuille
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

When designing computer vision systems for the blind and visually impaired it is important to determine the orientation of the user relative to the scene. We observe that most indoor and outdoor (city) scenes are designed on a Manhattan three-dimensional grid. This Manhattan grid structure puts strong constraints on the intensity gradients in the image. We demonstrate an algorithm for detecting the orientation of the user in such scenes based on Bayesian inference using statistics which we have learnt in this domain. Our algorithm requires a single input image and does not involve pre-processing stages such as edge detection and Hough grouping. We demonstrate strong experimental results on a range of indoor and outdoor images. We also show that estimating the grid structure makes it significantly easier to detect target objects which are not aligned with the grid.
Mixing and Memory: Emergent Cooperation in an Information Marketplace
Authors: Aaron A. Armstrong, Edmund H. Durfee
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

An information marketplace consists of a group of agents buying and selling information content and services. Self-interested agents may find it rational to cheat others in the market. We have modeled federations of digital libraries selling information to one another. In our model, cooperation emerges through endogenous incentives. We had hypothesized that a number of factors would encourage cooperation: greater familiarity with trading partners, more memory for modeling others, fewer initially misbehaving agents, lower rates of strategy exploration, smaller world sizes, and more rapidly evolving measures of the likelihood of other agents to cooperate. Our simulations confirmed many of our hypotheses. However, the benefits of a small world size are dependent on memory size, and the usefulness of rapidly evolving estimates of cooperation is dependent on the types of strategies employed by the agents. We suggest that it will become increasingly important to allow agents conceptually to carve their networked environment into subcommunities where familiarity and trust can emerge, as opposed to promoting indiscriminate interactions within a large society of digital agents.
A STREAMS based high performance IP/X.25 router
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

IP/X.25 router is a principle approach to realize the interconnection between two TCP/IP networks over X.25 network. In this paper, the design and implementation of a STREAMS based high performance IP/X25 router is discussed. We first discuss the method for developing communication software in a UNIX kernel, and define a basic abstract model for it. This method will improve the performance of communication software and device driver. After a brief introduction of the function of IP/X.25 router we present the structure of a high performance IP/X.25 router which is designed and realized with that model in UNIX kernel based on STREAMS mechanism. A kind of general finite state machine (FSM) for the connectless internetworking over connection oriented subnetwork service and a dynamic addressing mapping algorithm is described. Finally, we introduce its application in TCP/IP network as a example and discuss the importance of interoperability testing, which could solve the interoperable problem of communication software.
Clovers: The Dynamic Behavior of Types and Instances
Authors: Lynn A Stein, Stanley B. Zdonik
Venue:  (1989)

Clovers are a new mechanism for object-oriented languages that relax the constraints of the conventional type/instance distinction. Clovers provide a new definition of object-hood, in which a single object may consist of multiple overlapping representations, sharing aspects of both behavior and identity. We show how clovers can be used to implement multiple views, changes to the type of an object, and expanded type notions such as minimal template. We argue that Clovers provide a useful unification of the type/instance relaxations that have been presented in the literature, such as versioning, prototypes, and boolean classes.
Probabilistic Verification of Multiple-Valued Functions
Authors: Elena Dubrova, Harald Sack
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

This paper describes a probabilistic method for verifying the equivalence of two multiple-valued functions. Each function is hashed to an integer code by transforming it to an integer-valued polynomial and the equivalence of two polynomials is checked probabilistically. The hash codes for two equivalent functions are always the same. Thus, the equivalence of two functions can be verified with a known probability of error, arising from collisions between inequivalent functions. Such a probabilistic verification can be an attractive alternative for verifying functions that are too large to be handled by deterministic verification methods.
Nonblocking WDM Multicast Switching Networks
Authors: Yuanyuan Yang, Jianchao Wang, Chunming Qiao
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

With ever increasing demands on bandwidth from emerging bandwidth-intensive applications, such as web browsing, video conferencing, E-commerce, video-on-demand services, there has been an acute need for very high bandwidth transport network facilities. Optical networks are a promising candidate for this type of applications. At the same time, many bandwidth-intensive applications require multicast services for efficiency purposes. Multicast has been extensively studied in the parallel processing and electronic networking community, and has started to receive attention in the optical network community recently. In particular, as WDM (wavelength division multiplexing) networks emerge, supporting WDM multicast becomes increasingly attractive. In this paper, we consider efficient designs of multicast-capable WDM switching networks, which are significantly different, and hence require non-trivial extensions from their electronic counterparts. We first discuss various multicast models in WDM networks, and analyze the nonblocking multicast capacity and network cost under these models. We then propose two methods to construct nonblocking multistage WDM networks to reduce the network cost.
The Relationship of Slicing and Debugging to Program Understanding
Authors: Margaret Ann Francel, Spencer Rugaber
Venue: Proceedings of the 7th International Workshop on Program Comprehension (1999)

The paper describes a study that explores the relationship between program slicing and code understanding gained while debugging. The study consisted of an experiment that compared the program understanding abilities of two classes of debuggers: those who slice while debugging and those who do not. For debugging purposes, a slice can be thought of as a minimal subprogram of the original code that contains the program faults. Those who only examine statements within a slice for correctness are considered slicers; all others are considered non-slicers. Using accuracy of reconstruction as a measure of understanding; it was determined that slicers have a better understanding of the code after debugging.
Structure-preserving binary relations for program abstraction
Authors: David A. Schmidt
Venue: The essence of computation: complexity, analysis, transformation (2002)

An abstraction is a property-preserving contraction of a program's model into a smaller one that is suitable for automated analysis. An abstraction must be sound, and ideally, complete. Soundness and completeness arguments are intimately connected to the abstraction process, and approaches based on homomorphisms and Galois connections are commonly employed to define abstractions and prove their soundness and completeness.This paper develops Mycroft and Jones's proposal that an abstraction should be stated as a form of structure-preserving binary relation. Mycroft-Jones-style relations are defined, developed, and employed in characterizations of the homomorphism and Galois-connection approaches to abstraction.
Optimal Deterministic Sorting in Parallel Memory Hierarchies
Authors: Mark H. Nodine, Jeffrey S Vitter
Venue:  (1992)

We present a general deterministic sorting strategy that is applicable to a wide variety of parallel memory hierarchies with parallel processors. The simplest incarnation of the strategy is an optimal deterministic algorithm called Balance Sort for external sorting on multiple disks with a single CPU. Balance Sort was the topic of a previous technical report. This technical report shows how to adapt Balance Sort to sort deterministically in parallel memory hierarchies. The algorithms so derived will be optimal for all parallel memory hierarchies for which an optimal algorithm is known for a single hierarchy. In the case of $D$ disks, $P$ processors, block size $B$, and internal memory size $M$, they are optimal in terms of I/Os for any $P \leq M$ and $DB M \log \min\{M/B, \log M\}/\log M$ and $\log M/B = o(\log M)$.
Group Protocol for Quorum-Based Replication
Authors: Keijirou Arai, Katsuya Tanaka, Makoto Takizawa
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

Distributed applications are realized by cooperation of multiple objects. Objects in the systems are replicated to make the systems fault-tolerant. Read and write request messages are issued to the replicas in a quorum-based scheme. In this paper, a quorum-based ordered relation among request messages is defined to make replicas consistent. We discuss a group protocol, which supports a group of replicas with the quorum-based ordered delivery of request messages.
Silicon Single-Electron Devices and Their Applications
Authors: Yasuo Takahashi, Akira Fujiwara, Yukinori Ono, Katsumi Murase
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

We have developed two novel methods of fabricating very small Si single-electron transistors (SETs), called PAttern-Dependent OXidation (PADOX) and Vertical PAttern-Dependent OXidation (V-PADOX). These methods exploit special phenomena that occur when small Si structures on SiO2 are thermally oxidized. Since the size of the resultant Si island of the SET is about 10 nm, we can observe the conductance oscillations in the SET even at room temperature. The controllability and reproducibility of these methods are excellent because of the stability of the thermal oxidation process. We are using PADOX and V-PADOX to integrate single-electron devices (SEDs) for sophisticated functions. We have fabricated and tested several kinds of memory and logic devices. This paper also describes applications of multi-input gate SETs to multiple-valued logic circuits.
Visualizing the global topology of the MBone
Authors: T. Munzner, E. Hoffman, K. Claffy, B. Fenner
Venue: Proceedings of the 1996 IEEE Symposium on Information Visualization (INFOVIS '96) (1996)

We present a case study of visualizing the global topology of the Internet MBone. The MBone is the Internet's multicast backbone. Multicast is the most efficient way of distributing data from one sender to multiple receivers with minimal packet duplication. Developed and initially deployed by researchers within the Internet community, the MBone has been extremely popular for efficient transmission across the Internet of real-time video and audio streams such as conferences, meetings, congressional sessions, and NASA shuttle launches. The MBone, like the Internet itself grew exponentially with no central authority. The resulting suboptimal topology is of growing concern to network providers and the multicast research community. We create a geographic representation of the tunnel structure as arcs on a globe by resolving the latitude and longitude of MBone routers. The interactive 3D maps permit an immediate understanding of the global structure unavailable from the data in its original form as lines of text with only hostnames and IP addresses. Data visualization techniques such as grouping and thresholding allow further analysis of specific aspects of the MBone topology. We distribute the interactive 3D maps through the World-Wide Web using the VRML file format thus allowing network maintainers throughout the world to analyze the structure move effectively than would be possible with still pictures or pre-made videos.
Self-Adapting Backfilling Scheduling for Parallel Systems
Authors: Barry G. Lawson, Evgenia Smirni, Daniela Puiu
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

We focus on non-FCFS job scheduling policies for parallel systems that allow jobs to backfill, i.e., to move ahead in the queue, given that they do not delay certain previously submitted jobs. Consistent with commercial schedulers that maintain multiple queues where jobs are assigned according to the user-estimated duration, we propose a self-adapting backfilling policy that maintains multiple job queues to separate short from long jobs. The proposed policy adjusts its configuration parameters by continuously monitoring the system and quickly reacting to sudden fluctuations in the workload arrival pattern and/or severe changes in resource demands. Detailed performance comparisons via simulation using actual Supercomputing traces from the Parallel Workload Archive indicate that the proposed policy consistently outperforms traditional backfilling.
Digital Cinematography & Directing
Authors: Dan Ablan
Venue:  (2002)

:[digital] Cinematography and Directing is unlike any other cinematography or directing book you've seen. This book was written entirely for 3D animators. Based on real-world photographic and cinematic principles, it teaches you essential skills and concepts that you can apply to any industry 3D application, such as LightWave 3D, Softimage XSI, 3ds max, CINEMA 4D, Maya, and other leading programs. This book does not focus on using software but rather teaches you how to understand and use the camera within your 3D application.Master focal lengths, f-stops, and apertures within your 3D aplication.Learn how pre-production planning can guide and enhance your project by applying essential storyboarding techniques.Use light as not only an illumination source, but as a tool for cinematic storytelling.Learn how to direct your digital cast with proper staging techniques"Dan Ablan's years of innovating digital production techniques and his undeniable expertise at teaching CGI, FX, and Film, makes digitalCinematography and Directing a must-have!" -Dave Adams, Dreamworks.
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
Authors: Dimitris Achlioptas
Venue: Journal of Computer and System Sciences (2003)

A classic result of Johnson and Lindenstrauss asserts that any set of n points in d-dimensional Euclidean space can be embedded into k-dimensional Euclidean space---where k is logarithmic in n and independent of d--so that all pairwise distances are maintained within an arbitrarily small factor. All known constructions of such embeddings involve projecting the n points onto a spherically random k-dimensional hyperplane through the origin. We give two constructions of such embeddings with the property that all elements of the projection matrix belong in {-1, 0, +1 }. Such constructions are particularly well suited for database environments, as the computation of the embedding reduces to evaluating a single aggregate over k random partitions of the attributes.
New Efficient and Accurate Moment Matching Based Model for Crosstalk Estimation in Coupled RC Trees
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

In this paper, we provide a new efficient moment matching based model for the estimation of crosstalk in coupled RC tree networks. This model is formulated based on an exact and efficient linear order recursive algorithm for the moment computation of such networks with both lumped and distributed RC elements. The formulas used in the model are efficiently obtained by using the results of moment computation without any matrix operation and can fit for arbitrary input waveforms. Simulation results show it performs better than all existing formulas.