Rapid, automated detection of stem canker symptoms in woody perennials using artificial neural network analysis

Background Pseudomonas syringae can cause stem necrosis and canker in a wide range of woody species including cherry, plum, peach, horse chestnut and ash. The detection and quantification of lesion progression over time in woody tissues is a key trait for breeders to select upon for resistance. Results In this study a general, rapid and reliable approach to lesion quantification using image recognition and an artificial neural network model was developed. This was applied to screen both the virulence of a range of P. syringae pathovars and the resistance of a set of cherry and plum accessions to bacterial canker. The method developed was more objective than scoring by eye and allowed the detection of putatively resistant plant material for further study. Conclusions Automated image analysis will facilitate rapid screening of material for resistance to bacterial and other phytopathogens, allowing more efficient selection and quantification of resistance responses.

Modeling connectivity in terms of network activity

A new complex network model is proposed which is founded on growth, with new connections being established proportionally to the current dynamical activity of each node, which can be understood as a generalization of the Barabasi-Albert static model. By using several topological measurements, as well as optimal multivariate methods (canonical analysis and maximum likelihood decision), we show that this new model provides, among several other theoretical kinds of networks including Watts-Strogatz small-world networks, the greatest compatibility with three real-world cortical networks.

Fault detection in a cold forging process through feature extraction with a neural network

This paper investigates the application of neural networks to the recognition of lubrication defects typical to an industrial cold forging process employed by fastener manufacturers. The accurate recognition of lubrication errors, such as coating not being applied properly or damaged during material handling, is very important to the quality of the final product in fastener manufacture. Lubrication errors lead to increased forging loads and premature tool failure, as well as to increased defect sorting and the re-processing of the coated rod. The lubrication coating provides a barrier between the work material and the die during the drawing operation; moreover it needs be sufficiently robust to remain on the wire during the transfer to the cold forging operation. In the cold forging operation the wire undergoes multi-stage deformation without the application of any additional lubrication. Four types of lubrication errors, typical to production of fasteners, were introduced to a set of sample rods, which were subsequently drawn under laboratory conditions. The drawing force was measured, from which a limited set of features was extracted. The neural network based model learned from these features is able to recognize all types of lubrication errors to a high accuracy. The overall accuracy of the neural network model is around 98% with almost uniform distribution of errors between all four errors and the normal condition.

Modelling of porosity defects in high pressure die casting with a neural network

High Pressure Die Casting (HPDC) is a complex process that results in casting defects if configured improperly. However, finding out the optimal configuration is a non-trivial task as eliminating one of the casting defects (for example, porosity) can result in occurrence of other casting defects. The industry generally tries to eliminate the defects by trial and error which is an expensive and error -prone process. This paper aims to improve current modelling and understanding of defects formation in HPDC machines. We have conducted conventional die casting tests with a neural network model of HPDC machine and compared the obtained results with the current understanding of formation of porosity. While most of our findings correspond well to established knowledge in the field, some of our findings are in conflict with the previous studies of die casting.

Automotive can network response time analysis with variable jitter

Many methods to calculate message latencies for Controller Area Network (CAN) have previously been presented based upon the static worst-case behaviour of the system. With the use of modern simulation tools however, the behaviour of CAN networks can be simulated dynamically in order to find the likely worst-case response times for CAN messages. This paper shows the development of an automotive body control network model to be used as the basis for further simulations. A method to simulate the Worst-Case Response Time of this model is then presented, taking into account random queuing jitter.

Analytical network modeling of heterogeneous large-scale cluster systems

The study of the communication networks for distributed systems is very important, since the overall performance of these systems is often depends on the effectiveness of its communication network. In this paper, we address the problem of networks modeling for heterogeneous large-scale cluster systems. We consider the large-scale cluster systems as a typical cluster of clusters system. Since the heterogeneity is becoming common in such systems, we take into account network as well as cluster size heterogeneity to propose the model. To this end, we present an analytical network model and validate the model through comprehensive simulation. The results of the simulation demonstrated that the proposed model exhibits a good degree of accuracy for various system organizations and under different working conditions.

Controller area network (CAN) modelling for automotive body control applications

This research details methods to improve upon current worst-case message response time analysis of CAN networks. Also, through the development of a CAN network model, and using modern simulation software, methods were shown to provide more realistic analyses of both sporadic and periodic messages on CAN networks prior to implementation.

A hybrid ART-GRNN online learning neural network with a ε-insensitive loss function

In this brief, a new neural network model called generalized adaptive resonance theory (GART) is introduced. GART is a hybrid model that comprises a modified Gaussian adaptive resonance theory (MGA) and the generalized regression neural network (GRNN). It is an enhanced version of the GRNN, which preserves the online learning properties of adaptive resonance theory (ART). A series of empirical studies to assess the effectiveness of GART in classification, regression, and time series prediction tasks is conducted. The results demonstrate that GART is able to produce good performances as compared with those of other methods, including the online sequential extreme learning machine (OSELM) and sequential learning radial basis function (RBF) neural network models.

Construction of neural network-based prediction intervals using particle swarm optimization

Prediction intervals (PIs) are excellent tools for quantification of uncertainties associated with point forecasts and predictions. This paper adopts and develops the lower upper bound estimation (LUBE) method for construction of PIs using neural network (NN) models. This method is fast and simple and does not require calculation of heavy matrices, as required by traditional methods. Besides, it makes no assumption about the data distribution. A new width-based index is proposed to quantitatively check how much PIs are informative. Using this measure and the coverage probability of PIs, a multi-objective optimization problem is formulated to train NN models in the LUBE method. The optimization problem is then transformed into a training problem through definition of a PI-based cost function. Particle swarm optimization (PSO) with the mutation operator is used to minimize the cost function. Experiments with synthetic and real-world case studies indicate that the proposed PSO-based LUBE method can construct higher quality PIs in a simpler and faster manner.

Artificial neural network analysis of twin tunnelling-induced ground settlements

In this paper, we apply a computational intelligence method for tunnelling settlement prediction. A supervised feed forward back propagation neural network is used to predict the surface settlement during twin-tunnelling while surface buildings are considered in the models. The performance of the statistical neural network structure is tested on a dataset provided by numerical parametric studies conducted by ABAQUS software based on Shiraz line 1 metro data. Six input variables are fed to neural network model for predicting the surface settlement. These include tunnel center depth, distance between centerlines of twin tunnels, buildings width and building bending stiffness, and building weight and distance to tunnel centerline. Simulation results indicate that the proposed NN models are able to accurately predict the surface settlement.

An ant colony system based on the physarum network

The Physarum Network model exhibits the feature of important pipelines being reserved with the evolution of network during the process of solving a maze problem. Drawing on this feature, an Ant Colony System (ACS), denoted as PNACS, is proposed based on the Physarum Network (PN). When updating pheromone matrix, we should update both pheromone trails released by ants and the pheromones flowing in a network. This hybrid algorithm can overcome the low convergence rate and local optimal solution of ACS when solving the Traveling Salesman Problem (TSP). Some experiments in synthetic and benchmark networks show that the efficiency of PNACS is higher than that of ACS. More important, PNACS has strong robustness that is very useful for solving a higher dimension TSP.

Artificial neural network modeling of flow stress in hot rolling

In this study, an artificial neural network model is proposed to predict the flow stress variations during the hot rolling process. Optimization of the proposed neural network with respect to number of neurons within the hidden layer, different training methods and transfer functions of the neural network is performed. The results of the optimal network were compared with those of the conventional analytic method and it is shown that using an optimal neural network the mean calculated error is drastically reduced.

An analytical model for optimal spectrum leasing under constraints of quality of service in CRNs

Cognitive radio improves spectrum efficiency and mitigates spectrum scarcity by allowing cognitive users to opportunistically access idle chunks of the spectrum owned by licensed users. In long-term spectrum leasing markets, secondary network operators make a decision about how much spectrum is optimal to fulfill their users' data transmission requirements. We study this optimization problem in multiple channel scenarios. Under the constrains of expected user admission rate and quality of service, we model the secondary network into a dynamic data transportation system. In this system, the spectrum accesses of both primary users and secondary users are in accordance with stochastic processes, respectively. The main metrics of quality of service we are concerned with include user admission rate, average transmission delay and stability of the delay. To quantify the relationship between spectrum provisioning and quality of service, we propose an approximate analytical model. We use the model to estimate the lower and upper bounds of the optimal amount of the spectrum. The distance between the bounds is relatively narrow. In addition, we design a simple algorithm to compute the optimum by using the bounds. We conduct numerical simulations on a slotted multiple channel dynamic spectrum access network model. Simulation results demonstrate the preciseness of the proposed model. Our work sheds light on the design of game and auction based dynamic spectrum sharing mechanisms in cognitive radio networks.

A Mismatch-Based Model for Memory Reconsolidation and Extinction in Attractor Networks

OSAN, R. , TORT, A. B. L. , AMARAL, O. B. . A mismatch-based model for memory reconsolidation and extinction in attractor networks. Plos One, v. 6, p. e23113, 2011.

A modified Hopfield model for solving the N-Queens problem

A neural network model for solving the N-Queens problem is presented in this paper. More specifically, a modified Hopfield network is developed and its internal parameters are computed using the valid-subspace technique. These parameters guarantee the convergence of the network to the equilibrium points. The network is shown to be completely stable and globally convergent to the solutions of the N-Queens problem. Simulation results are presented to validate the proposed approach.