ppxscal/embedding_network huggingface dataset:
Distributed algorithms for consistent replicated state
Authors: Yair Amir
Venue:  (2005)

All modern applications, in the current Internet, need to be distributed in order to be sufficiently fault tolerant, more efficient and able to serve a large number of clients. At the center of most distributed applications there is a need for maintaining consistent replicated state with varying consistency semantics. This thesis argues that maintaining consistent replicated state can be practical and can be done with purely distributed solutions that do not require central management and do not artificially relax consistency requirements. We introduce a new communication primitive, ZBCast, which provides Persistent Global Total Order to the set of participants and we use it to develop a transparent synchronous database replication architecture. We evaluate the performance of the ZBCast primitive compared to the state of the art and then we evaluate the performance of a prototype replicating a PostgreSQL database in both local and wide-area network environments proving the efficiency of the approach. We also analyze the current Domain Name System architecture and expose some of its limitations. We present a purely distributed architecture that can be deployed incrementally and in parallel with the existing system, addressing issues at both the zone management level as well as the global infrastructure level.
Prufrock: a framework for constructing polytypic theorem provers
Authors: Justin Ward, Garrin Kimmell, Perry Alexander
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in the verification of specified properties. Unfortunately, the implementation of each such tool requires an early commitment to a particular methodology and language, in terms of both high-level semantic concerns and the lower-level syntactic representations of properties and proofs. In this paper, we present Prufrock, a novel approach to automated reasoning systems, which abstracts semantic concerns over entire classes of potential implementation languages. Prufrock utilizes polytypic programming techniques to create independent, reusable modules defining proof in different logics, independent of the language used to represent formulae in the logic, as well as the exact implementation of low-level prover functionality.
Deployment of Simple User-Centered Collaborative Technologies in Educational Institutions - Experiences and Requirements
Authors: Thorsten Hampel, Harald Selke, Silke Vitt
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

In our modern society with its variety of learning and work processes, collaborative structuring of knowledge plays an important role. With new and wiki systems, this paper looks at the various ways of organizing collaboration in virtual knowledge spaces. As part of a novel teaching concept - embedded in a system for cooperative knowledge organizationspatial structuring of knowledge forms an essential part of teaching and learning. Based on the evaluation results of this concept, the paper focuses on collaborative writing methods and the requirements of tools used with special consideration of wikis. It then goes on to describe the concrete realization of a fusion of semantic-spatial structuring techniques and collaborative writing considering as example the integration of wiki techniques into virtual knowledge spaces.
WebOS: say goodbye to desktop applications
Authors: Aaron Weiss
Venue: netWorker (2005)

Some call it the second coming of the dot-coms. The blogosphere is buzzing, and new buzzwords are minted daily in the press: "Web 2.0," "Weblications," and "WebOS"---the Web-based Operating System. Email, the Internet's first killer app, has now largely migrated from the desktop to the Web. Instant messaging, word processing, and even spreadsheets aren't far behind. Something is happening here, as Bob Dylan once sang, but do we know what it is?
Recognition of On-Line Handwritten Mathematical Expressions in the E-Chalk System - An Extension
Authors: Ernesto Tapia, Raul Rojas
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This article introduces the new version of our system for the recognition of on-line handwritten mathematical expressions. The previous version was capable to recognize the most common mathematical expressions, such as expressions of calculus, following the usual mathematical conventions. This version improves and extends our technique, allowing the recognition of structures described by tabular and multiline arrangements, such as matrices and systems of equations. The recognition results are stored in a composite of symbols, which are used by computer algebra systems for algebraic computations, and function plotting. The system is embedded as an intelligent assistant in the Electronic Chalkboard (E-Chalk), a system for the live transmition and storage of lectures.
Design and Implementation of Grid Monitoring System Based on GMA
Authors: Jianwei Liao, Hongbin Cai, Pandeng Jiang, Meirong Chen
Venue: Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (2005)

Grid requires scalable mechanisms that can be used to obtain the information of resources in Grid environment. In this paper, we analyzed the aims and main tasks of Grid Monitoring and the advantage of GMA (Grid monitoring Architecture), then proposed a java-based design pattern of Grid Monitoring System (JGMS) on the basis of GMA. The JGMS use special agents to complete the communication between Producer and Consumer in the different grid nodes. So, it can work on different platforms, pass through firewalls and be easy to deploy and use.
Smile and Laughter Recognition using Speech Processing and Face Recognition from Conversation Video
Authors: Akinori Ito, Xinyue Wang, Motoyuki Suzuki, Shozo Makino
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

This paper describes a method to detect smiles and laughter sounds from the video of natural dialogue. A smile is the most common facial expression observed in a dialogue. Detecting a user's smiles and laughter sounds can be useful for estimating the mental state of the user of a spoken-dialogue-based user interface. In addition, detecting laughter sound can be utilized to prevent the speech recognizer from wrongly recognizing the laughter sound as meaningful words. In this paper, a method to detect smile expression and laughter sound robustly by combining an image-based facial expression recognition method and an audio-based laughter sound recognition method. The image-based method uses a feature vector based on feature point detection from face images. The method could detect smile faces by more than 80% recall and precision rate. A method to combine a GMM-based laughter sound recognizer and the image-based method could improve the accuracy of detection of laughter sounds compared with methods that use image or sound only. As a result, more than 70% recall and precision rate of laughter sound detection was obtained from the natural conversation videos.
Exploiting temporal discontinuities for event detection and manipulation in video streams
Authors: Hugh Denman, Erika Doyle, Anil Kokaram, Daire Lennon, Rozenn Dahyot, Ray Fuller
Venue: Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval (2005)

Discontinuities in any information bearing signal serve to represent much of the vital or interesting content in that signal. A sharp loud noise in a movie could be a gun, or something breaking. In sports like tennis, cricket or snooker/pool it would indicate a point scoring event. In both cases the discontinuity is likely to be semantically relevant without further inference being necessary, once a particular domain is adopted. This paper discusses the importance of temporal motion discontinuities in inferring events in visual media. Two particular application domains are considered: content based audio/video synchronisation and event spotting in observational Psychology.
The Software/Hardware Co-Debug Environment with Emulator
Authors: Baodong Yu, Xuecheng Zou
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

It is a challenge to debug the software and hardware in the SOC for that neither the software nor the hardware is error-free. By combining the emulator and the simulator, with the new software debug engine, the new bus status monitor, and the new checkpoint technology, the high speed, easy-used software/hardware co-debugging environment is presented in this paper.
A multi-path routing service for immersive environments
Authors: Sherlia Shi, Lili Wang, K. L. Calvert, J. N. Griffioen
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

The Metaverse project aims to develop technology for low-cost, high-resolution networked immersive display environments that can be used for distributed collaboration, exploration of 3D data models, scientific visualization, and other Grid-related applications. Such applications often deal with massive data sets and need a high-capacity, low-latency transport service to effectively connect distant locations across the wide-area (best-effort) Internet. This work presents the initial design of such an end-to-end transport service for Metaverse applications, along with results of a simulation study evaluating its effectiveness. The transport service features an application programming interface providing enhanced control over the way resources are allocated to data objects, and uses multiple overlay-based end-to-end paths to increase bandwidth delivered to the application.
A Comparison of Binarization Methods for Historical Archive Documents
Authors: J. He, Q. D. M. Do, A. C. Downton, J. H. Kim
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper compares several alternative binarization algorithms for historical archive documents, by evaluating their effect on end-to-end word recognition performance in a complete archive document recognition system utilising a commercial OCR engine. The algorithms evaluated are: global thresholding; Niblack's and Sauvola's algorithms; adaptive versions of Niblack's and Sauvola's algorithms; and Niblack's and Sauvola's algorithms applied to background removed images. We found that, for our archive documents, Niblack's algorithm can achieve better performance than Sauvola's (which has been claimed as an evolution of Niblack's algorithm), and that it also achieved better performance than the internal binarization provided as part of the commercial OCR engine.
Gene expression time series modeling with principal component and neural network
Authors: S. I. Ao, M. K. Ng
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2006)

In this work, gene expression time series models have been constructed by using principal component analysis (PCA) and neural network (NN). The main contribution of this paper is to develop a methodology for modeling numerical gene expression time series. The PCA-NN prediction models are compared with other popular continuous prediction methods. The proposed model can give us the extracted features from the gene expressions time series and the orders of the prediction accuracies. Therefore, the model can help practitioners to gain a better understanding of a cell cycle, and to find the dependency of genes, which is useful for drug discoveries. Based on the results of two public real datasets, the PCA-NN method outperforms the other continuous prediction methods. In the time series model, we adapt Akaike's information criteria (AIC) tests and cross-validation to select a suitable NN model to avoid the overparameterized problem.
Continuous Query Processing of Spatio-Temporal Data Streams in PLACE
Authors: Mohamed F. Mokbel, Xiaopeng Xiong, Moustafa A. Hammad, Walid G. Aref
Venue: Geoinformatica (2005)

The tremendous increase in the use of cellular phones, GPS-like devices, and RFIDs results in highly dynamic environments where objects as well as queries are continuously moving. In this paper, we present a continuous query processor designed specifically for highly dynamic environments (e.g., location-aware environments). We implemented the proposed continuous query processor inside the PLACE server (Pervasive Location-Aware Computing Environments); a scalable location-aware database server developed at Purdue University. The PLACE server extends data streaming management systems to support location-aware environments. These environments are characterized by the wide variety of continuous spatio-temporal queries and the unbounded spatio-temporal streams. The proposed continuous query processor includes: (1) New incremental spatio-temporal operators to support a wide variety of continuous spatio-temporal queries, (2) Extended semantics of sliding window queries to deal with spatial sliding windows as well as temporal sliding windows, and (3) A shared-execution framework for scalable execution of a set of concurrent continuous spatio-temporal queries. Experimental evaluation shows promising performance of the continuous query processor of the PLACE server.
A supervised training algorithm for self-organizing maps for structures
Authors: Markus Hagenbuchner, Ah Chung Tsoi
Venue: Pattern Recognition Letters (2005)

Recent developments with self-organizing maps allow the application to graph structured data. This paper proposes a supervised learning technique for self-organizing maps for structured data. The ideas presented in this paper differ from Kohonen's approach in that a rejection term is introduced. This approach is superior because it is more robust to the variation of the number of different classes in a dataset. It is also more flexible because it is able to efficiently process data with missing or incomplete class information, and hence, includes the unsupervised version as a special case. We demonstrate the capabilities of the proposed model through an application to a relatively large practical data set from the area of image recognition, viz., logo recognition. It is shown that by adding supervised learning to the learning process the discrimination between pattern classes is enhanced, while the computational complexity is similar to that of the unsupervised version.
Study on Application of a Quantitative Evaluation Approach for Software Architecture Adaptability
Authors: Xia Liu, Qing Wang
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

Due to the rapid changes of business environment and changing technologies, adaptability and measurement of the degree to which software is adaptable are critical factors for survival of software systems. Software are often claimed to be adaptable, however there is no explicit and concrete definition of architecture adaptability. This paper first gives a definition of architecture adaptability, and then presents a metric and a quantitative evaluation approach to evaluate the architecture adaptability based on adaptability scenario profile and impact analysis. The purpose of this study is to provide a structural adaptability evaluation method to support architecture improving and decision making for choosing among candidate architectures.
MEP: A 3D PIC code for the simulation of the dynamics of a non-neutral plasma
Authors: Yu. Tsidulko, R. Pozzoli, M. Romé
Venue: Journal of Computational Physics (2005)

The three-dimensional evolution of a pure electron plasma is studied by means of a newly developed particle-in-cell code which solves the drift-Poisson system where kinetic effects in the motion parallel to the magnetic field are taken into account. Different results relevant to the non-linear dynamics of trapped plasmas and low-energy electron beams are presented.
Modular General Fuzzy Hypersphere Neural Network
Authors: Pradeep M. Patil, S. N. Kulkarni, A. J. Patil, D. D. Doye, U. V. Kulkarni
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

This paper describes Modular General Fuzzy Hypersphere Neural Network (MGFHSNN) with its learning algorithm, which is an extension of General Fuzzy Hypersphere Neural Network (GFHSNN) proposed by Kulkarni, Doye and Sontakke [1] that combines supervised and unsupervised learning in a single algorithm so that it can be used for pure classification, pure clustering and hybrid classification/clustering. MGFHSNN offers higher degree of parallelism since each module is exposed to the patterns of only one class and trained without overlap test and removal, unlike in Fuzzy Hypersphere Neural Network (FHSNN) [2], leading to reduction in training time. In proposed algorithm each module captures peculiarity of only one particular class and found superior in terms of generalization and training time with equivalent testing time. Thus, it can be used for voluminous realistic database, where new patterns can be added on fly.
A mutual semantic endorsement approach to image retrieval and context provision
Authors: Jia Li
Venue: Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval (2005)

Learning semantics from annotated images to enhance content-based retrieval is an important research direction. In this paper,annotation data are assumed available for only a subset of images inside the database. An on the fly learning method is developed to capture the semantics of query images. Specifically, the semantics of annotated images in a visual proximity of a query are compared with each other to determine the amount of mutual endorsement. An image is considered endorsed by another if they possess similar semantics. Annotations with high mutual endorsement are used to narrow down a candidate pool of images. The new retrieval method is inherently dynamic and treats seamlessly different forms of annotation data. Experiments show that semantic endorsement can increase precision by as much as 70%in average for a wide range of parameter settings. We also develop a context provision mechanism to reveal the relationship between a query and semantic clusters extracted from the database. Context helps users explore the content of a database and provides a platform for them to tailor searches by stressing different perspectives in the interpretation of a query.
Year-end cleanup
Authors: Richard Mateosian
Venue: IEEE Micro (2005)

The author reviews nine books on programming practices, communicating, and the Web.
Challenges in the implementation of low-k dielectrics in the back-end of line
Authors: R. J. O. M. Hoofman, G. J. A. M. Verheijden, J. Michelon, F. Iacopi, Y. Travaly, M. R. Baklanov, Zs. Tökei, G. P. Beyer
Venue: Microelectronic Engineering (2005)

The introduction of ultra low-k materials in copper technology has been much slower than anticipated in the ITRS Roadmap. The introduction of porosity in low-k materials has increased the level of complexity tremendously. In this paper, the challenges appearing during the integration of ultra low-k dielectrics will be discussed, since a proper understanding of these issues is essential for downscaling of the interconnect system. The inferior mechanical and thermal properties were always identified as main showstoppers for low-k integration. However, the extreme vulnerability of porous low-k to produces-induced damage (accompanied with the loss of dielectric performance and reliability) demands a continuous innovation of materials, processes and integration approaches.
Proceedings of the ACM symposium on Virtual reality software and technology
Venue: Virtual Reality Software and Technology (2005)

Welcome to VRST'05 in beautiful Monterey! This is the 12th year of the conference which started in Singapore in 1994. As in the previous years, the conference promises to be a platform for the highest quality technical presentations from a great mix of international researchers. We have included as many short papers as long ones in the program. This affords greater opportunity to present work in progress. Given the quality of papers in the program, we plan to edit special issues of at least two high-quality international journals from the conference.
Social Bookmarking in the Enterprise
Authors: David Millen, Jonathan Feinberg, Bernard Kerr
Venue: Queue (2005)

One of the greatest challenges facing people who use large information spaces is to remember and retrieve items that they have previously found and thought to be interesting. One approach to this problem is to allow individuals to save particular search strings to re-create the search in the future. Another approach has been to allow people to create personal collections of material&mdash;for example, the use of electronic citation bundles (called binders) in the ACM Digital Library. Collections of citations can be created manually by readers or through execution of (and alerting to) a saved search.
From Polling to Snowplowing
Authors: Iddo Eliazar
Venue: Queueing Systems: Theory and Applications (2005)

We study the limiting behavior of gated polling systems, as their dimension (the number of queues) tends to infinity, while the system's total incoming workflow and total switchover time (per cycle) remain unchanged. The polling systems are assumed asymmetric, with incoming workflow obeying general Lévy statistics, and with general inter-dependent switchover times. We prove convergence, in law, to a limiting polling system on the circle. The derivation is based on an asymptotic analysis of the stochastic Poincaré maps of the polling systems. The obtained polling limit is identified as a snowplowing system on the circle--whose evolution, steady-state equilibrium, and statistics have been recently investigated and are known.
Automatic verification of design patterns in Java
Authors: Alex Blewitt, Alan Bundy, Ian Stark
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Design patterns are widely used by designers and developers for building complex systems in object-oriented programming languages such as Java. However, systems evolve over time, increasing the chance that the pattern in its original form will be broken.To verify that a design pattern has not been broken requires specifying the original intent of the design pattern. Whilst informal descriptions of design patterns exist, no formal specifications are available due to differences in implementations between programming languages.We present a pattern specification language, Spine, that allows patterns to be defined in terms of constraints on their implementation in Java. We also present some examples of patterns defined in Spine and show how they are processed using a proof engine called Hedgehog.The conclusion discusses the type of patterns that are amenable to defining in Spine, and highlights some repeated mini-patterns discovered in the formalisation of these design patterns.