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 (60 papers in press)

 

Regular Issues

 

  • Vulnerability Analysis of Interaction-based Supply Chain Network and Its Self-organized Criticality   Order a copy of this article
    by Ren-Bin Xiao, Shanshan Xie, Tinggui Chen 
    Abstract: With the increasing complexity of the supply chain, it brings benefits as well as increasing vulnerability to the supply chain. Research on the cause and characteristic of vulnerability is prerequisite for effective management measures. First, a supply chain network model based on Possion distribution and preference selection mechanism was established, of which the interactions were further studied. On this basis, the cascading failure process of supply chain network was analyzed, and then the impact of supply chain network topology on the system vulnerability and the determination of node vulnerability were further discussed. Finally, an example of certain automotive group supply chain was used to verify the effectiveness and practicality of this method. The study found that the root of supply network vulnerability lies in cascading failure and there is a certain power-law relationship between its scale and frequency, namely supply chain network owns self-organized criticality, which affects the vulnerability of supply chain network. Meanwhile, the node vulnerability assessment method could provide an effective basis for taking preventive measures.
    Keywords: supply chain network; vulnerability; cascading failure; self-organized criticality(SOC)

  • An integrated resilient management approach to emergency logistics based on SOC   Order a copy of this article
    by Liang Geng, Ren-Bin Xiao, Ting-gui Chen 
    Abstract: As supply chain is becoming more vulnerable to disruptions, how to effectively prevent and respond to risks is a hot topic in supply chain management. In this paper, resilience management approach to supply chain risk control is applied, the practical problem of logistics distribution under the emergency environment is taken as an example and the implementation strategy of integrated resilience and its application effect are also discussed. This paper puts forward the integrated resilience management framework, which covers the early prevention, mid-term mitigation and later recovery. And it sets up resilience management mathematical model of logistics distribution and presents details about the implementation process of resilience strategy. The case study verified the effectiveness. Our method provides effective basis for resilience decision, which improves the real time capability and effectiveness of emergency logistics.
    Keywords: Resilience management; emergency logistics; SOC; Ant colony optimization.

  • A Framework for Generating Prioritized Test Scenarios using Firefly Optimization Technique   Order a copy of this article
    by Vikas Panthi, Durga Prasad Mohapatra 
    Abstract: The intention of this research is to generate test scenarios for concurrent and composite states in state machines using Firefly optimization algorithm. We have used state based coverage criterion such as state coverage, transition coverage, transition pair coverage etc. to evaluate the efficiency of our proposed algorithm. The proposed approach is useful for feasible test scenario generation. Generating exhaustive test scenarios for all concurrent interdependent sequences is exponential in size. As a result, in this paper, we find the important test scenarios in presence of concurrency in composite models.
    Keywords: Keywords: Test Scenario; Firefly Optimization Algorithm; State Machine Diagram; Coverage Criterion; Objective Function.

  • Numerical method for solving time-fractional multi-dimensional diffusion equations   Order a copy of this article
    by Amit Prakash, Manoj Kumar 
    Abstract: The key object of the current paper is to demonstrate a numerical technique to find the solution of fractional multi-dimensional diffusion equations that describe density dynamics in a material undergoing diffusion with the help of fractional variation iteration method (FVIM). Fractional variation iteration method is not confined to the minor parameter as usual perturbation method. This technique provides us analytical solution in the form of a convergent series with easily computable components. The advantage of this method over other method is that it does not require any linearization, perturbation and restrictive assumptions.
    Keywords: Fractional variational iteration method; Fractional multi-dimensional diffusion equations; He’s polynomials.

  • Research on Crawling mechanism and policy for crawling product information from Mobile Internet   Order a copy of this article
    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.

  • Special sequences in weighted graphs   Order a copy of this article
    by Sunil Mathew, Jill K. Mathew 
    Abstract: In a weighted graph, the edges are mainly classified into α, β and δ. In this Paper, some sequences in weighted graphs are introduced. These concepts are based on the above classification. Characterizations of partial blocks and partial trees are obtained. It is shown that β sequence of a partial tree is the zero sequence, and α sequence of a partial block is a binary sequence.
    Keywords: graph; tree; sequence; partial block; partial tree.

  • An optimal order a posteriori parameter choice strategy with modified Newton iterative scheme for solving nonlinear ill-posed operator equations   Order a copy of this article
    by Rajan M P, Pradeep D 
    Abstract: Study of inverse problems are interesting and mathematically challenging due to the fact that in most of the situation they are unstable with respect to perturbations of the data. In this paper to solve such operator equations, we propose a modified form of Gauss-Newton method combined with an a posteriori parameter choice strategy with the inexact data. Convergence and the convergence rate results are proven. We consider both a-priori and a-posteriori choice rule of parameter that guarantees the scheme converges to the exact solution. The theoretical results are illustrated through numerical examples and compared with the standard scheme to demonstrate that the scheme is stable and achieves good computational output. The salient features of our proposed scheme are: (i) Convergence analysis and desired convergence rate require only weaker assumptions compared to many assumptions used in the standard scheme in literature; (ii) Consideration of an adaptive and numerically stable a posteriori parameter strategy that gives the same order of convergence as that of an a priori method; (iii) Computation of an optimal order regularization parameter of the order O(δ2/3) using a discrepancy principle.
    Keywords: Nonlinear Ill-posed Problems; Regularization; Iterative Method.
    DOI: 10.1504/IJCSM.2018.10005797
     
  • Block Triangular and Skew Symmetric Splitting Method for Steady State Vector of Linear System of Erogodic Block Circulant Markov Chains   Order a copy of this article
    by Ranadheer Donthi, Rajaiah Dasari, Mallareddy Perati 
    Abstract: In this paper, we determine steady state probability vector (pie) of erogodic block Circulant Markov chain using block triangular and skew symmetric method. The homogeneous system (pie)Q=0 is transformed to the non homogeneous regularized linear system Ax=b, and proved that the matrix A=Q^T+(epsilon)I is positive definite for (epsilon)>0 We applied block triangular and skew symmetric splitting method to compute steady state probability vector of regularized linear system whose coefficient matrix is block circulant stochastic rate matrix. The contraction factor (alpha) minimizes the spectral radius of block iteration matrix of block coefficient matrix A. To improve computing efficiency of the TSS iteration, we employ ITSS iteration. From the numerical results it is clear that the error of TSS iteration method converges rapidly compare to other existing methods.
    Keywords: Circulant stochastic matrices; Steady state probability vector; Block triangular matrix; Block skew symmetric matrix; TSS Method; Convergence analysis.

  • Task Allocation Algorithm for Virtual Design Organization in Agile Industrial Design   Order a copy of this article
    by Gangjun Yang, Xueliang Zhang 
    Abstract: Agile industrial design is a kind of modern industrial design method to deal with the rapid change of market demand. From the perspective of the development trend of industrial design, virtual design organization will be an important form of agile design organizations. Task allocation of organization members is the primary work of agile industrial design practice, and it will involve many complex factors. Innovation as the core of industrial design determines its agility. Firstly, the characteristics of industrial design in agile environment were analyzed in this paper. On the basis of this study, the influencing factors of virtual organization task allocation were discussed, and the task allocation factors for virtual organization were summarized into five aspects, namely, difficulty of innovation, interest degree, ability of comprehensive design, emergency degree of design task, and busy degree of design work. Based on these, the paper focused on the definition of the difficulty coefficient of design exploration, and the calculation method of influencing factors and task allocation algorithm were given, and the results were verified by an example.
    Keywords: Agile industrial design; task allocation algorithm; virtual design organization.

  • Digital equipment maintenance decision model and its application research for low carbon environment   Order a copy of this article
    by Li Renwang, Wu Xinli, Luo Qing, Song Jinyu, Liu Xinxia, Cai Ping 
    Abstract: Abstract:In order to improve the resources and energy efficiency of digital device during the repair process, this paper take selected phase of S layer maintenance mode as device important degree analysis, considering the impact of environment during the repair process, use the modified fuzzy comprehensive evaluation method to describe the various elements of criticality for comprehensive evaluation, establish the digital equipment maintenance decision model for low-carbon environment; combine the qualitative and quantitative analysis to determine the level of membership evaluation factors, use the quasi excellent consistent matrix and variable weight comprehensive to improve the conventional weights, then, select the appropriate comprehensive evaluation model for solving the criticality, use the logic method to determine maintenance mode based on the degree of importance. Finally verify the correctness and practicability of the model by through an example.
    Keywords: Keywords: digital equipment; low carbon environment; maintenance decision.

  • Study on Clustering of Micro-Blog Business Enterprise Users Reputation Based on Web Crawler   Order a copy of this article
    by Meiyu Fang, Qibei Lu 
    Abstract: Micro-blog is a social tool of the new network era. It swept the world with its convenience of usage and real time release of information. PageRank and Hits algorithms are the most widely used method in the evaluation of Micro-Blogs influence. But the two algorithms have the deficiency of poor performance and unrelated to specified keywords. We proposed a Micro-blog enterprise users reputation analysis model based on clustering network and improved PageRank algorithm. The model was simulated with the Sina micro-blog data acquired by web crawler, and the model were compared with Hits and PageRank algorithm. The results show that the model has better convergence and its computational efficiency is superior to the traditional evaluation model based on PageRank or Hits algorithm.
    Keywords: Web crawler; E-commerce; Micro-blog.

  • Modular and homomorphic product of intuitionistic fuzzy graphs and their degree   Order a copy of this article
    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.

  • The structural topology optimization based on parameterized level-set method in Isogeometric analysis   Order a copy of this article
    by Zijun Wu, Shuting Wang 
    Abstract: The Isogeometric analysis(IGA), which establishes a bridge between CAD and CAE, offers a new convenient framework of optimization. This article develops an approach to apply the non-uniform rational basis splines(NURBS) based IGA to the topology optimization using parameterized level set method. Here, the objective function is evaluated according to the basis function of NURBS and the level set function is constructed through collocation points using the compactly supported radial basis function. To evaluate the equivalent strain energy for each elements, the level-set function value of every node is calculated from the corresponding value of collocation points. We have compared the numerical result accuracy as well as the time cost of the proposed method, and it turns out to be very promising.
    Keywords: Isogeometric analysis; Topology optimization; Level set method; Radial basis functions.

  • Solving Systems of Nonlinear Equations via Conjugate Direction Flower Pollination Algorithm   Order a copy of this article
    by Mohamed Abdelbaset, Ibrahim Hezam 
    Abstract: In this paper, we propose a new hybrid algorithm for solving system of nonlinear equations. The aim of hybridization is to utilize the feature of flower pollination algorithm (FPA) and conjugate direction method CD. conjugate direction flower pollination algorithm (CDFPA) combine the advantages of CD and FPA. The problem of solving nonlinear equations is equivalently changed to the problem of function optimization, and then a solution is obtained by CDFPA. The results show the proposed algorithm has high convergence speed and accuracy for solving nonlinear equations.
    Keywords: Flower pollination algorithm; Meta-heuristics; Optimization; Conjugate direction method; Nonlinear Equations.

  • An encoding and reconstructing method with robust transmission for 3D model topological data over wireless network   Order a copy of this article
    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.

  • The most suitable scheme selection of mechanical product configuration based on multi-objective decision analysis   Order a copy of this article
    by Bo Wei, Renwang Li, Gang Chen 
    Abstract: In the process of mechanical product configuration, if there is more than one feasible scheme, it is required to choose the one which is most consistent with the actual conditions of core enterprise. These actual conditions include cost, quality, delivery time and other factors that are related to the interests of the core enterprise. We propose to find the most suitable scheme from the feasible scheme set by using data envelopment analysis. By comparing the projected variable and the original data, we also know how much improvement can be achieved for a specific scheme. The above algorithm is verified and illustrated using a case study.
    Keywords: carbon footprint; multi-objective decision-making; product configuration; data envelopment analysis.

  • Randomness of Lacunary statistical acceleration convergence of $Gamma^{3}$ over $p-$ metric spaces defined by Orlicz functions   Order a copy of this article
    by Nagarajan Subramanian 
    Abstract: In this article the notion of Randomness of Lacunary statistical acceleration convergence of $Gamma^{3}$ over $p-$ metric spaces defined by sequence of Orlicz has been introduced and some theorems related to that concept have been established using the four dimensional matrix transformations. Author's construction with new definitions and also new statement of theorems of proofs are formulated. rn\textbf{keywords :} analytic sequence, double sequences, $Gamma^{3}$ space, Musielak - Orlicz function, Random $p-$ metric space, Lacunary sequence, Statistical convergence, Converging faster, Converging at the same rate, Acceleration field, triple natural density.
    Keywords: analytic sequence; double sequences; $Gamma^{3}$ space; Musielak - Orlicz function; Random $p-$ metric space; Lacunary sequence; Statistical convergence; Converging faster; Converging at the same rate; Acceleration field; triple natural density.

  • Generalized triple difference of rough intuitionistic statistical convergence in probability of fractional order defined by Musielak-Orlicz function   Order a copy of this article
    by Nagarajan Subramanian 
    Abstract: We generalized the concepts in probability of rough intuitionistic convergence and rough intuitionistic statistically convergence by introducing the generalized difference operator $Delta^{alpha}_{gamma}$ of fractional order, where $alpha$ is a proper fraction and $gamma=left(gamma_{mnk}right)$ is any fixed sequence of nonzero real or complex numbers. We study some properties of this operator and investigate the topological structures of related of triple difference sequence spaces of $chi^{3}_{f}left(Delta^{alpha}_{gamma}x_{mnk}right)$.rnindent The main focus of the present paper is to generalized rough intuitionistic convergence and rough intuitionistic statistical difference of triple difference sequence spaces of $chi^{3}$ and investigate their topological structures as well as some interesting results concerning the operator $Delta^{alpha}_{gamma}.$ rn
    Keywords: analytic sequence; Orlicz function; triple sequences; chi sequence; intuitionistic; statistical convergence,Ces$acute{a}$ro $C_{1,1,1}-$ statistical convergence.

  • Bratu-like equation arising in electrospinning process: a Green's function fixed-point iteration approach   Order a copy of this article
    by Suheil Khuri, Ali Sayfy, Heba Kafri 
    Abstract: The aim of this article is to solve a Bratu-like nonlinear differential equation arising in electrospinning and vibration-electrospinningrn process that was recently introduced by Liu and Wang (2014). Electro-spinning process has been associated to Bratu equation through thermo-electro-hydrodynamics balance equations. The proposed strategy is based on embedding Green's function into Picard's fi xed point iteration scheme. Validation of the novel algorithm is demonstrated through numerical examples which comprise certain selected values of the parameters that appear in the modeled equation.
    Keywords: Bratu-like equation; electrospinning process; Green's functions; fixed-point iterations.

  • Optimisation of dangerous goods transport based on the improved ant colony algorithm   Order a copy of this article
    by Ruichun He, Changxi Ma, Qiang Xiao, Lei Qi 
    Abstract: As the transportation safety problem of dangerous goods becoming more and more important, this paper establishes an optimisation model for the dangerous goods transport based on the improved ant colony algorithm. Firstly, the optimisation model of dangerous goods transport is designed. Secondly, the optimisation algorithm is designed based on the ant colony algorithm and genetic algorithm. Finally, the model and algorithm are verified by a case. The result indicates that the optimisation model and algorithm of dangerous goods transport have an important guiding significance on the safety of dangerous goods transport.
    Keywords: Dangerous goods; Transport; Optimization; Ant colony algorithm.

  • Comparative analysis of selection schemes used in artificial bee colony algorithm   Order a copy of this article
    by Yiwen Zhong, Shihua Zhan, Zejun Zhang, Di Zhong, Hui Zhang 
    Abstract: Artificial bee colony (ABC) algorithm, which has explicit strategies to balance intensification and diversification, is a simple and effective swarm intelligence algorithm for both continuous and combinatorial optimization problems. Selection scheme, which is used by onlooker bees to select employed bees to follow, is an important factor for ABC algorithm to keep good balance between intensification and diversification. In this paper, a normalized fitness function for minimization problem is first proposed for roulette wheel selection, so ABC can still have enough selection pressure in late stage. And then, aim to analyse the effect of different selection schemes, systematic experiments were carried for roulette wheel selection, rank selection, tournament selection, and disruptive selection on a set of benchmark functions with different dimensions and different computation resources. Simulation results show that the suitability of a selection scheme depends not only on the features of benchmark functions and but also on the computation resources used. No selection scheme can always outperform other selection schemes on all benchmark functions.
    Keywords: artificial bee colony; swarm intelligence; selection schemes; normalized fitness function; continuous optimization problem.

  • Analysis of a Two-Unit Automatic Power Factor Controller System with Priority to Inspection over Repair/Replacement   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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 efficiency 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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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   Order a copy of this article
    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 atom–bond 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 atom–bond 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.