Search

CNN has demonstrated remarkable performance in EEG signal detection, yet it still faces limitations in terms of global perception. Additionally, due to individual differences in EEG signals, the generalization ability of epilepsy detection models is week. To address this issue, this paper presents a cross-patient epilepsy detection method utilizing a multi-head self-attention mechanism. This method first utilizes Short-Time Fourier Transform (STFT) to transform the original EEG signals into time-frequency features, then models local information using Convolutional Neural Network (CNN), subsequently captures global dependency relationships between features using the multi-head self-attention mechanism of Transformer, and finally performs epilepsy detection using these features. Meanwhile, this model employs a light multi-head attention mechanism module with an alternating structure, which can comprehensively extract multi-scale features while significantly reducing computational costs. Experimental results on the CHB-MIT dataset show that the proposed model achieves accuracy, sensitivity, specificity, F1 score, and AUC of 92.89%, 96.17%, 92.99%, 94.41%, and 96.77%, respectively. Compared to the existing methods, the method proposed in this paper obtains better performance along with better generalization. [ABSTRACT FROM AUTHOR]

The human brain operates at multiple levels, from molecules to circuits, and understanding these complex processes requires integrated research efforts. Simulating biophysically-detailed neuron models is a computationally expensive but effective method for studying local neural circuits. Recent innovations have shown that artificial neural networks (ANNs) can accurately predict the behavior of these detailed models in terms of spikes, electrical potentials, and optical readouts. While these methods have the potential to accelerate large network simulations by several orders of magnitude compared to conventional differential equation based modelling, they currently only predict voltage outputs for the soma or a select few neuron compartments. Our novel approach, based on enhanced state-of-the-art architectures for multitask learning (MTL), allows for the simultaneous prediction of membrane potentials in each compartment of a neuron model, at a speed of up to two orders of magnitude faster than classical simulation methods. By predicting all membrane potentials together, our approach not only allows for comparison of model output with a wider range of experimental recordings (patch-electrode, voltage-sensitive dye imaging), it also provides the first stepping stone towards predicting local field potentials (LFPs), electroencephalogram (EEG) signals, and magnetoencephalography (MEG) signals from ANN-based simulations. While LFP and EEG are an important downstream application, the main focus of this paper lies in predicting dendritic voltages within each compartment to capture the entire electrophysiology of a biophysically-detailed neuron model. It further presents a challenging benchmark for MTL architectures due to the large amount of data involved, the presence of correlations between neighbouring compartments, and the non-Gaussian distribution of membrane potentials. Author summary: Our research focuses on cutting-edge techniques in computational neuroscience. We specifically make use of simulations of biophysically detailed neuron models. Traditionally these methods are computationally intensive, but recent advancements using artificial neural networks (ANNs) have shown promise in predicting neural behavior with remarkable accuracy. However, existing ANNs fall short in providing comprehensive predictions across all compartments of a neuron model and only provide information on the activity of a limited number of locations along the extent of a neuron. In our study, we introduce a novel approach leveraging state-of-the-art multitask learning architectures. This approach allows us to simultaneously predict membrane potentials in every compartment of a neuron model. By distilling the underlying electrophysiology into an ANN, we significantly outpace conventional simulation methods. By accurately capturing voltage outputs across the neuron's structure, our method invites comparisons with experimental data and paves the way for predicting complex aggregate signals such as local field potentials and EEG signals. Our findings not only advance our understanding of neural dynamics but also present a significant benchmark for future research in computational neuroscience. [ABSTRACT FROM AUTHOR]

This paper provides a comprehensive and computationally efficient case study for uncertainty quantification (UQ) and global sensitivity analysis (GSA) in a neuron model incorporating ion concentration dynamics. We address how challenges with UQ and GSA in this context can be approached and solved, including challenges related to computational cost, parameters affecting the system's resting state, and the presence of both fast and slow dynamics. Specifically, we analyze the electrodiffusive neuron-extracellular-glia (edNEG) model, which captures electrical potentials, ion concentrations (Na+, K+, Ca2+, and Cl−), and volume changes across six compartments. Our methodology includes a UQ procedure assessing the model's reliability and susceptibility to input uncertainty and a variance-based GSA identifying the most influential input parameters. To mitigate computational costs, we employ surrogate modeling techniques, optimized using efficient numerical integration methods. We propose a strategy for isolating parameters affecting the resting state and analyze the edNEG model dynamics under both physiological and pathological conditions. The influence of uncertain parameters on model outputs, particularly during spiking dynamics, is systematically explored. Rapid dynamics of membrane potentials necessitate a focus on informative spiking features, while slower variations in ion concentrations allow a meaningful study at each time point. Our study offers valuable guidelines for future UQ and GSA investigations on neuron models with ion concentration dynamics, contributing to the broader application of such models in computational neuroscience. [ABSTRACT FROM AUTHOR]

The Free Energy Principle (FEP) and Integrated Information Theory (IIT) are two ambitious theoretical approaches. The first aims to make a formal framework for describing self-organizing and life-like systems in general, and the second attempts a mathematical theory of conscious experience based on the intrinsic properties of a system. They are each concerned with complementary aspects of the properties of systems, one with life and behavior, the other with meaning and experience, so combining them has potential for scientific value. In this paper, we take a first step towards such a synthesis by expanding on the results of an earlier published evolutionary simulation study, which show a relationship between IIT-measures and fitness in differing complexities of tasks. We relate a basic information theoretic measure from the FEP, surprisal, to this result, finding that the surprisal of simulated agents' observations is inversely related to the general increase in fitness and integration over evolutionary time. Moreover, surprisal fluctuates together with IIT-based consciousness measures in within-trial time. This suggests that the consciousness measures used in IIT indirectly depend on the relation between the agent and the external world, and that it should therefore be possible to relate them to the theoretical concepts used in the FEP. Lastly, we suggest a future approach for investigating this relationship empirically. Author summary: Two influential theoretical frameworks in cognitive science, neuroscience and computational biology, are the Free Energy Principle and Integrated Information Theory. The first is a formal approach to self-organization and adaptive behavior ‐ in short, life ‐ based on first principles from statistical physics. The second is an attempt at formally describing the intrinsic experience of a given system, that is, how it feels to be that system. In this way, these two theories provide tools for understanding two complementary aspects of a given organism; namely, how it acts in a goal-directed manner based on statistical beliefs about the world, and how it feels to be that system in that process. In this paper, we provide an initial numerical investigation of the potential relation of these theoretical frameworks. We simulate agents that undergo evolution, and show that as their level of integration (Φ, a measure from Integrated Information Theory) increases, information theoretic surprisal (a quantity used in the Free Energy Principle) decreases. We also see that Φ and surprisal fluctuate together, and that these fluctuations depend on sensory input. Finally we provide considerations for future simulation work, and how to bring these two theoretical frameworks closer together. [ABSTRACT FROM AUTHOR]

Quarantine has been long used as a public health response to emerging infectious diseases, particularly at the onset of an epidemic when the infected proportion of a population remains identifiable and logistically tractable. In theory, the same logic should apply to low-incidence infections; however, the application and impact of quarantine in low prevalence settings appears less common and lacks a formal analysis. Here, we present a quantitative framework using a series of progressively more biologically realistic models of canine rabies in domestic dogs and from dogs to humans, a suitable example system to characterize dynamical changes under varying levels of dog quarantine. We explicitly incorporate health-seeking behaviour data to inform the modelling of contact-tracing and exclusion of rabies suspect and probable dogs that can be identified through bite-histories of patients presenting at anti-rabies clinics. We find that a temporary quarantine of rabies suspect and probable dogs provides a powerful tool to curtail rabies transmission, especially in settings where optimal vaccination coverage is yet to be achieved, providing a critical stopgap to reduce the number of human and animal deaths due to rabid bites. We conclude that whilst comprehensive measures including sensitive surveillance and large-scale vaccination of dogs will be required to achieve disease elimination and sustained freedom given the persistent risk of rabies re-introductions, quarantine offers a low-cost community driven solution to intersectoral health burden. Author summary: Canine rabies remains a human health risk in many countries around the world, particularly in lower and middle income settings where many dogs are free roaming and able to interact more easily with other dogs and humans. In this paper, we present results from a mathematical model that simulates the spread of rabies both between dogs and from dogs to humans and investigate the impact of quarantine and vaccination at reducing transmission. Our work demonstrates the effectiveness of quarantining both infectious and exposed dogs—we observe that quarantine can have a substantial effect on reducing the number of new animals subsequently infected and thereby lowering the risk of humans being exposed to infection. Such a policy can have significant benefits, particularly in settings where access to vaccinations is challenging and resources are limited. Our research can therefore help to inform policy makers in countries where canine rabies is circulating to develop appropriate strategies to reduce the human health risks associated with canine rabies in the future. [ABSTRACT FROM AUTHOR]

Accurate Origin-Destination (OD) prediction is significant for effective traffic monitor, which can support operation decision in traffic planning and management field. The enclosed expressway network system like toll gates system in China can collect mounts of trip records which can be gathered for OD prediction. The paper develops a novel neural network, which is named Expressway OD Prediction Neural Network (EODPNN) for toll data-based prediction. The network consists of the following three modules: The Feature Extension Module, the Memory Module, and the Prediction Module. In the process, the attributes data which can reflect the city attribute such as GDP, population, and the number of vehicles are considered to embeded into the notwork to increase the accuracy of the model. For the applicability improvment of the model, we categorize the cities in multiple classes based on their economy and population scales in this paper, which can provide a higher accurate prediction of OD by EODPNN. The results shows that, comparing to the traditional model like ARIMA and SVM, or typical neural networks like Bidirectional Long Short-term Memory, the EODPNN delivers a better prediction performance. The method proposed in this paper has been fully verified and has a potential to transplant to the other OD data-based management systems for a more accurate and flexible prediction. [ABSTRACT FROM AUTHOR]

Drug-target binding affinity prediction plays a key role in the early stage of drug discovery. Numerous experimental and data-driven approaches have been developed for predicting drug-target binding affinity. However, experimental methods highly rely on the limited structural-related information from drug-target pairs, domain knowledge, and time-consuming assays. On the other hand, learning-based methods have shown an acceptable prediction performance. However, most of them utilize several simple and complex types of proteins and drug compounds data, ranging from the protein sequences to the topology of a graph representation of drug compounds, employing multiple deep neural networks for encoding and feature extraction, and so, leads to the computational overheads. In this study, we propose a unified measure for protein sequence encoding, named BiComp, which provides compression-based and evolutionary-related features from the protein sequences. Specifically, we employ Normalized Compression Distance and Smith-Waterman measures for capturing complementary information from the algorithmic information theory and biological domains, respectively. We utilize the proposed measure to encode the input proteins feeding a new deep neural network-based method for drug-target binding affinity prediction, named BiComp-DTA. BiComp-DTA is evaluated utilizing four benchmark datasets for drug-target binding affinity prediction. Compared to the state-of-the-art methods, which employ complex models for protein encoding and feature extraction, BiComp-DTA provides superior efficiency in terms of accuracy, runtime, and the number of trainable parameters. The latter achievement facilitates execution of BiComp-DTA on a normal desktop computer in a fast fashion. As a comparative study, we evaluate BiComp's efficiency against its components for drug-target binding affinity prediction. The results have shown superior accuracy of BiComp due to the orthogonality and complementary nature of Smith-Waterman and Normalized Compression Distance measures for protein sequences. Such a protein sequence encoding provides efficient representation with no need for multiple sources of information, deep domain knowledge, and complex neural networks. Author summary: Drugs alter the protein conformation and functionality through binding to the target proteins. Measuring the binding tendency between drugs and proteins, known as drug-target binding affinity prediction, is an important task in developing new drug candidates and novel therapeutics in the early stage of drug discovery. Measuring the affinity strength through biological assays is expensive and time-consuming. On the other hand, considerable data-driven and computational methods are proposed to predict binding affinity prediction through employing complicated models, and multiple types of proteins and drug compounds data. In this paper, we present a deep learning-based method, named BiComp-DTA, which utilizes both biological and sequence content features extracted from the protein sequences using a new unified measure, named BiComp. Encoded protein sequences and drug's information are passed to the fully-connected and hybrid neural networks, including CNN and separable CNN layers, respectively. Simulation results using benchmark datasets indicate that BiComp-DTA provides an accurate and fast prediction for drug-target binding affinity prediction without employing multiple complicated networks, several types of proteins and drug compounds data, and external tools for input data modeling. [ABSTRACT FROM AUTHOR]

Computational models of infectious diseases have become valuable tools for research and the public health response against epidemic threats. The reproducibility of computational models has been limited, undermining the scientific process and possibly trust in modeling results and related response strategies, such as vaccination. We translated published reproducibility guidelines from a wide range of scientific disciplines into an implementation framework for improving reproducibility of infectious disease computational models. The framework comprises 22 elements that should be described, grouped into 6 categories: computational environment, analytical software, model description, model implementation, data, and experimental protocol. The framework can be used by scientific communities to develop actionable tools for sharing computational models in a reproducible way. [ABSTRACT FROM AUTHOR]

Geometric descriptions of deep neural networks (DNNs) have the potential to uncover core representational principles of computational models in neuroscience. Here we examined the geometry of DNN models of visual cortex by quantifying the latent dimensionality of their natural image representations. A popular view holds that optimal DNNs compress their representations onto low-dimensional subspaces to achieve invariance and robustness, which suggests that better models of visual cortex should have lower dimensional geometries. Surprisingly, we found a strong trend in the opposite direction—neural networks with high-dimensional image subspaces tended to have better generalization performance when predicting cortical responses to held-out stimuli in both monkey electrophysiology and human fMRI data. Moreover, we found that high dimensionality was associated with better performance when learning new categories of stimuli, suggesting that higher dimensional representations are better suited to generalize beyond their training domains. These findings suggest a general principle whereby high-dimensional geometry confers computational benefits to DNN models of visual cortex. Author summary: The effective dimensionality of neural population codes in both brains and artificial neural networks can be far smaller than the number of neurons in the population. In vision, it has been argued that there are crucial benefits of representing images using codes that are as simple and low-dimensional as possible, allowing representations to emphasize key semantic content and attenuate irrelevant perceptual details. However, there are competing benefits of high-dimensional codes, which can capture rich perceptual information to better support an open-ended set of visual behaviors. We quantified the effective dimensionality of neural networks created using a diverse set of training paradigms and compared these networks with image-evoked codes in the visual cortex of both monkeys and humans. Our findings revealed striking benefits of networks with higher effective dimensionality, which were consistently better predictors of cortical activity patterns and were able to readily learn new categories of images outside of their training domains. Together, these findings demonstrate the computational benefits of high-dimensional sensory codes, and they suggest that current neural network models of visual cortex may be better understood in terms of the richness of their representations rather than the details of their training tasks. [ABSTRACT FROM AUTHOR]

Analyzing geological drilling hole images acquired by Axial View Panoramic Borehole Televiewer (APBT) is a key step to explore the geological structure in a geological exploration. Conventionally, the borehole images are examined by technicians, which is inefficient and subjective. In this paper, three dominant types of borehole-wall images on coal-rock mass structure, namely, border images, fracture images and intact rock mass images are mainly studied. The traditional image classification methods based on unified feature extraction algorithm and single classifier is not effect for the borehole images. Therefore, this paper proposes a novel two-stage classification approach to improve the classification performance of borehole images. In the first-stage classification, the border images are identified from three kinds of images based on texture features and gray-scale histograms features. For the remaining two types of images, in the second-stage classification, Gabor filter is first applied to segment the region of interest (ROI) (such as microfracture, absciss layer and horizontal cracks, etc.) and the central interference region. Then, using the same feature vector after eliminating the central interference region, fracture images are separated from intact rock mass images. We test our two-stage classification system with real borehole images. The results of experimental show that the two-stage classification method can effectively classify three major borehole-wall images with the correction rate of 95.55% in the first stage and 95% in the second stage. [ABSTRACT FROM AUTHOR]

This paper studies the drive-response synchronization for quaternion-valued shunting inhibitory cellular neural networks (QVSICNNs) with mixed delays. First, QVSICNN is decomposed into an equivalent real-valued system in order to avoid the non-commutativity of the multiplicity. Then, the existence of almost periodic solutions is obtained based on the Banach fixed point theorem. An novel state-feedback controller is designed to ensure the global exponential almost periodic synchronization. At the end of the paper, an example is given to illustrate the effectiveness of the obtained results. [ABSTRACT FROM AUTHOR]

Combining a deep neural network with fuzzy theory, this paper proposes an advertising click-through rate (CTR) prediction approach based on a fuzzy deep neural network (FDNN). In this approach, fuzzy Gaussian-Bernoulli restricted Boltzmann machine (FGBRBM) is first applied to input raw data from advertising datasets. Next, fuzzy restricted Boltzmann machine (FRBM) is used to construct the fuzzy deep belief network (FDBN) with the unsupervised method layer by layer. Finally, fuzzy logistic regression (FLR) is utilized for modeling the CTR. The experimental results show that the proposed FDNN model outperforms several baseline models in terms of both data representation capability and robustness in advertising click log datasets with noise. [ABSTRACT FROM AUTHOR]

In this paper, we propose a hybrid method to forecast the stock prices called High-order-fuzzy-fluctuation-Trends-based Back Propagation(HTBP)Neural Network model. First, we compare each value of the historical training data with the previous day's value to obtain a fluctuation trend time series (FTTS). On this basis, the FTTS blur into fuzzy time series (FFTS) based on the fluctuation of the increasing, equality, decreasing amplitude and direction. Since the relationship between FFTS and future wave trends is nonlinear, the HTBP neural network algorithm is used to find the mapping rules in the form of self-learning. Finally, the results of the algorithm output are used to predict future fluctuations. The proposed model provides some innovative features:(1)It combines fuzzy set theory and neural network algorithm to avoid overfitting problems existed in traditional models. (2)BP neural network algorithm can intelligently explore the internal rules of the actual existence of sequential data, without the need to analyze the influence factors of specific rules and the path of action. (3)The hybrid modal can reasonably remove noises from the internal rules by proper fuzzy treatment. This paper takes the TAIEX data set of Taiwan stock exchange as an example, and compares and analyzes the prediction performance of the model. The experimental results show that this method can predict the stock market in a very simple way. At the same time, we use this method to predict the Shanghai stock exchange composite index, and further verify the effectiveness and universality of the method. [ABSTRACT FROM AUTHOR]

Constraining the many biological parameters that govern cortical dynamics is computationally and conceptually difficult because of the curse of dimensionality. This paper addresses these challenges by proposing (1) a novel data-informed mean-field (MF) approach to efficiently map the parameter space of network models; and (2) an organizing principle for studying parameter space that enables the extraction biologically meaningful relations from this high-dimensional data. We illustrate these ideas using a large-scale network model of the Macaque primary visual cortex. Of the 10-20 model parameters, we identify 7 that are especially poorly constrained, and use the MF algorithm in (1) to discover the firing rate contours in this 7D parameter cube. Defining a "biologically plausible" region to consist of parameters that exhibit spontaneous Excitatory and Inhibitory firing rates compatible with experimental values, we find that this region is a slightly thickened codimension-1 submanifold. An implication of this finding is that while plausible regimes depend sensitively on parameters, they are also robust and flexible provided one compensates appropriately when parameters are varied. Our organizing principle for conceptualizing parameter dependence is to focus on certain 2D parameter planes that govern lateral inhibition: Intersecting these planes with the biologically plausible region leads to very simple geometric structures which, when suitably scaled, have a universal character independent of where the intersections are taken. In addition to elucidating the geometry of the plausible region, this invariance suggests useful approximate scaling relations. Our study offers, for the first time, a complete characterization of the set of all biologically plausible parameters for a detailed cortical model, which has been out of reach due to the high dimensionality of parameter space. Author summary: Cortical circuits are characterized by a high degree of structural and dynamical complexity, and this biological reality is reflected in the large number of parameters in even semi-realistic cortical models. A fundamental task of computational neuroscience is to understand how these parameters govern network dynamics. While some neuronal parameters can be measured in vivo, many remain poorly constrained due to limitations of available experimental techniques. Computational models can address this problem by relating difficult-to-measure parameters to observable quantities, but to do so one must overcome two challenges: (1) the computational expense of mapping a high dimensional parameter space, and (2) extracting biological insights from such a map. This study aims to address these challenges in the following ways: First, we propose a parsimonious data-informed algorithm that efficiently predicts spontaneous cortical activity, thereby speeding up the mapping of parameter landscapes. Second, we show that lateral inhibition provides a basis for conceptualizing cortical parameter space, enabling us to begin to make sense of its geometric structure and attendant scaling relations. We illustrate our approach on a biologically realistic model of the monkey primary visual cortex. [ABSTRACT FROM AUTHOR]

Neuroscience models come in a wide range of scales and specificity, from mean-field rate models to large-scale networks of spiking neurons. There are potential trade-offs between simplicity and realism, versatility and computational speed. This paper is about large-scale cortical network models, and the question we address is one of scalability: would scaling down cell density impact a network’s ability to reproduce cortical dynamics and function? We investigated this problem using a previously constructed realistic model of the monkey visual cortex that is true to size. Reducing cell density gradually up to 50-fold, we studied changes in model behavior. Size reduction without parameter adjustment was catastrophic. Surprisingly, relatively minor compensation in synaptic weights guided by a theoretical algorithm restored mean firing rates and basic function such as orientation selectivity to models 10-20 times smaller than the real cortex. Not all was normal in the reduced model cortices: intracellular dynamics acquired a character different from that of real neurons, and while the ability to relay feedforward inputs remained intact, reduced models showed signs of deficiency in functions that required dynamical interaction among cortical neurons. These findings are not confined to models of the visual cortex, and modelers should be aware of potential issues that accompany size reduction. Broader implications of this study include the importance of homeostatic maintenance of firing rates, and the functional consequences of feedforward versus recurrent dynamics, ideas that may shed light on other species and on systems suffering cell loss. [ABSTRACT FROM AUTHOR]

This paper focuses on fine-grained image retrieval based on sketches. Sketches capture detailed information, but their highly abstract nature makes visual comparisons with images more difficult. In spite of the fact that the existing models take into account the fine-grained details, they can not accurately highlight the distinctive local features and ignore the correlation between features. To solve this problem, we design a gradually focused bilinear attention model to extract detailed information more effectively. Specifically, the attention model is to accurately focus on representative local positions, and then use the weighted bilinear coding to find more discriminative feature representations. Finally, the global triplet loss function is used to avoid oversampling or undersampling. The experimental results show that the proposed method outperforms the state-of-the-art sketch-based image retrieval methods. [ABSTRACT FROM AUTHOR]

Background: In this paper we present a model of parameters to aesthetically characterize films using a multi-disciplinary approach: by combining film theory, visual low-level video descriptors (modeled in order to supply aesthetic information) and classification techniques using machine and deep learning. Methods: Four different tests have been developed, each for a different application, proving the model's usefulness. These applications are: aesthetic style clustering, prediction of production year, genre detection and influence on film popularity. Results: The results are compared against high-level information to determine the accuracy of the model to classify films without knowing such information previously. The main difference with other film characterization approaches is that we are able to isolate the influence of high-level descriptors to really understand the relevance of low-level features and, accordingly propose a useful set of low-level visual descriptors for that purpose. This model has been tested with a representative number of films to prove that it can be used for different applications. [ABSTRACT FROM AUTHOR]

Sand production and blockage are common during the drilling and production of horizontal oil and gas wells as a result of formation breakdown. The use of high-pressure rotating jets and annular helical flow is an effective way to enhance horizontal wellbore cleanout. In this paper, we propose the idea of using supercritical CO2 (SC-CO2) as washing fluid in water-sensitive formation. SC-CO2 is manifested to be effective in preventing formation damage and enhancing production rate as drilling fluid, which justifies tis potential in wellbore cleanout. In order to investigate the effectiveness of SC-CO2 helical flow cleanout, we perform the numerical study on the annular flow field, which significantly affects sand cleanout efficiency, of SC-CO2 jets in horizontal wellbore. Based on the field data, the geometry model and mathematical models were built. Then a numerical simulation of the annular helical flow field by SC-CO2 jets was accomplished. The influences of several key parameters were investigated, and SC-CO2 jets were compared to conventional water jets. The results show that flow rate, ambient temperature, jet temperature, and nozzle assemblies play the most important roles on wellbore flow field. Once the difference between ambient temperatures and jet temperatures is kept constant, the wellbore velocity distributions will not change. With increasing lateral nozzle size or decreasing rear/forward nozzle size, suspending ability of SC-CO2 flow improves obviously. A back-propagation artificial neural network (BP-ANN) was successfully employed to match the operation parameters and SC-CO2 flow velocities. A comprehensive model was achieved to optimize the operation parameters according to two strategies: cost-saving strategy and local optimal strategy. This paper can help to understand the distinct characteristics of SC-CO2 flow. And it is the first time that the BP-ANN is introduced to analyze the flow field during wellbore cleanout in horizontal wells. [ABSTRACT FROM AUTHOR]

This paper addresses a chaos kernel function for the relevance vector machine (RVM) in EEG signal classification, which is an important component of Brain-Computer Interface (BCI). The novel kernel function has evolved from a chaotic system, which is inspired by the fact that human brain signals depict some chaotic characteristics and behaviors. By introducing the chaotic dynamics to the kernel function, the RVM will be enabled for higher classification capacity. The proposed method is validated within the framework of one versus one common spatial pattern (OVO-CSP) classifier to classify motor imagination (MI) of four movements in a public accessible dataset. To illustrate the performance of the proposed kernel function, Gaussian and Polynomial kernel functions are considered for comparison. Experimental results show that the proposed kernel function achieved higher accuracy than Gaussian and Polynomial kernel functions, which shows that the chaotic behavior consideration is helpful in the EEG signal classification. [ABSTRACT FROM AUTHOR]

Data gathering is a fundamental task in Wireless Visual Sensor Networks (WVSNs). Features of directional antennas and the visual data make WVSNs more complex than the conventional Wireless Sensor Network (WSN). The virtual backbone is a technique, which is capable of constructing clusters. The version associating with the aggregation operation is also referred to as the virtual backbone tree. In most of the existing literature, the main focus is on the efficiency brought by the construction of clusters that the existing methods neglect local-balance problems in general. To fill up this gap, Directional Virtual Backbone based Data Aggregation Scheme (DVBDAS) for the WVSNs is proposed in this paper. In addition, a measurement called the energy consumption density is proposed for evaluating the adequacy of results in the cluster-based construction problems. Moreover, the directional virtual backbone construction scheme is proposed by considering the local-balanced factor. Furthermore, the associated network coding mechanism is utilized to construct DVBDAS. Finally, both the theoretical analysis of the proposed DVBDAS and the simulations are given for evaluating the performance. The experimental results prove that the proposed DVBDAS achieves higher performance in terms of both the energy preservation and the network lifetime extension than the existing methods. [ABSTRACT FROM AUTHOR]

The selection of seismic attributes is a key process in reservoir prediction because the prediction accuracy relies on the reliability and credibility of the seismic attributes. However, effective selection method for useful seismic attributes is still a challenge. This paper presents a novel selection method of seismic attributes for reservoir prediction based on the gray relational degree (GRD) and support vector machine (SVM). The proposed method has a two-hierarchical structure. In the first hierarchy, the primary selection of seismic attributes is achieved by calculating the GRD between seismic attributes and reservoir parameters, and the GRD between the seismic attributes. The principle of the primary selection is that these seismic attributes with higher GRD to the reservoir parameters will have smaller GRD between themselves as compared to those with lower GRD to the reservoir parameters. Then the SVM is employed in the second hierarchy to perform an interactive error verification using training samples for the purpose of determining the final seismic attributes. A real-world case study was conducted to evaluate the proposed GRD-SVM method. Reliable seismic attributes were selected to predict the coalbed methane (CBM) content in southern Qinshui basin, China. In the analysis, the instantaneous amplitude, instantaneous bandwidth, instantaneous frequency, and minimum negative curvature were selected, and the predicted CBM content was fundamentally consistent with the measured CBM content. This real-world case study demonstrates that the proposed method is able to effectively select seismic attributes, and improve the prediction accuracy. Thus, the proposed GRD-SVM method can be used for the selection of seismic attributes in practice. [ABSTRACT FROM AUTHOR]

A long-term goal of AI is to produce agents that can learn a diversity of skills throughout their lifetimes and continuously improve those skills via experience. A longstanding obstacle towards that goal is catastrophic forgetting, which is when learning new information erases previously learned information. Catastrophic forgetting occurs in artificial neural networks (ANNs), which have fueled most recent advances in AI. A recent paper proposed that catastrophic forgetting in ANNs can be reduced by promoting modularity, which can limit forgetting by isolating task information to specific clusters of nodes and connections (functional modules). While the prior work did show that modular ANNs suffered less from catastrophic forgetting, it was not able to produce ANNs that possessed task-specific functional modules, thereby leaving the main theory regarding modularity and forgetting untested. We introduce diffusion-based neuromodulation, which simulates the release of diffusing, neuromodulatory chemicals within an ANN that can modulate (i.e. up or down regulate) learning in a spatial region. On the simple diagnostic problem from the prior work, diffusion-based neuromodulation 1) induces task-specific learning in groups of nodes and connections (task-specific localized learning), which 2) produces functional modules for each subtask, and 3) yields higher performance by eliminating catastrophic forgetting. Overall, our results suggest that diffusion-based neuromodulation promotes task-specific localized learning and functional modularity, which can help solve the challenging, but important problem of catastrophic forgetting. [ABSTRACT FROM AUTHOR]

Wind turbine noise is one of the major obstacles for the widespread use of wind energy. Noise tone can greatly increase the annoyance factor and the negative impact on human health. Noise annoyance caused by wind turbines has become an emerging problem in recent years, due to the rapid increase in number of wind turbines, triggered by sustainable energy goals set forward at the national and international level. Up to now, not all aspects of the generation, propagation and perception of wind turbine noise are well understood. For a modern large wind turbine, aerodynamic noise from the blades is generally considered to be the dominant noise source, provided that mechanical noise is adequately eliminated. The sources of aerodynamic noise can be divided into tonal noise, inflow turbulence noise, and airfoil self-noise. Many analytical and experimental acoustical studies performed the wind turbines. Since the wind turbine noise level analyzing by numerical methods or computational fluid dynamics (CFD) could be very challenging and time consuming, soft computing techniques are preferred. To estimate noise level of wind turbine, this paper constructed a process which simulates the wind turbine noise levels in regard to wind speed and sound frequency with adaptive neuro-fuzzy inference system (ANFIS). This intelligent estimator is implemented using Matlab/Simulink and the performances are investigated. The simulation results presented in this paper show the effectiveness of the developed method. [ABSTRACT FROM AUTHOR]

Modern computing architecture based on the separation of memory and processing leads to a well known problem called the von Neumann bottleneck, a restrictive limit on the data bandwidth between CPU and RAM. This paper introduces a new approach to computing we call AHaH computing where memory and processing are combined. The idea is based on the attractor dynamics of volatile dissipative electronics inspired by biological systems, presenting an attractive alternative architecture that is able to adapt, self-repair, and learn from interactions with the environment. We envision that both von Neumann and AHaH computing architectures will operate together on the same machine, but that the AHaH computing processor may reduce the power consumption and processing time for certain adaptive learning tasks by orders of magnitude. The paper begins by drawing a connection between the properties of volatility, thermodynamics, and Anti-Hebbian and Hebbian (AHaH) plasticity. We show how AHaH synaptic plasticity leads to attractor states that extract the independent components of applied data streams and how they form a computationally complete set of logic functions. After introducing a general memristive device model based on collections of metastable switches, we show how adaptive synaptic weights can be formed from differential pairs of incremental memristors. We also disclose how arrays of synaptic weights can be used to build a neural node circuit operating AHaH plasticity. By configuring the attractor states of the AHaH node in different ways, high level machine learning functions are demonstrated. This includes unsupervised clustering, supervised and unsupervised classification, complex signal prediction, unsupervised robotic actuation and combinatorial optimization of procedures–all key capabilities of biological nervous systems and modern machine learning algorithms with real world application. [ABSTRACT FROM AUTHOR]

Natural animals are renowned for their ability to acquire a diverse and general skill set over the course of their lifetime. However, research in artificial intelligence has yet to produce agents that acquire all or even most of the available skills in non-trivial environments. One candidate algorithm for encouraging the production of such individuals is Novelty Search, which pressures organisms to exhibit different behaviors from other individuals. However, we hypothesized that Novelty Search would produce sub-populations of specialists, in which each individual possesses a subset of skills, but no one organism acquires all or most of the skills. In this paper, we propose a new algorithm called Curiosity Search, which is designed to produce individuals that acquire as many skills as possible during their lifetime. We show that in a multiple-skill maze environment, Curiosity Search does produce individuals that explore their entire domain, while a traditional implementation of Novelty Search produces specialists. However, we reveal that when modified to encourage intra-life behavioral diversity, Novelty Search can produce organisms that explore almost as much of their environment as Curiosity Search, although Curiosity Search retains a significant performance edge. Finally, we show that Curiosity Search is a useful helper objective when combined with Novelty Search, producing individuals that acquire significantly more skills than either algorithm alone. [ABSTRACT FROM AUTHOR]

In this paper, we present a functional spiking-neuron model of human working memory (WM). This model combines neural firing for encoding of information with activity-silent maintenance. While it used to be widely assumed that information in WM is maintained through persistent recurrent activity, recent studies have shown that information can be maintained without persistent firing; instead, information can be stored in activity-silent states. A candidate mechanism underlying this type of storage is short-term synaptic plasticity (STSP), by which the strength of connections between neurons rapidly changes to encode new information. To demonstrate that STSP can lead to functional behavior, we integrated STSP by means of calcium-mediated synaptic facilitation in a large-scale spiking-neuron model and added a decision mechanism. The model was used to simulate a recent study that measured behavior and EEG activity of participants in three delayed-response tasks. In these tasks, one or two visual gratings had to be maintained in WM, and compared to subsequent probes. The original study demonstrated that WM contents and its priority status could be decoded from neural activity elicited by a task-irrelevant stimulus displayed during the activity-silent maintenance period. In support of our model, we show that it can perform these tasks, and that both its behavior as well as its neural representations are in agreement with the human data. We conclude that information in WM can be effectively maintained in activity-silent states by means of calcium-mediated STSP. Author summary: Mentally maintaining information for short periods of time in working memory is crucial for human adaptive behavior. It was recently shown that the human brain does not only store information through neural firing–as was widely believed–but also maintains information in activity-silent states. Here, we present a detailed neural model of how this could happen in our brain through short-term synaptic plasticity: rapidly adapting the connection strengths between neurons in response to incoming information. By reactivating the adapted network, the stored information can be read out later. We show that our model can perform three working memory tasks as accurately as human participants can, while using similar mental representations. We conclude that our model is a plausible and effective neural implementation of human working memory. [ABSTRACT FROM AUTHOR]

Calcium imaging has been widely used for measuring spiking activities of neurons. When using calcium imaging, we need to extract summarized information from the raw movie beforehand. Recent studies have used matrix deconvolution for this preprocessing. However, such an approach can neither directly estimate the generative mechanism of spike trains nor use stimulus information that has a strong influence on neural activities. Here, we propose a new deconvolution method for calcium imaging using marked point processes. We consider that the observed movie is generated from a probabilistic model with marked point processes as hidden variables, and we calculate the posterior of these variables using a variational inference approach. Our method can simultaneously estimate various kinds of information, such as cell shape, spike occurrence time, and tuning curve. We apply our method to simulated and experimental data to verify its performance. Author summary: Calcium imaging is a promising technique that enables the observation of the activities of large neural populations as a movie. Since the measured movie is a large-scale dataset containing a considerable amount of information, we need to apply a preprocessing procedure to extract crucial information from the raw movie for the analysis that follows. Recent studies have adopted matrix decomposition to decompose the observed movie into the product of two matrices: one consisting of cell shapes and the other consisting of calcium florescent time series. This approach can estimate cell locations and activities simultaneously; however, it cannot express some aspects of neural population codes. For instance, this approach cannot incorporate other covariates that may affect the neural population activities. In this paper, we propose a new statistical model for calcium imaging movies and an estimation procedure for this model. To express the random occurrence of spikes occurring in the movie, our model adopts a marked point process, which is used to express sequences of events to which certain characteristic values are attached. Our model can estimate cell shapes, spikes, and tuning curves of cells directly without any additional preprocessing procedure, and it also improves the estimation accuracy compared to the conventional approach. [ABSTRACT FROM AUTHOR]

Intelligent Transportation Systems rely on understanding, predicting and affecting the interactions between vehicles. The goal of this paper is to choose a small subset from the larger set so that the resulting regression model is simple, yet have good predictive ability for Vehicle agent speed relative to Vehicle intruder. The method of ANFIS (adaptive neuro fuzzy inference system) was applied to the data resulting from these measurements. The ANFIS process for variable selection was implemented in order to detect the predominant variables affecting the prediction of agent speed relative to intruder. This process includes several ways to discover a subset of the total set of recorded parameters, showing good predictive capability. The ANFIS network was used to perform a variable search. Then, it was used to determine how 9 parameters (Intruder Front sensors active (boolean), Intruder Rear sensors active (boolean), Agent Front sensors active (boolean), Agent Rear sensors active (boolean), RSSI signal intensity/strength (integer), Elapsed time (in seconds), Distance between Agent and Intruder (m), Angle of Agent relative to Intruder (angle between vehicles °), Altitude difference between Agent and Intruder (m)) influence prediction of agent speed relative to intruder. The results indicated that distance between Vehicle agent and Vehicle intruder (m) and angle of Vehicle agent relative to Vehicle Intruder (angle between vehicles °) is the most influential parameters to Vehicle agent speed relative to Vehicle intruder. [ABSTRACT FROM AUTHOR]

The spiking neural networks (SNNs) are the third generation of neural networks and perform remarkably well in cognitive tasks such as pattern recognition. The spike emitting and information processing mechanisms found in biological cognitive systems motivate the application of the hierarchical structure and temporal encoding mechanism in spiking neural networks, which have exhibited strong computational capability. However, the hierarchical structure and temporal encoding approach require neurons to process information serially in space and time respectively, which reduce the training efficiency significantly. For training the hierarchical SNNs, most existing methods are based on the traditional back-propagation algorithm, inheriting its drawbacks of the gradient diffusion and the sensitivity on parameters. To keep the powerful computation capability of the hierarchical structure and temporal encoding mechanism, but to overcome the low efficiency of the existing algorithms, a new training algorithm, the Normalized Spiking Error Back Propagation (NSEBP) is proposed in this paper. In the feedforward calculation, the output spike times are calculated by solving the quadratic function in the spike response model instead of detecting postsynaptic voltage states at all time points in traditional algorithms. Besides, in the feedback weight modification, the computational error is propagated to previous layers by the presynaptic spike jitter instead of the gradient decent rule, which realizes the layer-wised training. Furthermore, our algorithm investigates the mathematical relation between the weight variation and voltage error change, which makes the normalization in the weight modification applicable. Adopting these strategies, our algorithm outperforms the traditional SNN multi-layer algorithms in terms of learning efficiency and parameter sensitivity, that are also demonstrated by the comprehensive experimental results in this paper. [ABSTRACT FROM AUTHOR]

In high efficiency video coding (HEVC), coding tree contributes to excellent compression performance. However, coding tree brings extremely high computational complexity. Innovative works for improving coding tree to further reduce encoding time are stated in this paper. A novel low complexity coding tree mechanism is proposed for HEVC fast coding unit (CU) encoding. Firstly, this paper makes an in-depth study of the relationship among CU distribution, quantization parameter (QP) and content change (CC). Secondly, a CU coding tree probability model is proposed for modeling and predicting CU distribution. Eventually, a CU coding tree probability update is proposed, aiming to address probabilistic model distortion problems caused by CC. Experimental results show that the proposed low complexity CU coding tree mechanism significantly reduces encoding time by 27% for lossy coding and 42% for visually lossless coding and lossless coding. The proposed low complexity CU coding tree mechanism devotes to improving coding performance under various application conditions. [ABSTRACT FROM AUTHOR]

Hepatitis B virus (HBV) infection is a global public health issue. We offer a comprehensive analysis of the dynamics of HBV, which can be successfully controlled with vaccine and treatment. Hepatitis B virus (HBV) causes a significantly more severe and protracted disease compared to hepatitis A. While it initially presents as an acute disease, in approximately 5 to 10% of cases, it can develop into a chronic disease that causes permanent damage to the liver. The hepatitis B virus can remain active outside the body for at least seven days. If the virus penetrates an individual's body without immunization, it may still result in infection. Upon exposure to HBV, the symptoms often last for a duration ranging from 10 days to 6 months. In this study, we developed a new model for Hepatitis B Virus (HBV) that includes asymptomatic carriers, vaccination, and treatment classes to gain a comprehensive knowledge of HBV dynamics. The basic reproduction number R0 is calculated to identify future recurrence. The local and global stabilities of the proposed model are evaluated for values of R0 that are both below and above 1. The Lyapunov function is employed to ensure the global stability of the HBV model. Further, the existence and uniqueness of the proposed model are demonstrated. To look at the solution of the proposed model graphically, we used a useful numerical strategy, such as the non-standard finite difference method, to obtain more thorough numerical findings for the parameters that have a significant impact on disease elimination. In addition, the study of treatment class in the population, we may assess the effectiveness of alternative medicines to treat infected populations can be determined. Numerical simulations and graphical representations are employed to illustrate the implications of our theoretical conclusions. [ABSTRACT FROM AUTHOR]

Single-point incremental forming (SPIF) is a technology that allows incremental manufacturing of complex parts from a flat sheet using simple tools; further, this technology is flexible and economical. Measuring the forming force using this technology helps in preventing failures, determining the optimal processes, and implementing on-line control. In this paper, an experimental study using SPIF is described. This study focuses on the influence of four different process parameters, namely, step size, tool diameter, sheet thickness, and feed rate, on the maximum forming force. For an efficient force predictive model based on an adaptive neuro-fuzzy inference system (ANFIS), an artificial neural network (ANN) and a regressions model were applied. The predicted forces exhibited relatively good agreement with the experimental results. The results indicate that the performance of the ANFIS model realizes the full potential of the ANN model. [ABSTRACT FROM AUTHOR]

BACKGROUND: The assessment of bone age and skeletal maturity and its comparison to chronological age is an important task in the medical environment for the diagnosis of pediatric endocrinology, orthodontics and orthopedic disorders, and legal environment in what concerns if an individual is a minor or not when there is a lack of documents. Being a time-consuming activity that can be prone to inter- and intra-rater variability, the use of methods which can automate it, like Machine Learning techniques, is of value. OBJECTIVE: The goal of this paper is to present the state of the art evidence, trends and gaps in the research related to bone age assessment studies that make use of Machine Learning techniques. METHOD: A systematic literature review was carried out, starting with the writing of the protocol, followed by searches on three databases: Pubmed, Scopus and Web of Science to identify the relevant evidence related to bone age assessment using Machine Learning techniques. One round of backward snowballing was performed to find additional studies. A quality assessment was performed on the selected studies to check for bias and low quality studies, which were removed. Data was extracted from the included studies to build summary tables. Lastly, a meta-analysis was performed on the performances of the selected studies. RESULTS: 26 studies constituted the final set of included studies. Most of them proposed automatic systems for bone age assessment and investigated methods for bone age assessment based on hand and wrist radiographs. The samples used in the studies were mostly comprehensive or bordered the age of 18, and the data origin was in most of cases from United States and West Europe. Few studies explored ethnic differences. CONCLUSIONS: There is a clear focus of the research on bone age assessment methods based on radiographs whilst other types of medical imaging without radiation exposure (e.g. magnetic resonance imaging) are not much explored in the literature. Also, socioeconomic and other aspects that could influence in bone age were not addressed in the literature. Finally, studies that make use of more than one region of interest for bone age assessment are scarce. [ABSTRACT FROM AUTHOR]

Demand for spring onion seeds is variable and maintaining its supply is crucial to the success of seed companies. Spring onion seed demand forecasting, which can help reduce the high operational costs increased by long-period propagation and complex logistics, has not previously been investigated yet. This paper provides a novel perspective on spring onion seed demand forecasting and proposes a hybrid Holt-Winters and support vector machine (SVM) forecasting model. The model uses dynamic factors, including historical seed sales, seed inventory, spring onion crop market price and weather data, as inputs to forecast spring onion seed demand. Forecasting error, i.e. the difference between actual and forecasted demand, is assessed. Two advanced machine learning models are trained on the same dataset as benchmark models. Numerical experiments using actual commercial sales data for three spring onion seed varieties show the proposed hybrid model outperformed the statistical-based models for all three forecasting errors. Seed inventory, spring onion crop market price and historical seed sales are the most important dynamic factors, among which seed inventory has short-term influence while other two have mid-term influence on seed demand forecasting. The absolute minimum temperature is the only factor having long-term influence. This study provides a promising spring onion seed demand forecasting model that helps understand the relationships between seed demand and other dynamic factors and the model could potentially be applied to demand forecasting of other crop seeds to reduce total operational costs. [ABSTRACT FROM AUTHOR]

The olfactory system faces the difficult task of identifying an enormous variety of odors independent of their intensity. Primacy coding, where the odor identity is encoded by the receptor types that respond earliest, might provide a compact and informative representation that can be interpreted efficiently by the brain. In this paper, we analyze the information transmitted by a simple model of primacy coding using numerical simulations and statistical descriptions. We show that the encoded information depends strongly on the number of receptor types included in the primacy representation, but only weakly on the size of the receptor repertoire. The representation is independent of the odor intensity and the transmitted information is useful to perform typical olfactory tasks with close to experimentally measured performance. Interestingly, we find situations in which a smaller receptor repertoire is advantageous for discriminating odors. The model also suggests that overly sensitive receptor types could dominate the entire response and make the whole array useless, which allows us to predict how receptor arrays need to adapt to stay useful during environmental changes. Taken together, we show that primacy coding is more useful than simple binary and normalized coding, essentially because the sparsity of the odor representations is independent of the odor statistics, in contrast to the alternatives. Primacy coding thus provides an efficient odor representation that is independent of the odor intensity and might thus help to identify odors in the olfactory cortex. [ABSTRACT FROM AUTHOR]

Antenna selection in Multiple-Input Multiple-Output (MIMO) systems has attracted increasing attention due to the challenge of keeping a balance between communication performance and computational complexity. Recently, deep learning based methods have achieved promising performance in many application fields. This paper proposed a deep learning (DL) based antenna selection technique. First, we generated the label of training antenna systems by maximizing the channel capacity. Then, we adopted the deep convolutional neural network (CNN) on the channel matrices to explicitly exploit the massive latent cues of attenuation coefficients. Finally, we used the adopted CNN to assign the class label and then select the optimal antenna subset. Experimental results demonstrate that our method can achieve better performance than the state-of-the-art baselines for data-driven based antenna selection. [ABSTRACT FROM AUTHOR]

The fragile ecological environment near mines provide advantageous conditions for the development of landslides. Mine landslide susceptibility mapping is of great importance for mine geo-environment control and restoration planning. In this paper, a total of 493 landslides in Shangli County, China were collected through historical landslide inventory. 16 spectral, geomorphic and hydrological predictive factors, mainly derived from Landsat 8 imagery and Global Digital Elevation Model (ASTER GDEM), were prepared initially for landslide susceptibility assessment. Predictive capability of these factors was evaluated by using the value of variance inflation factor and information gain ratio. Three models, namely artificial neural network (ANN), support vector machine (SVM) and information value model (IVM), were applied to assess the mine landslide sensitivity. The receiver operating characteristic curve (ROC) and rank probability score were used to validate and compare the comprehensive predictive capabilities of three models involving uncertainty. Results showed that ANN model achieved higher prediction capability, proving its advantage of solve nonlinear and complex problems. Comparing the estimated landslide susceptibility map with the ground-truth one, the high-prone area tends to be located in the middle area with multiple fault distributions and the steeply sloped hill. [ABSTRACT FROM AUTHOR]

Urban change (urbanization) has dominated land change science for several decades. However, few studies have focused on what many scholars call the urban densification process (i.e., urban intensity expansion) despite its importance to both planning and subsequent impacts to the environment and local economies. This paper documents past urban densification patterns and uses this information to predict future densification trends in southeastern Wisconsin (SEWI) by using a rich dataset from the United States and by adapting the well-known Land Transformation Model (LTM) for this purpose. Urban densification is a significant and progressive process that often accompanies urbanization more generally. The increasing proportion of lower density areas, rather than higher density areas, was the main characteristic of the urban densification in SEWI from 2001 to 2011. We believe that improving urban land use efficiency to maintain rational densification are effective means toward a sustainable urban landscape. Multiple goodness-of-fit metrics demonstrated that the reconfigured LTM performed relatively well to simulate urban densification patterns in 2006 and 2011, enabling us to forecast densification to 2016 and 2021. The predicted future urban densification patterns are likely to be characterized by higher densities continue to increase at the expense of lower densities. We argue that detailed categories of urban density and specific relevant predictor variables are indispensable for densification prediction. Our study provides researchers working in land change science with important insights into urban densification process modeling. The outcome of this model can help planners to identify the current trajectory of urban development, enabling them to take informed action to promote planning objectives, which could benefit sustainable urbanization definitely. [ABSTRACT FROM AUTHOR]

It is evident through biology research that, biological neural network could be implemented through two means: by congenital heredity, or by posteriority learning. However, traditionally, artificial neural network, especially the Deep learning Neural Networks (DNNs) are implemented only through exhaustive training and learning. Fixed structure is built, and then parameters are trained through huge amount of data. In this way, there are a lot of redundancies in the implemented artificial neural network. This redundancy not only requires more effort to train the network, but also costs more computing resources when used. In this paper, we proposed a bionic way to implement artificial neural network through construction rather than training and learning. The hierarchy of the neural network is designed according to analysis of the required functionality, and then module design is carried out to form each hierarchy. We choose the Drosophila’s visual neural network as a test case to verify our method’s validation. The results show that the bionic artificial neural network built through our method could work as a bionic compound eye, which can achieve the detection of the object and their movement, and the results are better on some properties, compared with the Drosophila’s biological compound eyes. [ABSTRACT FROM AUTHOR]

Health care organizations are leveraging machine-learning techniques, such as artificial neural networks (ANN), to improve delivery of care at a reduced cost. Applications of ANN to diagnosis are well-known; however, ANN are increasingly used to inform health care management decisions. We provide a seminal review of the applications of ANN to health care organizational decision-making. We screened 3,397 articles from six databases with coverage of Health Administration, Computer Science and Business Administration. We extracted study characteristics, aim, methodology and context (including level of analysis) from 80 articles meeting inclusion criteria. Articles were published from 1997–2018 and originated from 24 countries, with a plurality of papers (26 articles) published by authors from the United States. Types of ANN used included ANN (36 articles), feed-forward networks (25 articles), or hybrid models (23 articles); reported accuracy varied from 50% to 100%. The majority of ANN informed decision-making at the micro level (61 articles), between patients and health care providers. Fewer ANN were deployed for intra-organizational (meso- level, 29 articles) and system, policy or inter-organizational (macro- level, 10 articles) decision-making. Our review identifies key characteristics and drivers for market uptake of ANN for health care organizational decision-making to guide further adoption of this technique. [ABSTRACT FROM AUTHOR]

With the growing body of research on traumatic brain injury and spinal cord injury, computational neuroscience has recently focused its modeling efforts on neuronal functional deficits following mechanical loading. However, in most of these efforts, cell damage is generally only characterized by purely mechanistic criteria, functions of quantities such as stress, strain or their corresponding rates. The modeling of functional deficits in neurites as a consequence of macroscopic mechanical insults has been rarely explored. In particular, a quantitative mechanically based model of electrophysiological impairment in neuronal cells, Neurite, has only very recently been proposed. In this paper, we present the implementation details of this model: a finite difference parallel program for simulating electrical signal propagation along neurites under mechanical loading. Following the application of a macroscopic strain at a given strain rate produced by a mechanical insult, Neurite is able to simulate the resulting neuronal electrical signal propagation, and thus the corresponding functional deficits. The simulation of the coupled mechanical and electrophysiological behaviors requires computational expensive calculations that increase in complexity as the network of the simulated cells grows. The solvers implemented in Neurite—explicit and implicit—were therefore parallelized using graphics processing units in order to reduce the burden of the simulation costs of large scale scenarios. Cable Theory and Hodgkin-Huxley models were implemented to account for the electrophysiological passive and active regions of a neurite, respectively, whereas a coupled mechanical model accounting for the neurite mechanical behavior within its surrounding medium was adopted as a link between electrophysiology and mechanics. This paper provides the details of the parallel implementation of Neurite, along with three different application examples: a long myelinated axon, a segmented dendritic tree, and a damaged axon. The capabilities of the program to deal with large scale scenarios, segmented neuronal structures, and functional deficits under mechanical loading are specifically highlighted. [ABSTRACT FROM AUTHOR]

Pneumonia is one of the major causes of child mortality, yet with a timely diagnosis, it is usually curable with antibiotic therapy. In many developing regions, diagnosing pneumonia remains a challenge, due to shortages of medical resources. Lung ultrasound has proved to be a useful tool to detect lung consolidation as evidence of pneumonia. However, diagnosis of pneumonia by ultrasound has limitations: it is operator-dependent, and it needs to be carried out and interpreted by trained personnel. Pattern recognition and image analysis is a potential tool to enable automatic diagnosis of pneumonia consolidation without requiring an expert analyst. This paper presents a method for automatic classification of pneumonia using ultrasound imaging of the lungs and pattern recognition. The approach presented here is based on the analysis of brightness distribution patterns present in rectangular segments (here called “characteristic vectors“) from the ultrasound digital images. In a first step we identified and eliminated the skin and subcutaneous tissue (fat and muscle) in lung ultrasound frames, and the “characteristic vectors”were analyzed using standard neural networks using artificial intelligence methods. We analyzed 60 lung ultrasound frames corresponding to 21 children under age 5 years (15 children with confirmed pneumonia by clinical examination and X-rays, and 6 children with no pulmonary disease) from a hospital based population in Lima, Peru. Lung ultrasound images were obtained using an Ultrasonix ultrasound device. A total of 1450 positive (pneumonia) and 1605 negative (normal lung) vectors were analyzed with standard neural networks, and used to create an algorithm to differentiate lung infiltrates from healthy lung. A neural network was trained using the algorithm and it was able to correctly identify pneumonia infiltrates, with 90.9% sensitivity and 100% specificity. This approach may be used to develop operator-independent computer algorithms for pneumonia diagnosis using ultrasound in young children. [ABSTRACT FROM AUTHOR]

Speech recognition (SR) has been improved significantly by artificial neural networks (ANNs), but ANNs have the drawbacks of biologically implausibility and excessive power consumption because of the nonlocal transfer of real-valued errors and weights. While spiking neural networks (SNNs) have the potential to solve these drawbacks of ANNs due to their efficient spike communication and their natural way to utilize kinds of synaptic plasticity rules found in brain for weight modification. However, existing SNN models for SR either had bad performance, or were trained in biologically implausible ways. In this paper, we present a biologically inspired convolutional SNN model for SR. The network adopts the time-to-first-spike coding scheme for fast and efficient information processing. A biological learning rule, spike-timing-dependent plasticity (STDP), is used to adjust the synaptic weights of convolutional neurons to form receptive fields in an unsupervised way. In the convolutional structure, the strategy of local weight sharing is introduced and could lead to better feature extraction of speech signals than global weight sharing. We first evaluated the SNN model with a linear support vector machine (SVM) on the TIDIGITS dataset and it got the performance of 97.5%, comparable to the best results of ANNs. Deep analysis on network outputs showed that, not only are the output data more linearly separable, but they also have fewer dimensions and become sparse. To further confirm the validity of our model, we trained it on a more difficult recognition task based on the TIMIT dataset, and it got a high performance of 93.8%. Moreover, a linear spike-based classifier—tempotron—can also achieve high accuracies very close to that of SVM on both the two tasks. These demonstrate that an STDP-based convolutional SNN model equipped with local weight sharing and temporal coding is capable of solving the SR task accurately and efficiently. [ABSTRACT FROM AUTHOR]

Background: Drosophila heart tube is a feasible model for cardiac physiological research. However, obtaining Drosophila electrocardiograms (ECGs) is difficult, due to the weak signals and limited contact area to apply electrodes. This paper presents a non-invasive Gallium-Indium (GaIn) based recording system for Drosophila ECG measurement, providing the heart rate and heartbeat features to be observed. This novel, high-signal-quality system prolongs the recording time of insect ECGs, and provides a feasible platform for research on the molecular mechanisms involved in cardiovascular diseases. Methods: In this study, two types of electrode, tungsten needle probes and GaIn electrodes, were used respectively to noiselessly conduct invasive and noninvasive ECG recordings of Drosophila. To further analyze electrode properties, circuit models were established and simulated. By using electromagnetic shielded heart signal acquiring system, consisted of analog amplification and digital filtering, the ECG signals of three phenotypes that have different heart functions were recorded without dissection. Results and Discussion: The ECG waveforms of different phenotypes of Drosophila recorded invasively and repeatedly with n value (n>5) performed obvious difference in heart rate. In long period ECG recordings, non-invasive method implemented by GaIn electrodes acts relatively stable in both amplitude and period. To analyze GaIn electrode, the correctness of GaIn electrode model established by this paper was validated, presenting accuracy, stability, and reliability. Conclusions: Noninvasive ECG recording by GaIn electrodes was presented for recording Drosophila pupae ECG signals within a limited contact area and signal strength. Thus, the observation of ECG changes in normal and SERCA-depleted Drosophila over an extended period is feasible. This method prolongs insect survival time while conserving major ECG features, and provides a platform for electrophysiological signal research on the molecular mechanism involved in cardiac arrhythmia, as well as research related to drug screening and development. [ABSTRACT FROM AUTHOR]

In mammals, the developmental path that links the primary behaviours observed during foetal stages to the full fledged behaviours observed in adults is still beyond our understanding. Often theories of motor control try to deal with the process of incremental learning in an abstract and modular way without establishing any correspondence with the mammalian developmental stages. In this paper, we propose a computational model that links three distinct behaviours which appear at three different stages of development. In order of appearance, these behaviours are: spontaneous motor activity (SMA), reflexes, and coordinated behaviours, such as locomotion. The goal of our model is to address in silico four hypotheses that are currently hard to verify in vivo: First, the hypothesis that spinal reflex circuits can be self-organized from the sensor and motor activity induced by SMA. Second, the hypothesis that supraspinal systems can modulate reflex circuits to achieve coordinated behaviour. Third, the hypothesis that, since SMA is observed in an organism throughout its entire lifetime, it provides a mechanism suitable to maintain the reflex circuits aligned with the musculoskeletal system, and thus adapt to changes in body morphology. And fourth, the hypothesis that by changing the modulation of the reflex circuits over time, one can switch between different coordinated behaviours. Our model is tested in a simulated musculoskeletal leg actuated by six muscles arranged in a number of different ways. Hopping is used as a case study of coordinated behaviour. Our results show that reflex circuits can be self-organized from SMA, and that, once these circuits are in place, they can be modulated to achieve coordinated behaviour. In addition, our results show that our model can naturally adapt to different morphological changes and perform behavioural transitions. [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]

Background: Living systems are associated with Social networks — networks made up of nodes, some of which may be more important in various aspects as compared to others. While different quantitative measures labeled as “centralities” have previously been used in the network analysis community to find out influential nodes in a network, it is debatable how valid the centrality measures actually are. In other words, the research question that remains unanswered is: how exactly do these measures perform in the real world? So, as an example, if a centrality of a particular node identifies it to be important, is the node actually important? Purpose: The goal of this paper is not just to perform a traditional social network analysis but rather to evaluate different centrality measures by conducting an empirical study analyzing exactly how do network centralities correlate with data from published multidisciplinary network data sets. Method: We take standard published network data sets while using a random network to establish a baseline. These data sets included the Zachary's Karate Club network, dolphin social network and a neural network of nematode Caenorhabditis elegans. Each of the data sets was analyzed in terms of different centrality measures and compared with existing knowledge from associated published articles to review the role of each centrality measure in the determination of influential nodes. Results: Our empirical analysis demonstrates that in the chosen network data sets, nodes which had a high Closeness Centrality also had a high Eccentricity Centrality. Likewise high Degree Centrality also correlated closely with a high Eigenvector Centrality. Whereas Betweenness Centrality varied according to network topology and did not demonstrate any noticeable pattern. In terms of identification of key nodes, we discovered that as compared with other centrality measures, Eigenvector and Eccentricity Centralities were better able to identify important nodes. [ABSTRACT FROM AUTHOR]

Cortical circuits in the brain have long been recognised for their information processing capabilities and have been studied both experimentally and theoretically via spiking neural networks. Neuromorphic engineers are primarily concerned with translating the computational capabilities of biological cortical circuits, using the Spiking Neural Network (SNN) paradigm, into in silico applications that can mimic the behaviour and capabilities of real biological circuits/systems. These capabilities include low power consumption, compactness, and relevant dynamics. In this paper, we propose a new accelerated-time circuit that has several advantages over its previous neuromorphic counterparts in terms of compactness, power consumption, and capability to mimic the outcomes of biological experiments. The presented circuit simulation results demonstrate that, in comparing the new circuit to previous published synaptic plasticity circuits, reduced silicon area and lower energy consumption for processing each spike is achieved. In addition, it can be tuned in order to closely mimic the outcomes of various spike timing- and rate-based synaptic plasticity experiments. The proposed circuit is also investigated and compared to other designs in terms of tolerance to mismatch and process variation. Monte Carlo simulation results show that the proposed design is much more stable than its previous counterparts in terms of vulnerability to transistor mismatch, which is a significant challenge in analog neuromorphic design. All these features make the proposed design an ideal circuit for use in large scale SNNs, which aim at implementing neuromorphic systems with an inherent capability that can adapt to a continuously changing environment, thus leading to systems with significant learning and computational abilities. [ABSTRACT FROM AUTHOR]

This paper examines a biologically-inspired representation technique designed for the support of sensory-motor learning in developmental robotics. An interesting feature of the many topographic neural sheets in the brain is that closely packed receptive fields must overlap in order to fully cover a spatial region. This raises interesting scientific questions with engineering implications: e.g. is overlap detrimental? does it have any benefits? This paper examines the effects and properties of overlap between elements arranged in arrays or maps. In particular we investigate how overlap affects the representation and transmission of spatial location information on and between topographic maps. Through a series of experiments we determine the conditions under which overlap offers advantages and identify useful ranges of overlap for building mappings in cognitive robotic systems. Our motivation is to understand the phenomena of overlap in order to provide guidance for application in sensory-motor learning robots. [ABSTRACT FROM AUTHOR]