ppxscal/embedding_network huggingface dataset:
Computer aided stability analysis of gravity dams: CADAM
Authors: Martin Leclerc, Pierre Léger, René Tinawi
Venue: Advances in Engineering Software (2003)

This paper presents the main features and organisation of CADAM, a computer program, freely available, that has been developed for the static and seismic stability evaluations of concrete gravity dams. CADAM is based on the gravity method using rigid body equilibrium and beam theory to perform stress analyses, compute crack lengths, and safety factors. Seismic analyses could be done using either the pseudostatic or a simplified response spectrum method. CADAM is primarily designed to provide support for learning the principles of structural stability evaluation of gravity dams. It could also be used for research and development on stability of gravity dams. In adopting several different world-wide published dam safety guidelines, a large number of modelling options have been implemented. These include (i) crack initiation and propagation, (ii) effects of drainage and cracking under static, seismic, and post-seismic uplift pressure conditions, and (iii) safety evaluation procedures using deterministic, allowable stresses and limit states probabilistic analyses (Monte-Carlo simulations). Structural stability evaluation of a 30 m dam is presented to illustrate the use of CADAM.
Numerical simulation of textile-reinforced concrete structures
Authors: S. Holler, C. Butenweg, S.-Y. Noh, K. Meskouris
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The paper presents a numerical model for the simulation of the bearing behaviour of textile-reinforced concrete structures under static load taking into account the specific bond characteristics. For the numerical simulation an assumed strain finite element based on the Reissner-Mindlin shell theory for finite rotations is used. The developed numerical model for textile-reinforced concrete allows cost efficient calculations and quicker computer aided analyses. The model verification is carried out by numerical simulations of experiments on textile-reinforced tension bars and also by simulating four-point-bending tests of textile-reinforced beams with thin-walled cross-sections under various loads. A comparison between the results of the simulations and the test results is presented and discussed.
Secure Group Communication in Asynchronous Networks with Failures: Integration and Experiments
Authors: Yair Amir, Giuseppe Ateniese, Damian Hasse, Yongdae Kim, Cristina Nita-Rotaru, Theo Schlossnagle, John Schultz, Jonathan Stanton, Gene Tsudik
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

The increasing popularity and diversity of collaborative applications prompts a need for highly secure and reliable communication platforms for dynamic peer groups. Security mechanisms for such groups tend to be both expensive and complex and their integration with reliable group communication services presents a formidable challenge.This paper discusses some important integration issues, reports on our implementation experience and provides experimental results. Our approach utilizes distributed group key management developed by the Cliques project. We enhance it to handle processor and network faults (under a fail-stop or crash-and-recover model) and asynchronous membership events (such as joins, leaves, merges and network partitions). Our approach leverages the strong properties provided by the Spread group communication system, such as message ordering, clean failure semantics and a membership service. The result of this work is a secure group communications layer and an API that provide the application programmer with both standard group communication services and flexible security services.
A Classification of Multi-Sensory Metaphors for Understanding Abstract Data in a Virtual Environment
Venue: Proceedings of the International Conference on Information Visualisation (2000)

With the advent of Virtual Environment technology, it is now possible to construct new styles of user interfaces that provide multi-sensory interactions. For example, interfaces can be designed which utilize 3D visual spaces and provide auditory and haptic feedback. Many information spaces are multivariate, large and abstract in nature. It has been a goal of Virtual Environments to ¿widen the human to computer bandwidth¿ and so assist in the interpretation of these spaces by providing models that map different attributes of data to different senses. While this approach has the potential to assist in understanding these large information spaces, what is unclear is how to choose the best metaphors or models to define these mappings between the abstract information and the human sensory channels. This paper looks at some issues involved in choosing such multi-sensory metaphors, provides a classification of interactions and examines their application to the task of technical analysis of stock market data.
A Comparison of Term Value Measurements for Automatic Indexing
Authors: Gerard Salton
Venue:  (1975)

A number of automatic theories have been proposed over the last few years leading to the assignment of significance values to linguistic entities in accordance with their importance for purposes of content representation. Among these are methodologies based on decision theory, information theory, communication theory, vector space transformation and others. An attempt is made to compare these theories by exhibiting the formal frequency characteristics which underlie them. The effectiveness of the various approaches is also evaluated in experimental situations by using collections of documents in the areas of aerodynamics, medicine and world affairs.
Implicitly-multithreaded processors
Authors: Il Park, Babak Falsafi, T. N. Vijaykumar
Venue: ACM SIGARCH Computer Architecture News (2003)

This paper proposes the Implicitly-MultiThreaded (IMT) architecture to execute compiler-specified speculative threads on to a modified Simultaneous Multithreading pipeline. IMT reduces hardware complexity by relying on the compiler to select suitable thread spawning points and orchestrate inter-thread register communication. To enhance IMT's effectiveness, this paper proposes three novel microarchitectural mechanisms: (1) resource- and dependence-based fetch policy to fetch and execute suitable instructions, (2) context multiplexing to improve utilization and map as many threads to a single context as allowed by availability of resources, and (3) early threadinvocation to hide thread start-up overhead by overlapping one thread's invocation with other threads' execution.We use SPEC2K benchmarks and cycle-accurate simulation to show that an microarchitecture-optimized IMT improves performance on average by 24% and at best by 69% over an aggressive superscalar. We also compare IMT to two prior proposals, TME and DMT, for speculative threading on an SMT using hardware-extracted threads. Our best IMT design outperforms a comparable TME and DMT on average by 26% and 38% respectively.
A Network Co-processor-Based Approach to Scalable Media Streaming in Servers
Authors: Raj Krishnamurthy, Karsten Schwan, Richard West, Marcel-Catalin Rosu
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

This paper presents the embedded construction and experimental results for a media scheduler on i960 RD equipped I2O Network Interfaces (NI) used for streaming. We utilize the Distributed Virtual Communication Machine (DVCM) infrastructure developed by us, which allows run-time extensions to provide scheduling for streams that may require it. The scheduling overhead of such a scheduler is ¿ 65µs with the ability to stream MPEG video to remote clients at requested rates. Moreover, placement of scheduler action `close' to the network on the Network Interface (NI) allows tighter coupling of computation and communication, eliminating traffic from the host bus & memory subsystem, allowing increased host CPU utilization for other tasks without being affected by host-CPU loading. Architectures to build scalable media scheduling servers are explored - by distributing media; schedulers and media stream producers among NIs within a server and clustering a number of such servers using commodity hardware and software.
A note on the superposition of Markov point processes
Authors: Marie Lieshout
Venue:  (1999)

We show that independent superposition of Markov point processes with respect to the same neighbourhood relation preserves the Hammersley--Clifford factorisation up to second order. If the processes are identically distributed, the third order interaction structure is preserved as well. Finally, we prove that the superposition of standardised locally stable Markov point processes converges weakly to a Poisson process.
Combat Flight Simulator 3: Sybex Official Strategies and Secrets, 1 edition
Authors: Michael Rymaszewski
Venue:  (2002)

:Whether you fly for the USAAF, RAF, or Luftwaffe, this exclusive strategy guide will help you win the war and master the most realistic, exciting Combat Flight Sim game ever. Written with the full support of CFS 3's developers, this guide details every plane's flight characteristics, shows you how to become a great combat pilot and squadron leader, and gives you the strategies and tactics you need dominate the skies over Europe. Inside you'll find: Single-mission walkthroughs and campaign game advice In-depth combat tips for dogfights and surface-target attacks Winning strategies for cooperative and competitive multiplayer games Analysis of every flyable plane in the game Essential tactics for creating pilots and managing prestige points About the Author Michael Rymaszewski is an avid computer gamer and WWII aviation buff. He has written more than dozen strategy guides, including Microsoft Combat Flight Simulator 2: WWII Pacific Theater Sybex Official Strategies and Secrets.
Statistical Modeling for Circuit Simulation
Authors: Colin C. McAndrew
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

Robust, high yield IC design requires statisticalsimulation, and therefore statistical models. Simple"fast" and "slow" sets of model parameters are notsufficient to predict the manufacturing variations of allmeasures of circuit performance for arbitrary circuittopologies, device geometries, and biases. This paperdescribes an accurate and efficient approach to statisticalmodeling and characterization. The procedure is basedon physical process parameters, and explicitly accountsfor correlated and uncorrelated variations of statisticalparameters. The process is generic, and so is applicableto any type of device, and emphasizes the accuracy ofdevice electrical performance variation modeling, ratherthan model parameter variation modeling. This providesan accurate and simple way to model and simulate thestatistical variation of circuit electrical performances.
Questionable Relevancy of Fixed Priority Assignment in Distributed Object Design
Authors: K. H. (Kane) Kim
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

The following fundamental issues in establishing sound architectures for object-oriented (OO) real-time (RT) distributed computing systems (DCS's) are briefly discussed in this paper: (1) How much is the fixed priority assignment relevant to the activities of distributed object designers ? (2) Can the event-triggered architecture and the time-triggered architecture be combined into a unified architecture ? 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
Protocol architectures for delivering application specific quality of service
Authors: P. K. Jain, N. C. Hutchinson, S. T. Chanson
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

With the advent of high speed networks, the future communication environment is expected to comprise a variety of networks with widely varying characteristics. The next generation multimedia applications require transfer of a wide variety of data such as voice, video, graphics, and text which have widely varying access patterns such as interactive, bulk transfer, and real-time guarantees. Traditional protocol architectures have difficulty in supporting multimedia applications and high-speed networks because they are neither designed nor implemented for such a diverse communication environment. In this paper, we analyze the drawbacks of traditional protocol architectures and propose two alternative architectures for the next generation high-speed network environment: Direct Application Association and Integrated Layered Logical Multiplexing. We implement sample protocol stacks for each of the above models using the most widely used protocol stack (TCP/UDP-IP-Ethernet) in the context of the x-kernel. The performance of these protocol architectures is shown to be comparable to that of a traditional protocol architecture. They win by enabling the key requirements (Application specific Quality of Service) and optimizations (Integrated Layer Processing) necessary for future communication environments
Cognitive Packet Networks
Authors: Erol Gelenbe, Zhiguang Xu, Esin Seref
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

We propose packet switching networks in which intelligent capabilities for routing and flow control are concentrated in the packets, rather than in the nodes and protocols. Networks which contain Cognitive Packets (CP) will be called Cognitive Packet Networks. Cognitive packets route themselves. They are assigned goals before entering the network, and pursue these goals adaptively. They learn to avoid congestion and to avoid getting lost or being destroyed. Cognitive packets learn from their own observations about the network and from the experience of other packets with whom they exchange information via mailboxes. Cognitive packets rely minimally on routers, so that network nodes only serve as buffers, mailboxes and processors. Each cognitive packet starts with a given representation of the network from which it then progressively constructs its own Cognitive Map of network state and uses it to make routing decisions. Cognitive packets can belong to classes, so that a class of packets share the same goals, use similar sets of rules, and make use of each other's experience. This paper describes CPN and shows how learning techniques can support the intelligent behavior of Cognitive Packets. Simulation results illustrate the effectiveness of these ideas.
On the Centralizers of Monoids in Clone Theory
Authors: Hajime Machida, Iv G. Rosenberg
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

For a set S of functions of k-valued logic, the centralizer Sis the set of functions which permute' with all functions inS. As a continuation of our previous work we study thecentralizers for certain monoids consisting of unary functions.First we show that the centralizers of permutationgroups are distinct to each other, and then characterizethe centralizer of the alternating group. Next, for certainmonoids whose centralizer is the smallest clone Jk, westudy the centralizers of some of its proper submonoids. Inparticular, we report the existence of a considerably smallmonoid whose centralizer is Jk as well.
Applications of a New Space Partitioning Technique
Authors: K P Agarwal, Micha Sharir
Venue:  (1991)

\indent We present several applications of a recent space partitioning technique of Chazelle, Sharir and Welzl [13]. Our results include efficient algorithms for output-sensitive hidden surface removal, for ray shooting in two and three dimensions, and for constructing spanning trees with low stabbing number.
C++ Black Book
Authors: Steven Holzner
Venue:  (2002)

:Written to give the reader the knowledge to master C++, from the basics to the most advanced material and include a Windows programming primer. A complete C++ reference and designed to work with all C++ compilers, this book is more comprehensive than any other book on C++ available today. Technically accurate and up-to-date, this book is designed to remain current without substantial updates for years. Illustrated with at least one example for every topic covered making it easier to learn the programming language.
Addition Chains as Test Trees and a Sequential Variant as the Huffman Problem
Authors: Abrahams Julia
Venue:  (1999)

An addition chain can be interpreted as a test tree to identify a single distinguished item from a set of candidates. In this diagnostic problem, there is a constant cost associated with setting up a test, distinct tests distinguish between different size subsets of items, and all tests are set up in advance. If the tests are set up sequentially as needed and if a probability is assigned to each item of its being the single item sought by the testing procedure, the Huffman algorithm finds the optimal test tree in the sense of minimizing the average cost of setting up the tests used in the testing procedure. 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
Computational Chemistry Using the PC, 3 edition
Authors: Donald W. Rogers
Venue:  (2003)

:This book offers an introduction to computational chemistry, molecular orbital calculations and molecular mechanics. Hands-on problems in molecular mechanics, semi-empirical, ab initio and MO calculations are given. The need for a 2nd edition is dictated by the fast development of hardware and software over the past 3 years. It covers the great advances made in both hardware and software. A sophisticated background is not assumed in either mathematics or computer programming. Where needed, the mathematical substructure is built up gradually. The book includes a disk with about 50 complete projects and selected output files suitable for self- study.
PhotoShop 7 and Illustrator 10: Create Great Advanced Graphics, 1 edition
Authors: Dave Cross, Vicki Loader, Barry Huggins, Ian Tindale
Venue:  (2002)

:This book will show you how to combine the power of Photoshop 7 and Illustrator 10 to take your creative and production skills to new heights. Find out the best way to use them in tandem, with a seamless workflow, for stunning results in your print and web output. The book looks at how the programs work together to help you create great graphics with practical demonstrations of projects you are likely to encounter in your work. You'll learn advanced techniques for working with layer blending modes, the latest tools and new file formats such as SVG, along with color management, animation, printing, web-publishing, and integration with other programs. This book is not for Photoshop and Illustator novices - it's called 'Advanced' because it aims to take your basic skills to the next level and teach you how to create the finest graphics you find in the world around you. The book looks at how the programs can serve each other and you: Adobe has worked hard to make these two applications function more efficiently together - this book will help you to reap the rewards of their labor. The aim of this book is to show how Photoshop 7 and illustrator 10 can work together as part of a team; this means looking at their strengths and weaknesses and how they compliment one another. Part 1 is shorter than Part 2 and contains an analysis of each application; how each one performs certain tasks and where the crossover lies. Many functions can be acheived in both and there is a certain amount of personal choice involved - we evaluate the benefits of each one and which may be suited to certain tasks: we want you to find the right balance to maintain a long and happy marriage! In Part 2, we look at the practical applications of each one through a series of projects that detail step-by-step how they may be used in conjunction with each other. The tutorials are backed up with theory and additional information to help you make an informed choice when deciding the workflow that fits you best. We hope to help you make the best use of your skills and talents, so you can go further and achieve more... Author Biography:
Use of the process meta-model to describe requirements engineering
Authors: N. Kraiem
Venue: Proceedings of the Third IEEE International Conference on Engineering of Complex Computer Systems (1997)

Information System Engineering has made the assumption that an Information System is supposed to capture some excerpt of the real world history and hence has concentrated on modelling. Very little attention has been paid to the conceptual modeling process. However the emphasis on system modelling is shifting to process modeling. The particular Requirements Engineering (RE) process modelling approach being presented in this paper advocates the capture of the history of RE artifacts. In this paper, we present an approach for defining a way of working providing guidelines for the development of information systems. This way of working is defined as an instance of the NATURE meta-model. Therefore, it consists in the execution of different types of related contexts, namely, a choice based context, followed by some plan or executive based contexts, depending on the decisions made. We propose to view the process of modelling domain knowledge as a decision based process, as suggested by the process theory developed at the University of Paris Sorbonne.
How to prove that a preconditioner cannot be superlinear
Authors: S. Serra Capizzano, E. Tyrtyshnikov
Venue: Mathematics of Computation (2003)

In the general case of multilevel Toeplitz matrices, we recently proved that any multilevel circulant preconditioner is not superlinear (a cluster it may provide cannot be proper). The proof was based on the concept of quasi-equimodular matrices, although this concept does not apply, for example, to the sine-transform matrices. In this paper, with a new concept of partially equimodular matrices, we cover all trigonometric matrix algebras widely used in the literature. We propose a technique for proving the nonsuperlinearity of certain frequently used preconditioners for some representative sample multilevel matrices. At the same time, we show that these preconditioners are, in a certain sense, the best among the sublinear preconditioners (with only a general cluster) for multilevel Toeplitz matrices.
Building Topology-Aware Overlays Using Global Soft-State
Authors: Zhichen Xu, Chunqiang Tang, Zheng Zhang
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Distributed hash table (DHT) based overlay networks offer anadministration-free and fault-tolerant storage space that maps"keys" to "values". For these systems to function efficiently,their structures must fit that of the underlying network. Existingtechniques for discovering network proximity information, suchas landmark clustering and expanding-ring search are eitherinaccurate or expensive. The lack of global proximity informationin overlay construction and maintenance can result in badproximity approximation or excessive communication.To address these problems, we propose the following: (1)Combining landmark clustering and round-trip time (RTT) measurementsto generate proximity information, achieving both efficiencyand accuracy. (2) Controlled placement of globalproximity information on the system itself as soft-state, such thatnodes can independently access relevant information efficiently.(3) Publish/subscribe functionality that allows nodes to subscribeto the relevant soft-state and get notified as the state changesnecessitate overlay restructuring.