ppxscal/embedding_network huggingface dataset:
Word Spotting in Archive Documents Using Shape Contexts
Authors: Josep Lladós, Partha Pratim-Roy, José A. Rodríguez, Gemma Sánchez
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

The analysis of historical document images is not only interesting for the preservation of historical heritage but also for the extraction of semantic knowledge. In this paper we present a word spotting approach to find keyword images in digital archives. Detected words allow to construct metadata on document contents for indexing and retrieval purposes. Instead of using OCR based approches that would require accurate segmentation and high image quality, we propose a shape recognition method based on the well-known shape context descriptor. Our method is proven to be robust under hightly distorted and noisy document images, a usual drawback in old document analysis. It has been used in a real application scenario, the Collection of Border Records of the Girona Archive. In particular, spotted keywords are used to extract knowledge on personal data of people referred in the documents.
Recent researches on multivariate spline and piecewise algebraic variety
Authors: Ren-Hong Wang
Venue: Journal of Computational and Applied Mathematics (2008)

The multivariate splines as piecewise polynomials have become useful tools for dealing with Computational Geometry, Computer Graphics, Computer Aided Geometrical Design and Image Processing. It is well known that the classical algebraic variety in algebraic geometry is to study geometrical properties of the common intersection of surfaces represented by multivariate polynomials. Recently the surfaces are mainly represented by multivariate piecewise polynomials (i.e. multivariate splines), so the piecewise algebraic variety defined as the common intersection of surfaces represented by multivariate splines is a new topic in algebraic geometry. Moreover, the piecewise algebraic variety will be also important in computational geometry, computer graphics, computer aided geometrical design and image processing. The purpose of this paper is to introduce some recent researches on multivariate spline, piecewise algebraic variety (curve), and their applications.
An Alignment-Free Distance Measure for Closely Related Genomes
Authors: Bernhard Haubold, Mirjana Domazet-Loso, Thomas Wiehe
Venue: Proceedings of the international workshop on Comparative Genomics (2008)

Phylogeny reconstruction on a genome scale remains computationally challenging even for closely related organisms. Here we propose an alignment-free pairwise distance measure, K r, for genomes separated by less than approximately 0.5 mismatches/nucleotide. We have implemented the computation of K r based on enhanced suffix arrays in the program kr, which is freely available from guanine.evolbio.mpg.de/kr/. The software is applied to genomes obtained from three sets of taxa: 27 primate mitochondria, eight Staphylococcus agalactiae strains, and 12 Drosophila species. Subsequent clustering of the K r values always recovers phylogenies that are similar or identical to the accepted branching order.
Taxonomy of nominal type histogram distance measures
Authors: Sung-Hyuk Cha
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

Distance or similarity measures are of fundamental importance to pattern classification, clustering, and information retrieval problems. Various distance/similarity measures that are applicable to compare two nominal type histograms are reviewed and categorized in both syntactic and semantic relationships. A correlation coefficient and a hierarchical clustering technique are adopted to reveal similarities among numerous distance/similarity measures.
Spherical Binary Images Matching
Authors: Liu Wei, He Yuanjun
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

In this paper a novel algorithm is presented to match the spherical binary images by measuring the maximal superposition degree between them. Experiments show that our method can match spherical binary images in a more accurate way.
Probabilistic two-dimensional principal component analysis and its mixture model for face recognition
Authors: Haixian Wang, Sibao Chen, Zilan Hu, Bin Luo
Venue: Neural Computing and Applications (2008)

Recently, two-dimensional principal component analysis (2DPCA) as a novel eigenvector-based method has proved to be an efficient technique for image feature extraction and representation. In this paper, by supposing a parametric Gaussian distribution over the image space (spanned by the row vectors of 2D image matrices) and a spherical Gaussian noise model for the image, we endow the 2DPCA with a probabilistic framework called probabilistic 2DPCA (P2DPCA), which is robust to noise. Further, by using the probabilistic perspective of P2DPCA, we extend the P2DPCA to a mixture of local P2DPCA models (MP2DPCA). The MP2DPCA offers us a method of being able to model faces in unconstrained (complex) environment. The model parameters could be fitted on the basis of maximum likelihood (ML) estimation via the expectation maximization (EM) algorithm. The experimental recognition results on UMIST, AR face database, and the face recognition (FR) data collected at University of Essex confirm the effectivity of the proposed methods.
New Methodology of Information Education with "Computer Science Unplugged"
Authors: Tomohiro Nishida, Yukio Idosaka, Yayoi Hofuku, Susumu Kanemune, Yasushi Kuno
Venue: Proceedings of the 3rd international conference on Informatics in Secondary Schools - Evolution and Perspectives: Informatics Education - Supporting Computational Thinking (2008)

We introduced "Computer Science Unplugged" to our classes in junior and senior high schools. "Unplugged" is an education method of computer science without students using a computer at all. For our classes, we developed original teaching materials and methods for Unplugged. As a result, the students could learn the topics of computer science with interest by using Unplugged. They enjoyed the games in Unplugged and thought about the topics deeply at the same time. We confirmed that students enhanced their motivations, thinking abilities, and imaginations.
From Charging for QoS to Charging for QoE: Internet Economics in the Era of Next Generation Multimedia Networks
Authors: Peter Reichl
Venue: Proceedings of the 1st international conference on Autonomous Infrastructure, Management and Security: Inter-Domain Management (2007)

Over the past years, telecommunications as a research area has grown far beyond pure communications engineering and today covers the entire economic value chain up to the end customer. As a consequence, "Internet Economics" has been established as a new and promising research area of its own, aiming at a fresh perspective on familiar problems. The basic idea of this interdisciplinary approach is to understand communication networks as economical rather than technical systems, and thus to describe and solve networking issues through the use of economic concepts and techniques. This tutorial gives an introduction into basic notions, concepts and results of this highly interdisciplinary field. We start with summarizing the fundamental framework, focusing on central concepts from operations research, game theory and micro-economics, and introduce basic concepts like equilibria, efficiency, competition models and fairness. This serves as starting point for a comprehensive review of traditional charging schemes like congestion pricing, smart market and Progressive Second-Price auctions, Paris Metro Pricing, effective bandwidth pricing, Cumulus Pricing and the Contract-Balancing Mechanism. The second part of the tutorial starts with a brief overview on relevant charging protocols and architectures, with a special emphasis on the 3GPP IP Multimedia Subsystem (IMS) as a promising candidate for an All-IP Next Generation Network architecture. Finally, we discuss the imminent paradigm shift from charging for Quality-of-Service (QoS) to charging for Quality-of-User Experience (QoE) and present two recent proposals as important examples of current research trends in this stimulating area.
On the Processing Power of Protozoa
Authors: Mark Daley
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

The ciliated protozoa are a diverse, and ubiquitously occuring, group of unicellular eukaryotic organisms of striking complexity. Almost all ciliates are binucleated; that is, unlike other eukaryotes, they have two types of nuclei: micronuclei and macronuclei. The macronuclei behave functionally as one would typically expect of a eukaryotic nucleus: they express proteins and take care of the general "housekeeping" functions of the cell. Ciliate macronuclei are ampliploid and contain very little non-coding DNA. The diploid micronuclei, arranged much more like a typical eukaryotic nucleus, are inert during the "day-to-day" functioning of the cell and serve instead as a storehouse for germline information.
Dimensions of Points in Self-similar Fractals
Authors: Jack H. Lutz, Elvira Mayordomo
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

We use nontrivial connections between the theory of computing and the fine-scale geometry of Euclidean space to give a complete analysis of the dimensions of individual points in fractals that are computably self-similar.
Clustering with an N-dimensional extension of Gielis superformula
Authors: Angel Kuri Morales, Edwin Aldana Bobadilla
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

Clustering is the task which allows us to identify groups, distributions or patterns over a set of data. To achieve it we must, first, adopt a measure of likelihood which allows us to group elements of similar characteristics into two or more such clusters. Presently there are several clustering algorithms which appeal to various metrics among which there outstand the ones based on Minkowski's and Mahalanobis' distances. In general this approach yields hyperspherical forms which restrict the fact that some clusters may be represented by irregular N-dimensional bodies. In this paper we use a formula originally developed by Johan Gielis which has been called the "superformula". It allows the generation of N-dimensional bodies of arbitrary shape by modifying certain parameters. This approach allows us to represent a cluster as the set of data contained in a given body without resorting to a metric of distance. Therefore, we replace the idea of nearness by one of membership. To determine the more adequate values of the parameters in the superformula we applied a Genetic Algorithm (GA); the so called Vasconcelos" GA.
Technology devices for older adults to aid self management of chronic health conditions
Authors: Amritpal Singh Bhachu, Nicolas Hine, John Arnott
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

The overall purpose of this study is the enhancement of devices and visualisations used by older adults as part of a telecare system for the self-management of health conditions. The opinions and feelings towards devices that could be used as part of a telecare system were gathered from a range of older people. This was done through the use of technology evaluation workshops, and the subsequent analysis of the collected data using grounded theory and thematic coding methodologies. Presenting healthcare data to an elderly person with chronic health issues, may be an appropriate way to help that person to better manage their condition, if the data can be understood.
Electro-optic Modulation in Passive Synthetic Aperture Imaging Detection
Authors: Yuntao He, Yuesong Jiang, Lin Shen
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

A new passive synthetic aperture imaging detection method is presented. The radiation signal of field of view is received and amplified first, and then the amplified signal is modulated to an optical carrier by electro-optic modulator. The optical signal transmitted by fibers and a fiber array is shaped by the end of the fibers. The image is formed synchronously and directly by an optical system using the fiber array. The approach of the imaging can be used to realize an extremely high resolution detection at microwave, millimeter wave and terahertz frequencies. The application of electro-optic modulation technique in passive synthetic aperture imaging was analyzed carefully and the model of electro-optic modulation was established. And the approximation of small input modulated signal in the electro-optic modulation was discussed. By simulated computation and analyze, the intensity constraint of the modulated signal in electro-optic modulator was gained.
Adaptive replication control based on consensus
Authors: Udo Fritzke,  Jr., Rodrigo Pereira Valentim, Luiz Alberto Ferreira Gomes
Venue: Proceedings of the 2nd workshop on Dependable distributed data management (2008)

This paper presents a meta protocol that allows the dynamic replacement of replication control protocols in replicated databases. The meta protocol is motivated by the diversity of concurrency control and replication control protocols that implement different transaction isolation levels. The replacement of protocols allows applications to dynamically adapt themselves to consistency and data access latency requirements. Such kind of adaptivity is important in mobile systems, where weaker consistency levels are acceptable when nodes are disconnected from a network, but stronger levels may be required when nodes are connected to each other. The paper defines three properties that meta protocol executions have to enforce and specifies a protocol that satisfies these properties. The protocol is based on a transaction execution model, uniform reliable broadcast and uniform consensus. Finally, we outline a dynamic adaptable architecture that is being implemented that includes the meta protocol and that makes use of an aspect oriented framework.
A Novel Method for Cortical Sulcal Fundi Extraction
Authors: Gang Li, Tianming Liu, Jingxin Nie, Lei Guo, Stephen T. Wong
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

Sulcal fundi are 3D curves along the bottom of sulcal regions of the human cerebral cortex. In this paper, we propose a novel automatic method for extraction of sulcal fundi from triangulated cortical surface. Compared to existing methods, the proposed method can find accurate sulcal fundi using curvatures and curvature derivatives without manual interaction. Given a triangulated cortical surface, our method is composed of four steps: estimating curvatures and curvature derivatives for each vertex, detecting the sulcal fundi segments in each triangle, linking the sulcal fundi segments and combining of adjacent sulcal fundi, and connecting breaking sulcal fundi and smoothing using the fast marching method on the cortical surface. The proposed sulcal fundi extraction method is applied to ten normal brain inner cortical surfaces. We quantitatively validated the proposed method of sulcal fundi extraction using manually labeled sulcal fundi by experts as the ground truth.
A Method to Classify Collaboration in CSCL Systems
Authors: Rafael Duque, Crescencio Bravo
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

One of the most important challenges of collaborative learning systems is to offer mechanisms to facilitate the study of the relationships between the collaboration process and the characteristics of the solution (product) built by the learners in this work process. In this article, a machine learning algorithm that generates a set of rules to classify the different forms of collaboration within a group of learners with respect to the quality of the solution built is presented. The algorithm, based on a fuzzy model, is put into practice using data registered in a collaborative learning environment.
An Automatic Tracking Approach for Monitoring Moving Targets from Meteorological Satellite Image Sequence Based on Point-Pattern Matching
Authors: Zhongyang Guo, Xiaoyan Dai, Jianping Wu
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Identification and tracking of moving targets from image sequence is an active branch of image processing and computer vision field. In meteorology, automatic tracking of the trajectories of convective systems from meteorological satellite remote sensing images remains a challenging issue. To monitor the evolution of Mesoscale Convective Systems (MCS) over the Tibetan Plateau in China in summer, an automatic tracking approach based on point-pattern matching is proposed using GMS brightness temperature data. The method tracks the trajectories of MCS by determining the spatial location relationship between sets of points representing MCSs on consecutive images. The experimental results demonstrate the capability of the proposed method to track the evolution of MCS life cycles, especially which have smaller area and faster velocity of displacement. Furthermore, the tracking results show the activity frequency and geographic distribution, and the trajectories and propagation of MCS over the Tibetan Plateau from June to August 1999-2000.
A Shuffled Complex Evolution of Particle Swarm Optimization Algorithm
Authors: Jiang Yan, Hu Tiesong, Huang Chongchao, Wu Xianing, Gui Faling
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

A shuffled complex evolution of particle swarm optimization algorithm called SCE-PSO is introduced in this paper. In the SCE-PSO, a population of points is sampled randomly in the feasible space. Then the population is partitioned into several complexes, which is made to evolve based on PSO. At periodic stages in the evolution, the entire population is shuffled and points are reassigned to complexes to ensure information sharing. Both theoretical and numerical studies of the SCE-PCO are presented. Five optimization problems with commonly used functions are utilized for evaluating the performance of the proposed algorithm, and the performance of the proposed algorithm is compared to PSO to demonstrate its efficiency.
Distributed Approximation Algorithm for Resource Clustering
Authors: Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Hubert Larchevêque
Venue: Proceedings of the 15th international colloquium on Structural Information and Communication Complexity (2008)

In this paper, we consider the clustering of resources on large scale platforms. More precisely, we target parallel applications consisting of independant tasks, where each task is to be processed on a different cluster. In this context, each cluster should be large enough so as to hold and process a task, and the maximal distance between two hosts belonging to the same cluster should be small in order to minimize latencies of intra-cluster communications. This corresponds to maximum bin covering with an extra distance constraint. We describe a distributed approximation algorithm that computes resource clustering with coordinates in ¿ in O(log2 n) steps and O(nlogn) messages, where n is the overall number of hosts. We prove that this algorithm provides an approximation ratio of $\frac{1}{3}$.
Scheduling for Reliable Execution in Autonomic Systems
Authors: Terry Tidwell, Robert Glaubius, Christopher Gill, William D. Smart
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

Scheduling the execution of multiple concurrent tasks on shared resources such as CPUs and network links is essential to ensuring the reliable operation of many autonomic systems. Well known techniques such as rate-monotonic scheduling can offer rigorous timing and preemption guarantees, but only under assumptions (i.e., a fixed set of tasks with well-known execution times and invocation rates) that do not hold in many autonomic systems. New hierarchical scheduling techniques are better suited to enforce the more flexible execution constraints and enforcement mechanisms that are required for autonomic systems, but a rigorous foundation for verifying and enforcing concurrency and timing guarantees is still needed for these approaches. The primary contributions of this paper are: (1) a scheduling policy design technique that can use different decision models across a wide range of systems models, and an example of how a specific (Markov Decision Process) decision model can be applied to a basic multi-threaded system model; (2) novel model checking techniques that can evaluate the behavior of the system model when it is placed under the control of the resulting scheduling policy; and (3) an evaluation of those scheduling policy design and model checking techniques for a simple but representative example of the kinds of execution scenarios that can arise in autonomic systems.
Universal active current filter using single third-generation current conveyor
Authors: Chun-Ming Chang, Ruei-Hsuan Yang, Shu-Hui Tu, Chun-Li Hou, Jiun-Wei Horng
Venue: Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science (2008)

The realization of the second-order universal (low-pass, band-pass, high-pass, band-reject, and all-pass) active current filter using a single third-generation current conveyor (CCIII), two grounded capacitors, and two resistosr is proposed in this paper. Three input signals and one tunable resistance determine the five generic filtering output signals. H-Spice simulations with 0.35µm process are used to validate the theoretical predictions of the filtering output signals, and show the low sensitivities to the passive components, and the sensitivity frequency responses.
This Is Not a Catalog: Philip Glass's Works Online
Authors: Mark Podlaseck, Robert Hoch, Edith Schoenberg
Venue: IEEE MultiMedia (2003)

One of the paradoxes of the World Wide Web is that while we frequently find ourselves navigating to online media, we rarely use online media to help us with this navigation. Consider, for example, the conventions of (legally) browsing for music on the Web.
Plato: A Preservation Planning Tool Integrating Preservation Action Services
Authors: Hannes Kulovits, Christoph Becker, Michael Kraxner, Florian Motlik, Kevin Stadler, Andreas Rauber
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

The creation of a concrete plan for preserving a collection of digital objects of a specific institution necessitates the evaluation of available solutions against clearly defined and measurable criteria. This process is called preservation planning and aids in the decision making process to find the most suitable preservation strategy considering the institution's requirements, the planning context and available actions applicable to the objects contained in the repository. Performed manually, this evaluation promises to be hard and tedious work, inasmuch as there exist numerous potential preservation action tools of different quality. In this demonstration, we present Plato [4], an interactive software tool aimed at creating preservation plans.
Pairings on Hyperelliptic Curves with a Real Model
Authors: Steven D. Galbraith, Xibin Lin, David J. Mireles Morales
Venue: Proceedings of the 2nd international conference on Pairing-Based Cryptography (2008)

We analyse the efficiency of pairing computations on hyperelliptic curves given by a real model using a balanced divisor at infinity. Several optimisations are proposed and analysed. Genus two curves given by a real model arise when considering pairing friendly groups of order dividing p 2¿ p + 1. We compare the performance of pairings on such groups in both elliptic and hyperelliptic versions. We conclude that pairings can be efficiently computable in real models of hyperelliptic curves.