相对有效性分析在上市公司投资价值评价中的应用

我国股票市场成立十年来炉深两地上市公司数已经超过千家，以上述公司投资价值的分析与判断一直是市场争论的热点。1997年万青先生在中国证券报上发表了一篇关于系统分析上市公司投资价值的章，当时就引来了众多证券研究机构和分析师的深入讨论，迄今为止有关上市公司投资价值定量化分析的方法仍然是证券市场里一个崭新的课题。本尝试采用DEAW分析方法为定量地评价上市公司的投资价值，建立相对有效性评价模型和评价指标体系，期望通过对模型的演算和结果的分析，最终能实现指导证券交易的目标。     

上市公司竞争力的非线性评价:辽宁省例证

上市公司竞争力的科学评价,对如何正确引导上市公司的发展具有重要意义.通过因子分析与BP神经网络两种综合评价方法的比较,发现非线性的BP神经网络方法在上市公司竞争力的综合评价上,比传统的线性综合评价方法更具真实性和科学性,并就如何提升辽宁省上市公司竞争力给出了政策建议.     

上市公司经营业绩的时序多指标综合评价

本文首先指出了传统的静态多指标综合评价的缺陷,在考虑上市公司静态业绩评价和评价值增长变化两方面的基础上,提出了应用主成分分析和理想点法等构造的时序多指标综合评价方法,最后通过电力类上市公司的动态综合评价说明了该方法确实是一种有效的动态评价方法。     

基于主成分分析的投资决策

本文首先运用多元统计分析中的主成分分析法对上市公司投资价值的多项指标进行了综合聚集，其次在理想点的基础上建立了综合优化决策模型，并对通讯行业上市公司进行了投资分析，从而为管理者和决策者提供了一种科学而合理的决策依据和决策方法。     

基于PLS通径分析的上市公司财务指标综合评价

为了对上市公司财务报表中的大量财务指标进行综合认识和评价,本文提出利用偏最小二乘(PLS)通径分析方法建立综合评价指标,该指标可以最大程度的综合各原始指标的信息,并且还可以利用其对各组原始指标所反映的不同隐变量信息进行研究.本文以证券市场上钢铁板块的22个上市公司公布的财务数据为例,利用PLS通径分析模型建立了一个综合评价指标,并用其对各上市公司进行了排名,得到了与实际情况十分吻合的结果.     

基于多元分析的股票评价方法

对上市公司钢铁板块2004年财务报表中的八个主要指标应用多元分析法进行了总体评价,得出上市公司的业绩主要受三个具有一定含义的因子的影响,并对上市公司各因子的得分情况及综合得分情况给出了相应分析.     

基于多因素指标的上市公司分类及评价方法

针对能够反映上市公司绩效的盈利性、安全性以及规模性多因素指标,采用聚类分析的方法对30家上市公司进行了分类.为能够甄别各类上市公司的优劣程度,利用密切值法,对四类上市公司进行了综合评价,并对其进行了优先次序的排序和等级的划分.     

投资环境的多层次灰色评价方法研究

针对投资环境评价问题 ,应用定性与定量相结合的分析方法 ,通过建立投资环境综合评价的指标体系 ,给出了一个投资环境评价的多层次灰色评价方法 .最后给出一个实例     

旅游上市公司财务风险评价的可变模糊改进方法

为克服旅游上市公司财务风险评价方法的不足,提出可变模糊改进方法.首先,基于集对模糊联系度,构造相对隶属度矩阵,进而建立可变模糊综合评价模型;然后,结合评价等级特征值,运用二元语义方法确定评价等级和阈值;最后,将方法应用于旅游上市公司财务风险评价问题.结果表明:旅游上市公司财务风险等级为Ⅱ级,即风险较低,且通过计算可发现收现能力和成长能力是影响其风险等级的主要因素,是旅游上市公司财务风险管理的重点.     

基于熵权模糊综合评价模型的股票内在价值研究

针对股票内在价值评判方法中指标权重设定的主观性缺陷,提出在利用熵权确定各指标权重的基础上,运用模糊综合评价方法对股票会计信息的综合指标进行模糊处理,为投资者投资股票提供一种新的参考;并通过"一带一路"概念股中的五支工程基建行业类股票进行模拟实证分析,证明将会计信息进行相关量化处理,能够为投资者提供较为客观的选择,同时基于熵权的模糊综合评价模型在股票内在价值评价中具有可行性.     

On the determination of the control parameters of the optimal can-order policy

This paper considers the well-known class of can-order policies. This type of coordinated replenishment policies accounts for a joint set-up cost structure, where a major set-up cost is incurred for any order and an individual minor set-up cost is charged for each item in the replenishment. Recent comparative studies have pointed out that the performance of the optimal can-order policy is poor, compared to other coordinated replenishment strategies, when the major set-up cost is high. This paper shows that it is the approximate decomposition method to calculate the optimal canorder parameters which performs bad in such situations and not the policy itself. Attention is focused to a subclass of can-order policies, which is close to the optimal can-order policy for high major set-up costs. A solution procedure is developed to calculate the optimal control parameters of this policy. It is shown that a properly chosen combination of the solution procedures to calculate can-order parameters leads to a can-order strategy which performs as well as other coordinated replenishment policies.     

Boundedness of the solution of the third problem for the Laplace equation

A necessary and sufficient condition for the boundedness of a solution of the third problem for the Laplace equation is given. As an application a similar result is given for the third problem for the Poisson equation on domains with Lipschitz boundary.Supported by GACR, Grant No. 201/00/1515.     

On the algorithm of the solution of the signorini problem

An algorithm is proposed for solving the Signorini problem /1/ in the formulation of a unilateral variational problem for the boundary functional in the zone of possible contact /2/. The algorithm is based on a dual formulation of Lagrange maximin problems for whose solution a decomposition approach is used in the following sense: a Ritz process in the basis functions that satisfy the linear constraint of the problem, the differential equation in the domain, is used in solving the minimum problem (with fixed Lagrange multipliers); the maximum problem is solved by the method of descent (a generalization of the Frank-Wolf method) under convexity constraints on the Lagrange multipliers. The algorithm constructed can be conisidered as a modification of the well-known algorithm to find the Udzawa-Arrow-Hurwitz saddle points /3, 4/. The convergence of the algorithm is investigated. A numerical analysis of the algorithm is performed in the example of a classical contact problem about the insertion of a stamp in an elastic half-plane under approximation of the contact boundary by isoparametric boundary elements. The comparative efficiency of the algorithm is associated with the reduction in the dimensionality of the boundary value problem being solved and the possibility of utilizing the calculation apparatus of the method of boundary elements to realize the solution.     

Accelerating the convergence of the method of alternating projections

The powerful von Neumann-Halperin method of alternating projections (MAP) is an algorithm for determining the best approximation to any given point in a Hilbert space from the intersection of a finite number of subspaces. It achieves this by reducing the problem to an iterative scheme which involves only computing best approximations from the individual subspaces which make up the intersection. The main practical drawback of this algorithm, at least for some applications, is that the method is slowly convergent. In this paper, we consider a general class of iterative methods which includes the MAP as a special case. For such methods, we study an ``accelerated' version of this algorithm that was considered earlier by Gubin, Polyak, and Raik (1967) and by Gearhart and Koshy (1989). We show that the accelerated algorithm converges faster than the MAP in the case of two subspaces, but is, in general, not faster than the MAP for more than two subspaces! However, for a ``symmetric' version of the MAP, the accelerated algorithm always converges faster for any number of subspaces. Our proof seems to require the use of the Spectral Theorem for selfadjoint mappings.

     

On the complexity of the Leibniz hierarchy

We prove that the problem of determining whether a finite logical matrix determines an algebraizable logic is complete for EXPTIME. The same result holds for the classes of order algebraizable, weakly algebraizable, equivalential and protoalgebraic logics. Finally, the same problem for the class of truth-equational logic is shown to be hard for EXPTIME.     

债券定价及利率风险的市场价格的重构方法

假设利率变化的模型是由随机微分方程给出,则可以用推导Black-Scholes方程的方法来推出债券价格满足的偏微分方程,得到一个抛物型的偏微分方程.但是,在债券定价的方程中隐含有一个参数λ称为利率风险的市场价格.所谓债券定价的反问题,就是由不同到期时间的债券的现在价格来得到利率风险的市场价格.对随机利率模型下债券定价的正问题先给予介绍和差分数值求解方法,并介绍了反问题,且对反问题给出了数值方法.     

关于多个子空间的交空间与维数公式的推广

通过讨论,得到了关于多个子空间的交空间的进一步的结果.并利用这些结果,给出了维数公式的一个新的推广形式,从而完善了维数公式的理论.     

Acceleration of the convergence of the Laguerre series in the problem of inverting the Laplace transform

When the Laplace transform is inverted numerically, the original function is sought in the form of a series in the Laguerre polynomials. To accelerate the convergence of this series, the Euler-Knopp method is used. The techniques for selecting the optimal value of the parameter of the transform on the real axis and in the complex plane are proposed.     

On the optimality of the greedy solutions of the general knapsack problems

Summary: In this paper we submit a unified discussion of some closely related results which were achieved independently in number theory and integer programming, and we partially generalize them. In the unified discussion we treat together two problems where the greedy method has different characters, in the first one it is an internal-point algorithm, in the second one it is an outer-point method. We call a knapsack problem "pleasant" if the greedy solution is optimal for every right-hand side. A sufficient and two finite necessary and sufficient conditions for the pleasantness of a problem are discussed. The sufficient condition can be checked very easily. The paper is finished with an error analysis of some nonpleasant problems     

Numerical solution of the inverse electrocardiography problem with the use of the Tikhonov regularization method

The inverse electrocardiography problem related to medical diagnostics is considered in terms of potentials. Within the framework of the quasi-stationary model of the electric field of the heart, the solution of the problem is reduced to the solution of the Cauchy problem for the Laplace equation in R ³. A numerical algorithm based on the Tikhonov regularization method is proposed for the solution of this problem. The Cauchy problem for the Laplace equation is reduced to an operator equation of the first kind, which is solved via minimization of the Tikhonov functional with the regularization parameter chosen according to the discrepancy principle. In addition, an algorithm based on numerical solution of the corresponding Euler equation is proposed for minimization of the Tikhonov functional. The Euler equation is solved using an iteration method that involves solution of mixed boundary value problems for the Laplace equation. An individual mixed problem is solved by means of the method of boundary integral equations of the potential theory. In the study, the inverse electrocardiography problem is solved in region Ω close to the real geometry of the torso and heart.