ppxscal/embedding_network huggingface dataset:
Camera Autocalibration and Horopter Curves
Authors: José Ignacio Ronda, Antonio Valdés, Fernando Jaureguizar
Venue: International Journal of Computer Vision (2004)

We describe a new algorithm for the obtainment of the affine and Euclidean calibration of a camera under general motion. The algorithm exploits the relationships of the horopter curves associated to each pair of cameras with the plane at infinity and the absolute conic. Using these properties we define cost functions whose minimization by means of general purpose techniques provides the required calibration. The experiments show the good convergence properties, computational efficiency and robust performance of the new techniques.
Maintenance productivity: observations based on an experience in a large system environment
Authors: Carl S. Hartzman, Charles F. Austin
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

This paper is concerned with the economical maintenance of large software products. It examines the software maintenance process and outlines a framework, based on cost-benefit, within which changes to the maintenance environment affecting future maintenance productivity can be evaluated. It also looks at the rationale for the recommendations that are made. The recommendations include the formation of a team charged with overseeing the maintainability of the products and the implementation of certain protocols for maintenance that rigorously incorporate documentation maintenance. The paper is based on the authors ' experience with a large software product, and contains product-specific recommendations.
Factorization of the Ashikhmin BRDF for real-time rendering
Authors: Mauro Steigleder, Michael D. McCool
Venue: Journal of Graphics Tools (2002)

Ashikhmin and Shirley have proposed an anisotropic BRDF model that is physically plausible and has intuitive parameters. We present an analytical factorization of the Ashikhmin BRDF that is suitable for real-time implementation on all graphics accelerators, and address some important issues necessary to correctly implement the factorization. We also discuss highlight antialiasing.
The price of anarchy is independent of the network topology
Authors: Tim Roughgarden
Venue: Journal of Computer and System Sciences (2003)

We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experienced by network traffic on an edge of the network is a function of the edge congestion, and network users are assumed to selfishly route traffic on minimum-latency paths. The quality of a routing of traffic is measured by the sum of travel times, also called the total latency. The outcome of selfish routing--a Nash equilibrium--does not in general minimize the total latency; hence, selfish behavior carries the cost of decreased network performance. We quantify this degradation in network performance via the price of anarchy, the worst-possible ratio between the total latency of a Nash equilibrium and of an optimal routing of the traffic. In this paper, we show that the price of anarchy is determined only by the simplest of networks. Specifically, we prove that under weak hypotheses on the class of allowable edge latency functions, the worst-case ratio between the total latency of a Nash equilibrium and of a minimum-latency routing for any multicommodity flow network is achieved by a single-commodity instance in a network of parallel links. In the special case where the class of allowable latency functions includes all of the constant functions, we prove that a network with only two parallel links suffices to achieve the worst-possible ratio. Our guarantee that simple networks always furnish worst-possible examples provides a powerful method for computing the price of anarchy with respect to an arbitrary class of latency functions. We apply this method to function classes that have been well studied in the literature, including degree-bounded polynomials and queuing delay functions. These are the first tight analyses of the price of anarchy for significant classes of latency functions outside the class of linear functions.
Beam equation with weak-internal damping in domain with moving boundary
Authors: H. R. Clark, M. A. Rincon, R. D. Rodrigues
Venue: Applied Numerical Mathematics (2003)

The small-amplitude motion of an elastic beam with internal damping is investigated in a One-dimensional domain with moving boundary. Existence, uniqueness, asymptotic behavior, and numerical analysis of solutions are shown to the mixed problem associated with the beam equation with fully clamped boundary conditions.
Slepian-Wolf Coding for Nonuniform Sources Using Turbo Codes
Authors: Jing (Tiffany) Li, Zhenyu Tu, Rick S. Blum
Venue: Proceedings of the Conference on Data Compression (2004)

The recently proposed turbo-binning scheme is shown to be both efficient and optimal foruniform source Slepian-Wolf coding problem. This paper studies the case when sources arei.i.d but nonuniformly distributed. It is firstly shown that any algebraic binning scheme basedon linear codes is optimal for nonuniform sources only asymptotically. Next two modificationsare proposed to improve the performance of the turbo-binning scheme for nonuniform sources.The first is to carefully design the constituent encoder structures to maximally match the turbocode to the nonuniform source distribution, and the second is to use variable-length syndromesequences to index the bins. Simulations show that the combination of both strategies can lead to an improvement of as much as 0.22 bit/symbol in overall compression rate for highly nonuniform sources.
A Java OpenCard framework based medical smartcard system
Authors: David Gildea, Tom Dowling
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

The architecture and use of the java OpenCard Framework, (OCF), to develop SmartCard systems is discussed. The protocols involved and the different layers that comprise the systems are also discussed. The design and implementation of an OCF based personal Medical SmartCard system is presented.
CMOS Circuit Design for Minimum Dynamic Power and Highest Speed
Authors: Tezaswi Raja, Vishwani D. Agrawal, Michael L. Bushnell
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

A new low-power design method producesCMOS circuits that consume the least dynamic powerat the highest speed permitted under the technologyconstraint.A gate is characterized by an inertial delayand separate delays between its inputs and output.The technology constraint, related to feasible rangesof lengths and widths of transistors, is specified by aparameter ub.It is the upper bound on the differencebetween the inputs of a gate.We formulate a linearprogram (LP) whose size is proportional to the circuitsize.This LP determines the inertial delay as well asinput to output delays for each gate of the circuit withthe given ub, such that all glitches are eliminated andthe overall delay of the circuit is minimized.Becauseof the additional flexibility in specifying gate delays,the glitch suppression is guaranteed without any delaybuffers.Hence this design consumes less powerthan those designed by other methods.We designedthe circuit c1355 with 46% of the original power dissipationcompared to a reference design.A previouslypublished method, that characterizes each gate with asingle delay, produced a c1355 circuit consuming 58%of the original power.Both low-power circuits had the same overall delay.The previous design required 224delay buffers, whereas the new design needed none.
Time/space efficient compressed pattern matching
Authors: Leszek Gasieniec, Igor Potapov
Venue: Fundamenta Informaticae (2002)

An exact pattern matching problem is to find all occurrences of a pattern p in a text t. We say that the pattern matching algorithm is optimal if its running time is linear in the sizes of t and p, i.e., O(t + p). Perhaps one of the most interesting settings of the pattern matching problem is when one has to design an efficient algorithm with a help of a small extra space. In this paper we explore this setting to the extreme. We work under an assumption that the text t is available only in a compressed form, represented by a straight-line program. The compression methods based on efficient construction of straight-line programs are as competitive as the compression standards, including the Lempel-Ziv compression scheme and recently intensively studied text compression via block sorting, due to Burrows and Wheeler. Our main result is an algorithm that solves the compressed string matching problem in an optimal linear time, with a help of a constant extra space. We also discuss an efficient implementation of a version our algorithm showing that the new concept may have also some interesting real applications. Our result is in contrast with many other compressed pattern matching algorithms where the goal is to find all pattern occurrences in time related to the size of the compressed text. However one must remember that all previous algorithms used at least a linear (in a compressed text, a dictionary, or a pattern) extra memory while our algorithm can be implemented in a constant size extra space. Also from the practical point of view, when the compression ratio is constant (very rarely smaller than 25%), there is no dramatic difference between the running time based on the size of the compressed text and the size of the original text, while an extra space resources might be strictly limited.
Influences of Different Ethical Issues on Ethical Decision-Making in an IT Context
Authors: Russell Haines, Lori N. K. Leonard
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

This paper reports the results of a laboratory experiment involving the discussion of ethicalscenarios. Groups discussed five ethical scenarios centered on the use of information technology, involving issues of privacy, intellectual property, use of company equipment for non-work activities, and modification of company software for personal gain. Data were collected via questionnaire before and after the discussion.The results show that ethical decision making processes vary by scenario, with perceivedimportance of an ethical issue and moral obligation to act being strong, but not all-inclusive influences on the link between attitude toward questionable behavior and intention to engage in the behavior. The results are discussed in the context of several models of ethical decision-making and suggestions are given for future research. Managers are advised on how to limit unethical behavior.
Running Mac OS X Panther
Authors: James Duncan Davidson
Venue:  (2003)

Running Mac OS X Panther is the ultimate Swiss Army Knife(TM); for power users who want to customize, tweak, and generally rev up their Mac. This book takes readers deep inside Mac OS X's core, revealing the inner workings of Panther for those who want to get the most out of their system. You may not be a Mac guru when you start this book, but once you've read it, you'll be well on your way.
The development of a multi-agent system for construction claims negotiation
Authors: Z. Ren, C. J. Anumba, O. O. Ugwu
Venue: Advances in Engineering Software (2003)

Negotiation is an important stage in construction claims management process. Unfortunately, most construction claims negotiations are conducted inefficiently due to various reasons. The recent development of multi-agent systems provides an innovative approach to facilitating various negotiations. This research has developed a multi-agent system for construction claims negotiation (MASCOT) to resolve the inefficiency problem. This paper discusses the key points of the MASCOT model. Of particular interest is the computer implementation of the developed MASCOT model using the ZEUS agent building toolkit.
Reducing Optical Crosstalk in Affordable Systems of Virtual Environment
Authors: Stanislav V. Klimenko, Igor Nikitin, Lialia Nikitina
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

We have implemented a scheme for elimination of depolarizationartefacts in passive stereo-projection systems.These problems appear due to non-perfectness of stereo-projectionequipment: depolarization of the light due to reflectionfrom the screen or due to the passage through thescreen; non-ideality of polarizing filters; mixing of left- andright-eye images in a change of relative orientation of thefilters. These effects lead to strong violations in stereo-perception(known as "ghosts"). They can be eliminatedby software methods, using linear filtering of the imagebefore its projection to the screen, based on the formulaL' = L -\alphaR, R' = R -\alphaL , where L, R are images, destinedfor the left and right eye respectively, \alpha is constant,defining intensity of the ghosts. This receipt, in theory leadingto exact compensation of the ghosts, in practice possessescertain limitations, which allow not complete eliminationbut only strong suppression of the ghosts, at verycareful calibration of the system. We have implementedthis algorithm in VE system Avango [1] by means of texturemappings. All necessary operations are performed bythe graphics board, thus providing the real-time renderingrate. The described method considerably improves stabilityof stereo-perception, making high-quality performances ofvirtual environment possible on affordable equipment.
The game of internet B2B
Authors: Thomas O'Daniel, Teoh Say Yen
Venue: Managing IT in government business & communities (2003)

Game theory accepts the expected utility hypothesis and reduces roles to the "informed" and the "uninformed" player in order to facilitate the process of constructing mathematical models. When quality is known to the seller, but not to the buyer, private markets can be modeled as a screening game, and public exchanges as a signaling game. In a private market, the buyer moves first by revealing acceptable quality. In a public exchange, the seller moves first by publicizing product information. Adoption of the technology will ultimately depend on perception of the game and payoffs relative to risks. Price competition is a significant negative externality, and opportunistic representations a real danger. When search costs are low, scope for differentiation limited, and information about quality is incomplete or imperfect, the conditions for a lemon's market are fulfilled. A focus on commodities, global reach, and building a positive brand image for Internet business-to-business (B2B) in general should prove effective.
Joint Development of Dual Oil Fields: Modeling and Regulation
Authors: A. V. Akhmetzyanov, V. N. Kulibanov
Venue: Automation and Remote Control (2003)

Modeling of a water drive development scheme for an oil field with intrawell oil-water separation is studied. Main relations for the motion of liquids in a well with regard for gravitational forces are derived. A stabilization system for withdrawal of oil from one bed and injection of water into another bed is constructed.
Wireless Support for Mobile Distributed Work: A Taxonomy and Examples
Authors: Stuart J. Barnes
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

Individually, the penetration of distributed networks and mobile telecommunications in the developed world has evoked considerable change in our daily lives -- how we work, live and learn. Combined, the potential impact of the wireless networks and related applications is immense. Although the literature on wireless applications has predominantly focused on business-to-consumer markets, following the patterns in the media and e-commerce research, it is now becoming clear that mobile networking will provide a tremendous impetus to the development of other strategic applications for businesses. This paper explores this emerging area of wireless applications in the business. It provides a background to conceptual ideas of mobile distributed work (MDW), and a framework for understanding the development of MDW in organizations. The paper also begins to apply these conceptual ideas in a number of case studies. The paper rounds off with a summary and some conclusions regarding the future of MDW.
Cross-training: learning probabilistic mappings between topics
Authors: Sunita Sarawagi, Soumen Chakrabarti, Shantanu Godbole
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Classification is a well-established operation in text mining. Given a set of labels A and a set DA of training documents tagged with these labels, a classifier learns to assign labels to unlabeled test documents. Suppose we also had available a different set of labels B, together with a set of documents DB marked with labels from B. If A and B have some semantic overlap, can the availability of DB help us build a better classifier for A, and vice versa? We answer this question in the affirmative by proposing cross-training: a new approach to semi-supervised learning in presence of multiple label sets. We give distributional and discriminative algorithms for cross-training and show, through extensive experiments, that cross-training can discover and exploit probabilistic relations between two taxonomies for more accurate classification.
High-order non-uniform grid schemes for numerical simulation of hypersonic boundary-layer stability and transition
Authors: Xiaolin Zhong, Mahidhar Tatineni
Venue: Journal of Computational Physics (2003)

The direct numerical simulation of receptivity, instability and transition of hypersonic boundary layers requires high-order accurate schemes because lower-order schemes do not have an adequate accuracy level to compute the large range of time and length scales in such flow fields. The main limiting factor in the application of high-order schemes to practical boundary-layer flow problems is the numerical instability of high-order boundary closure schemes on the wall. This paper presents a family of high-order non-uniform grid finite difference schemes with stable boundary closures for the direct numerical simulation of hypersonic boundary-layer transition. By using an appropriate grid stretching, and clustering grid points near the boundary, high-order schemes with stable boundary closures can be obtained. The order of the schemes ranges from first-order at the lowest, to the global spectral collocation method at the highest. The accuracy and stability of the new high-order numerical schemes is tested by numerical simulations of the linear wave equation and two-dimensional incompressible flat plate boundary layer flows. The high-order non-uniform-grid schemes (up to the 11th-order) are subsequently applied for the simulation of the receptivity of a hypersonic boundary layer to free stream disturbances over a blunt leading edge. The steady and unsteady results show that the new high-order schemes are stable and are able to produce high accuracy for computations of the nonlinear two-dimensional Navier-Stokes equations for the wall bounded supersonic flow.
Efficient Data Compression Methods for Multidimensional Sparse Array Operations Based on the EKMR Scheme
Authors: Chun-Yuan Lin, Yeh-Ching Chung, Jen-Shiuh Liu
Venue: IEEE Transactions on Computers (2003)

Abstract--In our previous work, we have proposed the extended Karnaugh map representation (EKMR) scheme for multidimensional array representation. In this paper, we propose two data compression schemes, EKMR Compressed Row/Column Storage (ECRS/ECCS), for multidimensional sparse arrays based on the EKMR scheme. To evaluate the proposed schemes, we compare them to the CRS/CCS schemes. Both theoretical analysis and experimental tests were conducted. In the theoretical analysis, we analyze the CRS/CCS and the ECRS/ECCS schemes in terms of the time complexity, the space complexity, and the range of their usability for practical applications. In experimental tests, we compare the compressing time of sparse arrays and the execution time of matrix-matrix addition and matrix-matrix multiplication based on the CRS/CCS and the ECRS/ECCS schemes. The theoretical analysis and experimental results show that the ECRS/ECCS schemes are superior to the CRS/CCS schemes for all the evaluated criteria, except the space complexity in some cases.
Optimization techniques for parallel irregular reductions
Authors: E. Gutiérrez, O. Plata, E. L. Zapata
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2003)

Different parallelization techniques have been proposed in the literature for irregular reductions in the context of shared memory multiprocessors. They may be classified into two broad families: those based on privatization of the reduction arrays and those based on the partitioning of the reduction arrays. Methods in the first family are simple but no data locality is exploited and their memory scalability is low. On the other hand, methods in the second family are more complex as they require an inspection phase but they exploit data locality and scale up better in memory. Focusing on partitioning-based methods, although they exhibit a good performance in a wide variety of irregular codes, some specific input data patterns may exist for which the performance is lowered. In particular these kind of access patterns may reduce the exploited parallelism by the method or introduce workload unbalances. In order to mitigate these negative effects, we propose three optimizations for a specific partitioning-based method (DWA-LIP). These optimizations try to increase the exploited parallelism, balance the workload and reduce the effect of high contention degree regions in the reduction arrays. Efficient implementations of the proposed optimizations for the DWA-LIP method have been tested experimentally, and compared with other methods for parallelizing irregular reductions.
FUNSOFT nets: a Petri-net based software process modeling language
Authors: Wolfgang Emmerich, Volker Gruhn
Venue: Proceedings of the 6th international workshop on Software specification and design (1991)

We introduce an approach to software process modeling and analysis. It is based on describing software processes by FUNSOFT nets. FUNSOFT nets are high level Petri nets which are adapted to the application domain of software process modeling. Their semantics is defined by Predicate/Transition nets. That enables to benefit from standard analysis techniques approved for Predicate/Transition nets.
Packing Trees into the Complete Graph
Authors: Edward Dobson
Venue: Combinatorics, Probability and Computing (2002)

Let c &les; 0.076122 and T1, T2,&hellip;, Tn be a sequence of trees such that &mid;V(Ti)&mid; &les; i&minus;c(i&minus;1). We prove that, if for each 1 &les; i &les; n there exists a vertex xi &isin; V(Ti) such that Ti&minus;xi has at least (1&minus;2c)(i&minus;1) isolated vertices, then T1,&hellip;, Tn can be packed into Kn. We also prove that if T is a tree of order n+1&minus;c&prime;n, c&prime; &les; 1&#x002F;25 (37&minus;8 &radic;21 ) &ap; 0.0135748, such that there exists a vertex x &isin; V(T) and T&minus;x has at least n(1&minus;2c&prime;) isolated vertices, then 2n&plus;1 copies of T may be packed into K2n&plus;1.
System JLZ: rational default reasoning by minimal ranking constructions
Authors: Emil Weydert
Venue: Journal of Applied Logic (2003)

We present a powerful quasi-probabilistic default formalism for graded defaults based on a well-motivated canonical ranking construction procedure, System JLZ. It implements the minimal construction paradigm and verifies the major inference principles and inheritance desiderata, including rational monotony for propositions and structured cumulativity for default conditionals. With help from a structured ranking semantics for defaults, it also avoids some drawbacks of semi-qualitative entropy maximization and other competing accounts.