ppxscal/embedding_network huggingface dataset:
Perturbation Theory for Factorizations of LU Type through Series Expansions
Authors: Froilán M. Dopico, Juan M. Molera
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

Component- and normwise perturbation bounds for the block LU factorization and block LDL$^*$ factorization of Hermitian matrices are presented. We also obtain, as a consequence, perturbation bounds for the usual pointwise LU, LDL$^*$, and Cholesky factorizations. Some of these latter bounds are already known, but others improve previous results. All the bounds presented are easily proved by using series expansions. Given a square matrix $A=L U$ having the LU factorization, and a perturbation $E$, the LU factors of the matrix $A+E= \widetilde{L} \widetilde{U}$ are written as two convergent series of matrices: $\widetilde{L} = \sum_{k=0}^{\infty} L_k$ and $\widetilde{U} = \sum_{k=0}^{\infty} U_k$, where $L_k = O(\|E\|^k)$, $U_k = O(\|E\|^k)$, and $L_0 = L$, $U_0 = U$. We present expressions for the matrices $L_k$ and $U_k$ in terms of $L$, $U$, and $E$. The domain and the rate of convergence of these series are studied. Simple bounds on the remainders of any order of these series are found, which significantly improve the bounds on the second-order terms existing in the literature. This is useful when first-order perturbation analysis is used.
Combining Matching Scores in Identification Model
Authors: Sergey Tulyakov, Venu Govindaraju
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

The paper discusses a problem of combining recognition scores for different classes produced by one recognizer during one recognition attempt. This problem arises in identifi- cation problems which we define as 1:N classification problems with big or variable N. By using artificial example we show that intuitive solution of making identification decision based solely on the best matching score is frequently suboptimal. Paper presents reasons for such behavior, and draws parallels with score normalization technique used in speaker identification. Two examples of real life applications illustrate the possible benefits of properly combining recognition scores.
Scalable real-time parallel garbage collection for symmetric multiprocessors
Authors: Guy Blelloch, Robert Harper
Venue:  (2001)

Garbage collection or automatic memory reclamation frees the programmer from the tedious and often error-prone task of memory deallocation. Since its incorporation into LISP in 1970, it has proved popular among high-level and safe programming languages such as Perl, ML, and Java. Due to the disruption of collection on the application, past efforts have concentrated on bounding application pause times by collecting incrementally or by using a multiprocessor. However, these sometimes successful collectors are not suitable for providing both scalable parallelism and real-time response at the same time. This thesis describes the first parallel, real-time garbage collection algorithm. Using an abstract symmetric multiprocessor model, we prove space and time bounds guaranteeing that every application pause is constant and that the collector takes bounded space. The possibility of multiple collector and application threads executing simultaneously requires careful synchronization to preserve correctness. To achieve real-time bounds, large objects must be copied incrementally and particular attention must be paid to turning the collector on and off. Finally, load-balancing using a scalable stack or queue provides good parallelism. In order to make the algorithm practical for incorporation into a runtime system, two types of changes are necessary. First, most compilers require a richer interface including stacks and global variables. Also, we must eliminate certain constructs in the abstract model that have no obvious translation. The difficulty in these modifications lies in preserving the other properties of the collector. Second, algorithmic changes for improving performance were adopted. These modifications reduce collection overhead and memory consumption. The resulting algorithm has been implemented in the context of the TILT/SML compiler. Using a set of 15 benchmarks, the collector was tested on an Enterprise 10K. In the 5 ms range, the collector is able to always provide the application with 15% to 35% access to the processor even when the collector is on. As for scalability, the collector gives a speedup of 24 to 29 when running with 32 processors. The collector's speedup is, in all cases, greater than that of the application.
Web Service Interactions: Analysis and Design
Authors: Jianwen Su
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

A fundamental promise of the web services paradigm lies in the ease of sharing information and resources that are provided in the form of web processes. A common approach to support such sharing is to allow web processes to interact through an asynchronous messaging mechanism. This approach lies in the core of many web services standards (SOAP, WSDL, BPEL, WS-CDL, WSCL ...). In this talk, we examine web service interaction models and formalizing some of them into the concept of a "conversation" that captures ordering constraints on messages during web service interactions. We will discuss a few technical results based on the conversation model. For example, the use of FIFO queues for incoming messages has a significant impact on conversations, and therefore is an important design decision. We also present technical results concerning static analysis and automated design of web services in the conversation model. Jianwen Su is a Professor of Computer Science at the University of California, Santa Barbara. He received the B.S. and M.S. degrees from the Fudan University, and the Ph.D. degree from University of Southern California, and held visiting positions at Bell Labs and INRIA. He has published over 80 journal and conference papers concerning data models and query languages, scientific and spatial databases, workflow, formal verification, and most recently web services. His current work on web services focuses on modeling and analysis of web service behaviors and compositions. He has served or is serving on program committees of many conferences including PODS, VLDB, SSTD, SSDBM, ICSOC, etc. and was the general chair of the ACM SIGMOD 2001 conference, is a program co-chair of 2005 IEEE Conference on Web Services (ICWS).
Using Statistical Transformations to Improve Compression for Linear Decompressors
Authors: Samuel I. Ward, Chris Schattauer, Nur A. Touba
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

Linear decompressors are the dominant methodology used in commercial test data compression tools. However, they are generally not able to exploit correlations in the test data, and thus the amount of compression that can be achieved with a linear decompressor is directly limited by the number of specified bits in the test data. The paper describes a scheme in which a non-linear decoder is placed between the linear decompressor and the scan chains. The nonlinear decoder uses statistical transformations that exploit correlations in the test data to reduce the number of specified bits that need to be produced by the linear decompressor. Given a test set, a procedure is presented for selecting a statistical code that effectively "compresses" the number of specified bits (note that this is a novel and different application of statistical codes from what has been studied before and requires new algorithms). Results indicate that the overall compression can be increased significantly using a small non-linear decoder produced with the procedure described in this paper.
Dempster-Shafer Evidence Theory of Information Fusion Based on Infoevolutionary Value for E-business with Continuous Improvement
Authors: Zhiling Yu, Yezhuang Tian, Bao Xi
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Continuous improvement is the typical field of ebusiness information fusion in terms of multi-source data. This research proposes a hybrid Dampster- Shafer method with entropy and information value coevolutionary for desegregation data. The result shows, the modified theory is a multi-criteria decision tool for information fusion in decreasing the information uncertainty effectively, which can advance the ebusiness performance of continuous improvement process and quality control.
SP2A: a service-oriented framework for P2P-based Grids
Authors: M. Amoretti, F. Zanichelli, G. Conte
Venue: Proceedings of the 3rd international workshop on Middleware for grid computing (2005)

Service-Oriented Architectures (SOAs) are rapidly becoming the key approach for achieving new levels of interoperability and scalability in the development of Grid applications. Within SOA solutions, current approaches for advertising service providers and for allowing prospective clients to discover them are mostly based on centralized registries. Envisioning Virtual Organizations in which all participants are both resource providers and consumers, in a peer-to-peer fashion, seems to be an appealing approach.In this paper we propose the Service-oriented Peer-to-Peer Architecture (SP2A), a framework enabling peer-to-peer resource sharing in Grid environments. Resources are not directly exposed but can be accessed through Resource Provision Services, whose semantically enriched interfaces are published in the network. The framework has been implemented as a Java API, which currently supports a number of important technologies such as JXTA (peer-to-peer routing), Web Services (service deployment), and OWL-S (semantic description of services).
The Telescience Tools: Version 2.0
Authors: Abel W. Lin, Lu Dai, Khim Ung, Jeff Mock, Steven T. Peltier, Mark H. Ellisman
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

For over the last decade, researchers at the National Center for Microscopy and Imaging Research (NCMIR, http://ncmir.ucsd.edu) have been developing and implementing novel technologies to propel collaborative research. NCMIR has built flexible high throughput, cyberinfrastructure environments which connect researchers to advanced imaging instruments datagrids and computational grids. Through the integration of pioneering research in remote instrumentation research (known as TelemicroscopyTM) and grid based distributed computing and data management, this group demonstrated this vision in the context of The TelescienceTM Project (https://telescience.ucsd.edu). Telescience provides an end-to-end, single sign-on solution for biomedical image analysis and structure-functioncorrelation that integrates users with resources and applications with unified security and without prohibitive complexity. Here, we describe the flattening and generalization of the layers of software that make up the Grid-based system architecture of the project. In particular, we focus on the maturation and generalization of the architecture, including the development of an Application to Middleware Interaction Component (ATOMIC) services fabric that streamlines application integration with core grid middleware. This broadening of the overall Grid service architecture is the product of over 6 years of user-developer iterative software refinement cycles which have resulted in a suite of Telescience Tools that provide generalized solutions for increasing the interoperability of user interfaces (web portals and applications) and externally addressable Grid resources (instruments and computers).
Finding Competitive Advantage in Requirements Analysis Education
Authors: Takashi Fuji
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Competitive advantage is most important in systems development. It can be created in requirements analysis of the life cycle. This paper shows the framework for finding competitive advantage in requirement analysis. The framework has been used for systems development in the life insurance industry and some research in the e-learning field. University students have used the framework in systems analysis exercises. It was found that the framework is an effective method for finding competitive advantage in requirements analysis.
Interoperation with network services
Authors: Armando Fox
Venue:  (2005)

The success of the Web and the emergence of ubiquitous computing (the embedding of computation and networking in the physical environment) has led to the re-emergence of the network service paradigm. A network service is a software component (e.g. a search engine) or a device (e.g. a media player) that exports a well-defined, network-accessible programmatic interface. The purpose of the network services paradigm is to provide a standard mechanism for discovering and accessing resources in the network. Two fundamental problems arise in this context: (1) how do (human) users discover and interact with services? and (2) how do applications discover and interact with services? Concerning user discovery and interaction, existing service frameworks have several drawbacks. First, most existing service frameworks limit users to accessing services from a specific platform (e.g., a Web browser) or modality (e.g., graphical user interfaces). Second, users are usually limited to interacting with one service at a time, making it tedious to accomplish tasks involving multiple services. Third, as users access similar services from different providers, they are likely to see different user interfaces, leading to an inconsistent user experience. In this thesis, we present the design and implementation of a service framework called ICrafter that addresses these limitations. We evaluated our contributions by deploying ICrafter in the iRoom, our testbed laboratory, and testing it on a number of iRoom services. Concerning application discovery and interaction, a major drawback of existing service frameworks is that changes to service interfaces, such as might occur due to versioning and extensions, break interoperability with existing applications in unpredictable ways. To remedy this, we first show how to automatically determine which changes to a service interface affect a given application written to that interface. Second, we show how these application-relevant changes can be &ldquo;resolved&rdquo; and interoperation re-enabled. We implemented these contributions in a system called AMIBA. Experimental results indicate that (typically) resolving 20% of the changes is sufficient to enable interoperation (because 80% of the changes are typically not relevant to a given application), thus demonstrating the utility of our approach.
An MPI prototype for compiled communication on Ethernet switched clusters
Authors: Amit Karwande, Xin Yuan, David K. Lowenthal
Venue: Journal of Parallel and Distributed Computing (2005)

Compiled communication has recently been proposed to improve communication performance for clusters of workstations. The idea of compiled communication is to apply more aggressive optimizations to communications whose information is known at compile time. Existing MPI libraries do not support compiled communication. In this paper, we present an MPI prototype, CC-MPI, that supports compiled communication on Ethernet switched clusters. The unique feature of CC-MPI is that it allows the user to manage network resources such as multicast groups directly and to optimize communications based on the availability of the communication information. CC-MPI optimizes one-to-all, one-to-many, all-to-all, and many-to-many collective communication routines using the compiled communication technique. We describe the techniques used in CC-MPI and report its performance.The results show that communication performance of Ethernet switched clusters can be significantly improved through compiled communication.
Efficient Integration of Bimodal Branch Prediction and Pipeline Analysis
Authors: Iain Bate, Ralf Reutemann
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Advanced microarchitectural features such as caches and branch prediction mechanisms supporting speculative execution are becoming commonplace within modern microprocessors. For developers of real-time systems, these mechanisms present predictability problems. Previous work has demonstrated accurate analysis for instruction caches, data caches, and branch prediction mechanisms is possible. However, the integration of these individual analysis methods is difficult to do without large increases in computational complexity or the introduction of pessimism regarding the Worst-Case Execution Time (WCET) estimate. In this paper, we discuss how a previously published analysis method for branch predictors can be integrated with instruction pipeline analysis.
Design principles and techniques for enabling reboot-based administration in a persistent state storage system
Authors: Armando Fox
Venue:  (2005)

Managing large computer installations is complex and expensive. It is already the case that system administration accounts for a majority of the total cost of ownership, often costing 5 to 10 times more than the purchase price of hardware and software. Since long-running trends of decreasing hardware costs and increasing system complexity exacerbate the problem, ease of management will continue to be a critical system design challenge in the future. In this thesis, I focus on management of persistent state in Internet-scale systems. These systems are characterized by their large scale and dynamically changing environment. At the scale of hundreds or thousands of nodes, node failures are the common case, which makes failure handling an important area of administration on which to focus. When changes in workload or system environment are frequent, system evolution tasks such as scaling are also common tasks administrators must handle. Finally, since Internet applications serve requests globally for fractions of a penny per access, mechanisms for dealing with scale and change must meet the 24 x 7 availability and low cost requirements. The approach I take to simplifying state management is to first design the system to have low-cost reboot-based recovery. The properties of &ldquo;cheap&rdquo; recovery are that data remains available and data consistency is maintained throughout failure, failover, and recovery. Instead of affecting availability or consistency, failure and recovery manifests as minimal performance degradation that is predictable and bounded. With cheap recovery, system administration can be simplified in two ways. First, cheap recovery simplifies failure detection by lowering the cost of acting on false positives, which in turn, enables the use of statistical techniques to turn hard-to-catch failures, such as node degradation, into failure followed by recovery. Second, cheap recovery can be used to cast system evolution tasks like online data repartitioning into failure plus recovery to achieve zero-downtime incremental scaling. These low-cost failure handling and system evolution mechanisms make it possible for the system to be continuously self-adjusting, a key property of self-managing systems.
Effectively Utilizing Global Cluster Memory for Large Data-Intensive Parallel Programs
Authors: John Oleszkiewicz, Li Xiao, Yunhao Liu
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

Large scientific parallel applications demand large amounts of memory space. Current parallel computing platforms schedule jobs without fully knowing their memory requirements. This leads to uneven memory allocation in which some nodes are overloaded. This, in turn, leads to disk paging, which is extremely expensive in the context of scientific parallel computing. To solve this problem, we propose a new peer-to-peer solution called Parallel Network RAM. This approach avoids the use of disk, better utilizes available RAM resources, and will allow larger problems to be solved while reducing the computational, communication, and synchronization overhead typically involved in parallel applications. We proposed several different Parallel Network RAM designs and evaluated the performance of each under different conditions. We discovered that different designs are appropriate in different situations.
Visualization of Automated Trust Negotiation
Authors: Danfeng Yao, Michael Shin, Roberto Tamassia, William H. Winsborough
Venue: Proceedings of the IEEE Workshops on Visualization for Computer Security (2005)

We have designed an interactive visualization framework for the automated trust negotiation (ATN) protocol and we have implemented a prototype of the visualizer in Java. This framework provides capabilities to perform the interactive visualization of an ATN session, display credentials and policies, analyze the relations of negotiated components, and refine access control policies and negotiation strategies. We give examples of the visualization of ATN sessions and demonstrate the interactive features of the visualizer for the incremental construction of a trust target graph (TTG). Our prototype, which implements most components of the visualization framework, has played a key role in a research project that has developed working trust negotiation systems in an industrial environment.
A Parallel Algorithm for the Constrained Multiple Sequence Alignment Problem
Authors: Dan He, Abdullah N. Arslan
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

We propose a parallel algorithm for the constrained multiple sequence alignment (CMSA) problem that seeks an optimal multiple alignment constrained to include a given pattern. We consider the dynamic programming computations in layers indexed by the symbols of the given pattern. In each layer we compute as a potential part of an optimal alignment for theCMSAproblem, shortest paths for multiple sources and multiple destinations. These shortest paths problems are independent from one another (which enables parallel execution), and each can be solved using an A. algorithm specialized for the shortest paths problem for multiple sources and multiple destinations. The final step of our algorithm solves a single source single destination shortest path problem. Our experiments on real sequences show that our algorithm is faster in general than the existing sequential dynamic programming solutions.
Integrating security policies via Container Portable Interceptors
Authors: Tom Ritter, Rudolf Schreiner, Ulrich Lang
Venue: Proceedings of the 4th workshop on Reflective and adaptive middleware systems (2005)

In the past, it was very common to develop middleware without consideration of security from the very beginning. To integrate security, the middleware that should be protected has to provide appropriate hooks and interfaces, and has to meet the requirements of security. In most cases it is not possible to develop a new, secure middleware from scratch. It is only possible to make minor modification to existing systems. In this paper we describe the successful integration of a CORBA Component based middleware and a policy management framework for the definition, management and enforcement of security policies. Integration is achieved by defining Container Portable Interceptors and QoS Enablers which provide the necessary hooks for interception and provision of context interfaces to integrate the security framework.