ppxscal/embedding_network huggingface dataset:
A Practical Approach for Writer-Dependent Symbol Recognition Using a Writer-Independent Symbol Recognizer
Authors: Joseph J. LaViola Jr., Robert C. Zeleznik
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

We present a practical technique for using a writerindependent recognition engine to improve the accuracy and speed while reducing the training requirements of a writerdependent symbol recognizer. Our writer-dependent recognizer uses a set of binary classifiers based on the AdaBoost learning algorithm, one for each possible pairwise symbol comparison. Each classifier consists of a set of weak learners, one of which is based on a writer-independent handwriting recognizer. During online recognition, we also use the n-best list of the writerindependent recognizer to prune the set of possible symbols and thus reduce the number of required binary classifications. In this paper, we describe the geometric and statistical features used in our recognizer and our all-pairs classification algorithm. We also present the results of experiments that quantify the effect incorporating a writer-independent recognition engine into a writer-dependent recognizer has on accuracy, speed, and user training time.
A Proposal of Service System Development Framework with Multi-Agents
Authors: Jun Sawamoto, Dilmurat Tilwaldi, Tsutomu Okawa, Hidekazu Tsuji
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

The research and development results of agent technology are awaited as the software solution with autonomy and social ability, which can provide the way to realize social activities on the Internet. However, the current status of the agent research is that research is for a specific application domain and is not so much generalized , and it is hard to apply the framework of the existing research to other fields. Moreover, it is thought that practical usage of agent is in immature state that there are few practical application examples and the system development methodology is not sufficient. In this research, the problem solving system by the multi-agents is first shown as an application development framework by the agents. Then, we present usage of templates of the agent model and the task model as the development support technique. And the evaluation according to an application construction experiment in the field of remote product management is discussed.
Bounds for Ramsey numbers of complete graphs dropping an edge
Authors: Yusheng Li, Jian Shen
Venue: European Journal of Combinatorics (2008)

Let K"n-e be a graph obtained from a complete graph of order n by dropping an edge, and let G"p be a Paley graph of order p. It is shown that if G"p contains no K"n-e, then r(K"n"+"1-e)>=2p+1. For example, G"1"4"9"3 contains no K"1"3-e, so r(K"1"4-e)>=2987, improving the old bound 2557. It is also shown that r(K"2@?+G)@?4r(G,K"2@?+G)-2, implying that r(K"n-e)@?4r(K"n"-"2,K"n-e)-2.
VOIP-telephone service: Economic efficiencies and policy implications
Authors: Sangho Seo
Venue: Telematics and Informatics (2008)

The primary purpose of this study is to estimate, empirically, the economic efficiency of voice-over-Internet-protocol (VOIP) technology and discuss how the emergence of VOIP technology is effective in leading to additional competition in US local telecommunications markets. Probit regression analyses, using data from the 2005 Television and Cable Fact Book the Federal Communications Commission and the US Government Census, reveal that the emergence of VOIP technology gives cable operators an incentive to deploy cable telephony in a local market where entry conditions are not favorable to deployment of circuit-switched technology and proliferates competition in US local telecommunications markets.
Design of smallest size two-dimensional linear-phase FIR filters with magnitude error constraint
Authors: Xiaoping Lai
Venue: Multidimensional Systems and Signal Processing (2007)

This paper presents an online procedure that produces the smallest feasible size of two-dimensional FIR filters with prescribed magnitude error constraint. The procedure uses the mean square normalized error of constrained and unconstrained least-square filters to produce the initial and the subsequent sizes that converge to the smallest feasible one in a few iterations, where the constrained least-square filters are defined as the least-square filters satisfying the magnitude error constraint. The procedure finally returns a smallest size filter that satisfies the magnitude error constraint and has least total squared magnitude error. Design examples of diamond-shaped, rectangular, and elliptic filters are provided, and comparisons with an exhaustive search are given.
Layered image resizing in compression domain
Authors: Ci Wang, Ping Xue, Weisi Lin
Venue: Image Communication (2008)

As an efficient unitary transform, the discrete cosine transform (DCT) has been widely adopted in compression standards. Most compressed images and videos are stored in the DCT format, and from time to time, they need to be resized for various transmission channels and consumer terminals. In this paper, we investigate existing resizing schemes, focusing on the difference of short and long basis vector truncation. A layered resizing scheme is then proposed based on the above analysis, where compressed images are divided into low- and high-frequency layers. The DCT vectors of these two layers are truncated with different word lengths, and then form the elementary layer (EL) and the enhancement layer (EH) of the downsampled image. The EL and EH can be transmitted together or separately according to the bandwidth available. An upsampling scheme is also provided in this paper to recover visual details. Experimental results show improvements of the proposed approach over existing resizing schemes, which can be explained since its frequency response is closer to the ideal downsample filter. The new approach can cater for user terminals' display limitation and channel bandwidth constraints, with additional scalability.
Enabling Architecture Changes in Distributed Web-Applications
Authors: Johannes Meinecke, Martin Gaedke, Christopher Thiele
Venue: Proceedings of the 2007 Latin American Web Conference (2007)

Engineering methods for Web applications that do not take changes of the system environment into account are in danger of planning across purposes with reality. Modern Web applications are characterized by dynamically evolving architectures of loosely coupled content sources, components and services from multiple organizations. The evolution of such ecosystems poses a problem to management and maintenance. Up-to-date architectural information about the components and their relationships is required in different places within the system. However, this is problematic, because, manual propagation of changes in system descriptions is both costly and error-prone. In this paper, we therefore describe how the publish-subscribe principle can be applied to automate the handling of architecture changes via a loosely-coupled event mechanism. We investigate relevant architecture changes and propose a concrete system of subscription topics and event compositions. The practicality of the approach is demonstrated by means of an implemented support system that is compliant with the WS-Notification specification.
Towards efficient search on unstructured data: an intelligent-storage approach
Authors: Aravindan Raghuveer, Meera Jindal, Mohamed F. Mokbel, Biplob Debnath, David Du
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Applications that create and consume unstructured data have grown both in scale of storage requirements and complexity of search primitives. We consider two such applications: exhaustive search and integration of structured and unstructured data. Current block-based storage systems are either incapable or inefficient to address the challenges bought forth by the above applications. We propose a storage framework to efficiently store and search unstructured and structured data while controlling storage management costs. Experimental results based on our prototype show that the proposed system can provide impressive performance and feature benefits.
On some properties of quasi-MV algebras and √{'} quasi-MV algebras. Part II
Authors: F&#x00e9;lix Bou, Francesco Paoli, Antonio Ledda, Hector Freytes
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

The present paper is a sequel to Paoli F, Ledda A, Giuntini R, Freytes H (On some properties of QMV algebras and &radic;' QMV algebras, submitted). We provide two representation results for quasi-MV algebras in terms of MV algebras enriched with additional structure; we investigate the lattices of subvarieties and subquasivarieties of quasi-MV algebras; we show that quasi-MV algebras, as well as cartesian and flat &radic;' quasi-MV algebras, have the amalgamation property.
Increasing buffer-locality for multiple index based scans through intelligent placement and index scan speed control
Authors: Christian A. Lang, Bishwaranjan Bhattacharjee, Tim Malkemus, Kwai Wong
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Decision support systems are characterized by large concurrent scan operations. A significant percentage of these scans are executed as index based scans of the data. This is especially true when the data is physically clustered on the index columns using the various clustering schemes employed by database engines. Common database management systems have only limited ability to reuse buffer content across multiple running queries due to their treatment of queries in isolation. Previous attempts to coordinate scans for better buffer reuse were limited to table scans only. Attempts for index based scan sharing were non existent or were less than satisfactory due to drifting between scans. In this paper, we describe a mechanism to keep scans using the same index closer together on scan position during scanning. This is achieved via intelligent placement of index scans at scan start time based on their scan ranges and speeds. This is then augmented by adaptive throttling of scan speeds based on the index scans runtime behavior during scan execution. We discuss the challenges in doing it for index scans in comparison to the more common table scan sharing. We show that this can be done with minimal changes to an existing database management system as demonstrated in our DB2 UDB prototype. Our experiments show significant gains in end-to-end response times and disk I/O for TPC-H workloads.
Linear road: a stream data management benchmark
Authors: Arvind Arasu, Mitch Cherniack, Eduardo Galvez, David Maier, Anurag S. Maskey, Esther Ryvkina, Michael Stonebraker, Richard Tibbetts
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

This paper specifies the Linear Road Benchmark for Stream Data Management Systems (SDMS). Stream Data Management Systems process streaming data by executing continuous and historical queries while producing query results in real-time. This benchmark makes it possible to compare the performance characteristics of SDMS' relative to each other and to alternative (e.g., Relational Database) systems. Linear Road has been endorsed as an SDMS benchmark by the developers of both the Aurora [1] (out of Brandeis University, Brown University and MIT) and STREAM [8] (out of Stanford University) stream systems. Linear Road simulates a toll system for the motor vehicle expressways of a large metropolitan area. The tolling system uses "variable tolling" [6, 11, 9]: an increasingly prevalent tolling technique that uses such dynamic factors as traffic congestion and accident proximity to calculate toll charges. Linear Road specifies a variable tolling system for a fictional urban area including such features as accident detection and alerts, traffic congestion measurements, toll calculations and historical queries. After specifying the benchmark, we describe experimental results involving two implementations: one using a commercially available Relational Database and the other using Aurora. Our results show that a dedicated Stream Data Management System can outperform a Relational Database by at least a factor of 5 on streaming data applications.
Design and implementation of a PCO-based protocol for sensor networks
Authors: Roberto Pagliari, Anna Scaglione
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

Sensor networks have been used in a wide range of applications. Considerable research effort is currently devoted to design protocols that allow networks of inexpensive sensors to perform reliable remote control and monitoring functions, in spite of the limitations of each device. Our objective is to demonstrate a fully software implementation of the so called Pulse Coupled Oscillator Protocol, proposed in [2, 6] for the decentralized synchronization of radio devices. The PCO protocol is inspired by a model found in mathematical biology [5]. It is decentralized, scalable and simple, as we will show in our demonstration.
Algebraic theory of recombination spaces
Authors: Peter F. Stadler, Günter P. Wagner
Venue: Evolutionary Computation (1997)

A new mathematical representation is proposed for the configuration space structure induced by recombination, which we call “P-structure.” It consists of a mapping of pairs of objects to the power set of all objects in the search space. The mapping assigns to each pair of parental “genotypes” the set of all recombinant genotypes obtainable from the parental ones. It is shown that this construction allows a Fourier decomposition of fitness landscapes into a superposition of “elementary landscapes.” This decomposition is analogous to the Fourier decomposition of fitness landscapes on mutation spaces. The elementary landscapes are obtained as eigenfunctions of a Laplacian operator defined for P-structures. For binary string recombination, the elementary landscapes are exactly the p-spin functions (Walsh functions), that is, the same as the elementary landscapes of the string point mutation spaces (i.e., the hypercube). This supports the notion of a strong homomorphism between string mutation and recombination spaces. However, the effective nearest neighbor correlations on these elementary landscapes differ between mutation and recombination and among different recombination operators. On average, the nearest neighbor correlation is higher for one-point recombination than for uniform recombination. For one-point recombination, the correlations are higher for elementary landscapes with fewer interacting sites as well as for sites that have closer linkage, confirming the qualitative predictions of the Schema Theorem. We conclude that the algebraic approach to fitness landscape analysis can be extended to recombination spaces and provides an effective way to analyze the relative hardness of a landscape for a given recombination operator.
Suitable notification intensity: the dynamic awareness system
Authors: Yao Wang, Wolfgang Gräther, Wolfgang Prinz
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

Being aware of others' activities has played a vital role in the success of online collaboration. This resulted in the emergence of many groupware systems that provide users with information about the activities of their collaborators in various manners. In virtually all current groupware systems, users are often overburdened by large amounts of unnecessary activity information. This happens because users are most of the time only interested in certain pieces of information for limited durations, while presently there exist no efficient mechanisms for automatically following a user's focus and adjusting the information flow directed at her/him. In this paper we present as a practical solution to this critical problem the dynamic awareness system, which extends the functionality of the BSCW shared workspace system. Key element of the dynamic awareness system is its rule-based inference mechanism to adjust the notification intensity, which reduces the information overload and indirectly allows users to better keep track of relevant events, as well as to manage more efficiently large amounts of shared information. We tested the effectiveness of the dynamic awareness system under real-life circumstances and describe the evaluation results.
Attacking a Swarm with a Band of Liars: evaluating the impact of attacks on BitTorrent
Authors: Marlom A. Konrath, Marinho P. Barcellos, Rodrigo B. Mansilha
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

BitTorrent has become one of the most popular Internet applications, given the number of users and the fraction of the Internet traffic it consumes. Its wide adoption has exposed some potential problems, like selfish peer behavior. Related research efforts so far have focused on modeling the dynamics of swarms, as well as devising incentive mechanisms that improve fairness without sacrificing efficiency. To the best of our knowledge, this is the first paper to evaluate the impact of attacks that exploit BitTorrent vulnerabilities with the sole intention of harming a swarm. The paper sheds light on BitTorrent behavior by presenting state diagrams, describes two attacks, and then evaluates their negative impact in realistic swarm settings. To evaluate the impact of attacks, a discrete-event simulator was developed and validated against an experimental evaluation performed in a controlled environment. Our findings show the seriousness of the problem and should be the basis for the development of new mechanisms to increase BitTorrent security.
Non-parametric Bayesian estimation for multitype branching processes through simulation-based methods
Authors: M. González, J. Martín, R. Martínez, M. Mota
Venue: Computational Statistics Data Analysis (2008)

The problem of statistical inference from a Bayesian outlook is studied for the multitype Galton-Watson branching process, considering a non-parametric framework. The only data assumed to be available are each generation's population size vectors. The Gibbs sampler is used in estimating the posterior distributions of the main parameters of the model, and the predictive distributions for as yet unobserved generations. The algorithm provided is independent of whether the process becomes extinct or not. The method is illustrated with simulated examples.
Beyond EPC - Insights from Multiple RFID Case Studies on the Storage of Additional Data on Tag
Authors: Adam Melski, Lars Thoroe, Thorsten Caus, Matthias Schumann
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

In our contribution, we analyze case studies on the storage of additional data on tag in RFID applications. We identify four basic functions which are pursued by the data-on-tag concept. The results of our analysis provide insight into what benefits can be achieved through the use of data-on-tag applications, which technology is necessary and why a data-onnetwork approach would fail in most of the analyzed cases.
Detection and Monitoring of Passengers on a Bus by Video Surveillance
Authors: Boon Chong Chee, Mihai Lazarescu, Tele Tan
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

This paper presents a method to detect passengers onboard public transport vehicles. The method comprises first an elliptical head detection algorithm using the curvature profile of the human head as a cue. This is followed by applying the geometric blur features which are consistent to affine distortion of the image to keep track of the movement of the head within the vehicle. The profile of the moving heads with respect to each other within a length of time can then be used as indicative features to detect the advent of suspicious behaviour of the passengers.
Poincaré–Birkhoff–Witt theorem for Leibniz n-algebras
Authors: José Manuel Casas, Manuel A. Insua, Manuel Ladra
Venue: Journal of Symbolic Computation (2007)

We construct the universal enveloping algebra of a Leibniz n-algebra and we prove that the category of modules over this algebra is equivalent to the category of representations. We also give a proof of the Poincare-Birkhoff-Witt theorem for universal enveloping algebras of finite-dimensional Leibniz n-algebras using Grobner bases in a free associative algebra.
Lowering Barriers to Interaction: Programming without Code
Authors: Catharine Brand
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

We developed a method of annotating pre-existing software so that an end-user can change the underlying program via an interface created from the annotations and generate new executable code.
A Kind of Dynamic Rough Sets
Authors: Dong Ya Li, Bao Qing Hu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Pawlak's rough set theory is the static rough set theory which is to research and deal with static knowledge. This paper proposes the dynamic rough set theory which is to research and deal with dynamic knowledge, and gives the mathematical expression of dynamic rough sets by defining some concepts such as the elementary transfer coefficients, the D-rough sets and the D-approximate sets, etc, based on dynamic knowledge. And in this paper we also study the transfer characteristic of D-rough sets and give some theorems such as the D-rough set degradation theorem, the D- rough set transform theorem and the transfer equilibrium theorem etc. Finally illustrative examples are further discussed. D-rough set is a common form of Pawlak's rough set, as Pawlak's rough set can be considered as a special case of D-rough set.
Improving the classification of newsgroup messages through social network analysis
Authors: Blaz Fortuna, Eduarda Mendes Rodrigues, Natasa Milic-Frayling
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Improving the classification of newsgroup messages through social network analysis. In this paper, we focus on automatic classification of message replies into several types. For representing messages we consider rich feature sets that combine the standard author reply-to network properties with features derived from four additional structures identified in the data: 1) a network of authors who participate in the same threads, 2) network of authors who post similar content, 3) network of threads sharing common authors, and 4) network of content-related threads. For selected newsgroups we train linear SVM classifiers to identify agreement and disagreement with the original message, and question and answer patterns in the threads. We show that the use of newly defined features substantially improves classification of messages in comparison with the SVM model based only on the standard reply-to network.
Modeling and Validating Spatio-Temporal Conceptual Schemas in XML Schema
Authors: Massimo Franceschet, Angelo Montanari, Donatella Gubiani
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

In this paper, we describe a translation algorithm that maps spatio-temporal conceptual schemas into XML schemas expressed in the W3C XML Schema Language. Moreover, we extend the standard XML Schema validator with a Java library to check spatio-temporal constraints. The resulting framework allows one to validate XML documents containing spatio-temporal information with respect to spatio-temporal conceptual schemas.