ppxscal/embedding_network huggingface dataset:
A Methodology for Assessing User's Skill Grade to Implement Adaptive User Interface Systems
Authors: Hitoshi Nagasaki, Motoei Azuma
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

A methodology for assessing a user's skill grade is a key technology for developing Adaptive User Interfaces.The methodology presented here assesses a user's skill grade by analyzing the tendencies of the user's operations. In order to analyze these tendencies, we categorized user's operations into three categories and extracted data from the logs on which the user'soperation behavior was recorded.In this paper, we discuss the methodology for assessing a user's skill grade and the system architecture, and then we describe the results of a preliminary experiment and a new experiment with the prototype based on the new architecture.
An Architectural Model for Service-Based Flexible Software
Authors: Keith H. Bennett, Jie Xu, Malcolm Munro, Zhuang Hong, Paul J. Layzell, Nicolas Gold, David Budgen, Pearl Brereton
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

The urgent need to change software easily to meet evolving business requirements requires a radical shift in the development of software, with a more demand-centric view leading to software which will be delivered as a service, within the framework of an open marketplace. We describe a service architecture and its rationale, in which components may be bound instantly, just at the time they are needed and then the binding may be disengaged. This allows highly flexible software services to be evolved in "internet time". The paper focuses on early results: some of the aims have been demonstrated and amplified through an experimental implementation based on e-Speak, an existing and available technology. It is concluded that technology such as e-Speak provides a useful infrastructure that rapidly enabled us to demonstrate the basic operation and viability of our approach.
Pruning Large Lexicons Using Generalized Word Shape Descriptors
Authors: Sriganesh Madhvanath, Venu Krpasundar
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

We present a technique for pruning of large lexicons for recognition of cursive script words. The technique involves extraction and representation of downward pen-strokes from the cursive word (off-line or on-line) to obtain a generalized descriptor which provides a coarse characterization of word shape. The descriptor is matched with ideal descriptors of lexicon entries organized as a trie. When used with a static lexicon of 21,000 words, the accuracy of reduction to 1000 words exceeds 95%.
Tailoring Text Using Topic Words: Selection and Compression
Authors: Timm Euler
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

In the context of unified messaging, a textual message may have to be reduced in length for display on certain mobile devices. This paper presents a new method to extract sentences that deal with a certain topic from a given text. The approach is based on automatically computed lists of words that represent the desired topics. These word lists also give semantic hints on how to shorten sentences, extending previous methods that rely on syntactical clues only. The method has been evaluated for extraction accuracy and by human subjects for informativeness of the resulting extracts.
An optimal parallel algorithm for volume ray casting
Authors: Vineet Goel, Amar Mukherjee
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Volume rendering by ray casting is a computationally expensive problem. For interactive volume visualization, rendering has to be done in real time (3D frames/sec). Since the typical 3D dataset size is at least 128/sup 3/, the use of parallel processing is imperative. We present an O(log n) EREW algorithm for volume rendering using O(n/sup 3/) processors which can be optimized to O(log/sup 3/ n) time using O(n/sup 3//log/sup 3/ n) processors. We have implemented our algorithm on MasPar MPl200. The implementation results show that a frame from 123/sup 3/ data size is generated in about 3 seconds using 4096 processors.
Pay As You Go-Associating Costs with Jini Leases
Authors: Peer Hasselmeyer, Markus Schumacher, Marco Voß
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

Jini is a technology for building reliable, fault-tolerant distributed applications. Besides offering an infrastructure for clients to locate services, it introduces the concept of leasing. Leases model time-constrained access granting and are used for distributed garbage collection. In this paper we propose an extension to the lease concept that allows associating costs with resource access. To make this extension usable in a commercial environment authentication, encryption, and non-repudiation are required. We analyze our extension in this respect and identify the types of security needed. Based on this analysis we introduce an architecture consisting of a number of Jini-enabled services that support non-repudiation and accounting.
Design and Implementation of Virtual Memory-Mapped Communication on Myrinet
Authors: Cezary Dubnicki, Angelos Bilas, Kai Li
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

This paper describes the design and implementation of the virtual memory-mapped communication model (VMMC) on a Myrinet network of PCI-based PCs. VMMC has been designed and implemented for the SHRIMP multicomputer where it delivers user-to-user latency and bandwidth close to the limits imposed by the underlying hardware. The goal of this work is to provide an implementation of VMMC on a commercially available hardware platform; to determine whether the benefits of VMMC can be realized on the new hardware; and to investigate network interface design tradeoffs by comparing SHRIMP with Myrinet and its respective VMMC implementation.Our Myrinet implementation of VMMC achieves 9.8 microseconds one-way latency and provides 108.4 MBytes per second user-to-user bandwidth. Compared to SHRIMP, the Myrinet implementation of VMMC incurs relatively higher overhead and demands more network interface resources (LANai processor, on-board SRAM) but requires less operating system support.
Logical Structure Analysis of Book Document Images Using Contents Information
Authors: ChunChen Lin, Yosihiro Niwa, Seinosuke Narita
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Numerous studies have so far been carried out extensively for the analysis of document image structure with particular emphasis placed on media conversion and layout analysis. For the conversion of a collection of books in a library to the form of hypertext documents, the logical structure extraction technology is indispensable in addition to document layout analysis. The table contents of a book generally involves very concise and faithful information to represent the logical structure of the entire book document. That is to say, we can efficiently analyze the logical structure of a book by making full use of its contents pages. This paper is intended to propose a new approach for document logical structure analysis to convert document images and contents information into an electronic document. First, the contents page of a book are analyzed to acquire overall document logical structure. Thereafter, we are able to use this information to acquire the logical structure of the whole pages of the book by analyzing consecutive pages of a portion of the book. The test results demonstrate very high discrimination rates: up to 97.6% for the headline structure, 99.4% for the text structure, 97.8%, for the page number structure and almost 100% for the head-foot structure.
A Persistent Hyper-Programming System
Authors: Graham N. C. Kirby, Ronald Morrison, David S. Munro, Richard C. H. Connor, Quintin I. Cutts
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

We demonstrate the use of a hyper-programming system in building persistent applications. This allows program representations to contain type-safe links to persistent objects embedded directly within the source code. The benefits include improved efficiency and potential for static program checking, reduced programming effort and the ability to display meaningful source-level representations for first-class procedure values. Hyper-programming represents a completely new style of programming which is only possible in a persistent programming system.
Selecting Distributed Object Technologies in the Presence of Uncertainty: an Experience Report on C4I enterprise modelling
Authors: Charles Herring, Zoran Milosevic, Simon Kaplan
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

This paper reports on our experience gained in deriving a reference model for Command, Control, Communication, Computers and Intelligence (C4I) architectures. The reference model addresses a dilemma faced by organizations today: choosing the right distributed object platform for domain-specific applications. In making such a choice, organizations face both technological and market uncertainty arising from the availability of multiple middleware platforms and the lack of mature distributed object solutions for specific domains. We present a general methodology to addresses both of these uncertainties. This methodology provides a basis for middleware-neutral specification of vertical domain architectures based on Reference Model - Open Distributed Processing (RM-ODP). We investigate the problem of mapping such a specification onto the capabilities of commercial middleware products. To address market uncertainty, our methodology incorporates results from the field of strategic planning embraced by many large enterprises - a scenario planning technique. We have successfully applied this methodology for several large corporations in Australia, including Australian Defense Forces (ADF).
Integrating task and data parallelism with the group communication archetype
Authors: K. Mani Chandy, Rajit Manohar, Berna L. Massingill, Daniel I. Meiron
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

A parallel program archetype aids the development of reliable, efficient parallel applications with common computation/communication structures by providing stepwise refinement methods and code libraries specific to the structure. The methods and libraries help in transforming a sequential program into a parallel program via a sequence of refinement steps that help maintain correctness while refining the program to obtain the appropriate level of granularity for a target machine. The specific archetype discussed deals with the integration of task and data parallelism using group communication. This archetype has been used to develop several applications.
The Role of Mobile Devices in E-Learning - First Experiences with a Wireless E-Learning Environment
Authors: Franz Lehner, Holger Nösekabel
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

This paper outlines the components of the project WELCOME (Wireless E-Learning and Communication Environment) at the University of Regensburg. We argue that mobile/electronic education should not attempt to replace traditional education with tutors and instructors but support both student and teacher by providing services that facilitate teaching, learning and education-related administrative tasks. The basic approach is integrative, combining a variety of devices (mobile and non-mobile) via a variety of transmitting techniques(wired and wireless).
Scalable parallel list ranking of image edges on fine-grained machines
Authors: Jamshed N. Patel, Ashfaq A. Khokhar, Leah H. Jamieson
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

We present analytical and experimental results for fine-grained list ranking algorithms, with the objective of examining how the locality properties of image edge lists can be used to improve the performance of this highly data-dependent operation. Starting with Wyllie's (1979) algorithm and Anderson and Miller's (1990) randomized algorithm as bases, we use the spatial locality of edge links to derive scalable algorithms designed to exploit the characteristics of image edges. Tested on actual and synthetic edge data, this approach achieves significant speedup on the MasPar MP-1 and MP-2, compared to the standard list ranking algorithms. The modified algorithms exhibit good scalability and are robust across a wide variety of images.
Exploiting the Capabilities of Communications Co-Processors
Authors: Klaus E. Schauser, Chris J. Scheiman, J. Mitchell Ferguson, Paul Z. Kolano
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Communications coprocessors (CCPs) have become commonplace in modern massively parallel processors (MPPs) and networks of workstations. These coprocessors provide dedicated hardware support for fast communication. In this paper, we study how to exploit the capabilities of CCPs for executing user-level message handlers. We show, in the context of active messages and Split-C, that we can move message handling code to the coprocessor, thus freeing the main processor for computational work. We address the important issues that arise, such as synchronization, and the limited computational power and flexibility of CCPs. We have implemented coprocessor versions of both active messages and Split-C. These implementations, developed on the Meiko CS-2, provide us with an excellent experimental platform to evaluate the benefits of a communications coprocessor architecture.
Domain-Specific Information Extraction Structures
Authors: Seamus Lyons, Dan Smith
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Information describing an event can frequently be found on several Web pages, each of which is often poorly structured and incomplete; the set of pages is typically repetitive, often contradictory and verbose. In order to deliver high quality information to a variety of devices in different contexts and roles, we need to provide information that is more succinct. Our approach to this problem is to use domain-specific templates to extract information selectively from the original pages into XML documents, which act as a canonical structure. The extracted information can then be transformed into a form suitable for the intended application. A further series of output transformations are then applied to format the information appropriately, e.g. as speech, simple text or published on the web. We illustrate our approach with an application in reporting soccer matches.
Long-Term Relevance Feedback Using Simple PCA and Linear Transformation
Authors: Xiaoying Tai, Fuji Ren, Kenji Kita
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

This paper proposes a new method to improve information retrieval performance of the vector space model (VSM) in part by preserve user-supplied relevance information for a long term in the system. The proposed method incorporate user's relevance feedback information and original documents similarities information into the retrieval model that is built by using a sequence of linear transformations. High-dimensional and sparse vectors into the a low-dimensional vector space, namely the space representing the latent semantic meanings of words, by using SPCA (Simple Principal Component Analysis). An experimental informationretrieval system based on the proposed method has been built. Experiments on two test collections, Medline collection and Cranfield collection, have carried out. Improvement of average precision compared with LSI (Latent Semantic Indexing) model, are 6.80% (Medline) and 67.46% (Cranfield) for the two training data sets, and 4.71% (Medline) and 8.12%Cranfield) for the test data, respectively. The results of our experiments show that the proposed method has better retrieval performance and provides an approach that makes it possible to preserve user-supplied relevance information for a long term in the system in order to use it later.
Fast scheduling of periodic tasks on multiple resources
Authors: Sanjoy K. Baruah, Johannes Gehrke, C. Greg Plaxton
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Given n periodic tasks, each characterized by an execution requirement and a period, and m identical copies of a resource, the periodic scheduling problem is concerned with generating a schedule for the n tasks on the m resources. We present an algorithm that schedules every feasible instance of the periodic scheduling problem, and runs in O(min{mlgn,n}) time per slot scheduled.
Human-Perception Handwritten Character Recognition Using Wavelets
Authors: Suzete E. N. Correia, João M. de Carvalho, Robert Sabourin
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

The human vision system effortlessly recognizes familiar shapes despite all changes and distortions found in the retinal images. This work proposes a novel approach for recognition of handwritten characters which is based on human perception. The wavelet transformis used to simulate the multiresolutional capability of the vision and to extract features such as fixation points and image details at horizontal, vertical and diagonal directions.A previous system [1] which uses wavelet directional features yielded a recognition rate of 98.25% using NISTnumerals database.
Lessons from 342 Medical Device Failures
Authors: Dolores R. Wallace, D. Richard Kuhn
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

Most complex systems today contain software, and systems failures activated by software faults can provide lessons for software development practices and software quality assurance. This paper presents an analysis of software-related failures of medical devices that caused no death or injury but led to recalls by the manufacturers. The analysis categorizes the failures by their symptoms and faults, and discusses methods of preventing and detecting faults in each category. The nature of the faults provides lessons about the value of generally accepted quality practices for prevention and detection methods applied prior to system release. It also provides some insight into the need for formal requirements specification and for improved testing of complex hardware-software systems.
Real-time multicast in wireless communication
Authors: Sandeepan Sanyal, Laila Nahar, Sourav Bhattacharya
Venue: Proceedings of the international Conference on Parallel Processing (1997)

This paper presents the reconfiguration of multicast tree at the instance of node migration in cellular wireless networks. We consider a novel, and highly practical, formulation of the real-time multicast problem. Unlike the traditional notion of source to leaf node message transmission time being the measure for real-time, we consider the multicast tree re-construction time (in the event of a node migration) as the measure for real-time constraints. The overall goal is to minimize both the delays-i): delay of re-constructing the multicast tree and ii) source to destination transmission delay. In this paper we introduce and provide solutions for the first objective, while the current research in real-time multicast tree considers the latter objective only. We propose three heuristics to solve the real-time multicast tree re-construction problem and present analysis and simulation results for different factors that contribute differently to the reconstruction delay.
An Investigation of Inter-Domain Control Aggregation Procedures
Authors: Rute Sofia, Roch Guérin, Pedro Veiga
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

Current Quality of Service models such as those embodied in the Differentiated Services proposal, rely on data path aggregation to achieve scalability. Data path aggregation bundles into a single aggregate multiple flows with the same quality requirements, hence decreasing the amount of state to be kept. A similar scalability concern exists on the control path, where the state required to account for individual reservations needs to be minimized. There have been several proposals aimed at control path aggregation, and the goal of this paper is to expand on these works in an attempt to gain a better understanding of the various parametersthat influence the efficiency of different approaches. In particular, we focus on interdomain control aggregation, and compare an Autonomous System (AS) sink-tree based approach with two examples of a shared AS segment based approach, in terms of the amount of state kept, both per AS and per edge router. Our main contributions are in providing a greater understanding into the design of efficient control path aggregation methods.
A Mental Cognitive Model of Web Semantic for e-Customer Profile
Authors: Irene S. Y. Kwan
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

e-Business is competing in the new era of e-market. We need an infrastructure that could provide insight information to enable maximum and constant learning that lead to a responsive web site. To keep the website in business on-line, we need sufficient on-line traffic on the e-Business web site. This result of an urgent need to investigate the keys to satisfy and stimuli e-customers by providing customer-effective websites that delivered business-focused e-services. The primary need is to produces a view of the behavior of the e-business system and its e-customers. Successful e-Business aim to provide customers with optimal on-lineexperience in e-business web site that supports effective customer relationship from customerawareness, through exploration to purchase commitment. This paper focuses on modeling e-customer behavior by developing a Mental Cognitive (MC) Model for identifying the web site semantics via the activities exercised by its e-customers. Our proposed MC Model also supports quantitative measure to abstract more rigorously the behavior of e-customers insupport of Internet marketing.
InfoSleuth: Agent-Based System for Data Integration and Analysis
Authors: Tomasz Ksiezyk, Gale Martin, Qing Jia
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

InfoSleuth is an agent-based system that automates the gathering and analysis of dynamic, distributed data accessible over the web. To gather data, a user specifies an SQL query which references elements from a common domain ontology (i.e., terminology). Agents then locate resources that have advertised having data relevant to these elements and translate the ontology-based query into queries referencing elements in the different schemas of the identified local databases. Other agents then integrate the results returned from these multiple resources and express them in terms of the common ontology. The large amount of data returned may be overwhelming, and so analysis agents serve to filter and interpret it. InfoSleuth is implemented in Java, and includes a common agent shell and specializations of the shell. The system was developed within a research environment over the course of 5 years and is now being hardened for commercial applications.
An Electronic Payment Scheme Allowing Special Rates for Anonymous Regular Customers
Authors: Chunfu Tan, Jianying Zhou
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Anonymous electronic payment systems are regarded as essential for the protection of the privacy of consumers participating in electronic transactions. In this paper, we present an electronic payment scheme which allows regular customers not only to get special rates from the merchant but also to be kept anonymous to the merchant.