Search

Machine learning (ML), a form of artificial intelligence (AI), is being increasingly employed in neurology. Reported performance metrics often match or exceed the efficiency of average clinicians. The neurologist is easily baffled by the underlying concepts and terminologies associated with ML studies. The superlative performance metrics of ML algorithms often hide the opaque nature of its inner workings. Questions regarding ML model's interpretability and reproducibility of its results in real-world scenarios, need emphasis. Given an abundance of time and information, the expert clinician should be able to deliver comparable predictions to ML models, a useful benchmark while evaluating its performance. Predictive performance metrics of ML models should not be confused with causal inference between its input and output. ML and clinical gestalt should compete in a randomized controlled trial before they can complement each other for screening, triaging, providing second opinions and modifying treatment. [ABSTRACT FROM AUTHOR]

Blade icing seriously affects wind turbines' aerodynamic performance and output power. Timely and accurately predicting blade icing status is crucial to improving the economy and safety of wind farms. However, existing blade icing prediction methods cannot effectively solve the problems of unbalanced icing/non-icing data and low prediction accuracy. In order to solve the above problems, this paper proposes a wind turbine blade icing prediction method based on the focal loss function and CNN-Attention-GRU. First, the recursive feature elimination method combined with the physical mechanism of icing is used to extract features highly correlated with blade icing, and a new feature subset is formed through a sliding window algorithm. Then, the focal loss function is utilized to assign more weight to the ice samples with a lower proportion, addressing the significant class imbalance between the ice and non-ice categories. Finally, based on the CNN-Attention-GRU algorithm, a blade icing prediction model is established using continuous 24-h historical data as the input and the icing status of the next 24 h as the output. The model is compared with advanced neural network models. The results show that the proposed method improves the prediction accuracy and F1 score by an average of 6.41% and 4.27%, respectively, demonstrating the accuracy and effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Due to the continuous development of neural network technology, it has been widely applied in fields such as autonomous driving and biomedicine. However, adversarial attacks can significantly degrade the performance and reliability of neural networks, making defending against such attacks a crucial research area. In this paper, we propose a robust U-Net and adversarial generative network-based defense method, training the target model on a clean training set without adversarial samples. Firstly, we train the target neural network on a clean training set. Then, we train the robust U-Net using the clean training set, employing reparameterization and random noise to resist adversarial perturbations. To supervise the quality of transformed images, we employ the adversarial generative network, utilizing the RU-Net as the generator and a discriminator to ensure the quality of generated images. Finally, we use the transformed images to retrain the target neural network, obtaining a robust neural network model capable of defending against adversarial attacks. Experimental evaluations on CIFAR-10 and Tiny Image Net demonstrate the effectiveness of our method in countering adversarial attacks and enhancing neural network robustness. [ABSTRACT FROM AUTHOR]

This paper proposes two novel approaches for the problem of energy management in hybrid electric vehicles. Shuffled frog-leaping algorithm (SFLA) is a recently proposed population-based optimization algorithm. This paper first formulates energy management as an optimization problem and optimizes the problem using SFLA. Then the paper makes use of SFLA as a training algorithm to train artificial neural network (ANN) and this SFLA-trained ANN is used for energy management. Interestingly, the proposed approaches of this paper are found to be robust and more efficient than contemporary approaches. [ABSTRACT FROM PUBLISHER]

The 3D measurement system based on line-structured light uses a camera to capture laser stripes due to changing in the shape of an object, and uses the acquired pixel coordinates for 3D reconstruction. System calibration is an important step in 3D measurement. The current camera calibration algorithm research mainly focuses on improving the algorithm itself, and there is less research on the influence of external factors. This paper proposes a coplanar hybrid calibration algorithm based on the error screening model by combining the error screening model, mathematical model and neural network model. It is mainly divided into two steps. The first step is to use the radial array constraint calibration algorithm based on the error screening model to solve the camera's internal and external parameters. The second step uses the camera internal and external parameters obtained in the first step to convert the pixel coordinates into real three-dimensional coordinates, and compares the calculated three-dimensional coordinates with the actual coordinates. Using machine learning to establish a compensation network, get a compensation function, and use the resulting 3D world coordinates to perform point cloud stitching. Experiments show that compared with the traditional calibration algorithm, the calibration algorithm has a small error and reduces the calibration error by about 6.5%. [ABSTRACT FROM AUTHOR]

Past research on the process of extinguishing a fire typically used a traditional linear water jet falling point model and the results ignored external factors, such as environmental conditions and the status of the fire engine, even though the water jet falling point location prediction was often associated with these parameters and showed a nonlinear relationship. This paper constructed a BP (Back Propagation) neural network model. The fire gun nozzle characteristics were included as model inputs, and the water discharge point coordinates were the model outputs; thus, the model could precisely predict the water discharge point with small error and high precision to determine an accurate firing position and allow for the timely adjustment of the spray gun. To improve the slow convergence and local optimality problems of the BP neural network (BPNN), this paper further used a genetic algorithm to optimize the BPNN (GA-BPNN). The BPNN can be used to optimize the weights in the network to train them for global optimization. A genetic algorithm was introduced into the neural network approach, and the water jet landing prediction model was further improved. The simulation results showed that the prediction accuracy of the GA-BP model was better than that of the BPNN alone. The established model can accurately predict the location of the water jet, making the prediction results more useful for firefighters. [ABSTRACT FROM AUTHOR]

This paper addresses the challenge of learning to play many different video games with little domain-specific knowledge. Specifically, it introduces a neuroevolution approach to general Atari 2600 game playing. Four neuroevolution algorithms were paired with three different state representations and evaluated on a set of 61 Atari games. The neuroevolution agents represent different points along the spectrum of algorithmic sophistication—including weight evolution on topologically fixed neural networks (conventional neuroevolution), covariance matrix adaptation evolution strategy (CMA–ES), neuroevolution of augmenting topologies (NEAT), and indirect network encoding (HyperNEAT). State representations include an object representation of the game screen, the raw pixels of the game screen, and seeded noise (a comparative baseline). Results indicate that direct-encoding methods work best on compact state representations while indirect-encoding methods (i.e., HyperNEAT) allow scaling to higher dimensional representations (i.e., the raw game screen). Previous approaches based on temporal-difference (TD) learning had trouble dealing with the large state spaces and sparse reward gradients often found in Atari games. Neuroevolution ameliorates these problems and evolved policies achieve state-of-the-art results, even surpassing human high scores on three games. These results suggest that neuroevolution is a promising approach to general video game playing (GVGP). [ABSTRACT FROM PUBLISHER]

Wireless mesh networks are a special class of wireless networks that are implemented as a collection of radio nodes in a mesh pattern or topology. Unlike MANETs, the mobility of nodes is very less in the topology. Quality of service is an essential metric in the performance of mesh networks which are attributed to several parameters including optimal routing through shortest path, ability for other nodes to communicate even if a particular node in the mesh fails, minimization of packet loss and time delay, computational complexity and cost, energy. This research paper is focused toward minimization of energy taken as the objective function and a five-stage neural network is used and trained after optimizing with a genetic algorithm. The experiments have been conducted in NS2 and Qualnet environment with a varying number of mesh routers and energy computed. The performance of energy savings has been compared against conventional routing techniques like AODV and a bee colony optimization technique presented in the literature. An energy savings of 51% have been reported in the paper justifying the superiority of the hybrid G-ANN algorithm. [ABSTRACT FROM AUTHOR]

Analyzing and predicting the trend of price fluctuation has been receiving more and more attention, as price risk has become the focus of risk control research in heating oil futures market. A novel time series prediction model combined with the complex network method is put forward in the paper. First of all, this paper counts the cumulative time interval of different nodes in the network, and fits its growth trend with the Fourier model. Then a novel price fluctuation prediction model is established based on the effective information such as some topology properties extracted from the network. The results show that the Fourier model can predict the emergence time of new nodes in the next stage, and the established price fluctuation prediction model can infer the names of nodes in the prediction interval, so as to determine the forward-looking behavior of price evolution. Besides, liken to the NAR neural network, the prediction results obtained by the proposed method also show superiority, which has important theoretical value and academic significance for early warning and prediction of price behavior in the heating oil futures market. [ABSTRACT FROM AUTHOR]

This paper presents a controller integrity monitoring method for a class of second-order nonlinear uncertain systems incorporating neural network-based adaptive control algorithms. The adaptive neural network model is employed to ensure robust tracking performance in the presence of certain modeling uncertainty under consideration during the offline controller design process. Based on Lyapunov stability analysis, an online controller integrity monitoring scheme is developed to detect the occurrence of controller software/algorithm faults and unanticipated physical component faults, which may lead to unstable learning behaviors and malfunctions of the adaptive controller. Adaptive thresholds for detecting controller malfunctions are derived, ensuring the robustness with respect to modeling uncertainty and neural network approximation error. Additionally, the detectability conditions are investigated, characterizing the class of detectable software faults and unanticipated physical faults. An upper bound on the fault detection time is also established. Simulation results are shown to illustrate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

This paper describes and evaluates several global optimization issues of Artificial Neural Networks (ANN) and their applications. In this paper, the authors examine the properties of the feed-forward neural networks and the process of determining the appropriate network inputs and architecture, and built up a short-term gas load forecast system - the Tell Future system. This system performs very well for short-term gas load forecasting, which is built based on various Back-Propagation (BP) algorithms. The standard Back-Propagation (BP) algorithm for training feed-forward neural networks have proven robust even for difficult problems. In order to forecast the future load from the trained networks, the history loads, temperature, wind velocity, and calendar information should be used in addition to the predicted future temperature and wind velocity. Compared to other regression methods, the neural networks allow more flexible relationships between temperature, wind, calendar information and load pattern. Feed-forward neural networks can be used in many kinds of forecasting in different industrial areas. Similar models can be built to make electric load forecasting, daily water consumption forecasting, stock and markets forecasting, traffic flow and product sales forecasting. [ABSTRACT FROM AUTHOR]

Classification of power-quality (PQ)-related voltage and current waveform disturbances is a key task for power system monitoring. A new method based on the optimized time-frequency representation (TFR) has been proposed in the first paper [1] of this two-paper series. This paper (the second paper) presents a case study of PQ event classification with the proposed method. The classification algorithm has been successfully tested with $60 real world PQ events that cover five classes, achieving a recognition rate of 98%. The algorithm is implemented on a digital signal processor (DSP) based hardware system and optimized according to the DSP architecture to meet the hard real-time constraints. The DSP-based system is capable of processing a five-cycle (83.3 ms) PQ waveform within 11.2 ms. The real-time computing capability of the algorithm has been verified with this result. The scalability of this method is also discussed. [ABSTRACT FROM AUTHOR]

This paper presents a novel approach to the localization of moving targets in a complex environment based on the measurement of the perturbations induced by the target presence on an independently‐generated time‐varying electromagnetic field. Field perturbations are measured via a set of sensors deployed over the domain of interest and used to detect and track a possible target by resorting to a particle Bernoulli filter (PBF). To comply with real‐time operation, the PBF works along with an artificial neural network (ANN) model of the environment trained offline via finite elements (FEs). The performance of the proposed algorithm is assessed via simulation experiments. [ABSTRACT FROM AUTHOR]

Brain tumors are major causes of death in today's world and methods of detecting them prematurely require vast improvement. The objective of this project is to detect the tumors early from MR image scans by utilizing deep convolutional networks to locate the tumor. The tumor is divided at first in the main stage and the generated bounding box is utilized for the center of the tumor in second step. This is trailed by division based on the bounding box of the tumor center division result. Examinations are performed with the BraTS 2017 validation set. This is a numerous division issue. [ABSTRACT FROM AUTHOR]

A residual networks family with hundreds or even thousands of layers dominates major image recognition tasks, but building a network by simply stacking residual blocks inevitably limits its optimization ability. This paper proposes a novel residual network architecture, residual networks of residual networks (RoR), to dig the optimization ability of residual networks. RoR substitutes optimizing residual mapping of residual mapping for optimizing original residual mapping. In particular, RoR adds levelwise shortcut connections upon original residual networks to promote the learning capability of residual networks. More importantly, RoR can be applied to various kinds of residual networks (ResNets, Pre-ResNets, and WRN) and significantly boost their performance. Our experiments demonstrate the effectiveness and versatility of RoR, where it achieves the best performance in all residual-network-like structures. Our RoR-3-WRN58-4 + SD models achieve new state-of-the-art results on CIFAR-10, CIFAR-100, and SVHN, with the test errors of 3.77%, 19.73%, and 1.59%, respectively. RoR-3 models also achieve state-of-the-art results compared with ResNets on the ImageNet data set. [ABSTRACT FROM AUTHOR]

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

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

Artificial neural networks (ANNs) are generally regarded to behave as black-box systems. Recent research explores various methods that can provide an insight into the internal connections and relationships existing within the network. Various methodologies that understand the input variable contribution are analyzed in detail, and rule extraction approaches for a trained artificial neural network are addressed. To understand the contribution of input variables to rainfall-runoff model combination systems, this paper for the first time investigates knowledge extraction from artificial neural network, which is used to combine the results obtained from different competing rainfall-runoff models, using three different approaches: (1) Garson's algorithm; (2) neural interpretation diagram (NID); and (3) sensitivity analysis (SA). For the purpose of investigating knowledge extraction techniques, the trained multilayer perceptron neural network to combine the results from four different rainfall-runoff models for the Brosna Catchment located in Ireland has been chosen. The results of the three approaches obtained in this study indicate that they can be used to reduce the complexity of rainfall-runoff model combination systems by eliminating the least significant contributing input variables. Based on these approaches, the paper helps to provide guidance in the optimal number of rainfall-runoff models that best perform in a combination system. [ABSTRACT FROM AUTHOR]

Gramophone records were the main recording medium for more than seven decades and regained widespread popularity over the past several years. Being an analog storage medium, gramophone records are subject to distortions caused by scratches, dust particles, degradation, and other means of improper handling. The observed noise often leads to an unpleasant listening experience and requires a filtering process to remove the unwanted disruptions and improve the audio quality. This paper proposes a novel approach that employs various feed forward time delay artificial neural networks to detect and reconstruct noise in musical sound waves. A set of 800 songs from eight different genres were used to validate the performance of the neural networks. The performance was analyzed according to the outlier detection and interpolation accuracy, the computational time and the tradeoff between the accuracy and the time. The empirical results of both detection and reconstruction neural networks were compared to a number of other algorithms, including various statistical measurements, duplication approaches, trigonometric processes, polynomials, and time series models. It was found that the neural networks’ outlier detection accuracy was slightly lower than some of the other noise identification algorithms, but achieved a more efficient tradeoff by detecting most of the noise in real time. The reconstruction process favored neural networks with an increase in the interpolation accuracy compared to other widely used time series models. It was also found that certain genres such as classical, country, and jazz music were interpolated more accurately. Volatile signals, such as electronic, metal, and pop music were more challenging to reconstruct and were substantially better interpolated using neural networks than the other examined algorithms. [ABSTRACT FROM PUBLISHER]

Knowledge-based neural network modeling techniques using space-mapping concept have been demonstrated in the existing literature as efficient methods to overcome the accuracy limitations of empirical/equivalent circuit models when matching new electromagnetic data. For different modeling problems, the mapping structures can be different. In this paper, we propose a unified automated model generation algorithm that uses \boldsymbol l\mathbf {1} optimization to automatically determine the type and the topology of the mapping structure in a knowledge-based neural network model. By encompassing various types of mappings of the knowledge-based neural network model in the existing literature, we present a new unified model structure and derive new sensitivity formulas for the training of the unified model. The proposed \boldsymbol l\mathbf {1} formulation of modeling can force some weights of the mapping neural networks to zeros while leaving other weights as nonzeros. We utilize this feature to allow \boldsymbol l\mathbf {1} optimization to automatically determine which mapping is necessary and which mapping is unnecessary. Using the proposed \boldsymbol l\mathbf {1} optimization method, the mapping structure can be determined to address different needs of different modeling problems. The structure of the final knowledge-based model can be flexible combinations of some or all of linear mapping, nonlinear mapping, input mapping, frequency mapping, and output mapping. In this way, the proposed algorithm is more systematic and can further speed up the knowledge-based modeling process than existing knowledge-based modeling algorithms. The proposed method is illustrated by three microwave filter modeling examples. [ABSTRACT FROM PUBLISHER]

Copyright of Journal of East China University of Science & Technology is the property of Journal of East China University of Science & Technology Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Background: Given the extensive use and preferred diagnostic method in common mammography tests for screening and diagnosis of breast cancer, there is concern about the increased dose absorbed by the patient due to the sensitivity of the breast tissue. Objective: This study aims to evaluate the entrance surface air kerma (ESAK) before irradiation to the patient through its estimation. Material and Methods: In this descriptive paper, firstly, a phantom was used to measure some data, including ESAK, Kvp, mAs, HVL, and type of filter/target. Secondly, the MultiLayer Perceptron (MLP) neural network model was trained with Levenberg-Marquardt (LM) backpropagation training algorithm and finally, ESAK was estimated. Results: Based on results obtained from the program in different neuron numbers, it was found that the number of 35 neurons is the most optimal value, offering a regression coefficient of 95.7%. The Mean Squared Error (MSE) for all data was 0.437 mGy and accounting for 4.8% of the output range changes, predicting 95.2% accuracy in the present research. Conclusion: Using neural networks in ESAK prediction, the method proposed in the present research leads to the possible ESAK estimation of patients before X-Ray. The results suggested that the regression coefficient represented 4.3% difference between the kerma measured by solid-state dosimeter in the radiation field and the value predicted in the research. In comparison with the Monte-Carlo simulation method, this method has better accuracy. [ABSTRACT FROM AUTHOR]

This paper presents two algorithms, both based on the time of flight (ToF) of scattered waves, to locate defect in an anisotropic woven-fabric carbon fiber reinforced polymer (CFRP) plate. The first algorithm uses a probabilistic approach by constructing a probability matrix. Each element of this matrix is associated with a location and represents the probability of existing a defect at the corresponding spatial coordinates of the plate. For the probability matrix method, localization results are influenced by manually chosen parameters and by the anisotropy of the CFRP plate. The second algorithm, based on artificial neural networks (ANNs), enables us to improve the accuracy of locating defects. With this ANN method, the anisotropic feature can be “learned” by the neural network from training data. The ToF of scattered waves obtained from three sensor pairs were used directly as inputs of the neural network. The spatial coordinates of the defect are the ANN outputs. The difficulty of obtaining sufficient experimental data for ANN training was surpassed by using added blocks on the surface of the plate under test to simulate defects. This scheme was validated and proved to be effective by comparing the scattered waves from a delamination and from an added block. Conclusions have been drawn by comparing the two methods. The localization results obtained by the ANN algorithm are proved to be better. [ABSTRACT FROM AUTHOR]

Homology Continuity is a fundamental property of the nature, but few of the traditional pattern recognition algorithms were aware of it. Firstly, this paper gives a brief description to the Principle of Homology Continuity (PHC), and tries to mathematically redefine it. Then, we introduce a PHC-based pattern learning method — Geometrical Covering Learning (GCL), following the Hyper sausage neural network as an instance of GCL. Lastly, we propose a GCL solution to the “two-spirals” pattern recognition problem. The final experimental results show that the new method is feasible and efficient. [ABSTRACT FROM AUTHOR]

In palynology, the visual classification of pollen grains from different species is a hard task which is usually tackled by human operators using microscopes. Its complete automatization would save a high quantity of resources and provide valuable improvements especially for allergy-related information systems, but also for other application fields as paleoclimate reconstruction, quality control of honey based products, collection of evidences in criminal investigations or fabric dating and tracking. This paper presents three state-of-the-art deep learning classification methods applied to the recently published POLEN23E image dataset. The three methods make use of convolutional neural networks: the first one is strictly based on the idea of transfer learning, the second one is based on feature extraction and the third one represents a hybrid approach, combining transfer learning and feature extraction. The results from the three methods are indeed very good, reaching over 97% correct classification rates in images not previously seen by the models, where other authors reported around 70. [ABSTRACT FROM AUTHOR]

Automatic image annotation aims to predict labels for images according to their semantic contents and has become a research focus in computer vision, as it helps people to edit, retrieve and understand large image collections. In the last decades, researchers have proposed many approaches to solve this task and achieved remarkable performance on several standard image datasets. In this paper, we propose a novel learning to rank approach to address image auto-annotation problem. Unlike typical learning to rank algorithms for image auto-annotation which directly rank annotations for image, our approach consists of two phases. In the first phase, neural ranking models are trained to rank image’s semantic neighbors. Then nearest-neighbor based models propagate annotations from these semantic neighbors to the image. Thus our approach integrates learning to rank algorithms and nearest-neighbor based models, including TagProp and 2PKNN, and inherits their advantages. Experimental results show that our method achieves better or comparable performance compared with the state-of-the-art methods on four challenging benchmarks including Corel5K, ESP Games, IAPR TC-12 and NUS-WIDE. [ABSTRACT FROM AUTHOR]

Abstract: The hearing sense is one of the five senses essential for human life. The hearing sense is required to acquire language, learn how to speak, and gain general knowledge. Most importantly, hearing enables individuals to communicate and socialize with the world around them. Deaf people suffer from hearing loss which affects many aspects of their lives; they cannot communicate or socialize effectively with normal people around them. In addition, the safety of deaf people is compromised in many scenarios because they cannot take the right decision emanating from the process of analyzing sounds in the brain, especially alarming sounds. The treatment of hearing loss is dependent on its level. Medicine fails to treat many cases of severe or profound deafness; therefore, people lose hope to live normally. In this paper, we propose a Deaf Assistance Digital System (DADS) that aims to convert major alarm sounds and words which are not distinguishable by deaf people into recognizable alerts for deaf people. The proposed system strives to help deaf people live normally by alerting them about sounds like baby crying or door bell. Moreover, DADS enhances the safety of deaf people by alerting them about alarming sounds and cautionary words. DADS consists of a speech recognition engine and a sound recognition engine. The speech recognition engine is based on the Soundx algorithm while the sound recognition system is implemented using neural networks. The implemented sound recognition and voice recognition engines have more than 90% accuracy. [ABSTRACT FROM AUTHOR]

Negative correlation learning (NCL) is a neural network ensemble learning algorithm that introduces a correlation penalty term to the cost function of each individual network so that each neural network minimizes its mean square error/MSEI together with the correlation of the ensemble. This paper analyzes NCL and reveals that the training of NCL (when λ = 1) corresponds to training the entire ensemble as a single learning machine that only minimizes the MSE without regularization. This analysis explains the reason why NCL is prone to overtitting the noise in the training set. This paper also demonstrates that tuning the correlation parameter λ in NCL by cross validation cannot overcome the overfitting problem. The paper analyzes this problem and proposes the regularized negative correlation learning (RNCL) algorithm which incorporates an additional regularization term for the whole ensemble. RNCL decomposes the ensemble's training objectives, including MSE and regularization, into a set of sub-objectives, and each sub-objective is implemented by an individual neural network. In this paper, we also provide a Bayesian interpretation for RNCL and provide an automatic algorithm to optimize regularization parameters based on Bayesian inference. The RNCL formulation is applicable to any nonlinear estimator minimizing the MSE. The experiments on synthetic as well as real-world data sets demonstrate that RNCL achieves better performance than NCL, especially when the noise level is nontrivial in the data set. [ABSTRACT FROM AUTHOR]

In this paper, we suggest basing the development of classification methods on traditional techniques but approximating them in whole or in part with artificial neural networks (ANNs). Compared to a direct ANN approach, the underlying traditional method is often easier to analyse. Classification failures can be better understood and corrected for, while at the same time faster execution can be obtained due to the parallel ANN structure. Furthermore, such a two‐step design philosophy partly eliminates the 'guesswork' associated with the design of ANNs. The expected gain is thus that the benefits from the traditional field, and the ANN field can be obtained by combining the best features from both fields. We illustrate our approach by working through an explicit example, namely, a Nearest Neighbour classifier applied to a subset of the MNIST database of handwritten digits. Two different approaches are discussed for how to translate the traditional method into an ANN. The first approach is based on a constructive implementation which directly reflects the original algorithm. The second approach uses ANNs to approximate the whole, or part of, the original method. An important part of the approach is to show how improvements can be introduced. In line with the presented philosophy, this is done by extending the traditional method in several ways followed by ANN approximation of the modified algorithms. The extensions are based on a windowed version of the nearest neighbour algorithm. We show that the improvements carry over to the ANN implementations. We further investigate the stability of the solutions by modifying the training set. It is shown that the errors do not change significantly. This also holds true for the ANN approximations providing confidence that the two‐step strategy is robust. [ABSTRACT FROM AUTHOR]

In this paper, we seek to improve deep neural networks by generalizing the pooling operations that play a central role in the current architectures. We pursue a careful exploration of approaches to allow pooling to learn and to adapt to complex and variable patterns. The two primary directions lie in: (1) learning a pooling function via (two strategies of) combining of max and average pooling, and (2) learning a pooling function in the form of a tree-structured fusion of pooling filters that are themselves learned. In our experiments every generalized pooling operation we explore improves performance when used in place of average or max pooling. We experimentally demonstrate that the proposed pooling operations provide a boost in invariance properties relative to conventional pooling and set the state of the art on several widely adopted benchmark datasets. These benefits come with only a light increase in computational overhead during training (ranging from additional 5 to 15 percent in time complexity) and a very modest increase in the number of model parameters (e.g., additional 1, 9, and 27 parameters for mixed, gated, and 2-level tree pooling operators, respectively). To gain more insights about our proposed pooling methods, we also visualize the learned pooling masks and the embeddings of the internal feature responses for different pooling operations. Our proposed pooling operations are easy to implement and can be applied within various deep neural network architectures. [ABSTRACT FROM PUBLISHER]

This paper presents the Self-Sorting Map (SSM), a novel algorithm for organizing and presenting multimedia data. Given a set of data items and a dissimilarity measure between each pair of them, the SSM places each item into a unique cell of a structured layout, where the most related items are placed together and the unrelated ones are spread apart. The algorithm integrates ideas from dimension reduction, sorting, and data clustering algorithms. Instead of solving the continuous optimization problem that other dimension reduction approaches do, the SSM transforms it into a discrete labeling problem. As a result, it can organize a set of data into a structured layout without overlap, providing a simple and intuitive presentation. The algorithm is designed for sorting all data items in parallel, making it possible to arrange millions of items in seconds. Experiments on different types of data demonstrate the SSM’s versatility in a variety of applications, ranging from positioning city names by proximities to presenting images according to visual similarities, to visualizing semantic relatedness between Wikipedia articles. [ABSTRACT FROM PUBLISHER]

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

This paper examines a linked simulation-optimization procedure based on the combined application of an artificial neural network (ANN) and genetic algorithm (GA) with the aim of developing an efficient model for the multiobjective management of groundwater lenses in small islands. The simulation-optimization methodology is applied to a real aquifer in Kish Island of the Persian Gulf to determine the optimal groundwater-extraction while protecting the freshwater lens from seawater intrusion. The initial simulations are based on the application of SUTRA, a variable-density groundwater numerical model. The numerical model parameters are calibrated through automated parameter estimation. To make the optimization process computationally feasible, the numerical model is subsequently replaced by a trained ANN model as an approximate simulator. Even with a moderate number of input data sets based on the numerical simulations, the ANN metamodel can be efficiently trained. The ANN model is subsequently linked with GA to identify the nondominated or Pareto-optimal solutions. To provide flexibility in the implementation of the management plan, the model is built upon optimizing extraction from a number of zones instead of point-well locations. Two issues are of particular interest to the research reported in this paper are: (1) how the general idea of minimizing seawater intrusion can be effectively represented by objective functions within the framework of the simulation-optimization paradigm, and (2) the implications of applying the methodology to a real-world small-island groundwater lens. Four different models have been compared within the framework of multiobjective optimization, including (1) minimization of maximum salinity at observation wells, (2) minimization of the root mean square (RMS) change in concentrations over the planning period, (3) minimization of the arithmetic mean, and (4) minimization of the trimmed arithmetic mean of concentration in the observation wells. The latter model can provide a more effective framework to incorporate the general objective of minimizing seawater intrusion. This paper shows that integration of the latest innovative tools can provide the ability to solve complex real-world optimization problems in an effective way. [ABSTRACT FROM AUTHOR]

Copyright of Automatisierungstechnik is the property of De Gruyter and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Style transfer is a process of migrating a style from a given image to the content of another, synthesizing a new image, which is an artistic mixture of the two. Recent work on this problem adopting convolutional neural-networks (CNN) ignited a renewed interest in this field, due to the very impressive results obtained. There exists an alternative path toward handling the style transfer task, via the generalization of texture synthesis algorithms. This approach has been proposed over the years, but its results are typically less impressive compared with the CNN ones. In this paper, we propose a novel style transfer algorithm that extends the texture synthesis work of Kwatra et al. (2005), while aiming to get stylized images that are closer in quality to the CNN ones. We modify Kwatra’s algorithm in several key ways in order to achieve the desired transfer, with emphasis on a consistent way for keeping the content intact in selected regions, while producing hallucinated and rich style in others. The results obtained are visually pleasing and diverse, shown to be competitive with the recent CNN style transfer algorithms. The proposed algorithm is fast and flexible, being able to process any pair of content + style images. [ABSTRACT FROM PUBLISHER]

In this paper, we focus on tackling the problem of automatic accurate localization of detected objects in high-resolution remote sensing images. The two major problems for object localization in remote sensing images caused by the complex context information such images contain are achieving generalizability of the features used to describe objects and achieving accurate object locations. To address these challenges, we propose a new object localization framework, which can be divided into three processes: region proposal, classification, and accurate object localization process. First, a region proposal method is used to generate candidate regions with the aim of detecting all objects of interest within these images. Then, generic image features from a local image corresponding to each region proposal are extracted by a combination model of 2-D reduction convolutional neural networks (CNNs). Finally, to improve the location accuracy, we propose an unsupervised score-based bounding box regression (USB-BBR) algorithm, combined with a nonmaximum suppression algorithm to optimize the bounding boxes of regions that detected as objects. Experiments show that the dimension-reduction model performs better than the retrained and fine-tuned models and the detection precision of the combined CNN model is much higher than that of any single model. Also our proposed USB-BBR algorithm can more accurately locate objects within an image. Compared with traditional features extraction methods, such as elliptic Fourier transform-based histogram of oriented gradients and local binary pattern histogram Fourier, our proposed localization framework shows robustness when dealing with different complex backgrounds. [ABSTRACT FROM PUBLISHER]

A doctor could say that a patient is sick while he/she is healthy or could say that the patient is healthy while he/she is sick, by mistake. So it is important to generate a system that can give a good diagnosis, in this case for abnormal eye movements. An abnormal eye movement is when the patient wants to move the eye to up or down and the eye does not move or the eye moves to other place. In this paper, a method for the pattern recognition is used to provide a better diagnosis for patients related with the abnormal eye movements. The real data of signals of two eye movements (up and down) of patients are obtained using a mindset ms-100 system. A new method that uses one intelligent algorithm for online pattern recognition is proposed. The difference between the proposed method and the previous works is that, in other works, both behaviors (up and down) are trained with one intelligent algorithm, while in this work, up behavior is trained with one intelligent algorithm and down behavior is trained with other intelligent algorithm; it is because the multi-output system can always be decomposed into a collection of single-output systems with the advantage to use different parameters for each one if necessary. The intelligent algorithm used by the proposed method could be any of the following: the adaline network denoted as AN, the multilayer neural network denoted as NN, or the Sugeno fuzzy inference system denoted as SF. So the comparison results of the proposed method using each of the intelligent algorithms for online pattern recognition of two eye movements are presented. [ABSTRACT FROM AUTHOR]

This paper presents a new approach to incipient fault diagnosis in power transformers, based on the results of dissolved gas analysis. A set of autoassociative neural networks or autoencoders is trained, so that each becomes tuned with a particular fault mode or no fault condition. The scarce data available forms clusters that are densified using an Information Theoretic Mean Shift algorithm, allowing all real data to be used in the validation process. Then, a parallel model is built where the autoencoders compete with one another when a new input vector is entered and the closest recognition is taken as the diagnosis sought. A remarkable accuracy of 100% is achieved with this architecture, in a validation data set using all real information available. [ABSTRACT FROM AUTHOR]

In this paper, problems of the online diagnostics of multiple faults in large scale systems are presented. Possibilities of recognition of multiple faults based on the knowledge of signatures of the single faults are discussed. The distinction between simultaneous faults and the series of faults is introduced and defined. The necessary condition for diagnostic reasoning assuming an occurrence of multiple faults is formulated. This paper will show that multiple faults appearing simultaneously or within short time intervals are correctly isolated under the assumption of single faults, if the subsets of faults suitable for isolation are disjunctive. A novel, practical and easy to implement algorithm designed for reasoning multiple faults is presented. An industrial example of the online diagnostics of a steam-water line of the power boiler is given. [ABSTRACT FROM AUTHOR]

This paper describes in full detail a model of a hierarchical classifier (HC). The original classification problem is broken down into several subproblems and a weak classifier is built for each of them. Subproblems consist of examples from a subset of the whole set of output classes. It is essential for this classification framework that the generated subproblems would overlap, i.e. some individual classes could belong to more than one subproblem. This approach allows to reduce the overall risk. Individual classifiers built for the subproblems are weak, i.e. their accuracy is only a little better than the accuracy of a random classifier. The notion of weakness for a multiclass model is extended in this paper. It is more intuitive than approaches proposed so far. In the HC model described, after a single node is trained, its problem is split into several subproblems using a clustering algorithm. It is responsible for selecting classes similarly classified. The main scope of this paper is focused on finding the most appropriate clustering method. Some algorithms are defined and compared. Finally, we compare a whole HC with other machine learning approaches. [ABSTRACT FROM AUTHOR]

Neural networks (NNs) have numerous applications to online processes, but the problem of stability is rarely discussed. This is an extremely important issue because, if the stability of a solution is not guaranteed, the equipment that is being used can be damaged, which can also cause serious accidents. It is true that in some research papers this problem has been considered, but this concerns continuous-time NN only. At the same time, there are many systems that are better described in the discrete time domain such as population of animals, the annual expenses in an industry, the interest earned by a bank, or the prediction of the distribution of loads stored every hour in a warehouse. Therefore, it is of paramount importance to consider the stability of the discrete-time NN. This paper makes several important contributions. 1) A theorem is stated and proven which guarantees uniform stability of a general discrete-time system. 2) It is proven that the backpropagation (BP) algorithm with a new time-varying rate is uniformly stable for online identification and the identification error converges to a small zone bounded by the uncertainty. 3) It is proven that the weights' error is bounded by the initial weights' error, i.e., overfitting is eliminated in the proposed algorithm. 4) The BP algorithm is applied to predict the distribution of loads that a transelevator receives from a trailer and places in the deposits in a warehouse every hour, so that the deposits in the warehouse are reserved in advance using the prediction results. 5) The BP algorithm is compared with the recursive least square (RLS) algorithm and with the Takagi–Sugeno type fuzzy inference system in the problem of predicting the distribution of loads in a warehouse, giving that the first and the second are stable and the third is unstable. 6) The BP algorithm is compared with the RLS algorithm and with the Kalman filter algorithm in a synthetic example. [ABSTRACT FROM AUTHOR]

In this paper, we propose an algorithm based on the central limit theorem to compute the sensitivity of the multilayer perceptron (MLP) due to the errors of the inputs and weights. For simplicity and practicality, all inputs and weights studied here are independently identically distributed (i.i.d.). The theoretical results derived from the proposed algorithm show that the sensitivity of the MLP is affected by the number of layers and the number of neurons adopted in each layer. To prove the reliability of the proposed algorithm, some experimental results of the sensitivity are also presented, and they match the theoretical ones. The good agreement between the theoretical results and the experimental results verifies the reliability and feasibility of the proposed algorithm. Furthermore, the proposed algorithm can also be applied to compute precisely the sensitivity of the MLP with any available activation functions and any types of i.i.d. inputs and weights. [ABSTRACT FROM AUTHOR]

In this paper, the use of a hybrid evolutionary optimization algorithm is proposed for global optimization of pavement structural parameters through inverse modeling. Shuffled complex evolution (SCE) is a population-based stochastic optimization technique combining the competitive complex evolution with the controlled random search, the implicit clustering, and the complex shuffling. Back-calculation of pavement layer moduli is an ill-posed inverse engineering problem, which involves searching for the optimal combination of pavement layer stiffness solutions in an unsmooth, multimodal, complex search space. SCE is especially considered a robust and efficient approach for global optimization of multimodal functions. A desirable characteristic of the SCE algorithm is that it uses information about the nature of the response surface, extracted using the deterministic Simplex geometric shape, to direct the search into regions with higher posterior probability. The hybrid back-calculation system described in this paper combines the robustness of the SCE in global optimization with the computational efficiency of neural networks and advanced pavement system characterization offered by employing finite-element models. This is the first time the SCE approach is applied to real-time nondestructive evaluation of pavement systems required in the routine maintenance and rehabilitation activities for sustainable transportation infrastructure. [ABSTRACT FROM AUTHOR]

This paper presents a novel vehicle-classification algorithm that uses the time-variable signal generated by a single inductive loop detector. In earlier studies, the noisy raw signal was fed into the algorithm by reducing its size with rough sampling. However, this approach loses the original signal form and cannot be the best exemplar vector. The developed algorithm suggests three contributions to cope with these problems. The first contribution is to clear the noise with discrete Fourier transform (DFT). The second contribution is to transfer the noiseless pattern into the Principal Component Analysis (PCA) domain. PCA is exploited not only for decorrelation but for explicit dimensionality reduction as well. This goal cannot be achieved by simple raw data sampling. The last contribution is to expand the principal components with a local maximum (Lmax) parameter. It strengthens the classification accuracy by emphasizing the undercarriage height variation of the vehicle. These parameters are fed into the three-layered backpropagation neural network (BPNN). BPNN classifies the vehicles into five groups, and the recognition rate is 94.21%. This recognition rate has performed best, compared with the methods presented in published works. [ABSTRACT FROM AUTHOR]

In this paper, a learning algorithm considering derivative information is proposed for neural networks. Based on backpropagation (BP) algorithm, this algorithm takes the derivative information of the samples into account. Because the partial derivative of the output variable of neural networks to the input variable can be obtained from the weights of the networks, the error between the calculated value and the theoretical value of the partial derivative can be reduced by adjusting the weights of the networks. This algorithm can effectively avoid the over-fitting and improve the generalization capability for the networks. The neural networks considering derivative information has been shown by experimental results to have better generalization performance than BP networks. [ABSTRACT FROM AUTHOR]

It is well known that microarray printing, hybridization, and washing oftentimes create erroneous measurements, and these errors detrimentally impact machine microarray spot quality classification. Thus, it is crucial to identify and remove these errors if automation is to replace the still common practice of visually assessing spot quality, an extremely expensive and time-consuming procedure. A major problem in microarray spot quality classification methods proposed in the literature is the correlation among the features extracted from the spots. In this paper, we propose using a random subspace ensemble of neural networks and a feature selection algorithm to improve the performance of our microarray spot quality classification method. Our best method obtains an error under the receiver operating characteristic curve (EAUR) of 0.3 outperforming the stand-alone support vector machine EAUR of 1.7. The consistency of our proposed approach makes it a viable alternative to the labour-intensive manual method of spot quality assessment. [ABSTRACT FROM AUTHOR]

This paper presents an enhanced design methodology for optimal mixture proportion of concrete composition with respect to accuracy in the case of using prediction models based on a limited database. In proposed methodology, the search space is constrained as the domain defined by a limited database instead of constructing the database covering the region represented by the possible ranges of all variables in the input space. A model for defining the search space which is expressed by the effective region in this paper and evaluating whether a mix proportion is effective is added to the optimization process, yielding highly reliable results. To demonstrate the proposed methodology, a genetic algorithm, an artificial neural network, and a convex hull were adopted as an optimum technique, a prediction model for material properties, and an evaluation model for the effective region, respectively. And then, it was applied to an optimization problem wherein the minimum cost should be obtained under a given strength requirement. Experimental test results show that the mix proportion obtained from the proposed methodology considering the regional characteristics of the database is found to be more accurate and feasible than that obtained from a general optimum technique that does not consider this aspect. [ABSTRACT FROM AUTHOR]

Copyright of Petroleum - Gas University of Ploiesti Bulletin, Technical Series is the property of Petroleum - Gas University of Ploiesti and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Virtual network embedding arranges virtual network services onto substrate network components. The performance of embedding algorithms determines the effectiveness and efficiency of a virtualized network, making it a critical part of the network virtualization technology. To achieve better performance, the algorithm needs to automatically detect the network status which is complicated and changes in a time-varying manner, and to dynamically provide solutions that can best fit the current network status. However, most existing algorithms fail to provide automatic embedding solutions in an acceptable running time. In this paper, we combine deep reinforcement learning with a novel neural network structure based on graph convolutional networks, and propose a new and efficient algorithm for automatic virtual network embedding. In addition, a parallel reinforcement learning framework is used in training along with a newly-designed multi-objective reward function, which has proven beneficial to the proposed algorithm for automatic embedding of virtual networks. Extensive simulation results under different scenarios show that our algorithm achieves best performance on most metrics compared with the existing state-of-the-art solutions, with upto 39.6% and 70.6% improvement on acceptance ratio and average revenue, respectively. Moreover, the results also demonstrate that the proposed solution possesses good robustness. [ABSTRACT FROM AUTHOR]

Neural network algorithms are gradually applied to the field of chemical informatics. In this paper, the neural network models are used to predict the properties of compounds based on Molecular Information. We predict the aqueous solubility of compounds, and evaluate the prediction results of the Neural Networks including CNN, RNN, DNN, SNN. The performance of the models in predicting the solubility is able to meet or exceed the predicted effect of the method based on the molecular structure (ESOL). DNN model performance is of more accuracy, and RNN performance is of better stability. This method can directly avoid complex molecular structure characterisation, and provide a convenient and flexible way to predict properties of compounds. [ABSTRACT FROM AUTHOR]