ppxscal/embedding_network huggingface dataset:
Analytical expressions of sensitivities for shape variables in second order bending systems
Authors: J. C. Perezzan, S. Hernández
Venue: Advances in Engineering Software (2005)

Due to the variety of its uses, sensitivity analysis is a very interesting field in structural engineering. However, the computational effort to obtain the analytical values for such sensitivities is a formidable task. Hence, it has generally been avoided when bending systems are considered; instead, approaches based on finite differences have been used. Nevertheless, using the latter method to carry out sensitivity analyses leads to considerable error, especially with shape variables, as many authors have pointed out.In this paper, the analytical expressions of sensitivity analyses with respect to shape variables are carried out for bending systems in second order theory. The first step is to evaluate the sensitivity analyses of the nodal movements by performing the loading vector along with the elastic and geometric stiffness matrix sensitivity analyses. Then, the sensitivity analyses of the maximum normal stresses are evaluated.Thereafter, there is an explanation of structural examples in which the previous analytical sensitivities are evaluated. The results are contrasted with those obtained by finite difference methods. There is also an example where the analytical sensitivities are used to carry out the optimisation of a portal structure. Finally, conclusions drawn from this work are presented.
A component integration meta-framework using smart adapters
Authors: Leon K. Jololian, Jean-Claude Ngatchou, Remzi Seker
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

Efforts to integrate independently developed software components, to a large extent, have not been successful. Effective integration requires that component models agree on at least two different levels: "wiring"-level connectivity and semantic-level compatibility. While the use of adapters has been successful in dealing with the wiring-level, no viable approach exists for the semantic level. This is partly due to the availability of standards for components at the wire-level and the absence of similar standards at the semantic-level. In this paper we describe a framework for developing standards that deals with the semantic-level characteristic of components. Mismatches between components can then be eliminated systematically. Our approach is based on modeling a component with a set of three primary elements consisting of data, function, and control. An integration framework using this model automates the generation of mediating adapters. The framework provides developers with an abstract language, for specifying the required component interaction.
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows
Authors: Xuemin Lin, Yidong Yuan, Wei Wang, Hongjun Lu
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

We consider the problem of efficiently computing the skyline against the most recent N elements in a data stream seen so far. Specifically, we study the n-of-N skyline queries; that is, computing the skyline for the most recent n (¿ ¿ N) elements. Firstly, we developed an effective pruning technique to minimize the number of elements to be kept. It can be shown that on average storing only O(log^d N) elements from the most recent N elements is sufficient to support the precise computation of all n-of-N skyline queries in a d-dimension space if the data distribution on each dimension is independent. Then, a novel encoding scheme is proposed, together with efficient update techniques, for the stored elements, so that computing an n-of-N skyline query in a d-dimension space takes O(log N + s) time that is reduced to O(d log log N + s) if the data distribution is independent, where s is the number of skyline points. Thirdly, a novel trigger based technique is provided to process continuous n-of-N skyline queries with O(¿) time to update the current result per new data element and O(log s) time to update the trigger list per result change, where ¿ is the number of element changes from the current result to the new result. Finally, we extend our techniques to computing the skyline against an arbitrary window in the most recent N elements. Besides theoretical performance guarantees, our extensive experiments demonstrated that the new techniques can support on-line skyline query computation over very rapid data streams.
Bayesian representation learning in the cortex regulated by acetylcholine
Authors: Junichiro Hirayama, Junichiro Yoshimoto, Shin Ishii
Venue: Neural Networks (2004)

A brain needs to detect an environmental change and to quickly learn internal representations necessary in a new environment. This paper presents a theoretical model of cortical representation learning that can adapt to dynamic environments, incorporating the results by previous studies on the functional role of acetylcholine (ACh). We adopt the probabilistic principal component analysis (PPCA) as a functional model of cortical representation learning, and present an on-line learning method for PPCA according to Bayesian inference, including a heuristic criterion for model selection. Our approach is examined in two types of simulations with synthesized and realistic data sets, in which our model is able to re-learn new representation bases after the environment changes. Our model implies the possibility that a higher-level recognition regulates the cortical ACh release in the lower-level, and that the ACh level alters the learning dynamics of a local circuit in order to continuously acquire appropriate representations in a dynamic environment.
Heterogeneous Distributed Parallel Programming for Coordination in Software Development
Authors: Chia-Chu Chiang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

We are presenting a formal specification-based approach to heterogeneous distributed parallel programming. A specification language is used to describe system behaviors. The specification is then analyzed to create a multiparty interaction interface description describing the properties of the multiparty interactions among processes. Our language mapping approach allows a multiparty interaction interface description automatically created in any target programming language. Developers can then write a program in the target language to include the description for execution. A familiar programming model will be provided to support implicit communication, concurrency, synchronization, and parallelism in systems through an implicit coordination-oriented approach. In other words, developers do not have to explicitly express communication, concurrency, synchronization, and parallelism when they are developing heterogeneous distributed and parallel systems.
Classifying the Complexity of Constraints Using Finite Algebras
Authors: Andrei Bulatov, Peter Jeavons, Andrei Krokhin
Venue: SIAM Journal on Computing (2005)

Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. Here we show that any set of relations used to specify the allowed forms of constraints can be associated with a finite universal algebra and we explore how the computational complexity of the corresponding constraint satisfaction problem is connected to the properties of this algebra. Hence, we completely translate the problem of classifying the complexity of restricted constraint satisfaction problems into the language of universal algebra.We introduce a notion of "tractable algebra," and investigate how the tractability of an algebra relates to the tractability of the smaller algebras which may be derived from it, including its subalgebras and homomorphic images. This allows us to reduce significantly the types of algebras which need to be classified. Using our results we also show that if the decision problem associated with a given collection of constraint types can be solved efficiently, then so can the corresponding search problem. We then classify all finite strictly simple surjective algebras with respect to tractability, obtaining a dichotomy theorem which generalizes Schaefer's dichotomy for the generalized satisfiability problem. Finally, we suggest a possible general algebraic criterion for distinguishing the tractable and intractable cases of the constraint satisfaction problem.
Syntactic Heroin
Authors: Rodney Bates
Venue: Queue (2005)

User-defined overloading is a drug. At first, it gives you a quick, feel-good fix. No sense in cluttering up code with verbose and ugly function names such as IntAbs, FloatAbs, DoubleAbs, or ComplexAbs; just name them all Abs. Even better, use algebraic notation such as A+B, instead of ComplexSum(A,B). It certainly makes coding more compact. But a dangerous addiction soon sets in. Languages and programs that were already complex enough to stretch everyone&rsquo;s ability suddenly get much more complicated.
Force Shading and Bump Mapping Using the Friction Cone Algorithm
Authors: N. Melder, W. S. Harwin
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Previous work has presented the friction cone algorithm, a generalised method to resolve forces on a simulated haptic object when two or more fingers are in contact. Two extensions to the friction cone algorithm are presented: force shading and bump mapping. Force shading removes the discontinuities that are present when transitioning from one face to the next, whilst bump mapping provides a mechanism for rendering haptic textures on polygonal surfaces. Both these extensions can be combined whilst still maintaining the friction cone algorithmýs intrinsic ability to simulate arbitrarily complex friction models.
Learning from little: comparison of classifiers given little training
Authors: George Forman, Ira Cohen
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

Many real-world machine learning tasks are faced with the problem of small training sets. Additionally, the class distribution of the training set often does not match the target distribution. In this paper we compare the performance of many learning models on a substantial benchmark of binary text classification tasks having small training sets. We vary the training size and class distribution to examine the learning surface, as opposed to the traditional learning curve. The models tested include various feature selection methods each coupled with four learning algorithms: Support Vector Machines (SVM), Logistic Regression, Naive Bayes, and Multinomial Naive Bayes. Different models excel in different regions of the learning surface, leading to meta-knowledge about which to apply in different situations. This helps guide the researcher and practitioner when facing choices of model and feature selection methods in, for example, information retrieval settings and others.
Slash - The Scalable Lightweight Archival Storage Hierarchy
Authors: Paul Nowoczynski, Nathan Stone, Jason Sommerfield, Bryon Gill, J. Ray Scott
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

Growing compute capacity coupled with advances in parallel filesystem performance and stability mean that HPC users will inevitably create and store larger datasets. If data residing on parallel filesystems is not efficiently offloaded to archival storage, disruptions in the compute cycle will occur. Hierarchical storage caches are a vital aspect of the HPC storage machine because they offload and prime the compute engine's parallel filesystem. To keep pace with expanding HPC data systems, these caches must adapt via new scalable architectures. The Pittsburgh Supercomputing Center (PSC) has developed a cooperative caching architecture to act as a distributed front-end cache to a hierarchical storage manager. SLASH, the Scalable Lightweight Archival Storage Hierarchy, provides means for creating parallel caching systems on an otherwise "monolithic" archival storage system without requiring modifications the archival system software.
An overhead reducing technique for Time Warp
Authors: Moon Jung Chung, Jinsheng Xu
Venue: Journal of Parallel and Distributed Computing (2005)

In this paper, we introduce a technique to reduce the number of state savings and the event queue size of Time Warp. By reducing the state saving and the sizes of event queues, we can decrease the overhead and the maximum memory requirement in Time Warp. We exploit the look-ahead technique to get a lower bound time stamp of the next event and to determine if an event is safe to be executed. No State saving is carried out when the event execution is safe. This lower bound can be used to discard saved states even though the time stamps are greater than the global virtual time (GVT). We prove that the proposed technique is correct under both aggressive and lazy cancellation schemes. This technique can be implemented with minimal additional overhead. Benchmark results on logic simulation show that the mechanism can reduce the number of state savings and memory size requirements significantly.
A Fuzzy Clustering Algorithm using Cellular Learning Automata based Evolutionary Algorithm
Authors: R. Rastegar, A. R. Arasteh, A. Hariri, M. R. Meybodi
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

In this paper, a new fuzzy clustering algorithm that uses cellular learning automata based evolutionary computing (CLA-EC) is proposed. The CLA-EC is a model obtained by combining the concepts of cellular learning automata and evolutionary algorithms. The CLA-EC is used to search for cluster centers in such a way that minimizes the clustering criterion. The simulation results indicate that the proposed algorithm produces clusters with acceptable quality with respect to clustering criterion and provides a performance that is superior to that of the C-means algorithm.
Model checking meets performance evaluation
Authors: Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

Markov chains are one of the most popular models for the evaluation of performance and dependability of information processing systems. To obtain performance measures, typically long-run or transient state probabilities of Markov chains are determined. Sometimes the Markov chain at hand is equipped with rewards and computations involve determining long-run or instantaneous reward probabilities.This note summarises a technique to determine performance and dependability guarantees of Markov chains. Given a precise description of the desired guarantee, all states in the Markov chain are determined that surely meet the guarantee. This is done in a fully automated way. Guarantees are described using logics. The use of logics yields an expressive framework that allows to express well-known measures, but also (new) intricate and complex performance guarantees. The power of this technique is that no matter how complex the logical guarantee, it is automatically checked which states in the Markov chain satisfy it. Neither manual manipulations of Markov chains (or their high-level descriptions) are needed, nor the knowledge of any numerical technique to analyze them efficiently. This applies to any (time-homogeneous) Markov chain of any structure specified in any high-level formalism.
Object combining: a new aggressive optimization for object intensive programs: Research Articles
Authors: Ronald Veldema, Ceriel J. H. Jacobs, Rutger F. H. Hofman, Henri E. Bal
Venue: Concurrency and Computation: Practice Experience (2005)

Object combining tries to put objects together that have roughly the same life times in order to reduce strain on the memory manager and to reduce the number of pointer indirections during a program's execution. Object combining works by appending the fields of one object to another, allowing allocation and freeing of multiple objects with a single heap (de)allocation. Unlike object inlining, which will only optimize objects where one has a (unique) pointer to another, our optimization also works if there is no such relation. Object inlining also directly replaces the pointer by the inlined object's fields. Object combining leaves the pointer in place to allow more combining. Elimination of the pointer accesses is implemented in a separate compiler optimization pass. Unlike previous object inlining systems, reference field overwrites are allowed and handled, resulting in much more aggressive optimization. Our object combining heuristics also allow unrelated objects to be combined, for example, those allocated inside a loop; recursive data structures (linked lists, trees) can be allocated several at a time and objects that are always used together can be combined. As Java explicitly permits code to be loaded at runtime and allows the new code to contribute to a running computation, we do not require a closed-world assumption to enable these optimizations (but it will increase performance). The main focus of object combining in this paper is on reducing object (de)allocation overhead, by reducing both garbage collection work and the number of object allocations. Reduction of memory management overhead causes execution time to be reduced by up to 35&percnt;. Indirection removal further reduces execution time by up to 6&percnt;. Copyright &copy; 2005 John Wiley & Sons, Ltd.
A Grid Certificate Authority for Community and Ad-Hoc Grids
Authors: Gregor von Laszewski, Mikhail Sosonkin
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 5 - Volume 06 (2005)

One of the most important issues in Grid computing is to provide a secure environment that allows administrators to contribute their resources and users to utilize them. Currently diverse methods are required to obtain certificates for the different Grids. In this paper we showcase a prototype of a tool that simplifies the tasks associated with maintaining a Grid certificate authority and simplifies the application process for the user to interact with multiple certificate authorities.
Design and Implementation of Electronic Communities
Authors: Levent V. Orman
Venue: Information Technology and Management (2005)

Electronic communities can be designed to organize consumers, to pool their purchasing power, and to guide their purchasing decisions. Such commercial electronic communities have the potential to facilitate the creation of novel marketplaces, and even radically change the buyer--seller interaction, as physical communities did throughout the history. Commercial electronic communities are groups of consumers that participate in the marketplace as a single unit. In addition to bargaining power gained from such bundling, such communities can expand markets by reducing market uncertainty, and they have the potential to drastically reduce transaction costs. However, these benefits are not automatic, and the optimum design and implementation of communities are critical to their economic success. The size and the makeup of a community, the size and the nature of the product bundle it offers, and the concise description and efficient implementation of the community as an electronic marketplace are all critical factors for the success of a community.
Sequent and hypersequent calculi for abelian and &lstrok;ukasiewicz logics
Authors: George Metcalfe, Nicola Olivetti, Dov Gabbay
Venue: ACM Transactions on Computational Logic (TOCL) (2005)

We present two embeddings of &Lstrok;ukasiewicz logic &Lstrok; into Meyer and Slaney's Abelian logic A, the logic of lattice-ordered Abelian groups. We give new analytic proof systems for A and use the embeddings to derive corresponding systems for &Lstrok;. These include hypersequent calculi, terminating hypersequent calculi, co-NP labeled sequent calculi, and unlabeled sequent calculi.
Book review: Using C, Lee Atkinson & Mark Atkinson (Que, 1990)
Venue: ACM SIGSMALL/PC Notes (1991)

Using C is a good book for intermediate and experienced programmers who want to learn about ANSI C. It covers the essential topics of C, including functions, pointers, I/O, and separate compilation, as well as the standard topics of operators, expressions, control flow, etc. In addition, it illustrates all the features of ANSI C, and includes a section on C++. The text includes several complete C programs that are compatible with the major C compilers for DOS. However, there is no companion disk, nor are there specific exercises on which the user can hone his/her programming skills.
Is the fast Givens transformation really fast?
Authors: Richard J. Hanson
Venue: ACM SIGNUM Newsletter (1973)

During the Eigensystem Workshop at Argonne National Laboratory, June 23-29, 1973, several attendees (including the author) listened to instruction regarding the use of the eigenvalue software product of NATS. [<u>EISPACK.</u> User's Information, from Argonne National Laboratory.]
Automatic measurement of memory hierarchy parameters
Authors: Kamen Yotov, Keshav Pingali, Paul Stodghill
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

The running time of many applications is dominated by the cost of memory operations. To optimize such applications for a given platform, it is necessary to have a detailed knowledge of the memory hierarchy parameters of that platform. In practice, this information is poorly documented if at all. Moreover, there is growing interest in self-tuning, autonomic software systems that can optimize themselves for different platforms; these systems must determine memory hierarchy parameters automatically without human intervention.One solution is to use micro-benchmarks to determine the parameters of the memory hierarchy. In this paper, we argue that existing micro-benchmarks are inadequate, and present novel micro-benchmarks for determining parameters of all levels of the memory hierarchy, including registers, all data caches and the translation look-aside buffer. We have implemented these micro-benchmarks in a tool called X-Ray that can be ported easily to new platforms. We present experimental results that show that X-Ray successfully determines memory hierarchy parameters on current platforms, and compare its accuracy with that of existing tools.
Multimodal Interaction in a Haptic Environment
Authors: Anton Nijholt, Sander Kole, Job Zwiers
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

In this paper we investigate the introduction of haptics in a multimodal tutoring environment. In this environment a haptic device is used to control a virtual piece of sterile cotton and a virtual injection needle. Speech input and output is provided to interact with a virtual tutor, available as a talking head, and a virtual patient. We introduce the haptic tasks and how different agents in the multi-agent system are made responsible for them. Notes are provided about the way we introduce an affective model in the tutor agent.