一类可调转股价可转债的定价分析与计算

1 引言可转换债券以其独特的风险受益特性逐渐为投、融资者所接受并得到了广泛的欢迎．如今,无论在广度还是深度上,全球范围的可转债市场都已经发生了质的变化,并且日趋成熟和繁荣．中国的可转债市场在经历了十余年的沉寂之后,近两年也正进入一个高速发     

树上秘密共享体制的信息率

研究以树G为通道结构的秘密共享体制的最优信息率ρ（G）。得到了ρ（G）＝2／3的要条件。证明了ρ（G）不会介于实数区间（3／5，2／3）中，给出了以树G的阶数表示的ρ（G）的下界，求出两类具有某种结构的树的最优信息率。     

ESR方法初探树木年轮记载的气候效应

对新疆托木尔峰地区松树年轮样品的ESR研究表明,其自由基浓度N_g是树木生长速率的指示,它与季节有关。春材的N_g值普遍高于秋材,与气温、降雨量有关,但不是一一对应的关系。年轮的N_g明显地受太阳黑子活动周的影响,随着太阳周而变化,只是峰谷和峰值年要前移或后推1—2年。     

Fuzzy信息系统的Rough集理论

提出 Fuzzy信息系统的概念 ,建立 fuzzy信息系统上的 Rough集理论 ,给出 Fuzzy信息系统与经典信息系统的关系 ,讨论 Fuzzy信息系统的知识约简问题     

思维导图在物理化学教学中的应用

通过介绍思维导图的特征以及思维导图软件XMind的主要功能特点,阐述了思维导图应用于物理化学的理论基础。以XMind软件作为绘制工具,以"热力学第二定律"为例,探讨了将思维导图运用于单元总结中,在建构知识体系、把握知识脉络以及训练思维能力方面的有效作用。进一步以本章重要知识点"熵增加原理"为例,尝试思维导图在知识点的理解掌握、拓展应用等方面的具体应用。     

On the first passage time of a simple random walk on a tree

We consider a simple random walk on a tree. Exact expressions are obtained for the expectation and the variance of the first passage time, thereby recovering the known result that these are integers. A relationship of the mean first passage matrix with the distance matrix is established and used to derive a formula for the inverse of the mean first passage matrix.     

A tree search method for the container loading problem with shipment priority

This paper addresses a special kind of container loading problem with shipment priority. We present a tree search method, which is based on a greedy heuristic. In the greedy heuristic, blocks made up of identical items with the same orientation are selected for packing into a container. Five evaluation functions are proposed for block selection, and the different blocks selected by each evaluation function constitute the branches of the search tree. A method of space splitting and merging is also embedded in the algorithm to facilitate efficient use of the container space. In addition, the proposed algorithm covers an important constraint called shipment priority to solve practical problems. The validity of the proposed algorithm is examined by comparing the present results with those of published algorithms using the same data.     

Fusing multiple Bayesian knowledge sources

We address the problem of information fusion in uncertain environments. Imagine there are multiple experts building probabilistic models of the same situation and we wish to aggregate the information they provide. There are several problems we may run into by naively merging the information from each. For example, the experts may disagree on the probability of a certain event or they may disagree on the direction of causality between two events (e.g., one thinks A causes B while another thinks B causes A). They may even disagree on the entire structure of dependencies among a set of variables in a probabilistic network. In our proposed solution to this problem, we represent the probabilistic models as Bayesian Knowledge Bases (BKBs) and propose an algorithm called Bayesian knowledge fusion that allows the fusion of multiple BKBs into a single BKB that retains the information from all input sources. This allows for easy aggregation and de-aggregation of information from multiple expert sources and facilitates multi-expert decision making by providing a framework in which all opinions can be preserved and reasoned over.     

维多利亚时期《知识》与《自然》之间的抗衡

维多利亚时代,与科学有关的期刊发展迅速,其中大名鼎鼎的《自然》（Nature）就在这一时期创刊。本文通过资料分析发现,《自然》虽然取得了成功,也是当时唯一一份维持到现在的世界级科学期刊,但是,另外一些期刊也依然值得纪念,如波达创办并经营的《知识》。这一期刊与《自然》曾经相伴相争,共同走过了一段岁月,最终消亡。不过本文认为,这一期刊从某种意义上更加具有科普的气息,而且更加为公众所喜爱。     

The sum of the distances between the leaves of a tree and the 'semi-regular' property

Various topological indices have been put forward in different studies, from biochemistry to pure mathematics. Among them, the Wiener index, the number of subtrees, and the Randi? index have received great attention from mathematicians. In the study of extremal problems regarding these indices among trees, one interesting phenomenon is that they share the same extremal tree structures. Much effort was devoted to the study of the correlations between these various indices. In this note we provide a common characteristic (the ‘semi-regular’ property) of these extremal structures, with respect to the above mentioned indices, among trees with a given maximum degree. This observation leads to a more unified approach for characterizing these extremal structures. As an application/example, we illustrate the idea by studying the extremal trees, regarding the sum of distances between all pairs of leaves of a tree, a new index, which recently appeared in phylogenetic tree reconstruction, and the study of the neighborhood of trees.