ppxscal/embedding_network huggingface dataset:
Efficient algorithms for block downdating of least squares solutions
Authors: Petko Yanev, Erricos J. Kontoghiorghes
Venue: Applied Numerical Mathematics (2004)

Five computationally efficient algorithms for block downdating of the least squares solutions are proposed. The algorithms are block versions of Givens rotations strategies and are rich in BLAS-3 operations. They efficiently exploit the triangular structure of the matrices. The theoretical complexities of the algorithms are derived and analyzed. The performance of the implementations confirms the theoretical results. The new strategies are found to outperform existing downdating methods.
A combined-nanoimprint-and-photolithography patterning technique
Authors: Xing Cheng, L. Jay Guo
Venue: Microelectronic Engineering (2004)

We propose a new lithography technique that combines the advantages of nanoimprint lithography (NIL) and photolithography. In this combined-nanoimprint-and-photolithography (CNP) technique, we introduce a hybrid maskmold made from UV transparent material and with a light-blocking metal layer placed on top of the mold protrusions. We demonstrate that the CNP method using such a hybrid mold can achieve resist patterns without residual layer, and the resist patterns can have higher aspect ratio than the feature on the mold. In addition, the photoresist used in the CNP technique can provide higher etching durability compared with thermal plastic polymers that are commonly used in NIL.
Poset-valued sets or how to build models for linear logics
Authors: Andrea Schalk, Valeria de Paiva
Venue: Theoretical Computer Science (2004)

We describe a method for constructing models of linear logic based on the category of sets and relations. The resulting categories are non-degenerate in general; in particular they are not compact closed nor do they have biproducts. The construction is simple, lifting the structure of a poset to the new category. The underlying poset thus controls the structure of this category, and different posets give rise to differently-flavoured models. As a result, this technique allows the construction of models for both, intuitionistic or classical linear logic as desired. A number of well-known models, for example coherence spaces and hypercoherences, are instances of this method.
A single CASE environment for teaching and learning
Authors: Mark Dixon
Venue: ACM SIGCSE Bulletin (2004)

This synopsis provides a description of a CASE Environment used within the education of software engineers.
STRIPES: an efficient index for predicted trajectories
Authors: Jignesh M. Patel, Yun Chen, V. Prasad Chakka
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Moving object databases are required to support queries on a large number of continuously moving objects. A key requirement for indexing methods in this domain is to efficiently support both update and query operations. Previous work on indexing such databases can be broadly divided into categories: indexing the past positions and indexing the future predicted positions. In this paper we focus on an efficient indexing method for indexing the future positions of moving objects.In this paper we propose an indexing method, called STRIPES, which indexes predicted trajectories in a dual transformed space. Trajectories for objects in d-dimensional space become points in a higher-dimensional 2d-space. This dual transformed space is then indexed using a regular hierarchical grid decomposition indexing structure. STRIPES can evaluate a range of queries including time-slice, window, and moving queries. We have carried out extensive experimental evaluation comparing the performance of STRIPES with the best known existing predicted trajectory index (the TPR*-tree), and show that our approach is significantly faster than TPR*-tree for both updates and search queries.
Distributed parallel computing using navigational programming
Authors: Lei Pan, Ming Kin Lai, Koji Noguchi, Javid J. Huseynov, Lubomir F. Bic, Michael B. Dillencourt
Venue: International Journal of Parallel Programming (2004)

Message Passing (MP) and Distributed Shared Memory (DSM) are the two most common approaches to distributed parallel computing. MP is difficult to use, whereas DSM is not scalable. Performance scalability and ease of programming can be achieved at the same time by using navigational programming (NavP). This approach combines the advantages of MP and DSM, and it balances convenience and flexibility. Similar to MP, NavP suggests to its programmers the principle of pivot-computes and hence is efficient and scalable. Like DSM, NavP supports incremental parallelization and shared variable programming and is therefore easy to use. The implementation and performance analysis of real-world algorithms, namely parallel Jacobi iteration and parallel Cholesky factorization, presented in this paper supports the claim that the NavP approach is better suited for general-purpose parallel distributed programming than either MP or DSM.
On the Spread of Finite Simple Groups
Authors: M. Guralnick, Aner Shalev
Venue: Combinatorica (2003)

The spread of a &#xfb01;nite group is the maximal integer k so that for each k non-identity elements of G there is an element generating G with each of them. We prove an asymptotic result characterizing the finite simple groups of bounded spread. We also obtain estimates for the spread of the various families of finite simple groups, and show that it is at least 2, with possibly finitely many exceptions. The proofs involve probabilistic methods.
A Meta-Modeling Approach to Web Services
Authors: Fei Cao, Barrett R. Bryant, Wei Zhao, Carol C. Burt, Rajeev R. Raje, Andrew M. Olson, Mikhail Auguston
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

Web Services (WS) technology is becoming pervasive inthe development of distributed systems and is anappealing vehicle for service presentation andhorizontal integration. On the other hand, ModelIntegrated Computing (MIC) offers a means of systemintegration in the vertical direction by using domain-specificmodeling, and then synthesizing the softwaresystem from the high-level model using a model-specificgenerator. This paper presents a meta-modelingapproach to WS to explore the application of MIC inWS development and its contribution.
Applying Propositional Logic to Workflow Verification
Authors: Henry H. Bi, J. Leon Zhao
Venue: Information Technology and Management (2004)

The increasing complexity of business processes in the era of e-business has heightened the need for workflow verification tools. However, workflow verification remains an open and challenging research area. As an indication, most of commercial workflow management systems do not yet provide workflow designers with formal workflow verification tools. We propose a logic-based verification method that is based on a well-known formalism, i.e., propositional logic. Our logic-based workflow verification approach has distinct advantages such as its rigorous yet simplistic logical formalism and its ability to handle generic activity-based process models. In this paper, we present the theoretical framework for applying propositional logic to workflow verification and demonstrate that logic-based workflow verification is capable of detecting process anomalies in workflow models.
A scalable lock-free stack algorithm
Authors: Danny Hendler, Nir Shavit, Lena Yerushalmi
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

The literature describes two high performance concurrent stack algorithms based on combining funnels and elimination trees. Unfortunately, the funnels are linearizable but blocking, and the elimination trees are non-blocking but not linearizable. Neither is used in practice since they perform well only at exceptionally high loads. The literature also describes a simple lock-free linearizable stack algorithm that works at low loads but does not scale as the load increases. The question of designing a stack algorithm that is non-blocking, linearizable, and scales well throughout the concurrency range, has thus remained open.This paper presents such a concurrent stack algorithm. It is based on the following simple observation: that a single elimination array used as a backoff scheme for a simple lock-free stack is lock-free, linearizable, and scalable. As our empirical results show, the resulting elimination-backoff stack performs as well as the simple stack at low loads, and increasingly outperforms all other methods (lock-based and non-blocking) as concurrency increases. We believe its simplicity and scalability make it a viable practical alternative to existing constructions for implementing concurrent stacks.
Every Graph of Sufficiently Large Average Degree Contains a C4-Free Subgraph of Large Average Degree
Authors: Daniela K&#x00fc;hn, Deryk Osthus
Venue: Combinatorica (2004)

We prove that for every k there exists d=d(k) such that every graph of average degree at least d contains a subgraph of average degree at least k and girth at least six. This settles a special case of a conjecture of Thomassen.
Web-based Collaboration: A Key Tool for the Management of Corporate Information
Authors: Marek Suchocki
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

In recent years many organisations have had to cope with fewer available management and technical staff. Gan [Interdisciplinary Skills for Built environment Professionals - A Scoping Study] identified a 25% fall in UK Universityapplications for Built Environment Courses between 1994 and 1997. Construction projects have increasingly applied leading Information Technologies for design, planning, document control and process management which helps offset these issues. The reduction in skilled staff has also created an increasingly virtual team nature to projects, with Extranet tools now being employed on a regular basis. However, once projects are complete, few organisations address the need to capture project results for future work. This paper introduces the issues being addressed by an infrastructure client for the management of asset documentation throughout its lifecycle despite having fewer available staff. This includes the capture of legacy information and provision to capital projects, the management of new project data and the return of validated as-built documentation for whole-life asset management.
Multi-Path Algorithm for Triangle Strips
Authors: Petr Vanecek, Ivana Kolingerova
Venue: Proceedings of the Computer Graphics International (2004)

Triangle surface models belong to the most populartype of geometric objects description in computer graphics.Therefore, the problem of fast visualization of this typeof data is often solved. One of popular approaches is stripification,i.e., a conversion of triangle surface into strips oftriangles. This enables to reduce the rendering time by reductiondata size and by avoiding of redundant lighting andtransformations computations.In this paper we present a new stripification algorithmfor static fully triangulated meshes. Our new algorithmis based on the dual graph of triangulation. The experimentalresults show that our stripification produces muchlower number of triangle strips than other stripification algorithms(except one).
Estimating and Improving Protein Interaction Error Rates
Authors: Patrik D'haeseleer, George M. Church
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

High throughput protein interaction data sets have proven to be notoriously noisy. Although it is possible to focus on interactions with higher reliability by using only those that are backed up by two or more lines of evidence, this approach invariably throws out the majority of available data. A more optimal use could be achieved by incorporating the probabilities associated with all available interactions into the analysis.We present a novel method for estimating error rates associated with specific protein interaction data sets, as well as with individual interactions given the data sets in which they appear. As a bonus, we also get an estimate for the total number of protein interactions in yeast. Certain types of false positive results can be identified and removed, resulting in a significant improvement in quality of the data set. For co-purification data sets, we show how we can reach a tradeoff between the "spoke" and "matrix" representation of interactions within co-purified groups of proteins to achieve an optimal false positive error rate.
Restrictive clustering and metaclustering for self-organizing document collections
Authors: Stefan Siersdorfer, Sergej Sizov
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

This paper addresses the problem of automatically structuring heterogenous document collections by using clustering methods. In contrast to traditional clustering, we study restrictive methods and ensemble-based meta methods that may decide to leave out some documents rather than assigning them to inappropriate clusters with low confidence. These techniques result in higher cluster purity, better overall accuracy, and make unsupervised self-organization more robust. Our comprehensive experimental studies on three different real-world data collections demonstrate these benefits. The proposed methods seem particularly suitable for automatically substructuring personal email folders or personal Web directories that are populated by focused crawlers, and they can be combined with supervised classification techniques.
Ontology Cleaning by Mereotopological Reasoning
Authors: Jose A. Alonso-Jimenez, Joaquin Borrego-Diaz, Antonia M. Chavez-Gonzalez
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

A mereotopological semantics to manage ontologies is presented. The aim is to provide a formal basis for ontology cleaning. It allows us to arrange, in a consistent manner, the concepts in early steps of the building of an ontology as well as to repair anomalies. The semantics supports cleaning cycle that combines several AI techniques as closed world assumption, default reasoning on taxonomies and knowledge acquisition.
The Design and Implementation of a Directory Based Wireless Network Operation Management System
Authors: Ing-Yi Chen, Chao-Chi Huang, Chen-Hsin Tsai
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

The goal of this research is to implement a Hierarchical Wireless Network Operation Management System based on LDAP technology. The architecture of such a management system is particularly beneficial in reducing the cost of ownership for any information system built to enable device management service and AAA service - the two major services required by WISPs. Two subsystems have been successfully implemented in the proposed Wireless Network Operation Management System: Device Management Center and AAA Service Center. The results of this research can enhance WISPs' competitiveness significantly in todayýs demanding wireless market.
Travel Stories
Authors: Bob Colwell
Venue: Computer (2004)

Engineering is the name they give to the act of constantly being transported from one geographic location to another.
An Extended RBAC Model for Web Services in Business Process
Authors: Peng Liu, Zhong Chen
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

Web services are widely accepted and adopted to provide business functionality in business world. Especially, Web service is chosen to compose business process by companies to achieve their business objectives. Business process contains a set of activities, which represent business interactions between Web services spanning company boundaries. As Web services are built in open distributed environment, it is apt to cause security concerns. Security problems mainly prevent many companies from implementing Web services. This paper proposes an extended RBAC model, called WS-RBAC4BP, to protect web services in business process. In this model, companies and Web services are considered as subjects and protected objects, respectively. New types of constraints are introduced. Furthermore, the system architecture of WS-RABC4BP is presented. This paper also gives examples to illustrate the model.
Safety and power
Authors: Stavros M. Macrakis
Venue: ACM SIGSOFT Software Engineering Notes (1982)

Although the "question of safety vs. power in programming languages" is most interesting, Glass's letter [SEN 6:5 (Oct 81)] addresses only a peripheral issue, namely some (seemingly arbitrary) areas in which certain programming languages have required unsafe solutions.In order to focus discussion, let me propose a definition of safety: a practice is "safe" if it relies only on the language's semantics. Clearly, unsafe practices are in general not portable between compilers or machines. There appear to be two primary motivations for unsafe practices: efficiency and extra-linguistic operations. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Influence of surface stress on frequency of microcantilever-based biosensors
Authors: Q. Ren, Y.-P. Zhao
Venue: Microsystem Technologies (2004)

Microcantilever-based biosensors have been found increasing applications in physical, chemical, and biological fields in recent years. When biosensors are used in those fields, surface stress and mass variations due to bio-molecular binding can cause the microcantilever deform or the shift of frequency. These simple biosensors allow biologists to study surface biochemistry on a micro or nano scale and offer new opportunities in developing microscopic biomedical analysis with unique characteristics. To compare and illustrate the influence of the surface stress on the frequency and avoid unnecessary and complicated numerical solution of the resonance frequency, some dimensionless numbers are derived in this paper by making governing equations dimensionless. Meanwhile, in order to analyze the influence of the general surface stress on the frequency, a new model is put forward, and the frequency of the microcantilever is calculated by using the subspace iteration method and the Rayleigh method. The sensitivity of microcantilever is also discussed.
Using Enhancing Signals to Improve Specificity of ab initio Splice Site Sensors
Authors: Alexandre Tchourbanov, Hesham H. Ali, Jitender Deogun
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

In this paper, we describe a new approach to improve the precision of splice site annotation in human genes. The problem is known to be extremely challenging since the human splice signals are highly indistinct and frequent cryptic sites confuse signal sensors. There is a strong evidence that Exonic Splicing Enhancers (ESE) and Exonic Splicing Silencers (ESS) influence commitment to splicing at early stages. We propose the use of a Na¨ýve Bayesian Network (BN) combined with Boltzmann machine splice sites sensor, to improve the specificity of splice site prediction. The SpliceScan program is implemented to demonstrate feasibility of specificity enhancement based on ESE/ESS signals interactions. SpliceScan is more sensitive than GeneSplicer and NNSplice for the same specificity. The designed method is of particular value for ab initio gene annotation.
Discovering and Analyzing World Wide Web Collections
Authors: Sougata Mukherjea
Venue: Knowledge and Information Systems (2004)

With the explosive growth of the World Wide Web, it is becoming increasingly difficult for users to discover Web pages that are relevant to a topic. To address this problem we are developing a system that allows the collection and analysis of Web pages related to a particular topic. In this paper we present the system&#x2019;s overall architecture and introduce the focused crawler used by the system. We also discuss the various techniques we use to allow the user to analyze and gain useful insights about a collection. Finally, we present some statistics on the collections.
Toolglasses, marking menus, and hotkeys: a comparison of one and two-handed command selection techniques
Authors: Daniel L. Odell, Richard C. Davis, Andrew Smith, Paul K. Wright
Venue: Proceedings of Graphics Interface 2004 (2004)

This paper introduces a new input technique, bimanual marking menus, and compares its performance with five other techniques: static toolbars, hotkeys, grouped hotkeys, marking menus, and toolglasses. The study builds on previous work by setting the comparison in a commonly encountered task, shape drawing. In this context, grouped hotkeys and bimanual marking menus were found to be the fastest. Subjectively, the most preferred input method was bimanual marking menus. Toolglass performance was unexpectedly slow, which hints at the importance of low-level toolglass implementation choices.
The AGILO Robot Soccer Team&mdash;Experience-Based Learning and Probabilistic Reasoning in Autonomous Robot Control
Authors: Michael Beetz, Thorsten Schmitt, Robert Hanek, Sebastian Buck, Freek Stulp, Derik Schröter, Bernd Radig
Venue: Autonomous Robots (2004)

This article describes the computational model underlying the AGILO autonomous robot soccer team, its implementation, and our experiences with it. According to our model the control system of an autonomous soccer robot consists of a probabilistic game state estimator and a situated action selection module. The game state estimator computes the robot's belief state with respect to the current game situation using a simple off-the-shelf camera system. The estimated game state comprises the positions and dynamic states of the robot itself and its teammates as well as the positions of the ball and the opponent players. Employing sophisticated probabilistic reasoning techniques and exploiting the cooperation between team mates, the robot can estimate complex game states reliably and accurately despite incomplete and inaccurate sensor information. The action selection module selects actions according to specified selection criteria as well as learned experiences. Automatic learning techniques made it possible to develop fast and skillful routines for approaching the ball, assigning roles, and performing coordinated plays. The paper discusses the computational techniques based on experimental data from the 2001 robot soccer world championship.