Search

Knowledge map is a new method of knowledge management with the information revolution. This paper is aimed at forming a systematic and standardized huge redundant knowledge structure, which can be used to mine the knowledge structure and the relationship between knowledge and visualize it in a graphical way, in order to obtain more representative information and improve the classification accuracy of text classification model. In this paper, a knowledge map construction method based on the Text CNN algorithm is proposed for the subject of Nautical English. It is of practical significance and academic value to make use of knowledge map to study Chinese Maritime English, which is helpful to the development of Chinese Maritime English and provides guidance. In order to maintain the diversity of particle swarm optimization, the Text CNN algorithm is combined with the construction of Maritime English subject knowledge map, and the network parameters and structure are optimized. Using knowledge map to study China Maritime English has important practical significance and academic value and has certain guiding significance for the development of China Maritime English. [ABSTRACT FROM AUTHOR]

The goal of this paper is to study a new system of a class of variational inequalities termed as absolute value variational inequalities. Absolute value variational inequalities present a rational, pragmatic, and novel framework for investigating a wide range of equilibrium problems that arise in a variety of disciplines. We first develop a system of absolute value auxiliary variational inequalities to calculate the approximate solution of the system of absolute variational inequalities, and then by employing the projection technique, we prove the existence of solutions of the system of absolute value auxiliary variational inequalities. By utilizing an auxiliary principle and the existence result, we propose several new iterative algorithms for solving the system of absolute value auxiliary variational inequalities in the frame of four different operators. Furthermore, the convergence of the proposed algorithms is investigated in a thorough manner. The efficiency and supremacy of the proposed schemes is exhibited through some special cases of the system of absolute value variational inequalities and an illustrative example. The results presented in this paper are more general and rehash a number of some previously published findings in this field. [ABSTRACT FROM AUTHOR]

Recently, conformable calculus has appeared in many abstract uses in mathematics and several practical applications in engineering and science. In addition, many methods and numerical algorithms have been adapted to it. In this paper, we will demonstrate, use, and construct the cubic B-spline algorithm to deal with conformable systems of differential boundary value problems concerning two points and two fractional parameters in both regular and singular types. Here, several linear and nonlinear examples will be presented, and a model for the Lane-Emden will be one of the applications presented. Indeed, we will show the complete construction of the used spline through the conformable derivative along with the convergence theory, and the error orders together with other results that we will present in detail in the form of tables and graphs using Mathematica software. Through the results we obtained, it became clear to us that the spline approach is effective and fast, and it requires little compulsive and mathematical burden in solving the problems presented. At the end of the article, we presented a summary that contains the most important findings, what we calculated, and some future suggestions. [ABSTRACT FROM AUTHOR]

At present, the traditional phase unwrapping algorithm is difficult to balance the accuracy and unwrapping efficiency. The traditional phase unwrapping algorithm is difficult to balance the accuracy and efficiency in the phase unwrapping experiments of simulated and measured topographic interferograms. In this paper, the phase unwrapping technology will be studied under the framework of deep learning theory according to the development trend of InSAR intelligence. A phase unwrapping algorithm based on deep GAN is proposed. The model structure includes dense convolution layer blocks and series structure, so that the network can achieve a better balance between feature extraction and detail preservation of interferogram. This is helpful to improve the phase unwrapping accuracy and training efficiency of the network. The experimental results show that the algorithm has a good expansion effect on the interferogram with high signal-to-noise ratio. The synthesis algorithm makes full use of the advantages of the branch cutting method and the finite element method. The phase reliable region and unreliable region are determined, and the transmission of phase error from the unreliable region to reliable region is effectively avoided. The accuracy of the phase unwrapping results in the reliable region is ensured, and the overall phase unwrapping convergence accuracy is greatly improved. [ABSTRACT FROM AUTHOR]

In this paper, we study the strong convergence of an algorithm to solve the variational inequality problem which extends a recent paper (Thong et al., Numerical Algorithms. 78, 1045-1060 (2018)). We reduce and refine some of their algorithm conditions and we prove the convergence of the algorithm in the presence of some computational errors. Then, using the MATLAB software, the result will be illustrated with some numerical examples. Also, we compare our algorithm with some other well-known algorithms. [ABSTRACT FROM AUTHOR]

At present, many budget companies have realized high-level computerized accounting and have high-speed and advanced database management systems. In order to adapt to the growth of budget entity informatization, the financial department must improve its own financial budget level. Introduce information technology, and develop corresponding financial budget software to better perform its own financial calculation function. This paper explores and analyzes the full collaborative matching algorithm of enabling big data financial budget and builds a financial big data financial budget platform through offline and online data collection. Combined with the matching algorithm and linear regression prediction algorithm in data analysis, the financial data is analyzed in depth. Finally, the PSO-SA algorithm runs 10 rounds on the datasets with matching scales d = 10 and 30, respectively. It is found that the fluctuation is large when d = 10 and relatively stable when d = 30. When d = 10 , the maximum value is 7.2354, and the minimum value is 6.9969. When d = 10 , the maximum value is 26.6403, and the minimum value is 23.9599. It can be concluded that when d = 0 , PSO-SA can obtain a relatively good matching scheme, but it is easy to fall into a local optimal solution. The superposition effect of "data + computing power + algorithm + scenario" can help enterprises make better decisions. Embed complex analysis into daily management and trading scenarios to build a financial empowerment platform. Make the increasingly complex work more automated and intelligent, and improve financial efficiency. [ABSTRACT FROM AUTHOR]

With the deepening of tourists' demand for tourism services, the personalization of online tourists has gradually become an application of personalized recommendation technology. According to the application requirements of personalized scenic spot recommendation, this paper uses social networks and Bayesian networks to fully mine the matching degree between users and scenic spots for personalized recommendation. Add social network factors to the recommendation of tourist attractions, and fully tap the social network relationship between users. First, the users are clustered by the coupling bidirectional clustering algorithm. Then, DBSCAN (density-based noise application spatial clustering) algorithm is used to cluster scenic spots. Finally, two stable user sets and scenic spot sets are applied to the personalized recommendation algorithm to predict the user's next upcoming scenic spot. The algorithm is compared with some traditional algorithms in the dataset. The algorithm deals with the similarity of user attributes and user behavior and uses content-based algorithm to deal with the relationship between scenic spots; com datasets have better performance. [ABSTRACT FROM AUTHOR]

As a complex machine learning algorithm, deep learning can extract object shape information and more complex and advanced information in images by using a deep learning model. In order to solve some problems of deep learning in image feature extraction and classification, this paper designs a modeling method of multifocus image segmentation algorithm based on deep learning. The acceleration effect of FPGA (field programmable gate array) on deep learning and weight sharing is analyzed. By introducing deep learning, the trouble of determining the weight coefficient is eliminated, and the energy function is simplified. Therefore, the relevant parameters of multifocus image segmentation can be easily set, and better results can be obtained. The multifocus image segmentation algorithm based on deep learning can not only obtain closed and smooth segmentation curves but also adaptively deal with topology changes due to high segmentation accuracy and stable algorithm. The results show that the model effectively combines the local and global information of the image, so that the model has good robustness. The depth learning algorithm is used to calculate the average value of local inner and outer pixels of an image. Even for complex images, relatively simple contour curves can be obtained. [ABSTRACT FROM AUTHOR]

Speckle noise removal in medical ultrasound images is a challenging task. In this paper, a new model is proposed to removal speckle noise, alternating direction method of multipliers algorithm is employed to solve the new energy minimization model. The convexity, existence, and uniqueness of the new energy minimization model's solution are proved. Series of experiments are designed in this paper. Numerical results show that the new algorithm can reduce the step effect effectively obtain good results in visual effect and quantitative measures by comparing with some traditional models. [ABSTRACT FROM AUTHOR]

In this paper, we concern with the split feasibility problem (SFP) whenever the convex sets involved are composed of level sets. By applying Gradient-projection algorithm which is used to solve constrained convex minimization problem of a real valued convex function, we construct two new algorithms for the split feasibility problem and prove that both of them are convergent weakly to a solution of the feasibility problem. In the end, as an application, we obtain a new algorithm for solving the split equality problem. [ABSTRACT FROM AUTHOR]

In this paper, we continue to investigate the convergence analysis of Tseng-type forward-backward-forward algorithms for solving quasimonotone variational inequalities in Hilbert spaces. We use a self-adaptive technique to update the step sizes without prior knowledge of the Lipschitz constant of quasimonotone operators. Furthermore, we weaken the sequential weak continuity of quasimonotone operators to a weaker condition. Under some mild assumptions, we prove that Tseng-type forward-backward-forward algorithm converges weakly to a solution of quasimonotone variational inequalities. [ABSTRACT FROM AUTHOR]

Recently, the notions of right and left covering rough sets were constructed by right and left neighborhoods to propose four types of multigranulation covering rough set (MGCRS) models. These models were constructed using the granulations as equivalence relations. In this paper, we introduce four types of multigranulation covering rough set models under arbitrary relations using the q -minimal and q -maximal descriptors of objects in a given universe. We also study the properties of these new models. Thus, we explore the relationships between these models. Then, we put forward an algorithm to illustrate the method of reduction based on the presented model. Finally, we give an illustrative example to show its efficiency and importance. [ABSTRACT FROM AUTHOR]

The theory of Bessel functions is a rich subject due to its essential role in providing solutions for differential equations associated with many applications. As fractional calculus has become an efficient and successful tool for analyzing various mathematical and physical problems, the so-called fractional Bessel functions were introduced and studied from different viewpoints. This paper is primarily devoted to the study of developing two aspects. The starting point is to present a fractional Laplace transform via conformable fractional-order Bessel functions (CFBFs). We establish several important formulas of the fractional Laplace Integral operator acting on the CFBFs of the first kind. With this in hand, we discuss the solutions of a generalized class of fractional kinetic equations associated with the CFBFs in view of our proposed fractional Laplace transform. Next, we derive an orthogonality relation of the CFBFs, which enables us to study an expansion of any analytic functions by means of CFBFs and to propose truncated CFBFs. A new approximate formula of conformable fractional derivative based on CFBFs is provided. Furthermore, we describe a useful scheme involving the collocation method to solve some conformable fractional linear (nonlinear) multiorder differential equations. Accordingly, several practical test problems are treated to illustrate the validity and utility of the proposed techniques and examine their approximate and exact solutions. The obtained solutions of some fractional differential equations improve the analog ones provided by various authors using different techniques. The provided algorithm may be beneficial to enrich the Bessel function theory via fractional calculus. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the Yang transform homotopy perturbation method (YTHPM), which is a novel method. We provide formulae for the Yang transform of Caputo-Fabrizio fractional order derivatives. We derive an algorithm for the solution of Caputo-Fabrizio (CF) fractional order partial differential equation in series form and show its convergence to the exact solution. To demonstrate the novel approach, we include some examples with detailed solutions. We use tables and graphs to compare the exact and approximate solutions. [ABSTRACT FROM AUTHOR]

The objective of this paper is to present an efficient numerical technique for solving time fractional modified anomalous subdiffusion equation. Anomalous diffusion equation has its role in various branches of biological sciences. B-spline is a piecewise function to draw curves and surfaces, which maintain its degree of smoothness at the connecting points. B-spline provides an active process of approximation to the limit curve. In current attempt, B-spline curve is used to approximate the solution curve of time fractional modified anomalous subdiffusion equation. The process is kept simple involving collocation procedure to the data points. The time fractional derivative is approximated with the discretized form of the Riemann-Liouville derivative. The process results in the form of system of algebraic equations, which is solved using a variant of Thomas algorithm. In order to ensure the convergence of the procedure, a valid method named Von Neumann stability analysis is attempted. The graphical and tabular display of results for the illustrated examples is presented, which stamped the efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

This paper is dedicated to construct a viscosity extragradient algorithm for finding fixed points in a CAT(0) space. The mappings we consider are nonexpansive. Strong convergence of the algorithm is obtained. The results established in this work extend and improve some recent discovers in the literature. [ABSTRACT FROM AUTHOR]

The objective of this paper is to present an efficient numerical technique for solving time fractional modified anomalous subdiffusion equation. Anomalous diffusion equation has its role in various branches of biological sciences. B-spline is a piecewise function to draw curves and surfaces, which maintain its degree of smoothness at the connecting points. B-spline provides an active process of approximation to the limit curve. In current attempt, B-spline curve is used to approximate the solution curve of time fractional modified anomalous subdiffusion equation. The process is kept simple involving collocation procedure to the data points. The time fractional derivative is approximated with the discretized form of the Riemann-Liouville derivative. The process results in the form of system of algebraic equations, which is solved using a variant of Thomas algorithm. In order to ensure the convergence of the procedure, a valid method named Von Neumann stability analysis is attempted. The graphical and tabular display of results for the illustrated examples is presented, which stamped the efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we study a kind of conjugate gradient viscosity approximation algorithm for finding a common solution of split generalized equilibrium problem and variational inequality problem. Under mild conditions, we prove that the sequence generated by the proposed iterative algorithm converges strongly to the common solution. The conclusion presented in this paper is the generalization, extension, and supplement of the previously known results in the corresponding references. Some numerical results are illustrated to show the feasibility and efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper, a generalized algorithm to develop a class of approximating binary subdivision schemes is presented. The proposed algorithm is based on three-point approximating binary and four-point interpolating binary subdivision schemes. It contains a parameter which classifies members of the new class of subdivision schemes. A set of efficient properties, for instance, polynomial generation and reproduction, support, continuity, and Hölder continuity, is discussed. Moreover, applications of the proposed subdivision schemes are given in order to demonstrate their variety, flexibility, and visual performance. [ABSTRACT FROM AUTHOR]

We consider mixed parallel and cyclic iterative algorithms in this paper to solve the multiple-set split equality common fixed-point problem which is a generalization of the split equality problem and the split feasibility problem for the demicontractive mappings without prior knowledge of operator norms in real Hilbert spaces. Some weak and strong convergence results are established. The results obtained in this paper generalize and improve the recent ones announced by many others. [ABSTRACT FROM AUTHOR]

In this paper, we investigate existence of n-tuplet coincidence point theorems in partially ordered probabilistic metric spaces. Also, we gave uniqueness of n-tuplet fixed point theorems in this space. [ABSTRACT FROM AUTHOR]

In this paper, we propose an extension of quasi-equilibriumproblems fromthe convex case to the nonconvex case and fromHilbert spaces to Banach spaces. The proposed problem is called quasi-variational problem. We study the convergence of some algorithms to solutions of the proposed nonconvex problems in Banach spaces. [ABSTRACT FROM AUTHOR]

The aim of this paper is to construct a novel implicit iterative algorithm for the split common fixed point problem for the demicontractive operators U, T, and  xn=αnfxn+1-αnUλxn-ρnA*I-TAxn, n≥0, where Uλ=(1-λ)I+λU, and we obtain the sequence which strongly converges to a solution x^ of this problem, and the solution x^ satisfies the variational inequality. 〈x^-f(x^),x^-z〉≤0, ∀z∈S, where S denotes the set of all solutions of the split common fixed point problem. [ABSTRACT FROM AUTHOR]

This paper deals with the second-order nonlinear neutral delay difference equation Δ(anh(xn-τ1n,xn-τ2n,…,xn-τmn)Δ(xn-qnxn-τ0))+f(n,xn-σ1n,xn-σ2n,…,xn-σkn)=bn, n≥n0. Using the Banach fixed point theorem, Mann iterative method with errors, and some new techniques, we prove the existence of uncountably many positive solutions and the convergence of the sequences generated by the Mann iterative method with errors relative to these solutions for the above equation. Six examples are included. Our results extend and improve essentially the known results in this field. [ABSTRACT FROM AUTHOR]