Autosomal dominant Alport syndrome linked to the type IV collage alpha 3 and alpha 4 genes (COL4A3 and COL4A4)

Alport syndrome is a hereditary nephritis that may lead to end-stage renal disease (ESRD) in young adult life and is often associated with sensorineural deafness and/or ocular abnormalities. The majority of families are X-linked due to mutations in the COL4A5 gene at Xq22. Autosomal forms of the disease are also recognized with recessive disease, having been shown to be due to mutations in the COL4A3 and COL4A4 genes on chromosome 2. Familial benign haematuria has also been mapped to this region in some families.

A Conditional Approach for Modelling Patient Re-admissions in Hospital using a mixture of Coxian phase-type distributions incorporating Bayes Theorem

The number of elderly patients requiring hospitalisation in Europe is rising. With a greater proportion of elderly people in the population comes a greater demand for health services and, in particular, hospital care. Thus, with a growing number of elderly patients requiring hospitalisation competing with non-elderly patients for a fixed (and in some cases, decreasing) number of hospital beds, this results in much longer waiting times for patients, often with a less satisfactory hospital experience. However, if a better understanding of the recurring nature of elderly patient movements between the community and hospital can be developed, then it may be possible for alternative provisions of care in the community to be put in place and thus prevent readmission to hospital. The research in this paper aims to model the multiple patient transitions between hospital and community by utilising a mixture of conditional Coxian phase-type distributions that incorporates Bayes' theorem. For the purpose of demonstration, the results of a simulation study are presented and the model is applied to hospital readmission data from the Lombardy region of Italy.

On lattices from combinatorial game theory modularity and a representation theorem: Finite case

We show that a self-generated set of combinatorial games, S, may not be hereditarily closed but, strong self-generation and hereditary closure are equivalent in the universe of short games. In [13], the question “Is there a set which will give an on-distributive but modular lattice?” appears. A useful necessary condition for the existence of a finite non-distributive modular L(S) is proved. We show the existence of S such that L(S) is modular and not distributive, exhibiting the first known example. More, we prove a Representation Theorem with Games that allows the generation of all finite lattices in game context. Finally, a computational tool for drawing lattices of games is presented.

On lattices from combinatorial game theory modularity and a representation theorem: finite case

We show that a self-generated set of combinatorial games, S. may not be hereditarily closed but, strong self-generation and hereditary closure are equivalent in the universe of short games. In [13], the question "Is there a set which will give a non-distributive but modular lattice?" appears. A useful necessary condition for the existence of a finite non-distributive modular L(S) is proved. We show the existence of S such that L(S) is modular and not distributive, exhibiting the first known example. More, we prove a Representation Theorem with Games that allows the generation of all finite lattices in game context. Finally, a computational tool for drawing lattices of games is presented. (C) 2014 Elsevier B.V. All rights reserved.

The von Neumann Minimax Theorem and its relatives and a study of externality in on-line auctions

This work consists of a theoretical part and an experimental one. The first part provides a simple treatment of the celebrated von Neumann minimax theorem as formulated by Nikaid6 and Sion. It also discusses its relationships with fundamental theorems of convex analysis. The second part is about externality in sponsored search auctions. It shows that in these auctions, advertisers have externality effects on each other which influence their bidding behavior. It proposes Hal R.Varian model and shows how adding externality to this model will affect its properties. In order to have a better understanding of the interaction among advertisers in on-line auctions, it studies the structure of the Google advertisements networ.k and shows that it is a small-world scale-free network.

An Interactive Theorem Prover for First-Order Dynamic Logic

Dynamic logic is an extension of modal logic originally intended for reasoning about computer programs. The method of proving correctness of properties of a computer program using the well-known Hoare Logic can be implemented by utilizing the robustness of dynamic logic. For a very broad range of languages and applications in program veri cation, a theorem prover named KIV (Karlsruhe Interactive Veri er) Theorem Prover has already been developed. But a high degree of automation and its complexity make it di cult to use it for educational purposes. My research work is motivated towards the design and implementation of a similar interactive theorem prover with educational use as its main design criteria. As the key purpose of this system is to serve as an educational tool, it is a self-explanatory system that explains every step of creating a derivation, i.e., proving a theorem. This deductive system is implemented in the platform-independent programming language Java. In addition, a very popular combination of a lexical analyzer generator, JFlex, and the parser generator BYacc/J for parsing formulas and programs has been used.

A Representation Theorem for Domains with Discrete and Continuous Variables.

This paper proves a new representation theorem for domains with both discrete and continuous variables. The result generalizes Debreu's well-known representation theorem on connected domains. A strengthening of the standard continuity axiom is used in order to guarantee the existence of a representation. A generalization of the main theorem and an application of the more general result are also presented.

Arrow's Theorem in Spatial Environments

In spatial environments, we consider social welfare functions satisfying Arrow's requirements. i.e., weak Pareto and independence of irrelevant alternatives. When the policy space os a one-dimensional continuum, such a welfare function is determined by a collection of 2n strictly quasi-concave preferences and a tie-breaking rule. As a corrollary, we obtain that when the number of voters is odd, simple majority voting is transitive if and only if each voter's preference is strictly quasi-concave. When the policy space is multi-dimensional, we establish Arrow's impossibility theorem. Among others, we show that weak Pareto, independence of irrelevant alternatives, and non-dictatorship are inconsistent if the set of alternatives has a non-empty interior and it is compact and convex.

Harsanyi’s Social Aggregation Theorem : A Multi-Profile Approach with Variable-Population Extensions

This paper provides new versions of Harsanyi’s social aggregation theorem that are formulated in terms of prospects rather than lotteries. Strengthening an earlier result, fixed-population ex-ante utilitarianism is characterized in a multi-profile setting with fixed probabilities. In addition, we extend the social aggregation theorem to social-evaluation problems under uncertainty with a variable population and generalize our approach to uncertain alternatives, which consist of compound vectors of probability distributions and prospects.

Comparaison de la force d'adhésion de deux types de résines de collage appliquées sur des surfaces métalliques traitées de différentes façons : une étude in vitro

L’objectif de cette étude était d’évaluer et de comparer la force d’adhésion de deux résines de collage: le ClearfilTM Esthetic Cement & DC Bond Kit (C) et le RelyXTM Unicem (R), sur trois adhérents différents : une surface d’émail, un alliage de métaux non précieux (Np) et un alliage de métaux semi-précieux (Sp). La surface des échantillons des alliages métalliques a subi différents traitements de surface. Sur l’émail (n=15) ainsi que sur les plaquettes d’alliages Np et Sp (n=15), des cylindres de résine étaient appliqués et polymérisés. Suite au processus de collage, les échantillons ont été incubés à 37°C pendant 24 heures, puis ont subi 500 cycles de thermocyclage. Des tests de cisaillement ont été effectués, suivi par l’analyse de la surface des échantillons au microscope à balayage électronique. Une comparaison de type T-test et des comparaisons multiples post hoc, ont été effectuées pour l’analyse statistique (p 0,05). Sur l’émail, les résultats ont démontré que la résine C présentait une force d'adhésion moyenne statistiquement supérieure (33,97±17,18 MPa) à la résine R (10,48±11,23 MPa) (p 0,05). Le type d’alliage utilisé n’influençait pas la force d’adhésion, et ce, peu importe le type de résine de collage (p>0,05). Pour le groupe Sp, la résine C a démontré une adhésion statistiquement supérieure à la résine R, et ce, pour tous les traitements de surface (p 0,05). En conclusion, la résine C a démontré des résultats d’adhésion significativement supérieurs à la résine R sur l’émail ainsi que sur presque toutes les surfaces traitées des alliages de métaux.