ppxscal/embedding_network huggingface dataset:
An extension of CGAL to the oriented projective plane T2 and its dynamic visualization system
Authors: A. G. Oliveira, P. J. de Rezende, F. P. Selmi-Dei
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

The oriented projective plane T2 is an extension of the Euclidean plane E2 and comprises a number of advantages for algorithm design and implementation. We have extended the Computational Geometry Algorithms Library (CGAL) to allow for the implementation of geometric primitives and algorithms. The present video illustrates both the extension of a few algorithms to T2 under CGAL and a dynamic visualization system (T2 Viewer)built specially for displaying the spherical and planar models of T2.
Protein visualization and simulation in 3D
Authors: Nathan Burnell
Venue: Journal of Computing Sciences in Colleges (2005)

The function of a protein is primarily determined by its three-dimensional geometry, which is, in turn, determined by its one-dimensional amino acid sequence. It is not practical to replicate this process, called protein folding, with brute-force algorithms and today's computer technology. Instead, biological scientists and pharmacologists can utilize protein visualization software, which allows them to view and explore known protein structures in 3D on personal computers. In this way, researchers apply human intuition to the folding problem and can develop drugs that interact with proteins without directly solving the folding problem.
An Analysis of Relationship between Video Contents and Subjective Video Quality for Internet Broadcasting
Authors: Yuka Kato, Atsushi Honda, Katsuya Hakozaki
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

This paper analyzes relationship between video contents and subjective video quality for Internet broadcasting, and applies the results to the rate control methods. In this analysis, we classify video programs into some groups in which a large majority of usersfeel the same subjective video quality. We investigate the relationship by conducting an experiment with method of paired comparisons, and express that as equations by multiple linear regression analysis.
An optimal pre-determinization algorithm for weighted transducers
Authors: Cyril Allauzen, Mehryar Mohri
Venue: Theoretical Computer Science (2004)

We present a general algorithm, pre-determinization, that makes an arbitrary weighted transducer over the tropical semiring or an arbitrary unambiguous weighted transducer over a cancellative commutative semiring determinizable by inserting in it transitions labeled with special symbols. After determinization, the special symbols can be removed or replaced with ε-transitions. The resulting transducer can be significantly more efficient to use. We report empirical results showing that our algorithm leads to a substantial speed-up in large-vocabulary speech recognition. Our pre-determinization algorithm makes use of an efficient algorithm for testing a general twins property, a sufficient condition for the determinizability of all weighted transducers over the tropical semiring and unambiguous weighted transducers over cancellative commutative semirings. Based on the transitions marked by this test of the twins property, our pre-determinization algorithm inserts new transitions just when needed to guarantee that the resulting transducer has the twins property and thus is determinizable. It also uses a single-source shortest-paths algorithm over the min-max semiring for carefully selecting the positions for insertion of new transitions to benefit from the subsequent application of determinization. These positions are proved to be optimal in a sense that we describe.
Re-ranking algorithm using post-retrieval clustering for content-based image retrieval
Authors: Gunhan Park, Yunju Baek, Heung-Kyu Lee
Venue: Information Processing and Management: an International Journal (2005)

In this paper, we propose a re-ranking algorithm using post-retrieval clustering for content-based image retrieval (CBIR). In conventional CBIR systems, it is often observed that images visually dissimilar to a query image are ranked high in retrieval results. To remedy this problem, we utilize the similarity relationship of the retrieved results via post-retrieval clustering. In the first step of our method, images are retrieved using visual features such as color histogram. Next, the retrieved images are analyzed using hierarchical agglomerative clustering methods (HACM) and the rank of the results is adjusted according to the distance of a cluster from a query. In addition, we analyze the effects of clustering methods, querycluster similarity functions, and weighting factors in the proposed method. We conducted a number of experiments using several clustering methods and cluster parameters. Experimental results show that the proposed method achieves an improvement of retrieval effectiveness of over 10% on average in the average normalized modified retrieval rank (ANMRR) measure.
Further Study on Augmented Lagrangian Duality Theory
Authors: X. X. Huang, X. Q. Yang
Venue: Journal of Global Optimization (2005)

In this paper, we present a necessary and sufficient condition for a zero duality gap between a primal optimization problem and its generalized augmented Lagrangian dual problems. The condition is mainly expressed in the form of the lower semicontinuity of a perturbation function at the origin. For a constrained optimization problem, a general equivalence is established for zero duality gap properties defined by a general nonlinear Lagrangian dual problem and a generalized augmented Lagrangian dual problem, respectively. For a constrained optimization problem with both equality and inequality constraints, we prove that first-order and second-order necessary optimality conditions of the augmented Lagrangian problems with a convex quadratic augmenting function converge to that of the original constrained program. For a mathematical program with only equality constraints, we show that the second-order necessary conditions of general augmented Lagrangian problems with a convex augmenting function converge to that of the original constrained program.
Reconstruct versus read-modify writes in RAID
Authors: Alexander Thomasian
Venue: Information Processing Letters (2005)

RAID5 (Redundant Arrays of Independent Disk level 5) is a popular paradigm, which uses parity to protect against single disk failures. A major shortcoming of RAID5 is the small write penalty, i.e., the cost of updating parity when a data block is modified. Read-modify writes and reconstruct writes are alternative methods for updating small data and parity blocks. We use a queuing formulation to determine conditions under which one method outperforms the other. Our analysis shows that in the case of RAID6 and more generally disk arrays with k check disks tolerating k disk failures, RCW outperforms RMW for higher values of N and G. We note that clustered RAID and variable scope of parity protection methods favor reconstruct writes. A dynamic scheme to determine the more desirable policy based on the availability of appropriate cached blocks is proposed.
New NFS Tracing Tools and Techniques for System Analysis
Authors: Daniel Ellard, Margo Seltzer
Venue: Proceedings of the 17th USENIX conference on System administration (2003)

Passive NFS traces provide an easy and unobtrusive way to measure, analyze, and gain an understanding of an NFS workload. Historically, such traces have been used primarily by file system researchers in an attempt to understand, categorize, and generalize file system workloads. However, because such traces provide a wealth of detailed information about how a specific system is actually used, they should also be of interest to system administrators. We introduce a new open-source toolkit for passively gathering and summarizing NFS traces and show how to use this toolkit to perform analyses that are difficult or impossible with existing tools.
Modeling and Testing Comparison Faults for Ternary Content Addressable Memories
Authors: Jin-Fu Li, Chou-Kun Lin
Venue: Proceedings of the 23rd IEEE VLSI Test Symposium (2005)

This paper presents the comparison faults of TCAMs based on physical defects, such as shorts between two circuit nodes and transistor stuck-open and stuck-on faults. Accordingly, several comparison fault models are proposed. A March-like test algorithm for comparison faults is also proposed. The test algorithm only requires 4N Write operations, 3N Erase operations, and (4N+2B) Compare operations to cover 100% comparison faults for an N x B-bit TCAM.Compared with the previous work, the proposed test algorithm has lower time complexity for TCAMs with wide words and the time complexity is independent of the number of stuck-on faults.Also, the algorithm can cover all defects that cause a failed Compare operation.Moreover, it can be realized by built-in self-test circuitry with lower area cost.
Evaluating the impact of simultaneous multithreading on network servers using real hardware
Authors: Yaoping Ruan, Vivek S. Pai, Erich Nahum, John M. Tracey
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

This paper examines the performance of simultaneous multithreading (SMT) for network servers using actual hardware, multiple network server applications, and several workloads. Using three versions of the Intel Xeon processor with Hyper-Threading, we perform macroscopic analysis as well as microarchitectural measurements to understand the origins of the performance bottlenecks for SMT processors in these environments. The results of our evaluation suggest that the current SMT support in the Xeon is application and workload sensitive, and may not yield significant benefits for network servers.In general, we find that enabling SMT on real hardware usually produces only slight performance gains, and can sometimes lead to performance loss. In the uniprocessor case, previous studies appear to have neglected the OS overhead in switching from a uniprocessor kernel to an SMT-enabled kernel. The performance loss associated with such support is comparable to the gains provided by SMT. In the 2-way multiprocessor case, the higher number of memory references from SMT often causes the memory system to become the bottleneck, offsetting any processor utilization gains. This effect is compounded by the growing gap between processor speeds and memory latency. In trying to understand the large gains shown by simulation studies, we find that while the general trends for microarchitectural behavior agree with real hardware, differences in sizing assumptions and performance models yield much more optimistic benefits for SMT than we observe.
Paramax Systems Corporation: description of the Paramax system used for MUC-4
Authors: Carl Weir, Barry Silk
Venue: Proceedings of the 4th conference on Message understanding (1992)

This paper describes the Paramax MUC-4 data extraction system, a system with an analysis component implemented in CLIPS that provides a level of text understanding that falls somewhere between what is possible with conventional information retrieval techniques and deep linguistic analysis.
Minimized embedding of arbitrary hamiltonian graphs in fault-tolerant graph and reconfiguration at faults. II. Grids and k-fault-tolerance
Authors: M. F. Karavai
Venue: Automation and Remote Control (2005)

Optimal algorithms to construct 1-fault-tolerant structures were presented with examples of simple and diagonal grids and torus based on algorithm A2 discussed in the first part of the paper. The general procedure of constructing the k-fault-tolerant structures was presented first for a simple cycle and then for more involved grid graphs. Algorithms for reconfiguration after failure were described. For the 1-fault-tolerant structures, these algorithms are realized as a simple table of automorphisms of the fault-tolerant graph. For the case of k-fault-tolerance, correct reconfiguration requires symmetrization of the reduced graph after the ith failure by elimination of the redundant connections introduced to improve fault-tolerance from i - 1 to i when constructin the k-fault-tolerant system graph.
Modularizing design patterns with aspects: a quantitative study
Authors: Alessandro Garcia, Cláudio Sant'Anna, Eduardo Figueiredo, Uirá Kulesza, Carlos Lucena, Arndt von Staa
Venue: Proceedings of the 4th international conference on Aspect-oriented software development (2005)

Design patterns offer flexible solutions to common problems in software development. Recent studies have shown that several design patterns involve crosscutting concerns. Unfortunately, object-oriented (OO) abstractions are often not able to modularize those crosscutting concerns, which in turn decrease the system reusability and maintainability. Hence, it is important verifying whether aspect-oriented approaches support improved modularization of crosscutting concerns relative to design patterns. Ideally, quantitative studies should be performed to compare OO and aspect-oriented implementations of classical patterns with respect to important software engineering attributes, such as coupling and cohesion. This paper presents a quantitative study that compares aspect-based and OO solutions for the 23 Gang-of-Four patterns. We have used stringent software engineering attributes as the assessment criteria. We have found that most aspect-oriented solutions improve separation of pattern-related concerns, although only 4 aspect-oriented implementations have exhibited significant reuse.
Incentive-compatible, budget-balanced, yet highly efficient auctions for supply chain formation
Authors: Moshe Babaioff, William E. Walsh
Venue: Decision Support Systems (2005)

We address the mechanism design problem of supply chain formation--the problem of negotiation mechanisms to coordinate the buying and selling of goods in multiple markets across a supply chain. Because effective negotiation strategies can be difficult to design for supply chains, we focus on incentive-compatible (IC) auctions, in which the agents' dominant strategy is to simply report their private information truthfully. Unfortunately, with two-sided negotiation, characteristic of supply chains, it is impossible to simultaneously achieve perfect efficiency, budget balance, and individual rationality with incentive compatibility. To resolve this problem, we introduce auctions that explicitly discard profitable trades, thus giving up perfect efficiency to maintain budget balance, incentive compatibility, and individual rationality. We use a novel payment rule based on Vickrey--Clarke--Groves payments, but adapted to our allocation rule. The first auction we present is incentive compatible when each agent desires only a single bundle of goods; the auction correctly knows all agents' bundles of interest, but the monetary valuations are private to the agents. We introduce extensions to maintain incentive compatibility when the auction does not know the agents' bundles of interest. We establish a good worst case bound on efficiency when the bundles of interest are known, which also applies in some cases when the bundles are not known. Our auctions produce higher efficiency for a broader class of supply chains than any other incentive-compatible, individually rational (IR), and budget-balanced (BB) auction we are aware of.
Propositional & analogical generation of coordinated verbal, visual & musical texts: U. of Wisconsin
Authors: Sheldon Klein, David A. Ross Mark S. Manasse Johanna Danos Mark S. Bickford Kendall I. Jensen Walter A. Burt Glenn D. Blank
Venue: Issue 79 (January 1982) (1982)

We are developing a model for human cognitive processing which assumes that a major component of the rules for calculating behavior are resident outside the individual, in the inherited, collective phenomena that anthropologists call 'culture'. Our model contains rules of behavior encoded in propositional structures such as frames or scripts, plus a method for calculating behavior by analogy. Propositional rules are transformed into situation state descriptions that are related by transformation operators which are also valid for transforming situations by analogy, and for planning by analogy. This kind of operator has been named 'Appositional Transformation Operator' or ATO (1,2,3,4).
Singular $$\mathcal{H}$$2-optimization problems for discrete-time systems
Authors: K. Yu. Polyakov
Venue: Automation and Remote Control (2005)

Singular $$\mathcal{H}$$ 2-optimization problems are considered for the standard discrete-time control system. Two types of singularity (type I and type II) are distinguished. A detailed treatment of problems with singularity of type II, which leads to nonuniqueness of solution, is presented. New algorithms for design of optimal controllers are presented both in frequency domain and state space, which generalize standard procedures onto the case of singular $$\mathcal{H}$$ 2-problems. A parameterization of the set of optimal controllers is given.
An experimental study of multimedia traffic performance in mesh networks
Authors: Yuan Sun, Irfan Sheriff, Elizabeth M. Belding-Royer, Kevin C. Almeroth
Venue: Papers presented at the 2005 workshop on Wireless traffic measurements and modeling (2005)

Performance evaluation and analysis of wireless networks is essential because testbed experiments facilitate a better understanding of network and application characteristics. This understanding of performance, in turn, results in robust protocol design. In this paper, we present an experimental study of multimedia traffic performance in mesh networks. We evaluate the performance of video and voice traffic through multi-hop wireless paths and study the capacity of the mesh network. We also investigate the impact of different traffic and network characteristics on application performance. The impact of different wireless network interface card configurations is examined, followed by our suggestions for how to improve performance. We believe our study is beneficial for both wireless network capacity planning and robust protocol design for wireless applications and services. Other researchers can also draw upon our traffic measurement experience for their own mesh testbed experiments.
Visual expectations: a cognitive model of fuzzy decision making
Authors: Skyler Place
Venue: Journal of Computing Sciences in Colleges (2004)

The goal of our research is to create a computer model that follows the same decision making process as humans for a specific visual task. Human vision is a complex cognitive process that includes many top down and bottom up processes. Sensory information is altered and combined before it even reaches the brain. Decisions made solely on visual information can be controlled through how we believe we are perceiving information (verses what we are actually seeing). Furthermore, these decisions can be modeled to create a system that responds in the same manner as a human.
3D Cable-Based Cartesian Metrology System
Authors: Robert L. Williams,  II, James S. Albus, Roger V. Bostelman
Venue: Journal of Robotic Systems (2004)

A novel cable-based metrology system is presented wherein six cables are connected in parallel from ground-mounted string pots to the moving object or tool of interest. Cartesian pose can be determined for feedback control and other purposes by reading the lengths of the six cables via the string pots and using closed-form forward pose kinematics. This article focuses on a sculpting metrology tool, assisting a human artist in generating a piece from a computer model, but applications exist in manufacturing, rapid prototyping, robotics, and automated construction. We present experimental data to demonstrate the operation of our system, we study the absolute accuracy and also measurement resolution, and we discuss various error sources. The proposed real-time cable-based metrology system is less complex and more economical than existing commercial Cartesian metrology technologies. &copy; 2004 Wiley Periodicals, Inc.
3D Model-Assisted Face Recognition in Video
Authors: Unsang Park, Hong Chen, Anil K. Jain
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

Face recognition in video has gained wide attention as a covert method for surveillance to enhance security in a variety of application domains (e.g., airports). A video contains temporal information as well as multiple instances of a face, so it is expected to lead to better face recognition performance compared to still face images. However, faces appearing in a video have substantial variations in pose and lighting. These pose and lighting variations can be effectively modeled using 3D face models. Combining the advantages of 2D video and 3D face models, we propose a face recognition system that identifies faces in a video. Thesystem utilizes the rich information in a video and overcomes the pose and lighting variations using 3D face model. The description of the proposed method and preliminary results are provided.
A Second-Order Perceptron Algorithm
Authors: Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile
Venue: SIAM Journal on Computing (2005)

Kernel-based linear-threshold algorithms, such as support vector machines and Perceptron-like algorithms, are among the best available techniques for solving pattern classification problems. In this paper, we describe an extension of the classical Perceptron algorithm, called second-order Perceptron, and analyze its performance within the mistake bound model of on-line learning. The bound achieved by our algorithm depends on the sensitivity to second-order data information and is the best known mistake bound for (efficient) kernel-based linear-threshold classifiers to date. This mistake bound, which strictly generalizes the well-known Perceptron bound, is expressed in terms of the eigenvalues of the empirical data correlation matrix and depends on a parameter controlling the sensitivity of the algorithm to the distribution of these eigenvalues. Since the optimal setting of this parameter is not known a priori, we also analyze two variants of the second-order Perceptron algorithm: one that adaptively sets the value of the parameter in terms of the number of mistakes made so far, and one that is parameterless, based on pseudoinverses.
Partial stability and control: The state-of-the-art and development prospects
Authors: V. I. Vorotnikov
Venue: Automation and Remote Control (2005)

Problems in bordering fields associated with partial stability and stabilization of nonlinear dynamic systems, including partial stability and stabilization by part of coordinates of the phase vector, are reviewed. They are classified, and their relation with other stability and stabilization problems, including recent ones, are considered. Main development trends in theory and research methods are surveyed and certain results and applications are described. The partial control notion in border disciplines is examined. A long list of references is given.