Towards unsupervised ontology learning from data

Data-driven elicitation of ontologies from structured data is a well-recognized knowledge acquisition bottleneck. The development of efficient techniques for (semi-)automating this task is therefore practically vital - yet, hindered by the lack of robust theoretical foundations. In this paper, we study the problem of learning Description Logic TBoxes from interpretations, which naturally translates to the task of ontology learning from data.In the presented framework, the learner is provided with a set of positive interpretations (i.e., logical models) of the TBox adopted by the teacher. The goal is to correctly identify the TBox given this input. We characterize the key constraints on the models that warrant finite learnability of TBoxes expressed in selected fragments of the Description Logic ε λ and define corresponding learning algorithms.This work was funded in part by the National Research Foundation under Grant no. 85482

Taking Defeasible Entailment Beyond Rational Closure

We present a systematic approach for extending the KLM framework for defeasible entailment. We first present a class of basic defeasible entailment relations, characterise it in three distinct ways and provide a high-level algorithm for computing it. This framework is then refined, with the refined version being characterised in a similar manner. We show that the two well-known forms of defeasible entailment, rational closure and lexicographic closure, fall within our refined framework, that rational closure is the most conservative of the defeasible entailment relations within the framework (with respect to subset inclusion), but that there are forms of defeasible entailment within our framework that are more “adventurous” than lexicographic closure

Effects of post mortem temperature on rigor tension, shortening and pH in ostrich muscle

Fully developed rigor mortis in muscle is characterised by maximum loss of extensibility. The course of post mortem changes in ostrich muscle was studied by following isometric tension, shortening and change in pH during the first 24 h post mortem within muscle strips from the muscularis gastrocnemius, pars interna at constant temperatures of 7 °C and 37 °C. Maximum shortening was significantly higher at 37 °C (33.4 ± 3.57%) than at 7 °C (10.7 ± 2.63%). The rate of rigor development was temperature dependent, reaching a maximum tension at 4.08 ± 3.89 h post mortem in muscle strips at 37 °C; while at 7 °C maximum tension was reached at 10.5 ± 6.47 h post mortem. It was concluded that the completion of rigor occurred at the point of minimum pH. Keywords: Rigor mortis, rigor tension, muscle shortening, ostrich, rigor shortening, cold-shortening, hot-deboning, rate of pH declineSouth African Journal of Animal Science Vol. 38 (3) 2008: pp. 184-19

A KLM Perspective on Defeasible Reasoning for Description Logics

In this paper we present an approach to defeasible reasoning for the description logic ALC. The results discussed here are based on work done by Kraus, Lehmann and Magidor (KLM) on defeasible conditionals in the propositional case. We consider versions of a preferential semantics for two forms of defeasible subsumption, and link these semantic constructions formally to KLM-style syntactic properties via representation results. In addition to showing that the semantics is appropriate, these results pave the way for more effective decision procedures for defeasible reasoning in description logics. With the semantics of the defeasible version of ALC in place, we turn to the investigation of an appropriate form of defeasible entailment for this enriched version of ALC. This investigation includes an algorithm for the computation of a form of defeasible entailment known as rational closure in the propositional case. Importantly, the algorithm relies completely on classical entailment checks and shows that the computational complexity of reasoning over defeasible ontologies is no worse than that of the underlying classical ALC. Before concluding, we take a brief tour of some existing work on defeasible extensions of ALC that go beyond defeasible subsumption

Specialized antigen-presenting cells. Splenic-dendritic cells and peritoneal-exudate cells induced by mycobacteria activate effector T cells that are resistant to suppression

We have tested the ability of several types of trinitrophenyl (TNP)-labeled Ia+ cells to induce contact hypersensitivity (CS) after intravenous injection. Most labeled cell types (spleen cells, splenic macrophages, various types of peritoneal-exudate cells) not only fail to induce CS after this type of inoculation but, rather, activate T suppressor cells leading to specific immunological tolerance. Occasionally, some of these immunizing cells managed to bypass the T suppressor system and induced CS. In these cases the response was short-lived and could be blocked by concomitant injection of trinitrobenzelsulphonic acid (TNBS), a potent inducer of T suppressor cells. In sharp contrast to these results, TNP-labeled splenic dendritic cells and TNP-labeled peritoneal-exudate cells induced by complete Freund\u27s adjuvant had the following distinctive features: (a) They were always able to sensitize when injected intravenously, and the degree of sensitization they produced was roughly equivalent to that achieved by cutaneous application of picryl chloride, the chemically reactive form of TNP. (b) The response they elicited was long lived (i.e., lasted for \u3e3 wk). (c) Their sensitizing capacity could not be blocked by the concomitant injection of TNBS. (d) They elicited a response that could be adoptively transferred to untreated, normal recipients. These results indicate that the type of cell that first presents antigen to the immune system plays an important, even essential, role in determining the strength and duration of the subsequent immune response. In particular, the results suggest that some special antigen-presenting cells can induce a response that is relatively resistant to host suppressor mechanisms. Evidence that they do so by activating contrasuppressor cells is discussed

Age of diagnosis for congenital hearing loss at Universitas Hospital, Bloemfontein

Background. Congenital hearing loss affects 3 - 6/1 000 children worldwide. The benefits of early identification of hearing loss and early intervention have been clearly established. There are no previous studies reporting on the age of diagnosis of congenital hearing loss in the Free State province.Objectives. To determine the age of diagnosis of congenital hearing loss in the Otorhinolaryngology Clinic at Universitas Hospital. Secondary aims included determining age at first visit, as well as the time delay between first visit and diagnosis, and documenting any interventions which took  place.Methods. A retrospective, descriptive study was undertaken, analysing data from 2001 to 2010.Results. A total of 260 cases of congenital hearing loss were analysed. The median age of diagnosis of hearing loss was 44.5 months. The median age of first visit was 40.9 months, and the median delay between first visit and diagnosis was 49 days.Conclusions. The median age of diagnosis far exceeds national and  international benchmarks. This has a profoundly negative impact on the development and outcomes of children with hearing loss. These results have been used to motivate for the expansion of hearing screening and diagnostic services in the province

On Binary Matroid Minors and Applications to Data Storage over Small Fields

Locally repairable codes for distributed storage systems have gained a lot of interest recently, and various constructions can be found in the literature. However, most of the constructions result in either large field sizes and hence too high computational complexity for practical implementation, or in low rates translating into waste of the available storage space. In this paper we address this issue by developing theory towards code existence and design over a given field. This is done via exploiting recently established connections between linear locally repairable codes and matroids, and using matroid-theoretic characterisations of linearity over small fields. In particular, nonexistence can be shown by finding certain forbidden uniform minors within the lattice of cyclic flats. It is shown that the lattice of cyclic flats of binary matroids have additional structure that significantly restricts the possible locality properties of $\mathbb{F}_{2}$-linear storage codes. Moreover, a collection of criteria for detecting uniform minors from the lattice of cyclic flats of a given matroid is given, which is interesting in its own right.Comment: 14 pages, 2 figure