Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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

    ARTICLE

    Upper and Lower Bounds of the α-Universal Triple I Method for Unified Interval Implications

    Yiming Tang1,2, Jianwei Gao1,*, Yifan Huang1

    CMC-Computers, Materials & Continua, Vol.79, No.1, pp. 1063-1088, 2024, DOI:10.32604/cmc.2024.049341

    Abstract The α-universal triple I (α-UTI) method is a recognized scheme in the field of fuzzy reasoning, which was proposed by our research group previously. The robustness of fuzzy reasoning determines the quality of reasoning algorithms to a large extent, which is quantified by calculating the disparity between the output of fuzzy reasoning with interference and the output without interference. Therefore, in this study, the interval robustness (embodied as the interval stability) of the α-UTI method is explored in the interval-valued fuzzy environment. To begin with, the stability of the α-UTI method is explored for the case of an individual rule,… More >

  • Open Access

    ARTICLE

    Performance Evaluation of Three-Dimensional UWB Real-Time Locating Auto-Positioning System for Fire Rescue

    Hang Yang1,2,3,*, Xunbo Li1, Witold Pedrycz2

    Intelligent Automation & Soft Computing, Vol.37, No.3, pp. 3039-3058, 2023, DOI:10.32604/iasc.2023.040412

    Abstract Fire rescue challenges and solutions have evolved from straightforward plane rescue to encompass 3D space due to the rise of high-rise city buildings. Hence, this study facilitates a system with quick and simplified on-site launching and generates real-time location data, enabling fire rescuers to arrive at the intended spot faster and correctly for effective and precise rescue. Auto-positioning with step-by-step instructions is proposed when launching the locating system, while no extra measuring instrument like Total Station (TS) is needed. Real-time location tracking is provided via a 3D space real-time locating system (RTLS) constructed using Ultra-wide Bandwidth technology (UWB), which requires… More >

  • Open Access

    ARTICLE

    Hybrid Flow Shop with Setup Times Scheduling Problem

    Mahdi Jemmali1,2,3,*, Lotfi Hidri4

    Computer Systems Science and Engineering, Vol.44, No.1, pp. 563-577, 2023, DOI:10.32604/csse.2023.022716

    Abstract The two-stage hybrid flow shop problem under setup times is addressed in this paper. This problem is NP-Hard. on the other hand, the studied problem is modeling different real-life applications especially in manufacturing and high performance-computing. Tackling this kind of problem requires the development of adapted algorithms. In this context, a metaheuristic using the genetic algorithm and three heuristics are proposed in this paper. These approximate solutions are using the optimal solution of the parallel machines under release and delivery times. Indeed, these solutions are iterative procedures focusing each time on a particular stage where a parallel machines problem is… More >

  • Open Access

    ARTICLE

    Robust Frequency Estimation Under Additive Mixture Noise

    Yuan Chen1, Yulu Tian1, Dingfan Zhang2, Longting Huang3,*, Jingxin Xu4

    CMC-Computers, Materials & Continua, Vol.72, No.1, pp. 1671-1684, 2022, DOI:10.32604/cmc.2022.022371

    Abstract In many applications such as multiuser radar communications and astrophysical imaging processing, the encountered noise is usually described by the finite sum of -stable variables. In this paper, a new parameter estimator is developed, in the presence of this new heavy-tailed noise. Since the closed-form PDF of the -stable variable does not exist except and , we take the sum of the Cauchy () and Gaussian () noise as an example, namely, additive Cauchy-Gaussian (ACG) noise. The probability density function (PDF) of the mixed random variable, can be calculated by the convolution of the Cauchy's PDF and Gaussian's PDF. Because… More >

  • Open Access

    ARTICLE

    Computer Geometries for Finding All Real Zeros of Polynomial Equations Simultaneously

    Naila Rafiq1, Saima Akram2, Mudassir Shams3,*, Nazir Ahmad Mir1

    CMC-Computers, Materials & Continua, Vol.69, No.2, pp. 2635-2651, 2021, DOI:10.32604/cmc.2021.018955

    Abstract In this research article, we construct a family of derivative free simultaneous numerical schemes to approximate all real zero of non-linear polynomial equation. We make a comparative analysis of the newly constructed numerical schemes with a well-known existing simultaneous method for determining all the distinct real zeros of polynomial equations using computer algebra system Mat Lab. Lower bound of convergence of simultaneous schemes is calculated using Mathematica. Global convergence property of the numerical schemes is presented by taking random starting initial approximation and their convergence history are graphically presented. Some real life engineering applications along with some higher degree polynomials… More >

  • Open Access

    ARTICLE

    On Computer Implementation for Comparison of Inverse Numerical Schemes for Non-Linear Equations

    Mudassir Shams1,*, Naila Rafiq2, Nazir Ahmad Mir1,2, Babar Ahmad3, Saqib Abbasi1, Mutee-Ur-Rehman Kayani1

    Computer Systems Science and Engineering, Vol.36, No.3, pp. 493-507, 2021, DOI:10.32604/csse.2021.014476

    Abstract In this research article, we interrogate two new modifications in inverse Weierstrass iterative method for estimating all roots of non-linear equation simultaneously. These modifications enables us to accelerate the convergence order of inverse Weierstrass method from 2 to 3. Convergence analysis proves that the orders of convergence of the two newly constructed inverse methods are 3. Using computer algebra system Mathematica, we find the lower bound of the convergence order and verify it theoretically. Dynamical planes of the inverse simultaneous methods and classical iterative methods are generated using MATLAB (R2011b), to present the global convergence properties of inverse simultaneous iterative… More >

  • Open Access

    ABSTRACT

    A Numerical Method Based On Element Free Galerkin Method For Lower Bound Limit Analysis

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

    The International Conference on Computational & Experimental Engineering and Sciences, Vol.3, No.3, pp. 145-150, 2007, DOI:10.3970/icces.2007.003.145

    Abstract A solution procedure for lower bound limit analysis is presented making use of the element free Galerkin (EFG) method rather than of the traditional numerical methods such as finite element method and boundary element method. A reduced basis technique is adopted to solve the mathematical programming iteratively in a sequence of reduced self-equilibrium stress subspaces with very low dimensions. Numerical example in this paper shows that it is feasible and efficient to solve the problems of limit analysis by using the EFG method. More >

  • Open Access

    ARTICLE

    Parameter Sensitivity and Probabilistic Analysis of the Elastic Homogenized Properties for Rubber Filled Polymers

    Marcin Kamiński1,2, Bernd Lauke2

    CMES-Computer Modeling in Engineering & Sciences, Vol.93, No.6, pp. 411-440, 2013, DOI:10.3970/cmes.2013.093.411

    Abstract The main aim in this paper is a computational study devoted to the sensitivity gradients and probabilistic moments of the effective elastic parameters for the rubber-filled polymers. The methodology is based on least squares recovery of the polynomial functions relating the effective tensor components and the given input design/random parameters. All numerical experiments are provided with respect to Young’s moduli of the elastomer constituents. Computational analysis is possible thanks to the application of the Response Function Method, which is enriched in our approach with the weighting procedures implemented according to the Dirac-type distributions. The homogenized elasticity tensor components are derived… More >

  • Open Access

    ARTICLE

    Upper and Lower Bounds of the Solution for the Superelliptical Plates Problem Using Genetic Algorithms

    H.W. Tang1, Y.T. Yang1, C.K. Chen1

    CMES-Computer Modeling in Engineering & Sciences, Vol.85, No.3, pp. 193-206, 2012, DOI:10.3970/cmes.2012.085.193

    Abstract In this article, a new method combining the Mathematical Programming and the Method of Weighted Residual called MP-MWR is presented. Under the validation of maximum principle, and up on the collocation method, the differential equation can be transferred into a bilateral inequality problem. Applying the genetic algorithms helps to find optimal solutions of upper and lower bounds which satisfy the inequalities. Here, the method is verified by analyzing the deflection of superelliptical clamped plate problem. By using this method, the good approximate solution and its error bounds can be obtained effectively and accurately. More >

  • Open Access

    ARTICLE

    Lower Bound Limit Analysis of Anisotropic Soils

    Chunguang Li1, *, Cuihua Li1, 2, Cong Sun3, Hong Zheng1

    CMC-Computers, Materials & Continua, Vol.54, No.1, pp. 21-41, 2018, DOI:10.3970/cmc.2018.054.021

    Abstract Previous approaches can only tackle anisotropic problems with cohesion varying with direction. A novel linearization of the Mohr-Coulomb yield criterion associated with plane strain problem has been achieved by simulating the Mohr’s circle with orientation lines in σ-τ space, which allows for lower bound solution of soils with cohesion and friction coefficient varying with direction. The finite element lower limit analysis formulation using the modified anisotropic yield criterion is then developed. Several examples are given to illustrate the capability and effectiveness of the proposed numerical procedure for computing rigorous lower bounds for anisotropic soils. More >

Displaying 1-10 on page 1 of 11. Per Page