ppxscal/embedding_network huggingface dataset:
Book review: COMPUTATIONAL VISION By Harry Wechsler (Academic Press London, 1990)
Venue: ACM SIGART Bulletin (1991)

During my academic lifetime, I have read many textbooks and articles concerned with the various subjects of computer science, and I now expect a familiar format --- equations, cryptic explanations, and a narrow scope --- which can, at times, be rather tedious. In Computational Vision, Harry Wechsler has created a reading environment that captures the reader's interest and imagination by describing his insights from philosophy, biology, and the arts, and yet provides the necessary rigor found in the traditional format. He is also quite bold in stating his beliefs about the current state and the future directions of the vision sciences. Because of the complexity and inaccessibility of the biological vision systems that computational vision seeks to emulate, one would surmise that introspection and subjective opinion would be the norm, but this is not the case, Hopefully, readers of Wechsler's book will realize that by adopting this style, the vision community can only benefit from the stimulation of seeking to prove or disprove various hypotheses.
The research seminar on computer algebra in 2003-2004
Authors: S. A. Abramov, A. A. Bogolubskaya, V. A. Rostovtsev, V. F. Edneral
Venue: Programming and Computing Software (2005)

An annual report on meetings of the scientific research seminar on computer algebra is presented.
Quick Reconfiguration in Clustered Micro-Sequencer
Authors: Roozbeh Jafari, Seda Ogrenci Memik, Majid Sarrafzadeh
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

This paper presents a Micro-Sequencer based reconfigurable system. We introduce the concept of Quick Reconfiguration and compare it with existing "full reconfiguration" schemes. In a typical scenario, reconfiguring a system from one application to another does not require a "full" reconfiguration. Instead we can exploit similarities among various applications to save on reconfiguration time. We show that a significant speedup is gained by using quick reconfiguration on a set of image processing benchmarks, which takes seconds versus hours in traditional FPGA reconfigurations. We evaluate the flexibility, the performance and the parallelism of this architecture with customized functional units. Furthermore, a method was proposed for customizing clustered datapath to improve the throughput of the system. This method accelerates the system by 13 times on average compared to the case where the same algorithm is running on a modern processor. We also map various applications directly onto FPGAs and measure the silicon area and the power consumption and compare to the case where the applications are implemented on micro-sequencers. On average, micro-sequencer takes 31% more area and consumes 23% more power. However, the reconfiguration time is decreased to less than one second on average while for applications directly mapped onto FPGAs, it is near 3000 seconds.
Estimating high-confidence portions based on agreement among outputs of multiple LVCSR models
Authors: Takehito Utsuro, Hiromitsu Nishizaki, Yasuhiro Kodama, Seiichi Nakagawa
Venue: Systems and Computers in Japan (2004)

This paper experimentally evaluates the agreement among the outputs of multiple Japanese LVCSR models, with respect to whether it is effective as an estimate of confidence for each hypothesized word. The results of experimental evaluation show that the agreement between the outputs with two LVCSR models with different decoders and acoustic models can achieve quite reliable confidence. Furthermore, among various features of acoustic models based on Gaussian mixture HMMs, it is concluded that ones such as whether or not to have short pause models, as well as different units in HMMs are the most effective in achieving highly reliable confidence. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(7): 33&ndash;40, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10636
On the implementation of object-oriented philosophy for the design of a finite element code dedicated to multibody systems
Authors: V. Kromer, F. Dufossé, M. Gueury
Venue: Finite Elements in Analysis and Design (2005)

The principal objective of this paper is to describe one approach to the design and implementation of a multibody systems analysis code using an object-oriented architecture. Emphasis will be placed on the adequacy between object-oriented programming and the finite element method used for the treatment of three-dimensional multibody flexible mechanisms with large rotations and large strains, within a given formalism and given hypotheses. We will show that the object-oriented programming greatly simplifies the choice and the implementation of other formalisms concerning polyarticulated systems, thus conferring high flexibility and adaptability to the developed software.
Lineage retrieval for scientific data processing: a survey
Authors: Rajendra Bose, James Frew
Venue: ACM Computing Surveys (CSUR) (2005)

Scientific research relies as much on the dissemination and exchange of data sets as on the publication of conclusions. Accurately tracking the lineage (origin and subsequent processing history) of scientific data sets is thus imperative for the complete documentation of scientific work. Researchers are effectively prevented from determining, preserving, or providing the lineage of the computational data products they use and create, however, because of the lack of a definitive model for lineage retrieval and a poor fit between current data management tools and scientific software. Based on a comprehensive survey of lineage research and previous prototypes, we present a metamodel to help identify and assess the basic components of systems that provide lineage retrieval for scientific data products.
A method to standardize usability metrics into a single score
Authors: Jeff Sauro, Erika Kindlund
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Current methods to represent system or task usability in a single metric do not include all the ANSI and ISO defined usability aspects: effectiveness, efficiency & satisfaction. We propose a method to simplify all the ANSI and ISO aspects of usability into a single, standardized and summated usability metric (SUM). In four data sets, totaling 1860 task observations, we show that these aspects of usability are correlated and equally weighted and present a quantitative model for usability. Using standardization techniques from Six Sigma, we propose a scalable process for standardizing disparate usability metrics and show how Principal Components Analysis can be used to establish appropriate weighting for a summated model. SUM provides one continuous variable for summative usability evaluations that can be used in regression analysis, hypothesis testing and usability reporting.
Topk Queries across Multiple Private Databases
Authors: Li Xiong, Subramanyam Chitti, Ling Liu
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Advances in distributed service-oriented computing and global communications have formed a strong technology push for large scale data integration among organizations and enterprises. However, concerns about data privacy become increasingly important for large scale mission-critical data integration applications. Ideally, given a database query spanning multiple private databases, we wish to compute the answer to the query without revealing any additional information of each individual database apart from the query result. In practice, we may relax this constraint to allow efficient information integration while minimizing the information disclosure. In this paper, we propose an efficient decentralized peer-to-peer protocol for supporting aggregate queries over multiple private databases while respecting the privacy constraints of participants. The paper has three main contributions. First, it formalizes the notion of loss of privacy in terms of information revealed at individual participating databases. Second, it presents a novel probabilistic decentralized protocol for top k selection across multiple private databases that minimizes the loss of privacy. Third, it experimentally evaluates the protocol in terms of its correctness, efficiency and privacy characteristics.
Signal-specialized parameterization for piecewise linear reconstruction
Authors: Geetika Tewari, John Snyder, Pedro V. Sander, Steven J. Gortler, Hugues Hoppe
Venue: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing (2004)

We propose a metric for surface parameterization specialized to its signal that can be used to create more efficient, high-quality texture maps. Derived from Taylor expansion of signal error, our metric predicts the signal approximation error - the difference between the original surface signal and its reconstruction from the sampled texture. Unlike previous methods, our metric assumes piecewise-linear reconstruction, and thus makes a good approximation to bilinear reconstruction employed in graphics hardware. We achieve significant savings in texture area for a desired signal accuracy compared to the signal-specialized parameterization metric proposed by Sander et al. in the 2002 Eurographics Workshop on Rendering.
Equational Approach to Formal Analysis of TLS
Authors: Kazuhiro Ogata, Kokichi Futatsugi
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

TLS has been formally analyzed with the OTS/CafeOBJ method. In the method, distributed systems are modeled as transition systems, which are written in terms of equations, and it is verified that the models have properties by means of equational reasoning. TLS is the latest version, or the successor of SSL, which is probably the most widely deployed security protocol. Among the results of the analysis are that pre-master secrets cannot be leaked, when a client has negotiated a cipher suite and security parameters with a server, the server has really agreed on them, and client cannot be identified if they do not send their certificates to servers.
A Novel Method of Sprite Generation Based on Pixel Similarity
Authors: Yong Shen, Li Zhang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

In this paper, a novel, efficient, and robust method for sprite generation is presented. First a hierarchical block-based technique is applied to detect and segment the moving regions from the background. Next short-term and long-term motion estimation methods are combined to search the background motion relative to the generated sprite image. Considering the different attribution of pixels in different locations, Pixel Similarity (PS) is proposed to denote the contribution of pixels in sprite generation. Then a new blending technique based on Pixel Similarity is developed in order to prevent sprite image from being blurred due to the inaccurate foreground segmentation and global motion estimation. Experimental results show that the proposed method can significantly improve the sprite image quality.
Keynote 2 for Mac OS X: Visual QuickStart Guide (Visual Quickstart Guides)
Authors: Tom Negrino
Venue:  (2005)

The first task-based guide to Keynote is back, just in time for the revision of Apple's elegant presentation software, Keynote. Keynote 2 for Mac OS X: Visual QuickStart Guide gets readers quickly up-to-speed on the powerful presentation software through detailed step-by-step tasks and hundreds of screenshots. Business and educational users will want to start leveraging the power of Apple's graphics-intensive Keynote presentation software ($79, as part of Apple's iWork suite) immediately--dragging and dropping graphics, digital photos, QuickTime movies, and audio into their slide shows; creating animations, shadows, and labels for their charts and tables; producing dynamic drop shadows and cinematic transitions between slides; and more--and this Visual QuickProject Guide will show them how. Task-based instructions, peppered with plenty of full-color screenshots, tips, and sidebars make it easy to dive in and start creating high-impact presentations in no time. Readers will learn how to use Keynote's professionally designed "themes" to create coordinated backgrounds, fonts, colors, bullets, tables, and charts in seconds.ï¾
Voronoi treemaps for the visualization of software metrics
Authors: Michael Balzer, Oliver Deussen, Claus Lewerentz
Venue: Proceedings of the 2005 ACM symposium on Software visualization (2005)

In this paper we present a hierarchy-based visualization approach for software metrics using Treemaps. Contrary to existing rectangle-based Treemap layout algorithms, we introduce layouts based on arbitrary polygons that are advantageous with respect to the aspect ratio between width and height of the objects and the identification of boundaries between and within the hierarchy levels in the Treemap. The layouts are computed by the iterative relaxation of Voronoi tessellations. Additionally, we describe techniques that allow the user to investigate software metric data of complex systems by utilizing transparencies in combination with interactive zooming.
Optimal fuzzy control to reduce energy consumption in distillation columns
Authors: C. Bouyahiaoui, L. I. Grigoriev, F. Laaouad, A. Khelassi
Venue: Automation and Remote Control (2005)

Distillation columns constitute a significant fraction of the capital invested in the refineries around the world; their control requires a major part of the total operating cost of chemical processes, if the used strategy is not adequate. This article presents the application of optimal fuzzy control to reduce the energy consumption of a Benzene-Toluene distillation column. This method is based on the determination of the specific values of the fuzzy controller parameters such that certain performance criterion is minimised. Results of a simulation study are presented showing the potential improvement offered by this method.
The Promise of Quantum Computing and Quantum Information Theory - Quantum Parallelism
Authors: Dan C. Marinescu
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Heat dissipation, leakage, and other physical phenomena limit our ability to build increasingly faster solid state devices, while quantum computation holds out the promise to solve efficiently most difficult problems in computational sciencessuch as simulation of quantum systems, integer factorization, database searching and the computation of discrete logarithms.
Automatic Support for Irregular Computations in a High-Level Language
Authors: Jimmy Su, Katherine Yelick
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

The problem of writing high performance parallel applications becomes even more challenging when irregular, sparse or adaptive methods are employed. In this paper we introduce compiler and runtime support for programs with indirect array accesses into Titanium, a high-level language that combines an explicit SPMD parallelism model with implicit communication through a global shared address space. By combining the well-known inspectorexecutor technique with high level multi-dimensional array constructs, compiler analysis and performance modeling, we demonstrate optimizations that are entirely hidden from the programmer. The global address space makes the programs easier to write than in message passing, with remote array accesses used in place of explicit messages with data packing and unpacking. The programs are also faster than message passing programs: Using sparse matrixvector multiplication programs, we show that the Titanium code is an average of 21% faster across several matrices and machines, with the best case speedup more than a factor of 2x. The performance advantages are due to both the lightweight RDMA (Remote Direct Memory Access) communication model that underlies the Titanium implementation and automatic optimization selection that adapts the communication to the machine and workload, in some cases using different communication models for different processors within a single computation.
Analysis of business process and capability hypergraphs
Authors: J. Q. Trelewicz, Jorge L. C. Sanz, Ankur Chandra
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

Business process modelling is receiving renewed attention as businesses restructure their business partnerships, sourcing agreements, and production arrangements. However, although processes may be connected to the strategic elements of a business, the process graphs are not themselves business models. When a business is restructured, either in terms of organization or in terms of strategic direction, process graphs may be completely changed. We discuss in this paper the linking of process and capability models with hypergraphs, facilitating richer modelling and analysis of the business.
Improved latency and accuracy for neural branch prediction
Authors: Daniel A. Jiménez
Venue: ACM Transactions on Computer Systems (TOCS) (2005)

Microarchitectural prediction based on neural learning has received increasing attention in recent years. However, neural prediction remains impractical because its superior accuracy over conventional predictors is not enough to offset the cost imposed by its high latency. We present a new neural branch predictor that solves the problem from both directions: it is both more accurate and much faster than previous neural predictors. Our predictor improves accuracy by combining path and pattern history to overcome limitations inherent to previous predictors. It also has much lower latency than previous neural predictors. The result is a predictor with accuracy far superior to conventional predictors but with latency comparable to predictors from industrial designs. Our simulations show that a path-based neural predictor improves the instructions-per-cycle (IPC) rate of an aggressively clocked microarchitecture by 16&percnt; over the original perceptron predictor. One reason for the improved accuracy is the ability of our new predictor to learn linearly inseparable branches; we show that these branches account for 50&percnt; of all branches and almost all branch mispredictions.
A symbolic operator approach to several summation formulas for power series
Authors: T. X. He, L. C. Hsu, P. J.-S. Shiue, D. C. Torney
Venue: Journal of Computational and Applied Mathematics (2005)

This paper deals with the summation problem of power series of the form Sab(f;x) = Σa ≤ k ≤ b f(k)xk, where 0 ≤ a < b ∞, and {f(k)} is a given sequence of numbers with k ∈ [a,b) or f(t) is a differentiable function defined on [a,b). We present a symbolic summation operator with its various expansions, and construct several summation formulas with estimable remainders for Sab(f;x), by the aid of some classical interpolation series due to Newton, Gauss and Everett, respectively.
Reflective shadow maps
Authors: Carsten Dachsbacher, Marc Stamminger
Venue: Proceedings of the 2005 symposium on Interactive 3D graphics and games (2005)

In this paper we present "reflective shadow maps", an algorithm for interactive rendering of plausible indirect illumination. A reflective shadow map is an extension to a standard shadow map, where every pixel is considered as an indirect light source. The illumination due to these indirect lights is evaluated on-the-fly using adaptive sampling in a fragment shader. By using screen-space interpolation of the indirect lighting, we achieve interactive rates, even for complex scenes. Since we mainly work in screen space, the additional effort is largely independent of scene complexity. The resulting indirect light is approximate, but leads to plausible results and is suited for dynamic scenes. We describe an implementation on current graphics hardware and show results achieved with our approach.
Involutive divisions: Slice and pair properties
Authors: A. S. Semenov
Venue: Programming and Computing Software (2005)

Two classes of involutive divisions are considered: pairwise and sliced ones. Pairwise involutive divisions are convenient for the calculation of multiplicative and nonmultiplicative variables when new monomials are added. Directed sliced partitions are convenient for finding involutive divisors of an arbitrary monomial. It is proved that the only homothetic division that is simultaneously pairwise and directed sliced is the Janet involutive division. This shows that the Janet division is optimal for the calculation of multiplicative variables and for the fast search of a divisor.
Understanding performance in coliseum, an immersive videoconferencing system
Authors: H. Harlyn Baker, Nina Bhatti, Donald Tanguay, Irwin Sobel, Dan Gelb, Michael E. Goss, W. Bruce Culbertson, Thomas Malzbender
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2005)

Coliseum is a multiuser immersive remote teleconferencing system designed to provide collaborative workers the experience of face-to-face meetings from their desktops. Five cameras are attached to each PC display and directed at the participant. From these video streams, view synthesis methods produce arbitrary-perspective renderings of the participant and transmit them to others at interactive rates, currently about 15 frames per second. Combining these renderings in a shared synthetic environment gives the appearance of having all participants interacting in a common space. In this way, Coliseum enables users to share a virtual world, with acquired-image renderings of their appearance replacing the synthetic representations provided by more conventional avatar-populated virtual worlds. The system supports virtual mobility---participants may move around the shared space---and reciprocal gaze, and has been demonstrated in collaborative sessions of up to ten Coliseum workstations, and sessions spanning two continents.Coliseum is a complex software system which pushes commodity computing resources to the limit. We set out to measure the different aspects of resource, network, CPU, memory, and disk usage to uncover the bottlenecks and guide enhancement and control of system performance. Latency is a key component of Quality of Experience for video conferencing. We present how each aspect of the system---cameras, image processing, networking, and display---contributes to total latency. Performance measurement is as complex as the system to which it is applied. We describe several techniques to estimate performance through direct light-weight instrumentation as well as use of realistic end-to-end measures that mimic actual user experience. We describe the various techniques and how they can be used to improve system performance for Coliseum and other network applications. This article summarizes the Coliseum technology and reports on issues related to its performance---its measurement, enhancement, and control.
Fun-sort--or the chaos of unordered binary search
Authors: Therese Biedl, Timothy Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai Golin, James A. King, J. Ian Munro
Venue: Discrete Applied Mathematics (2004)

Usually, binary search only makes sense in sorted arrays. We show that insertion sort based on repeated "binary searches" in an initially unsorted array also sorts n elements in time Θ(n2 log n). If n is a power of two, then the expected termination point of a binary search in a random permutation of n elements is exactly the cell where the element should be if the array was sorted. We further show that we can sort in expected time Θ(n2 log n) by always picking two random cells and swapping their contents if they are not ordered correctly.