International Journal of Engineering, Mathematical and Physical Sciences

Optimization of Fuel Consumption of a Bus used in City Line with Regulation of Driving Characteristics

Year: 2012 Volume: 6 Issue: 1 33 - 39 Pages

Abstract: The fuel cost of the motor vehicle operating on its common route is an important part of the operating cost. Therefore, the importance of the fuel saving is increasing day by day. One of the parameters which improve fuel saving is the regulation of driving characteristics. The number and duration of stop is increased by the heavy traffic load. It is possible to improve the fuel saving with regulation of traffic flow and driving characteristics. The researches show that the regulation of the traffic flow decreases fuel consumption, but it is not enough to improve fuel saving without the regulation of driving characteristics. This study analyses the fuel consumption of two trips of city bus operating on its common route and determines the effect of traffic density and driving characteristics on fuel consumption. Finally it offers some suggestions about regulation of driving characteristics to improve the fuel saving. Fuel saving is determined according to the results obtained from simulation program. When experimental and simulation results are compared, it has been found that the fuel saving was reached up the to 40 percent ratios.

Non-Polynomial Spline Method for the Solution of Problems in Calculus of Variations

Year: 2011 Volume: 5 Issue: 3 354 - 359 Pages

Abstract: In this paper, a numerical solution based on nonpolynomial cubic spline functions is used for finding the solution of boundary value problems which arise from the problems of calculus of variations. This approximation reduce the problems to an explicit system of algebraic equations. Some numerical examples are also given to illustrate the accuracy and applicability of the presented method.

Effects of Material Properties of Warhead Casing on Natural Fragmentation Performance of High Explosive (HE) Warhead

Year: 2011 Volume: 5 Issue: 11 1704 - 1709 Pages

Abstract: This research paper presents numerical studies of the characteristics of warhead fragmentation in terms of initial velocities, spray angles of fragments and fragment mass distribution of high explosive (HE) warhead. The behavior of warhead fragmentation depends on shape and size of warhead, thickness of casing, type of explosive, number and position of detonator, and etc. This paper focuses on the effects of material properties of warhead casing, i.e. failure strain, initial yield and ultimate strength on the characteristics of warhead fragmentation. It was found that initial yield and ultimate strength of casing has minimal effects on the initial velocities and spray angles of fragments. Moreover, a brittle warhead casing with low failure strain tends to produce higher number of fragments with less average fragment mass.

Hull Separation Optimization of Catamaran Unmanned Surface Vehicle Powered with Hydrogen Fuel Cell

Year: 2012 Volume: 6 Issue: 3 278 - 282 Pages

Abstract: This paper presents an optimization of the hull separation, i.e. transverse clearance. The main objective is to identify the feasible speed ranges and find the optimum transverse clearance considering the minimum wave-making resistance. The dimensions and the weight of hardware systems installed in the catamaran structured fuel cell powered USV (Unmanned Surface Vehicle) were considered as constraints. As the CAE (Computer Aided Engineering) platform FRIENDSHIP-Framework was used. The hull surface modeling, DoE (Design of Experiment), Tangent search optimization, tool integration and the process automation were performed by FRIENDSHIP-Framework. The hydrodynamic result was evaluated by XPAN the potential solver of SHIPFLOW.

New DES based on Elliptic Curves

Year: 2010 Volume: 4 Issue: 3 355 - 359 Pages

Abstract: It is known that symmetric encryption algorithms are fast and easy to implement in hardware. Also elliptic curves have proved to be a good choice for building encryption system. Although most of the symmetric systems have been broken, we can create a hybrid system that has the same properties of the symmetric encryption systems and in the same time, it has the strength of elliptic curves in encryption. As DES algorithm is considered the core of all successive symmetric encryption systems, we modified DES using elliptic curves and built a new DES algorithm that is hard to be broken and will be the core for all other symmetric systems.

Harvesting of Kinetic Energy of the Raindrops

Year: 2014 Volume: 8 Issue: 2 252 - 257 Pages

Abstract: This paper presents a methodology to harvest the kinetic energy of the raindrops using piezoelectric devices. In the study 1m×1m PVDF (Polyvinylidene fluoride) piezoelectric membrane, which is fixed by the four edges, is considered for the numerical simulation on deformation of the membrane due to the impact of the raindrops. Then according to the drop size of the rain, the simulation is performed classifying the rainfall types into three categories as light stratiform rain, moderate stratiform rain and heavy thundershower. The impact force of the raindrop is dependent on the terminal velocity of the raindrop, which is a function of raindrop diameter. The results were then analyzed to calculate the harvestable energy from the deformation of the piezoelectric membrane.

Enhanced Traveling Salesman Problem Solving by Genetic Algorithm Technique (TSPGA)

Year: 2008 Volume: 2 Issue: 2 102 - 108 Pages

Abstract: The well known NP-complete problem of the Traveling Salesman Problem (TSP) is coded in genetic form. A software system is proposed to determine the optimum route for a Traveling Salesman Problem using Genetic Algorithm technique. The system starts from a matrix of the calculated Euclidean distances between the cities to be visited by the traveling salesman and a randomly chosen city order as the initial population. Then new generations are then created repeatedly until the proper path is reached upon reaching a stopping criterion. This search is guided by a solution evaluation function.

Adaptation of Iterative Methods to Solve Fuzzy Mathematical Programming Problems

Year: 2008 Volume: 2 Issue: 8 563 - 568 Pages

Abstract: Based on the fuzzy set theory this work develops two adaptations of iterative methods that solve mathematical programming problems with uncertainties in the objective function and in the set of constraints. The first one uses the approach proposed by Zimmermann to fuzzy linear programming problems as a basis and the second one obtains cut levels and later maximizes the membership function of fuzzy decision making using the bound search method. We outline similarities between the two iterative methods studied. Selected examples from the literature are presented to validate the efficiency of the methods addressed.

Parallel Explicit Group Domain Decomposition Methods for the Telegraph Equation

Year: 2011 Volume: 5 Issue: 12 1929 - 1933 Pages

Abstract: In a previous work, we presented the numerical solution of the two dimensional second order telegraph partial differential equation discretized by the centred and rotated five-point finite difference discretizations, namely the explicit group (EG) and explicit decoupled group (EDG) iterative methods, respectively. In this paper, we utilize a domain decomposition algorithm on these group schemes to divide the tasks involved in solving the same equation. The objective of this study is to describe the development of the parallel group iterative schemes under OpenMP programming environment as a way to reduce the computational costs of the solution processes using multicore technologies. A detailed performance analysis of the parallel implementations of points and group iterative schemes will be reported and discussed.

A Hybrid Approach Using Particle Swarm Optimization and Simulated Annealing for N-queen Problem

Year: 2010 Volume: 4 Issue: 7 886 - 890 Pages

Abstract: This paper presents a hybrid approach for solving nqueen problem by combination of PSO and SA. PSO is a population based heuristic method that sometimes traps in local maximum. To solve this problem we can use SA. Although SA suffer from many iterations and long time convergence for solving some problems, By good adjusting initial parameters such as temperature and the length of temperature stages SA guarantees convergence. In this article we use discrete PSO (due to nature of n-queen problem) to achieve a good local maximum. Then we use SA to escape from local maximum. The experimental results show that our hybrid method in comparison of SA method converges to result faster, especially for high dimensions n-queen problems.

Keywords:
PSO
SA
N-queen
CSP

Computational Aspects of Regression Analysis of Interval Data

Year: 2011 Volume: 5 Issue: 9 1466 - 1473 Pages

Authors:
Michal Cerny

Abstract: We consider linear regression models where both input data (the values of independent variables) and output data (the observations of the dependent variable) are interval-censored. We introduce a possibilistic generalization of the least squares estimator, so called OLS-set for the interval model. This set captures the impact of the loss of information on the OLS estimator caused by interval censoring and provides a tool for quantification of this effect. We study complexity-theoretic properties of the OLS-set. We also deal with restricted versions of the general interval linear regression model, in particular the crisp input – interval output model. We give an argument that natural descriptions of the OLS-set in the crisp input – interval output cannot be computed in polynomial time. Then we derive easily computable approximations for the OLS-set which can be used instead of the exact description. We illustrate the approach by an example.

Topological Properties of an Exponential Random Geometric Graph Process

Year: 2011 Volume: 5 Issue: 4 591 - 596 Pages

Authors:
Yilun Shang

Abstract: In this paper we consider a one-dimensional random geometric graph process with the inter-nodal gaps evolving according to an exponential AR(1) process. The transition probability matrix and stationary distribution are derived for the Markov chains concerning connectivity and the number of components. We analyze the algorithm for hitting time regarding disconnectivity. In addition to dynamical properties, we also study topological properties for static snapshots. We obtain the degree distributions as well as asymptotic precise bounds and strong law of large numbers for connectivity threshold distance and the largest nearest neighbor distance amongst others. Both exact results and limit theorems are provided in this paper.

A New Heuristic Statistical Methodology for Optimizing Queuing Networks Using Discreet Event Simulation

Year: 2011 Volume: 5 Issue: 9 1462 - 1465 Pages

Authors:
Mohamad Mahdavi

Abstract: Most of the real queuing systems include special properties and constraints, which can not be analyzed directly by using the results of solved classical queuing models. Lack of Markov chains features, unexponential patterns and service constraints, are the mentioned conditions. This paper represents an applied general algorithm for analysis and optimizing the queuing systems. The algorithm stages are described through a real case study. It is consisted of an almost completed non-Markov system with limited number of customers and capacities as well as lots of common exception of real queuing networks. Simulation is used for optimizing this system. So introduced stages over the following article include primary modeling, determining queuing system kinds, index defining, statistical analysis and goodness of fit test, validation of model and optimizing methods of system with simulation.

Anti-Homomorphism in Fuzzy Ideals

Year: 2010 Volume: 4 Issue: 8 1137 - 1140 Pages

Abstract: The anti-homomorphic image of fuzzy ideals, fuzzy ideals of near-rings and anti ideals are discussed in this note. A necessary and sufficient condition has been established for near-ring anti ideal to be characteristic.

On a New Numerical Analysis for the Symmetric Shortest Queue Problem

Year: 2012 Volume: 6 Issue: 8 974 - 982 Pages

Abstract: We consider a network of two M/M/1 parallel queues having the same poisonnian arrival stream with rate λ. Upon his arrival to the system a customer heads to the shortest queue and stays until being served. If the two queues have the same length, an arriving customer chooses one of the two queues with the same probability. Each duration of service in the two queues is an exponential random variable with rate μ and no jockeying is permitted between the two queues. A new numerical method, based on linear programming and convex optimization, is performed for the computation of the steady state solution of the system.

Adaptive Functional Projective Lag Synchronization of Lorenz System

Year: 2009 Volume: 3 Issue: 12 1087 - 1089 Pages

Abstract: This paper addresses functional projective lag synchronization of Lorenz system with four unknown parameters, where the output of the master system lags behind the output of the slave system proportionally. For this purpose, an adaptive control law is proposed to make the states of two identical Lorenz systems asymptotically synchronize up. Based on Lyapunov stability theory, a novel criterion is given for asymptotical stability of the null solution of an error dynamics. Finally, some numerical examples are provided to show the effectiveness of our results.

Keywords:
Adaptive function projective synchronization
Chaotic system
Lag synchronization
Lyapunov method

Exponential Stability Analysis for Switched Cellular Neural Networks with Time-varying Delays and Impulsive Effects

Year: 2010 Volume: 4 Issue: 8 1130 - 1136 Pages

Abstract: In this Letter, a class of impulsive switched cellular neural networks with time-varying delays is investigated. At the same time, parametric uncertainties assumed to be norm bounded are considered. By dividing the network state variables into subgroups according to the characters of the neural networks, some sufficient conditions guaranteeing exponential stability for all admissible parametric uncertainties are derived via constructing appropriate Lyapunov functional. One numerical example is provided to illustrate the validity of the main results obtained in this paper.

Second Order Admissibilities in Multi-parameter Logistic Regression Model

Year: 2012 Volume: 6 Issue: 9 1276 - 1280 Pages

Abstract: In multi-parameter family of distributions, conditions for a modified maximum likelihood estimator to be second order admissible are given. Applying these results to the multi-parameter logistic regression model, it is shown that the maximum likelihood estimator is always second order inadmissible. Also, conditions for the Berkson estimator to be second order admissible are given.

Using Memetic Algorithms for the Solution of Technical Problems

Year: 2009 Volume: 3 Issue: 11 966 - 971 Pages

Abstract: The intention of this paper is, to help the user of evolutionary algorithms to adapt them easier to their problem at hand. For a lot of problems in the technical field it is not necessary to reach an optimum solution, but to reach a good solution in time. In many cases the solution is undetermined or there doesn-t exist a method to determine the solution. For these cases an evolutionary algorithm can be useful. This paper intents to give the user rules of thumb with which it is easier to decide if the problem is suitable for an evolutionary algorithm and how to design them.

Radiation Safety of Population in the Region of NPP-2006/MIR-1200 Site

Year: 2013 Volume: 7 Issue: 3 343 - 345 Pages

Abstract: The main features of NPP-2006/MIR-1200 design are described. Estimation of individual doses for population under normal operation and accident conditions is performed for Leningradskaya NPP – 2 as an example. The radiation effect on population and environment doesn-t exceed the established normative limit and is as low as reasonably achievable. NPP- 2006/MIR-1200 design meets all Russian and international requirements for power units under construction.