ppxscal/embedding_network huggingface dataset:
Multiple View Geometry of General Algebraic Curves
Authors: J. Y. Kaminski, Amnon Shashua
Venue: International Journal of Computer Vision (2004)

We introduce a number of new results in the context of multi-view geometry from general algebraic curves. We start with the recovery of camera geometry from matching curves. We first show how one can compute, without any knowledge on the camera, the homography induced by a single planar curve. Then we continue with the derivation of the extended Kruppa's equations which are responsible for describing the epipolar constraint of two projections of a general algebraic curve. As part of the derivation of those constraints we address the issue of dimension analysis and as a result establish the minimal number of algebraic curves required for a solution of the epipolar geometry as a function of their degree and genus.We then establish new results on the reconstruction of general algebraic curves from multiple views. We address three different representations of curves: (i) the regular point representation in which we show that the reconstruction from two views of a curve of degree d admits two solutions, one of degree d and the other of degree d(d &minus; 1). Moreover using this representation, we address the problem of homography recovery for planar curves, (ii) dual space representation (tangents) for which we derive a lower bound for the number of views necessary for reconstruction as a function of the curve degree and genus, and (iii) a new representation (to computer vision) based on the set of lines meeting the curve which does not require any curve fitting in image space, for which we also derive lower bounds for the number of views necessary for reconstruction as a function of curve degree alone.
Optimal Finite State Universal Coding of Individual Sequences
Authors: Eado Meron, Meir Feder
Venue: Proceedings of the Conference on Data Compression (2004)

The problem of assigning a probability to the next outcome of an individual binary sequenceunder the constraint that the universal predictor has a finite number of states, is explored.Thetwo main loss functions that are considered are the square error loss and the self-information loss.Universal prediction w.r.t. the self-information loss can be combined with arithmetic encoding to construct a universal encoder, thus we essentially explore the universal coding problem.We analyze the performance of randomized time-invariant K-state universal predictors, and provideperformance bounds in terms of the number of states K for long enough sequences.In the casewhere the comparison class consists of constant predictors we provide, for the square error loss,tight bounds indicating that the optimal asymptotic expected redundancy is O (\frac{1}{k}).For the self-informationloss we show an upper bound on the coding redundancy of O (\frac{{\log K}}{K}) and a lowerbound ofO (\frac{1}{k}).
Some optimization problems on weak-bisplit graphs
Authors: Jean-Marie Vanherpe
Venue: Information Processing Letters (2003)

A new decomposition scheme for bipartite graphs namely canonical decomposition was introduced by Fouquet et al. [Internat. J. Found. Comput. Sci. 10 (1999) 513-533]. The so-called weak-bisplit graphs are totally decomposable following this decomposition. We present here some optimization problems for general bipartite graphs which have efficient solutions when dealing with weak-bisplit graphs.
A Short Guide to Predator--Prey Lattice Models
Authors: Andrzej Pekalski
Venue: Computing in Science and Engineering (2004)

The motivation for writing this mini review is that many approaches to predator-prey (PP) systems have been discovered, overlooked, and then rediscovered again years later. Briefly describing some of the papers that physicists have written about the subject over the last 20 years thus seems advisable. This review contains no detailed formulas, model descriptions, or techniques; rather, it presents the authors' assumptions, main results, and conclusions. Some unclear points still exist, despite the time elapsed from the first papers, so this review might inspire you to open research in new directions.
Understanding functional dependency
Authors: Robert A. Schultz
Venue: Effective databases for text & document management (2003)

In explaining functional dependency to students, I have noticed in texts a mixture of two types of elements: intensional (or psychological or meaning) and extensional (patterns of repetition in the data). In this chapter I examine whether it is possible to consider functional dependency, in particular, in second and third normal forms, solely on an extensional basis. The Microsoft Access Analyzer utility seems to do so. I illustrate the mix of intensional and extensional elements in textbook definitions of functional dependency. I conclude that although in principle first, second and third normal form can be done solely by extensional means, in practice intensional considerations are indispensable. Finally, I discuss these questions with respect to the "higher order" normal forms, namely Boyce-Codd, fourth, fifth and Domain/Key normal form.
Knowledge-Sharing Issues in Experimental Software Engineering
Authors: Forrest Shull, Manoel G. Mendoncça, Victor Basili, Jeffrey Carver, José C. Maldonado, Sandra Fabbri, Guilherme Horta Travassos, Maria Cristina Ferreira
Venue: Empirical Software Engineering (2004)

Recently the awareness of the importance of replicating studies has been growing in the empirical software engineering community. The results of any one study cannot simply be extrapolated to all environments because there are many uncontrollable sources of variation between different environments.In our work, we have reasoned that the availability of laboratory packages for experiments can encourage better replications and complementary studies. However, even with effectively specified laboratory packages, transfer of experimental know-how can still be difficult. In this paper, we discuss the collaboration structures we have been using in the Readers&rsquo; Project, a bilateral project supported by the Brazilian and American national science agencies that is investigating replications and transfer of experimental know-how issues. In particular, we discuss how these structures map to the Nonaka&ndash;Takeuchi knowledge sharing model, a well-known paradigm used in the knowledge management literature. We describe an instantiation of the Nonaka&ndash;Takeuchi Model for software engineering experimentation, establishing a framework for discussing knowledge sharing issues related to experimental software engineering. We use two replications to illustrate some of the knowledge sharing issues we have faced and discuss the mechanisms we are using to tackle those issues in Readers&rsquo; Project.
A Transaction Cost Model of Electronic Trust: Transactional Return, Incentives for Network Security and Optimal Risk in the Digital Economy
Authors: Virginia Franke Kleist
Venue: Electronic Commerce Research (2004)

Transaction cost economics can explain the mechanism by which network security technologies may reduce the interexchange costs between businesses in the supply chain and between businesses and customers in the digital economy. This paper develops the construct of technology-based electronic trust, where interpersonal, or &ldquo;real&rdquo; trust between people can be amplified and enhanced with the use of network security information technologies. The paper formally models an electronic commerce trust typology based on minimizing the cost of establishing trust in transactions, balanced against maximizing the potential user value from successfully completing transactions in the digital economy, suggesting that there is an optimal amount of acceptable risk in electronic commerce transactions. Sophisticated deployments of security information technologies may increase levels of interpersonal trust while lowering transaction costs in electronic commerce, thus promoting the long run development of neutral, interorganizational electronic markets and growth in the digital economy.
Variable precision rough sets
Authors: Alicja Mieszkowicz-Rolka, Leszek Rolka
Venue: Artificial intelligence and security in computing systems (2003)

This paper considers the evaluation of human decision model basing on measures of the variable precision rough sets theory. A modified notion of the positive area of classification was used in order to avoid problems in analysis of inconsistent data. Decision tables were generated and investigated in case of control of a dynamic plant (aircraft).
Designing mobile commerce applications
Authors: Peter Tarasewich
Venue: Communications of the ACM (2003)

Exploring the importance and untangling the complexity of the notion of context.
Market-Based Resource Allocation for Content Delivery in the Internet
Authors: Özgür Erçetin, Leandros Tassiulas
Venue: IEEE Transactions on Computers (2003)

Abstract--Caches have been used extensively to store the most popular/recent requested data to improve the user latency and reduce the network load. Recently, a more systematic approach to caching has been developed within the framework of Content Delivery Networks (CDN). A CDN is the network of caches, where the caches are geographically distributed and serve user requests on behalf of the subscriber Web sites. Users receive the requested information from the caching servers, which are closer to the users and usually much less loaded than the origin server. The objective is to minimize the user latency by intelligently distributing the content and serving the user requests from the most efficient sites. We realistically model the agents in a CDN with selfish self-maximizing behaviors and define the problem as a noncooperative game. We separate the distribution and routing subproblems and use games to solve each. We show that the subproblems have equilibrium solutions and, if the equilibrium of a subproblem is unique, we achieve the global optimum for that subproblem. We also determine that a unique equilibrium is reached if the content providers are not willing to pay high amounts and the cache sizes are sufficiently small. We noticed that the global system optimum requires the content providers to pay very high amounts, which in practice may prohibit the applicability of the distributed method. Thus, we consider an investment strategy for the content providers, which maximizes the publishers' net benefits and leads to a near-optimum system solution. We also show that the joint distribution and routing game has an equilibrium and demonstrate its performance by numerical examples.
Time-Utility Function-Driven Switched Ethernet: Packet Scheduling Algorithm, Implementation, and Feasibility Analysis
Authors: Jinggang Wang, Binoy Ravindran
Venue: IEEE Transactions on Parallel and Distributed Systems (2004)

Abstract--We present a MAC-layer, soft real-time packet scheduling algorithm called UPA. UPA considers a message model where message packets have end-to-end timeliness requirements that are specified using Jensen's Time-Utility Functions (TUFs). The algorithm seeks to maximize system-wide, aggregate packet utility. Since this scheduling problem is NP-hard, UPA heuristically computes schedules with a quadratic worst-case cost, faster than the previously best CMA algorithm. Our simulation studies show that UPA performs the same as or significantly better than CMA for a broad set of TUFs. Furthermore, we implement UPA and prototype a TUF-driven switched Ethernet system. The performance measurements of UPA from the implementation reveal its strong effectiveness. Finally, we derive timeliness feasibility conditions of TUF-driven switched Ethernet systems that use the UPA algorithm.
Fast Path-Based Neural Branch Prediction
Authors: Daniel A. Jiménez
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

Microarchitectural prediction based on neural learninghas received increasing attention in recent years. However,neural prediction remains impractical because its superioraccuracy over conventional predictors is not enough to offsetthe cost imposed by its high latency. We present a newneural branch predictor that solves the problem from bothdirections: it is both more accurate and much faster thanprevious neural predictors. Our predictor improves accuracyby combining path and pattern history to overcomelimitations inherent to previous predictors. It also has muchlower latency than previous neural predictors. The result isa predictor with accuracy far superior to conventional predictorsbut with latency comparable to predictors from industrialdesigns. Our simulations show that a path-basedneural predictor improves the instructions-per-cycle (IPC)rate of an aggressively clocked microarchitecture by 16%over the original perceptron predictor.
An architecture to support distributed data retrieval in specialized formats
Authors: M. Brian Blake
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Raw data and processed information are essential to the development of software simulation systems used in the analysis of various application domains. In such domains, the dissemination and management of this information is a daunting task. This paper discusses software architectural and specification-driven approaches to data retrieval in custom formats. Simulation developers use XML-based specification to request database results in any format.
Basic I/O handling on burroughs B6500
Authors: Rajani M. Patel
Venue: Proceedings of the second symposium on Operating systems principles (1969)

The approach to processing basic Input/Output in B6500 hardware design and software implementation is discussed in this paper. Hardware I/O structure necessary to the understanding of the approach is described first. The representation of the I/O queue and the algorithms used in handling I/O requests are described in detail to emphasize the ease with which the I/O handling portions of the executive system may be modified to suit any installation. Some of the I/O tables for coordinating I/O activity are discussed. The concept of asynchronous processes running as extended arms of the executive system is discussed and the implementation of it for updating status of peripheral units, for handling I/O errors, etc. is described. The usage and implementation of I/O related events and software interrupts is discussed. The locking concept is presented. Finally, the complete I/O initiation and completion cycle is described. The description throughout this paper is based on the actual working system implemented with language ESPOL - an extended ALGOL language used for writing executive systems. Some of the special language constructs pertinent to I/O handling are illustrated.
Efficient matching for state-persistent publish/subscribe systems
Authors: Hubert Ka Yau Leung, Hans-Arno Jacobsen
Venue: Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research (2003)

Content-based publish/subscribe systems allow information dissemination and fine-grained information filtering in loosely coupled distributed systems. Stateless publish/subscribe systems send notifications to all subscribers whose subscriptions match an incoming publication. State-persistent publish/subscribe systems, a recently proposed model that stores the states of both publications and subscriptions, only send notifications upon state transitions. The information filtering process requires an efficient matching algorithm with high throughput and scalability. Although there have been studies on matching algorithms for stateless publish/subscribe systems, the matching problem for state-persistent publish/subscribe systems is still an open research problem. This paper presents a novel content-based matching algorithm and its data structures for state-persistent publish/subscribe systems. We will also present the complexity analysis and results of simulations that validates the analytical predictions.
Fast, Layout-Aware Validation of Test-Vectors for Nanometer-Related Timing Failures
Authors: Aman Kokrady, C. P. Ravikumar
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

ATPG tools generate test vectors assuming the zero delay modelfor logic gates. In reality, however, gates have finite rise and falldelays that are dependent on process, voltage, and temperaturevariations across different dies on a wafer and within a die. Atest engineer must verify the vectors for timing correctnessbefore they are handed off to the product engineer. Currently,validation of test vectors is done using dynamic simulation of thecircuit using the test vectors. A test vector is invalidated if itcannot reliably distinguish between a good and a faulty circuitunder the signal placement and observation error window of thetester equipment. As chips become faster, the need to test them attheir intended speed of operation has been recognized;accordingly, at-speed functional tests, memory BIST, andtransition delay tests are being used for modern ASICs. Sincestructural tests can result in much more switching activity in thecircuit than what is estimated during normal functioning, theymay fail delay testing due to nanometer effects such as crosstalkand IR drop. As a result, the validation performed by a dynamicsimulation can be prone to error. Here is a case of a test thatover-exercises the chip and declares it faulty even when the chipmay work correctly in functional mode at the intended speed.One solution to this problem is to overdesign, e.g. oversize thepower rails or increase wiring pitch, but this will impact the yieldof the product. We propose layout-aware verification of at-speedtest vectors and eliminating test vectors that can result inmisclassification. Attempting to address this verification indynamic simulation will force the use of circuit simulation ormixed-level simulation techniques, which are expensive in termsof run time. We discuss a static approach to validate the testvectors to save valuable cycle time. Experimental results on twodesigns will be presented to illustrate our approach.
Data Coding by Linear Forms of Numerical Sequences
Authors: A. V. Anisimov
Venue: Cybernetics and Systems Analysis (2003)

This paper proposes to code integers and binary trees by linear forms of (au_{n-1}+bu_{n})-type, where u_{n-1} and u_{n-1} are adjacent members of some integer sequence. New prefix codes of integers are obtained. Such codes have better characteristics than the well-known Levenshtein code. Data compression by means of coding by linear forms is considered. Linear Fibonacci forms are studied in detail.
On Systems of Small Sets with No Large &Delta;-Subsystems
Authors: A. V. Kostochka, V. Rödl, L. A. Talysheva
Venue: Combinatorics, Probability and Computing (1999)

A family of k sets is called a &Delta;-system if any two sets have the same intersection. Denote by f(r, k) the least integer so that any r-uniform family of f(r, k) sets contains a &Delta;-system consisting of k sets. We prove that, for every fixed r, f(r, k) = kr + o(kr). Using a recent result of Molloy and Reed [5], a bound on the error term is provided for sufficiently large k.
DBC: a condensed representation of frequent patterns for efficient mining
Authors: Artur Bykowski, Christophe Rigotti
Venue: Information Systems (2003)

Given a large set of data, a common data mining problem is to extract the frequent patterns occurring in this set. The idea presented in this paper is to extract a condensed representation of the frequent patterns called disjunction-bordered condensation (DBC), instead of extracting the whole frequent pattern collection. We show that this condensed representation can be used to regenerate all frequent patterns and their exact frequencies. Moreover, this regeneration can be performed without any access to the original data. Practical experiments show that the DBCcan be extracted very efficiently even in difficult cases and that this extraction and the regeneration of the frequent patterns is much more efficient than the direct extraction of the frequent patterns themselves. We compared the DBC with another representation of frequent patterns previously investigated in the literature called frequent closed sets. In nearly all experiments we have run, the DBC have been extracted much more efficiently than frequent closed sets. In the other cases, the extraction times are very close.
Information technology strategic alignment: Brazilian cases
Authors: Fernando José Barbin Laurindo, Marly Monteiro de Carvalho, Tamio Shimizu
Venue: Business strategies for information technology management (2003)

This chapter presents a study about the effectiveness of Information Technology (IT) applications in Brazilian companies. IT has been considered a strategic issue for successful companies. On the other hand, the discussion about the results of Information Technology (IT) applications considering the return over the investments and the effectiveness of their management still remains controversial. Effectiveness evaluation allows strategic alignment between IT and company business visions and should be analyzed as a continuous process. In order to discuss these issues, in this chapter, a comparative analysis about IT strategic impacts is performed using different theoretical models. The study is based on multiple cases: financial services, telecommunications, and building materials companies. Interviews with the main actors from different levels of the organization hierarchy have been done.
Technologies for Trust in Electronic Commerce
Authors: Mary Anne Patton, Audun Jøsang
Venue: Electronic Commerce Research (2004)

Lack of consumer trust in e-commerce merchants, e-commerce technology, and the social, financial and legal infrastructures of the e-commerce environment, poses a major challenge to the large-scale uptake of business to consumer e-commerce. Most traditional cues for assessing trust in the physical world are not available online. This paper gives an overview of some of the work being done to devise alternative methods for assessing, communicating and establishing trust in this environment. Examples are drawn from a wide range of disciplines including human&ndash;computer interaction, usability, marketing, information technology, mathematics, linguistics and law. Industry, self-regulatory and government initiatives aimed at building consumer trust and confidence in e-commerce are also discussed.
GRTL: a graphical platform for pipelined system design
Authors: Glenn Jennings
Venue: Proceedings of the conference on European design automation (1991)

We present GRTL, a graphical design tool specifically for manual design of synchronous pipelines at the register transfer level. Abstractions (parameterized behavioral components, abstract signals) and AI methodology simplify input and reduce detail, yet useful timing analyses can be obtained. Features include integrated interactive design blackboard, Werner diagram and clocking formalisms for design correctness, open library, reversible functional simulator, and downloading facility for external silicon compilation. Earlier work is contrasted.
Facets of linear signed order polytopes
Authors: Samuel Fiorini, Peter Fishburn
Venue: Discrete Applied Mathematics (2003)

Self-reflecting signed orders have been proposed to aid assessment of preferences between subsets of an n-item set {1,2,... ,n} by considering desirabilities of excluding as well as including items in a set. A linear signed order for n is a linear order on the 2n-element set {1,...,n} U {1*,...,n*}, where (x*)* = x, which satisfies the self-reflection property x y ⇔ y* x*. The linear signed order polytope Qn for n is defined in a standard way as a polytope in [0,1]2n(2n-1). It has dimension n2. We note a complete equation system for Qn and specify all facet defining inequalities for n ≤ 4. Additional classes of facets for larger n that are not induced by a lifting lemma are identified. Comparisons to linear ordering polytopes are included.