ppxscal/embedding_network huggingface dataset:
The effect of changing environmental conditions on behaviour of glulam beams
Authors: S. Srpčič, J. Srpčič, M. Saje, G. Turk
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The paper deals with the mechanical analysis of glulam beams in changing climatic conditions. The computational part of the paper includes two separate numerical procedures. First, the diffusion equation is solved in order to determine the temporal and spatial distribution of water content in the cross-section of the beam subjected to the changing environmental humidity. The results of the first computational stage are used as the input data for the second part of the numerical analysis, in which the mechanical response of the beam is assessed. Finite element method with highly accurate non-linear beam element is employed. The displacements and strains as well as stress distribution in the mid-span cross-section are presented. In the article some measured values of vertical displacements in the middle of span are shown, too.
Implementation and Experimentation of IP Rate Control
Authors: M. Biggs, M. Hassan, J. Breen
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

This paper reports implementation and experimentation of a new IP rate control protocol proposed to alleviate congestion in the gateway of a LAN connected to external networks. Congestion is avoided by using explicit rate notification to LAN hosts via new ICMP control messages. In addition to avoiding congestion, the protocol also allows for greater fairness and priority in network traffic, while having no impact on traffic outside the local network. The implementation of the IP rate control protocol in a Linux platform is described followed by the experiments conducted at the network laboratory of Monash University. Experimental results show that IP rate control can be very effective in controlling congestion at the LAN gateway by controlling host transmission rates. IP rate control reduces queuing delay and packet loss rate at the LAN gateway.
A Security Architecture for Mobile Agents in Ajanta
Authors: Neeran M. Karnik, Anand R. Tripathi
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

A mobile agent represents a computation that can autonomously migrate in a network to perform tasks on behalf of its creator. This paper describes the security architecture of Ajanta, a Java-based system for mobile agent programming. This architecture provides mechanisms to protect server resources from malicious agents, agent data from tampering by malicious servers, and to protect the system infrastructure itself. An agent can carry three kinds of protected data: read-only objects, objects visible only to specific servers, and a secure append-only list of objects. Agents' access to server resources is controlled using a proxy-based mechanism. A generic authentication protocol is used for all sensitive client-server interactions. Ajanta also supports communication between remote agents using RMI, which can be controlled by the servers' security policies.
Virtual Lego: The Official LDraw.org Guide to LDraw Tools for Windows
Authors: Tim Courtney, Steve Bliss, Ahui Herrera
Venue:  (2003)

:Virtual LEGO introduces the reader to a suite of software that allows users to create and document computer-generated LEGO models. Written by maintainers of LDraw.org (the official hub of LEGO model-building software), the book includes coverage of popular freeware tools such as LDraw, MLCAD, L3P, L3PAO, LPub, POV-Ray, and MegaPOV. The CDROM contains all the software readers need to get started, all available LEGO parts models, and templates for building instruction layouts.
Publishing Formal Mathematics on the Web
Authors: Pavel Naumov
Venue:  (1998)

Paper describes the design of the Nuprl Web Publisher an automated tool for converting formal, computer-generated, mathematical texts into a set of hyper-linked HTML pages that preserves original, non-linear, text structure. The current version of the Web Publisher, also developed by the author, provides access to term structure of the displayed formulas and links to definitions of abstractions used in these formulas.
A Strictly-Optimal Strategy to Access Multi-Dimensional Data on Parallel Disk Systems
Authors: Sajal K. Das, M. Cristina Pinotti
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

The disk allocation problem addresses the issue of how to distribute large files among several disks so as to maximize the concurrent disk accesses in response to partial match queries. In the past this problem has been studied for binary as well as for p-ary cartesian product files.In this paper, we propose a strictly-optimal disk allocation strategy for non-uniform cartesian product files for every partial match query. Our strategy is based on a large and flexible class of maximum distance separable (MDS) codes, namely the redundant residue codes. A new family of residue codes, called the redundant non-pairwise prime residue codes, is also introduced.
Computers, Art and Smart Rooms: A Smart Picture Frame that Senses the Weather and Genetically Evolves Images
Authors: Marisa E. Kolodny
Venue:  (1999)

By using sensors to sense the environment and genetic programming to evolve images, this thesis explores two methods for developing smart pictures that can be integrated with a living space. The system presented senses the weather and indoor conditions, displays current weather and forecast information retrieved from the web, and displays genetically evolved images. Sensing the weather not only provides the user with information they might find useful, but also allows the computer to gain a better understanding of the user which in turn allows the computer to respond more accurately. Genetic programming allows the computer to better respond to its environment by evolving fitter programs. 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
Evaluation of a Semi-Static Approach to Mapping Dynamic Iterative Tasks onto Heterogeneous Computing Systems
Authors: Yu-Kwong Kwok, Anthony A. Maciejewski, Howard Jay Siegel, Arif Ghafoor, Ishfaq Ahmad
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

To minimize the execution time of an iterative application in a heterogeneous parallel computing environment, an appropriate mapping scheme is needed for matching and scheduling the subtasks of the application onto the processors. When some of the characteristics of the application subtasks are unknown a priori and will change from iteration to iteration during execution-time, a semi-static methodology can be employed, that starts with an initial mapping but dynamically decides whether to perform a remapping between iterations of the application, by observing the effects of these dynamic parameters on the application?s execution time. The objective of this study is to implement and evaluate such a semi-static methodology. For analyzing the effectiveness of the proposed scheme, it is compared with two extreme approaches: a completely dynamic approach using a fast mapping heuristic and an ideal approach that uses a genetic algorithm on-line but ignores the time for remapping. Experimental results indicate that the semi-static approach outperforms the dynamic approach and is reasonably close to the ideal but infeasible approach.
Architectural Repair of Open Source Software
Authors: John B. Tran, Michael W. Godfrey, Eric H. S. Lee, Richard C. Holt
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

As a software system evolves, its architecture will drift. System changes are often done without considering their effects on the system structure. These changes often introduce structural anomalies between the concrete (as-built) and the conceptual (as-designed) architecture, which can impede program understanding. The problem of architectural drift is especially pronounced in open source systems, where many developers work in isolation on distinct features with little co-ordination. In this paper, we present our experiences with repairing the architectures of two large open source systems (the Linux operating system kernel and the VIM text editor) to aid program understanding. For both systems, we were successful in removing many structural anomalies from their architectures.
Archeoguide: System Architecture of a Mobile Outdoor Augmented Reality System
Authors: Patrick Dähne, John N. Karigiannis
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

We present the system architecture of a mobile outdoor augmented reality system for the Archeoguide project. We begin with a short introduction to the project. Then we present the hardware we chose for the mobile system and we describe the system architecture we designed for the software implementation. We conclude this paper with the first results obtained from experiments we made during our trials at ancient Olympia in Greece.
Hamiltonian decompositions of Cayley graphs on abelian groups of even order
Authors: Jiuqiang Liu
Venue: Journal of Combinatorial Theory Series B (2003)

Alspach conjectured that any 2k-regular connected Cayley graph cay(A,S) on a finite abelian group A can be decomposed into k hamiltonian cycles. In 1992, the author proved that the conjecture holds if S = {s1, s2, ..., sk} is a minimal generating set of an abelian group A of odd order. Here we prove an analogous result for abelian group of even order: If A is a finite abelian group of even order at least 4 and S = {s1, s2, ..., sk} is a strongly minimal generating set (i.e., 2si ∉ 〈S - {si}〉 for each 1≤i≤k) of A, then cay(A,S) can be decomposed into hamiltonian cycles.
Smoothing and Prefetching Video from Distributed Servers
Authors: Spiridon Bakiras, Victor O. K. Li
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

Video prefetching has been proposed recently for the transmission of variable-bit-rate (VBR) video over a packet-switched network. The objective of these protocols is to prefetch future frames to be stored at the customer's set-top box (STB) in periods of low link utilization. Experimental results have shown that video prefetching is very effective and it achieves much higher network utilization (i.e. larger number of simultaneous connections) than the traditional video smoothing schemes. Video prefetching, however, can only be efficiently implemented when there is one centralized server that serves the different customers over a common link.In a distributed environment there is a large degradation in its performance. In this paper we introduce a new scheme that utilizes smoothing along with prefetching, to overcome the problem of distributed prefetching. We will show that our scheme performs almost as well as the centralized prefetching protocol even though it is implemented in a distributed environment.
Finite element analysis of damaged multilayered composite beams with transverse deformability
Authors: M. Di Sciuva, M. Gherlone
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

A third-order Hermitian zig-zag plate theory is presented as development of the classical cubic zig-zag one. In addition to the capabilities of the previous model ((i) transverse shear flexibility, (ii) through-the-thickness continuity of the transverse shear stresses, (iii) traction-free condition on the two external surfaces of the laminate and (iv) possibility to study damaged interfaces), the Hermitian model offers interesting improvements ((i) through-the-thickness linear transverse displacement, (ii) transverse normal deformability, (iii) traction equilibrium condition on the external surfaces and (iv) use of the displacements and transverse shear stresses of the external surfaces as degrees of freedom). The Hermitian zig-zag theory, together with the application of the sublaminates approach, can also be used to obtain more detailed local through-the-thickness distributions of transverse normal and shear quantities. At first a beam finite element based on the Hermitian model has been formulated. Then a discretizing and assembling procedure has been used that enables to divide the laminate thickness in a number of elements-sublaminates. A numerical assessment of the method potentialities is presented.
Improved Implementations of the Speculative Memory Access Mechanism specMEM
Authors: Hiroshi Nakashima, Takayuki Sato, Haruyuki Matsuo, Kazuhiko Ohno
Venue: Proceedings of the 1999 International Workshop on Innovative Architecture (1999)

In order to reduce the overhead of synchronizing operations of shared memory multiprocessors, we proposed a mechanism, named specMEM, to execute memory accesses following a synchronizing operation speculatively before the completion of the synchronization is confirmed [4]. A unique feature of our mechanism is that the detection of speculation failure and the restoration of computational state on the failure are implemented by a small extension of coherent cache. It is also remarkable that operations for speculation on its success and failure are performed in a constant time for each independent of the number of speculative accesses. Although we reported in [4] that specMEM achieves significant execution time reduction, for example 13 % for LU decomposition, we also observed that it may be implemented more efficiently. This paper discusses about more efficient implementations of specMEM with an extra cache state and/or a non-speculative secondary cache.
Authorization Schemes for Large-Scale Systems Based on Java, CORBA and Web Security Models
Authors: Carla Merkle Westphall, Joni da Silva Fraga
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

This paper presents an authorization scheme for large-scale networks that involves programming models and tools represented by Web, Java and CORBA. The authorization scheme is based on structures and concepts introduced in Web, Java and CORBA for security. A discretionary prototype is presented here, where the solutions adopted involving a concrete scheme are discussed. This scheme was developed in order to simplify authorization policy implementation in these systems. These policies are based on well-known literature security models as the Access Matrix Model. These security models are adapted in order to elaborate a feasible and practical authorization scheme in which it is easy to define policies to be followed in large-scale distributed systems.
Macromedia Fireworks MX Fast & Easy Web Development
Authors: Yesh Singhal
Venue:  (2002)

:Create professional Web graphics with Macromedia Fireworks MX Fast & Easy Web Development! To take advantage of everything Fireworks has to offer, you need this easy to follow guide that gets you up and running quickly. Filled with easy-to-understand instructions and hundreds of actual screen shots, the visual format of this book is perfect for beginner, as well as the intermediate user, learning this popular graphics product.
Dynamic Light-Weight Groups
Authors: Katherine Guo, Lu Rodrigues
Venue:  (1996)

The virtual synchrony model for group communication has proven to be a powerful paradigm for building distributed applications. In applications that require the use of a large number of groups, significant performance gains can be attained if these groups share the resources required to provide virtual synchrony. A service that maps user groups onto instances of a virtually synchronous implementation is called a Light-Weight Group Service. This paper discusses the usage of Light-Weight Group protocols in dynamic environments, where mappings cannot be defined a priori and may change over time. We show that it is possible to establish mappings that promote sharing and, at the same time, minimize interference. These mappings can be established in an automated manner, using heuristics applied locally at each node. Experiments using an implementation in the Horus system show that significant performance improvements can be achieved with this approach.
Signal Processing Computations Using the Genralized Singular Value Decomposition
Authors: J. M. Speiser, Charles Van Loan
Venue:  (1984)

The ordinary Singular Value Decomposition (SVD) is widely used in statistical and signal processing computation, both for the insight it provides into the structure of a linear operator, and as a technique for reducing the computational word length required for least-squares solutions and certain Hermitian eigensystem decompositions by roughly a factor of two, via computing directly on a data matrix, rather than on the corresponding estimated correlation or covariance matrix. Although the SVD has long been utilized as a method of off-line or non-real-time computation, parallel computing architectures for its implementation in near real time have begun to emerge. The Generalized Singular Value Decomposition (GSVD) bears the same relationship to the computation of certain Hermitian generalized eigensystem decompositions that the ordinary SVD bears to the corresponding ordinary eigensystem decompositions. This paper discusses methods for computing the GSVD via a sequence of more familiar computations and indicates the relation of the GSVD to the MUSIC algorithm of R. Schmidt.
A Tensor Product Action on q-Clan Generalized Quadrangles with $q=2^e$
Authors: Stan E. Payne
Venue:  (1994)

The Fundamental theorem of q-clan geometry implies (among other things) that all automorphisms of the generalized quadrangle GQ(C) of order (q^2,q) associated with a q-clan C which fix a special pair of points are automorphisms of the elation group of the quadrangle. When q=2^e, with a slight modification of the usual representation, we describe these automorphisms in terms of tensor products of pairs of matrices in GL(2,q). The resulting efficiency in computation allows a simplified description of the automorphisms of GQ(C). We apply the general theory to give an improved description of the induced stabilizers of the ovals in PG(2,q) that are associated with the new Subiaco q-clans introduced and studied in [2], [7], [1] and [8].
The Adobe Photoshop 7 Wow! Book
Authors: Jack Davis, Linnea Dayton
Venue:  (2003)

:Tips and techniques for real-world commercial projects with clear step-by-step instructions for enhancing and restoring photos, combining images, painting, customizing clip art, and creating special effects for type and graphics, as well as interactivity, animation, and optimizing for the Web. The foundational info you need about Photoshop's tools and operations, including the Healing Brush and Patch Tools, Natural Media Brush Engine, Layer Styles, Shape Layers, Vector Masks, improved Liquify and Pattern Maker filters, and ImageReady's automated Rollover Styles.
Exact Monte Carlo for Few-Electron Systems
Authors: Shiwei Zhang, Malvin H. Kalos
Venue:  (1991)

We have constructed an exact and stable algorithm for few-electron systems, with which we have determined the energies of an excited state of the He atom and of the ground state of the Li atom. Significant features of the new method include the following: There are equal populations of random walkers that carry positive and negative weights. The positions of walkers are selected from a distribution that couples all walkers using a Green''s function with a known form. The correct importance functions that take into account the global interactions of the populations are different for positive and negative walkers. This symmetry breaking is an essential element for long-term stability. A novel transformation of the potential energy facilitates the exact evaluation of the energy E.
Deliberation Scheduling for Time-Critical Scheduling in Stochastic Domains
Authors: Lloyd Greenwald, Thomas Dean
Venue:  (1994)

In this work we explore the use of deliberation scheduling for allocating computation among competing decision procedures in solving time-critical scheduling problems in stochastic domains. We present a two-level deliberation scheduling solution. At the higher level deliberation scheduling is used to partition infinite horizon scheduling problems temporally and sequence and allot computation time among the resulting problem instances. At the lower level deliberation scheduling is used to combine phases of a decision procedure for solving each problem instance. Our approach extends the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. We borrow from operations research in applying bottleneck-centered scheduling heuristics to improve initial policies and make use of Monte Carlo simulation for selectively constructing partial policies in large state spaces. Additionally, we employ a variant of Drummond''s situated control rules to constrain the space of possible actions.
Fault-Tolerant Broadcasts
Authors: Fred B. Schneider, David Gries, Richard D. Schlichting
Venue:  (1982)

A distributed program is presented that ensures delivery of a message to the functioning processors in a computer network, despite the fact that processors may fail at any time. All processor failures are assumedd to be detected and to result in halting the offending processor. A reliable communications network is assumed.
Modular Compilers Based on Monad Transformers
Authors: William L. Harrison, Samuel N. Kamin
Venue: Proceedings of the 1998 International Conference on Computer Languages (1998)

The monadic style of language specification has the advantages of modularity and extensibility: it is simple to add or change features in an interpreter to reflect modifications in the source language. It has proven difficult to extend the method to compilation. We demonstrate that by introducing machine-like stores (code and data) into the monadic semantics and then partially evaluating the resulting semantic expressions, we can achieve many of the same advantages for a compiler as for an interpreter. A number of language constructs and features are compiled: expressions, CBV and CBN evaluation of lambda-expressions, dynamic scoping, and various imperative features. The treatment of recursive procedures is outlined as well. The resulting method allows compilers to be constructed in a mix-and-match fashion just as in a monad-structured interpreter.
Prediction of collapse potential via artificial neural networks
Authors: G. Habibagahi, M. Taherian
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

Collapse defined as the additional deformation of compacted soils when wetted is believed to be responsible for damage to the buildings resting on compacted fills as well as failure in embankments and earth dams. In this paper, three different types of neural networks, namely, conventional back-propagation neural network (BPNN), recurrent neural network (RNN), and generalized neural network (GRNN) are employed as computational tools to predict the amount of collapse and to investigate the influence of various parameters on the collapse potential. To arrive at this goal, 192 series of single oedometer test were carried out on three soils with different initial conditions and inundated at different applied pressures. The test results were used to prepare the necessary database for training the neural network. Similar test results available in literature were also included in the database to arrive at a total of 330 sets of data. Comparison of the network prediction for collapse potential with some available models shows the superiority of the network in terms of the accuracy of prediction. Moreover, relative importance of different factors on the collapse potential was assessed. Based on the neural network analysis, initial dry unit weight was found to be the most important factor influencing collapse potential.