On the use of textural features for writer identification in old handwritten music scores

Writer identification consists in determining the writer of a piece of handwriting from a set of writers. In this paper we present a system for writer identification in old handwritten music scores which uses only music notation to determine the author. The steps of the proposed system are the following. First of all, the music sheet is preprocessed for obtaining a music score without the staff lines. Afterwards, four different methods for generating texture images from music symbols are applied. Every approach uses a different spatial variation when combining the music symbols to generate the textures. Finally, Gabor filters and Grey-scale Co-ocurrence matrices are used to obtain the features. The classification is performed using a k-NN classifier based on Euclidean distance. The proposed method has been tested on a database of old music scores from the 17th to 19th centuries, achieving encouraging identification rates.

Calibrating Wireless Sensor Network Simulation Models with Real-World Experiments

This paper studies the energy-efficiency and service characteristics of a recently developed energy-efficient MAC protocol for wireless sensor networks in simulation and on a real sensor hardware testbed. This opportunity is seized to illustrate how simulation models can be verified by cross-comparing simulation results with real-world experiment results. The paper demonstrates that by careful calibration of simulation model parameters, the inevitable gap between simulation models and real-world conditions can be reduced. It concludes with guidelines for a methodology for model calibration and validation of sensor network simulation models.

Dynamic Optimization of SLA-Based Services Scaling Rules

Current advanced cloud infrastructure management solutions allow scheduling actions for dynamically changing the number of running virtual machines (VMs). This approach, however, does not guarantee that the scheduled number of VMs will properly handle the actual user generated workload, especially if the user utilization patterns will change. We propose using a dynamically generated scaling model for the VMs containing the services of the distributed applications, which is able to react to the variations in the number of application users. We answer the following question: How to dynamically decide how many services of each type are needed in order to handle a larger workload within the same time constraints? We describe a mechanism for dynamically composing the SLAs for controlling the scaling of distributed services by combining data analysis mechanisms with application benchmarking using multiple VM configurations. Based on processing of multiple application benchmarks generated data sets we discover a set of service monitoring metrics able to predict critical Service Level Agreement (SLA) parameters. By combining this set of predictor metrics with a heuristic for selecting the appropriate scaling-out paths for the services of distributed applications, we show how SLA scaling rules can be inferred and then used for controlling the runtime scale-in and scale-out of distributed services. We validate our architecture and models by performing scaling experiments with a distributed application representative for the enterprise class of information systems. We show how dynamically generated SLAs can be successfully used for controlling the management of distributed services scaling.

Real-Time Passive Capturing of the GSM Radio

This paper addresses the problem of service development based on GSM handset signaling. The aim is to achieve this goal without the participation of the users, which requires the use of a passive GSM receiver on the uplink. Since no tool for GSM uplink capturing was available, we developed a new method that can synchronize to multiple mobile devices by simply overhearing traffic between them and the network. Our work includes the implementation of modules for signal recovery, message reconstruction and parsing. The method has been validated against a benchmark solution on GSM downlink and independently evaluated on uplink channels. Initial evaluations show up to 99% success rate in message decoding, which is a very promising result. Moreover, we conducted measurements that reveal insights on the impact of signal power on the capturing performance and investigate possible reactive measures.

Context-aware Opportunistic Routing in Mobile Ad-hoc Networks Incorporating Node Mobility

Opportunistic routing (OR) employs a list of candi- dates to improve reliability of wireless transmission. However, list-based OR features restrict the freedom of opportunism, since only the listed nodes can compete for packet forwarding. Additionally, the list is statically generated based on a single metric prior to data transmission, which is not appropriate for mobile ad-hoc networks. This paper provides a thorough perfor- mance evaluation of a new protocol - Context-aware Opportunistic Routing (COR). The contributions of COR are threefold. First, it uses various types of context information simultaneously such as link quality, geographic progress, and residual energy of nodes to make routing decisions. Second, it allows all qualified nodes to participate in packet forwarding. Third, it exploits the relative mobility of nodes to further improve performance. Simulation results show that COR can provide efficient routing in mobile environments, and it outperforms existing solutions that solely rely on a single metric by nearly 20 - 40 %.

Opportunistic Content-Centric Data Transmission During Short Network Contacts

In this paper, we investigate content-centric data transmission in the context of short opportunistic contacts and base our work on an existing content-centric networking architecture. In case of short interconnection times, file transfers may not be completed and the received information is discarded. Caches in content-centric networks are used for short-term storage and do not guarantee persistence. We implemented a mechanism to extend caching on persistent storage enabling the completion of disrupted content transfers. The mechanisms have been implemented in the CCNx framework and have been evaluated on wireless mesh nodes. Our evaluations using multicast and unicast communication show that the implementation can support content transfers in opportunistic environments without significant processing and storing overhead.

Decidability for some justification logics with negative introspection

Justification logics are modal logics that include justifications for the agent's knowledge. So far, there are no decidability results available for justification logics with negative introspection. In this paper, we develop a novel model construction for such logics and show that justification logics with negative introspection are decidable for finite constant specifications.

Clinical outcome of single porcelain-fused-to-zirconium dioxide crowns: a systematic review

STATEMENT OF PROBLEM The increasing demand by patients for esthetic and metal-free restorations has driven the development of ceramic restorations with good esthetic and mechanical stability. Recent clinical studies have investigated the use of zirconium dioxide as a core material for complete crowns and computer-aided-design/computer-aided-manufacturing fabricated restorations. PURPOSE The aim of this systematic review was to evaluate the clinical survival rates of porcelain-fused-to-zirconia (PFZ) single crowns on anterior and posterior teeth and to compare them with metal ceramic (MC) crowns. MATERIAL AND METHODS A systematic search was conducted with PubMed and manual research to identify literature written in English that refers to in vivo studies published from January 1, 1950 through July 1, 2011. Clinical trials that evaluated PFZ and MC single crowns on natural teeth were selected for further analysis. Titles and/or abstracts of articles identified through the electronic searches were reviewed and evaluated for appropriateness. In addition, a hand search of relevant dental journals was peformed, and reference lists of culled articles were screened to identify publications. RESULTS The search resulted in a total of 488 initial matches. Nineteen studies with a total of 3621 crowns met the inclusion criteria. The survival rates of PFZ crowns (total 300) ranged from 92.7% to 100% for a follow-up time of 24 to 39 months, whereas those of MC crowns (total 3321) ranged from 70% to 100% for a follow-up time of 12 to 298 months. Studies that reported long-term results were found only for the MC crown group. CONCLUSIONS The scientific clinical data available to compare PFZ and MC crowns are limited. The survival rates may well be influenced by the selection and appropriate use of the veneering ceramic, and, therefore, additional prospective long-term clinical trials are necessary to draw reliable conclusions.

42'195 Meter ins Rampenlicht - Standortmarketing durch Marathonevents in Schweizer Städten

Mit der Durchführung von Sportevents werden vielfältige Hoffnungen verbunden. Unter anderem können Events Informationen über eine Destination transportieren und dadurch das zukünftige Verhalten von relevanten Zielgruppen wie Touristen oder Investoren beeinflussen. Die vorliegende Studie untersucht anhand von drei Marathonevents die Wechselwirkung zwischen Event und Destination sowie die Strategien zur Optimierung der positiven Effekte. Dabei zeigt sich, dass die Passung der Eventthematik zu den Destinationsschwerpunkten sowie der frühzeitige Einbezug aller relevanten Stake Holder Schlüsselrollen spielen. Alle drei betrachteten Marathonevents nehmen im Standortmarketing der jeweiligen Destination keine zentrale Rolle ein, sondern leisten in moderatem Umfang einen Beitrag zum Destination Branding.

Herbrand Theorems for Substructural Logics

Herbrand and Skolemization theorems are obtained for a broad family of first-order substructural logics. These logics typically lack equivalent prenex forms, a deduction theorem, and reductions of semantic consequence to satisfiability. The Herbrand and Skolemization theorems therefore take various forms, applying either to the left or right of the consequence relation, and to restricted classes of formulas.