Reason Maintenance Systems: Tools for Foundations-based Belief Revision

Dynamic and distributed environments are hard to model since they suffer from unexpected changes, incomplete knowledge, and conflicting perspectives and, thus, call for appropriate knowledge representation and reasoning (KRR) systems. Such KRR systems must handle sets of dynamic beliefs, be sensitive to communicated and perceived changes in the environment and, consequently, may have to drop current beliefs in face of new findings or disregard any new data that conflicts with stronger convictions held by the system. Not only do they need to represent and reason with beliefs, but also they must perform belief revision to maintain the overall consistency of the knowledge base. One way of developing such systems is to use reason maintenance systems (RMS). In this paper we provide an overview of the most representative types of RMS, which are also known as truth maintenance systems (TMS), which are computational instances of the foundations-based theory of belief revision. An RMS module works together with a problem solver. The latter feeds the RMS with assumptions (core beliefs) and conclusions (derived beliefs), which are accompanied by their respective foundations. The role of the RMS module is to store the beliefs, associate with each belief (core or derived belief) the corresponding set of supporting foundations and maintain the consistency of the overall reasoning by keeping, for each represented belief, the current supporting justifications. Two major approaches are used to reason maintenance: single-and multiple-context reasoning systems. Although in the single-context systems, each belief is associated to the beliefs that directly generated it—the justification-based TMS (JTMS) or the logic-based TMS (LTMS), in the multiple context counterparts, each belief is associated with the minimal set of assumptions from which it can be inferred—the assumption-based TMS (ATMS) or the multiple belief reasoner (MBR).

Mobile device-to-device distributed computing using data sets

The rapidly increasing computing power, available storage and communication capabilities of mobile devices makes it possible to start processing and storing data locally, rather than offloading it to remote servers; allowing scenarios of mobile clouds without infrastructure dependency. We can now aim at connecting neighboring mobile devices, creating a local mobile cloud that provides storage and computing services on local generated data. In this paper, we describe an early overview of a distributed mobile system that allows accessing and processing of data distributed across mobile devices without an external communication infrastructure. Copyright © 2015 ICST.

Constraint-based modeling of minimum set covering: application to species differentation

Work presented in the context of the European Master in Computational Logics, as partial requisit for the graduation as Master in Computational Logics

Minimal Criteria for the Diagnosis of Avulsion of the Puborectalis Muscle by Tomographic Ultrasound

Introduction and hypothesis Puborectalis avulsion is a likely etiological factor for female pelvic organ prolapse(FPOP). We performed a study to establish minimal sonographic criteria for the diagnosis of avulsion. Methods We analysed datasets of 764 women seen at a urogynecological service. Offline analysis of ultrasound datasets was performed blinded to patient data. Tomographic ultrasound imaging (TUI) was used to diagnose avulsion of the puborectalis muscle. Results Logistic regression modelling of TUI data showed that complete avulsion is best diagnosed by requiring the three central tomographic slices to be abnormal. This finding was obtained in 30% of patients and was associated with symptoms and signs of FPOP (P<0.001). Lesser degrees of trauma (‘partial avulsion’) were not associated with symptoms or signs of pelvic floor dysfunction. Conclusions Complete avulsion of the puborectalis muscle is best diagnosed on TUI by requiring all three central slices to be abnormal. Partial trauma seems of limited clinical relevance.

Constraint reasoning with local search for continuous optimization

Optimization is a very important field for getting the best possible value for the optimization function. Continuous optimization is optimization over real intervals. There are many global and local search techniques. Global search techniques try to get the global optima of the optimization problem. However, local search techniques are used more since they try to find a local minimal solution within an area of the search space. In Continuous Constraint Satisfaction Problems (CCSP)s, constraints are viewed as relations between variables, and the computations are supported by interval analysis. The continuous constraint programming framework provides branch-and-prune algorithms for covering sets of solutions for the constraints with sets of interval boxes which are the Cartesian product of intervals. These algorithms begin with an initial crude cover of the feasible space (the Cartesian product of the initial variable domains) which is recursively refined by interleaving pruning and branching steps until a stopping criterion is satisfied. In this work, we try to find a convenient way to use the advantages in CCSP branchand- prune with local search of global optimization applied locally over each pruned branch of the CCSP. We apply local search techniques of continuous optimization over the pruned boxes outputted by the CCSP techniques. We mainly use steepest descent technique with different characteristics such as penalty calculation and step length. We implement two main different local search algorithms. We use “Procure”, which is a constraint reasoning and global optimization framework, to implement our techniques, then we produce and introduce our results over a set of benchmarks.

Efficient paraconsistent reasoning with rules and ontologies for the semantic web

Ontologies formalized by means of Description Logics (DLs) and rules in the form of Logic Programs (LPs) are two prominent formalisms in the field of Knowledge Representation and Reasoning. While DLs adhere to the OpenWorld Assumption and are suited for taxonomic reasoning, LPs implement reasoning under the Closed World Assumption, so that default knowledge can be expressed. However, for many applications it is useful to have a means that allows reasoning over an open domain and expressing rules with exceptions at the same time. Hybrid MKNF knowledge bases make such a means available by formalizing DLs and LPs in a common logic, the Logic of Minimal Knowledge and Negation as Failure (MKNF). Since rules and ontologies are used in open environments such as the Semantic Web, inconsistencies cannot always be avoided. This poses a problem due to the Principle of Explosion, which holds in classical logics. Paraconsistent Logics offer a solution to this issue by assigning meaningful models even to contradictory sets of formulas. Consequently, paraconsistent semantics for DLs and LPs have been investigated intensively. Our goal is to apply the paraconsistent approach to the combination of DLs and LPs in hybrid MKNF knowledge bases. In this thesis, a new six-valued semantics for hybrid MKNF knowledge bases is introduced, extending the three-valued approach by Knorr et al., which is based on the wellfounded semantics for logic programs. Additionally, a procedural way of computing paraconsistent well-founded models for hybrid MKNF knowledge bases by means of an alternating fixpoint construction is presented and it is proven that the algorithm is sound and complete w.r.t. the model-theoretic characterization of the semantics. Moreover, it is shown that the new semantics is faithful w.r.t. well-studied paraconsistent semantics for DLs and LPs, respectively, and maintains the efficiency of the approach it extends.

Intestinal intussusception and occlusion caused by small bowel polyps in the Peutz-Jeghers syndrome. Management by combined intraoperative enteroscopy and resection through minimal enterostomy: case report

The Peutz-Jeghers syndrome is a hereditary disease that requires frequent endoscopic and surgical intervention, leading to secondary complications such as short bowel syndrome. CASE REPORT: This paper reports on a 15-year-old male patient with a family history of the disease, who underwent surgery for treatment of an intestinal occlusion due to a small intestine intussusception. DISCUSSION: An intra-operative fiberscopic procedure was included for the detection and treatment of numerous polyps distributed along the small intestine. Enterotomy was performed to treat only the larger polyps, therefore limiting the intestinal resection to smaller segments. The postoperative follow-up was uneventful. CONCLUSION: We point out the importance of conservative treatment for patients with this syndrome, especially those who will undergo repeated surgical interventions because of clinical manifestation while they are still young.

Minimal computation structures for visual information applications based on printed electronics

In the early nineties, Mark Weiser wrote a series of seminal papers that introduced the concept of Ubiquitous Computing. According to Weiser, computers require too much attention from the user, drawing his focus from the tasks at hand. Instead of being the centre of attention, computers should be so natural that they would vanish into the human environment. Computers become not only truly pervasive but also effectively invisible and unobtrusive to the user. This requires not only for smaller, cheaper and low power consumption computers, but also for equally convenient display solutions that can be harmoniously integrated into our surroundings. With the advent of Printed Electronics, new ways to link the physical and the digital worlds became available. By combining common printing techniques such as inkjet printing with electro-optical functional inks, it is starting to be possible not only to mass-produce extremely thin, flexible and cost effective electronic circuits but also to introduce electronic functionalities into products where it was previously unavailable. Indeed, Printed Electronics is enabling the creation of novel sensing and display elements for interactive devices, free of form factor. At the same time, the rise in the availability and affordability of digital fabrication technologies, namely of 3D printers, to the average consumer is fostering a new industrial (digital) revolution and the democratisation of innovation. Nowadays, end-users are already able to custom design and manufacture on demand their own physical products, according to their own needs. In the future, they will be able to fabricate interactive digital devices with user-specific form and functionality from the comfort of their homes. This thesis explores how task-specific, low computation, interactive devices capable of presenting dynamic visual information can be created using Printed Electronics technologies, whilst following an approach based on the ideals behind Personal Fabrication. Focus is given on the use of printed electrochromic displays as a medium for delivering dynamic digital information. According to the architecture of the displays, several approaches are highlighted and categorised. Furthermore, a pictorial computation model based on extended cellular automata principles is used to programme dynamic simulation models into matrix-based electrochromic displays. Envisaged applications include the modelling of physical, chemical, biological, and environmental phenomena.

A minimal version of a Protein Tyrosine Phosphatase

Phosphatase and tensin homologue (PTEN) protein belongs to the family of protein tyrosine phos-phatase. Mutations on the phosphatase and tensin homologue (PTEN) protein are highly observed in diverse types of human tumors, being mostly identified on the phosphatase domain of the protein. Although PTEN is a modular protein composed by a phosphatase domain and a C2 domain for mem-brane anchoring, this work aimed at developing a minimal version of PTEN´s phosphatase domain. The minimal version (Small Domain) comprises a 28 residue peptide, with the PTEN 8-mer catalytic peptide accommodated between a α-helix and β-turn as observed in PTEN native structure. Firstly, a de novo prediction of the Small Domain´s secondary structure was carried out by molecular modeling tools. The stability of the predicted structures were then evaluated by Molecular Dynamics. Automated molecular docking of PTEN natural substrate PIP3, its analogue (Inositol) and a PTEN inhibitor (L-tar-tare) were performed with the modeled structure, and PTEN used as a positive control. The gene en-coding for Small Domain was designed and cloned into an expression vector at N-terminal of Green Fluorescence Protein (GFP) encoding gene. The fusion protein was then expressed in Escherichia coli cells. Different expression conditions have been explored for the production of the fusion protein to minimize the formation of inclusion bodies.

An algorithmic approach to estimating the minimal number of periodic points for smooth self-maps of simply-connected manifolds

For a given self-map f of M, a closed smooth connected and simply-connected manifold of dimension m ≥ 4, we provide an algorithm for estimating the values of the topological invariant Dm r [f], which equals the minimal number of r-periodic points in the smooth homotopy class of f. Our results are based on the combinatorial scheme for computing Dm r [f] introduced by G. Graff and J. Jezierski [J. Fixed Point Theory Appl. 13 (2013), 63–84]. An open-source implementation of the algorithm programmed in C++ is publicly available at http://www.pawelpilarczyk.com/combtop/.

The Irish pub as a third place : a sociological exploration of people, place and identity

There is considerable interest in alcohol in Irish society, yet minimal sociologcial understanding of its consumption, particularly of the sites where most drinking occurs: the country's 8750 pubs. Despite widespread public discussions on the role of the pub, there is scant social science evidence to better inform debate. Pubs are central to Irish community and are key sites of social interaction. American sociologist Ray Oldenburg has argued that "third places" (neither workplace nor home) are crucial to the maintenance of the community and the enhancement of social capital. According to Oldenburg, the role of the third place in the community is to provide continuity, regularity, a sense of place - all of which conceptually contribute to the construction of the self, the projection of the self within the public sphere, the distribution of social capital and the generation of a collective identity. The pub is the archetypal third place, but Oldenburg is concerned that modern pubs are less able to provide this vital function. Social scientists have suggested that community is in a state of fragmentation and decline due to changes in modes of social interaction and a decrease in shared spaces, resulting in a weakened connection to place. Community without propinquity has been characterised by social alienation, fragmentation and what Oldenburg refers to as the "problem of place" (13). Third places, and thus the Irish pub, have been particularly affected. In order to increase the sociological knowledge of the pub in Ireland, this project critically engages with the pub to assess the importance that public drinking houses have in the everyday. Moreover, this research sets out to investigate the people/place relationship using the pub as an investigative lens and examine the ways in which people shape place, place shapes people and how that relationship is implicated in the construction of irish identities. Furthermore, this is also an articulation of a cultural shift within Ireland and Irish places whose effects are deep and multi-layered. This project aims to explore the development of the contemporary geography of identity as the irish pub as a third place is transformed or disappears from the social landscape.

Representations of lattice point sets : theory, algorithms, applications

Magdeburg, Univ., Fak. für Mathematik, Habil.-Schr., 2006

Difference sets from projective planes

Magdeburg, Univ., Fak. für Mathematik, Diss., 2013

Illustrative visualization of medical data sets

Magdeburg, Univ., Fak. für Informatik, Diss., 2014

Illustrative visualization of medical data sets

Magdeburg, Univ., Fak. für Informatik, Diss., 2014