Radial basis function neural networks applied to NASA SSME data
Wheeler, Kevin R.; Dhawan, Atam P.
1993-01-01
This paper presents a brief report on the application of Radial Basis Function Neural Networks (RBFNN) to the prediction of sensor values for fault detection and diagnosis of the Space Shuttle's Main Engines (SSME). The location of the Radial Basis Function (RBF) node centers was determined with a K-means clustering algorithm. A neighborhood operation about these center points was used to determine the variances of the individual processing notes.
Implementation of Radial Basis Function Neural Network for Image Steganalysis
Sambasiva Rao Baragada; S. Ramakrishna; M.S. Rao; S. Purushothaman
2008-01-01
Steganographic tools and techniques are becoming more potential and widespread. Illegal use of steganography poses serious challenges to the law enforcement agencies. Limited work has been carried out on supervised steganalysis using neural network as a classifier. We present a combined method of identifying the presence of covert information in a carrier image using fisherÃ¢â‚¬â„¢s linear discriminant (FLD) function followed by the radial basis function (RBF). Experiments show promising resu...
Learning of Radial Basis Function Networks: Experimental Results
Neruda, Roman
World Scientific and Engineering Society Press, 2002 - (Mastorakis, N.; Mladenov, V.), s. 241-246 ISBN 960-8052-62-9. [World Multi-Conference on Circuits, Systems, Communications and Computeers /6./. Rethymno (GR), 07.07.2002-12.07.2002] R&D Projects: GA ČR GA201/01/1192; GA AV ČR IAB1030006 Institutional research plan: AV0Z1030915 Keywords : radial basis function networks * hybrid learning * soft computing Subject RIV: BA - General Mathematics
Improving Genetic Optimization by Means of Radial Basis Function Networks
Bajer, L.; Holeňa, Martin
Seňa : Pont, 2009 - (Vojtáš, P.). s. 95-96 ISBN 978-80-970179-1-0. [ITAT 2009. Conference on Theory and Practice of Information Theory. 25.09.2009-29.09.2009, Kráľova studňa] Institutional research plan: CEZ:AV0Z10300504 Keywords : black-box optimization * evolutionary optimization * genetic algorithms * surrogate modelling * radial basis function networks Subject RIV: IN - Informatics, Computer Science
Nonlinear Image Restoration Using a Radial Basis Function Network
Iiguni Youji
2004-01-01
Full Text Available We propose a nonlinear image restoration method that uses the generalized radial basis function network (GRBFN and a regularization method. The GRBFN is used to estimate the nonlinear blurring function. The regularization method is used to recover the original image from the nonlinearly degraded image. We alternately use the two estimation methods to restore the original image from the degraded image. Since the GRBFN approximates the nonlinear blurring function itself, the existence of the inverse of the blurring process does not need to be assured. A method of adjusting the regularization parameter according to image characteristics is also presented for improving restoration performance.
Implementation of Radial Basis Function Neural Network for Image Steganalysis
Sambasiva Rao Baragada
2008-09-01
Full Text Available Steganographic tools and techniques are becoming more potential and widespread. Illegal use of steganography poses serious challenges to the law enforcement agencies. Limited work has been carried out on supervised steganalysis using neural network as a classifier. We present a combined method of identifying the presence of covert information in a carrier image using fisherÃ¢â‚¬â„¢s linear discriminant (FLD function followed by the radial basis function (RBF. Experiments show promising results when compared to the existing supervised steganalysis methods, but arranging the retrieved information is still a challenging problem.
An improved radial basis function network for structural reliability analysis
Approximation methods such as response surface method and artificial neural network (ANN) method are widely used to alleviate the computation costs in structural reliability analysis. However most of the ANN methods proposed in the literature suffer various drawbacks such as poor choice of parameter setting, poor generalization and local minimum. In this study, a support vector machine-based radial basis function (RBF) network method is proposed, in which the improved RBF model is used to approximate the limit state function and then is connected to a reliability method to estimate failure probability. Since the learning algorithm of RBF network is replaced by the support vector algorithm, the advantage of the latter, such as good generalization ability and global optimization are propagated to the former, thus the inherent drawback of RBF network can be defeated. Numerical examples are given to demonstrate the applicability of the improved RBF network method in structural reliability analysis, as well as to illustrate the validity and effectiveness of the proposed method
Nonlinear Time Series Forecast Using Radial Basis Function Neural Networks
ZHENG Xin; CHEN Tian-Lun
2003-01-01
In the research of using Radial Basis Function Neural Network (RBF NN) forecasting nonlinear timeseries, we investigate how the different clusterings affect the process of learning and forecasting. We find that k-meansclustering is very suitable. In order to increase the precision we introduce a nonlinear feedback term to escape from thelocal minima of energy, then we use the model to forecast the nonlinear time series which are produced by Mackey-Glassequation and stocks. By selecting the k-means clustering and the suitable feedback term, much better forecasting resultsare obtained.
Nonlinear Time Series Forecast Using Radial Basis Function Neural Networks
ZHENGXin; CHENTian-Lun
2003-01-01
In the research of using Radial Basis Function Neural Network (RBF NN) forecasting nonlinear time series, we investigate how the different clusterings affect the process of learning and forecasting. We find that k-means clustering is very suitable. In order to increase the precision we introduce a nonlinear feedback term to escape from the local minima of energy, then we use the model to forecast the nonlinear time series which are produced by Mackey-Glass equation and stocks. By selecting the k-means clustering and the suitable feedback term, much better forecasting results are obtained.
Dynamics of learning near singularities in radial basis function networks.
Wei, Haikun; Amari, Shun-Ichi
2008-09-01
The radial basis function (RBF) networks are one of the most widely used models for function approximation in the regression problem. In the learning paradigm, the best approximation is recursively or iteratively searched for based on observed data (teacher signals). One encounters difficulties in such a process when two component basis functions become identical, or when the magnitude of one component becomes null. In this case, the number of the components reduces by one, and then the reduced component recovers as the learning process proceeds further, provided such a component is necessary for the best approximation. Strange behaviors, especially the plateau phenomena, have been observed in dynamics of learning when such reduction occurs. There exist singularities in the space of parameters, and the above reduction takes place at the singular regions. This paper focuses on a detailed analysis of the dynamical behaviors of learning near the overlap and elimination singularities in RBF networks, based on the averaged learning equation that is applicable to both on-line and batch mode learning. We analyze the stability on the overlap singularity by solving the eigenvalues of the Hessian explicitly. Based on the stability analysis, we plot the analytical dynamic vector fields near the singularity, which are then compared to those real trajectories obtained by a numeric method. We also confirm the existence of the plateaus in both batch and on-line learning by simulation. PMID:18693082
Three learning phases for radial-basis-function networks.
Schwenker, F; Kestler, H A; Palm, G
2001-05-01
In this paper, learning algorithms for radial basis function (RBF) networks are discussed. Whereas multilayer perceptrons (MLP) are typically trained with backpropagation algorithms, starting the training procedure with a random initialization of the MLP's parameters, an RBF network may be trained in many different ways. We categorize these RBF training methods into one-, two-, and three-phase learning schemes. Two-phase RBF learning is a very common learning scheme. The two layers of an RBF network are learnt separately; first the RBF layer is trained, including the adaptation of centers and scaling parameters, and then the weights of the output layer are adapted. RBF centers may be trained by clustering, vector quantization and classification tree algorithms, and the output layer by supervised learning (through gradient descent or pseudo inverse solution). Results from numerical experiments of RBF classifiers trained by two-phase learning are presented in three completely different pattern recognition applications: (a) the classification of 3D visual objects; (b) the recognition hand-written digits (2D objects); and (c) the categorization of high-resolution electrocardiograms given as a time series (ID objects) and as a set of features extracted from these time series. In these applications, it can be observed that the performance of RBF classifiers trained with two-phase learning can be improved through a third backpropagation-like training phase of the RBF network, adapting the whole set of parameters (RBF centers, scaling parameters, and output layer weights) simultaneously. This, we call three-phase learning in RBF networks. A practical advantage of two- and three-phase learning in RBF networks is the possibility to use unlabeled training data for the first training phase. Support vector (SV) learning in RBF networks is a different learning approach. SV learning can be considered, in this context of learning, as a special type of one-phase learning, where
Neuronal spike sorting based on radial basis function neural networks
Taghavi Kani M
2011-02-01
Full Text Available "nBackground: Studying the behavior of a society of neurons, extracting the communication mechanisms of brain with other tissues, finding treatment for some nervous system diseases and designing neuroprosthetic devices, require an algorithm to sort neuralspikes automatically. However, sorting neural spikes is a challenging task because of the low signal to noise ratio (SNR of the spikes. The main purpose of this study was to design an automatic algorithm for classifying neuronal spikes that are emitted from a specific region of the nervous system."n "nMethods: The spike sorting process usually consists of three stages: detection, feature extraction and sorting. We initially used signal statistics to detect neural spikes. Then, we chose a limited number of typical spikes as features and finally used them to train a radial basis function (RBF neural network to sort the spikes. In most spike sorting devices, these signals are not linearly discriminative. In order to solve this problem, the aforesaid RBF neural network was used."n "nResults: After the learning process, our proposed algorithm classified any arbitrary spike. The obtained results showed that even though the proposed Radial Basis Spike Sorter (RBSS reached to the same error as the previous methods, however, the computational costs were much lower compared to other algorithms. Moreover, the competitive points of the proposed algorithm were its good speed and low computational complexity."n "nConclusion: Regarding the results of this study, the proposed algorithm seems to serve the purpose of procedures that require real-time processing and spike sorting.
Ali Nasrollahnejad
2014-10-01
Full Text Available Recording of ground motions with high amplitudes of acceleration and velocity play a key role for designing engineering projects. Here we try to represent a reasonable prediction of peak ground acceleration which may create more than g acceleration in different regions. In this study, applying different structures of Neural Networks (NN and using four key parameters, moment magnitude, rupture distance, site class, and style of faulting which an earthquake may cause serious effects on a site. We introduced a radial basis function network (RBF with mean error of 0.014, as the best network for estimating the occurrence probability of an earthquake with large value of PGA ≥1g in a region. Also the results of applying back propagation in feed forward neural network (FFBP show a good coincidence with designed RBF results for predicting high value of PGA, with Mean error of 0.017.
A Novel Algorithm of Network Trade Customer Classification Based on Fourier Basis Functions
Li Xinwu
2013-11-01
Full Text Available Learning algorithm of neural network is always an important research contents in neural network theory research and application field, learning algorithm about the feed-forward neural network has no satisfactory solution in particular for its defects in calculation speed. The paper presents a new Fourier basis functions neural network algorithm and applied it to classify network trade customer. First, 21 customer classification indicators are designed, based on characteristics and behaviors analysis of network trade customer, including customer characteristics type variables and customer behaviors type variables,; Second, Fourier basis functions is used to improve the calculation flow and algorithm structure of original BP neural network algorithm to speed up its convergence and then a new Fourier basis neural network model is constructed. Finally the experimental results show that the problem of convergence speed can been solved, and the accuracy of the customer classification are ensured when the new algorithm is used in network trade customer classification practically.
An Efficient Weather Forecasting System using Radial Basis Function Neural Network
Tiruvenkadam Santhanam
2011-01-01
Full Text Available Problem statement: Accurate weather forecasting plays a vital role for planning day to day activities. Neural network has been use in numerous meteorological applications including weather forecasting. Approach: A neural network model has been developed for weather forecasting, based on various factors obtained from meteorological experts. This study evaluates the performance of Radial Basis Function (RBF with Back Propagation (BPN neural network. The back propagation neural network and radial basis function neural network were used to test the performance in order to investigate effective forecasting technique. Results: The prediction accuracy of RBF was 88.49%. Conclusion: The results indicate that proposed radial basis function neural network is better than back propagation neural network.
Noise reduction technique for images using radial basis function neural networks
This paper presents a NN (Neural Network) based model for reducing the noise from images. This is a RBF (Radial Basis Function) network which is used to reduce the effect of noise and blurring from the captured images. The proposed network calculates the mean MSE (Mean Square Error) and PSNR (Peak Signal to Noise Ratio) of the noisy images. The proposed network has also been successfully applied to medical images. The performance of the trained RBF network has been compared with the MLP (Multilayer Perceptron) Network and it has been demonstrated that the performance of the RBF network is better than the MLP network. (author)
Evolutionary Trained Radial Basis Function Networks for Robot Control
Vidnerová, Petra; Slušný, Stanislav; Neruda, Roman
Piscataway: IEEE, 2008, s. 833-838. ISBN 978-1-4244-2286-9. [ICARCV 2008. International Conference on Control, Automation, Robotics & Vision /10./. Hanoi (VN), 17.12.2008-20.12.2008] R&D Projects: GA AV ČR KJB100300804 Institutional research plan: CEZ:AV0Z10300504 Keywords : evolutionary robotics * RBF networks * genetic algorithms Subject RIV: IN - Informatics, Computer Science
Satisfiability of logic programming based on radial basis function neural networks
Hamadneh, Nawaf; Sathasivam, Saratha; Tilahun, Surafel Luleseged; Choon, Ong Hong [School of Mathematical Sciences, Universiti Sains Malaysia, 11800 USM, Penang (Malaysia)
2014-07-10
In this paper, we propose a new technique to test the Satisfiability of propositional logic programming and quantified Boolean formula problem in radial basis function neural networks. For this purpose, we built radial basis function neural networks to represent the proportional logic which has exactly three variables in each clause. We used the Prey-predator algorithm to calculate the output weights of the neural networks, while the K-means clustering algorithm is used to determine the hidden parameters (the centers and the widths). Mean of the sum squared error function is used to measure the activity of the two algorithms. We applied the developed technique with the recurrent radial basis function neural networks to represent the quantified Boolean formulas. The new technique can be applied to solve many applications such as electronic circuits and NP-complete problems.
Fusion prediction based on the attribute clustering net-work and the radial basis function
无
2001-01-01
A fusion prediction method is introduced on the basis of attribute clustering network and radial basis functions. An algorithm of quasi-self organization for developing the model for the fusion prediction is introduced. Some simulation results for chaotic time series are presented to show the performance of the method.
Yunfeng Wu
2014-01-01
Full Text Available This paper presents a novel adaptive linear and normalized combination (ALNC method that can be used to combine the component radial basis function networks (RBFNs to implement better function approximation and regression tasks. The optimization of the fusion weights is obtained by solving a constrained quadratic programming problem. According to the instantaneous errors generated by the component RBFNs, the ALNC is able to perform the selective ensemble of multiple leaners by adaptively adjusting the fusion weights from one instance to another. The results of the experiments on eight synthetic function approximation and six benchmark regression data sets show that the ALNC method can effectively help the ensemble system achieve a higher accuracy (measured in terms of mean-squared error and the better fidelity (characterized by normalized correlation coefficient of approximation, in relation to the popular simple average, weighted average, and the Bagging methods.
The Rate of Approximation of Gaussian Radial Basis Neural Networks in Continuous Function Space
Ting Fan XIE; Fei Long CAO
2013-01-01
There have been many studies on the dense theorem of approximation by radial basis feedforword neural networks,and some approximation problems by Gaussian radial basis feedforward neural networks (GRBFNs) in some special function space have also been investigated.This paper considers the approximation by the GRBFNs in continuous function space.It is proved that the rate of approximation by GRNFNs with nd neurons to any continuous function f defined on a compact subset K （C） Rd can be controlled by ω(f,n-1/2),where ω(f,t) is the modulus of continuity of the function f.
Shengqiao Ni
Full Text Available This paper presents improvements to the conventional Topology Representing Network to build more appropriate topology relationships. Based on this improved Topology Representing Network, we propose a novel method for online dimensionality reduction that integrates the improved Topology Representing Network and Radial Basis Function Network. This method can find meaningful low-dimensional feature structures embedded in high-dimensional original data space, process nonlinear embedded manifolds, and map the new data online. Furthermore, this method can deal with large datasets for the benefit of improved Topology Representing Network. Experiments illustrate the effectiveness of the proposed method.
Radial basis function neural network for power system load-flow
This paper presents a method for solving the load-flow problem of the electric power systems using radial basis function (RBF) neural network with a fast hybrid training method. The main idea is that some operating conditions (values) are needed to solve the set of non-linear algebraic equations of load-flow by employing an iterative numerical technique. Therefore, we may view the outputs of a load-flow program as functions of the operating conditions. Indeed, we are faced with a function approximation problem and this can be done by an RBF neural network. The proposed approach has been successfully applied to the 10-machine and 39-bus New England test system. In addition, this method has been compared with that of a multi-layer perceptron (MLP) neural network model. The simulation results show that the RBF neural network is a simpler method to implement and requires less training time to converge than the MLP neural network. (author)
Diagnosis of Cervical Cancer Using the Median M-Type Radial Basis Function (MMRBF) Neural Network
Gómez-Mayorga, Margarita E.; Gallegos-Funes, Francisco J.; de-La-Rosa-Vázquez, José M.; Cruz-Santiago, Rene; Ponomaryov, Volodymyr
The automatic analysis of Pap smear microscopic images is one of the most interesting fields in biomedical image processing. In this paper we present the capability of the Median M-Type Radial Basis Function (MMRBF) neural network in the classification of cervical cancer cells. From simulation results we observe that the MMRBF neural network has better classification capabilities in comparison with the Median RBF algorithm used as comparative.
Radial basis function neural networks with sequential learning MRAN and its applications
Sundararajan, N; Wei Lu Ying
1999-01-01
This book presents in detail the newly developed sequential learning algorithm for radial basis function neural networks, which realizes a minimal network. This algorithm, created by the authors, is referred to as Minimal Resource Allocation Networks (MRAN). The book describes the application of MRAN in different areas, including pattern recognition, time series prediction, system identification, control, communication and signal processing. Benchmark problems from these areas have been studied, and MRAN is compared with other algorithms. In order to make the book self-contained, a review of t
Design of Radial Basis Function Neural Networks for Software Effort Estimation
Ali Idri
2010-07-01
Full Text Available In spite of the several software effort estimation models developed over the last 30 years, providing accurate estimates of the software project under development is still unachievable goal. Therefore, many researchers are working on the development of new models and the improvement of the existing ones using artificial intelligence techniques such as: case-based reasoning, decision trees, genetic algorithms and neural networks. This paper is devoted to the design of Radial Basis Function Networks for software cost estimation. It shows the impact of the RBFN network structure, especially the number of neurons in the hidden layer and the widths of the basis function, on the accuracy of the produced estimates measured by means of MMRE and Pred indicators. The empirical study uses two different software project datasets namely, artificial COCOMO'81 and Tukutuku datasets.
Upset Prediction in Friction Welding Using Radial Basis Function Neural Network
Wei Liu
2013-01-01
Full Text Available This paper addresses the upset prediction problem of friction welded joints. Based on finite element simulations of inertia friction welding (IFW, a radial basis function (RBF neural network was developed initially to predict the final upset for a number of welding parameters. The predicted joint upset by the RBF neural network was compared to validated finite element simulations, producing an error of less than 8.16% which is reasonable. Furthermore, the effects of initial rotational speed and axial pressure on the upset were investigated in relation to energy conversion with the RBF neural network. The developed RBF neural network was also applied to linear friction welding (LFW and continuous drive friction welding (CDFW. The correlation coefficients of RBF prediction for LFW and CDFW were 0.963 and 0.998, respectively, which further suggest that an RBF neural network is an effective method for upset prediction of friction welded joints.
Liu, Jinkun
2013-01-01
Radial Basis Function (RBF) Neural Network Control for Mechanical Systems is motivated by the need for systematic design approaches to stable adaptive control system design using neural network approximation-based techniques. The main objectives of the book are to introduce the concrete design methods and MATLAB simulation of stable adaptive RBF neural control strategies. In this book, a broad range of implementable neural network control design methods for mechanical systems are presented, such as robot manipulators, inverted pendulums, single link flexible joint robots, motors, etc. Advanced neural network controller design methods and their stability analysis are explored. The book provides readers with the fundamentals of neural network control system design. This book is intended for the researchers in the fields of neural adaptive control, mechanical systems, Matlab simulation, engineering design, robotics and automation. Jinkun Liu is a professor at Beijing University of Aeronautics and Astronauti...
Computing single step operators of logic programming in radial basis function neural networks
Logic programming is the process that leads from an original formulation of a computing problem to executable programs. A normal logic program consists of a finite set of clauses. A valuation I of logic programming is a mapping from ground atoms to false or true. The single step operator of any logic programming is defined as a function (Tp:I→I). Logic programming is well-suited to building the artificial intelligence systems. In this study, we established a new technique to compute the single step operators of logic programming in the radial basis function neural networks. To do that, we proposed a new technique to generate the training data sets of single step operators. The training data sets are used to build the neural networks. We used the recurrent radial basis function neural networks to get to the steady state (the fixed point of the operators). To improve the performance of the neural networks, we used the particle swarm optimization algorithm to train the networks
Computing single step operators of logic programming in radial basis function neural networks
Hamadneh, Nawaf; Sathasivam, Saratha; Choon, Ong Hong [School of Mathematical Sciences, Universiti Sains Malaysia, 11800 USM, Penang (Malaysia)
2014-07-10
Logic programming is the process that leads from an original formulation of a computing problem to executable programs. A normal logic program consists of a finite set of clauses. A valuation I of logic programming is a mapping from ground atoms to false or true. The single step operator of any logic programming is defined as a function (T{sub p}:I→I). Logic programming is well-suited to building the artificial intelligence systems. In this study, we established a new technique to compute the single step operators of logic programming in the radial basis function neural networks. To do that, we proposed a new technique to generate the training data sets of single step operators. The training data sets are used to build the neural networks. We used the recurrent radial basis function neural networks to get to the steady state (the fixed point of the operators). To improve the performance of the neural networks, we used the particle swarm optimization algorithm to train the networks.
Petković, Dalibor; Gocic, Milan; Shamshirband, Shahaboddin; Qasem, Sultan Noman; Trajkovic, Slavisa
2016-08-01
Accurate estimation of the reference evapotranspiration (ET0) is important for the water resource planning and scheduling of irrigation systems. For this purpose, the radial basis function network with particle swarm optimization (RBFN-PSO) and radial basis function network with back propagation (RBFN-BP) were used in this investigation. The FAO-56 Penman-Monteith equation was used as reference equation to estimate ET0 for Serbia during the period of 1980-2010. The obtained simulation results confirmed the proposed models and were analyzed using the root mean-square error (RMSE), the mean absolute error (MAE), and the coefficient of determination ( R 2). The analysis showed that the RBFN-PSO had better statistical characteristics than RBFN-BP and can be helpful for the ET0 estimation.
ZHAO Min; CUI Wei-cheng
2007-01-01
Improving the efficiency of ship optimization is crucial for modern ship design. Compared with traditional methods, multidisciplinary design optimization (MDO) is a more promising approach. For this reason, Collaborative Optimization (CO) is discussed and analyzed in this paper. As one of the most frequently applied MDO methods, CO promotes autonomy of disciplines while providing a coordinating mechanism guaranteeing progress toward an optimum and maintaining interdisciplinary compatibility. However, there are some difficulties in applying the conventional CO method, such as difficulties in choosing an initial point and tremendous computational requirements. For the purpose of overcoming these problems, optimal Latin hypercube design and Radial basis function network were applied to CO. Optimal Latin hypercube design is a modified Latin Hypercube design. Radial basis function network approximates the optimization model, and is updated during the optimization process to improve accuracy. It is shown by examples that the computing efficiency and robustness of this CO method are higher than with the conventional CO method.
Petković, Dalibor; Gocic, Milan; Shamshirband, Shahaboddin; Qasem, Sultan Noman; Trajkovic, Slavisa
2015-06-01
Accurate estimation of the reference evapotranspiration (ET0) is important for the water resource planning and scheduling of irrigation systems. For this purpose, the radial basis function network with particle swarm optimization (RBFN-PSO) and radial basis function network with back propagation (RBFN-BP) were used in this investigation. The FAO-56 Penman-Monteith equation was used as reference equation to estimate ET0 for Serbia during the period of 1980-2010. The obtained simulation results confirmed the proposed models and were analyzed using the root mean-square error (RMSE), the mean absolute error (MAE), and the coefficient of determination (R 2). The analysis showed that the RBFN-PSO had better statistical characteristics than RBFN-BP and can be helpful for the ET0 estimation.
Three Phase Induction Motor Faults Detection by Using Radial Basis Function Neural Network
Abd Alla, Ahmed N.
2006-01-01
In the present study the Artificial Neural Network (ANN) technique for the detection of (bearing and stator inter turn faults) incipient faults in an induction motor bas been explored. Radial basis function approach has been used for ANN Training and test. Three phase instantaneous currents and angular velocity depending on rotor speed are utilized in proposed approach. An experimental setup is used to implement an online fault defector
Radial Basis Function Neural Network Based Super-Resolution Restoration for an Underspled Image
苏秉华; 金伟其; 牛丽红
2004-01-01
To achieve restoration of high frequency information for an underspled and degraded low-resolution image, a nonlinear and real-time processing method-the radial basis function (RBF) neural network based super-resolution method of restoration is proposed. The RBF network configuration and processing method is suitable for a high resolution restoration from an underspled low-resolution image. The soft-competition learning scheme based on the k-means algorithm is used, and can achieve higher mapping approximation accuracy without increase in the network size. Experiments showed that the proposed algorithm can achieve a super-resolution restored image from an underspled and degraded low-resolution image, and requires a shorter training time when compared with the multiplayer perception (MLP) network.
Radial basis function network learns ceramic processing and predicts related strength and density
Cios, K.J.; Baaklini, G.Y.; Vary, A.; Tjia, R.E.
1993-05-01
Radial basis function (RBF) neural networks were trained using the data from 273 Si3N4 modulus of rupture (MOR) bars which were tested at room temperature and 135 MOR bars which were tested at 1370 C. Milling time, sintering time, and sintering gas pressure were the processing parameters used as the input features. Flexural strength and density were the outputs by which the RBF networks were assessed. The 'nodes-at-data-points' method was used to set the hidden layer centers and output layer training used the gradient descent method. The RBF network predicted strength with an average error of less than 12 percent and density with an average error of less than 2 percent. Further, the RBF network demonstrated a potential for optimizing and accelerating the development and processing of ceramic materials.
Radial basis function network learns ceramic processing and predicts related strength and density
Cios, K.J.; Baaklini, G.Y.; Vary, A. (NASA Lewis Research Center, Cleveland, OH (United States)); Tjia, R.E. (Univ. of Toledo, OH (United States))
1994-07-01
Radial basis function (RBF) neural networks were trained using the data from 273 Si[sub 3]N[sub 4] modulus of rupture (MOR) bars that were tested at room temperature and 135 MOR bars that were tested at 1,370 C. Milling time, sintering time, and sintering gas pressure were the processing parameters used s the input features. Flexural strength and density were the outputs by which the RBF networks were assessed. The nodes at data points'' method was used to set the hidden layer centers and output layer training used the gradient descent method. The RBF network predicted strength with an average error of less than 12% and density with an average error of less than 2%. Further, the RBF network demonstrated a potential for optimizing and accelerating the development and processing of emerging ceramic materials.
Radial basis function network learns ceramic processing and predicts related strength and density
Cios, Krzysztof J.; Baaklini, George Y.; Vary, Alex; Tjia, Robert E.
1993-01-01
Radial basis function (RBF) neural networks were trained using the data from 273 Si3N4 modulus of rupture (MOR) bars which were tested at room temperature and 135 MOR bars which were tested at 1370 C. Milling time, sintering time, and sintering gas pressure were the processing parameters used as the input features. Flexural strength and density were the outputs by which the RBF networks were assessed. The 'nodes-at-data-points' method was used to set the hidden layer centers and output layer training used the gradient descent method. The RBF network predicted strength with an average error of less than 12 percent and density with an average error of less than 2 percent. Further, the RBF network demonstrated a potential for optimizing and accelerating the development and processing of ceramic materials.
Supervised Learning Errors by Radial Basis Function Neural Networks and Regularization Networks
Neruda, Roman; Vidnerová, Petra
Los Alamitos : IEEE Computer Society, 2008, s. 193-196. ISBN 978-1-4244-3430-5. [SIP 2008. International Symposium on Signal Processing, Image Processing and Pattern Recognition /1./. Hainan Island (CN), 13.12.2008-15.12.2008] R&D Projects: GA ČR GA201/08/1744 Institutional research plan: CEZ:AV0Z10300504 Keywords : regularization * radial basis function * training error Subject RIV: IN - Informatics, Computer Science
This paper introduces a novel algorithm for determining the structure of a radial basis function (RBF) network (the number of hidden units) while it is used for dynamic modeling of chaotic time series. It can be seen that the hidden units in the RBF network can form hyperplanes to partition the input space into various regions in each of which it is possible to approximate the dynamics with a basis function. The number of regions corresponds to the number of hidden units. The basic idea of the proposed algorithm is to partition the input space by fractal scaling of the chaotic time series being modeled. By fractal scaling process, the number of basis functions (hidden units) as well as the number of input variables can be specified. Accordingly, the network topology is efficiently determined based on the complexity of the underlying dynamics as reflected in the observed time series. The feasibility of the proposed scheme is examined through dynamic modeling of the well-known chaotic time series. The results show that the new method can improve the predictability of chaotic time series with a suitable number of hidden units compared to that of reported in the literature
Lu, Y; Sundararajan, N; Saratchandran, P
1998-01-01
This paper presents a detailed performance analysis of the minimal resource allocation network (M-RAN) learning algorithm, M-RAN is a sequential learning radial basis function neural network which combines the growth criterion of the resource allocating network (RAN) of Platt (1991) with a pruning strategy based on the relative contribution of each hidden unit to the overall network output. The resulting network leads toward a minimal topology for the RAN. The performance of this algorithm is compared with the multilayer feedforward networks (MFNs) trained with 1) a variant of the standard backpropagation algorithm, known as RPROP and 2) the dependence identification (DI) algorithm of Moody and Antsaklis on several benchmark problems in the function approximation and pattern classification areas. For all these problems, the M-RAN algorithm is shown to realize networks with far fewer hidden neurons with better or same approximation/classification accuracy. Further, the time taken for learning (training) is also considerably shorter as M-RAN does not require repeated presentation of the training data. PMID:18252454
D'Souza, Adora M.; Abidin, Anas Zainul; Nagarajan, Mahesh B.; Wismüller, Axel
2016-03-01
We investigate the applicability of a computational framework, called mutual connectivity analysis (MCA), for directed functional connectivity analysis in both synthetic and resting-state functional MRI data. This framework comprises of first evaluating non-linear cross-predictability between every pair of time series prior to recovering the underlying network structure using community detection algorithms. We obtain the non-linear cross-prediction score between time series using Generalized Radial Basis Functions (GRBF) neural networks. These cross-prediction scores characterize the underlying functionally connected networks within the resting brain, which can be extracted using non-metric clustering approaches, such as the Louvain method. We first test our approach on synthetic models with known directional influence and network structure. Our method is able to capture the directional relationships between time series (with an area under the ROC curve = 0.92 +/- 0.037) as well as the underlying network structure (Rand index = 0.87 +/- 0.063) with high accuracy. Furthermore, we test this method for network recovery on resting-state fMRI data, where results are compared to the motor cortex network recovered from a motor stimulation sequence, resulting in a strong agreement between the two (Dice coefficient = 0.45). We conclude that our MCA approach is effective in analyzing non-linear directed functional connectivity and in revealing underlying functional network structure in complex systems.
Prediction Study on PCI Failure of Reactor Fuel Based on a Radial Basis Function Neural Network
Xinyu Wei
2016-01-01
Full Text Available Pellet-clad interaction (PCI is one of the major issues in fuel rod design and reactor core operation in water cooled reactors. The prediction of fuel rod failure by PCI is studied in this paper by the method of radial basis function neural network (RBFNN. The neural network is built through the analysis of the existing experimental data. It is concluded that it is a suitable way to reduce the calculation complexity. A self-organized RBFNN is used in our study, which can vary its structure dynamically in order to maintain the prediction accuracy. For the purpose of the appropriate network complexity and overall computational efficiency, the hidden neurons in the RBFNN can be changed online based on the neuron activity and mutual information. The presented method is tested by the experimental data from the reference, and the results demonstrate its effectiveness.
Wang, Bing; Meng, Yao-hua; Yu, Xiao-Hong
2014-01-01
For learning problem of Radial Basis Function Process Neural Network (RBF-PNN), an optimization training method based on GA combined with SA is proposed in this paper. Through building generalized Fr\\'echet distance to measure similarity between time-varying function samples, the learning problem of radial basis centre functions and connection weights is converted into the training on corresponding discrete sequence coefficients. Network training objective function is constructed according to...
Shankar, Praveen
The performance of nonlinear control algorithms such as feedback linearization and dynamic inversion is heavily dependent on the fidelity of the dynamic model being inverted. Incomplete or incorrect knowledge of the dynamics results in reduced performance and may lead to instability. Augmenting the baseline controller with approximators which utilize a parametrization structure that is adapted online reduces the effect of this error between the design model and actual dynamics. However, currently existing parameterizations employ a fixed set of basis functions that do not guarantee arbitrary tracking error performance. To address this problem, we develop a self-organizing parametrization structure that is proven to be stable and can guarantee arbitrary tracking error performance. The training algorithm to grow the network and adapt the parameters is derived from Lyapunov theory. In addition to growing the network of basis functions, a pruning strategy is incorporated to keep the size of the network as small as possible. This algorithm is implemented on a high performance flight vehicle such as F-15 military aircraft. The baseline dynamic inversion controller is augmented with a Self-Organizing Radial Basis Function Network (SORBFN) to minimize the effect of the inversion error which may occur due to imperfect modeling, approximate inversion or sudden changes in aircraft dynamics. The dynamic inversion controller is simulated for different situations including control surface failures, modeling errors and external disturbances with and without the adaptive network. A performance measure of maximum tracking error is specified for both the controllers a priori. Excellent tracking error minimization to a pre-specified level using the adaptive approximation based controller was achieved while the baseline dynamic inversion controller failed to meet this performance specification. The performance of the SORBFN based controller is also compared to a fixed RBF network
Markopoulos, Angelos P.; Georgiopoulos, Sotirios; Manolakos, Dimitrios E.
2016-03-01
Various artificial neural networks types are examined and compared for the prediction of surface roughness in manufacturing technology. The aim of the study is to evaluate different kinds of neural networks and observe their performance and applicability on the same problem. More specifically, feed-forward artificial neural networks are trained with three different back propagation algorithms, namely the adaptive back propagation algorithm of the steepest descent with the use of momentum term, the back propagation Levenberg-Marquardt algorithm and the back propagation Bayesian algorithm. Moreover, radial basis function neural networks are examined. All the aforementioned algorithms are used for the prediction of surface roughness in milling, trained with the same input parameters and output data so that they can be compared. The advantages and disadvantages, in terms of the quality of the results, computational cost and time are identified. An algorithm for the selection of the spread constant is applied and tests are performed for the determination of the neural network with the best performance. The finally selected neural networks can satisfactorily predict the quality of the manufacturing process performed, through simulation and input-output surfaces for combinations of the input data, which correspond to milling cutting conditions.
Dongliang Guo
2014-01-01
Full Text Available Indoor localization technique has received much attention in recent years. Many techniques have been developed to solve the problem. Among the recent proposed methods, radio frequency identification (RFID indoor localization technology has the advantages of low-cost, noncontact, non-line-of-sight, and high precision. This paper proposed two radial basis function (RBF neural network based indoor localization methods. The RBF neural networks are trained to learn the mapping relationship between received signal strength indication values and position of objects. Traditional method used the received signal strength directly as the input of neural network; we added another input channel by taking the difference of the received signal strength, thus improving the reliability and precision of positioning. Fuzzy clustering is used to determine the center of radial basis function. In order to reduce the impact of signal fading due to non-line-of-sight and multipath transmission in indoor environment, we improved the Gaussian filter to process received signal strength values. The experimental results show that the proposed method outperforms the existing methods as well as improves the reliability and precision of the RFID indoor positioning system.
Circular antenna array pattern analysis using radial basis function neural network
A method is proposed to design circular antenna array for the given gain and beam width using Artificial Neural Networks. In optimizing circular arrays, the parameters to be controlled are excitation of the elements, their separation, lengths and the circle radius. This paper deals about finding the parameters of radiation pattern of given uniform circular antenna array. Initially, the network is trained with a set of input-output data pairs. The trained network is used for testing. The training data set is generated from MATLAB simulation with number of elements N=5, 10, 15 and 20 elements of uniform circular array, respectively, distributed over a given circle, assuming 20 training cases. The number of input nodes, hidden nodes and output nodes are 20, 20 and 1, respectively. Predicted values of the neural network are compared with those of MATLAB simulation results and are found to be in agreement. This work establishes the application of Radial Basis Function Neural Network (RBFNN) for circular array pattern optimization. RBFNN is able to predict the output values with 97% of accuracy. This work proves that RBFNN can be used for circular antenna array design.
Johnsson, Roger
2006-11-01
Methods to measure and monitor the cylinder pressure in internal combustion engines can contribute to reduced fuel consumption, noise and exhaust emissions. As direct measurements of the cylinder pressure are expensive and not suitable for measurements in vehicles on the road indirect methods which measure cylinder pressure have great potential value. In this paper, a non-linear model based on complex radial basis function (RBF) networks is proposed for the reconstruction of in-cylinder pressure pulse waveforms. Input to the network is the Fourier transforms of both engine structure vibration and crankshaft speed fluctuation. The primary reason for the use of Fourier transforms is that different frequency regions of the signals are used for the reconstruction process. This approach also makes it easier to reduce the amount of information that is used as input to the RBF network. The complex RBF network was applied to measurements from a 6-cylinder ethanol powered diesel engine over a wide range of running conditions. Prediction accuracy was validated by comparing a number of parameters between the measured and predicted cylinder pressure waveform such as maximum pressure, maximum rate of pressure rise and indicated mean effective pressure. The performance of the network was also evaluated for a number of untrained running conditions that differ both in speed and load from the trained ones. The results for the validation set were comparable to the trained conditions.
Research on motion compensation method based on neural network of radial basis function
Zuo Yunbo
2014-01-01
The machining precision not only depends on accurate mechanical structure but also depends on motion compensation method. If manufacturing precision of mechanical structure cannot be improved, the motion compensation is a reasonable way to improve motion precision. A motion compensation method based on neural network of radial basis function (RBF) was presented in this paper. It utilized the infinite approximation advantage of RBF neural network to fit the motion error curve. The best hidden neural quantity was optimized by training the motion error data and calculating the total sum of squares. The best curve coefficient matrix was got and used to calculate motion compensation values. The experiments showed that the motion errors could be reduced obviously by utilizing the method in this paper.
Jun Wang; Guoqing Chen; Tuo Zhu; Shumei Gao; Bailin Wei; Linna Bi
2009-01-01
@@ The fluorescence spectra of synthetic food dyes of sunset yellow and tartrazine are analyzed.The fluorescence peak wavelengths of sunset yellow and tartrazine are 576 and 569 nm, respectively, while the fluorescence spectra widths are 480-750 and 500-750 nm induced by ultraviolet light between 310-400 nm.The fluorescence spectra of sunset yellow overlap heavily with those of tartrazine, so it is diffic ult to distinguish them.Based on the principle of radial basis function neural network, a neural network is obtained from the training of the 14 groups of experimental data.The results show that the species of sunset yellow and tartrazine could be recognized accurately.This method has potential applications in other synthetic food dyes detection and food safety inspection.
Dynamics of on-line learning in radial basis function networks
Freeman, Jason A. S.; Saad, David
1997-07-01
On-line learning is examined for the radial basis function network, an important and practical type of neural network. The evolution of generalization error is calculated within a framework which allows the phenomena of the learning process, such as the specialization of the hidden units, to be analyzed. The distinct stages of training are elucidated, and the role of the learning rate described. The three most important stages of training, the symmetric phase, the symmetry-breaking phase, and the convergence phase, are analyzed in detail; the convergence phase analysis allows derivation of maximal and optimal learning rates. As well as finding the evolution of the mean system parameters, the variances of these parameters are derived and shown to be typically small. Finally, the analytic results are strongly confirmed by simulations.
On-line Cutting Quality Recognition in Milling Using a Radical Basis Function Neural Network
无
2000-01-01
Tool wear, chatter vibration, chip breaking and built-up edge are main phenomena to be monitored in modern manufacturing processes, which are considered as important factors to the quality of products.They are closely related to the cutting parameters, which are to be selected in manufacturing process.However, it is very difficult to measure directly the cutting quality based on on-line monitoring.In this study, the relationship between the cutting parameters and cutting quality is analyzed.A Radical Basis Function (RBF) neural network based on-line quality recognition scheme is also presented, which monitors the level of surface roughness.The experimental results reveal that the RBF neural network has a high prediction success rate.
Learning Errors by Radial Basis Function Neural Networks and Regularization Networks
Neruda, Roman; Vidnerová, Petra
2009-01-01
Roč. 1, č. 2 (2009), s. 49-57. ISSN 2005-4262 R&D Projects: GA MŠk(CZ) 1M0567 Institutional research plan: CEZ:AV0Z10300504 Keywords : neural network * RBF networks * regularization * learning Subject RIV: IN - Informatics, Computer Science http://www.sersc.org/journals/IJGDC/vol2_no1/5.pdf
DENSENESS OF RADIAL-BASIS FUNCTIONS IN L2（Rn） AND ITS APPLICATIONS IN NEURAL NETWORKS
CHENTIANPING; CHENHONG
1996-01-01
The authors discuss problems of approximation to functions in L2 (Rn)and operators from L2(Rn1)to L2(Rn2)by Radial-Basis Functions. The results obtained solve the parblem of capability of RBF neural networks,a basic problem in neural networks.
Chen, Jiajia; Zhao, Pan; Liang, Huawei; Mei, Tao
2014-01-01
The autonomous vehicle is an automated system equipped with features like environment perception, decision-making, motion planning, and control and execution technology. Navigating in an unstructured and complex environment is a huge challenge for autonomous vehicles, due to the irregular shape of road, the requirement of real-time planning, and the nonholonomic constraints of vehicle. This paper presents a motion planning method, based on the Radial Basis Function (RBF) neural network, to guide the autonomous vehicle in unstructured environments. The proposed algorithm extracts the drivable region from the perception grid map based on the global path, which is available in the road network. The sample points are randomly selected in the drivable region, and a gradient descent method is used to train the RBF network. The parameters of the motion-planning algorithm are verified through the simulation and experiment. It is observed that the proposed approach produces a flexible, smooth, and safe path that can fit any road shape. The method is implemented on autonomous vehicle and verified against many outdoor scenes; furthermore, a comparison of proposed method with the existing well-known Rapidly-exploring Random Tree (RRT) method is presented. The experimental results show that the proposed method is highly effective in planning the vehicle path and offers better motion quality. PMID:25237902
Jiajia Chen
2014-09-01
Full Text Available The autonomous vehicle is an automated system equipped with features like environment perception, decision-making, motion planning, and control and execution technology. Navigating in an unstructured and complex environment is a huge challenge for autonomous vehicles, due to the irregular shape of road, the requirement of real-time planning, and the nonholonomic constraints of vehicle. This paper presents a motion planning method, based on the Radial Basis Function (RBF neural network, to guide the autonomous vehicle in unstructured environments. The proposed algorithm extracts the drivable region from the perception grid map based on the global path, which is available in the road network. The sample points are randomly selected in the drivable region, and a gradient descent method is used to train the RBF network. The parameters of the motion-planning algorithm are verified through the simulation and experiment. It is observed that the proposed approach produces a flexible, smooth, and safe path that can fit any road shape. The method is implemented on autonomous vehicle and verified against many outdoor scenes; furthermore, a comparison of proposed method with the existing well-known Rapidly-exploring Random Tree (RRT method is presented. The experimental results show that the proposed method is highly effective in planning the vehicle path and offers better motion quality.
Yan, Qin; Zhong, Yanfei
2008-12-01
The radial basis function (RBF) neural network is a powerful method for remote sensing image classification. It has a simple architecture and the learning algorithm corresponds to the solution of a linear regression problem, resulting in a fast training process. The main drawback of this strategy is the requirement of an efficient algorithm to determine the number, position, and dispersion of the RBF. Traditional methods to determine the centers are: randomly choose input vectors from the training data set; vectors obtained from unsupervised clustering algorithms, such as k-means, applied to the input data. These conduce that traditional RBF neural network is sensitive to the center initialization. In this paper, the artificial immune network (aiNet) model, a new computational intelligence based on artificial immune networks (AIN), is applied to obtain appropriate centers for remote sensing image classification. In the aiNet-RBF algorihtm, each input pattern corresonds to an antigenic stimulus, while each RBF candidate center is considered to be an element, or cell, of the immune network model. The steps are as follows: A set of candidate centers is initialized at random, where the initial number of candidates and their positions is not crucial to the performance. Then, the clonal selection principle will control which candidates will be selected and how they will be upadated. Note that the clonal selection principle will be responsible for how the centers will represent the training data set. Finally, the immune network will identify and eliminate or suppress self-recognizing individuals to control the number of candidate centers. After the above learning phase, the aiNet network centers represent internal images of the inuput patterns presented to it. The algorithm output is taken to be the matrix of memory cells' coordinates that represent the final centers to be adopted by the RBF network. The stopping criterion of the proposed algorithm is given by a pre
Radial Basis Function Neural Networks Based QSPR for the Prediction of log P
YAO,Xiao-Jun(姚小军); LIU,Man-Cang(刘满仓); ZHANG,Xiao-Yun(张晓昀); ZHANG,Rui-Sheng(张瑞生); HU,Zhi-De(胡之德); FAN,Bo-Tao(范波涛)
2002-01-01
Quantitative structure-property relatioonship (QSPR) method is used to study the correlation models between the structures of a set of diverse organic compounds and their log P. Molecular descriptors calculated from structure alone are used to describe the molecular structures. A subset of the calculated descriptors, selected using forward stepwise regression, is used in the QSPR models development. Multiple linear regression (MLR)and radial basis function neural networks (RBFNNs) are urilized to construct the linear and non-linear correlation model,respectively. The optimal QSPR model developedis based on a 7-17-1 RBFNNs architecture using seven calculated molecular descriptors. The root mean square errorsin predictions for the training, predicting and overall data sets are 0.284, 0.327 and 0.291 log P units, respectively.
Radial Basis Function Neural Networks Based QSPR for the Prediction of log P
姚小军; 范波涛; 等
2002-01-01
Quantitative structure-property relationship(QSPR) method is used to study the correlation models between the structures of a set of diverse organic compounds and their log P.Molecular descriptors calculated from strucure alone are used to describe the molecular structures.A subset of the calcualted descriptors,selected using forward stepwise regression,is used in the QSPR models development.Multiple linear regression (MLR) and radial basis function neural networks (RBFNNs) are utilied to construct the linear and non-linear correlation model,respectively,The optimal QSPR model developed is based on a 7-17-1 RBFNNs architecture using sever calculated molecular descriptors .The root mean square errors in predictions for the training,predicting and overall data sets are 0.284,0.327 and 0.291 log P units respectively.
Ryu, Duchwan
2013-03-01
The sea surface temperature (SST) is an important factor of the earth climate system. A deep understanding of SST is essential for climate monitoring and prediction. In general, SST follows a nonlinear pattern in both time and location and can be modeled by a dynamic system which changes with time and location. In this article, we propose a radial basis function network-based dynamic model which is able to catch the nonlinearity of the data and propose to use the dynamically weighted particle filter to estimate the parameters of the dynamic model. We analyze the SST observed in the Caribbean Islands area after a hurricane using the proposed dynamic model. Comparing to the traditional grid-based approach that requires a supercomputer due to its high computational demand, our approach requires much less CPU time and makes real-time forecasting of SST doable on a personal computer. Supplementary materials for this article are available online. © 2013 American Statistical Association.
Hancock, M.F. Jr. [Rollins College, Winter Park, FL (United States)
1995-12-31
The National Council on Compensation Insurance (NCCI) maintains a national data base of outcomes of workers` compensation claims. We consider whether a radial basis function network can predict the total dollar value of a claim based upon medical and demographic indicators (MDI`s). This work used data from 12,130 workers` compensation claims collected over a period of four years from the state of New Mexico. Two problems were addressed: (1) How well can the total incurred medical expense for all claims be predicted from available MDI`s? For individual claims? (2) How well can the duration of disability be predicted from available MDI`s? The available features intuitively correlated with total medical cost were selected, including type of injury, part of body injured, person`s age at time of injury, gender, marital status, etc. These features were statistically standardized and sorted by correlation with outcome valuation. Principal component analysis was applied. A radial basis function neural network was applied to the feature sets in both supervised and unsupervised training modes. For sets used in training, individual case valuations could consistently be predicted to within $1000 over 98% of the time. For these sets, it was possible to predict total medical expense for the training sets themselves to within 10%. When applied as blind tests against sets which were NOT part of the training data, the prediction was within 15% on the whole sets. Results on individual cases were very poor in only 30% of the cases were the predictions for the training sets within $1000 of their actual valuations. Single-factor analysis suggested that the presence of an attorney strongly decorrelated the data. A simple stratification was performed to remove cases involving attorneys and contested claims, and the procedures above repeated. Preliminary results based upon the very limited effort applied indicate that NCCI data support population estimates, but not single-point estimates.
Near and long-term load prediction using radial basis function networks
Hancock, M.F. [Rollins College, Winter Park, FL (United States)
1995-12-31
A number of researchers have investigated the application of multi-layer perceptrons (MLP`s), a variety of neural network, to the problem of short-term load forecasting for electric utilities (e.g., Rahman & Hazin, IEEE Trans. Power Systems, May 1993). {open_quotes}Short-term{close_quotes} in this context typically means {open_quotes}next day{close_quotes}. These forecasts have been based upon previous day actual loads and meteorological factors (e.g., max-min temperature, relative humidity). We describe the application of radial basis function networks (RBF`s) to the {open_quotes}long-term{close_quotes} (next year) load forecasting problem. The RBF network performs a two-stage classification based upon annual average loads and meteorological data. During stage 1, discrete classification is performed using radius-limited elements. During stage 2, a multi-layer perceptron may be applied. The quantized output is used to correct a prediction template. The stage 1 classifier is trained by maximizing an objective function (the {open_quotes}disambiguity{close_quotes}). The stage 2 MLP`s are trained by standard back-propagation. This work uses 12 months of hourly meteorological data, and the corresponding hourly load data for both commercial and residential feeders. At the current stage of development, the RBF machine can train on 20% of the weather/load data (selected by simple linear sampling), and estimate the hourly load for an entire year (8,760 data points) with 9.1% error (RMS, relative to daily peak load). (By comparison, monthly mean profiles perform at c. 12% error.) The best short-term load forecasters operate in the 2% error range. The current system is an engineering prototype, and development is continuing.
Ensembles of radial basis function networks for spectroscopic detection of cervical precancer
Tumer, K.; Ramanujam, N.; Ghosh, J.; Richards-Kortum, R.
1998-01-01
The mortality related to cervical cancer can be substantially reduced through early detection and treatment. However, current detection techniques, such as Pap smear and colposcopy, fail to achieve a concurrently high sensitivity and specificity. In vivo fluorescence spectroscopy is a technique which quickly, noninvasively and quantitatively probes the biochemical and morphological changes that occur in precancerous tissue. A multivariate statistical algorithm was used to extract clinically useful information from tissue spectra acquired from 361 cervical sites from 95 patients at 337-, 380-, and 460-nm excitation wavelengths. The multivariate statistical analysis was also employed to reduce the number of fluorescence excitation-emission wavelength pairs required to discriminate healthy tissue samples from precancerous tissue samples. The use of connectionist methods such as multilayered perceptrons, radial basis function (RBF) networks, and ensembles of such networks was investigated. RBF ensemble algorithms based on fluorescence spectra potentially provide automated and near real-time implementation of precancer detection in the hands of nonexperts. The results are more reliable, direct, and accurate than those achieved by either human experts or multivariate statistical algorithms.
Analysis of CT Brain Images using Radial Basis Function Neural Network
T. Joshva Devadas
2012-07-01
Full Text Available Medical image processing and analysis is the tool to assist radiologists in the diagnosis process to obtain a more accurate and faster diagnosis. In this work, we have developed a neural network to classify the computer tomography (CT brain tumor image for automatic diagnosis. This system is divided into four steps namely enhancement, segmentation, feature extraction and classification. In the first phase, an edge-based selective median filter is used to improve the visibility of the loss of the gray-white matter interface in CT brain tumor images. Second phase uses a modified version of shift genetic algorithm for the segmentation. Next phase extracts the textural features using statistical texture analysis method. These features are fed into classifiers like BPN, Fuzzy k-NN, and radial basis function network. The performances of these classifiers are analyzed in the final phase with receiver operating characteristic and precision-recall curve. The result shows that the CAD system is only to develop the tool for brain tumor and proposed method is very accurate and computationally more efficient and less time consuming.
Yoo, Sung-Hoon; Oh, Sung-Kwun; Pedrycz, Witold
2015-09-01
In this study, we propose a hybrid method of face recognition by using face region information extracted from the detected face region. In the preprocessing part, we develop a hybrid approach based on the Active Shape Model (ASM) and the Principal Component Analysis (PCA) algorithm. At this step, we use a CCD (Charge Coupled Device) camera to acquire a facial image by using AdaBoost and then Histogram Equalization (HE) is employed to improve the quality of the image. ASM extracts the face contour and image shape to produce a personal profile. Then we use a PCA method to reduce dimensionality of face images. In the recognition part, we consider the improved Radial Basis Function Neural Networks (RBF NNs) to identify a unique pattern associated with each person. The proposed RBF NN architecture consists of three functional modules realizing the condition phase, the conclusion phase, and the inference phase completed with the help of fuzzy rules coming in the standard 'if-then' format. In the formation of the condition part of the fuzzy rules, the input space is partitioned with the use of Fuzzy C-Means (FCM) clustering. In the conclusion part of the fuzzy rules, the connections (weights) of the RBF NNs are represented by four kinds of polynomials such as constant, linear, quadratic, and reduced quadratic. The values of the coefficients are determined by running a gradient descent method. The output of the RBF NNs model is obtained by running a fuzzy inference method. The essential design parameters of the network (including learning rate, momentum coefficient and fuzzification coefficient used by the FCM) are optimized by means of Differential Evolution (DE). The proposed P-RBF NNs (Polynomial based RBF NNs) are applied to facial recognition and its performance is quantified from the viewpoint of the output performance and recognition rate. PMID:26163042
[Automated recognition of quasars based on adaptive radial basis function neural networks].
Zhao, Mei-Fang; Luo, A-Li; Wu, Fu-Chao; Hu, Zhan-Yi
2006-02-01
Recognizing and certifying quasars through the research on spectra is an important method in the field of astronomy. This paper presents a novel adaptive method for the automated recognition of quasars based on the radial basis function neural networks (RBFN). The proposed method is composed of the following three parts: (1) The feature space is reduced by the PCA (the principal component analysis) on the normalized input spectra; (2) An adaptive RBFN is constructed and trained in this reduced space. At first, the K-means clustering is used for the initialization, then based on the sum of squares errors and a gradient descent optimization technique, the number of neurons in the hidden layer is adaptively increased to improve the recognition performance; (3) The quasar spectra recognition is effectively carried out by the above trained RBFN. The author's proposed adaptive RBFN is shown to be able to not only overcome the difficulty of selecting the number of neurons in hidden layer of the traditional RBFN algorithm, but also increase the stability and accuracy of recognition of quasars. Besides, the proposed method is particularly useful for automatic voluminous spectra processing produced from a large-scale sky survey project, such as our LAMOST, due to its efficiency. PMID:16826929
RADIAL BASIS FUNCTION NETWORK DEPENDENT EXCLUSIVE MUTUAL INTERPOLATION FOR MISSING VALUE IMPUTATION
R. S. Somasundaram
2013-01-01
Full Text Available The success of data mining relies on the purity of the data set. Before performing the data mining, the data has to be cleaned. An unprocessed data set may contain noisy or missing values which is a critical research issue in the pre-processing stage. Imputation methods are being used to solve the missing value problems. In this proposed work, a machine learning based imputation method is proposed by using the mutual information by exclusively interpolating two different section of the same dataset. For designing the proposed model, a radial basis function based neural network has been used. The performance of the proposed algorithm has been measured with respect to different rate or percentage of missing values in the data set and the results has been compared with existing simple and efficient imputation methods also. To evaluate the performance, the standard WDBC data set has been used. The proposed algorithm performs well and was able to impute the missing values even in the worst cases with more than 50% of missing values. Instead of using simple quality measure such as Mean Square Error (MSE to evaluate the imputed data quality, in this study, the quality is measured in terms of classification performance. The results arrived were more significant and comparable.
The Application of Direction Basis Function Neural Networks to the Prediction of Chaotic Time Series
CAOWenming
2004-01-01
In this paper we have examined the ability of Direction basis function networks (DBFN) to predict the output of a chaotic time series generated from a model of a physical system. DBFNs are known to be universal approximators, and chaotic systems are known to exhibit “random” behavior. Therefore the challenge is to apply the DBFN to the prediction of the output of a chaotic system, which we have chosen here to be the Mackey-Glass delay differential equation. The DBFN has been trained with off-line supervised learning using a Recursive Least Squares optimization for obtaining weights. Key issues which are addressed are the estimation of the order of the system and dependence of prediction error on various factors such as placement of DBF centers, selection of perceptive widths, and number of training samples. Included in this study is an implementation of Moody and Darken's K Means Clustering approach to optimally place DBF centers and a heuristic nearest neighbor method for determining perceptive widths.
Jingwen Tian; Meijuan Gao; Yonggang He
2013-01-01
Since the control system of the welding gun pose in whole‐position welding is complicated and nonlinear, an intelligent control system of welding gun pose for a pipeline welding robot based on an improved radial basis function neural network (IRBFNN) and expert system (ES) is presented in this paper. The structure of the IRBFNN is constructed and the improved genetic algorithm is adopted to optimize the network structure. This control system makes full use of the characteristics of the IRBFNN...
Lee, Kyo-Beum; Blaabjerg, Frede
estimate the motor inertia value, the observer using the Radial Basis Function Network (RBFN) is applied. A control law for stabilizing the system and adaptive laws for updating both of the weights in the RBFN and a bounding constant are established so that the whole closed-loop system is stable in the...
Tzong-Yi Lee
Full Text Available Ubiquitin (Ub is a small protein that consists of 76 amino acids about 8.5 kDa. In ubiquitin conjugation, the ubiquitin is majorly conjugated on the lysine residue of protein by Ub-ligating (E3 enzymes. Three major enzymes participate in ubiquitin conjugation. They are E1, E2 and E3 which are responsible for activating, conjugating and ligating ubiquitin, respectively. Ubiquitin conjugation in eukaryotes is an important mechanism of the proteasome-mediated degradation of a protein and regulating the activity of transcription factors. Motivated by the importance of ubiquitin conjugation in biological processes, this investigation develops a method, UbSite, which uses utilizes an efficient radial basis function (RBF network to identify protein ubiquitin conjugation (ubiquitylation sites. This work not only investigates the amino acid composition but also the structural characteristics, physicochemical properties, and evolutionary information of amino acids around ubiquitylation (Ub sites. With reference to the pathway of ubiquitin conjugation, the substrate sites for E3 recognition, which are distant from ubiquitylation sites, are investigated. The measurement of F-score in a large window size (-20∼+20 revealed a statistically significant amino acid composition and position-specific scoring matrix (evolutionary information, which are mainly located distant from Ub sites. The distant information can be used effectively to differentiate Ub sites from non-Ub sites. As determined by five-fold cross-validation, the model that was trained using the combination of amino acid composition and evolutionary information performs best in identifying ubiquitin conjugation sites. The prediction sensitivity, specificity, and accuracy are 65.5%, 74.8%, and 74.5%, respectively. Although the amino acid sequences around the ubiquitin conjugation sites do not contain conserved motifs, the cross-validation result indicates that the integration of distant sequence
Shuhuan Wen
2012-01-01
Full Text Available This paper works on hybrid force/position control in robotic manipulation and proposes an improved radial basis functional (RBF neural network, which is a robust relying on the Hamilton Jacobi Issacs principle of the force control loop. The method compensates uncertainties in a robot system by using the property of RBF neural network. The error approximation of neural network is regarded as an external interference of the system, and it is eliminated by the robust control method. Since the conventionally fixed structure of RBF network is not optimal, resource allocating network (RAN is proposed in this paper to adjust the network structure in time and avoid the underfit. Finally the advantage of system stability and transient performance is demonstrated by the numerical simulations.
Shahbaz A. Siddiqui; Kusum Verma; K. R. Niazi; Manoj Fozdar
2014-01-01
On-line Transient Stability Assessment (TSA) is challenging task due to the large number of variables involved and continuously varying operating conditions. This study proposes an on-line transient stability assessment methodology based on the predicted values of generator rotor angles under varying operating conditions for predefined contingency set through Radial Basis Function Neural Network (RBFNN). The real and reactive power loads are taken as input features for training of the neural ...
Analysis of CT Brain Images using Radial Basis Function Neural Network
T. Joshva Devadas
2012-07-01
Full Text Available Medical image processing and analysis is the tool to assist radiologists in the diagnosis process to obtain a moreaccurate and faster diagnosis. In this work, we have developed a neural network to classify the computer tomography(CT brain tumor image for automatic diagnosis. This system is divided into four steps namely enhancement, segmentation, feature extraction and classification. In the first phase, an edge-based selective median filter is usedto improve the visibility of the loss of the gray-white matter interface in CT brain tumor images. Second phaseuses a modified version of shift genetic algorithm for the segmentation. Next phase extracts the textural featuresusing statistical texture analysis method. These features are fed into classifiers like BPN, Fuzzy k-NN, and radialbasis function network. The performances of these classifiers are analyzed in the final phase with receiver operating characteristic and precision-recall curve. The result shows that the CAD system is only to develop the tool for braintumor and proposed method is very accurate and computationally more efficient and less time consuming.Defence Science Journal, 2012, 62(4, pp.212-218, DOI:http://dx.doi.org/10.14429/dsj.62.1830
Oh, Sung-Kwun; Kim, Wook-Dong; Pedrycz, Witold
2016-05-01
In this paper, we introduce a new architecture of optimized Radial Basis Function neural network classifier developed with the aid of fuzzy clustering and data preprocessing techniques and discuss its comprehensive design methodology. In the preprocessing part, the Linear Discriminant Analysis (LDA) or Principal Component Analysis (PCA) algorithm forms a front end of the network. The transformed data produced here are used as the inputs of the network. In the premise part, the Fuzzy C-Means (FCM) algorithm determines the receptive field associated with the condition part of the rules. The connection weights of the classifier are of functional nature and come as polynomial functions forming the consequent part. The Particle Swarm Optimization algorithm optimizes a number of essential parameters needed to improve the accuracy of the classifier. Those optimized parameters include the type of data preprocessing, the dimensionality of the feature vectors produced by the LDA (or PCA), the number of clusters (rules), the fuzzification coefficient used in the FCM algorithm and the orders of the polynomials of networks. The performance of the proposed classifier is reported for several benchmarking data-sets and is compared with the performance of other classifiers reported in the previous studies.
Shahbaz A. Siddiqui
2014-10-01
Full Text Available On-line Transient Stability Assessment (TSA is challenging task due to the large number of variables involved and continuously varying operating conditions. This study proposes an on-line transient stability assessment methodology based on the predicted values of generator rotor angles under varying operating conditions for predefined contingency set through Radial Basis Function Neural Network (RBFNN. The real and reactive power loads are taken as input features for training of the neural network. Principal Component Analysis (PCA is used for dimensionality reduction of the input data set to select informative features. The proposed method is tested on IEEE-39 bus test system and the results obtained for transient stability assessment through predicted rotor angles are promising.
Mary Opokua Ansong; Hong-Xing Yao; Jun Steed Huang
2013-01-01
The performance of a proposed compact radial basis function was compared with the sigmoid basis function and the gaussian-radial basis function neural networks in 3D wireless sensor routing topology control, in underground mine rescue operation. Optimised errors among other parameters were examined in addition to scalability and time efficiency. To make the routing path efficient in emergency situations, the sensor sequence and deployment as well as transmission range were carefully considere...
Critical heat flux (CHF) is an important parameter for the design of nuclear reactors. Although many experimental and theoretical researches have been performed, there is not a single correlation to predict CHF because it is influenced by many parameters. These parameters are based on fixed inlet, local and fixed outlet conditions. Artificial neural networks (ANNs) have been applied to a wide variety of different areas such as prediction, approximation, modeling and classification. In this study, two types of neural networks, radial basis function (RBF) and multilayer perceptron (MLP), are trained with the experimental CHF data and their performances are compared. RBF predicts CHF with root mean square (RMS) errors of 0.24%, 7.9%, 0.16% and MLP predicts CHF with RMS errors of 1.29%, 8.31% and 2.71%, in fixed inlet conditions, local conditions and fixed outlet conditions, respectively. The results show that neural networks with RBF structure have superior performance in CHF data prediction over MLP neural networks. The parametric trends of CHF obtained by the trained ANNs are also evaluated and results reported
An on-line training radial basis function neural network for optimum operation of the UPFC
Farrag, Mohamed; Putrus, Ghanim
2011-01-01
The concept of Flexible A.C. Transmission Systems (FACTS) technology was developed to enhance the performance of electric power networks (both in steady-state and transient-state) and to make better utilization of existing power transmission facilities. The continuous improvement in power ratings and switching performance of power electronic devices together with advances in circuit design and control techniques are making this concept and devices employed in FACTS more commercially attractiv...
Lei Wang; Cheng Shao; Hai Wang; Hong Wu
2006-01-01
Membrane technology has found wide applications in the petrochemical industry, mainly in the purification and recovery of the hydrogen resources. Accurate prediction of the membrane separation performance plays an important role in carrying out advanced process control (APC). For the first time, a soft-sensor model for the membrane separation process has been established based on the radial basis function (RBF) neural networks. The main performance parameters, i.e, permeate hydrogen concentration, permeate gas flux, and residue hydrogen concentration, are estimated quantitatively by measuring the operating temperature, feed-side pressure, permeate-side pressure, residue-side pressure, feed-gas flux, and feed-hydrogen concentration excluding flow structure, membrane parameters, and other compositions. The predicted results can gain the desired effects. The effectiveness of this novel approach lays a foundation for integrating control technology and optimizing the operation of the gas membrane separation process.
Meng, Qinggang; Lee, M. H.
2007-03-01
Advanced autonomous artificial systems will need incremental learning and adaptive abilities similar to those seen in humans. Knowledge from biology, psychology and neuroscience is now inspiring new approaches for systems that have sensory-motor capabilities and operate in complex environments. Eye/hand coordination is an important cross-modal cognitive function, and is also typical of many of the other coordinations that must be involved in the control and operation of embodied intelligent systems. This paper examines a biologically inspired approach for incrementally constructing compact mapping networks for eye/hand coordination. We present a simplified node-decoupled extended Kalman filter for radial basis function networks, and compare this with other learning algorithms. An experimental system consisting of a robot arm and a pan-and-tilt head with a colour camera is used to produce results and test the algorithms in this paper. We also present three approaches for adapting to structural changes during eye/hand coordination tasks, and the robustness of the algorithms under noise are investigated. The learning and adaptation approaches in this paper have similarities with current ideas about neural growth in the brains of humans and animals during tool-use, and infants during early cognitive development.
Seerat Fatima
2011-10-01
Full Text Available The purpose of this study is to classify the networks according to functions they performed, especially scrutinize their structures. The research concentrates on the influence of these functional networks on the internationalization process of small and medium sized companies (SME in developing countries. What are the different types of support being provided by network partners? What is the structure of the existing network? The research part is inductive, qualitative and based on case study. The study’s findings illustrate the subtleties of how various network partners interact with entrepreneurs to penetrate, integrate and extend their international markets. Networks can help entrepreneurs expose themselves to new opportunities, obtain knowledge, learn from experiences, and benefit from the synergistic effect of pooled resources. Another contribution of this paper is that it identifies structures of the functional networks, till date networks are classified on the basis of extent of support they provide, not on what support they provide, thus advancing the literature.
Meghabghab, George
2001-01-01
Discusses the evaluation of search engines and uses neural networks in stochastic simulation of the number of rejected Web pages per search query. Topics include the iterative radial basis functions (RBF) neural network; precision; response time; coverage; Boolean logic; regression models; crawling algorithms; and implications for search engine…
Rai, H. M.; Trivedi, A.; Chatterjee, K.; Shukla, S.
2014-01-01
This paper employed the Daubechies wavelet transform (WT) for R-peak detection and radial basis function neural network (RBFNN) to classify the electrocardiogram (ECG) signals. Five types of ECG beats: normal beat, paced beat, left bundle branch block (LBBB) beat, right bundle branch block (RBBB) beat and premature ventricular contraction (PVC) were classified. 500 QRS complexes were arbitrarily extracted from 26 records in Massachusetts Institute of Technology-Beth Israel Hospital (MIT-BIH) arrhythmia database, which are available on Physionet website. Each and every QRS complex was represented by 21 points from p1 to p21 and these QRS complexes of each record were categorized according to types of beats. The system performance was computed using four types of parameter evaluation metrics: sensitivity, positive predictivity, specificity and classification error rate. The experimental result shows that the average values of sensitivity, positive predictivity, specificity and classification error rate are 99.8%, 99.60%, 99.90% and 0.12%, respectively with RBFNN classifier. The overall accuracy achieved for back propagation neural network (BPNN), multilayered perceptron (MLP), support vector machine (SVM) and RBFNN classifiers are 97.2%, 98.8%, 99% and 99.6%, respectively. The accuracy levels and processing time of RBFNN is higher than or comparable with BPNN, MLP and SVM classifiers.
Jingwen Tian
2013-02-01
Full Text Available Since the control system of the welding gun pose in whole‐position welding is complicated and nonlinear, an intelligent control system of welding gun pose for a pipeline welding robot based on an improved radial basis function neural network (IRBFNN and expert system (ES is presented in this paper. The structure of the IRBFNN is constructed and the improved genetic algorithm is adopted to optimize the network structure. This control system makes full use of the characteristics of the IRBFNN and the ES. The ADXRS300 micro‐mechanical gyro is used as the welding gun position sensor in this system. When the welding gun position is obtained, an appropriate pitch angle can be obtained through expert knowledge and the numeric reasoning capacity of the IRBFNN. ARM is used as the controller to drive the welding gun pitch angle step motor in order to adjust the pitch angle of the welding gun in real‐time. The experiment results show that the intelligent control system of the welding gun pose using the IRBFNN and expert system is feasible and it enhances the welding quality. This system has wide prospects for application.
Anitha, J.; Vijila, C. Kezi Selva; Hemanth, D. Jude
2010-02-01
Diabetic retinopathy (DR) is a chronic eye disease for which early detection is highly essential to avoid any fatal results. Image processing of retinal images emerge as a feasible tool for this early diagnosis. Digital image processing techniques involve image classification which is a significant technique to detect the abnormality in the eye. Various automated classification systems have been developed in the recent years but most of them lack high classification accuracy. Artificial neural networks are the widely preferred artificial intelligence technique since it yields superior results in terms of classification accuracy. In this work, Radial Basis function (RBF) neural network based bi-level classification system is proposed to differentiate abnormal DR Images and normal retinal images. The results are analyzed in terms of classification accuracy, sensitivity and specificity. A comparative analysis is performed with the results of the probabilistic classifier namely Bayesian classifier to show the superior nature of neural classifier. Experimental results show promising results for the neural classifier in terms of the performance measures.
Yang, Yanchao; Jiang, Hong; Liu, Congbin; Lan, Zhongli
2013-03-01
Cognitive radio (CR) is an intelligent wireless communication system which can dynamically adjust the parameters to improve system performance depending on the environmental change and quality of service. The core technology for CR is the design of cognitive engine, which introduces reasoning and learning methods in the field of artificial intelligence, to achieve the perception, adaptation and learning capability. Considering the dynamical wireless environment and demands, this paper proposes a design of cognitive engine based on the rough sets (RS) and radial basis function neural network (RBF_NN). The method uses experienced knowledge and environment information processed by RS module to train the RBF_NN, and then the learning model is used to reconfigure communication parameters to allocate resources rationally and improve system performance. After training learning model, the performance is evaluated according to two benchmark functions. The simulation results demonstrate the effectiveness of the model and the proposed cognitive engine can effectively achieve the goal of learning and reconfiguration in cognitive radio.
Ebtehaj, Isa; Bonakdari, Hossein; Zaji, Amir Hossein
2016-01-01
In this study, an expert system with a radial basis function neural network (RBF-NN) based on decision trees (DT) is designed to predict sediment transport in sewer pipes at the limit of deposition. First, sensitivity analysis is carried out to investigate the effect of each parameter on predicting the densimetric Froude number (Fr). The results indicate that utilizing the ratio of the median particle diameter to pipe diameter (d/D), ratio of median particle diameter to hydraulic radius (d/R) and volumetric sediment concentration (C(V)) as the input combination leads to the best Fr prediction. Subsequently, the new hybrid DT-RBF method is presented. The results of DT-RBF are compared with RBF and RBF-particle swarm optimization (PSO), which uses PSO for RBF training. It appears that DT-RBF is more accurate (R(2) = 0.934, MARE = 0.103, RMSE = 0.527, SI = 0.13, BIAS = -0.071) than the two other RBF methods. Moreover, the proposed DT-RBF model offers explicit expressions for use by practicing engineers. PMID:27386995
Ai, Yuewei; Shao, Xinyu; Jiang, Ping; Li, Peigen; Liu, Yang; Yue, Chen
2015-11-01
The welded joints of dissimilar materials have been widely used in automotive, ship and space industries. The joint quality is often evaluated by weld seam geometry, microstructures and mechanical properties. To obtain the desired weld seam geometry and improve the quality of welded joints, this paper proposes a process modeling and parameter optimization method to obtain the weld seam with minimum width and desired depth of penetration for laser butt welding of dissimilar materials. During the process, Taguchi experiments are conducted on the laser welding of the low carbon steel (Q235) and stainless steel (SUS301L-HT). The experimental results are used to develop the radial basis function neural network model, and the process parameters are optimized by genetic algorithm. The proposed method is validated by a confirmation experiment. Simultaneously, the microstructures and mechanical properties of the weld seam generated from optimal process parameters are further studied by optical microscopy and tensile strength test. Compared with the unoptimized weld seam, the welding defects are eliminated in the optimized weld seam and the mechanical properties are improved. The results show that the proposed method is effective and reliable for improving the quality of welded joints in practical production.
2014-01-01
This paper proposed a novel radial basis function (RBF) neural network model optimized by exponential decreasing inertia weight particle swarm optimization (EDIW-PSO). Based on the inertia weight decreasing strategy, we propose a new Exponential Decreasing Inertia Weight (EDIW) to improve the PSO algorithm. We use the modified EDIW-PSO algorithm to determine the centers, widths, and connection weights of RBF neural network. To assess the performance of the proposed EDIW-PSO-RBF model, we choo...
A self-organized Radial Basis Function Network (RBFN) is proposed for the problem of object extraction in Positron Emission Tomography Images of the heart. RBENs are supervised-learning networks. However, viewing the output of the networks as a fuzzy set, we have able to compute the error of the system using fuzziness measures. Thus, there is no need of target output for training the network. Besides the self-organizing feature of the network, our RBFN has a non linear output layer trained using the back-propagation algorithm. Two mathematical models of fuzzy measures have been considered: the index of fuzziness and fuzzy entropy. Preliminary results show that entropy measure produced a better extraction of healthy myocardium. (authors)
Goudarzi, Shidrokh; Haslina Hassan, Wan; Abdalla Hashim, Aisha-Hassan; Soleymani, Seyed Ahmad; Anisi, Mohammad Hossein; Zakaria, Omar M.
2016-01-01
This study aims to design a vertical handover prediction method to minimize unnecessary handovers for a mobile node (MN) during the vertical handover process. This relies on a novel method for the prediction of a received signal strength indicator (RSSI) referred to as IRBF-FFA, which is designed by utilizing the imperialist competition algorithm (ICA) to train the radial basis function (RBF), and by hybridizing with the firefly algorithm (FFA) to predict the optimal solution. The prediction accuracy of the proposed IRBF–FFA model was validated by comparing it to support vector machines (SVMs) and multilayer perceptron (MLP) models. In order to assess the model’s performance, we measured the coefficient of determination (R2), correlation coefficient (r), root mean square error (RMSE) and mean absolute percentage error (MAPE). The achieved results indicate that the IRBF–FFA model provides more precise predictions compared to different ANNs, namely, support vector machines (SVMs) and multilayer perceptron (MLP). The performance of the proposed model is analyzed through simulated and real-time RSSI measurements. The results also suggest that the IRBF–FFA model can be applied as an efficient technique for the accurate prediction of vertical handover. PMID:27438600
Panagou, Efstathios Z
2008-04-01
A radial basis function neural network was developed to determine the kinetic behavior of Listeria monocytogenes in Katiki, a traditional white acid-curd soft spreadable cheese. The applicability of the neural network approach was compared with the reparameterized Gompertz, the modified Weibull, and the Geeraerd primary models. Model performance was assessed with the root mean square error of the residuals of the model (RMSE), the regression coefficient (R2), and the F test. Commercially prepared cheese samples were artificially inoculated with a five-strain cocktail of L. monocytogenes, with an initial concentration of 10(6) CFU g(-1) and stored at 5, 10, 15, and 20 degrees C for 40 days. At each storage temperature, a pathogen viability loss profile was evident and included a shoulder, a log-linear phase, and a tailing phase. The developed neural network described the survival of L. monocytogenes equally well or slightly better than did the three primary models. The performance indices for the training subset of the network were R2 = 0.993 and RMSE = 0.214. The relevant mean values for all storage temperatures were R2 = 0.981, 0.986, and 0.985 and RMSE = 0.344, 0.256, and 0.262 for the reparameterized Gompertz, modified Weibull, and Geeraerd models, respectively. The results of the F test indicated that none of the primary models were able to describe accurately the survival of the pathogen at 5 degrees C, whereas with the neural network all fvalues were significant. The neural network and primary models all were validated under constant temperature storage conditions (12 and 17 degrees C). First or second order polynomial models were used to relate the inactivation parameters to temperature, whereas the neural network was used a one-step modeling approach. Comparison of the prediction capability was based on bias and accuracy factors and on the goodness-of-fit index. The prediction performance of the neural network approach was equal to that of the primary
Izzet Y Önel; K Burak Dalci; İbrahim Senol
2006-06-01
This paper investigates the application of induction motor stator current signature analysis (MCSA) using Park’s transform for the detection of rolling element bearing damages in three-phase induction motor. The paper ﬁrst discusses bearing faults and Park’s transform, and then gives a brief overview of the radial basis function (RBF) neural networks algorithm. Finally, system information and the experimental results are presented. Data acquisition and Park’s transform algorithm are achieved by using LabVIEW and the neural network algorithm is achieved by using MATLAB programming language. Experimental results show that it is possible to detect bearing damage in induction motors using an ANN algorithm.
Shiva Kumar
2012-01-01
Full Text Available Radial basis function neural networks (RBFNNs, which is a relatively new class of neural networks, have been investigated for their applicability for prediction of performance and emission characteristics of a diesel engine fuelled with waste cooking oil (WCO. The RBF networks were trained using the experimental data, where in load percentage, compression ratio, blend percentage, injection timing, and injection pressure were taken as the input parameters, and brake thermal efficiency (BTE, brake specific energy consumption (BSEC, exhaust gas temperature (, and engine emissions were used as the output parameters. The number of RBF centers was selected randomly. The network was initially trained using variable width values for the RBF units using a heuristic and then was trained by using fixed width values. Studies showed that RBFNN predicted results matched well with the experimental results over a wide range of operating conditions. Prediction accuracy for all the output parameters was above 90% in case of performance parameters and above 70% in case of emission parameters.
Seerat Fatima; Prof. Dr. Mujahid Ali; Sheraz Arif
2011-01-01
The purpose of this study is to classify the networks according to functions they performed, especially scrutinize their structures. The research concentrates on the influence of these functional networks on the internationalization process of small and medium sized companies (SME) in developing countries. What are the different types of support being provided by network partners? What is the structure of the existing network? The research part is inductive, qualitative and based on case stud...
Li-juan XIE; Xing-qian YE; Dong-hong LIU; Yi-bin YING
2008-01-01
Near-infrared (NIR) spectroscopy combined with chemometrics techniques was used to classify the pure bayberry juice and the one adulterated with 10% (w/w) and 20% (w/w) water. Principal component analysis (PCA) was applied to reduce the dimensions of spectral data, give information regarding a potential capability of separation of objects, and provide principal component (PC) scores for radial basis function neural networks (RBFNN). RBFNN was used to detect bayberry juice adulterant. Multiplicative scatter correction (MSC) and standard normal variate (SNV) transformation were used to preprocess spectra. The results demonstrate that PC-RBFNN with optimum parameters can separate pure bayberry juice samples from water-adulterated bayberry at a recognition rate of 97.62%, but cannot clearly detect water levels in the adulterated bayberry juice. We conclude that NIR technology can be successfully applied to detect water-adulterated bayberry juice.
In this paper, Radial Basis Function network (RBF) is used for modelling and predicting the daily global solar radiation data using other meteorological data such as air temperature, sunshine duration, and relative humidity. These data were recorded in the period 1998-2002 at Al-Madinah (Saudi Arabia) by the National Renewable Energy Laboratory. Four RBF-models have been developed for predicting the daily global solar radiation. It was found that the RBF-model which uses the sunshine duration and air temperature as input parameters, gives accurate results as the correlation coefficient in this case is 98.80%. A comparative study between developed RBF, Multilayer perceptron and conventional regression models are presented and discussed in this paper, In addition, an application for estimating the sizing of a stand-alone PV system at Al-Maidinah is presented in order to show the effectiveness of the developed RBF-model.
Kong, Chunli; Wang, Huiyi; Li, Dapeng; Zhang, Yuemei; Pan, Jinfeng; Zhu, Beiwei; Luo, Yongkang
2016-06-15
To investigate and predict quality of 2% brined common carp (Cyprinus carpio) fillets during frozen storage, free fatty acids (FFA), salt extractable protein (SEP), total sulfhydryl (SH) content, and Ca(2+)-ATPase activity were determined at 261K, 253K, and 245K, respectively. There was a dramatic increase (Pfirst 3weeks. SEP decreased to 67.31% after 17weeks at 245K, whereas it took about 7weeks and 13weeks to decrease to the same extent at 261K and 253K, respectively. Ca(2+)-ATPase activity kept decreasing to 18.28% after 7weeks at 261K. Furthermore, radial basis function neural networks (RBFNNs) were developed to predict quality (FFA, SEP, SH, and Ca(2+)-ATPase activity) of brined carp fillets during frozen storage with relative errors all within ±5%. Thus, RBFNN is a promising method to predict quality of carp fillets during storage at 245-261K. PMID:26868584
Highlights: • It is presented a new method based on Artificial Neural Network (ANN) developed to deal with accident identification in PWR nuclear power plants. • Obtained results have shown the efficiency of the referred technique. • Results obtained with this method are as good as or even better to similar optimization tools available in the literature. - Abstract: The task of monitoring a nuclear power plant consists on determining, continuously and in real time, the state of the plant’s systems in such a way to give indications of abnormalities to the operators and enable them to recognize anomalies in system behavior. The monitoring is based on readings of a large number of meters and alarm indicators which are located in the main control room of the facility. On the occurrence of a transient or of an accident on the nuclear power plant, even the most experienced operators can be confronted with conflicting indications due to the interactions between the various components of the plant systems; since a disturbance of a system can cause disturbances on another plant system, thus the operator may not be able to distinguish what is cause and what is the effect. This cognitive overload, to which operators are submitted, causes a difficulty in understanding clearly the indication of an abnormality in its initial phase of development and in taking the appropriate and immediate corrective actions to face the system failure. With this in mind, computerized monitoring systems based on artificial intelligence that could help the operators to detect and diagnose these failures have been devised and have been the subject of research. Among the techniques that can be used in such development, radial basis functions (RBFs) neural networks play an important role due to the fact that they are able to provide good approximations to functions of a finite number of real variables. This paper aims to present an application of a neural network of Gaussian radial basis
On the assumption that random interruptions in the observation process are modeled by a sequence of independent Bernoulli random variables, we firstly generalize two kinds of nonlinear filtering methods with random interruption failures in the observation based on the extended Kalman filtering (EKF) and the unscented Kalman filtering (UKF), which were shortened as GEKF and GUKF in this paper, respectively. Then the nonlinear filtering model is established by using the radial basis function neural network (RBFNN) prototypes and the network weights as state equation and the output of RBFNN to present the observation equation. Finally, we take the filtering problem under missing observed data as a special case of nonlinear filtering with random intermittent failures by setting each missing data to be zero without needing to pre-estimate the missing data, and use the GEKF-based RBFNN and the GUKF-based RBFNN to predict the ground radioactivity time series with missing data. Experimental results demonstrate that the prediction results of GUKF-based RBFNN accord well with the real ground radioactivity time series while the prediction results of GEKF-based RBFNN are divergent. (geophysics, astronomy, and astrophysics)
DU Lin-na; WU Li-hang; LU Jia-hui; GUO Wei-liang; MENG Qing-fan; JIANG Chao-jun; SHEN Si-le; TENG Li-rong
2007-01-01
Partial least squares(PLS), back-propagation neural network (BPNN) and radial basis function neural network(RBFNN) were respectively used for estalishing quantative analysis models with near infrared(NIR) diffuse reflectance spectra for determining the contents of rifampincin(RMP), isoniazid(INH) and pyrazinamide(PZA) in rifampicin isoniazid and pyrazinamide tablets. Savitzky-Golay smoothing, first derivative, second derivative, fast Fourier transform(FFT) and standard normal variate(SNV) transformation methods were applied to pretreating raw NIR diffuse reflectance spectra. The raw and pretreated spectra were divided into several regions, depending on the average spectrum and RSD spectrum. Principal component analysis(PCA) method was used for analyzing the raw and pretreated spectra in different regions in order to reduce the dimensions of input data. The optimum spectral regions and the models' parameters were chosen by comparing the root mean square error of cross-validation(RMSECV) values which were obtained by leave-one-out cross-validation method. The RMSECV values of the RBFNN models for determining the contents of RMP, INH and PZA were 0.00288, 0.00226 and 0.00341, respectively. Using these models for predicting the contents of INH, RMP and PZA in prediction set, the RMSEP values were 0.00266, 0.00227 and 0.00411, respectively. These results are better than those obtained from PLS models and BPNN models. With additional advantages of fast calculation speed and less dependence on the initial conditions, RBFNN is a suitable tool to model complex systems.
Zhiqiang Guo
Full Text Available In this paper, we propose and implement a hybrid model combining two-directional two-dimensional principal component analysis ((2D2PCA and a Radial Basis Function Neural Network (RBFNN to forecast stock market behavior. First, 36 stock market technical variables are selected as the input features, and a sliding window is used to obtain the input data of the model. Next, (2D2PCA is utilized to reduce the dimension of the data and extract its intrinsic features. Finally, an RBFNN accepts the data processed by (2D2PCA to forecast the next day's stock price or movement. The proposed model is used on the Shanghai stock market index, and the experiments show that the model achieves a good level of fitness. The proposed model is then compared with one that uses the traditional dimension reduction method principal component analysis (PCA and independent component analysis (ICA. The empirical results show that the proposed model outperforms the PCA-based model, as well as alternative models based on ICA and on the multilayer perceptron.
Guo, Zhiqiang; Wang, Huaiqing; Yang, Jie; Miller, David J
2015-01-01
In this paper, we propose and implement a hybrid model combining two-directional two-dimensional principal component analysis ((2D)2PCA) and a Radial Basis Function Neural Network (RBFNN) to forecast stock market behavior. First, 36 stock market technical variables are selected as the input features, and a sliding window is used to obtain the input data of the model. Next, (2D)2PCA is utilized to reduce the dimension of the data and extract its intrinsic features. Finally, an RBFNN accepts the data processed by (2D)2PCA to forecast the next day's stock price or movement. The proposed model is used on the Shanghai stock market index, and the experiments show that the model achieves a good level of fitness. The proposed model is then compared with one that uses the traditional dimension reduction method principal component analysis (PCA) and independent component analysis (ICA). The empirical results show that the proposed model outperforms the PCA-based model, as well as alternative models based on ICA and on the multilayer perceptron. PMID:25849483
The on-line estimation of the state of charge (SOC) of the batteries is important for the reliable running of the pure electric vehicle in practice. Because a nonlinear feature exists in the batteries and the radial-basis-function neural network (RBF NN) has good characteristics to solve the nonlinear problem, a practical method for the SOC estimation of batteries based on the RBF NN with a small number of input variables and a simplified structure is proposed. Firstly, in this paper, the model of on-line SOC estimation with the RBF NN is set. Secondly, four important factors for estimating the SOC are confirmed based on the contribution analysis method, which simplifies the input variables of the RBF NN and enhances the real-time performance of estimation. Finally, the pure electric buses with LiFePO4 Li-ion batteries running during the period of the 2010 Shanghai World Expo are considered as the experimental object. The performance of the SOC estimation is validated and evaluated by the battery data from the electric vehicle
Highlights: • Wear tests were conducted on Cu–(5–20%) W nano composite. • SEM, TEM, XRD and EDS were used to evaluate the characteristics of composite. • Wear mechanism was discussed through the distribution map and SEM. • Best trained RBFNN was developed to predict the unknown values. - Abstract: Cu–(5–20%) W composite preforms, with a density of 94% were prepared through mechanical milling, mixing, compaction, sintering and hot extrusion. The X-ray Diffraction analysis, Particle Size analysis, Transmission Electron Microscope, Scanning Electron Microscope and Energy Dispersive Spectrum were used for the characterization studies. The pore size during different sintering atmospheres and the pore size reduction during extrusion, were studied through Auto CAD 2010 software. The wear experiments were conducted using the pin-on-disc wear tester. The various regions in the wear mechanisms were identified through the wear distribution map. The Radial Basis Functional Neural Network has been used in an attempt to predict the mechanical and tribological behavior of composites, and useful conclusions have been made
Hassanzadeh, Zeinabe; Kompany-Zareh, Mohsen; Ghavami, Raouf; Gholami, Somayeh; Malek-Khatabi, Atefe
2015-10-01
The configuring of a radial basis function neural network (RBFN) consists of optimizing the architecture and the network parameters (centers, widths, and weights). Methods such as genetic algorithm (GA), K-means and cluster analysis (CA) are among center selection methods. In the most of reports on RBFN modeling optimum centers are selected among rows of descriptors matrix. A combination of RBFN and GA is introduced for better description of quantitative structure-property relationships (QSPR) models. In this method, centers are not exactly rows of the independent matrix and can be located in any point of the samples space. In the proposed approach, initial centers are randomly selected from the calibration set. Then GA changes the locations of the initially selected centers to find the optimum positions of centers from the whole space of scores matrix, in order to obtain highest prediction ability. This approach is called whole space GA-RBFN (wsGA-RBFN) and applied to predict the adsorption coefficients (logk), of 40 small molecules on the surface of multi-walled carbon nanotubes (MWCNTs). The data consists of five solute descriptors [R, π, α, β, V] of the molecules and known as data set1. Prediction ability of wsGA-RBFN is compared to GA-RBFN and MLR models. The obtained Q2 values for wsGA-RBFN, GA-RBFN and MLR are 0.95, 0.85, and 0.78, respectively, which shows the merit of wsGA-RBFN. The method is also applied on the logarithm of surface area normalized adsorption coefficients (logKSA), of organic compounds (OCs) on MWCNTs surface. The data set2 includes 69 aromatic molecules with 13 physicochemical properties of the OCs. Thirty-nine of these molecules were similar to those of data set1 and the others were aromatic compounds included of small and big molecules. Prediction ability of wsGA-RBFN for second data set was compared to GA-RBF. The Q2 values for wsGA-RBFN and GA-RBF are obtained as 0.89 and 0.80, respectively.
Generalized Network Externality Function
A. Paothong; G.S. Ladde
2012-01-01
In this work, we focus on the development of mathematical modeling of network externality processes. The introduction of the generalized network externality function provides a unified source of a tool for developing and analyzing the planning, policy and performance of the network externality process and network goods/services in a systematic way. This leads to fulfill all existing network externality assumptions as special cases. We study its properties and applications. This study provides...
Dynamic programming using radial basis functions
Junge, Oliver; Schreiber, Alex
2014-01-01
We propose a discretization of the optimality principle in dynamic programming based on radial basis functions and Shepard's moving least squares approximation method. We prove convergence of the approximate optimal value function to the true one and present several numerical experiments.
Analysis of radial basis function interpolation approach
Zou You-Long; Hu Fa-Long; Zhou Can-Can; Li Chao-Liu; Dunn Keh-Jim
2013-01-01
The radial basis function (RBF) interpolation approach proposed by Freedman is used to solve inverse problems encountered in well-logging and other petrophysical issues. The approach is to predict petrophysical properties in the laboratory on the basis of physical rock datasets, which include the formation factor, viscosity, permeability, and molecular composition. However, this approach does not consider the effect of spatial distribution of the calibration data on the interpolation result. This study proposes a new RBF interpolation approach based on the Freedman's RBF interpolation approach, by which the unit basis functions are uniformly populated in the space domain. The inverse results of the two approaches are comparatively analyzed by using our datasets. We determine that although the interpolation effects of the two approaches are equivalent, the new approach is more flexible and beneficial for reducing the number of basis functions when the database is large, resulting in simplification of the interpolation function expression. However, the predicted results of the central data are not sufficiently satisfied when the data clusters are far apart.
Bioprinting: Functional droplet networks
Durmus, Naside Gozde; Tasoglu, Savas; Demirci, Utkan
2013-06-01
Tissue-mimicking printed networks of droplets separated by lipid bilayers that can be functionalized with membrane proteins are able to spontaneously fold and transmit electrical currents along predefined paths.
陈向东; 唐景山; 宋爱国
2000-01-01
In this paper,an improved radial basis function networks named hidden neuron modifiable radial basis function (IINMRBF) networks is proposed for target classification,and evolutionary programming (EP) is used as a learning algorithm to determine and modify the hidden neuron of HNMRBF nets.The result of passive sonar target classification shows that HNMRBF nets can effectively solve the problem of traditional neural networks,i.e.learning new target patterns on-line will cause forgetting of the old patterns.%本文提出了一种改进的称为隐神经元可调径向基函数神经网络(HNMRBF)，并且应用进化规划算法作为聚类算法来决定和修改HNMRBF网络的隐神经元.最后，我们使用基于进化规划算法的HMRBF网络来进行被动声纳信号目标的分类，结果表明HNMRBF网络能有效地解决用传统神经网络时所遇到的问题，即在线学习新的目标模式时往往会遗忘旧的模式.
翟红林; 陈晓峰; 陈兴国; 胡之德
2004-01-01
结合了径向基神经网络较强模式分类能力与概率神经网络运算简单的优点,提出了一种径向基概率神经网络模型,并应用于小儿厌食症的辅助诊断,通过对119例样本数据的处理,获得了92.4%的准确率.此外,偏最小二乘法的分析结果表明,Zn元素与小儿厌食症关系最为紧密.%Based on a radial basis function probabilistic neural network model, which combined the powerful capability of the pattern classification of radial basis function neural network and the simple operation of probabilistic neural network, a new approach of assisted diagnosis for infancy anorexia was developed and applied to 119 samples, with an accuracy rate of 92%. In addition, the result of partial least squares analysis indicated that Zn was the most important element that was closely related to infancy anorexia..
Virtual network functions orchestration in wireless networks
Riggio, Roberto; Bradai, Abbas; Rasheed, Tinku; Schulz-Zander, Julius; Kuklinski, Slawomir; Ahmed, Toufik
2015-01-01
Network Function Virtualization (NFV) is emerging as one of the most innovative concepts in the networking landscape. By migrating network functions from dedicated mid-dleboxes to general purpose computing platforms, NFV can effectively reduce the cost to deploy and to operate large networks. However, in order to achieve its full potential, NFV needs to encompass also the radio access network allowing Mobile Virtual Network Operators to deploy custom resource allocation solutions within their...
The Interpolation Theory of Radial Basis Functions
Baxter, Brad
2010-01-01
In this dissertation, it is first shown that, when the radial basis function is a $p$-norm and $1 2$. Specifically, for every $p > 2$, we construct a set of different points in some $\\Rd$ for which the interpolation matrix is singular. The greater part of this work investigates the sensitivity of radial basis function interpolants to changes in the function values at the interpolation points. Our early results show that it is possible to recast the work of Ball, Narcowich and Ward in the language of distributional Fourier transforms in an elegant way. We then use this language to study the interpolation matrices generated by subsets of regular grids. In particular, we are able to extend the classical theory of Toeplitz operators to calculate sharp bounds on the spectra of such matrices. Applying our understanding of these spectra, we construct preconditioners for the conjugate gradient solution of the interpolation equations. Our main result is that the number of steps required to achieve solution of the lin...
Spherical radial basis functions, theory and applications
Hubbert, Simon; Morton, Tanya M
2015-01-01
This book is the first to be devoted to the theory and applications of spherical (radial) basis functions (SBFs), which is rapidly emerging as one of the most promising techniques for solving problems where approximations are needed on the surface of a sphere. The aim of the book is to provide enough theoretical and practical details for the reader to be able to implement the SBF methods to solve real world problems. The authors stress the close connection between the theory of SBFs and that of the more well-known family of radial basis functions (RBFs), which are well-established tools for solving approximation theory problems on more general domains. The unique solvability of the SBF interpolation method for data fitting problems is established and an in-depth investigation of its accuracy is provided. Two chapters are devoted to partial differential equations (PDEs). One deals with the practical implementation of an SBF-based solution to an elliptic PDE and another which describes an SBF approach for solvi...
Speech Recognition Oriented Vowel Classification Using Temporal Radial Basis Functions
Guezouri, Mustapha; Benyettou, Abdelkader
2009-01-01
The recent resurgence of interest in spatio-temporal neural network as speech recognition tool motivates the present investigation. In this paper an approach was developed based on temporal radial basis function "TRBF" looking to many advantages: few parameters, speed convergence and time invariance. This application aims to identify vowels taken from natural speech samples from the Timit corpus of American speech. We report a recognition accuracy of 98.06 percent in training and 90.13 in test on a subset of 6 vowel phonemes, with the possibility to expend the vowel sets in future.
Using a Mahalanobis-like distance to train Radial Basis Neural Networks
Valls, José M.; Aler, Ricardo; Fernández, Óscar
2005-01-01
Radial Basis Neural Networks (RBNN) can approximate any regular function and have a faster training phase than other similar neural networks. However, the activation of each neuron depends on the euclidean distance between a pattern and the neuron center. Therefore, the activation function is symmetrical and all attributes are considered equally relevant. This could be solved by altering the metric used in the activation function (i.e. using non-symmetrical metrics). The Mahalanobis distance ...
Learning Mixtures of Truncated Basis Functions from Data
Langseth, Helge; Nielsen, Thomas Dyhre; Pérez-Bernabé, Inmaculada;
2014-01-01
significantly faster, and therefore indicate that the MoTBF framework can be used for inference and learning in reasonably sized domains. Furthermore, we show how a particular sub- class of MoTBF potentials (learnable by the proposed methods) can be exploited to significantly reduce complexity during inference.......In this paper we investigate methods for learning hybrid Bayesian networks from data. First we utilize a kernel density estimate of the data in order to translate the data into a mixture of truncated basis functions (MoTBF) representation using a convex optimization technique. When utilizing a...... propose an alternative learning method that relies on the cumulative distribution function of the data. Empirical results demonstrate the usefulness of the approaches: Even though the methods produce estimators that are slightly poorer than the state of the art (in terms of log-likelihood), they are...
Molecular basis of whey protein functionality
Zoran Herceg; Anet Režek; Suzana Rimac Brnčić
2008-01-01
Whey proteins constitute 18-20% of total milk protein content. Their nutritive value, accompanied by diverse physico-chemical and functional properties, make whey proteins widely applicable in food industry. Highly risen demands of consumers for tastier, healthier, suitable and more natural food products have given dairy industry the opportunity for development and enrichment of food products with whey protein supplements in order to increase their functional and nutritive properties. Develop...
赵高强; 傅(王乐)
2011-01-01
风速预测对风电场和电力系统的运行都具有重要意义.为了提高风速预测的精度,提出了一种基于量子粒子群-径向基神经网络模型,在确定网络隐含层节点数后,将RBF网络的参数编码成优化算法中的粒子个体进行优化,在全局空间搜索最优适应值的参数.用优化后的神经网络进行风速预测,实例结果表明该算法在预测速度和精度上都得到了提高.%Forecasting of wind speed is very important to the operation of wind power plants and power systems.To improve the wind speed forecasting accuracy, a model based on quantum- behaved particle swarm optimization and radial basis function neural network algorithm is proposed.After the number of nodes in hidden layer is confirmed and all parameters of RBF nets are coded to individual particles to optimize learning algorithm, the parameter of optimal-adaptive values can be searched in global space.Using the optimized neural network to forecast wind speed,and some calculation examples were abtained.The results showed that the new method can improve the speed and accuracy of prediction.
Madsen, Per Printz
1998-01-01
The purpose of this paper is to describe a neural network (SNN), that is based on Shannons ideas of reconstruction of a real continuous function from its samples. The basic function, used in this network, is the Sinc-function. Two learning algorithms are described. A simple one called IM...
Madsen, Per Printz
1999-01-01
The purpose of this paper is to describe a neural network (SNN), that is based on Shannons ideas of reconstruction of a real continuous function from its samples. The basic function, used in this network, is the Sinc-function. Two learning algorithms are described. A simple one called IM...
Chennubhotla Chakra; Wu Chuang; Farkas Illés J; Bahar Ivet; Oltvai Zoltán N
2006-01-01
Abstract Background Signal recognition and information processing is a fundamental cellular function, which in part involves comprehensive transcriptional regulatory (TR) mechanisms carried out in response to complex environmental signals in the context of the cell's own internal state. However, the network topological basis of developing such integrated responses remains poorly understood. Results By studying the TR network of the yeast Saccharomyces cerevisiae we show that an intermediate l...
吴洪岩; 刘淑华; 张嵛
2009-01-01
在复杂连续环境下,强化学习系统的状态空间面临维数灾难问题,需要采取量化的方法,降低输入空间的复杂度.径向基神经网络(RBFNN:Radial Basis Function Neural Networks)具有较强的函数逼近能力及泛化能力,由此提出了基于径向基神经网络的Q学习方法,并将其应用于单机器人的自主导航.在基于径向基神经网络的强化学习系统中,用径向基神经网络逼近状态空间和Q函数,使学习系统具有良好的泛化能力.仿真结果表明,该导航方法具有较强的避碰能力,提高了机器人对环境的适应能力.
EEG Source Reconstruction using Sparse Basis Function Representations
Hansen, Sofie Therese; Hansen, Lars Kai
2014-01-01
State of the art performance of 3D EEG imaging is based on reconstruction using spatial basis function representations. In this work we augment the Variational Garrote (VG) approach for sparse approximation to incorporate spatial basis functions. As VG handles the bias variance trade-off with cross...
Kauffman networks with threshold functions
Greil, Florian; Drossel, Barbara
2007-01-01
We investigate Threshold Random Boolean Networks with $K = 2$ inputs per node, which are equivalent to Kauffman networks, with only part of the canalyzing functions as update functions. According to the simplest consideration these networks should be critical but it turns out that they show a rich variety of behaviors, including periodic and chaotic oscillations. The results are supported by analytical calculations and computer simulations.
A Discrete Adapted Hierarchical Basis Solver For Radial Basis Function Interpolation
Castrillon-Candas, Julio Enrique; Eijkhout, Victor
2011-01-01
In this paper we develop a discrete Hierarchical Basis (HB) to efficiently solve the Radial Basis Function (RBF) interpolation problem with variable polynomial order. The HB forms an orthogonal set and is adapted to the kernel seed function and the placement of the interpolation nodes. Moreover, this basis is orthogonal to a set of polynomials up to a given order defined on the interpolating nodes. We are thus able to decouple the RBF interpolation problem for any order of the polynomial interpolation and solve it in two steps: (1) The polynomial orthogonal RBF interpolation problem is efficiently solved in the transformed HB basis with a GMRES iteration and a diagonal, or block SSOR preconditioner. (2) The residual is then projected onto an orthonormal polynomial basis. We apply our approach on several test cases to study its effectiveness, including an application to the Best Linear Unbiased Estimator regression problem.
Network-based functional enrichment
Poirel Christopher L
2011-11-01
Full Text Available Abstract Background Many methods have been developed to infer and reason about molecular interaction networks. These approaches often yield networks with hundreds or thousands of nodes and up to an order of magnitude more edges. It is often desirable to summarize the biological information in such networks. A very common approach is to use gene function enrichment analysis for this task. A major drawback of this method is that it ignores information about the edges in the network being analyzed, i.e., it treats the network simply as a set of genes. In this paper, we introduce a novel method for functional enrichment that explicitly takes network interactions into account. Results Our approach naturally generalizes Fisher’s exact test, a gene set-based technique. Given a function of interest, we compute the subgraph of the network induced by genes annotated to this function. We use the sequence of sizes of the connected components of this sub-network to estimate its connectivity. We estimate the statistical significance of the connectivity empirically by a permutation test. We present three applications of our method: i determine which functions are enriched in a given network, ii given a network and an interesting sub-network of genes within that network, determine which functions are enriched in the sub-network, and iii given two networks, determine the functions for which the connectivity improves when we merge the second network into the first. Through these applications, we show that our approach is a natural alternative to network clustering algorithms. Conclusions We presented a novel approach to functional enrichment that takes into account the pairwise relationships among genes annotated by a particular function. Each of the three applications discovers highly relevant functions. We used our methods to study biological data from three different organisms. Our results demonstrate the wide applicability of our methods. Our algorithms are
Representation of Functional Data in Neural Networks
Rossi, Fabrice; Conan-Guez, Brieuc; Verleysen, Michel
2005-01-01
Functional Data Analysis (FDA) is an extension of traditional data analysis to functional data, for example spectra, temporal series, spatio-temporal images, gesture recognition data, etc. Functional data are rarely known in practice; usually a regular or irregular sampling is known. For this reason, some processing is needed in order to benefit from the smooth character of functional data in the analysis methods. This paper shows how to extend the Radial-Basis Function Networks (RBFN) and Multi-Layer Perceptron (MLP) models to functional data inputs, in particular when the latter are known through lists of input-output pairs. Various possibilities for functional processing are discussed, including the projection on smooth bases, Functional Principal Component Analysis, functional centering and reduction, and the use of differential operators. It is shown how to incorporate these functional processing into the RBFN and MLP models. The functional approach is illustrated on a benchmark of spectrometric data ana...
陈晶; 王文圣; 李跃清
2011-01-01
将集对分析与径向基函数神经网络结合,提出了集对分析径向基函数神经网络预测模型.模型思路是将研究对象t-1时和t时的影响因子集构造为集对并计算联系度,由联系度的同一度、差异度、对立度及研究对象t-1时的值为输入,研究对象t时的值为输出,构建径向基函数神经网络.以年径流预测为例研究表明,模型结构清晰、步骤明确、预测精度较高,为集对分析应用于水文预测提供了新思路.%The proposed SPA-RBFNN prediction model is a combination of set pair analysis (SPA) and radial basis function neural network (RBFNN). The idea of SPA-RBFNN, firstly sets the impact factors of research object in both t-1 and t period of time as a pair, and calculates the connection degree of the pair, then uses its calculated homology degree, difference degree and antinomy degree, along with the situation of research object in t-1 period of time as model input, the situation of research object in t period of time as model output, finally finishes the model establishment. The case study of annual runoff prediction shows that SPARBFNN prediction model is characterized by explicit structure, easy realization and good prediction ability. The model construction idea provides a new thinking for the application of SPA in solving the hydrological prediction problems.
Aging and Functional Brain Networks
Tomasi, Dardo; Volkow, Nora D.
2011-01-01
Aging is associated with changes in human brain anatomy and function and cognitive decline. Recent studies suggest the aging decline of major functional connectivity hubs in the “default-mode” network (DMN). Aging effects on other networks, however, are largely unknown. We hypothesized that aging would be associated with a decline of short- and long-range functional connectivity density (FCD) hubs in the DMN. To test this hypothesis we evaluated resting-state datasets corresponding to 913 hea...
Construction of `Wachspress Type' Rational Basis Functions over Rectangles
P L Powar; S S Rana
2000-02-01
In the present paper, we have constructed rational basis functions of 0 class over rectangular elements with wider choice of denominator function. This construction yields additional number of interior nodes. Hence, extra nodal points and the flexibility of denominator function suggest better approximation.
Dynamic Analysis of Wind Turbine Blades Using Radial Basis Functions
Ming-Hung Hsu
2011-01-01
Wind turbine blades play important roles in wind energy generation. The dynamic problems associated with wind turbine blades are formulated using radial basis functions. The radial basis function procedure is used to transform partial differential equations, which represent the dynamic behavior of wind turbine blades, into a discrete eigenvalue problem. Numerical results demonstrate that rotational speed significantly impacts the first frequency of a wind turbine blade. Moreover, the...
Aging and functional brain networks
Tomasi D.; Tomasi, D.; Volkow, N.D.
2011-07-11
Aging is associated with changes in human brain anatomy and function and cognitive decline. Recent studies suggest the aging decline of major functional connectivity hubs in the 'default-mode' network (DMN). Aging effects on other networks, however, are largely unknown. We hypothesized that aging would be associated with a decline of short- and long-range functional connectivity density (FCD) hubs in the DMN. To test this hypothesis, we evaluated resting-state data sets corresponding to 913 healthy subjects from a public magnetic resonance imaging database using functional connectivity density mapping (FCDM), a voxelwise and data-driven approach, together with parallel computing. Aging was associated with pronounced long-range FCD decreases in DMN and dorsal attention network (DAN) and with increases in somatosensory and subcortical networks. Aging effects in these networks were stronger for long-range than for short-range FCD and were also detected at the level of the main functional hubs. Females had higher short- and long-range FCD in DMN and lower FCD in the somatosensory network than males, but the gender by age interaction effects were not significant for any of the networks or hubs. These findings suggest that long-range connections may be more vulnerable to aging effects than short-range connections and that, in addition to the DMN, the DAN is also sensitive to aging effects, which could underlie the deterioration of attention processes that occurs with aging.
Functional Aspects of Biological Networks
Sneppen, Kim
2007-03-01
We discuss biological networks with respect to 1) relative positioning and importance of high degree nodes, 2) function and signaling, 3) logic and dynamics of regulation. Visually the soft modularity of many real world networks can be characterized in terms of number of high and low degrees nodes positioned relative to each other in a landscape analogue with mountains (high-degree nodes) and valleys (low-degree nodes). In these terms biological networks looks like rugged landscapes with separated peaks, hub proteins, which each are roughly as essential as any of the individual proteins on the periphery of the hub. Within each sup-domain of a molecular network one can often identify dynamical feedback mechanisms that falls into combinations of positive and negative feedback circuits. We will illustrate this with examples taken from phage regulation and bacterial uptake and regulation of small molecules. In particular we find that a double negative regulation often are replaced by a single positive link in unrelated organisms with same functional requirements. Overall we argue that network topology primarily reflects functional constraints. References: S. Maslov and K. Sneppen. ``Computational architecture of the yeast regulatory network." Phys. Biol. 2:94 (2005) A. Trusina et al. ``Functional alignment of regulatory networks: A study of temerate phages". Plos Computational Biology 1:7 (2005). J.B. Axelsen et al. ``Degree Landscapes in Scale-Free Networks" physics/0512075 (2005). A. Trusina et al. ``Hierarchy and Anti-Hierarchy in Real and Scale Free networks." PRL 92:178702 (2004) S. Semsey et al. ``Genetic Regulation of Fluxes: Iron Homeostasis of Escherichia coli". (2006) q-bio.MN/0609042
Świetlicka, Izabela; Muszyński, Siemowit; Marzec, Agata
2015-04-01
The presented work covers the problem of developing a method of extruded bread classification with the application of artificial neural networks. Extruded flat graham, corn, and rye breads differening in water activity were used. The breads were subjected to the compression test with simultaneous registration of acoustic signal. The amplitude-time records were analyzed both in time and frequency domains. Acoustic emission signal parameters: single energy, counts, amplitude, and duration acoustic emission were determined for the breads in four water activities: initial (0.362 for rye, 0.377 for corn, and 0.371 for graham bread), 0.432, 0.529, and 0.648. For classification and the clustering process, radial basis function, and self-organizing maps (Kohonen network) were used. Artificial neural networks were examined with respect to their ability to classify or to cluster samples according to the bread type, water activity value, and both of them. The best examination results were achieved by the radial basis function network in classification according to water activity (88%), while the self-organizing maps network yielded 81% during bread type clustering.
Acoustics of a flanged cylindrical pipe using singular basis functions
Amir; Matzner; Shtrikman
2000-02-01
The problem of acoustic radiation from a cylindrical pipe with an infinite flange has been discussed in a number of papers. The most common approach is to decompose the field inside the pipe over a basis of Bessel functions. A very large number of basis functions is usually required, with a large degree of ripple appearing as an artifact in the solution. In this paper it is shown that a close analysis of the velocity field near the corner yields a new family of functions, which are called "edge functions." Using this set of functions as test functions and applying the moment method on the boundary between the waveguide and free space, a solution is obtained with greatly improved convergence properties and no ripple. PMID:10687680
Point Set Denoising Using Bootstrap-Based Radial Basis Function
Ramli, Ahmad; Abd. Majid, Ahmad
2016-01-01
This paper examines the application of a bootstrap test error estimation of radial basis functions, specifically thin-plate spline fitting, in surface smoothing. The presence of noisy data is a common issue of the point set model that is generated from 3D scanning devices, and hence, point set denoising is one of the main concerns in point set modelling. Bootstrap test error estimation, which is applied when searching for the smoothing parameters of radial basis functions, is revisited. The main contribution of this paper is a smoothing algorithm that relies on a bootstrap-based radial basis function. The proposed method incorporates a k-nearest neighbour search and then projects the point set to the approximated thin-plate spline surface. Therefore, the denoising process is achieved, and the features are well preserved. A comparison of the proposed method with other smoothing methods is also carried out in this study. PMID:27315105
Speech/Nonspeech Detection Using Minimal Walsh Basis Functions
Pwint Moe
2007-01-01
Full Text Available This paper presents a new method to detect speech/nonspeech components of a given noisy signal. Employing the combination of binary Walsh basis functions and an analysis-synthesis scheme, the original noisy speech signal is modified first. From the modified signals, the speech components are distinguished from the nonspeech components by using a simple decision scheme. Minimal number of Walsh basis functions to be applied is determined using singular value decomposition (SVD. The main advantages of the proposed method are low computational complexity, less parameters to be adjusted, and simple implementation. It is observed that the use of Walsh basis functions makes the proposed algorithm efficiently applicable in real-world situations where processing time is crucial. Simulation results indicate that the proposed algorithm achieves high-speech and nonspeech detection rates while maintaining a low error rate for different noisy conditions.
Function approximation in inhibitory networks.
Tripp, Bryan; Eliasmith, Chris
2016-05-01
In performance-optimized artificial neural networks, such as convolutional networks, each neuron makes excitatory connections with some of its targets and inhibitory connections with others. In contrast, physiological neurons are typically either excitatory or inhibitory, not both. This is a puzzle, because it seems to constrain computation, and because there are several counter-examples that suggest that it may not be a physiological necessity. Parisien et al. (2008) showed that any mixture of excitatory and inhibitory functional connections could be realized by a purely excitatory projection in parallel with a two-synapse projection through an inhibitory population. They showed that this works well with ratios of excitatory and inhibitory neurons that are realistic for the neocortex, suggesting that perhaps the cortex efficiently works around this apparent computational constraint. Extending this work, we show here that mixed excitatory and inhibitory functional connections can also be realized in networks that are dominated by inhibition, such as those of the basal ganglia. Further, we show that the function-approximation capacity of such connections is comparable to that of idealized mixed-weight connections. We also study whether such connections are viable in recurrent networks, and find that such recurrent networks can flexibly exhibit a wide range of dynamics. These results offer a new perspective on computation in the basal ganglia, and also perhaps on inhibitory networks within the cortex. PMID:26963256
Optimal Piecewise Linear Basis Functions in Two Dimensions
Brooks III, E D; Szoke, A
2009-01-26
We use a variational approach to optimize the center point coefficients associated with the piecewise linear basis functions introduced by Stone and Adams [1], for polygonal zones in two Cartesian dimensions. Our strategy provides optimal center point coefficients, as a function of the location of the center point, by minimizing the error induced when the basis function interpolation is used for the solution of the time independent diffusion equation within the polygonal zone. By using optimal center point coefficients, one expects to minimize the errors that occur when these basis functions are used to discretize diffusion equations, or transport equations in optically thick zones (where they approach the solution of the diffusion equation). Our optimal center point coefficients satisfy the requirements placed upon the basis functions for any location of the center point. We also find that the location of the center point can be optimized, but this requires numerical calculations. Curiously, the optimum center point location is independent of the values of the dependent variable on the corners only for quadrilaterals.
Basis convergence of range-separated density-functional theory
Range-separated density-functional theory (DFT) is an alternative approach to Kohn-Sham density-functional theory. The strategy of range-separated density-functional theory consists in separating the Coulomb electron-electron interaction into long-range and short-range components and treating the long-range part by an explicit many-body wave-function method and the short-range part by a density-functional approximation. Among the advantages of using many-body methods for the long-range part of the electron-electron interaction is that they are much less sensitive to the one-electron atomic basis compared to the case of the standard Coulomb interaction. Here, we provide a detailed study of the basis convergence of range-separated density-functional theory. We study the convergence of the partial-wave expansion of the long-range wave function near the electron-electron coalescence. We show that the rate of convergence is exponential with respect to the maximal angular momentum L for the long-range wave function, whereas it is polynomial for the case of the Coulomb interaction. We also study the convergence of the long-range second-order Møller-Plesset correlation energy of four systems (He, Ne, N2, and H2O) with cardinal number X of the Dunning basis sets cc − p(C)V XZ and find that the error in the correlation energy is best fitted by an exponential in X. This leads us to propose a three-point complete-basis-set extrapolation scheme for range-separated density-functional theory based on an exponential formula
47 CFR 51.307 - Duty to provide access on an unbundled basis to network elements.
2010-10-01
... network elements. 51.307 Section 51.307 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED... Carriers § 51.307 Duty to provide access on an unbundled basis to network elements. (a) An incumbent LEC... service, nondiscriminatory access to network elements on an unbundled basis at any technically...
Network Decomposition and Maximum Independent Set Part Ⅰ: Theoretic Basis
朱松年; 朱嫱
2003-01-01
The structure and characteristics of a connected network are analyzed, and a special kind of sub-network, which can optimize the iteration processes, is discovered. Then, the sufficient and necessary conditions for obtaining the maximum independent set are deduced. It is found that the neighborhood of this sub-network possesses the similar characters, but both can never be allowed incorporated together. Particularly, it is identified that the network can be divided into two parts by a certain style, and then both of them can be transformed into a pair sets network, where the special sub-networks and their neighborhoods appear alternately distributed throughout the entire pair sets network. By use of this characteristic, the network decomposed enough without losing any solutions is obtained. All of these above will be able to make well ready for developing a much better algorithm with polynomial time bound for an odd network in the the application research part of this subject.
Caffeine Modulates Attention Network Function
Brunye, Tad T.; Mahoney, Caroline R.; Lieberman, Harris R.; Taylor, Holly A.
2010-01-01
The present work investigated the effects of caffeine (0 mg, 100 mg, 200 mg, 400 mg) on a flanker task designed to test Posner's three visual attention network functions: alerting, orienting, and executive control [Posner, M. I. (2004). "Cognitive neuroscience of attention". New York, NY: Guilford Press]. In a placebo-controlled, double-blind…
Artificial neural network modeling of fixed bed biosorption using radial basis approach
Saha, Dipendu; Bhowal, Avijit; Datta, Siddhartha
2010-04-01
In modern day scenario, biosorption is a cost effective separation technology for the removal of various pollutants from wastewater and waste streams from various process industries. The difficulties associated in rigorous mathematical modeling of a fixed bed bio-adsorbing systems due to the complexities of the process often makes the development of pure black-box artificial neural network (ANN) models particularly useful in this field. In this work, radial basis function network has been employed as ANN to model the breakthrough curves in fixed bed biosorption. The prediction has been compared to the experimental breakthrough curves of Cadmium, Lanthanum and a dye available in the literature. Results show that this network gives fairly accurate representation of the actual breakthrough curves. The results obtained from ANN modeling approach shows the better agreement between experimental and predicted breakthrough curves as the error for all these situations are within 6%.
Chennubhotla Chakra
2006-10-01
Full Text Available Abstract Background Signal recognition and information processing is a fundamental cellular function, which in part involves comprehensive transcriptional regulatory (TR mechanisms carried out in response to complex environmental signals in the context of the cell's own internal state. However, the network topological basis of developing such integrated responses remains poorly understood. Results By studying the TR network of the yeast Saccharomyces cerevisiae we show that an intermediate layer of transcription factors naturally segregates into distinct subnetworks. In these topological units transcription factors are densely interlinked in a largely hierarchical manner and respond to external signals by utilizing a fraction of these subnets. Conclusion As transcriptional regulation represents the 'slow' component of overall information processing, the identified topology suggests a model in which successive waves of transcriptional regulation originating from distinct fractions of the TR network control robust integrated responses to complex stimuli.
The Functional Requirements and Design Basis for Information Barriers
Fuller, James L.
2012-05-01
This report summarizes the results of the Information Barrier Working Group workshop held at Sandia National Laboratory in Albuquerque, NM, February 2-4, 1999. This workshop was convened to establish the functional requirements associated with warhead radiation signature information barriers, to identify the major design elements of any such system or approach, and to identify a design basis for each of these major elements. Such information forms the general design basis to be used in designing, fabricating, and evaluating the complete integrated systems developed for specific purposes.
A T Matrix Method Based upon Scalar Basis Functions
Mackowski, D.W.; Kahnert, F. M.; Mishchenko, Michael I.
2013-01-01
A surface integral formulation is developed for the T matrix of a homogenous and isotropic particle of arbitrary shape, which employs scalar basis functions represented by the translation matrix elements of the vector spherical wave functions. The formulation begins with the volume integral equation for scattering by the particle, which is transformed so that the vector and dyadic components in the equation are replaced with associated dipole and multipole level scalar harmonic wave functions. The approach leads to a volume integral formulation for the T matrix, which can be extended, by use of Green's identities, to the surface integral formulation. The result is shown to be equivalent to the traditional surface integral formulas based on the VSWF basis.
Algebraic evaluation of matrix elements in the Laguerre function basis
McCoy, A. E.; Caprio, M. A.
2016-02-01
The Laguerre functions constitute one of the fundamental basis sets for calculations in atomic and molecular electron-structure theory, with applications in hadronic and nuclear theory as well. While similar in form to the Coulomb bound-state eigenfunctions (from the Schrödinger eigenproblem) or the Coulomb-Sturmian functions (from a related Sturm-Liouville problem), the Laguerre functions, unlike these former functions, constitute a complete, discrete, orthonormal set for square-integrable functions in three dimensions. We construct the SU(1, 1) × SO(3) dynamical algebra for the Laguerre functions and apply the ideas of factorization (or supersymmetric quantum mechanics) to derive shift operators for these functions. We use the resulting algebraic framework to derive analytic expressions for matrix elements of several basic radial operators (involving powers of the radial coordinate and radial derivative) in the Laguerre function basis. We illustrate how matrix elements for more general spherical tensor operators in three dimensional space, such as the gradient, may then be constructed from these radial matrix elements.
Human brain networks function in connectome-specific harmonic waves
Atasoy, Selen; Donnelly, Isaac; Pearson, Joel
2016-01-01
A key characteristic of human brain activity is coherent, spatially distributed oscillations forming behaviour-dependent brain networks. However, a fundamental principle underlying these networks remains unknown. Here we report that functional networks of the human brain are predicted by harmonic patterns, ubiquitous throughout nature, steered by the anatomy of the human cerebral cortex, the human connectome. We introduce a new technique extending the Fourier basis to the human connectome. In...
Application of the Characteristic Basis Function Method Using CUDA
Juan Ignacio Pérez
2014-01-01
Full Text Available The characteristic basis function method (CBFM is a popular technique for efficiently solving the method of moments (MoM matrix equations. In this work, we address the adaptation of this method to a relatively new computing infrastructure provided by NVIDIA, the Compute Unified Device Architecture (CUDA, and take into account some of the limitations which appear when the geometry under analysis becomes too big to fit into the Graphics Processing Unit’s (GPU’s memory.
Practical auxiliary basis implementation of Rung 3.5 functionals.
Janesko, Benjamin G; Scalmani, Giovanni; Frisch, Michael J
2014-07-21
Approximate exchange-correlation functionals for Kohn-Sham density functional theory often benefit from incorporating exact exchange. Exact exchange is constructed from the noninteracting reference system's nonlocal one-particle density matrix γ(r(->), r(->)'). Rung 3.5 functionals attempt to balance the strengths and limitations of exact exchange using a new ingredient, a projection of γ(r(->), r(->)') onto a semilocal model density matrix γ(SL)(ρ(r(->)), ∇ρ(r(->)), r(->) - r(->)'). γSL depends on the electron density ρ(r(->) at reference point r(->), and is closely related to semilocal model exchange holes. We present a practical implementation of Rung 3.5 functionals, expanding the r(->) - r(->)' dependence of γSL in an auxiliary basis set. Energies and energy derivatives are obtained from 3D numerical integration as in standard semilocal functionals. We also present numerical tests of a range of properties, including molecular thermochemistry and kinetics, geometries and vibrational frequencies, and bandgaps and excitation energies. Rung 3.5 functionals typically provide accuracy intermediate between semilocal and hybrid approximations. Nonlocal potential contributions from γSL yield interesting successes and failures for band structures and excitation energies. The results enable and motivate continued exploration of Rung 3.5 functional forms. PMID:25053297
Product design on the basis of fuzzy quality function deployment
无
2008-01-01
In the implementation of quality function deployment (QFD), the determination of the target values of engineering characteristics is a complex decision process with multiple variables and multiple objectives that should trade off, and optimize all kinds of conflicts and constraints. A fuzzy linear programming model (FLP) is proposed. On the basis of the inherent fuzziness of QFD system, triangular fuzzy numbers are used to represent all the relationships and correlations, and then, the functional relationships between the customer needs and engineering characteristics and the functional correlations among the engineering characteristics are determined with the information in the house of quality (HoQ) fully used. The fuzzy linear programming (FLP) model aims to find the optimal target values of the engineering characteristics to maximize the customer satisfaction. Finally, the proposed method is illustrated by a numerical example.
Wave forecasting in near real time basis by neural network
Rao, S.; Mandal, S.; Prabaharan, N.
., forecasting of waves become an important aspect of marine environment. This paper presents application of the neural network (NN) with better update algorithms, namely rprop, quickprop and superSAB for wave forecasting. Measured waves off Marmagoa, Goa, India...
The Gaussian Radial Basis Function Method for Plasma Kinetic Theory
Hirvijoki, Eero; Belli, Emily; Embréus, Ola
2015-01-01
A fundamental macroscopic description of a magnetized plasma is the Vlasov equation supplemented by the nonlinear inverse-square force Fokker-Planck collision operator [Rosenbluth et al., Phys. Rev., 107, 1957]. The Vlasov part describes advection in a six-dimensional phase space whereas the collision operator involves friction and diffusion coefficients that are weighted velocity-space integrals of the particle distribution function. The Fokker-Planck collision operator is an integro-differential, bilinear operator, and numerical discretization of the operator is far from trivial. In this letter, we describe a new approach to discretize the entire kinetic system based on an expansion in Gaussian Radial Basis functions (RBFs). This approach is particularly well-suited to treat the collision operator because the friction and diffusion coefficients can be analytically calculated. Although the RBF method is known to be a powerful scheme for the interpolation of scattered multidimensional data, Gaussian RBFs also...
Practical auxiliary basis implementation of Rung 3.5 functionals
Janesko, Benjamin G., E-mail: b.janesko@tcu.edu [Department of Chemistry, Texas Christian University, Fort Worth, Texas 76129 (United States); Scalmani, Giovanni; Frisch, Michael J. [Gaussian, Inc., 340 Quinnipiac St., Bldg. 40, Wallingford, Connecticut 06492 (United States)
2014-07-21
Approximate exchange-correlation functionals for Kohn-Sham density functional theory often benefit from incorporating exact exchange. Exact exchange is constructed from the noninteracting reference system's nonlocal one-particle density matrix γ(r{sup -vector},r{sup -vector}′). Rung 3.5 functionals attempt to balance the strengths and limitations of exact exchange using a new ingredient, a projection of γ(r{sup -vector},r{sup -vector} ′) onto a semilocal model density matrix γ{sub SL}(ρ(r{sup -vector}),∇ρ(r{sup -vector}),r{sup -vector}−r{sup -vector} ′). γ{sub SL} depends on the electron density ρ(r{sup -vector}) at reference point r{sup -vector}, and is closely related to semilocal model exchange holes. We present a practical implementation of Rung 3.5 functionals, expanding the r{sup -vector}−r{sup -vector} ′ dependence of γ{sub SL} in an auxiliary basis set. Energies and energy derivatives are obtained from 3D numerical integration as in standard semilocal functionals. We also present numerical tests of a range of properties, including molecular thermochemistry and kinetics, geometries and vibrational frequencies, and bandgaps and excitation energies. Rung 3.5 functionals typically provide accuracy intermediate between semilocal and hybrid approximations. Nonlocal potential contributions from γ{sub SL} yield interesting successes and failures for band structures and excitation energies. The results enable and motivate continued exploration of Rung 3.5 functional forms.
Nikolaev, A. V.; Lamoen, D.; Partoens, B.
2016-07-01
In order to increase the accuracy of the linearized augmented plane wave (LAPW) method, we present a new approach where the plane wave basis function is augmented by two different atomic radial components constructed at two different linearization energies corresponding to two different electron bands (or energy windows). We demonstrate that this case can be reduced to the standard treatment within the LAPW paradigm where the usual basis set is enriched by the basis functions of the tight binding type, which go to zero with zero derivative at the sphere boundary. We show that the task is closely related with the problem of extended core states which is currently solved by applying the LAPW method with local orbitals (LAPW+LO). In comparison with LAPW+LO, the number of supplemented basis functions in our approach is doubled, which opens up a new channel for the extension of the LAPW and LAPW+LO basis sets. The appearance of new supplemented basis functions absent in the LAPW+LO treatment is closely related with the existence of the u ˙ l -component in the canonical LAPW method. We discuss properties of additional tight binding basis functions and apply the extended basis set for computation of electron energy bands of lanthanum (face and body centered structures) and hexagonal close packed lattice of cadmium. We demonstrate that the new treatment gives lower total energies in comparison with both canonical LAPW and LAPW+LO, with the energy difference more pronounced for intermediate and poor LAPW basis sets.
陈正洪; 王勇; 李艳
2008-01-01
A closed-chain robot has several advantages over an open-chain robot, such as high mechanical rigidity, high payload, high precision. Accurate trajectory control of a robot is essential in practical use. This paper presents an adaptive proportional integral differential (PID) control algorithm based on radial basis function (RBF) neural network for trajectory tracking of a two-degree-of-freedom (2-DOF) closed-chain robot. In this scheme, an RBF neural network is used to approximate the unknown nonlinear dynamics of the robot, at the same time, the PID parameters can be adjusted online and the high precision can be obtained. Simulation results show that the control algorithm accurately tracks a 2-DOF closed-chain robot trajectories. The results also indicate that the system robustness and tracking performance are superior to the classic PID method.
Czakó, Gábor; Szalay, Viktor; Császár, Attila G.
2006-01-01
The currently most efficient finite basis representation (FBR) method [Corey et al., in Numerical Grid Methods and Their Applications to Schrödinger Equation, NATO ASI Series C, edited by C. Cerjan (Kluwer Academic, New York, 1993), Vol. 412, p. 1; Bramley et al., J. Chem. Phys. 100, 6175 (1994)] designed specifically to deal with nondirect product bases of structures ϕnl(s)fl(u), χml(t)ϕnl(s)fl(u), etc., employs very special l-independent grids and results in a symmetric FBR. While highly efficient, this method is not general enough. For instance, it cannot deal with nondirect product bases of the above structure efficiently if the functions ϕnl(s) [and/or χml(t)] are discrete variable representation (DVR) functions of the infinite type. The optimal-generalized FBR(DVR) method [V. Szalay, J. Chem. Phys. 105, 6940 (1996)] is designed to deal with general, i.e., direct and/or nondirect product, bases and grids. This robust method, however, is too general, and its direct application can result in inefficient computer codes [Czakó et al., J. Chem. Phys. 122, 024101 (2005)]. It is shown here how the optimal-generalized FBR method can be simplified in the case of nondirect product bases of structures ϕnl(s)fl(u), χml(t)ϕnl(s)fl(u), etc. As a result the commonly used symmetric FBR is recovered and simplified nonsymmetric FBRs utilizing very special l-dependent grids are obtained. The nonsymmetric FBRs are more general than the symmetric FBR in that they can be employed efficiently even when the functions ϕnl(s) [and/or χml(t)] are DVR functions of the infinite type. Arithmetic operation counts and a simple numerical example presented show unambiguously that setting up the Hamiltonian matrix requires significantly less computer time when using one of the proposed nonsymmetric FBRs than that in the symmetric FBR. Therefore, application of this nonsymmetric FBR is more efficient than that of the symmetric FBR when one wants to diagonalize the Hamiltonian matrix
Quantifying and Analyzing the Network Basis of Genetic Complexity
Thompson, Ethan G.; Galitski, Timothy
2012-01-01
Genotype-to-phenotype maps exhibit complexity. This genetic complexity is mentioned frequently in the literature, but a consistent and quantitative definition is lacking. Here, we derive such a definition and investigate its consequences for model genetic systems. The definition equates genetic complexity with a surplus of genotypic diversity over phenotypic diversity. Applying this definition to ensembles of Boolean network models, we found that the in-degree distribution and the number of p...
Network stratification analysis for identifying function-specific network layers.
Zhang, Chuanchao; Wang, Jiguang; Zhang, Chao; Liu, Juan; Xu, Dong; Chen, Luonan
2016-04-22
A major challenge of systems biology is to capture the rewiring of biological functions (e.g. signaling pathways) in a molecular network. To address this problem, we proposed a novel computational framework, namely network stratification analysis (NetSA), to stratify the whole biological network into various function-specific network layers corresponding to particular functions (e.g. KEGG pathways), which transform the network analysis from the gene level to the functional level by integrating expression data, the gene/protein network and gene ontology information altogether. The application of NetSA in yeast and its comparison with a traditional network-partition both suggest that NetSA can more effectively reveal functional implications of network rewiring and extract significant phenotype-related biological processes. Furthermore, for time-series or stage-wise data, the function-specific network layer obtained by NetSA is also shown to be able to characterize the disease progression in a dynamic manner. In particular, when applying NetSA to hepatocellular carcinoma and type 1 diabetes, we can derive functional spectra regarding the progression of the disease, and capture active biological functions (i.e. active pathways) in different disease stages. The additional comparison between NetSA and SPIA illustrates again that NetSA could discover more complete biological functions during disease progression. Overall, NetSA provides a general framework to stratify a network into various layers of function-specific sub-networks, which can not only analyze a biological network on the functional level but also investigate gene rewiring patterns in biological processes. PMID:26879865
Explicit transverse leakage treatment using an analytic basis function expansion
An explicit method for calculating the transverse leakage is presented in this paper. The method is based upon the use of analytic basis functions, which represent individual eigenfunctions of the neutron diffusion equation. The intranodal flux solution is expressed as an eigenspace, and can be solved by using the already calculated surface currents and flux moments as boundary conditions. The salient feature of the method, therefore, is that no ad hoc presumptions are made with regard to the leakage shape. The individual eigenfunctions are calculated based upon already calculated parameters from the flux solution and response matrix solution, and therefore no additional parameters are introduced into the problem, which could lead to an unwanted increase in computation time. The new transverse leakage method is implemented in PSU's NEM code and is tested against the OECD/NEA 3D C5G7 rodded MOX benchmark and the C3 benchmark. (author)
Optimized Radial Basis Function Classifier for Multi Modal Biometrics
Anand Viswanathan
2014-07-01
Full Text Available Biometric systems can be used for the identification or verification of humans based on their physiological or behavioral features. In these systems the biometric characteristics such as fingerprints, palm-print, iris or speech can be recorded and are compared with the samples for the identification or verification. Multimodal biometrics is more accurate and solves spoof attacks than the single modal bio metrics systems. In this study, a multimodal biometric system using fingerprint images and finger-vein patterns is proposed and also an optimized Radial Basis Function (RBF kernel classifier is proposed to identify the authorized users. The extracted features from these modalities are selected by PCA and kernel PCA and combined to classify by RBF classifier. The parameters of RBF classifier is optimized by using BAT algorithm with local search. The performance of the proposed classifier is compared with the KNN classifier, Naïve Bayesian classifier and non-optimized RBF classifier.
Adaptive radial basis function mesh deformation using data reduction
Gillebaart, T.; Blom, D. S.; van Zuijlen, A. H.; Bijl, H.
2016-09-01
Radial Basis Function (RBF) mesh deformation is one of the most robust mesh deformation methods available. Using the greedy (data reduction) method in combination with an explicit boundary correction, results in an efficient method as shown in literature. However, to ensure the method remains robust, two issues are addressed: 1) how to ensure that the set of control points remains an accurate representation of the geometry in time and 2) how to use/automate the explicit boundary correction, while ensuring a high mesh quality. In this paper, we propose an adaptive RBF mesh deformation method, which ensures the set of control points always represents the geometry/displacement up to a certain (user-specified) criteria, by keeping track of the boundary error throughout the simulation and re-selecting when needed. Opposed to the unit displacement and prescribed displacement selection methods, the adaptive method is more robust, user-independent and efficient, for the cases considered. Secondly, the analysis of a single high aspect ratio cell is used to formulate an equation for the correction radius needed, depending on the characteristics of the correction function used, maximum aspect ratio, minimum first cell height and boundary error. Based on the analysis two new radial basis correction functions are derived and proposed. This proposed automated procedure is verified while varying the correction function, Reynolds number (and thus first cell height and aspect ratio) and boundary error. Finally, the parallel efficiency is studied for the two adaptive methods, unit displacement and prescribed displacement for both the CPU as well as the memory formulation with a 2D oscillating and translating airfoil with oscillating flap, a 3D flexible locally deforming tube and deforming wind turbine blade. Generally, the memory formulation requires less work (due to the large amount of work required for evaluating RBF's), but the parallel efficiency reduces due to the limited
Network Physiology reveals relations between network topology and physiological function
Bashan, Amir; Kantelhardt, Jan W; Havlin, Shlomo; Ivanov, Plamen Ch; 10.1038/ncomms1705
2012-01-01
The human organism is an integrated network where complex physiologic systems, each with its own regulatory mechanisms, continuously interact, and where failure of one system can trigger a breakdown of the entire network. Identifying and quantifying dynamical networks of diverse systems with different types of interactions is a challenge. Here, we develop a framework to probe interactions among diverse systems, and we identify a physiologic network. We find that each physiologic state is characterized by a specific network structure, demonstrating a robust interplay between network topology and function. Across physiologic states the network undergoes topological transitions associated with fast reorganization of physiologic interactions on time scales of a few minutes, indicating high network flexibility in response to perturbations. The proposed system-wide integrative approach may facilitate the development of a new field, Network Physiology.
Circadian gating of neuronal functionality: a basis for iterative metaplasticity.
Iyer, Rajashekar; Wang, Tongfei A; Gillette, Martha U
2014-01-01
Brain plasticity, the ability of the nervous system to encode experience, is a modulatory process leading to long-lasting structural and functional changes. Salient experiences induce plastic changes in neurons of the hippocampus, the basis of memory formation and recall. In the suprachiasmatic nucleus (SCN), the central circadian (~24-h) clock, experience with light at night induces changes in neuronal state, leading to circadian plasticity. The SCN's endogenous ~24-h time-generator comprises a dynamic series of functional states, which gate plastic responses. This restricts light-induced alteration in SCN state-dynamics and outputs to the nighttime. Endogenously generated circadian oscillators coordinate the cyclic states of excitability and intracellular signaling molecules that prime SCN receptivity to plasticity signals, generating nightly windows of susceptibility. We propose that this constitutes a paradigm of ~24-h iterative metaplasticity, the repeated, patterned occurrence of susceptibility to induction of neuronal plasticity. We detail effectors permissive for the cyclic susceptibility to plasticity. We consider similarities of intracellular and membrane mechanisms underlying plasticity in SCN circadian plasticity and in hippocampal long-term potentiation (LTP). The emerging prominence of the hippocampal circadian clock points to iterative metaplasticity in that tissue as well. Exploring these links holds great promise for understanding circadian shaping of synaptic plasticity, learning, and memory. PMID:25285070
Reconstructing the magnetosphere from data using radial basis functions
Andreeva, Varvara A.; Tsyganenko, Nikolai A.
2016-03-01
A new method is proposed to derive from data magnetospheric magnetic field configurations without any a priori assumptions on the geometry of electric currents. The approach utilizes large sets of archived satellite data and uses an advanced technique to represent the field as a sum of toroidal and poloidal parts, whose generating potentials Ψ1 and Ψ2 are expanded into series of radial basis functions (RBFs) with their nodes regularly distributed over the 3-D modeling domain. The method was tested by reconstructing the inner and high-latitude field within geocentric distances up to 12RE on the basis of magnetometer data of Geotail, Polar, Cluster, Time History of Events and Macroscale Interactions during Substorms, and Van Allen space probes, taken during 1995-2015. Four characteristic states of the magnetosphere before and during a disturbance have been modeled: a quiet prestorm period, storm deepening phase with progressively decreasing SYM-H index, the storm maximum around the negative peak of SYM-H, and the recovery phase. Fitting the RBF model to data faithfully resolved contributions to the total magnetic field from all principal sources, including the westward and eastward ring current, the tail current, diamagnetic currents associated with the polar cusps, and the large-scale effect of the field-aligned currents. For two main phase conditions, the model field exhibited a strong dawn-dusk asymmetry of the low-latitude magnetic depression, extending to low altitudes and partly spreading sunward from the terminator plane in the dusk sector. The RBF model was found to resolve even finer details, such as the bifurcation of the innermost tail current. The method can be further developed into a powerful tool for data-based studies of the magnetospheric currents.
Collision avoidance for a mobile robot based on radial basis function hybrid force control technique
Wen Shu-Huan
2009-01-01
Collision avoidance is always difficult in the planning path for a mobile robot. In this paper, the virtual force field between a mobile robot and an obstacle is formed and regulated to maintain a desired distance by hybrid force control algorithm. Since uncertainties from robot dynamics and obstacle degrade the performance of a collision avoidance task, intelligent control is used to compensate for the uncertainties. A radial basis function (RBF) neural network is used to regulate the force field of an accurate distance between a robot and an obstacle in this paper and then simulation studies are conducted to confirm that the proposed algorithm is effective.
Kaye, Jason; Yang, Chao
2014-01-01
Kohn-Sham density functional theory is one of the most widely used electronic structure theories. The recently developed adaptive local basis functions form an accurate and systematically improvable basis set for solving Kohn-Sham density functional theory using discontinuous Galerkin methods, requiring a small number of basis functions per atom. In this paper we develop residual-based a posteriori error estimates for the adaptive local basis approach, which can be used to guide non-uniform basis refinement for highly inhomogeneous systems such as surfaces and large molecules. The adaptive local basis functions are non-polynomial basis functions, and standard a posteriori error estimates for $hp$-refinement using polynomial basis functions do not directly apply. We generalize the error estimates for $hp$-refinement to non-polynomial basis functions. We demonstrate the practical use of the a posteriori error estimator in performing three-dimensional Kohn-Sham density functional theory calculations for quasi-2D...
The statistical basis of neural network algorithms: theory, applications, and caveats
There is a growing interest in the use of algorithms based on artificial neural networks and related methods in order to perform data analyses, and even triggering, in modern high energy physics experiments. For the increasingly complex tasks faced by the HELP community, they are becoming more and more attractive, especially in view of their apparent power and case of implementation. Common to the methods under consideration is their use of correlations between input variables. Frequently, the algorithms are treated as black-boxes which are essentially incomprehensible, but provide almost magically good results. This paper describes in some detail the statistical basis by which these techniques actually function, and its connection to classical methods. Strong emphases are made on: the dangers of the blind application of these newer techniques and some methods to use them more wisely. Specific examples of relevance to high energy physics, and, in particular, to particle identification, are constructed to illustrate the importance of the ideas presented. (author)
CAD and mesh repair with Radial Basis Functions
Marchandise, E.; Piret, C.; Remacle, J.-F.
2012-03-01
In this paper we present a process that includes both model/mesh repair and mesh generation. The repair algorithm is based on an initial mesh that may be either an initial mesh of a dirty CAD model or STL triangulation with many errors such as gaps, overlaps and T-junctions. This initial mesh is then remeshed by computing a discrete parametrization with Radial Basis Functions (RBF's). We showed in [1] that a discrete parametrization can be computed by solving Partial Differential Equations (PDE's) on an initial correct mesh using finite elements. Paradoxically, the meshless character of the RBF's makes it an attractive numerical method for solving the PDE's for the parametrization in the case where the initial mesh contains errors or holes. In this work, we implement the Orthogonal Gradients method to be described in [2], as a RBF solution method for solving PDE's on arbitrary surfaces. Different examples show that the presented method is able to deal with errors such as gaps, overlaps, T-junctions and that the resulting meshes are of high quality. Moreover, the presented algorithm can be used as a hole-filling algorithm to repair meshes with undesirable holes. The overall procedure is implemented in the open-source mesh generator Gmsh [3].
Framework for Ethernet Network Functionality Testing
Mirza Aamir Mehmood
2011-11-01
Full Text Available Computer networks and telecommunication systems use a wide range of applications. Therefore, the power and complexity of computer networks are increasing every day which enhances the possibilities of the end user, but also makes harder the work of those who have to design, maintain and make a network efficient, optimized and secure. Ethernet functionality testing as a generic term used for checking connectivity, throughput and capability to transfer packets over the network. Especially in the packet-switch environment, Ethernet testing has become an essential part for deploying a reliable network. A platform and vendor independent framework is required to verify and test the functionality of the Ethernet network and to verify the functionality and performance of the TCP/IP stack. NetBurst is developed for Ethernet functionality testing
顾成奎; 王正欧; 孙雅明
2003-01-01
A new method for identifying nonlinear time-varying systems with unknown structure is presented. The method extends the application area of basis sequence identification. The essential idea is to utilize the learning and nonlinear approximating ability of neural networks to model the non-linearity of the system, characterize time-varying dynamics of the system by the time-varying parametric vector of the network, then the parametric vector of the network is approximated by a weighted sum of known basis sequences. Because of black-box modeling ability of neural networks, the presented method can identify nonlinear time-varying systems with unknown structure. In order to improve the real-time capability of the algorithm, the neural network is trained by a simple fast learning algorithm based on local least squares presented by the authors. The effectiveness and the performance of the method are demonstrated by some simulation results.
The functional consequences of mutualistic network architecture.
José M Gómez
Full Text Available The architecture and properties of many complex networks play a significant role in the functioning of the systems they describe. Recently, complex network theory has been applied to ecological entities, like food webs or mutualistic plant-animal interactions. Unfortunately, we still lack an accurate view of the relationship between the architecture and functioning of ecological networks. In this study we explore this link by building individual-based pollination networks from eight Erysimum mediohispanicum (Brassicaceae populations. In these individual-based networks, each individual plant in a population was considered a node, and was connected by means of undirected links to conspecifics sharing pollinators. The architecture of these unipartite networks was described by means of nestedness, connectivity and transitivity. Network functioning was estimated by quantifying the performance of the population described by each network as the number of per-capita juvenile plants produced per population. We found a consistent relationship between the topology of the networks and their functioning, since variation across populations in the average per-capita production of juvenile plants was positively and significantly related with network nestedness, connectivity and clustering. Subtle changes in the composition of diverse pollinator assemblages can drive major consequences for plant population performance and local persistence through modifications in the structure of the inter-plant pollination networks.
Network architecture functional description and design
Stans, L.; Bencoe, M.; Brown, D.; Kelly, S.; Pierson, L.; Schaldach, C.
1989-05-25
This report provides a top level functional description and design for the development and implementation of the central network to support the next generation of SNL, Albuquerque supercomputer in a UNIX{reg sign} environment. It describes the network functions and provides an architecture and topology.
Barbara Martini
2016-06-01
Full Text Available Emerging technologies such as Software-Defined Networks (SDN and Network Function Virtualization (NFV promise to address cost reduction and flexibility in network operation while enabling innovative network service delivery models. However, operational network service delivery solutions still need to be developed that actually exploit these technologies, especially at the multi-provider level. Indeed, the implementation of network functions as software running over a virtualized infrastructure and provisioned on a service basis let one envisage an ecosystem of network services that are dynamically and flexibly assembled by orchestrating Virtual Network Functions even across different provider domains, thereby coping with changeable user and service requirements and context conditions. In this paper we propose an approach that adopts Service-Oriented Architecture (SOA technology-agnostic architectural guidelines in the design of a solution for orchestrating and dynamically chaining Virtual Network Functions. We discuss how SOA, NFV, and SDN may complement each other in realizing dynamic network function chaining through service composition specification, service selection, service delivery, and placement tasks. Then, we describe the architecture of a SOA-inspired NFV orchestrator, which leverages SDN-based network control capabilities to address an effective delivery of elastic chains of Virtual Network Functions. Preliminary results of prototype implementation and testing activities are also presented. The benefits for Network Service Providers are also described that derive from the adaptive network service provisioning in a multi-provider environment through the orchestration of computing and networking services to provide end users with an enhanced service experience.
Estimation of State of Charge of Lead Acid Battery using Radial Basis Function
Sauradip, M; Sinha, SK; K Muthukumar
2001-01-01
A Radial Basis Function based learning system method has been proposed for estimation of State of Charge (SOC) of Lead Acid Battery. Coulomb metric method is used for SOC estimation with correction factor computed by Radial Basis Function Method. Radial basis function based technique is used for learning battery performance variation with time and other parameters. Experimental results are included.
Hierarchical modularity in human brain functional networks
Meunier, D; Fornito, A; Ersche, K D; Bullmore, E T; 10.3389/neuro.11.037.2009
2010-01-01
The idea that complex systems have a hierarchical modular organization originates in the early 1960s and has recently attracted fresh support from quantitative studies of large scale, real-life networks. Here we investigate the hierarchical modular (or "modules-within-modules") decomposition of human brain functional networks, measured using functional magnetic resonance imaging (fMRI) in 18 healthy volunteers under no-task or resting conditions. We used a customized template to extract networks with more than 1800 regional nodes, and we applied a fast algorithm to identify nested modular structure at several hierarchical levels. We used mutual information, 0 < I < 1, to estimate the similarity of community structure of networks in different subjects, and to identify the individual network that is most representative of the group. Results show that human brain functional networks have a hierarchical modular organization with a fair degree of similarity between subjects, I=0.63. The largest 5 modules at ...
An Adaptive Complex Network Model for Brain Functional Networks
Gomez Portillo, Ignacio J.; Gleiser, Pablo M.
2009-01-01
Brain functional networks are graph representations of activity in the brain, where the vertices represent anatomical regions and the edges their functional connectivity. These networks present a robust small world topological structure, characterized by highly integrated modules connected sparsely by long range links. Recent studies showed that other topological properties such as the degree distribution and the presence (or absence) of a hierarchical structure are not robust, and show diffe...
A universal formula for network functions
Skelboe, Stig
1975-01-01
A linear electrical network can be described in a convenient way by means of the node equations. This letter presents a universal formula which expresses any network function as the quotient of two determinants. The determinants belong to matrices derived from the indefinite nodal admittance...
Advanced Functionalities for Highly Reliable Optical Networks
An, Yi
This thesis covers two research topics concerning optical solutions for networks e.g. avionic systems. One is to identify the applications for silicon photonic devices for cost-effective solutions in short-range optical networks. The other one is to realise advanced functionalities in order to...
Main concept of local area network protection on the basis of the SAAM 'TRAFFIC'
In our previous paper we developed a system for acquisition, analysis and management of the network traffic (SAAM 'Traffic') for a segment of the JINR local area computer network (JINR LAN). In our present work we consider well-known scenarios of attacks on local area networks and propose protection methods based on the SAAM 'Traffic'. Although the system for LAN protection is installed on a router computer, it is not analogous to the firewall scheme and, thus, it does not hinder the performance of distributed network applications. This provides a possibility to apply such an approach to GRID-technologies, where network protection on the firewall basis can not be basically used. (author)
From networks of protein interactions to networks of functional dependencies
Luciani Davide
2012-05-01
Full Text Available Abstract Background As protein-protein interactions connect proteins that participate in either the same or different functions, networks of interacting and functionally annotated proteins can be converted into process graphs of inter-dependent function nodes (each node corresponding to interacting proteins with the same functional annotation. However, as proteins have multiple annotations, the process graph is non-redundant, if only proteins participating directly in a given function are included in the related function node. Results Reasoning that topological features (e.g., clusters of highly inter-connected proteins might help approaching structured and non-redundant understanding of molecular function, an algorithm was developed that prioritizes inclusion of proteins into the function nodes that best overlap protein clusters. Specifically, the algorithm identifies function nodes (and their mutual relations, based on the topological analysis of a protein interaction network, which can be related to various biological domains, such as cellular components (e.g., peroxisome and cellular bud or biological processes (e.g., cell budding of the model organism S. cerevisiae. Conclusions The method we have described allows converting a protein interaction network into a non-redundant process graph of inter-dependent function nodes. The examples we have described show that the resulting graph allows researchers to formulate testable hypotheses about dependencies among functions and the underlying mechanisms.
Concept of the dealer-service network management on the system approach basis
Irina MAKAROVA
2011-01-01
Full Text Available In article the method of improvement of automobile service quality within the limits of a dealer-service network limits, by building of information-logistical system and feedback mechanism adjustment is considered. As operating influence application of the discounts` system calculated on the basis of forward orderings on spare parts arriving from the service centers is offered.
Abrupt structural transitions involving functionally optimal networks
Jarrett, T C; Fricker, M; Johnson, N F; Jarrett, Timothy C.; Ashton, Douglas J.; Fricker, Mark; Johnson, Neil F.
2005-01-01
We show analytically that abrupt structural transitions can arise in functionally optimal networks, driven by small changes in the level of transport congestion. Our findings are based on an exactly solvable model system which mimics a variety of biological and social networks. Our results offer an explanation as to why such diverse sets of network structures arise in Nature (e.g. fungi) under essentially the same environmental conditions. As a by-product of this work, we introduce a novel renormalization scheme involving `cost motifs' which describes analytically the average shortest path across multiple-ring-and-hub networks.
Functional connectivity and brain networks in schizophrenia
Lynall, Mary-Ellen; Bassett, Danielle S.; Kerwin, Robert; McKenna, Peter J.; Kitzbichler, Manfred; Müller, Ulrich; Bullmore, Ed
2010-01-01
Schizophrenia has often been conceived as a disorder of connectivity between components of large-scale brain networks. We tested this hypothesis by measuring aspects of both functional connectivity and functional network topology derived from resting state fMRI time series acquired at 72 cerebral regions over 17 minutes from 15 healthy volunteers (14 male, 1 female) and 12 people diagnosed with schizophrenia (10 male, 2 female). We investigated between-group differences in strength and divers...
Mapping functional connectivity in cellular networks
Buibas, Marius
2011-01-01
My thesis is a collection of theoretical and practical techniques for mapping functional or effective connectivity in cellular neuronal networks, at the cell scale. This is a challenging scale to work with, primarily because of the difficulty in labeling and measuring the activities of networks of cells. It is also important as it underlies behavior, function, and complex diseases. I present methods to measure and quantify the dynamic activities of cells using the optical flow technique, whic...
Fuzzy Functional Dependencies and Bayesian Networks
LIU WeiYi(刘惟一); SONG Ning(宋宁)
2003-01-01
Bayesian networks have become a popular technique for representing and reasoning with probabilistic information. The fuzzy functional dependency is an important kind of data dependencies in relational databases with fuzzy values. The purpose of this paper is to set up a connection between these data dependencies and Bayesian networks. The connection is done through a set of methods that enable people to obtain the most information of independent conditions from fuzzy functional dependencies.
Physiological basis, use and abuse of functional imaging
Functional imaging in the contrast to conventional methods of nuclear medicine is defined. The importance of an isomorphic physiological model as a link between the physics of the test and the clinical problem is discussed. Clinical, physiological and mathematical criteria for use of computer assisted functional images are developed. (WU)
Constructing social networks on the basis of task and knowledge networks using WESTT
Stanton, Neville A.; Baber, Chris; Houghton, Robert J.
2007-01-01
In this paper, we propose that it is possible to combine conventional Human Factors approaches to task analysis and crew models to the study of covert networks. The intention is to add to the debate and methods that surround the study of covert networks. We suggest that it is possible to use Human Factors methods to both inform Social Network Analysis approaches, and to provide representations by which intelligence can be shared and explored. The paper is couched in terms of the WESTT approac...
Hybrid model decomposition of speech and noise in a radial basis function neural model framework
Sørensen, Helge Bjarup Dissing; Hartmann, Uwe
1994-01-01
The aim of the paper is to focus on a new approach to automatic speech recognition in noisy environments where the noise has either stationary or non-stationary statistical characteristics. The aim is to perform automatic recognition of speech in the presence of additive car noise. The technique...... applied is based on a combination of the hidden Markov model (HMM) decomposition method, for speech recognition in noise, developed by Varga and Moore (1990) from DRA and the hybrid (HMM/RBF) recognizer containing hidden Markov models and radial basis function (RBF) neural networks, developed by Singer...... and Lippmann (1992) from MIT Lincoln Lab. The present authors modified the hybrid recognizer to fit into the decomposition method to achieve high performance speech recognition in noisy environments. The approach has been denoted the hybrid model decomposition method and it provides an optimal method...
Functional network organization of the human brain
Power, Jonathan D.; Cohen, Alexander L.; Nelson, Steven M.; Wig, Gagan S.; Barnes, Kelly Anne; Church, Jessica A.; Vogel, Alecia C.; Laumann, Timothy O.; Miezin, Fran M.; Schlaggar, Bradley L.; Petersen, Steven E.
2011-01-01
Real-world complex systems may be mathematically modeled as graphs, revealing properties of the system. Here we study graphs of functional brain organization in healthy adults using resting state functional connectivity MRI. We propose two novel brain-wide graphs, one of 264 putative functional areas, the other a modification of voxelwise networks that eliminates potentially artificial short-distance relationships. These graphs contain many subgraphs in good agreement with known functional br...
Darden, Safi-Kirstine; Steffensen, Lise K.; Dabelsteen, Torben
2008-01-01
In species where individuals are widely spaced instantaneous signals cannot readily form the basis of communication networks, that is several individuals within signalling range of each other. However, markings, signals that remain in the environment after the signaller has left, may fulfil this...... role. In this study, we have investigated the possible function of swift fox, Vulpes velox, latrines, collections of scat, urine and possibly other secretions, in a communication network context. We found that latrines had higher frequencies of occurrence inside the core (defined as the 50% kernel....... That is, they function in territory defence in the exclusive areas of a pair's core and as centres for information exchange in the outer areas of a pair's home-range that overlap with neighbouring foxes. We discuss the possible information content of latrines and the possibility of latrines forming the...
OPTIMIZATION OF CUTTING PARAMETERS ON THE BASIS OF SEMANTIC NETWORK USAGE
V. M. Pashkevich
2011-01-01
Full Text Available The paper considers problems on accuracy assurance of machine component cutting while using edge tools. An approach based on artificial intelligence technologies in particular technologies of functional semantic networks. The paper analyzes a possibility to apply functional semantic networks for optimization of cutting parameters. An intellectual system intended for solution of applied problems is described in the paper. The paper reveals a system structure and an example for setting optimal cutting speed is cited in the paper.
Individual diversity of functional brain network economy.
Hahn, Andreas; Kranz, Georg S; Sladky, Ronald; Ganger, Sebastian; Windischberger, Christian; Kasper, Siegfried; Lanzenberger, Rupert
2015-04-01
On average, brain network economy represents a trade-off between communication efficiency, robustness, and connection cost, although an analogous understanding on an individual level is largely missing. Evaluating resting-state networks of 42 healthy participants with seven Tesla functional magnetic resonance imaging and graph theory revealed that not even half of all possible connections were common across subjects. The strongest similarities among individuals were observed for interhemispheric and/or short-range connections, which may relate to the essential feature of the human brain to develop specialized systems within each hemisphere. Despite this marked variability in individual network architecture, all subjects exhibited equal small-world properties. Furthermore, interdependency between four major network economy metrics was observed across healthy individuals. The characteristic path length was associated with the clustering coefficient (peak correlation r=0.93), the response to network attacks (r=-0.97), and the physical connection cost in three-dimensional space (r=-0.62). On the other hand, clustering was negatively related to attack response (r=-0.75) and connection cost (r=-0.59). Finally, increased connection cost was associated with better response to attacks (r=0.65). This indicates that functional brain networks with high global information transfer also exhibit strong network resilience. However, it seems that these advantages come at the cost of decreased local communication efficiency and increased physical connection cost. Except for wiring length, the results were replicated on a subsample at three Tesla (n=20). These findings highlight the finely tuned interrelationships between different parameters of brain network economy. Moreover, the understanding of the individual diversity of functional brain network economy may provide further insights in the vulnerability to mental and neurological disorders. PMID:25411715
Physiologic Basis for Improved Pulmonary Function after Lung Volume Reduction
Fessler, Henry E.; Scharf, Steven M; Ingenito, Edward P.; McKenna, Robert J.; Sharafkhaneh, Amir
2008-01-01
It is not readily apparent how pulmonary function could be improved by resecting portions of the lung in patients with emphysema. In emphysema, elevation in residual volume relative to total lung capacity reduces forced expiratory volumes, increases inspiratory effort, and impairs inspiratory muscle mechanics. Lung volume reduction surgery (LVRS) better matches the size of the lungs to the size of the thorax containing them. This restores forced expiratory volumes and the mechanical advantage...
Design Optimization of Centrifugal Pump Using Radial Basis Function Metamodels
Yu Zhang; Jinglai Wu; Yunqing Zhang; Liping Chen
2014-01-01
Optimization design of centrifugal pump is a typical multiobjective optimization (MOO) problem. This paper presents an MOO design of centrifugal pump with five decision variables and three objective functions, and a set of centrifugal pumps with various impeller shroud shapes are studied by CFD numerical simulations. The important performance indexes for centrifugal pump such as head, efficiency, and required net positive suction head (NPSHr) are investigated, and the results indicate that th...
Functional network inference of the suprachiasmatic nucleus.
Abel, John H; Meeker, Kirsten; Granados-Fuentes, Daniel; St John, Peter C; Wang, Thomas J; Bales, Benjamin B; Doyle, Francis J; Herzog, Erik D; Petzold, Linda R
2016-04-19
In the mammalian suprachiasmatic nucleus (SCN), noisy cellular oscillators communicate within a neuronal network to generate precise system-wide circadian rhythms. Although the intracellular genetic oscillator and intercellular biochemical coupling mechanisms have been examined previously, the network topology driving synchronization of the SCN has not been elucidated. This network has been particularly challenging to probe, due to its oscillatory components and slow coupling timescale. In this work, we investigated the SCN network at a single-cell resolution through a chemically induced desynchronization. We then inferred functional connections in the SCN by applying the maximal information coefficient statistic to bioluminescence reporter data from individual neurons while they resynchronized their circadian cycling. Our results demonstrate that the functional network of circadian cells associated with resynchronization has small-world characteristics, with a node degree distribution that is exponential. We show that hubs of this small-world network are preferentially located in the central SCN, with sparsely connected shells surrounding these cores. Finally, we used two computational models of circadian neurons to validate our predictions of network structure. PMID:27044085
Functional network inference of the suprachiasmatic nucleus
Abel, John H.; Meeker, Kirsten; Granados-Fuentes, Daniel; St. John, Peter C.; Wang, Thomas J.; Bales, Benjamin B.; Doyle, Francis J.; Herzog, Erik D.; Petzold, Linda R.
2016-04-04
In the mammalian suprachiasmatic nucleus (SCN), noisy cellular oscillators communicate within a neuronal network to generate precise system-wide circadian rhythms. Although the intracellular genetic oscillator and intercellular biochemical coupling mechanisms have been examined previously, the network topology driving synchronization of the SCN has not been elucidated. This network has been particularly challenging to probe, due to its oscillatory components and slow coupling timescale. In this work, we investigated the SCN network at a single-cell resolution through a chemically induced desynchronization. We then inferred functional connections in the SCN by applying the maximal information coefficient statistic to bioluminescence reporter data from individual neurons while they resynchronized their circadian cycling. Our results demonstrate that the functional network of circadian cells associated with resynchronization has small-world characteristics, with a node degree distribution that is exponential. We show that hubs of this small-world network are preferentially located in the central SCN, with sparsely connected shells surrounding these cores. Finally, we used two computational models of circadian neurons to validate our predictions of network structure.
Polarized DIS Structure Functions from Neural Networks
We present a parametrization of polarized Deep-Inelastic-Scattering (DIS) structure functions based on Neural Networks. The parametrization provides a bias-free determination of the probability measure in the space of structure functions, which retains information on experimental errors and correlations. As an example we discuss the application of this method to the study of the structure function g1p(x,Q2)
Brown, James; Carrington, Tucker
2016-06-01
In this paper we show that it is possible to use an iterative eigensolver in conjunction with Halverson and Poirier's symmetrized Gaussian (SG) basis [T. Halverson and B. Poirier, J. Chem. Phys. 137, 224101 (2012)] to compute accurate vibrational energy levels of molecules with as many as five atoms. This is done, without storing and manipulating large matrices, by solving a regular eigenvalue problem that makes it possible to exploit direct-product structure. These ideas are combined with a new procedure for selecting which basis functions to use. The SG basis we work with is orders of magnitude smaller than the basis made by using a classical energy criterion. We find significant convergence errors in previous calculations with SG bases. For sum-of-product Hamiltonians, SG bases large enough to compute accurate levels are orders of magnitude larger than even simple pruned bases composed of products of harmonic oscillator functions.
The molecular basis for centromere identity and function.
McKinley, Kara L; Cheeseman, Iain M
2016-01-01
The centromere is the region of the chromosome that directs its segregation in mitosis and meiosis. Although the functional importance of the centromere has been appreciated for more than 130 years, elucidating the molecular features and properties that enable centromeres to orchestrate chromosome segregation is an ongoing challenge. Most eukaryotic centromeres are defined epigenetically and require the presence of nucleosomes containing the histone H3 variant centromere protein A (CENP-A; also known as CENH3). Ongoing work is providing important molecular insights into the central requirements for centromere identity and propagation, and the mechanisms by which centromeres recruit kinetochores to connect to spindle microtubules. PMID:26601620
Avian magnetic compass: Its functional properties and physical basis
Roswitha WILTSCHKO, Wolfgang WILTSCHKO
2010-06-01
Full Text Available The avian magnetic compass was analyzed in bird species of three different orders – Passeriforms, Columbiforms and Galliforms – and in three different behavioral contexts, namely migratory orientation, homing and directional conditioning. The respective findings indicate similar functional properties: it is an inclination compass that works only within a functional window around the ambient magnetic field intensity; it tends to be lateralized in favor of the right eye, and it is wavelength-dependent, requiring light from the short-wavelength range of the spectrum. The underlying physical mechanisms have been identified as radical pair processes, spin-chemical reactions in specialized photopigments. The iron-based receptors in the upper beak do not seem to be involved. The existence of the same type of magnetic compass in only very distantly related bird species suggests that it may have been present already in the common ancestors of all modern birds, where it evolved as an all-purpose compass mechanism for orientation within the home range [Current Zoology 56 (3: 265–276, 2010].
The boiler is a very important component of a thermal power plant, and its efficient operation requires continuous online information of various relevant parameters. Furnace exit gas temperature (FEGT) is one such important design/operating parameter. Knowledge of FEGT is not only useful for design of convective heating surface but also helpful for operating actions and decision making. Its online information ensures improvement in economic benefit of the power plant. Non-availability of FEGT on the operator desk greatly limits efficient operation. In this study, a novel method of estimating FEGT using neural network is presented. The training data are first generated by calculating FEGT using heat balances through various heat exchangers. Prediction accuracy and fast response are major advantages in using neural network for estimating FEGT for operator information. Two types of feed forward neural modeling networks, radial basis function and back-propagation network, were applied and compared based on their network simplicity, model building and prediction accuracy. Results are verified on practical data obtained from a 210 MW boiler of a thermal power plant
Generating functions for q-Bernstein, q-Meyer-Konig-Zeller and q-Beta basis
Gupta, Vijay; Kim, Taekyun; Choi, Jongsung; Kim, Young-Hee
2010-01-01
The present paper deals with the q-analogue of Bernstein, Meyer-Konig-Zeller and Beta operators. Here we estimate the generating functions for q-Bernstein, q-Meyer-Konig-Zeller and q-Beta basis functions.
Hierarchical modularity in human brain functional networks
Renaud Lambiotte
2009-10-01
Full Text Available The idea that complex systems have a hierarchical modular organization originates in the early 1960s and has recently attracted fresh support from quantitative studies of large scale, real-life networks. Here we investigate the hierarchical modular (or “modules-within-modules” decomposition of human brain functional networks, measured using functional magnetic resonance imaging (fMRI in 18 healthy volunteers under no-task or resting conditions. We used a customized template to extract networks with more than 1800 regional nodes, and we applied a fast algorithm to identify nested modular structure at several hierarchical levels. We used mutual information, 0 < I < 1, to estimate the similarity of community structure of networks in different subjects, and to identify the individual network that is most representative of the group. Results show that human brain functional networks have a hierarchical modular organization with a fair degree of similarity between subjects, I=0.63. The largest 5 modules at the highest level of the hierarchy were medial occipital, lateral occipital, central, parieto-frontal and fronto-temporal systems; occipital modules demonstrated less sub-modular organization than modules comprising regions of multimodal association cortex. Connector nodes and hubs, with a key role in inter-modular connectivity, were also concentrated in association cortical areas. We conclude that methods are available for hierarchical modular decomposition of large numbers of high resolution brain functional networks using computationally expedient algorithms. This could enable future investigations of Simon's original hypothesis that hierarchy or near-decomposability of physical symbol systems is a critical design feature for their fast adaptivity to changing environmental conditions.
Schwenke, David W.; Truhlar, Donald G.
1990-01-01
The Generalized Newton Variational Principle for 3D quantum mechanical reactive scattering is briefly reviewed. Then three techniques are described which improve the efficiency of the computations. First, the fact that the Hamiltonian is Hermitian is used to reduce the number of integrals computed, and then the properties of localized basis functions are exploited in order to eliminate redundant work in the integral evaluation. A new type of localized basis function with desirable properties is suggested. It is shown how partitioned matrices can be used with localized basis functions to reduce the amount of work required to handle the complex boundary conditions. The new techniques do not introduce any approximations into the calculations, so they may be used to obtain converged solutions of the Schroedinger equation.
Boese, A D; Martin, J M L; Klopper, Wim; Martin, Jan M. L.
2005-01-01
In a previous contribution (Mol. Phys. {\\bf 103}, xxxx, 2005), we established the suitability of density functional theory (DFT) for the calculation of molecular anharmonic force fields. In the present work, we have assessed a wide variety of basis sets and exchange-correlation functionals for harmonic and fundamental frequencies, equilibrium and ground-state rotational constants, and thermodynamic functions beyond the RRHO (rigid rotor-harmonic oscillator) approximation. The fairly good performance of double-zeta plus polarization basis sets for frequencies results from an error compensation between basis set incompleteness and the intrinsic error of exchange-correlation functionals. Triple-zeta plus polarization basis sets are recommended, with an additional high-exponent $d$ function on second-row atoms. All conventional hybrid GGA functionals perform about equally well: high-exchange hybrid GGA and meta-GGA functionals designed for kinetics yield poor results, with the exception of of the very recently de...
Scoring Function Based on Weighted Residue Network
Shan Chang
2011-12-01
Full Text Available Molecular docking is an important method for the research of protein-protein interaction and recognition. A protein can be considered as a network when the residues are treated as its nodes. With the contact energy between residues as link weight, a weighted residue network is constructed in this paper. Two weighted parameters (strength and weighted average nearest neighbors’ degree are introduced into this model at the same time. The stability of a protein is characterized by its strength. The global topological properties of the protein-protein complex are reflected by the weighted average nearest neighbors’ degree. Based on this weighted network model and these two parameters, a new docking scoring function is proposed in this paper. The scoring and ranking for 42 systems’ bound and unbounded docking results are performed with this new scoring function. Comparing the results obtained from this new scoring function with that from the pair potentials scoring function, we found that this new scoring function has a similar performance to the pair potentials on some items, and this new scoring function can get a better success rate. The calculation of this new scoring function is easy, and the result of its scoring and ranking is acceptable. This work can help us better understand the mechanisms of protein-protein interactions and recognition.
Schizophrenia classification using functional network features
Rish, Irina; Cecchi, Guillermo A.; Heuton, Kyle
2012-03-01
This paper focuses on discovering statistical biomarkers (features) that are predictive of schizophrenia, with a particular focus on topological properties of fMRI functional networks. We consider several network properties, such as node (voxel) strength, clustering coefficients, local efficiency, as well as just a subset of pairwise correlations. While all types of features demonstrate highly significant statistical differences in several brain areas, and close to 80% classification accuracy, the most remarkable results of 93% accuracy are achieved by using a small subset of only a dozen of most-informative (lowest p-value) correlation features. Our results suggest that voxel-level correlations and functional network features derived from them are highly informative about schizophrenia and can be used as statistical biomarkers for the disease.
Distributed Function Calculation over Noisy Networks
Zhidun Zeng
2016-01-01
Full Text Available Considering any connected network with unknown initial states for all nodes, the nearest-neighbor rule is utilized for each node to update its own state at every discrete-time step. Distributed function calculation problem is defined for one node to compute some function of the initial values of all the nodes based on its own observations. In this paper, taking into account uncertainties in the network and observations, an algorithm is proposed to compute and explicitly characterize the value of the function in question when the number of successive observations is large enough. While the number of successive observations is not large enough, we provide an approach to obtain the tightest possible bounds on such function by using linear programing optimization techniques. Simulations are provided to demonstrate the theoretical results.
Deep networks for motor control functions
Max eBerniker
2015-03-01
Full Text Available The motor system generates time-varying commands to move our limbs and body. Conventional descriptions of motor control and learning rely on dynamical representations of our body’s state (forward and inverse models, and control policies that must be integrated forward to generate feedforward time-varying commands; thus these are representations across space, but not time. Here we examine a new approach that directly represents both time-varying commands and the resulting state trajectories with a function; a representation across space and time. Since the output of this function includes time, it necessarily requires more parameters than a typical dynamical model. To avoid the problems of local minima these extra parameters introduce, we exploit recent advances in machine learning to build our function using a stacked autoencoder, or deep network. With initial and target states as inputs, this deep network can be trained to output an accurate temporal profile of the optimal command and state trajectory for a point-to-point reach of a nonlinear limb model, even when influenced by varying force fields. In a manner that mirrors motor babble, the network can also teach itself to learn through trial and error. Lastly, we demonstrate how this network can learn to optimize a cost objective. This functional approach to motor control is a sharp departure from the standard dynamical approach, and may offer new insights into the neural implementation of motor control.
Deep networks for motor control functions.
Berniker, Max; Kording, Konrad P
2015-01-01
The motor system generates time-varying commands to move our limbs and body. Conventional descriptions of motor control and learning rely on dynamical representations of our body's state (forward and inverse models), and control policies that must be integrated forward to generate feedforward time-varying commands; thus these are representations across space, but not time. Here we examine a new approach that directly represents both time-varying commands and the resulting state trajectories with a function; a representation across space and time. Since the output of this function includes time, it necessarily requires more parameters than a typical dynamical model. To avoid the problems of local minima these extra parameters introduce, we exploit recent advances in machine learning to build our function using a stacked autoencoder, or deep network. With initial and target states as inputs, this deep network can be trained to output an accurate temporal profile of the optimal command and state trajectory for a point-to-point reach of a non-linear limb model, even when influenced by varying force fields. In a manner that mirrors motor babble, the network can also teach itself to learn through trial and error. Lastly, we demonstrate how this network can learn to optimize a cost objective. This functional approach to motor control is a sharp departure from the standard dynamical approach, and may offer new insights into the neural implementation of motor control. PMID:25852530
Affinely Recursive Functions and Neural Networks
Kůrková, Věra; Kainen, P.C.
Atlanta : Georgia Institute of Technology, 1994 - ( Ames , W.), s. 776-779 [IMACS World Congress /14./. Atlanta (US), 11.07.1994-15.07.1994] R&D Projects: GA AV ČR IA23057; GA ČR GA201/93/0427 Keywords : neural networks * affinely recursive functions
Dynamic functional network connectivity using distance correlation
Rudas, Jorge; Guaje, Javier; Demertzi, Athena; Heine, Lizette; Tshibanda, Luaba; Soddu, Andrea; Laureys, Steven; Gómez, Francisco
2015-01-01
Investigations about the intrinsic brain organization in resting-state are critical for the understanding of healthy, pathological and pharmacological cerebral states. Recent studies on fMRI suggest that resting state activity is organized on large scale networks of coordinated activity, in the so called, Resting State Networks (RSNs). The assessment of the interactions among these functional networks plays an important role for the understanding of different brain pathologies. Current methods to quantify these interactions commonly assume that the underlying coordination mechanisms are stationary and linear through the whole recording of the resting state phenomena. Nevertheless, recent evidence suggests that rather than stationary, these mechanisms may exhibit a rich set of time-varying repertoires. In addition, these approaches do not consider possible non-linear relationships maybe linked to feed-back communication mechanisms between RSNs. In this work, we introduce a novel approach for dynamical functional network connectivity for functional magnetic resonance imaging (fMRI) resting activity, which accounts for non-linear dynamic relationships between RSNs. The proposed method is based on a windowed distance correlations computed on resting state time-courses extracted at single subject level. We showed that this strategy is complementary to the current approaches for dynamic functional connectivity and will help to enhance the discrimination capacity of patients with disorder of consciousness.
Computational Exploration of the Biological Basis of Black-Scholes Expected Utility Function
Sukanto Bhattacharya; Kuldeep Kumar
2007-01-01
It has often been argued that there exists an underlying biological basis of utility functions. Taking this line of argument a step further in this paper, we have aimed to computationally demonstrate the biological basis of the Black-Scholes functional form as applied to classical option pricing and hedging theory. The evolutionary optimality of the classical Black-Scholes function has been computationally established by means of a haploid genetic algorithm model. The objective was to minimiz...
Computational Exploration of the Biological Basis of Black-Scholes Expected Utility Function
Kuldeep Kumar; Sukanto Bhattacharya
2007-01-01
It has often been argued that there exists an underlying biological basis of utility functions. Taking this line of argument a step further in this paper, we have aimed to computationally demonstrate the biological basis of the Black-Scholes functional form as applied to classical option pricing and hedging theory. The evolutionary optimality of the classical Black-Scholes function has been computationally established by means of a haploid genetic algorithm model. The objective was to mi...
Free vibrations and buckling analysis of laminated plates by oscillatory radial basis functions
Neves, A. M. A.; Ferreira, A. J. M.
2015-12-01
In this paper the free vibrations and buckling analysis of laminated plates is performed using a global meshless method. A refined version of Kant's theorie which accounts for transverse normal stress and through-the-thickness deformation is used. The innovation is the use of oscillatory radial basis functions. Numerical examples are performed and results are presented and compared to available references. Such functions proved to be an alternative to the tradicional nonoscillatory radial basis functions.
Functional optimization of the arterial network
Mauroy, Benjamin
2014-01-01
We build an evolutionary scenario that explains how some crucial physiological constraints in the arterial network of mammals - i.e. hematocrit, vessels diameters and arterial pressure drops - could have been selected by evolution. We propose that the arterial network evolved while being constrained by its function as an organ. To support this hypothesis, we focus our study on one of the main function of blood network: oxygen supply to the organs. We consider an idealized organ with a given oxygen need and we optimize blood network geometry and hematocrit with the constraint that it must fulfill the organ oxygen need. Our model accounts for the non-Newtonian behavior of blood, its maintenance cost and F\\aa hr\\ae us effects (decrease in average concentration of red blood cells as the vessel diameters decrease). We show that the mean shear rates (relative velocities of fluid layers) in the tree vessels follow a scaling law related to the multi-scale property of the tree network, and we show that this scaling la...
Efficient basis for the Dicke model: II. Wave function convergence and excited states
An extended bosonic coherent basis has been shown by Chen et al (2008 Phys. Rev. A 78 051801) and Liu T et al (2009 Phys. Rev. A 80 165308) to provide numerically exact solutions of the finite-size Dicke model. The advantages in employing this basis, as compared with the photon number (Fock) basis, are exhibited to be valid for a large region of the Hamiltonian parameter space and many excited states by analyzing the convergence in the wave functions. (paper)
Multiscale finite element methods for high-contrast problems using local spectral basis functions
Efendiev, Yalchin
2011-02-01
In this paper we study multiscale finite element methods (MsFEMs) using spectral multiscale basis functions that are designed for high-contrast problems. Multiscale basis functions are constructed using eigenvectors of a carefully selected local spectral problem. This local spectral problem strongly depends on the choice of initial partition of unity functions. The resulting space enriches the initial multiscale space using eigenvectors of local spectral problem. The eigenvectors corresponding to small, asymptotically vanishing, eigenvalues detect important features of the solutions that are not captured by initial multiscale basis functions. Multiscale basis functions are constructed such that they span these eigenfunctions that correspond to small, asymptotically vanishing, eigenvalues. We present a convergence study that shows that the convergence rate (in energy norm) is proportional to (H/Λ*)1/2, where Λ* is proportional to the minimum of the eigenvalues that the corresponding eigenvectors are not included in the coarse space. Thus, we would like to reach to a larger eigenvalue with a smaller coarse space. This is accomplished with a careful choice of initial multiscale basis functions and the setup of the eigenvalue problems. Numerical results are presented to back-up our theoretical results and to show higher accuracy of MsFEMs with spectral multiscale basis functions. We also present a hierarchical construction of the eigenvectors that provides CPU savings. © 2010.
Gaussian continuum basis functions for calculating high-harmonic generation spectra
Coccia, Emanuele; Labeye, Marie; Caillat, Jérémie; Taieb, Richard; Toulouse, Julien; Luppi, Eleonora
2016-01-01
We explore the computation of high-harmonic generation spectra by means of Gaussian basis sets in approaches propagating the time-dependent Schr{\\"o}dinger equation. We investigate the efficiency of Gaussian functions specifically designed for the description of the continuum proposed by Kaufmann et al. [ J. Phys. B 22 , 2223 (1989) ]. We assess the range of applicability of this approach by studying the hydrogen atom , i. e. the simplest atom for which "exact" calculations on a grid can be performed. We notably study the effect of increasing the basis set cardinal number , the number of diffuse basis functions , and the number of Gaussian pseudo-continuum basis functions for various laser parameters. Our results show that the latter significantly improve the description of the low-lying continuum states , and provide a satisfactory agreement with grid calculations for laser wavelengths $\\lambda$0 = 800 and 1064 nm. The Kaufmann continuum functions therefore appear as a promising way of constructing Gaussian ...
Olga V. Avseeva; Yuri B. Tebekin
2011-01-01
The article is devoted to the problem of the quality management for multiphase processes on the basis of the probabilistic approach. Method with continuous response functions is offered from the application of the method of Lagrange multipliers.
Yuri B. Tebekin
2011-11-01
Full Text Available The article is devoted to the problem of the quality management for multiphase processes on the basis of the probabilistic approach. Method with continuous response functions is offered from the application of the method of Lagrange multipliers.
Arithmetic functions in torus and tree networks
Bhanot, Gyan; Blumrich, Matthias A.; Chen, Dong; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Steinmacher-Burow, Burkhard D.; Vranas, Pavlos M.
2007-12-25
Methods and systems for performing arithmetic functions. In accordance with a first aspect of the invention, methods and apparatus are provided, working in conjunction of software algorithms and hardware implementation of class network routing, to achieve a very significant reduction in the time required for global arithmetic operation on the torus. Therefore, it leads to greater scalability of applications running on large parallel machines. The invention involves three steps in improving the efficiency and accuracy of global operations: (1) Ensuring, when necessary, that all the nodes do the global operation on the data in the same order and so obtain a unique answer, independent of roundoff error; (2) Using the topology of the torus to minimize the number of hops and the bidirectional capabilities of the network to reduce the number of time steps in the data transfer operation to an absolute minimum; and (3) Using class function routing to reduce latency in the data transfer. With the method of this invention, every single element is injected into the network only once and it will be stored and forwarded without any further software overhead. In accordance with a second aspect of the invention, methods and systems are provided to efficiently implement global arithmetic operations on a network that supports the global combining operations. The latency of doing such global operations are greatly reduced by using these methods.
Fire Risk Assessment of Some Indian Coals Using Radial Basis Function (RBF) Technique
Nimaje, Devidas; Tripathy, Debi Prasad
2016-03-01
Fires, whether surface or underground, pose serious and environmental problems in the global coal mining industry. It is causing huge loss of coal due to burning and loss of lives, sterilization of coal reserves and environmental pollution. Most of the instances of coal mine fires happening worldwide are mainly due to the spontaneous combustion. Hence, attention must be paid to take appropriate measures to prevent occurrence and spread of fire. In this paper, to evaluate the different properties of coals for fire risk assessment, forty-nine in situ coal samples were collected from major coalfields of India. Intrinsic properties viz. proximate and ultimate analysis; and susceptibility indices like crossing point temperature, flammability temperature, Olpinski index and wet oxidation potential method of Indian coals were carried out to ascertain the liability of coal to spontaneous combustion. Statistical regression analysis showed that the parameters of ultimate analysis provide significant correlation with all investigated susceptibility indices as compared to the parameters of proximate analysis. Best correlated parameters (ultimate analysis) were used as inputs to the radial basis function network model. The model revealed that Olpinski index can be used as a reliable method to assess the liability of Indian coals to spontaneous combustion.
A Frame of Intrusion Detection Learning System Utilizing Radial Basis Function
S.Selvakani Kandeeban
2012-02-01
Full Text Available The process of monitoring the events that occur in a computer system or network and analyzing them for signs of intrusion is known as Intrusion Detection System (IDS. Detection ability of most of the IDS are limited to known attack patterns; hence new signatures for novel attacks can be troublesome, time consuming and has high false alarm rate. To achieve this, system was trained and tested with known and unknown patterns with the help of Radial Basis Functions (RBF. KDD 99 IDE (Knowledge Discovery in Databases Intrusion Detection Evaluation data set was used for training and testing. The IDS is supposed to distinguish normal traffic from intrusions and to classify them into four classes: DoS, probe, R2L and U2R. The dataset is quite unbalanced, with 79% of the traffic belonging to the DoS category, 19% is normal traffic and less than 2% constitute the other three categories. The usefulness of the data set used for experimental evaluation has been demonstrated. The different metrics available for the evaluation of IDS were also introduced. Experimental evaluations were shown that the proposed methods were having the capacity of detecting a significant percentage ofrate and new attacks.
Full text: We show that a suitable set of coherent basis states placed on a discrete hexagonal grid can be used to numerically very accurately represent general quantum states in a memory efficient way. Adding an algorithm for dynamic basis adaptation allows highly accurate Quantum Monte Carlo wave function simulations with small basis sets. At the example of the intricate nonlinear dynamics of an optical parametric oscillator around threshold, we demonstrate that this approach yields accurate time dependent solutions with a substantially smaller basis sets than required for a photon number basis. Above threshold the adaptive basis splits into localized subsets allowing efficient representation of bimodal or even more complex phase space distributions and directly yields an intuitive physical picture of the ongoing dynamics. (author)
Computationally efficient double hybrid density functional theory using dual basis methods
Byrd, Jason N
2015-01-01
We examine the application of the recently developed dual basis methods of Head-Gordon and co-workers to double hybrid density functional computations. Using the B2-PLYP, B2GP-PLYP, DSD-BLYP and DSD-PBEP86 density functionals, we assess the performance of dual basis methods for the calculation of conformational energy changes in C$_4$-C$_7$ alkanes and for the S22 set of noncovalent interaction energies. The dual basis methods, combined with resolution-of-the-identity second-order M{\\o}ller-Plesset theory, are shown to give results in excellent agreement with conventional methods at a much reduced computational cost.
Combustion monitoring of a water tube boiler using a discriminant radial basis network.
Sujatha, K; Pappa, N
2011-01-01
This research work includes a combination of Fisher's linear discriminant (FLD) analysis and a radial basis network (RBN) for monitoring the combustion conditions for a coal fired boiler so as to allow control of the air/fuel ratio. For this, two-dimensional flame images are required, which were captured with a CCD camera; the features of the images-average intensity, area, brightness and orientation etc of the flame-are extracted after preprocessing the images. The FLD is applied to reduce the n-dimensional feature size to a two-dimensional feature size for faster learning of the RBN. Also, three classes of images corresponding to different burning conditions of the flames have been extracted from continuous video processing. In this, the corresponding temperatures, and the carbon monoxide (CO) emissions and those of other flue gases have been obtained through measurement. Further, the training and testing of Fisher's linear discriminant radial basis network (FLDRBN), with the data collected, have been carried out and the performance of the algorithms is presented. PMID:20864104
Exponential-trigonometric basis functions in the Coulomb four-body problem
Basis functions of a new type--specifically, exponential-trigonometric functions depending on all six interparticle distances--have been proposed for the Coulomb four-body problem. A method has been developed for computing nine-dimensional integrals determining the matrix elements of the Hamiltonian for a four-body system and featuring these functions. The efficiency of the approach that relies on the proposed basis functions has been tested by calculating the e+e-e+e-, p+μ-p+μ-, μ+e-μ+e-, and p+e-p+e- molecules
Experimental - trigonometric basis functions for the Coulomb-four-body problem
Basis functions of a new type are proposed for the Coulomb four-body problem: the exponential-trigonometric functions depending on all the six interparticle separations. The method of computation of the nine-dimensional integrals determining the matrix elements of the four-body system energy operator with these functions is outlined. The efficiency of new basis functions is verified by computations of the e+e-e+e-, p+μ-p+μ-, μ+e-μ+e-, and p+e-p+e- molecules
On Functional Module Detection in Metabolic Networks
Ina Koch
2013-08-01
Full Text Available Functional modules of metabolic networks are essential for understanding the metabolism of an organism as a whole. With the vast amount of experimental data and the construction of complex and large-scale, often genome-wide, models, the computer-aided identification of functional modules becomes more and more important. Since steady states play a key role in biology, many methods have been developed in that context, for example, elementary flux modes, extreme pathways, transition invariants and place invariants. Metabolic networks can be studied also from the point of view of graph theory, and algorithms for graph decomposition have been applied for the identification of functional modules. A prominent and currently intensively discussed field of methods in graph theory addresses the Q-modularity. In this paper, we recall known concepts of module detection based on the steady-state assumption, focusing on transition-invariants (elementary modes and their computation as minimal solutions of systems of Diophantine equations. We present the Fourier-Motzkin algorithm in detail. Afterwards, we introduce the Q-modularity as an example for a useful non-steady-state method and its application to metabolic networks. To illustrate and discuss the concepts of invariants and Q-modularity, we apply a part of the central carbon metabolism in potato tubers (Solanum tuberosum as running example. The intention of the paper is to give a compact presentation of known steady-state concepts from a graph-theoretical viewpoint in the context of network decomposition and reduction and to introduce the application of Q-modularity to metabolic Petri net models.
On functional module detection in metabolic networks.
Koch, Ina; Ackermann, Jörg
2013-01-01
Functional modules of metabolic networks are essential for understanding the metabolism of an organism as a whole. With the vast amount of experimental data and the construction of complex and large-scale, often genome-wide, models, the computer-aided identification of functional modules becomes more and more important. Since steady states play a key role in biology, many methods have been developed in that context, for example, elementary flux modes, extreme pathways, transition invariants and place invariants. Metabolic networks can be studied also from the point of view of graph theory, and algorithms for graph decomposition have been applied for the identification of functional modules. A prominent and currently intensively discussed field of methods in graph theory addresses the Q-modularity. In this paper, we recall known concepts of module detection based on the steady-state assumption, focusing on transition-invariants (elementary modes) and their computation as minimal solutions of systems of Diophantine equations. We present the Fourier-Motzkin algorithm in detail. Afterwards, we introduce the Q-modularity as an example for a useful non-steady-state method and its application to metabolic networks. To illustrate and discuss the concepts of invariants and Q-modularity, we apply a part of the central carbon metabolism in potato tubers (Solanum tuberosum) as running example. The intention of the paper is to give a compact presentation of known steady-state concepts from a graph-theoretical viewpoint in the context of network decomposition and reduction and to introduce the application of Q-modularity to metabolic Petri net models. PMID:24958145
Kim, Oleksiy S.; Meincke, Peter; Breinbjerg, Olav;
2007-01-01
applied to transform the VSIE into a system of linear equations. The higher-order MoM provides significant reduction in the number of unknowns in comparison with standard MoM formulations using low-order basis functions, such as RWG functions. Due to the orthogonal nature of the higher-order Legendre......The problem of electromagnetic scattering by composite metallic and dielectric objects is solved using the coupled volume-surface integral equation (VSIE). The method of moments (MoM) based on higher-order hierarchical Legendre basis functions and higher-order curvilinear geometrical elements is...
MESHLESS METHOD BASED ON COLLOCATION WITH CONSISTENT COMPACTLY SUPPORTED RADIAL BASIS FUNCTIONS
SONG Kangzu; ZHANG Xiong; LU Mingwan
2004-01-01
Based on our previous study, the accuracy of derivatives of interpolating functions are usually very poor near the boundary of domain when Compactly Supported Radial Basis Functions (CSRBFs) are used, so that it could result in significant error in solving partial differential equations with Neumann boundary conditions. To overcome this drawback, the Consistent Compactly Supported Radial Basis Functions (CCSRBFs) are developed, which satisfy the predetermined consistency conditions. Meshless method based on point collocation with CCSRBFs is developed for solving partial differential equations. Numerical studies show that the proposed method improves the accuracy of approximation significantly.
Nonlinear System Identification via Basis Functions Based Time Domain Volterra Model
Yazid Edwar
2014-07-01
Full Text Available This paper proposes basis functions based time domain Volterra model for nonlinear system identification. The Volterra kernels are expanded by using complex exponential basis functions and estimated via genetic algorithm (GA. The accuracy and practicability of the proposed method are then assessed experimentally from a scaled 1:100 model of a prototype truss spar platform. Identification results in time and frequency domain are presented and coherent functions are performed to check the quality of the identification results. It is shown that results between experimental data and proposed method are in good agreement.
Complex network perspective on structure and function of Staphylococcus aureus metabolic network
L Ying; D W Ding
2013-02-01
With remarkable advances in reconstruction of genome-scale metabolic networks, uncovering complex network structure and function from these networks is becoming one of the most important topics in system biology. This work aims at studying the structure and function of Staphylococcus aureus (S. aureus) metabolic network by complex network methods. We first generated a metabolite graph from the recently reconstructed high-quality S. aureus metabolic network model. Then, based on `bow tie' structure character, we explain and discuss the global structure of S. aureus metabolic network. The functional significance, global structural properties, modularity and centrality analysis of giant strong component in S. aureus metabolic networks are studied.
Unconditioned responses and functional fear networks in human classical conditioning.
Linnman, Clas; Rougemont-Bücking, Ansgar; Beucke, Jan Carl; Zeffiro, Thomas A; Milad, Mohammed R
2011-08-01
Human imaging studies examining fear conditioning have mainly focused on the neural responses to conditioned cues. In contrast, the neural basis of the unconditioned response and the mechanisms by which fear modulates inter-regional functional coupling have received limited attention. We examined the neural responses to an unconditioned stimulus using a partial-reinforcement fear conditioning paradigm and functional MRI. The analysis focused on: (1) the effects of an unconditioned stimulus (an electric shock) that was either expected and actually delivered, or expected but not delivered, and (2) on how related brain activity changed across conditioning trials, and (3) how shock expectation influenced inter-regional coupling within the fear network. We found that: (1) the delivery of the shock engaged the red nucleus, amygdale, dorsal striatum, insula, somatosensory and cingulate cortices, (2) when the shock was expected but not delivered, only the red nucleus, the anterior insular and dorsal anterior cingulate cortices showed activity increases that were sustained across trials, and (3) psycho-physiological interaction analysis demonstrated that fear led to increased red nucleus coupling to insula but decreased hippocampus coupling to the red nucleus, thalamus and cerebellum. The hippocampus and the anterior insula may serve as hubs facilitating the switch between engagement of a defensive immediate fear network and a resting network. PMID:21377494
Graph theoretical analysis of resting magnetoencephalographic functional connectivity networks
Lindsay eRutter
2013-07-01
Full Text Available Complex networks have been observed to comprise small-world properties, believed to represent an optimal organization of local specialization and global integration of information processing at reduced wiring cost. Here, we applied magnitude squared coherence to resting magnetoencephalographic time series in reconstructed source space, acquired from controls and patients with schizophrenia, and generated frequency-dependent adjacency matrices modeling functional connectivity between virtual channels. After configuring undirected binary and weighted graphs, we found that all human networks demonstrated highly localized clustering and short characteristic path lengths. The most conservatively thresholded networks showed efficient wiring, with topographical distance between connected vertices amounting to one-third as observed in surrogate randomized topologies. Nodal degrees of the human networks conformed to a heavy-tailed exponentially truncated power-law, compatible with the existence of hubs, which included theta and alpha bilateral cerebellar tonsil, beta and gamma bilateral posterior cingulate, and bilateral thalamus across all frequencies. We conclude that all networks showed small-worldness, minimal physical connection distance, and skewed degree distributions characteristic of physically-embedded networks, and that these calculations derived from graph theoretical mathematics did not quantifiably distinguish between subject populations, independent of bandwidth. However, post-hoc measurements of edge computations at the scale of the individual vertex revealed trends of reduced gamma connectivity across the posterior medial parietal cortex in patients, an observation consistent with our prior resting activation study that found significant reduction of synthetic aperture magnetometry gamma power across similar regions. The basis of these small differences remains unclear.
Although phase-space localized Gaussians are themselves poor basis functions, they can be used to effectively contract a discrete variable representation basis [A. Shimshovitz and D. J. Tannor, Phys. Rev. Lett. 109, 070402 (2012)]. This works despite the fact that elements of the Hamiltonian and overlap matrices labelled by discarded Gaussians are not small. By formulating the matrix problem as a regular (i.e., not a generalized) matrix eigenvalue problem, we show that it is possible to use an iterative eigensolver to compute vibrational energy levels in the Gaussian basis
Brown, James; Carrington, Tucker
2015-07-01
Although phase-space localized Gaussians are themselves poor basis functions, they can be used to effectively contract a discrete variable representation basis [A. Shimshovitz and D. J. Tannor, Phys. Rev. Lett. 109, 070402 (2012)]. This works despite the fact that elements of the Hamiltonian and overlap matrices labelled by discarded Gaussians are not small. By formulating the matrix problem as a regular (i.e., not a generalized) matrix eigenvalue problem, we show that it is possible to use an iterative eigensolver to compute vibrational energy levels in the Gaussian basis.
Representations of Boolean Functions by Perceptron Networks
Kůrková, Věra
Prague : Institute of Computer Science AS CR, 2014 - (Kůrková, V.; Bajer, L.; Peška, L.; Vojtáš, R.; Holeňa, M.; Nehéz, M.), s. 68-70 ISBN 978-80-87136-19-5. [ITAT 2014. European Conference on Information Technologies - Applications and Theory /14./. Demänovská dolina (SK), 25.09.2014-29.09.2014] R&D Projects: GA MŠk(CZ) LD13002 Institutional support: RVO:67985807 Keywords : perceptron networks * model complexity * Boolean functions Subject RIV: IN - Informatics, Computer Science
Boese, A. Daniel; Klopper, Wim; Martin, Jan M. L.
2005-01-01
In a previous contribution (Mol. Phys. {\\bf 103}, xxxx, 2005), we established the suitability of density functional theory (DFT) for the calculation of molecular anharmonic force fields. In the present work, we have assessed a wide variety of basis sets and exchange-correlation functionals for harmonic and fundamental frequencies, equilibrium and ground-state rotational constants, and thermodynamic functions beyond the RRHO (rigid rotor-harmonic oscillator) approximation. The fairly good perf...
Deterministic Function Computation with Chemical Reaction Networks
Chen, Ho-Lin; Soloveichik, David
2012-01-01
We study the deterministic computation of functions on tuples of natural numbers by chemical reaction networks (CRNs). CRNs have been shown to be efficiently Turing-universal when allowing for a small probability of error. CRNs that are guaranteed to converge on a correct answer, on the other hand, have been shown to decide only the semilinear predicates. We introduce the notion of function, rather than predicate, computation by representing the output of a function f:N^k --> N^l by a count of some molecular species, i.e., if the CRN starts with n_1,...,n_k molecules of some "input" species X_1,...,X_k, the CRN is guaranteed to converge to having f(n_1,...,n_k) molecules of the "output" species Y_1,...,Y_l. We show that a function f:N^k --> N^l is deterministically computed by a CRN if and only if its graph {(x,y) \\in N^k x N^l | f(x) = y} is a semilinear set. Finally, we show that each semilinear function f can be computed on input x in expected time O(polylog |x|).
Computer network defense through radial wave functions
Malloy, Ian J.
The purpose of this research is to synthesize basic and fundamental findings in quantum computing, as applied to the attack and defense of conventional computer networks. The concept focuses on uses of radio waves as a shield for, and attack against traditional computers. A logic bomb is analogous to a landmine in a computer network, and if one was to implement it as non-trivial mitigation, it will aid computer network defense. As has been seen in kinetic warfare, the use of landmines has been devastating to geopolitical regions in that they are severely difficult for a civilian to avoid triggering given the unknown position of a landmine. Thus, the importance of understanding a logic bomb is relevant and has corollaries to quantum mechanics as well. The research synthesizes quantum logic phase shifts in certain respects using the Dynamic Data Exchange protocol in software written for this work, as well as a C-NOT gate applied to a virtual quantum circuit environment by implementing a Quantum Fourier Transform. The research focus applies the principles of coherence and entanglement from quantum physics, the concept of expert systems in artificial intelligence, principles of prime number based cryptography with trapdoor functions, and modeling radio wave propagation against an event from unknown parameters. This comes as a program relying on the artificial intelligence concept of an expert system in conjunction with trigger events for a trapdoor function relying on infinite recursion, as well as system mechanics for elliptic curve cryptography along orbital angular momenta. Here trapdoor both denotes the form of cipher, as well as the implied relationship to logic bombs.
Plant geography upon the basis of functional traits: an example from eastern North American trees.
Swenson, Nathan G; Weiser, Michael D
2010-08-01
Plant geographers have sought for decades to describe and predict the geographic distribution of vegetation types on the basis of plant function and its relationship with the abiotic environment. Traditionally this has been accomplished using categorical representations such as plant functional types. Increasingly, plant functional ecologists have sought to refine categorical functional types via quantitative functional traits in order to understand the ecological implications of trade-offs in plant form and function. Fewer works have focused upon testing whether commonly measured functional traits enhance our understanding of plant biogeography broadly and the geographic distribution of vegetation types in particular. Here we combine a continental-scale forest inventory data set containing 18 111 plots with a plant functional trait data set to ask: (1) Is there a strong relationship between the abiotic environment and the distribution of functional trait values in forest inventory plots? And (2) can different Holdridge life zones be distinguished upon the basis of their functional trait distributions? The results show geographic patterns of functional trait distributions that are often strongly correlated with climate and also show that the Holdridge life zones in the study area can be differentiated using a combination of functional traits. PMID:20836445