ppxscal/embedding_network huggingface dataset:
FINDER: A Mediator System for Structured and Semi-Structured Data Integration
Authors: Manuel Álvarez, Alberto Pan, Juan Raposo, Fidel Cacheda, Ángel Viña
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Mediator systems aim to provide an unified vision over heterogeneous, distributed, structured and semi-structured data sources. We present FINDER, a mediator system which has been used for building several real-world data integration applications, both in the Internet and Intranet domains. In this paper we provide an overview of the system and remark some of its distinctive features.
Load Balancing with Memory
Authors: Michael Mitzenmacher, Balaji Prabhakar, Devavrat Shah
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

A standard load balancing model considers placing n balls into n bins by choosing d possible locations for each ball independently and uniformly at random and sequentially placing each in the least loaded of its chosen bins. It is well known that allowing just a small amount of choice(d = 2) greatly improves performance over random placement (d = 1). In this paper, we show that similar performance gains occur by introducing memory. We focus on the situation where each time a ball is placed, the least loaded of that ball's choices after placement is remembered and used as one of the possible choices for the next ball. For example, we show that when each ball gets just one random choice, but can also choose the best of the last ball's choices, the maximum number of balls in a bin is l{{\log \log n} \mathord{\left/ {\vphantom {{\log \log n} {2\log \phi+ 0(1)}}} \right. \kern-\nulldelimiterspace} {2\log \phi+ 0(1)}} with high probability, where \phi= ({{1 + \sqrt 5 )} \mathord{\left/ {\vphantom {{1 + \sqrt 5 )} 2}} \right. \kern-\nulldelimiterspace} 2} is the golden ratio. The asymptotic performance is therefore better with one random choice and one choice from memory than with two fresh random choices for each ball; the performance with memory asymptoticallymatches the asymmetric policy using two choices introduced by Vöcking. More generally, we find that a small amount of memory, like a small amount of choice, can dramatically improve the load balancing performance. We also investigate continuous time variations corresponding to queueing systems, where we find similar results.
A Study of the HMS Operational Architecture
Authors: Thomas Neligwa, S. Misbah Deen
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

This paper presents the HMS operational architecture detailing both the control and co-operation architectures based on the function block model. While the intrinsic structure of the holon is responsible for its autonomy and individualistic skills, the co-operation architecture outlines how interactions between holons can be organised and supported. We have also illustrated how this architecture can be mapped onto a holonic production environment using a motor assembly scenario. Even though the motor assembly test case has a hierarchical task structure, we believe it is rigorous enough to demonstrate the benefits of the holonic operational behaviour.
E-Shell Renderin
Authors: Leonardo M. Rocha, Alexandre X. Falcão
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

In Medical Imaging, shell rendering is considered one of the most efficient and effective methods for volume visualization. It requires a compact data structure of voxels and uses the voxel splatting technique for surface and volume rendering. In order to avoid holes in the rendition, the size of the voxels are usually made bigger than the size of the pixels for voxel splatting. In such a case, we have identified a conceptual problem in shell rendering which affects the correctness and quality of the renditions. In this paper, we discuss this problem and propose a solution, which improves image quality without affecting the speed of the method. The new approach is called E-Shell Rendering (extended-shell rendering). It requires an extension of the shell data structure and a variant oftheoriginal algorithm. We illustrate and discuss the results with examples created by surface and volume rendering.
Machine and Human Recognition of Segmented Characters from Handwritten Words
Authors: Fumitaka Kimura, N. Kayahara, Yasuji Miyake, Malayappan Shridhar
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

In this paper handwritten character recognition by human readers, a statistical classifier, and a neural network is compared to know the required accuracy for handwritten word recognition. Sample characters extracted from postal address words on mail pieces collected by USPS were used to evaluate human and machine performance. Experimental results show that 1) when the characters are segmented from words and are randomly presented, the accuracy of the machine recognition is comparable with the average human recognition accuracy, 2) the neural network employing the feature vector of size 64 outperforms the statistical classifier employing the same feature vector, and that 3) the statistical classifier employing the feature vector of size 400 achieves comparable recognition rate with the best human reader.
Improved Dynamic Reachability Algorithms for Directed Graphs
Authors: Liam Roditty, Uri Zwick
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We obtain several new dynamic algorithms for maintaining the transitive closure of a directed graph, and several other algorithms for answering reachability queries without explicitly maintaining a transitive closure matrix. Among our algorithms are:(i) A decremental algorithm for maintaining the transitive closure of a directed graph, through an arbitrary sequence of edge deletions, in O(mn) total expected time, essentially the time needed for computing the transitive closure of the initial graph. Such a result was previously known only for acyclic graphs.(ii) Two fully dynamic algorithms for answering reachability queries. The first is deterministic and has an amortized insert/delete time of 0(m\sqrt n ), and worst-case query time of 0(\sqrt {n)}. The second is randomized and has an amortized insert/delete time of 0(m^{0.58} n) and worst-case query time of 0(m^{0.43}). This significantly improves the query times of algorithms with similar update times.(iii) A fully dynamic algorithm for maintaining the transitive closure of an acyclic graph. The algorithm is deterministic and has a worst-case insert time of O(m), constant amortized delete time of O(1), and a worst-case query time of O(n/log n).Our algorithms are obtained by combining several new ideas, one of which is a simple sampling idea used for detecting decompositions of strongly connected components, with techniques of Even and Shiloach [7], Italiano [14], Henzinger and King [10], and Frigioni et al. [8]. We also adapt results of Cohen [3] on estimating the size of the transitive closure to the dynamic setting.
Optimizations for Language-Directed Computational Steering
Authors: Jeffrey S. Vetter, Karsten Schwan
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Two important requirements for interactive computational steering are low steering latency and minimal application perturbation. The key insight of this research is that precise, interpretable descriptions of steering commands enable runtime optimization for steering perturbation and latency. Within our structured approach for specifying steering requests, we define three optimizations for latency and perturbation while maintaining the fidelity of the user's request. To validate our approach, we have constructed an operational prototype for computational steering. Our empirical evaluations demonstrate the opportunities for optimization inherent in language-directed computational steering.
Parallel processing algorithms and architecture for multimedia on-demand servers
Authors: Raja Neogi, Meghanad D. Wagh
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Advances in networking and storage technologies have made it possible to build multimedia on-demand servers that provide service similar to those of neighborhood videotape rental stores. We propose a specialized high performance programmable multiprocessor architecture which allows continuous playback of mediastreams to large number of clients, a critical factor in multimedia servers. This architecture supports dynamic phase shifts in media distribution which is particularly useful in a distributed environment. We introduce algorithms for maximum concurrency extraction and to avoid task migration in the presence of dynamically changing demand. We show that our solution performs an order of magnitude better than other known solutions.
Implementing the Data Diffusion Machine Using Crossbar Routers
Authors: Henk L. Muller, Paul W. A. Stallard, David H. D. Warren
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

The Data Diffusion Machine is a scalable virtual shared memory architecture. A hierarchical network is used to ensure that all data can be located in a time bounded by O(log p), where p is the number of processors. The DDM hierarchy requires a high degree of connectivity between clusters of nodes, which can be provided with point-to-point links. For large machines however the wiring will be complex. In this article we discuss the implementation of such networks, and develop three alternative implementations. The base level performance of each alternative has been measured on an emulator of the DDM. The final solution collapses the physical hierarchy, and we show that this does not affect the performance, while clearly simplifying the design. It demonstrates that with the use of crossbar routers we can make a cheap, scalable and high performance implementation of the DDM.
Better Rules, Few Features: A Semantic Approach to Selecting Features from Text
Authors: Catherine Blake, Wanda Pratt
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

The choice of features used to represent a domain has a profound effect on the quality of the model produced; yet, few researchers have investigated the relationship between the features used to represent text and the quality of the final model. We explored this relationship formedical texts by comparing association rules based on features with three different semantic levels: (1) words (2) manually assigned keywords and (3) automatically selected medical concepts. Our preliminary findings indicate that bi-directional association rules based onconcepts or keywords are more plausible and more useful than those based on word features. The concept and keyword representations also required 90% fewer features than the word representation. This drastic dimensionality reduction suggests that this approach is well suited to large textual corpus of medical text, such as parts of the Web.
Using simple page placement policies to reduce the cost of cache fills in coherent shared-memory systems
Authors: Michael Marchetti, Leonidas I. Kontothanassis, Ricardo Bianchini, Michael L. Scott
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

The cost of a cache miss depends heavily on the location of the main memory that backs the missing line. For certain applications, this cost is a major factor in overall performance. We report on the utility of OS-based page placement as a mechanism to increase the frequency with which cache fills access local memory in distributed shared memory multiprocessors. Even with the very simple policy of first-use placement, we find significant improvements over round-robin placement for many applications on both hardware- and software-coherent systems. For most of our applications, first-use placement allows 35 to 75 percent of cache fills to be performed locally, resulting in performance improvements of up to 40 percent with respect to round-robin placement. We were surprised to find no performance advantage in more sophisticated policies, including page migration and page replication. In fact, in many cases the performance of our applications suffered under these policies.
Image Classification Using Neural Networks and Ontologies
Authors: Casey Breen, Latifur Khan, Arunkumar Ponnusamy
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

The advent of extremely powerful home PCs and the growth of the Internet have made the appearance of multimedia documents a common sight in the computer world. In the world of unstructured data composed of images and other media types, classification often comes at the price of countless hours of manual labor. This research aims to present a scalable system capable of examining images and accurately classifying the image based on its visual content. When retrieving images based on a user's query, the system will yields a minimal amount of irrelevant information (high precision) and insure a maximum amount of relevant information (high recall).
An Integrated Processor Management Scheme for the Mesh-Connected Multicomputer Systems
Authors: Chung-yen Chang, Prasant Mohapatra
Venue: Proceedings of the international Conference on Parallel Processing (1997)

The performance of a multicomputer system depends on the processor management strategy. Processor management deals with processor allocation and job scheduling. Most of the processor allocation and job scheduling schemes proposed in the literature incur high implementation complexity and are therefore impractical to be integrated. In this paper, we propose an integrated processor management scheme that includes a bypass-queue scheduling policy and a fixed-orientation allocation algorithm. Both policies have very low complexities and are hence suitable to be integrated. Both policies improve the system performance considerably when applied in isolation. The integrated scheme provides even better performance.
Data Privacy, U. S.Common Practices
Authors: Noushin Ashrafi, Jean-Pierre Kuilboer
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

The advancement in Internet technologies has led to high expectations about the growth of e-commerce and e-business. Predictions, however, have not materialized; E-commerce represents less that 1% of the total trade and signs of a sharp growth are not in sight. Slow growth of e-commerce has often been attributed to the lack of trust [1] in either the medium (Internet) or the agents involved in the transaction (organizations). Our research is aimed at providing some insights as what privacy policies are and how they are practiced in the U.S. To this effect we have surveyed firms in multiple sectors that have been listed as most active in trading online. Our findings indicate that most interactive companies have Published Privacy Policies (PPP). However, the percentage of companies with PPP varies based on their type ofbusiness, size, and whether the company is 100% interactive or it also has brick and mortar presence
The Representative Basis for Association Rules
Authors: Viet Phan Luong
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

We define the concept of the representative basic for interesting association rules, and an inference system which is purely qualitative. The representative basis is unique, and minimal with respect to (wrt) the inference system. On the representative basis, the inference system is correct and complete. Experimental results show that the number of rule in the representative basis is significantly reduced wrt the number of rules generated by other existing approaches.
On-Line End-to-End Congestion Control
Authors: Naveen Garg, Neal E. Young
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

Congestion control in the current Internet is accomplished mainly by TCP/IP. To understand the macroscopic network behavior that results from TCP/IP and similar end-to-end protocols, one main analytic technique is to show that the the protocol maximizes some global objective function of the network traffic.Here we analyze a particular end-to-end, MIMD (multiplicative-increase, multiplicative-decrease) protocol. We show that if all users of the network use the protocol, and all connections last for at least logarithmically many rounds, then the total weighted throughput (value of all packets received) is near the maximum possible. Our analysis includes round-trip-times, and (in contrast to most previous analyses) gives explicit convergence rates, allows connections to start and stop, and allows capacities to change.
A Multicast Transport Protocol for Cooperative Media Distribution
Authors: Dimitris Vyzovitis, Andrew Lippman
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

This paper describes the main ideas of DRMTP (Distributed Real-time Multicast Transport Protocol), an adaptive application-level protocol which allows cooperative multicast of real-time streams. Our protocol is designed for peer-to-peer operation, where multiple sources residing on end-user machines may be present in the network, and is based on a dynamic stream aggregation and congestion control scheme. The protocol solves the problem ofnetwork asymmetry that plagues residential broadband networks and allows for fast fail-over and adaptation to departure of source nodes, mitigating the reliability and upstream capacity problems of end-user nodes. Coupled with traffic localization, stream patching, and TCP-friendly congestion control, we design a protocol that enables scalable softreal-time media distribution in a completely decentralised, serverless fashion.
Mining Market Value Functions for Targeted Marketing
Authors: Yi Yu Yao, Ning Zhong
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

Targeted marketing typically involves the identification of customers or products having potential market values. We propose a linear model for solving this problem by drawing and extending results from information retrieval. It is assumed that each object is represented by values of a finite set of attributes. A market value function, which is a linear combination of utility functions on attribute values, is used to rank objects. Several methods are examined for mining market value functions. The main advantage of the model is that one can rank objects of interest according to their market values, instead of classifying the objects. The theoretical results reported in this paper establish a basis on which further studies and experimental evaluation can be carried out.
Performance Analysis of Several Algorithms for Processing Joins between Textual Attributes
Authors: Weiyi Meng, Clement T. Yu, Wei Wang, Naphtali Rishe
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

Three algorithms for processing joins on attributes of textual type are presented and analyzed in this paper. Since such joins often involve document collections of very large size, it is very important to find efficient algorithms to process them. The three algorithms differ on whether the documents themselves or the inverted files on the documents are used to process the join. Our analysis and the simulation results indicate that the relative performance of these algorithms depends on the input document collections, system characteristics and the input query. For each algorithm, the type of input document collections with which the algorithm is likely to perform well is identified.
Resource Management in Computer Graphics Teaching
Authors: Hedlena M. de A. Bezerra, Bórje F. F. Karlsson, Matheus Cabral de Araújo Gois, Alejandro César Frery
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

The present work discusses the importance of using different elements to accomplish a better learning of computer graphics related concepts, and how to make this information available in a way accessible for students that is useful as learning support tools. We propose and assess the use of a resource site in order to increase the interaction between the courses in the area.
DB2 LOBs: The Teenage Years
Authors: Tobin J. Lehman, Patrick Gainer
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

Previous versions of DB2 Common Server had large objects (LOBs) that were neither large nor functional. Their size was limited to 32,700 bytes and, until recently when support for SUBSTR and CONCAT was added, there was no function available on these objects at all. DB2 LOBs were infants. However, with the latest release of DB2 Common Server, Version 2.1, LOBs have matured considerably, supporting significantly larger sizes and many new language features. To give the reader a feeling for the extent of this new language support, we compare our new SQL LOB language features with that of three other major Relational database competitors: Sybase, Informix and Oracle. Users will find the new DB2 LOBS easy to load and store, easy to search, and easy to integrate into the DB2 user-defined functions (UDFs) and user-defined types (UDTs). In addition, when used in serial mode, the performance of LOB I/O rivals that of file systems and, when used in parallel mode, is a clear winner. DB2 LOBs have now entered the teenage years.
From Embodied Cognitive Science To Synthetic Psychology
Authors: Michael R. W. Dawson
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

One new tradition that has emerged from early research on autonomous robots is embodiedcognitive science. This paper describes the relationship between embodied cognitive scienceand a related tradition, synthetic psychology. It is argued that while both are synthetic, embodied cognitive science is anti-representational while synthetic psychology still appeals torepresentations. It is further argued that modern connectionism offers a medium for conductingsynthetic psychology, provided that researchers analyze the internal representations that theirnetworks develop. Some case studies that illustrate this approach are presented in brief.
PTC: Proxies that Transcode and Cache in Heterogeneous Web Client Environments
Authors: Aameek Singh, Abhishek Trivedi, Krithi Ramamritham, Prashant J. Shenoy
Venue: Proceedings of the 3rd International Conference on Web Information Systems Engineering (2002)

Advances in computing and communication technologieshave resulted in a wide variety of networked mobile devicesthat access data over the Internet. In this paper, we arguethat servers by themselves may not be able to handle thisdiversity in client characteristics and intermediate proxiesshould be employed to handle the mismatch between theserver-supplied data and the client capabilities. Since existingproxies are primarily designed to handle traditionalwired hosts, such proxy architectures will need to be enhancedto handle mobile devices. We propose such an enhancedproxy architecture that is capable of handling theheterogeneity in client needs-specifically the variations inclient bandwidth and display capabilities. Our architecturecombines transcoding (which is used to match the fidelityof the requested object to client capabilities) and caching(which is used to reduce the latency for accessing popularobjects). Our proxies can intelligently adapt to prevailingsystem conditions using learning techniques to intelligentlydecide whether to transcode locally or fetch an appropriateversion from the server. Our experimental results indicatethat such strategies produce significant improvementsin the client response times. Further, we find that even simplelearning techniques can lead to significant performanceimprovements.