Symmetry of the Barochronous Motions of a Gas

We study the system of nonlinear differential equations which expresses the constancy of the algebraic invariants of the Jacobian matrix for smooth vector fields in three-dimensional space. This system is equivalent to the equations of gas dynamics which describe the barochronous motions of a gas (the pressure and density depend only on the time). We present the results of computation of the admissible local Lie group and construction of the general solution of the system. We mention a few new problems that arise here.     

壮岱侬花婆神话与中越文学交流态势

壮岱侬民族拥有同中有异的花婆神话。通过对它的分析,可以发现,中越文学的交流态势,实际上是建立在带有女性主义色彩的生态伦理缔结与交往的基础之上的。     

在课程研究与教学中渗透人文关怀——"陶渊明研究"教学示例

结合具体课程的研究与教学,从内容和方法两方面贴近学生生存与发展的需要,突出学生学习的主体性,重视师生的交流与对话,在学术研究的同时落实人文关怀的教育理念,努力培养大学生高尚的人格、情感、气质和人生信念,构建健康和谐的精神家园.     

论数字时代地方文献目录之编制

从咨访文献学家、选择合适人才、搜集地方文献书目信息等角度探讨了关于编制地方文献目录的问题。     

高校学科文献资源的科学配置机制及管理体制研究

提出了高等学校实行学科文献资源科学配置的机理及原则,探讨了在网络环境下如何建立有核心竞争力的学科文献资源管理体制。     

日文文献编目初探

从文字、文献责任者、编目规则等方面对若干日文文献主要著录问题进行了阐述。     

浅谈江汉大学图书馆外文文献书目回溯建库

分析了外文书刊书目回溯建库的必要性,介绍了江汉大学图书馆外文书目数据库建设现状,对其外文书刊书目回溯建库提出了几点建议。     

Structure theorem for tournaments omitting N5

A finite tournament T is tight if the class of finite tournaments omitting T is well‐quasi‐ordered. We show here that a certain tournament N₅ on five vertices is tight. This is one of the main steps in an exact classification of the tight tournaments, as explained in [10]; the third and final step is carried out in [11]. The proof involves an encoding of the indecomposable tournaments omitting N₅ by a finite alphabet, followed by an application of Kruskal's Tree Theorem. This problem arises in model theory and in computational complexity in a more general form, which remains open: the problem is to give an effective criterion for a finite set {T₁,…,T_k} of finite tournaments to be tight in the sense that the class of all finite tournaments omitting each of T₁,…,T_k is well‐quasi‐ordered. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 165–192, 2003     

Finding Robust Solutions Using Local Search

This paper investigates how a local search metaheuristic for continuous optimisation can be adapted so that it finds broad peaks, corresponding to robust solutions. This is relevant in problems in which uncertain or noisy data is present. When using a genetic or evolutionary algorithm, it is standard practice to perturb solutions once before evaluating them, using noise from a given distribution. This approach however, is not valid when using population-less techniques like local search and other heuristics that use local search. For those algorithms to find robust solutions, each solution needs to be perturbed and evaluated several times, and these evaluations need to be combined into a measure of robustness. In this paper, we examine how many of these evaluations are needed to reliably find a robust solution. We also examine the effect of the parameters of the noise distribution. Using a simple tabu search procedure, the proposed approach is tested on several functions found in the literature. This revised version was published online in August 2006 with corrections to the Cover Date.