从展示数学思维过程谈数学教学

从展示数学思维过程谈数学教学马华，翟宇毅（西安电子科技大学，西安７１００７１）高等数学是工科院校一门重要而难学的基础理论课，它不但为后继课程提供必需的基础知识，更重要的是，通过它的学习可以培养学生的能力，如逻辑推理能力、建立数学模型的能力、运算能力、...     

Expressing and Describing Experiences. A Case of Showing Versus Saying

Experiences are interpreted as conscious mental occurrences that are of phenomenal character. There is already a kind of (weak) intentionality involved with this phenomenal interpretation. A stricter conception of experiences distinguishes between purely phenomenal experiences and intentional experiences in a narrow sense. Wittgenstein’s account of psychological (experiential) verbs is taken over: Usually, expressing mental states verbally is not describing them. According to this, “I believe” can be seen as an expression of one’s own belief, but not as an expression of a belief about one’s belief. Hence, the utterance “I believe it is raining” shows that I believe that it is raining, although it is not said by these words that I believe that it is raining. Thinking thoughts such as “I believe it is raining, but it is not raining” (a variant of Moore’s paradox) is an absurdity between what is already said by silently uttering “It is not raining” and what is shown by silently uttering “I believe it is raining.” The paper agrees with a main result of Wittgenstein’s considerations of Moore’s paradox, namely the view that logical structure, deducibility, and consistency cannot be reduced solely to propositions—besides a logic of propositions, there is, for example, a logic of assertions and of imperatives, respectively.     

Convexification of polygons by flips and by flipturns

Simple polygons can be made convex by a finite number of flips, or of flipturns. These results are extended to very general polygons.     

Approximation by chaotic operators and by conjugate classes

We show that every bounded linear operator on a separable, infinite-dimensional Hilbert space H is the sum of two operators in the norm-closure of the set of operators on H that are chaotic in the sense of Devaney. We also observe that the density of several classes of cyclic operators, with respect to the strong operator topology, may be derived from a result by Hadwin et al. (Proc Amer. Math. Soc. 76 (1979) 250-252).     

Algebras Generated by the Bergman and Anti-Bergman Projections and by Multiplications by Piecewise Continuous Functions

The C*-algebra generated by the Bergman and anti-Bergman projections and by the operators of multiplication by piecewise continuous functions on the Lebesgue space L²(Π) over the upper half-plane is studied. Making use of a local principle, limit operators techniques, and the Plamenevsky results on two-dimensional singular integral operators with coefficients admitting homogeneous discontinuities we reduce the study to simpler C*-algebras associated with points and pairs We construct a symbol calculus for unital C*-algebras generated by n orthogonal projections sum of which equals the unit and by m one-dimensional orthogonal projections. Such algebras are models of local algebras at points z ∈∂Π being the discontinuity points of coefficients. A symbol calculus for the C*- algebra and a Fredholm criterion for the operators are obtained. Finally, a C*-algebra isomorphism between the quotient algebra where is the ideal of compact operators, and its analogue for the unit disk is constructed.     

Interpolation by neural network operators activated by ramp functions

In this paper, a family of interpolation neural network operators are introduced. Here, ramp functions as well as sigmoidal functions generated by central B-splines are considered as activation functions. The interpolation properties of these operators are proved, together with a uniform approximation theorem with order, for continuous functions defined on bounded intervals. The relations with the theory of neural networks and with the theory of the generalized sampling operators are discussed.     

Solving Fredholm integral equations by approximating kernels by spline quasi-interpolants

We study two methods for solving a univariate Fredholm integral equation of the second kind, based on (left and right) partial approximations of the kernel K by a discrete quartic spline quasi-interpolant. The principle of each method is to approximate the kernel with respect to one variable, the other remaining free. This leads to an approximation of K by a degenerate kernel. We give error estimates for smooth functions, and we show that the method based on the left (resp. right) approximation of the kernel has an approximation order O(h ⁵) (resp. O(h ⁶)). We also compare the obtained formulae with projection methods.     

Covering Convex Bodies by Cylinders and Lattice Points by Flats

In connection with an unsolved problem of Bang (1951) we give a lower bound for the sum of the base volumes of cylinders covering a d-dimensional convex body in terms of the relevant basic measures of the given convex body. As an application we establish lower bounds on the number of k-dimensional flats (i.e. translates of k-dimensional linear subspaces) needed to cover all the integer points of a given convex body in d-dimensional Euclidean space for 1≤k≤d−1. K. Bezdek and A.E. Litvak are partially supported by a Natural Sciences and Engineering Research Council of Canada Discovery Grant.     

Representation of Nelson algebras by rough sets determined by quasiorders

In this paper, we show that every quasiorder R induces a Nelson algebra ${{\mathbb R}{\mathbb S}}$ such that the underlying rough set lattice RS is algebraic. We note that ${{\mathbb R}{\mathbb S}}$ is a three-valued ?ukasiewicz algebra if and only if R is an equivalence. Our main result says that if ${{\mathbb A}}$ is a Nelson algebra defined on an algebraic lattice, then there exists a set U and a quasiorder R on U such that ${{\mathbb A} \cong {\mathbb R}{\mathbb S}}$ .     

Integration by parts

Many theorems of integration theory are true for a wide range of definitions of integrals. One such theorem is that giving integration by parts, and we discuss it in this paper.     

求导积分法

将一大类常见的积分问题归纳为一个用幂函数求导法求积分的公式,使得大多数常见的积分问题可以不用任何积分公式求解。     

Entrainment by Chaos

A new phenomenon, the entrainment of limit cycles by chaos, which results from the appearance of cyclic irregular behavior, is discussed. In this study, sensitivity is considered as the main ingredient of chaos to be captured, and the period-doubling cascade is chosen for extension. Theoretical results are supported by simulations and discussions regarding Chua’s oscillators, entrainment of toroidal attractors by chaos, synchronization, and controlling problems. It is demonstrated that the entrainment cannot be considered as generalized synchronization of chaotic systems.     

Scaling by Binormalization

We present an iterative algorithm (BIN) for scaling all the rows and columns of a real symmetric matrix to unit 2-norm. We study the theoretical convergence properties and its relation to optimal conditioning. Numerical experiments show that BIN requires 2–4 matrix–vector multiplications to obtain an adequate scaling, and in many cases significantly reduces the condition number, more than other scaling algorithms. We present generalizations to complex, nonsymmetric and rectangular matrices.     

Strict Betweennesses Induced by Posets as well as by Graphs

For a finite poset P = (V, ≤ ), let _s(P){\cal B}_s(P) consist of all triples (x,y,z) ∈ V ³ such that either x < y < z or z < y < x. Similarly, for every finite, simple, and undirected graph G = (V,E), let B_s(G){\cal B}_s(G) consist of all triples (x,y,z) ∈ V ³ such that y is an internal vertex on an induced path in G between x and z. The ternary relations B_s(P){\cal B}_s(P) and B_s(G){\cal B}_s(G) are well-known examples of so-called strict betweennesses. We characterize the pairs (P,G) of posets P and graphs G on the same ground set V which induce the same strict betweenness relation B_s(P)=B_s(G){\cal B}_s(P)={\cal B}_s(G).