Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (17)
  • Open Access

    ARTICLE

    Non-Linear Localization Algorithm Based on Newton Iterations

    Jianfeng Lu*, Guirong Fei

    Journal on Internet of Things, Vol.2, No.4, pp. 129-134, 2020, DOI:10.32604/jiot.2020.07196

    Abstract In order to improve the performance of time difference of arrival (TDOA) localization, a nonlinear least squares algorithm is proposed in this paper. Firstly, based on the criterion of the minimized sum of square error of time difference of arrival, the location estimation is expressed as an optimal problem of a non-linear programming. Then, an initial point is obtained using the semi-definite programming. And finally, the location is extracted from the local optimal solution acquired by Newton iterations. Simulation results show that when the number of anchor nodes is large, the performance of the proposed algorithm will be significantly better… More >

  • Open Access

    ARTICLE

    Energy Aware Routing Algorithm in Manet Using Linear Programming

    Hany Ramadan1,∗, Ben Bella S. Tawfik2, Alaa El Din M. Riad3

    Computer Systems Science and Engineering, Vol.33, No.6, pp. 421-428, 2018, DOI:10.32604/csse.2018.33.421

    Abstract Mobile ad hoc networks (MANET) are wireless network without infrastructure and suffering from low power battery. Therefore the main objective in finding a route for traffic transfer from a given source to a given destination is to minimize the node energy consumption. This paper solves the problem of finding a route satisfying the main objective of minimum energy consumption and other QoS requirements such as minimum delay and maximum packet delivery ratio by using linear programming technique. Two cases are considered: 1. The traffic amount of a given request is transmitted into single path, and 2. The traffic amount of… More >

  • Open Access

    ABSTRACT

    A combined approach of the MLPG method and nonlinear programming for lower-bound limit analysis

    S. S. Chen1, Y. H. Liu1,2, Z. Z. Cen1

    The International Conference on Computational & Experimental Engineering and Sciences, Vol.11, No.3, pp. 63-64, 2009, DOI:10.3970/icces.2009.011.063

    Abstract In most engineering applications, solutions derived from the lower-bound theorem of plastic limit analysis are particularly valuable because they provide a safe estimate of the load that will cause plastic collapse. A solution procedure based on the meshless local Petrov-Galerkin (MLPG) method is proposed for lower-bound limit analysis. This is the first work for lower-bound limit analysis by this meshless local weak form method. In the construction of trial functions, the natural neighbour interpolation (NNI) is employed to simplify the treatment of the essential boundary conditions. The discretized limit analysis problem is solved numerically with the reduced-basis technique. The self-equilibrium… More >

  • Open Access

    ARTICLE

    Solution of Fully Fuzzy System of Linear Equations by Linear Programming Approach

    Diptiranjan Behera1,2, Hong-Zhong Huang1, S. Chakraverty3

    CMES-Computer Modeling in Engineering & Sciences, Vol.108, No.2, pp. 67-87, 2015, DOI:10.3970/cmes.2015.108.067

    Abstract Fuzzy systems of linear equations play a vital role in various applications of engineering, science and finance problems. This paper proposes a new method for solving Fully Fuzzy System of Linear Equations (FFSLE) using the linear programming problem approach. There is no restriction on the elements of coefficient matrix. The proposed method is able to solve the system, when the elements of the fuzzy unknown vector are both non-negative and non-positive. Triangular convex normalized fuzzy sets are considered for the present analysis. Known example problems are solved and compared with the results of existing methods to illustrate the efficacy and… More >

  • Open Access

    ARTICLE

    New Optimization Algorithms for Structural Reliability Analysis

    S.R. Santos1, L.C. Matioli2, A.T. Beck3

    CMES-Computer Modeling in Engineering & Sciences, Vol.83, No.1, pp. 23-56, 2012, DOI:10.3970/cmes.2012.083.023

    Abstract Solution of structural reliability problems by the First Order method require optimization algorithms to find the smallest distance between a limit state function and the origin of standard Gaussian space. The Hassofer-Lind-Rackwitz-Fiessler (HLRF) algorithm, developed specifically for this purpose, has been shown to be efficient but not robust, as it fails to converge for a significant number of problems. On the other hand, recent developments in general (augmented Lagrangian) optimization techniques have not been tested in aplication to structural reliability problems. In the present article, three new optimization algorithms for structural reliability analysis are presented. One algorithm is based on… More >

  • Open Access

    ARTICLE

    A Combined Approach of the MLPG Method and Nonlinear Programming for Lower-Bound Limit Analysis

    S. S. Chen1, Y. H. Liu1,2, Z. Z. Cen1

    CMES-Computer Modeling in Engineering & Sciences, Vol.28, No.1, pp. 39-56, 2008, DOI:10.3970/cmes.2008.028.039

    Abstract In most engineering applications, solutions derived from the lower-bound theorem of plastic limit analysis are particularly valuable because they provide a safe estimate of the load that will cause plastic collapse. A solution procedure based on the meshless local Petrov-Galerkin (MLPG) method is proposed for lower-bound limit analysis. This is the first work for lower-bound limit analysis by this meshless local weak form method. In the construction of trial functions, the natural neighbour interpolation (NNI) is employed to simplify the treatment of the essential boundary conditions. The discretized limit analysis problem is solved numerically with the reduced-basis technique. The self-equilibrium… More >

  • Open Access

    ARTICLE

    A Nonlinear Optimization Algorithm for Lower Bound Limit and Shakedown Analysis

    G. Gang1, Y.H. Liu2

    CMC-Computers, Materials & Continua, Vol.20, No.3, pp. 251-272, 2010, DOI:10.3970/cmc.2010.020.251

    Abstract Limit and shakedown analysis theorems are the theories of classical plasticity for the direct computation of the load-carrying capacity under proportional and varying loads. Based on Melan's theorem, a solution procedure for lower bound limit and shakedown analysis of three-dimensional (3D) structures is established making use of the finite element method (FEM). The self-equilibrium stress fields are expressed by linear combination of several basic self-equilibrium stress fields with parameters to be determined. These basic self-equilibrium stress fields are elastic responses of the body to imposed permanent strains obtained through elastic-plastic incremental analysis by the three-dimensional finite element method (3D-FEM). The… More >

Displaying 11-20 on page 2 of 17. Per Page