310,765 research outputs found
EEG Resting-State Brain Topological Reorganization as a Function of Age
Resting state connectivity has been increasingly studied to investigate the effects of aging on the brain. A reduced organization
in the communication between brain areas was demonstrated b
y combining a variety of different imaging technologies (fMRI,
EEG, and MEG) and graph theory. In this paper, we propose a methodology to get new insights into resting state connectivity and
its variations with age, by combining advanced techniques of effective connectivity estimation, graph theoretical approach, and
classification by SVM method. We analyzed high density EEG signal
srecordedatrestfrom71healthysubjects(age:20–63years).
Weighted and directed connectivity was computed by means of Partial Directed Coherence based on a General Linear Kalman filter
approach. To keep the information collected by the estimator, weighted and directed graph indices were extracted from the resulting
networks. A relation between brain network properties and age of the subject was found, indicating a tendency of the network to
randomly organize increasing with age. This result is also confirmed dividing the whole population into two subgroups according
to the age (young and middle-aged adults): significant differences exist in terms of network organization measures. Classification
of the subjects by means of such indices returns an accuracy greater than 80
Benchmarks for Parity Games (extended version)
We propose a benchmark suite for parity games that includes all benchmarks
that have been used in the literature, and make it available online. We give an
overview of the parity games, including a description of how they have been
generated. We also describe structural properties of parity games, and using
these properties we show that our benchmarks are representative. With this work
we provide a starting point for further experimentation with parity games.Comment: The corresponding tool and benchmarks are available from
https://github.com/jkeiren/paritygame-generator. This is an extended version
of the paper that has been accepted for FSEN 201
On the algorithmic complexity of twelve covering and independence parameters of graphs
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to covering and independence, each of which has been studied previously in some form. Here we survey briefly results concerning total coverings and total matchings of graphs, and consider the aforementioned 12 covering and independence parameters with regard to algorithmic complexity. We survey briefly known results for several graph classes, and obtain new NP-completeness results for the minimum total cover and maximum minimal total cover problems in planar graphs, the minimum maximal total matching problem in bipartite and chordal graphs, and the minimum independent dominating set problem in planar cubic graphs
A graph-based mathematical morphology reader
This survey paper aims at providing a "literary" anthology of mathematical
morphology on graphs. It describes in the English language many ideas stemming
from a large number of different papers, hence providing a unified view of an
active and diverse field of research
- …