A finite model property for RMImin

It is proved that the variety of relevant disjunction lattices has the finite embeddability property. It follows that Avron's relevance logic RMI _min has a strong form of the finite model property, so it has a solvable deducibility problem. This strengthens Avron's result that RMI _min is decidable. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Unified Model for Generation Complex Networks with Utility Preferential Attachment

In this paper, based on the utility preferential attachment, we propose a new unified model to generate different network topologies such as scale-free, small-world and random networks. Moreover, a new network structure named super scale network is found, which has monopoly characteristic in our simulation experiments. Finally, the characteristics ofthis new network are given.     

一阶形式系统K~*及其完备性

模糊命题演算的形式系统L＊已经在模糊逻辑与模糊推理的结合研究中得到了成功的应用.本文考虑与系统L＊相应的一阶逻辑理论,建立了一阶形式系统K＊,并证明了这个系统的完备性.     

带有回报计划的动态客户关系管理模型及实验应用分析

在客户最大化效用及公司最大化CLV的动态环境下。对所提的带有回报计划的动态客户关系管理模型用于某超市的客户数据库中，发现模型的结果对这类客户是适用的。并给出了不同的客户状态空间对应的有效营销组合策略。结果表明：合适的回报计划可以促进客户的购买、提高公司的利润及缓解价格竞争。回报极限应该比客户的平均购买水平偏高，回报率应该与回报极限的改变方向一致。计划的时间范围应定在一年左右比较合适。对于累积购买水平较高的客户一般不邮寄商品信息。在回报计划的初期与末期不用打折。中期对那些购买次数很少的客户可以实行相应的降价策略。     

On Binary Computation Structures

Based on a modification of Moss' and Parikh's topological modal language [8], we study a generalization of a weakly expressive fragment of a certain propositional modal logic of time. We define a bimodal logic comprising operators for knowledge and nexttime. These operators are interpreted in binary computation structures. We present an axiomatization of the set T of theorems valid for this class of semantical domains and prove – as the main result of this paper – its completeness. Moreover, the question of decidability of T is treated.     

On the law S ( S ( x , y ), T ( x , y )) = S ( x , y ) of fuzzy logic

Motivated by some functional models arising in fuzzy logic, when classical boolean relations between sets are generalized, we study the functional equation S(S(x, y), T(x, y)) = S(x, y), where S is a continuous t-conorm and T is a continuous t-norm. Some interesting methods for solving this type of equations are introduced.     

A parametric representation of linguistic hedges in Zadeh’s fuzzy logic

This paper proposes a model for the parametric representation of linguistic hedges in Zadeh’s fuzzy logic. In this model each linguistic truth-value, which is generated from a primary term of the linguistic truth variable, is identified by a real number r depending on the primary term. It is shown that the model yields a method of efficiently computing linguistic truth expressions accompanied with a rich algebraic structure of the linguistic truth domain, namely De Morgan algebra. Also, a fuzzy logic based on the parametric representation of linguistic truth-values is introduced.     

Optimal Investment in a Levy Market

In this paper we consider the optimal investment problem in a market where the stock price process is modeled by a geometric Levy process (taking into account jumps). Except for the geometric Brownian model and the geometric Poissonian model, the resulting models are incomplete and there are many equivalent martingale measures. However, the model can be completed by the so-called power-jump assets. By doing this we allow investment in these new assets and we can try to maximize the expected utility of these portfolios. As particular cases we obtain the optimal portfolios based in stocks and bonds, showing that the new assets are superfluous for certain martingale measures that depend on the utility function we use.     

求解通信网节点间全部路由的逻辑代数化算法

经典的D IJKSTRA和BELLM AN-F LOYD通信网络路由算法,只能根据特定网络参数得到最佳路由,却无法获得网络存在的全部可用路由,而通信网理论研究及网络管理等方面,往往需要获得节点之间的全部可用路由.研究出一种路由新算法,遵循逻辑代数运算规则、采用关联矩阵中行与行之间整合与删除方式计算,N个节点的网络只需N-1次整合及删除运算,就能得到源节点到任意节点两点之间全部路由结果.详细论证了算法的正确性与合理性,简介了算法的并行运算可行性及与经典路由算法的兼容性等问题.通过算例详细说明算法的计算过程,并验证其正确性.