中枢神経系疾患の治療は正常細胞（ニューロン）の機能維持を目的とするが，脳血管障害のように機能障害の原因が細胞の死滅に基づくことは多い．一方，脳腫瘍の治療においては薬物療法や放射線療法といった腫瘍細胞の死滅を目標とするものが大きな位置を占める．いずれの場合にも，細胞死の機序を理解することは各種病態や治療法の理解のうえで重要である．現在のところ最も研究の進んでいる細胞死の型はアポトーシスである．そのなかで重要な位置を占めるミトコンドリアにおける反応および抗アポトーシス因子について概要を紹介する．

Neuroscience 細胞死：最近の知見

Monthly Notices is one of the three largest general primary astronomical research publications. It is an international journal, published by the Royal Astronomical Society. This article 1 describes its publication policy and practice.

Monthly Notices of the Royal Astronomical Society

where A represents the magnetic vector potential, is an integral of the hydromagnetic equations. This -integral made it possible to formulate a variational principle for the force-free magnetic fields. The integral expresses the fact that motions cannot transform a given field in an entirely arbitrary different field, if the conductivity of the medium isconsidered infinite. In this paper we shall show that the full set of hydromagnetic equations admit five more integrals, besides the energy integral, if dissipative processes are absent. These integrals, as we shall presently verify, are I2 =fbHvdV, (2)

Proceedings of the National Academy of Sciences

This article reviews the state-of-the-art in overlapping community detection algorithms, quality measures, and benchmarks. A thorough comparison of different algorithms (a total of fourteen) is provided. In addition to community-level evaluation, we propose a framework for evaluating algorithms' ability to detect overlapping nodes, which helps to assess overdetection and underdetection. After considering community-level detection performance measured by normalized mutual information, the Omega index, and node-level detection performance measured by F-score, we reached the following conclusions. For low overlapping density networks, SLPA, OSLOM, Game, and COPRA offer better performance than the other tested algorithms. For networks with high overlapping density and high overlapping diversity, both SLPA and Game provide relatively stable performance. However, test results also suggest that the detection in such networks is still not yet fully resolved. A common feature observed by various algorithms in real-world networks is the relatively small fraction of overlapping nodes (typically less than 30p), each of which belongs to only 2 or 3 communities.

Overlapping community detection in networks: The state-of-the-art and comparative study

Summary

Animal social networks are descriptions of social structure which, aside from their intrinsic interest for understanding sociality, can have significant bearing across many fields of biology.


Network analysis provides a flexible toolbox for testing a broad range of hypotheses, and for describing the social system of species or populations in a quantitative and comparable manner. However, it requires careful consideration of underlying assumptions, in particular differentiating real from observed networks and controlling for inherent biases that are common in social data.


We provide a practical guide for using this framework to analyse animal social systems and test hypotheses. First, we discuss key considerations when defining nodes and edges, and when designing methods for collecting data. We discuss different approaches for inferring social networks from these data and displaying them. We then provide an overview of methods for quantifying properties of nodes and networks, as well as for testing hypotheses concerning network structure and network processes. Finally, we provide information about assessing the power and accuracy of an observed network.


Alongside this manuscript, we provide appendices containing background information on common programming routines and worked examples of how to perform network analysis using the r programming language.


We conclude by discussing some of the major current challenges in social network analysis and interesting future directions. In particular, we highlight the under-exploited potential of experimental manipulations on social networks to address research questions.

/pdf/constructing-conducting-and-interpreting-animal-social-4aooyxxhf3.pdf

Constructing, conducting and interpreting animal social network analysis

Identifying overlapping communities in networks is a challenging task. In this work we present a probabilistic approach to community detection that utilizes a Bayesian non-negative matrix factorization model to extract overlapping modules from a network. The scheme has the advantage of soft-partitioning solutions, assignment of node participation scores to modules, and an intuitive foundation. We present the performance of the method against a variety of benchmark problems and compare and contrast it to several other algorithms for community detection.

https://www.robots.ox.ac.uk/~sjrob/Pubs/PRE_NMF_finalProof.pdf

Overlapping community detection using Bayesian non-negative matrix factorization

The increasing miniaturisation of animal-tracking technology has made it possible to gather exceptionally detailed machine-sensed data on the social dynamics of almost entire populations of individuals, in both terrestrial and aquatic study systems. Here, we review important issues concerning the collection of such data, and their processing and analysis, to identify the most promising approaches in the emerging field of 'reality mining'. Automated technologies can provide data sensing at time intervals small enough to close the gap between social patterns and their underlying processes, providing insights into how social structures arise and change dynamically over different timescales. Especially in conjunction with experimental manipulations, reality mining promises significant advances in basic and applied research on animal social systems.

/pdf/reality-mining-of-animal-social-systems-295lzahruh.pdf

Reality mining of animal social systems.

We propose a methodology for extracting social network structure from spatio-temporal datasets that describe timestamped occurrences of individuals. Our approach identifies temporal regions of dense agent activity and links are drawn between individuals based on their co-occurrences across these ‘gathering events’. The statistical significance of these connections is then tested against an appropriate null model. Such a framework allows us to exploit the wealth of analytical and computational tools of network analysis in settings where the underlying connectivity pattern between interacting agents (commonly termed the adjacency matrix) is not given a priori. We perform experiments on two large-scale datasets (greater than 106 points) of great tit Parus major wild bird foraging records and illustrate the use of this approach by examining the temporal dynamics of pairing behaviour, a process that was previously very hard to observe. We show that established pair bonds are maintained continuously, whereas new pair bonds form at variable times before breeding, but are characterized by a rapid development of network proximity. The method proposed here is general, and can be applied to any system with information about the temporal co-occurrence of interacting agents.

/pdf/inferring-social-network-structure-in-ecological-systems-4kd6imho7c.pdf

Inferring social network structure in ecological systems from spatio-temporal data streams.

Classifier combination methods need to make best use of the outputs of multiple, imperfect classifiers to enable higher accuracy classifications. In many situations, such as when human decisions need to be combined, the base decisions can vary enormously in reliability. A Bayesian approach to such uncertain combination allows us to infer the differences in performance between individuals and to incorporate any available prior knowledge about their abilities when training data is sparse. In this chapter we explore Bayesian classifier combination, using the computationally efficient framework of variational Bayesian inference. We apply the approach to real data from a large citizen science project, Galaxy Zoo Supernovae, and show that our method far outperforms other established approaches to imperfect decision combination.We go on to analyse the putative community structure of the decision makers, based on their inferred decision making strategies, and show that natural groupings are formed. Finally we present a dynamic Bayesian classifier combination approach and investigate the changes in base classifier performance over time.

/pdf/dynamic-bayesian-combination-of-multiple-imperfect-42ys1u5hho.pdf

Dynamic Bayesian Combination of Multiple Imperfect Classifiers

In this paper, we investigate the sparsity and recognition capabilities of two approximate Bayesian classification algorithms, the multiclass multi-kernel relevance vector machines (mRVMs) that have been recently proposed. We provide an insight into the behavior of the mRVM models by performing a wide experimentation on a large range of real-world datasets. Furthermore, we monitor various model fitting characteristics that identify the predictive nature of the proposed methods and compare against existing classification techniques. By introducing novel convergence measures, sample selection strategies and model improvements, it is demonstrated that mRVMs can produce state-of-the-art results on multiclass discrimination problems. In addition, this is achieved by utilizing only a very small fraction of the available observation data.

Ioannis Psorakis

Papers

Overlapping community detection using Bayesian non-negative matrix factorization

Reality mining of animal social systems.

Inferring social network structure in ecological systems from spatio-temporal data streams.

Dynamic Bayesian Combination of Multiple Imperfect Classifiers

Multiclass Relevance Vector Machines: Sparsity and Accuracy