ppxscal/embedding_network huggingface dataset:
Supporting the Life-Cycle of Multimedia and Visualization Using Distributed Performance Support Systems
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

UK Higher Education Institutions have invested significantly in the implementation of multimedia and visualization material in teaching, learning and assessment of civil and building engineering - with mixed results. This paper focuses on the use and life cycle of digital imagery and visualization material, which is embedded within multimedia teaching aids to improve student understanding. It describes ways in which these materials are developed and used in the civil and building engineering curriculum and, in particular, how distributed performance support systems can be applied to make more effective use of digital imagery and visualization material. Following this, the paper then describes how a distributed performance support system approach to education is being adopted at Loughborough University as part of the CAL-Visual project. After highlighting the main aims and objectives of the project, the paper concludes by discussing some of the issues encountered during the design and implementation of a distributed performance support system. 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
Unified framework for sparse and dense SPMD code generation (preliminary report)
Authors: Vladimir Kotlyar, Keshav Pingali, Paul Stodghill
Venue:  (1997)

We describe a novel approach to sparse {\em and} dense SPMD code generation: we view arrays (sparse and dense) as distributed relations and parallel loop execution as distributed relational query evaluation. This approach provides for a uniform treatment of arbitrary sparse matrix formats and partitioning information formats. The relational algebra view of computation and communication sets provides new opportunities for the optimization of node program performance and the reduction of communucation set generation and index translation overhead.
Unlocking with Residual-Free Bubbles
Authors: Leopoldo P. Franca, Alessandro Russo
Venue:  (1995)

Residual-free bubbles are derived for the Timoshenko beam problem. Eliminating these bubbles the resulting formulation is form-identical to using the following tricks to the standard variational formulation: I) one-point reduced integration on the shear energy term; ii) replace its coefficient 1/ 2 by 1/ ( 2 + ( h2K/12)) in each element; iii) modify consistently the right-hand-side. This final formulation is legally'' obtained in that the Galerkin method enriched with residual-free bubbles is developed using full integration throughout. Furthermore this method is nodally exact by construction.
A built-in self-reconfigurable scheme for 3D mesh arrays
Authors: I. Takanami, T. Horita
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

We propose a model for fault tolerant 3D processor arrays using one-and-half track switches. Spare processors are laid on the two opposite surfaces of the 3D array. The fault compensation process is performed by shifting processors on a continuous straight line from a faulty processor to a spare on the surfaces. Two opposite directions are allowed for compensation paths only which they are not in the near-miss relation. Then, switches with only 4 states are needed to preserve the 3D mesh topology after compensating faults. We give an algorithm in a convenient form for reconfiguring by hardware the 3D mesh arrays with faults and show the survival rates and the probabilities of them by computer simulation. The probabilities are compared with those of the case using double tracks which have no restriction of the near-miss relation. The algorithm can reconfigure the 3D mesh arrays in polynomial time. Finally, we design a logical circuit for hardware realization of the algorithm. This will be able to make us build such a built-in self-reconfigurable 3D mesh array that the reconfiguration can be done very quickly.
Mobile Agent Fault Tolerance for Information Retrieval Applications: An Exception Handling Approach
Authors: Simon Pears, Jie Xu, Cornelia Boldyreff
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

Maintaining mobile agent availability in the presence of agent server crashes is a challenging issue since developers normally have no control over remote agent servers. A popular technique is that a mobile agent injects a replica into stable storage upon its arrival at each agent server. However, a server crash leaves the replica unavailable, for an unknown time period, until the agent server is back on-line. This paper uses exception handling to maintain the availability of mobile agents in the presence of agent server crash failures. Two exceptionhandler designs are proposed. The first exists at the agent server that created the mobile agent. The second operates at the previous agent server visited by the mobile agent. Initial performance results demonstrate that although the second design is slower it offers the smaller trip time increase in the presence of agent server crashes.
How good can IP routing be?
Authors: Lorenz Dean H., Orda Ariel, Raz Danny, Author:
Venue:  (2001)

In the traditional IP scheme, both the packet forwarding and the routing protocols are source invariant, i.e., their decisions depend on the destination IP address and not on the source address. Recent protocols, such as MPLS, as well as traditional circuit based protocols like PNNI allow routing decisions to depend both on the source and destination addresses. In fact, much of the theoretical work on routing assumes per-flow forwarding and routing, i.e., the forwarding decision is based both on the source and destination addresses. The benefit of per-flow forwarding is well-accepted, so is the practical implications of its deployment. Nevertheless, no quantitative study has been carried on the performance differences between the two approaches. This work aims at investigating the toll in terms of performance degradation that is incurred by source invariant schemes, as opposed to the per-flow alternatives. We show, both theoretically and by simulations, that source invariant routing can be significantly worse than per-flow routing. Realizing that static shortest path algorithms are not optimal even among the source invariant routing algorithms, we develop novel routing algorithms that are based on dynamic weights, and empirically study their performance in an Internet like environment. Paper Available at: ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/2001/2001-17.ps.gz
Nonlinear finite element analysis of composite planar frames with interlayer slip
Authors: B. Čas, F. Saje, M. Saje, I. Planinc
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

A new finite element formulation for nonlinear analysis of two-layered composite planar frames with interlayer slip is presented. The formulation is based on geometrically nonlinear Reissner's beam theory with small interlayer slips and the well known Bernoulli hypothesis for each layer is taken into account. The nonlinear time-dependent constitutive models for layers and nonlinear relationship between slip and shear stress at the interface are considered in the formulation. Because only a few elements are needed to describe a beam or column of a frame with great precision, a new element is prefectly suited for practical calculations.
The Definitive Guide to the .NET Compact Framework
Authors: Larry Roof, Dan Fergus
Venue:  (2003)

:About the AuthorLarry Roof has been a key individual in the Windows CE market from the beginning. He authored the first book on developing mobile applications with Visual Basic for Windows CE, is a frequent speaker at major technical conferences, writes a monthly column for MSDN Voices, and runs face-to-face training on developing mobile applications. Dan Fergus currently works as a consultant and trainer teaching a Compact Framework course along with Visual Basic .NET and ASP.NET courses. Dan has been working with .NET and the CF since the beginning and currently has several applications on the PocketPC on the market. Before becoming an independent, Dan worked at NuMega Technologies as the Dev Lead on Visual Basic 6 debugging tools. Dan also speaks at developer conferences around the world and writes for several magazines.
Computing with Heterogeneous Parallel Machines: Advantages and Challenges
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

This invited keynote paper discusses the advantages of computing with heterogeneous parallel machines, and examines the research challenges for automating the use of such systems. One type of heterogeneous computing system is a mixed-mode machine, where a single machine can operate in different modes of parallelism. Another is a mixed-machine system, where a suite of different kinds of parallel machines are interconnected by high-speed links. To exploit such systems, a task must be decomposed into subtasks, where each subtask is computationally homogeneous. The subtasks are then assigned to and executed with the machines (or modes) that will result in a minimal overall execution time. Typically, users must specify this decomposition and assignment. One long-term pursuit in heterogeneous computing is to do this automatically. An overview of a conceptual model of what this involves is given. As an example of the research in this area, a genetic-algorithm-based approach to the subtask assignment and scheduling problem is explored. Open problems in heterogeneous computing are described.
Optimal Distributed Resource Allocation
Authors: Roman Ginis
Venue:  (1999)

We present and explore the problem of automatic distributed resource allocation for a large scale system operating on the basic principles of a free market economy. We model such environment as a resource allocation problem where the producers and consumers are numerous distributed entities controlled by different interests that trade resource time to achieve their goals and maximize their individual objective functions. A consumer specifies her problem in terms of a graph of resource types that describes temporal relationships between the resources. A resource type is expressed by a predicate that establishes the necessary properties that a resource needs to satisfy to be used in a solution. The consumer also specifies an objective function in terms of the resource type attributes, that needs to be maximized while searching for a solution. A feasible reservation on the part of a consumer, is a set of resources each of which satisfies the required constraints of its type and is available at such times as dictated by the temporal execution order specified by the graph. We present two polynomial-time algorithms for finding feasible and optimal reservation plans. We also introduce a method to perform a distributed atomic transaction to commence the reservation of the chosen resources. The transaction method is based oil the call-option financial instrument that is well suited for the problem. Finally we show how to use these algorithms to solve the problems in crisis management applications.
Cases, adverbs, situations and events
Authors: Paul Dekker
Venue:  (1996)

In this paper we discuss two approaches to adverbial quantification, the so-called `bound variable approach'' and the `situation-based approach'', and we address the suggestion that has been made in the literature that the latter reduces to the former as soon as the underlying structure of situations has been characterized at the required level of detail. We will first show what constraints on situation structures are needed in order for the situation-based approach to produce the results of the bound variable approach. Then we will argue that the required constraints are at odds with the philosophy underlying the situation based approach. This result points at a principled difference between the two approaches, and this, theoretical, difference can be used as a heuristic to find empirical support for any of the two approaches. 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
High Quality Pictorial Detail Acquisition and Patching on 3D Objects
Authors: Paolo Cignoni, Claudio Montani, Claudio Rocchini, Roberto Scopigno
Venue:  (1998)

In this paper we propose a new approach for the creation of highly realistic models of real free-form 3D objects. We propose the integration of different tech-niques (automatic 3D scanning, image processing, inverse texture-mapping and surface-based 3D graphics) into a coherent modeling system. The system starts from a 3D mesh (acquired with any of the available 3D scanning technologies) and improves this model with pictorial detail and, if required, high frequency shape de-tail. This added information is obtained by means of a small set of photographs of the object; these images are processed in order to: compute camera calibration and position, remove illumination effects to compute both diffuse reflectance proper-ties and a high resolution surface normal field, and finally to attach the acquired detail on the triangle mesh via standard texture mapping. In the very last phase, we integrate the images into a single texture map by blending the different images, and also detect mesh areas that are not covered by any image. In particular, a new approach is proposed to produce a smooth join between different images that maps on adjacent sections of the surface. This is done by applying an accurate piecewise local registration of the original images and by blending textures. For each mesh face which is on the adjacency border between different observed images, texture blending is operated by resampling a new texture patch obtained as a weighted blend of the corresponding adjacent images. Examples of the results obtained with sample Cultural Heritage objects are pre-sented and discussed. EMAIL:: r.scopigno@cnuce.cnr.it
Object Closure Conversion
Authors: Neal Glew
Venue:  (1999)

An integral part of implementing functional languages is closure conversion-the process of converting code with free variables into closed code and auxiliary data structures. Closure conversion has been extensively studied in this context, but also arises in languages with first-class objects. In fact, one variant of Java''s inner classes are an example of objects that need to be closure converted, and the transformation for converting these inner classes into Java Virtual Machine classes is an example of closure conversion. This paper argues that a direct formulation of object closure conversion is interesting and gives further insight into general closure conversion. It presents a formal closure-conversion translation for a second-order object language and proves it correct. The translation and proof generalise to other object-oriented languages, and the paper gives some examples to support this statement. Finally, the paper discusses the well known connection between function closures and single-method objects. This connection is formalised by showing that an encoding of functions into objects, object closure conversion, and various object encodings compose to give various closure-conversion translations for functions.
Balanced multi-level multi-way partitioning of analog integrated circuits for hierarchical symbolic analysis
Authors: Sheldon X.-D. Tan, C.-J. Richard Shi
Venue: Integration, the VLSI Journal (2003)

This paper considers the problem of partitioning analog integrated circuits for hierarchical symbolic analysis based on determinant decision diagrams (DDDs). The objective is to use DDDs with the minimum number of vertices to represent all the symbolic expressions. We show that the problem can be formulated as that of multi-level multi-way hyper graph partitioning with balance constraints, and be solved in two phases by connectivity-oriented initial clustering and iterative improvement. Our new contribution consists of a fast and effective heuristic for constructing a balanced initial partition, a potential gain formulae that can be computed efficiently, and a multiple-vertex moving strategy for relaxing and enforcing balance constraints. The proposed algorithm has been implemented and applied to symbolic analysis of several practical analog integrated circuits. Experimental results are described and compared to the contour tableau method of Sangiovanni-Vincentelli, Chen and Chua, and the SCAPP algorithm of Hassoun and Lin. The resulting hierarchical symbolic analyzer outperforms SPICE in numerical evaluations for a number of large analog circuits.
Office XP: Paso a Paso
Authors: Gonzalo Ferreyra Cortes
Venue:  (2002)

:Brinda un amplio panorama sobre las versiones Standard y Professional de Office 2002; encontrara descritas las funciones de cada una de las aplicaciones: Word, Excel, PowerPoint, Outlook y Access, asi como la manera de trabajar con ellas como conjunto. Un libro de consulta pero tambien de autoaprendizaje tanto para los que se inician, como para los usuarios que ya manejan versiones anteriores de Office, y quieren conocer la nueva tecnologia XP de Microsoft. 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
Modelling robot manipulators in a CAD environment using B-splines
Authors: C. G. Johnson, D. Marsh
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

A major aim of robotics research is the provision of systems which simplify the programming of robots, enabling experienced designers and engineers to implement robotic devices as part of a larger systems without the need to become expert programmers. Also in the quest for a flexible industrial production system is it desirable to be able to reprogram robots offline, so that they can be doing one task whilst being prepared for another. This paper describes the mathematical and computational background to a system which enables the development and testing of robot programs in a CAD environment in a way that is simple to use and compatible with existing methods used in CAD systems.
Investigating the use of analysis contracts to improve the testability of object-oriented code
Authors: L. C. Briand, Y. Labiche, H. Sun
Venue: Software&mdash;Practice Experience (2003)

A number of activities involved in testing software are known to be difficult and time consuming. Among them is the definition and coding of test oracles and the isolation of faults once failures have been detected. Through a thorough and rigorous empirical study, we investigate how the instrumentation of contracts could address both issues. Contracts are known to be a useful technique in specifying the precondition and postcondition of operations and class invariants, thus making the definition of object-oriented analysis or design elements more precise. It is one of the reasons the Object Constraint Language (OCL) was made part of the Unified Modeling Language. Our aim in this paper is to reuse and instrument contracts to ease testing. A thorough case study is run where we define OCL contracts, instrument them using a commercial tool and assess the benefits and limitations of doing so to support the automated detection of failures and the isolation of faults. As contracts can be defined at various levels of detail, we also investigate the cost and benefit of using contracts at different levels of precision. We then draw practical conclusions regarding the applicability of the approach and its limitations.
Simulating Fail-Stop in Asynchronous Distributed Systems
Authors: Laura S. Sabel, Keith Marzullo
Venue:  (1994)

The fail-stop failure model appears frequently in the distributed systems literature. However, in an asynchronous distributed system, the fail-stop model cannot be implemented. In particular, it is impossible to reliably detect crash failures in an asynchronous system. In this paper, we show that it is possible to specify and implement a failure model that is indistinguishable from the fail-stop model from the point of view of any process within an asynchronous system. We give necessary conditions for a failure model to be indistinguishable from the fail-stop model, and derive lower bounds on the amount of process replication needed to implement such a failure model. We present a simple one-round protocol for implementing one such failure model, which we call simulated fail-stop.
Practical Prefetching Via Data Compression
Authors: M K Curewitz, Krishnan,  P, S J Vitter
Venue:  (1994)

An important issue that affects response time performance in current OODB and hypertext systems is the I/O involved in moving objects from slow memory to cache. A promising way to tackle this problem is to use {\em prefetching}, in which we predict the user''s next page requests and get those pages into cache in the background. Current databases perform limited prefetching using techniques derived from older virtual memory systems. A novel idea of using data compression techniques for prefetching was recently advocated in by Vitter in Krishnan in which the prefetchers based on the Lempel-Ziv data compressor (the UNIX {\em compress\/} command) were shown theoretically to be optimal in the limit. In this paper we analyze the {\em practical\/} aspects of using data compression techniques for prefetching. We adapt three well-known data compressors to get three simple, deterministic, and universal prefetchers. We simulate our prefetchers on sequences of page accesses derived from the OO1 and OO7 benchmarks and from CAD applications, and demonstrate significant reductions in fault-rate. We examine the important issues of cache replacement, size of the data structure used by the prefetcher, and problems arising from bursts of ``fast'''' page requests (that leave virtually no time between adjacent requests for prefetching and book keeping). We conclude that prediction for prefetching based on data compression techniques holds great promise.
The cognitive coherence approach for agent communication pragmatics
Authors: Philippe Pasquier, Brahim Chaib-draa
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Different approaches have investigated the syntax and semantic of agent communication. However, all these approaches (including : agent communication languages, conversation policies and dialogue games) have not indicated how agents should dynamically use communications. In fact, most of these approaches have mainly focused on "structure" of dialogues even though developers are more interested in agents' capabilities of having "useful" conversations in respect to their goals rather than in their abilities to structure dialogues. This leads us to propose a theory of use of conversations between agents. This pragmatic theory extends and adapts the cognitive dissonance theory (a major theory of social psychology) to multi-agent systems. In this paper, we show how this theory allows us to provide generic conceptual tools for the automation of both agent communicational behavior and attitude change processes. The cognitive coherence that we propose is formulated in terms of constraints and elements of cognition and allows us to define cognitive incoherences and dialogue utility measures. We show how these measures could be used to solve common problems and answer some critical questions concerning agent communication frameworks use. Finally, the theory is illustrated with an example of dialogue games automatic use.