Conformations and steric and stacking interactions of trisubstituted ureas and thioureas with alkyl and phenyl groups

The monomeric ν(N—H) vibrations of various trisubstituted ureas of the R₂UPh type and -thioureas of the R₂TUPh type have been studied. The trans—out isomerism in the former and the trans—out—cis isomerism in the latter are discussed from the point of view of steric effect. The monomeric ν(N—H) vibrations of RPhUPh and RPhTUPh are also examined. The single band appearing in the spectrum of both ureas is characteristic of the cis form; this suggests the existence of phenyl—phenyl interaction (the stacking interaction proposed by Galabov et al. [10]). Behavior of ν(N—H) vibrations at several concentrations is shown to be clearly different in the three forms (trans, out and cis). The presence of the cis form is confirmed by solvent effect experiments.     

基于"营养化学"通识课程综合互动性考评体系的建立与实施

以学生为中心,以学生能力培养为导向,设计"课堂辩论""社会调查""养生文化推广"三种考试形式,以实践形式从不同侧面考核学生综合运用所学知识的能力。学生自选考试形式,参与评分过程。对学生考试成绩的分析结果显示,各种考试形式及其评分标准合理、有效,能对学生综合素质给予全面系统的评估。     

Cut generation for an integrated employee timetabling and production scheduling problem

This paper investigates the integration of the employee timetabling and production scheduling problems. At the first level, we manage a classical employee timetabling problem. At the second level, we aim at supplying a feasible production schedule for a set of interruptible tasks with qualification requirements and time-windows. Instead of hierarchically solving these two problems as in the current practice, we try here to integrate them and propose two exact methods to solve the resulting problem. The former is based on a Benders decomposition while the latter relies on a specific decomposition and a cut generation process. The relevance of these different approaches is discussed here through experimental results.     

无机化学教学中过程化考核的实践

通过精心设计和实施课中提问、课后作业、单元练习和分组讨论(包括通过微信)等一系列过程化考核措施,即时掌握学生对知识的认识状态,及时调整教学进度,改进教学方法;学生在参与大量的过程化考核过程中也逐渐学会了大学化学的学习方法,并能掌握知识的精髓。     

A Tabu-Search Hyperheuristic for Timetabling and Rostering

Hyperheuristics can be defined to be heuristics which choose between heuristics in order to solve a given optimisation problem. The main motivation behind the development of such approaches is the goal of developing automated scheduling methods which are not restricted to one problem. In this paper we report the investigation of a hyperheuristic approach and evaluate it on various instances of two distinct timetabling and rostering problems. In the framework of our hyperheuristic approach, heuristics compete using rules based on the principles of reinforcement learning. A tabu list of heuristics is also maintained which prevents certain heuristics from being chosen at certain times during the search. We demonstrate that this tabu-search hyperheuristic is an easily re-usable method which can produce solutions of at least acceptable quality across a variety of problems and instances. In effect the proposed method is capable of producing solutions that are competitive with those obtained using state-of-the-art problem-specific techniques for the problems studied here, but is fundamentally more general than those techniques.     

Scheduling Classes on a College Campus

We consider the problem of scheduling a set of classes to classrooms with the objective of minimizing the number of classrooms used. The major constraint that we must obey is that no two classes can be assigned to the same classroom at the same time on the same day of the week. We present an algorithm that produces a nearly optimal schedule for an arbitrary set of classes. The algorithm's first stage produces a packing of classes using a combination of a greedy algorithm and a non-bipartite matching and the second stage consists of a bipartite matching.First we show that for one variant of the problem our algorithm produces schedules that require a number of classrooms that is always within a small additive constant of optimal. Then we show that for an interesting variant of the problem the same algorithm produces schedules that require a small constant factor more classrooms than optimal. Finally, we report on experimental results of our algorithm using actual data and also show how to create schedules with other desirable characteristics.     

第12届全国大学生化学实验邀请赛物理化学实验试题解析

对第12届全国大学生化学实验邀请赛物理化学实验操作考试试题命题、考试情况进行了总结,并对实验竞赛过程中反映出的当前实验教学所存在的问题进行了分析。     

Hybrid variable neighbourhood approaches to university exam timetabling

In this paper, we investigate variable neighbourhood search (VNS) approaches for the university examination timetabling problem. In addition to a basic VNS method, we introduce variants of the technique with different initialisation methods including a biased VNS and its hybridisation with a Genetic Algorithm. A number of different neighbourhood structures are analysed. It is demonstrated that the proposed technique is able to produce high quality solutions across a wide range of benchmark problem instances. In particular, we demonstrate that the Genetic Algorithm, which intelligently selects appropriate neighbourhoods to use within the biased VNS, produces the best known results in the literature, in terms of solution quality, on some of the benchmark instances. However, it requires relatively large amount of computational time. Possible extensions to this overall approach are also discussed.     

Scheduling fixtures for New Zealand Cricket

^** Email: m.wright{at}lancaster.ac.uk This paper describes the problem faced every year by New ZealandCricket in scheduling the principal inter-regional fixtures.This is a combinatorial optimization problem with few constraintsbut many objectives, which are described in detail. A techniqueknown as Subcost-Guided Simulated Annealing is used to solvethis problem, producing one or more schedules of high quality.One particular feature of the problem requires great care—thedetermination of adequate neighbourhoods for such a tightlyconstrained problem, where most simple changes lead to infeasibility.The approach adopted is to use a complex and unorthodox definitionof a perturbation, each one leading to several possible neighbouringsolutions which are generated by means of a tree search procedure.The system will be used in practice for the 2003–2004cricket season and beyond.     

聚苯胺／ZnO复合材料纳米线的制备及界面特性研究

为获得优异性能的纳／微米结构的有机一无机复合功能材料，进而探讨在纳／微米结构的电子器件或其它领域的潜在应用，在纳米线聚苯胺（PANi）悬浮液的存在下，采用水热方法进行了ZnO的生长，并用所制得的ZnO／PANi复合材料构筑了叉指结构的聚合物基柔性化学传感器原型器件。采用透射电镜（TEM）、X射线衍射（XRD）、X射线光...