2022-06-29T18:26:34Z http://ijm2c.iauctb.ac.ir/?_action=export&rf=summon&issue=112383
2014-03-21 10.30495
International Journal of Mathematical Modelling & Computations 2228-6225 2228-6225 2014 4 2 (SPRING) MATHEMATICAL ANALYSIS OF NEWLY DESIGNED TWO POROUS LAYERS SLIDER BEARING WITH A CONVEX PAD UPPER SURFACE CONSIDERING SLIP AND SQUEEZE VELOCITY USING FERROFLUID LUBRICANT Rajesh Shah Ramesh C. Kataria This paper proposes mathematical modeling and analysis of ferrofluid lubricated newly designed slider bearing having convex pad (surface or plate) stator with two porous layers attached to the slider. The problem considers the effect of slip velocity proposed by Sparrow et. al. and modified by Shah et. al. at the film-porous interface. The squeeze velocity V=−which appears when the upper impermeable plate approach to the lower one, is also considered here for study. The magnetic field is assumed to be oblique to the lower plate. From the Reynolds’s equation of the above model, expressions for dimensionless form of pressure and load carrying capacity are obtained. The expression for the dimensionless load carrying capacity is then solved numerically to examine its possible effect on the designed bearing system   Ferrofluid Squeeze velocity Porosity Lubrication Slip Velocity Convex bearing 2014 03 21 93 101 http://ijm2c.iauctb.ac.ir/article_521853_f1bca9b4042f898412e7c334ff5d6cb9.pdf
2014-03-21 10.30495
International Journal of Mathematical Modelling & Computations 2228-6225 2228-6225 2014 4 2 (SPRING) SOLVING BLASIUS EQUATION USING IMPERIALIST COMPETITIVE ALGORITHM Hossein Towsyfyan In this study, a new approach isintroduced to solve Blasius differential equation using of ImperialistCompetitive Algorithm (ICA). This algorithm is inspired by competitionmechanism among Imperialists and colonies and has demonstrated excellent capabilitiessuch as simplicity, accuracy, faster convergence and better global optimumachievement in contrast to other evolutionary algorithms. The obtained results havebeen compared with the exact solution of Blasius equation and another resultobtained in previous works and showhigher accuracy and less computational requirements. Inaddition, the method presented with details can beeasily extended to solve a wide range of nonlinear problems.   2014 03 21 103 114 http://ijm2c.iauctb.ac.ir/article_521854_dadd648e7b67f44c8e34556c9040bb5a.pdf
2014-03-21 10.30495
International Journal of Mathematical Modelling & Computations 2228-6225 2228-6225 2014 4 2 (SPRING) THE COMPARISON OF TWO METHOD NONPARAMETRIC APPROACH ON SMALL AREA ESTIMATION (CASE: APPROACH WITH KERNEL METHODS AND LOCAL POLYNOMIAL REGRESSION) Dewi Ratnaningsih Small Area estimation is a technique used to estimate parameters of subpopulations with small sample sizes.  Small area estimation is needed  in obtaining information on a small area, such as sub-district or village.  Generally, in some cases, small area estimation uses parametric modeling.  But in fact, a lot of models have no linear relationship between the small area average and the covariate. This problem requires a non-parametric approach to solve, such asKernel approach and Local Polynomial Regression (LPR). The purpose of this study is comparing the results of small area estimation using Kernel approach and LPR. Data used in this study are generated by simulation results using R language . Simulation data obtained by generating function m (x) are linear and quadratic pattern. The criteria used to compare the results of the simulation are Absolute Relative Bias (ARB), Mean Square Error (MSE), Generalized Cross Validation (GCV), and risk factors. The simulation results showed: 1) Kernel gives smaller relative bias than LPR does on both  linear and quadratic data pattern. The relative bias obtained by Kernel tends to be more stable and consistent than the relative bias resulted by LPR, (2) the Kernel MSE is smaller than the LPR MSE either on linear or quadratic pattern in any combination treatment, (3) the value of GCV and the risk factors in Kernel are smaller than these in LPR in any combination of the simulated data patterns, (4) on non parametric data, for both linear data pattern and quadratic data pattern, Kernel methods provide better estimation compared to LPR.   2014 03 21 115 123 http://ijm2c.iauctb.ac.ir/article_521855_c95b7c0bf41552e40bb3eb23acaf8817.pdf
2014-03-21 10.30495
International Journal of Mathematical Modelling & Computations 2228-6225 2228-6225 2014 4 2 (SPRING) CONSTANT STRESS ACCELERATED LIFE TESTING DESIGNWITH TYPE-II CENSORING SCHEME FOR PARETO DISTRIBUTION USING GEOMETRIC PROCESS Mustafa Kamal In many of the studies concerning Accelerated life testing (ALT), the log linear function between life and stress which is just a simple re-parameterization of the original parameter of the life distribution is used to obtain the estimates of original parameters but from the statistical point of view, it is preferable to work with the original parameters instead of developing inferences for the parameters of the log-linear link function. In this paper the geometric process is used to estimate the parameters of Pareto Distribution with type-II censored data in constant stress accelerated life testing. Assuming that the lifetimes under increasing stress levels form a geometric process, estimates of the parameters are obtained by using the maximum likelihood method. In addition, asymptotic confidence interval estimates of the parameters using Fisher information matrix are also obtained. The statistical properties of estimates of the parameters and the confidence intervals are illustrated by a Simulation study.   Maximum Likelihood Estimation Reliability Function Fisher Information Matrix Asymptotic Confidence Interval Simulation study 2014 03 21 125 134 http://ijm2c.iauctb.ac.ir/article_521856_903dbdcffa57bc38f6406fbb1a19aa64.pdf
2014-03-21 10.30495
International Journal of Mathematical Modelling & Computations 2228-6225 2228-6225 2014 4 2 (SPRING) MATHEMATICAL MODELLING FOR DICE FINDER GAME PROBLEM Sanjay Jain Play is often episodic and mission-centric, with a series of challenges culminating in a final puzzle or enemy that must be overcome. Multiple missions played with the same characters may be related to each other in a plot arc of escalating challenges. The exact tone, structure, pace and end (if any) vary from game to game depending on the needs and preferences of the players, as in . "THE CHANCE ELEMENT in thousands of indoor games is introduced by a variety of simple random-number generators. The most popular of such devices, ever since the time of ancient Egypt, have been cubical Dice. Cubical, Because of their symmetry, any of the five regular solids can be and have been used as gaming dice, but the cube has certain obvious advantages over the other four solids. It is the easiest to make, its six sides accommodate a set of numbers neither too large nor too small, and it rolls easily enough but not too easily", as in , . In our proposed Dice Finder game problem, user can see the different dice number's on screen from 1 to 6. Using the property of Dice that “Opposite sides of a dice add up to seven”, user has to find that correct number of dice out all of that, for which one condition is true.   Dice Die Fair dice Tabletop role-playing game Dice finder 2014 03 21 135 150 http://ijm2c.iauctb.ac.ir/article_521857_2bd8a9258768eb92e3c192c3c488394a.pdf
2014-03-21 10.30495
International Journal of Mathematical Modelling & Computations 2228-6225 2228-6225 2014 4 2 (SPRING) FINITE POPULATION SINGLE SERVER BATCH SERVICE QUEUE WITH COMPULSORY SERVER VACATION Rathinasabapathy Kalyanaraman R. Mahalakshmi A single server finite population queueing model with compulsory server vacation and with fixed batch service has been considered. For this model the system steady state probabilities are obtained. Some performance measures are calculated and numerical examples are also given.   Finite source queue-Fixed batch size-Compulsory server vacation-Supplementary variable technique-Steady state probabilities-Performancemeasures 2014 03 21 151 165 http://ijm2c.iauctb.ac.ir/article_521858_22fa298d004819c840efd155cb918747.pdf
2014-03-21 10.30495
International Journal of Mathematical Modelling & Computations 2228-6225 2228-6225 2014 4 2 (SPRING) MODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS Deepak C. Pandey Arun K. Pal Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained. The effect of jumping mechanism is analysed which clearly shows that the queuing system provides better results when the fraction of class-1 arrivals in the overall traffic mix is small.   Discrete-time queuing theory priority scheduling generating functions delay analysis 2014 03 21 167 176 http://ijm2c.iauctb.ac.ir/article_521859_bda6332ed5bea145aa094cab803163f6.pdf
2014-03-21 10.30495
International Journal of Mathematical Modelling & Computations 2228-6225 2228-6225 2014 4 2 (SPRING) SOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM Saber Molla-Alizadeh-Zavardehi Masoud Sanei Reza Soltani Ali Mahmoodirad In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For comparing GA and MA, twenty eight problems with different specifics have been generated at random and then the quality of the proposed algorithms was evaluated using the relative percentage deviation (RPD) method. Finally, based on RPD method, we investigate the impact of increasing the problem size on the performance of our proposed algorithms.   Step Fixed Charge Transportation Problems Genetic Algorithm Memetic Algorithm Spanning Tree 2014 03 21 177 187 http://ijm2c.iauctb.ac.ir/article_521860_f96058ef7dd64aa46b38bf805adf7c79.pdf