ppxscal/embedding_network huggingface dataset:
Beyond Pairwise Clustering
Authors: Sameer Agarwal, Jongwoo Lim, Lihi Zelnik-Manor, Pietro Perona, David Kriegman, Serge Belongie
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the hypergraph partitioning problem. We propose a two-step algorithm for solving this problem. In the first step we use a novel scheme to approximate the hypergraph using a weighted graph. In the second step a spectral partitioning algorithm is used to partition the vertices of this graph. The algorithm is capable of handling hyperedges of all orders including order two, thus incorporating information of all orders simultaneously. We present a theoretical analysis that relates our algorithm to an existing hypergraph partitioning algorithm and explain the reasons for its superior performance. We report the performance of our algorithm on a variety of computer vision problems and compare it to several existing hypergraph partitioning algorithms.
On step control criteria
Authors: J. C. Butcher
Venue: ACM SIGNUM Newsletter (1973)

Programs for the numerical solution of ordinary differential equations generally use one of two alternative criteria for step size control, these are, the error per step criterion and the error per unit step criterion. The purpose of this note is to present a trivial example which illustrates an argument favouring the error per unit step criterion.
Numerical simulation of high Schmidt number flow over a droplet by using moving unstructured mesh
Authors: Rho-Taek Jung, Toru Sato
Venue: Journal of Computational Physics (2005)

A direct numerical simulation code for flow over a droplet, which rises freely, deforms in shape, and dissolves into a continuous phase, was developed. A two-phase flow field was discretised by a cell-centred arbitrary Lagrangian-Eulerian finite volume formulation by using three-dimensional hybrid unstructured meshes, which consist of triangular prisms near interface for the resolution of viscous boundary layer and tetrahedrons in the other part. Since mass boundary layer is much thinner than that of momentum for high Schmidt number problems, very-thin-layer cells are generated within one layer of the prisms attached to the interface only for solving mass transfer. This can be claimed as a novelty of the present simulation method. From the simulation results, the mechanisms of shape deformation and/or oscillation, trajectory morphology, and vortex shedding are elucidated and correlated to mass transfer at moderately high Reynolds number.
Comparison of numerical solutions for Q2 evolution equations
Authors: S. Kumano, T.-H. Nagai
Venue: Journal of Computational Physics (2004)

Q2 evolution equations are important not only for describing hadron reactions in accelerator experiments but also for investigating ultrahigh-energy cosmic rays. The standard ones are called DGLAP evolution equations, which are integrodifferential equations. There are methods for solving the Q2 evolution equations for parton-distribution and fragmentation functions. Because the equations cannot be solved analytically, various methods have been developed for the numerical solution. We compare brute-force, Laguerre-polynomial, and Mellin-transformation methods particularly by focusing on the numerical accuracy and computational efficiency. An efficient solution could be used, for example, in the studies of a top-down scenario for the ultrahigh-energy cosmic rays.
GRAPE - An Industrial Distributed System for Computer Vision
Authors: David Minor, Shmuel Rippa
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 4 - Volume 05 (2005)

GRAPE (Graph Processing Environment) is an industrial distributed computer vision system currently in use in Orbotech's Automated Optical Inspection (AOI) machines. These machines are designed for the automatic detection of defects in Flat Panel Displays (FPD), Printed Circuit Boards (PCB) and Ball Grid Arrays (BGA). The GRAPE system is designed to be easy to use for algorithm and systems engineers with little or no special training in parallel or distributed systems. Algorithms are written in standard C++ and joined together in a visual dataflow graph. The user then partitions the graph into "contexts" which are used by the system to automatically parallelize the computation. The underlying execution model of GRAPE is based on a large-grained dynamic data-flow paradigm. In contrast to traditional dataflow engines GRAPE algorithms can hold "state" over multiple executions while also making use of data parallelism. This is useful for computer vision applications, which typically need to assemble and process data collected over many execution cycles. In this paper we present an overview of the GRAPE system with its context oriented parallelism and synchronization.
Orientation in Manhattan: Equiprojective Classes and Sequential Estimation
Authors: Andre T. Martins Pedro M. Q. Aguiar, Mario A. T. Figueiredo
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2005)

The problem of inferring 3D orientation of a camera from video sequences has been mostly addressed by first computing correspondences of image features. This intermediate step is now seen as the main bottleneck of those approaches. In this paper, we propose a new 3D orientation estimation method for urban (indoor and outdoor) environments, which avoids correspondences between frames. The scene property exploited by our method is that many edges are oriented along three orthogonal directions; this is the recently introduced Manhattan world (MW) assumption. The main contributions of this paper are: the definition of equivalence classes of equiprojective orientations, the introduction of a new small rotation model, formalizing the fact that the camera moves smoothly, and the decoupling of elevation and twist angle estimation from that of the compass angle. We build a probabilistic sequential orientation estimation method, based on an MW likelihood model, with the above-listed contributions allowing a drastic reduction of the search space for each orientation estimate. We demonstrate the performance of our method using real video sequences.
Rendering natural waters taking fluorescence into account: Research Articles
Authors: By E. Cerezo, F. J. Seron
Venue: Computer Animation and Virtual Worlds (2004)

The aim of the work presented here is to generalize a system, developed to treat general participating media, to make it capable of considering volumetric inelastic processes such as fluorescence. Our system, based on the discrete ordinates method, is adequate to treat a complex participating medium such as natural waters as it is prepared to deal with not only anisotropic but also highly peaked phase functions, as well as to consider the spectral behaviour of the medium's characteristic parameters. It is also able to generate detailed quantitative illumination information, such as the amount of light that reaches the medium boundaries or the amount of light absorbed in each of the medium voxels. First, we present an extended form of the radiative transfer equation to incorporate inelastic volumetric phenomena. Then, we discuss the necessary changes in the general calculation scheme to include inelastic scattering. We have applied all this to consider the most common inelastic effect in natural waters: fluorescence in chlorophyll-a. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Location-dependent queries evaluation in mobile networks
Authors: Marie Thilliez, Thierry Delot
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

The recent emergence of handheld devices and wireless networks implies an exp onential increase in the number of terminals users. Given this increase, today's service providers have to propose new location-aware applications based on users mobility. We particularly focus on applications based on communication areas. These areas are formed by juxtaposition of several wireless and/or mobile networks and allow the users of handheld devices, physically close to each other, to communicate and exchange data. In this mobile and dynamic environment, the current localization services are not well suited, thus, we have proposed ISLANDS. The localization service ISLANDS provides an evaluation model which allows, in particular, the evaluation of location dependent queries such as "which is the closest theater to me ?". In this paper, we describe the proposed solutions to allow the expression and the evaluation of this type of queries. And, we detail more particularly the evaluation of these solutions.
So Where's the Computation Superhighway?
Authors: Olivier Marin
Venue: IEEE Distributed Systems Online (2005)

What we're arriving at is a planetary proliferation of networked equipment surrounding us that can run programs cooperatively. Starting from this conception, and putting aside a few technicalities for a jiffy, the WWW appears to be an unlimited pool of computing resources.
Impact of offshore outsourcing on CS/IS curricula
Authors: Ernest Ferguson
Venue: Journal of Computing Sciences in Colleges (2004)

Reflection on the year 2003, historians might refer to the offshore outsourcing of information technology jobs as the megatrend of the year. As the IT industry matures, software is coming to be viewed as a commodity and computing as a utility. With custom software failing to deliver strategic advantage, the industry is rushing to seek the lowest labor costs for implementation, maintenance, support, and operations. This paper explores possible changes to computer science and information systems curriculum as a result of the outsourcing phenomenon.
Algorithms for DMA communications
Authors: Alexander P. Kemalov
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

A Direct Memory Access /DMA/ is previously used to transfer data between the main memory of host computer /PC/ and the network &rarr; to another one PC. This method is used to free the processor from the burden of transfer operations. DMA procedures commonly are initiated by the operating system kernel to separate one application and its data with another.A cluster of PCs architecture suggests that interconnections get faster and overhead and latency in networks go down while operating system operations get slower. In clusters these factors are very important because an intensive data transfer between hosts. These trends imply that DMA operation becomes slower /using operating system kernel/, compared to interconnection network. The important aspect here is ability to transfer data directly between the network interface and application buffers. Such direct data path requires the network interface "to know" the virtual-to-physical address translation of a user buffer.This paper proposes several algorithms that allow applications to start DMA operation without OS kernel. The algorithms allow user-level applications to have direct access to the DMA engine and TLB library. This approach is achieved without requiring changes to the OS kernel. Using our algorithms, DMA operation can be initiated faster /in comparison to OS kernel/.
Improving Goal and Role Oriented Analysis for Agent Based Systems
Authors: Pei Pei Kuan, Shanika Rarunasekera, Leon Sterling
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

The separation between analysis and design phases has long been advocated in software engineering literature. There has been active interest in the the area of agentoriented software engineering but the methodologies developed do not focus on a clear separation between the two phases. Furthermore, existing agent oriented methodologies tend to be tied to a particular design architecture and applicable onlyfor small systems. In this paper, we describe a goal and role based analysis methodology that is both unbiased towards any design architecture and is scalable. The model is derived from improvements to the ROADMAP methodology for agent oriented systems developed at the University Melbourne. We also present REBEL - a CASE tool developed to support the methodology. Furthermore, several examples and experiences with the method are discussed Weconclude by comparing analysis models of other agent oriented methodologies to ours.
Spatial associative classification at different levels of granularity: a probabilistic approach
Authors: Michelangelo Ceci, Annalisa Appice, Donato Malerba
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

In this paper we propose a novel spatial associative classifier method based on a multi-relational approach that takes spatial relations into account. Classification is driven by spatial association rules discovered at multiple granularity levels. Classification is probabilistic and is based on an extension of naive Bayes classifiers to multi- relational data. The method is implemented in a Data Mining system tightly integrated with an object relational spatial database. It performs the classification at different granularity levels and takes advantage from domain specific knowledge in form of rules that support qualitative spatial reasoning. An application to real-world spatial data is reported. Results show that the use of different levels of granularity is beneficial.
Brains, Bodies, and Beyond: Competitive Co-Evolution of Robot Controllers, Morphologies and Environments
Authors: Gunnar Buason, Nicklas Bergfeldt, Tom Ziemke
Venue: Genetic Programming and Evolvable Machines (2005)

This paper presents a series of simulation experiments that incrementally extend previous work on neural robot controllers in a predator-prey scenario, in particular the work of Floreano and Nolfi, and integrates it with ideas from work on the `co-evolution' of robot morphologies and control systems. The aim of these experiments has been to further systematically investigate the tradeoffs and interdependencies between morphological parameters and behavioral strategies through a series of predator-prey experiments in which increasingly many aspects are subject to self-organization through competitive co-evolution. Motivated by the fact that, despite the emphasis of the interdependence of brain, body and environment in much recent research, the environment has actually received relatively little attention, the last set of experiments lets robots/species actively adapt their environments to their own needs, rather than just adapting themselves to a given environment.
Design of Array Stimulators for Synthetic Tactile Sensations
Authors: Ian R. Summers, Alan C. Brady, M. K. Syed, Craig M. Chanter
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

We have produced a 100-contactor array on the fingertip to provide passive stimulation, and a25-contactor array on the fingertip which allows active exploration in 2D. This paper discusses various aspects of the design of such devices.
An E-learning tool for Database Administration
Authors: Paul Douglas, Steve Barker
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

In this paper, we describe an item of "intelligent" educational software that is intended to help students taking university computer science courses to understand the fundamentals of transaction scheduling. The software, implemented in PROLOG, empowers students to construct their own learning environment and is able to provide tailored forms of feedback to different types of learner. We describe the development and evaluation of the software, and we present details of the analysis of the results of our investigation into the effectiveness of the software as a teaching and learning tool. Our results suggest that our learning tool provides students with a different and valuable type of learning experience, which traditional methods do not provide.
Dynamic Reconfiguration in Computer Clusters with Irregular Topologies in the Presence of Multiple Node and Link Failures
Authors: Dimiter Avresky
Venue: IEEE Transactions on Computers (2005)

Component failures in high-speed computer networks can result in significant topological changes. In such cases, a network reconfiguration algorithm must be executed to restore the connectivity between the network nodes. Most contemporary networks use either static reconfiguration algorithms or stop the user traffic in order to prevent cyclic dependencies in the routing tables. The goal of this paper is to present NetRec, a dynamic network reconfiguration algorithm for tolerating multiple node and link failures in high-speed networks with arbitrary topology. The algorithm updates the routing tables asynchronously and does not require any global knowledge about the network topology. Certain phases of NetRec are executed in parallel, which reduces the reconfiguration time. The algorithm suspends the application traffic in small regions of the network only while the routing tables are being updated. The message complexity of NetRec is analyzed and the termination, liveness, and safety of the proposed algorithm are proven. Additionally, results from validation of the algorithm in a distributed network-validation testbed Distant, based on the MPI 1.2 features for building arbitrary virtual topologies, are presented.
Schedulers and redundancy for a class of constraint propagation rules
Authors: Sebastian Brand, Krzysztof R. Apt
Venue: Theory and Practice of Logic Programming (2005)

We study here schedulers for a class of rules that naturally arise in the context of rule-based constraint programming. We systematically derive a scheduler for them from a generic iteration algorithm of Apt (2000). We apply this study to so-called membership rules of Apt and Monfroy (2001). This leads to an implementation that yields a considerably better performance for these rules than their execution as standard CHR rules. Finally, we show how redundant rules can be identified and how appropriately reduced sets of rules can be computed.
Information superhighway: a one-way road
Authors: Hristo Tuzharov, Chavdar Marchev
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The paper makes an attempt to specify the basic tendencies in the building of the information superhighway. Some important contemporary technologies have been considered. In our opinion they will play a significant role in the Common Information Space.
Vertical ray shooting for fat objects
Authors: Mark de Berg
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

We describe a data structure for vertical ray shooting in a set of n convex fat polyhedra of constant complexity in 3-space. The structure has O(log2 n) query time, and it uses O(n log3 n(log log n)2) storage. It can also be used for fat objects with curved boundaries, at the cost of a small increase in storage.
Cloth Representation by Shape from Shading with Shading Primitives
Authors: Feng Han, Song-Chun Zhu
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Cloth is a complex visual pattern with flexible 3D shape and illumination variations. Computing the 3D shape of cloth from a single image is of great interest to both computer graphics and vision researches. However, the acquisition of 3D cloth shape by Shape from Shading (SFS) is still a challenge. In this paper, we present a two-layer generative model for representing both the 2D cloth image and the 3D cloth surface. The first layer represents all the folds on cloth, which are called "shading primitives" in [4], and thus captures the overall "skeleton structures" of cloth. We learn a number of typical 3D fold primitives using some training images obtained through photometric stereo. The 3D fold primitives yield a dictionary of 2D shading primitives for cloth images. The second layer represents non-fold parts with very smooth (often flat) surface or shading, which interpolates the primitives in the first layer with a smoothness prior like conventional SFS. Then we present an algorithm called "cloth sketching" to find all the shading primitives on cloth image and simultaneously recover their 3D shape by fitting to the 3D fold primitives. Our sketch representation can be viewed as a 2-layer Markov random field (MRF), and it introduces some prior knowledge on the folds and has lower dimension and is more robust than the traditional shape-from-shading representation which assumes a MRF model on pixels. We show a number of experiments with satisfactory results in comparison to previous work.
Solving Three-Dimensional Transport Models with Synchronous and Asynchronous Iterative Algorithms in a Grid Computing Environment
Authors: Jacques M. Bahi, Raphael Couturier, Michel Salomon
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14 (2005)

In this paper we study the development of parallel algorithms to solve advection-diffusion equations. Both synchronous and asynchronous algorithms contexts are considered. The solver we present is based on the multisplitting Newton method that provides a coarse-grained scheme. Experiments are carried out in an heterogeneous grid environment in which both parallel algorithms are analyzed. Experiments allow us to draw some conclusions about the use of parallel iterative algorithms in a grid computing environment.
Interactome data and databases: different types of protein interaction: Conference Reviews
Authors: Javier De Las Rivas, Alberto de Luis
Venue: Comparative and Functional Genomics (2004)

In recent years, the biomolecular sciences have been driven forward by overwhelming advances in new biotechnological high-throughput experimental methods and bioinformatic genome-wide computational methods. Such breakthroughs are producing huge amounts of new data that need to be carefully analysed to obtain correct and useful scientific knowledge. One of the fields where this advance has become more intense is the study of the network of &lsquo;protein&ndash;protein interactions&rsquo;, i.e. the &lsquo;interactome&rsquo;. In this short review we comment on the main data and databases produced in this field in last 5 years. We also present a rationalized scheme of biological definitions that will be useful for a better understanding and interpretation of &lsquo;what a protein&ndash;protein interaction is&rsquo; and &lsquo;which types of protein&ndash;protein interactions are found in a living cell&rsquo;. Finally, we comment on some assignments of interactome data to defined types of protein interaction and we present a new bioinformatic tool called APIN (Agile Protein Interaction Network browser), which is in development and will be applied to browsing protein interaction databases. Copyright &copy; 2004 John Wiley & Sons, Ltd.
A comparison of LSA, wordNet and PMI-IR for predicting user click behavior
Authors: Ishwinder Kaur, Anthony J. Hornof
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

A predictive tool to simulate human visual search behavior would help interface designers inform and validate their design. Such a tool would benefit from a semantic component that would help predict search behavior even in the absence of exact textual matches between goal and target. This paper discusses a comparison of three semantic systems-LSA, WordNet and PMI-IR-to evaluate their performance in predicting the link that people would select given an information goal and a webpage. PMI-IR best predicted human performance as observed in a user study.