Phoretic mites associated with animal and human decomposition

Phoretic mites are likely the most abundant arthropods found on carcases and corpses. They outnumber their scavenger carriers in both number and diversity. Many phoretic mites travel on scavenger insects and are highly specific; they will arrive on a particular species of host and no other. Because of this, they may be useful as trace indicators of their carriers even when their carriers are absent. Phoretic mites can be valuable markers of time. They are usually found in a specialised transitional transport or dispersal stage, often moulting and transforming to adults shortly after arrival on a carcase or corpse. Many are characterised by faster development and generation cycles than their carriers. Humans are normally unaware, but we too carry mites; they are skin mites that are present in our clothes. More than 212 phoretic mite species associated with carcases have been reported in the literature. Among these, mites belonging to the Mesostigmata form the dominant group, represented by 127 species with 25 phoretic mite species belonging to the family Parasitidae and 48 to the Macrochelidae. Most of these mesostigmatids are associated with particular species of flies or carrion beetles, though some are associated with small mammals arriving during the early stages of decomposition. During dry decay, members of the Astigmata are more frequently found; 52 species are phoretic on scavengers, and the majority of these travel on late-arriving scavengers such as hide beetles, skin beetles and moths. Several species of carrion beetles can visit a corpse simultaneously, and each may carry 1-10 species of phoretic mites. An informative diversity of phoretic mites may be found on a decaying carcass at any given time. The composition of the phoretic mite assemblage on a carcass might provide valuable information about the conditions of and time elapsed since death.

Empirical mode decomposition: a novel technique for the study of tremor time series

Tremor is a clinical feature characterized by oscillations of a part of the body. The detection and study of tremor is an important step in investigations seeking to explain underlying control strategies of the central nervous system under natural (or physiological) and pathological conditions. It is well established that tremorous activity is composed of deterministic and stochastic components. For this reason, the use of digital signal processing techniques (DSP) which take into account the nonlinearity and nonstationarity of such signals may bring new information into the signal analysis which is often obscured by traditional linear techniques (e.g. Fourier analysis). In this context, this paper introduces the application of the empirical mode decomposition (EMD) and Hilbert spectrum (HS), which are relatively new DSP techniques for the analysis of nonlinear and nonstationary time-series, for the study of tremor. Our results, obtained from the analysis of experimental signals collected from 31 patients with different neurological conditions, showed that the EMD could automatically decompose acquired signals into basic components, called intrinsic mode functions (IMFs), representing tremorous and voluntary activity. The identification of a physical meaning for IMFs in the context of tremor analysis suggests an alternative and new way of detecting tremorous activity. These results may be relevant for those applications requiring automatic detection of tremor. Furthermore, the energy of IMFs was visualized as a function of time and frequency by means of the HS. This analysis showed that the variation of energy of tremorous and voluntary activity could be distinguished and characterized on the HS. Such results may be relevant for those applications aiming to identify neurological disorders. In general, both the HS and EMD demonstrated to be very useful to perform objective analysis of any kind of tremor and can therefore be potentially used to perform functional assessment.

Robust neurofuzzy rule base knowledge extraction and estimation using subspace decomposition combined with regularization and D-optimality

A new robust neurofuzzy model construction algorithm has been introduced for the modeling of a priori unknown dynamical systems from observed finite data sets in the form of a set of fuzzy rules. Based on a Takagi-Sugeno (T-S) inference mechanism a one to one mapping between a fuzzy rule base and a model matrix feature subspace is established. This link enables rule based knowledge to be extracted from matrix subspace to enhance model transparency. In order to achieve maximized model robustness and sparsity, a new robust extended Gram-Schmidt (G-S) method has been introduced via two effective and complementary approaches of regularization and D-optimality experimental design. Model rule bases are decomposed into orthogonal subspaces, so as to enhance model transparency with the capability of interpreting the derived rule base energy level. A locally regularized orthogonal least squares algorithm, combined with a D-optimality used for subspace based rule selection, has been extended for fuzzy rule regularization and subspace based information extraction. By using a weighting for the D-optimality cost function, the entire model construction procedure becomes automatic. Numerical examples are included to demonstrate the effectiveness of the proposed new algorithm.

A step toward the wet surface chemistry of glycine and alanine on Cu{110}: destabilization and decomposition in the presence of near-ambient water vapor

The coadsorption of water with organic molecules under near-ambient pressure and temperature conditions opens up new reaction pathways on model catalyst surfaces that are not accessible in conventional ultrahigh-vacuum surfacescience experiments. The surface chemistry of glycine and alanine at the water-exposed Cu{110} interface was studied in situ using ambient-pressure photoemission and X-ray absorption spectroscopy techniques. At water pressures above 10-5 Torr a significant pressure-dependent decrease in the temperature for dissociative desorption was observed for both amino acids, accompanied by the appearance of a newCN intermediate, which is not observed for lower pressures. The most likely reaction mechanisms involve dehydrogenation induced by O and/or OH surface species resulting from the dissociative adsorption of water. The linear relationship between the inverse decomposition temperature and the logarithm of water pressure enables determination of the activation energy for the surface reaction, between 213 and 232 kJ/mol, and a prediction of the decomposition temperature at the solidliquid interface by extrapolating toward the equilibrium vapor pressure. Such experiments near the equilibrium vapor pressure provide important information about elementary surface processes at the solidliquid interface, which can be retrieved neither under ultrahigh vacuum conditions nor from interfaces immersed in a solution.

Morphological decomposition in Broca's aphasia

Background: Few studies have investigated how individuals diagnosed with post-stroke Broca’s aphasia decompose words into their constituent morphemes in real-time processing. Previous research has focused on morphologically complex words in non-time-constrained settings or in syntactic frames, but not in the lexicon. Aims: We examined real-time processing of morphologically complex words in a group of five Greek-speaking individuals with Broca’s aphasia to determine: (1) whether their morphological decomposition mechanisms are sensitive to lexical (orthography and frequency) vs. morphological (stem-suffix combinatory features) factors during visual word recognition, (2) whether these mechanisms are different in inflected vs. derived forms during lexical access, and (3) whether there is a preferred unit of lexical access (syllables vs. morphemes) for inflected vs. derived forms. Methods & Procedures: The study included two real-time experiments. The first was a semantic judgment task necessitating participants’ categorical judgments for high- and low-frequency inflected real words and pseudohomophones of the real words created by either an orthographic error at the stem or a homophonous (but incorrect) inflectional suffix. The second experiment was a letter-priming task at the syllabic or morphemic boundary of morphologically transparent inflected and derived words whose stems and suffixes were matched for length, lemma and surface frequency. Outcomes & Results: The majority of the individuals with Broca’s aphasia were sensitive to lexical frequency and stem orthography, while ignoring the morphological combinatory information encoded in the inflectional suffix that control participants were sensitive to. The letter-priming task, on the other hand, showed that individuals with aphasia—in contrast to controls—showed preferences with regard to the unit of lexical access, i.e., they were overall faster on syllabically than morphemically parsed words and their morphological decomposition mechanisms for inflected and derived forms were modulated by the unit of lexical access. Conclusions: Our results show that in morphological processing, Greek-speaking persons with aphasia rely mainly on stem access and thus are only sensitive to orthographic violations of the stem morphemes, but not to illegal morphological combinations of stems and suffixes. This possibly indicates an intact orthographic lexicon but deficient morphological decomposition mechanisms, possibly stemming from an underspecification of inflectional suffixes in the participants’ grammar. Syllabic information, however, appears to facilitate lexical access and elicits repair mechanisms that compensate for deviant morphological parsing procedures.

Heterogeneous tensor decomposition for clustering via manifold optimization

Tensor clustering is an important tool that exploits intrinsically rich structures in real-world multiarray or Tensor datasets. Often in dealing with those datasets, standard practice is to use subspace clustering that is based on vectorizing multiarray data. However, vectorization of tensorial data does not exploit complete structure information. In this paper, we propose a subspace clustering algorithm without adopting any vectorization process. Our approach is based on a novel heterogeneous Tucker decomposition model taking into account cluster membership information. We propose a new clustering algorithm that alternates between different modes of the proposed heterogeneous tensor model. All but the last mode have closed-form updates. Updating the last mode reduces to optimizing over the multinomial manifold for which we investigate second order Riemannian geometry and propose a trust-region algorithm. Numerical experiments show that our proposed algorithm compete effectively with state-of-the-art clustering algorithms that are based on tensor factorization.