Jaya algorithm in estimation of P[X > Y] for two parameter Weibull distribution

<abstract> <p>Jaya algorithm is a highly effective recent metaheuristic technique. This article presents a simple, precise, and faster method to estimate stress strength reliability for a two-parameter, Weibull distribution with common scale parameters but different shape parameters. The three most widely used estimation methods, namely the maximum likelihood estimation, least squares, and weighted least squares have been used, and their comparative analysis in estimating reliability has been presented. The simulation studies are carried out with different parameters and sample sizes to validate the proposed methodology. The technique is also applied to real-life data to demonstrate its implementation. The results show that the proposed methodology's reliability estimates are close to the actual values and proceeds closer as the sample size increases for all estimation methods. Jaya algorithm with maximum likelihood estimation outperforms the other methods regarding the bias and mean squared error.</p> </abstract>

Characterizations of intra-regular LA-semihyperrings in terms of their hyperideals

<abstract><p>The purpose of this article is to investigate the class of intra-regular $ LA $-semihyperrings. Then, characterizations of intra-regular $ LA $-semihyperrings by the properties of many types of their hyperideals are obtained. Moreover, we present a construction of $ LA $-semihyperrings from ordered $ LA $-semirings.</p></abstract>

Conjugate gradient algorithm for consistent generalized Sylvester-transpose matrix equations

<abstract><p>We develop an effective algorithm to find a well-approximate solution of a generalized Sylvester-transpose matrix equation where all coefficient matrices and an unknown matrix are rectangular. The algorithm aims to construct a finite sequence of approximated solutions from any given initial matrix. It turns out that the associated residual matrices are orthogonal, and thus, the desire solution comes out in the final step with a satisfactory error. We provide numerical experiments to show the capability and performance of the algorithm.</p></abstract>

Regularity of extended conjugate graphs of finite groups

<abstract><p>The extended conjugate graph associated to a finite group $ G $ is defined as an undirected graph with vertex set $ G $ such that two distinct vertices joined by an edge if they are conjugate. In this article, we show that several properties of finite groups can be expressed in terms of properties of their extended conjugate graphs. In particular, we show that there is a strong connection between a graph-theoretic property, namely regularity, and an algebraic property, namely nilpotency. We then give some sufficient conditions and necessary conditions for the non-central part of an extended conjugate graph to be regular. Finally, we study extended conjugate graphs associated to groups of order $ pq $, $ p^3 $, and $ p^4 $, where $ p $ and $ q $ are distinct primes.</p></abstract>

Weighted boundedness of multilinear integral operators for the endpoint cases

<abstract><p>We prove the weighted boundedness for the multilinear operators associated to some integral operators for the endpoint cases. The operators include Littlewood-Paley operators, Marcinkiewicz operators and Bochner-Riesz operator.</p></abstract>

Universal enveloping Hom-algebras of regular Hom-Poisson algebras

<abstract><p>In this paper, we introduce universal enveloping Hom-algebras of Hom-Poisson algebras. Some properties of universal enveloping Hom-algebras of regular Hom-Poisson algebras are discussed. Furthermore, in the involutive case, it is proved that the category of involutive Hom-Poisson modules over an involutive Hom-Poisson algebra $ A $ is equivalent to the category of involutive Hom-associative modules over its universal enveloping Hom-algebra $ U_{eh}(A) $.</p></abstract>

Rough sets in graphs using similarity relations

<abstract><p>In this paper, we investigate the theory of rough set to study graphs using the concept of orbits. Rough sets are based on a clustering criterion and we use the idea of similarity of vertices under automorphism as a criterion. We introduce indiscernibility relation in terms of orbits and prove necessary and sufficient conditions under which the indiscernibility partitions remain the same when associated with different attribute sets. We show that automorphisms of the graph $ \mathcal{G} $ preserve the indiscernibility partitions. Further, we prove that for any graph $ \mathcal{G} $ with $ k $ orbits, any reduct $ \mathcal{R} $ consists of one element from $ k-1 $ orbits of the graph. We also study the rough membership functions for paths, cycles, complete and complete bipartite graphs. Moreover, we introduce essential sets and discernibility matrices induced by orbits of graphs and study their relationship. We also prove that every essential set consists of union of any two orbits of the graph.</p></abstract>

Optimal control for a phase field model of melting arising from inductive heating

<abstract><p>Due to its unique performance of high efficiency, fast heating speed and low power consumption, induction heating is widely and commonly used in many applications. In this paper, we study an optimal control problem arising from a metal melting process by using a induction heating method. Metal melting phenomena can be modeled by phase field equations. The aim of optimization is to approximate a desired temperature evolution and melting process. The controlled system is obtained by coupling Maxwell's equations, heat equation and phase field equation. The control variable of the system is the external electric field on the local boundary. The existence and uniqueness of the solution of the controlled system are showed by using Galerkin's method and Leray-Schauder's fixed point theorem. By proving that the control-to-state operator $ P $ is weakly sequentially continuous and Fréchet differentiable, we establish an existence result of optimal control and derive the first-order necessary optimality conditions. This work improves the limitation of the previous control system which only contains heat equation and phase field equation.</p></abstract>

New error bound for linear complementarity problem of $ S $-$ SDDS $-$ B $ matrices

<abstract><p>$ S $-$ SDDS $-$ B $ matrices is a subclass of $ P $-matrices which contains $ B $-matrices. New error bound of the linear complementarity problem for $ S $-$ SDDS $-$ B $ matrices is presented, which improves the corresponding result in ^{[<xref ref-type="bibr" rid="b1">1</xref>]}. Numerical examples are given to verify the corresponding results.</p></abstract>

A discrete Ramos-Louzada distribution for asymmetric and over-dispersed data with leptokurtic-shaped: Properties and various estimation techniques with inference

<abstract> <p>In this paper, a flexible probability mass function is proposed for modeling count data, especially, asymmetric, and over-dispersed observations. Some of its distributional properties are investigated. It is found that all its statistical and reliability properties can be expressed in explicit forms which makes the proposed model useful in time series and regression analysis. Different estimation approaches including maximum likelihood, moments, least squares, Andersonӳ-Darling, Cramer von-Mises, and maximum product of spacing estimator, are derived to get the best estimator for the real data. The estimation performance of these estimation techniques is assessed via a comprehensive simulation study. The flexibility of the new discrete distribution is assessed using four distinctive real data sets ԣoronavirus-flood peaks-forest fire-Leukemia? Finally, the new probabilistic model can serve as an alternative distribution to other competitive distributions available in the literature for modeling count data.</p> </abstract>