ppxscal/embedding_network huggingface dataset:
Efficient reconfiguration scheme for mesh-connected network: the recursive shift approach
Authors: I. Numata
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

Recently, several strategies have been studied to recover faulty processing elements on mesh arrays. S.Y. Kung et al. (1989) proposed a 1 1/2 track model for reconfiguration of mesh arrays and the reconfiguration algorithm based on graph theory by finding compensation paths. However, compensation path scheme does not perform reconfiguration efficiently since the strategy only focuses on faulty processing elements and requires global information. In this paper, we propose a new reconfiguration strategy named recursive shift to recover faulty processing elements on mesh arrays. It is confirmed that our strategy obtains much higher array yield than previous schemes without global information on identical redundant processing elements.
Visualization of Unbuilt Buildings in their Landscape
Authors: Ernst Petersen
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

Computer modelling can provide better information on building projects presented in two dimensional drawings but never built. A cemetery project in Denmark was formed as a solid model in its sloping landscape using Softimage. Boolean operations were used to position walls at a given height above the terrain. More accurate still and video images were made and compared with original sketches. 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
An optimistic quality-of-service provisioning scheme for cellular networks
Authors: S. K. Das, R. Jayaram, S. K. Sen
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

We propose an optimistic quality-of-service (QoS) provisioning scheme for multimedia traffic in wireless networks. The scheme uses the standard classification of network traffic into two priority classes based on their bandwidth requirement and delay tolerance. We classify the users as local or departing based on their current coordinates in the cell. A call admission algorithm, a call management algorithm and a prediction based resource reservation algorithm which reserves the specified bandwidth (by borrowing channels from neighboring cells, if required) in the predicted destination cell(s) of a departing user are presented. A novel approach called bandwidth compaction is proposed which enables more efficient spectrum utilization. Simulation experiments show improvements of about 24% in the call blocking probability and 12% in the connection dropping probability over other bandwidth reserving schemes. An overall improvement of 24% in bandwidth utilization over other schemes not employing any bandwidth management technique, is also observed.
A Temporal-Logic Based Compositional Proof System for Real-Time Message Passing
Authors: Jozef Hooman, Jennifer Widom
Venue:  (1988)

We consider a model of real-time network computation in which synchronous communication events occur during (possibly overlapping) intervals along a dense time scale. A specification language for processes and networks based on real-time temporal logic is defined. We give a simple proof system for network specifications when specifications for component processes are given. The proof system is then extended for a version of real-time CSP, under the assumption that all communications take some fixed length of time. Finally, it is shown that this proof system can be modified to allow varying communication lengths. All versions of the proof system are compositional, sound, and relatively complete.
Composite toroidal pressure hull
Authors: J. Blachut
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The paper addresses the static stability of externally pressurised toroidal shells with closed circular and non-circular cross-sections. Results of a numerical study into bifurcation buckling of CFRP filament wound toroids are presented. The influence of boundary conditions, variable wall thickness, laminations stacking and initial geometric imperfections on the load carrying capacity is provided.
Confident Assessment of Children's Handwritten Responses
Authors: Jonathan Allan, Tony Allen, Nasser Sherkat
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This paper introduces a novel approach for the automatic assessment of children's responses to standardised English exam questions. The constrained nature of the question and answer medium is exploited to produce an automatic assessment mechanism that is both highly accurate and produces a reasonable level of response yield. It is shown that the novel approach can achieve 100% scoring accuracy on 44% of all responses compared to a traditional lexical approach that has an error rate of 41%. When a thresholding method, similarto that used in the novel approach is applied, the traditional approach can achieve an accuracy of 100% but with a response yield of only 5%. The approach introduced in this paper is thus shown to have a significant advantage over the traditional lexical based assessment.
Efficient RMI: Dynamic Specialization of Object Serialization
Authors: Kenji Kono, Takashi Masuda
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

This paper describes a novel approach to object serialization in remote method invocation (RMI). Object serialization transforms objects' representations between heterogeneous platforms. Efficient serialization is primary concern in RMI because the conventional approaches incur large runtime overheads. The approach described here specializes a serializing routine dynamically according to a receiver's platform, and this routine converts the sender's in-memory representations of objects directly into the receiver's in-memory representations.This approach simplifies the process of RMI: the receiver can access the passed objects immediately without any data copies and data conversions. A new platform can join the existing community of senders and receivers because a specialized routine for the platform is generated as needed. Experimental results show that significant performance gains are obtained by this approach. The prototype implementation of this approach was 1.9 - 3.0 times faster than Sun XDR, and the time needed for generating a specialized routine was only 0.6 msec.
Fast and loose: biologically inspired couplings
Authors: Andy Philippides, Phil Husbands, Tom Smith, Michael O'Shea
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Recent years have seen the discovery of gaseous transmitters in biological nervous systems. An ANN inspired by such gaseous signalling, the GasNet, has previously been shown to be more evolvable than traditional ANNs. Here we present 2 new versions of the GasNet which take further inspiration from the properties of gaseous signalling. The plexus model is inspired by the cortical nNOS plexus and the properties of the NO signal it generates. The receptor model is inspired by the mediating action of neurotransmitter receptors. Both models are shown to significantly further improve evolvability. We describe preliminary results suggesting that the reasons for the increase in evolvability is the loose coupling of distinct signalling mechanisms. Issues surrounding the degree of coupling between these mechanisms, one 'chemical' and one 'electrical', are discussed.
GraGA: A Graph Based Genetic Algorithm for Airline Crew Scheduling
Authors: H. Timucin Ozdemir, Chilukuri K. Mohan
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

Crew Scheduling is an NP-hard constrained combinatorial optimization problem, very important for the airline industry. We propose a Genetic Algorithm (GraGA) to solve this problem. A new graph based representation utilizes memory effectively, unlike previous attempts, and provides a framework in which we can easily develop various genetic operators.
Inexpensive Non-Sensor Based Augmented Reality Modeling of Curves and Surfaces in Physical Space
Authors: Adrian David Cheok, Neo Weng Chuen Edmund, Ang Wee Eng
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

Previous works in modeling of curves and surfaces in augmented reality (AR) space has used expensive sensors such as magnetic sensors. In this work, we propose an augmented reality system where a user can model interesting surfaces with her hands, and without expensivesensing systems. The system uses computer vision based methods for the tracking of the user's head and hand position. Using a glove and the tracking system, the user can draw smooth lines or surfaces with her hands in a physical space. Also the user can intuitively modify the lines or surface created by pushing or pulling at the control points of the lines or curve in a tangible manner.
Comprehensive Distributed Garbage Collection by Tracking Causal Dependencies of Relevant Mutator Events
Authors: Sylvain R. Y. Louboutin, Vinny Cahill
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

Comprehensive distributed garbage collection in object-oriented distributed systems has mostly been addressed via distributed versions of graph-tracing algorithms, a legacy of centralised garbage collection techniques. Two features jeopardize the scalability of these approaches: the bottleneck associated with having to reach a global consensus before any resource can actually be reclaimed, and the overhead of eager log--keeping. This paper describes an alternative approach to comprehensive distributed garbage collection that entails computing the vector--time characterizing the causal history of some relevant events of the mutator processes computations. Knowing the causal histories of these events makes it possible to identify garbage objects that are not identifiable by means of per-site garbage collection alone. Computing the vector-times necessary to identify garbage is possible without the unbounded space overheads usually associated with dynamically reconstructing vector-times of arbitrary events of distributed computations. Our approach integrates a lazy log-keeping mechanism and therefore tackles both of the aforementioned stumbling blocks of distributed garbage collection.
Built-In-Self-Test of Analogue Circuits Using Optimised Fault Sets and Transient Response Testing
Authors: N. Axelos, J. Watson, D. Taylor, A. Platts
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

Transient Response Testing has been shown to be a very powerful and economical functional test technique for linear analogue cells in mixed-signal systems. Recently this work has been extended to non-linear analogue circuits by treating Transient Response Testingas a structural test technique and employing optimised and reduced fault sets that are derived from Inductive Fault Analysis and circuit sensitivity analyses. These developments have been very successful and have also facilitated a novel BIST methodology for analogue circuits. The BIST scheme employs a generic on-chip stimulus for all analogue cells and features a specially designed test cell that coordinates a short test sequence that involves sampling the transient response at key instants in the test cycle and comparing to a known reference.
Incremental Software Development Method Based on Abstract Interpretation
Authors: N. Yoshioka, M. Suzuki, T. Katayama
Venue: Proceedings of the 9th international workshop on Software specification and design (1998)

Stepwise Refinement is a well-known effective method for developing a large and complex software product. In traditional methods, a program is refined with respect to its function and the method is only applied in its design phase. In consequence, data defined at each step is too abstract to allow its execution and it is hard to find design errors by executing design artifacts.In this paper, we propose a method: Incremental Software development method based on Data Reification (ISDR), in which a program is refined from its data reification point of view and can be executed using Abstract Interpretation. One of the advantages of ISDR is that we can interpret intermediate programs which are not finished completely, so that errors can be detected at an earlier stage of software development than in traditional methods.
Role-assignment in open agent societies
Authors: Mehdi Dastani, Virginia Dignum, Frank Dignum
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Open systems are characterized by heterogeneous participants which can enter or leave the system at will. Typical examples are e-commerce applications or information agent systems. Agents (e.g. personal assistants for buying things on the Internet) will only temporarily take up roles (e.g. a buyer in on-line auctions). This creates the need to define precisely what it means that an agent "takes up" a role and "enacts" it. In this paper we present ongoing research on the determination of the conditions under which an agent can enact a role and what it means for the agent to enact a role. We define possible relations between roles and agents and discuss architectural and functional changes that an agent must undergo when it enters an open agent system.
Exception Handling in a Cooperative Object-Oriented Approach
Authors: Rogério de Lemos, Alexander Romanovsky
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

A Cooperative Action (CO action) is a modelling abstraction for representing collaborative behaviour between objects at different phases of the software development. In this paper, the original definition of a cooperative object-oriented approach for software development is extended in order to include the description of exceptional behaviour. Unlike the traditional methods that usually deal with exceptions at late design and implementation phases, the proposed approach emphasises the separation of treatments of application-related, design-related, and implementation-related exceptions during the software lifecycle. The feasibility of the approach is demonstrated in terms of a benchmark case study.
Performance assessment of a deterministic access protocol for high performance bus topology LANs
Authors: D. W. Pritty, J. R. Malone, N. L. Lawrie, D. N. Smeed, E. Harmon
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

This paper describes the operation of a proposed method of access to bidirectional local area network buses-called timed packet release or TPR. The method is based on a system of time delays in the nodes, reckoned from a timing reference signal and provides collision free deterministic access for queued packets. A comparative evaluation of the performance of TPR with other methods of bidirectional bus access such as token passing and the reservation protocols is provided. Results, obtained using discrete event simulation models, are presented for the various access protocols. Performance is measured in terms of the average delay-throughput characteristics of the networks. The implementation aspects of TPR are reviewed briefly.
A Smooth Rational Spline for Visualizing Monotone Data
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

A C 2 curve interpolation scheme for monotonic data has been developed. This scheme uses piecewise rational cubic functions. The two families of parameters, in the description of the rational interpolant, have been constrained to preserve the shape of the data. The monotone rational cubic spline scheme has a unique representation. 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
A Query Algebra for Object-Oriented Databases
Authors: Gail M. Shaw, Stanley B. Zdonik
Venue:  (1989)

We define an algebra that synthesizes relational query concepts with object-oriented databases. The algebra fully supports abstract data types and object identity while providing associative access to objects, including a unique join capability. The operations take an abstract view of objects and access typed collections of objects through the public interface defined for the type. The algebra supports access to relationships implied by the structure of the objects, as well as the definition and creation of new relationships between objects. The structure of the algebra and the abstract access to objects offer opportunities for query optimization.
Pattern-Based Parallel Programming
Authors: S. Bromling, S. MacDonald, J. Anvik, J. Schaeffer, D. Szafron, K. Tan
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

The advantages of pattern-based programming have been well-documented in the sequential programming literature. However patterns have yet to make their way into mainstream parallel computing, even though several research tools support them. There are two critical shortcomings of pattern (or template) based systems for parallel programming: lack of extensibility and performance. This paper describes our approach for addressing these problems in the CO2P3S parallel programming system. CO2P3S supports multiple levels of abstraction, allowing the user todesign an application with high-level patterns, but move to lower levels of abstraction for performance tuning. Patterns are implemented as parameterized templates, allowing the user the ability to customize the pattern to meet their needs. CO2P3S generates code that is specific to the pattern/parameter combination selected by the user. The MetaCO2P3S tool addresses extensibility by giving usersthe ability to design and add new pattern templates to CO2P3S. Since the pattern templates are stored in a system-independent format, they are suitable for storing in a repository to be shared throughout the user community.
ESF: an automatically generated encyclopedia of special functions
Authors: Ludovic Meunier, Bruno Salvy
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

We present our on-going work on the automatic generation of an encyclopedia of special functions on the web, called The Encyclopedia of Special Functions (ESF)footnoteurlhttp://algo.inria.fr/esf. All mathematical formulæ in the ESF are computed, typeset and displayed without any human intervention. This is achieved by exploiting a collection of computer algebra algorithms in a systematic way, on top of a specially designed data structure for a class of special functions.
The effect of agreements in a game with multiple strategies for cooperation
Authors: Pedro Mariano, Luís Correia
Venue: Proceedings of the eighth international conference on Artificial life (2002)

We present a model suited not only for the study of evolution of cooperation but also to study behaviours such as treason and exploitation. This game has multiple Pareto Optimal solutions, which causes shifts in the agent strategies that we can interpret as either treason or exploitation. This requires some form of coordination between agents to avoid penalising behaviours. We present results of our game with and without an agreement model. We show that our game provides rich evolutionary dynamics.
The Generation Circulation Method to Generalized Reed-Muller Coefficients over GF(3)
Authors: Chol U. Lee, Gi-Young Byun, Bu-Sik Shin, Jae-Hwan Sim, Heung-Soo Kim
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

This paper propose the circulation method to generate GRMcoefficient over GF(3). The general method to derive GRMcoefficients are obtain RM expansion for the function andexpand it for the polarities. The general method has manyoperations when the number of the variable is increased.Proposed method of this paper simplifies the generationprocess and reduces a number of operations compare toparallel type because of the cyclic property of polarity.To verify propriety of this method, previous proposed paperis compared in the number of operations.
A Pragmatic Approach to Augmented Reality Authoring
Authors: Matthias Haringer, Holger T. Regenbrecht
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

In this paper we describe the Augmented Reality (AR) authoring system "PowerSpace" which allows fast and comfortable generation of AR worlds. The system presented uses the functionality of a 2D presentation program (Microsoft PowerPoint) as the basis for thecomposition of 3D content.An MS PowerPoint export is used to generate an XML-based extensible description of a presentation. This description is enriched by 3D content with the help of an editor, which is also part of the PowerSpace system. The content of this presentation is finally converted into 3D scenes and is used in an AR-Viewer.
The exact solution for solving a class nonlinear operator equations in the reproducing kernel space
Authors: Chun-li Li, Ming-gen Cui
Venue: Applied Mathematics and Computation (2003)

In this paper, the author will introduce the Sobolev space W21 (Ωn) firstly and then give the reproducing properties of the space W21 (Ωn). As these results of those, a class of the nonlinear operator equation Σi=1n Πj=1mi (Aiju) = f is transformed to the n-dimensional linear operator equation Au = f. Finally, we also give the exact solution of this nonlinear operator equation.
Measuring early usage of Dartmouth''s wireless network
Authors: Pablo Stern
Venue:  (2001)

In Spring 2001, Dartmouth College installed a campus-wide 802.11b wireless network. To understand how that network is used, we examined the usage characteristics of the network over a five-week period. We monitored access points to determine user behavior, and user and network traffic characteristics. Because our study coincided with the deployment of the access points, our analysis captures the growth of a wireless network. The results of this study help understand the behavior of mobile users and provide a reference to network engineers wishing to deploy and expand similar wireless networks.
Centralized Multicast
Authors: S. Keshav, S. Paul
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

Most current schemes for multicast routing assume that multicast routers participate both in forwarding multicast packets and in control algorithms for routing, resource reservation, and group management. By separating data and control flow, and by centralizing control in distinct control elements, we have designed a simple and scalable approach to IP multicast that we call Centralized Multicast. We present the details of our approach, analysis of its performance, and a discussion of its advantages over current schemes.
Detecting and Representing Relevant Web Deltas Using Web Join
Authors: Sourav S. Bhowmick, Wee Keong Ng, Ee-Peng Lim, Sanjay Madria
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

In this paper, we show how to detect and represent web deltas, i.e., changes in Web information, that are relevant to a user's query in the context of our web warehousing system called WHOWEDA (Warehouse of Web Data). In WHOWEDA, Web information is materialized views stored in web tables and can be manipulated and analyzed using a set of web algebraic operators. In this paper, we present a mechanism to detect relevant web deltas using web join and outer web join. We show how to represent these changes using delta web tables.