ppxscal/embedding_network huggingface dataset:
Dynamic characteristics of laminated angle-ply noncircular cylindrical shells
Authors: H. G. Patel, B. P. Patel, M. Ganapathi, M. Touratier
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper deals with the free vibration behavior of anisotropic laminated angle-ply non-circular cylindrical shells using finite element approach. The formulation is based on first-order shear deformation theory. A detailed study is carried out to highlight the effects of lap-up and ply-angle on the natural frequencies pertaining to different types of modes of vibrations of simply supported non-circular shell structures.
Implementation of a BIC Monitor in a New Analog BIST Structure.
Authors: M. Sidiropulos, V. Stopjakova, H. Manhaeve
Venue: Proceedings of the 1996 IEEE International Workshop on IDDQ Testing (IDDQ '96) (1996)

The last step in the development of a BIST structure employing a new self-test technique for analog circuits is presented in this paper, namely the design and implementation of a suitable built-in supply current (BIC) monitor. The new self-test technique, based on power supply current monitoring, takes advantage of the redundancy in the structure of fully balanced circuits.. The new technique requires a special BIC monitor that provides appropriate signals for a successful fault detection. The BIC monitor, presented in this paper, is based on a second generation current conveyor CCII+, and offers an accurate measurement of supply currents with a minimal supply voltage degradation. The BIC monitor circuit was evaluated using fault simulations, which show a reasonable fault coverage. An implementation of the new BIC monitor in an analog BIST structure is finally described.
Workflow support across organisational boundaries
Authors: R. M. Tagg
Venue: Proceedings of the 1996 Information Systems Conference of New Zealand (ISCNZ '96) (1996)

Workflow systems have come into recent vogue as an approach to supporting the co-ordination of business processes. The current surge of commercial activity in groupware and workflow software products has been triggered largely by the widespread use of business process re-engineering (BPR). While commercial products have developed to meet market opportunities, academic research has moved towards support for so-called transactional workflows, where workflow paradigms are applied to the mainstream of mission critical applications. This paper addresses the needs of the growing number of applications which cross the boundaries between organisations. Following a brief review of workflow developments, the needs of such cross-boundary applications are discussed. A model for operation of an appropriate workflow system is described, and the facilities of a "lightweight" workflow server are proposed.
The Design of a Prototyping Programming Language for Parallel
Authors: Sequential Algorithms, S L Nyland
Venue:  (1991)

\indent Prototyping of computer programs is an exploration process. The specifications, whether written down or merely imagined, are often incomplete, and answers must be found to complete the specification. The prototyping process is used for the express purpose of gaining knowledge to complete the specifications. This thesis is a presentation of a programming language for prototyping sequential and parallel algorithms. The language is called CPL, which stands for a {\em Common Prototyping Language}. The goals of a prototyping language are to allow a programmer to quickly explore an algorithm, be it sequential or parallel. Several programming styles are examined, the programming language is described in detail, and then an examination of how the language fits particular styles is made. Several examples of modern algorithms are described, showing the effectiveness of CPL and prototyping (two of the algorithms required repairs). The distinguishing characteristics of the language are many. A strong data model is supported that includes set-theoretic constructs such as sets, sequences, and maps, as well as support for objects. All data are first-class objects, allowing freedom in handling. A unique characteristic of the language is its ability to describe many different models of parallel computing. These include the Parallel Random-Access Machine (PRAM), communicating sequential processes, data-level parallelism, and distributed computing. The language has a supportive variable typing system, variables need not be declared, and are freely typed, unless the programmer specifies otherwise. Much of the notation in the language does not distinguish between notation for statements or expressions, simplifying the language. The language allows statements to be treated as values and stored. This facilitates the automatic generation of multiple concurrent streams of execution. These characteristics of the language give it a unique ability to describe parallel algorithms at a very high level. The programming styles examined include imperative, mathematical, object-oriented, functional, PRAM and other forms of parallel computing, search and translation. The model of parallelism chosen is shown to be effective through stylistic arguments as well as by diverse programming examples. The programming examples show that the language described is applicable to many different styles of programming, that the language is consistent, and that it is usable. The examples include recent algorithms on tree-search problems in parallel, scan algorithms for data-parallel machines, sorting on distributed systems, and a theoretical, parallel graph-connectivity algorithm. Clarifications of the not-quite-correct algorithms have been made, showing that the algorithms are indeed effective and perform as expected.
On intervals in some posets of forests
Authors: Frédéric Chapoton
Venue: Journal of Combinatorial Theory Series A (2003)

We compute the characteristic polynomials of intervals in some posets of leaf-labeled forests of rooted binary trees.
Rule-based word clustering for text classification
Authors: Hui Han, Eren Manavoglu, C. Lee Giles, Hongyuan Zha
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

This paper introduces a rule-based, context-dependent word clustering method, with the rules derived from various domain databases and the word text orthographic properties. Besides significant dimensionality reduction, our experiments show that such rule-based word clustering improves by 8 the overall accuracy of extracting bibliographic fields from references, and by 18.32 on average the class-specific performance on the line classification of document headers.
Collapse of a RC structure due to erroneous FEM computer controlled design
Authors: O. Río, L. Sparowitz, P. Tanner, D. Theodossopoulos
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The collapse of the top slab of a water reservoir as a result of a combination of improper design and erroneous FE analysis is demonstrated. In order to explain the mechanism of failure as well as the feasibility of other solutions, the strut-and-tie modelling method is used. Through the analysis of this particular case study, the effectiveness of both methods in the analysis of structures where structural joints or D structural zones exist is compared in terms of their ability to assess possible causes of failure and the amount of computational load.
Solution of Alternating-Line Processes on Modern Parallel Computers
Authors: David Espadas, Manuel Prieto, Ignacio M. Llorente, Francisco Tirado
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

The aim of this paper is the study of different methods for the solution of alternating-line problems, taking into account the evolution of architectural parameters on modern parallel computers, i.e. processors, memory hierarchy, and interconnection network performance. Three different kinds of solvers are studied: The Pipelined Gaussian Elimination scheme, the Matrix Transposition scheme, and the new one which is presented in this paper: the Mapping Transposition scheme, whose performance clearly betters, in many cases, that obtained by all the other methods, due to its better fitting to the characteristics of modern parallel computers. The experimental results have been obtained on a Cray T3E and on an SGI Origin 2000, up to 512 and 32 processors, respectively.
Matrix Sensitivity Analysis from an Interior Solution of a Linear Program
Authors: Harvey J. Greenberg
Venue:  (1997)

This considers the effect of changing matrix coefficients in a linear program after we have obtained an interior solution. Changes are restricted to where there remains an optimal solution to the perturbed problem ( called "admissible"). Mills'' minimax theorem provides one approach and has been used for similar sensitivity analysis from a basic optimum. Here we consider the effect on the optimal partition and how the analysis results relate to the classical approach that uses a basic solution.
New Algorithms for Content-Based Publication-Subscription Systems
Authors: Anton Riabov, Zhen Liu, Joel L. Wolf, Philip S. Yu, Li Zhang
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

This paper introduces new algorithms specifically designedfor content-based publication-subscription systems.These algorithms can be used to determine multicast groupswith as much commonality as possible, based on the totalityof subscribers' interests.The algorithms are based onconcepts borrowed from the literature on spatial databasesand clustering.These algorithms perform well in the contextof highly heterogeneous subscriptions, and they also scalewell.Based on concepts borrowed from the spatial databaseliterature, we develop an algorithm to match publicationsto subscribers in real-time.We also investigate the benefitsof dynamically determining whether to unicast, multicastor broadcast information about the events over the networkto the matched subscribers.We call this the distributionmethod problem.Some of these same concepts can be appliedto match publications to subscribers in real-time, andalso to determine dynamically whether to unicast, multicastor broadcast information about the events over the networkto the match subscribers.We demonstrate the quality ofour algorithms via a number of realistic simulation experiments.
Script and Nature Differentiation for Arabic and Latin Text Images
Authors: Slim Kanoun, Adellatif Ennaji, Yves LeCourtier, Adel M. Alimi
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

A method for Arabic and Latin text block differentiation for printed and handwritten scripts isproposed. This method is based on a morphological analysis for each script at the text block level and a geometrical analysis at the line and the connected component level. In this paper, we present a brief survey of existing methods used for scripts differentiation as well as a general characteristics of Arabic and Latin scripts. Then, We describe our method for the differentiation of these last scripts. We finally show two experimental results on two different data sets. 400 text blocks constitute the first one and 335 text blocks compose the second.
Numerical solution of some singular unconstrained minimization problems
Authors: Abram Zhuzhunashvili, Yuri Tvalodze
Venue:  (1999)

Numerical solution of a singular unconstrained minimization problem is divided into two steps. Firstly, we consider a continuous analogue of the steepest gradient descent, which leads to a system of Volterra integral equations, and obtain convergence rate estimates. Secondly, the system is solved by an approximate-iterative method. An estimate of the total absolute error is given as a sum of the inherent error, the error of the numerical method, and the round-off error. The estimate enables one to determine parameters of the computational process and to solve the initial problem with pre-assigned accuracy.
Tree Visualisation and Navigation Clues for Information Visualisation
Authors: Ivan Herman, M. Delest, Guy Melancon
Venue:  (1998)

Information visualisation very often requires good navigation aids on large trees, which represent the underlying abstract information. Using trees for information visualisation requires novel user interface techniques, visual clues, and navigational aids. This paper describes a visual clue for trees as well as an automatic folding (clustering) technique, both based on some mathematical concepts and results in combinatorics. Examples are shown how these techniques can be used, and what the further challenges in this area are.
Molecular Modeling: Basic Principles and Applications, 2 edition
Authors: Hans-Dieter Holtje, Gerd Folkers, Wolfgang Sippl, Didier Rognan
Venue:  (2003)

:Written by experienced experts in molecular modeling, this books describes the basics to the extent that is necessary to reliably judge the results from molecular modeling calculations.Without unnecessary overhead it leads the reader from simple calculations on small molecules to the modeling of proteins and other relevant biomolecules. The beginner is guided through the first modeling experiment, and the routine user of modeling software provided with invaluable troubleshooting hints. A unique resource for students, researchers and lecturers, now available in an all-new and enlarged edition.
Discussion paper: privacy-preserving distributed queries for a clinical case research network
Authors: Gunther Schadow, Shaun J. Grannis, Clement J. McDonald
Venue: Proceedings of the IEEE international conference on Privacy, security and data mining - Volume 14 (2002)

We present the motivation, use-case and requirements of a clinical case research network that would allow biomedical researchers to perform retrospective analysis on de-identified clinical cases joined across a large scale (nationwide) distributed network. Based on semi-join adaptive plans for fusion-queries, in this paper we discuss how joining can be done in a way that protects the privacy of the individual patients involved. Our method is based on a cryptographically strong keyed-hash algorithm (HMAC.) These hash values are truncated and the resulting hash-collisions in semi-join filters are exploited to limit the ability of an apprentice-site to re-identify patients in the filter. As a measure of privacy we use likelihood ratios. Since the join key is based on real person identifiers, we need to apply the methods of record linkage to hashing and semi-join filters. We find that multiple disjunctive rules as used in deterministic matching, lead here to a higher privacy risk than rules based on a single identifier vector.
Lambda calculi and linear speedups
Authors: David Sands, Jörgen Gustavsson, Andrew Moran
Venue: The essence of computation: complexity, analysis, transformation (2002)

The equational theories at the core of most functional programming are variations on the standard lambda calculus. The best-known of these is the call-by-value lambda calculus whose core is the value-beta computation rule (λx.M) V → M [V/x] where V is restricted to be a value rather than an arbitrary term.This paper investigates the transformational power of this core theory of functional programming. The main result is that the equational theory of the call-by-value lambda calculus cannot speed up (or slow down) programs by more than a constant factor. The corresponding result also holds for call-by-need but we show that it does not hold for call-byname: there are programs for which a single beta reduction can change the program's asymptotic complexity.
Norm adoption in the NoA agent architecture
Authors: Martin J. Kollingbaum, Timothy J. Norman
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Agents based on reactive planning architectures use pre-specified plans as behaviour specifications. Normative agents are motivated by norms in their behaviour: obligations motivate them to act, prohibitions motivate them to refrain from certain actions, and permissions (or privileges) and capabilities specify the range of possible actions for such an agent. An important issue for normative agents is: under what circumstances is it appropriate for an agent to adopt a new set of obligations, prohibitions or permissions and what effect does it have on the agent's normative state? In answering this question, a critical issue is whether or not this set of norms is consistent with the agent's current normative state. Consistency of a set of norms is discussed in detail in respect to a reactive planning agent architecture -- NoA, but, it is argued, provides useful insight to the problem of norm consistency in general and particularly where practical reasoning agents are concerned.
REALbasic for Macintosh: Visual QuickStart Guide
Authors: Michael Swaine
Venue:  (2002)

:Untitled REALbasic is one of the most popular programming platforms for Macintosh users. REALbasic has been described as &Ograve;Visual Basic for the Macintosh&Oacute; and indeed, REALbasic's visual, drag-and-drop interface is easy enough for beginners to learn, while still powerful enough for professionals to use. REALbasic for Macintosh: Visual QuickStart Guide shows how to develop applications for the Macintosh and Windows platform, with plenty of screenshots to guide readers along. This book covers REALbasic version 3.5, which adds supports for Mac OS X, powerful new 3D graphics, Microsoft Office automation, an internal scripting language, and much more. Ideal for beginning programmers as well as those with more programming experience. Ideal for anyone interested in developing applications on a Macintosh for Macintosh or Windows. That includes programmers who want to use REALbasic for incidental programming, HyperCard users who feel abandoned by Apple and are looking for a replacement, system administrators with access to a Mac, and people with no programming or scripting experience.
The Central Guardian Approach to Enforce Fault Isolation in the Time-Triggered Architecture
Authors: Günther Bauer, Hermann Kopetz, Wilfried Steiner
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

This paper discusses measures to make a distributed system based on the Time-Triggered Architecture resistant to arbitrary node failures. The presented approach introduces a central guardian as part of the interconnection network. This guardian acts as a supervising unit to node computers by checking for compliance to the fault hypothesis at the network interface of the node. By implementing appropriate algorithms the guardian is able to transform failure modes (of nodes) that cannot be tolerated by the fault hypothesis of the TTP/Cprotocol. This transformation ensures that ¿ at the interface to correct nodes ¿ even an arbitrarily faulty node will be compliant to the fault hypothesis of the TTP/C communication protocol.
LDBS: A Duplication Based Scheduling Algorithm for Heterogeneous Computing Systems
Authors: Atakan Dogan, Füsun Özgüner
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

Finding an optimal solution to the problem of scheduling an application modeled by a directed acyclic graph (DAG) onto a set of heterogeneous machines is known to be an NP-hard problem. In this study, we present a duplication based scheduling algorithm, namely the levelized duplication based scheduling (LDBS) algorithm, which solves this problem efficiently. The primary goal of LDBS is to minimize the schedule length of applications. LDBS can accommodate different duplication heuristics, thanks to its modular design. Specifically, we have designed two different duplication heuristics with different time complexities. The simulation studies confirm that LDBS is a very competitive scheduling algorithm in terms of minimizing the schedule length of applications.
Efficient Solution of Sparse Block Hessenberg Systems
Authors: Paola Favati, G. Lotti, Ornella Menchi, Francesco Romani
Venue:  (1998)

This paper describes a divide-and-conquer strategy for solving block Hessenberg systems. The method is a revised version of the recursive divide-and-conquer method due to Stewart. It keeps the good stability properties and the number of arithmetic operations of the original algorithm with a lower memory requirement. TEL:: 050593448 EMAIL:: favati@imc.pi.cnr.it
Towards Situated Computing
Authors: Richard Hull, Philip Neaves, James Bedford-Roberts
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

Situated computing concerns the ability of computing devices to detect, interpret and respond to aspects of the user's local environment. In this paper, we use our recent prototyping experience to identify a number of challenging issues that must be resolved in building wearable computers that support situated applications. The paper is organized into three areas: Sensing the local environment, interpreting sensor data, and realizing the value of situated applications. We conclude that while it is feasible to develop interesting prototypes, there remain many difficulties to overcome before robust systems may be widely deployed.
Characterizing Reference Locality in the WWW
Authors: Virgilio Almeida, Azer Bestavros, Mark Crovella, Adriana deOliveira
Venue:  (1996)

Abstract As the World Wide Web (Web) is increasingly adopted as the infrastructure for large-scale distributed information systems, issues of performance modeling become ever more critical. In particular, locality of reference is an important property in the performance modeling of distributed information systems. In the case of the Web, understanding the nature of reference locality will help improve the design of middleware, such as caching, prefetching, and document dissemination systems. For example, good measurements of reference locality would allow us to generate synthetic reference streams with accurate performance characteristics, would allow us to compare empirically measured streams to explain differences, and would allow us to predict expected performance for system design and capacity planning. In this paper we propose models for both temporal and spatial locality of reference in streams of requests arriving at Web servers. We show that simple models based only on document popularity (likelihood of reference) are insufficient for capturing either temporal or spatial locality. Instead, we rely on an equivalent, but numerical, representation of a reference stream: a stack distance trace. We show that temporal locality can be characterized by the marginal distribution of the stack distance trace, and we propose models for typical distributions and compare their cache performance to our traces. We also show that spatial locality in a reference stream can be characterized using the notion of self-similarity. Self-similarity describes long-range correlations in the dataset, which is a property that previous researchers have found hard to incorporate into synthetic reference strings. We show that stack distance strings appear to be stongly self-similar, and we provide measurements of the degree of self-similarity in our traces. Finally, we discuss methods for generating synthetic Web traces that exhibit the properties of temporal and spatial locality that we measured in our data. Keywords: Self-similarity; Long-range dependence; Distance strings; Reference locality; Caching; Performance modeling.