Open Review of Science Publications

Publication of scientific research in print is traditionally peer reviewed anonymously prior to publication, which is a time-tested process but has serious limitations. The advent of the Internet permits postpublication open review online after minimal review by the editors or the author-selected reviewers, which can be quick, that permits the authors to revise the content. Most meritorious articles published online may be selected for publication in print as annual or biennial collections.     

1969年前后美国改变对华遏制政策的理论基础与路径选择

1969年前后,国际冷战格局出现了美守苏攻态势,美国政府和领导人从国家利益出发迅速改变对华遏制政策,意图利用中国因素抗衡苏联。美国联合中国抗衡苏联的外交政策改变了国际冷战格局,影响十分深远。     

固气相变蒸发热的计算

用固体的Einstein模型与Debye模型分别导出相应模型的固气相变的蒸发热和蒸发压公式，并对其做数值计算。结果表明，蒸发热与温度之间近似呈线性关系,之与工程上经验近似是一致的。     

基于人文的现代营销行为

随着商品经济的发展和市场竞争的加剧，发达的商品经济以其高雅文化的面貌征服了人们的情感，表现为一种双赢的商品交易与极具亲和力的现代营销——“人文营销”。它使企业以人文要素为中心展开营销活动，通过营销整合，营造强烈的人文氛围，重视企业与企业之间、企业与消费者之间的良性沟通及人文关怀，强化竞争及交易双方的亲和力，从而实现有效营销。     

A Genetic Algorithm for the Weight Setting Problem in OSPF Routing

With the growth of the Internet, Internet Service Providers (ISPs) try to meet the increasing traffic demand with new technology and improved utilization of existing resources. Routing of data packets can affect network utilization. Packets are sent along network paths from source to destination following a protocol. Open Shortest Path First (OSPF) is the most commonly used intra-domain Internet routing protocol (IRP). Traffic flow is routed along shortest paths, splitting flow at nodes with several outgoing links on a shortest path to the destination IP address. Link weights are assigned by the network operator. A path length is the sum of the weights of the links in the path. The OSPF weight setting (OSPFWS) problem seeks a set of weights that optimizes network performance. We study the problem of optimizing OSPF weights, given a set of projected demands, with the objective of minimizing network congestion. The weight assignment problem is NP-hard. We present a genetic algorithm (GA) to solve the OSPFWS problem. We compare our results with the best known and commonly used heuristics for OSPF weight setting, as well as with a lower bound of the optimal multi-commodity flow routing, which is a linear programming relaxation of the OSPFWS problem. Computational experiments are made on the AT&T Worldnet backbone with projected demands, and on twelve instances of synthetic networks.     

HFC－134a水平管内流动沸腾换热研究的进展

在分析国外有关文献的基础上，对ＨＦＣ－１３４ａ水平管内流动沸腾换热研究的现状和已取得的成果进行了综述，指出了该领域进一步研究的方向．     

"过牧"的制度解释及治理的制度设计--对玛曲县人草畜紧张关系的制度经济学思考

黄河源区草地生态环境的恶化趋势,并没有因近几年政策的投入而得到遏制.因此,有必要对其形成原因及治理的制度结构进行分析,以厘清此类地区实现可持续发展所必需的制度创新.以黄河源区的玛曲县近三十年过牧历史为案例,对高寒牧区制度变迁中的路径依赖和锁定问题进行了新的阐释,并对可持续性的制度框架进行了设计.     

瞿秋白是探索"农村包围城市,武装夺取政权"的先驱

在1921年7月到1927年7月的毛泽东思想萌芽时期,瞿秋白提出中国革命必须以武装斗争--"革命战争"为主要形式;必须建立革命军队、党指挥枪、进行土地革命;必须建立"农民政权"--实际上就是建立农村革命根据地,以"农村包围城市"思想的萌芽.瞿秋白对中国革命道路理论的前所未有的探索是开拓性的贡献.瞿秋白是探索中国革命道路的先驱.     

A General Model of Some Inverse Combinatorial Optimization Problems and Its Solution Method Under l ∞ Norm

This paper proposes an optimization model and shows that most inverse combinatorial optimization problems so far discussed can be fit into this model as special cases. We propose a Newton-type algorithm for this model under l norm. This algorithm can solve the model in strongly polynomial time if the subproblem involved is solvable in strongly polynomial time for any fixed value of the parameter appearing in the subproblem, and it is shown that most particular inverse optimization problems encountered are this kind. Therefore, through this paper we show that a large group of inverse optimization problems can be handled in a uniform way and solved in strongly polynomial time.