ppxscal/embedding_network huggingface dataset:
A New Explicit Rate-Based Congestion Control Scheme for ABR Services
Authors: King T. Ma, Ravi Sankar, Kenneth J. Christensen
Venue: Proceedings of the 22nd Annual IEEE Conference on Local Computer Networks (1997)

The ATM Forum has adopted the rate-based scheme as the standard for ABR services. Effective ABR services are essential for ATM LAN Emulation. In this paper we propose a new algorithm or scheme that has equivalent or better performance than existing schemes, but requires only O(1) computation. This O(1) computation is independent of both the number and rates of the connections. The scheme, called the "USF scheme", is compared via simulation to the existing EPRCA, MIT, and OSU schemes. Results show that the less complex USF scheme provides better throughput, delay, and fairness than the existing schemes.
Java concurent program for the Samarandache function
Authors: David Power, Sabin Tabirca, Tatiana Tabirca
Venue: Smarandache Notions Journal (2002)

The aim of this article is to propose a Java concurrent program for the Smarandache function based on the equation S(p1k1.....psks) = max{S(p1k1,....,S(psks)}. Some results concerning the theoretical complexity of this program are proposed. Finally, the experimental results of the sequential and Java programs are given in order to demonstrate the efficiency of the concurrent implementation.
Designing social force: control for collective behavior of learning individuals
Authors: Keiki Takadama, Katsunori Shimohara
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

This paper explores methods for controlling the collective behavior of learning individuals (e.g., robots, agents) to achieve goals at the collective level while these individuals pursue their own goals at the individual level. Toward this enormous goal, we start by categorizing the four levels for controlling individuals in terms of both direct and indirect control, and then investigate the results at each control level to clarify the extent to which degree we should force the learning individuals to achieve goals at the collective level.
Automatic corpus-based tone and break-index prediction using K-ToBI representation
Authors: Jin-Seok Lee, Byeongchang Kim, Gary Geunbae Lee
Venue: ACM Transactions on Asian Language Information Processing (TALIP) (2002)

In this article we present a prosody generation architecture based on K-ToBI (Korean Tone and Break Index) representation. ToBI is a multitier representation system based on linguistic knowledge that transcribes events in an utterance. The TTS (Text-To-Speech) system, which adopts ToBI as an intermediate representation, is known to exhibit higher flexibility, modularity, and domain/task portability compared to the direct prosody generation TTS systems. However, for practical-level performance, the cost of corpus preparation is very expensive because the ToBI labeled corpus is constructed manually by many prosody experts, and normally requires large amounts of data for statistical prosody modeling. Unlike previous ToBI-based systems, this article proposes a new method, which transcribes the K-ToBI labels in Korean speech completely automatically. We develop automatic corpus-based K-ToBI labeling tools and prediction methods based on several lexico-syntactic linguistic features for decision-tree induction. We demonstrate the performance of F0 generation from automatically predicted K-ToBI labels, and confirm that the performance is reasonably comparable to state-of-the-art direct prosody generation methods and previous ToBI-based methods.
Providing internship and laboratory experiences for students in computer network courses
Authors: Douglas Hawley, Jon Rickman
Venue: Journal of Computing Sciences in Colleges (2002)

Computing Services departments at Universities can be used for powerful student internship opportunities. These departments, however, are responsible for a stable and secure network. As part of a National Science Foundation grant, the presenters and their colleagues have developed a model for colleges and universities to utilize campus networks for internship opportunities where both Computing Services and the academic department benefit. Provided in this tutorial will be in depth coverage of the student activities in the on-campus internship and a description of the procedures used by Computing Services to provide and manage the networking activities for the student interns. Potential benefits will also be addressed.
Existence verification for singular and nonsmooth zeros of real nonlinear systems
Authors: Jianwei Dian, R. Baker Kearfott
Venue: Mathematics of Computation (2003)

Traditional computational fixed point theorems, such as the Kantorovich theorem (made rigorous with directed roundings), Krawczyk's method, or interval Newton methods use a computer's floating-point hardware computations to mathematically prove existence and uniqueness of a solution to a nonlinear system of equations within a given region of n-space. Such computations require the Jacobi matrix of the system to be nonsingular in a neighborhood of a solution. However, in previous work we showed how we could mathematically verify existence of singular solutions in a small region of complex n-space containing an approximate real solution. We verified existence of such singular solutions by verifying that the topological degree of a small region is nonzero; a nonzero topological degree implies existence of a solution in the interior of the region. Here, we show that, when the actual topological degree in complex space is odd and the rank defect of the Jacobi matrix is one, the topological degree of a small region containing the singular solution can be verified to be plus or minus one in real space. The algorithm for verification in real space is significantly simpler and more efficient. We demonstrate this efficiency with numerical experiments.Since our verification procedure uses only values on the surfaces of a bounding box that contains the solution, the method can also be applied to cases where the system is nonsmooth at the solution.
A language and character set determination method based on N-gram statistics
Authors: Izumi Suzuki, Yoshiki Mikami, Ario Ohsato, Yoshihide Chubachi
Venue: ACM Transactions on Asian Language Information Processing (TALIP) (2002)

An N-gram-based language, script, and encoding scheme-detection method is introduced in this article. The method detects language, script, and encoding schemes using a target text document encoded by computer by checking how many byte sequences of the target match the byte sequences that can appear in the texts belonging to a language, script, and encoding scheme. This detection mechanism is different from conventional N-gram-based methods in that its threshold for any category is uniquely predetermined. The method was originally created for a survey of web pages conducted to find how many web pages are written in a particular language, script, and encoding scheme. The requirement is that the method must be able to respond to either "correct answer" or "unable to detect" where "unable to detect" includes "other than registered." There are some minor problems with this method, but its effectiveness as a language, script, and encoding scheme-detection method has been confirmed by experiments.
Active harmony: towards automated performance tuning
Authors: Cristian Ţăpuş, I-Hsin Chung, Jeffrey K. Hollingsworth
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

In this paper, we present the Active Harmony automated runtime tuning system. We describe the interface used by programs to make applications tunable. We present the Library Specification Layer which helps program library developers expose multiple variations of the same API using different algorithms. The Library Specification Language helps to select the most appropriate program library to tune the overall performance. We also present the optimization algorithm used to adjust parameters in the application and the libraries. Finally, we present results that show how the system is able to tune several real applications. The automated tuning system is able to tune the application parameters to within a few percent of the best value after evaluating only 11 out of over 1,700 possible configurations.
Uniform hyperbolic polynomial B-spline curves
Authors: Yonggang Lü, Guozhao Wang, Xunnian Yang
Venue: Computer Aided Geometric Design (2002)

This paper presents a new kind of uniform splines, called hyperbolic polynomial B-splines, generated over the space Ω = span{sinht, cosht, tk-3, tk-4 ...,t, 1} in which k is an arbitrary integer larger than or equal to 3. Hyperbolic polynomial B-splines share most of the properties as those of the B-splines in the polynomial space. We give the subdivision formulae for this new kind of curves and then prove that they have the variation dimishing properties and the control polygons of the subdivisions converge. Hyperbolic polynomial B-splines can take care of freeform curves as well as some remarkable curves such as the hyperbola and the catenary. The generation of tensor product surfaces by these new splines is straightforward. Examples of such tensor product surfaces: the saddle surface, the catenary cylinder, and a certain kind of ruled surface are given in this paper.
A personalized information dissemination system based on How-Net
Authors: Lei Zhang, Xiaoyong Du, Shan Wang
Venue: Journal of Computer Science and Technology (2002)

The information dissemination model is becoming increasingly important in wide-area information systems. In this model, a user subscribes to an information dissemination service by submitting profiles that describe his interests. There have been several simple kinds of information dissemination services on the Internet such as mailing list, but the problem is that it provides a crude granularity of interest matching. A user whose information need does not exactly match certain lists will either receive too many irrelevant or too few relevent messages. This paper presents a personalized Information dissemination model based on How-Net, which uses a Concept Network-views(CN-V), model to support information filtering, user's interests, modeling and information recommendation. A Concept Network is constructed upon the user's profiles and the content of documents, which describes concepts and their relations in the content and assigns different weights to these concepts. Usually the Concept Network is not well arranged, from which it is hard to find some useful relations, so several views from are extracted it to represent the important relations explicitly.
Probabilistic approaches to topic detection and tracking
Authors: Tim Leek, Richard Schwartz, Srinivasa Sista
Venue: Topic detection and tracking: event-based information organization (2002)

BBN's systems for TDT use probabilistic models for higher accuracy and easy training. They generate measures that are normalized across topics, so that only one threshold is necessary to make decisions. These systems make little or no use of deep linguistic knowledge, and therefore are easy to modify for new languages and domains. At the same time their performance has consistently been in the top tier.
Leveraging the Global Information Revolution for Economic Development: Singapore's Evolving Information Industry Strategy
Authors: Preyas Desai, Devavrat Purohit, Wolfgang Stadje, Poh-Kam Wong
Venue: Information Systems Research (1998)

Despite her small size and late industrialization, Singapore has managed to capture a significant share of the global information industry over the last three decades. This paper analyzed the structure and growth dynamics of Singapore's information industries using an analytical framework that integrates the four key components of an information economy: ICT goods industry, content industry, network infrastructure, and informatization. The paper identifies four generic stages in the development path of Singapore's information economy and highlights policy implications for other small, open economies.
A modified augmented Lagrangian method for a class of constrained problems
Authors: M. H. B. M. Shariff, J. R. Dormand
Venue: Journal of Computational and Applied Mathematics (2003)

A modified augmented Lagrangian method for a class of constrained problems is presented. The class of constraints discussed in this paper are linear equality constraints which, depending on a value of a parameter, are "exactly" or "nearly" satisfied. The proposed iterative method for indefinite systems is suitable for large scale problems, parallel processing and distributed computing. The class of problems is defined and convergent analyses of the method are discussed. A numerical test is done to justify the proposed method.
Scheduling UET grids with unit communication time delays into unbounded/fixed number of processors
Authors: P. Tsanakas, T. Andronikos, N. Koziris, G. Papakonstantinou
Venue: Highly parallel computaions: algorithms and applications (2001)

The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. Many scientific algorithms, especially nested loops, which require nearest-neighbor communication in a lattice space, are modeled by a task graph or iteration space with the properties of a grid. We consider the nested loop model with unit dependencies thus having an iteration space with the form of a n-dimensional grid. The exact model is that of generalized grids with diagonal edges, allowing unequal boundaries for each dimension. We survey the optimal time scheduling techniques for UET-UCT (unit execution time - unit communication time) grid topologies, using unbounded and bounded number of processors, without allowing task duplication. UET-UCT scheduling of generalized n-dimensional grids is low complexity tractable.
Predictability: definition, ananlysis and optimization
Authors: Ankur Srivastava, Majid Sarrafzadeh
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

Predictability is the quantified from of accuracy. We propose a predictability driven design methodology. The novelty lies in defining and using the idea of predictability. In order to illustrate the basic concepts we focus on the low power binding problem. The binding problem for low power was solved in [3], [5], but in the presence of in-accuracies, their claims of optimality are imprecise. Our experiments show that these inaccuracies could be as high as 33%. Our methodology could improve this unpredictability to as low as 11% with minimal power penalty (7% on average).
Performance optimizations and bounds for sparse matrix-vector multiply
Authors: Richard Vuduc, James W. Demmel, Katherine A. Yelick, Shoaib Kamil, Rajesh Nishtala, Benjamin Lee
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

We consider performance tuning, by code and data structure reorganization, of sparse matrix-vector multiply (SpM &times; V), one of the most important computational kernels in scientific applications. This paper addresses the fundamental questions of what limits exist on such performance tuning, and how closely tuned code approaches these limits.Specifically, we develop upper and lower bounds on the performance (Mflop/s) of SpM &times; V when tuned using our previously proposed register blocking optimization. These bounds are based on the non-zero pattern in the matrix and the cost of basic memory operations, such as cache hits and misses. We evaluate our tuned implementations with respect to these bounds using hardware counter data on 4 different platforms and on a test set of 44 sparse matrices. We find that we can often get within 20% of the upper bound, particularly on a class of matrices from finite element modeling (FEM) problems; on non-FEM matrices, performance improvements of 2&times; are still possible. Lastly, we present a new heuristic that selects optimal or near-optimal register block sizes (the key tuning parameters) more accurately than our previous heuristic. Using the new heuristic, we show improvements in SpM &times; V performance (Mflop/s) by as much as 2.5&times; over an untuned implementation.Collectively, our results suggest that future performance improvements, beyond those that we have already demonstrated for SpM &times; V, will come from two sources: (1) consideration of higher-level matrix structures (e.g., exploiting symmetry, matrix reordering, multiple register block sizes), and (2) optimizing kernels with more opportunity for data reuse (e.g., sparse matrix-multiple vector multiply, multiplication of ATA by a vector).
On the Order Fill Rate in a Multi-Item, Base-Stock Inventory System
Authors: N. V. R. Mahadev, Aleksandar Pekec, Fred S. Roberts, Jing-Sheng Song
Venue: Operations Research (1998)

A customer order to a multi-item inventory system typically consists of several different items in different amounts. The probability of satisfying an arbitrary demand within a prespecified time window, termed the order fill rate, is an important measure of customer satisfaction in industry. This measure, however, has received little attention in the inventory literature, partly because its evaluation is considered a hard problem. In this paper, we study this performance measure for a base-stock system in which the demand process forms a multivariate compound Poisson process and the replenishment leadtimes are constant. We show that the order fill rate can be computed through a series of convolutions of one-dimensional compound Poisson distributions and the batch-size distributions. This procedure makes the exact calculation faster and much more tractable. We also develop simpler bounds to estimate the order fill rate. These bounds require only partial order-based information or merely the item-based information. Finally, we investigate the impact of the standard independent demand assumption when the demand is actually correlated across items.
Programs, not code
Authors: Steven J. Beaty
Venue: Journal of Computing Sciences in Colleges (2001)

Students too often write code instead of programs. There are fundamental differences between the two. This paper suggests programming should be encouraged and gives an approach to doing so.
A comparative analysis of neural network performances in astronomical imaging
Authors: Rossella Cancelliere, Mario Gai
Venue: Applied Numerical Mathematics (2003)

Neural networks are widely used as recognisers and classifiers since the second half of the 80's; this is related to their capability of solving a nonlinear approximation problem. A neural network achieves this result by training; this iterative procedure has very useful features like parallelism, robustness and easy implementation.The choice of the best neural network is often problem dependent; in literature, the most used are the radial and sigmoidal networks. In this paper we compare performances and properties of both when applied to a problem of aberration detection in astronomical imaging.Images are encoded using an innovative technique that associates each of them with its most convenient moments, evaluated along the {x, y} axes; in this way we obtain a parsimonious but effective method with respect to the usual pixel by pixel description.
Augmenting a retail environment using steerable interactive displays
Authors: Noi Sukaviriya, Mark Podlaseck, Rick Kjeldsen, Anthony Levas, Gopal Pingali, Claudio Pinhanez
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

This paper describes a prototype retail environment in which information interactions occur in situ, within the actual space of the merchandise. By combining a steerable projected display and recognition of user gestures and actions, and user position tracking through peripheral cameras, we have developed several innovative interaction techniques designed to augment the reality of a retail store.
Numerical document queries
Authors: Helmut Seidl, Thomas Schwentick, Anca Muscholl
Venue: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2003)

A query against a database behind a site like Napster may search, e.g., for all users who have downloaded more jazz titles than pop music titles. In order to express such queries, we extend classical monadic second-order logic by Presburger predicates which pose numerical restrictions on the children (content) of an element node and provide a precise automata-theoretic characterization. While the existential fragment of the resulting logic is decidable, it turns out that satisfiability of the full logic is undecidable. Decidable satisfiability and a querying algorithm even with linear data complexity can be obtained if numerical constraints are only applied to those contents of elements where ordering is irrelevant. Finally, it is sketched how these techniques can be extended also to answer questions like, e.g., whether the total price of the jazz music downloaded so far exceeds a user's budget.
Modeling medical prognosis: survival analysis techniques
Authors: Lucila Ohno-Machado
Venue: Computers and Biomedical Research (2001)

Medical prognosis has played an increasing role in health care. Reliable prognostic models that are based on survival analysis techniques have been recently applied to a variety of domains, with varying degrees of success. In this article, we review some methods commonly used to model time-oriented data, such as Kaplan-Meier curves, Cox proportional hazards, and logistic regression, and discuss their applications in medical prognosis. Nonlinear, nonparametric models such as neural networks have increasingly been used for building prognostic models. We review their use in several medical domains and discuss different implementation strategies. Advantages and disadvantages of these methods are outlined, as well as pointers to pertinent literature.
Ideal models for pointwise relational and state-free imperative programming
Authors: David A. Naumann
Venue: Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming (2001)

Point-freerelation calculus and its categorical generalizations have been fruitful in development of calculi of functional programming, especially for general principles, e.g., polytypic patterns of recursion on inductive data. But in specific applications, pointwise formulations can be more convenient and comprehensible than point-free combinators. A typed lambda calculus including non-injective pattern-matching was given by de Moor and Gibbons, but their relational semantics has shortcomings. We give an alternative based on a categorical axiomatization of ideal relations. We give a second semantics based on predicate transformers, and show how the pattern construct offers a new integration of imperative and functional programming. Simulation results justify the semantics.
Algorithmic procedure for finding semantically related journals
Authors: Alexander I. Pudovkin, Eugene Garfield
Venue: Journal of the American Society for Information Science and Technology (2002)

Using citations, papers and references as parameters a relatedness factor (RF) is computed for a series of journals. Sorting these journals by the RF produces a list of journals most closely related to a specified starting journal. The method appears to select a set of journals that are semantically most similar to the target journal. The algorithmic procedure is illustrated for the journal Genetics. Inter-journal citation data needed to calculate the RF were obtained from the 1996 ISI Journal Citation Reports on CD-ROM©. Out of the thousands of candidate journals in JCR©, 30 have been selected. Some of them are different from the journals in the JCR category for genetics and heredity. The new procedure is unique in that it takes varying journal sizes into account.