Fuzzy Entropy： Axiomatic Definition and Neural Networks Model

The measure of uncertainty is adopted as a measure of information. The measures of fuzziness are known as fuzzy information measures. The measure of a quantity of fuzzy information gained from a fuzzy set or fuzzy system is known as fuzzy entropy. Fuzzy entropy has been focused and studied by many researchers in various fields. In this paper, firstly, the axiomatic definition of fuzzy entropy is discussed. Then, neural networks model of fuzzy entropy is proposed, based on the computing capability of neural networks. In the end, two examples are discussed to show the efficiency of the model.     

Visual and Symbolic Reasoning in Mathematics: Making Connections With Computers?

In this article, we analyze the visual and symbolic strategies developed by students to express generalizations of number patterns and the connections they make between them. By analysis of a series of case studies, we compare the approaches adopted by students working through parallel task sequences, which integrate different computer tools in different ways. Finally, we make suggestions as to how students might be encouraged to exploit visual reasoning alongside the symbolic and draw out implications for curriculum design.     

Creative Mathematics and the Computer ‐‐ A Correspondence

In this article a pattern arising from the coefficients in the expansion of the sum of the ?th powers of the roots of a quadratic equation is explored by computer. The paper is presented in the form of a correspondence on this problem, which originated during the Computer Appreciation Course held in University College, Galway, in July 1971, for teachers of mathematics for sixth forms. It is felt that the use of the conversational mode may emphasize some of the points of educational interest which arise in the elementary FORTRAN IV programs which are used to generate the array of coefficients. Two methods are adopted: the first involving a direct calculation using binomial coefficients and the second utilizing a recurrence relation. The programs are deliberately unsophisticated so that the educational aspects of the comparison of the methods may be high‐lighted.     

Intelligent Crack Recognition Based on XFEM and GA-BP Neural Networks北大核心CSCD

基于扩展有限元法(XFEM)和经遗传算法(GA)优化的误差反向传播多层前馈(BP)神经网络(GA-BP)算法,建立了识别结构中裂纹的反演分析模型。模型通过XFEM正向分析获得的测点位移数据训练GA-BP神经网络,并在此基础上利用该网络进行裂纹反向识别。通过两个典型算例对模型的可行性和精度进行了验证,并探讨了网格密度、测点布置、输入数据噪声等对网络识别精度的影响。结果表明,该文的方法可反演线弹性断裂力学重点关注的直线裂纹的几何信息且具有较好的容噪性能,此外,GA-BP神经网络的预测精度较传统BP神经网络普遍更高。     

A new look at some basic concepts in arbitrage pricing theory

The notion of No Free Lunch with Vanishing Risk (or NFLVR in short) w.r.t. admissible strategies depends on the choice of numeraire. Yan introduced the notion of allowable strategy and showed that condition of NFLVR w.r.t. allowable strategies is independent of the choice of numeraire and is equivalent to the existence of an equivalent martingale measure for the deflated price process. In this paper we establish a version of the Kramkov's optional decomposition theorem in the setting of equivalent martingale measures. Based on this theorem, we have a new look at some basic concepts in arbitrage pricing theory: superhedging, fair price, attainable contingent claims, complete markets and etc.     

Finite-Time Synchronization of Coupled Neutral-Type Neural Networks With Stochastic Disturbances and Uncertainties北大核心CSCD

The finite⁃time synchronization problems were solved for coupled neutral⁃type neural networks with stochastic disturbances and uncertainties. Based on the Lyapunov stability theory and the inequality techniques, the finite⁃time synchronization criterion was proposed for this system. Then the finite⁃time synchronization was realized for the master⁃slave system through the construction of an appropriate state feedback controller. At last, a numerical simulation was given to verify the effectiveness of the proposed theory. © 2023 Editorial Office of Applied Mathematics and Mechanics. All rights reserved.     

A classification of some regular p-groups and its applications

In this paper we classify regular p-groups with type invariants (e, 1,1,1) for e≥2 and (1,1,1,1,1). As a by-product, we give a new approach to the classification of groups of order p5, p ≥ 5 a prime.     

A remark on “Connections and Higgs fields on a principal bundle”

The authors show that a unipotent vector bundle on a non–Kähler compact complex manifold does not admit a flat holomorphic connection in general. It was also construct examples of topologically trivial stable vector bundle on compact Gauduchon manifold that does not admit any unitary flat connection.     

On the Evaluation of the Tutte Polynomial at the Points (1, –1) and (2, –1)

Motivated by the identity t (K _n+2; 1, –1) = t (K _n ; 2, –1), where t(G; x, y) is the Tutte polynomial of a graph G, we search for graphs G having the property that there is a pair of vertices u, v such that t(G; 1, –1) = t(G – {u, v}; 2, –1). Our main result gives a sufficient condition for a graph to have this property; moreover, it describes the graphs for which the property still holds when each vertex is replaced by a clique or a coclique of arbitrary order. In particular, we show that the property holds for the class of threshold graphs, a well-studied class of perfect graphs.     

Some Uses of the Farris Transform in Mathematics and Phylogenetics—A Review

In 1970, Farris introduced a procedure that can be used to transform a tree metric into an ultra metric. Since its discovery, Farris’ procedure has been used extensively within phylogenetics where it has become commonly known as the Farris transform. Remarkably, the Farris transform has not only been rediscovered several times within phylogenetics, but also in other fields. In this paper, we will review some of its various properties and uses. The paper is divided into four parts and, altogether, 12 sections. In the first part, we introduce a standardized scheme for classifying those dissimilarity mappings to which the Farris transform can be applied—a scheme that has evolved over the years, but has apparently not been spelled out before in sufficient detail. In the second part, we will discuss how a straightforward generalization of the Farris transform naturally arises in T-Theory. The third part describes how this generalized Farris transform can be used to approximate dissimilarities by tree metrics. And in the final part, we describe some further, “non-standard” applications of the Farris transform. Received November 24, 2004     

A Teacher’s Conception of Definition and Use of Examples When Doing and Teaching Mathematics

To contribute to an understanding of the nature of teachers’ mathematical knowledge and its role in teaching, the case study reported in this article investigated a teacher’s conception of a metamathematical concept, definition, and her use of examples in doing and teaching mathematics. Using an enactivist perspective on mathematical knowledge, the authors give an account of the case of Lily, a prospective, then beginning, teacher who conceived of mathematical definition as an object with particular form and function and engaged in purposeful, specialized use of examples when doing and teaching mathematics. Lily’s case illustrates how a teacher’s interpretation of examples (as exemplifications or single instances) and conception of the form and function of definitions can influence her doing and teaching mathematics. An implication is that teacher preparation should foster teachers’ abilities to use examples purposefully to provide students with rich opportunities to engage in mathematical processes such as defining.     

A multiparameter Garsia–Rodemich–Rumsey inequality and some applications

We extend the classical Garsia–Rodemich–Rumsey inequality to the multiparameter situation. The new inequality is applied to obtain some joint Hölder continuity along the rectangles for fractional Brownian fields W(t,x)$W(t,x)$ and for the solution u(t,y)$u(t,y)$ of the stochastic heat equation with additive white noise.     

Prediction of Gas-Liquid Pressurization Performances of Multistage Multiphase Pumps Based on Similarity Laws and Neural Networks北大核心CSCD

It is very important to accurately predict the gas-liquid pressurization performance of multiphase pumps for the economy and safety of oil-gas production. Existent prediction models and methods are limited by narrow parameter ranges and low pump stages. A gas-liquid experimental platform at the industrial level was built, and the gas-liquid pressurization performances of a 25-stage centrifugal multiphase pump were obtained. A prediction method for gas-liquid pressurization performances was proposed for multiphase pumps with high stages at variable rotational speeds. Firstly, the artificial neural network of gas-liquid boosting pressure in the pump with low stages at a constant rotational speed, was constructed. Then, the boosting pressures at variable rotational speeds were converted to the designed condition by the 2-phase similarity law. Finally, based on the isothermal compression hypothesis, the inter-stage flow parameters were updated and the boosting pressures in pumps with high stages were acquired. The relative errors of prediction results of gas-liquid pressurization were less than 15% in pumps with different stage numbers (3~25 stages) and rotational speeds (2 500~3 500 r·min-1). The proposed method can be applied to other types of multiphase pumps, to determine the stage numbers of multiphase pumps and make production evaluation in oil-gas industry. © 2023 Editorial Office of Applied Mathematics and Mechanics. All rights reserved.     

A heat equation on some adic completions of ℚ and ultrametric analysis

For each finite set S of prime numbers there exists a unique completion ? _S of ?, which is a second countable, locally compact and totally disconnected topological ring. This topological ring has a natural ultrametric that allows to define a pseudodifferential operator D ^α and to study an abstract heat equation on the Hilbert space L ²(? _S ). The fundamental solution of this equation is a normal transition function of a Markov process on ? _S . The techniques developed provides a general framework for these kind of problems on different ultrametric groups.     

A functional generalization of the Cauchy–Schwarz inequality and some subclasses

In this work, a functional generalization of the Cauchy–Schwarz inequality is presented for both discrete and continuous cases and some of its subclasses are then introduced. It is also shown that many well-known inequalities related to the Cauchy–Schwarz inequality are special cases of the inequality presented.     

A very simple proof of Pascal’s hexagon theorem and some applications

In this article we present a simple and elegant algebraic proof of Pascal’s hexagon theorem which requires only knowledge of basics on conic sections without theory of projective transformations. Also, we provide an efficient algorithm for finding an equation of the conic containing five given points and a criterion for verification whether a set of points is a subset of the conic.     

On constructivity and the Rosser property: a closer look at some Gödelean proofs

The proofs of Kleene, Chaitin and Boolos for Gödel's First Incompleteness Theorem are studied from the perspectives of constructivity and the Rosser property. A proof of the incompleteness theorem has the Rosser property when the independence of the true but unprovable sentence can be shown by assuming only the (simple) consistency of the theory. It is known that Gödel's own proof for his incompleteness theorem does not have the Rosser property, and we show that neither do Kleene's or Boolos' proofs. However, we show that a variant of Chaitin's proof can have the Rosser property. The proofs of Gödel, Rosser and Kleene are constructive in the sense that they explicitly construct, by algorithmic ways, the independent sentence(s) from the theory. We show that the proofs of Chaitin and Boolos are not constructive, and they prove only the mere existence of the independent sentences.     

Completeness and Admissibility for General Heuristic Search Algorithms—A Theoretical Study: Basic Concepts and Proofs

We propose a formal generalization for various works dealing with Heuristic Search in State Graphs. This generalization focuses on the properties of the evaluation functions, on the characteristics of the state graphs, on the notion of path length, on the procedures that control the node expansions, on the rules that govern the update operations. Consequently, we present the algorithm family and the sub-family Ã, which include Nilsson's A or A_* and many of their successors such as HPA, B, A ^* , A, C, BF^*, B, IDA^*, D, A^**, SDW. We prove general theorems about the completeness and the sub-admissibility that widely extend the previous results and provide a theoretical support for using diverse kinds of Heuristic Search algorithms in enlarged contexts, specially when the state graphs and the evaluation functions are less constrained than ordinarily.