Community structure and modularity in networks of correlated brain activity

Functional connectivity patterns derived from neuroimaging data may be represented as graphs or networks, with individual image voxels or anatomically-defined structures representing the nodes, and a measure of correlation between the responses in each pair of nodes determining the edges. This explicit network representation allows network-analysis approaches to be applied to the characterization of functional connections within the brain. Much recent research in complex networks has focused on methods to identify community structure, i.e. cohesive clusters of strongly interconnected nodes. One class of such algorithms determines a partition of a network into 'sub-networks' based on the optimization of a modularity parameter, thus also providing a measure of the degree of segregation versus integration in the full network. Here, we demonstrate that a community structure algorithm based on the maximization of modularity, applied to a functional connectivity network calculated from the responses to acute fluoxetine challenge in the rat, can identify communities whose distributions correspond to anatomically meaningful structures and include compelling functional subdivisions in the brain. We also discuss the biological interpretation of the modularity parameter in terms of segregation and integration of brain function.     

Reliable computing with unreliable components: Using separable environments to stabilize long-term information storage

How, in the face of both intrinsic and extrinsic volatility, can unconventional computing fabrics store information over arbitrarily long periods? Here, we argue that the predictable structure of many realistic environments, both natural and artificial, can be used to maintain useful categorical boundaries even when the computational fabric itself is inherently volatile and the inputs and outputs are partially stochastic. As a concrete example, we consider the storage of binary classifications in connectionist networks, although the underlying principles should be applicable to other unconventional computing paradigms. Specifically, we demonstrate that an unsupervised, activity dependent plasticity rule, AHAH (Anti-Hebbian-And-Hebbian), allows binary classifications to remain stable even when the underlying synaptic weights are subject to random noise. When embedded in environments composed of separable features, the weight vector is restricted by the AHAH rule to local attractors representing stable partitions of the input space, allowing unsupervised recovery of stored binary classifications following random perturbations that leave the system in the same basin of attraction. We conclude that the stability of long-term memories may depend not so much on the reliability of the underlying substrate, but rather on the reproducible structure of the environment itself, suggesting a new paradigm for reliable computing with unreliable components.     

利用BP神经网络光谱分类法研究肉品新鲜度

利用自行设计的一种光纤探头式生物表面光谱测试系统 ,对肉品进行测量。建立用于肉品新鲜度的自动分类和识别的 BP神经网络 ,准确率达到 93.3%。试验表明 ,利用光谱分析法测量肉品的新鲜度快捷、准确 ,可用于实际肉品检测     

Simultaneous Determination of Multicomponents in Air Toxic Organic Compounds Using Artificial Neural Networks in Ftir Spectroscopy

The application of Artificial Neural Networks (ANNs) for nonlinear multivariate calibration using simulated FTIR data was demonstrated in this paper. Neural networks consisting of three layers of nodes were trained by using the back-propagation learning rule. Since parameters affect the performance of the network greatly, simulated data were used to train the network in order to get a satisfactory combination of all parameters. The mixtures of four air toxic organic compounds whose FTIR spectra are overlapped were chosen to evaluate the calibration and prediction ability of the network. The relative standard error (RSD%), the percent standard error of prediction samples (%SEP) and the percent standard error of calibration samples (%SEC) are used for evaluating the ability of the neural network.     

Entangled network and quantum communication

A theoretical scheme is introduced to generate entangled network via Dzyaloshinskii-Moriya (DM) interaction. The dynamics of entanglement between different nodes, which is generated by direct or indirect interaction, is investigated. It is shown that, the direction of (DM) interaction and the locations of the nodes have a sensational effect on the degree of entanglement. The minimum entanglement generated between all the nodes is quantified. The upper and lower bounds of the entanglement depend on the direction of DM interaction, and the repetition of the behavior depends on the strength of DM. The generated entangled nodes are used as quantum channel to perform quantum teleportation, where it is shown that the fidelity of teleporting unknown information between the network members depends on the locations of the members.     

An efficient statistics-based method for the automated detection of sperm whale clicks

In this paper, we present a new method for the automated detection of sperm whale regular clicks and creaks based on statistical computations. In the first stage, a spectrogram is computed from the input waveform, followed by a noise normalisation process. A frequency domain filter is then applied, and the energy accumulated in each time frame is calculated. Two-second time-windows are then classified as containing either regular clicks, creaks, or noise based on statistical parameters using a neural network classifier. Finally, previously obtained statistical parameters are used to implement an energy-based detection criterion for the classified time-windows. Individual regular clicks and creaks are isolated by linking contiguous detected time frames. The proposed method was tested on five recordings of sperm whale sounds. Comparison of the detection performances to hand-labelled regular clicks and creaks revealed that this method outperforms two recently reported waveform-based methods when working with the same recordings files. An average percentage of detection of 86.97% was attained for the set of files. This method consumes also little computation time.     

A combinatorial interior point method for network flow problems

For solving minimum cost flow problems, we develop a combinatorial interior point method based on a variant of the algorithm of Karmarkar, described in Gonzaga [3, 4]. Gonzaga proposes search directions generated by projecting certain directions onto the nullspace ofA. By the special combinatorial structure of networks any projection onto the nullspace ofA can be interpreted as a flow in the incremental graph ofG. In particular, to evaluate the new search direction, it is sufficient to choose a negative circuit subject to costs on the arcs depending on the current solution. That approach results in an O(mn ² L) algorithm wherem denotes the number of vertices,n denotes the number of arcs, andL denotes the total length of the input data.     

贷款分配方法的数学模型及其解法

为了解决三角债问题，银行给出一笔贷款，应该如何分配这笔贷款，使清理的债务达到最大。本文建立这个问题的数学模型，并且给出一个解法。     

Scheduling in network flow shops

We consider the general problem of static scheduling of a set of jobs in a network flow shop. In network flow shops, the scheduler not only has to sequence and schedule but also must concurrently determine the process routing of the jobs through the shop. In this paper, we establish the computational complexity of this new class of scheduling problem and propose a general purpose heuristic procedure. The performance of the heuristic is analyzed when makespan, cycle time and average flow time are the desired objectives.This research has been supported by the UCLA Academic Senate Grant #95.