Automatic Palaeographic Exploration of Genizah Manuscripts

The Cairo Genizah is a collection of hand-written documents containing approximately 350,000 fragments of mainly Jewish texts discovered in the late 19th century. The fragments are today spread out in some 75 libraries and private collections worldwide, but there is an ongoing effort to document and catalogue all extant fragments. Palaeographic information plays a key role in the study of the Genizah collection. Script style, and–more specifically–handwriting, can be used to identify fragments that might originate from the same original work. Such matched fragments, commonly referred to as “joins”, are currently identified manually by experts, and presumably only a small fraction of existing joins have been discovered to date. In this work, we show that automatic handwriting matching functions, obtained from non-specific features using a corpus of writing samples, can perform this task quite reliably. In addition, we explore the problem of grouping various Genizah documents by script style, without being provided any prior information about the relevant styles. The automatically obtained grouping agrees, for the most part, with the palaeographic taxonomy. In cases where the method fails, it is due to apparent similarities between related scripts

Can Nondeterminism Help Complementation?

Complementation and determinization are two fundamental notions in automata theory. The close relationship between the two has been well observed in the literature. In the case of nondeterministic finite automata on finite words (NFA), complementation and determinization have the same state complexity, namely Theta(2^n) where n is the state size. The same similarity between determinization and complementation was found for Buchi automata, where both operations were shown to have 2^\Theta(n lg n) state complexity. An intriguing question is whether there exists a type of omega-automata whose determinization is considerably harder than its complementation. In this paper, we show that for all common types of omega-automata, the determinization problem has the same state complexity as the corresponding complementation problem at the granularity of 2^\Theta(.).Comment: In Proceedings GandALF 2012, arXiv:1210.202

B\"uchi Complementation and Size-Change Termination

We compare tools for complementing nondeterministic B\"uchi automata with a recent termination-analysis algorithm. Complementation of B\"uchi automata is a key step in program verification. Early constructions using a Ramsey-based argument have been supplanted by rank-based constructions with exponentially better bounds. In 2001 Lee et al. presented the size-change termination (SCT) problem, along with both a reduction to B\"uchi automata and a Ramsey-based algorithm. The Ramsey-based algorithm was presented as a more practical alternative to the automata-theoretic approach, but strongly resembles the initial complementation constructions for B\"uchi automata. We prove that the SCT algorithm is a specialized realization of the Ramsey-based complementation construction. To do so, we extend the Ramsey-based complementation construction to provide a containment-testing algorithm. Surprisingly, empirical analysis suggests that despite the massive gap in worst-case complexity, Ramsey-based approaches are superior over the domain of SCT problems. Upon further analysis we discover an interesting property of the problem space that both explains this result and provides a chance to improve rank-based tools. With these improvements, we show that theoretical gains in efficiency of the rank-based approach are mirrored in empirical performance

Propositional Dynamic Logic for Message-Passing Systems

We examine a bidirectional propositional dynamic logic (PDL) for finite and infinite message sequence charts (MSCs) extending LTL and TLC-. By this kind of multi-modal logic we can express properties both in the entire future and in the past of an event. Path expressions strengthen the classical until operator of temporal logic. For every formula defining an MSC language, we construct a communicating finite-state machine (CFM) accepting the same language. The CFM obtained has size exponential in the size of the formula. This synthesis problem is solved in full generality, i.e., also for MSCs with unbounded channels. The model checking problem for CFMs and HMSCs turns out to be in PSPACE for existentially bounded MSCs. Finally, we show that, for PDL with intersection, the semantics of a formula cannot be captured by a CFM anymore

Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank

International audienceIn a preceding paper, automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-finite and even transfinite words studied by Buchi Kleene's theorem has been generalized to these words. We show that deterministic automata do not have the same expressive power. Despite this negative result, we prove that rational sets of words of finite ranks are closed under complementation

Predictive factors related to the progression of periodontal disease in patients with early rheumatoid arthritis: A cohort study

Background: Rheumatoid arthritis (RA) and periodontal disease are inter-related conditions. However, factors predictive of periodontal disease progression in patients with early rheumatoid arthritis (eRA) are lacking. The aim of this study was to identify factors associated with the progression of clinical attachment loss (CAL) in interproximal dental sites of eRA patients. Methods: Twenty-eight eRA patients were evaluated for the progression of CAL at 280 interproximal dental sites at 1 year of follow-up. Markers of RA activity (rheumatoid factor, erythrocyte sedimentation rate, and C-reactive protein), a marker of bone resorption (Dickkopf-related protein 1), Disease Activity Score 28 and Simple Disease Activity Index were included as potential systemic predictive factors. Plaque index, gingival index, pocket depth, clinical attachment level and Dickkopf-related protein 1 in crevicular fluid at baseline were included as potential local predictive factors. Data were analysed in a hierarchical structure using generalised linear mixed models for progression at each site (> 2 mm) during follow-up. Results: C-reactive protein level was the most important predictive systemic factor for the progression of CAL. The mean CAL and a high degree of gingival inflammation in interproximal sites at baseline were important predictive local factors (p < 0.0001). Patients who received combined treatment with disease-modifying antirheumatic drugs and corticosteroids exhibited less CAL (p < 0.0001). The predictive value of the generalised linear mixed model for progression was 85%. Conclusions: Systemic factors, including RA disease activity and baseline periodontal condition, were associated with periodontal progression. Pharmacological treatment may affect periodontal progression in patients with early RA

A Complete Axiom System for Propositional Interval Temporal Logic with Infinite Time

Interval Temporal Logic (ITL) is an established temporal formalism for reasoning about time periods. For over 25 years, it has been applied in a number of ways and several ITL variants, axiom systems and tools have been investigated. We solve the longstanding open problem of finding a complete axiom system for basic quantifier-free propositional ITL (PITL) with infinite time for analysing nonterminating computational systems. Our completeness proof uses a reduction to completeness for PITL with finite time and conventional propositional linear-time temporal logic. Unlike completeness proofs of equally expressive logics with nonelementary computational complexity, our semantic approach does not use tableaux, subformula closures or explicit deductions involving encodings of omega automata and nontrivial techniques for complementing them. We believe that our result also provides evidence of the naturalness of interval-based reasoning

Biodegradable Polymers in Bone Tissue Engineering

The use ofdegradable polymers in medicine largely started around the mid 20th century with their initial use as in vivo resorbing sutures. Thorough knowledge on this topic as been gained since then and the potential applications for these polymers were, and still are, rapidly expanding. After improving the properties of lactic acid-based polymers, these were no longer studied only from a scientific point of view, but also for their use in bone surgery in the 1990s. Unfortunately, after implanting these polymers, different foreign body reactions ranging from the presence of white blood cells to sterile sinuses with resorption of the original tissue were observed. This led to the misconception that degradable polymers would, in all cases, lead to inflammation and/or osteolysis at the implantation site. Nowadays, we have accumulated substantial knowledge on the issue of biocompatibility of biodegradable polymers and are able to tailor these polymers for specific applications and thereby strongly reduce the occurrence of adverse tissue reactions. However, the major issue of biofunctionality, when mechanical adaptation is taken into account, has hitherto been largely unrecognized. A thorough understanding of how to improve the biofunctionality, comprising biomechanical stability, but also visualization and sterilization of the material, together with the avoidance of fibrotic tissue formation and foreign body reactions, may greatly enhance the applicability and safety of degradable polymers in a wide area of tissue engineering applications. This review will address our current understanding of these biofunctionality factors, and will subsequently discuss the pitfalls remaining and potential solutions to solve these problems

Effects of Fe2O3 addition and annealing on the mechanical and dissolution properties of MgO- and CaO-containing phosphate glass fibres for bio-applications

This paper investigated the preparation of phosphate glass fibres (PGFs) in the following systems: i) 45P2O5-5B2O3-5Na2O-(29-x)CaO-16MgO-(x)Fe2O3and ii) 45P2O5-5B2O3-5Na2O-24CaO-(21-x)MgO-(x)Fe2O3(where x = 5, 8 and 11 mol%) for biomedical applications. Continuous fibres of 23 ± 1 μm diameter were prepared via a melt-draw spinning process. Compositions with higher Fe2O3content and higher MgO/CaO ratio required higher melting temperature and longer heating time to achieve glass melts for fibre pulling. The effects of Fe2O3 addition and annealing treatment on mechanical properties and degradation behaviours were also investigated. Adding Fe2O3 was found to increase the tensile strength from 523 ± 63 (Ca-Fe5) to 680 ± 75 MPa (Ca-Fe11), improve the tensile modulus from 72 ± 4 (Ca-Fe5) to 78 ± 3 GPa (Ca-Fe11) and decrease the degradation rate from 4.0 (Mg-Fe5) to 1.9 × 10-6kg m-2s-1(Mg-Fe11). The annealing process reduced the fibre tensile strength by 46% (Ca-Fe5), increased the modulus by 19.6% (Ca-Fe8) and decreased the degradation rate by 89.5% (Mg-Fe11) in comparison to the corresponding as-drawn fibres. Additionally, the annealing process also impeded the formation of precipitate shells and revealed coexistence of the precipitation and the pitting corrosion as fibre degradation behaviours