Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem

In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics.     

人才招聘及评估模型的研究和实现

综述了互联网环境下人才招聘网站的应用现状，进而提出了面向政府及企事业单位选拔人才--站式服务的新思路；在给出了人才评估的分析模型后，对人才招聘及过滤进行了具体研究和实现．     

Fourier regularization for a backward heat equation

In this paper a simple and convenient new regularization method for solving backward heat equation—Fourier regularization method is given. Meanwhile, some quite sharp error estimates between the approximate solution and exact solution are provided. A numerical example also shows that the method works effectively.     

Results of the maximum genus of graphs

In this paper,we provide a new class of up-embeddable graphs,and obtain a tight lower bound on the maximum genus of a class of 2-connected pseudographs of diameter 2 and of a class of diameter 4 multi-graphs.This extends a result of Skoviera.     

Sufficient optimality conditions and duality in vector optimization with invex-convexlike functions

We prove the Kuhn-Tucker sufficient optimality condition, the Wolfe duality, and a modified Mond-Weir duality for vector optimization problems involving various types of invex-convexlike functions. The class of such functins contains many known generalized convex functions. As applications, we demonstrate that, under invex-convexlikeness assumptions, the Pontryagin maximum principle is a sufficient optimality condition for cooperative differential games. The Wolfe duality is established for these games.The author is indebted to the referees and Professor W. Stadler for valuable remarks and comments, which have been used to revise considerably the paper.     

对数似然比与整值随机变量序列的一类强律

本文引进对数似然比作为整值随机变量序列相对于服从几何分布的独立随机变量序列的偏差的一种度量,并通过限制对数似然比给出了样本空间的一个子集.在此子集上得到了一类用不等式表示的强律,其中包含整值随机变量序列与相对熵密度及几何分布的熵函数有关的若干极限性质.     

Time-resolved fluorescence study of the single tryptophan in thiocyanate and azide derivatives of horseradish peroxidase: Implication for a p H-induced conformational change in the heme cavity

Detailed pH-dependent steady state and picosecond time-resolved tryptophan fluorescence studies on thiocyanate and azide complexes of horseradish peroxidase have been carried out. The fluorescence decay of the single tryptophan in these species was fitted to a discrete three exponential model. Maximum entropy method analysis also gave three distinct regions of lifetime distributions. The fast subnanosecond lifetime component was found to have > 97% amplitude contribution while other two longer lifetime components have small contributions. Small contributions from the nanosecond lifetime components possibly arise from apoprotein impurity or some small amount of disordered heme conformer of the protein. pH dependence of the fast picosecond lifetime components was found to show a systematic behavior which has been interpreted in the light of obligatory conformation change associated with activation of the enzyme at low pH.     

最大度为6的极大外平面图的完备色数

证明了最大度为６的极大外平面图的完备色数为７。     

高考预效度的混合估计

用传统的预测效度估计法估计高考预测效度，其估计值往往偏低。为此，本文应用回归分析中混合估计理论提出了高考预测效度的混合估计。这种估计是预测效度的无偏估计，并解决了预测效度估计值偏低的问题。