• 제목/요약/키워드: computational mathematics

검색결과 3,169건 처리시간 0.028초

EVALUATION OF THE CONVOLUTION SUMS Σak+bl+cm=n σ(k)σ(l)σ(m), Σal+bm=n lσ(l)σ(m) AND Σal+bm=n σ3(l)σ(m) FOR DIVISORS a, b, c OF 10

  • PARK, YOON KYUNG
    • Journal of applied mathematics & informatics
    • /
    • 제40권5_6호
    • /
    • pp.813-830
    • /
    • 2022
  • The generating functions of the divisor function σs(n) = Σ0<d|n ds are quasimodular forms. In this paper, we find the basis of the space of quasimodular forms of weight 6 on Γ0(10) consisting of Eisenstein series and η-quotients. Then we evaluate the convolution sum Σak+bl+cm=n σ(k)σ(l)σ(m) with lcm(a, b, c) = 10 and Σal+bm=n lσ(l)σ(m) and Σal+bm=n σ3(l)σ(m) with lcm(a, b) = 10.

GENERALIZED SYMMETRICAL SIGMOID FUNCTION ACTIVATED NEURAL NETWORK MULTIVARIATE APPROXIMATION

  • ANASTASSIOU, GEORGE A.
    • Journal of Applied and Pure Mathematics
    • /
    • 제4권3_4호
    • /
    • pp.185-209
    • /
    • 2022
  • Here we exhibit multivariate quantitative approximations of Banach space valued continuous multivariate functions on a box or ℝN, N ∈ ℕ, by the multivariate normalized, quasi-interpolation, Kantorovich type and quadrature type neural network operators. We treat also the case of approximation by iterated operators of the last four types. These approximations are achieved by establishing multidimensional Jackson type inequalities involving the multivariate modulus of continuity of the engaged function or its high order Fréchet derivatives. Our multivariate operators are defined by using a multidimensional density function induced by the generalized symmetrical sigmoid function. The approximations are point-wise and uniform. The related feed-forward neural network is with one hidden layer.

ANALYSIS OF AN SEIQRVS EPIDEMIC DYNAMICS FOR INFECTIOUS VIRAL DISEASE: QUARANTINE AS A CONTROL STRATEGY

  • RAKESH SINGH TOMAR;JOYDIP DHAR;AJAY KUMAR
    • Journal of applied mathematics & informatics
    • /
    • 제41권1호
    • /
    • pp.107-121
    • /
    • 2023
  • An epidemic infectious disease model consists of six compartments viz. Susceptible, Exposed, Infected, Quarantine, Recovered, and Virus with nonlinear saturation incidence rate is proposed to know the viral disease dynamics. There exist two biological equilibrium points for the model system. The system's local and global stability is done through Lyapunov's direct method about equilibrium points. The sensitivity analysis has been performed for the basic reproduction number and equilibrium points through the normalized forward sensitivity index. Sensitivity analysis shows that virus growth and quarantine rates are more sensitive parameters. In support of mathematical conclusions, numerical experimentation has been shown.

BIVARIATE NUMERICAL MODELING OF THE FLOW THROUGH POROUS SOIL

  • S. JELTI;A. CHARHABIL;A. SERGHINI;A. ELHAJAJI;J. EL GHORDAF
    • Journal of applied mathematics & informatics
    • /
    • 제41권2호
    • /
    • pp.295-309
    • /
    • 2023
  • The Richards' equation attracts the attention of several scientific researchers due to its importance in the hydrogeology field especially porous soil. This work presents a numerical method to solve the two dimensional Richards' equation. The pressure form and the mixed form of Richards' equation are solved numerically using a bivariate diamond finite volumes scheme. Euler explicit scheme is used for the time discretization. Different test cases are done to validate the accuracy and the efficiency of our numerical model and to compare the possible numerical strategies. We started with a first simple test case of Richards' pressure form where the hydraulic capacity and the hydraulic conductivity are taken constant and then a second test case where the hydrodynamics parameters are linear variables. Finally, a third test case where the soil parameters are taken according the Van Gunchten empirical model is presented.

PARAMETRIZED GUDERMANNIAN FUNCTION RELIED BANACH SPACE VALUED NEURAL NETWORK MULTIVARIATE APPROXIMATIONS

  • GEORGE A. ANASTASSIOU
    • Journal of Applied and Pure Mathematics
    • /
    • 제5권1_2호
    • /
    • pp.69-93
    • /
    • 2023
  • Here we give multivariate quantitative approximations of Banach space valued continuous multivariate functions on a box or ℝN, N ∈ ℕ, by the multivariate normalized, quasi-interpolation, Kantorovich type and quadrature type neural network operators. We treat also the case of approximation by iterated operators of the last four types. These approximations are derived by establishing multidimensional Jackson type inequalities involving the multivariate modulus of continuity of the engaged function or its high order Fréchet derivatives. Our multivariate operators are defined by using a multidimensional density function induced by a parametrized Gudermannian sigmoid function. The approximations are pointwise and uniform. The related feed-forward neural network is with one hidden layer.

DATA MINING-BASED MULTIDIMENSIONAL EXTRACTION METHOD FOR INDICATORS OF SOCIAL SECURITY SYSTEM FOR PEOPLE WITH DISABILITIES

  • BATYHA, RADWAN M.
    • Journal of applied mathematics & informatics
    • /
    • 제40권1_2호
    • /
    • pp.289-303
    • /
    • 2022
  • This article examines the multidimensional index extraction method of the disability social security system based on data mining. While creating the data warehouse of the social security system for the disabled, we need to know the elements of the social security indicators for the disabled. In this context, a clustering algorithm was used to extract the indicators of the social security system for the disabled by investigating the historical dimension of social security for the disabled. The simulation results show that the index extraction method has high coverage, sensitivity and reliability. In this paper, a multidimensional extraction method is introduced to extract the indicators of the social security system for the disabled based on data mining. The simulation experiments show that the method presented in this paper is more reliable, and the indicators of social security system for the disabled extracted are more effective in practical application.

ON A VARIANT OF VERTEX EDGE DOMINATION

  • S.V. SIVA RAMA RAJU
    • Journal of applied mathematics & informatics
    • /
    • 제41권4호
    • /
    • pp.741-752
    • /
    • 2023
  • A new variant of vertex edge domination, namely semi total vertex edge domination has been introduced in the present paper. A subset S of the vertex set V of a graph G is said to be a semi total vertex edge dominating set(stved - set), if it is a vertex edge dominating set of G and each vertex in S is within a distance two of another vertex in S. An stved-set of G having minimum cardinality is said to be an γstve(G)- set and its cardinality is denoted by γstve(G). Bounds for γstve(G) - set have been given in terms of various graph theoretic parameters and graphs attaining the bounds have been characterized. In particular, bounds for trees have been obtained and extremal trees have been characterized.

ON THE PROPERTIES OF POSITIVE BOOLEAN DEPENDENCIES BY GROUPS IN THE DATABASE MODEL OF BLOCK FORM

  • TRUC, TRINH NGOC;THANG, TRINH DINH;TUYEN, TRAN MINH
    • Journal of applied mathematics & informatics
    • /
    • 제40권3_4호
    • /
    • pp.531-543
    • /
    • 2022
  • The article proposed a new type of data relationship: Positive Boolean dependencies by groups on block and slice in the database model of block form, where instead of considering value pairs, we consider a group of p values (p ≥ 2). From this new concept, the article stated and demonstrated the equivalence of the three types of deduction, namely: deduction by logic, deduction by block with groups, deduction by block has no more than p elements with groups. Operations on blocks or slices performed for index attributes on blocks, the properties related to this new concept as theorem the equivalen of the three types of deduction, closure of set positive Boolean dependencies by groups and representation and tight representation set of positive Boolean dependencies by groups when the block degenerated into relation are true in the relational database model and also stated and proven in this paper.

FUSESHARP: A MULTI-IMAGE FOCUS FUSION METHOD USING DISCRETE WAVELET TRANSFORM AND UNSHARP MASKING

  • GARGI TRIVEDI;RAJESH SANGHAVI
    • Journal of applied mathematics & informatics
    • /
    • 제41권5호
    • /
    • pp.1115-1128
    • /
    • 2023
  • In this paper, a novel hybrid method for multi-focus image fusion is proposed. The method combines the advantages of wavelet transform-based methods and focus-measure-based methods to achieve an improved fusion result. The input images are first decomposed into different frequency sub-bands using the discrete wavelet transform (DWT). The focus measure of each sub-band is then calculated using the Laplacian of Gaussian (LoG) operator, and the sub-band with the highest focus measure is selected as the focused sub-band. The focused sub-band is sharpened using an unsharp masking filter to preserve the details in the focused part of the image.Finally, the sharpened focused sub-bands from all input images are fused using the maximum intensity fusion method to preserve the important information from all focus images. The proposed method has been evaluated using standard multi focus image fusion datasets and has shown promising results compared to existing methods.

PERFORMANCE OF A KNIGHT TOUR PARALLEL ALGORITHM ON MULTI-CORE SYSTEM USING OPENMP

  • VIJAYAKUMAR SANGAMESVARAPPA;VIDYAATHULASIRAMAN
    • Journal of applied mathematics & informatics
    • /
    • 제41권6호
    • /
    • pp.1317-1326
    • /
    • 2023
  • Today's computers, desktops and laptops were build with multi-core architecture. Developing and running serial programs in this multi-core architecture fritters away the resources and time. Parallel programming is the only solution for proper utilization of resources available in the modern computers. The major challenge in the multi-core environment is the designing of parallel algorithm and performance analysis. This paper describes the design and performance analysis of parallel algorithm by taking the Knight Tour problem as an example using OpenMP interface. Comparison has been made with performance of serial and parallel algorithm. The comparison shows that the proposed parallel algorithm achieves good performance compared to serial algorithm.