专职修理工多重休假且修理设备可更换的k/n(G)表决系统研究

讨论专职修理工多重休假,修理设备可发生失效且可更换的k/n（G）表决可修系统.当系统中没有故障部件时,专职修理工开始一次休假,在此期间,若有工作部件发生故障,则立即指派普通修理工修理故障部件,一直持续到系统中无故障部件或专职修理工休假回来.利用马尔可夫过程理论和矩阵解法,给出了系统瞬态和稳态下的可用度和故障频度、可靠度、系统首次故障前的平均时间、修理设备处于更换状态的概率等指标的表达式.在此基础上,基于不同的初始条件研究了相关指标随时间的变化情况.最后,特殊情形的讨论验证了所得结果的正确性.     

Minimum classification error training in example based speech and pattern recognition using sparse weight matrices

The Minimum Classification Error (MCE) criterion is a well-known criterion in pattern classification systems. The aim of MCE training is to minimize the resulting classification error when trying to classify a new data set. Usually, these classification systems use some form of statistical model to describe the data. These systems usually do not work very well when this underlying model is incorrect. Speech recognition systems traditionally use Hidden Markov Models (HMM) with Gaussian (or Gaussian mixture) probability density functions as their basic model. It is well known that these models make some assumptions that are not correct. In example based approaches, these statistical models are absent and are replaced by the pure data. The absence of statistical models has created the need for parameters to model the data space accurately. For this work, we use the MCE criterion to create a system that is able to work together with this example based approach. Moreover, we extend the locally scaled distance measure with sparse, block diagonal weight matrices resulting in a better model for the data space and avoiding the computational load caused by using full matrices. We illustrate the approach with some example experiments on databases from pattern recognition and with speech recognition.     

Research on game model and complexity of retailer collecting and selling in closed-loop supply chain

A closed-loop supply chain is a complex system in which node enterprises play important roles and exert great influence. Firstly, this paper established a collecting price game model for a close-loop supply chain system with a manufacturer and a retailer who have different rationalities. It assumed that the node enterprises took the marginal utility maximization as the basis of decision-making. Secondly, through numerical simulation, we analyzed complex dynamic phenomena such as the bifurcation, chaos and continuous power spectrum and so on. Thirdly, we analyzed the influences of the system parameters; this further explained the complex nonlinear dynamics behavior from the perspective of economics. The results have significant theoretical and practical application value.     

Multistage optimization of option portfolio using higher order coherent risk measures

Choosing a suitable risk measure to optimize an option portfolio’s performance represents a significant challenge. This paper is concerned with illustrating the advantages of Higher order coherent risk measures to evaluate option risk’s evolution. It discusses the detailed implementation of the resulting dynamic risk optimization problem using stochastic programming. We propose an algorithmic procedure to optimize an option portfolio based on minimization of conditional higher order coherent risk measures. Illustrative examples demonstrate some advantages in the performance of the portfolio’s levels when higher order coherent risk measures are used in the risk optimization criterion.     

Calibrated American option pricing by stochastic linear programming

Abstract

We propose an approach for computing the arbitrage-free interval for the price of an American option in discrete incomplete market models via linear programming. The main idea is built replicating strategies that use both the basic asset and some European derivatives available on the market for trading. This method goes under the name of calibrated option pricing and it has given significant results for European options. Here, we extend the analysis to American options showing that the arbitrage-free interval can be characterized in terms of martingale measures and that it gets significantly reduced with respect to the non-calibrated case.     

基于2-可加模糊测度的NPD项目复杂性评价

针对NPD项目复杂性各因素间具有的关联性以及传统评价方法的局限性,提出一种基于关联多属性的2-可加模糊测度方法来对NPD项目复杂性进行评价。在界定项目复杂性内涵的基础上,从产品复杂性、环境复杂性、组织复杂性和技术复杂性四个方面构建了NPD项目复杂性评价指标体系。从模糊测度、默比乌斯变换和交互作用系数间的转化关系出发,基于最大Marichal熵原则,提出了一种确定2-可加模糊测度值的新方法。利用Choquet积分作为集结算子,自下而上计算各候选方案的综合评价值。最后,通过具体算例说明了该方法的可行性和有效性。     

Balayages on Excessive Measures,their Representation and the Quasi-Lindelöf Property

If Exc is the set of all excessive measures associated with a submarkovian resolvent on a Lusin measurable space and B is a balayage on Exc then we show that for any mExc there exists a basic set A (determined up to a m-polar set) such that B=(B^A)* for any Exc, m. The m-quasi-Lindelöf property (for the fine topology) holds iff for any B there exists the smallest basic set A as above. We characterize the case when any B is representable i.e. there exists a basic set such that B=(B^A)* on Exc.     

Composition operators on weighted Dirichlet spaces

We characterize bounded and compact composition operators on weighted Dirichlet spaces. The method involves integral averages of the determining function for the operator, and the connection between composition operators on Dirichlet spaces and Toeplitz operators on Bergman spaces. We also present several examples and counter-examples that point out the borderlines of the result and its connections to other themes.

     

Trigonometric moment problems for arbitrary finite subsets of

We consider finite subsets satisfying the extension property, i.e. the property that every collection of complex numbers which is positive-definite on is the restriction to of the Fourier coefficients of some positive measure on . A simple algebraic condition on the set of trigonometric polynomials with non-zero coefficients restricted to is shown to imply the failure of the extension property for . This condition is used to characterize the one-dimensional sets satisfying the extension property and to provide many examples of sets failing to satisfy it in higher dimensions. Another condition, in terms of unitary matrices, is investigated and is shown to be equivalent to the extension property. New two-dimensional examples of sets satisfying the extension property are given as well as explicit examples of collections for which the extension property fails.