PURPOSE A four-month extended wear clinical trial was conducted to compare the ocular effects of a high Dk Balafilcon A silicone hydrogel lens and a low Dk HEMA 38.6 per cent H20 soft lens. METHOD Twenty-four subjects who were adapted to daily wear of soft lenses wore a high Dk lens in one eye and a low Dk HEMA lens in the other eye for four months on an extended wear basis after one week of ...

Let Dk be the class of graphs for which every minor has minimum degree at most k. Then Dk is closed under taking minors. By the Robertson-Seymour graph minor theorem, Dk is characterised by a finite family of minor-minimal forbidden graphs, which we denote by b Dk. This paper discusses b Dk and related topics. We obtain four main results: (1) We prove that every (k + 1)-regular graph with less ...

Clarin.dk, the infrastructure maintained by the CLARIN-DK project, is not only a repository of resources, but also a place where users can analyse, annotate, reformat and potentially even translate resources, using tools that are integrated in the infrastructure as web services. In many cases a single tool does not produce the desired output, given the input resource at hand. Still, in such cas...

Let Dk(w) be the multiset containing all factors of w of length k including repetitions. One of the main results is that if Dk(w) = Dk(v) for all k ≤ |w| 2 + 1, then w = v. The bound |w| 2 + 1 is optimal; however we will also show that if Dk(w) = Dk(v) for all k ≤ |w| 2 , then w and v are structurally similar. c © 2008 Elsevier B.V. All rights reserved.

ClimateLab, Symbion Science Park, Fruebjergvej 3, Box 98, DK-2100 Copenhagen O, Denmark Department of Bioscience, Aarhus University, Ny Munkegade 116, DK-8000 Aarhus C, Denmark Department of Bioscience, Aarhus University, Frederiksborgvej 399, DK-4000 Roskilde, Denmark Center for Macroecology, Evolution and Climate, Faculty of Science, University of Copenhagen, Universitetsparken 15, DK-2100 Co...

— In this paper we present a class ofalgorithms for the réduction ofbinary trees. Each algorithm Dk uses an input-restricted deque of length k and an auxiliary store. Dk is a possible generalization of the customary method for the réduction of a tree by means of a stack. We shall show that the number of binary trees with n leaves which can be reduced by algorithm Dk with at most i auxiliary cel...

Let Gl be the graph obtained from Kl by adhering the root of isomorphic trees T to every vertex of Kl, and dk−j+1 be the degree of vertices in the level j. In this paper we study the spectrum of the adjacency matrix A(Gl) and the Laplacian matrix L(Gl) for all positive integer l, and give some results about the spectrum of the adjacency matrix A(Gl) and the Laplacian matrix L(Gl). By using thes...

In this paper, we report findings on an examination of the document selecting behaviors of people with different levels of domain knowledge (DK). We found that people with high and low DK levels generally select different sets of documents to view; those high in DK read more documents and gave higher relevance ratings for the documents they view than those low in DK. The reasons of the findings...

Center for Macroecology, Evolution and Climate, Natural History Museum of Denmark, University of Copenhagen, Universitetsparken 15, DK-2100 Copenhagen Ø, Denmark Dept. of Biology, University of Copenhagen, Universitetsparken 15, DK-2100 Copenhagen Ø, Denmark Biodiversity & Conservation, Department of Bioscience, Aarhus University, Grenåvej 14, DK-8410 Rønde, Denmark Centre for GeoGenetics, Natu...

G. Toscano, S. Raza, S. Xiao, M. Wubs, A.-P. Jauho, S.I. Bozhevolnyi, and N.A. Mortensen Department of Photonics Engineering, Technical University of Denmark, DK-2800 Kgs. Lyngby, Denmark Center for Electron Nanoscopy, Technical University of Denmark, DK-2800 Kgs. Lyngby, Denmark Department of Micro and Nanotechnology, Technical University of Denmark, DK-2800 Kgs. Lyngby, Denmark Institute of S...