周文讽刺小说论

集革命者和小说家为一身的周文,其讽刺小说继承、发扬了鲁迅开创的新文学讽刺传统,坚持从内蕴着自己生命体验的生活领域取材,塑造出一批以旧军阀（官僚）为主体的典型性讽刺人物形象,并形成了自己反腐朽、反庸俗、反奴性的基本讽刺主题与冷静、犀利、含而不露却又有浓郁喜剧色彩的讽刺美学风格。独特的讽刺艺术,是沟通周文革命实践与艺术实践的桥梁。     

扩张财政政策对内外均衡的影响分析 ——基于篮子货币汇率制度下的蒙代尔—弗莱明模型

 内容提要：本文根据中国当前的实际情况，对经典的M-F模型进行了修正，提出了基于篮子货币汇率制度的M-F模型，并在修正的M-F模型框架下对扩张财政政策对国民收入的影响效力进行了理论和实证分析。本文在前述分析的基础上进一步分析了财政支出对国内消费的决定作用。最后本文基于以上的分析，针对当前中国内外失衡的现状，提出当前政府应实施扩张的财政政策、优化财政支出结构等相关对策建议。     

A better constant-factor approximation for weighted dominating set in unit disk graph

This paper presents a (10+ε)-approximation algorithm to compute minimum-weight connected dominating set (MWCDS) in unit disk graph. MWCDS is to select a vertex subset with minimum weight for a given unit disk graph, such that each vertex of the graph is contained in this subset or has a neighbor in this subset. Besides, the subgraph induced by this vertex subset is connected. Our algorithm is composed of two phases: the first phase computes a dominating set, which has approximation ratio 6+ε (ε is an arbitrary positive number), while the second phase connects the dominating sets computed in the first phase, which has approximation ratio 4. This work is supported in part by National Science Foundation under grant CCF-9208913 and CCF-0728851; and also supported by NSFC (60603003) and XJEDU.     

深化大学英语改革的几点思考——基于网络的计算机辅助教学在大学英语教学改革中的运用

作为教育部大学英语教学改革试点院校,我们取得了不少成绩也获得了不少经验。但是改革中涌现出来的问题也需要我们去思考。本文着重讨论了什么是"以学生为中心"的课堂模式,如何协调计算机辅助教学与教师的作用并强烈呼吁应根据地方有限资源采取多元化的教学模式。     

华东地区农村中小学教育建筑的展望

通过对华东地区过去与现在中小学教育建筑状况的分析比较,运用实例总结归纳了两个时间段农村教育建筑的弊端以及改进措施,提出了对未来中小学建筑的展望;同时,结合自然的、历史的、社会的、人文的多重因素,对农村教育建筑的发展做出了关联与探讨。     

An Approximation for Minimum Multicast Route in Optical Networks with Nonsplitting Nodes

Consider the problem of computing the minimum-weight multicast route in an optical network with both nonsplitting and splitting nodes. This problem can be reduced to the minimum Hamiltonian path problem when all nodes are nonsplitting, and the Steiner minimum tree problem when all nodes are splitting. Therefore, the problem is NP-hard. Previously, the best known polynomial-time approximation has the performance ratio 3. In this paper, we present a new polynomial-time approximation with performance ratio of 1+ρ, where ρ is the best known approximation performance ratio for the Steiner minimum tree in graph and it has been known that ρ < 1.55. Support in part by National Science Foundation under grants CCF-0514796 and CNS-0524429     

Efficient algorithms for supergraph query processing on graph databases

We study the problem of processing supergraph queries on graph databases. A graph database D is a large set of graphs. A supergraph query q on D is to retrieve all the graphs in D such that q is a supergraph of them. The large number of graphs in databases and the NP-completeness of subgraph isomorphism testing make it challenging to efficiently processing supergraph queries. In this paper, a new approach to processing supergraph queries is proposed. Specifically, a method for compactly organizing graph databases is first presented. Common subgraphs of the graphs in a database are stored only once in the compact organization of the database, in order to reduce the overall cost of subgraph isomorphism testings from the stored graphs to queries during query processing. Then, an exact algorithm and an approximate algorithm for generating the significant feature set with optimal order are proposed, followed by the algorithms for indices construction on graph databases. The optimal order on the feature set is to reduce the number of subgraph isomorphism testings during query processing. Based on the compact organization of graph databases, a novel algorithm for testing subgraph isomorphisms from multiple graphs to one graph is presented. Finally, based on all the above techniques, a query processing method is proposed. Analytical and experimental results show that the proposed algorithms outperform the existing similar algorithms by one to two orders of magnitude.     

A greedy algorithm for the fault-tolerant connected dominating set in a general graph

Using a connected dominating set (CDS) to serve as the virtual backbone of a wireless network is an effective way to save energy and alleviate broadcasting storm. Since nodes may fail due to an accidental damage or energy depletion, it is desirable that the virtual backbone is fault tolerant. A node set \(C\) is an \(m\) -fold connected dominating set ( \(m\) -fold CDS) of graph \(G\) if every node in \(V(G)\setminus C\) has at least \(m\) neighbors in \(C\) and the subgraph of \(G\) induced by \(C\) is connected. In this paper, we will present a greedy algorithm to compute an \(m\) -fold CDS in a general graph, which has size at most \(2+\ln (\Delta +m-2)\) times that of a minimum \(m\) -fold CDS, where \(\Delta \) is the maximum degree of the graph. This result improves on the previous best known performance ratio of \(2H(\Delta +m-1)\) for this problem, where \(H(\cdot )\) is the Harmonic number.     

Improvement of path analysis algorithm in social networks based on HBase

When social network has reached hundreds of million users, the analysis of data in social network services becomes very important. Understanding how nodes interconnect in large graphs is an essential problem in many fields. In order to find connecting nodes between two nodes or two groups of source nodes in huge graphs, we propose a parallelized data-mining algorithm to get the shortest path between nodes in a social network based on HBase distributed key/value store. Our algorithm can achieve the shortest path among different nodes in network under the parallel environment. We analyze the social network model by this algorithm first, and then optimize the output from cloud platform by using the intermediary degrees and degree central algorithm. Finally, with a simulated social network, we validate the efficiency of the proposed algorithm. The experiment results indicate that our algorithm can improve the efficiency of parallel breath-first search (BSF).     

Constructing weakly connected dominating set for?secure clustering in distributed sensor network

Secure clustering problem plays an important role in distributed sensor networks. Weakly Connected Dominating Set (WCDS) is used for solving this problem. Therefore, computing a minimum WCDS becomes an important topic of this research. In this paper, we compare the size of Maximal Independent Set (MIS) and minimum WCDS in unit disk graph. Our analysis shows that five is the least upper bound for this ratio. We also present a distributed algorithm to produce a weakly connected MIS within a factor 5 from the minimum WCDS.