Nonflat surface level pyramid: a high connectivity multidimensional interconnection network

Parallel machines are extensively used to increase computational speed in solving different scientific problems. Various topologies with different properties have been proposed so far and each one is suitable for specific applications. Pyramid interconnection networks have potentially powerful architecture for many applications such as image processing, visualization, and data mining. The major advantage of pyramids which is important for image processing systems is hierarchical abstracting and transferring the data toward the apex node, just like the human being vision system, which reach to an object from an image. There are rapidly growing applications in which the multidimensional datasets should be processed simultaneously. For such a system, we need a symmetric and expandable interconnection network to process data from different directions and forward them toward the apex. In this paper, a new type of pyramid interconnection network called Non-Flat Surface Level (NFSL) pyramid is proposed. NFSL pyramid interconnection networks constructed by L-level A-lateral-base pyramids that are named basic-pyramids. So, the apex node is surrounded by the level-one surfaces of NFSL that are the first nearest level of nodes to apex in the basic pyramids. Two topologies which are called NFSL-T and NFSL-Q originated from Trilateral-base and Quadrilateral-base basic-pyramids are studied to exemplify the proposed structure. To evaluate the proposed architecture, the most important properties of the networks are determined and compared with those of the standard pyramid networks and its variants.     

Classification of non-alcoholic beer based on aftertaste sensory evaluation by chemometric tools

Sensory evaluation is the application of knowledge and skills derived from several different scientific and technical disciplines, physiology, chemistry, mathematics and statistics, human behavior, and knowledge about product preparation practices. This research was aimed to evaluate aftertaste sensory attributes of commercial non-alcoholic beer brands (P1, P2, P3, P4, P5, P6, P7) by several chemometric tools. These attributes were bitter, sour, sweet, fruity, liquorice, artificial, body, intensity and duration. The results showed that the data are in a good consistency. Therefore, the brands were statistically classified in several categories. Linear techniques as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) were performed over the data that revealed all types of beer are well separated except a partial overlapping between zones corresponding to P4, P6 and P7. In this research, for the confirmation of the groups observed in PCA and in order to calculate the errors in calibration and in validation, PLS-DA technique was used. Based on the quantitative data of PLS-DA, the classification accuracy values were ranked within 49-86%. Moreover, it was found that the classification accuracy of LDA was much better than PCA. It shows that this trained sensory panel can discriminate among the samples except an overlapping between two types of beer. Also, two types of artificial networks were used: Probabilistic Neural Networks (PNN) with Radial Basis Functions (RBF) and FeedForward Networks with Back Propagation (BP) learning method. The highest classification success rate (correct predicted number over total number of measurements) of about 97% was obtained for RBF followed by 94% for BP. The results obtained in this study could be used as a reference for electronic nose and electronic tongue in beer quality control.     

A general insight into the effect of neuron structure on classification

This paper gives a general insight into how the neuron structure in a multilayer perceptron (MLP) can affect the ability of neurons to deal with classification. Most of the common neuron structures are based on monotonic activation functions and linear input mappings. In comparison, the proposed neuron structure utilizes a nonmonotonic activation function and/or a nonlinear input mapping to increase the power of a neuron. An MLP of these high power neurons usually requires a less number of hidden nodes than conventional MLP for solving classification problems. The fewer number of neurons is equivalent to the smaller number of network weights that must be optimally determined by a learning algorithm. The performance of learning algorithm is usually improved by reducing the number of weights, i.e., the dimension of the search space. This usually helps the learning algorithm to escape local optimums, and also, the convergence speed of the algorithm is increased regardless of which algorithm is used for learning. Several 2-dimensional examples are provided manually to visualize how the number of neurons can be reduced by choosing an appropriate neuron structure. Moreover, to show the efficiency of the proposed scheme in solving real-world classification problems, the Iris data classification problem is solved using an MLP whose neurons are equipped by nonmonotonic activation functions, and the result is compared with two well-known monotonic activation functions.     

Hyper-chaotic Feeded GA (HFGA): a reversible optimization technique for robust and sensitive image encryption

In recent years, due to their straightforward structure and efficiency, the chaos-based cryptographic algorithms have become a good candidate for image encryption. However, they still suffer from many weaknesses, such as insensitivity to the plain image, weak key streams, small key space, non-resistance to some attacks and failure to meet some security criteria. For this purpose in this paper, a novel hybrid image encryption algorithm named Hyper-chaotic Feeded GA (HFGA) is proposed to fill the gaps in two stages; initial encryption by using a hyper-chaotic system, and then outputs reinforcement by employing a customized Genetic Algorithm (GA). By applying an innovative technique, called gene-labelling, the proposed algorithm not only optimizes the preliminary encrypted images in terms of security criteria but also allows the legal receiver to easily and securely decrypt the optimized cipher image. In fact, in the first stage, besides unpredictable random sequences generated by a hyper-chaotic system, a new sensitive diffusion function is proposed which makes the algorithm resistant to differential attacks. In the second stage, the generated cipher images, which are labeled in a special way, will be used as the initial population of a GA which enhances randomness of the cipher images. The results of several experiments and statistical analysis show that the proposed image encryption scheme provides an efficient and secure way for fast image encrypting as well as providing robustness against some well-known statistical attacks.     

On Density-Based Data Streams Clustering Algorithms: A Survey简

Clustering data streams has drawn lots of attention in the last few years due to their ever-growing presence. Data streams put additional challenges on clustering such as limited time and memory and one pass clustering. Furthermore, discovering clusters with arbitrary shapes is very important in data stream applications. Data streams are infinite and evolving over time, and we do not have any knowledge about the number of clusters. In a data stream environment due to various factors, some noise appears occasionally. Density-based method is a remarkable class in clustering data streams, which has the ability to discover arbitrary shape clusters and to detect noise. Furthermore, it does not need the nmnber of clusters in advance. Due to data stream characteristics, the traditional density-based clustering is not applicable. Recently, a lot of density-based clustering algorithms are extended for data streams. The main idea in these algorithms is using density- based methods in the clustering process and at the same time overcoming the constraints, which are put out by data streanFs nature. The purpose of this paper is to shed light on some algorithms in the literature on density-based clustering over data streams. We not only summarize the main density-based clustering algorithms on data streams, discuss their uniqueness and limitations, but also explain how they address the challenges in clustering data streams. Moreover, we investigate the evaluation metrics used in validating cluster quality and measuring algorithms＇ performance. It is hoped that this survey will serve as a steppingstone for researchers studying data streams clustering, particularly density-based algorithms.     

Natural killer or T-lymphocyte cells: Which is the best immune therapeutic agent for cancer? An optimal control approach

Therapeutic vaccines are being developed as a promising new approach to treatment for cancer patients. There are still many unanswered questions about which kind of therapeutic vaccines are the best for the cancer treatments? In this paper we consider a mathematical model, in the form of a system of ordinary differential equations (ODE), this system is an example from a class of mathematical models for immunotherapy of the tumor that were derived from a biologically validated model by Lisette G. de Pillis. The problem how to schedule a variable amount of which vaccines to achieve a maximum reduction in the primary cancer volume is consider as an optimal control problem and it is shown that optimal control is quadratic with 0 denoting a trajectory corresponding to no treatment and 1 a trajectory with treatment at maximum dose along that all therapeutics are being exhausted. The ODE system dynamics characterized by locating equilibrium points and stability properties are determined by using appropriate Lyapunov functions. Especially we attend a parametric sensitivity analysis, which indicates the dependency of the optimal solution with respect to disturbances in model parameters.     

Textual image compression at low bit rates based on region-of-interest coding

In this paper, we deal with those applications of textual image compression where high compression ratio and maintaining or improving the visual quality and readability of the compressed images are of main concern. In textual images, most of the information exists in the edge regions; therefore, the compression problem can be studied in the framework of region-of-interest (ROI) coding. In this paper, the Set Partitioning in Hierarchical Trees (SPIHT) coder is used in the framework of ROI coding along with some image enhancement techniques in order to remove the leakage effect which occurs in the wavelet-based low-bit-rate compression. We evaluated the compression performance of the proposed method with respect to some qualitative and quantitative measures. The qualitative measures include the averaged mean opinion scores (MOS) curve along with demonstrating some outputs in different conditions. The quantitative measures include two proposed modified PSNR measures and the conventional one. Comparing the results of the proposed method with those of three conventional approaches, DjVu, JPEG2000, and SPIHT coding, showed that the proposed compression method considerably outperformed the others especially from the qualitative aspect. The proposed method improved the MOS by 20 and 30 %, in average, for high- and low-contrast textual images, respectively. In terms of the modified and conventional PSNR measures, the proposed method outperformed DjVu and JPEG2000 up to 0.4 dB for high-contrast textual images at low bit rates. In addition, compressing the high contrast images using the proposed ROI technique, compared to without using this technique, improved the average textual PSNR measure up to 0.5 dB, at low bit rates.