ppxscal/embedding_network huggingface dataset:
Guarded hybrid knowledge bases12
Authors: Stijn Heymans, Jos De bruijn, Livia Predoiu, Cristina Feier, Davy Van niewenborgh
Venue: Theory and Practice of Logic Programming (2008)

Recently, there has been a lot of interest in the integration of Description Logics (DL) and rules on the Semantic Web. We define guarded hybrid knowledge bases (or g-hybrid knowledge bases) as knowledge bases that consist of a Description Logic knowledge base and a guarded logic program, similar to the <inline-graphic mime-subtype="gif" xlink="S1471068407003201_inline1"><alt-text>$\mathcal{DL}$</alt-text></inline-graphic> + log knowledge bases from Rosati (In Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning, AAAI Press, Menlo Park, CA, 2006, pp. 68–78.). g-Hybrid knowledge bases enable an integration of Description Logics and Logic Programming where, unlike in other approaches, variables in the rules of a guarded program do not need to appear in positive non-DL atoms of the body, i.e., DL atoms can act as guards as well. Decidability of satisfiability checking of g-hybrid knowledge bases is shown for the particular DL <inline-graphic mime-subtype="gif" xlink="S1471068407003201_inline2"><alt-text>$\mathcal{DLRO}^{\-{le}}$</alt-text></inline-graphic>, which is close to OWL DL, by a reduction to guarded programs under the open answer set semantics. Moreover, we show 2-Exptime-completeness for satisfiability checking of such g-hybrid knowledge bases. Finally, we discuss advantages and disadvantages of our approach compared with <inline-graphic mime-subtype="gif" xlink="S1471068407003201_inline1"><alt-text>$\mathcal{DL}$</alt-text></inline-graphic> + log knowledge bases.
User evaluation of god-like interaction techniques
Authors: Aaron Stafford, Wayne Piekarski
Venue: Proceedings of the ninth conference on Australasian user interface - Volume 76 (2008)

God-like interaction is a metaphor for improved communication of situational and navigational information between outdoor users, equipped with mobile augmented reality systems, and indoor users, equipped with tabletop projector display systems. This paper presents the results of a user evaluation that explores user experience to a subset of the god-like interaction metaphor. The tasks performed by the participants were designed around known problems in the AR community. The results of the evaluation are intended to help define the boundaries in which the god-like interaction metaphor is practical for communication of navigational and situational information. This paper reports the findings of the evaluation as well as recommendations for further development of the interaction metaphor.
From the Office Document Format Battlefield
Authors: Jirka Kosek
Venue: IT Professional (2008)

The two most common XML-based formats for office application suites are now international standards. Unfortunately, the Open Document Format and Office Open XML are similar but imperfectly compatible.
Measure on small complexity classes, with applications for BPP
Authors: E. Allender
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We present a notion of resource-bounded measure for P and other subexponential-time classes. This generalization is based on Lutz's notion of measure, but overcomes the limitations that cause Lutz's definitions to apply only to classes at least as large as E. We present many of the basic properties of this measure, and use it to explore the class of sets that are hard for BPP. Bennett and Gill showed that almost all sets are hard for BPP; Lutz improved this from Lebesgue measure to measure on ESPACE. We use our measure to improve this still further, showing that for all /spl epsiv/>0, almost every set in E/sub /spl epsiv// is hard for BPP, where E/sub /spl epsiv//=/spl cup//sub /spl delta/
Computationally efficient modelling of pattern dependencies in the micro-embossing of thermoplastic polymers
Authors: Hayden Taylor, Duane Boning, Ciprian Iliescu, Bangtao Chen
Venue: Microelectronic Engineering (2008)

We present a highly computationally efficient way to simulate the deformation of a polymeric layer when embossed with an arbitrarily patterned stamp. Two simplified material models are considered: a purely elastic model, which is useful when the material is in a rubbery regime, and a visco-elastic model, which has more general applicability. The simulation approach has been shown to represent the feature size-dependent penetration of a polymethylmethacrylate (PMMA) layer into stamp cavities with widths varying between 5 and 90@mm. The time-dependence of cavity penetration has also been approximately modelled in the case of PMMA embossed at 110^oC under an average pressure of 8MPa for up to 10min.
Quantifying usability in secure graphics: assessing the user costs of protecting 3D content
Authors: Jiajun Zhu, Jonathan Z. Bakdash, David Koller, Thomas Banton, Dennis R. Proffitt, Greg Humphreys
Venue: Proceedings of the 5th symposium on Applied perception in graphics and visualization (2008)

There is an increasing need for methods for secure dissemination of interactive 3D graphics content, providing protection for valuable 3D models while still allowing them to be widely shared. Existing systems for protected sharing of 3D models may introduce perturbations into the rendered images of the content, in order to defend against potential malicious reconstruction attacks that could otherwise recover the 3D model shape. However, the particular nature and magnitude of these perturbation defenses has not been based upon any rigorous analysis or measurement of their perceptual effect on non-malicious users of the protected graphics system. In this paper, we take the first steps toward such an analysis, conducting a series of user studies that evaluate the impact (as measured by user reaction time) of varying amounts of noise applied to user interactions in a real-time 3D rendering system. We are thus able to experimentally determine the most appropriate tradeoffs between noise perturbation defenses and the security of the 3D content against typical reconstruction attacks.
Clustering-based genre prediction on music data
Authors: Chris Sanden, Chad Befus, John Z. Zhang
Venue: Proceedings of the 2008 C3S2E conference (2008)

In this work, we study the problem of genre prediction on music data. The prediction is based on a genre map, which is constructed from clustering training music data. We make use of a novel algorithm which captures the structural distances from music data and achieves a high clustering accuracy. Preliminary experiments are conducted and discussed.
Biometric dispersion matcher
Authors: Joan Fíbregas, Marcos Faundez-Zanuy
Venue: Pattern Recognition (2008)

In this paper we propose a new classifier called a dispersion matcher. Our proposal is especially well adapted to those scenarios where a large number of classes and a small number of samples per class are available for training. This is the situation of biometric systems where just three to five measures per person are acquired during enrollment. This is just the opposite situation of other pattern recognition applications where a small number of classes and a large amount of training samples are available, such as handwritten digit recognition (10 classes) for ZIP code identification. The dispersion matcher trains a quadratic discriminant classifier to solve the dichotomy ''Do these two feature vectors belong to the same person?''. In this way, we solve an important set of topics: (a) we can classify an open world problem and we do not need to train the model again if a new user is added, (b) we find a natural solution for feature selection, (c) experimental results with a priori threshold provides good results. We evaluate the proposed system with hand-geometry and face recognition problems (identification and verification). In hand geometry, we get a minimum detection cost function (DCF) for verification of 0.21% and a maximum identification rate of 99.1%, which compares favorably with other state-of-the-art methods. In face verification we achieve 5.59% DCF and 92.77% identification rate, which also compares favorably with the literature.
A hybrid searching scheme in unstructured P2P networks
Authors: Xiuqi Li, Jie Wu
Venue: International Journal of Parallel, Emergent and Distributed Systems (2007)

The existing searching schemes in peer-to-peer (P2P) networks are either forwarding-based or non-forwarding based. In forwarding-based schemes, queries are forwarded from the querying source to the query destination nodes. These schemes offer low state maintenance. However, querying sources do not entirely have control over query processing. In non-forwarding based methods, queries are not forwarded and the querying source directly probes its neighbors for the desired files. Non-forwarding searching provides querying sources flexible control over the searching process at the cost of high state maintenance. In this paper, we seek to combine the powers of both forwarding and non-forwarding searching schemes. We propose an approach where the querying source directly probes its own extended neighbors and forwards the query to a subset of its extended neighbors and guides these neighbors to probe their own extended neighbors on its behalf. Our approach can adapt query processing to the popularity of the sought files without having to maintain a large set of neighbors because its neighbors' neighbors are also in the searching scope due to the 1-hop forwarding inherent in our approach. It achieves a higher query efficiency than the forwarding scheme and a better success rate than the non-forwarding approach. To the best of our knowledge, the work in this paper is the first one to combine forwarding and non-forwarding P2P searching schemes. Experimental results demonstrate the effectiveness of our approach.
Provenance Services for Distributed Workflows
Authors: Sérgio Manuel Serra da Cruz, Patrícia M. Barros, Paulo M. Bisch, Maria Luiza Machado Campos, Marta Mattoso
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Scientific experiments using workflows benefit from mechanisms to trace the generation of results. As workflows start to scale it is fundamental to have access to their underlying processes, parameters and data. Particularly in molecular dynamics (MD) simulations, a study of the interatomic interactions in proteins must use distributed high performance computing environments to produce timely results. Scientist’s trust in experiments produced by gathering distributed partial results may be limited without provenance information. This paper presents a service architecture that captures and stores provenance data from distributed, autonomous, replicated and heterogeneous resources. Such provenance data can be used to trace the history of the distributed execution process. These services can be coupled to workflow management systems. The Kepler system was used as a basis to manage a grid workflow application. Experimental results regarding cluster and grid MD simulations were evaluated using the provenance services architecture.
A comprehensive data quality methodology for web and structured data
Authors: Carlo Batini, Federico Cabitza, Cinzia Cappiello, Chiara Francalanci
Venue: International Journal of Innovative Computing and Applications (2008)

Measuring and improving data quality in an organisation or in a group of interacting organisations is a complex task. Several methodologies have been developed in the past, providing a basis for the definition of a data quality programme that guarantees high data quality levels. Since the main limitation of existing approaches is their specialisation on specific issues or contexts, this paper presents a Comprehensive Data Quality (CDQ) methodology. The main aim of the CDQ methodology is the integration and enhancement of the phases, techniques and tools proposed by previous approaches. In particular, the CDQ methodology is conceived to be at the same time complete, flexible and simple to apply. Completeness is achieved by considering an existing techniques and tools and integrating them in a framework that can work in any organisation. The methodology is flexible, since it supports the user in the selection of the most suitable techniques and tools within each phase and in any context. Finally, CDQ is simple, since it is organised in phases and each phase is characterised by a specific goal and a set of techniques to apply. The methodology is explained by means of a running example and significant cases of its application are reported.
Canonical View Synthesis for Gait Recognition
Authors: Seungdo Jeong, Su-Sun Kim, Byung-Uk Choi
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

GAIT is defined as a person's manner of walking. While the computer vision community has progressed the identification of individuals by means of their gait, there are many difficulties which are not settled yet. Especially, dependency to the direction of walking is very serious. That is, extracted gait features become individualized according to the direction of walking, even if the camera is fixed. In this paper we propose an improvement to reduce this dependency based on homography. We establish a direction of walking through the silhouette of gait then estimate the planar homography by means of simple operations. Through transformation using planar homography we reduce dependency to the direction of the gait features. In order to estimate planar homography, vanishing point and vanishing lines are considered. The proposed planar homography that transforms the vanishing point to infinity makes the corresponding directional vanishing lines parallel, and this can always transform any plane that is established by the integrated silhouette of gait to the canonical plane. Therefore one can obtain the canonical-viewed images using the estimated homography. Moreover, through synthesizing of canonical-viewed images by means of the estimated homography, a viewpoint variation from the direction of walking is compensated. To test this idea we segment the gait silhouette into sub-regions and use the averaged features and variations on each region, as input to a gait recognition experiment. Our experiments show that the proposed method efficiently reduces the dependency to directional variations of gait.
A neuro fuzzy fechnique for modelling climatic variations in the Plio-Pleistocene
Authors: F. O. Souza, R. A. Miranda, E. M. A. M. Mendes, R. M. Palhares
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

In this paper a new approach to model climatic variations in the Plio-Pleistocene is presented. In a recent reference, Rial in [1] introduced the working hypothesis that frequency modulation (FM) of the orbital eccentricity forcing may be an important source of the nonlinearities observed in the δ18O time series from deep-sea sediment cores. Two models are proposed based on the ANFIS (Adaptive Neuro Fuzzy Inference System) structure. The first model uses only past values of the time series under investigation. The second model uses information on the orbital eccentricity forcing and an artificially generated FM which is an extension of the FM signal proposed by Rial. The two models are compared in the light of long term predictions.
Numerical treatment of second kind Fredholm integral equations systems on bounded intervals
Authors: M. C. De Bonis, C. Laurita
Venue: Journal of Computational and Applied Mathematics (2008)

In this paper the authors propose numerical methods to approximate the solutions of systems of second kind Fredholm integral equations. They prove that such methods are stable and convergent. Error estimates in weighted L^p norm, 1=
A novel method for nonlinear fractional partial differential equations: Combination of DTM and generalized Taylor's formula
Authors: Shaher Momani, Zaid Odibat
Venue: Journal of Computational and Applied Mathematics (2008)

In this article, a novel numerical method is proposed for nonlinear partial differential equations with space- and time-fractional derivatives. This method is based on the two-dimensional differential transform method (DTM) and generalized Taylor's formula. The fractional derivatives are considered in the Caputo sense. Several illustrative examples are given to demonstrate the effectiveness of the present method. Results obtained using the scheme presented here agree well with the analytical solutions and the numerical results presented elsewhere. Results also show that the numerical scheme is very effective and convenient for solving nonlinear partial differential equations of fractional order.
The 2-chart Problem - Contemplating System Behavior in the Aggregate
Authors: Reuven Gallant, Meir M. Lehman
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

This paper addresses "the 2-chart problem," with respect to diagrammatic representations of complex event-driven reactive systems. In particular we focus on behavioral modeling with statecharts. A taxonomy of cues and a heuristic for using them is proposed. This facilitates consideration of behavioral issues of each chart individually. The more complex issues that arise from consideration of both of them jointly are then considered. We show how this heuristic may be applied iteratively with a top-down traversal of the system model. In particular it is shown how to use this approach to address the issues first addressed in Lehman's work on software evolution: the unbounded number of features in any application domain and the need to identify tacit assumptions that give rise to these features that become obsolete as the application and its world of operation evolve.
Direction-based motion detection using the MPEG2 encoder
Authors: Josue A. Hernandez, Hiroyoshi Morita, Hector M. Perez
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

Now a day, the used of biometrics as part of the security systems have been increasing; to detect, classify and to track human motion with a high precision are part of this demand, for that reason many approaches have been proposed and, since computer vision let us to manipulated digital image sequences many of these techniques use the information content in a video stream has the main tool to do this task. In this paper we present a simple but robust technique to detect and to track human motion using MPEG2. the proposed method take advantage of the MPEG2 encoder extracting the movement vector from the P frames and filter them in order to obtain better information about real motion into the scene. Our method implies very low computational cost and low complexity compare with other techniques. Experimental results have shown good accuracy, demonstrating that the proposed technique could be reliable.
Fault Tolerance and Recovery of Scientific Workflows on Computational Grids
Authors: Gopi Kandaswamy, Anirban Mandal, Daniel A. Reed
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

In this paper, we describe the design and implementation of two mechanisms for fault-tolerance and recovery for complex scientific workflows on computational grids. We present our algorithms for over-provisioning and migration, which are our primary strategies for fault-tolerance. We consider application performance models, resource reliability models, network latency and bandwidth and queue wait times for batch-queues on compute resources for determining the correct fault-tolerance strategy. Our goal is to balance reliability and performance in the presence of soft real-time constraints like deadlines and expected success probabilities, and to do it in a way that is transparent to scientists. We have evaluated our strategies by developing a Fault-Tolerance and Recovery (FTR) service and deploying it as a part of the Linked Environments for Atmospheric Discovery (LEAD) production infrastructure. Results from real usage scenarios in LEAD show that the failure rate of individual steps in workflows decreases from about 30% to 5% by using our fault-tolerance strategies.
A Proposal on the Error Bound of Collaborative Filtering Recommender System
Authors: Uk-Pyo Han, Gil-Mo Yang, Jae-Soo Yoo, Young-Jun Chung, Hee-Choon Lee
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

We predict accuracy of user’s preferences by using memory-based collaborative filtering algorithm in recommender system, and then analyze the results through the EDA approach. The possibilities are presented that prediction accuracy can be evaluated before prediction process by analyzing the results. The classification functions using the generative probability of specific ratings are made, and users are classified by using the classification functions. The prediction accuracies of each classified group are analyzed through statistical tests. The method of setting the Error Bound of users who have high probabilities in low prediction accuracy will be presented.
Inverse conjecture for the gowers norm is false
Authors: Shachar Lovett, Roy Meshulam, Alex Samorodnitsky
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

Let p be a fixed prime number and N be a large integer. The "Inverse Conjecture for the Gowers Norm" states that if the "d-th Gowers norm" of a function f:FNp to Fp is non-negligible, that is larger than a constant independent of N, then f has a non-trivial correlation with a degree d-1 polynomial. The conjecture is known to hold for d=2,3 and for any prime p. In this paper we show the conjecture to be false for p=2 and for d=4, by presenting an explicit function whose 4-th Gowers norm is non-negligible, but whose correlation with any polynomial of degree 3 is exponentially small. Essentially the same result, with different bounds for correlation, was independently obtained by Green and Tao. Their analysis uses a modification of a Ramsey-type argument of Alon and Beigel to show inapproximability of certain functions by low-degree polynomials. We observe that a combination of our results with the argument of Alon and Beigel implies the inverse conjecture to be false for any prime p, for d = p2.
Lanczos methods in economic Models: visual representation and computing
Authors: Concepción González-Concepción, Peter Graves-Morris
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

Techniques for solving systems of linear equations are important problems which answer basic questions in Numerical Analysis. Moreover, the methods used for linear problems often help solve non-linear problems, and many iterative schemes for linear systems have led to the development of non-linear iterative methods. The associated difficulties with the numerical resolution of linear systems (instability, ill-conditioning, etc.) are the same as those of more general problems. Large sparse systems frequently occur in economic models and many other applications. Thus, appropriate special methods which are efficient and reliable should be used whenever possible. In this paper, we present Lanczos' iterative method and some modifications to it in the context of solutions to problems using dynamic models. It is clearly a more efficient alternative to the classical methods previously used when solving these problems.