藏传佛教伦理的普世之途

藏传佛教作为传统宗教文化的一部分，几千年来，不仅在藏区社会生活的各个领域占据重要的地位，而且佛教伦理思想为缓和社会文化的多元碰撞，提供了信仰的驻足点和缓解信仰危机的人文关怀。     

投入产出系统计算方法的探讨

投入产出系统计算工作量主要集中在计算完全需要系数矩阵(I-A)~(-1)。本文给出两种计算(I-A)~(-1)的方法。这两种方法都只用到矩阵乘法,原理简单,易于掌握,便于推广。     

浅析情绪体验对道德信念的影响

情绪体验对道德信念的形成和改变具有重大的影响。本文结合情绪心理学和品德心理学的新近研究 ,从情绪评价与道德信念的关系、情绪体验与道德信念的形成以及情绪体验与道德信念的改变等 3个方面来深入分析情绪体验对道德信念的影响。     

基于BP神经网络的航空运输量短期预测模型

随着我国经济的发展,航空运输业也空前繁荣发展,航空运量受多方面的影响。本文运用误差反传神经网络,综合时间因素、实际进出空港的实际架次与飞机类型、进出空港旅客人数和货物量以及空港气象条件等,探索航空运量的短期预测模型。     

决策树技术在客户信用分析中的应用

针对客户信用分析的需求，利用决策树技术对某钢厂的销售数据进行分析。依据客户交易信息，使用决策树算法对客户信用进行分类，得出一系列帮助企业做出正确交易决策的判定规则。     

遗传算法在项目融资(BOT)中的应用研究

介绍了项目融资的概念,分析了项目融资经济分析的一般程序及存在的问题,提出了利用改进遗传算法解决问题的思路,并通过实例说明了该方法是有效的,为项目融资经济分析提供了一条新的途径。     

解布局问题的模拟退火算法

本文以简化模型为例,给出了用模拟退火算法解布局问题的一般形式、基本步骤以及罚函数的使用方法,所给算法在选用适当的数据结构后即可求解复杂的布局问题,有很强的适应性和灵活性.     

Automated statistical methods for measuring the strength of block ciphers

A block cipher is one of the most common forms of algorithms used for data encryption. This paper describes an efficient set of statistical methods for analysing the security of these algorithms under the black-box approach. The procedures can be fully automated, which provides the designer or user of a block cipher with a useful set of tools for security analysis.     

The use of sparsest cuts to reveal the hierarchical community structure of social networks

We show that good community structures can be obtained by partitioning a social network in a succession of divisive sparsest cuts. A network flow algorithm based on fundamental principles of graph theory is introduced to identify the sparsest cuts and an underlying hierarchical community structure of the network via maximum concurrent flow. Matula [Matula, David W., 1985. Concurrent flow and concurrent connectivity in graphs. In: Alavi, Y., et al. (Eds.), Graph Theory and its Applications to Algorithms and Computer Science. Wiley, New York, NY, pp. 543–559.] established the maximum concurrent flow problem (MCFP), and papers on divisive vs. agglomerative average-linkage hierarchical clustering [e.g., Matula, David W., 1983. Cluster validity by concurrent chaining. In: Felsenstein, J. (Ed.), Numerical Taxonomy: Proc. of the NATO Adv. Study Inst., vol. 1. Springer-Verlag, New York, pp. 156–166 (Proceedings of NATO ASI Series G); Matula, David W., 1986. Divisive vs. agglomerative average linkage hierarchical clustering. In: Gaul, W., and Schader, M. (Eds.), Classification as a Tool of Research. Elsevier, North-Holland, Amsterdam, pp. 289–301; Thompson, Byron J., 1985. A flow rerouting algorithm for the maximum concurrent flow problem with variable capacities and demands, and its application to cluster analysis. Master Thesis. School of Engineering and Applied Science, Southern Methodist University] provide the basis for partitioning a social network by way of sparsest cuts and/or maximum concurrent flow.     

Test inversion bootstrap confidence intervals

In this paper we explore the theoretical and practical implications of using bootstrap test inversion to construct confidence intervals. In the presence of nuisance parameters, we show that the coverage error of such intervals is O ( n ^−1/2) which may be reduced to O ( n ⁻¹) if a Studentized statistic is used. We present three simulation studies and compare the performance of test inversion methods with established methods on the problem of estimating a confidence interval for the dose–response parameter in models of the Japanese atomic bomb survivors data.