ppxscal/embedding_network huggingface dataset:
Beyond Instant Messaging
Authors: John C. Tang, James "Bo" Begole
Venue: Queue (2003)

The recent rise in popularity of IM (instant messaging) has driven the development of platforms and the emergence of standards to support IM. Especially as the use of IM has migrated from online socializing at home to business settings, there is a need to provide robust platforms with the interfaces that business customers use to integrate with other work applications. Yet, in the rush to develop a mature IM infrastructure, it is also important to recognize that IM features and uses are still evolving. For example, popular press stories1 have raised the concern that IM interactions may be too distracting in the workplace. This concern suggests that we still need to fine-tune the interface design for IM so the benefits of quick, lightweight communication can be gained without creating a distracting burden for users. How can the industry meet the demand for robust platforms and standards for IM without locking out innovation and development?
Multi-Tier Architecture for Web Search Engines
Authors: Knut Magne Risvik, Yngve Aasheim, Mathias Lidal
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

This paper describes a novel multi-tier architecture for a search engine. Based on observations from query log analysis as well as properties of a ranking formula, we derive a method to tier documents in a search engine. This allows for increased performance while keeping the order of the results returned, and hence relevance, almost "untouched". The architecture and method have been tested large scale on a carrier-class search engine with 1 billion documents. The architecture gives a hugh increase in capacity, and is today in use for a major search engine.
Reducing Redundancy in the Hypertree Decomposition Scheme
Authors: Peter Harvey, Aditya Ghose
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Hypertree decomposition is a powerful technique for transforming near-acyclic CSPs into acyclic CSPs. Acyclic CSPs have efficient, polynomial time solving techniques, and so these conversions are of interest to the constraints community. We present here an improvement on the opt-k-decomp algorithm for finding an optimal hypertree decomposition.
A Java Cryptography Service Provider Implementing One-Time Pad
Authors: Timothy E. Lindquist, Mohamed Diarra, Bruce R. Millard
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Security is a challenging aspect of communications today that touches many areas including memory space, processing speed, code development and maintenance issues. When it comes to dealing with lightweight computing devices, each of these problems is amplified. In an attempt to address some of these problems, SUN's Java 2 Standard Edition version 1.4 includes the Java Cryptography Architecture (JCA). The JCA provides a single encryption API for application developers within a framework where multiple service providers may implement different algorithms. To the extent possible application developers have available multiple encryption technologies through a framework of common classes, interfaces and methods.The One Time Pad encryption method is a simple and reliable cryptographic algorithm whose characteristics make it attractive for communication with limited computing devices. The major difficulty of the One-Time pad is key distribution.In this paper, we present an implementation of One-Time Pad as a JCA service provider, and demonstrate its usefulness on Palm devices.
Retransmission protocol designs and analyses for high speed packet access in 3g systems
Authors: Moonyoung Choi
Venue:  (2003)

Advanced Internet applications combined with high-speed wireless transmissions will provide subscribers with high-quality multimedia services in wireless access, which is to emerge in 3G and future generation wireless networks. A major challenge in the design of future generation wireless networks is to simultaneously achieve high channel utilization and provide required quality of service (QoS) for multimedia applications. This dissertation focuses on the data link layer and media-access sublayer addressing the retransmission schemes for various types of traffic in high speed 3G wireless communication systems. We examine, analyze and design several retransmission and packet access schemes for high speed wireless communication systems. Basic automatic repeat request (ARQ) scheme designs are analyzed and performance differences between two ARQ approaches (ACK-NAK-based ARQ and NAK-based ARQ) are presented in terms of throughput and delay. Both the random error channel and the correlated fading channel are considered. Unified expressions for evaluating different ARQ strategies with multi-copy retransmissions are obtained for both ACK-NAK-based ARQ and NAK-based ARQ. Hybrid ARQ schemes for variable error rate channels in high speed wireless systems are examined and discussed. Analyses on random access channel (RACH) and common packet channel (CPCH) access schemes with the consideration of time-slotted behaviors are provided. Previous continuous analysis did not fully characterize the CPCH access scheme. A CPCH scheme with two or more traffic types with different priorities is proposed and its numerical results are presented. Multi-channel hybrid ARQ schemes with correlated error channels are introduced and their throughput performances are compared. These schemes apply to high speed downlink packet access (HSDPA) in wideband code division multiple access (W-CDMA) and orthogonal frequency division multiplexing (OFDM) systems.
Frame Selection for Dynamic Caching Adjustment in Video Proxy Servers
Authors: Wei-Hsiu Ma, David H. C. Du
Venue: Multimedia Tools and Applications (2004)

By caching video data, a video proxy server close to the clients can be used to assist video delivery and alleviate the load of video servers. We assume a video can be partially cached and a certain number of video frames are stored in the proxy server. In our setting, the proxy server is allowed to cache the passing data from the video server. A video provides several options (levels) in terms of bandwidth requirement over the server-proxy path. For each video, the proxy server decides to cache a smaller amount of data at a lower level or to accumulate more data to reach a higher level. The proxy server can dynamically adjust the cached video data by choosing an appropriate level based on the network condition or the popularity of the video. We propose a frame selection scheme, Dynamic Chunk Algorithm, to determine which frames are to be cached in the proxy server for the dynamic caching adjustment scenario. The algorithm guarantees the rate constraint over the server-proxy path to be satisfied for each level. This approach also maintains the set of cached frames at a higher level as a superset of the cached frames at a lower level. Hence, it enforces the proxy server to simply cache more data without dropping frames when it intends to reduce network bandwidth consumption for a video and vice versa.
Operations Which Preserve Path-Width at Most Two
Authors: János Barát, Péter Hajnal
Venue: Combinatorics, Probability and Computing (2001)

The number of excluded minors for the class of graphs with path-width at most two is very large. To give a practical characterization of the obstructions, we introduce some operations which preserve path-width at most two. We give a list of ten graphs such that any graph with path-width more than two can be reduced &ndash; by taking minors and applying our operations &ndash; to one of the graphs on our list. We think that our operations and excluded substructures give a far more transparent description of the class of graphs with path-width at most two than Kinnersley and Langston's characterization by 110 excluded minors (see [4]).
An internet accessible telepresence
Authors: A. E. Kaplan, S. Keshav, N. L. Schryer, J. H. Venutolo
Venue: Multimedia Systems (1997)

The US Vice President, Al Gore, in a speech on the information superhighway, suggested that it could be used to remotely control a nuclear reactor. We do not have enough confidence in computer software, hardware, or networks to attempt this experiment, but have instead built a Internet-accessible, remote-controlled model car that provides a race driver's view via a video camera mounted on the model car. The remote user can see live video from the car, and, using a mouse, control the speed and direction of the car. The challenge was to build a car that could be controlled by novice users in narrow corridors, and that would work not only with the full motion video that the car natively provides, but also with the limited size and frame rate video available over the Internet multicast backbone. We have built a car that has been driven from a site 50 miles away over a 56-kbps IP link using nv format video at as little as one frame per second and at as low as 100 × 100 pixels resolution. We also built hardware to control the car, using a slightly modified voice grade channel videophone. Our experience leads us to believe that it is now possible to put together readily available hardware and software components to build a cheap and effective telepresence.
Adaptive categorization of ART networks in robot behavior learning using game-theoretic formulation
Authors: Wai-keung Fung, Yun-hui Liu
Venue: Neural Networks (2003)

Adaptive Resonance Theory (ART) networks are employed in robot behavior learning. Two of the difficulties in online robot behavior learning, namely, (1) exponential memory increases with time, (2) difficulty for operators to specify learning tasks accuracy and control learning attention before learning. In order to remedy the aforementioned difficulties, an adaptive categorization mechanism is introduced in ART networks for perceptual and action patterns categorization in this paper. A game-theoretic formulation of adaptive categorization for ART networks is proposed for vigilance parameter adaptation for category size control on the categories formed. The proposed vigilance parameter update rule can help improving categorization performance in the aspect of category number stability and solve the problem of selecting initial vigilance parameter prior to pattern categorization in traditional ART networks. Behavior learning using physical robot is conducted to demonstrate the effectiveness of the proposed adaptive categorization mechanism in ART networks.
Lower Bounds for the Probability of Intersection of Several Unions of Events
Authors: Tuhao Chen, E. Seneta
Venue: Combinatorics, Probability and Computing (1998)

To bound the probability of a union of n events from a single set of events, Bonferroni inequalities are sometimes used. There are sharper bounds which are called Sobel&ndash;Uppuluri&ndash;Galambos inequalities. When two (or more) sets of events are involved, bounds are considered on the probability of intersection of several such unions, one union from each set. We present a method for unified treatment of bivariate lower and upper bounds in this note. The lower bounds obtained are new and at least as good as lower bounds appearing in the literature so far. The upper bounds coincide with existing bivariate Sobel&ndash;Uppuluri&ndash;Galambos type upper bounds derived by the method of indicator functions. A numerical example is given to illustrate that the new lower bounds can be strictly better than existing ones.
A New Hybrid Approach to Handwritten Address Verification
Authors: C. K. Lee, C. G. Leedham
Venue: International Journal of Computer Vision (2004)

The use of optical character recognition (OCR) has achieved considerable success in the sorting of machine-printed mail. The automatic reading of unconstrained handwritten addresses however, is less successful. This is due to the high error rate caused by the wide variability of handwriting styles and writing implements. This paper describes a strategy for automatic handwritten address reading which integrates a postcode recognition system with a hybrid verification stage. The hybrid verification system seeks to reduce the error rate by correlating the postcode against features extracted and words recognised from the remainder of the handwritten address. Novel use of syntactic features extracted from words has resulted in a significant reduction in the error rate while keeping the recognition rate high. Experimental results on a testset of 1,071 typical Singapore addresses showed a significant improvements from 24.0% error rate, 71.2% correct recognition rate, and 4.8% rejection rate using &ldquo;raw&rdquo; OCR postcode recognition to 0.4% error rate, 65.1% correct recognition rate, and 34.5% rejection rate using the hybrid verification approach. The performance of the approach compares favourably with the currently installed commercial system at Singapore Post, which achieved 0.7% error rate, 47.8% correct recognition rate, and 51.5% rejection rate for 6-digit postcode using the same test data.
Proceedings of the 2003 conference on Interaction design and children
Authors: Stuart MacFarlane, Tony Nicol, Janet Read, Linda Snape
Venue: Interaction Design and Children (2003)

Nine months ago, I found myself in the Netherlands, attending (and very much enjoying) the International Workshop on 'Interaction Design and Children', organised by Tilde Bekker, Patios Markopoulos, and Maia Kersten-Tsikalkina, of the Eindhoven University of Technology. They deserve congratulation for their foresight in organising that event (and for coming up with its wonderfully concise but descriptive title!) ; it attracted a range of excellent papers, and a large audience of interested researchers and practitioners working in the field of interactive technologies for children. It was clear that there was a demand for more such events.Perhaps carried away by the euphoria of the occasion, my colleagues and I arrived home. t o the realisation that we had volunteered to organise a similar event for 2003. Our first problem was what to call it. We wanted to keep the title 'Interaction Design and Children'. The Eindhoven event was called 'Workshop', but looked like a conference; we decided to call the 2003 event a Conference. So, is this the first International Conference on Interaction Design and Children, or the second? Unable to solve this puzzle, we have simply called it Interaction Design and Children 2003.We are pleased to present in this volume the fifteen full papers accepted for presentation at IDC2003. They cover a range of interesting and high quality research, including applications of new technologies, evaluation of products with children, and designing products with and for children. A strong theme throughout is the search for effective methods to involve children in all stages of the life cycle of interactive products - requirements elicitation, design, implementation, evaluation, and use. Many of these methods are in their infancy; there is scope for radical innovation. This is an exciting field to be working in!Opening these Proceedings are extended abstracts of the keynote talks by Alan Dix and Yasmin Kafai. Echoing the theme of the papers above, both consider, in different ways, what we can learn from children. Alan muses on what it is to be playful, using a range of intriguing examples. Yasmin describes a series of projects in which children have designed software for younger children, and considers what we can learn from what they have achieved.Also in this volume are summaries of the posters and interactive demonstrations presented at the conference, and position statements from the participants in a (hopefully controversial) panel discussion on usability testing for children's online interfaces.
Component-Based Workflow Architecture of a Distributed Software Process Management System
Authors: Xie Yongyi, Zhang Weishi
Venue: Proceedings of the Third International Conference on Quality Software (2003)

This paper deals with the component-based workflow architecture of a distributed software processmanagement system called BetterProcess, which is constructed to help software companies improve thequality and efficiency of cooperative work in software process improvement. Five requirements are discussedas the motivations in this paper. This architecture presents the overall structure of the system BetterProcess,which consists of its architectural software components, the externally visible properties of those components,and the relationships of them. These components mainly include the Client Runtime Engine, the CooperativeServer Engine, the Information Converter, the Information Access Middleware, etc. This paper also presentsthe application of this architecture in a specific distributed software process management for an ongoingdevelopment of a Web-based Shipping Management Information System.
Parallel Algorithm for Mining Fuzzy Association Rules
Authors: Baowen Xu, Jianjiang Lu, Yingzhou Zhang, Lei Xu, Huowang Chen, Hongji Yang
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

The principle and steps of the algorithm formining fuzzy association rules is studied, and theparallel algorithm for mining fuzzy association rulesis presented. In this parallel mining algorithm,quantitative attributes are partitioned into severalfuzzy sets by the parallel fuzzy c-means algorithm, andfuzzy sets are applied to soften the partition boundaryof the attributes. Then, the parallel algorithm formining Boolean association rules is improved todiscover frequent fuzzy attributes. Last, the fuzzyassociation rules with at least fuzzy confidence aregenerated on all processors. The parallel miningalgorithm is implemented on the distributed linkedPC/workstation. The experiment results show that theparallel mining algorithm has fine scaleup, sizeup andspeedup.
End-to-End Stored FGS Video Transmission Based on Adaptive Smoothing and TCP-Friendly Rate Control
Authors: Hao Yin, Chuang Lin, Qian Zhang
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

This paper presents a design of an end-to-end smooth and TCP-friendly transmission for stored MPEG-4 Fine-Grained Scalable (FGS) videos over the best-effort Internet. We first present a novel framework for FGS video delivery over a TCP-friendly connection. Under the assumption of complete knowledge of bandwidth evolution, we derive an optimal policy for layer selection such that consistent quality playback is ensured when the network conditions are constantly varying. Based on this ideal optimal policy, we develop an online heuristic smoothing algorithm based on bandwidth prediction. Through simulation experiments, it has been shown that heuristic policy performs almost as well as the ideal optimal policy for a wide-range of bandwidth scenarios, and smooth and TCP-friendly video transfer can be accomplished by our proposed scheme.
Nonlinear pressure and temperature waves propagation in fluid saturated rock
Authors: M. De'Michieli Vitturi, F. Beux
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

In this study, we consider a non-linear one dimensional model for temperature and pressure waves in fluid saturated porous rock due to abrupt variations in depth. The geological system studied, illustrated in Fig.1, represents a horizontal medium overlying an aquifer in a hypertermal domain. The aquifer consist of a homogeneus isotropic deep horizon identified as a source of temperature or pressure change (for exemple, magma due to intrusion, friction fault phenomena, etc.). This is covered by a homogeneous isotropic upper horizon, with a lower temperature, represented by a fluid-saturated porous permeable medium.
Supply Chain Coordination by Means of Automated Negotiations
Authors: Andreas Fink
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

The coordination within supply chains depends on appropriate forms of distributed decision making. Considering joint decisions as formal contracts, the coordination problem may be regarded as a search process in a corresponding contract space. Automated negotiations, with firms or decision making units represented as software agents, can provide an effectivemechanism to determine mutually beneficial contracts. The generic negotiation approach examined in this paper is based on a formal specification of contracts that represent bilateral collaborations between two firms (agents) which aim for the coordination of their production sequences. Taking into account asymmetric information and opportunistic behavior, a mediator supports the negotiation process. This mediator repeatedly generates new candidate contracts, which are accepted or rejected by the agents according to particular strategies. We define an explicit mechanism for implementing a cooperative acceptance criterion, whereby agents conditionally agree on utility deteriorations according to a probabilistic criterionsimilar to that of simulated annealing. The proposed design enables the definition of negotiation rules to be verified by the mediator, forcing both agents to behave in a cooperative manner. The negotiation approach is validated for different supply chain sequencing scenarios. In spite of the simplicity and generality of the negotiation mechanism, the experimental results are very promising. Thus automated negotiations may constitute an effective means for coordinating decisions within supply chains.
Generalized Stack Permutations
Authors: M. D. Atkinson
Venue: Combinatorics, Probability and Computing (1998)

Stacks which allow elements to be pushed into any of the top r positions and popped from any of the top s positions are studied. An asymptotic formula for the number un of permutations of length n sortable by such a stack is found in the cases r=1 or s=1. This formula is found from the generating function of un. The sortable permutations are characterized if r=1 or s=1 or r=s=2 by a forbidden subsequence condition.
The structure of the ILLIAC IV operating system
Authors: Peter A. Alsberg, Carlton R. Mills
Venue: Proceedings of the second symposium on Operating systems principles (1969)

The paper outlines the structure of the operating system for the ILLIAC IV, a large array computer being built by the University of Illinois. The system is unique in that it resides primarily on a second control computer and distributes operating system functions among independent programs in a multi-programming, multi-processing mix, where inter-program communication is accomplished by buffer files. The job control language interpreter and hardware interrupt dispatcher are independent modules which may be user defined, invoked dynamically, and co-exist with the standard system modules.
Autonomous Decentralized Database System Reconstruction Technology through Mobile Agent Monitoring and Coordination
Authors: Carlos Perez Leguizamo, Dake Wang, Kinji Mori
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Due to the progress of information technology and widespread of e-business, the market has become diversifiedand highly dynamic based on changing user's preferences.To meet the extensive competition in a dynamic environment,Autonomous Decentralized Database System basedon autonomous coordinating subsystems has been proposed.Autonomy and decentralization of subsystems helpachieving high response time in highly competitive situationand an autonomous Mobile Agent based coordinationhas been proposed to achieve flexibility in a highlydynamic environment.Further, the system is providedwith autonomous reconstruction to coordinate the heterogeneousrequirements of multiple subsystem.Based onthe complementary requirements of the subsystems, heterogeneitydistribution has been defined to accomplish thereconstruction process.This autonomous reconstructionconsists of autonomous division and autonomous integrationof the system, based on the ever changing situation,to assure high response time.