Search

Creativity is a complex, multi-faceted concept encompassing a variety of related aspects, abilities, properties and behaviours. If we wish to study creativity scientifically, then a tractable and well-articulated model of creativity is required. Such a model would be of great value to researchers investigating the nature of creativity and in particular, those concerned with the evaluation of creative practice. This paper describes a unique approach to developing a suitable model of how creative behaviour emerges that is based on the words people use to describe the concept. Using techniques from the field of statistical natural language processing, we identify a collection of fourteen key components of creativity through an analysis of a corpus of academic papers on the topic. Words are identified which appear significantly often in connection with discussions of the concept. Using a measure of lexical similarity to help cluster these words, a number of distinct themes emerge, which collectively contribute to a comprehensive and multi-perspective model of creativity. The components provide an ontology of creativity: a set of building blocks which can be used to model creative practice in a variety of domains. The components have been employed in two case studies to evaluate the creativity of computational systems and have proven useful in articulating achievements of this work and directions for further research. [ABSTRACT FROM AUTHOR]

Wang et al. proposed a method for obtaining elliptic curves with embedding degree 1 for securing critical infrastructures, and presented several elliptic curves generated by their method with torsion points of 160 bits and 189 bits orders. They also presented some experimental results and claimed that their implementation of an elliptic curve generated with their method is faster than an implementation for embedded devices presented by Bertoni et al. In this paper, we point out that the security and efficiency claims given by Wang et al. are flawed. Specifically, we show that it is possible to solve finite field discrete logarithm problems defined over their elliptic curves in practice. On the elliptic curves with torsion points of 160 bits orders generated by Wang et al., their instances of finite field discrete logarithm problems are solved in around 4 hours by using a standard desktop PC. On the torsion points of 189 bits orders, their instances are solved in around 10 days by using two standard desktop PCs. The hardness of the finite field discrete logarithm problems is one of the most important bases of security; therefore, their elliptic curves should not be used for cryptographic purposes. [ABSTRACT FROM AUTHOR]

In this paper we investigate the changes in the functional connectivity intensity, and some related properties, in healthy people, across the life span and at resting state. For the explicit computation of the functional connectivity we exploit a recently proposed model, that bases not only on the correlations data provided by the acquisition equipment, but also on different parameters, such as the anatomical distances between nodes and their degrees. The leading purpose of the paper is to show that the proposed approach is able to recover the main aspects of resting state condition known from the available literature, as well as to suggest new insights, perspectives and speculations from a neurobiological point of view. Our study involves 133 subjects, both males and females of different ages, with no evidence of neurological diseases or systemic disorders. First, we show how the model applies to the sample, where the subjects are grouped into 28 different groups (14 of males and 14 of females), according to their age. This leads to the construction of two graphs (one for males and one for females), that can be realistically interpreted as representative of the neural network during the resting state. Second, following the idea that the brain network is better understood by focusing on specific nodes having a kind of centrality, we refine the two output graphs by introducing a new metric that favours the selection of nodes having higher degrees. As a third step, we extensively comment and discuss the obtained results. In particular, it is remarkable that, despite a great overlapping exists between the outcomes concerning males and females, some intriguing differences appear. This motivates a deeper local investigation, which represents the fourth part of the paper, carried out through a thorough statistical analysis. As a result, we are enabled to support that, for two special age groups, a few links contribute in differentiating the behaviour of males and females. In addition, we performed an average-based comparison between the proposed model and the traditional statistical correlation-based approach, then discussing and commenting the main outlined discrepancies. [ABSTRACT FROM AUTHOR]

Two critical tasks in multi-criteria group decision making (MCGDM) are to describe criterion values and to aggregate the described information to generate a ranking of alternatives. A flexible and superior tool for the first task is q-rung orthopair fuzzy number (qROFN) and an effective tool for the second task is aggregation operator. So far, nearly thirty different aggregation operators of qROFNs have been presented. Each operator has its distinctive characteristics and can work well for specific purpose. However, there is not yet an operator which can provide desirable generality and flexibility in aggregating criterion values, dealing with the heterogeneous interrelationships among criteria, and reducing the influence of extreme criterion values. To provide such an aggregation operator, Muirhead mean operator, power average operator, partitioned average operator, and Archimedean T-norm and T-conorm operations are concurrently introduced into q-rung orthopair fuzzy sets, and an Archimedean power partitioned Muirhead mean operator of qROFNs and its weighted form are presented and a MCGDM method based on the weighted operator is proposed in this paper. The generalised expressions of the two operators are firstly defined. Their properties are explored and proved and their specific expressions are constructed. On the basis of the specific expressions, a method for solving the MCGDM problems based on qROFNs is then designed. Finally, the feasibility and effectiveness of the method is demonstrated via a numerical example, a set of experiments, and qualitative and quantitative comparisons. [ABSTRACT FROM AUTHOR]

In this paper, the synchronization problem for a class of discrete-time complex-valued neural networks with time-varying delays is investigated. Compared with the previous work, the time delay and parameters are assumed to be time-varying. By separating the real part and imaginary part, the discrete-time model of complex-valued neural networks is derived. Moreover, by using the complex-valued Lyapunov-Krasovskii functional method and linear matrix inequality as tools, sufficient conditions of the synchronization stability are obtained. In numerical simulation, examples are presented to show the effectiveness of our method. [ABSTRACT FROM AUTHOR]

This paper considers the DCSK system under jamming environment. We consider both fast and slow switching pulse jamming (PJ). We derive approximations of the system bit error rates (BERs) in analytic expressions containing only well-known special functions, from which we show that for both jamming cases increasing the spreading factor can enhance the BER. In addition, we reveal that under the fast switching PJ, the BER does not depend on the jamming duty cycle ρ when ρ ≤ 0.5, however when ρ > 0.5, increasing its value degrades the BER. Moreover, we find out that under the slow switching PJ, increasing ρ may either enhance or degrade the BER. [ABSTRACT FROM AUTHOR]

In this paper, a unique and more distinctive encryption algorithm is proposed. This is based on the complexity of highly nonlinear S box in Flesnelet domain. The nonlinear pattern is transformed further to enhance the confusion in the dummy data using Fresnelet technique. The security level of the encrypted image boosts using the algebra of Galois field in Fresnelet domain. At first level, the Fresnelet transform is used to propagate the given information with desired wavelength at specified distance. It decomposes given secret data into four complex subbands. These complex sub-bands are separated into two components of real subband data and imaginary subband data. At second level, the net subband data, produced at the first level, is deteriorated to non-linear diffused pattern using the unique S-box defined on the Galois field . In the diffusion process, the permuted image is substituted via dynamic algebraic S-box substitution. We prove through various analysis techniques that the proposed scheme enhances the cipher security level, extensively. [ABSTRACT FROM AUTHOR]

Code-based cryptography is one of few alternatives supposed to be secure in a post-quantum world. Meanwhile, identity-based identification and signature (IBI/IBS) schemes are two of the most fundamental cryptographic primitives, so several code-based IBI/IBS schemes have been proposed. However, with increasingly profound researches on coding theory, the security reduction and efficiency of such schemes have been invalidated and challenged. In this paper, we construct provably secure IBI/IBS schemes from code assumptions against impersonation under active and concurrent attacks through a provably secure code-based signature technique proposed by Preetha, Vasant and Rangan (PVR signature), and a security enhancement Or-proof technique. We also present the parallel-PVR technique to decrease parameter values while maintaining the standard security level. Compared to other code-based IBI/IBS schemes, our schemes achieve not only preferable public parameter size, private key size, communication cost and signature length due to better parameter choices, but also provably secure. [ABSTRACT FROM AUTHOR]

Muirhead mean (MM) is a well-known aggregation operator which can consider interrelationships among any number of arguments assigned by a variable vector. Besides, it is a universal operator since it can contain other general operators by assigning some special parameter values. However, the MM can only process the crisp numbers. Inspired by the MM’ advantages, the aim of this paper is to extend MM to process the intuitionistic fuzzy numbers (IFNs) and then to solve the multi-attribute group decision making (MAGDM) problems. Firstly, we develop some intuitionistic fuzzy Muirhead mean (IFMM) operators by extending MM to intuitionistic fuzzy information. Then, we prove some properties and discuss some special cases with respect to the parameter vector. Moreover, we present two new methods to deal with MAGDM problems with the intuitionistic fuzzy information based on the proposed MM operators. Finally, we verify the validity and reliability of our methods by using an application example, and analyze the advantages of our methods by comparing with other existing methods. [ABSTRACT FROM AUTHOR]

In a general (k, n) scalable secret image sharing (SSIS) scheme, the secret image is shared by n participants and any k or more than k participants have the ability to reconstruct it. The scalability means that the amount of information in the reconstructed image scales in proportion to the number of the participants. In most existing SSIS schemes, the size of each image shadow is relatively large and the dealer does not has a flexible control strategy to adjust it to meet the demand of differen applications. Besides, almost all existing SSIS schemes are not applicable under noise circumstances. To address these deficiencies, in this paper we present a novel SSIS scheme based on a brand-new technique, called compressed sensing, which has been widely used in many fields such as image processing, wireless communication and medical imaging. Our scheme has the property of flexibility, which means that the dealer can achieve a compromise between the size of each shadow and the quality of the reconstructed image. In addition, our scheme has many other advantages, including smooth scalability, noise-resilient capability, and high security. The experimental results and the comparison with similar works demonstrate the feasibility and superiority of our scheme. [ABSTRACT FROM AUTHOR]

Data analysis and model-data comparisons in the environmental sciences require diagnostic measures that quantify time series dynamics and structure, and are robust to noise in observational data. This paper investigates the temporal dynamics of environmental time series using measures quantifying their information content and complexity. The measures are used to classify natural processes on one hand, and to compare models with observations on the other. The present analysis focuses on the global carbon cycle as an area of research in which model-data integration and comparisons are key to improving our understanding of natural phenomena. We investigate the dynamics of observed and simulated time series of Gross Primary Productivity (GPP), a key variable in terrestrial ecosystems that quantifies ecosystem carbon uptake. However, the dynamics, patterns and magnitudes of GPP time series, both observed and simulated, vary substantially on different temporal and spatial scales. We demonstrate here that information content and complexity, or Information Theory Quantifiers (ITQ) for short, serve as robust and efficient data-analytical and model benchmarking tools for evaluating the temporal structure and dynamical properties of simulated or observed time series at various spatial scales. At continental scale, we compare GPP time series simulated with two models and an observations-based product. This analysis reveals qualitative differences between model evaluation based on ITQ compared to traditional model performance metrics, indicating that good model performance in terms of absolute or relative error does not imply that the dynamics of the observations is captured well. Furthermore, we show, using an ensemble of site-scale measurements obtained from the FLUXNET archive in the Mediterranean, that model-data or model-model mismatches as indicated by ITQ can be attributed to and interpreted as differences in the temporal structure of the respective ecological time series. At global scale, our understanding of C fluxes relies on the use of consistently applied land models. Here, we use ITQ to evaluate model structure: The measures are largely insensitive to climatic scenarios, land use and atmospheric gas concentrations used to drive them, but clearly separate the structure of 13 different land models taken from the CMIP5 archive and an observations-based product. In conclusion, diagnostic measures of this kind provide data-analytical tools that distinguish different types of natural processes based solely on their dynamics, and are thus highly suitable for environmental science applications such as model structural diagnostics. [ABSTRACT FROM AUTHOR]

Identifying causal relations from time series is the first step to understanding the behavior of complex systems. Although many methods have been proposed, few papers have applied multiple methods together to detect causal relations based on time series generated from coupled nonlinear systems with some unobserved parts. Here we propose the combined use of three methods and a majority vote to infer causality under such circumstances. Two of these methods are proposed here for the first time, and all of the three methods can be applied even if the underlying dynamics is nonlinear and there are hidden common causes. We test our methods with coupled logistic maps, coupled Rössler models, and coupled Lorenz models. In addition, we show from ice core data how the causal relations among the temperature, the CH4 level, and the CO2 level in the atmosphere changed in the last 800,000 years, a conclusion also supported by irregularly sampled data analysis. Moreover, these methods show how three regions of the brain interact with each other during the visually cued, two-choice arm reaching task. Especially, we demonstrate that this is due to bottom up influences at the beginning of the task, while there exist mutual influences between the posterior medial prefrontal cortex and the presupplementary motor area. Based on our results, we conclude that identifying causality with an appropriate ensemble of multiple methods ensures the validity of the obtained results more firmly. [ABSTRACT FROM AUTHOR]

Graphlets are small subgraphs, usually containing up to five vertices, that can be found in a larger graph. Identification of the graphlets that a vertex in an explored graph touches can provide useful information about the local structure of the graph around that vertex. Actually finding all graphlets in a large graph can be time-consuming, however. As the graphlets grow in size, more different graphlets emerge and the time needed to find each graphlet also scales up. If it is not needed to find each instance of each graphlet, but knowing the number of graphlets touching each node of the graph suffices, the problem is less hard. Previous research shows a way to simplify counting the graphlets: instead of looking for the graphlets needed, smaller graphlets are searched, as well as the number of common neighbors of vertices. Solving a system of equations then gives the number of times a vertex is part of each graphlet of the desired size. However, until now, equations only exist to count graphlets with 4 or 5 nodes. In this paper, two new techniques are presented. The first allows to generate the equations needed in an automatic way. This eliminates the tedious work needed to do so manually each time an extra node is added to the graphlets. The technique is independent on the number of nodes in the graphlets and can thus be used to count larger graphlets than previously possible. The second technique gives all graphlets a unique ordering which is easily extended to name graphlets of any size. Both techniques were used to generate equations to count graphlets with 4, 5 and 6 vertices, which extends all previous results. Code can be found at and . [ABSTRACT FROM AUTHOR]

This paper presents a high payload watermarking scheme for High Efficiency Video Coding (HEVC). HEVC is an emerging video compression standard that provides better compression performance as compared to its predecessor, i.e. H.264/AVC. Considering that HEVC may will be used in a variety of applications in the future, the proposed algorithm has a high potential of utilization in applications involving broadcast and hiding of metadata. The watermark is embedded into the Quantized Transform Coefficients (QTCs) during the encoding process. Later, during the decoding process, the embedded message can be detected and extracted completely. The experimental results show that the proposed algorithm does not significantly affect the video quality, nor does it escalate the bitrate. [ABSTRACT FROM AUTHOR]

This paper proposes a statistical generalized species-area model (GSAM) to represent various patterns of species-area relationship (SAR), which is one of the fundamental patterns in ecology. The approach enables the generalization of many preliminary models, as power-curve model, which is commonly used to mathematically describe the SAR. The GSAM is applied to simulated data set of species diversity in areas of different sizes and a real-world data of insects of Hymenoptera order has been modeled. We show that the GSAM enables the identification of the best statistical model and estimates the number of species according to the area. [ABSTRACT FROM AUTHOR]

The evolutionary history of certain species such as polyploids are modeled by a generalization of phylogenetic trees called multi-labeled phylogenetic trees, or MUL trees for short. One problem that relates to inferring a MUL tree is how to construct the smallest possible MUL tree that is consistent with a given set of rooted triplets, or SMRT problem for short. This problem is NP-hard. There is one algorithm for the SMRT problem which is exact and runs in time, where is the number of taxa. In this paper, we show that the SMRT does not seem to be an appropriate solution from the biological point of view. Indeed, we present a heuristic algorithm named MTRT for this problem and execute it on some real and simulated datasets. The results of MTRT show that triplets alone cannot provide enough information to infer the true MUL tree. So, it is inappropriate to infer a MUL tree using triplet information alone and considering the minimum number of duplications. Finally, we introduce some new problems which are more suitable from the biological point of view. [ABSTRACT FROM AUTHOR]

In biological systems, the dynamic analysis method has gained increasing attention in the past decade. The Boolean network is the most common model of a genetic regulatory network. The interactions of activation and inhibition in the genetic regulatory network are modeled as a set of functions of the Boolean network, while the state transitions in the Boolean network reflect the dynamic property of a genetic regulatory network. A difficult problem for state transition analysis is the finding of attractors. In this paper, we modeled the genetic regulatory network as a Boolean network and proposed a solving algorithm to tackle the attractor finding problem. In the proposed algorithm, we partitioned the Boolean network into several blocks consisting of the strongly connected components according to their gradients, and defined the connection between blocks as decision node. Based on the solutions calculated on the decision nodes and using a satisfiability solving algorithm, we identified the attractors in the state transition graph of each block. The proposed algorithm is benchmarked on a variety of genetic regulatory networks. Compared with existing algorithms, it achieved similar performance on small test cases, and outperformed it on larger and more complex ones, which happens to be the trend of the modern genetic regulatory network. Furthermore, while the existing satisfiability-based algorithms cannot be parallelized due to their inherent algorithm design, the proposed algorithm exhibits a good scalability on parallel computing architectures. [ABSTRACT FROM AUTHOR]

In this note we present a robust bootstrap test with good Type I error control for testing the general hypothesis H0: ρ = ρ0. In order to carry out this test we use what is termed a surrogate bootstrap distribution. The test was inspired by the studentized permutation for testing H0: ρ = 0, which was proven to be exact in certain scenarios and asymptotically correct overall. We show that the bootstrap based test is robust to a variety of distributional scenarios in terms of proper Type I error control. [ABSTRACT FROM AUTHOR]

China's rapid urbanization and high traffic accident frequency have received many researchers’ attention. It is important to reveal how urban infrastructures and other risk factors affects the traffic accident frequency. A growing amount of research has examined the local risk factors impact on traffic accident frequency at certain time. Some studies considered these spatial influences but overlooked the temporal correlation/heterogeneity of traffic accidents and related risk factors. This study explores risk factors’ influence on urban traffic accidents frequency while considering both the spatial and temporal correlation/heterogeneity of traffic accidents. The study area is split into 100 equally sized rectangle traffic analysis zones (TAZs), and the urban traffic accident frequency and attributes in each TAZ are extracted. The linear regression model, spatial lag model (SLM), spatial error model (SEM) and time-fixed effects error model (T-FEEM) are established and compared respectively. The proposed methodologies are illustrated using ten-month traffic accident data from the urban area of Guiyang City, China. The results reveal that the time-fixed effects error model, which considers both spatial and temporal correlation/heterogeneity of traffic accidents, is superior to other models. More traffic accidents will happen in those TAZs that have more hospitals or schools. Moreover, hospitals have a greater influence on traffic accidents than schools. Because of the location in the margin of the city, those TAZs that have passenger stations have more traffic accidents. This study provides policy makers with more detailed characterization about the impact of related risk factors on traffic accident frequencies, and it is suggested that not only the spatial correlation/heterogeneity but also the temporal correlation/heterogeneity should be taken into account in guiding traffic accident control of urban area. [ABSTRACT FROM AUTHOR]

We have identified nine highly connected and differentially expressed gene subnetworks between aggressive primary tumors and metastatic lesions in endometrial carcinomas. We implemented a novel pipeline combining gene set and network approaches, which here allows integration of protein-protein interactions and gene expression data. The resulting subnetworks are significantly associated with disease progression across tumor stages from complex atypical hyperplasia, primary tumors to metastatic lesions. The nine subnetworks include genes related to metastasizing features such as epithelial-mesenchymal transition (EMT), hypoxia and cell proliferation. TCF4 and TWIST2 were found as central genes in the subnetwork related to EMT. Two of the identified subnetworks display statistically significant association to patient survival, which were further supported by an independent validation in the data from The Cancer Genome Atlas data collection. The first subnetwork contains genes related to cell proliferation and cell cycle, while the second contains genes involved in hypoxia such as HIF1A and EGLN3. Our findings provide a promising context to elucidate the biological mechanisms of metastasis, suggest potential prognostic markers and further identify therapeutic targets. The pipeline R source code is freely available, including permutation tests to assess statistical significance of the identified subnetworks. [ABSTRACT FROM AUTHOR]

Comparing the functional performance of biological systems often requires comparing multiple mechanical properties. Such analyses, however, are commonly presented using orthogonal plots that compare N ≤ 3 properties. Here, we develop a multidimensional visualization strategy using permutated radar charts (radial, multi-axis plots) to compare the relative performance distributions of mechanical systems on a single graphic across N ≥ 3 properties. Leveraging the fact that radar charts plot data in the form of closed polygonal profiles, we use shape descriptors for quantitative comparisons. We identify mechanical property-function correlations distinctive to rigid, flexible, and damage-tolerant biological materials in the form of structural ties, beams, shells, and foams. We also show that the microstructures of dentin, bone, tendon, skin, and cartilage dictate their tensile performance, exhibiting a trade-off between stiffness and extensibility. Lastly, we compare the feeding versus singing performance of Darwin’s finches to demonstrate the potential of radar charts for multidimensional comparisons beyond mechanics of materials. [ABSTRACT FROM AUTHOR]

Team formation, which aims to form a team to complete a given task by covering its required skills, furnishes a natural way to help organizers complete projects effectively. In this work, we propose a new team hiring problem. Given a set of projects with required skills, and a pool of experts , each of which has his own skillset, compensation demand and participation constraint (i.e., the maximum number of projects the expert can participate in simultaneously), we seek to hire a team of participation-constrained experts to complete all the projects so that the overall compensation is minimized. We refer to this as the participation constrained team hire problem. To the best of our knowledge, this is the first work to investigate the problem. We also study a special case of the problem, where the number of projects is within the participation constraint of each expert and design an exact algorithm for it. Since participation constrained team hire problem is proven to be NP-hard, we design three novel efficient approximate algorithms as its solution, each of which focuses on a particular perspective of the problem. We perform extensive experimental studies, on both synthetic and real datasets, to evaluate the performance of our algorithms. Experimental results show that our exact algorithm far surpasses the brute-force solutions and works well in practice. Besides, the three algorithms behave differently when distinct facets of the problem are involved. [ABSTRACT FROM AUTHOR]

This article finds feasible solutions to the travelling salesman problem, obtaining the route with the shortest distance to visit n cities just once, returning to the starting city. The problem addressed is clustering the cities, then using the NEH heuristic, which provides an initial solution that is refined using a modification of the metaheuristic Multi-Restart Iterated Local Search MRSILS; finally, clusters are joined to end the route with the minimum distance to the travelling salesman problem. The contribution of this research is the use of the metaheuristic MRSILS, that in our knowledge had not been used to solve the travelling salesman problem using clusters. The main objective of this article is to demonstrate that the proposed algorithm is more efficient than Genetic Algorithms when clusters are used. To demonstrate the above, both algorithms are compared with some cases taken from the literature, also a comparison with the best-known results is done. In addition, statistical studies are made in the same conditions to demonstrate this fact. Our method obtains better results in all the 10 cases compared. [ABSTRACT FROM AUTHOR]

Sustainability is a key concept in economic and policy debates. Nevertheless, it is usually treated only in a qualitative way and has eluded quantitative analysis. Here, we propose a sustainability index based on the premise that sustainable systems do not lose or gain Fisher Information over time. We test this approach using time series data from the AmeriFlux network that measures ecosystem respiration, water and energy fluxes in order to elucidate two key sustainability features: ecosystem health and stability. A novel definition of ecosystem health is developed based on the concept of criticality, which implies that if a system’s fluctuations are scale invariant then the system is in a balance between robustness and adaptability. We define ecosystem stability by taking an information theory approach that measures its entropy and Fisher information. Analysis of the Ameriflux consortium big data set of ecosystem respiration time series is contrasted with land condition data. In general we find a good agreement between the sustainability index and land condition data. However, we acknowledge that the results are a preliminary test of the approach and further verification will require a multi-signal analysis. For example, high values of the sustainability index for some croplands are counter-intuitive and we interpret these results as ecosystems maintained in artificial health due to continuous human-induced inflows of matter and energy in the form of soil nutrients and control of competition, pests and disease. [ABSTRACT FROM AUTHOR]

Identification of risk factors of treatment resistance may be useful to guide treatment selection, avoid inefficient trial-and-error, and improve major depressive disorder (MDD) care. We extended the work in predictive modeling of treatment resistant depression (TRD) via partition of the data from the Sequenced Treatment Alternatives to Relieve Depression (STAR*D) cohort into a training and a testing dataset. We also included data from a small yet completely independent cohort RIS-INT-93 as an external test dataset. We used features from enrollment and level 1 treatment (up to week 2 response only) of STAR*D to explore the feature space comprehensively and applied machine learning methods to model TRD outcome at level 2. For TRD defined using QIDS-C16 remission criteria, multiple machine learning models were internally cross-validated in the STAR*D training dataset and externally validated in both the STAR*D testing dataset and RIS-INT-93 independent dataset with an area under the receiver operating characteristic curve (AUC) of 0.70–0.78 and 0.72–0.77, respectively. The upper bound for the AUC achievable with the full set of features could be as high as 0.78 in the STAR*D testing dataset. Model developed using top 30 features identified using feature selection technique (k-means clustering followed by χ2 test) achieved an AUC of 0.77 in the STAR*D testing dataset. In addition, the model developed using overlapping features between STAR*D and RIS-INT-93, achieved an AUC of > 0.70 in both the STAR*D testing and RIS-INT-93 datasets. Among all the features explored in STAR*D and RIS-INT-93 datasets, the most important feature was early or initial treatment response or symptom severity at week 2. These results indicate that prediction of TRD prior to undergoing a second round of antidepressant treatment could be feasible even in the absence of biomarker data. [ABSTRACT FROM AUTHOR]

We propose a novel method to test the existence of community structure in undirected, real-valued, edge-weighted graphs. The method is based on the asymptotic behavior of extreme eigenvalues of a real symmetric edge-weight matrix. We provide a theoretical foundation for this method and report on its performance using synthetic and real data, suggesting that this new method outperforms other state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Linguistic neutrosophic numbers (LNNs) can easily describe the incomplete and indeterminate information by the truth, indeterminacy, and falsity linguistic variables (LVs), and the Hamy mean (HM) operator is a good tool to deal with multiple attribute group decision making (MAGDM) problems because it can capture the interrelationship among the multi-input arguments. Motivated by these ideas, we develop linguistic neutrosophic HM (LNHM) operator and weighted linguistic neutrosophic HM (WLNHM) operator. Some desirable properties and special cases of two operators are discussed in detail. Furthermore, considering the situation in which the decision makers (DMs) can’t give the suitable weight of each attribute directly from various reasons, we propose the concept of entropy for linguistic neutrosophic set (LNS) to obtain the attribute weight vector objectively, and then the method for MAGDM problems with LNNs is proposed, and some examples are used to illustrate the effectiveness and superiority of the proposed method by comparing with the existing methods. [ABSTRACT FROM AUTHOR]

Since anatomic MRI is presently not able to directly discern neuronal loss in Parkinson’s Disease (PD), studying the associated functional connectivity (FC) changes seems a promising approach toward developing non-invasive and non-radioactive neuroimaging markers for this disease. While several groups have reported such FC changes in PD, there are also significant discrepancies between studies. Investigating the reproducibility of PD-related FC changes on independent datasets is therefore of crucial importance. We acquired resting-state fMRI scans for 43 subjects (27 patients and 16 normal controls, with 2 replicate scans per subject) and compared the observed FC changes with those obtained in two independent datasets, one made available by the PPMI consortium (91 patients, 18 controls) and a second one by the group of Tao Wu (20 patients, 20 controls). Unfortunately, PD-related functional connectivity changes turned out to be non-reproducible across datasets. This could be due to disease heterogeneity, but also to technical differences. To distinguish between the two, we devised a method to directly check for disease heterogeneity using random splits of a single dataset. Since we still observe non-reproducibility in a large fraction of random splits of the same dataset, we conclude that functional heterogeneity may be a dominating factor behind the lack of reproducibility of FC alterations in different rs-fMRI studies of PD. While global PD-related functional connectivity changes were non-reproducible across datasets, we identified a few individual brain region pairs with marginally consistent FC changes across all three datasets. However, training classifiers on each one of the three datasets to discriminate PD scans from controls produced only low accuracies on the remaining two test datasets. Moreover, classifiers trained and tested on random splits of the same dataset (which are technically homogeneous) also had low test accuracies, directly substantiating disease heterogeneity. [ABSTRACT FROM AUTHOR]

A new trend in medicine is the use of algorithms to analyze big datasets, e.g. using everything your phone measures about you for diagnostics or monitoring. However, these algorithms are commonly compared against weak baselines, which may contribute to excessive optimism. To assess how well an algorithm works, scientists typically ask how well its output correlates with medically assigned scores. Here we perform a meta-analysis to quantify how the literature evaluates their algorithms for monitoring mental wellbeing. We find that the bulk of the literature (∼77%) uses meaningless comparisons that ignore patient baseline state. For example, having an algorithm that uses phone data to diagnose mood disorders would be useful. However, it is possible to explain over 80% of the variance of some mood measures in the population by simply guessing that each patient has their own average mood—the patient-specific baseline. Thus, an algorithm that just predicts that our mood is like it usually is can explain the majority of variance, but is, obviously, entirely useless. Comparing to the wrong (population) baseline has a massive effect on the perceived quality of algorithms and produces baseless optimism in the field. To solve this problem we propose “user lift” that reduces these systematic errors in the evaluation of personalized medical monitoring. [ABSTRACT FROM AUTHOR]

Homophily, the tendency of individuals to associate with others who share similar traits, has been identified as a major driving force in the formation and evolution of social ties. In many cases, it is not clear if homophily is the result of a socialization process, where individuals change their traits according to the dominance of that trait in their local social networks, or if it results from a selection process, in which individuals reshape their social networks so that their traits match those in the new environment. Here we demonstrate the detailed temporal formation of strong homophily in academic achievements of high school and university students. We analyze a unique dataset that contains information about the detailed time evolution of a friendship network of 6,000 students across 42 months. Combining the evolving social network data with the time series of the academic performance (GPA) of individual students, we show that academic homophily is a result of selection: students prefer to gradually reorganize their social networks according to their performance levels, rather than adapting their performance to the level of their local group. We find no signs for a pull effect, where a social environment of good performers motivates bad students to improve their performance. We are able to understand the underlying dynamics of grades and networks with a simple model. The lack of a social pull effect in classical educational settings could have important implications for the understanding of the observed persistence of segregation, inequality and social immobility in societies. [ABSTRACT FROM AUTHOR]

Background: We have analysed large data sets consisting of tens of thousands of time series from three Type B laser systems: a semiconductor laser in a photonic integrated chip, a semiconductor laser subject to optical feedback from a long free-space-external-cavity, and a solid-state laser subject to optical injection from a master laser. The lasers can deliver either constant, periodic, pulsed, or chaotic outputs when parameters such as the injection current and the level of external perturbation are varied. The systems represent examples of experimental nonlinear systems more generally and cover a broad range of complexity including systematically varying complexity in some regions. Methods: In this work we have introduced a new procedure for semi-automatically interrogating experimental laser system output power time series to calculate the correlation dimension (CD) using the commonly adopted Grassberger-Proccacia algorithm. The new CD procedure is called the ‘minimum gradient detection algorithm’. A value of minimum gradient is returned for all time series in a data set. In some cases this can be identified as a CD, with uncertainty. Findings: Applying the new ‘minimum gradient detection algorithm’ CD procedure, we obtained robust measurements of the correlation dimension for many of the time series measured from each laser system. By mapping the results across an extended parameter space for operation of each laser system, we were able to confidently identify regions of low CD (CD < 3) and assign these robust values for the correlation dimension. However, in all three laser systems, we were not able to measure the correlation dimension at all parts of the parameter space. Nevertheless, by mapping the staged progress of the algorithm, we were able to broadly classify the dynamical output of the lasers at all parts of their respective parameter spaces. For two of the laser systems this included displaying regions of high-complexity chaos and dynamic noise. These high-complexity regions are differentiated from regions where the time series are dominated by technical noise. This is the first time such differentiation has been achieved using a CD analysis approach. Conclusions: More can be known of the CD for a system when it is interrogated in a mapping context, than from calculations using isolated time series. This has been shown for three laser systems and the approach is expected to be useful in other areas of nonlinear science where large data sets are available and need to be semi-automatically analysed to provide real dimensional information about the complex dynamics. The CD/minimum gradient algorithm measure provides additional information that complements other measures of complexity and relative complexity, such as the permutation entropy; and conventional physical measurements. [ABSTRACT FROM AUTHOR]

Graphlets are small connected induced subgraphs of a larger graph G. Graphlets are now commonly used to quantify local and global topology of networks in the field. Methods exist to exhaustively enumerate all graphlets (and their orbits) in large networks as efficiently as possible using orbit counting equations. However, the number of graphlets in G is exponential in both the number of nodes and edges in G. Enumerating them all is already unacceptably expensive on existing large networks, and the problem will only get worse as networks continue to grow in size and density. Here we introduce an efficient method designed to aid statistical sampling of graphlets up to size k = 8 from a large network. We define graphettes as the generalization of graphlets allowing for disconnected graphlets. Given a particular (undirected) graphette g, we introduce the idea of the canonical graphette as a representative member of the isomorphism group Iso(g) of g. We compute the mapping , in the form of a lookup table, from all 2k ( k − 1)/2 undirected graphettes g of size k ≤ 8 to their canonical representatives , as well as the permutation that transforms g to . We also compute all automorphism orbits for each canonical graphette. Thus, given any k ≤ 8 nodes in a graph G, we can in constant time infer which graphette it is, as well as which orbit each of the k nodes belongs to. Sampling a large number N of such k-sets of nodes provides an approximation of both the distribution of graphlets and orbits across G, and the orbit degree vector at each node. [ABSTRACT FROM AUTHOR]

The use of computational systems to aid in the design of magic tricks has been previously explored. Here further steps are taken in this direction, introducing the use of computer technology as a natural language data sourcing and processing tool for magic trick design purposes. Crowd sourcing of psychological concepts is investigated; further, the role of human associative memory and its exploitation in magical effects is explored. A new trick is developed and evaluated: a physical card trick partially designed by a computational system configured to search for and explore conceptual spaces readily understood by spectators. [ABSTRACT FROM AUTHOR]

Social influence plays an important role in human behavior and decisions. Sources of influence can be divided as external, which are independent of social context, or as originating from peers, such as family and friends. An important question is how to disentangle the social contagion by peers from external influences. While a variety of experimental and observational studies provided insight into this problem, identifying the extent of contagion based on large-scale observational data with an unknown network structure remains largely unexplored. By bridging the gap between the large-scale complex systems perspective of collective human dynamics and the detailed approach of social sciences, we present a parsimonious model of social influence, and apply it to a central topic in political science—elections and voting behavior. We provide an analytical expression of the county vote-share distribution, which is in excellent agreement with almost a century of observed U.S. presidential election data. Analyzing the social influence topography over this period reveals an abrupt phase transition from low to high levels of social contagion, and robust differences among regions. These results suggest that social contagion effects are becoming more instrumental in shaping large-scale collective political behavior, with implications on democratic electoral processes and policies. [ABSTRACT FROM AUTHOR]

Corneal confocal microscopy (CCM) has revealed reduced corneal nerve fiber (CNF) length and density (CNFL, CNFD) in patients with diabetes, but the spatial pattern of CNF loss has not been studied. We aimed to determine whether spatial analysis of the distribution of corneal nerve branching points (CNBPs) may contribute to improving the detection of early CNF loss. We hypothesized that early CNF decline follows a clustered rather than random distribution pattern of CNBPs. CCM, nerve conduction studies (NCS), and quantitative sensory testing (QST) were performed in a cross-sectional study including 86 patients recently diagnosed with type 2 diabetes and 47 control subjects. In addition to CNFL, CNFD, and branch density (CNBD), CNBPs were analyzed using spatial point pattern analysis (SPPA) including 10 indices and functional statistics. Compared to controls, patients with diabetes showed lower CNBP density and higher nearest neighbor distances, and all SPPA parameters indicated increased clustering of CNBPs (all P<0.05). SPPA parameters were abnormally increased >97.5th percentile of controls in up to 23.5% of patients. When combining an individual SPPA parameter with CNFL, ≥1 of 2 indices were >99th or <1st percentile of controls in 28.6% of patients compared to 2.1% of controls, while for the conventional CNFL/CNFD/CNBD combination the corresponding rates were 16.3% vs 2.1%. SPPA parameters correlated with CNFL and several NCS and QST indices in the controls (all P<0.001), whereas in patients with diabetes these correlations were markedly weaker or lost. In conclusion, SPPA reveals increased clustering of early CNF loss and substantially improves its detection when combined with a conventional CCM measure in patients with recently diagnosed type 2 diabetes. [ABSTRACT FROM AUTHOR]

We present a new approach for handwritten signature classification and verification based on descriptors stemming from time causal information theory. The proposal uses the Shannon entropy, the statistical complexity, and the Fisher information evaluated over the Bandt and Pompe symbolization of the horizontal and vertical coordinates of signatures. These six features are easy and fast to compute, and they are the input to an One-Class Support Vector Machine classifier. The results are better than state-of-the-art online techniques that employ higher-dimensional feature spaces which often require specialized software and hardware. We assess the consistency of our proposal with respect to the size of the training sample, and we also use it to classify the signatures into meaningful groups. [ABSTRACT FROM AUTHOR]

The fruit fly optimization algorithm (FOA) is a newly developed bio-inspired algorithm. The continuous variant version of FOA has been proven to be a powerful evolutionary approach to determining the optima of a numerical function on a continuous definition domain. In this study, a discrete FOA (DFOA) is developed and applied to the traveling salesman problem (TSP), a common combinatorial problem. In the DFOA, the TSP tour is represented by an ordering of city indices, and the bio-inspired meta-heuristic search processes are executed with two elaborately designed main procedures: the smelling and tasting processes. In the smelling process, an effective crossover operator is used by the fruit fly group to search for the neighbors of the best-known swarm location. During the tasting process, an edge intersection elimination (EXE) operator is designed to improve the neighbors of the non-optimum food location in order to enhance the exploration performance of the DFOA. In addition, benchmark instances from the TSPLIB are classified in order to test the searching ability of the proposed algorithm. Furthermore, the effectiveness of the proposed DFOA is compared to that of other meta-heuristic algorithms. The results indicate that the proposed DFOA can be effectively used to solve TSPs, especially large-scale problems. [ABSTRACT FROM AUTHOR]

Neuronal information can be coded in different temporal and spatial scales. Cross-frequency coupling of neuronal oscillations, especially phase-amplitude coupling (PAC), plays a critical functional role in neuronal communication and large scale neuronal encoding. Several approaches have been developed to assess PAC intensity. It is generally agreed that the PAC intensity relates to the uneven distribution of the fast oscillation amplitude conditioned on the slow oscillation phase. However, it is still not clear what the PAC intensity exactly means. In the present study, it was found that there were three types of interferential signals taking part in PAC phenomenon. Based on the classification of interferential signals, the conception of PAC intensity is theoretically annotated as the proportion of slow or fast oscillation that is involved in a related PAC phenomenon. In order to make sure that the annotation is proper to some content, simulation data are constructed and then analyzed by three PAC approaches. These approaches are the mean vector length (MVL), the modulation index (MI), and a new permutation mutual information (PMI) method in which the permutation entropy and the information theory are applied. Results show positive correlations between PAC values derived from all three methods and the suggested intensity. Finally, the amplitude distributions, i.e. the phase-amplitude plots, obtained from different PAC intensities show that the annotation proposed in the study is in line with the previous understandings. [ABSTRACT FROM AUTHOR]

We present a method to solve the binding problem by using a quantum algorithm for the retrieval of associations from associative memory during visual scene analysis. The problem is solved by mapping the information representing different objects into superposition by using entanglement and Grover’s amplification algorithm. [ABSTRACT FROM AUTHOR]

Supervised machine learning methods typically require splitting data into multiple chunks for training, validating, and finally testing classifiers. For finding the best parameters of a classifier, training and validation are usually carried out with cross-validation. This is followed by application of the classifier with optimized parameters to a separate test set for estimating the classifier’s generalization performance. With limited data, this separation of test data creates a difficult trade-off between having more statistical power in estimating generalization performance versus choosing better parameters and fitting a better model. We propose a novel approach that we term “Cross-validation and cross-testing” improving this trade-off by re-using test data without biasing classifier performance. The novel approach is validated using simulated data and electrophysiological recordings in humans and rodents. The results demonstrate that the approach has a higher probability of discovering significant results than the standard approach of cross-validation and testing, while maintaining the nominal alpha level. In contrast to nested cross-validation, which is maximally efficient in re-using data, the proposed approach additionally maintains the interpretability of individual parameters. Taken together, we suggest an addition to currently used machine learning approaches which may be particularly useful in cases where model weights do not require interpretation, but parameters do. [ABSTRACT FROM AUTHOR]

As the use of large-scale data-driven analysis becomes increasingly common, the need for robust methods for interpreting a large number of results increases. To date, neuroimaging attempts to interpret large-scale activity or connectivity results often turn to existing neural mapping based on previous literature. In case of a large number of results, manual selection or percent of overlap with existing maps is frequently used to facilitate interpretation, often without a clear statistical justification. Such methodology holds the risk of reporting false positive results and overlooking additional results. Here, we propose using enrichment analysis for improving the interpretation of large-scale neuroimaging results. We focus on two possible cases: position group analysis, where the identified results are a set of neural positions; and connection group analysis, where the identified results are a set of neural position-pairs (i.e. neural connections). We explore different models for detecting significant overrepresentation of known functional brain annotations using simulated and real data. We implemented our methods in a tool called RichMind, which provides both statistical significance reports and brain visualization. We demonstrate the abilities of RichMind by revisiting two previous fMRI studies. In both studies RichMind automatically highlighted most of the findings that were reported in the original studies as well as several additional findings that were overlooked. Hence, RichMind is a valuable new tool for rigorous inference from neuroimaging results. [ABSTRACT FROM AUTHOR]

Previous studies have identified several cortical regions that show larger BOLD responses during preparation and execution of anti-saccades than pro-saccades. We confirmed this finding with a greater BOLD response for anti-saccades than pro-saccades during the preparation phase in the FEF, IPS and DLPFC and in the FEF and IPS in the execution phase. We then applied multi-voxel pattern analysis (MVPA) to establish whether different neural populations are involved in the two types of saccade. Pro-saccades and anti-saccades were reliably decoded during saccade execution in all three cortical regions (FEF, DLPFC and IPS) and in IPS during saccade preparation. This indicates neural specialization, for programming the desired response depending on the task rule, in these regions. In a further study tailored for imaging the superior colliculus in the midbrain a similar magnitude BOLD response was observed for pro-saccades and anti-saccades and the two saccade types could not be decoded with MVPA. This was the case both for activity related to the preparation phase and also for that elicited during the execution phase. We conclude that separate cortical neural populations are involved in the task-specific programming of a saccade while in contrast, the SC has a role in response preparation but may be less involved in high-level, task-specific aspects of the control of saccades. [ABSTRACT FROM AUTHOR]

The formation of transient networks in response to external stimuli or as a reflection of internal cognitive processes is a hallmark of human brain function. However, its identification in fMRI data of the human brain is notoriously difficult. Here we propose a new method of fMRI data analysis that tackles this problem by considering large-scale, task-related synchronisation networks. Networks consist of nodes and edges connecting them, where nodes correspond to voxels in fMRI data, and the weight of an edge is determined via task-related changes in dynamic synchronisation between their respective times series. Based on these definitions, we developed a new data analysis algorithm that identifies edges that show differing levels of synchrony between two distinct task conditions and that occur in dense packs with similar characteristics. Hence, we call this approach “Task-related Edge Density” (TED). TED proved to be a very strong marker for dynamic network formation that easily lends itself to statistical analysis using large scale statistical inference. A major advantage of TED compared to other methods is that it does not depend on any specific hemodynamic response model, and it also does not require a presegmentation of the data for dimensionality reduction as it can handle large networks consisting of tens of thousands of voxels. We applied TED to fMRI data of a fingertapping and an emotion processing task provided by the Human Connectome Project. TED revealed network-based involvement of a large number of brain areas that evaded detection using traditional GLM-based analysis. We show that our proposed method provides an entirely new window into the immense complexity of human brain function. [ABSTRACT FROM AUTHOR]

Heart failure (HF) patients show brain injury in autonomic, affective, and cognitive sites, which can change resting-state functional connectivity (FC), potentially altering overall functional brain network organization. However, the status of such connectivity or functional organization is unknown in HF. Determination of that status was the aim here, and we examined region-to-region FC and brain network topological properties across the whole-brain in 27 HF patients compared to 53 controls with resting-state functional MRI procedures. Decreased FC in HF appeared between the caudate and cerebellar regions, olfactory and cerebellar sites, vermis and medial frontal regions, and precentral gyri and cerebellar areas. However, increased FC emerged between the middle frontal gyrus and sensorimotor areas, superior parietal gyrus and orbito/medial frontal regions, inferior temporal gyrus and lingual gyrus/cerebellar lobe/pallidum, fusiform gyrus and superior orbitofrontal gyrus and cerebellar sites, and within vermis and cerebellar areas; these connections were largely in the right hemisphere (p<0.005; 10,000 permutations). The topology of functional integration and specialized characteristics in HF are significantly changed in regions showing altered FC, an outcome which would interfere with brain network organization (p<0.05; 10,000 permutations). Brain dysfunction in HF extends to resting conditions, and autonomic, cognitive, and affective deficits may stem from altered FC and brain network organization that may contribute to higher morbidity and mortality in the condition. Our findings likely result from the prominent axonal and nuclear structural changes reported earlier in HF; protecting neural tissue may improve FC integrity, and thus, increase quality of life and reduce morbidity and mortality. [ABSTRACT FROM AUTHOR]

Scale-free networks, in which the distribution of the degrees obeys a power-law, are ubiquitous in the study of complex systems. One basic network property that relates to the structure of the links found is the degree assortativity, which is a measure of the correlation between the degrees of the nodes at the end of the links. Degree correlations are known to affect both the structure of a network and the dynamics of the processes supported thereon, including the resilience to damage, the spread of information and epidemics, and the efficiency of defence mechanisms. Nonetheless, while many studies focus on undirected scale-free networks, the interactions in real-world systems often have a directionality. Here, we investigate the dependence of the degree correlations on the power-law exponents in directed scale-free networks. To perform our study, we consider the problem of building directed networks with a prescribed degree distribution, providing a method for proper generation of power-law-distributed directed degree sequences. Applying this new method, we perform extensive numerical simulations, generating ensembles of directed scale-free networks with exponents between 2 and 3, and measuring ensemble averages of the Pearson correlation coefficients. Our results show that scale-free networks are on average uncorrelated across directed links for three of the four possible degree-degree correlations, namely in-degree to in-degree, in-degree to out-degree, and out-degree to out-degree. However, they exhibit anticorrelation between the number of outgoing connections and the number of incoming ones. The findings are consistent with an entropic origin for the observed disassortativity in biological and technological networks. [ABSTRACT FROM AUTHOR]

Biologists are required to integrate large amounts of data to construct a working model of the system under investigation. This model is often informal and stored mentally or textually, making it prone to contain undetected inconsistencies, inaccuracies, or even contradictions, not much less than a representation in free natural language. Using Object-Process Methodology (OPM), a formal yet visual and humanly accessible conceptual modeling language, we have created an executable working model of the mRNA decay process in Saccharomyces cerevisiae, as well as the import of its components to the nucleus following mRNA decay. We show how our model, which incorporates knowledge from 43 articles, can reproduce outcomes that match the experimental findings, evaluate hypotheses, and predict new possible outcomes. Moreover, we were able to analyze the effects of the mRNA decay model perturbations related to gene and interaction deletions, and predict the nuclear import of certain decay factors, which we then verified experimentally. In particular, we verified experimentally the hypothesis that Rpb4p, Lsm1p, and Pan2p remain bound to the RNA 3′-untralslated region during the entire process of the 5′ to 3′ degradation of the RNA open reading frame. The model has also highlighted erroneous hypotheses that indeed were not in line with the experimental outcomes. Beyond the scientific value of these specific findings, this work demonstrates the value of the conceptual model as an in silico vehicle for hypotheses generation and testing, which can reinforce, and often even replace, risky, costlier wet lab experiments. [ABSTRACT FROM AUTHOR]

We quantify the notion of pattern and formalize the process of pattern discovery under the framework of binary bipartite networks. Patterns of particular focus are interrelated global interactions between clusters on its row and column axes. A binary bipartite network is built into a thermodynamic system embracing all up-and-down spin configurations defined by product-permutations on rows and columns. This system is equipped with its ferromagnetic energy ground state under Ising model potential. Such a ground state, also called a macrostate, is postulated to congregate all patterns of interest embedded within the network data in a multiscale fashion. A new computing paradigm for indirect searching for such a macrostate, called Data Mechanics, is devised by iteratively building a surrogate geometric system with a pair of nearly optimal marginal ultrametrics on row and column spaces. The coupling measure minimizing the Gromov-Wasserstein distance of these two marginal geometries is also seen to be in the vicinity of the macrostate. This resultant coupling geometry reveals multiscale block pattern information that characterizes multiple layers of interacting relationships between clusters on row and on column axes. It is the nonparametric information content of a binary bipartite network. This coupling geometry is then demonstrated to shed new light and bring resolution to interaction issues in community ecology and in gene-content-based phylogenetics. Its implied global inferences are expected to have high potential in many scientific areas. [ABSTRACT FROM AUTHOR]

The ancient Greek astronomical calculating machine, known as the Antikythera Mechanism, predicted eclipses, based on the 223-lunar month Saros cycle. Eclipses are indicated on a four-turn spiral Saros Dial by glyphs, which describe type and time of eclipse and include alphabetical index letters, referring to solar eclipse inscriptions. These include Index Letter Groups, describing shared eclipse characteristics. The grouping and ordering of the index letters, the organization of the inscriptions and the eclipse times have previously been unsolved. A new reading and interpretation of data from the back plate of the Antikythera Mechanism, including the glyphs, the index letters and the eclipse inscriptions, has resulted in substantial changes to previously published work. Based on these new readings, two arithmetical models are presented here that explain the complete eclipse prediction scheme. The first model solves the glyph distribution, the grouping and anomalous ordering of the index letters and the structure of the inscriptions. It also implies the existence of lost lunar eclipse inscriptions. The second model closely matches the glyph times and explains the four-turn spiral of the Saros Dial. Together, these models imply a surprisingly early epoch for the Antikythera Mechanism. The ancient Greeks built a machine that can predict, for many years ahead, not only eclipses but also a remarkable array of their characteristics, such as directions of obscuration, magnitude, colour, angular diameter of the Moon, relationship with the Moon’s node and eclipse time. It was not entirely accurate, but it was an astonishing achievement for its era. [ABSTRACT FROM AUTHOR]

Recently, there has been much interest in the community structure or mesoscale organization of complex networks. This structure is characterised either as a set of sparsely inter-connected modules or as a highly connected core with a sparsely connected periphery. However, it is often difficult to disambiguate these two types of mesoscale structure or, indeed, to summarise the full network in terms of the relationships between its mesoscale constituents. Here, we estimate a community structure with a stochastic blockmodel approach, the Erdős-Rényi Mixture Model, and compare it to the much more widely used deterministic methods, such as the Louvain and Spectral algorithms. We used the Caenorhabditis elegans (C. elegans) nervous system (connectome) as a model system in which biological knowledge about each node or neuron can be used to validate the functional relevance of the communities obtained. The deterministic algorithms derived communities with 4–5 modules, defined by sparse inter-connectivity between all modules. In contrast, the stochastic Erdős-Rényi Mixture Model estimated a community with 9 blocks or groups which comprised a similar set of modules but also included a clearly defined core, made of 2 small groups. We show that the “core-in-modules” decomposition of the worm brain network, estimated by the Erdős-Rényi Mixture Model, is more compatible with prior biological knowledge about the C. elegans nervous system than the purely modular decomposition defined deterministically. We also show that the blockmodel can be used both to generate stochastic realisations (simulations) of the biological connectome, and to compress network into a small number of super-nodes and their connectivity. We expect that the Erdős-Rényi Mixture Model may be useful for investigating the complex community structures in other (nervous) systems. [ABSTRACT FROM AUTHOR]

We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural networks that represents an assessment of their computational power in terms of the significance of their attractor dynamics. This complexity measurement is achieved by first proving a computational equivalence between Boolean recurrent neural networks and some specific class of -automata, and then translating the most refined classification of -automata to the Boolean neural network context. As a result, a hierarchical classification of Boolean neural networks based on their attractive dynamics is obtained, thus providing a novel refined attractor-based complexity measurement for Boolean recurrent neural networks. These results provide new theoretical insights to the computational and dynamical capabilities of neural networks according to their attractive potentialities. An application of our findings is illustrated by the analysis of the dynamics of a simplified model of the basal ganglia-thalamocortical network simulated by a Boolean recurrent neural network. This example shows the significance of measuring network complexity, and how our results bear new founding elements for the understanding of the complexity of real brain circuits. [ABSTRACT FROM AUTHOR]