ppxscal/embedding_network huggingface dataset:
Solving Necklace Constraint Problems
Authors: Pierre Flener, Justin Pearson
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to be permuted (unlabelled necklaces), without getting an essentially different solution. We bring together the fields of combinatorial enumeration, where efficient algorithms have been designed for (special cases of) some of these combinatorial objects, and constraint programming, where the requisite symmetry breaking has at best been done statically so far. We design the first search procedure and identify the first symmetry-breaking constraints for the general case of unlabelled necklaces. Further, we compare dynamic and static symmetry breaking on real-life scheduling problems featuring (unlabelled) necklaces.
Experiences with Mapping Non-linear Memory Access Patterns into GPUs
Authors: Eladio Gutierrez, Sergio Romero, Maria A. Trenas, Oscar Plata
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

Modern Graphics Processing Units (GPU) are very powerful computational systems on a chip. For this reason there is a growing interest in using these units as general purpose hardware accelerators (GPGPU). To facilitate the programming of general purpose applications, NVIDIA introduced the CUDA programming environment. CUDA provides a simplified abstraction of the underlying complex GPU architecture, so as a number of critical optimizations must be applied to the code in order to get maximum performance. In this paper we discuss our experience in porting an application kernel to the GPU, and all classes of design decisions we adopted in order to obtain maximum performance. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Locating text in scanned books
Authors: Chang Hu, Anne Rose, Benjamin B. Bederson
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

In this paper, we describe a work flow to extract and verify text locations using commercial software, along with free software products and human proofing. To help mid-sized digital libraries, we are making our solution available as open source software.
Verifying epistemic protocols under common knowledge
Authors: Yanjing Wang, Lakshmanan Kuppusamy, Jan van Eijck
Venue: Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (2009)

Epistemic protocols are communication protocols aiming at transfer of knowledge in a controlled way. Typically, the preconditions or goals for protocol actions depend on the knowledge of agents, often in nested form. Informal epistemic protocol descriptions for muddy children, coordinated attack, dining cryptographers, Russian cards, secret key exchange are well known. The contribution of this paper is a formal study of a natural requirement on epistemic protocols, that the contents of the protocol can be assumed to be common knowledge. By formalizing this requirement we can prove that there can be no unbiased deterministic protocol for the Russian cards problem. For purposes of our formal analysis we introduce an epistemic protocol language, and we show that its model checking problem is decidable.
Efficiently incorporating user feedback into information extraction and integration programs
Authors: Xiaoyong Chai, Ba-Quy Vuong, AnHai Doan, Jeffrey F. Naughton
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Many applications increasingly employ information extraction and integration (IE/II) programs to infer structures from unstructured data. Automatic IE/II are inherently imprecise. Hence such programs often make many IE/II mistakes, and thus can significantly benefit from user feedback. Today, however, there is no good way to automatically provide and process such feedback. When finding an IE/II mistake, users often must alert the developer team (e.g., via email or Web form) about the mistake, and then wait for the team to manually examine the program internals to locate and fix the mistake, a slow, error-prone, and frustrating process. In this paper we propose a solution for users to directly provide feedback and for IE/II programs to automatically process such feedback. In our solution a developer U uses hlog, a declarative IE/II language, to write an IE/II program P. Next, U writes declarative user feedback rules that specify which parts of P's data (e.g., input, intermediate, or output data) users can edit, and via which user interfaces. Next, the so-augmented program P is executed, then enters a loop of waiting for and incorporating user feedback. Given user feedback F on a data portion of P, we show how to automatically propagate F to the rest of P, and to seamlessly combine F with prior user feedback. We describe the syntax and semantics of hlog, a baseline execution strategy, and then various optimization techniques. Finally, we describe experiments with real-world data that demonstrate the promise of our solution.
Providing Real-Time Information Services for Public Bus Commuters
Authors: David Morrison, Atul Sajjanhar, Yi-Ping Phoebe Chen
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

This paper investigates RTIS for public bus commuters; identifying their needs and proposing the architecture and design for this service. Considering that the service needs to be extensible, adaptable and interoperative, the new system is based on the use of XML Web Services. This gives the structure flexibility for further development and integration with other like services.
Surveying Users' Opinions and Trends towards Mobile Payment Issues
Authors: Iosif Androulidakis, Chris Basios, Nikos Androulidakis
Venue: Proceeding of the 2008 conference on Techniques and Applications for Mobile Commerce: Proceedings of TAMoCo 2008 (2008)

The current market penetration of mobile phones in conjunction with an expected growth of m-commerce offers a high potential for the growth of m-payment over the next few years. Although research analysts have predicted that m-payments will gain a significant foothold in the coming years, the requisite high-speed data services and the desirable demand will not materialize overnight. In addition, a wide variety of m-payment technologies are available today, but the value of such services is not clear yet. In order to investigate some key issues related to m-payment from a user's perspective, this paper explores and presents the mobile users' opinions and estimations about these new services via a survey conducted among 315 students in the University of Ioannina, Greece.
Face recognition in JPEG and JPEG2000 compressed domain
Authors: Kresimir Delac, Mislav Grgic, Sonja Grgic
Venue: Image and Vision Computing (2009)

In this paper we investigate the potential of performing face recognition in JPEG and JPEG2000 compressed domain. This is achieved by avoiding full decompression and using transform coefficients as input to face recognition algorithms. We propose a new comparison methodology and by employing it show that face recognition can efficiently be implemented directly into compressed domain. In the first part of our experiment we use all the available transform coefficients and show that recognition rates are comparable and in some cases even higher than recognition rates obtained by using pixels from uncompressed images (standard face recognition approach). In the second part, we propose an effective coefficient preselection method (applicable both in JPEG and JPEG2000 compressed domain). Our results show that by using the proposed method, recognition rates can be significantly improved while additionally reducing computational time. Finally, we propose what a hypothetical compressed domain face recognition system should look like.
Toward Aligning Computer Programming with Clear Thinking via the Reason Programming Language
Authors: Selmer Bringsjord, Jinrong Li
Venue: Proceeding of the 2008 conference on Current Issues in Computing and Philosophy (2008)

Logic has long set itself the task of helping humans think clearly. Certain computer programming languages, most prominently the Logo language, have been billed ashelping young people become clearer thinkers. It is somewhat doubtful that such languages can succeed in this regard, but at any rate it seems sensible to explore an approach to programming that guarantees an intimate link between the thinking required to program and the kind of clear thinking that logic has historically sought to cultivate. Accordingly, Bringsjord has invented a new computer programming language, Reason, one firmly based in the declarative programming paradigm, and specifically aligned with the core skills constituting clear thinking. Reason thus offers the intimate link in question to all who would genuinely use it.
A distributed architecture for data mining and integration
Authors: Malcolm P. Atkinson, Jano I. van Hemert, Liangxiu Han, Ally Hume, Chee Sun Liew
Venue: Proceedings of the second international workshop on Data-aware distributed computing (2009)

This paper presents the rationale for a new architecture to support a significant increase in the scale of data integration and data mining. It proposes the composition into one framework of (1) data mining and (2) data access and integration. We name the combined activity DMI. It supports enactment of DMI processes across heterogeneous and distributed data resources and data mining services. It posits that a useful division can be made between the facilities established to support the definition of DMI processes and the computational infrastructure provided to enact DMI processes. Communication between those two divisions is restricted to requests submitted to gateway services in a canonical DMI language. Larger-scale processes are enabled by incremental refinement of DMI-process definitions often by recomposition of lower-level definitions. Autonomous evolution of data resources and services is supported by types and descriptions which will support detection of inconsistencies and semi-automatic insertion of adaptations. These architectural ideas are being evaluated in a feasibility study that involves an application scenario and representatives of the community.
Facial Feature Extraction Using Geometric Feature and Independent Component Analysis
Authors: Toan Thanh Do, Thai Hoang Le
Venue: Knowledge Acquisition: Approaches, Algorithms and Applications: Pacific Rim Knowledge Acquisition Workshop, PKAW 2008, Hanoi, Vietnam, December 15-16, 2008, Revised Selected Papers (2009)

Automatic facial feature extraction is one of the most important and attempted problems in computer vision. It is a necessary step in face recognition, facial image compression. There are many methods have been proposed in the literature for the facial feature extraction task. However, all of them have still disadvantage such as not complete reflection about face structure, face texture. Therefore, a combination of different feature extraction methods which can integrate the complementary information should lead to improve the efficiency of feature extraction stage. In this paper we describe a methodology for improving the efficiency of feature extraction stage based on the association of two methods: geometric feature based method and Independent Component Analysis (ICA) method. Comparison of two methods of facial feature extraction: geometric feature based method combined with PCA method (called GPCA) versus geometric feature based method combined with ICA method (called GICA) on CalTech dataset has demonstrated the efficiency of GICA method. Our results show that GICA achieved good performance 96.57% compared to 94.70% of GPCA method. Furthermore, we compare two methods mentioned above on our dataset, with performance of GICA being 98.94% better 96.78% of GPCA method. The experiment results have confirmed the benefits of the association geometric feature based method and ICA method in facial feature extraction.
Immune Particle Swarm Optimization for Support Vector Regression on Forest Fire Prediction
Authors: Yan Wang, Juexin Wang, Wei Du, Chuncai Wang, Yanchun Liang, Chunguang Zhou, Lan Huang
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

An Immune Particle Swarm Optimization (IPSO) for parameters optimization of Support Vector Regression (SVR) is proposed in this article. After introduced clonal copy and mutation process of Immune Algorithm (IA), the particle of PSO is considered as antibodies. Therefore, evaluated the fitness of particles by the Cross Validation standard, the best individual mutated particle for each cloned group will be selected to compose the next generation to get better parameters ¿C ¿ of SVR. It can construct high accuracy and generalization performance regression model rapidly by optimizing the combination of three SVR parameters at the same time. Under the datasets generated from sincx function with additive noise and forest fires dataset, experimental results show that the new method can determine the parameters of SVR quickly and the gotten models have superior learning accuracy and generalization performance.
Effects of Using a Research Context Ontology for Query Expansion
Authors: Carola Carstens
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

This thesis investigates the question whether and how ontologies such as the ones currently evolving in the Semantic Web can serve as knowledge structures for the generation of query expansion terms in information retrieval systems. This issue is examined using a specific example domain, namely educational research. Initial results support the already well-researched finding that query expansion can increase recall. Subsequent experiments will focus on comparing the effectiveness of thesaurus and ontology-based query expansion, on identifying ontological relationships which are especially useful for the generation of query expansion terms in the domain of educational research, and on evaluating the usefulness of different ontological relationships as expansion terms for different types of queries, as well as for different query expansion modes.
Modelling dynamic systems using ANFIS
Authors: Efren Gorrostieta, Artemio Sotomayor, Marco Antonio Aceves, Carlos Pedraza, J. M. Ramos
Venue: Proceedings of the international conference on Computational and information science 2009 (2009)

The next paper presents the development of a non-lineal dynamic system modelling using the combination of neural networks with fuzzy logic. The first approximation method used is ANFIS. With this method, the most significant rules were selected and slightly modified to obtain a significantly better result. This procedure was applied on a case study where an environmental system was modelled.
On a Method of Paired Representation: Enhancement and Decomposition by Series Direction Images
Authors: Artyom M. Grigoryan, Khalil Naghdali
Venue: Journal of Mathematical Imaging and Vision (2009)

In the paired representation, a two-dimensional (2-D) image is represented uniquely by a complete set of 1-D signals, so-called splitting-signals, that carry the spectral information of the image at frequency-points of specific subsets that divide the whole domain of frequencies. Image processing can thus be reduced to processing of splitting-signals and such process requires a modification of only a few spectral components of the image, for each signal. For instance, the ¿-rooting method of image enhancement can be fulfilled through processing one or a few splitting-signals. Such process can even be accomplished without computing the 2-D Fourier transforms of the original and enhanced images. To show that, we present an effective formula for inverse 2-D N×N-point paired transform, where N is a power of 2. The representation of the image and 2-D DFT by paired splitting-signals leads to the new concepts of direction and series images, that define the resolution and periodic structures of the image components, which can be packed in the form of the "resolution map" of the size of the image. Simple method of image enhancement by series images is described.
Creativity and Artificial Intelligence: A Conceptual Blending Approach, 1st edition
Authors: Cmara Pereira, Francisco
Venue: Applications Of Cognitive Linguistics (2007)

With CD-ROM. Creativity and Artificial Intelligence: A Conceptual Blending Approach takes readers into a computationally plausible model of creativity. Inspired by a thorough analysis of work on creativity from the areas of philosophy, psychology, cognitive science, cognitive linguistics and artificial intelligence, the author deals with the various processes, principles and representations that lie underneath the act of creativity. Focusing on Arthur Koestler's Bisociations, which eventually lead to Turner and Fauconnier's conceptual blending framework, the book proposes a theoretical model that considers blends and their emergent structure as a fundamental cognitive mechanism. The author thus discusses the computational implementation of several aspects of conceptual blending theory, namely composition, completion, elaboration, frames and optimality constraints. Informal descriptions and examples are supplied to provide non-computer scientists as well as non-cognitive linguists with clear insights into these ideas. Several experiments are made, and their results are discussed, with particular emphasis on the validation of the creativity and conceptual blending aspects. Written by a researcher with a background in artificial intelligence, the book is the result of several years of exploration and discussion from different theoretical perspectives. As a result, the book echoes some of the criticism made on conceptual blending and creativity in artificial intelligence, and thus proposes improvements in both areas, with the aim of being a constructive contribution to these very intriguing, yet appealing, research orientations.
Design and control of a two-mode monopod
Authors: Gaurav Sukhatme
Venue:  (2008)

Legged machines can traverse terrain unreachable by wheels or tracks. Similarly running machines have capabilities that exceed those of walking machines. The running machines constructed thus far have mainly served as existence proofs of various single locomotion modes. In this thesis we present a robot design that incorporates two locomotion modes, hopping and scooting, with a minimal number of actuators, and the added capability of being able to transition between modes as needed. We develop controllers for both modes and demonstrate their feasibility in simulation. We also present experimental results for a scooting robot.
Objective measurement of transcoded video quality in mobile applications
Authors: Ramanathan Palaniappan, Nitin Suresh, Nikil Jayant
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

This paper evaluates the performance of a zero reference metric used in objective measurement of the quality of video which has been transcoded at various bit rates to suit the needs of the 3G mobile environment. This Zero reference metric (AVQ) has been shown to exhibit a high correlation with Mean Time Between Failures (MTBF) [1], [2] which is a functional measure of video quality representing how often a typical viewer observes a noticeable visual error. This paper reports on the performance of transcoders with MPEG2 video at 512 kbps as input and 192, 256 and 384 kbps versions of MPEG-4 Part 2 Visual and MPEG-4 Part 10 (H.264 ) as outputs. We use AVQ-estimated MTBF and PSNR as quality metrics. Our results show that MTBF better reflects subtleties such as lowered visual quality during significant motion. It also provides a more descriptive spread of quality in the 192-384 kbps range of transcoder outputs.
Graph theoretical approach to study eQTL
Authors: Yang Huang, Stefan Wuchty, Michael T. Ferdig, Teresa M. Przytycka
Venue: Bioinformatics (2009)

Motivation: Analysis of expression quantitative trait loci (eQTL) significantly contributes to the determination of gene regulation programs. However, the discovery and analysis of associations of gene expression levels and their underlying sequence polymorphisms continue to pose many challenges. Methods are limited in their ability to illuminate the full structure of the eQTL data. Most rely on an exhaustive, genome scale search that considers all possible locus–gene pairs and tests the linkage between each locus and gene. Result: To analyze eQTLs in a more comprehensive and efficient way, we developed the Graph based eQTL Decomposition method (GeD) that allows us to model genotype and expression data using an eQTL association graph. Through graph-based heuristics, GeD identifies dense subgraphs in the eQTL association graph. By identifying eQTL association cliques that expose the hidden structure of genotype and expression data, GeD effectively filters out most locus–gene pairs that are unlikely to have significant linkage. We apply GeD on eQTL data from Plasmodium falciparum, the human malaria parasite, and show that GeD reveals the structure of the relationship between all loci and all genes on a whole genome level. Furthermore, GeD allows us to uncover additional eQTLs with lower FDR, providing an important complement to traditional eQTL analysis methods. Contact: przytyck@ncbi.nlm.nih.gov
Big-step normalisation
Authors: Thorsten Altenkirch, James Chapman
Venue: Journal of Functional Programming (2009)

Traditionally, decidability of conversion for typed λ-calculi is established by showing that small-step reduction is confluent and strongly normalising. Here we investigate an alternative approach employing a recursively defined normalisation function which we show to be terminating and which reflects and preserves conversion. We apply our approach to the simply typed λ-calculus with explicit substitutions and βη-equality, a system which is not strongly normalising. We also show how the construction can be extended to system T with the usual β-rules for the recursion combinator. Our approach is practical, since it does verify an actual implementation of normalisation which, unlike normalisation by evaluation, is first order. An important feature of our approach is that we are using logical relations to establish equational soundness (identity of normal forms reflects the equational theory), instead of the usual syntactic reasoning using the Church–Rosser property of a term rewriting system.
Multi-wall carbon nanotubes in microwaves
Authors: S. Moseenkov, V. Kuznetsov, A. Usoltseva, I. Mazov, A. Ischenko, T. Buryakov, O. Anikeeva, A. Romanenko, P. Kuzhir, D. Bychenok, K. Batrakov, S. Maksimenko
Venue: Proceedings of the 1st WSEAS international conference on Nanotechnology (2009)

The electromagnetic (EM) response of multi-wall carbon nanotubes (MWCNT) prepared by chemical vapor decomposition (CVD) method has been analyzed in the microwave frequency range. EM absorption properties of MWCNT depend on their medium diameter related to their conductivity, concentration of highly dispersed Fe-Co metal particles localized inside and in the tips of nanotube. MWCNT display high EM absorption in microwaves and can be used as fillers for the design of the effective EM coatings.