Modeling a just-in-time plant using sequencing algorithms

An Australian automotive component company plans to assemble and deliver seats to customer on just-in-time basis. The company management has decided to model operations of the seat plant to help them make decisions on capital investment and labour requirements. There are four different areas in seat assembly and delivery areas. Each area is modeled independently to optimise its operations. All four areas are then combined into one model called the plant model to model operations of seat plant from assembly to delivery. Discrete event simulation software is used to model the assembly operations of seat plant.

A generalized data windowing scheme for adaptive conjugate gradient algorithms

The performance of the modified adaptive conjugate gradient (CG) algorithms based on the iterative CG method for adaptive filtering is highly related to the ways of estimating the correlation matrix and the cross-correlation vector. The existing approaches of implementing the CG algorithms using the data windows of exponential form or sliding form result in either loss of convergence or increase in misadjustment. This paper presents and analyzes a new approach to the implementation of the CG algorithms for adaptive filtering by using a generalized data windowing scheme. For the new modified CG algorithms, we show that the convergence speed is accelerated, the misadjustment and tracking capability comparable to those of the recursive least squares (RLS) algorithm are achieved. Computer simulations demonstrated in the framework of linear system modeling problem show the improvements of the new modifications.

Machine learning approaches for modeling spammer behavior

Spam is commonly known as unsolicited or unwanted email messages in the Internet causing potential threat to Internet Security. Users spend a valuable amount of time deleting spam emails. More importantly, ever increasing spam emails occupy server storage space and consume network bandwidth. Keyword-based spam email filtering strategies will eventually be less successful to model spammer behavior as the spammer constantly changes their tricks to circumvent these filters. The evasive tactics that the spammer uses are patterns and these patterns can be modeled to combat spam. This paper investigates the possibilities of modeling spammer behavioral patterns by well-known classification algorithms such as Naïve Bayesian classifier (Naive Bayes), Decision Tree Induction (DTI) and Support Vector Machines (SVMs). Preliminary experimental results demonstrate a promising detection rate of around 92%, which is considerably an enhancement of performance compared to similar spammer behavior modeling research.

Large-scale statistical modeling of motion patterns : a Bayesian nonparametric approach

We propose a novel framework for large-scale scene understanding in static camera surveillance. Our techniques combine fast rank-1 constrained robust PCA to compute the foreground, with non-parametric Bayesian models for inference. Clusters are extracted in foreground patterns using a joint multinomial+Gaussian Dirichlet process model (DPM). Since the multinomial distribution is normalized, the Gaussian mixture distinguishes between similar spatial patterns but different activity levels (eg. car vs bike). We propose a modification of the decayed MCMC technique for incremental inference, providing the ability to discover theoretically unlimited patterns in unbounded video streams. A promising by-product of our framework is online, abnormal activity detection. A benchmark video and two surveillance videos, with the longest being 140 hours long are used in our experiments. The patterns discovered are as informative as existing scene understanding algorithms. However, unlike existing work, we achieve near real-time execution and encouraging performance in abnormal activity detection.

Improved particle swarm optimization-based artificial neural network for rainfall-runoff modeling

This paper presents the application of an improved particle swarm optimization (PSO) technique for training an artificial neural network (ANN) to predict water levels for the Heshui watershed, China. Daily values of rainfall and water levels from 1988 to 2000 were first analyzed using ANNs trained with the conjugate-gradient, gradient descent and Levenberg-Marquardt neural network (LM-NN) algorithms. The best results were obtained from LM-NN and these results were then compared with those from PSO-based ANNs, including conventional PSO neural network (CPSONN) and improved PSO neural network (IPSONN) with passive congregation. The IPSONN algorithm improves PSO convergence by using the selfish herd concept in swarm behavior. Our results show that the PSO-based ANNs performed better than LM-NN. For models run using a single parameter (rainfall) as input, the root mean square error (RMSE) of the testing dataset for IPSONN was the lowest (0.152 m) compared to those for CPSONN (0.161 m) and LM-NN (0.205 m). For multi-parameter (rainfall and water level) inputs, the RMSE of the testing dataset for IPSONN was also the lowest (0.089 m) compared to those for CPSONN (0.105 m) and LM-NN (0.145 m). The results also indicate that the LM-NN model performed poorly in predicting the low and peak water levels, in comparison to the PSO-based ANNs. Moreover, the IPSONN model was superior to CPSONN in predicting extreme water levels. Lastly, IPSONN had a quicker convergence rate compared to CPSONN.

New variable step-sizes minimizing mean-square deviation for the lms-type algorithms

The least-mean-square-type (LMS-type) algorithms are known as simple and effective adaptation algorithms. However, the LMS-type algorithms have a trade-off between the convergence rate and steady-state performance. In this paper, we investigate a new variable step-size approach to achieve fast convergence rate and low steady-state misadjustment. By approximating the optimal step-size that minimizes the mean-square deviation, we derive variable step-sizes for both the time-domain normalized LMS (NLMS) algorithm and the transform-domain LMS (TDLMS) algorithm. The proposed variable step-sizes are simple quotient forms of the filtered versions of the quadratic error and very effective for the NLMS and TDLMS algorithms. The computer simulations are demonstrated in the framework of adaptive system modeling. Superior performance is obtained compared to the existing popular variable step-size approaches of the NLMS and TDLMS algorithms. © 2014 Springer Science+Business Media New York.

Effectiveness of evolutionary algorithms for optimization of heat exchangers

This paper comprehensively investigates performance of evolutionary algorithms for design optimization of shell and tube heat exchangers (STHX). Genetic algorithm (GA), firefly algorithm (FA), and cuckoo search (CS) method are implemented for finding the optimal values for seven key design variables of the STHX model. ε-NTU method and Bell-Delaware procedure are used for thermal modeling of STHX and calculation of shell side heat transfer coefficient and pressure drop. The purpose of STHX optimization is to maximize its thermal efficiency. Obtained results for several simulation optimizations indicate that GA is unable to find permissible and optimal solutions in the majority of cases. In contrast, design variables found by FA and CS always lead to maximum STHX efficiency. Also computational requirements of CS method are significantly less than FA method. As per optimization results, maximum efficiency (83.8%) can be achieved using several design configurations. However, these designs are bearing different dollar costs. Also it is found that the behavior of the majority of decision variables remains consistent in different runs of the FA and CS optimization processes.

A general collaborative framework for modeling and perceiving distributed network behavior

Collaborative Anomaly Detection (CAD) is an emerging field of network security in both academia and industry. It has attracted a lot of attention, due to the limitations of traditional fortress-style defense modes. Even though a number of pioneer studies have been conducted in this area, few of them concern about the universality issue. This work focuses on two aspects of it. First, a unified collaborative detection framework is developed based on network virtualization technology. Its purpose is to provide a generic approach that can be applied to designing specific schemes for various application scenarios and objectives. Second, a general behavior perception model is proposed for the unified framework based on hidden Markov random field. Spatial Markovianity is introduced to model the spatial context of distributed network behavior and stochastic interaction among interconnected nodes. Algorithms are derived for parameter estimation, forward prediction, backward smooth, and the normality evaluation of both global network situation and local behavior. Numerical experiments using extensive simulations and several real datasets are presented to validate the proposed solution. Performance-related issues and comparison with related works are discussed.

Rainfall-runoff modeling using dynamic evolving neural fuzzy inference system with online learning

This is an open access article under the CC BY-NC-ND license.Neuro-Fuzzy Systems (NFS) are computational intelligence tools that have recently been employed in hydrological modeling. In many of the common NFS the learning algorithms used are based on batch learning where all the parameters of the fuzzy system are optimized off-line. Although these models have frequently been used, there is a criticism on such learning process as the number of rules are needed to be predefined by the user. This will reduce the flexibility of the NFS architecture while dealing with different data with different level of complexity. On the other hand, online or local learning evolves through local adjustments in the model as new data is introduced in sequence. In this study, dynamic evolving neural fuzzy inference system (DENFIS) is used in which an evolving, online clustering algorithm called the Evolving Clustering Method (ECM) is implemented. ECM is an online, maximum distance-based clustering method which is able to estimate the number of clusters in a data set and find their current centers in the input space through its fast, one-pass algorithm. The 10-minutes rainfall-runoff time series from a small (23.22 km2) tropical catchment named Sungai Kayu Ara in Selangor, Malaysia, was used in this study. Out of the 40 major events, 12 were used for training and 28 for testing. Results obtained by DENFIS were then compared with the ones obtained by physically-based rainfall-runoff model HEC-HMS and a regression model ARX. It was concluded that DENFIS results were comparable to HEC-HMS and superior to ARX model. This indicates a strong potential for DENFIS to be used in rainfall-runoff modeling.