世纪的误读与隔膜——冰心人生问题小说的文化价值解读

冰心是初登文坛就获得巨大影响的作家,回到历史现场,会发现其世纪初的影响,主要来自人生问题小说的创作,然而,评论界和文学史对于冰心人生问题小说的评价,历来都不算高。这一世纪的隔膜,来自文化观念与文学观念的隔膜。冰心人生问题小说对人生意义与价值的追问,切入到了转型时代最深层的意义虚空,呈现了小说是展示存在的文体文化本质,具有不可忽视的文化价值。      

多资源受限条件下工程集成管理优化问题研究

本文建立了多资源受限条件下工程集成管理优化的模型,该模型的求解属于国际上公认的NP-hard难题之一,利用基于优先权的编码技术使得模型的求解成为可能,提出同时具有惯性权重和限定因子参数的改进版本微粒群算法,编制其matlab求解源程序,运用在以管道水平定向钻穿越工程为实例的集成管理优化模型中,微粒群算法程序在求解过程表现出了高效的搜索能力,获得了满意的优化结果。最后,着重讨论了在微粒群算法参数设计中微粒个体意识与集体意识的比较分析和微粒群种群规模与协同搜索能力的关系。     

Simple Efficient Contracts in Complex Environments

This paper studies a general model of holdup in a setting encompassing the models of Segal (1999) and Che and Hausch (1999) among others. It is shown that if renegotiation is modeled as an infinite‐horizon noncooperative bargaining game, then, with a simple initial contract, an efficient equilibrium will generally exist. The contract is robust in the sense that it does not depend on fine details of the model. The contract gives authority to one party to set the terms of trade and gives the other party a nonexpiring option to trade at these terms. The difference from standard results arises because the initial contract ensures that the renegotiation game has multiple equilibria; the multiplicity of continuation equilibria can be used to enforce efficient investment.     

Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem

In a previous work we proposed a variable fixing heuristics for the 0-1 Multidimensional knapsack problem (01MDK). This approach uses fractional optima calculated in hyperplanes which contain the binary optimum. This algorithm obtained best lower bounds on the OR-Library benchmarks. Although it is very attractive in terms of results, this method does not prove the optimality of the solutions found and may fix variables to a non-optimal value. In this paper, we propose an implicit enumeration based on a reduced costs analysis which tends to fix non-basic variables to their exact values. The combination of two specific constraint propagations based on reduced costs and an efficient enumeration framework enable us to fix variables on the one hand and to prune significantly the search tree on the other hand. Experimentally, our work provides two main contributions: (1) we obtain several new optimal solutions on hard instances of the OR-Library and (2) we reduce the bounds of the number of items at the optimum on several harder instances.     

我国产业结构演变的历史进程与现实问题分析

改革开放以来,我国产业结构演变进程可大致分为三个发展阶段:产业结构演变的加速发展阶段(1978～1991年)、产业结构演变的深化发展阶段(1992～2001年)和产业结构演变的提升发展阶段(2002年至今)。产业结构合理化水平不高和产业结构高级化水平不够仍然是我国产业结构演变进程中面临的主要现实问题,需要全面提升产业结构的合理化和高级化水平,促进产业结构优化升级。     

自主性游戏中教师回应行为调查研究

教师恰当的回应行为能够促进幼儿自主性游戏水平的逐步提高。本次研究旨在对自主性游戏中幼儿教师的回应行为现状进行质化与量化相结合的研究,通过笔者的非参与性观察和对幼儿教师的问卷及访谈,收集资料,并对数据进行统计,从回应行为的次数及回应方式、回应类型多角度进行分析。结果表明：自主性游戏中缺乏教师回应行为;幼儿教师的消极回应占据主要比重;回应行为模式化,教师无法正确把握回应的时机与方式。在此基础上,笔者提出了相关建议,以期帮助幼儿教师进一步提高在自主性游戏中的回应能力,从而提高幼儿的自主性游戏水平。     

基于三阶段DEA模型的嘉兴海洋产业效率

运用三阶段DEA（数据包络分析）模型对嘉兴市2006-2010年海洋产业效率进行研究表明:嘉兴市海洋产业发展处于规模报酬递减阶段;市场占有率提高有利于提高嘉兴市海洋产业效率;国有制形式是嘉兴市海洋产业效率的不利因素;企业资本结构对海洋产业效率的影响具有不确定性。     

浅谈城市民族问题

城市大多是一个地方或地区的政治、经济、文化的中心 ,人口流动性大 ,社会影响力强。加之现在流动到城市的少数民族越来越多 ,城市民族问题与其他社会问题掺杂在一起 ,具有敏感性、辐射性、连锁反应性等特点。城市民族关系已经成为反映我国民族关系好坏的晴雨表。因此 ,研究城市民族问题意义十分重大。本文将从城市少数民族的特点 ,城市民族问题及其主要内容、特点 ,城市民族问题与城市民族工作等五方面分析、论述城市民族问题。     

Lower bounds and a tabu search algorithm for the minimum deficiency problem

An edge coloring of a graph G=(V,E) is a function c:E→ℕ that assigns a color c(e) to each edge e∈E such that c(e)≠c(e′) whenever e and e′ have a common endpoint. Denoting S _v (G,c) the set of colors assigned to the edges incident to a vertex v∈V, and D _v (G,c) the minimum number of integers which must be added to S _v (G,c) to form an interval, the deficiency D(G,c) of an edge coloring c is defined as the sum ∑ _v∈V D _v (G,c), and the span of c is the number of colors used in c. The problem of finding, for a given graph, an edge coloring with a minimum deficiency is NP-hard. We give new lower bounds on the minimum deficiency of an edge coloring and on the span of edge colorings with minimum deficiency. We also propose a tabu search algorithm to solve the minimum deficiency problem and report experiments on various graph instances, some of them having a known optimal deficiency.