232 resultados para Linear complexity


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Genome-wide association studies (GWAS) have been widely used in genetic dissection of complex traits. However, common methods are all based on a fixed-SNP-effect mixed linear model (MLM) and single marker analysis, such as efficient mixed model analysis (EMMA). These methods require Bonferroni correction for multiple tests, which often is too conservative when the number of markers is extremely large. To address this concern, we proposed a random-SNP-effect MLM (RMLM) and a multi-locus RMLM (MRMLM) for GWAS. The RMLM simply treats the SNP-effect as random, but it allows a modified Bonferroni correction to be used to calculate the threshold p value for significance tests. The MRMLM is a multi-locus model including markers selected from the RMLM method with a less stringent selection criterion. Due to the multi-locus nature, no multiple test correction is needed. Simulation studies show that the MRMLM is more powerful in QTN detection and more accurate in QTN effect estimation than the RMLM, which in turn is more powerful and accurate than the EMMA. To demonstrate the new methods, we analyzed six flowering time related traits in Arabidopsis thaliana and detected more genes than previous reported using the EMMA. Therefore, the MRMLM provides an alternative for multi-locus GWAS.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This study investigates effects of syntactic complexity operationalised in terms of movement, intervention and (NP) feature similarity in the development of A’ dependencies in 4-, 6-, and 8-year old typically developing (TD) French children and children with Autism Spectrum Disorders (ASD). Children completed an off-line comprehension task testing eight syntactic structures classified in four levels of complexity: Level 0: No Movement; Level 1: Movement without (configurational) Intervention; Level 2: Movement with Intervention from an element which is maximally different or featurally ‘disjoint’ (mismatched in both lexical NP restriction and number); Level 3: Movement with Intervention from an element similar in one feature or featurally ‘intersecting’ (matched in lexical NP restriction, mismatched in number). The results show that syntactic complexity affects TD children across the three age groups, but also indicate developmental differences between these groups. Movement affected all three groups in a similar way, but intervention effects in intersection cases were stronger in younger than older children, with NP feature similarity affecting only 4-year olds. Complexity effects created by the similarity in lexical restriction of an intervener thus appear to be overcome early in development, arguably thanks to other differences of this intervener (which was mismatched in number). Children with ASD performed less well than the TD children although they were matched on non-verbal reasoning. Overall, syntactic complexity affected their performance in a similar way as in their TD controls, but their performance correlated with non-verbal abilities rather than age, suggesting that their grammatical development does not follow the smooth relation to age that is found in TD children.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Given the long-term negative outcomes associated with depression in adolescence, there is a pressing need to develop brief, evidence based treatments that are accessible to more young people experiencing low mood. Behavioural Activation (BA) is an effective treatment for adult depression, however little research has focused on the use of BA with depressed adolescents, particularly with briefer forms of BA. In this article we outline an adaptation of brief Behavioral Activation Treatment of Depression (BATD) designed for adolescents and delivered in eight sessions (Brief BA). This case example illustrates how a structured, brief intervention was useful for a depressed young person with a number of complicating and risk factors.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Subspace clustering groups a set of samples from a union of several linear subspaces into clusters, so that the samples in the same cluster are drawn from the same linear subspace. In the majority of the existing work on subspace clustering, clusters are built based on feature information, while sample correlations in their original spatial structure are simply ignored. Besides, original high-dimensional feature vector contains noisy/redundant information, and the time complexity grows exponentially with the number of dimensions. To address these issues, we propose a tensor low-rank representation (TLRR) and sparse coding-based (TLRRSC) subspace clustering method by simultaneously considering feature information and spatial structures. TLRR seeks the lowest rank representation over original spatial structures along all spatial directions. Sparse coding learns a dictionary along feature spaces, so that each sample can be represented by a few atoms of the learned dictionary. The affinity matrix used for spectral clustering is built from the joint similarities in both spatial and feature spaces. TLRRSC can well capture the global structure and inherent feature information of data, and provide a robust subspace segmentation from corrupted data. Experimental results on both synthetic and real-world data sets show that TLRRSC outperforms several established state-of-the-art methods.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper proposes a novel adaptive multiple modelling algorithm for non-linear and non-stationary systems. This simple modelling paradigm comprises K candidate sub-models which are all linear. With data available in an online fashion, the performance of all candidate sub-models are monitored based on the most recent data window, and M best sub-models are selected from the K candidates. The weight coefficients of the selected sub-model are adapted via the recursive least square (RLS) algorithm, while the coefficients of the remaining sub-models are unchanged. These M model predictions are then optimally combined to produce the multi-model output. We propose to minimise the mean square error based on a recent data window, and apply the sum to one constraint to the combination parameters, leading to a closed-form solution, so that maximal computational efficiency can be achieved. In addition, at each time step, the model prediction is chosen from either the resultant multiple model or the best sub-model, whichever is the best. Simulation results are given in comparison with some typical alternatives, including the linear RLS algorithm and a number of online non-linear approaches, in terms of modelling performance and time consumption.