ppxscal/embedding_network huggingface dataset:
A unified formulation for multilayered plate elements based on PVD and RMVT
Authors: E. Carrera
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper presents a unified formulation of classical and refined finite, plate elements for bending and vibrations analysis of layered composites structures. Classical formulation which are based on displacement assumptions and Principle of Virtual Displacement (PVD) applications, are compared to advanced mixed elements which are formulated on the basis of Reissner's Mixed Variational Theorem (RMVT). Finite elements which preserve the independence of the number of the independent variables from the numbers of the Ni-layers (Equivalent Single Layer Models) as well as those elements in which the number of the unknown variables remains Ni-dependent (Layer Wise Models) are both considered. Linear up-to-fourth order expansions in the thickness direction are treated for the unknown stress and displacement variables. Extensive use of indicial notations has been made. As a results finite element matrices have been all written in terms of a few fundamental nuclei which have only 9 terms. Some results have been proposed to assess and compare the implemented elements. It is shown that the a priori fulfillment of the interlaminar continuity for transverse stresses makes mixed models more attractive than other available models that violate such a continuity.
NRMI: Natural and Efficient Middleware
Authors: Eli Tilevich, Yannis Smaragdakis
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

We present NRMI: a drop-in replacement of Java RMI thatoffers call-by-copy-restore semantics for arbitrary linkeddata structures, in addition to regular call-by-copy semantics.Call-by-copy-restore middleware is more natural touse than traditional call-by-copy RPC mechanisms,enabling distributed calls to behave much like local calls.We discuss in depth the effect of calling semantics for middleware,describe how call-by-copy-restore can be implementedefficiently, and show examples of Java programswhere NRMI is more convenient than regular Java RMI.
Evolution of ultrasimple virtual robots
Authors: D. Ashlock, J. Walker, J. Oliver
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

A genetic algorithm is presented to design virtual robots that perform a variety of different tasks. In all cases the robots are attempt to locate radiative sources. The fitness heuristic, number of sources, and boundary types of the world are varied. In all cases the genetic algorithm produced working designs. Designs are significantly specialized for the varied environments.
An Analysis of the Total Least Squares Problem
Authors: Gene H. Golub, Charles Van Loan
Venue:  (1980)

Totla least squares (TLS) is a method of fitting that is appropriate when there are errors in both the observation vector $b (mxl)$ and in the data matrix $A (mxn)$. The technique has been discussed by several authors and amounts to fitting a "best" subspace to the points $(a^{T}_{i},b_{i}), i=1,\ldots,m,$ where $a^{T}_{i}$ is the $i$-th row of $A$. In this paper a singular value decomposition analysis of the TLS problem is presented. The sensitivity of the TLS problem as well as its relationship to ordinary least squares regression is explored. Aan algorithm for solving the TLS problem is proposed that utilizes the singular value decomposition and which provides a measure of the underlying problem''s sensitivity.
Analyzing Testability on Data Flow Designs
Authors: Yves Le Traon, Farid Ouabdesselam, Chantal Robach
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

High testability is a strongly desired feature of software since it tends to make the validation phase more efficient in exposing faults during testing, and consequently it increases the quality of the end product. Furthermore, testability is a criterion of crucial importance to software developers since the sooner it can be estimated, the better the software architecture will be organized to improve subsequent maintenance. This paper is concerned with the testability of data flow software designs, its definition and the axiomatization of its expected behavior. This behavior is expressed in relation to basic operations applicable on designs, and to the dedicated test strategies, which are selected. Measurements are proposed which are consistent with the stated axioms. The whole approach is demonstrated using design specifications of embedded software developed in the avionics industry.
Automatic generation of links between heterogeneous genomic databases
Authors: F. Achard, P. Dessen
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

Our goal was to study the feasibility of a system to create links between heterogeneous genomic databases. We developed a test program to build up relationships between the Genome Data Base and the Genetic Sequence Data Bank. We analyzed keywords, probes and cytogenetic locations extracted from both banks to create a network of links. The activation of the network generates new linkage data between those banks. Considering the quantity of new links created (over 50000), we could not make an exhaustive analysis of the results but the tests we performed make us think that our links are accurate. However, we also noticed that the system lacks some sensitivity, mainly due to the use of biological abbreviations or synonyms. Therefore, we propose as a conclusion some ways of enhancing the retrieval efficiency of our system.
Optimizing communication for array operations on message-passing multicomputers
Authors: A. Eberhart
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

Whole array operations and array section operations are important features of many data-parallel languages. Efficient implementation of these operations on distributed-memory multicomputers is critical to the scalability and high-performance of data-parallel programs. We present an approach for analyzing communication patterns induced by array operations and for scheduling message flow based on the information. Our scheduling algorithm guarantees contention-free data transfer and utilizes network resources optimally. It incurs little overhead and is suitable to be used in compilers and in runtime libraries. We also present simulation results that demonstrate the algorithm's superiority to the asynchronous transfer mode that is commonly used for this type of communication.
Multi-Agent Technology for Planning, Scheduling, and Resource Allocation
Authors: V. Gorodetski, A. Lebedev
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

A large number of hot applications are reducible to combinatorial models. Almost all of them are at least NP - hard and cannot be solved in a traditional way. In the paper, we consider an agent -based approach to solve a set of planning and scheduling applications under real time and temporal constraints. The problem is formalized as a contract allocation task over a set of companies and specified as an auction-based competition of agents managed by a meta-agent. The paper contributions are multi-agent system architecture; knowledge-based specification of real time and temporal constraints; and knowledge-based auction management model.
Opportunity Cost Algorithms for Combinatorial Auctions
Authors: Akcoglu Karhan, Aspnes James, DasGupta Bhaskar, Ming-Yang
Venue:  (2000)

Two general algorithms based on opportunity costs are given for approximating a revenue-maximizing set of bids an auctioneer should accept, in a combinatorial auction in which each bidder offers a price for some subset of the available goods and the auctioneer can only accept non-intersecting bids. Since this problem is difficult even to approximate in general, the algorithms are most useful when the bids are restricted to be connected node subsets of an underlying object graph that represents which objects are relevant to each other. The approximation ratios of the algorithms depend on structural properties of this graph and are small constants for many interesting families of object graphs. The running times of the algorithms are linear in the size of the bid graph, which describes the conflicts between bids. Extensions of the algorithms allow for efficient processing of additional constraints, such as budget constraints that associate bids with particular bidders and limit how many bids from a particular bidder can be accepted.
The Conservativeness of Reliability Estimates Based on Instantaneous Coverage
Authors: John McGough, Mark Smotherman, Kishor Trivedi
Venue:  (1985)

In order to remain tractable, many reliability models do not include the states and transitions necessary to represent fault/error-handling details. Instead, the effectiveness of fault/error-handling mechanisms is represented by the use of instantaneous coverage probabilities. This paper investigates the effect of the error introduced by the assumption of instantaneous coverage probabilities on the predictions of the reliability model, and it shows that the reliability estimates thus obtained are lower bounds on the reliability estimates of the composite model with embedded fault/error-handling states and transitions. The paper also discusses the choice of the calculation method for the instantaneous coverage probabilities and defines a near-coincident-fault coverage model that yields conservative instantaneous coverage probabilities.
A transition system semantics for the control-driven coordination language MANIFOLD
Authors: Marcello M. Bonsangue, Farhad Arbab, J. W. Bakker, J. J.M.M. Rutten, A. Scutella, G. Zavattaro
Venue:  (1998)

Coordination languages are a new class of parallel programming languages which manage the interactions among concurrent programs. Basically, coordination is achieved either by manipulating data values shared among all active processes or by dynamically evolving the interconnections among the processes as a consequence of observations of their state changes. The latter, also called control-driven coordination, is supported by MANIFOLD. We present the formal semantics of a kernel of MANIFOLD, based on a two-level transition system model: the first level is used to specify the ideal behavior of each single component in a MANIFOLD system, whereas the second level captures their interactions. Although we apply our two-level model in this paper to define the semantics of a control-oriented coordination language, this approach is useful for the formal studies of other coordination models and languages as well.
Properties of Independent Components of Self-Motion Optical Flow
Authors: Marwan A. Jabri, Ki-Young Park, Soo-Young Lee, Terrence J. Sejnowski
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

In this paper, we describe the properties of independent components of optical flow of moving objects. Video sequences of objects seen by an observer moving at various angles, directions and distances are used to produce optical flow maps. These maps are then processed using independent component analysis, which yields filters that resemble the receptive fields of dorsal medial superior temporal cells of the primate brain. Contraction, expansion, rotation and translation receptive fields have been identified. Our results support Barlow's sensory coding theory and are in-line with other work on independent components of image and video intensities.
Object-Oriented Modeling and Automated Analysis of a Telemedicine Application
Authors: Laura A. Campbell y, Betty H. C. Cheng
Venue: Proceedings of the 10th International Workshop on Software Specification and Design (2000)

As the impact of and demand for software increases, there is greater need for rigorous software development techniques that can be used by a typical software engineer. We have added formal syntax and semantics definitions to an existing object-oriented modeling notation in order to integrate informal and formal approaches to software development. This formalization enables developers to construct object-oriented models of requirements and designs and then automatically generate formal specifications for the diagrams. These formal specifications enable the diagrams to be analyzed by a number of existing automated reasoning utilities, including behavior simulators, model checkers, and rewriting systems.
Streaming Media Demystified
Authors: Michael Topic
Venue:  (2002)

:With uncommon skill, Michael Topic's excellent guide takes you inside today's essential killer app. More than just an implementation guide -- though it certainly is that, packed with needed data on the latest formats and standards -- Streaming Media Demystified offers a complete picture of the application that will soon threaten television's dominance as the primary transmitter of video. With future potential bigger than television, streaming video over the Internet is the essential application for broadband and 3G. This book takes you inside a billion-dollar technology. 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 evolving multi agent system for meteorological alerts
Authors: Sandy Dance, Malcolm Gorman, Lin Padgham, Michael Winikoff
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

The Australian Bureau of Meteorology has a requirement for complex and evolving systems to manage its weather forecasting, monitoring and alerts. This paper describes an agent-based system that monitors in real time the current terminal area forecasts (forecasts for areas around airports) and alerts forecasters to inconsistencies between these and observations obtained from automatic weather station data.
Alignment scores in a regularized support vector classification method for fold recognition of remote protein families
Authors: Mottl Vadim, Dvoenko Sergey, Seredin Oleg, Kulikowski Casimir, Muchnik Ilya
Venue:  (2001)

One of fundamental principles of molecular biology says that the primary structure of a protein, i.e. sequence of amino acid residues forming its polypeptide chain, carries an essential amount of information for unambiguous establishing its spatial structure. Despite the fact that each protein has its own spatial structure, it is typical phenomenon that the fold pattern remains basically the same within large groups of evolutionarily allied proteins, so that the "number" of essentially different spatial structures is much less than that of known proteins. Since spatial structures are classified in that or other manner, the estimation of the spatial structure of a given protein reduces to its allocating over a finite set of classes, i.e. the problem falls into the competence area of pattern recognition. The traditional methodology of pattern recognition presupposes that the object whose class-membership is to be recognized is represented by vector of some numerical features and is considered as a point in the respective linear vector space. However, the actual diversity of amino acid properties that may play an important part in forming the spatial structure of a protein is so immensely rich, that the choice of suitable numerical properties makes a special problem which is the key one here. We consider here an alternative featureless approach to recognition of spatial structure of proteins. It is proposed to judge about the membership of a protein in one of the classes of spatial structures immediately on the basis of measuring the proximity of its amino acid chain to those of some other proteins whose spatial structure is known. To infer the decision rule of recognition from a training sample of proteins of known structure, we apply the traditional support vector method of machine learning on the basis of treating amino acid chains as elements of a Hilbert space, i.e. linear space with inner product, in what role the pairwise alignment scores are used. The inevitable difficulty of the small size of training samples is overcome by a special regularization technique that makes use of some available a priori information on the sought-for decision rule. The proposed approach to the problem of fold class recognition illustrated by results of processing a collection of 396 mutually distant protein domains of 51 fold classes chosen from the SCOP database.
Proceedings of the 18th Real-Time Systems Symposium WIP Session
Authors: Azer Bestavros
Venue:  (1997)

Abstract This technical report includes 10 short papers presented during the WIP session of the 18th Real-Time Systems Symposium, held in Washington DC on December 3-5, 1997. The title and authors are included below. ------ (1) CPU Reservations and Time Constraints: Efficient, Predictable Scheduling of Independent Activities Michael B. Jones, Microsoft Research, Microsoft Corporation Daniela Rosu and Marcel-Catalin Rosu, Georgia Institute of Technology Abstract: Workstations and personal computers are increasingly being used for applications with real-time characteristics such as speech understanding and synthesis, media computations and I/O, and animation, often concurrently executed with traditional non-real-time workloads. This paper presents a system that can schedule multiple independent activities so that: - activities can obtain minimum guaranteed execution rates with application-specified reservation granularities via CPU Reservations, - CPU Reservations, which are of the form "reserve X units of time out of every Y units", provide not just an average case execution rate of X/Y over long periods of time, but the stronger guarantee that from any instant of time, by Y time units later, the activity will have executed for at least X time units, - applications can use Time Constraints to schedule tasks by deadlines, with on-time completion guaranteed for tasks with accepted constraints, and - both CPU Reservations and Time Constraints are implemented very efficiently. In particular, - CPU scheduling overhead is bounded by a constant and is not a function of the number of schedulable tasks. Other key scheduler properties are: - activities cannot violate other activities'' guarantees, - time constraints and CPU reservations may be used together, separately, or not at all (which gives a round-robin schedule), with well-defined interactions between all combinations, and - spare CPU time is fairly shared among all activities. The Rialto operating system, developed at Microsoft Research, achieves these goals by using a precomputed schedule, which is the fundamental basis of this work. ------ (2) Characterizing Group Communication Middleware for a Real-time Distributed System L. M. Feeney, P. Bernadat, F. Travostino The Open Group Research Institute Abstract: This paper presents our current work in characterizing the behavior of a real-time dependable distributed system, which must exhibit predictable behavior under load and in the presence of partial failures. We focus on measuring the end-to-end properties of the middleware which implements the real-time process group service, specifically its membership and message latency. The paper also describes the tools and techniques we have developed, along with some of the practical issues that arise in instrumenting a real-time distributed system. ------ (3) Real-Time Monitoring of the EIVIS Distributed Video-Server on Windows NT M. Gergeleit and M. Mock GMD - German National Research Center for Informati
Query-independent evidence in home page finding
Authors: Trystan Upstill, Nick Craswell, David Hawking
Venue: ACM Transactions on Information Systems (TOIS) (2003)

Hyperlink recommendation evidence, that is, evidence based on the structure of a web's link graph, is widely exploited by commercial Web search systems. However there is little published work to support its popularity. Another form of query-independent evidence, URL-type, has been shown to be beneficial on a home page finding task. We compared the usefulness of these types of evidence on the home page finding task, combined with both content and anchor text baselines. Our experiments made use of five query sets spanning three corpora---one enterprise crawl, and the WT10g and VLC2 Web test collections.We found that, in optimal conditions, all of the query-independent methods studied (in-degree, URL-type, and two variants of PageRank) offered a better than random improvement on a content-only baseline. However, only URL-type offered a better than random improvement on an anchor text baseline. In realistic settings, for either baseline, only URL-type offered consistent gains. In combination with URL-type the anchor text baseline was more useful for finding popular home pages, but URL-type with content was more useful for finding randomly selected home pages. We conclude that a general home page finding system should combine evidence from document content, anchor text, and URL-type classification.
Efficient Reconciliation of Unordered Databases
Authors: Yaron Minsky, Ari Trachtenberg
Venue:  (1999)

We consider the problem of reconciling two unordered databases whose contents are related. Specifically, we wish to determine the mutual difference of these databases with a minimum communication complexity. This type of problem arises naturally in the context of gossip protocols. We analyze two instances of the reconciliation problem, a client-server model and a more general peer-to-peer model, and provide interactive solutions for both. For the former instance, we also provide a simple one-message reconciliation algorithm, based on elementary symmetric polynomials, which has an almost optimal communication complexity.
Direct and Interactive Marketing
Authors: Adrian Sargeant, Douglas C. West
Venue:  (2002)

:"This textbook offers a comprehensive review of the principles of direct, database, and interactive marketing. Designed to accompany undergraduate and post-experience courses in this discipline, the text has been structured to reflect each of the stages that would commonly be encountered in the creation of an interactive marketing plan. It provides a consideration of both customer acquisition and customer development and a detailed examination of the research and analytical techniques employed in making marketing decisions."
The Effect of Compiler Optimizations on Pentium 4 Power Consumption
Authors: John S. Seng, Dean M. Tullsen
Venue: Proceedings of the Seventh Workshop on Interaction between Compilers and Computer Architectures (2003)

This paper examines the effect of compiler optimizationson the energy usage and power consumption of the IntelPentium 4 processor. We measure the effects of differentlevels of general optimization and specific optimization. Weclassify general optimizations as those compiler flags whichenable a set of compiler optimizations. Specific optimizationsare those which can be enabled and disabled individually.The three specific optimizations we study are loopunrolling, loop vectorization, and function inlining. The binariesused in this study are generated using the Intel C++compiler, which allows fine-grained control over each ofthese specific optimizations.