Despite their remarkable expressibility, convolution neural networks (CNNs) still fall short of delivering satisfactory results on single image dehazing, especially in terms faithful recovery fine texture details. In this paper, we argue that the inadequacy conventional CNN-based dehazing methods can be attributed to fact domain hazy images is too far away from clear images, rendering it diffic...

PURPOSE To evaluate the morphological changes of the meibomian glands (MG) in patients with meibomian gland dysfunction (MGD) compared to normal subjects by in vivo confocal microscopy and to investigate the relation of these changes to the clinical ocular surface findings and tear functions. METHODS Twenty MGD patients and 15 normal subjects were recruited into this prospective study. Patien...

Intuitively, the richer the set of control structures provided by a programming language (language constructs), the better its expressibility. Equating the ease of expression of an algorithm with the succinctness (size) of the resultant program, we show that all commonly-used programming languages provide all implementable control structures. We also study the class of size functions witnessing...

k Abstract. We give an AC 0 upper bound on the complexity of rst-oder queries over (innnite) databases deened by restricted linear constraints. This result enables us to deduce the non-expressibility of various usual queries, such as the parity of the cardinality of a set or the connectivity of a graph in rst-order logic with linear constraints over the reals.

In this short note we address the issue of expressing norms (such as obligations and prohibitions) in temporal logic. In particular, we address the argument from [1] that norms cannot be expressed in Linear Time Temporal Logic (LTL). Recently, doubts were raised in [1] regarding suitability of LTL and other temporal logics for expressing ‘real life’ norms. We claim that the argument in [1] does...

In this paper probabilistic and non-deterministic programs are considered on the ground of logic of programs. We are interested in dependencies between nondeterministic and probabilistic interpretation of a program. The formal definitions of probabilistic and non-deterministic semantics are the starting point for our considerations. The emphasis is on differences in expressibility the halting p...

The paper is a survey of notions and results related to classical and new generalizations of the notion of a periodic sequence. The topics related to almost periodicity in combinatorics on words, symbolic dynamics, expressibility in logical theories, algorithmic computability, Kolmogorov complexity, number theory, are discussed.

This paper addresses a limitationof most deductive database systems: they cannot reason hypothetically. Although they reason eeectively about the world as it is, they are poor at tasks such as planning and design, where one must explore the consequences of hypothetical actions and possibilities. To address this limitation, we have developed a logic-programming language in which users can create...

Calculations can naturally be described as graphs in which vertices represent computation and edges reeect data dependencies. By partitioning the vertices of a graph, the calculation can be divided among processors of a parallel computer. However, the standard methodology for graph partitioning minimizes the wrong metric and lacks expressibility. We survey several recently proposed alternatives...