ppxscal/embedding_network huggingface dataset:
An Efficient Commit Protocol Exploiting Primary-Backup Placement in a Distributed Storage System
Authors: Xiangyong Ouyang, Tomohiro Yoshiharay, Haruo Yokota
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

Advanced data engineering applications require a largescale storage system that is both scalable and dependable. In such a system, an atomic commit protocol becomes imperative to ensure the consistency and atomicity of transactions. In this paper we present a new commit protocol, BA-1.5PC, which is well tailored to such distributed storage environments as autonomous disks [20] that use a primarybackup storage schema. The protocol achieves an efficient commit process while also guaranteeing a high dependability by combining several approaches: (1) a low-overhead log mechanism that eliminates blocking disk I/Os, (2) removing the voting phase from commit processing to gain a faster commit process, and (3) a primary-backup assisted recovery strategy to enhance dependability in the presence of possible failures, so that a master failure in the decision phase will not block prepared cohorts of a transaction. Experiments were carried out on a trial version of an autonomous disks system to verify its efficiency. The results indicate that this protocol significantly outperforms several well-known commit protocols in terms of transaction throughput.
XTC -- The XML Transformation Coordinator for XML Document Transformation Technologies
Authors: Daniel Fotsch, Andreas Speck
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

In the recent time the Extensible Markup Language (XML) is playing an increasing role in the exchange of nearly all kind of Web-based data and elsewhere. Hence, the development and enhancement of XML document transformation technologies and concepts become essential in the future. However, numerous specific transformation approaches specify their transformation definitions in XML files themselves. In this paper we present the XML Transformation Coordinator (XTC) which supports the composition and adaptation step in the development of these XML transformation definitions implementing a hierarchy concept of transformation operators. This hierarchy concept allows the specification of complex transformation operators without changing the underlying transformation technology. The complex operators are either generic or specifically suited to develop transformations in a certain domain or application area.
Artificial compressibility, characteristics-based schemes for variable-density, incompressible, multispecies flows: Part II. Multigrid implementation and numerical tests
Authors: Evgeniy Shapiro, Dimitris Drikakis
Venue: Journal of Computational Physics (2005)

The paper presents an investigation of the accuracy and efficiency of artificial compressibility, characteristics-based (CB) schemes for variable-density incompressible flows. The CB schemes have been implemented in conjunction with a multigrid method for accelerating numerical convergence and a fourth-order, explicit Runge-Kutta method for the integration of the governing equations in time. The implementation of the CB schemes is obtained in conjunction with first-, second- and third-order interpolation formulas for calculating the variables at the cell faces of the computational volume. The accuracy and efficiency of the schemes are examined against analytical and experimental results for diffusion broadening in two- and three-dimensional microfluidic channels, a problem that has motivated the development of the present methods. Moreover, unsteady, inviscid simulations have been performed for variable-density mixing layer. The computations revealed that accuracy and efficiency depend on the CB scheme design. The best multigrid convergence rates were exhibited by the conservative CB scheme, which is obtained by the fully conservative formulation of the variable-density, incompressible equations.
Backtracking iterators
Authors: Jean-Christophe Filliâtre
Venue: Proceedings of the 2006 workshop on ML (2006)

Iterating over the elements of an abstract collection is usually done in ML using a fold-like higher-order function provided by the data structure. This article discusses a different paradigm of iteration based on purely functional, immutable cursors. Contrary to fold-like iterators, the iteration can be cleanly interrupted at any step. Contrary to imperative cursors (such as those found in C++ and Java libraries) it is possible to backtrack the iterator to a previous step. Several ways to iterate over binary trees are examined and close links with Gérard Huet's Zipper are established. Incidentally, we show the well-known two-lists implementation of functional queues arising from a Zipper-based breadth-first traversal.
SPI - A Role for Method Engineering
Authors: B. Henderson-Sellers
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

This keynote presentation covers both the theory of situational method engineering and its application in terms of two industry case studies carried out over the last 5 years in Sydney, Australia in helping organizations to create agile and flexible methodologies, capable of maturing and improving over the years.
Developing Personalized Knowledge Navigation Service for Students Self-Learning based on Interpretive Structural Modeling
Authors: Zheng-Hong Wu, Yu-Jun Liu, Maiga Chang, Alex Chang, Ming Li
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This paper designs a personalized navigation service based on the student cognitive levels. The personalized navigation service takes the interpretive structural modeling to generate concept navigation matrix by using the student cognitive background matrix (retrieved from tests and questionnaire) and the concept relation matrix (retrieved from textbooks). According to the knowledge structure and the concept navigation matrix, the service can provide different students their own knowledge navigation maps.
SeSAm: implementation of agent-based simulation using visual programming
Authors: F. Klügl, R. Herrler, M. Fehler
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

In this paper, we present the most important features of SeSAm, a modeling and simulation platform for multi-agent simulations. Based on a declarative, explicit model representation and visual programming, it allows implementing models on specification level. Optimizing compilation allows efficient simulation of the explicit model representation. It was successfully applied in different areas, like biology, traffic or logistics simulation.
Proceedings of the 2006 workshop on Dependability issues in wireless ad hoc networks and sensor networks
Venue: International Conference on Mobile Computing and Networking (2006)

It is our great pleasure to welcome you to the 2nd Instantiation of the Workshop on Dependability Issues in Wireless Ad Hoc Networks and Sensor Networks, or more familiarly, DIWANS! The 1st DIWANS took place in 2004 in Florence, Italy, where it was co-located with the IEEE International Conference on Dependable Systems and Networks (DSN). DIWANS 2004 was very well attended and generated engaging and insightful discussions on a wide range of issues related to dependability of wireless networks. This 2nd DIWANS is co-located with the ACM International Conference on Mobile Computing and Networking (MobiCom) in the beautiful Marina del Rey, California site. DIWANS 2006 is sponsored by ACM and SIGMOBILE, in cooperation with the IEEE Technical Committee on Fault-Tolerant Computing (TC on FTC). The Workshop has also received a financial contribution from Istituto di Informatica e Telematica del CNR (IIT-CNR). We are extremely grateful to ACM, SIGMOBILE, TC on FTC, and IIT-CNR for their support.
Towards a transactional services coordination model
Authors: Alberto Portilla, Christine Collet, Genoveva Vargas-Solar
Venue: Proceedings of the 10th International Database Engineering and Applications Symposium (2006)

This paper proposes a flexible transactional behavior model for services coordination. We assume that given a flow describing the application logic of a service based application, it is possible to associate to it a personalised transactional behaviour in an orthogonal way. This behaviour is defined by specifying contracts and associating a well defined behaviour to the activities participating in the coordination. Such contracts ensure transactional properties at execution time in the presence of exceptions. Keywords: Transactional behaviour, advanced transactional models, services oriented systems, services based applications, web services.
Benchmarking a Semantic Web Service Architecture for Fault-tolerant B2B Integration
Authors: Jorge Cardoso
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

With the development and maturity of Service- Oriented Architectures (SOA) to support business-tobusiness transactions, organizations are implementing Web services to expose their public functionalities associated with internal systems and business processes. In many business processes, Web services need to provide is a high level of availability, since the globalization of the Internet enables business partners to easily switch to other competitors when services are not available. Along with the development of SOA, considerable technological advances are being made to use the semantic Web to achieve the automated processing and integration of data and applications. This paper describes the implementation and benchmarking of an architecture that semantically integrates Web services with a peer-to-peer infrastructure to increase service availability through fault-tolerance.
Contributions in Mathematical Approaches to Steganalysis
Authors: Aruna Ambalavanan
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

Current steganalysis techniques focus on detecting the secret message or estimating some parameters of secret message such as its length. In this work we develop a steganalysis technique that estimates the secret message itself. Most steganalysis algorithms are histogram based and such techniques fail if the cover distribution is preserved after embedding. One such distribution preserving steganographic technique is proposed. To cater to such hiding strategies a steganalysis algorithm is developed which unlike its counterparts is not training based. Instead it is a deterministic algorithm formulated along the lines of Bayesian inference techniques. The knowledge about the embedding process and the cover medium is sufficiently exploited as apriori information. We develop such a technique for spatial bit plane embedding. For spread spectrum type embedding a source separation formulation is used in separating the message carrying signal from the host using certain prior information about the embedding process and the host medium.
Junta distributions and the average-case complexity of manipulating elections
Authors: Ariel D. Procaccia, Jeffrey S. Rosenschein
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manipulate, but predictably used NP-hardness as the complexity measure. Such a worst-case analysis may be an insufficient guarantee of resistance to manipulation.Indeed, we demonstrate that NP-hard manipulations may be tractable in the average-case. For this purpose, we augment the existing theory of average-case complexity with new concepts; we consider elections distributed with respect to junta distributions, which concentrate on hard instances, and introduce a notion of heuristic polynomial time. We use our techniques to prove that a family of important voting protocols is susceptible to manipulation by coalitions, when the number of candidates is constant.
64-bit JMP for Linux
Authors: Erin Vang
Venue: Linux Journal (2006)

64-Bit Linux and JMP statistics software are made for each other.
Implementation of New Active Service to Support Ubiquitous Card for U-City
Authors: Sang-Hun Lee, Mi-Og Park, Kun-Won Jang, Moon-Seog Jun
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

This system proposes ubiquitous card service which is to give us the unique personalized information in UCity( Ubiquitous City). The user have to submit the personal information(considered one's intellectual powers, concerns, and age etc.) in U-Card(Secure Smart Card with PKI and RF tag) with secure channel to the information servers, and the user acquired the unique information that is created by system with the user's personal information. This system can keep individual information and apply U-Card having public key and certificate to the protection of the invasion of one's privacy and support the communication between RFID and Reader. So the system acquires the personalized information then provide services(customized information about the contents) on the base of U-City.
Improving the Speed of Kernel PCA on Large Scale Datasets
Authors: Tat-Jun Chin, David Suter
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

This paper concerns making large scale Kernel Principal Component Analysis (KPCA) feasible on regular hardware. The KPCA has been proven a useful non-linear feature extractor in several computer vision applications. The standard computation method for KPCA, however, scales badly with the problem size, thus limiting the potential of the technique for large scale data. We propose a novel method to alleviate this problem. The essence of our solution lies in partitioning the data and greedily filtering each partition for a sparse representation. Incremental KPCA is then utilized to merge each partition to arrive at the overall KPCA. We also provide experimental results which demonstrate the effectiveness of the approach.
Language Lateralization in a Bimanual Language
Authors: David P. Corina, Lucila San Jose-robertson, Andre Guillemin, Julia High, Allen R. Braun
Venue: Journal of Cognitive Neuroscience (2003)

Unlike spoken languages, sign languages of the deaf make use of two primary articulators, the right and left hands, to produce signs. This situation has no obvious parallel in spoken languages, in which speech articulation is carried out by symmetrical unitary midline vocal structures. This arrangement affords a unique opportunity to examine the robustness of linguistic systems that underlie language production in the face of contrasting articulatory demands and to chart the differential effects of handedness for highly skilled movements. Positron emission tomography (PET) technique was used to examine brain activation in 16 deaf users of American Sign Language (ASL) while subjects generated verb signs independently with their right dominant and left nondominant hands (compared to the repetition of noun signs). Nearly identical patterns of left inferior frontal and right cerebellum activity were observed. This pattern of activation during signing is consistent with patterns that have been reported for spoken languages including evidence for specializations of inferior frontal regions related to lexical-semantic processing, search and retrieval, and phonological encoding. These results indicate that lexical-semantic processing in production relies upon left-hemisphere regions regardless of the modality in which a language is realized, and that this left-hemisphere activation is stable, even in the face of conflicting articulatory demands. In addition, these data provide evidence for the role of the right posterolateral cerebellum in linguistic-cognitive processing and evidence of a left ventral fusiform contribution to sign language processing.
Artifacts for time-aware agents
Authors: Cédric Dinont, Philippe Mathieu, Emmanuel Druon, Patrick Taillibert
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Time-aware agents are agents capable of reasoning about their tasks duration and deadlines, and, more generally, to manage the temporal aspects of the execution of their tasks. We first focus on the case of agents in charge of long duration computations, sustaining that it is not acceptable for an autonomous agent to remain unaware of its environment for too long. We then consider deadline meetings when several time-aware agents share the same CPU. To achieve these goals, we recognize the importance of the artifact concept [16]. We introduce computational artifacts for long duration tasks and a coordination artifact for managing the CPU agenda and acting as an intermediary when agents negotiate CPU power. Control of computational artifacts is done thanks to a set of operating instructions dynamically computed by the coordination artifact.
Conformance Testing, the Elixer within the Chain for Learning Scenarios and Objects
Authors: Rob Nadolski, Owen ONeill, Wim van der Vegt, Rob Koper
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The chain for learning scenarios(LSs) and learning objects(LOs) comprises five iterative links: (i) development, (ii) publication, (iii) making resources searchable (iv) facilitating their arrangement (v) towards a runnable unit of learning. E-learning specifications and components-based systems embedded in a service-oriented architecture are conditio sine qua non for enabling this chain. To create a stronger more enduring chain, it must be easier to develop software and content compliant to elearning specifications. Conformance Testing (CT) is the elixir within the chain for LSs and LOs and the Telcert project CT system can be used in strengthening the chain.
Traveling threads: a new multithreaded execution model
Authors: Peter M. Kogge
Venue:  (2006)

Computer architecture is plagued by the von Neumann bottleneck. This work introduces and evaluates the traveling thread execution model in which threads migrate to the memory resources close to the data they require rather than perform remote memory accesses. This helps address the von Neumann problem by exposing additional concurrency within programs to tolerate long memory latencies, reduces two-way request/response network transactions typical of caching architectures to one way thread migration transactions, and reduces or eliminates cache coherency traffic.
Comparative Study on Information Schema Evaluation
Authors: Kab-seung Kou, Sung-il Han, Gang-soo Lee
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

In these days, many organizations try to manage their information system in safe way due to more rapidly change in information system environment. Appropriate development and evaluation are necessary in order to manage safe information system. The information guarantee of information system is gained through effective and appropriate information security management. In this paper, we survey and analyze for information security system in each criteria.
A Flight Test Demonstration of On-line Neural Network Applications in Advanced Aircraft Flight Control System
Authors: Fola Soares, John Burken
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

The objective of NASA's Intelligent Flight Control System (IFCS) program is to develop and flight test control schemes that enhance control during a primary control surface failure or aerodynamic change due to a failure or modeling errors. The goal of the Generation 2 (Gen-2)] is to evaluate on-line neural flight control system that can provide adaptive control without explicit parameter identification. The Gen-2 approach does not require (1) information on the nature or the extent of the failure, (2) knowledge of the control surface positions, or (3) information on aerodynamic failures or un-modeled parameters. This tracking controller adds direct adaptive neural network signals to the control law1,2,3,4. These neural networks are used to generate command augmentation signals to compensate for errors due to un-modeled dynamics, including dynamics due to damage or failure. Flight demonstration started early in the year 2006, on the NASA F-15 tail number 837. The F-15 6-degree-offreedom (6-dof) simulator was used in the evaluation test, comparing stabilator and canard failure compensation with the neural network algorithm.
Studies in Cognition: The Problems Solved and Created by Transcranial Magnetic Stimulation
Authors: E. M. Robertson, H. Théoret, A. Pascual-leone
Venue: Journal of Cognitive Neuroscience (2003)

The application of transcranial magnetic stimulation (TMS) to investigate important questions in cognitive neuroscience has increased considerably in the last few years. TMS can provide substantial insights into the nature and the chronometry of the computations performed by specific cortical areas during various aspects of cognition. However, the use of TMS in cognitive studies has many potential perils and pitfalls. Although TMS can help bridge the gap between psychological models and brain-based arguments of cognitive functions, hypothesis-driven carefully designed experiments that acknowledge the current limitations of TMS are critical.
Operational analysis framework for emergency operations center preparedness training
Authors: Eytan Pollak, Mark Falash, Lorie Ingraham, Vivian Gottesman
Venue: Proceedings of the 36th conference on Winter simulation (2004)

As the U.S. Department of Homeland Security works to create an integrated emergency response system, it is evident that computer-based solutions can support this process. Individual commercial simulation packages and databases can provide a partial solution, but are not easily integrated to provide a comprehensive analysis of the events. To achieve model and domain knowledge integration, an analysis framework is developed to allow a broad range of simulation systems to share information, including inputs, models, and results. This analysis framework facilitates the combination of standalone scenarios into one master scenario where the overall chain-of-events can be analyzed and optimized. This paper describes a framework used in the simulation of an anthrax incident. The simulation modeled State, City, and Department of Health EOC processes executed under the Incident Command System (ICS). Hospital and distribution center models were integrated to add the effects and impact of the general population into the scenario.