ppxscal/embedding_network huggingface dataset:
Efficient Nearest Neighbor Classification Using a Cascade of Approximate Similarity Measures
Authors: Vassilis Athitsos, Jonathan Alon, Stan Sclaroff
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

This paper proposes a method for efficient nearest neighbor classification in non-Euclidean spaces with computationally expensive similarity/distance measures. Efficient approximations of such measures are obtained using the BoostMap algorithm, which produces embeddings into a real vector space. A modification to the BoostMap algorithm is proposed, which uses an optimization cost that is more appropriate when our goal is classification accuracy as opposed to nearest neighbor retrieval accuracy. Using the modified algorithm, multiple approximate nearest neighbor classifiers are obtained, that provide a wide range of trade-offs between accuracy and efficiency. The approximations are automatically combined to form a cascade classifier, which applies the slower and more accurate approximations only to the hardest cases. The proposed method is experimentally evaluated in the domain of handwritten digit recognition using shape context matching. Results on theMNIST database indicate that a speed-up of two to three orders of magnitude is gained over brute force search, with minimal losses in classification accuracy.
The microstructure of CVD diamond for high-density thermal inkjet
Authors: S. S. Baek, B. Choi, Y. Oh
Venue: Microsystem Technologies (2005)

The microstructure for high-density thermal inkjet (TIJ) is proposed to overcome the defect due to the limit of the nozzle density in conventional TIJs. To bring high-density TIJ, the heat transfer of diamonds by means of placing heaters on sidewall of ink inlet is used in order to minimize the area occupied by the heaters. In addition, manifold, inlet, pressure chamber and nozzle concerning the flow of ink are placed in-line. To demonstrate feasibility, TIJ for bubble visualization test is designed and fabricated. Diamond is deposited on the sidewall of inlet with Hot Filament CVD (HFCVD). The trench filling method and the side deposition method are executed for the vertical sidewall of diamond. To solve the problem for direct CVD deposition on Pt layer, Ta film is utilized as a passivation layer in the fabrication processing. The generated bubble confirms the possibility of the bubble formation by heat transfer of diamond.
Ergodic Quantum Computing
Authors: Dominik Janzing, Pawel Wocjan
Venue: Quantum Information Processing (2005)

We propose a (theoretical) model for quantum computation where the result can be read out from the time average of the Hamiltonian dynamics of a 2-dimensional crystal on a cylinder.The Hamiltonian is a spatially local interaction among Wigner--Seitz cells containing six qubits. The quantum circuit that is simulated is specified by the initialization of program qubits. As in Margolus' Hamiltonian cellular automaton (implementing classical circuits), a propagating wave in a clock register controls asynchronously the application of the gates. However, in our approach all required initializations are basis states. After a while the synchronizing wave is essentially spread around the whole crystal. The circuit is designed such that the result is available with probability about 1/4 despite of the completely undefined computation step. This model reduces quantum computing to preparing basis states for some qubits, waiting, and measuring in the computational basis. Even though it may be unlikely to find our specific Hamiltonian in real solids, it is possible that also more natural interactions allow ergodic quantum computing.
Adaptive Collaboration in Peer-to-Peer Systems
Authors: Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark Tuttle
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

We consider a simple model for reputation systems such as the one used by eBay. In our model there are n players, some of which may exhibit arbitrarily malicious (Byzantine) behavior, and there are m objects, some of which are bad. The goal of the honest players is to find a good object. To facilitate collaboration, the system maintains a shared billboard. A basic step of a player consists of consulting the billboard, probing an object to learn its true value, and posting the result on the billboard for the benefit of others. Probing an object incurs a unit cost to the player, and consulting the billboard is free. The dilemma of an honest player is how to balance between the desire to reduce its cost by taking advantage of the reports posted by honest peers, and the fear of being exploited by adopting reports posted by malicious players. In prior work, we presented an algorithm solving this problem in an asynchronous model, and we analyzed the total cost of the probes made by honest players during the algorithm. In this paper, we focus on the individual cost, and we consider a synchronous model in which each player takes a step in each round. Our prior algorithm has individual cost 0(\frac{1}{\alpha }\log n) in this model, assuming that an \alphafraction of players are honest. In this paper, we prove that no algorithm can guarantee individual cost of less than \Omega (\frac{1}{\alpha }), which is essentially constant if there are enough honest players. Our main result is a new algorithm that achieves O(1) individual cost when there are many honest players, and achieves individual cost 0(\frac{1}{\alpha }\frac{{\log n}}{{\log \log n}}) even when there are not. We also show that this algorithm generalizes to other interesting scenarios.
Adaptive grid refinement for a model of two confined and interacting atoms
Authors: William F. Mitchell, Eite Tiesinga
Venue: Applied Numerical Mathematics (2005)

We have applied adaptive grid refinement to solve a two-dimensional Schrödinger equation in order to study the feasibility of a quantum computer based on extremely-cold neutral alkali-metal atoms. Qubits are implemented as motional states of an atom trapped in a single well of an optical lattice of counter-propagating laser beams. Quantum gates are constructed by bringing two atoms together in a single well leaving the interaction between the atoms to cause entanglement. For special geometries of the optical lattices and thus shape of the wells, quantifying the entanglement reduces to solving for selected eigenfunctions of a Schrödinger equation that contains a two-dimensional Laplacian, a trapping potential that describes the optical well, and a short-ranged interaction potential. The desired eigenfunctions correspond to eigenvalues that are deep in the interior of the spectrum where the trapping potential becomes significant. The spatial range of the interaction potential is three orders of magnitude smaller than the spatial range of the trapping potential, necessitating the use of adaptive grid refinement.
Fractal architecture for the adaptive complex enterprise
Authors: Jay Ramanathan
Venue: Communications of the ACM (2005)

Today's businesses must continuously adapt to external conditions in accelerated time frames. This requires businesses to shift from strategies that eliminate variation to those that embrace variation and changing conditions. Industrial-age Make-Sell businesses accomplished objectives by steadily eliminating variation. In contrast, today's sense-and-respond (S-R) businesses must often execute by embracing variation and learn to perform given widely varying circumstances [4]. Specifically, the S-R business must adapt to external conditions by managing along the chain: "Sense changing opportunities&rarr;Request variation&rarr;Product variation&rarr;Response process variation&rarr;Resource variation and Information variation&rarr;Efficient delivery and feedback&rarr;Business growth and survival." (Here, the implication symbol "&rarr;" reflects cause and effect.) Recognizing that IT holds the promise of enabling the S-R enterprise, transformation is often accompanied by enterprise integration projects but with limited success. Project experiences spanning the past 10 years suggest that IT must first meet key challenges.
Feature Recognition in Solar Images
Authors: Valentina Zharkova, Stanley Ipson, Ali Benkhalil, Sergei Zharkov
Venue: Artificial Intelligence Review (2005)

Despite several decades of research and development in the field of pattern recognition, the general problem of recognizing complex patterns with arbitrary orientations, locations, and scales remains unsolved and normally is applied using iterative manual evaluation of the detection results. This problem is becoming increasingly important with the growing number of massive archives of solar images produced by instruments located at ground-based observatories and aboard current satellites such as YOHKOH, SOHO and TRACE, with future satellites such as SOLAR B, SDO and STEREO in prospect. The size of expected archives requires a new automated approach to digital image processing and data extraction with robust and efficient pattern recognition techniques to be developed and implemented. This review evaluates techniques for the standardisation in shape and intensity of solar images and summarises the existing manual and semi-automated feature recognition techniques applied to a representative range of solar features, including sunspots, filaments, active regions, flares, coronal mass ejections and magnetic neutral lines. The review also surveys the most recent fully-automated detection techniques developed for the creation of Solar Feature Catalogues of sunspots, active regions and filaments for the European Grid of Solar Observations. The survey is aimed to help researchers and students to learn about the recognition techniques applied to astrophysical images with different levels of noise and distortions and to work effectively with the Solar Feature Catalogue.
Space-Time Invariants for Recognizing 3D Motions from Arbitrary Viewpoints under Perspective Projection
Authors: Ying Piao, Kazutaka Hayakawa, Jun Sato
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

The visual motions are very important for understanding dynamic actions and for extracting dymanic events from video sequences. Recently, it was shown that some invariants on motions can be extracted from sequential images and these can be applied for recognizing motions from images viewed from arbitrary viewpoints. Unfortunately, invariants were limited for planar motions viewed from affine cameras. In this paper, we propose a method for computing invariants on non-planar motions viewed from perspective cameras. The extracted invariants are applied for distinguishing 3D motions from video sequences viewed from arbitrary viewpoints.
Topology Reconfiguration Mechanism for Traffic Engineering in WDM Optical Network
Authors: Badar Gillani, Robert D. Kent, Akshai K. Aggarwal
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

Optical Wavelength Division Multiplexed (WDM) networks provide an excellent transmission medium for voice and data traffic, streaming media, and high performance and grid computing needs. Rearrangeability is one compelling characteristic of WDM Optical networks that allows network operators to rearrange the networks in response to changing traffic demands and element failures to provide improved network performance. Under changing traffic flows and abhorrent network conditions reconfiguration is an ongoing process. Available approaches are not able to handle extreme load conditions, traffic bursts, and element failures and, so far, these approaches cover only limited aspects of the problem of automated reconfiguration. In this work we present an Adaptive Reconfiguration mechanism for WDM Optical Networks (ARWON). Two heuristically based algorithms, Combination algorithm (CA) and Multi LightPath Change (MLPC) algorithm, are also proposed to support implementation of ARWON. Simulation experiments covered all ranges of traffic flows and element failure scenario and performance of ARWON was validated with an established contemporary reconfiguration algorithm. Results show that under all loading conditions and link failure scenario ARWON performed better than the comparison algorithm. Under extreme loading conditions ARWON incurred 11 times less traffic loss than Single LightPath Change (SLPC) algorithm and on average SLPC was carrying 20 more lightpaths than ARWON, per observation cycle, that were 100 percent loaded. Under link failure scenario ARWON recovered faster and rerouted the traffic in one step, whereas SLPC recovered slowly and recovery took much longer duration than ARWON. For other loading conditions, ranging from low to high loading, it was observed that during early stages of simulation ARWON performs at par or marginally better than SLPC. Performance of ARWON steadily improves as simulation progresses over longer duration.
A probabilistic scheme of independent random elements distributed over a finite lattice. II. The method of lattice moments
Authors: A. N. Alekseichuk
Venue: Cybernetics and Systems Analysis (2005)

A new method is proposed for proving some theorems on the convergence of sequences of random quantities ¿ n that assume values in a set {0,1,...,n} to discrete probability distributions. The method is based on the investigation of definite numerical characteristics (called lattice moments) of asymptotic behavior of distributions of ¿ n and is illustrated by the examples of investigating the asymptotic behavior of the probability distribution of the solution space dimension of a system of independent random homogeneous linear equations over a finite field and that of the number of connected components of a random (unequiprobable) hypergraph with independent hyperedges.
Indexing with Unknown Illumination and Pose
Authors: Ira Kemelmacher, Ronen Basri
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

The task of identifying 3D objects in 2D images isdifficult due to variation in objectsý appearance with changes in pose and lighting. The task is further complicated by the presence of occlusion and clutter. Shape indexing is a method for rapid association between features identified in an image and their corresponding 3D features stored in a database. Previous indexing methods ignored variations due to lighting, restricting the approach to polyhedral objects. In this paper, we further develop these methods to handle variations in both pose and lighting. We focus on rigid objects undergoing a scaled-orthographic projection and use spherical harmonics to represent lighting. The resulting integrated algorithm can recognize 3D objects from a single input image; furthermore, it recovers the pose and lighting of each familiar object in the given image. The algorithm has been tested on a database of real objects, demonstrating its performance on cluttered scenes under a variety of poses and illumination conditions.
Approximation by B-spline convolution operators: a probabilistic approach
Authors: J. A. Adell, C. Sangüesa
Venue: Journal of Computational and Applied Mathematics (2005)

This paper is concerned with the approximation properties of convolution operators with respect to univariate B-splines. For such operators, we give rates of uniform convergence in terms of the usual second modulus of smoothness at a length which depends on the distances between the knots and their multiplicity. A reasonable balance between the degree of accuracy in the approximation and the degree of differentiability of the approximants is achieved by considering Steklov operators (built up from B-splines with equidistant simple knots), for which strong converse inequalities are given. Applications to simultaneous approximation and divided difference expansions, and to estimate the infinite time ruin probabilities in a context of risk theory are also provided. We use a probabilistic approach in the spirit of Karlin et al. (J. Multivariate Anal. 20 (1986) 69) and Ignatov and Kaishev (Serdica 15 (1989) 91) based on the representation of B-splines as the probability densities of linear combinations of uniform order statistics.
A TEXT COMPREHENSION MODEL OF HYPERTEXT: A THEORY BASED APPROACH TO DESIGN AND EVALUATION
Authors: Peter W. Foltz
Venue: ACM SIGCHI Bulletin (1991)

Hypertext presents a way to present text to readers that differs greatly from linear text. When text is presented linearly, there is a single order to read the text. However, in hypertext, information is represented in more of a semantic network and a reader may choose a path through the text that will be most relevant to his or her interests. While this permits added flexibility, it is not clear whether this flexibility is always an advantage to the reader. There have been strong claims of the superiority of hypertext over linear text, but research has often shown advantages for linear text over hypertext. Thus, it is not clear how, and with what features, a hypertext may be properly written.
A Numerical Scheme for the Curvature Equation Near the Singularities
Authors: Marcos Craizer, Sinésio Pesco, Ralph Teixeira
Venue: Journal of Mathematical Imaging and Vision (2005)

In this paper we propose a modification in the usual numerical method for computing the solutions of the curvature equation in the plane . This modification takes place near the singularities of the image. We propose to use zero as the vertical speed at a saddle point and, at an extremum, the geometric mean of the eigenvalues of the Hessian matrix. This modification is theoretically justified and the preliminary experimental results show that it makes the algorithm more reliable.
Intra-Class Variation, Affine Transformation and Background Clutter: Towards Robust Image Matching
Authors: Lixin Fan
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Image matching is a fundamental computer vision problem including many scenarios, such as varying view scene matching, feature selection and registration, object recognition, and general object class matching. This article presents an unified framework and working algorithm for these different matching scenarios. The proposed feature-based image matching method demonstrates excellent robustness to significant geometrical transformation, intra-class variation and background clutter which are usually presented in different matching scenarios.
Controls Insensitizing the Observation of a Quasi-geostrophic Ocean Model
Authors: Enrique Fernández-Cara, Galina C. Garcia, Axel Osses
Venue: SIAM Journal on Control and Optimization (2005)

We consider a linear quasi-geostrophic ocean model with partially known initial conditions. We search for controls that make the observation locally insensitive to the perturbations of the initial data. Their existence is equivalent to the null controllability property for an associated cascade Stokes-like system. Thanks to the presence of the Coriolis term, we are able to prove the existence of such controls. Our strategy is the following. First, we prove a unique continuation property for the adjoint of the state system that leads to approximate controllability; then, under certain assumptions, an observability inequality is established for the adjoint. The proof is inspired by the arguments leading to the unique continuation property. This inequality leads to the desired null controllability result.
Non-Visual Feedback Cues for Pen Computing
Authors: Selina Sharmin, Grigori Evreinov, Roope Raisamo
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

The aim of this work is to present a novel stylus with embedded vibro-tactile actuator and an empirical pilot study on non-visual feedback cues, tactile and sound, used when a graphical trail is inspected. The study showed that tactile feedback took less time than sound feedback to complete the task. In addition, participants preferred tactile feedback to sound during blind inspection of a trail. These results can be used for further development of novel diagrammatic tools and pen-based input techniques especially for physically challenged users.
What's the web like if you can't see it?
Authors: Chieko Asakawa
Venue: Proceedings of the 2005 International Cross-Disciplinary Workshop on Web Accessibility (W4A) (2005)

Awareness of Web accessibility is spreading all over the world among Web designers and developers, due to regulations such as the US law called Section 508 and guidelines like the W3C WCAG. We now see various Web accessibility adaptations on the Web. For example, we see increasing use of alternative texts for images and skip-navigation links for speed.However, we sometimes find inappropriate ALT texts and broken skip-navigation links, even though they are present. These pages may be compliant, but they are not accessible or really usable. We analyzed such problems and found that some sites only try to comply with regulations and guidelines, but without understanding the needs underlying Web accessibility. We concluded that Web designers and developers should experience the real problems faced by people with disabilities so they can create truly accessible and usable pages. There was no practical way for them to experience disabilities.In this paper, after giving an overview of the historical progress of voice browsers, we discuss how much and how well the Web accessibility has progressed by analyzing real world improvements to existing sites. We then describe why the "disability experience" helps give a better understanding of the Web accessibility guidelines and regulations. Some tools like Home Page Reader and aDesigner are available to let designers experience blind users' perspective of usability. Finally, we discuss the future direction of our accessibility efforts.
A model of context-dependent association using selective desensitization of nonmonotonic neural elements
Authors: Masahiko Morita, Kouhei Matsuzawa, Shigemitsu Morokami
Venue: Systems and Computers in Japan (2005)

In neural networks based on a distributed information representation, when different patterns are to be recalled from the same input by association depending on the context, the usual method is to concatenate the pattern representing the context with the input pattern. However, there is a serious problem in this approach, and strong constraints are imposed on the number of inputs and the number of context patterns. This paper tries to apply a different method of contextual modification to nonmonotonic neural networks in order to construct a context-dependent associative model that can solve the longstanding problem. In the proposed model, the number of associations that can be learned increases almost in proportion to the number of elements, regardless of the numbers of the input and context patterns. In addition, the state transitions among attractors can be controlled flexibly by switching the context, which enables the model to simulate the behavior of any finite automaton without inducing an explosive increase in the number of elements or the training time. The model also has a high generalization power ability based on fully distributed representations and has potential for overcoming the limitations of conventional symbol processing. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(7): 73&ndash;83, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10477
Inverse spherical surfaces
Authors: G. Casciola, S. Morigi
Venue: Journal of Computational and Applied Mathematics (2005)

In this paper we describe a new way to design rational parametric surfaces defined on spherical triangles which are useful for modelling in a spherical environment. These surfaces can be seen as single-valued functions in spherical coordinates.