2,201 research outputs found

    Laboratory Rearing of Phalangium Opilio (Arachnida: Opiliones)

    Get PDF
    While a good deal of work has been reported on the natural history and ecology of the opiliones in Europe and England (Bristowe, 1949; Sankey, 1949; Todd, 1949; Phillipson, 1959; Savory, 1964; Juberthie, 1965), this important group has received little attention in North America. Bishop (1949) published a concise synopsis of reactions and general habits of the opiliones of New York and, in a Ph. D. dissertation, Edgar (1960) described the biology of the order in Michigan. Current studies at Michigan State University on the effects of insecticides on non-target organisms have revealed an acute lack of biological information on the group, and before the effects of insecticides could be determined, life histories of the opiliones had to be clarified. Consequently, in 1966 a study of the ecology and rearing requirements of selected Michigan species was initiated. The present paper describes a new incubation technique for opilione eggs that shows promise of facilitating laboratory rearing of this group

    Evaluation of an Abuse Prevention Education Program for Adults with Developmental Disabilities

    Get PDF
    Abstract An evaluation of an abuse protection education program was conducted for adults with developmental disabilities who receive supports and services from two Community Living Ontario agencies. Abuse education is mandated within the province of Ontario but few empirically evaluated curricula exist to help organizations provide effective education for this vulnerable population. A sample of 61 adults with varying degrees of cognitive ability were randomly assigned to one of three groups: control; information-only educational lessons; and an expanded program providing additional lessons on decision-making and behavioural skills thought necessary to prevent, recognize and report abuse. This program has been developed to be easy to use, inexpensive, comprehensive, engaging and sensitive to the potential for re-traumatization for participants with an abuse history. Results indicated that regardless of treatment group assignment, people with higher cognitive abilities performed better on all test instruments at pretest and posttest as compared to people with lower cognitive abilities and that women generally performed better than men. In regards to treatment impact there was limited statistically significant evidence but substantial anecdotal evidence to indicate that participants who received the entire curriculum demonstrated improvements in abuse protection knowledge and skill acquisition at posttest. However, the gains made eroded within 5 weeks of education. Similar results were seen in a naturalistic case study group of 13 adults with higher cognitive abilities. Previous research suggests that if programs such as this one were delivered over longer periods of time and included regular ‘booster’ lessons, statistically significant findings could be more robust. Access to reliable and valid instruments to measure abuse protection knowledge and skills remains a limitation for accurate evaluation of programs such as this one. The results have implications for agencies in Ontario who are required by legislation to provide abuse awareness for adults with developmental disabilities

    Coupled Ito equations of continuous quantum state measurement, and estimation

    Full text link
    We discuss a non-linear stochastic master equation that governs the time-evolution of the estimated quantum state. Its differential evolution corresponds to the infinitesimal updates that depend on the time-continuous measurement of the true quantum state. The new stochastic master equation couples to the two standard stochastic differential equations of time-continuous quantum measurement. For the first time, we can prove that the calculated estimate almost always converges to the true state, also at low-efficiency measurements. We show that our single-state theory can be adapted to weak continuous ensemble measurements as well.Comment: 5 pages, RevTeX4. In version v2 some minor revisions and clarifications have been incorporated. Moreover, a new reference has been included. Accepted for publication in Journal of Physics A: Mathematical and Genera

    Reflexive Cones

    Full text link
    Reflexive cones in Banach spaces are cones with weakly compact intersection with the unit ball. In this paper we study the structure of this class of cones. We investigate the relations between the notion of reflexive cones and the properties of their bases. This allows us to prove a characterization of reflexive cones in term of the absence of a subcone isomorphic to the positive cone of \ell_{1}. Moreover, the properties of some specific classes of reflexive cones are investigated. Namely, we consider the reflexive cones such that the intersection with the unit ball is norm compact, those generated by a Schauder basis and the reflexive cones regarded as ordering cones in a Banach spaces. Finally, it is worth to point out that a characterization of reflexive spaces and also of the Schur spaces by the properties of reflexive cones is given.Comment: 23 page

    Bringing Order to Special Cases of Klee's Measure Problem

    Full text link
    Klee's Measure Problem (KMP) asks for the volume of the union of n axis-aligned boxes in d-space. Omitting logarithmic factors, the best algorithm has runtime O*(n^{d/2}) [Overmars,Yap'91]. There are faster algorithms known for several special cases: Cube-KMP (where all boxes are cubes), Unitcube-KMP (where all boxes are cubes of equal side length), Hypervolume (where all boxes share a vertex), and k-Grounded (where the projection onto the first k dimensions is a Hypervolume instance). In this paper we bring some order to these special cases by providing reductions among them. In addition to the trivial inclusions, we establish Hypervolume as the easiest of these special cases, and show that the runtimes of Unitcube-KMP and Cube-KMP are polynomially related. More importantly, we show that any algorithm for one of the special cases with runtime T(n,d) implies an algorithm for the general case with runtime T(n,2d), yielding the first non-trivial relation between KMP and its special cases. This allows to transfer W[1]-hardness of KMP to all special cases, proving that no n^{o(d)} algorithm exists for any of the special cases under reasonable complexity theoretic assumptions. Furthermore, assuming that there is no improved algorithm for the general case of KMP (no algorithm with runtime O(n^{d/2 - eps})) this reduction shows that there is no algorithm with runtime O(n^{floor(d/2)/2 - eps}) for any of the special cases. Under the same assumption we show a tight lower bound for a recent algorithm for 2-Grounded [Yildiz,Suri'12].Comment: 17 page

    An update on the Hirsch conjecture

    Get PDF
    The Hirsch conjecture was posed in 1957 in a letter from Warren M. Hirsch to George Dantzig. It states that the graph of a d-dimensional polytope with n facets cannot have diameter greater than n - d. Despite being one of the most fundamental, basic and old problems in polytope theory, what we know is quite scarce. Most notably, no polynomial upper bound is known for the diameters that are conjectured to be linear. In contrast, very few polytopes are known where the bound ndn-d is attained. This paper collects known results and remarks both on the positive and on the negative side of the conjecture. Some proofs are included, but only those that we hope are accessible to a general mathematical audience without introducing too many technicalities.Comment: 28 pages, 6 figures. Many proofs have been taken out from version 2 and put into the appendix arXiv:0912.423

    Servicio SURAD, 2011 primer año de funcionamiento

    Get PDF
    1 copia .pdf del póster original, presentado en tamaño din A0 en las 4as Jornadas de Análisis de la Red de Bibliotecas del CSIC (Madrid. 26-27 abril, 2012). Más información de las Jornadas en: http://jornadas.urici.csic.es/IVjornadas/El servicio SURAD presenta los resultados del 2011, su primer año de actividad. SURAD es el servicio de localización y suministro de documentos científicos para la comunidad investigadora del CSIC, que atiende aquellas solicitudes que no pueden gestionar en primera instancia sus bibliotecas. SURAD se gestiona a través de la Unidad de Recursos de la Información Científica para la Investigación y integrado dentro del Plan 100% Digital del CSIC. Su objetivo es dar un servicio de acceso al documento a la comunidad científica del CSIC que carece de servicio de biblioteca presencial en su centro/instituto y actuar como servicio de último recurso de obtención de documentos para las bibliotecas de la Red, proporcionando los documentos que éstas no puedan obtener.Peer reviewe
    corecore