# Forthcoming articles

International Journal of Computing Science and Mathematics

These articles have been peer-reviewed and accepted for publication in IJCSM, but are pending final changes, are not yet published and may not appear here in their final order of publication until they are assigned to issues. Therefore, the content conforms to our standards but the presentation (e.g. typesetting and proof-reading) is not necessarily up to the Inderscience standard. Additionally, titles, authors, abstracts and keywords may change before publication. Articles will not be published until the final proofs are validated by their authors.

Forthcoming articles must be purchased for the purposes of research, teaching and private study only. These articles can be cited using the expression "in press". For example: Smith, J. (in press). Article Title. Journal Title.

Articles marked with this shopping trolley icon are available for purchase - click on the icon to send an email request to purchase.

Articles marked with this Open Access icon are freely available and openly accessible to all without any restriction except the ones stated in their respective CC licenses.

Register for our alerting service, which notifies you by email when new issues of IJCSM are published online.

We also offer RSS feeds which provide timely updates of tables of contents, newly published articles and calls for papers.

 International Journal of Computing Science and Mathematics (85 papers in press)  Regular Issues  Research on Crawling mechanism and policy for crawling product information from Mobile Internet   by Chonghuan Xu, Shu Wang, Jia Chen Abstract: Product information on the Mobile Internet grows fast in volume and becomes hard in acquisition. Companies tend to deliver product information on their well-tuned Mobile websites or websites that is responsive to various mobile devices. Thus, this kind of site is more of an web app than a traditional website, which we call a RIA(Rich Internet Application). With RIAs, information are kept secret from search engine spiders by means of HTML5, Ajax and other scripting techniques in deep web, user interactions are needed to trigger some prescribed events in some certain order to show the whole picture of the information we need. In this paper, we identified the crux of the problem is how to provide the mechanism to parse the scripts and manipulate DOM(Document Object Model) and the policy to trigger user events and run the scrape process. A new mechanism and policy was formulated based on web crawler techniques and studies in Ajax-specified web crawlers. By remodeling web pages redesigning the architecture of web crawler and refining scrape algorithm, we successfully scrape product data from Mobile Internet RIAs. Keywords: Crawler; Scrape data; Mobile Internet; RIA; Product information. Modular and homomorphic product of intuitionistic fuzzy graphs and their degree   by Sankar Sahoo, Madhumangal Pal Abstract: An intuitionistic fuzzy graph is an extension of a fuzzy graph that give more precision, flexibility and compatibility to a system when compared with the system that designed using fuzzy graphs. In this paper, we define two new operations on intuitionistic fuzzy graphs, namely modular product and homomorphic product and study about the degree of the vertex of the resultant graph, which are obtained from two intuitionistic fuzzy graphs $G^prime$ and $G^{primeprime}$ using the operations modular product and homomorphic product. These operations will be used in computer science, geometry, algebra, operations research, etc. Keywords: Intuitionistic fuzzy graphs; modular product; homomorphic product. An encoding and reconstructing method with robust transmission for 3D model topological data over wireless network   by Huiqin Wang, Bailin Yang Abstract: This paper proposes an encoding and reconstructing method with robust transmission for 3D model topological data. For the encoding of topological data, we firstly adopt the valence-driven method to visit the full mesh and give each vertex a sequence number, degree information and the neighboring vertex information. Then, we adopt the improved graph coloring algorithm to color each vertex according to the sequence number of vertex. Thirdly, we divide the 3D model into several packets according to vertexs color. Finally, we use the Huffman coding to compress model. For the reconstructing of topological data, when the client receives packets, we design an effective reconstructing method by combining degree information, the neighboring vertex information with special traversal rule to reconstruct the model. Experimental results show that even in the high packet loss rate, the model can also obtain a good reconstruction result. Keywords: Topological data encoding; Model reconstructing; Graph coloring; Wireless network; Model Transmission. Analysis of a Two-Unit Automatic Power Factor Controller System with Priority to Inspection over Repair/Replacement   by Roosel Jain, Gulshan Taneja, P.K. Bhatia Abstract: For the present paper, a reliability model of Automatic Power Factor Controller (APFC) working in industrial companies has been developed using regenerative point technique. The system for the study consists of two cold standby identical units. Initially, the system is operative with controlled power factor. The inspection is carried out to detect the type of failure which can be due to fuse blown off, transformer burnt, programming problem, output relay faulty. But different type of failure requires different time to repair/replacement. Priority is given to repair/replacement based on estimated values of repair/replacement rates for different type of failure. Hence it is required to detect the type of failure as soon as possible which can be done by inspection only. In view of this inspection is given priority over repair/ replacement also. The various reliability indices of system effectiveness are obtained and graphs have been plotted for economic analysis of the system. Keywords: Automatic Power Factor Controller (APFC); controlled/uncontrolled power factor; reliability indices of system effectiveness; regenerative point technique. A Hybrid Particle Swarm Optimization for Multi-Objective Flexible Job-Shop Scheduling Problem with Dual-Resources Constrained   by Jing Zhang, Jing Jie, Wanliang Wang, Xinli Xu Abstract: This paper presents a hybrid discrete particle swarm algorithm for a multiple-objective flexible job-shop scheduling problem based on Maximum Fitness function. The problem has dual-resources constraints and considers both production time and production cost to be optimization objectives. An improved position updating method is proposed in global search mechanism to avoid the occurrence of infeasible solution. A dynamic random search strategy is designed as the local search mechanism to enhance the local exploiting search ability. A modified reservation strategy is used to maintain the external archives. Finally, simulation results demonstrate the feasibility and effectiveness of the proposed algorithm and that more uniform non-dominated solutions can be obtained. Keywords: discrete particle swarm optimization; dual-resource constrained; multi-objective optimization; flexible job shop scheduling problem. An Improved Cuckoo Search Algorithm for Integer Programming Problems   by Yongquan Zhou, Mohamed Metwalli Abstract: This paper presents a novel cuckoo search algorithm called elite opposition- cuckoo search algorithm (ECS) for solving integer programming problems. The opposite solution of the elite individual in the population is generated by an opposition-based strategy in the proposed algorithm and form an opposite search space by constructing the opposite population that locates inside the dynamic search boundaries, then, the search space of the algorithm is guided to approximate the space in which the global optimum is included by simultaneously evaluating the current population and the opposite one. The results show that ECS algorithm has faster convergence speed, higher computational precision, and is more effective for solving integer programming problems. Keywords: Elite Opposition; Cuckoo search; Integer programming problems. Analysis of flow field of hydrodynamic suspension polishing disk based on multi-fractal method   by Xiaohang Shan, Beqing Ye, Li Zhang Abstract: Amorphous film is an important amorphous material, which has a widely application prospect in the aspects of electronics, mechanics, chemical industry, national defence and so on. The quality of amorphous film substrate has a significant impact in the amorphous film performance. Hydrodynamic suspension polishing is a super-smooth and non-damage polishing method, which is suitable for the processing of amorphous film substrate. The characteristic of disks flow field is the key factor for influencing the quality of polishing. The movement and distribution of abrasives in flow field is analysed in this paper by high speed photography technology. The distribution of bubbles and abrasives is extracted by Matlab in the dynamic flow field of hydrodynamic suspension polishing based on fractal and multi-fractal theory. The multi-fractal spectra is calculated and the association of multi-fractal spectra is analysed. The results show that when buoyancy meets the requirement, the lower the polishing disk rotational speed, the more uniform abrasive distribution. Polishing effect will be better with well continuity of polishing slurry. Keywords: multi-fractal; flow field; multi-fractal spectra; suspension polishing. Separated vehicle scheduling optimization for container trucking transportation based on a hybrid quantum evolutionary algorithm   by Zheng Wang, Jianfeng Dai Abstract: To optimize the truckrouting problem with time windows,a multi-objective mathematical programming model was established for separated vehicle scheduling.To compute Pareto solutions,a phased optimal algorithm based on hybrid quantumevolution was put forward. To enhance the convergence rate, a greedy repair operator was designed. To avoid premature convergence, a neighborhood search based on node switching was performed. To maintain the dispersion of the Paretosolutions, an adaptive grid operator was designed. The effectiveness of the proposed method compared to previous scheduling modes and other algorithms was verified experimentally.For the same transport capacity, the vehicle scheduling method based on a quantum evolutionary algorithm can greatly reduce both the number of vehicles and cost. Keywords: Tractor and trailerseparated; Pareto optimal solutions; truck and trailer routing problem (TTRP); hybrid quantum evolutionary algorithm. Computation of inverse 1-center location problem on the weighted interval graphs   by Biswanath Jana Abstract: Let TIG be the tree corresponding to the weighted interval graph G = (V,E). The eccentricity e(v) of the vertex v is defined as the sum of the weights of the vertices from v to the vertex farthest from v in TIG. A vertex with minimum eccentricity in the tree TIG is called the 1-center of that tree. In an inversern1-center location problem the parameter of an interval tree TIG corresponding to the weighted interval graph G = (V;E), like vertex weights have to be modified at minimum total cost such that a pre-specified vertex s in V becomes the 1-center of the interval graph G. In this paper, we present an optimal algorithm to find an inverse 1-center location on the weighted tree TIG corresponding to the weighted interval graph G = (V,E), where the vertex weights can be changed within certain bounds. The time complexity of our proposed algorithm is O(n), where n is the number of vertices of the interval graph G. Keywords: Tree-networks; center location; 1-center location; inverse 1-center location; inverse optimization; tree; interval graphs. On contraction method to cleansing duplicates in graph   by Li Huang Abstract: With the quick development of the linked data, graph data explosion has become a challenging problem. Duplicates also exit in graph data. Duplicates detection is a hotspot in the study of heterogeneous data integration and information retrieval. However, attentions are seldom paid to duplicates cleansing after detecting. Due to the complexity and strong relevance, duplicates in graph could not remove one immediately. It is more important need some special methods for duplicates cleansing. In this paper, we study the problem and give a solution, named on contraction method to cleansing graph duplicates. The proposed method introduces graph contraction to duplicates cleansing. According to the situations, we give different solutions. Experiments on publication datasets show that the proposed method is efficient ensure the relationship and stability in the graph. Keywords: graph data integration; duplicates cleansing; graph contraction. CRITICAL INJECTIVE CHROMATIC GRAPHS   by Anjaly Kishore, Sunitha M.S Abstract: The concept of critical injective chromatic graph is introduced. Some properties of critical injective chromatic graph are studied. An application injective chromatic number and injective chromatic sum in the diagnosis diseases based on symptoms is suggested. Keywords: injective chromatic number; chromatic sum; critical injective chromatic graph. An Inclusive Framework for Developing a Car Racing Simulator Game Using Artificial Intelligence Techniques and Usability Principles   by Laiali Almazaydeh Abstract: Computer games have become one of the most significant digital applications due to the rapid improvement of software industry. Developers create computer games based on a combination of interleaving elements that contain technical and artistic aspects. Therefore, games development needs a comprehensive ideal path including different design considerations and usability issues than other typical software. In this research, we illustrate the general framework that helps developers to develop effective interactive games with an example of our developed contemporary computer game called Race for Freedom which was inspired by the Death Race films story. The most significance game development challenges addressed in this research is adapting artificial intelligence techniques in the implementation phase and validating the usability of developed game in the evaluation phase. Keywords: AI; electronic games; heuristics; HCI; racing games; shooting games; usability. Algorithm Composition of Chinese Folk Music Based on Swarm Intelligence   by Xiaomei Zheng, Lei Wang, Dongyang Li, Lin Shen, Yanyuan Gao, Weian Guo, Yushan Wang Abstract: Particle Swarm Optimization (PSO), which is a kind of typical swarm intelligent algorithm, simulates the process of birds searching for food to solve optimization problems. In this paper, a Chinese folk composition model based on PSO algorithm is put forward. The concept of multi-melody space is constructed for the traditional pentatonic music creation. The Multi-melody space PSO algorithm called MSPA searches the solution in melody space. Experimental results show that the model is feasible and effective in the process of Chinese folk music composition. Keywords: Chinese folk music; Pentatonic mode; Paritcle swarm optimization (PSO); Multi-melody space. Zeghdoudi Distribution and Its Applications   by Halim Zeghdoudi, Hamouda Messaadia Abstract: This paper proposes a new distribution, called as Zeghdoudi distribution (ZD). Various statistical properties of moment method and maximum likelihood estimation is established. An application of the model to a real data set is presented finally and compared with the fit attained by some other well-known one and two parameters distributions. Keywords: Lindley distribution; Gamma distribution; maximum-likelihood estimation. Optimal path for mobile aggregator in intelligence agriculture   by WANG JIE Abstract: "Intelligent agriculture" is intelligent agriculture expert system, is the specific application of "perception of China" concept in agriculture development area. Wireless sensor network, as the most important part of the Internet of things, has the ability of perception. So it can collect a lot of useful information in intelligent agriculture. With the development of mobile device and unmanned aerial vehicle technology, modern agricultural producer, has been able to use mobile aggregator to collect real-time data in greenhouses. Around each of the greenhouses, all kinds of sensors will be installed which will take part of the sensing work). Therefore, the sensor nodes around all the greenhouse compose a wireless sensor network. And the mobile aggregator is responsible for the data aggregation of this wireless sensor network for Intelligent agriculture. In order to reduce the energy consumption of mobile aggregator, we usually can reduce the distance that in each sensing period, the mobile aggregator need to cover all agricultural greenhouses. By designing an optimal path through all the greenhouses, the energy consumption of the mobile aggregator can be greatly reduced. In this paper, we use genetic algorithm to solve the optimal path problem for mobile aggregator in Intelligent agriculture. We conduct two experiment, both of them get the optimal path. In both of the two experiment, the best distance will decrease when the generation number or the group size increases. In the second experiment, we set the generation number as a fixed value, and calculate the best distance and the worst distance when the group size changes. We can see the result of the second experiment that the best distance decreases when the group size increases while the worst does not decrease. We also get some guideline when use genetic algorithm to solve the optimal path problem in practical application. Keywords: optimal path; intelligence agriculture; genetic algorithm. Analysis of Motion Characteristics of Three Degrees of Freedom Decoupling Hydraulic Self-servo Joint   by Lin Jiang, Zhi-chao Zhu, Ruo-lin Wu Abstract: Multi degree freedom robot joint has the common problems, such as its motion is coupled and not stable enough, the output torque is small. Aiming at these problems, a new hydraulic swing cylinder with radial oil distribution and single vane rotating angle self-servo valve is proposed. And based on this new hydraulic swing cylinder, three degrees freedom decoupling hydraulic self-servo joint with motion decoupling and larger workspace is designed in this paper. The motion decoupling of three degrees of freedom decoupling hydraulic self-servo joint is analyzed and verified by using ADAMS software. The simulation results show that three degree freedom hydraulic joint has the characteristics of smooth motion, large output torque, the motion decoupling. Keywords: Rotating angle self-servo; Radial oil distribution; Hydraulic self-servo joint; Motion decoupling; workspace. Dynamic Differential Evolution with Oppositional Orthogonal Crossover for Large Scale Optimization Problems   by Xiaogang Dong, Changshou Deng, Yucheng Tan Abstract: Differential Evolution is a population-based optimization algorithm andrnhas been successfully applied in many fields. However, when tackling large scale optimization problem, it still encounters serious challenges. To meet these challenges, a dynamic differential evolution with oppositional orthogonal crossover is proposed in this paper. A new opposition learning is proposed and then is used in the orthogonal crossover to improve the exploitation ability of the dynamic differential evolution. During the evolution process in dynamic differential evolution, only one individual is randomly chosen to undergo this oppositional orthogonal crossover operation. Thirteen benchmark problems with 1000 dimensions were used to evaluate its performance. The results show that the proposed method is very competitive in terms of solution quality obtained. Keywords: Large scale optimization problem;Dynamic Differential Evolution;Oppositional Orthogonal Crossover; New Oppositional Learning. Matrix inequalities in the Lowner ordering by means of Schur complement and block matrices   by Cheng Zeng Abstract: It has been evident that a Schur complement plays an important role in many aspects of matrix theory, in statistics, as well as in applied mathemathics. The purpose of this article is to present a family of matrix inequalities involving the Kronecker product, Hadamard product and ordinary sum. Our theorems contain or extend some existing known results. Keywords: Schur complement; Block matrix; Hadamard product; Kronecker product; Lowner ordering; Matrix inequality; Moore-penrose inverse; Khatri-Rao product. Discontinuous Legendre Wavelet Galerkin method for the generalized Burgers-Fisher equation   by Xiaoyang Zheng, Yong Fu, Zhengyuan Wei Abstract: This paper presents discontinuous Legendre wavelet Galerkin (DLWG) technique for solving the generalized Burgers-Fisher equation. Weak formulation of this equation and numerical fluxes are addressed by utilizing the advantages of the both Legendre wavelet and discontinuous Galerkin (DG) approach. Finally, numerical experiments demonstrate the validity and utility of the DLWG method. Keywords: Generalization Burger-Fisher equation; Legendre wavelet; Discontinuous Galerkin method; Wavelet Galerkin method; Discontinuous Legendre Wavelet Galerkin method. ELLIPTIC CURVE BASED AUTHENTICATED ENCRYPTION SCHEME AND ITS APPLICATION FOR ELECTRONIC PAYMENT SYSTEM   by Rajeev Kumar, S.K. Pal, Arvind Yadav Abstract: The use of e-payment system for E-commerce is making our day to day life more easy and convenient. In existing e-payment schemes, there are a number of security and efficiency issues to be addressed. To address such issues Yang et al. proposed an authenticated encryption scheme and an e-payment system based on this encryption scheme. Their scheme excluded the need of digital signature for authentication. They claimed that the computation costs can be greatly reduced. But recently Chaudhry et al. exposed the weaknesses of Yang et al.'s scheme. To overcome the weaknesses of Yang et al.' scheme, they proposed improved authenticated encryption and e-payment schemes. However, our analysis shows that there are few security issues in their scheme. Direct use of private key in product with standard key size gives an opportunity to adversary. Based on these observations we propose an improved scheme for authenticated encryption. We also propose e-payment system using our encryption scheme. We give the security proof and performance analysis of our scheme. Keywords: Authenticated encryption; elliptic curve; electronic payment system; elliptic curve cryptography. An improved artificial bee colony algorithm for solving parameter identification problems   by Xuemei You, Yinghong Ma, Zhiyuan Liu Abstract: Swarm intelligence algorithms (SIA) have shown excellent optimization performance on many real world problems. Artificial bee colony (ABC) is one of the most popular SIA. However, ABC has some shortcomings. In this paper, we design an improved ABC, called IABC, which introduces a hybrid search strategy. To evaluate the optimization ability of IABC, we run IABC on several famous benchmark functions. Experimental results show that IABC can achieve good solutions on the test functions. Finally, IABC is used to solve parameter identification problems. Two test instances are used for the simulation experiment. Results demonstrate that IABC can obtain a good matching to the target model. Keywords: artificial bee colony; hybrid search; parameter identification; optimization. Double diffusive convection in a layer of Kuvshiniski viscoelastic nanofluid in a porous medium   by Ramesh Chand, G.C. Rana, S.K. Kango, Kamal Singh Abstract: Double diffusive convection of Kuvshiniski viscoelastic nanofluid in a porous medium is studied for more realistic boundary conditions within the frame work of linear stability theory. The model used for nanofluid incorporates the effect of Brownian diffusion and thermophoresis. The flux of volume fraction of nanoparticles is taken to be zero on the isothermal boundaries. For the porous medium Brinkman-Darcy model is considered. The stability criterion for stationary convection has been derived and graphs have been plotted to study the effects of the Dufour parameter, Soret parameter, Lewis number, the modified diffusivity ratio and the concentration Rayleigh number on stationary convection. Keywords: Double diffusive convection; Kuvshiniski viscoelastic fluid; Galerkin method; Dufour parameter; Soret parameter; porous medium. An efficient numerical method for the solution of third order boundary value problem in ordinary differential equations   by Pramod Pandey Abstract: In this article we have considered linear third order boundary value problems and proposed an efficient difference method for numerical solution of the problems. We have shown that proposed method is convergent and second order accurate. The numerical results in experiment on some test problems show the simplicity and efficiency of the method. Keywords: Boundary Value Problem; Difference Method; Explicit Inverse; Obstacle problems; Second order Convergence; Third Order Differential Equation. Three Stage Game Research of Dual-Channel Supply Chain of Fresh Agricultural Products under Consumer Preference   by Zhenguo Liu, Zhiqiang Yu, Shuangshuang Zhang, JianLiang Peng Abstract: Double channel conflict between Fresh Agricultural Products is the focus of the urgent problems. With consumer service preference, this article build a three-stage dynamic game model of the integration of resources during the fresh produce supply chain online and Offline distribution to study the effect of the variables in the Fresh Agricultural Products supply, finally through the case analysis, to verify the validity of the method of three stage game of Dual-Channel Supply Chain of the distribution of resources integration of Fresh Agricultural Products. The research results have important guiding value to the management of Dual-Channel Supply Chain of the distribution of resources integration of Fresh Agricultural Products. Keywords: Fresh Agricultural Products; Dual-Channel Supply Chain; Three Stage Game; consumer preference; the integration of resources. A new method based on artificial neural networks for solving general nonlinear systems   by Hamed Abbasnejhad, Ahmad Jafarian Abstract: Implementation of the amazing features of the human brain in anrnarti Keywords: Nonlinear algebraic system; Arti¯cial neural networks ap-rnproach; Criterion function; Back-propagation learning algorithm. A Cross-Diffusion Model of Effects of Norepinephrine on Immune Response to Human Immunodeficiency Virus   by Samuel Shikaa, Vinod Gill Abstract: In this paper, the effects of norepinephrine on immune response to Human Immunodeficiency Virus (HIV) has been modelled using a system of partial differential equations capturing both random and directed movement of immune cells. The equilibrium point of the kinetic system is evaluated and found to be asymptotically stable while the parameter values were obtained from the existing literature. Numerical simulations are performed in order to examine the impact of norepinephrine concentration of antigen presentation process and activation cytotoxic T cells. Keywords: cross-diffusion equations; lymphocytes; norepinephrine; HIV model. AN IMPROVED LOWER BOUND FOR GENERAL POSITION SUBSET SELECTION   by Ali Gholami Rudi Abstract: In the General Position Subset Selection (GPSS) problem, the goal is to find the largest possible subset of a set of points, such that no three of its members are collinear. If $s_{textrm{GPSS}}$ is the size the optimal solution, $sqrt{s_{textrm{GPSS}}}$ is the current best guarantee for the size of the solution obtained using a polynomial time algorithm. In this paper we present an algorithm for GPSS to improve this bound based on the number of collinear pairs of points. We experimentally evaluate this and few other GPSS algorithms; the result of these experiments suggests further opportunities for obtaining tighter lower bounds for GPSS. Keywords: General position subset selection; Collinearity testing; Discrete geometry. Particle smoothing via Markov Chain Monte Carlo in general state space models   by Meng Gao, Hui Zhang Abstract: Sequential Monte Carlo (SMC) methods (also known as particle filter) provide a way to solve the state estimation problem in nonlinear non-Gaussian state space models (SSM) through numerical approximation. Particle smoothing is one retrospective state estimation method based on particle filtering. In this paper, we propose a new particle smoother. The basic idea is easy and leads to a forward-backward procedure, where the Metropolis-Hastings algorithm is used to resample the filtering particles. The goodness of the new scheme is assessed using a nonlinear SSM. It is concluded that this new particle smoother is suitable for state estimation in complicated dynamical systems. Keywords: Sequential Monte Carlo; Particle filter; Forward filtering-backward smoothing;rnMetropolis-Hastings. A Linear time-dependent deteriorating inventory model with linearly time- dependent demand Rate and inflation   by Rakesh Tripathi, Sarla Pareek, Manjit Kaur Abstract: This paper considers inventory model for linearly time-dependent deteriorating items with linearly time dependent demand. Inflation is also taken into account. The model is discussed allowable shortages. Mathematical model has been derived to obtain the optimal cycle time and optimal total average cost for items. The objective of this is to minimize the total average cost. Numerical examples are provided to validate the proposed model. Results are also illustrated with the help of sensitivity analysis. Keywords: Linearly time-dependent deterioration; linearly time-dependent demand; inflation; shortage; inventory. Optimization on Empty Trains Distribution with Time Window in Heavy Haul Railway   by Gang Duan, Li Chen, Yin-zhen LI, Rui-chun HE Abstract: The half close form of heavy haul railway such as Daqin Railway is divided into two parts, i.e. the loading region and the unloading region, according to its characteristic. We research the whole process of empty trains distribution. To guarantee loading continuity and stability, a model is proposed to minimize the empty trains multiplying hours of arriving at loading point early or late and subject to the constraints of the required empty trains in loading point, transport capacity in unloading region, the time window of loading point and the type, mode and quantity of empty trains combined in combination station and decomposed in decomposition station. The aim is to improve the efficiency of empty trains returning and reduce the operating costs. The data from Daqin heavy haul railway are performed to testify the models correctness and effectiveness. Keywords: Empty wagons distribution of heavy haul railway; empty wagons combination and decomposition; Daqin Railway. Diagnostic computational model for neuronal disorder through glycogen metabolism in astrocytes   by Selvakumar R, Rashith Muhammad M Abstract: An automaton called embedded automaton is introduced to monitor the glycogen metabolism with an end product as lactate in astrocytes. It is designed to observe the glycogen metabolism with the states of acceptance and rejection. It is a hybridization of both non-deterministic finite automaton and push-down automaton. The acceptance state of the embedded automaton depicts the normal level of glycogen synthesis and degradation. The rejection state of this machine shows the inhibition of metabolic processes in the absence of active enzymes. The process of glycogen metabolism in astrocytes can be regulated with a group of regulatory enzymes. It assists in enhancing the energy supply to neurons by regulating the neuronal activity. The construction of computational model using automata theory can help in targeting research on the enzymatic activity in brain glycogen pathways. Such an interdisciplinary approach can be a promising therapeutic application for both diagnosis and therapy for neuronal injuries. Keywords: Embedded automaton; Enzymes; Glial cell; Glycogen metabolism. General central firefly algorithm based on different learning time   by Peiwu Li, Jia Zhao, Zhifeng Xie, Wenjing Li, Li Lv Abstract: Firefly algorithm (FA) is a bionic random algorithm for solving complex optimization problems. Standard FA utilizes the principle that any firefly will be attracted to other fireflies superior to itself to complete the population evolution. In this method, the better fireflies only show the advantages of themselves, but do not represent that of swarm. Since the fireflies are drawn to the local optimal particles, the convergence speed is faster, and the swarm may be trapped into a local optimum. We propose the general central firefly algorithm based on different learning time, by incorporating general central particle into the algorithm that represent the advantages of the swarm. In this way, information exchange between the swarms can be enhanced. Different learning time of the general central particle is embedded into the particle update phase of FA. Correspondingly, several variants of general central FA are generated, namely, the algorithms based on one-to-one (OO) learning time, one-to-all (OA) learning time and all-to-all (AA) learning time. The proposed method was then tested on 12 benchmark functions. The experiment showed that the optimization performance of all three algorithms based on different learning time was better than that of the standard FA. OOFA algorithm had the best optimization performance. Keywords: Firefly algorithm; general center particle; learning time;. Solving Large-Scale 01 Knapsack Problem by the Social-Spider Optimization Algorithm   by Yongquan Zhou Abstract: This paper uses the social-spider optimization (SSO) algorithm to solve large-scale 0-1 knapsack problems. The SSO algorithm is based on the simulation of cooperative behavior of social-spiders. In SSO algorithm, individuals emulate a group of spiders which interact to each other based on the biological laws of the cooperative colony. The algorithm considers two different search agents (spiders): males and females. Depending on gender, each individual is conducted by a set of different evolutionary operators which mimic different cooperative behavior which are typically found in the colony. The experiment results show that the social-spider optimization algorithm can be an efficient alternative for large-scale 0-1 knapsack problems. Keywords: large-scale 0-1 knapsack problems; social-spider optimization algorithm; cooperative behavior. 3-Dimensional Coordinated search technique for a Randomly Located target   by Mohamed El-hadidy, Abd El-Moneim Teamah, Abd Al-Aziz Hosni El-Bagoury Abstract: This paper involves a new coordinated search model that determines a three dimensional randomly located target by using two searchers. Rather than finding the expected value the time for detecting the target in case of symmetric and asymmetric trivariate known distribution. We obtain the optimal search strategy that minimizes the expected value of the detection time of the search to detect the target, assuming standard normal and skew standard normal distributions. An illustrative example has been given to demonstrate the applicability of this technique. Keywords: Optimal search theory; Coordinated search technique; Skew standard normal distributions. K-Domination Number of Products of Two Directed Cycles and Two Directed Paths   by Ramy Shaheen Abstract: Let D be a finite simple directed graph with vertex set V(D) and arc set A(D). A subset S of the vertex set V(D) is a k-dominating set (k ≥ 1) of D if for each vertex v not in S there exists k vertices {u1, , uk}S such that (ui , v) is an arc of D for i = 1, , k. In this paper we calculate the k-domination number (k ≥ 2) of the Cartesian products of two directed graphs D1D2 for D1 and D2 are two directed cycles, two directed paths or path and cycle, respectively. Also, we give k-domination number (k ≥ 2) of the direct product of two directed cycles and two directed paths. Keywords: Directed graph; Directed cycle; Directed paths; Cartesian product; Direct product; k-domination number. Local convergence of a fast Steffensen-type method on Banach space under weak conditions   by Santhosh George, Ioannis K. Argyros Abstract: This paper is devoted to the study of a seventh-order Steffensen-type methods for solving nonlinear equations in Banach spaces. Using the idea of restricted convergence domain, we extended the applicability of the seventh-order Steffensen-type methods. Our convergence conditions are weaker than the conditions used in earlier studies. Numerical examples where earlier results cannot apply to solve equations but our results can apply are also given in this study. Keywords: Steffensen-type method;restricted convergence domain;radius of convergence; local convergence. A NEW THREE PARAMETER LIFETIME DISTRIBUTION   by Ahmed M. T. Abd El-Bar, Ibrahim Ragab Abstract: In this paper, we introduce a three-parameter distribution called the Weibull exponential (WE) distribution which offers a more flexible model for lifetime data. We show that the hazard rate of the new model can be increasing, decreasing and bathtub shaped. A comprehensive mathematical treatment of the WE distribution is provided. We give closed-form expressions for the density, hazard rate, moments, quantile function, mean residual life function, mean deviations, Bonferroni and Lorenz curves. We also derive the density of order statistic. Moreover, we discuss estimation by the maximum likelihood and obtain an expression for the observed information matrix. Furthermore, simulation results on maximum likelihood estimation are presented. Two real data sets are used to assess the performance of the new model among some classical distributions. Keywords: Weibull distribution; Hazard rate function; Mean residual life function; Maximum Likelihood estimation (MLE); information matrix. Research on pipeline blocking state recognition algorithm based on mixed domain feature and KPCA-ELM   by Jingzong Yang, Zao Feng, Xiaodong Wang, Guoyong Huang Abstract: Aiming at the problem of recognition on pipeline blockage, a method based on mixed domain feature and KPCA-ELM is proposed. Firstly, the original acoustic impulse response signals are analyzed by statistical analysis and local mean decomposition (LMD), in order to construct the mixed domain features, which are made up of time, frequency and time-frequency domain features. Then the kernel principal component analysis (KPCA) is adopted to reduce the high-dimensional features of mixed domain, and extract the main features which reflect the operation state of main components. Finally, the main features are input to extreme learning machine (ELM) for state recognition. After the feature extraction by KPCA, the redundancy of input features is eliminated. The simulation results show that KPCA is more sensitive to the nonlinear characteristics of the pipeline blockage signal when compared with PCA. Meanwhile, ELM is superior to BP in terms of classification accuracy and time consuming. Keywords: pipeline; KPCA; ELM; state recognition. On ve-degree molecular topological properties of silicate and oxygen networks   by Süleyman Ediz Abstract: Silicate based inorganic materials are important for the synthesis of new inorganic molecules in which the studies for ultrahigh proton conductivity and catalysis. Quantitative structure-property and structure-activity relationships of the silicate oxygen networks necessitate expressions for the molecular topological features of these networks. In QSPR/QSAR studies, physicochemical characteristics and molecular topological indices such as atombond connectivity (ABC), geometric-arithmetic (GA), harmonic (H) and sum-connectivity (χ) indices are used to model the physicochemical properties of chemical compounds and networks. These topological indices are based on the degrees of the vertices(atoms) of a connected graph. Recently novel two degree concepts have been defined in graph theory; ev-degrees and ve-degrees. In this study by using the ve-degree concept, we define ve-degree atombond connectivity (ve-ABC), ve-degree geometric-arithmetic (ve-GA), ve-degree harmonic (ve-H) and ve-degree sum-connectivity (ve-χ) indices as parallel to their corresponding classical degree versions. We show that the ve-degree sum-connectivity index give better correlation than Wiener, Zagreb and Randić indices to predict the acentric factor of octanes. Also we compute ve-degree topological indices for some silicate oxygen netwoks such as dominating oxide network (DOX), regular triangulene oxide network (RTOX), dominating silicate network (DSL) and derive analytical closed formulae of these networks. Keywords: silicate oxygen networks; QSPR studies; ve-degree topological indices. Bivariate Spectral Quasi-linearisation exploration of heat transfer in the boundary layer flow of micropolar fluid with strongly concentrated particles over a surface at absolute zero due to impulsive   by Isaac Lare Animasaun, Sandile Sydney Motsa Abstract: The problem of unsteady micropolar fluid flow over a surface in which the heat energy falls at a lower limit of thermodynamic temperature scale due to impulsive is investigated. In this article, a new spectral method for solving the partial differential equation is shown to unravel the heat transfer within the boundary layer. Some fluid layers at the free stream are given an impulsive motion in the horizontal direction. The thermal conductivity of the non-Newtonian fluid is assumed to be temperature dependent due to the influence of internal heat source; hence, its modified to suit the case of melting heat transfer following all the fundamental theories. The mathematical models are non-dimensionalized and parameterized using similarity transformation suitable to unravel the fluid flow at short time and long time periods. The bivariate spectral quasi-linearisation is adopted to solve the dimensionless problem. Effects of relevant parameters on the micropolar fluid flow with heat transfer are analyzed. Smooth transitions within the time frame $0leqxileq1$ in the domain $0leqetaleq7$ are observed. At final steady stage ($xi = 1$), maximum micro-rotation of tiny particles is guaranteed when the magnitude of micro-rotation parameter is small. The minimum temperature distribution is ascertained when the magnitude of Prandtl number is significantly large. Keywords: Heat Transfer; Constant Vortex viscosity; Micropolar fluid; Bivariate Spectral Quasi-linearisation; Variable Thermal Conductivity. Enhanced Box-Muller Method for high quality Gaussian Random Number Generation   by Adnane ADDAIM, Driss Gretete Abstract: Fast and high-quality Gaussian Random Number Generation (GRNG) is a keyrncapability for simulations across a wide range of disciplines. In this article, we present an enhanced Box-Muller method for GRNG using one uniform variable. Its Probability Density Function (PDF) is given in closed form as a function of one parameter. In this article, the theoretical basis of this method is quite thoroughly discussed, and is evaluated using several different statistical tests, including the chi-square test and the Anderson-Darling test. The simulations results show good performances of this method which generates accurately a truernGaussian PDF even at very high σ (standard deviations) values in comparison with the standard Box-Muller method. Keywords: Gaussian Random Number Generation; Box-Muller method; statistical tests. Existence and Stability of Anti-periodic Solutions for FCNNs with Time-varying Delays and Impulsive Effects on Time Scales   by Hongmei Bao Abstract: This paper deals with the existence and global exponential stability of anti-periodic solutions for fuzzy cellular neural networks(FCNNs) with time-varying delays and impulsive effects on time scales. Using the theory of coincidence degree, inequality technique and constructing some suitable Lyapunov functional, some sufficient conditions are obtained for the existence and global exponential stability of anti-periodic solutionsfor FCNNs with time-varying delays and impulsive effects on time scales.These results are less restrictive than those given in the earlier references. Moreover an example is provided to illustrate results obtained. Keywords: Anti-periodic solutions; Fuzzy cellular neural networks; Impulsive effects; Time-varying delays; Time scales. A study on the effect of inclined magnetic field and Hall current on the micropolar fluid model of blood flow through stenotic arteries in a porous medium.   by Ajaz Ahmad Dar Abstract: The problem of blood flow through a horizontal nonsymmetric artery with a mild stenosis in a porous medium has been investigated. The nature of blood in small arteries are analyzed mathematically by considering it as a homogeneous and incompressible micropolar fluid. The effect of both rotation and inclined magnetic field are studied analytically and computed numerically. To evaluate the influence of the stenosis shape, an appropriate geometry has been considered such that the shape of the stenosis can be changed simply just by varying a parameter (referred to as the shape parameter). The expressions for the flow characteristics such as velocity, the impedance (resistance to flow), the wall shear stress distribution and its magnitude at the stenosis throat have been derived and analyzed for different values of shape parameter n, rotation parameter Ω, the magnetic field parameter M, inclination angle of the Magnetic f ield parameter (θ), permeability parameter (K1), the coupling number N and the micropolar fluid parameter m. Keywords: Micropolar fluid; Magnetic field; Inclination angle of the Magnetic field parameter; Blood Flow; Rotation; Stenosed Artery. AN EFFICIENT FIFTH-ORDER STEFFENSEN-TYPE METHOD FOR SOLVING SYSTEMS OF NONLINEAR EQUATIONS   by Anuradha Singh Abstract: In this paper, we present a three-step Steffensen-type iterative method of order five for solving systems of nonlinear equations. Various particular cases of the proposed method are considered. The general form of computational efficiency of the proposed scheme is compared to existing techniques. Numerical examples are given to show the performance of the proposed method with some existing schemes. We observed from the comparison of the new scheme with some known methods that the proposed scheme shows high efficiency index than others. Keywords: Nonlinear systems; order of convergence,rnefficiency index; Jacobian matrix; LU factorization. Group Acceptance Sampling Plans for Resubmitted Lots under Exponentiated Fr   by Srinivasa Rao Gadde Abstract: In quality control, we used to develop different types of sampling plans to ensure the quality of product lifetime. In this paper, we develop a group acceptance sampling plan (GASP) for lot resubmitting, to ensure the quality of product lifetime assuming that the product lifetime follows the exponentiated Fr Keywords: Resubmitted lot; group sampling plan; life test; producer’s risk; consumer’s risk;rnpercentile life.rn. Real-time online action detection and segmentation using Improved Efficient Linear Search   by Shiye Wang, Zhezhou Yu, Xiangchun Yu Abstract: More and more attention has been paid to linear-time online action detection and video segmentation, due to wide application in the fields of human-computer interaction, games and surveillance. In this paper we propose a new descriptor which can be adopted for action recognition, online action detection and segmentation. In addition, we propose the Improved Efficient Linear Search (Improved ELS) whose scheme is modified to solve the problem of the existence of many action classes maximum subarray sums exceeding their thresholds. Then we evaluated our approach on MSRC-12 and MSR-Action3D datasets. The results show that our descriptor achieves the state-of-the-art results on action recognition and the performance of the Improved ELS is much higher than that of the ELS. Keywords: linear-time; skeleton data; action recognition; action detection and segmentation; moving pose descriptor; Improved Efficient Linear Search. Parameter estimation for partially observed nonlinear stochastic system   by Chao Wei, Chaobing He Abstract: This paper is concerned with the parameter estimation problem for partially observed nonlinear stochastic system. The suboptimal estimation of the state is obtained by constructing the extended Kalman filtering equation. The likelihood function is provided based on state estimation equation. The strong consistency of the estimator is proved by applying maximal inequality for martingales, Borel-Cantelli lemma and uniform ergodic theorem. An example is provided to verify the effectiveness of the method. Keywords: nonlinear stochastic system; state estimation equation; parameter estimation; strong consistency. Numerical solution of fuzzy differential equations using orthogonal polynomials   by Smita Tapaswini, Snehashish Chakraverty Abstract: Present paper proposed a new method to solve n-th order fuzzy differential equations using collocation type of method. In the solution procedure, Gram Schmidt orthogonalisation process is used with Legendre and Chebyshev polynomials. Known example problems are solved and compared with the exact results to illustrate the efficiency and reliability of the proposed method. Keywords: Fuzzy number; Triangular fuzzy number; Legendre polynomial; Chebyshev polynomial; n-th order fuzzy differential equations. Variation of wind speed distribution characteristics across Indian sub-continent   by Satheesh Kumar, Asokan K, Dennis C. Kiplangat, Drisya G. V. Abstract: Knowledge of wind speed and its characteristics is important for optimizing the production and transmission of wind power generated by wind mills. In this paper, we analyse frequency component level distribution characteristics of wind speed variations at locations across Indian sub-continent. The results show significant variation of the distribution behaviour among frequency components.We also analyse effect of location, seasonal variation and temporal position in the solar cycle. The skewness and kurtosis showclear scaling behaviour against latitude showing a decrease as location approaches equator. The impact of solar cycle is more predominant at locations closer to the equator. The seasonal impact on distribution characteristics is also evident and more prominent at locations closer to equator in solar maximum year. Keywords: Weibull distribution; wind speed; solar cycle; wavelet decomposition. DISTANCE BASED FACILITY LOCATION PROBLEM FOR FUZZY DEMAND WITH SIMULTANEOUS OPENING OF TWO FACILITIES   by Ashish Sharma, Ashish Sharma, Anand Singh Jalal Abstract: In the real world there are so many businesses for which the major concern is the location of facility/store so that they can satisfy the demand in an efficient manner. Therefore the companies perform extensive survey for finding the right location before the setup of facility/store. These surveys generate the probabilistic data. In the light of these real life aspects we developed a distance based facility location problem (FLP) for the fuzzy demand. The distance between customer and facility is incorporated in the form of constraints. Model is applied over different defuzzification methods and results are compared. Results are also obtained for the option of simultaneous opening of two locations. Results show that, sometimes the two facility opening option provides the better results as compared to one. Solution procedure is provided. Numerical example is presented in order to briefly explain the model using LINGO. Keywords: Facility Location Problem; Fuzzy demand; Region search; Distance based FLP. User collaborative filtering recommendation algorithm based on adaptive parametric optimization SSPSO   by Xiuqin Pan, Wenmin Zhou, Yong Lu, Ruixiang Li Abstract: Recommendation algorithm is one of the hot issues in the field of computer science, and is widely used in many aspects. Various types of e-commerce systems and applications need to use recommendation system to support. Collaborative filtering recommendation algorithm has been widely used in e-commerce system for its high recommendation accuracy. In order to improve the performance of the process of clustering and selection of nearest neighbours in collaborative filtering, there are several optimization proposals in this paper directly to the recommendation algorithm which is based on the adaptive parametric optimization semi-supervised PSO clustering (APO_SSPSO). This paper uses MovieLens data sets to compare the performance of the proposed method and the traditional collaborative filtering recommendation algorithm. Simulation has proved that this recommendation algorithm has accuracy and effectiveness in enhancing the performance of user collaborative filtering recommendation system. And to some extent, the algorithm has minimized space consumption. Keywords: user collaborative filtering; recommendation algorithm; particle swarm optimization (PSO); semi-supervised learning. A Spline Based Computational Technique Applicable for Solution of Boundary Value Problem Arising in Human Physiology   by Pankaj Srivastava Abstract: Nonpolynomial quintic spline functions based algorithms are used for computing an approximation to the non-linear two point second order singular boundary value problems arising in human physiology. After removing the singularity by L hospital rule, the resulting boundary value problem is then efficiently treated by employing nonpolynomial quintic spline for finding the numerical solution. Two examples have been included and comparison of the numerical results made with cubic extended B-spline method and finite difference method. Keywords: Nonpolynomial quintic spline; Nodal points; Singular boundary value problem; System of equations; Maximum absolute error. Bifurcation analysis of H   by Ilham Djellit, Wissame Selmani Abstract: The dynamic behaviour of a dynamical system, described by a planar map, is analytically and numerically explored. We examine analytical conditions for stability and bifurcation of the fixed points of the system and by using numerical methods, we compute bifurcation curves of fixed points and cycles with orders up to 5 under variation of three parameters, and compute all codimension 1 and codimension-2 bifurcations on the corresponding curves. These curves form stability boundaries of various types of cycles which emanate around codimension-2 bifurcation points. Mathematical underpinnings and numerical simulations confirm our results and contribute to reveal further complex dynamical behaviours. Keywords: Codimension-2 Bifurcations; Blumberg’s dynamics; Fold and flip bifurcation curves; Diffeomorphism; Embedding. A Membrane-inspired Quantum Bee Colony Optimization Based on Simulated Quantum Gate and Its Applications   by Ming Diao, Yongzhen Bai, Yu Wang Abstract: In order to effectively solve discrete optimization problems, a membrane-inspired quantum bee colony optimization (MQBCO) is proposed for scientific computing and engineering applications. The proposed algorithm applies the membrane computing theory and simulated quantum gate to improve quantum bee colony optimization (QBCO), which is an effective discrete optimization algorithm and is proved by testing the benchmark functions. The new spectrum assignment algorithm based on MQBCO can search the global optimal solution. Simulation results are provided to show that the designed spectrum assignment method is superior to the previous intelligent spectrum assignment algorithms in terms of fairness and network utility. Keywords: quantum bee colony optimization; membrane computing; P system; spectrum assignment. Modelling user pictures with Hierarchical Dirichlet Process of P2P lending market   by Danyang Li, Yongquan Liang, An Liu Abstract: The emergence of Peer-to-Peer (P2P) lending has drawn a lot of attention. The enormous data generated from this billions level market bring us lots of challenges and opportunities. One interesting question of modelling this data is that can we discover the hidden pattern of users characteristics from it? Currently, few works have been made to this area. In this article, we try to build a Bayesian probabilistic model to discover the latent user pictures. Especially, we build a user picture model via Hierarchical Dirichlet Process from data of one of the biggest market, Lending Club. The discovered user picture is interpretable and can be evaluated from many perspectives. To demonstrate the usage of user picture, we also proposed a method to predict loan status. The experimental results show our approach outperformed the comparison methods Keywords: P2P lending; User pictures; Hierarchical Dirichlet Process; Prediction. Reverse Super Edge-Magic Strength of Banana Trees   by Shaik Sharief Basha Abstract: A reverse magic labeling of a graph G(V,E) is a bijection such that for all edges xy, f(xy)-{f(x)+f(y)} is a constant which is denoted by c(f). A reverse magic labeling of a graph G(V,E) is called reverse super edge-magic labeling of G if f(V) ={1,2, } and f(E) = { +1, +2,., +} . The reverse super edge-magic strength of a graph G,rsm(G), is defined as the minimum of all c(f) where the minimum is taken over all reverse edge-magic labelings f of G. In this paper we invented the reverse super edge-magic strength of banana trees . Keywords: Reverse super – edge magic labeling ; Reverse super edge-magic strength of a graph; banana trees. T*: A Weighted Double-heuristic Search Algorithm to Find the Shortest Path   by Mohammad Samadi Gharajeh Abstract: This paper proposes a weighted double-heuristic search algorithm to find the shortest path between two points. It can be used in numerous fields such as graph theory, game theory, and network. This algorithm, called T*, uses a weighted and heuristic function as f(x) = α Keywords: Shortest Path; Search Algorithm; Weighted Strategy; Double-heuristic Function; Graph Theory. Analytical solutions to nonlinear problems by the generalized form of HAM : A note   by Anant Kant Shukla, Tumkur R. Ramamohan, Suripeddi Srinivas Abstract: The objective of this article is to obtain analytical solutions for a set of nonlinear problems by using Further Generalization of HAM\'\'. In comparison to the Homotopy analysis method (HAM) solutions, more accurate solutions are obtained by introducing an extra term in the frame of HAM. We consider a set of three nonlinear problems of which first two are governed by single nonlinear Ordinary differential equation (they are two cases of the forced Van der Pol Duffing oscillator) and third one is governed by a system of four coupled nonlinear Ordinary differential equations. A maximum reduction of approximately 25% in the square residual error is obtained by using the generalized form of HAM compared to the square residual error without the generalized form. Keywords: Further generalization of HAM; Homotopy analysis method; Square residual error. Dynamic Navigation of Web Query Results Using B-tree and Improved Page Rank Algorithm   by Lakshmi Lingutla Abstract: Most of the web search queries submitted by users are short, uncertain and ambiguous. The size of World Wide Web is increasing, as millions of web pages are added to it every day. The information retrieval process is very complicated today as it depends on many factors like classification of a web query, number of phrases present in the query, number of in-links to the documents, the number of out-links from the document, vocabulary, changing nature of the meaning of words, and number of times each phrase appears in a document. Information retrieval process mainly involves two steps, retrieval of relevant documents for user queries and retrieved documents are sorted using efficient page rank algorithms. Most of the existing systems use static navigation of the web query and ranking. They mainly depend on the number of in links and out links of a web page due to which they produce more number of non-relevant documents. In this paper, we proposed dynamic navigation of web query using B-tree navigation method to retrieve relevant documents efficiently by reducing non-relevant documents and resulting documents are sorted by using an improved page rank algorithm. The main objective of this paper is to retrieve most appropriate results for the given query, by reducing time taken to retrieve web pages and reducing the number of non-relevant web pages. Keywords: Web query classification; Session log; Categorization factor; Dynamic navigation; Unique visit count; Distance. Research on Productive Efficiencies Measurement based on Three-Stage Super DEA Model: A case of Chinese Road and Bridge Enterprises   by Changbing JIANG Abstract: Three-Stage Super DEA Model is firstly used to analyse the Productive Efficiency of Chinese Road and Bridge Enterprises listed on the Shanghai and Shenzhen stock markets during 2007 and 2014. Through analysis, the research indicated that: 1) Pure technical efficiency of Chinese road and bridge enterprises has a greater effect on productive efficiency than scale efficiency. 2) The productive efficiency productivity has a huge difference between annually and each Road and Bridge enterprise. 3) Overall efficiency of Chinese road and bridge enterprises is low, and shows a slow upward trend. 4) Environment variables and random errors have a greater impact on Productive Efficiency of Chinese Road and Bridge Enterprises. Keywords: road and bridge enterprises; productive efficiencies; three-stage super DEA model. Mathematical Model of Childhood Diseases Outbreak with Optimal Control and Cost Effectiveness Strategy   by Kazeem Okosun, Oluwole Makinde Abstract: In this paper, we derive and analyze a deterministic model for the transmission of childhood disease perform optimal control analysis of the model. The model is found to exhibit multiple equilibria. However, a unique endemic equilibrium exists when there is no disease induced death. We also derive and analyze the necessary conditions for the optimal control of the disease. In addition, we investigate the cost-effectiveness of the controls to determine the most effective strategy to control childhood disease with minimum costs. Finally, we present the numerical solutions. Keywords: Childhood coverage; Sensitivity indices; diseases; Epidemiological model; Vaccination. Applying Refined Descriptive Sampling on the vibrating string model   by Megdouda OURBIH-TARI, Sofia GUEBLI, Abdelouhab ALOUI Abstract: Monte Carlo methods (MC) and Refined Descriptive Sampling (RDS) are sampling methods that can be used to produce input values for estimation of expectation of function of output variables. This paper gives an application of RDS method in a two-dimensional problem of a vibrating string. An empirical comparison of theserntwo methods demonstrating the effectiveness of RDS on MC is performed by using the variance as a statistical criterion since both methods are unbiased. Keywords: Sampling method; Variance; Monte Carlo; Expectation. The new exact analytical solution and numerical simulation of (3 + 1)-dimensional time fractional KZK equation   by Lanfang Zhang, Juanjuan Ji, Julang Jiang, Chaolong Zhang Abstract: The KZK parabolic nonlinear wave equation is one of the most widely employed nonlinear models for propagation of 3D diffraction sound beams in dissipative media. In this paper, the exact analytical solutions of (3+1)-dimensional time fractional KZK equation have been constructed in the sense of modified Riemann-Liouville derivative and the (G'/G)-expansion method , the simplest equation and the fractional complex transform. As a result, some new exact analytical solutions are obtained, and the effects of diffraction, attenuation and nonlinearity are researched deeply using the obtained exact analytical solutions. Keywords: (3+1)-dimensional time fractional KZK equation; diffraction; attenuation; nonlinearity; fractional complex transform; numerical simulation. An image hole inpainting algorithm with improved FMM for mobile devices   by Huiqin Wang, Dong Fang, Congcong Wang, Jianqiu Jin Abstract: During the warping operation with DIBR, the hole will be generated through the synthesis of 3D image. For mobile device, it has lower performance so that the hole inpainting can not be completed in real-time. In order to overcome this shortcoming, we propose an image hole inpainting algorithm with improved FMM for mobile devices. The algorithm fills the hole after 3D image warping by DIBR. First, we mark the color image and the corresponding holes. Then, we preserve the original image foreground edge information by the improved expanded core of traditional FMM. Finally, we implement the algorithm on mobile devices. Experimental results show that the improved FMM proposed in this paper is better than the traditional FMM. Keywords: Mobile device; Inpainting; DIBR; FMM. The Fully-Implicit Finite Difference Method for Solving Nonlinear Inverse Parabolic Problems with Unknown Source Term   by Reza Pourgholi, Hassan Dana Mazraeh, Sahar Tavana Abstract: A numerical procedure based on a fully implicit finite difference method for an inverse problem of identification of an unknown source in a heat equation is presented. Approach of the proposed method is to approximate unknown function from the solution of the minimization problem based on the overspecified data. This problem is ill-posed, in the sense that the solution (if it exist) dose not depend continuously on the data. To regularize this ill-conditioned, we apply the Tikhonov regularization $0^{th}$, $1^{st}$ and $2^{nd}$ method to obtain the stable numerical approximation to the solution. A stability analysis shows that this numerical scheme approximation is unconditionally stable. Numerical results for two inverse source identification problems show that the proposed numerical algorithm is simple, accurate, stable and computationally efficient. Keywords: Ill-posed problem; Fully implicit; Unknown source; Tikhonov regularization method; Least square; Noisy data. Using kernel based collocation methods to solve a delay partial differential equation with application to finance.   by Mojtaba Moradipour, Hossein Azari Abstract: We consider a delay partial differential equation arising in a jump diffusion model of option pricing. Under the mean--reverting jump--diffusion model, the price of options on electricity satisfies a second order partial differential equation. In this paper, we use positive definite kernels to discretize the PDE in spatial direction and achieve a linear system of first order differential equation with respect to time. We impose homogeneous boundary conditions of the PDE by using a manipulated version of kernels called recursive kernels''. The proposed methods are fast and accurate with low computational complexity. No integrations are necessary and the time dependent system of differential equations can be solve analytically. Illustrative example is included to demonstrate the validity and applicability of the new techniques. Keywords: Positive definite kernels; collocation methods; mesh free methods; jump diffusion models; option pricing. New Concepts of Domination Sets in Vague Graphs with Applications   by Hossein Rashmanlou, Yahya Talebi Abstract: A vague graph is a generalized structure of a fuzzy graph that gives more precision, flexibility, and compatibility to a system when compared with systems that are designed using fuzzy graphs, which is introduced by Ramakrishna cite{12}. Domination in graphs has many applications to several fields. Domination arises in facility location problems, where the number of facilities (e.g., hospitals, fire stations) is fixed and one attempts to minimize the distance that a person needs to travel to get to the closest facility. Concepts from domination setrnalso appear in problems involving finding sets of representatives in monitoring communication orrnelectrical networks, and in land surveyor must stand in order to take height measurements for anrnentire region. Hence, in this paper, double domination of vague graphs is introduced and some basic theorems are proved.rnAn interesting result on $gamma_{dd}(G)$ using some known parameter of $G$ is obtained. Finally, some applications of domination in vague graph are given. Keywords: Vague graph; double domination set; cut node; fuzzy set. A Research on Defect Image Enhancement Based on Partial Differential Equation of Quantum Mechanics   by Zhonghua Wang, Yuan Liao, Guiying Chi Abstract: The defect image enhancement of aeronautic component is vital for the defect quantitative and qualitative properties. In this paper, a novel defect image enhancement algorithm is presented, which adopts the partial differential equation of quantum mechanics. The algorithm includes two key steps as follows. Firstly, according to the quantum mechanics theory, the image edge quantum probability is computed. Secondly, the partial differential equation coupling the anisotropic edge quantum probability is constructed to enhance the defect images of aeronautical component. Compared with other methods, the experimental results indicate that the proposed method better highlight the defect images. Keywords: Quantum mechanics; Partial Differential; Image enhancement. Fourth Order Computational Method for Two Parameters Singularly Perturbed Boundary Value Problem using Non Polynomial Cubic Spline   by Kolloju Phaneendra, G. Mahesh Abstract: In this paper, we proposed a fourth order finite difference scheme using non polynomial cubic spline for the solution of two parameters singularly perturbed two-point boundary value problem having dual boundary layer on a uniform mesh. In this method, the first order derivatives in the non polynomial cubic spline finite difference scheme are replaced by the higher order finite differences to get the discretization equation for the problem. The discretization equation is solved by the tridiagonal solver discrete invariant imbedding. The proposed method is analyzed for convergence and a fourth order rate of convergence is proved. The numerical results are compared with exact solutions and the outcomes of other existing numerical methods. Keywords: Two parameters singularly perturbed two point boundary value problem; Dual boundary layer; Characteristic equation; Non polynomial cubic spline. An Eco-epidemiological Model for Newcastle Disease in Central Zone of Tanzania   by Alfred Hugo, Oluwole Daniel Makinde, Santosh Kumar Abstract: Newcastle disease is a contagious bird disease which affects main domestic and wild avian species. A deterministic compartmental model for Newcastle disease (ND) is developed and analysed using ordinary differential equation theory. The uncertainties of model parameters were therefore examined using Markov Chain Monte Carlo (MCMC) simulations for the data of chicken death cases due to Newcastle disease from five districts in two regions in Tanzania. The parameter distribution was tested using MCMC convergence diagnostics. The graphical diagnostic test for MCMC used include Trace plots or time series plot, two-dimensional parameter plots and autocorrelation function plots. Hence, model parameters were successfully estimated for numerical simulations and the results of simulations were presented. Keywords: Eco-epidemiology; Newcastle Disease; Parameter estimation. A novel Computation Method for 2D Deformation of Fish Scale based on SURF and N-R Optimization   by Guihua Li, Pengxiang Ge Abstract: Fish scales were unique structural materials that served as a form of natural armor and affected the mechanical properties which had important applications in bionics. Digital Image Correlation (DIC) method was used to determine the mechanical properties, but it took a long time to calculate the uniaxial tensile deformation. In this investigation a DIC optimization algorithm method based on Speeded-Up Robust Features (SURF) and Newton-Raphson (N-R) was conducted on specimens prepared from the scales. First, the SURF algorithm was used to detect the matched points and their coordinate values in the digital images before and after deformation. Then, the initial displacement of the interest point was estimated from the affine transformation fitted to the matched feature points inside the subset area. Last, the Zero-mean Normalized Sum of Squared Differences (ZNSSD) metric function was optimized by the N-R iterative method, and the optimized displacement value of the interest points would be gained. The numerical translation experiments and simulation results showed that this method improved the search speed and the measurement accuracy effectively. So the deformation of fish scales for axial tension would be calculated by this method. Keywords: Tensile deformation; DIC; SURF algorithm; N-R Algorithm; Fish scale. Modified Bessel Series Solution of the Single Server Queueing Model with Feedback   by Chandra Shekhar, Amit Kumar, Shreekant Varshney Abstract: In multi-access systems, scheduling mechanism often requires a proper feedback policy. In this paper, the direct and simple transient solution technique for the state of the system in a single server/processor Markovian queueing model with feedback is presented using modified Bessel function of the second kind. This technique appears to economize in algebra. The expression for a time-dependent measure of effectiveness such as an expected number of the customers in the system is also derived. We demonstrate how fast the state probabilities tend to their equilibrium limits when it exists. The sensitivity of the state of the system and expected number of the customers in the system has been also analyzed and the results are depicted in the tables and graphs. Keywords: Single server; Feedback policy; Modified Bessel function of the second kind; Transient solution; Poisson queues. A uniformly convergent numerical scheme for singularly perturbed differential equation with integral boundary condition arising in neural network   by Deepti Shakti, Jugal Mohapatra Abstract: This article deals with a singularly perturbed quasilinear boundary value problem with integral boundary condition which arises in neural network. The problem is discretized by using an upwind finite difference scheme on a nonuniform mesh obtained via equidistribution of a monitor function. We prove that the method is first order convergent in the discrete maximum norm independent of perturbation parameter. The parameter uniform convergence is confirmed by numerical computations. Keywords: Singular perturbation; Upwind scheme; adaptive grid; integral boundary condition; Boundary layer. An Efficient Approximation Algorithm for the Extension Facility Location Problem on Torus Internetwork Topology   by Wenhao Shu, Wenbin Qian, Jun Yang Abstract: The uncapacitated facility location problem is an NP-hard problem. Nowadays there are few studies on this problem in practical applications on the torus internetwork topology. The objective of this paper is to extend the facility location problem on the two-dimensional torus internetwork topology. At first, the extension facility location problem with two additional constraints is formulated as integer linear programming. Then, two embedding schemes are proposed respectively by partitioning the solutions of the extension problem into stars, which exhibit a trade-off between dilation and expansion. Finally, an efficient approximation algorithm is developed to find the integer solutions of the extension facility location problem. Moreover, the relative analysis of approximation guarantee of the proposed algorithm is given. Keywords: Facility location; Approximation algorithm; Embedding scheme; Torus internetwork topology. Respondents View of Novel Framework for Data Protection in Social Networking Sites: An Analysis   by Shilpi Sharma Abstract: The era of social networking technologies has been met with mixed reactions by every user around the world. This study explored the novel framework for data protection at users level in social networking site. The study followed a descriptive research design wherein a questionnaire was used as the main research tool. The data collected was analyzed using SPSS 19. Data was gathered from 300 users and analyzed in accordance with the objectives of the study. As we know that concerns rose about the disclosure of personal information on social network sites, users continue to disclose huge quantity of personal information. They find that reading privacy policy is time consuming and changes made can result into improper settings. The analysis of the results concludes that the novel framework satisfies the requirements and the needs to secure user data in a platform i.e. social media. The members of website have appreciated the implementation that lay towards graphical authentication, watermarking feature, encryption technique, approval of friendship request prior to approval and consent of service provider while processing or sharing information for data protection in social networking sites. Keywords: Social Networking Sites; Information Disclosure; Privacy Setting; Authentication; Significance. Nonsmooth Multiobjective Fractional Programming Problem Involving Higher order Functions   by Pallavi Kharbanda, Divya Agarwal Abstract: In this paper, a new generalized class of higher order $(F,\alpha,\rho,d)$-V-type I function is introduced for a nonsmooth multiobjective fractional programming problem involving support functions. The newly defined class extends several known classes in the literature has been justified through a non-trivial example. In the framework of new concept, we determine conditions under which a fractional function becomes higher order $(F,\alpha,\rho,d)$-V-type I function and do some computational work to substantiate the analysis. Further, we establish Karush-Kuhn-Tucker type sufficient optimality conditions and derive various duality results for higher order Mond-Weir type and Schaible type dual programs. Keywords: Multiobjective programming; $(F,\alpha,\rho,d)$-V-type I function; Fractional programming; Non-linear Programming; Efficient solution. New exact solutions to nonlinear diffusion equation that occurs in image processing   by Rafaa Chouder, Benhamidouche Noureddine Abstract: In this paper, we would like to seek new exact solutions to nonlinear diffusion equation that occurs in image processing. This equation is called degenerate parabolic equation. The solutions which we seek are called "travelling profiles solutions". For that, we have used the "travelling profiles method" in order to find, explicitly, new exact solutions to this equation under some conditions. An interesting particular case has been discussed, this case coincides with particular solutions called "intermediate asymptotic solutions" used to study the contour enhancement in image processing. Keywords: Nonlinear degenerate parabolic equations - Travelling profiles solutions - Exact solutions. QUADRATIC NUMERICAL TREATMENT FOR SINGULAR INTEGRAL EQUATIONS WITH LOGARITHMIC KERNEL   by Mostefa NADIR Abstract: The goal of this paper is to present a direct method for an approximative solution of a weakly singular integral equations (W.S.I.E) with logarithmic kernel on a piecewise smooth integration path using a modified quadratic spline approximation, we also show that this approximation gives an e Keywords: Weakly singular integral; Quadratic interpolation; Holder space and Holder condition. Hydromagnetic Chemically Reacting and Radiating Unsteady Mixed Convection Blasius Flow Past Surface Flat in a Porous Medium   by Adetayo S. Eegunjobi, Oluwole. D. Makinde, Onesmus Shuungula, Serge N. Neossi-Nguetchue Abstract: We investigate numerically in this paper, the mutual effects of thermal radiation, magnetic field and buoyancy forces on mixed convection of an electrically conducting chemically reacting incompressible viscous fluid flow over a heated vertical flat surface embedded in a porous medium. Suitable governing equations are obtained and changed to a system of couple nonlinear ordinary differential equations using desirable transformations. Boundary valued problems are therefore solved numerically using the Runge-Kutta-Fehlberg integration procedure coupled with shooting method. The results of the dimensionless velocity, temperature and concentration are then used to compute the skin friction, Nusselt number and Sherwood number. The influences of some of the flow parameters on each of these results are put up graphically and analysed. Keywords: Unsteady MHD; Blasius flow; Mixed convection; Porous medium; Chemically reacting; Thermal radiation. Lanczos-type Algorithms with Embedded Interpolation and Extrapolation Models for Solving Large Scale Systems of Linear Equations   by Wali Khan Abstract: The new approach to combating instability in Lanczos-type algorithms for large scale problems is proposed. It is a modification of so-called embedded interpolation and extrapolation model in Lanczos-type algorithms (EIEMLA), which enables us to interpolate the sequence of vector solutions generated by a Lanczos-type algorithm entirely, without re-arranging the position of the entries of the vector solutions. The numerical results show that the new approach performs more effectively than EIEMLA. In fact, we extend this new approach on the use of a restarting framework to obtain the convergence of Lanczos algorithms accurately. This kind of restarting challenges other existing restarting strategies in Lanczos-type algorithms. Keywords: Numerical Analysis; Interpolation; Extrapolation; Lanczos Algorithms; EIEMLA; Modified EIEMLA; Restarting Strategy. Further results on the generalized hypergeometric matrix functions   by Mohamed Abdalla Abstract: In recent years, various results of the special matrix functions have been established in many papers. In the present paper, we have developed certain properties involving generalized hypergeometric matrix functions, such as, integral representations and reduction formulae. Also, open problems concerning the generalized hypergeometric matrix functions are stated. Keywords: The generalized hypergeometric matrix function; Integral form; Reduction formulae. Finite Element Simulation of Prevention Thermal Cracking in Mass Concrete   by Juncai Xu, Qingwen Ren, Zhenzhong Shen, Song Yang, Xin Xie, Zhengyu Yang Abstract: Mass concrete structures play a very important role in civil engineering. The cracking of concrete is regarded as one of the biggest engineering problems. Therefore, it is very necessary for the cracking of mass concrete to do the control analysis. Some factors should be considered in mass concrete crack control analysis, mainly including the heat releases model of concrete, the mechanical model to the concrete, the process of temperature control in the pipe model. Differential evolution algorithm and equivalent algorithm are adopted to solve the coefficient of adiabatic temperature and cool water effect. In the paper, stress field calculation, back analysis calculations, and cooling pipe processing create secondary development based on the ABAQUS software platform. The second development of the code is used to reasonably solve the problem with one actual aqueduct in hydraulic engineering. Keywords: Mass concrete; differential evolution algorithm; equivalent algorithm; crack control. Computational Study of Drug Delivery in Tumorous Human Airways   by Vivek Kumar Srivastav, Akshoy Ranjan Paul, Anuj Jain Abstract: There is increasing interest in the research of direct drug delivery in respiratory tract because of its attractiveness to produce greater therapeutic benefit for the treatment of pulmonary diseases and systemic diseases. In the present study, a three dimensional human airway geometric model was constructed from computer tomography (CT) scan images. A tumor was artificially created in the trachea of the airway model for the CFD simulation of the aerosol-particles transport in the airways and its deposition on the tumor. Low Reynolds Number (LRN) k-omega model was used to model turbulence flow behavior and Discrete Phase Model (DPM) was applied to simulate aerosol-particle transport. The CFD simulation was carried out for three air inhalation flow rates: 20 L/min (normal breathing), 40 L/min (moderate breathing) and 60 L/min (high breathing), and three particle sizes of 1, 5 and 10 m to determine the effect of these parameters on the deposition efficiency of the particles on the tumor. The air flow patterns show that the more flow disturbance occurs at the downstream of the tumor as compared to upstream. The results show that the maximum aerosol deposition on the tumor occurs at 60 L/min inhalation rate for 5 to 10 micron aerosol-particles size. The findings will be useful to maximize therapeutic benefit of respiratory drug delivery. Keywords: Human Airway model; Tumorous trachea; Aerosol-Particle Deposition; Computational Fluid Dynamics (CFD); Drug delivery. Modelling and Analysis of TCP Congestion Control Mechanisms Using Stochastic Reward Netsby Osama Younes Abstract: Modelling of congestion control mechanisms of Transmission Control Protocol (TCP) helps to obtain parametric results that help to better understand the TCP behaviour under different operating conditions. Several analytical models were proposed to analyse the behaviour of TCP congestion control mechanisms. However, most of these models were designed for a few TCP sessions with non-persistent connections. A few analytical studies were presented for modelling persistent TCP connections. Nevertheless, these studies have many limiting assumptions and are not scalable. In this work, a stochastic reward nets model is introduced for the TCP Reno with persistent TCP connections, which share two bottleneck links in a wide area network. A microscopic approach was used for constructing the proposed model that captures most features of congestion control mechanisms used by the TCP Reno, and interactions between different TCP sessions. The proposed model relaxed several limiting assumptions adopted by other related models introduced in the literature. To validate the proposed model, analytical results are extensively compared with simulation results. Keywords: performance modelling, Petri Nets, congestion control, TCP performance, TCP Reno Arabic language and Knowledge reduction in Formal Contextsby issam sahmoudi Abstract: Formal Concept Analysis (FCA) is a mathematical tool that offers conceptual data for knowledge representation, extraction and analysis with applications in different areas. One of the main problem of FCA is the computational cost due to the large number of formal concepts generated. The objective of this paper is to address this problem by reducing the knowledge in formal contexts, we propose to use a linguistic approach, and we apply this latter for Arabic language. Objective Performance Evaluations are conducted to assess the efficiency of our proposed method. Keywords: Formal Concept Analysis;Formal Contexts;Knowledge Reduction