International Journal of Engineering, Mathematical and Physical Sciences

Investigation on Bio-Inspired Population Based Metaheuristic Algorithms for Optimization Problems in Ad Hoc Networks

Year: 2015 Volume: 9 Issue: 3 152 - 159 Pages

Abstract: Nature is a great source of inspiration for solving complex problems in networks. It helps to find the optimal solution. Metaheuristic algorithm is one of the nature-inspired algorithm which helps in solving routing problem in networks. The dynamic features, changing of topology frequently and limited bandwidth make the routing, challenging in MANET. Implementation of appropriate routing algorithms leads to the efficient transmission of data in mobile ad hoc networks. The algorithms that are inspired by the principles of naturally-distributed/collective behavior of social colonies have shown excellence in dealing with complex optimization problems. Thus some of the bio-inspired metaheuristic algorithms help to increase the efficiency of routing in ad hoc networks. This survey work presents the overview of bio-inspired metaheuristic algorithms which support the efficiency of routing in mobile ad hoc networks.

The Optimization of Decision Rules in Multimodal Decision-Level Fusion Scheme

Year: 2015 Volume: 9 Issue: 3 148 - 151 Pages

Abstract: This paper introduces an original method of parametric optimization of the structure for multimodal decisionlevel fusion scheme which combines the results of the partial solution of the classification task obtained from assembly of the mono-modal classifiers. As a result, a multimodal fusion classifier which has the minimum value of the total error rate has been obtained.

A Hybrid Method for Determination of Effective Poles Using Clustering Dominant Pole Algorithm

Year: 2015 Volume: 9 Issue: 3 143 - 147 Pages

Abstract: In this paper, an analysis of some model order reduction techniques is presented. A new hybrid algorithm for model order reduction of linear time invariant systems is compared with the conventional techniques namely Balanced Truncation, Hankel Norm reduction and Dominant Pole Algorithm (DPA). The proposed hybrid algorithm is known as Clustering Dominant Pole Algorithm (CDPA), is able to compute the full set of dominant poles and its cluster center efficiently. The dominant poles of a transfer function are specific eigenvalues of the state space matrix of the corresponding dynamical system. The effectiveness of this novel technique is shown through the simulation results.

The Study of Relative Efficiency in Growth Curve Model

Year: 2014 Volume: 8 Issue: 10 1381 - 1384 Pages

Abstract: In this paper, some relative efficiency have been discussed, including the LSE estimate with respect to BLUE in curve model. Four new kinds of relative efficiency have defined, and their upper bounds have been discussed.

Mathematical Modeling of Cell Volume Alterations under Different Osmotic Conditions

Year: 2014 Volume: 8 Issue: 8 1164 - 1168 Pages

Abstract: Cell volume, together with membrane potential and intracellular hydrogen ion concentration, is an essential biophysical parameter for normal cellular activity. Cell volumes can be altered by osmotically active compounds and extracellular tonicity. In this study, a simple mathematical model of osmotically induced cell swelling and shrinking is presented. Emphasis is given to water diffusion across the membrane. The mathematical description of the cellular behavior consists in a system of coupled ordinary differential equations. We compare experimental data of cell volume alterations driven by differences in osmotic pressure with mathematical simulations under hypotonic and hypertonic conditions. Implications for a future model are also discussed.

Exploring Solutions in Extended Horava-Lifshitz Gravity

Year: 2015 Volume: 9 Issue: 2 94 - 97 Pages

Abstract: In this letter, we explore exact solutions for the Horava-Lifshitz gravity. We use of an extension of this theory with first order dynamical lapse function. The equations of motion have been derived in a fully consistent scenario. We assume that there are some spherically symmetric families of exact solutions of this extended theory of gravity. We obtain exact solutions and investigate the singularity structures of these solutions. Specially, an exact solution with the regular horizon is found.

Operational Representation of Certain Hypergeometric Functions by Means of Fractional Derivatives and Integrals

Year: 2014 Volume: 8 Issue: 10 1375 - 1380 Pages

Abstract: The investigation in the present paper is to obtain certain types of relations for the well known hypergeometric functions by employing the technique of fractional derivative and integral.

An Alternative Proof for the Topological Entropy of the Motzkin Shift

Year: 2015 Volume: 9 Issue: 2 90 - 93 Pages

Abstract: A Motzkin shift is a mathematical model for constraints on genetic sequences. In terms of the theory of symbolic dynamics, the Motzkin shift is nonsofic, and therefore, we cannot use the Perron- Frobenius theory to calculate its topological entropy. The Motzkin shift M(M,N) which comes from language theory, is defined to be the shift system over an alphabet A that consists of N negative symbols, N positive symbols and M neutral symbols. For an x in the full shift, x will be in the Motzkin subshift M(M,N) if and only if every finite block appearing in x has a non-zero reduced form. Therefore, the constraint for x cannot be bounded in length. K. Inoue has shown that the entropy of the Motzkin shift M(M,N) is log(M + N + 1). In this paper, a new direct method of calculating the topological entropy of the Motzkin shift is given without any measure theoretical discussion.

Robust ANOVA: An Illustrative Study in Horticultural Crop Research

Year: 2015 Volume: 9 Issue: 2 85 - 89 Pages

Abstract: An attempt has been made in the present communication to elucidate the efficacy of robust ANOVA methods to analyse horticultural field experimental data in the presence of outliers. Results obtained fortify the use of robust ANOVA methods as there was substantiate reduction in error mean square, and hence the probability of committing Type I error, as compared to the regular approach.

Yang-Lee Edge Singularity of the Infinite-Range Ising Model

Year: 2015 Volume: 9 Issue: 2 80 - 84 Pages

Authors:
Seung-Yeon Kim

Abstract: The Ising ferromagnet, consisting of magnetic spins, is the simplest system showing phase transitions and critical phenomena at finite temperatures. The Ising ferromagnet has played a central role in our understanding of phase transitions and critical phenomena. Also, the Ising ferromagnet explains the gas-liquid phase transitions accurately. In particular, the Ising ferromagnet in a nonzero magnetic field has been one of the most intriguing and outstanding unsolved problems. We study analytically the partition function zeros in the complex magnetic-field plane and the Yang-Lee edge singularity of the infinite-range Ising ferromagnet in an external magnetic field. In addition, we compare the Yang-Lee edge singularity of the infinite-range Ising ferromagnet with that of the square-lattice Ising ferromagnet in an external magnetic field.

The Evaluation of the Performance of Different Filtering Approaches in Tracking Problem and the Effect of Noise Variance

Year: 2014 Volume: 8 Issue: 10 1369 - 1374 Pages

Abstract: Performance of different filtering approaches depends on modeling of dynamical system and algorithm structure. For modeling and smoothing the data the evaluation of posterior distribution in different filtering approach should be chosen carefully. In this paper different filtering approaches like filter KALMAN, EKF, UKF, EKS and smoother RTS is simulated in some trajectory tracking of path and accuracy and limitation of these approaches are explained. Then probability of model with different filters is compered and finally the effect of the noise variance to estimation is described with simulations results.

Multi Objective Simultaneous Assembly Line Balancing and Buffer Sizing

Year: 2015 Volume: 9 Issue: 1 63 - 70 Pages

Abstract: Assembly line balancing problem is aimed to divide the tasks among the stations in assembly lines and optimize some objectives. In assembly lines the workload on stations is different from each other due to different tasks times and the difference in workloads between stations can cause blockage or starvation in some stations in assembly lines. Buffers are used to store the semi-finished parts between the stations and can help to smooth the assembly production. The assembly line balancing and buffer sizing problem can affect the throughput of the assembly lines. Assembly line balancing and buffer sizing problems have been studied separately in literature and due to their collective contribution in throughput rate of assembly lines, balancing and buffer sizing problem are desired to study simultaneously and therefore they are considered concurrently in current research. Current research is aimed to maximize throughput, minimize total size of buffers in assembly line and minimize workload variations in assembly line simultaneously. A multi objective optimization objective is designed which can give better Pareto solutions from the Pareto front and a simple example problem is solved for assembly line balancing and buffer sizing simultaneously. Current research is significant for assembly line balancing research and it can be significant to introduce optimization approaches which can optimize current multi objective problem in future.

Parameters Estimation of Multidimensional Possibility Distributions

Year: 2015 Volume: 9 Issue: 2 76 - 79 Pages

Abstract: We present a solution to the Maxmin u/E parameters estimation problem of possibility distributions in m-dimensional case. Our method is based on geometrical approach, where minimal area enclosing ellipsoid is constructed around the sample. Also we demonstrate that one can improve results of well-known algorithms in fuzzy model identification task using Maxmin u/E parameters estimation.

Solving Linear Matrix Equations by Matrix Decompositions

Year: 2014 Volume: 8 Issue: 11 1426 - 1429 Pages

Abstract: In this paper, a system of linear matrix equations is considered. A new necessary and sufficient condition for the consistency of the equations is derived by means of the generalized singular-value decomposition, and the explicit representation of the general solution is provided.

Keywords:
Matrix equation
Generalized inverse
Generalized singular-value decomposition.

A Further Study on the 4-Ordered Property of Some Chordal Ring Networks

Year: 2015 Volume: 9 Issue: 1 59 - 62 Pages

Abstract: Given a graph G. A cycle of G is a sequence of vertices of G such that the first and the last vertices are the same. A hamiltonian cycle of G is a cycle containing all vertices of G. The graph G is k-ordered (resp. k-ordered hamiltonian) if for any sequence of k distinct vertices of G, there exists a cycle (resp. hamiltonian cycle) in G containing these k vertices in the specified order. Obviously, any cycle in a graph is 1-ordered, 2-ordered and 3- ordered. Thus the study of any graph being k-ordered (resp. k-ordered hamiltonian) always starts with k = 4. Most studies about this topic work on graphs with no real applications. To our knowledge, the chordal ring families were the first one utilized as the underlying topology in interconnection networks and shown to be 4-ordered. Furthermore, based on our computer experimental results, it was conjectured that some of them are 4-ordered hamiltonian. In this paper, we intend to give some possible directions in proving the conjecture.

Central Finite Volume Methods Applied in Relativistic Magnetohydrodynamics: Applications in Disks and Jets

Year: 2015 Volume: 9 Issue: 1 48 - 58 Pages

Abstract: We have developed a new computer program in Fortran 90, in order to obtain numerical solutions of a system of Relativistic Magnetohydrodynamics partial differential equations with predetermined gravitation (GRMHD), capable of simulating the formation of relativistic jets from the accretion disk of matter up to his ejection. Initially we carried out a study on numerical methods of unidimensional Finite Volume, namely Lax-Friedrichs, Lax-Wendroff, Nessyahu-Tadmor method and Godunov methods dependent on Riemann problems, applied to equations Euler in order to verify their main features and make comparisons among those methods. It was then implemented the method of Finite Volume Centered of Nessyahu-Tadmor, a numerical schemes that has a formulation free and without dimensional separation of Riemann problem solvers, even in two or more spatial dimensions, at this point, already applied in equations GRMHD. Finally, the Nessyahu-Tadmor method was possible to obtain stable numerical solutions - without spurious oscillations or excessive dissipation - from the magnetized accretion disk process in rotation with respect to a central black hole (BH) Schwarzschild and immersed in a magnetosphere, for the ejection of matter in the form of jet over a distance of fourteen times the radius of the BH, a record in terms of astrophysical simulation of this kind. Also in our simulations, we managed to get substructures jets. A great advantage obtained was that, with the our code, we got simulate GRMHD equations in a simple personal computer.

Optimization of Flexible Job Shop Scheduling Problem with Sequence Dependent Setup Times Using Genetic Algorithm Approach

Year: 2015 Volume: 9 Issue: 1 42 - 47 Pages

Abstract: This paper presents optimization of makespan for ‘n’ jobs and ‘m’ machines flexible job shop scheduling problem with sequence dependent setup time using genetic algorithm (GA) approach. A restart scheme has also been applied to prevent the premature convergence. Two case studies are taken into consideration. Results are obtained by considering crossover probability (pc = 0.85) and mutation probability (pm = 0.15). Five simulation runs for each case study are taken and minimum value among them is taken as optimal makespan. Results indicate that optimal makespan can be achieved with more than one sequence of jobs in a production order.

An Output Oriented Super-Efficiency Model for Considering Time Lag Effect

Year: 2015 Volume: 9 Issue: 1 38 - 41 Pages

Abstract: There exists some time lag between the consumption of inputs and the production of outputs. This time lag effect should be considered in calculating efficiency of decision making units (DMU). Recently, a couple of DEA models were developed for considering time lag effect in efficiency evaluation of research activities. However, these models can’t discriminate efficient DMUs because of the nature of basic DEA model in which efficiency scores are limited to ‘1’. This problem can be resolved a super-efficiency model. However, a super efficiency model sometimes causes infeasibility problem. This paper suggests an output oriented super-efficiency model for efficiency evaluation under the consideration of time lag effect. A case example using a long term research project is given to compare the suggested model with the MpO model.

A Simplified Distribution for Nonlinear Seas

Year: 2015 Volume: 9 Issue: 1 34 - 37 Pages

Abstract: The exact theoretical expression describing the probability distribution of nonlinear sea-surface elevations derived from the second-order narrowband model has a cumbersome form that requires numerical computations, not well-disposed to theoretical or practical applications. Here, the same narrowband model is reexamined to develop a simpler closed-form approximation suitable for theoretical and practical applications. The salient features of the approximate form are explored, and its relative validity is verified with comparisons to other readily available approximations, and oceanic data.

Preconditioned Generalized Accelerated Overrelaxation Methods for Solving Certain Nonsingular Linear System

Year: 2014 Volume: 8 Issue: 11 1419 - 1425 Pages

Abstract: In this paper, we present preconditioned generalized accelerated overrelaxation (GAOR) methods for solving certain nonsingular linear system. We compare the spectral radii of the iteration matrices of the preconditioned and the original methods. The comparison results show that the preconditioned GAOR methods converge faster than the GAOR method whenever the GAOR method is convergent. Finally, we give two numerical examples to confirm our theoretical results.