中日两国历史学疑古思潮的比较

中日两国在史学发展的历程中,都出现过强劲的疑古思潮。中国自古史学遗产丰厚,疑古思想的发展也源远流长,至清代乾嘉时期,有崔述撰著《考信录》,学术成就粲然,对近代日本和中国的疑古学者都产生很大影响。日本明治维新时期,引进德国兰克的客观主义史学理念,结合中国传入的考据学方法,形成一股近代化的疑古思潮,发展至20世纪20～30年代,形成津田左右吉的"日本神代史抹杀论",中国在同一时期则出现顾颉刚为代表的古史辨派,引发一场学术论辩。由于中日两国具体国情、文化背景和国际政治形势的转变,日本的疑古思潮取得最终胜利,而中国的疑古思潮则被排斥、抑制而失败。分析这种截然不同的后果,可以得出必须清算"二重证据法"给历史学界造成的不良影响、必须确立历史学以求真、求是为第一准则等学术启示。     

保护女性性受害者应注意的几个问题

遭受性侵害的女性,其巨大的痛苦往往不仅仅来自直接的性侵害行为所造成的身体伤害本身,而且还来自侦查和诉讼过程中对女性人格权、隐私权的第二次侵害。文章就许多媒体纷纷报道的某地警方为抓获犯罪嫌疑人而设计“二次强奸”的抓捕方案,让被害人再次受辱一案为背景,论述了刑事警察在侦破女性性受害案中应注意的几个问题：要充分认识性侵害案的严重性及其特点;树立科学、人性的侦查理念;要及时立案和安抚受害人;在侦查过程中要注意对女性性受害人的保护;加大宣传力度和提高破案技术。     

特征AHP在高校教师教学质量评定中的应用

本文针对高校教师教学质量的评定提出了一种特征层次分析法。首先通过分析教学质量的影响因素,建立三层层次分析模型。在其基础上引入特征法,选取特征群并确定特征群中个体的权重,利用反算法根据组合权重及方案层权重,求取准则层评定指标权重,避免了不同质指标间对比的不确定性,摒除了专家直接给出评定指标对比矩阵的主观性,减少了对教师评定过程的不一致性和不完备性。     

Vine copula constructions of higher-dimensional dependent reliability systems

Copulas have proved to be very successful tools for the flexible modeling of dependence. Bivariate copulas have been deeply researched in recent years, while building higher-dimensional copulas is still recognized to be a difficult task. In this paper, we study the higher-dimensional dependent reliability systems using a type of decomposition called “vine,” by which a multivariate distribution can be decomposed into a cascade of bivariate copulas. Some equations of system reliability for parallel, series, and k-out-of-n systems are obtained and then decomposed based on C-vine and D-vine copulas. Finally, a shutdown system is considered to illustrate the results obtained in the paper.     

Two new estimators for the proportion of true null hypotheses in multiple test

In multiple hypothesis test, an important problem is estimating the proportion of true null hypotheses. Existing methods are mainly based on the p-values of the single tests. In this paper, we propose two new estimations for this proportion. One is a natural extension of the commonly used methods based on p-values and the other is based on a mixed distribution. Simulations show that the first method is comparable with existing methods and performs better under some cases. And the method based on a mixed distribution can get accurate estimators even if the variance of data is large or the difference between the null hypothesis and alternative hypothesis is very small.     

THEORIES OF RISK: TESTING INVESTOR BEHAVIOR ON THE TAIWAN STOCK AND STOCK INDEX FUTURES MARKETS

This article considers four utility functions—concave, convex, S‐shaped, and reverse S‐shaped—to analyze the behavior of different types of investors on the Taiwan stock index and its corresponding index futures. Using stochastic dominance (SD) rules, we show that the existence of all four investor types is plausible. Risk averters prefer spot to futures, whereas risk seekers prefer futures to spot. Investors with S‐shaped utility functions prefer spot (futures) to futures (spot) when markets move upward (downward). Investors with reverse S‐shaped utility functions prefer futures (spot) to spot (futures) when markets move upward (downward). We show that both spot and futures markets can exist when only risk averters are present, but futures can dominate spot only if there is some risk‐seeking behavior. These results are robust with respect to subperiods, spot returns including dividends, and diversification. (JEL C14, G12, G15)     

上海经济社会发展与养老服务事业:挑战与对策

着眼于经济社会发展与养老服务事业之间的关系,应从经济增长速度减缓、外来人口迅速增加、经济结构转型升级、城市空间功能调整等方面,探讨上海当前及今后一段时期养老服务所面临的主要挑战与问题。上海需要在政府引导下着力构建和完善政府、市场、社会多方参与、分工合作的养老服务体系,具体包括促进养老公共资源配置的均衡化、大力发展老年服务产业、推进不同层次养老保障制度之间的有效衔接、积极提高上海养老服务的社会化水平等。     

教师专业化途径浅析

本文阐释教师专业化的定义及其重要意义,分析教师专业化的实现途径。     

Batch-Processing Scheduling with Setup Times

The problem is to minimize the total weighted completion time on a single batch-processing machine with setup times. The machine can process a batch of at most B jobs at one time, and the processing time of a batch is given by the longest processing time among the jobs in the batch. The setup time of a batch is given by the largest setup time among the jobs in the batch. This batch-processing problem reduces to the ordinary uni-processor scheduling problem when B = 1. In this paper we focus on the extreme case of B = +, i.e. a batch can contain any number of jobs. We present in this paper a polynomial-time approximation algorithm for the problem with a performance guarantee of 2. We further show that a special case of the problem can be solved in polynomial time.     

The <Emphasis Type="Italic">p</Emphasis>-maxian problem on block graphs

This paper deals with the p-maxian problem on block graphs with unit edge length. It is shown that the two points with maximum distance provide an optimal solution for the 2-maxian problem of block graphs except for K ₃. It can easily be extended to the p-maxian problem of block graphs. So we solve the p-maxian problem on block graphs in linear time.