ppxscal/embedding_network huggingface dataset:
Bicriterion scheduling of identical processing time jobs by uniform processors
Authors: Alexander Tuzikov, Mikhail Makhaniok, Reinhard Männer
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

The problem of bicriterion scheduling of jobs with identical processing times by uniform processors is considered. The first criterion is the minimization of either total or maximum costs, the second one is the minimization of maximum cost with different cost functions. Polynomial time algorithms are presented to determine all efficient solutions and the optimal solution for a given global criterion.
Synthesis of Multi-Dimensional Applications in VHDL
Authors: Nelson L. Passos, Edwin Hsing-Mean Sha
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

The VHDL language is considered to be an important standard among the hardware description tools. Most of the existing loop optimization techniques that consider the parallelism inherent to multi-dimensional problems, depend on loop transformations not available in the current VHDL Synthesis products. This study presents a coding technique on modeling multi-dimensional (nested) loops on VHDL, where pre-processor tools can rewrite the VHDL instructions in such a way that the optimized design can be synthesized. This new approach is expected to improve the VHDL design cycle by including multi-dimensional signal processing and other common applications in the scope of the VHDL Synthesis tools.
Native ATM Application Programmer Interface Testbed for Cluster-Based Computing
Authors: Patrick W. Dowd, Todd M. Carrozzi, Frank A. Pellegrino, Amy Xin Chen
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

This paper investigates the use of ATM for cluster based computing. The need for a native ATM API is discussed as well as the performance of message passing libraries (MPL) that are written to use such an API to exploit the advantages of a high-speed network for cluster-based computing. The MPLs offer a standard interface, such as PVM or MPI, and interoperate with existing TCP/IP and UDP/IP based versions in addition to the ATM API environment. The interoperability extensions made to two MPLs, MPI and Prowess, are described with a hybrid environment of both ATM and TCP-based legacy network technology. The native ATM API is described in this paper which supports cluster based computing that may be geographically distributed. Furthermore, this API provides a reliable transport interface to the MPL which has been optimized for an ATM environment. The transport protocol is a low-state design that optimizes the performance based on the available bandwidth, buffer constraints, propagation delay characteristics, and security requirements of a particular connection, and will rapidly evolve if the connection characteristics change.
Symbolic performance prediction of scalable parallel programs
Authors: Mark J. Clement, Michael J. Quinn
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Recent advances in the power of parallel computers have made them attractive for solving large computational problems. Scalable parallel programs are particularly well suited to Massively Parallel Processing (MPP) machines since the number of computations can be increased to match the available number of processors. Performance tuning can be particularly difficult for these applications since it must often be performed with a smaller problem size than that targeted for eventual execution. This research develops a performance prediction methodology that addresses this problem through symbolic analysis of program source code. Algebraic manipulations can then be performed on the resulting analytical model to determine performance for scaled up applications on different hardware architectures.
Converting Web Applications to Data Components: Design Methodology
Authors: Jan Pazdziora
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

Most of the current Web applications are closely tied to the client and large parts of their code concern with producing proper output markup. Converting them into components that produce pure data output, independent from presentation specifics, increases maintainability and eliminates duplicated code for different output media, and thus is the key requirement for modern systems. In this paper, we explore steps needed to transfer existing applications to data oriented components, and present implementation and performance issues and their solutions.
A Graph-Theoretic Approach to Indexing in Object-Oriented Databases
Authors: Boris Shidlovsky, Elisa Bertino
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

A graph-theoretic approach to the path indexing problem is proposed. We represent the indexing relationships supported by indices allocated in the classes in the path in the form of a directed graph. All the previous approaches directly fit into the scheme and form a hierarchy of complexity with respect to the time required for selection of the optimal index configuration. Based on the general scheme, we develop a new approach to the path indexing problem exploiting the notion of visibility graph. We introduce a generalized nested-inherited index, give algorithms for retrieval and update operations and compare the behavior of the new structure with previous approaches.
Improving Memory Performance for Indirect Accesses on SIMD Computers
Authors: James D. Allen, David E. Schimmel
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

SIMD machines operate more efficiently on a wider range of problems when they have the ability to access memory with both global and local addresses. Recent work has made possible the use of caches for global addresses. This paper examines techniques for employing caches to improve memory accesses with local addresses. Specifically, we examine the improvement from utilizing a cluster-based indirect only cache. This is a simple extension of the direct only cache and yet improves indirect memory references significantly.
Ontologies for Multi-Agent Systems in Manufacturing Domain
Authors: Marek Obitko, Vladimír Marík
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Ontologies play important role in knowledge sharing and exploration, particularly in communication in multi-agent systems. We briefly survey, compare and analyze current usage of ontologies in the area of manufacturing and compare it with the ontology modelling for the Semantic Web. We focus on the problem of scalable interoperability in open heterogeneous multi-agent systems, such as supply chains. A study of transformation of a particular ontology from manufacturing domain into the form suitable for communication with semantic web agents is presented. We conclude with a discussion what we see as next important steps in the development of ontologies in the manufacturing domain in order to have more automated approaches for ontological knowledge integration.
System Scaling for Large-scale Internet-Based Online Services
Authors: David C. Ni, J. Martinez, J. Wang
Venue: 23rd International Computer Software and Applications Conference (1999)

The rapidly growing web-based online services offered by new and traditional vendors have attracted the interests of massive consumers. These vendors provide or extend their services and products to the clients via the internet. As the service offers or related activities (e.g., merge) increase, they begin to scale up service infrastructure. For example, the vendors may integrate new information systems with the online service systems. These add-on systems capture statistics of web activities, deliver customized service offer, and support marketing, planing etc. From the technological perspective, online service scaling up introduces technical challenges to the corporate IT organizations.In this paper, we propose system models and strategies for integrating or consolidating services into the existing online service infrastructure. We describe a case of loosely coupled integration in detail. We present the approaches for integrating built-in-house and third-party frameworks based on architectural/design patterns and end-to-end system performance for the different web service providers.
A Concept Mapping Tool for Pocket PC Computers
Authors: Tony Chan, Mike Sharples
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

We describe the implementation and evaluation of a concept mapping tool for Pocket PC computers. The paper raises issues associated with developing a learning tool for handheld computers, including reduced screen size, availability, connectivity and usability.
Space Cutting Approaches for Repairing Memories
Authors: Yinan N. Shen, N. Park, Fabrizio Lombardi
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

This paper presents new algorithms for yield enhancement of redundant memories. These algorithms are based on the technique of spare cutting for a redundant memory chip in which repair is implemented by row/column deletion. Different approaches are proposed: some of these approaches are based on a fully exhaustive process, while others try to heuristically reduce the computational overhead involved in determining the repair-solution.
Probabilistic Intensity Mapping in MRI Image Registration
Authors: Alexei M. C. Machado, Mario F. M. Campos, James C. Gee
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

In this work, we present a method which is able to relate different MR sensors with respect to intensity distortions in the output images. For the important problem of image registration, the method makes possible a principled approach to likelihood modeling or the construction of similarity metrics. Likelihood models can be used as prior knowledge of the relationship between intensities in both images, providing a fundamental information resource for image registration. A poor model of the intensity mapping for the image pair to be matched may lead to false matches, regardless of the prior morphological constraints assumed and will bias all subsequent analyses. A formal analysis of robustness under different kinds of noise is also provided and the findings compared to other relevant similarity metrics. Experiments are controlled based on the application of synthetic spatial and intensity deformations that guarantee a fiducial basis for comparison.
Discovering Similar Patterns for Characterising Time Series in a Medical Domain
Authors: Fernando Alonso, Juan Pedro Caraça-Valente, Loïc Martínez, César Montes
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

In this article, we describe the process of discovering similar patterns in time series and creating reference models for population groups in a medical domain, and particularly in the field of physiotherapy, using data mining techniques on a set of isokinetic data.The discovered knowledge was evaluated against the expertise of a physician specialised in isokinetic techniques, and applied in the I4 (Intelligent Interpretation of Isokinetic Information) project developed in conjunction with the Spanish National Centre for Sports Research and Sciences and the School of Physiotherapy of the Spanish National Organisation for the Blind for muscular diagnosis and rehabilitation, injury prevention, training evaluation and planning, etc., of elite and blind athletes.
A Simple Sketch for 3D Scanning Based on a Rotating Platform and a Web Camera
Authors: Luiz Marcos Gonçalves, George Thó, Anderson L. de O. Cavalcanti
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

We propose a technique for 3D scanning based on a very simple device composed of a rotating platform and a cheap web camera, both controled by a computer. Images from an object are taken under different viewing angles in a synchronized way by the camera and processed in order to allow the reconstruction of the object shape in a very simple way. It works well for convex objects. Extensions to other complex objects are being studied.
Implementation of a Virtual Time Synchronizer for Distributed Databases
Authors: Azzedine Boukerche, Sajal K. Das, Ajoy Kumar Datta, Timothy E. LeMaster
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

The availability of high speed networks and improved microprocessor performance have made it possible to build inexpensive cluster of workstations as an appealing platform for parallel and distributed computing. In this paper, we study the performance of a distributed database system synchronized by virtual time (VT) mechanism by experimenting on a LAN-connected collection of 12 Sun-SPARCS workstations. Our experimental results demonstrate that the VT synchronization protocol is a viable concurrency control method, and it yields about 25-30% reduction in the response time, when compared with a widely used, multiversion (MV) concurrency control scheme based on timestamps order. The reason for comparing with the MV approach is that both virtual time and multiversion protocols are based upon the concept of timestamps, and attain high performance by using multiple version of data objects.
Energy-Efficient Caching for Wireless Mobile Computing
Authors: Kun-Lung Wu, Philip S. Yu, Ming-Syan Chen
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

Caching can reduce the bandwidth requirement in a mobile computing environment. However, due to battery power limitations, a wireless mobile computer may often be forced to operate in a doze or even totally disconnected mode. As a result, the mobile computer may miss some cache invalidation reports broadcasted by a server, forcing it to discard the entire cache contents after waking up. In this paper, we present an energy-efficient cache invalidation method, called GCORE, that allows a mobile computer to operate in a disconnected mode to save battery while still retaining most of the caching benefits after a reconnection. We present an efficient implementation of GCORE and conduct simulations to evaluate its caching effectiveness. The results show that GCORE can substantially improve mobile caching by reducing the communication bandwidth (or energy consumption) for query processing.
Towards Eliminating Random I/O in Hash Joins
Authors: Ming-Ling Lo, Chinya V. Ravishankar
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

The widening performance gap between CPU and disk is significant for hash join performance. Most current hash join methods try to reduce the volume of data transferred between memory and disk. In this paper, we try to reduce hash-join times by reducing random I/O. We study how current algorithms incur random I/O, and propose a new hash join method, Seq+, that converts much of the random I/O to sequential I/O. Seq+ uses a new organization for hash buckets on disk, and larger input and output buffer sizes. We introduce the technique of batch writes to reduce the bucket-write cost, and the concepts of write- and read-groups of hash buckets to reduce the bucket-read cost. We derive a cost model for our method, and present formulas for choosing various algorithm parameters, including input and output buffer sizes. Our performance study shows that the new hash join method performs many times better than current algorithms under various environments. Since our cost functions under-estimate the cost of current algorithms and over-estimate the cost of Seq+, the actual performance gain of Seq+ is likely to be even greater.
Formal Authorization Allocation Approaches for Role-Based Access Control Based on Relational Algebra Operations
Authors: Hua Wang, Jinli Cao, Yanchun Zhang
Venue: Proceedings of the 3rd International Conference on Web Information Systems Engineering (2002)

In this paper, we develop formal authorization allocationalgorithms for role-based access control (RBAC). Theformal approaches are based on relational structure, andrelational algebra and operations. The process of user-roleassignments is an important issue in RBAC because it maymodify the authorization level or imply high-level confidentialinformation to be derived while users change positionsand request different roles. There are two types of problemswhich may arise in user-role assignment. One is related toauthorization granting process. When a role is granted to auser, this role may be conflict with other roles of the user ortogether with this role; the user may have or derive a highlevel of authority. Another is related to authorization revocation.When a role is revoked from a user, the user maystill have the role from other roles.To solve the problems, this paper presents an authorizationgranting algorithm, and weak revocation and strongrevocation algorithms that are based on relational algebra.The algorithms can be used to check conflicts and thereforeto help allocate the roles without compromising the securityin RBAC. We describe how to use the new algorithms withan anonymity scalable payment scheme. Finally, comparisonswith other related work are discussed.
New Challenges for Video Servers: Performance of Non-Linear Applications under User Choice
Authors: Michael Kozuch, Wayne Wolf, Andrew Wolfe
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

This paper outlines a framework for classifying video application types according to linearity and user-choice response constraint. It then presents the first analyses of video server performance under various non-linear video application loads.
Object Identification in Legacy Code as a Grouping Problem
Authors: Houari A. Sahraoui, Petko Valtchev, Idrissa Konkobo, Shiqiang Shen
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Maintenance is undoubtedly the most effort-consuming activity in software production whereby the entropy of legacy systems is a major challenge. Migration of legacy systems to object-oriented technology is considered by many organizations as a suitable way out, however, the cost and the complexity of the task may dissuade the decision-makers. As a contribution to the automation, complete or partial, of the migration process, our paper presents two algorithms for identifying objects in procedural code, a task which is crucial within the entire process. The suggested algorithms are experimentally evaluated, using the examples of three existing systems.
An Efficient VLSI Architecture Parallel Prefix Counting With Domino Logic
Authors: Rong Lin, Koji Nakano, Stephan Olariu, Albert Y. Zomaya
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

We propose an efficient reconfigurable parallel prefix counting network based on the recently-proposed technique of shift switching with domino logic, where the charge/discharge signals propagate along the switch chain producing semaphores results in a network that is fast and highly hardware-compact. The proposed architecture for prefix counting N - 1 bits features a total delay of (4 log N + vN - 2) * Td, where Td is the delay for charging or discharging a row of two prefix sum units of eight shift switches. Simulation results reveal that Td does not exceed 1ns under 0.8-micron CMOS technology. Our design is faster than any design known to us for N = 210 Yet another important and novel feature of the proposed architecture is that it requires very simple controls, partially driven by semaphores, reducing significantly the hardware complexity and fully utilizing the inherent speed of the process.
The Story of e-Learning in HKU SPACE
Authors: Bruce S. N. Cheung
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

In 1999, the HKU School of Professional and Continuing Education (SPACE) established theSPACE On-line Universal Learning (SOUL) Project. SOUL is now serving over 20,000 users. Compare to other off-the-shelf e-learning solutions, the SOUL Platform is tailored for students and teachers. The major barrier of e-learning development by teachers is the heavy reliance on technical team support. Most e-learning systems are too technically complex for teachers to use easily, necessitating lengthy communications with a technical team. Another problem is the lack of support in the quality maintenance of e-courses. There is no method or indication built into such systems for teachers to identify any structural problems with their teaching materials and the curriculum design. Furthermore, there is limited capacity for students to have a personalized study path. To address these problems, three new major features in PowerEdBuilder (the R&D component of the SOUL project) called Content Engineering (CE), SmartTutor, and e-Course eXchange (eCX) have been implemented. These three innovative breakthrough technologies set a milestone in e-learning helping bridge the gap between pedagogy and technology.
Quality Issues in System Engineering Affecting Virtual Distance Learning Systems
Authors: Elsabé Cloete
Venue: 24th International Computer Software and Applications Conference (2000)

A quality learning system is the foundation of virtual distance learning. It represents not only a significant investment and a competitive edge for a particular learning institution, but is also crucial to the success of the learning process. The integration of the heritage systems and legacy data into a network-centric environment involves more than just connecting data and hardware to the Internet - it requires the ability to make intelligent trade-offs that extend the scope of, and harvest the investment in, these systems. The systems engineer must design a strategy for the implementation and maintenance of a quality learning system. This quality is parametrized by factors such as feasibility, schedule, flexibility and maintenance, chronological instability, and scalability and expandability. In this paper, we describe how these parameters affect the quality of a virtual learning system, and attempt to reduce unforeseen systems engineering problems when developing a new virtual learning system.
Web Document Classification Based on Fuzzy Association
Authors: Choochart Haruechaiyasak, Mei-Ling Shyu, Shu-Ching Chen, Xiuqi Li
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

In this paper, a method of automatically classifying Web documents into a set of categories using the fuzzy association concept is proposed. Using the same word or vocabulary to describe different entities creates ambiguity, especially in the Web environment where theuser population is large. To solve this problem, fuzzy association is used to capture the relationships among different index terms or keywords in the documents, i.e., each pair of words has an associated value to distinguish itself from the others. Therefore, the ambiguity in word usage is avoided. Experiments using data sets collected from two Web portals: Yahoo! (www.yahoo.com) and Open Directory Project (dmoz.org) are conducted. We compare our approach to the vector space model with the cosine coefficient. The results show that our approach yields higher accuracy compared to the vector space model.