Phase shift invariant imaging of coherent sources (PSIICOS) from MEG data.
Increasing evidence suggests that neuronal communication is a defining property of functionally specialized brain networks and that it is implemented through synchronization between population activities of distinct brain areas. The detection of long-range coupling in electroencephalography (EEG) and magnetoencephalography (MEG) data using conventional metrics (such as coherence or phase-locking value) is by definition contaminated by spatial leakage. Methods such as imaginary coherence, phase-lag index or orthogonalized amplitude correlations tackle spatial leakage by ignoring zero-phase interactions. Although useful, these metrics will by construction lead to false negatives in cases where true zero-phase coupling exists in the data and will underestimate interactions with phase lags in the vicinity of zero. Yet, empirically observed neuronal synchrony in invasive recordings indicates that it is not uncommon to find zero or close-to-zero phase lag between the activity profiles of coupled neuronal assemblies. Here, we introduce a novel method that allows us to mitigate the undesired spatial leakage effects and detect zero and near zero phase interactions. To this end, we propose a projection operation that operates on sensor-space cross-spectrum and suppresses the spatial leakage contribution but retains the true zero-phase interaction component. We then solve the network estimation task as a source estimation problem defined in the product space of interacting source topographies. We show how this framework provides reliable interaction detection for all phase-lag values and we thus refer to the method as Phase Shift Invariant Imaging of Coherent Sources (PSIICOS). Realistic simulations demonstrate that PSIICOS has better detector characteristics than existing interaction metrics. Finally, we illustrate the performance of PSIICOS by applying it to real MEG dataset recorded during a standard mental rotation task. Taken together, using analytical derivations, data simulations and real brain data, this study presents a novel source-space MEG/EEG connectivity method that overcomes previous limitations and for the first time allows for the estimation of true zero-phase coupling via non-invasive electrophysiological recordings.
The Abstract book contains the abstracts of the posters presentations of the participants of the Methodological school: Methods of data processing in EEG and MEG, Moscow, 16-30th of April, 2013. The School was devoted to the theoretical and practical aspects of the contemporary methods of the dynamic mapping of brain activity by analysis of multichannel MEG and EEG.
Reading utilises at least two neural pathways. The temporal lexical route visually maps whole words to their lexical entries, whilst the nonlexical route decodes words phonologically via parietal cortex. Readers typically employ the lexical route for familiar words, but poor comprehension plus precocity at mechanically 'sounding out' words suggests that differences might exist in autism. Combined MEG/EEG recordings of adults with autistic spectrum conditions (ASC) and controls while reading revealed preferential recruitment of temporal areas in controls and additional parietal recruitment in ASC. Furthermore, a lack of differences between semantic word categories was consistent with previous suggestion that people with ASC may lack a 'default' lexical-semantic processing mode. These results are discussed with reference to dual-route models of reading.
The Abstract book contains the abstracts of the posters presentations of the participants of the Methodological school: Methods of data processing in EEg and MEG, Moscow, 16-30th of April, 2013. The School was devoted to the theoretical and practical aspects of the contemporary methods of the dynamic mapping of brain activity by analysis of multichannel MEG and EEG.
The problem of non-invasive preoperative localization of motor areas in human cortex has not been solved yet. In clinical practice, localization of the hand representation in the primary motor cortex often becomes one of the main goals of the pre-surgical evaluation. In healthy subjects the area of the motor hand representation usually corresponds to certain standard anatomical landmarks (hand knob in the precentral gyrus), which can be easily found in sMRI images. Unfortunately, in patients with various brain lesions these landmarks may be absent or not corresponding to the area of the motor cortex. In such cases, location of irreplacable areas must be determined according to their functional and/or temporal dynamical characteristics.
It might become a promising method of localizing primary motor area by way of taking into account the characteristic properties of the primary motor cortex temporal dynamics during movement preparation.
A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.
Event logs collected by modern information and technical systems usually contain enough data for automated process models discovery. A variety of algorithms was developed for process models discovery, conformance checking, log to model alignment, comparison of process models, etc., nevertheless a quick analysis of ad-hoc selected parts of a journal still have not get a full-fledged implementation. This paper describes an ROLAP-based method of multidimensional event logs storage for process mining. The result of the analysis of the journal is visualized as directed graph representing the union of all possible event sequences, ranked by their occurrence probability. Our implementation allows the analyst to discover process models for sublogs defined by ad-hoc selection of criteria and value of occurrence probability
It is well-known that the class of sets that can be computed by polynomial size circuits is equal to the class of sets that are polynomial time reducible to a sparse set. It is widely believed, but unfortunately up to now unproven, that there are sets in EXPNP, or even in EXP that are not computable by polynomial size circuits and hence are not reducible to a sparse set. In this paper we study this question in a more restricted setting: what is the computational complexity of sparse sets that are selfreducible? It follows from earlier work of Lozano and Torán (in: Mathematical systems theory, 1991) that EXPNP does not have sparse selfreducible hard sets. We define a natural version of selfreduction, tree-selfreducibility, and show that NEXP does not have sparse tree-selfreducible hard sets. We also construct an oracle relative to which all of EXP is reducible to a sparse tree-selfreducible set. These lower bounds are corollaries of more general results about the computational complexity of sparse sets that are selfreducible, and can be interpreted as super-polynomial circuit lower bounds for NEXP.
The Handbook of CO₂ in Power Systems' objective is to include the state-of-the-art developments that occurred in power systems taking CO₂ emission into account. The book includes power systems operation modeling with CO₂ emissions considerations, CO₂ market mechanism modeling, CO₂ regulation policy modeling, carbon price forecasting, and carbon capture modeling. For each of the subjects, at least one article authored by a world specialist on the specific domain is included.
Many electronic devices operate in a cyclic mode. This should be considered when forecastingreliability indicators at the design stage.The accuracy of the prediction and the planning for the event to ensure reliability depends on correctness of valuation and accounting greatest possiblenumber of factors. That in turn will affect the overall progress of the design and, in the end,result in the quality and competitiveness of products