一类双指标递归关系的求解方法

递归关系不仅在数学中有广泛应用,而且在计算机算法设计与分析中也有广泛应用.在讨论两DNA序列间可能出现的比对数目时,得到比对数目满足的递归关系.对这种递归关系进行了推广,得到一类含四个参数的双指标递归关系模型.采用母函数方法,给出了这类递归关系模型的显式解表达式.     

利用三角函数代换求递归关系的解

利用三角函数代换求递归关系的解湖北民族学院教学系王卫东关于递归关系的解，即递归数列通项公式的求解，现已有多种方法散见于各种中数杂志；但如何利用三角知识去解决这类问题，还少有人作．本文试给出利用三角函数代换求速归数列通项公式的方法，以例示明．例１设数列...     

离散时间比例再保险模型的破产概率

研究具有相依结构的离散时间比例再保险模型的破产概率.在模型中假设随机利率和索赔间隔时间是相依的.利用更新递归技巧,首先得到了破产概率满足的递归方程.然后,根据该递归方程得到了破产概率的上下界估计.     

几种常见的递归数列

一个数列的连续项之间的关系叫递归关系.由递归关系确定的数列叫递归数列.中学教材中的等差、等比数列,是最基本、应用最广的递归数列.递归数列在高考试题中时有所见.本文主要介绍一阶递归数列:an 1=f(an)(有一个初始条件)及二阶递归数列:an 1=f(an,an-1)(有两个初始条件)中的简单类型.1.第一类:a1=aan 1=can d　型若c=1,则an 1=an d,显然{an}是首项为a、公差为d的等差数列;若d=0,c≠0,则an 1=can,显然{an}是首项为a、公比为c的等比数列;下面就一般情形予以研究.例1　已知数列{an}中,a1=3,an 1=2an 4,求这数列的通项.解　由an 1=2an 4,得an=…     

某些“无限”几何问题中的递归思想例谈

作为数列极限的应用,现行教材中有不少涉及“无限”的几何问题,这类问题往往都归结到如何去找符合题意的数列;而要探求出这些数列的通项,除需要具备一些有关的基础知识和较基本的技巧外,更多的情况下却需要有较熟练的递归技巧,这里举几个例子阐述递归思想在解涉及“无限”的几何问题中的作用.     

微积分教学中参数方程的几个例子

参数方程在许多学科都有广泛应用,本文旨在探讨大学数学中的参数方程教学,通过三个比较典型的例子展示参数方程与直角坐标和极坐标间的联系与区别以及同工程等学科的关系.建议在教学中参考以提升学生对这类方程描述运动的理解.     

具有相依结构离散时间模型破产概率的上界

研究两类具有相依结构的离散时间风险模型的破产概率问题.其中,索赔和利率过程假设为2个不同的自回归移动平均模型.利用更新递归技巧,首先得到了该模型下破产概率所满足的递归方程.然后,根据该递归方程得到了破产概率的上界估计.最后对两类风险模型的破产概率的上界进行了比较.     

一类4次旋转对称布尔函数的汉明重量和非线性度

旋转对称布尔函数在密码学中具有重要的应用价值.本文研究了一类特殊4次的旋转对称布尔函数的快速求值及其汉明重量的递归关系,通过将该函数分解成数个子函数,并利用这些函数的傅里叶变换值的递归关系,证明了其汉明重量与非线性度相等.本文的结果和处理指数和的方法对于进一步研究Cusick的一个猜想可能有帮助.     

能行拓扑空间中处处非递归的R.E.点集

本文引入一种递归表现的能行拓补空间,研究了这种空间中按点处处非递归的性质,获得了下述结果: 在任何递归表现的拓扑空间中有处处单纯点集和处处非递归的r.e.点集。     

公债市场波动、消费动态与经济增长——基于递归效用与习惯形成的分析

本文在考虑公债市场波动的经济增长模型中引入递归效用和习惯形成,建立基于递归效用和习惯形成的随机经济增长模型,求得均衡时的最优消费和政府债券需求,讨论递归效用和习惯形成对最优消费和政府债券需求的影响,推导出消费的动态路径和经济增长路径,研究递归效用和习惯形成对消费动态路径和经济增长路径的影响.     

Learning intransitive reciprocal relations with kernel methods

In different fields like decision making, psychology, game theory and biology, it has been observed that paired-comparison data like preference relations defined by humans and animals can be intransitive. Intransitive relations cannot be modeled with existing machine learning methods like ranking models, because these models exhibit strong transitivity properties. More specifically, in a stochastic context, where often the reciprocity property characterizes probabilistic relations such as choice probabilities, it has been formally shown that ranking models always satisfy the well-known strong stochastic transitivity property. Given this limitation of ranking models, we present a new kernel function that together with the regularized least-squares algorithm is capable of inferring intransitive reciprocal relations in problems where transitivity violations cannot be considered as noise. In this approach it is the kernel function that defines the transition from learning transitive to learning intransitive relations, and the Kronecker-product is introduced for representing the latter type of relations. In addition, we empirically demonstrate on two benchmark problems, one in game theory and one in theoretical biology, that our algorithm outperforms methods not capable of learning intransitive reciprocal relations.     

关于一阶理论的型与可数模型的关系

引入了一类特殊的型的概念，较集中地论述了一阶理论的型与可数模型的关系．     

Deterministic and Stochastic Control of Navier—Stokes Equation with Linear, Monotone, and Hyperviscosities

This paper deals with the optimal control of space—time statistical behavior of turbulent fields. We provide a unified treatment of optimal control problems for the deterministic and stochastic Navier—Stokes equation with linear and nonlinear constitutive relations. Tonelli type ordinary controls as well as Young type chattering controls are analyzed. For the deterministic case with monotone viscosity we use the Minty—Browder technique to prove the existence of optimal controls. For the stochastic case with monotone viscosity, we combine the Minty—Browder technique with the martingale problem formulation of Stroock and Varadhan to establish existence of optimal controls. The deterministic models given in this paper also cover some simple eddy viscosity type turbulence closure models. Accepted 7 June 1999     

Functional equations for transfer-matrix operators in open Hecke chain models

We consider integrable open chain models formulated in terms of the generators of affine Hecke algebras. We use the fusion procedure to construct the hierarchy of commutative elements, which are analogues of the commutative transfer matrices. These elements satisfy a set of functional relations generalizing functional relations for a family of transfer matrices in solvable spin chain models of the U_q(gl(n|m)) type. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 150, No. 2, pp. 219–236, February, 2007.     

Statistical analysis of first-order MARMA processes

In this paper, we consider processes of the MARMA type that can be derived from the classical ARMA processes by replacing summation by the maximum operation. It is assumed that the innovations and the values of the process have the standard Fréchet distribution. For simple MARMA processes of first order, certain numerical characteristics are calculated. Sign tests and rank statistical methods for parameter estimation are developed. The characterization relations that can be used for the identification of models are justified.     

Classes of finite relations as initial abstract data types I

The aim of this paper is to give axiomatizations for sixteen types of finite relations. These classes of relations are obtained as intersections of the following basic classes of relations: total relations, surjective relations, partial functions, and injective relations.

A normal form for all relations is given and each of the sixteen types of relations is (syntactically) characterized by certain additional conditions on this normal form.

For each of the sixteen types T, a set of identities E_T is singled out. The class of relations of type T forms an initial algebra in the category of all algebras which satisfy E_T. In the first part of this paper, for each type T the involved algebras are symmetric strict monoidal categories (in the sense of MacLane), enriched with certain specific constants.     

多粒度模糊粗糙集研究

本文研究了模糊粗糙集中属性约简问题.利用模糊粗糙集和多粒度粗糙集各自优点的结合,提出了两类多粒度模糊粗糙集模型,使得两类粗糙集中的上下近似算子关于负算子对偶.同时研究了多粒度模糊粗糙集的性质及与单粒度模糊粗糙集的关系.并通过构造区分函数的方法提出了一类多粒度模糊粗糙集模型的近似约简方法.最后用一个实例核对了该类多粒度模糊粗糙决策系统近似约简方法的有效性.     

Intuitionistic choice and classical logic

Abstract. The effort in providing constructive and predicative meaning to non-constructive modes of reasoning has almost without exception been applied to theories with full classical logic [4]. In this paper we show how to combine unrestricted countable choice, induction on infinite well-founded trees and restricted classical logic in constructively given models. These models are sheaf models over a -complete Boolean algebra, whose topologies are generated by finite or countable covering relations. By a judicious choice of the Boolean algebra we can directly extract effective content from -statements true in the model. All the arguments of the present paper can be formalised in Martin-L?f's constructive type theory with generalised inductive definitions. Received: 20 March 1997 / Revised version: 20 February 1998     

Gr?bner–Shirshov Basis of Derived Hall Algebra of Type A_n

We know that in Ringel–Hall algebra of Dynkin type, the set of all skew commutator relations between the iso-classes of indecomposable modules forms a minimal Gr?bner–Shirshov basis,and the corresponding irreducible elements forms a PBW type basis of the Ringel–Hall algebra. We aim to generalize this result to the derived Hall algebra DH(A_n) of type A_n. First, we compute all skew commutator relations between the iso-classes of indecomposable objects in the bounded derived category D~b(A_n) using the Auslander–Reiten quiver of D~b(A_n), and then we prove that all possible compositions between these skew commutator relations are trivial. As an application, we give a PBW type basis of DH(A_n).