Explore the vast range of titles available.

Resting-state functional magnetic resonance imaging (fMRI) has highlighted the rich structure of brain activity in absence of a task or stimulus. A great effort has been dedicated in the last two decades to investigate functional connectivity (FC), i.e. the functional interplay between different regions of the brain, which was for a long time assumed to have stationary nature. Only recently was the dynamic behaviour of FC revealed, showing that on top of correlational patterns of spontaneous fMRI signal fluctuations, connectivity between different brain regions exhibits meaningful variations within a typical resting-state fMRI experiment. As a consequence, a considerable amount of work has been directed to assessing and characterising dynamic FC (dFC), and several different approaches were explored to identify relevant FC fluctuations. At the same time, several questions were raised about the nature of dFC, which would be of interest only if brought back to a neural origin. In support of this, correlations with electroencephalography (EEG) recordings, demographic and behavioural data were established, and various clinical applications were explored, where the potential of dFC could be preliminarily demonstrated. In this review, we aim to provide a comprehensive description of the dFC approaches proposed so far, and point at the directions that we see as most promising for the future developments of the field. Advantages and pitfalls of dFC analyses are addressed, helping the readers to orient themselves through the complex web of available methodologies and tools. [Display omitted] •A great effort has been spent on dynamic functional connectivity characterization.•We exhaustively describe existing approaches, their advantages and pitfalls.•We discuss future analytical directions: frame-wise analysis and temporal modeling.•Frame-wise analysis extracts the meaningful functional networks from events.•Temporal modeling parameterizes brain dynamics in flexible and realistic manners.

Ultraconserved (UCEs) are popular markers for phylogenomic studies. They are relatively simple to collect from distantly-related organisms, and contain sufficient information to infer relationships at almost all taxonomic levels. Most studies of UCEs use partitioning to account for variation in rates and patterns of molecular evolution among sites, for example by estimating an independent model of molecular evolution for each UCE. However, rates and patterns of molecular evolution vary substantially within as well as between UCEs, suggesting that there may be opportunities to improve how UCEs are partitioned for phylogenetic inference. We propose and evaluate new partitioning methods for phylogenomic studies of UCEs: Sliding-Window Site Characteristics (SWSC), and UCE Site Position (UCESP). The first method uses site characteristics such as entropy, multinomial likelihood, and GC content to generate partitions that account for heterogeneity in rates and patterns of molecular evolution within each UCE. The second method groups together nucleotides that are found in similar physical locations within the UCEs. We examined the new methods with seven published data sets from a variety of taxa. We demonstrate the UCESP method generates partitions that are worse than other strategies used to partition UCE data sets (e.g., one partition per UCE). The SWSC method, particularly when based on site entropies, generates partitions that account for within-UCE heterogeneity and leads to large increases in the model fit. All of the methods, code, and data used in this study, are available from https://github.com/Tagliacollo/PartitionUCE. Simplified code for implementing the best method, the SWSC-EN, is available from https://github.com/Tagliacollo/PFinderUCE-SWSC-EN.

Functional brain networks reconfigure spontaneously during rest. Such network dynamics can be studied by dynamic functional connectivity (dynFC); i.e., sliding-window correlations between regional brain activity. Key parameters—such as window length and cut-off frequencies for filtering—are not yet systematically studied. In this letter we provide the fundamental theory from signal processing to address these parameter choices when estimating and interpreting dynFC. We guide the reader through several illustrative cases, both simple analytical models and experimental fMRI BOLD data. First, we show how spurious fluctuations in dynFC can arise due to the estimation method when the window length is shorter than the largest wavelength present in both signals, even for deterministic signals with a fixed relationship. Second, we study how real fluctuations of dynFC can be explained using a frequency-based view, which is particularly instructive for signals with multiple frequency components such as fMRI BOLD, demonstrating that fluctuations in sliding-window correlation emerge by interaction between frequency components similar to the phenomenon of beat frequencies. We conclude with practical guidelines for the choice and impact of the window length.

To design an algorithm for detecting outliers over streaming data has become an important task in many common applications, arising in areas such as fraud detections, network analysis, environment monitoring and so forth. Due to the fact that real-time data may arrive in the form of streams rather than batches, properties such as concept drift, temporal context, transiency, and uncertainty need to be considered. In addition, data processing needs to be incremental with limited memory resource, and scalable. These facts create big challenges for existing outlier detection algorithms in terms of their accuracies when they are implemented in an incremental fashion, especially in the streaming environment. To address these problems, we first propose C_KDE_WR, which uses sliding window and kernel function to process the streaming data online, and reports its results demonstrating high throughput on handling real-time streaming data, implemented in a CUDA framework on Graphics Processing Unit (GPU). We also present another algorithm, C_LOF, based on a very popular and effective outlier detection algorithm called Local Outlier Factor (LOF) which unfortunately works only on batched data. Using a novel incremental approach that compensates the drawback of high complexity in LOF, we show how to implement it in a streaming context and to obtain results in a timely manner. Like C_KDE_WR, C_LOF also employs sliding-window and statistical-summary to help making decision based on the data in the current window. It also addresses all those challenges of streaming data as addressed in C_KDE_WR. In addition, we report the comparative evaluation on the accuracy of C_KDE_WR with the state-of-the-art SOD_GPU using Precision, Recall and F-score metrics. Furthermore, a t-test is also performed to demonstrate the significance of the improvement. We further report the testing results of C_LOF on different parameter settings and drew ROC and PR curve with their area under the curve (AUC) and Average Precision (AP) values calculated respectively. Experimental results show that C_LOF can overcome the masquerading problem, which often exists in outlier detection on streaming data. We provide complexity analysis and report experiment results on the accuracy of both C_KDE_WR and C_LOF algorithms in order to evaluate their effectiveness as well as their efficiencies.

A promising recent development in the study of brain function is the dynamic analysis of resting-state functional MRI scans, which can enhance understanding of normal cognition and alterations that result from brain disorders. One widely used method of capturing the dynamics of functional connectivity is sliding window correlation (SWC). However, in the absence of a “gold standard” for comparison, evaluating the performance of the SWC in typical resting-state data is challenging. This study uses simulated networks (SNs) with known transitions to examine the effects of parameters such as window length, window offset, window type, noise, filtering, and sampling rate on the SWC performance. The SWC time course was calculated for all node pairs of each SN and then clustered using the k-means algorithm to determine how resulting brain states match known configurations and transitions in the SNs. The outcomes show that the detection of state transitions and durations in the SWC is most strongly influenced by the window length and offset, followed by noise and filtering parameters. The effect of the image sampling rate was relatively insignificant. Tapered windows provide less sensitivity to state transitions than rectangular windows, which could be the result of the sharp transitions in the SNs. Overall, the SWC gave poor estimates of correlation for each brain state. Clustering based on the SWC time course did not reliably reflect the underlying state transitions unless the window length was comparable to the state duration, highlighting the need for new adaptive window analysis techniques. •We evaluate sliding window correlation as a dynamic network analysis method.•We evaluate k-means for state identification of the results.•Use of simulated networks provides ground truth for performance evaluation.•Window length, offset, and filtering significantly influence the results

Sliding-window correlation is an emerging method for mapping time-resolved, resting-state functional connectivity. To avoid mapping spurious connectivity fluctuations (false positives), Leonardi and Van De Ville recently recommended choosing a window length exceeding the longest wavelength composing the BOLD signal, usually assumed to be ~100s. Here, we provide further statistical support for this rule of thumb. However, we demonstrate that non-stationary fluctuations in functional connectivity can in theory be detected with much shorter window lengths (e.g. 40s), while maintaining nominal control of false positives. We find that statistical power is near-maximal for window lengths chosen according to Leonardi and Van De Ville's rule of thumb. Furthermore, we lay some foundations for a parametric test to identify non-stationary fluctuations in functional connectivity, also noting limitations of the sinusoidal model upon which our work, and the work of Leonardi and Van De Ville, is based. Most notably, our analytical results pertain to covariances, as does our statistical test, whereas functional connectivity is more commonly measured using correlations. •We consider window length choice when computing dynamic functional connectivity.•We provide statistical support for Leonardi and Van De Ville's 1/f rule of thumb.•We discuss limitations of Leonardi and Van De Ville's sinusoidal model.•We develop a test to identify non-stationary connectivity fluctuations.

Background Genotype imputation can help reduce genotyping costs particularly for implementation of genomic selection. In applications entailing large populations, recovering the genotypes of untyped loci using information from reference individuals that were genotyped with a higher density panel is computationally challenging. Popular imputation methods are based upon the Hidden Markov model and have computational constraints due to an intensive sampling process. A fast, deterministic approach, which makes use of both family and population information, is presented here. All individuals are related and, therefore, share haplotypes which may differ in length and frequency based on their relationships. The method starts with family imputation if pedigree information is available, and then exploits close relationships by searching for long haplotype matches in the reference group using overlapping sliding windows. The search continues as the window size is shrunk in each chromosome sweep in order to capture more distant relationships. Results The proposed method gave higher or similar imputation accuracy than Beagle and Impute2 in cattle data sets when all available information was used. When close relatives of target individuals were present in the reference group, the method resulted in higher accuracy compared to the other two methods even when the pedigree was not used. Rare variants were also imputed with higher accuracy. Finally, computing requirements were considerably lower than those of Beagle and Impute2. The presented method took 28 minutes to impute from 6 k to 50 k genotypes for 2,000 individuals with a reference size of 64,429 individuals. Conclusions The proposed method efficiently makes use of information from close and distant relatives for accurate genotype imputation. In addition to its high imputation accuracy, the method is fast, owing to its deterministic nature and, therefore, it can easily be used in large data sets where the use of other methods is impractical.

The stochastic nature of renewable energy sources, especially solar PV output, has created uncertainties for the power sector. It threatens the stability of the power system and results in an inability to match power consumption and production. This paper presents a Convolutional Neural Network (CNN) approach consisting of different architectures, such as the regular CNN, multi-headed CNN, and CNN-LSTM (CNN-Long Short-Term Memory), which utilizes a sliding window data-level approach and other data pre-processing techniques to make accurate forecasts. The output of the solar panels is linked to input parameters such as irradiation, module temperature, ambient temperature, and windspeed. The benchmarking and accuracy metrics are calculated for 1 h, 1 day, and 1 week for the CNN based methods which are then compared with the results from the autoregressive moving average and multiple linear regression models in order to demonstrate its efficacy in making short-term and medium-term forecasts.

The past few years have seen an emergence of approaches that leverage temporal changes in whole-brain patterns of functional connectivity (the chronnectome). In this chronnectome study, we investigate the replicability of the human brain's inter-regional coupling dynamics during rest by evaluating two different dynamic functional network connectivity (dFNC) analysis frameworks using 7 500 functional magnetic resonance imaging (fMRI) datasets. To quantify the extent to which the emergent functional connectivity (FC) patterns are reproducible, we characterize the temporal dynamics by deriving several summary measures across multiple large, independent age-matched samples. Reproducibility was demonstrated through the existence of basic connectivity patterns (FC states) amidst an ensemble of inter-regional connections. Furthermore, application of the methods to conservatively configured (statistically stationary, linear and Gaussian) surrogate datasets revealed that some of the studied state summary measures were indeed statistically significant and also suggested that this class of null model did not explain the fMRI data fully. This extensive testing of reproducibility of similarity statistics also suggests that the estimated FC states are robust against variation in data quality, analysis, grouping, and decomposition methods. We conclude that future investigations probing the functional and neurophysiological relevance of time-varying connectivity assume critical importance. •Replicability in dynamic functional connectivity state measures was investigated.•Twenty-eight samples each with two hundred and fifty rest-fMRI datasets were studied.•State profiles were modelled using two (clustering and fuzzy meta-state) approaches.•Both approaches showed high consistency for a range of model orders.•Surrogate testing confirmed state summary measures to be statistically significant.

The need to use roads is vital. In reality, smooth asphalt roads help people in their daily lives by saving time, avoiding traffic, and preserving the means of transportation. Recently, road anomaly detection using smartphone sensors such as accelerometers, gyroscopes, and GPS has become an important topic in the field of Intelligent Transportation Systems (ITS). In this context, many solutions have been proposed using Static Sliding Window (SSW), which is based on fixed window length. However, in the real world, the window length of the anomaly changes according to the speed value and the anomaly width, which is considered as a major drawback of SSW. In this paper, we propose a new technique called Dynamic Sliding Window (DSW), which aims to improve the quality of road anomaly detection by preprocessing the accelerometer signal. The proposed technique is applied to the same dataset and under the same conditions as the SSW. To cover all scenarios, thirty different virtual roads and several types of anomalies (speed bumps, metal bumps, and potholes) were used as training and test data. The resulting outputs of the DSW and SSW have been used by seven heuristic algorithms proposed by previous researchers and seven classifiers based on twelve feature detectors. The obtained results using the proposed DSW have been compared to those obtained using the SSW to demonstrate the efficiency of the former. Indeed, based on the comparison, the proposed DSW has proven its potential to outperform all previous road anomaly detection methods.