ppxscal/embedding_network huggingface dataset:
A Dynamic Buffer Allocation Scheme for Nrt-Traffics in ATM Switches
Authors: Hong-Soon Namo, Je-Chan Kim, Bong-Tae Kim
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

In this paper, we propose a dynamic buffer allocation scheme for nrt-traffics in ATM switches that accommodates various service classes using a common buffer. This scheme dynamically controls thresholds of the buffer not to drop cells for loss-specified services and fairly allocates the buffer space among best effort services. When the buffer occupancy exceeds a certain threshold level, it begins early packet discard (EPD) mechanism for unspecified bit rate (UBR) and guaranteed frame rate (GFR). By dynamically sharing the buffer space among different services, this scheme can improve both fairness and buffer utilization to support various qualities of service (QoS) requirements.
The GOMS Family of Analysis Techniques: Tools for Design and Evaluation
Authors: Bonnie E. John, David E. Kieras
Venue:  (1994)

Since the seminal Card, Moran, & Newell (1983) book, "The psychology of human-computer interaction", the concept of the GOMS model has been one of the few widely known theoretical concepts in human-computer interaction. This concept has spawned much research to verify and extend the original concept and has been used in real-world design and evaluation situations. The original presentation of the GOMS concept left substantial room for interpretation and subsequent researchers and practitioners have applied the idea in a variety of ways. While this variety shows that the GOMS concept is fruitful, there is some confusion about the GOMS concept and the various approaches that share this label yet appear to be radically different. This paper synthesizes the previous work on GOMS to provide an integrated view of GOMS models and how they can be used in design. The major variants of GOMS that have matured sufficiently be be used in real-world design and evaluation situations are described and related to the original GOMS proposal and to each other. A single example is used to illustrate all of the techniques. Guidance is provided to practitioners who wish to use GOMS for their design and evaluation problems, and examples of actual applications of GOMS techniques are presented.
User-Level Dynamic Page Migration for Multiprogrammed Shared-Memory Multiprocessors
Authors: Dimitrios S. Nikolopoulos, Theodore S. Papatheodorou, Constantine D. Polychronopoulos, Jesús Labarta, Eduard Ayguadé
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

This paper presents algorithms for improving the performance of parallel programs on multiprogrammed shared-memory NUMA multiprocessors, via the use of user-level dynamic page migration. The idea that drives the algorithms is that a page migration engine can perform accurate and timely page migrations in a multiprogrammed system if it can correlate page reference information with scheduling information obtained from the operating system. The necessary page migrations can be performed as a response to scheduling events that break the implicit association between threads and their memory affinity sets. We present two algorithms that use feedback from the kernel scheduler to aggressively migrate pages upon thread migrations. The first algorithm exploits the iterative nature of parallel programs, while the second targets generic codes without making assumptions on their structure. Performance evaluation on an SGI Origin2000 shows that our page migration algorithms provide substantial improvements in throughput of up to 264% compared to the native IRIX 6.5.5 page placement and migration schemes.
Test Case Design Based on Z and the Classification-Tree Method
Authors: Harbhajan Singh, Mirko Conrad, Sadegh Sadeghipour
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

Software testing often consumes up to 50 percent of the overall software costs. A large amount of time and money within the test process is spent due to incomplete, inconsistent or ambiguos informal specifications of the test objects. A more formal approach to the early phases of software development can reduce the error rate drastically and, in addition, can significantly improve the central testing activities like test case design and test evaluation. This paper presents an approach for generating test cases from formal specifications written in Z by combining the classification-tree method for partition testing with the disjunctive normal form approach. Firstly, a classification tree describing high level test cases is constructed from the formal specification of the test object. Then the high level test cases are further refined by generating a disjunctive normal form for them. The refined test cases obtained this way cover all specified aspects of the system explicitly and also contain all information necessary to evaluate the test results. The proposed combination of the classification-tree method with the disjunctive normal form approach preserves advantages of both methods, overcomes most of their limitations, and can be supported by tools.
An Object Recognition System for Complex Imagery that Models the Probability of a False Positive
Authors: Clark F. Olson, Daniel P. Huttenlocher
Venue:  (1996)

This paper describes an object recognition system for use in complex imagery that can perform recognition adaptively by setting the matching threshold such that the probability of a false positive is low. In order to accurately model small, irregularly shaped objects, we represent the objects using dense sets of edge pixels with associated local orientations. Three-dimensional objects are modeled by a set of two-dimensional views of the object. We allow translation, rotation, and scaling of the views to approximate full three-dimensional motion of the object. We use a version of the Hausdorff measure to determine which positions of an object model are good matches to an image. These positions are determined efficiently through the examination of a hierarchical cell decomposition of the transformation space, which allows large volumes of the space to be pruned quickly. Additional techniques are used to decrease the computation time of the method when matching is performed against a catalog of object models. We then describe a new model of the matching process that allows the probability of a false positive to be estimated efficiently at run-time. Finally, we give results of this system recognizing object in infrared and intensity images.
Biometric Recognition: Security and Privacy Concerns
Authors: Salil Prabhakar, Sharath Pankanti, Anil K. Jain
Venue: IEEE Security and Privacy (2003)

Biometrics offers greater security and convenience than traditional methods of personal recognition. But how secure is biometrics? And what are the privacy implications?
Note on the Work Function Algorithm
Authors: Csaba Bela
Venue:  (1999)

We prove that the work function algorithm is $(n-1)$-competitive for the $k$-server problem, where $n$ is the number of points in the metric space. This gives improved upper bounds when $k+3 \leq n \leq 2k-1$; in particular, it shows that the work function algorithm is optimal for $k=n-1$.
Maintaining Credible Dialogs in a VideoBot System with Special Audio Techniques
Authors: Doug DeGroot
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

An approach to using actual audio and video clips of real humans to construct artificial, conversational agents and bots is presented. This approach differs from other schemes focusing on believable, emotional, intelligent agents and bots in that it begins with real human subjects but constructs artificial behaviors and interactions with human users as opposed to beginning with artificial characters and trying to construct real interactions. The approach presents several production challenges during the filming, postproduction, and scripting phases of bot creation that make it difficult for human users to sustain suspension of disbelief during interaction with the bot. Various approaches to solving these problems are presented and described.
VERITAS An Application for Knowledge Verification
Authors: Jorge Santos, Carlos Ramos, Zita A. Vale, Albino Marques
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

Knowledge Management is one of the most important goals of any organization. Therefore, several automatic tools are used for that purpose, e.g. Knowledge Based Systems (KBS), Experts Systems, Data Mining Applications and Computer Aided Decision Systems. The Validation and Verification (V & V) process is fundamental in order to ensure the quality of used knowledge. The usage of Automatic Verification tools can be a reliable, inexpensive and reusable way to overcome the constant growth of the Knowledge Bases, the shortening of development times and the costs of Validation, specially field tests. This paper addresses the Verification of Knowledge Based Systems, Focusing on VERITAS, a verification tool initially developed to verify a KBS used to assist operators of Portuguese Transmission Control Centers in incident analysis and power restoration. VERITAS performs knowledge base structural analysis allowing the detection of knowledge anomalies.
Challenges to Transforming IT in the US Government
Authors: Simon Liu, John D. Hwang
Venue: IT Professional (2003)

Nearly seven years ago, the US Congress passed the Clinger-Cohen Act to revolutionize IT management in federal agencies. So, where's the e-government?
Mining Typhoon Knowledge with Neural Networks
Authors: Zhihua Zhou, Shifu Chen, Zhaoqian Chen
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

Neural network technology has not been fully utilized in data mining. The reason is two-sided. First, most neural algorithms need long-term training, and could not perform incremental learning. Second, the knowledge learned by neural networks is concealed in a large amount of connections. In this paper, we develop a neural network method to mine typhoon knowledge through overcoming those two obstacles. Experimental results show that our method could return considerable reward.
TabSum: A Flexible and Dynamic Table Summarization Approach
Authors: Ming-Ling Lo, Kun-Lung Wu, Philip S. Yu
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Many diverse small devices, such as smart phones and personal digital assistants, are being deployed to access the Internet. Small devices typically have limited display and processing capabilities. It is thus difficult to effectively present a large table of information on these different devices such that the users can easily browse the table.In this paper, we present the design and prototype implementation of TabSum, a flexible and dynamic table summarization approach to reducing tables into smaller but still meaningful representations for various devices. TabSum supports easy browsing of a large table by various devices and provides personalization by taking into account both device capabilities and user preferences. A multi-source multi-layered specification methodology is proposed to describe summarization rules preferred by various sources. Upon requests, a set of table reduction rules is dynamically applied to the rows and columns of a table to reduce its size. The approach is flexible and dynamic. It summarizes both numeric and non-numeric data types.
Real-Time Task Scheduling for a Variable Voltage Processor
Authors: Takanori Okuma, Tohru Ishihara, Hiroto Yasuura
Venue: Proceedings of the 12th international symposium on System synthesis (1999)

This paper presents a real-time task scheduling technique with a variable voltage processor which can vary its supply voltage dynamically. Using such a processor, running tasks with a low supply voltage leads to drastic power reduction. However, reducing the supply voltage may violate real-time constraints. In this paper, we propose a scheduling technique which simultaneously assigns both CPU time and a supply voltage to each task so as to minimize total energy consumption while satisfying all real-time constraints. Experimental results demonstrate effectiveness of the proposed technique.
Improved bound for the Carathéodory rank of the bases of a matroid
Authors: José Coelho de Pina, José Soares
Venue: Journal of Combinatorial Theory Series B (2003)

Let M be a matroid on m elements and let r be its rank. We show that any vector in the integer cone of the incidence vectors of bases of M can be written as nonnegative integer combination of at most m + r - 1 incidence vectors of bases of M.
Dynamic Load Balancing in Geographically Distributed Heterogeneous Web Servers
Authors: Michele Colajanni, Valeria Cardellini, Philip S. Yu
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

With ever increasing Web traffic, a distributed multi-server Web site can provide scalability and flexibility to cope with growing client demands. Load balancing algorithms to spread the requests across multiple Web servers are crucial to achieve the scalability. Various domain name server (DNS) based schedulers have been proposed in the literature, mainly for multiple homogeneous servers. The presence of heterogeneous Web servers not only increases the complexity of the DNS scheduling problem, but also makes previously proposed algorithms for homogeneous distributed systems not directly applicable. This leads us to propose new policies, called adaptive TTL algorithms, that take into account of both the uneven distribution of client request rates and heterogeneity of Web servers to adaptively set the time-to-live (TTL) value for each address mapping request. Extensive simulation results show that these strategies are robust and effective in balancing load among geographically distributed heterogeneous Web servers.
Non-Canonical Extensions of Bottom-Up Parsing Techniques
Authors: Thomas G. Szymanski, John H. Williams
Venue:  (1975)

A bottom-up parsing technique which can make non-leftmost possible reductions in sentential forms is said to be non-canonical. Nearly every existing parsing technique can be extended to a non-canonical method which operates on larger classes of grammars and languages than the original technique. Moreover, the resulting parsers run in time linearly proportional to the length of their input strings. Several such extensions are defined and analyzed from the points of view of both power and decidability. The results are presented in terms of a general bottom-up parsing model which yields a common decision procedure for testing membership in many of the existing and extended classes.
A Segmentation System for Touching Handwritten Japanese Characters
Authors: Teruyuki Yamaguchi, Shinji Tsuruoka, Tomohiro Yoshikawa, Tsuyoshi Shinogi, Eiji Makimoto, Hisao Ogata, Malayappan Shridhar
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

The present character recognition system needs the segmentation process as preprocessing fo an input image of the touching character string. The process divides it into some isolated characters. To improve the total performance of the character recognition system, it is required to lessen the number of retrieval path in the candidate character lattice. We proposed the segmentation method based on connecting condition of the neighbor lines to resolve theseproblems in the previous paper. In this paper, we modify our segmentation algorithm, and we evaluate the performance of these segmentation methods by a direct evaluation system with permissible degree and an indirect evaluation using the characte recognition. We confirm theusefulness of our new method for 456 touching handwritten Japanese "Kanji"image with 948 characters by the comparison of three segmentation methods.The correct segmentation rates are 61.4% (conventional method), 75.1% (previous method), and 83.0 % (proposed method).
Matchmaking of web services based on the DAML-S service model
Authors: Sharad Bansal, Jose M. Vidal
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

DAML-S provides the means for a web service to advertise its functionality to potential users of the service. This brings to fore the issue of discovering an advertisement that best matches a request for a particular service---a process referred to as matchmaking. The algorithms that have thus far been proposed for matchmaking are based on comparisons of the requested and offered inputs and outputs. In this project, we extend these algorithms by taking into account the detailed process description of the service, thus leading to more accurate matchmaking.
UGA Software Standards
Authors: Matthias M. Wloka, Nate Huang, D. B Conner
Venue:  (1992)

Software standards are a set of rules applied by programmers to insure readable and maintainable source code. The software standards described in this report cover high-level concepts, such as documentation issues and general approaches to programming, as well as low-level concepts, like naming conventions, code and comment formatting style. The low-level rules are formulated for the C programming language. By applying these software standards to the UGA system, the Brown Graphics Group has been able to create an extensive software environment. The goal of producing readable, maintainable, and consistent source code has been achieved within the UGA system. The concepts can be applied to other software development environments to attain similar goals.
Sensorless Manipulation Using Transverse Vibrations of a Plate
Authors: Karl F. Bohringer, Vivek Bhatt, Ken Y. Goldberg
Venue:  (1995)

The existing industrial parts feeders move the parts through a sequence of mechanical filters that reject parts in unwanted orientations. In this paper we develop a new setup that uses a different vibratory mechanism to systematically manipulate parts, by actively orienting and localizing them. The idea is to generate and change dynamic modes for a plate by varying the applied frequency of oscillation. Depending on the node shapes of the plate for these frequencies, the position and orientation of the parts can be controlled. We develop an analysis of the underlying dynamics, and show that it can be used to predict the behavior of objects placed on the vibrating plate. Using this analysis, we propose that the applied frequencies can be automatically sequenced to obtain a ``sensorless'''' strategy for manipulating a given object.
Functional Decomposition of Polynomials
Authors: Joachim Von zur Gathen, Dexter Kozen, Susan Landau
Venue:  (1987)

NOT AVAILABLE
Routing and Embeddings in Cyclic Petersen Networks: An Efficient Extension of the Petersen Graph
Authors: Chi-Hsiang Yeh, Behrooz Parhami
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

The Petersen graph is a Moore graph that has node degree 3, diameter 2, and optimal network size 10. In this paper, we present a class of interconnection networks, called cyclic Petersen networks (CPNs), which efficiently extend the Petersen graph to obtain larger networks with small diameter and node degree. We derive balanced routing algorithms and efficient embeddings for CPNs. In particular, we show that many normal mesh algorithms can be emulated on CPNs with a slowdown factor of about 1.1. We also show that complete CPNs can embed meshes, tori, meshes of trees, and folded Petersen networks with dilation 3, hyper-cubes and generalized hypercubes with dilation 4, and pyramids with dilation 5.
TCP behavior with many flows
Authors: R. Morris
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

TCP's ability to share a bottleneck fairly and efficiently decreases as the number of competing flows increases. This effect starts to appear when there are more flows, than packers in the delay-bandwidth product. In the limit of large numbers of flows, TCP forces a packet loss rate approaching 50%, causing delays that users are likely to notice. TCP's minimum congestion window of one packet is the source of these problems: it causes a few flows to send too fast while the rest wait in re-transmission time-out. The particular packet loss rate is a function of TCP's abrupt transition front exponential backoff to sending with a window of one or more packets, and of the high rate at which TCP increases small congestion windows. Analysis of packet traces suggests that these aspects of TCP's algorithms contribute substantially to the total loss rate observed on the Internet. One way to work around the problem is to make sure routers have not just one round-trip time of buffering, but buffering proportional to the total number of active flows. A more fundamental cure might make TCP less aggressive and more adaptive when its congestion window is small.
Improved Uniform Test Error Bounds
Authors: Eric Bax
Venue:  (1997)

We derive distribution-free uniform test error bounds that improve on VC-type bounds for validation. We show how to use knowledge of test inputs to improve the bounds. The bounds are sharp, but they require intense computation. We introduce a method to trade sharpness for speed of computation. Also, we compute the bounds for several test cases.
Sensor Placement Design for Object Pose Determination with Three Light-Stripe Range Finders
Authors: Keiichi Kemmotsu, Takeo Kanade
Venue:  (1994)

The pose of a polyhedral object can be determined with range data obtained from a set of simple light-stripe range sensors. However, localization results are highly dependent on sensor placement. This paper presents a method for designing an optimal sensor placement of three light-stripe sensors with which to determine the pose of an arbitrarily positioned object. We evaluate a sensor placement on the basis of average performance measures over the whole state space of object pose by a Monte Carlo method. An optimal sensor placement is then selected by another Monte Carlo method which searches for a maximal score function of the performance measures over the whole state of sensor placements.
Mathematics of Quantum Computation
Authors: Ranee K. Brylinski
Venue:  (2002)

:Among the most exciting developments in science today is the design and construction of the quantum computer. Its realization will be the result of multidisciplinary efforts, but ultimately, it is mathematics that lies at the heart of theoretical quantum computer science.Mathematics of Quantum Computation brings together leading computer scientists, mathematicians, and physicists to provide the first interdisciplinary but mathematically focused exploration of the field's foundations and state of the art. Each section of the book addresses an area of major research, and does so with introductory material that brings newcomers quickly up to speed. Chapters that are more advanced include recent developments not yet published in the open literature.Information technology will inevitably enter into the realm of quantum mechanics, and, more than all the atomic, molecular, optical, and nanotechnology advances, it is the device-independent mathematics that is the foundation of quantum computer and information science. Mathematics of Quantum Computation offers the first up-to-date coverage that has the technical depth and breadth needed by those interested in the challenges being confronted at the frontiers of research.