Markov控制过程基于神经元动态规划的优化算法

论文在Markov性能势理论基础上,研究了Markov控制过程在神经元网络等逼近结构表示的随机平稳策略作用下的仿真优化算法,分析了它们在一个无限长的样本轨道上概率1的收敛性,并给出了一个三－状态受控Markov过程的数值实例。     

Preliminary Evaluation of Supercritical Carbon Dioxide Extracted Dabai Pulp Oleoresin as a New Alternative Fat

There has been growing interest among food scientists in producing a toxin-free fat as an end product with varying physical or nutritional properties of interest to the food industry. Oleoresin is a rich source of bioactive compounds which consumers can easily add to a large variety of food. Dabai (Canarium odontophyllum) pulp oleoresin (DPL) was extracted using supercritical carbon dioxide (SC-CO₂) extraction, a green extraction technology. This study investigates the quality of SC-CO₂ extracted DPL in discovering its potential as a new alternative fat. The extraction experiment was carried out at a pressure of 40 MPa and a temperature of 40 °C. DPL is a saturated fatty acid (SFA)-rich fat due to its high SFA composition (47.72 ± 0.01%). In addition, the low content of peroxide value (PV) (5.60 ± 0.09 mEq/kg) and free fatty acids (FFA) (3.40 ± 0.03%) indicate the quality and stability of DPL for various applications besides food consumption. DPL also has a low slip melting point (SMP) (20.20 ± 0.03 °C), and HPLC-FID revealed that DPL contained 0.13 ± 0.02 mg/100 g of vitamin E (α-tocopherol), indicating its potential application as a solid fat with a bioactive compound. This present work demonstrates the possible prospect of DPL in the formulation of end products for food industries.     

Catalan数的一个递归关系

将非结合代数中ｎ元Ｘ１,Ｘ２,．．．,Ｘｎ按给定次序的加括号乘法（结合法）转化为长为ｎ－１的路Ｘ１,Ｘ２．．．Ｘｎ的边收缩问题,用容斥原理,得到Ｃａｔａｌａｎ数的一个新的递归关系。     

路偏序集的个数

如果一个有限偏序集Ｐ的Ｈａｓｓｅ图在图论意义上同构于一条路,那么称这个有限偏序集Ｐ为路偏序集,令ｆ（ｎ）表示ｎ个元素不同构的路偏序集的个数,作者证明了。     

关于最长圈交Crotschel猜想的证明

讨论了最长路的交及性质,证明了Ｇｒｏｔｓｃｈｅｌ猜想：Ｃ１和Ｃ２是ｋ－连通图Ｇ的两个最长圈,则│Ｖ（Ｃ１）∩Ｖ（Ｃ２）│≥ｋ,且公共点Ｖ（Ｃ１）∩Ｖ（Ｃ２）形成Ｇ的一个顶点割。     

机械臂关节空间B样条曲线轨迹规划

在关节空间使用B样条曲线对机械臂进行轨迹规划 ,并与分段 3次样条曲线进行比较 ,用B样条方法进行轨迹规划的具有分段处理性、计算速度快、以及计算机内存占用较少等优点     

图C_n·P_3的优美标号与调和标号

设C_n·P_3(n≥3)是由圈C_n上一点与路P_3的起点粘合而得到的图。本文研究图C_n·P_3的优美标号与调和标号,得到一些结果。     

Value theory without symmetry

We investigate quasi-values of finite games – solution concepts that satisfy the axioms of Shapley (1953) with the possible exception of symmetry.  Following Owen (1972), we define “random arrival', or path, values: players are assumed to “enter' the game randomly, according to independently distributed arrival times, between 0 and 1; the payoff of a player is his expected marginal contribution to the set of players that have arrived before him.  The main result of the paper characterizes quasi-values, symmetric with respect to some coalition structure with infinite elements (types), as random path values, with identically distributed random arrival times for all players of the same type.  General quasi-values are shown to be the random order values (as in Weber (1988) for a finite universe of players).  Pseudo-values (non-symmetric generalization of semivalues) are also characterized, under different assumptions of symmetry. Received: April 1998/Revised version: February 2000     

Asymptotic Windings of Brownian Motion Paths on Riemann Surfaces

We study asymptotic winding properties of Brownian motion paths on Riemann surfaces by obtaining limit laws for stochastic line integrals along Brownian paths of meromorphic differential 1-forms (Abelian differentials).     

Finding the critical path in an activity network with time-switch constraints

An activity network is an acyclic graph with non-negative weights and with a unique source and destination. A project consisting of a set of activities and precedence relationships can be represented by an activity network and the mathematical analysis of the network provides useful information for managing the project. In a traditional activity network, it is assumed that an activity always begins after all of its preceding activities have been completed. This assumption may not be adequate enough to describe some practical applications where some forms of time constraints are attached to an activity. In this paper, we investigate one type of time constraint called time-switch constraint which assumes that an activity begins only in a specified time interval of a cycle with some pairs of exclusive components. Polynomial time algorithms are developed to find the critical path (or longest path) and analyze the float of each arc in this time-constrained activity network. The analysis shows that the critical path and float in this context differ from those of a traditional activity network in some management perspectives and thus, consideration of the time-switch constraint leads to enhanced project management through more effective use of budgets and resource allocation.