Scatterhoarding and tree regeneration : ecology of nut dispersal in a Neotropical rainforest

cum laude graduation (with distinction

Nocturnal activity by the primarily diurnal Central American agouti (Dasyprocta punctata) in relation to environmental conditions, resource abundance and predation risk

An animal's fitness is in part based on its ability to manage the inherent risks (foraging costs, predation, exposure to disease) with the benefits (resource gain, access to mates, social interactions) of activity (Abrams 1991, Altizer et al. 2003, Lima & Bednekoff 1999, Rubenstein & Hohmann 1989, Wikelski et al. 2001). Thus, understanding an animal's pattern of activity is key to understanding behavioural and ecological processes. However, while numerous laboratory methodologies are available to continuously quantify activity over long periods of time, logistical difficulties have greatly hindered activity studies of animals in the field (DeCoursey 1990)

Colouring of Graphs with Ramsey-Type Forbidden Subgraphs

A colouring of a graph G = (V;E) is a mapping c : V ! f1; 2; : : :g such that c(u) 6= c(v) if uv 2 E; if jc(V )j k then c is a k-colouring. The Colouring problem is that of testing whether a given graph has a k-colouring for some given integer k. If a graph contains no induced subgraph isomorphic to any graph in some family H, then it is called H-free. The complexity of Colouring for H-free graphs with jHj = 1 has been completely classied. When jHj = 2, the classication is still wide open, although many partial results are known. We continue this line of research and forbid induced subgraphs fH1;H2g, where we allow H1 to have a single edge and H2 to have a single nonedge. Instead of showing only polynomial-time solvability, we prove that Colouring on such graphs is xed-parameter tractable when parameterized by jH1j + jH2j. As a byproduct, we obtain the same result both for the problem of determining a maximum independent set and for the problem of determining a maximum clique

Behavioural response of farmed Atlantic salmon (Salmo salar L.) to artificial underwater lights : Wavelet analysis of acoustic telemetry data

publishedVersio

Exact results for the reactivity of a single-file system

We derive analytical expressions for the reactivity of a Single-File System with fast diffusion and adsorption and desorption at one end. If the conversion reaction is fast, then the reactivity depends only very weakly on the system size, and the conversion is about 100%. If the reaction is slow, then the reactivity becomes proportional to the system size, the loading, and the reaction rate constant. If the system size increases the reactivity goes to the geometric mean of the reaction rate constant and the rate of adsorption and desorption. For large systems the number of nonconverted particles decreases exponentially with distance from the adsorption/desorption end.Comment: 4 pages, 2 figure

A record of Striped Hog-nosed Skunk Conepatus semistriatus in central Panama, between two known sub-ranges

Striped Hog-nosed Skunk Conepatus semistriatus was camera-trapped in central Panama. The photographs, taken in a densely forested area, probably belong to a single, wandering, individual. These photographs represent the easternmost record of C. semistriatus in Central America and confirm an earlier, unvouchered, report that its distribution in Panama is larger than previously thought. The record is in the centre of the 700-km wide gap between two sub-ranges, suggesting that the species has a continuous distribution across Central and northern South America

Adolescents' use of care for behavioral and emotional problems: Types, trends, and determinants

Objective: While adolescents use various types of care for behavioral and emotional problems, evidence on age trends and determinants per type is scarce. We aimed to assess use of care by adolescents because of behavioral and emotional problems, overall and by type, and its determinants, for ages 10-19 years. Methods: We obtained longitudinal data on 2,230 adolescents during ages 10-19 from four measurements regarding use of general care and specialized care (youth social care and mental healthcare) in the preceding 6 months, the Child Behavior Checklist (CBCL) and Youth Self-Report, and child and family characteristics. We analyzed data by multilevel logistic regression. Results: Overall rates of use increased from 20.1% at age 10/11 to 32.2% at age 19: general care was used most. At age 10/11 use was higher among boys, at age 19 among girls. Use of general care increased for both genders, whereas use of specialized care increased among girls but decreased among boys. This differential change was associated with CBCL externalizing and internalizing problems, school problems, family socioeconomic status, and parental divorce. Preceding CBCL problems predicted more use: most for mental health care and least for general care. Moreover, general care was used more frequently by low and medium socioeconomic status families, with odds ratios (95%-confidence intervals): 1.52 (1.23;1.88) and 1.40 (1.17;1.67); youth social care in case of parental divorce, 2.07 (1.36;3.17); and of special education, 2.66 (1.78;3.95); and mental healthcare in case of special education, 2.66 (1.60;4.51). Discussion: Adolescents with behavioral and emotional problems use general care most frequently. Overall use increases with age. Determinants of use vary per type

Sparse Square Roots

We show that it can be decided in polynomial time whether a graph of maximum degree 6 has a square root; if a square root exists, then our algorithm finds one with minimum number of edges. We also show that it is FPT to decide whether a connected n-vertex graph has a square root with at most n − 1 + k edges when this problem is parameterized by k. Finally, we give an exact exponential time algorithm for the problem of finding a square root with maximum number of edges

Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs

We show that for all k ≤ − 1 an interval graph is − (k + 1)-Hamilton-connected if and only if its scattering number is at most k. We also give an O(n + m) time algorithm for computing the scattering number of an interval graph with n vertices and m edges, which improves the O(n 3) time bound of Kratsch, Kloks and Müller. As a consequence of our two results the maximum k for which an interval graph is k-Hamilton-connected can be computed in O(n + m) time