This document discusses various tools that can be used to analyze directed dynamical connectivity in electrical neuroimaging data. It describes two main classes of methods: those that assume independent measurements at each node and infer networks from temporally correlated data, and those that use temporal dynamics by modeling a dynamical system at each node using approaches like dynamic Bayesian networks or model-free investigations of temporal correlation. It also discusses tools like dynamic causal models, Granger causality, transfer entropy, and their ability to reflect effective connectivity and directed dynamical connectivity.
Multiscale Granger Causality and Information Decomposition danielemarinazzo
Ā
Slides for the C3S workshop in Cologne, in which I presented an extension to multiple temporal scale of Granger causality and Partial Information Decomposition, using the robust state space formulation
A Spatial Domain Image Steganography Technique Based on Matrix Embedding and ...CSCJournals
Ā
This paper presents an algorithm in spatial domain which gives less distortion to the cover image during embedding process. Minimizing embedding impact and maximizing embedding capacity are the key factors of any steganography algorithm. Peak Signal to Noise Ratio (PSNR) is the familiar metric used in discriminating the distorted image (stego image) and cover image. Here matrix embedding technique is chosen to embed the secret image which is initially Huffman encoded. The Huffman encoded image is overlaid on the selected bits of all the channels of pixels of cover image through matrix embedding. As a result, the stego image is constructed with very less distortion when compared to the cover image ends up with higher PSNR value. A secret image which cannot be embedded in a normal LSB embedding technique can be overlaid in this proposed technique since the secret image is Huffman encoded. Experimental results for standard cover images, which obtained higher PSNR value during the operation is shown in this paper.
CORRELATION OF EIGENVECTOR CENTRALITY TO OTHER CENTRALITY MEASURES: RANDOM, S...csandit
Ā
In this paper, we thoroughly investigate correlations of eigenvector centrality to five centrality
measures, including degree centrality, betweenness centrality, clustering coefficient centrality,
closeness centrality, and farness centrality, of various types of network (random network, smallworld
network, and real-world network). For each network, we compute those six centrality
measures, from which the correlation coefficient is determined. Our analysis suggests that the
degree centrality and the eigenvector centrality are highly correlated, regardless of the type of
network. Furthermore, the eigenvector centrality also highly correlates to betweenness on
random and real-world networks. However, it is inconsistent on small-world network, probably
owing to its power-law distribution. Finally, it is also revealed that eigenvector centrality is
distinct from clustering coefficient centrality, closeness centrality and farness centrality in all
tested occasions. The findings in this paper could lead us to further correlation analysis on
multiple centrality measures in the near future
International Journal of Engineering and Science Invention (IJESI)inventionjournals
Ā
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
ALTERNATIVES TO BETWEENNESS CENTRALITY: A MEASURE OF CORRELATION COEFFICIENTcsandit
Ā
In this paper, we measure and analyze the correlation of betweenness centrality (BWC) to five centrality measures, including eigenvector centrality (EVC), degree centrality DEG),
clustering coefficient centrality (CCC), farness centrality (FRC), and closeness centrality(CLC). We simulate the evolution of random networks and small-world networks to test the correlation between BWC and the five measures. Additionally, nine real-world networks are also involved in our present study to further examine the correlation. We find that DEG is
highly correlated to BWC on most cases and can serve as alternative to computationallyexpensive BWC. Moreover, EVC, CLC and FRC are also good candidates to replace BWC on
random networks. Although it is not a perfect correlation for all the real-world networks, there still exists a relatively good correlation between BWC and other three measures (CLC, FRC and EVC) on some networks. Our findings in this paper can help us understand how BWC correlates to other centrality measures and when to decide a good alternative to BWC
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Multiscale Granger Causality and Information Decomposition danielemarinazzo
Ā
Slides for the C3S workshop in Cologne, in which I presented an extension to multiple temporal scale of Granger causality and Partial Information Decomposition, using the robust state space formulation
A Spatial Domain Image Steganography Technique Based on Matrix Embedding and ...CSCJournals
Ā
This paper presents an algorithm in spatial domain which gives less distortion to the cover image during embedding process. Minimizing embedding impact and maximizing embedding capacity are the key factors of any steganography algorithm. Peak Signal to Noise Ratio (PSNR) is the familiar metric used in discriminating the distorted image (stego image) and cover image. Here matrix embedding technique is chosen to embed the secret image which is initially Huffman encoded. The Huffman encoded image is overlaid on the selected bits of all the channels of pixels of cover image through matrix embedding. As a result, the stego image is constructed with very less distortion when compared to the cover image ends up with higher PSNR value. A secret image which cannot be embedded in a normal LSB embedding technique can be overlaid in this proposed technique since the secret image is Huffman encoded. Experimental results for standard cover images, which obtained higher PSNR value during the operation is shown in this paper.
CORRELATION OF EIGENVECTOR CENTRALITY TO OTHER CENTRALITY MEASURES: RANDOM, S...csandit
Ā
In this paper, we thoroughly investigate correlations of eigenvector centrality to five centrality
measures, including degree centrality, betweenness centrality, clustering coefficient centrality,
closeness centrality, and farness centrality, of various types of network (random network, smallworld
network, and real-world network). For each network, we compute those six centrality
measures, from which the correlation coefficient is determined. Our analysis suggests that the
degree centrality and the eigenvector centrality are highly correlated, regardless of the type of
network. Furthermore, the eigenvector centrality also highly correlates to betweenness on
random and real-world networks. However, it is inconsistent on small-world network, probably
owing to its power-law distribution. Finally, it is also revealed that eigenvector centrality is
distinct from clustering coefficient centrality, closeness centrality and farness centrality in all
tested occasions. The findings in this paper could lead us to further correlation analysis on
multiple centrality measures in the near future
International Journal of Engineering and Science Invention (IJESI)inventionjournals
Ā
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
ALTERNATIVES TO BETWEENNESS CENTRALITY: A MEASURE OF CORRELATION COEFFICIENTcsandit
Ā
In this paper, we measure and analyze the correlation of betweenness centrality (BWC) to five centrality measures, including eigenvector centrality (EVC), degree centrality DEG),
clustering coefficient centrality (CCC), farness centrality (FRC), and closeness centrality(CLC). We simulate the evolution of random networks and small-world networks to test the correlation between BWC and the five measures. Additionally, nine real-world networks are also involved in our present study to further examine the correlation. We find that DEG is
highly correlated to BWC on most cases and can serve as alternative to computationallyexpensive BWC. Moreover, EVC, CLC and FRC are also good candidates to replace BWC on
random networks. Although it is not a perfect correlation for all the real-world networks, there still exists a relatively good correlation between BWC and other three measures (CLC, FRC and EVC) on some networks. Our findings in this paper can help us understand how BWC correlates to other centrality measures and when to decide a good alternative to BWC
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
An ideal steganographic scheme in networks using twisted payloadeSAT Journals
Ā
Abstract With the rapid development of network technology, information security has become a mounting problem. Steganography involves hiding information in a cover media, in such a way that the cover media is not supposed to have any confidential message for its unintentional addressee In this paper, an ideal steganographic scheme in networks is proposed using twisted payload. The confidential image values are twisted by using scrambling techiques.The Discrete Wavelet Transform (DWT) is applied on cover image and Integer Wavelet Transform (IWT) is applied to the scrambled confidential image. Merge operation is done on both images and Inverse DWT is computed on the same to get the stego image. The information hiding algorithm is the reverse process of the extracting algorithm. After this an ideal steganographic scheme is applied which generates a stego image which is immune against conventional attack and performs good perceptibility compared to other steganographic approaches. Index Terms: Network security, Steganography, Discrete Wavelet Transform, Integer Wavelet Transform, Modified Arnold Transform, Merge Operation, Quality Measures
A FLOATING POINT DIVISION UNIT BASED ON TAYLOR-SERIES EXPANSION ALGORITHM AND...csandit
Ā
Floating point division, even though being an infrequent operation in the traditional sense, is
indis-pensable when it comes to a range of non-traditional applications such as K-Means
Clustering and QR Decomposition just to name a few. In such applications, hardware support
for floating point division would boost the performance of the entire system. In this paper, we
present a novel architecture for a floating point division unit based on the Taylor-series
expansion algorithm. We show that the Iterative Logarithmic Multiplier is very well suited to be
used as a part of this architecture. We propose an implementation of the powering unit that can
calculate an odd power and an even power of a number simultaneously, meanwhile having little
hardware overhead when compared to the Iterative Logarithmic Multiplier.
Quantum persistent k cores for community detectionColleen Farrelly
Ā
PPT overview of paper accepted for 2019 Southeastern International Conference on Combinatorics, Graph Theory & Computing. Details a persistence approach to community detection and a new quantum persistence-based algorithm based on the coloring problem.
Master Thesis Presentation (Subselection of Topics)Alina Leidinger
Ā
This presentation shows some of my work carried out as part of my master thesis on "Mathematical Analysis of Neural Networks" at TUM Chair of Applied Numerical Analysis under Prof. Dr. Massimo Fornasier. The thesis constitutes a literature review with the aim of analysing and contrasting some of the approaches in the mathematical analysis of neural networks. The thesis focuses on 3 key aspects: Modern and classical approximation theory, robustness and stability of neural networks and unique identification of network weights. While the three themes carry approximately equal weight in the thesis, this presentation gives only a very short overview over the first and third chapter of my thesis and focuses on the robustness chapter. See also the full text version available on SlideShare/LinkedIn.
Presents a new type of statistical model developed by Quantopo, LLC, based on generalized linear modeling and Tweedie regression that leverages the power of quantum computing. Paper is being written and will be uploaded to arXiv while under review.
Data Hiding and Retrieval using Visual CryptographyAM Publications
Ā
Nath et al. developed several methods for hiding data in a cover file using different steganography
methods. In some methods Nath et al. first applied encryption method before hiding into the cover file. For security
reasons the secret message is encrypted first before inserting into the cover file. To make the system more complex the
authors used some random insertion of bits so that even if the intruders can extract the bits from cover file but they
cannot reconstruct the original secret message. In the present work the authors applied different data hiding
algorithm based on visual cryptography. Visual Cryptography is now a days a very popular method for hiding any
secret message inside multiple shares. Initially people were trying to hide some secret message which is simply B/W in
two shares. But slowly the researchers started to hide any color image (may be text or image or any object) in two or
more shares. In the present work the authors tried to hide any color message/image in two or more shares. The
interesting part of the present method is that from one share it impossible to create the second share or to extract the
hidden secret message from one share without having the other share(s). The present method may be used for
reconstructing password or any kind of important message or image. The present method may be applied in forensic
department or in defense for sending some confidential message
LOCATION BASED DETECTION OF REPLICATION ATTACKS AND COLLUDING ATTACKSEditor IJCATR
Ā
Wireless sensor networks gains its importance because of the critical applications in which it is involved like
industrial automation, healthcare applications, military and surveillance. Among security attacks in wireless sensor
networks we consider an active attack, NODE REPLICATION attack and COLLUDING attack. We use localized
algorithms, ((ie) replication detection is done at the node level and eliminated without the intervention of the base
station) to solve replication attacks and colluding attacks. Replication attacks are detected to using a unique key pair
and cryptographic hash function. We propose to use XED and EED algorithm[1] ( authenticates the node and tries to
reduce the replication) , with this using the Event detected location , non-beacon node is used to find the location of a
malicious node and by a simple threshold verification we identify malicious clusters
With the surge in modern research focus towards Pervasive Computing, lot of techniques and challenges
needs to be addressed so as to effectively create smart spaces and achieve miniaturization. In the process of
scaling down to compact devices, the real things to ponder upon are the Information Retrieval challenges.
In this work, we discuss the aspects of multimedia which makes information access challenging. An
Example Pattern Recognition scenario is presented and the mathematical techniques that can be used to
model uncertainty are also presented for developing a system that can sense, compute and communicate in
a way that can make human life easy with smart objects assisting from around his surroundings.
EVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKSijcsit
Ā
This paper introduces an evolutionary approach to enhance the process of finding central nodes in mobile networks. This can provide essential information and important applications in mobile and social networks. This evolutionary approach considers the dynamics of the network and takes into consideration the central nodes from previous time slots. We also study the applicability of maximal cliques algorithms in mobile social networks and how it can be used to find the central nodes based on the discovered maximal cliques. The experimental results are promising and show a significant enhancement in finding the central nodes.
An ideal steganographic scheme in networks using twisted payloadeSAT Journals
Ā
Abstract With the rapid development of network technology, information security has become a mounting problem. Steganography involves hiding information in a cover media, in such a way that the cover media is not supposed to have any confidential message for its unintentional addressee In this paper, an ideal steganographic scheme in networks is proposed using twisted payload. The confidential image values are twisted by using scrambling techiques.The Discrete Wavelet Transform (DWT) is applied on cover image and Integer Wavelet Transform (IWT) is applied to the scrambled confidential image. Merge operation is done on both images and Inverse DWT is computed on the same to get the stego image. The information hiding algorithm is the reverse process of the extracting algorithm. After this an ideal steganographic scheme is applied which generates a stego image which is immune against conventional attack and performs good perceptibility compared to other steganographic approaches. Index Terms: Network security, Steganography, Discrete Wavelet Transform, Integer Wavelet Transform, Modified Arnold Transform, Merge Operation, Quality Measures
A FLOATING POINT DIVISION UNIT BASED ON TAYLOR-SERIES EXPANSION ALGORITHM AND...csandit
Ā
Floating point division, even though being an infrequent operation in the traditional sense, is
indis-pensable when it comes to a range of non-traditional applications such as K-Means
Clustering and QR Decomposition just to name a few. In such applications, hardware support
for floating point division would boost the performance of the entire system. In this paper, we
present a novel architecture for a floating point division unit based on the Taylor-series
expansion algorithm. We show that the Iterative Logarithmic Multiplier is very well suited to be
used as a part of this architecture. We propose an implementation of the powering unit that can
calculate an odd power and an even power of a number simultaneously, meanwhile having little
hardware overhead when compared to the Iterative Logarithmic Multiplier.
Quantum persistent k cores for community detectionColleen Farrelly
Ā
PPT overview of paper accepted for 2019 Southeastern International Conference on Combinatorics, Graph Theory & Computing. Details a persistence approach to community detection and a new quantum persistence-based algorithm based on the coloring problem.
Master Thesis Presentation (Subselection of Topics)Alina Leidinger
Ā
This presentation shows some of my work carried out as part of my master thesis on "Mathematical Analysis of Neural Networks" at TUM Chair of Applied Numerical Analysis under Prof. Dr. Massimo Fornasier. The thesis constitutes a literature review with the aim of analysing and contrasting some of the approaches in the mathematical analysis of neural networks. The thesis focuses on 3 key aspects: Modern and classical approximation theory, robustness and stability of neural networks and unique identification of network weights. While the three themes carry approximately equal weight in the thesis, this presentation gives only a very short overview over the first and third chapter of my thesis and focuses on the robustness chapter. See also the full text version available on SlideShare/LinkedIn.
Presents a new type of statistical model developed by Quantopo, LLC, based on generalized linear modeling and Tweedie regression that leverages the power of quantum computing. Paper is being written and will be uploaded to arXiv while under review.
Data Hiding and Retrieval using Visual CryptographyAM Publications
Ā
Nath et al. developed several methods for hiding data in a cover file using different steganography
methods. In some methods Nath et al. first applied encryption method before hiding into the cover file. For security
reasons the secret message is encrypted first before inserting into the cover file. To make the system more complex the
authors used some random insertion of bits so that even if the intruders can extract the bits from cover file but they
cannot reconstruct the original secret message. In the present work the authors applied different data hiding
algorithm based on visual cryptography. Visual Cryptography is now a days a very popular method for hiding any
secret message inside multiple shares. Initially people were trying to hide some secret message which is simply B/W in
two shares. But slowly the researchers started to hide any color image (may be text or image or any object) in two or
more shares. In the present work the authors tried to hide any color message/image in two or more shares. The
interesting part of the present method is that from one share it impossible to create the second share or to extract the
hidden secret message from one share without having the other share(s). The present method may be used for
reconstructing password or any kind of important message or image. The present method may be applied in forensic
department or in defense for sending some confidential message
LOCATION BASED DETECTION OF REPLICATION ATTACKS AND COLLUDING ATTACKSEditor IJCATR
Ā
Wireless sensor networks gains its importance because of the critical applications in which it is involved like
industrial automation, healthcare applications, military and surveillance. Among security attacks in wireless sensor
networks we consider an active attack, NODE REPLICATION attack and COLLUDING attack. We use localized
algorithms, ((ie) replication detection is done at the node level and eliminated without the intervention of the base
station) to solve replication attacks and colluding attacks. Replication attacks are detected to using a unique key pair
and cryptographic hash function. We propose to use XED and EED algorithm[1] ( authenticates the node and tries to
reduce the replication) , with this using the Event detected location , non-beacon node is used to find the location of a
malicious node and by a simple threshold verification we identify malicious clusters
With the surge in modern research focus towards Pervasive Computing, lot of techniques and challenges
needs to be addressed so as to effectively create smart spaces and achieve miniaturization. In the process of
scaling down to compact devices, the real things to ponder upon are the Information Retrieval challenges.
In this work, we discuss the aspects of multimedia which makes information access challenging. An
Example Pattern Recognition scenario is presented and the mathematical techniques that can be used to
model uncertainty are also presented for developing a system that can sense, compute and communicate in
a way that can make human life easy with smart objects assisting from around his surroundings.
EVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKSijcsit
Ā
This paper introduces an evolutionary approach to enhance the process of finding central nodes in mobile networks. This can provide essential information and important applications in mobile and social networks. This evolutionary approach considers the dynamics of the network and takes into consideration the central nodes from previous time slots. We also study the applicability of maximal cliques algorithms in mobile social networks and how it can be used to find the central nodes based on the discovered maximal cliques. The experimental results are promising and show a significant enhancement in finding the central nodes.
The dynamics of networks enables the function of a variety of systems we rely on every day, from gene regulation and metabolism in the cell to the distribution of electric power and communication of information. Understanding, steering and predicting the function of interacting nonlinear dynamical systems, in particular if they are externally driven out of equilibrium, relies on obtaining and evaluating suitable models, posing at least two major challenges. First, how can we extract key structural system features of networks if only time series data provide information about the dynamics of (some) units? Second, how can we characterize nonlinear responses of nonlinear multi-dimensional systems externally driven by fluctuations, and consequently, predict tipping points at which normal operational states may be lost? Here we report recent progress on nonlinear response theory extended to predict tipping points and on model-free inference of network structural features from observed dynamics.
NEURAL NETWORK FOR THE RELIABILITY ANALYSIS OF A SERIES - PARALLEL SYSTEM SUB...IAEME Publication
Ā
Artificial neural networks can achieve high computation rates by employing a massive number of simple processing elements with a high degree of connectivity between the elements. Neural networks with feedback connections provide a computing model capable of exploiting fine- grained parallelism to solve a rich class of complex problems. In this paper we discuss a complex series-parallel system subjected to finite common cause and finite human error failures and its reliability using neural network method.
NICARAā¢ is a novel, unique and cost-effective solution for everyone working with brain data, who wishes to gain a deeper insight into the world of Connectomics.
X-TREPAN: A MULTI CLASS REGRESSION AND ADAPTED EXTRACTION OF COMPREHENSIBLE D...cscpconf
Ā
In this work, the TREPAN algorithm is enhanced and extended for extracting decision trees from neural networks. We empirically evaluated the performance of the algorithm on a set of databases from real world events. This benchmark enhancement was achieved by adapting Single-test TREPAN and C4.5 decision tree induction algorithms to analyze the datasets. The models are then compared with X-TREPAN for comprehensibility and classification accuracy. Furthermore, we validate the experimentations by applying statistical methods. Finally, the modified algorithm is extended to work with multi-class regression problems and the ability to comprehend generalized feed forward networks is achieved.
X-TREPAN : A Multi Class Regression and Adapted Extraction of Comprehensible ...csandit
Ā
In this work, the TREPAN algorithm is enhanced and extended for extracting decision trees
from neural networks. We empirically evaluated the performance of the algorithm on a set of
databases from real world events. This benchmark enhancement was achieved by adapting
Single-test TREPAN and C4.5 decision tree induction algorithms to analyze the datasets. The
models are then compared with X-TREPAN for comprehensibility and classification accuracy.
Furthermore, we validate the experimentations by applying statistical methods. Finally, the
modified algorithm is extended to work with multi-class regression problems and the ability to
comprehend generalized feed forward networks is achieved.
Wavelet-based EEG processing for computer-aided seizure detection and epileps...IJERA Editor
Ā
Many Neurological disorders are very difficult to detect. One such Neurological disorder which we are going to discuss in this paper is Epilepsy. Epilepsy means sudden change in the behavior of a human being for a short period of time. This is caused due to seizures in the brain. Many researches are going onto detect epilepsy detection through analyzing EEG. One such method of epilepsy detection is proposed in this paper. This technique employs Discrete Wave Transform (DWT) method for pre-processing, Approximate Entropy (ApEn) to extract features and Artificial Neural Network (ANN) for classification. This paper presented a detailed survey of various methods that are being used for epilepsy detection and also proposes a wavelet based epilepsy detection method
Application of Hybrid Genetic Algorithm Using Artificial Neural Network in Da...IOSRjournaljce
Ā
The main purpose of data mining is to extract knowledge from large amount of data. Artificial Neural network (ANN) has already been applied in a variety of domains with remarkable success. This paper presents the application of hybrid model for stroke disease that integrates Genetic algorithm and back propagation algorithm. Selecting a good subset of features, without sacrificing accuracy, is of great importance for neural networks to be successfully applied to the area. In addition the hybrid model that leads to further improvised categorization, accuracy compared to the result produced by genetic algorithm alone. In this study, a new hybrid model of Neural Networks and Genetic Algorithm (GA) to initialize and optimize the connection weights of ANN so as to improve the performance of the ANN and the same has been applied in a medical problem of predicting stroke disease for verification of the results.
Since volcanic activity was first discovered on Io from Voyager images in 1979, changes
on Ioās surface have been monitored from both spacecraft and ground-based telescopes.
Here, we present the highest spatial resolution images of Io ever obtained from a groundbased telescope. These images, acquired by the SHARK-VIS instrument on the Large
Binocular Telescope, show evidence of a major resurfacing event on Ioās trailing hemisphere. When compared to the most recent spacecraft images, the SHARK-VIS images
show that a plume deposit from a powerful eruption at Pillan Patera has covered part
of the long-lived Pele plume deposit. Although this type of resurfacing event may be common on Io, few have been detected due to the rarity of spacecraft visits and the previously low spatial resolution available from Earth-based telescopes. The SHARK-VIS instrument ushers in a new era of high resolution imaging of Ioās surface using adaptive
optics at visible wavelengths.
We characterize the earliest galaxy population in the JADES Origins Field (JOF), the deepest
imaging field observed with JWST. We make use of the ancillary Hubble optical images (5 filters
spanning 0.4ā0.9Āµm) and novel JWST images with 14 filters spanning 0.8ā5Āµm, including 7 mediumband filters, and reaching total exposure times of up to 46 hours per filter. We combine all our data
at > 2.3Āµm to construct an ultradeep image, reaching as deep as ā 31.4 AB mag in the stack and
30.3-31.0 AB mag (5Ļ, r = 0.1ā circular aperture) in individual filters. We measure photometric
redshifts and use robust selection criteria to identify a sample of eight galaxy candidates at redshifts
z = 11.5 ā 15. These objects show compact half-light radii of R1/2 ā¼ 50 ā 200pc, stellar masses of
Mā ā¼ 107ā108Mā, and star-formation rates of SFR ā¼ 0.1ā1 Mā yrā1
. Our search finds no candidates
at 15 < z < 20, placing upper limits at these redshifts. We develop a forward modeling approach to
infer the properties of the evolving luminosity function without binning in redshift or luminosity that
marginalizes over the photometric redshift uncertainty of our candidate galaxies and incorporates the
impact of non-detections. We find a z = 12 luminosity function in good agreement with prior results,
and that the luminosity function normalization and UV luminosity density decline by a factor of ā¼ 2.5
from z = 12 to z = 14. We discuss the possible implications of our results in the context of theoretical
models for evolution of the dark matter halo mass function.
Slide 1: Title Slide
Extrachromosomal Inheritance
Slide 2: Introduction to Extrachromosomal Inheritance
Definition: Extrachromosomal inheritance refers to the transmission of genetic material that is not found within the nucleus.
Key Components: Involves genes located in mitochondria, chloroplasts, and plasmids.
Slide 3: Mitochondrial Inheritance
Mitochondria: Organelles responsible for energy production.
Mitochondrial DNA (mtDNA): Circular DNA molecule found in mitochondria.
Inheritance Pattern: Maternally inherited, meaning it is passed from mothers to all their offspring.
Diseases: Examples include Leberās hereditary optic neuropathy (LHON) and mitochondrial myopathy.
Slide 4: Chloroplast Inheritance
Chloroplasts: Organelles responsible for photosynthesis in plants.
Chloroplast DNA (cpDNA): Circular DNA molecule found in chloroplasts.
Inheritance Pattern: Often maternally inherited in most plants, but can vary in some species.
Examples: Variegation in plants, where leaf color patterns are determined by chloroplast DNA.
Slide 5: Plasmid Inheritance
Plasmids: Small, circular DNA molecules found in bacteria and some eukaryotes.
Features: Can carry antibiotic resistance genes and can be transferred between cells through processes like conjugation.
Significance: Important in biotechnology for gene cloning and genetic engineering.
Slide 6: Mechanisms of Extrachromosomal Inheritance
Non-Mendelian Patterns: Do not follow Mendelās laws of inheritance.
Cytoplasmic Segregation: During cell division, organelles like mitochondria and chloroplasts are randomly distributed to daughter cells.
Heteroplasmy: Presence of more than one type of organellar genome within a cell, leading to variation in expression.
Slide 7: Examples of Extrachromosomal Inheritance
Four Oāclock Plant (Mirabilis jalapa): Shows variegated leaves due to different cpDNA in leaf cells.
Petite Mutants in Yeast: Result from mutations in mitochondrial DNA affecting respiration.
Slide 8: Importance of Extrachromosomal Inheritance
Evolution: Provides insight into the evolution of eukaryotic cells.
Medicine: Understanding mitochondrial inheritance helps in diagnosing and treating mitochondrial diseases.
Agriculture: Chloroplast inheritance can be used in plant breeding and genetic modification.
Slide 9: Recent Research and Advances
Gene Editing: Techniques like CRISPR-Cas9 are being used to edit mitochondrial and chloroplast DNA.
Therapies: Development of mitochondrial replacement therapy (MRT) for preventing mitochondrial diseases.
Slide 10: Conclusion
Summary: Extrachromosomal inheritance involves the transmission of genetic material outside the nucleus and plays a crucial role in genetics, medicine, and biotechnology.
Future Directions: Continued research and technological advancements hold promise for new treatments and applications.
Slide 11: Questions and Discussion
Invite Audience: Open the floor for any questions or further discussion on the topic.
Richard's entangled aventures in wonderlandRichard Gill
Ā
Since the loophole-free Bell experiments of 2020 and the Nobel prizes in physics of 2022, critics of Bell's work have retreated to the fortress of super-determinism. Now, super-determinism is a derogatory word - it just means "determinism". Palmer, Hance and Hossenfelder argue that quantum mechanics and determinism are not incompatible, using a sophisticated mathematical construction based on a subtle thinning of allowed states and measurements in quantum mechanics, such that what is left appears to make Bell's argument fail, without altering the empirical predictions of quantum mechanics. I think however that it is a smoke screen, and the slogan "lost in math" comes to my mind. I will discuss some other recent disproofs of Bell's theorem using the language of causality based on causal graphs. Causal thinking is also central to law and justice. I will mention surprising connections to my work on serial killer nurse cases, in particular the Dutch case of Lucia de Berk and the current UK case of Lucy Letby.
The increased availability of biomedical data, particularly in the public domain, offers the opportunity to better understand human health and to develop effective therapeutics for a wide range of unmet medical needs. However, data scientists remain stymied by the fact that data remain hard to find and to productively reuse because data and their metadata i) are wholly inaccessible, ii) are in non-standard or incompatible representations, iii) do not conform to community standards, and iv) have unclear or highly restricted terms and conditions that preclude legitimate reuse. These limitations require a rethink on data can be made machine and AI-ready - the key motivation behind the FAIR Guiding Principles. Concurrently, while recent efforts have explored the use of deep learning to fuse disparate data into predictive models for a wide range of biomedical applications, these models often fail even when the correct answer is already known, and fail to explain individual predictions in terms that data scientists can appreciate. These limitations suggest that new methods to produce practical artificial intelligence are still needed.
In this talk, I will discuss our work in (1) building an integrative knowledge infrastructure to prepare FAIR and "AI-ready" data and services along with (2) neurosymbolic AI methods to improve the quality of predictions and to generate plausible explanations. Attention is given to standards, platforms, and methods to wrangle knowledge into simple, but effective semantic and latent representations, and to make these available into standards-compliant and discoverable interfaces that can be used in model building, validation, and explanation. Our work, and those of others in the field, creates a baseline for building trustworthy and easy to deploy AI models in biomedicine.
Bio
Dr. Michel Dumontier is the Distinguished Professor of Data Science at Maastricht University, founder and executive director of the Institute of Data Science, and co-founder of the FAIR (Findable, Accessible, Interoperable and Reusable) data principles. His research explores socio-technological approaches for responsible discovery science, which includes collaborative multi-modal knowledge graphs, privacy-preserving distributed data mining, and AI methods for drug discovery and personalized medicine. His work is supported through the Dutch National Research Agenda, the Netherlands Organisation for Scientific Research, Horizon Europe, the European Open Science Cloud, the US National Institutes of Health, and a Marie-Curie Innovative Training Network. He is the editor-in-chief for the journal Data Science and is internationally recognized for his contributions in bioinformatics, biomedical informatics, and semantic technologies including ontologies and linked data.
Seminar of U.V. Spectroscopy by SAMIR PANDASAMIR PANDA
Ā
Spectroscopy is a branch of science dealing the study of interaction of electromagnetic radiation with matter.
Ultraviolet-visible spectroscopy refers to absorption spectroscopy or reflect spectroscopy in the UV-VIS spectral region.Ā
Ā Ultraviolet-visible spectroscopy is an analytical method that can measure the amount of light received by the analyte.
Introduction:
RNA interference (RNAi) or Post-Transcriptional Gene Silencing (PTGS) is an important biological process for modulating eukaryotic gene expression.
It is highly conserved process of posttranscriptional gene silencing by which double stranded RNA (dsRNA) causes sequence-specific degradation of mRNA sequences.
dsRNA-induced gene silencing (RNAi) is reported in a wide range of eukaryotes ranging from worms, insects, mammals and plants.
This process mediates resistance to both endogenous parasitic and exogenous pathogenic nucleic acids, and regulates the expression of protein-coding genes.
What are small ncRNAs?
micro RNA (miRNA)
short interfering RNA (siRNA)
Properties of small non-coding RNA:
Involved in silencing mRNA transcripts.
Called āsmallā because they are usually only about 21-24 nucleotides long.
Synthesized by first cutting up longer precursor sequences (like the 61nt one that Lee discovered).
Silence an mRNA by base pairing with some sequence on the mRNA.
Discovery of siRNA?
The first small RNA:
In 1993 Rosalind Lee (Victor Ambros lab) was studying a non- coding gene in C. elegans, lin-4, that was involved in silencing of another gene, lin-14, at the appropriate time in the
development of the worm C. elegans.
Two small transcripts of lin-4 (22nt and 61nt) were found to be complementary to a sequence in the 3' UTR of lin-14.
Because lin-4 encoded no protein, she deduced that it must be these transcripts that are causing the silencing by RNA-RNA interactions.
Types of RNAi ( non coding RNA)
MiRNA
Length (23-25 nt)
Trans acting
Binds with target MRNA in mismatch
Translation inhibition
Si RNA
Length 21 nt.
Cis acting
Bind with target Mrna in perfect complementary sequence
Piwi-RNA
Length ; 25 to 36 nt.
Expressed in Germ Cells
Regulates trnasposomes activity
MECHANISM OF RNAI:
First the double-stranded RNA teams up with a protein complex named Dicer, which cuts the long RNA into short pieces.
Then another protein complex called RISC (RNA-induced silencing complex) discards one of the two RNA strands.
The RISC-docked, single-stranded RNA then pairs with the homologous mRNA and destroys it.
THE RISC COMPLEX:
RISC is large(>500kD) RNA multi- protein Binding complex which triggers MRNA degradation in response to MRNA
Unwinding of double stranded Si RNA by ATP independent Helicase
Active component of RISC is Ago proteins( ENDONUCLEASE) which cleave target MRNA.
DICER: endonuclease (RNase Family III)
Argonaute: Central Component of the RNA-Induced Silencing Complex (RISC)
One strand of the dsRNA produced by Dicer is retained in the RISC complex in association with Argonaute
ARGONAUTE PROTEIN :
1.PAZ(PIWI/Argonaute/ Zwille)- Recognition of target MRNA
2.PIWI (p-element induced wimpy Testis)- breaks Phosphodiester bond of mRNA.)RNAse H activity.
MiRNA:
The Double-stranded RNAs are naturally produced in eukaryotic cells during development, and they have a key role in regulating gene expression .
Lateral Ventricles.pdf very easy good diagrams comprehensive
Ā
Model-based and model-free connectivity methods for electrical neuroimaging
1. Directed dynamical connectivity in electrical
neuroimaging: which tools should I use?
A very partial and personal overview, in good faith but still
Daniele Marinazzo
Department of Data Analysis, Faculty of Psychology and Educational Sciences,
Ghent University, Belgium
@dan marinazzo
http://users.ugent.be/~dmarinaz/
Daniele Marinazzo Directed connectivity in electrical neuroimaging
2. At least two distinct ways one can think of causality
Temporal precedence, i.e. causes precede their consequences
Physical inļ¬uence (control), i.e. changing causes changes their
consequences
Daniele Marinazzo Directed connectivity in electrical neuroimaging
3. At least two distinct ways one can think of causality
Temporal precedence, i.e. causes precede their consequences
Physical inļ¬uence (control), i.e. changing causes changes their
consequences
Daniele Marinazzo Directed connectivity in electrical neuroimaging
4. Two classes of methods
Assume independent measurements at each node
Inference of networks from temporally correlated data (dynam-
ical networks)
Daniele Marinazzo Directed connectivity in electrical neuroimaging
5. Using temporal dynamics
We model a dynamical system at each node
Two main approaches:
Dynamic Bayesian networks (Hidden Markov Models)
Model-free and model-based investigation of temporal correla-
tion
Daniele Marinazzo Directed connectivity in electrical neuroimaging
6. What to expect from ācausalityā measures in neuroscience
Causal measures in neuroscience should reļ¬ect eļ¬ective con-
nectivity, i.e. the underlying physiological inļ¬uences exerted
among neuronal populations in diļ¬erent brain areas. ā Dy-
namic Causal Models
Daniele Marinazzo Directed connectivity in electrical neuroimaging
7. What to expect from ācausalityā measures in neuroscience
Causal measures in neuroscience should reļ¬ect eļ¬ective con-
nectivity, i.e. the underlying physiological inļ¬uences exerted
among neuronal populations in diļ¬erent brain areas. ā Dy-
namic Causal Models
Diļ¬erent but complementary goal: to reļ¬ect directed dynam-
ical connectivity without requiring that the resulting networks
recapitulate the underlying physiological processes. ā Granger
Causality, Transfer Entropy
Daniele Marinazzo Directed connectivity in electrical neuroimaging
8. What to expect from ācausalityā measures in neuroscience
Causal measures in neuroscience should reļ¬ect eļ¬ective con-
nectivity, i.e. the underlying physiological inļ¬uences exerted
among neuronal populations in diļ¬erent brain areas. ā Dy-
namic Causal Models
Diļ¬erent but complementary goal: to reļ¬ect directed dynam-
ical connectivity without requiring that the resulting networks
recapitulate the underlying physiological processes. ā Granger
Causality, Transfer Entropy
The same underlying (physical) network structure can give rise
to multiple distinct dynamical connectivity patterns
In practice it is always unfeasible to measure all relevant vari-
ables
Bressler and Seth 2010
Daniele Marinazzo Directed connectivity in electrical neuroimaging
9. Basic idea of Dynamic Causal Models
We have several neural populations ..
Daniele Marinazzo Directed connectivity in electrical neuroimaging
10. Basic idea of Dynamic Causal Models
.. with interactions among and within them
Daniele Marinazzo Directed connectivity in electrical neuroimaging
11. Basic idea of Dynamic Causal Models
What we see and what we donāt
Daniele Marinazzo Directed connectivity in electrical neuroimaging
12. Basic idea of Dynamic Causal Models
Forward model
Daniele Marinazzo Directed connectivity in electrical neuroimaging
13. Basic idea of Dynamic Causal Models
Bayesian framework
Daniele Marinazzo Directed connectivity in electrical neuroimaging
14. Basic idea of Dynamic Causal Models
Bayesian framework
Daniele Marinazzo Directed connectivity in electrical neuroimaging
15. Basic idea of Dynamic Causal Models
Model inference
Prior: what connections are included in the model
Likelihood: Incorporates the generative model and prediction
errors
Model evidence: Quantiļ¬es the goodness of a model (i.e.,
accuracy minus complexity). Used to draw inference on model
structure.
Posterior: Probability density function of the parameters given
the data and model. Used to draw inference on model param-
eters.
Daniele Marinazzo Directed connectivity in electrical neuroimaging
16. Basic idea of Dynamic Causal Models
Inference on model structure
Which model (or family of models) has highest evidence?
Daniele Marinazzo Directed connectivity in electrical neuroimaging
17. Basic idea of Dynamic Causal Models
Inference on model structure
Which model (or family of models) has highest evidence?
Inference on model parameters
Which parameters are statistically signiļ¬cant, and what is their
size/sign?
Daniele Marinazzo Directed connectivity in electrical neuroimaging
18. Inference on model structure
A necessary step, unless strong prior knowledge about structure
Bayesian model comparison (BMS) compares the (log) model
evidence of diļ¬erent models (i.e., probability of the data given
model)
log model evidence is approximated by free energy
Daniele Marinazzo Directed connectivity in electrical neuroimaging
19. Inference on model structure
A necessary step, unless strong prior knowledge about structure
Bayesian model comparison (BMS) compares the (log) model
evidence of diļ¬erent models (i.e., probability of the data given
model)
log model evidence is approximated by free energy
The Kullback - Leibler divergence between the real and approx-
imate conditional density minus the log-evidence
Daniele Marinazzo Directed connectivity in electrical neuroimaging
20. Inference on model structure
A necessary step, unless strong prior knowledge about structure
Bayesian model comparison (BMS) compares the (log) model
evidence of diļ¬erent models (i.e., probability of the data given
model)
log model evidence is approximated by free energy
The Kullback - Leibler divergence between the real and approx-
imate conditional density minus the log-evidence
A Bayesian Expectation Maximization
Daniele Marinazzo Directed connectivity in electrical neuroimaging
21. Inference on model structure
A necessary step, unless strong prior knowledge about structure
Bayesian model comparison (BMS) compares the (log) model
evidence of diļ¬erent models (i.e., probability of the data given
model)
log model evidence is approximated by free energy
The Kullback - Leibler divergence between the real and approx-
imate conditional density minus the log-evidence
A Bayesian Expectation Maximization
ok, a model ļ¬t
Daniele Marinazzo Directed connectivity in electrical neuroimaging
22. Inference on model parameters
Often a second step in DCM studies
Inference on the parameters of the clear winning model (if there
is one)
If no clear winning model (or if optimal model structure diļ¬ers
between groups) then Bayesian model averaging (BMA) is
an option
Final parameters are weighted average of individual model pa-
rameters and posterior probabilities
Daniele Marinazzo Directed connectivity in electrical neuroimaging
23. Group level inference
Diļ¬erent DCMs are ļ¬tted to the data for every subject.
Group inference on the models (or groups of models: in DCM
terminology families of models e.g. all models with input to
region A vs. input to region B, or vs. both, three families):
Bayesian model selection
Winning model/family is the one with highest exceedance prob-
ability
Group inference on model parameter: Either on the winning
model or Bayesian model averaging (BMA) across models (within
a winning family or all models when BMS reveal no clear win-
ner)
(BMA) Parameter(s) of interest are harvested for every subject
and subjected to frequentist inference (e.g. t-test)
Daniele Marinazzo Directed connectivity in electrical neuroimaging
24. DCM for ERPs/ERFs
Bottom-up: connection from low to high hierarchical areas
top-down: connection from high to low hierarchical areas (Felle-
man 1991)
Lateral: same level in hierarchical organization (e.g. interhemi-
spheric connection)
Prior on connection: forward ā backward ā lateral
Layers within regions interact via intrinsic connections
Daniele Marinazzo Directed connectivity in electrical neuroimaging
27. Inļ¬uences in multivariate datasets
We must condition the measure to the eļ¬ect of other variables
Daniele Marinazzo Directed connectivity in electrical neuroimaging
28. Inļ¬uences in multivariate datasets
We must condition the measure to the eļ¬ect of other variables
The most straightforward solution is the conditioned approach,
starting from Geweke et al 1984
Daniele Marinazzo Directed connectivity in electrical neuroimaging
29. Beyond conditioning: joint information
Daniele Marinazzo Directed connectivity in electrical neuroimaging
30. Transfer entropy and Markov property
Absence of causality: generalized Markov property
p(x|X, Y ) = p(x|X)
Transfer Entropy
Transfer entropy (Schreiber 2000) quantiļ¬es the violation of the
generalized Markov property
T(Y ā X) = p(x|X, Y ) log
p(x|X, Y )
p(x|X)
dx dX dY
T measures the information ļ¬owing from one series to the other.
Daniele Marinazzo Directed connectivity in electrical neuroimaging
31. Transfer entropy and regression
Risk functional
The minimizer of the risk functional
R [f ] = dX dx (x ā f (X))2
p(X, x)
represents the best estimate of x given X, and corresponds to the
regression function
f ā
(X) = dxp(x|X) x
Daniele Marinazzo Directed connectivity in electrical neuroimaging
32. Transfer entropy and regression
Markov property for uncorrelated variables
The best estimate of x, given X and Y is now:
gā
(X, Y ) = dxp(x|X, Y ) x
p(x|X, Y ) = p(x|X) ā f ā
(X) = gā
(X, Y )
and the knowledge of Y does not improve the prediction of x
Daniele Marinazzo Directed connectivity in electrical neuroimaging
33. Transfer entropy and regression
Transfer entropy (entropy rate)
SX = ā dx dX p(x, X) log[p(x|X)]
SXY = ā dx dX dY p(x, X, Y ) log[p(x|X, Y )]
Regression
EX = dx dX p(x, X) (x ā dx p(x |X) x )2
EX,Y = dx dX dY p(x, X, Y ) (x ā dx p(x |X, Y ) x )2
Daniele Marinazzo Directed connectivity in electrical neuroimaging
34. Granger causality and Transfer entropy
GC and TE are equivalent for Gaussian variables and other
quasi-Gaussian distributions
(Barnett et al 2009, Hlavackova-Schindler 2011, Barnett and
Bossomaier 2012)
In this case they both measure information transfer.
Daniele Marinazzo Directed connectivity in electrical neuroimaging
35. Granger causality and Transfer entropy
GC and TE are equivalent for Gaussian variables and other
quasi-Gaussian distributions
(Barnett et al 2009, Hlavackova-Schindler 2011, Barnett and
Bossomaier 2012)
In this case they both measure information transfer.
Uniļ¬ed approach (model based and model free)
Mathematically more treatable
Allows grouping variables according to their predictive content
(Faes et al. 2014)
Daniele Marinazzo Directed connectivity in electrical neuroimaging
37. Joint information
Letās go for an operative and practical deļ¬nition
Daniele Marinazzo Directed connectivity in electrical neuroimaging
38. Joint information
Letās go for an operative and practical deļ¬nition
Relation (B and C) ā A
synergy: (B and C) contributes to A with more information
than the sum of its variables
redundancy: (B and C) contributes to A with less information
than the sum of its variables
Stramaglia et al. 2012, 2014, 2016
Daniele Marinazzo Directed connectivity in electrical neuroimaging
39. Generalization of GC for sets of driving variables
Conditioned Granger Causality in a multivariate system
Ī“X(B ā Ī±) = log
(xĪ±|X B)
(xĪ±|X)
Daniele Marinazzo Directed connectivity in electrical neuroimaging
40. Generalization of GC for sets of driving variables
Conditioned Granger Causality in a multivariate system
Ī“X(B ā Ī±) = log
(xĪ±|X B)
(xĪ±|X)
Unnormalized version
Ī“u
X(B ā Ī±) = (xĪ±|X B) ā (xĪ±|X)
Daniele Marinazzo Directed connectivity in electrical neuroimaging
41. Generalization of GC for sets of driving variables
Conditioned Granger Causality in a multivariate system
Ī“X(B ā Ī±) = log
(xĪ±|X B)
(xĪ±|X)
Unnormalized version
Ī“u
X(B ā Ī±) = (xĪ±|X B) ā (xĪ±|X)
An interesting property
If {XĪ²}Ī²āB are statistically independent and their contributions in
the model for xĪ± are additive, then Ī“u
X(B ā Ī±) =
Ī²āB
Ī“u
X(Ī² ā Ī±).
This property does not hold for the standard deļ¬nition of GC, neither
for entropy-rooted quantities, because logarithm.
Daniele Marinazzo Directed connectivity in electrical neuroimaging
42. Question from the audience:
What does it ever mean to have an unnormalized measure of
Granger causality?
Donāt you lose any link with information?
Daniele Marinazzo Directed connectivity in electrical neuroimaging
43. Question from the audience:
What does it ever mean to have an unnormalized measure of
Granger causality?
Donāt you lose any link with information?
Daniele Marinazzo Directed connectivity in electrical neuroimaging
44. Deļ¬ne synergy and redundancy in this framework
Synergy
Ī“u
X(B ā Ī±) >
Ī²āB Ī“u
XB,Ī²(Ī² ā Ī±)
Daniele Marinazzo Directed connectivity in electrical neuroimaging
45. Deļ¬ne synergy and redundancy in this framework
Synergy
Ī“u
X(B ā Ī±) >
Ī²āB Ī“u
XB,Ī²(Ī² ā Ī±)
Redundancy
Ī“u
X(B ā Ī±) <
Ī²āB Ī“u
XB,Ī²(Ī² ā Ī±)
Daniele Marinazzo Directed connectivity in electrical neuroimaging
47. Do it yourself!
Statistical Parametric Mapping - DCM http://www.fil.ion.
ucl.ac.uk/spm/
MVGC (State-Space robust implementation) http://users.
sussex.ac.uk/~lionelb/MVGC/
BSmart (Time-varying, Brain-oriented) http://www.brain-smart.
org/
MuTE (Multivariate Transfer Entropy, GC in the covariance
case) http://mutetoolbox.guru/
emVAR (Frequency Domain) http://www.lucafaes.net/emvar.
html
ITS (Information Dynamics) http://www.lucafaes.net/its.
html
Daniele Marinazzo Directed connectivity in electrical neuroimaging
48. Thanks
Hannes Almgren, Ale Montalto and Frederik van de Steen (UGent)
Sebastiano Stramaglia (Bari)
Pedro Valdes Sosa (CNeuro and UESTC)
Laura Astolļ¬ and Thomas Koenig
Daniele Marinazzo Directed connectivity in electrical neuroimaging
49. References
David et al., 2006: Dynamical causal modelling of evoked reponses in EEG and MEG (NI)
Stephan et al., 2010: Ten simple rules for dynamic causal modeling (NI)
Penny et al., 2004: Comparing Dynamic causal models (NI)
Litvak et al., 2008: EEG and MEG Data Analysis in SPM8 (CIN)
Bressler and Seth, 2010: Wiener-Granger causality, a well-established methodology (NI)
Montalto et al., 2014: MuTE: A MATLAB Toolbox to Compare Established and Novel Estimators of the
Multivariate Transfer Entropy (PLOS One)
Bastos and Schoļ¬elen, 2016: A Tutorial Review of Functional Connectivity Analysis Methods and Their
Interpretational Pitfalls (Front N Sys)
Stramaglia et el. 2106: Synergetic and Redundant Information Flow Detected by Unnormalized Granger
Causality (IEEE TBME)
Daniele Marinazzo Directed connectivity in electrical neuroimaging