ppxscal/embedding_network huggingface dataset:
Approximation of Sobolev classes by polynomials and ridge functions
Authors: V. N. Konovalov, D. Leviatan, V. E. Maiorov
Venue: Journal of Approximation Theory (2009)

Let W"p^r(B^d) be the usual Sobolev class of functions on the unit ball B^d in R^d, and W"p^@?^,^r(B^d) be the subclass of all radial functions in W"p^r(B^d). We show that for the classes W"p^@?^,^r(B^d) and W"p^r(B^d), the orders of best approximation by polynomials in L"q(B^d) coincide. We also obtain exact orders of best approximation in L"2(B^d) of the classes W"p^@?^,^r(B^d) by ridge functions and, as an immediate consequence, we obtain the same orders in L"2(B^d) for the usual Sobolev classes W"p^r(B^d).
Fred meets Tweety
Authors: Antonis Kakas, Loizos Michael, Rob Miller
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

We propose a framework that brings together two major forms of default reasoning in Artificial Intelligence: applying default property classification rules in static domains, and default persistence of properties in temporal domains. Particular attention is paid to the central problem of qualification. We illustrate how previous semantics developed independently for the two separate forms of default reasoning naturally lead to the integration that we propose, and how this gives rise to domains where different types of knowledge interact and qualify each other while preserving elaboration tolerance.
Developing a flexible content model for media repositories: a case study
Authors: Christopher A. Beer, Peter D. Pinch, Karen Cariani
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

This article describes the process and challenges of developing a content model that can support the content and metadata present in a complex media archive. Media archives have some of the most diverse requirements in an effort to catalog, preserve, and make accessible a wide range of content with multifaceted relationships between works. We focus particularly on the design and implementation of the WGBH Media Library and Archives' Fedora digital access repository for scholars, educational users and the public. It is our hope that the process and findings from this work can support the architecture and development of other media archives.
A grammar-based entity representation framework for data cleaning
Authors: Arvind Arasu, Raghav Kaushik
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Fundamental to data cleaning is the need to account for multiple data representations. We propose a formal framework that can be used to reason about and manipulate data representations. The framework is declarative and combines elements of a generative grammar with database querying. It also incorporates actions in the spirit of programming language compilers. This framework has multiple applications such as parsing and data normalization. Data normalization is interesting in its own right in preparing data for analysis as well as in pre-processing data for further cleansing. We empirically study the utility of the framework over several real-world data cleaning scenarios and find that with the right normalization, often the need for further cleansing is minimized.
Learning Markov logic network structure via hypergraph lifting
Authors: Stanley Kok, Pedro Domingos
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

Markov logic networks (MLNs) combine logic and probability by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. Learning MLN structure from a relational database involves learning the clauses and weights. The state-of-the-art MLN structure learners all involve some element of greedily generating candidate clauses, and are susceptible to local optima. To address this problem, we present an approach that directly utilizes the data in constructing candidates. A relational database can be viewed as a hypergraph with constants as nodes and relations as hyperedges. We find paths of true ground atoms in the hypergraph that are connected via their arguments. To make this tractable (there are exponentially many paths in the hypergraph), we lift the hypergraph by jointly clustering the constants to form higherlevel concepts, and find paths in it. We variabilize the ground atoms in each path, and use them to form clauses, which are evaluated using a pseudo-likelihood measure. In our experiments on three real-world datasets, we find that our algorithm outperforms the state-of-the-art approaches.
Neural Network Based Landscape Pattern Simulation in ChangBai Mountain, Northeast China
Authors: Mingchang Wang, Shengbo Chen, Lixin Xing, Chunyan Yang, Zijun Wang
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

Simulation on evolution of landscape pattern is a hot problem because the evolution of terrestrial landscape pattern will be related directly to the changes of climate. In the study, it presents a neural network model for the evolution of landscape pattern by using the landscape pattern transformation rules and parameters. Owing to the typical vertical zoning of vegetation, Mount ChangBai is taken as an example to demonstrate the application of simulation model. Landsat TM data in 1985 and 1999 are combined with the geographic data. The landscape pattern evolution parameters are built and the transformation rules are confirmed by the help of the three layers Back Propagation (BP) Neural Network. There are 16 neural cells for the input layer and 11 cells for the output cell. The evolution of the landscape pattern in 2013 and 2027 are predicted by the model. The precision of the model in 1985 was 84% by taking the year of 1999 as starting point, while the precision of the model in 1999 was 82% by taking the year of 1985 as starting point. The simulation result was very close to actual situation by comparison with Moran I index in 1985 and 1999.
Leveraging complexity in software for cybersecurity
Authors: Robert C. Armstrong, Jackson R. Mayo
Venue: Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies (2009)

A method for assessing statistically quantifiable improvements in security for software vulnerabilities is presented. Drawing on concepts in complexity theory, undecidability, and previous work in high-reliability systems, we show that ensembles of similar implementations have statistical value even though each by itself is inscrutable. Research questions are identified that may allow practical application of these concepts.
On the sampling distribution of resubstitution and leave-one-out error estimators for linear classifiers
Authors: Amin Zollanvari, Ulisses M. Braga-Neto, Edward R. Dougherty
Venue: Pattern Recognition (2009)

Error estimation is a problem of high current interest in many areas of application. This paper concerns the classical problem of determining the performance of error estimators in small-sample settings under a Gaussianity parametric assumption. We provide here for the first time the exact sampling distribution of the resubstitution and leave-one-out error estimators for linear discriminant analysis (LDA) in the univariate case, which is valid for any sample size and combination of parameters (including unequal variances and sample sizes for each class). In the multivariate case, we provide a quasi-binomial approximation to the distribution of both the resubstitution and leave-one-out error estimators for LDA, under a common but otherwise arbitrary class covariance matrix, which is assumed to be known in the design of the LDA discriminant. We provide numerical examples, using both synthetic and real data, that indicate that these approximations are accurate, provided that LDA classification error is not too large.
Development of Designed Q-R Code
Authors: Jun Sasaki, Hiroaki Shimomukai, Tae Yoneda, Yutaka Funyu
Venue: Proceeding of the 2007 conference on Information Modelling and Knowledge Bases XVIII (2007)

The mobile Internet has been used widely in Japan. If we use a cellular phone with the Q-R (Quick Response) code reader function (a two dimensional code developed by Denso-Wave Corporation) we can very easily access a web-site. However, though the existence of Q-R code reader function in the cellular phone is well known, not many people who use the function. The reason is that the Q-R code is not intuitive because it was developed to be read by machines. Our idea to solve the problem is to combine the Q-R code with a designed particular picture or graphic. We propose a method to produce the designed Q-R code and we develop its production system. This paper describes the proposed method, the production system and evaluation results using some designed Q-R codes produced by the system.
Plenary lecture 2: real and virtual sound quality in room and musical acoustics
Authors: Lamberto Tronchin
Venue: Proceedings of the 10th WSEAS international conference on Acoustics & music: theory & applications (2009)

The not-linear and multi-channel convolution algorithms for musical and room acoustics auralisation is actually considered the most suitable technique for correctly reproducing the sound characteristics of a musical instrument or a room. The initial simple convolution from a dry signal with a mono impulse response moved to a multi-channel convolution and therefore to a more complex system. On the other hand, the new technology has allowed the definition of a new set of physical parameters that could be able to correctly describe the sound characteristics of the system. During this lecture, the results of a world-wide campaign of acoustic measurement of impulse responses in ancient Italian musical instruments and different special theatres and auditoria are presented. The application of a new technique in virtual 3D sound reconstruction is presented. Furthermore, the methodology is compared with other techniques of 3D sound reproduction. The possibility to enhance the spatial reproduction of sound quality in musical instruments and real spaces and the comprehensibility of spatial parameters is finally considered and presented in different cases.
The ICT standardisation policy of the EU: changes ahead!?
Authors: Kai Jakobs, Knut Blind
Venue: Proceedings of the 2009 Euro American Conference on Telematics and Information Systems: New Opportunities to increase Digital Citizenship (2009)

The paper first briefly discusses the current situation in the field of ICT standardisation, with a certain focus on Europe. Here, the perceived diminishing influence of Europe in the international standards arena has led to first (minor) initiatives by the European Commission, aiming at changes in their ICT standardisation policy. Some options currently under discussion are addressed.
Adaptive learning in evolving task allocation networks
Authors: Tomas Klos, Bart Nooteboom
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

In this paper, we study multi-agent economic systems using a recent approach to economic modeling called Agent-based Computational Economics (ACE): the application of the Complex Adaptive Systems (CAS) paradigm to economics. In this paper, we apply the CAS paradigm to the study of an industrial goods market, where firms need to decide between making and buying components. Computer simulations using our model explain different emerging distributions of economic activity among organizational forms (market and hierarchy) in terms of the search problem facing the agents, and in terms of the negative consequences of the agents' search behavior on their perceived trustworthiness in the eyes of their potential partners. A further impediment to reaching optimal allocations we observe is that agents learn to protect themselves and their current allocation by being loyal and by focusing on their trust in their partner, rather than their partner's profit generating potential.
Proposal and Basic Research for a Learning Model “RPRaS” for Novice Programming
Authors: Kozo Mizutani, Masayuki Arai, Takashi Unagami
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

This paper describes a proposal for a new learning model “RPRaS” for learning novice programming. We often find that there are students who cannot solve problems (program requirements) in classes. Even if they can understand the program requirements, they might not be able to write program source based on the requirements. RPRaS is a learning model that aims to support an understanding relation between program requirements and program sources. For preparing effective learning support methods, we have examined using a trial learning system based on the model. In this paper gives an explanation of the trial system and the reports of the examination.
Letter to the editor: A robust iterative scheme for finite volume discretization of diffusive flux on highly skewed meshes
Authors: Yves Marcel Ahipo, Philippe Traore
Venue: Journal of Computational and Applied Mathematics (2009)

A new approach for diffusive flux discretization on a nonorthogonal mesh for finite volume method is proposed. This approach is based on an iterative method, Deferred correction introduced by M. Peric [J.H. Fergizer, M. Peric, Computational Methods for Fluid Dynamics, Springer, 2002]. It converges on highly skewed meshes where the former approach diverges. A convergence proof of our method is given on arbitrary quadrilateral control volumes. This proof is founded on the analysis of the spectral radius of the iteration matrix. This new approach is applied successfully to the solution of a Poisson equation in quadrangular domains, meshed with highly skewed control volumes. The precision order of used schemes is not affected by increasing skewness of the grid. Some numerical tests are performed to show the accuracy of the new approach.
An algorithm for drawing a contour line that borders a plane surface by increasing the number of knowledge points
Authors: Nicolae Dobritoiu
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

In this paper we present an algorithm for drawing a contour line that borders a surface from a horizontal plane when we know a finite number of points. Starting from these points that are given through their coordinates, this algorithm allows the increasing of the number of known points and therefore by binding all the points (old and new) it results a contour line which approximates better the real contour line.
Learning directed probabilistic logical models: ordering-search versus structure-search
Authors: Daan Fierens, Jan Ramon, Maurice Bruynooghe, Hendrik Blockeel
Venue: Annals of Mathematics and Artificial Intelligence (2008)

We discuss how to learn non-recursive directed probabilistic logical models from relational data. This problem has been tackled before by upgrading the structure-search algorithm initially proposed for Bayesian networks. In this paper we show how to upgrade another algorithm for learning Bayesian networks, namely ordering-search. For Bayesian networks, ordering-search was found to work better than structure-search. It is non-obvious that these results carry over to the relational case, however, since there ordering-search needs to be implemented quite differently. Hence, we perform an experimental comparison of these upgraded algorithms on four relational domains. We conclude that also in the relational case ordering-search is competitive with structure-search in terms of quality of the learned models, while ordering-search is significantly faster.
Framing tangible interaction frameworks
Authors: Ali Mazalek, Elise Van den hoven
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2009)

Tangible interaction is a growing area of human–computer interaction research that has become popular in recent years. Yet designers and researchers are still trying to comprehend and clarify its nature, characteristics, and implications. One approach has been to create frameworks that help us look back at and categorize past tangible interaction systems, and look forward at the possibilities and opportunities for developing new systems. To date, a number of different frameworks have been proposed that each provide different perspectives on the tangible interaction design space, and which can guide designers of new systems in different ways. In this paper, we map the space of tangible interaction frameworks. We order existing frameworks by their general type, and by the facets of tangible interaction design they address. One of our main conclusions is that most frameworks focus predominantly on the conceptual design of tangible systems, whereas fewer frameworks abstract the knowledge gained from previous systems, and hardly any framework provides concrete steps or tools for building new tangible systems. In addition, the facets most represented in existing frameworks are those that address the interactions with or the physicality of the designed systems. Other facets, such as domain-specific technology and experience, are rare. This focus on design, interaction, and physicality is interesting, as the origins of the field are rooted in engineering methods and have only recently started to incorporate more design-inspired approaches. As such, we expected more frameworks to focus on technologies and to provide concrete building suggestions for new tangible interaction systems.
A museum mobile game for children using QR-codes
Authors: Ugo B. Ceipidor, Carlo M. Medaglia, Amedeo Perrone, Maria De Marsico, Giorgia Di Romano
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

We present a mobile game to play a museum treasure hunt, addressed to students that are about 11-14. They have to search for the "materializations" of the solutions to a sequence of riddles, and to photograph them by personal camera phones. The letters of a secret word are orderly provided on right answers, spurring the interest for the exhibition through the cellular phone. The novelty is the use of QR-Codes, a kind of 2D codes, to identify the correct answers and to enjoy some other services. A preliminary field test in the Norsk Telemuseum gave very good results.
NEWPAR: An Optimized Feature Selection and Weighting Schema for Category Ranking
Authors: Fernando Ruiz-Rico, Jose-Luis Vicedo
Venue: Proceeding of the 2006 conference on STAIRS 2006: Proceedings of the Third Starting AI Researchers' Symposium (2006)

This paper presents an automatic feature extraction method for category ranking. It has been evaluated using Reuters and OHSUMED data sets, outperforming some of the best known and most widely used approaches.
Finding Instances of Deduction and Abduction in Clinical Experimental Transcripts
Authors: Maria Amalfi, Katia Lo Presti, Alessandro Provetti, Franco Salvetti
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

This article describes the design and implementation of a prototype that analyzes and classifies transcripts of interviews collected during an experiment that involved lateral-brain damage patients. The patients' utterances are classified as instances of categorization, prediction and explanation (abduction) based on surface linguistic cues. The agreement between our automatic classifier and human annotators is measured. The agreement is statistically significant, thus showing that the classification can be performed in an automatic fashion.
Making Byzantine fault tolerant systems tolerate Byzantine faults
Authors: Allen Clement, Edmund Wong, Lorenzo Alvisi, Mike Dahlin, Mirco Marchetti
Venue: Proceedings of the 6th USENIX symposium on Networked systems design and implementation (2009)

This paper argues for a new approach to building Byzantine fault tolerant replication systems. We observe that although recently developed BFT state machine replication protocols are quite fast, they don't tolerate Byzantine faults very well: a single faulty client or server is capable of rendering PBFT, Q/U, HQ, and Zyzzyva virtually unusable. In this paper, we (1) demonstrate that existing protocols are dangerously fragile, (2) define a set of principles for constructing BFT services that remain useful even when Byzantine faults occur, and (3) apply these principles to construct a new protocol, Aardvark. Aardvark can achieve peak performance within 40% of that of the best existing protocol in our tests and provide a significant fraction of that performance when up to f servers and any number of clients are faulty. We observe useful throughputs between 11706 and 38667 requests per second for a broad range of injected faults.
Image segmentation with active contours based on selective visual attention
Authors: E. Mendi, M. Milanova
Venue: Proceedings of the 3rd WSEAS international symposium on Wavelets theory and applications in applied mathematics, signal processing & modern science (2009)

Telemedicine is growing and there is an increased demand for faster image processing and transmitting diagnostic medical images. Identifying and extracting the region of interest (ROI) accurately is an important step before coding and compressing the image data for efficient transmission or storage. The usual approach to extract ROI is to apply contour segmentation method. Chan-Vese active contour model [1] is a well-known image segmentation technique based on Mumford-Shah level set methods. Selective visual attention is a fundamental component of perceptual representation in a visual system. It influences the identification of a stimulus from those that operate after perception is complete. The Saliency Toolbox [2] is a collection of Matlab functions and scripts for computing the saliency map for an image, for determining the extent of a proto-object, and for serially scanning the image with the focus of visual attention. The implementation of the toolbox is extension of the saliency map-based model of bottom-up attention [3], by a process of inferring the extent of a proto-object at the attended location from the maps that are used to compute the saliency map. In this paper, we focus on extracting ROI by segmentation based on visual attended locations. Chan-Vese active contour model is used for image segmentation and attended locations are determined by SaliencyToolbox. Finally, we successfully segmented two attended locations of a medical image.
Text mining for indexing
Authors: Judith Gelernter, Michael Lesk
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

This paper describes techniques for automatically extracting and classifying maps found within articles. The process uses image analysis to find text in maps, document structure to find captions and titles, and then text mining to assign each map to a subject category, a geographical place, and a time period. The text analysis is based on authority lists taken from gazetteers and from library classifications.