ppxscal/embedding_network huggingface dataset:
Curious George: An attentive semantic robot
Authors: David Meger, Per-Erik Forssén, Kevin Lai, Scott Helmer, Sancho McCann, Tristram Southey, Matthew Baumann, James J. Little, David G. Lowe
Venue: Robotics and Autonomous Systems (2008)

State-of-the-art methods have recently achieved impressive performance for recognising the objects present in large databases of pre-collected images. There has been much less focus on building embodied systems that recognise objects present in the real world. This paper describes an intelligent system that attempts to perform robust object recognition in a realistic scenario, where a mobile robot moving through an environment must use the images collected from its camera directly to recognise objects. To perform successful recognition in this scenario, we have chosen a combination of techniques including a peripheral-foveal vision system, an attention system combining bottom-up visual saliency with structure from stereo, and a localisation and mapping technique. The result is a highly capable object recognition system that can be easily trained to locate the objects of interest in an environment, and subsequently build a spatial-semantic map of the region. This capability has been demonstrated during the Semantic Robot Vision Challenge, and is further illustrated with a demonstration of semantic mapping. We also empirically verify that the attention system outperforms an undirected approach even with a significantly lower number of foveations.
Evaluation over thousands of queries
Authors: Ben Carterette, Virgil Pavlu, Evangelos Kanoulas, Javed A. Aslam, James Allan
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Information retrieval evaluation has typically been performed over several dozen queries, each judged to near-completeness. There has been a great deal of recent work on evaluation over much smaller judgment sets: how to select the best set of documents to judge and how to estimate evaluation measures when few judgments are available. In light of this, it should be possible to evaluate over many more queries without much more total judging effort. The Million Query Track at TREC 2007 used two document selection algorithms to acquire relevance judgments for more than 1,800 queries. We present results of the track, along with deeper analysis: investigating tradeoffs between the number of queries and number of judgments shows that, up to a point, evaluation over more queries with fewer judgments is more cost-effective and as reliable as fewer queries with more judgments. Total assessor effort can be reduced by 95% with no appreciable increase in evaluation errors.
Framework for 3D web-based visualization of HLA-compliant simulations
Authors: Regina B. Araujo, Fabio M. Iwasaki, Ednaldo B. Pizzolato, Azzedine Boukerche
Venue: Proceedings of the 13th international symposium on 3D web technology (2008)

This paper presents an open standard and Web-based framework that generates HLA-compliant simulation visualization interfaces with support to control and management functionalities. Differently from other existing approaches, our framework can provide greater flexibility for customization and deployment of 3D-visualizations of HLA-based simulations using current available implementations of X3D in different devices, from palmtops to desktops.
Exploiting Energy Saving Opportunity of Barrier Operation in MPI Programs
Authors: Wenjing Yang, Canqun Yang
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

In high performance parallel computing, energy consumption has become a more and more important problem. Under the support of the voltage scaling-available processors, reducing CPU voltage/frequency in the non-critical path is an efficient energy reduction method. This paper exploited the energy saving opportunities in MPI_Barrier operation. Through testing NPB3.2-MPI programs on 256-process cluster system, we found that the busy time of each process has the big difference each other when the cluster is connected by a 100Mbps network. We proposed two low-power methods: one is shut-down based MPI_Barrier (SDMB) and the other is dynamic voltage/frequency scaling based MPI_Barrier (DVSMB). Experimental results show that average 4.95% energy saving is obtained through SDMB and average 12.28% energy saving is obtained through DVSMB. SDMB avoids the performance loss through pre-activation strategy and the performance loss of DVSMB is less than 1%.
Three-dimensional modeling of curved structures containing and/or submerged in fluid
Authors: M. Esmailzadeh, A. A. Lakis, M. Thomas, L. Marcouiller
Venue: Finite Elements in Analysis and Design (2008)

The dynamic behavior of a 3D thin flexible structure in inviscid incompressible stationary fluid is studied numerically. A finite element is developed using a combination of classical thin plate theory and finite element analysis, in which the finite elements are rectangular four-noded flat shell with five degrees of freedom per node. The displacement functions are derived from Sanders' thin shell equations. The velocity potential function and Bernoulli's equation for liquid yield an expression for fluid pressure as a function of nodal displacement of the element and inertial force of the quiescent fluid. An analytical integration of the fluid pressure over the element produces the virtual added-mass matrix of fluid. Calculations are presented to illustrate the dynamic behavior of a rectangular reservoir containing fluid as well as a completely submerged blade.
Finitely Bounded Effective Computability
Authors: Xizhong Zheng
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

One of the most important property of the computability is the certainty. For example a set of natural numbers is computable if there is a Turing machine which decides certainly if a given natural number belongs to the set or not, and no wrong answers are tolerant. On the other hand, the finitely bounded computability discussed in this paper allows finitely many mistakes which can be eventually corrected during an effective procedure. We will show especially that the class of finitely bounded computable real numbers has very interesting properties, and it is a real closed field containing even properly in the class of d-c.e. real numbers.
Encoding First Order Proofs in SMT
Authors: Jeremy Bongio, Cyrus Katrak, Hai Lin, Christopher Lynch, Ralph Eric McGregor
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

We present a method for encoding first order proofs in SMT. Our implementation, called ChewTPTP-SMT, transforms a set of first order clauses into a propositional encoding (modulo theories) of the existence of a rigid first order connection tableau and the satisfiability of unification constraints, which is then fed to Yices. For the unification constraints, terms are represented as recursive datatypes, and unification constraints are equations on terms. The finiteness of the tableau is encoded by linear real arithmetic inequalities. We compare our implementation with our previous implementation ChewTPTP-SAT, encoding rigid connection tableau in SAT, and show that for Horn clauses many fewer propositional clauses are generated by ChewTPTP-SMT, and ChewTPTP-SMT is much faster than ChewTPTP-SAT. This is not the case for our non-Horn clause encoding. We explain this, and we conjecture a rule of thumb on when to use theories in encoding a problem.
Toward robust face analysis method of non-cooperative persons in stereo color image sequences
Authors: Ayoub K. Al-Hamadi, Robert Niese, Axel Panning, Bernd Michaelis
Venue: Machine Graphics Vision International Journal (2006)

This paper describes a novel method for analyzing single faces of non-cooperative persons on the basis of stereoscopic color images. The challenges arise from the fact that the persons observed are non-cooperative, which in turn complicates further processing as facial feature extraction and tracking in image sequence. In our method, face detection is based on color-driven clustering of 3D points derived from stereo. A mesh model is registered with a post-processed face cluster, using a variant of the Iterative Closest Point algorithm (ICP). The pose is derived from correspondence. Then, the pose and model information are used for face normalization and facial feature localization. Automatic extraction of facial features is carried out using modified Active Shape Models (ASM). In contrast to the simple ASM, another approach is pursued in this work. It involves two modifications to the ASM, which lead to greater stability and robustness. The results show that stereo and color are powerful cues for finding the face and its pose, and for facial feature extraction under a wide range of poses, illumination types and expressions (PIE).
Extending colorings of locally planar graphs
Authors: Michael O. Albertson, Joan P. Hutchinson
Venue: Journal of Graph Theory (2001)

Suppose G is a graph embedded in Sg with width (also known as edge width) at least 264(2g-1). If P &sube; V(G) is such that the distance between any two vertices in P is at least 16, then any 5-coloring of P extends to a 5-coloring of all of G. We present similar extension theorems for 6- and 7-chromatic toroidal graphs, for 3-colorable large-width graphs embedded on Sg with every face even-sided, and for 4-colorable large-width Eulerian triangulations. &copy; 2001 John Wiley & Sons, Inc. J Graph Theory 36: 105&ndash;116, 2001
30 seconds is not enough!: a study of operating system timer usage
Authors: Simon Peter, Andrew Baumann, Timothy Roscoe, Paul Barham, Rebecca Isaacs
Venue: Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008 (2008)

The basic system timer facilities used by applications and OS kernels for scheduling timeouts and periodic activities have remained largely unchanged for decades, while hardware architectures and application loads have changed radically. This raises concerns with CPU overhead power management and application responsiveness. In this paper we study how kernel timers are used in the Linux and Vista kernels, and the instrumentation challenges and tradeoffs inherent in conducting such a study. We show how the same timer facilities serve at least five distinct purposes, and examine their performance characteristics under a selection of application workloads. We show that many timer parameters supplied by application and kernel programmers are somewhat arbitrary, and examine the potential benefit of adaptive timeouts. We also discuss the further implications of our results, both for enhancements to the system timer functionality in existing kernels, and for the clean-slate design of a system timer subsystem for new OS kernels, including the extent to which applications might require such an interface at all.
The effects of virtual reality, augmented reality, and motion parallax on egocentric depth perception
Authors: J. Adam Jones, J. Edward Swan,  II, Gurjot Singh, Eric Kolstad, Stephen R. Ellis
Venue: Proceedings of the 5th symposium on Applied perception in graphics and visualization (2008)

As the use of virtual and augmented reality applications becomes more common, the need to fully understand how observers perceive spatial relationships grows more critical. One of the key requirements in engineering a practical virtual or augmented reality system is accurately conveying depth and layout. This requirement has frequently been assessed by measuring judgments of egocentric depth. These assessments have shown that observers in virtual reality (VR) perceive virtual space as compressed relative to the real-world, resulting in systematic underestimations of egocentric depth. Previous work has indicated that similar effects may be present in augmented reality (AR) as well. This paper reports an experiment that directly measured egocentric depth perception in both VR and AR conditions; it is believed to be the first experiment to directly compare these conditions in the same experimental framework. In addition to VR and AR, two control conditions were studied: viewing real-world objects, and viewing real-world objects through a head-mounted display. Finally, the presence and absence of motion parallax was crossed with all conditions. Like many previous studies, this one found that depth perception was underestimated in VR, although the magnitude of the effect was surprisingly low. The most interesting finding was that no underestimation was observed in AR.
The HiVe Writer
Authors: Tony Cant, Ben Long, Jim McCarthy, Brendan Mahony, Kylie Williams
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Critical systems require assurance that key security, safety or mission requirements are met. Tools are necessary to provide this assurance. The HiVe Writer supports model-based documentation for complex critical systems. The HiVe Writer forms the functional foundation for the ambitious HiVe (Hierarchical Verification Environment) project which aims to provide a unified framework in which entire design projects can be described with the highest level of assurance. The primary innovation in the HiVe Writer is a centrally-managed design model: any design, explanatory and technical documents created within the tool are constrained to be consistent with this design model and therefore with each other. This paper gives a detailed description of the HiVe Writer, showing how it supports model-based editing of structured technical documents and, in particular, requirements formulation.
Characterization of graphs with hall number 2
Authors: Changiz Eslahchi, Matthew Johnson
Venue: Journal of Graph Theory (2004)

Hall's condition is a simple requirement that a graph G and list assignment L must satisfy if G is to have a proper L-colouring. The Hall number of G is the smallest integer m such that whenever the lists on the vertices each has size at least m and Hall's condition is satisfied a proper L-colouring exists. Hilton and P.D. Johnson introduced the parameter and showed that a graph has Hall number 1 if and only if every block is a clique. In this paper we give a forbidden-induced-subgraph characterization of graphs with Hall number 2. &copy; 2003 Wiley Periodicals, Inc. J Graph Theory 45: 81&ndash;100, 2004
Characterization of total ill-posedness in linear semi-infinite optimization
Authors: A. Hantoute, M. A. López
Venue: Journal of Computational and Applied Mathematics (2008)

This paper deals with the stability of linear semi-infinite programming (LSIP, for short) problems. We characterize those LSIP problems from which we can obtain, under small perturbations in the data, different types of problems, namely, inconsistent, consistent unsolvable, and solvable problems. The problems of this class are highly unstable and, for this reason, we say that they are totally ill-posed. The characterization that we provide here is of geometrical nature, and it depends exclusively on the original data (i.e., on the coefficients of the nominal LSIP problem). Our results cover the case of linear programming problems, and they are mainly obtained via a new formula for the subdifferential mapping of the support function.
Connectivity opportunity selection in heterogeneous wireless multi-hop networks
Authors: Dave Cavalcanti, Nagesh Nandiraju, Deepti Nandiraju, Dharma P. Agrawal, Anup Kumar
Venue: Pervasive and Mobile Computing (2008)

This paper addresses the problem of selecting the best connectivity alternative for the user in a generic Heterogeneous Wireless Multi-hop Network (HWMN), integrating distinct wireless technologies and multi-mode cooperating stations. We propose a Connectivity opportunity Selection Algorithm (CSA) that uses network state information and mobility profile information to select the best connectivity based on the applications' requirements. We provide a simulation-based performance evaluation of the CSA and compare it with a greedy network selection scheme. Furthermore, we propose an extended reference model that allows the integration of the concept of connectivity opportunity and our proposed CSA with the framework being defined by the upcoming IEEE 802.21 standard for Media Independent Handover services.
Provably good mesh generation
Authors: M. Bern, D. Eppstein, J. Gilbert
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

Several versions of the problem of generating triangular meshes for finite-element methods are studied. It is shown how to triangulate a planar point set or a polygonally bounded domain with triangles of bounded aspect ratio, how to triangulate a planar point set with triangles having no obtuse angles, how to triangulate a point set in arbitrary dimension with simplices of bounded aspect ratio, and how to produce a linear-size Delaunay triangulation of a multidimensional point set by adding a linear number of extra points. All the triangulations have size within a constant factor of optimal and run in optimal time O(n log n+k) with input of size n and output of size k. No previous work on mesh generation simultaneously guarantees well-shaped elements and small total size.
A decentralized strategy for cooperative robot exploration
Authors: Antonio Franchi, Luigi Freda, Giuseppe Oriolo, Marilena Vendittelli
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

We present a decentralized cooperative exploration strategy for mobile robots. A roadmap of the explored area, with the associate safe region, is built in the form of a compact data structure, called Sensor-based Random Graph. This is incrementally expanded by the robots by using a randomized local planner which automatically realizes a trade-off between information gain and navigation cost. Connecting structures, called bridges, are incrementally added to the graph to create shortcuts and improve the connectivity of the roadmap. Decentralized cooperation and coordination mechanisms are used so as to guarantee exploration efficiency and avoid conflicts. Simulations are presented to show the performance of the proposed technique.
Thermal conductivity measurements of low-k films using thermoreflectance phenomenon
Authors: M. Kuwahara, O. Suzuki, S. Takada, N. Hata, P. Fons, J. Tominaga
Venue: Microelectronic Engineering (2008)

The thermal conductivity of low-dielectric-constant (low-k) materials has been studied by a nano second thermoreflectance measurement system (Nano-TheMS). The Nano-TheMS, which utilizes thermoreflectance, can easily measure the thermal conductivity of thin film of nano-meter scale thickness. We have measured a series of low-k film samples with varying methyl group content. The methyl group content is a significant factor in determining the dielectric constant and mechanical strength of low-k materials. We have also measured the temperature dependence of the thermal conductivity from room temperature to 300^oC as this dependence is essential to simulate realistic temperature distributions inside integrated devices. It was found that its dependence is not remarkable but the thermal conductivity gradually increase with rising temperature.
Regularly σ-conservative and σ-coercive four dimensional matrices
Authors: M. Mursaleen, S. A. Mohiuddine
Venue: Computers Mathematics with Applications (2008)

The idea of @s-conservative and @s-coercive matrices for single sequences was introduced and studied by Schaefer in 1972. The theory of matrix transformations for double sequences has been recently developed by various authors. In this paper we study the concepts of regularly @s-conservative and @s-coercive matrices for double sequences.
Selecting Informative Genes from Microarray Data for Cancer Classification with Genetic Programming Classifier Using K-Means Clustering and SNR Ranking
Authors: Supoj Hengpraprohm, Prabhas Chongstitvatana
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

This paper presents a method for selecting informative features using K-Means clustering and SNR ranking. The performance of the proposed method was tested on cancer classification problems. Genetic Programming is employed as a classifier. The experimental results indicate that the proposed method yields higher accuracy than using the SNR ranking alone and higher than using all of the genes in classification. The clustering step assures that the selected genes have low redundancy, hence the classifier can exploit these features to obtain better performance.
Study of general Taylor-like explicit methods in solving stiff ordinary differential equations
Authors: Xinyuan Wu, Jianlin Xia
Venue: International Journal of Computer Mathematics (2007)

In this paper, we present a further study of Taylor-like explicit methods in solving stiff ordinary differential equations. We derive the general form for Taylor-like explicit methods in solving stiff differential equations. We also analyse the order of convergence and stability property for the general form. Moreover, we give its corresponding vector form via introducing a new definition of vector product and quotient in another article. The convergence and stability of the vector form are considered as well.
A spectral approach to lower bounds
Authors: B. Chazelle
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requires /spl Omega/(n log n) additions and subtractions. This is the first nontrivial lower bound for range searching over a group. By constrast, range searching over a semigroup (which forbids subtractions) is almost completely understood. Our proof has two parts: First, we develop a general, entropy-based, method for relating the linear circuit complexity of a linear map A to the spectrum of A/sup T/A. In the second part of the proof, we design a "high-spectrum" geometric set system and, using techniques from discrepancy theory, we estimate the median eigenvalue of its associated map. Interestingly, the method also shows that using up to a linear number of help gates cannot help; these are gates that can compute any bivariate function. The best feature of our method is that it is very general. With any instance of range searching we associate a quadratic form: any lower bound on the mid-range of its spectrum implies a lower bound on the complexity of that range searching problem. The main drawback of our approach is that it (probably) yields weak lower bounds. Another shortcoming is that the method does not seem to generalize to range searching over rings or fields.
Bringing lives to light: lives and event representation in temporal and geographic context
Authors: Ryan Shaw, Ray R. Larson
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

Our demonstration system consists of a set of tools for identifying life events in biographical texts and linking them to relevant contextual resources.
Determination of available transfer capability (ATC) considering integral square generator angle (ISGA)
Authors: N. Mat, M. M. Othman, I. Musirin, A. Mohamed, A. Hussain
Venue: Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications (2008)

This paper presents the determination of power transfer between two buses that takes into account the dynamic security constraint. The dynamic security constraint based transient stability has been found to be one of the limiting factors in determining the power transfer so-called as the available transfer capability (ATC). The multimachine integral square generator angle (ISGA) index is used to measure the severity of stable and unstable transient events during the occurrence of line outage that is considered in the ATC assessment. The determination of ATC considering dynamic security constraint has been performed on a case study of 6 bus system.