用于分散电压控制的规则库法

电力系统正常运行时,无功/电压控制目的是安全经济供电.而在紧急情况下,首要目标是运行的安全性,其次才是经济性.本文提出的局部网概念及其灵敏度矩阵,以及对电压违限严重性的分级和控制战略,使控制更为快速有效.此法更适用于当事故引起全系统运行数据不全时对局部网的电压控制.     

伍子胥散论

伍子胥是吴国的忠臣,他从长远考虑,竭力主张灭越,但他的意见未被夫差采纳,反而被夫差杀害。后来吴国遭到越国的偷袭,夫差这才意识到自己错杀了伍子胥,于是他为伍子胥立庙设祭,即是忏悔,又是安抚。吴人和越人都尊伍子胥为江海涛神,是怕屈死的伍子胥亡灵变成厉鬼作祟。伍子胥在筑吴国都城和伐楚战争方面是有功于吴国的,然而他是楚人,他为了报家仇而不惜引敌国之兵攻入祖国,烧杀抢掠、奸淫妇女,还惨无人道地鞭尸,实在不值得后人称道。     

科学执政、民主执政中的依法执政基本途径

依法执政或依法行政,作为执政方式最为直接、最为具体的基本实践环节或途径,在相当范围内反映着科学执政、民主执政的实现程度。这取决于《行政许可法》不打折扣地坚决实施,政府的依法执政职能方式从重管制向重服务转变;职能范围从“全能”向“有限”回归;职能性质由“专断”走向真正“民主”;职能习惯从主观随意转向严格的法治。     

欧共体竞争法的实施机制及对我国的启示

欧盟理事会第1/2003号条例取代了1962年第17号条例,废除了原有的事前申报制度,实现了欧共体竞争法实施的非集权化,加强了欧盟委员会的调查权,由此确立了“非集权”的竞争法实施机制①。在新机制下,委员会负责制定和发展欧共体的竞争政策,实施欧共体竞争法的任务由各成员国承担。作为世界上最先进的竞争法体系之一,欧共体竞争法的最新发展对我国竞争法制的确立有重要的借鉴意义。     

拟正则图的最大边边连通度(英文)

定义了图的边边连通度,设计了一类具有最大边边连通度的拟正则图。     

Using a computer simulation game to teach family time use concepts

A computer simulation game designed to give students insights into family time use concepts has been used in an introductory family resource management class at Ohio State University and other universities. The game allows for planning for time use changes over the family life cycle. The game can give students insights into economic and sociological models of time use. It is possible that future versions of the game could be used in family counseling.His research interests include derivation of optimal decision-making rules for families and family financial management.Her research interests include financial management over the life course including financial ratios, baby boomers, and retirement. She received her Ph.D. in 1993 from The Ohio State University in Family Resource Management.His research interests include the time trade-offs made between couples, financial planning over the life cycle, and the interaction of time and money between families and their home-based businesses. He received his Ph.D. in 1993 from The Ohio State University in Family Resource Management.     

高Si/C高强度铸铁中C、Si、Si/C的作用及其选择

本文叙述了高Si/C高强度灰铸铁中碳、硅元素存在的形式及其对结晶过程的影响。试验表明,当碳当量一定时,随着Si/C的升高,初生奥氏体枝晶数量增多并且细化和强化,从而构成了强度的基础。该铸铁的强度模式应为“初生奥氏+共晶团”。本文对E型石墨存在的必然性和合理性也进行了讨论。     

Any complete preference structure without circuit admits an interval representation

This article proves that all complete preference structures where the strict preference relation (P) has no circuit admit a representation by intervals of the real line; the rule for deciding whether an interval is indifferent or preferred to another is less straightforward than for interval orders: strict preference is indeed compatible with a certain degree of overlapping of intervals, the allowed degree being specified by means of a so-called tolerance function.     

De minimis and equity in risk

Indices and orderings are developed for evaluating alternative strategies in the management of risk. They reflect the goals of reducing individual and collective risks, of increasing equity, and of assigning priority to the reduction and to the equity of high risks. Individual risk is defined as the (random or non-random) level of exposure to a danger. In particular the role of a lower negligibility level is investigated. A class of indices is proposed which involves two parameters, a negligibility level and a parameter of inequality aversion, and several interpretations of the indices are discussed. We provide a set of eight axioms which are necessary and sufficient for this class of indices, and we present an approach to deal with partial information on the parameters.     

A fast splitting procedure for classification trees

This paper provides a faster method to find the best split at each node when using the CART methodology. The predictability index is proposed as a splitting rule for growing the same classification tree as CART does when using the Gini index of heterogeneity as an impurity measure. A theorem is introduced to show a new property of the index : the for a given predictor has a value not lower than the for any split generated by the predictor. This property is used to make a substantial saving in the time required to generate a classification tree. Three simulation studies are presented in order to show the computational gain in terms of both the number of splits analysed at each node and the CPU time. The proposed splitting algorithm can prove computational efficiency in real data sets as shown in an example.