ppxscal/embedding_network huggingface dataset:
Qos-based multicast routing for real-time communications
Authors: Hasan Ural
Venue:  (2003)

This thesis studies the distributed multicast routing algorithms that provide quality of service (QoS) guarantees in networks. It focuses on the delay constrained minimum cost tree (or constrained Steiner tree) problem; that is, it constructs a multicast tree that not only meets the constrained end-to-end delay requirements but also is the minimum cost multicast tree. This problem is known to be NP-complete. The existing distributed multicast routing algorithms that are based on heuristics do not consider a network environment where node failures occur. As a result, these algorithms will fail to complete the construction of a multicast tree when node failures occur during the construction period. Moreover, they will fail to maintain the constructed multicast tree if node failures occur after the construction period and during the on-going multicast session. In both cases, these algorithms will have to be restarted. We propose two new distributed delay constrained multicast routing algorithms that provide QoS guarantees even in networks where node failures occur. One is shortest path (SP) based and the other is minimum spanning tree (MST) based. They are capable of constructing a delay constrained multicast tree when node failures occur during the tree construction period and recovering from any node failure in a multicast tree during the on-going multicast session without interrupting the running traffic on the unaffected portion of the tree. The proposed SP-based or MST-based algorithms perform the failure recovery efficiently, which give better performance in terms of the number of exchanged messages and the convergence time than the existing distributed SP-based or MST-based delay constrained multicast routing algorithms in a network where node failures occur, respectively. The existing distributed delay constrained multicast routing algorithms can be classified either as an MST-based heuristic or as a SP-based heuristic. Two representative algorithms i.e., DKPP and DSPH are MST and SP based heuristics, respectively. The MST based algorithms like DKPP run with a high message and time complexity of O(n3). (Abstract shortened by UMI.)
Optimization of a Data Dependence Graph for the Local Microcode Compaction Problem. Part 1: Problem Statement
Authors: O. N. Malykh, Yu. S. Shakhnovskii
Venue: Programming and Computing Software (2004)

A traditional approach to solving the problem of local compaction of a horizontal microcode is described. In accordance with this approach any linear segment of the source microcode is made to correspond to a unique data dependence graph. A notion of the data exchange between the microoperations is introduced. Based on this notion, a model is developed that demonstrates that a given linear segment is, generally, associated with a set of semantically equivalent data dependence graphs, which differ from one another by the order of the execution of the exchanges on shared static resources. An optimization combinatorial problem on the permutation of the exchanges of a linear segment is formulated. Conditions for the existence of an admissible solution are studied, and a method for finding it is developed. A new space of solutions for the local compaction problem is obtained through the use of a new data dependence graph, which is, in a sense, better than the original one.
Virtual Trackballs Revisited
Authors: Knud Henriksen, Jon Sporring, Kasper Hornbæk
Venue: IEEE Transactions on Visualization and Computer Graphics (2004)

Abstract--Rotation of three-dimensional objects by a two-dimensional mouse is a typical task in computer-aided design, operation simulations, and desktop virtual reality. The most commonly used rotation technique is a virtual trackball surrounding the object and operated by the mouse pointer. This article reviews and provides a mathematical foundation for virtual trackballs. The first, but still popular, virtual trackball was described by Chen et al. [CHECK END OF SENTENCE]. We show that the virtual trackball by Chen et al. does not rotate the object along the intended great circular arc on the virtual trackball and we give a correction. Another popular virtual trackball is Shoemake's quaternion implementation [CHECK END OF SENTENCE], which we show to be a special case of the virtual trackball by Chen et al.. Shoemake extends the scope of the virtual trackball to the full screen. Unfortunately, Shoemake's virtual trackball is inhomogeneous and discontinuous with consequences for usability. Finally, we review Bell's virtual trackball [CHECK END OF SENTENCE] and discuss studies of the usability of virtual trackballs.
Product location, allocation and server home base location for an order picking line with multiple servers
Authors: Elizabeth Jewkes, Chulung Lee, Ray Vickson
Venue: Computers and Operations Research (2004)

In this paper, we are interested in several interrelated control issues for a 'pick to order' (or, 'strict' order picking) picking line which stores N = nk types of products in n bins, each with k shelves. To fill each order, a container is transported past the various locations containing products, and the appropriate quantity of each product is removed from its respective storage location and put into the order container using an 'out and back' picking strategy. Each of several pickers is assigned a set or 'zone' of products. We are interested in the concurrent problems of: (1) product location, (2) picker home base location, and (3) allocating products to each picker so that the expected order cycle time is minimized. We provide easily implemented algorithms to solve these problems and are able to show that the results apply for several alternate picking strategies. For fixed product locations, we develop an efficient dynamic programming algorithm which determines the optimal product allocation and server locations.
A model of dopamine modulated cortical activation
Authors: F. Gregory Ashby, Michael B. Casale
Venue: Neural Networks (2003)

Standard techniques from pharmacology and current theories on the biochemistry of dopamine (DA) are used to derive a new model of how DA modulates cortical activation. The model assumes that DA potentiates the glutamate response through the NMDA receptor and depresses the glutamate response through non-NMDA receptors. A static version of the model is used to examine the neurobiological plausibility of the Servan-Schreiber, Printz, and Cohen model [Science 249 (1990) 892]. A dynamic version can be used to model many behaviors that are outside the domain of the static [Science 249 (1990) 892] model, including single-cell recording data. As a preliminary test of the model, we show that it can account for some single-cell recording data that examined the effects of DA on the firing rate of glutamatergic cortical cells.
Make to Order or Make to Stock: Model and Application
Authors: S. Rajagopalan
Venue: Management Science (2002)

Some firms make all their products to order while others make them to stock. There are a number of firms that maintain a middle ground, where some items are made to stock and others are made to order. This paper was motivated by a consumer product company faced with the decision about which items to make to stock and which ones to make to order, and the inventory and production policy for the make-to-stock items. The production environment is characterized by multiple items, setup times between the production of consecutive items, limited capacity, and congestion effects. In such an environment, making an item to order reduces inventory costs for that item, but might increase the lot size and inventory costs for the items made to stock. Also, lead times increase because of congestion effects, resulting in higher safety stocks for make-to-stock items and lower service levels for make-to-order items, thus leading to a complex trade-off. We develop a nonlinear, integer programming formulation of the problem. We present an efficient heuristic to solve the problem, which was motivated by key results for a special case of the problem without congestion effects that can be solved optimally. We also develop a lower bound to evaluate the performance of the heuristic. A computational study indicates that the heuristic performs well. We discuss the application of the model in a large firm and the resulting insights. We also provide insights into the impact of various problem parameters on the make-to-order versus make-to-stock decisions using a computational study. In particular, we find that the average number of setups of an item selected for make-to-stock production is always less than half the average number of setups of the item if it were to be made to order. Also, factors other than an item's demand, such as its setup time, processing time, and unit holding cost, impact the make-to-order versus make-to-stock decision.
Efficient and effective exploratory mining of constrained frequent sets
Authors: Raymond T. Ng
Venue:  (2003)

Data mining refers to the search for implicit, previously unknown, and potentially useful relationships or patterns (such as frequent sets) that might be embedded in data. Most of the existing data mining algorithms do not allow users to express the patterns to be mined according to their intentions, via the use of constraints. Consequently, these unconstrained mining algorithms can yield numerous patterns that are not interesting to users. Moreover, data mining is supposed to be a human-centered and exploratory process, not a one-shot exercise. In this context, we are working on a project with the overall objective of developing a practical human-centered computing environment for the efficient and effective exploratory mining of constrained frequent sets. One critical component of such an environment is the support for the dynamic mining of constrained frequent sets. Constraints enable users to impose a certain focus on the mining process. The term &ldquo; dynamic&rdquo; means that, in the middle of the computation, users are able to (i) change (such as tighten or relax) the constraints, and/or (ii) change the support threshold. This permits users to have a decisive influence on subsequent computations. In real-life situations, the available buffer space may be quite limited, thus adding another complication to the problem. In this thesis, we develop an algorithm, called DCF, for Dynamic Constrained Frequent-set computation. This algorithm is enhanced with a few optimizations, exploiting a light-weight structure called a segment support map. Such a structure enables DCF to (i) obtain sharper bounds on the support of patterns (or frequent sets of items), and (ii) better exploit properties of constraints. Furthermore, when handling dynamic changes to constraints, DCF relies on the concept of a delta member generating function, which exploits a special class of constraints&mdash;namely, succinct constraints&mdash;to generate precisely the sets of items that satisfy the new but not the old constraints. Our experimental results show the effectiveness of these enhancements. Lastly, to show that the exploitation of succinct constraints is not confined to DCF, we develop another algorithm that also supports the dynamic mining of constrained frequent sets, albeit in a tree-based framework.
Affine Planes and Flag Linear Spaces
Authors: S. Rajola, M. Scafati Tallini
Venue: Designs, Codes and Cryptography (2004)

This paper deals with the construction of the flag linear space determined by any affine plane.
The Sun Never Sits on Distributed Development
Authors: Ken Coar
Venue: Queue (2003)

More and more software development is being distributed across greater and greater distances. The motives are varied, but one of the most predominant is the effort to keep costs down. As talent is where you find it, why not use it where you find it, rather than spending the money to relocate it to some ostensibly more “central” location? The increasing ubiquity of the Internet is making far-flung talent ever-more accessible.
A Novel Reordering Write Buffer to Improve Write Performance of Log-Structured File Systems
Authors: Jun Wang, Yiming Hu
Venue: IEEE Transactions on Computers (2003)

Abstract--This paper presents a novel reordering write buffer which improves the performance of Log-structured File Systems (LFS). While LFS has a good write performance, high garbage-collection overhead degrades its performance under high disk space utilization. Previous research concentrated on how to improve the efficiency of the garbage collector after data is written to disk. We propose a new method that reduces the amount of work the garbage collector would do before data reaches disk. By classifying active and inactive data in memory into different segment buffers and then writing them to different disk segments, we force the disk segments to form a bimodal distribution. Most data blocks in active segments are quickly invalidated, while inactive segments remain mostly intact. Simulation results based on a wide range of both real-world and synthetic traces show that our method significantly reduces the garbage collection overhead, slashing the overall write cost of LFS by up to 53 percent, improving the write performance of LFS by up to 26 percent, and the overall system performance by up to 21 percent.
Bayesian computation in recurrent neural circuits
Authors: Rajesh P. N. Rao
Venue: Neural Computation (2004)

A large number of human psychophysical results have been successfully explained in recent years using Bayesian models. However, the neural implementation of such models remains largely unclear. In this article, we show that a network architecture commonly used to model the cerebral cortex can implement Bayesian inference for an arbitrary hidden Markov model. We illustrate the approach using an orientation discrimination task and a visual motion detection task. In the case of orientation discrimination, we show that the model network can infer the posterior distribution over orientations and correctly estimate stimulus orientation in the presence of significant noise. In the case of motion detection, we show that the resulting model network exhibits direction selectivity and correctly computes the posterior probabilities over motion direction and position. When used to solve the well-known random dots motion discrimination task, the model generates responses that mimic the activities of evidence-accumulating neurons in cortical areas LIP and FEF. The framework we introduce posits a new interpretation of cortical activities in terms of log posterior probabilities of stimuli occurring in the natural world.
Using LOGO in teaching
Authors: Richard Rubinstein
Venue: ACM SIGCUE Outlook (1975)

Teachers faced with selecting or creating introductory computing materials often must choose among several computer languages. LOGO was selected for use in the author's courses at the University of California, Irvine. This paper describes these courses in terms of the demands placed on the computing language used, and the ideas to which the students were exposed. Those characteristics of LOGO which are most important to the success of the courses are evaluated.
Semantic Log Analysis Based on a User Query Behavior Model
Authors: Kawamae Noriaki, Mukaigaito Takeya, Hanaki Miyoshi
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

We propose a novel log analysis method to capture thesemantic relations among words appearing in Web searchlogs. Our method focuses on the reciprocal relations amonga user's intentions, stages of information need, and querybehavior in seeking information via a search engine. Theapproach works because it is based on the assumption that auser's intentions in each query can be derived as a model onthe basis of his stage of information need and query behavior,through multiple empirical observations of search logs.The user's intentions drive user to change the words in eachsuccessive queries and can thus be used to clarify the semanticrelations among words. As a result, this method hasthe advantage of capturing the semantic relations amongwords without requiring either manual or natural languageprocessing. Our experimental results indicate that semanticrelations could successfully be derived from search logs,confirming that an ontology and thesaurus could be constructedautomatically.
AES and the cryptonite crypto processor
Authors: Dino Oliva, Rainer Buchty, Nevin Heintze
Venue: Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems (2003)

CRYPTONITE is a programmable processor tailored to the needs of crypto algorithms. The design of CRYPTONITE was based on an in-depth application analysis in which standard crypto algorithms (AES, DES, MD5, SHA-1, etc) were distilled down to their core functionality. We describe this methodology and use AES as a central example. Starting with a functional description of AES, we give a high level account of how to implement AES efficiently in hardware, and present several novel optimizations (which are independent of CRYPTONITE).We then describe the CRYPTONITE architecture, highlighting how AES implementation issues influenced the design of the processor and its instruction set. CRYPTONITE is designed to run at high clock rates and be easy to implement in silicon while providing a significantly better performance/area/power tradeoff than general purpose processors.
Modeling, Simulation, and Visualization: The Pentagon on September 11th
Authors: Chris Hoffmann, Voicu Popescu, Sami Kilic, Mete Sozen
Venue: Computing in Science and Engineering (2004)

Researchers used a custom importer to simplify and load simulation data from the September 11th Pentagon attack into a commercial animation system. The resulting high-quality impact visualization combines state-of-the-art graphics with state-of-the-art engineering simulation.
Challenges in graph-based relational data visualization
Authors: Emanuel G. Noik
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

During recent years we have witnessed a growing trend toward the use of visual interfaces to view and query databases. The graph topovisual formalism is particularly well-suited for depicting relational data. The vertices of a directed graph represent a set of entities, while arcs represent relationships among the entities. This paper studies the functional requirements of a hypothetical graph visualization facility (GVF) by surveying past work in related areas and by describing challenging problems that must be addressed before such a system can be realized. Our contribution, therefore, is twofold: we present a unique holistic approach, which, in turn, gives rise to a number of interesting research problems.
A BSU-Based Sports Video Content Analysis Framework for Content-Based Streams Filtering
Authors: Jianyun Chen, Yunhao Li, Songyang Lao, Lingda Wu
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

The flowing of a good deal of sports video, the widespread application of Internet and the rapid increase of the users' requirements on demand make content-based sports video streams filtering important and urgent. Sports video content analysis module is the base of the content-based video streams filtering system. In this paper, we propose a novel and general sports video content analysis framework for content-based sports video streams filtering. he framework is based on Basic Semantic Unit (BSU) that is specially presented for sports video in this paper. And we demonstrate the application of this framework on Soccer Video. Our preliminary experimental studies indicate that the proposed framework is satisfactory and promising.
Notes on Sum-Free and Related Sets
Authors: Peter J. Cameron, Paul Erdös
Venue: Combinatorics, Probability and Computing (1999)

Our main topic is the number of subsets of [1, n] which are maximal with respect to some condition such as being sum-free, having no number dividing another, etc. We also investigate some related questions.
Photo2Video
Authors: Xian-Sheng HUA, Lie LU, Hong-Jiang ZHANG
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

To exploit rich content embedded in a single photograph, a system named Photo2Video was developed to automatically convert a photographic series into a video by simulating camera motions, set to incidental music of the user's choice. For a chosen photographic series, an appropriate camera motion pattern is selected for each photograph to generate a corresponding motion photograph clip. Then, the final output video is rendered by connecting a series of motion photograph clips with specific transitions, and aligning with the selected incidental music. Photo2Video provides a novel way to browse a series of images and can be regarded as a system exploring the new medium between photograph and video.
Computing the Betti numbers of arrangements via spectral sequences
Authors: Saugata Basu
Venue: Journal of Computer and System Sciences (2003)

In this paper, we consider the problem of computing the Betti numbers of an arrangement of n compact semi-algebraic sets, S1,...,Sn ⊂ Rk, where each Si is described using a constant number of polynomials with degrees bounded by a constant. Such arrangements are ubiquitous in computational geometry. We give an algorithm for computing lth Betti number, β(∪i=1n Si), 0 ≤ ℓ ≤ k - 1 using O(nℓ+2) algebraic operations. Additionally, one has to perform linear algebra on integer matrices of size bounded by O(nℓ+2). All previous algorithms for computing the Betti numbers of arrangements, triangulated the whole arrangement giving rise to a complex of size O(n2k) in the worst case. Thus, the complexity of computing the Betti numbers (other than the zeroth one) for these algorithms was O(n2k). To our knowledge this is the first algorithm for computing βℓ(∪i=1n Si) that does not rely on such a global triangulation, and has a graded complexity which depends on ℓ.
Review fo "The logical approach to syntax: foundations, specifications, and implementations of theories of government and binding" by Edward P. Stabler. The MIT Press 1992.
Venue: Computational Linguistics (1994)

The title The Logical Approach to Syntax: Foundations, Specifications, and Implementations of Theories of Government and Binding describes Stabler's book very well. In it, Stabler introduces techniques and results pertaining to formal logic, develops logical representations of particular instantiations of Government-Binding Theory (GB), and explores the consequences of the theory within a deductive framework. Beyond specific results found in the book, Stabler shows how logical implications of alternative conceptions of linguistic principles can be rigorously investigated. The logical representations are, in effect, specifications for the implementation of language processing models.