The challenges of amblyopia treatment

The treatment of amblyopia, particularly anisometropic (difference in refractive correction) and/or strabismic (turn of one eye) amblyopia has long been a challenge for many clinicians. Achieving optimum outcomes, where the amblyopic eye reaches a visual acuity similar to the fellow eye, is often impossible in many patients. Part of this challenge has resulted from a previous lack of scientific evidence for amblyopia treatment that was highlight by a systematic review by Snowdon et al. in 1998. Since this review, a number of publications have revealed new findings in the treatment of amblyopia. This includes the finding that less intensive occlusion treatments can be successful in treating amblyopia. A relationship between adherence to treatment and visual acuity has also been established and has been shown to be influenced by the use of intervention material. In addition, there is growing evidence of that a period of glasses wearing only can significantly improve visual acuity alone without any other modes of treatment. This review article reports findings since the Snowdon's report

On The Power of Tree Projections: Structural Tractability of Enumerating CSP Solutions

The problem of deciding whether CSP instances admit solutions has been deeply studied in the literature, and several structural tractability results have been derived so far. However, constraint satisfaction comes in practice as a computation problem where the focus is either on finding one solution, or on enumerating all solutions, possibly projected to some given set of output variables. The paper investigates the structural tractability of the problem of enumerating (possibly projected) solutions, where tractability means here computable with polynomial delay (WPD), since in general exponentially many solutions may be computed. A general framework based on the notion of tree projection of hypergraphs is considered, which generalizes all known decomposition methods. Tractability results have been obtained both for classes of structures where output variables are part of their specification, and for classes of structures where computability WPD must be ensured for any possible set of output variables. These results are shown to be tight, by exhibiting dichotomies for classes of structures having bounded arity and where the tree decomposition method is considered

ON THE LOW-TEMPERATURE ORDERING OF THE 3D ATIFERROMAGNETIC THREE-STATE POTTS MODEL

The antiferromagnetic three-state Potts model on the simple-cubic lattice is studied using Monte Carlo simulations. The ordering in a medium temperature range below the critical point is investigated in detail. Two different regimes have been observed: The so-called broken sublattice-symmetry phase dominates at sufficiently low temperatures, while the phase just below the critical point is characterized by an effectively continuous order parameter and by a fully restored rotational symmetry. However, the later phase is not the permutationally sublattice symmetric phase recently predicted by the cluster variation method.Comment: 20 pages with 9 figures in a single postscript file (compressed and uuencoded by uufiles -gz -9) plus two big figures in postscript file

The stability of the O(N) invariant fixed point in three dimensions

We study the stability of the O(N) fixed point in three dimensions under perturbations of the cubic type. We address this problem in the three cases $N=2,3,4$ by using finite size scaling techniques and high precision Monte Carlo simulations. It is well know that there is a critical value $2<N_c<4$ below which the O(N) fixed point is stable and above which the cubic fixed point becomes the stable one. While we cannot exclude that $N_c<3$, as recently claimed by Kleinert and collaborators, our analysis strongly suggests that $N_c$ coincides with 3.Comment: latex file of 18 pages plus three ps figure

Logics for Unranked Trees: An Overview

Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purposes: some are better suited for extracting data, some for expressing navigational properties, and some make it easy to relate complex properties of trees to the existence of tree automata for those properties. Furthermore, logics differ significantly in their model-checking properties, their automata models, and their behavior on ordered and unordered trees. In this paper we present a survey of logics for unranked trees

Scaling of the specific heat in superfluid films

We study the specific heat of the $x-y$ model on lattices $L \times L \times H$ with $L \gg H$ (i.e. on lattices representing a film geometry) using the Cluster Monte--Carlo method. In the $H$--direction we apply Dirichlet boundary conditions so that the order parameter in the top and bottom layers is zero. We find that our results for the specific heat of various thickness size $H$ collapse on the same universal scaling function. The extracted scaling function of the specific heat is in good agreement with the experimentally determined universal scaling function using no free parameters.Comment: 4 pages, uuencoded compressed PostScrip

Chiral perturbation theory, finite size effects and the three-dimensional XYXY model

We study finite size effects of the d=3 $XY$ model in terms of the chiral perturbation theory. We calculate by Monte Carlo simulations physical quantities which are, to order of $(1/L)^2$, uniquely determined only by two low energy constants. They are the magnetization and the helicity modulus (or the Goldstone boson decay constant) in infinite volume. We also pay a special attention to the region of the validity of the two possible expansions in the theory.Comment: 34 pages ( 9 PS files are included. harvmac and epsf macros are needed. ), KYUSHU-HET-17, SAGA-HE-6

The DLV System for Knowledge Representation and Reasoning

This paper presents the DLV system, which is widely considered the state-of-the-art implementation of disjunctive logic programming, and addresses several aspects. As for problem solving, we provide a formal definition of its kernel language, function-free disjunctive logic programs (also known as disjunctive datalog), extended by weak constraints, which are a powerful tool to express optimization problems. We then illustrate the usage of DLV as a tool for knowledge representation and reasoning, describing a new declarative programming methodology which allows one to encode complex problems (up to $\Delta^P_3$-complete problems) in a declarative fashion. On the foundational side, we provide a detailed analysis of the computational complexity of the language of DLV, and by deriving new complexity results we chart a complete picture of the complexity of this language and important fragments thereof. Furthermore, we illustrate the general architecture of the DLV system which has been influenced by these results. As for applications, we overview application front-ends which have been developed on top of DLV to solve specific knowledge representation tasks, and we briefly describe the main international projects investigating the potential of the system for industrial exploitation. Finally, we report about thorough experimentation and benchmarking, which has been carried out to assess the efficiency of the system. The experimental results confirm the solidity of DLV and highlight its potential for emerging application areas like knowledge management and information integration.Comment: 56 pages, 9 figures, 6 table

Randomly dilute spin models with cubic symmetry

We study the combined effect of cubic anisotropy and quenched uncorrelated impurities on multicomponent spin models. For this purpose, we consider the field-theoretical approach based on the Ginzburg-Landau-Wilson $\phi^4$ Hamiltonian with cubic-symmetric quartic interactions and quenched randomness coupled to the local energy density. We compute the renormalization-group functions to six loops in the fixed-dimension (d=3) perturbative scheme. The analysis of such high-order series provides an accurate description of the renormalization-group flow. The results are also used to determine the critical behavior of three-dimensional antiferromagnetic three- and four-state Potts models in the presence of quenched impurities.Comment: 23 pages, 1 figure

On the low-temperature phase of the three-state antiferromagnetic Potts model on the simple cubic lattice

The three-state antiferromagnetic Potts model on the simple cubic lattice is investigated using the cluster variation method in the cube and the star-cube approximations. The broken-sublattice-symmetry phase is found to be stable in the whole low-temperature region, contrary to previous results obtained using a modified cluster variation method. The tiny free energy difference between the broken-sublattice-symmetry and the permutationally-symmetric-sublattices phases is calculated in the two approximations and turns out to be smaller in the (more accurate) star-cube approximation than in the cube one.Comment: 4 pages REVTeX + 2 PostScript figures, to be published in Phys. Rev. E as a Rapid Communicatio