789 research outputs found
Quark Lagrangian diagonalization versus non-diagonal kinetic terms
Loop corrections induce a dependence on the momentum squared of the
coefficients of the Standard Model Lagrangian, making highly non-trivial (or
even impossible) the diagonalization of its quadratic part. Fortunately, the
introduction of appropriate counterterms solves this puzzle.Comment: 2 pages, 1 figur
Sex differences in brain plasticity: a new hypothesis for sex ratio bias in autism.
Several observations support the hypothesis that differences in synaptic and regional cerebral plasticity between the sexes account for the high ratio of males to females in autism. First, males are more susceptible than females to perturbations in genes involved in synaptic plasticity. Second, sex-related differences in non-autistic brain structure and function are observed in highly variable regions, namely, the heteromodal associative cortices, and overlap with structural particularities and enhanced activity of perceptual associative regions in autistic individuals. Finally, functional cortical reallocations following brain lesions in non-autistic adults (for example, traumatic brain injury, multiple sclerosis) are sex-dependent. Interactions between genetic sex and hormones may therefore result in higher synaptic and consecutively regional plasticity in perceptual brain areas in males than in females. The onset of autism may largely involve mutations altering synaptic plasticity that create a plastic reaction affecting the most variable and sexually dimorphic brain regions. The sex ratio bias in autism may arise because males have a lower threshold than females for the development of this plastic reaction following a genetic or environmental event
Collaborative learning with peerwise
© 2018 D. Duret et al. Building effective and supportive communities of practice in an asynchronous environment can enable students to learn from each other at their own convenient times without the need to meeting for discussing concepts. In an undergraduate course with a large amount of content to learn, working collaboratively to answer practice exam questions can help encourage deeper learning and understanding. This project examined whether exam performance can be positively influenced by online collaboration during revision and suggests that the quality of an individual’s contribution has a direct effect on his/her subsequent exam performance. We compared two student cohorts’ exam marks from their previous 3 years of exams with how they performed in Year 4 after using PeerWise (an online repository of multiple-choice questions that are created, answered, rated and discussed by students). In addition, we looked at the quantity and quality of their contribution in PeerWise to evaluate how this affected their fourth year exam performance. We confirmed that exam performance is improved by authoring questions in PeerWise, but found it is further enhanced by replying to, and commenting on, others’ posts as well
Is there a best Büchi automaton for explicit model checking?
LTL to Büchi automata (BA) translators are traditionally optimized to produce automata with a small number of states or a small number of non-deterministic states. In this paper, we search for properties of Büchi automata that really influence the performance of explicit model checkers. We do that by manual analysis of several automata and by experiments with common LTL-to-BA translators and realistic verification tasks. As a result of these experiences, we gain a better insight into the characteristics of automata that work well with Spin.Překladače LTL na Büchiho automaty jsou obvykle optimalizovány tak, aby produkovaly automaty s co nejmenším počtem stavů, či s co nejmenším počtem nedeterministických stavů. V této publikaci hledáme vlastnosti Büchiho automatů, které skutečně ovlivňují výkon nástrojů pro explicitní metodu ověřování modelu (model checking). A to pomocí manuální analýzy několika automatů a experimenty s běžnými překladače LTL na automaty a realistickými verifikačními úlohami. Výsledkem těchto experimentů je lepší porozumění charakteristik automatů, které jsou dobré pro model checker Spin
Suspended particles are hotspots of microbial remineralization in the ocean's twilight zone
The sinking of photosynthetically produced organic carbon from the ocean surface to its interior is a significant term in the global carbon cycle. Most sinking organic carbon is, however, remineralized in the mesopelagic zone (∼100 m–1000 m), thereby exerting control over ocean-atmosphere carbon dioxide (CO2) partitioning and hence global climate. Sinking particles are considered hotspots of microbial respiration in the dark ocean. However, our observations in the contrasting Scotia Sea and the Benguela Current show that >90% of microbial remineralisation is associated with suspended, rather than sinking, organic matter, resulting in rapid turnover of the suspended carbon pool and demonstrating its central role in mesopelagic carbon cycling. A non-steady-state model indicates that temporally variable particle fluxes, particle injection pumps and local chemoautotrophy are necessary to help balance the observed mesopelagic respiration. Temperature and oxygen exert control over microbial respiration, particularly for the suspended fraction, further demonstrating the susceptibility of microbial remineralisation to the ongoing decline in oxygen at mid-ocean depths. These observations suggest a partial decoupling of carbon cycling between non-sinking and fast-sinking organic matter, challenging our understanding of how oceanic biological processes regulate climate
Searching a bitstream in linear time for the longest substring of any given density
Given an arbitrary bitstream, we consider the problem of finding the longest
substring whose ratio of ones to zeroes equals a given value. The central
result of this paper is an algorithm that solves this problem in linear time.
The method involves (i) reformulating the problem as a constrained walk through
a sparse matrix, and then (ii) developing a data structure for this sparse
matrix that allows us to perform each step of the walk in amortised constant
time. We also give a linear time algorithm to find the longest substring whose
ratio of ones to zeroes is bounded below by a given value. Both problems have
practical relevance to cryptography and bioinformatics.Comment: 22 pages, 19 figures; v2: minor edits and enhancement
- …