International Journal of Engineering, Mathematical and Physical Sciences

BIBD-s for (13, 5, 5), (16, 6, 5) and (21, 6, 4) Possessing Possibly an Automorphism of Order 3

Year: 2009 Volume: 3 Issue: 10 833 - 836 Pages

Abstract: When trying to enumerate all BIBD-s for given parameters, their natural solution space appears to be huge and grows extremely with the number of points of the design. Therefore, constructive enumerations are often carried out by assuming additional constraints on design-s structure, automorphisms being mostly used ones. It remains a hard task to construct designs with trivial automorphism group – those with no additional symmetry – although it is believed that most of the BIBD-s belong to that case. In this paper, very many new designs with parameters 2-(13, 5, 5), 2-(16, 6, 5) and 2-(21, 6, 4) are constructed, assuming an action of an automorphism of order 3. Even more, it was possible to construct millions of such designs with no non-trivial automorphisms.

Transonic Flutter Analysis Using Euler Equation and Reduced Order Modeling Technique

Year: 2011 Volume: 5 Issue: 9 1485 - 1493 Pages

Abstract: A new method identifies coupled fluid-structure system with a reduced set of state variables is presented. Assuming that the structural model is known a priori either from an analysis or a test and using linear transformations between structural and aeroelastic states, it is possible to deduce aerodynamic information from sampled time histories of the aeroelastic system. More specifically given a finite set of structural modes the method extracts generalized aerodynamic force matrix corresponding to these mode shapes. Once the aerodynamic forces are known, an aeroelastic reduced-order model can be constructed in discrete-time, state-space format by coupling the structural model and the aerodynamic system. The resulting reduced-order model is suitable for constant Mach, varying density analysis.

A Dual Method for Solving General Convex Quadratic Programs

Year: 2009 Volume: 3 Issue: 10 828 - 832 Pages

Abstract: In this paper, we present a new method for solving quadratic programming problems, not strictly convex. Constraints of the problem are linear equalities and inequalities, with bounded variables. The suggested method combines the active-set strategies and support methods. The algorithm of the method and numerical experiments are presented, while comparing our approach with the active set method on randomly generated problems.

Geometric Data Structures and Their Selected Applications

Year: 2007 Volume: 1 Issue: 11 546 - 551 Pages

Authors:
Miloš Šeda

Abstract: Finding the shortest path between two positions is a fundamental problem in transportation, routing, and communications applications. In robot motion planning, the robot should pass around the obstacles touching none of them, i.e. the goal is to find a collision-free path from a starting to a target position. This task has many specific formulations depending on the shape of obstacles, allowable directions of movements, knowledge of the scene, etc. Research of path planning has yielded many fundamentally different approaches to its solution, mainly based on various decomposition and roadmap methods. In this paper, we show a possible use of visibility graphs in point-to-point motion planning in the Euclidean plane and an alternative approach using Voronoi diagrams that decreases the probability of collisions with obstacles. The second application area, investigated here, is focused on problems of finding minimal networks connecting a set of given points in the plane using either only straight connections between pairs of points (minimum spanning tree) or allowing the addition of auxiliary points to the set to obtain shorter spanning networks (minimum Steiner tree).

Hybrid Coding for Animated Polygonal Meshes

Year: 2008 Volume: 2 Issue: 12 909 - 916 Pages

Abstract: A new hybrid coding method for compressing animated polygonal meshes is presented. This paper assumes the simplistic representation of the geometric data: a temporal sequence of polygonal meshes for each discrete frame of the animated sequence. The method utilizes a delta coding and an octree-based method. In this hybrid method, both the octree approach and the delta coding approach are applied to each single frame in the animation sequence in parallel. The approach that generates the smaller encoded file size is chosen to encode the current frame. Given the same quality requirement, the hybrid coding method can achieve much higher compression ratio than the octree-only method or the delta-only method. The hybrid approach can represent 3D animated sequences with higher compression factors while maintaining reasonable quality. It is easy to implement and have a low cost encoding process and a fast decoding process, which make it a better choice for real time application.

The Practical MFCAV Riemann Solver is Applied to a New Cell-centered Lagrangian Method

Year: 2011 Volume: 5 Issue: 5 764 - 773 Pages

Abstract: The MFCAV Riemann solver is practically used in many Lagrangian or ALE methods due to its merit of sharp shock profiles and rarefaction corners, though very often with numerical oscillations. By viewing it as a modification of the WWAM Riemann solver, we apply the MFCAV Riemann solver to the Lagrangian method recently developed by Maire. P. H et. al.. The numerical experiments show that the application is successful in that the shock profiles and rarefaction corners are sharpened compared with results obtained using other Riemann solvers. Though there are still numerical oscillations, they are within the range of the MFCAV applied in onther Lagrangian methods.

Interactive Concept-based Search using MOEA:The Hierarchical Preferences Case

Year: 2007 Volume: 1 Issue: 12 592 - 597 Pages

Abstract: An IEC technique is described for a multi-objective search of conceptual solutions. The survivability of solutions is influenced by both model-based fitness and subjective human preferences. The concepts- preferences are articulated via a hierarchy of sub-concepts. The suggested method produces an objectivesubjective front. Academic example is employed to demonstrate the proposed approach.

Solution of Density Dependent Nonlinear Reaction-Diffusion Equation Using Differential Quadrature Method

Year: 2010 Volume: 4 Issue: 5 569 - 574 Pages

Authors:
Gülnihal Meral

Abstract: In this study, the density dependent nonlinear reactiondiffusion equation, which arises in the insect dispersal models, is solved using the combined application of differential quadrature method(DQM) and implicit Euler method. The polynomial based DQM is used to discretize the spatial derivatives of the problem. The resulting time-dependent nonlinear system of ordinary differential equations(ODE-s) is solved by using implicit Euler method. The computations are carried out for a Cauchy problem defined by a onedimensional density dependent nonlinear reaction-diffusion equation which has an exact solution. The DQM solution is found to be in a very good agreement with the exact solution in terms of maximum absolute error. The DQM solution exhibits superior accuracy at large time levels tending to steady-state. Furthermore, using an implicit method in the solution procedure leads to stable solutions and larger time steps could be used.

The RK1GL2X3 Method for Initial Value Problems in Ordinary Differential Equations

Year: 2010 Volume: 4 Issue: 1 92 - 94 Pages

Authors:
J.S.C. Prentice

Abstract: The RK1GL2X3 method is a numerical method for solving initial value problems in ordinary differential equations, and is based on the RK1GL2 method which, in turn, is a particular case of the general RKrGLm method. The RK1GL2X3 method is a fourth-order method, even though its underlying Runge-Kutta method RK1 is the first-order Euler method, and hence, RK1GL2X3 is considerably more efficient than RK1. This enhancement is achieved through an implementation involving triple-nested two-point Gauss- Legendre quadrature.

Knowledge Acquisition for the Construction of an Evolving Ontology: Application to Augmented Surgery

Year: 2009 Volume: 3 Issue: 4 263 - 268 Pages

Abstract: This work concerns the evolution and the maintenance of an ontological resource in relation with the evolution of the corpus of texts from which it had been built. The knowledge forming a text corpus, especially in dynamic domains, is in continuous evolution. When a change in the corpus occurs, the domain ontology must evolve accordingly. Most methods manage ontology evolution independently from the corpus from which it is built; in addition, they treat evolution just as a process of knowledge addition, not considering other knowledge changes. We propose a methodology for managing an evolving ontology from a text corpus that evolves over time, while preserving the consistency and the persistence of this ontology. Our methodology is based on the changes made on the corpus to reflect the evolution of the considered domain - augmented surgery in our case. In this context, the results of text mining techniques, as well as the ARCHONTE method slightly modified, are used to support the evolution process.

Speech Enhancement Using Kalman Filter in Communication

Year: 2014 Volume: 8 Issue: 3 488 - 493 Pages

Authors:
Eng. Alaa K. Satti Salih

Abstract: Revolutions Applications such as telecommunications, hands-free communications, recording, etc. which need at least one microphone, the signal is usually infected by noise and echo. The important application is the speech enhancement, which is done to remove suppressed noises and echoes taken by a microphone, beside preferred speech. Accordingly, the microphone signal has to be cleaned using digital signal processing DSP tools before it is played out, transmitted, or stored. Engineers have so far tried different approaches to improving the speech by get back the desired speech signal from the noisy observations. Especially Mobile communication, so in this paper will do reconstruction of the speech signal, observed in additive background noise, using the Kalman filter technique to estimate the parameters of the Autoregressive Process (AR) in the state space model and the output speech signal obtained by the MATLAB. The accurate estimation by Kalman filter on speech would enhance and reduce the noise then compare and discuss the results between actual values and estimated values which produce the reconstructed signals.

Intuitionistic Fuzzy Points in Semigroups

Year: 2011 Volume: 5 Issue: 3 403 - 408 Pages

Authors:
Sujit Kumar Sardar Manasi Mandal Samit Kumar Majumder

Abstract: The notion of intuitionistic fuzzy sets was introduced by Atanassov as a generalization of the notion of fuzzy sets. Y.B. Jun and S.Z. Song introduced the notion of intuitionistic fuzzy points. In this paper we find some relations between the intuitionistic fuzzy ideals of a semigroup S and the set of all intuitionistic fuzzy points of S.

Statistical Analysis of First Order Plus Dead-time System using Operational Matrix

Year: 2009 Volume: 3 Issue: 12 1090 - 1094 Pages

Abstract: To increase precision and reliability of automatic control systems, we have to take into account of random factors affecting the control system. Thus, operational matrix technique is used for statistical analysis of first order plus time delay system with uniform random parameter. Examples with deterministic and stochastic disturbance are considered to demonstrate the validity of the method. Comparison with Monte Carlo method is made to show the computational effectiveness of the method.

Implicit Two Step Continuous Hybrid Block Methods with Four Off-Steps Points for Solving Stiff Ordinary Differential Equation

Year: 2011 Volume: 5 Issue: 3 399 - 402 Pages

Abstract: In this paper, a self starting two step continuous block hybrid formulae (CBHF) with four Off-step points is developed using collocation and interpolation procedures. The CBHF is then used to produce multiple numerical integrators which are of uniform order and are assembled into a single block matrix equation. These equations are simultaneously applied to provide the approximate solution for the stiff ordinary differential equations. The order of accuracy and stability of the block method is discussed and its accuracy is established numerically.

On Chromaticity of Wheels

Year: 2014 Volume: 8 Issue: 8 1104 - 1107 Pages

Abstract: Let the vertices of a graph such that every two adjacent vertices have different color is a very common problem in the graph theory. This is known as proper coloring of graphs. The possible number of different proper colorings on a graph with a given number of colors can be represented by a function called the chromatic polynomial. Two graphs G and H are said to be chromatically equivalent, if they share the same chromatic polynomial. A Graph G is chromatically unique, if G is isomorphic to H for any graph H such that G is chromatically equivalent to H. The study of chromatically equivalent and chromatically unique problems is called chromaticity. This paper shows that a wheel W12 is chromatically unique.

Numerical Solution for Elliptical Crack with Developing Cusps Subject to Shear Loading

Year: 2011 Volume: 5 Issue: 10 1614 - 1618 Pages

Abstract: This paper study the behavior of the solution at the crack edges for an elliptical crack with developing cusps, Ω in the plane elasticity subjected to shear loading. The problem of finding the resulting shear stress can be formulated as a hypersingular integral equation over Ω and it is then transformed into a similar equation over a circular region, D, using conformal mapping. An appropriate collocation points are chosen on the region D to reduce the hypersingular integral equation into a system of linear equations with (2N+1)(N+1) unknown coefficients, which will later be used in the determination of shear stress intensity factors and maximum shear stress intensity. Numerical solution for the considered problem are compared with the existing asymptotic solution, and displayed graphically. Our results give a very good agreement to the existing asymptotic solutions.

Confidence Intervals for Double Exponential Distribution: A Simulation Approach

Year: 2012 Volume: 6 Issue: 1 61 - 65 Pages

Authors:
M. Alrasheedi

Abstract: The double exponential model (DEM), or Laplace distribution, is used in various disciplines. However, there are issues related to the construction of confidence intervals (CI), when using the distribution.In this paper, the properties of DEM are considered with intention of constructing CI based on simulated data. The analysis of pivotal equations for the models here in comparisons with pivotal equations for normal distribution are performed, and the results obtained from simulation data are presented.

Bounds on the Second Stage Spectral Radius of Graphs

Year: 2009 Volume: 3 Issue: 11 1026 - 1029 Pages

Abstract: Let G be a graph of order n. The second stage adjacency matrix of G is the symmetric n × n matrix for which the ijth entry is 1 if the vertices vi and vj are of distance two; otherwise 0. The sum of the absolute values of this second stage adjacency matrix is called the second stage energy of G. In this paper we investigate a few properties and determine some upper bounds for the largest eigenvalue.

Hopf Bifurcation for a New Chaotic System

Year: 2010 Volume: 4 Issue: 8 1166 - 1169 Pages

Authors:
Kejun Zhuang

Abstract: In this paper, a three dimensional autonomous chaotic system is considered. The existence of Hopf bifurcation is investigated by choosing the appropriate bifurcation parameter. Furthermore, formulas for determining the direction of the Hopf bifurcation and the stability of bifurcating periodic solutions are derived with the help of normal form theory. Finally, a numerical example is given.

Minimal Residual Method for Adaptive Filtering with Finite Termination

Year: 2012 Volume: 6 Issue: 12 1705 - 1708 Pages

Abstract: We present a discussion of three adaptive filtering algorithms well known for their one-step termination property, in terms of their relationship with the minimal residual method. These algorithms are the normalized least mean square (NLMS), Affine Projection algorithm (APA) and the recursive least squares algorithm (RLS). The NLMS is shown to be a result of the orthogonality condition imposed on the instantaneous approximation of the Wiener equation, while APA and RLS algorithm result from orthogonality condition in multi-dimensional minimal residual formulation. Further analysis of the minimal residual formulation for the RLS leads to a triangular system which also possesses the one-step termination property (in exact arithmetic)