ppxscal/embedding_network huggingface dataset:
Relative Performance of Preemption-Safe Locking and Non-Blocking Synchronization on Multiprogrammed Shared Memory Multiprocessors
Authors: Maged M. Michael, Michael L. Scott
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Most multiprocessors are multiprogrammed to achieve acceptable response time. Unfortunately inopportune preemption may significantly degrade the performance of synchronized parallel applications. To address this problem, researchers have developed two principal strategies for concurrent, atomic update of shared data structures: (1) preemption safe locking and (2) non blocking (lock free) algorithms. Preemption safe locking requires kernel support. Non blocking algorithms generally require a universal atomic primitive, and are widely regarded as inefficient. We present a comparison of the two alternative strategies, focusing on four simple but important concurrent data structures-stacks, FIFO queues, priority queues and counters-in microbenchmarks and real applications on a 12 processor SGI Challenge multiprocessor. Our results indicate that data structure specific non blocking algorithms, which exist for stacks, FIFO queues and counters, can work extremely well: not only do they outperform preemption safe lock based algorithms on multiprogrammed machines, they also out perform ordinary locks on dedicated machines. At the same time, since general purpose nonblocking techniques do not yet appear to be practical, preemption safe locks remain the preferred alternative for complex data structures: they outperform conventional locks by significant margins on multiprogrammed systems.
Architecture and design of a 40 gigabit per second ATM switch
Authors: Steven E. Butner, David A. Skirmont
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

This paper presents the architecture of a very high performance 4-input, 4-output asynchronous transfer mode (ATM) switch that has been designed as part of the ARPA-sponsored "Thunder and Lightning" project at the University of California, Santa Barbara. This research project is focused on the design and prototype demonstration of ATM links and switches operating at or above 40 gigabits per second per TDM link, with potential scalability to 100 Gbps. Such aggressive link rates place severe requirements on switch architecture, particularly the buffering scheme. In this paper we present the ATM switch structure and justify the main design choices.
Data Warehouse Clustering on the Web
Authors: Aristides Triantafillakis, Panagiotis Kanellis, Drakoulis Martakos
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

A distributed Data Warehouse can be defined as a logically integrated collection of shared data that is physically distributed across the nodes of a computer network, such as the Internet. In the context of the Internet and collaborative e-commerce environments datawarehouse refreshment requires a shift of emphasis from associating it purely with materialized view maintenance towards establishing a framework that supports refreshment in a federation of data warehouses. Adopting system and information quality as success variables we argue that what is required is inherently more complex than the materialized view maintenance problem and propose an open multi-agent architecture for the incremental maintenance of this kind of materialized views.
A WWW Based Software Metrics Environment for Software Process Management and Software Product Quality Improvement
Authors: Xiaoqing Liu, Ravi Viswanathan
Venue: 23rd International Computer Software and Applications Conference (1999)

The software process needs to be continuously improved to develop high quality software. However, with increasing specialization in the workforce and decentralization in the workplace, software process planning, monitoring, analysis and dynamic tuning in a heterogeneous distributed environment becomes a challenge. In this paper we describe a tool which takes advantage of emerging internet technology to implement a software metrics environment for software process management and software quality improvement. The tool uses a dimensional analytic model to visualize the software development process. The system offers facilities to monitor the status and quality attributes of projects being developed at multiple sites and on multiple platforms based on internet, Java, JDBC and a database system.
Evaluation of Certificate Revocation Policies: OCSP vs. Overissued-CRL
Authors: Jose L. Muñoz, Jordi Forné, Juan C. Castro
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Public key cryptography is widely used toprovide Internet se curity servic es. The PKI is the infrastructure that supports the public key cryptography and the revocation of certificates implies one of its major costs. In this paper we propose a model to compare revocation policies and we use it to compare the main revocation policies: OCSP and Overissued-CRL.
Compiling MATLAB Programs to ScaLAPACK: Exploiting Task and Data Parallelism
Authors: Shankar Ramaswamy, Eugene W. Hodges,  IV, Prithviraj Banerjee
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

In this paper we suggest a new approach aimed at reducing the effort required to program distributed-memory multicomputers. The key idea in our approach is to automatically convert a program written in a library-based programming language (MATLAB) to a parallel program based on the ScaLAPACK parallel library. In the process of performing this conversion, we apply compiler optimizations that simultaneously exploit task and data parallelism. As our results show, our approach is feasible and practical and our optimization provides significant performance benefits.
Spherical Maps Visualization
Authors: Francisco Mauro Alves Fonseca, Marcus Vinícius A. Andrade
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

In this work we developed a program to visualize spherical maps (maps on the sphere composed by arcs of circles, not necessarily geodesic ones) allowing the user to modify the position of the observer. Besides, it is possible to insert vertices and edges in a spherical map. The program was implemented using the C++ and the libraries OpenGL and wxWindows.
Relational Database Compression Using Augmented Vector Quantization
Authors: Wee Keong Ng, Chinya V. Ravishankar
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

Data compression is one way to alleviate the I/O bottleneck problem faced by I/O-intensive applications such as databases. However, this approach is not widely used because of the lack of suitable database compression techniques. In this paper, we design and implement a novel database compression technique based on vector quantization (VQ). VQ is a data compression technique with wide applicability in speech and image coding, but it is not directly suitable for databases because it is lossy. We show how one may use a lossless version of vector quantization to reduce database space storage requirements and improve disk I/O bandwidth.
Smoothing parameter selection for smoothing splines: a simulation study
Authors: Thomas C. M. Lee
Venue: Computational Statistics Data Analysis (2003)

Smoothing splines are a popular method for performing nonparametric regression. Most important in the implementation of this method is the choice of the smoothing parameter. This article provides a simulation study of several smoothing parameter selection methods, including two so-called risk estimation methods. To the best of the author's knowledge, the empirical performances of these two risk estimation methods have never been reported in the literature. Empirical conclusions from and recommendations based on the simulation results will be provided. One noteworthy empirical observation is that the popular method, generalized cross-validation, was outperformed by another method, an improved Akaike Information criterion, that shares the same assumptions and computational complexity.
DART: delay and routability driven technology mapping for LUT based FPGAs
Authors: Aigo Lu, Erik Dagless, Jonathan M. Saul
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

A two-phased approach for routability directed delay-optimal mapping of LUT based FPGAs is presented based on the results of stochastic routability analysis. First, delay-optimal mapping is performed which simultaneously minimizes area and delay. Then, the mapped circuits are restructured to alleviate the potential routing congestions. Experimental results indicate that the first phase creates designs which require 17% fewer levels and 40% fewer LUTs than MIS-pga (delay), 11% fewer levels and 37% fewer LUTs than FlowMap-r, and 5% fewer levels and 39% fewer LUTs than TechMap-D. The success of the second phase is confirmed by running a vendor's layout tool APR. It is observed that they are more routable and have less final delays than those produced by other mappers if they are placed and routed.
A Neural Approach to Classification of Satellite Images
Authors: Viviane Todt Diverio, Arthur Tórgo Gomez, Fernando Santos Osório, Leandro Toss Hoffmann, António Gabriel Rodrigues
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

This paper shows the results obtained using a traditional statistical method (Gaussian Maximum Likelihood) and Artificial Neural Networks (Back-Propagation and Cascade-Correlation) applied to multispectral Landsat Thematic Mapper data classification. The studied images cover a region situated in Rio Grande do Sul State - Brazil.
High speed rough classification for handwritten characters using hierarchical learning vector quantization
Authors: Yuuji Waizumi, Nei Kato, Kazuki Saruta, Yoshiaki Nemoto
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Today, high accuracy of character recognition is attainable using a neural network for problems with a relatively small number of categories. But for large categories, like Chinese characters, it is difficult to reach the neural network convergence because of the "local minima problem" and a large number of calculations. Studies are being done to solve the problem by splitting the neural network into some small modules. The effectiveness of the combination of learning vector quantization (LVQ) and back propagation (BP) has been reported. LVQ is used for rough classification and BP is used for fine recognition. It is difficult to obtain high accuracy for rough classification by LVQ itself. To deal with this problem, we propose hierarchical learning vector quantization (HLVQ). HLVQ divides categories in feature space hierarchically in the learning procedure. The adjacent feature spaces overlap each other near the borders. HLVQ possesses both classification speed and accuracy due to the hierarchical architecture and the overlapping technique. In the experiment using ETL9B, the largest database of handwritten characters in Japan, (includes 3036 categories, 607,200 samples), the effectiveness of HLVQ was verified.
Capabilities for E-Commerce
Authors: Alfs T. Berztiss
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Properly applied principles of business reengineering (BRE) continue to be valid. Since the shift to e-commerce inanorganization is a form of reengineering, BRE is relevant toe-commerce. This allows us to adapt a BRE process for the context of e-commerce. However, in order for an organization to support a process, it needs certain capabilities. We define a capability maturity model for e-commerce. Our process definitions apply to B2C and B2B, but emphasis is on consumers participating in B2B.
A Toolkit for Constraint Management in Heterogeneous Information Systems
Authors: Sudarshan S. Chawathe, Hector Garcia-Molina, Jennifer Widom
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

We present a framework and a toolkit to monitor and enforce distributed integrity constraints in loosely coupled heterogeneous information systems. Our framework enables and formalizes weakened notions of consistency, which are essential in such environments. Our framework is used to describe (1) intelfaces provided by a database for the data items involved in inter-site constraints; (2) strategies for monitoring and enforcing such constraints, (3) guarantees regarding the level of consistency the system can provide. Our toolkit uses this framework to provide a set of configurable modules thatare used to monitorand en- force constraints spanning loosely coupled heterogeneous information systems.
Preprocessing Opportunities in Optimal Numerical Range Partitioning
Authors: Tapio Elomaa, Juho Rousu
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

We show that only the segment borders have to be taken into account as cut point candidates in searching for theoptimal multisplit of a numerical value range with respect to convex attribute evaluation functions. Segment borders can be found efficiently in a linear-time preprocessing step. With Training Set Error, which is not strictly convex, the data can be preprocessed into an even smaller number of cut point candidates, called alternations, when striving for the optimal partition. We show that no segment borders(resp. alternations) can be overlooked with strictly convex functions (resp. Training Set Error) without risking to lose optimality. Our experiments show that while in real-world domainssignificant reduction in the number of cut point candidates can be obtained for Training Set Error, the number of segment borders is usually not much lower than that of boundary points.
Image Compression via TRITREE Decomposition
Authors: Vânia Cordeiro Da Silva, João de Carvalho
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

The work presents a new method for image compression, using tritree decomposition (TT). TT was originally proposed by Wille (1992) for generation of non-structured finite element meshes for numerical solution of differential equation systems. TT decomposition is similar to quadtree decomposition (QT), which has been broadly used by image processing algorithms, mainly for segmentation and compression. However, while QT subdivides the image into progressively smaller quadratic regions, TT decomposition subdivides the image into triangular regions. The goal is to segment the image into a set of triangular homogeneous regions, where the differences among the pixel values don't exceed a certain threshold. A tree is built to represent the decomposition. Each triangle will be a node of the tree TT. The initial triangle, that contains the whole image, is the root of the tree. The final triangles, representing the compressed image, are the leaves of the tree. Reconstruction of the image is accomplished by planar interpolation among the vertices of each triangular leaf.
Distributed and Concurrent Development Environment via Sharing Design Information
Authors: Kiyoh Nakamura, Yoshinobu Fujii, Yukio Kiyokane, Masami Nakamura, Katsuhiko Hinenoya, Yeo Hua Peck, Siow Choon-Lian
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

This paper discusses a global environment for support of distributed concurrent software development with an emphasis on sharing design information. There are many issues to be resolved in global software development such as communication gaps between distributed sites, guaranteed access to the latest information and specification and design resources, accurate and flexible coordination of project tasks, and a work environment that is independent of the infrastructure at the sites. The mechanism whereby concurrent development and concurrent workflow management are synchronized should be the key point. We will propose our approach to sharing design information with respect to the above issues. We adopt Standard Generalized Markup Language (SGML), the international standard for document description and exchange of electronic documents, as our design document standard. We will introduce a sophisticated document management system to support information sharing, and many information-sharing applications that can be effectively realized by using the features of SGML.
RPCL-Based Local PCA Algorithm
Authors: Zhiyong Liu, Lei Xu
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Mining local structure is important in data analysis.Gaussian mixture is able to describe local structurethrough the covariance matrices, but when used on high dimensional data, fitly specifying such a large number of d(d + 1)=2 free elements in each covariance matrix is difficult. In this paper, by constraining the covariance matrixin decomposed orthonormal form, we propos a Local PCAalgorithm to tackle this problem in help of RPCL competitivelearning, which can automatically determine the number of local structure.
Sparse Hypercube: A Minimal k-Line Broadcast Graph
Authors: Satoshi Fujita, Arthur M. Farley
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k during any time unit.
Matching Software Fault Tolerance with Application Needs
Authors: Eltefaat Shokri, Herbert Hecht
Venue: The 3rd IEEE International Symposium on High-Assurance Systems Engineering (1998)

The designation "fault tolerant software" has been used for techniques ranging from roll-back and retry to N-version programming, from data mirroring to functional redundancy. If the term is to be meaningful, qualifying definitions are required. This paper attempts to provide these by analyzing the capabilities of representative software fault tolerance techniques described in prior literature and matching these with the needs of representative environments in which fault tolerance may be applied.This paper suggests five categories for comparison of application needs and fault-tolerance capabilities: accuracy, deadline, state preservation, coverage, and economy of resources. It then shows how representative needs and capabilities can be characterized in identical terms by these categories. Algorithms are developed for either ranking (ordering) the importance of categories or assigning weighting factors to them. The algorithms suggest partially-suitable matches where there is no complete match between the application needs and the capabilities of fault-tolerance techniques. Examples of the selection technique are presented.
Index translation schemes for adaptive computations on distributed memory multicomputers
Authors: Bongki Moon, Mustafa Uysal, Joel H. Saltz
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Current research in parallel programming is focused on closing the gap between globally indexed algorithms and the separate address spaces of processors on distributed memory multicomputers. A set of index translation schemes have been implemented as a part of CHAOS runtime support library, so that the library functions can be used for implementing a global index space across a collection of separate local index spaces. These schemes include two software-cached translation schemes aimed at adaptive irregular problems as well as a distributed translation table technique for statically irregular problems. To evaluate and demonstrate the efficiency of the software-cached translation schemes, experiments have been performed with an adaptively irregular loop kernel and a full-fledged 3D DSMC code from NASA Langley on the Intel Paragon and Gray T3D. This paper also discusses and analyzes the operational conditions under which each scheme can produce optimal performance.
Object-Oriented Software Testing: Some Research and Development
Authors: David Chenho Kung, Pei Hsia, Yasufumi Toyoshima, Cris Chen, Jerry Gao
Venue: The 3rd IEEE International Symposium on High-Assurance Systems Engineering (1998)

It is widely accepted that the OO paradigm will significantly increase software reusability, extendibility, interoperability, and reliability. This is also true for high assurance systems engineering, provided that the systems are tested adequately. Software testing is an important software quality assurance activity to ensure that the benefits of OO programming will be realized. OO software testing has to deal with new problems introduced by the powerful new features of OO languages. The objective of this article is to review some of the existing researches in OO software testing, in particular, the research at the University of Texas at Arlington.
Mobile Communications Technologies for Young Adult Learning and Skills Development (m-Learning)
Authors: Jill Attewell, Mikael Gustafsson
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

The m-learning project will develop prototype products to provide information and modules of learning via inexpensive portable technologies which are already owned by, or readily accessible for, the majority of EU young adults. The products seek to attract young adultsto learning and assist in the development and achievement of lifelong learning objectives. M-Learning's target audiences are young adults who are not in education or training (including the unemployed), and those who are mobile, casual/temporary/self-employed or in low paid/ low skill employment, with literacy or numeracy development needs.
An Environment for Mobile Context-Based Hypermedia Retrieval
Authors: James D. Carswell, Alan Eustace, Keith Gardiner, Eoin Kilfeather, Marco Neumann
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

This paper proposes a novel solution to querying hyperlinked multimedia cultural heritage datasets based on the user's context. Context in this sense is defined as the user's location in virtual space and the particular mobile device being modeled together with user preferences or profile. The purpose is to automatically push relevant data from the database server to the client based on this comprehensive definition of the user's context. Consideration in regard to which mobile device is currently being modeled is a primary filter for determining what data will be sent and in what format. For example, image data will not be sent to a mobile phone and video will not be sent to a PDA. The CHI (Cultural Heritage Interfaces) project differs from many of the models encountered on the Web in that its primary focus is not the accurate 3D rendering of a street/landscape, but the simulation of such a physical reality to explore the adaptive hypermedia paradigm in the context of a spatial navigation interface.
Routing in Wormhole-Switched Clustered Networks with Applications to Fault-Tolerance
Authors: Vivek Halwan, Füsun Özgüner
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

This paper presents a novel technique for routing in wormhole-switched clustered networks. The network model consists of a set of clusters interfaced through a common central network. First, a global routing algorithm is derived based on the local algorithms used for routing within clusters. This proposed algorithm is shown to be deadlock-free with two virtual channels. This method is then applied for fault-tolerant routing in meshes, without disabling any of the connected healthy nodes.