一种新的风险价值（VaR）计算方法及其应用研究

应用格列汶科定理对历史模拟法进行改进,以提高历史模拟法的计算准确性,并利用该方法来确定POT模型中的阈值,以此新方法计算金融市场的风险价值(VaR);然后运用上证指数进行了实证分析,得到了较好的结果。     

次氯酸钠氧化淀粉生产工艺探讨

本文探讨了氧化淀粉生产过程中次氯酸钠浓度、氧化反应温度、氧化反应液的pH值、浆液浓度对变性淀粉性能的影响,通过测试浆纱断裂强度、断裂伸长率、毛羽数、上浆用浆液粘度等性能指标,选出了最佳工艺条件。     

惠莲悲剧成因试析──兼论《金瓶梅》中惠莲悲剧的社会文化意义

惠莲虚荣心具有资本主义萌芽时期市民意识特点，含有下层妇女自觉的愿望和追求。它的形成有其必然的社会原因和个体心理因素。虚荣心是惠莲之死的主要内在原因。惠莲悲剧是一个在浓厚封建氛围下市民社会的女性悲剧。     

黄海之滨税收情——记东港市地方税务局

在中华人民共和国海岸线的北方终点,在鸭绿江奔腾入海的地方,有一方2436平方公里的热土,甲午风云回荡着她的历史丰韵,大东港的崛起讲述着她今朝的繁华,占刹的钟声细数她丰厚的文化底蕴--这就是沿海、沿江、沿边的东港市.     

梁启超与墨子之兼爱说

梁启超以与西方思想理论相参照为方法,客观、系统地详细地分析了墨学产生的社会根源,墨学的体系,墨学在学术思想史上的地位,墨学与先秦其他诸子的学说的异同及其对后世的影响等,揭示出了墨学的普遍价值。     

基于偏差补偿滤波器的DMC算法

运用内模原理和预测控制的方法，讨论了基于脉冲响应的ＤＭＣ，保证控制系统具有良好的稳定性能，且其参数可以在线调整     

新时期农民合作经济组织治理的理性思考

农民合作经济组织是维护和发展农民权益的主要载体,也是新农村建设的主要依托。组织治理是一个动态、持续的过程,我国农民合作经济组织在治理上存在先天不足和后天弥补缺位的问题,在组织治理的路径上,应贯彻对内公平与对外效率的新理念,同时发挥政府服务作用和市场激励作用,治理外部环境优化与内部组织制度创新同步进行,创建利益联结与关系产权协调等机制。     

西南彝族传统婚姻形态的宗法性探究

宗法文化是中华民族传统文化的一部分。西南彝族传统婚姻形态缔结的原则和表现形式体现了彝族族权、父权、夫权的宗法性特征,分析西南彝族传统婚姻形态的宗法性,有益于彝族历史文化研究的拓展和深入。     

The Developing Trend of the People's Mediation in China

Abstract

Mediation has long been the preferred method for dispute resolution in China because it serves multiple functions, such as maintaining harmonious social relationships, smoothing away discord, and repressing social conflict. The sustaining forces that support mediation, however, have been weakened since the late 1970s with the profound economic and social transformation, cultural changes, and legal reforms that have taken place in China. As a result, mediation faced unprecedented challenges and was on the wane in the 1990s in urban China and some rural areas. To address this problem, the Chinese government has been making efforts to revitalize mediation since the late 1990s. This study discusses the social and cultural background under which mediation declined during the 1990s; examines the differently evolving patterns of mediation in urban and rural China; discusses the recent reform policies and practices aimed at reviving mediation; and, finally, explains implications for future development of mediation and research.     

New analysis and computational study for the planar connected dominating set problem

The connected dominating set (CDS) problem is a well studied NP-hard problem with many important applications. Dorn et al. (Algorithmica 58:790–810 2010) introduce a branch-decomposition based algorithm design technique for NP-hard problems in planar graphs and give an algorithm (DPBF algorithm) which solves the planar CDS problem in \(O(2^{9.822\sqrt{n}}n+n^3)\) time and \(O(2^{8.11\sqrt{n}}n+n^3)\) time, with a conventional method and fast matrix multiplication in the dynamic programming step of the algorithm, respectively. We show that DPBF algorithm solves the planar CDS problem in \(O(2^{9.8\sqrt{n}}n+n^3)\) time with a conventional method and in \(O(2^{8.08\sqrt{n}}n+n^3)\) time with a fast matrix multiplication. For a graph \(G\), let \({\hbox {bw}}(G)\) be the branchwidth of \(G\) and \(\gamma _c(G)\) be the connected dominating number of \(G\). We prove \({\hbox {bw}}(G)\le 2\sqrt{10\gamma _c(G)}+32\). From this result, the planar CDS problem admits an \(O(2^{23.54\sqrt{\gamma _c(G)}}\gamma _c(G)+n^3)\) time fixed-parameter algorithm. We report computational study results on the practical performance of DPBF algorithm, which show that the size of instances can be solved by the algorithm mainly depends on the branchwidth of the instances, coinciding with the theoretical analysis. For graphs with small or moderate branchwidth, the CDS problem instances with size up to a few thousands edges can be solved in a practical time and memory space.