ppxscal/embedding_network huggingface dataset:
SROAM: An End-to-End Service Model for Improved Performance in Roaming over Wireless LAN Networks
Authors: Jun Yuan, Chao Liu, Xiaoming Li
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Nowadays mobile devices enable users to have various ways to surf on the Internet and broad band communication channels facilitate applications of online multimedia. Most of network real-time multimedia applications run on TCP/IP protocol stack. Although several protocols are proposed to handle the mobility management on network layer, the real-time stream transmission yet suffer severe roaming interruption and hence worsen the playback performance. This paper analyzes the roaming delay and transmission throughput in detail and evaluates the effect of multiple elements constituting the whole roaming delay. A service codenamed Swift Roaming System (SROAM) is proposed to reduce the roaming delay and increase the average transmission throughput. Some initial experiment results are provided to support the effectiveness of the methods proposed in the system.
Toward the Success of eGovernment Initiatives: Mapping Known Success Factors to the Design of Practical Tools
Authors: Jinwon Ho, Theresa A. Pardo
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

This paper introduces a strategy for assessing the practical frameworks that government managers use to guide egovernment investment decisions. A gap analysis strategy is outlined here and a preliminary application of the analysis is presented using a single egovernment investment decision making framework. The gap analysis strategy serves two purposes; to inform the design, development, and use of egovernment investment decision making tools and processes; and to propose a strategy for informing the ongoing debate about information systems research relevance.
An integrated method for estimating selectivities in a multidatabase system
Authors: Qiang Zhu
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

A multidatabase system (MDBS) integrates information from autonomous local databases managed by different database management systems (MDBS) in a distributed environment. A number of challenges are raised for query optimization in such an MDBS. One of the major challenges is that some local optimization information may not be available at the global level. We recently proposed a query sampling method to drive cost estimation formulas for local databases in an MDBS [22]. To use the derived formulas to estimate the costs of queries, we need to know the selectivities of the qualifications of the queries. Unfortunately, existing methods for estimating selectivities cannot be used efficiently in an MDBS environment. This paper discusses difficulties of estimating selectivities in an MDBS. Based on the discussion, this paper presents an integrated method to estimate selectivities in an MDBS. The method integrates and extends several existing methods so that they can be used in an MDBS efficiently. It extends Christodoulakis's parametric method so that estimation accuracy is improved and more types of queries can be handled. It extends Lipton and Naughton's adaptive sampling method so that both performance and accuracy are improved. Theoretical and experimental results show that the extended Lipton and Naughton's method described in this paper can be many times faster than the original one. In addition, the integrated method uses a new piggyback approach to collect and maintain statistics, which can reduce the statistic maintenance cost. The integrated method is designed for the MDBS in the CORDS project (CORDS-MDBS). Implementation considerations are also given in the paper.
A rough set approach to the treatment of continuous-valued attributes in multi-concept classification for mechanical diagnosis
Authors: Li-pheng Khoo, Lian-yin Zhai
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

The efficient use of critical machines or equipment in a manufacturing system requires reliable information about their current operating conditions. This information is often used as a basis for machine condition monitoring and fault diagnosis&mdash;which essentially is an endeavor of knowledge extraction. Rough set theory provides a novel way to knowledge acquisition, especially when dealing with vagueness and uncertainty. It focuses on the discovery of patterns in incomplete and/or inconsistent data. However, rough set theory requires the data analyzed to be in discrete manner. This paper proposes a novel approach to the treatment of continuous-valued attributes in multi-concept classification for mechanical diagnosis using rough set theory. Based on the proposed approach, a prototype system called RClass-Plus has been developed. RClass-Plus is validated using a case study on mechanical fault diagnosis. Details of the validation are described.
Investigation of performance metrics for interconnect stack architectures
Authors: Puneet Gupta, Andrew B. Kahng, Youngmin Kim, Dennis Sylvester
Venue: Proceedings of the 2004 international workshop on System level interconnect prediction (2004)

This paper discusses metrics involving the bandwidth and energy characteristics of arbitrary interconnect stacks. Front-end dimensions are set by lithography and related fabrication restrictions and its performance is easily quantified using well-known metrics such as FO4 or ring oscillator delays, Ioff, and Ion. Back-end dimensions are not similarly constrained yet there are no comparable back-end metrics. In this study we seek figures-of-merit for interconnect architectures (stacks) that describe performance in terms of bandwidth and energy while considering issues such as via blockage and repeaters. A definition of bandwidth is presented and then appropriate via blockage models for interconnect stacks are investigated. In this paper, we improve existing bandwidth and throughput-driven design methodologies by looking at the entire stack rather than a single wiring layer. We also propose the use of bandwidth per unit energy. We evaluate and discuss these metrics in current 130nm and 90nm interconnect technologies.
Context Modeling based Depth Image Compression for Distributed Virtual Environment
Authors: Paul Bao, Douglas Gourlay, Youfu Li
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

Depth images, comprising pixel intensities and depthmap, are viewed as a compact model of 3D scenes andused in 3D image warping for the distributed orcollaborative virtual environment to enable the distributedrendering of complex 3D scenes at relatively low cost. Themajor overhead of the model is the transmission of thedepth images of the initial reference and the subsequentnew views that may be up to a few Mbs in size dependingon the screen resolution. This paper presents efficientcompression techniques specifically designed for the depthimages. Additionally we experiment with the warpedimage quality by reducing the resolution of the depth map.We show that significant compression can be achieved ata cost of a very modest impairment in the perceptualquality of the warped image.
A Solution for the N-bit Parity Problem Using a Single Translated Multiplicative Neuron
Authors: Eduardo Masato Iyoda, Hajime Nobuhara, Kaoru Hirota
Venue: Neural Processing Letters (2003)

A solution to the N-bit parity problem employing a single multiplicative neuron model, called translated multiplicative neuron (&pi;t-neuron), is proposed. The &pi;t-neuron presents the following advantages: (a) &forall;N&ge;1, only 1 &pi;t-neuron is necessary, with a threshold activation function and parameters defined within a specific interval; (b) no learning procedures are required; and (c) the computational cost is the same as the one associated with a simple McCulloch-Pitts neuron. Therefore, the &pi;t-neuron solution to the N-bit parity problem has the lowest computational cost among the neural solutions presented to date.
Polynomiography and applications in art, education, and science
Authors: Bahman Kalantari
Venue: ACM SIGGRAPH 2003 Educators Program (2003)

Polynomiography is the art and science of visualization in approximation of zeros of complex polynomials. Informally speaking polynomiography allows one to take colorful pictures of polynomials. These images can subsequently be recolored in many ways using one's own creativity and artistry. It has tremendous applications in visual arts, education, and science. The paper describes some of these applications. From the artistic point of view polynomiography can be used to create quite a diverse set of images reminiscent of the intricate patterning of carpets and elegant fabrics; abstract expressionist and minimalist art; and even images that resemble cartoon characters. From the educational point of view polynomiography can be used to teach mathematical concepts, theorems, and algorithms, e.g. the algebra and geometry of complex numbers; the notions of convergence, and continuity; geometric constructs such as Voronoi regions; and modern notions such as fractals. From the scientific point of view it provides not only a tool for viewing polynomials, present in virtually every branch of science, but also a tool to discover new theorems.
CAGISTrans: Providing Adaptable Transactional Support for Cooperative Work &ndash; an Extended Treatment
Authors: Heri Ramampiaro, Mads Nygård
Venue: Information Technology and Management (2004)

The theme of this paper is on transactional support for cooperative work environments, focusing on data sharing &ndash; i.e., providing suitable mechanisms to manage concurrent access to shared resources. The subject is not new per se. In fact, in terms of transaction models and frameworks, several solutions already exist. Still, there are some problems that are not solved. Among these are the problems that result from the dynamic and heterogeneous nature of cooperative work. Our solution is to provide transactional support that not only can be tailored to suit different situations, but can also be modified following changes in the actual environment while the work is being performed &ndash; i.e., adaptable transactional support. As part of this, we have identified and extracted the beneficial features from existing models and attempted to extend these to form a transactional framework, called CAGISTrans. This is a framework for the specification of transaction models suiting specific applications. To handle dynamic environments we propose a new way of organizing the elements of a transaction model to allow runtime refinement. In addition, we have developed a transaction management system, built on the middleware principle, to allow interoperability and database independence. Thus this addresses the problems induced by the heterogeneous nature of cooperative environments.
Groups Merging and Groups Disbanding In IP Multicast
Authors: Kwang Yong Koh, Hung Keng Pung
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

A novel method is developed to merge and disbandgroups in IP Multicast while retaining the original setupof their groups. It extends the semantic of joining orleaving a membership from discrete members to groupmembers in IP networks.. It has minimal impact onexisting multicast trees and does not affect the operationsof multicast routing protocols and the Internet GroupManagement (IGMP). It incurs lower processingoverheads by maintaining the merge status of groups atthe network level instead of storing the status atapplication level. A prototype router and testbed havebeen implemented successfully to demonstrate thefeasibility of the proposed solution and for performanceevaluation. The proposed group connection managementfills the necessary gap in the existing IP Multicastarchitecture, where the lack of graceful merging anddisbanding methods present an obstacle for more creativeand complex usage of group applications.
Dynamic Buffer Allocation in Video-on-Demand Systems
Authors: Sang-Ho Lee, Kyu-Young Whang, Yang-Sae Moon, Wook-Shin Han, Il-Yeol Song
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

In video-on-demand (VOD) systems, as the size of the buffer allocated to user requests increases, initial latency and memory requirements increase. Hence, the buffer size must be minimized. The existing static buffer allocation scheme, however, determines the buffer size based on the assumption that the system is in the fully loaded state. Thus, when the system is in a partially loaded state, the scheme allocates a buffer larger than necessary to a user request. This paper proposes a dynamic buffer allocation scheme that allocates to user requests buffers of the minimum size in a partially loaded state, as well as in the fully loaded state. The inherent difficulty in determining the buffer size in the dynamic buffer allocation scheme is that the size of the buffer currently being allocated is dependent on the number of and the sizes of the buffers to be allocated in the next service period. We solve this problem by the predict-and-enforce strategy, where we predict the number and the sizes of future buffers based on inertia assumptions and enforce these assumptions at runtime. Any violation of these assumptions is resolved by deferring service to the violating new user request until the assumptions are satisfied. Since the size of the current buffer is dependent on the sizes of the future buffers, it is represented by a recurrence equation. We provide a solution to this equation, which can be computed at the system initialization time for runtime efficiency. We have performed extensive analysis and simulation. The results show that the dynamic buffer allocation scheme reduces initial latency (averaged over the number of user requests in service from one to the maximum capacity) to {\frac{1}{29.4}} \sim {\frac{1}{11.0}} of that for the static one and, by reducing the memory requirement, increases the number of concurrent user requests to 2.36 \sim 3.25 times that of the static one when averaged over the amount of system memory available. These results demonstrate that the dynamic buffer allocation scheme significantly improves the performance and capacity of VOD systems.
A model for the performance evaluation of packet transmissions using type-II hybrid ARQ over a correlated error channel
Authors: Rami Mukhtar, Stephen Hanly, Moshe Zukherman, Fraser Cameron
Venue: Wireless Networks (2004)

Type-II Hybrid-ARQ (Type-II HARQ) has been shown, under certain circumstances, to increase the efficiency and reduce loss of data transmissions over a wireless channel. However, it is difficult to predict how it will perform when transmission symbol errors are correlated. We present a computationally efficient approach to the performance evaluation of packet transmissions over a wireless link employing Type-II HARQ error mitigation when the physical channel is subject to correlated transmission symbol errors. This provides a tool for static or online optimization of system parameters. We present numerical results for a wide range of channel statistics, illustrating the effect of bit error correlation, bit error rate, and block size on packet latency and loss rate.
An analysis of structural validity in entity-relationship modeling
Authors: James Dullea, Il-Yeol Song, Ioanna Lamprou
Venue: Data Knowledge Engineering (2003)

We explore the criteria that contribute to the structural validity of modeling structures within the entity-relationship (ER) diagram. Our approach examines cardinality constraints in conjunction with the degree of the relationship to address constraint consistency, state compliance, and role uniqueness issues to derive a complete and comprehensive set of decision rules. Unlike typical other analyses that use only maximum cardinality constraints, we have used both maximum and minimum cardinality constraints in defining the properties and their structural validity criteria yielding a complete analysis of the structural validity of recursive, binary, and ternary relationship types. Our study evaluates these relationships as part of the overall diagram and our rules address these relationships as they coexist in a path structure within the model. The contribution of this paper is to provide a comprehensive set of decision rules to determine the structural validity of any ERD containing recursive, binary, and ternary relationships. These decision rules can be readily applied to real world data models regardless of their complexity. The rules can easily be incorporated into the database modeling and designing process, or extended into case tool implementations.
Digging in the wrong spot
Authors: Larry Marine
Venue: interactions (2004)

Ever feel that you were spinning your wheels improving an interface? You made change after change, enhancement after enhancement, all based on design guidelines and usability testing---but nothing seemed to move the product very far toward helping your users accomplish their goals. Maybe you had your sights set on the wrong target. Maybe you were digging in the wrong spot. In this Whiteboard, Larry Marine describes two kinds of digging spots---one straightforward and one less obvious---and explains why and how to dig for the more elusive treasure.<br>--- Elizabeth Buie
Caveat Emptor: What to Know Before Trying to Beat a Consumer System into a Scientific Instrument
Authors: Joseph DiDio III, Norman Chonacky
Venue: Computing in Science and Engineering (2004)

When flexibility is possible or desired and cost is paramount, commercial-off-the-shelf products might be suitable and preferable for scientific applications--as long as you are willing to take the time to investigate and flesh out the inadequacies and drawbacks. If you can succeed in developing a scientifc sensor network by taking advantage of a rich pool of intelligent and powerful consumer electronics, you can simultaneously collect valuable and meaningful data, inspire students, and bask in the idea that somewhere out there, MacGyver would be proud.
TalkBack: a conversational answering machine
Authors: Vidya Lakshmipathy, Chris Schmandt, Natalia Marmasse
Venue: Proceedings of the 16th annual ACM symposium on User interface software and technology (2003)

Current asynchronous voice messaging interfaces, like voicemail, fail to take advantage of our conversational skills. TalkBack restores conversational turn-taking to voicemail retrieval by dividing voice messages into smaller sections based on the most significant silent and filled pauses and pausing after each to record a response. The responses are composed into a reply, alternating with snippets of the original message for context. TalkBack is built into a digital picture frame; the recipient touches a picture of the caller to hear each segment of the message in turn. The minimal interface models synchronous interaction and facilitates asynchronous voice messaging. TalkBack can also present a voice-annotated slide show which it receives over the Internet.
An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction
Authors: Hervé Daudé, Philippe Flajolet, Brigitte Vallée
Venue: Combinatorics, Probability and Computing (1997)

The Gaussian algorithm for lattice reduction in dimension 2 is analysed under its standard version. It is found that, when applied to random inputs in a continuous model, the complexity is constant on average, its probability distribution decays geometrically, and the dynamics are characterized by a conditional invariant measure. The proofs make use of connections between lattice reduction, continued fractions, continuants, and functional operators. Analysis in the discrete model and detailed numerical data are also presented.
Babel in the international caf&#x00E9;: a respectful critique
Authors: Beverly Trayner
Venue: Communities and Technologies (2003)

This paper reflects on the case of participants with different first languages conversing in "The International Café" in an online workshop about Communities of Practice. It describes the context of the café within the workshop and an informal translation experiment designed to bring together community members with different first languages. In the light of this experiment the paper critically reflects on the effectiveness of translation for negotiating meaning in international community conversations. It discusses the value of cultivating global literacies where language is considered not as a technical issue requiring translation equivalence, but as something that shapes individual and collective worldviews, where the fine-tuning and exploration of situated meanings of people with different first languages is viewed as integral to the process of interacting, learning and sharing knowledge in an international community. The reflections highlight a connected issue of time: for participating in, facilitating and designing for such conversations. Finally, international conversations in the café are contextualised as part of a broader issue of clarifying the purpose and principles behind cultivating a truly international online community workshop. Four key issues arising from this reflective critique are tentatively offered as inter-connected design factors for international online community environments.
Accuracy improvement of automatic text classification based on feature transformation
Authors: Guowei Zu, Wataru Ohyama, Tetsushi Wakabayashi, Fumitaka Kimura
Venue: Proceedings of the 2003 ACM symposium on Document engineering (2003)

In this paper, we describe a comparative study on techniques of feature transformation and classification to improve the accuracy of automatic text classification. The normalization to the relative word frequency, the principal component analysis (K-L transformation) and the power transformation were applied to the feature vectors, which were classified by the Euclidean distance, the linear discriminant function, the projection distance, the modified projection distance and the SVM.
Using a Log-normal Failure Rate Distribution for Worst Case Bound Reliability Prediction
Authors: Peter G. Bishop, Robin E. Bloomfield
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

Prior research has suggested that the failure rates offaults follow a log normal distribution. We propose aspecific model where distributions close to a log normalarise naturally from the program structure. The lognormal distribution presents a problem when used inreliability growth models as it is not mathematicallytractable. However we demonstrate that a worst casebound can be estimated that is less pessimistic than ourearlier worst case bound theory.
Fluorination of carbon nanotubes within the molecular cluster method
Authors: N. G. Lebedev, I. V. Zaporotskova, L. A. Chernozatonskii
Venue: Microelectronic Engineering (2003)

Computations of single-wall carbon nanotube fluorination processes have been carried out within the framework of the molecular cluster model and semiempirical quantum-chemical MNDO scheme. The adsorption energy for the fluorine atom as a function of distance from the surface of the carbon has been calculated. Chemically stable and van der Waals metastable stations of F atoms on nanotube surfaces have been found. The adsorption process for two fluorine atoms on adjacent surface carbons has been studied. It has been found that the second fluorine atom is adsorbed without van der Waals metastable station. The probability of the processes has been estimated in the quasi-classical approach. The greatest possible concentration ratio F/C of almost all investigated nanotubes has been found to be 1 except for the (8,8) nanotube for which the ratio is 0.75.