LDS751染料的受激喇曼散射

报道了用532nm激光抽运LDS751染料产生720—780nm可调谐染料激光输出的同时,观察到喇曼频移为102和45cm-1的反斯托克斯线,前者谱线较强,后者较弱.与这两条强线对应的斯托克斯线未能观察到.另外,还观察到喇曼频移为34cm-1的一级和二级斯托克斯线与反斯托克斯线 关键词： LDS751染料 受激喇曼散射 喇曼位移 斯托克斯线 反斯托克斯线     

抗坏血酸同顺磁离子Mn~(2+)、Gd~(3+)络会的~(13)C NMR研究

该文用顺磁离子对其近邻~(13)C核的NMR吸收增宽效应,系统地研究了抗坏血酸在不同溶剂中对金属离子Mn~(2+)、Gd~(3+)的配合行为.在水溶液中,抗坏血酸可通过两种配合方式与Mn~(2+)作用,但与Gd~(3+)的作用只有一种稳定的结构.在水中抗坏血酸对金属的配位活性部位分别是1位羟基氧,3位离解的羟基氧和6位羟基氧.在DMSO中,3位羟基由于H~+对该基团的静电遮蔽而变得对金属离子Mn~(2+)表现为配位惰性,同时6位羟基配位活性较大增强.对Gd~(3+)来说,此时没有优势配位活性部位存在.文章还讨论了抗坏血酸在H_2O-DMSO混合溶剂中的~(13)C NMR谱及在DMSO中NaOH对其~(13)C NMR谱及其与金属络合结构的影响.     

The course scheduling problem at Lufthansa Technical Training

Lufthansa Technical Training GmbH (LTT) performs training courses for Lufthansa Technik AG as well as for several other international airlines. Courses of about 670 different types are offered of which several hundred take place each year. The course scheduling problem faced by LTT is to construct a yearly schedule which maximizes the profit margin incurred while meeting a variety of complex precedence, temporal, and resource-related constraints. A “good” operational schedule should also meet a number of additional subordinate objectives. We formalize the problem and develop a heuristic scheme along with several priority rules, as well as a local search algorithm to determine well-suited weights for weighted composite rules. The operational planning situation of 1996 served as our major test instance; additional test instances were constructed by modifying this data. Several computational experiments were carried out to evaluate the performance of the algorithms. It turned out that the best so-found schedule is substantially better in terms of the profit margin incurred than the solution manually constructed by LTT.     

Multinuclear magnetic resonance study of some mesoionic oxatriazoles containing nitrogenous exocyclic groups

¹H,¹³C,¹⁴N and¹⁵N NMR measurements are reported for four mesoionic 1-oxa-2, 3, 4-triazoles containing exocyclic nitrogenous groups. The NMR signal assignments are discussed and compared with those previously published for some corresponding oxatriazoles. The results obtained support the proposed cyclic mesoionic structures for the compounds studied. The questions of possible charge delocalization and valence tautomerism are addressed. Compound with N^– H as a exocyclic group (Fig. 1) is found to be relatively unstable, this is attributed to proton migration in the corresponding non-cyclic form of this molecule.Published in Khimiya Geterotsikiicheskikh Soedinenii, No. 9, pp. 1260–1263, September, 1995.     

Fast neighborhood search for the single machine total weighted tardiness problem

Most successful heuristics for solving 1||∑w_jT_j are based on swap moves. We present an algorithm which improves the complexity of searching the swap neighborhood from O(n³) to O(n²). We show that this result also improves the complexity of the recently developed dynasearch heuristics.     

A decomposition heuristics for the container ship stowage problem

In this paper we face the problem of stowing a containership, referred to as the Master Bay Plan Problem (MBPP); this problem is difficult to solve due to its combinatorial nature and the constraints related to both the ship and the containers. We present a decomposition approach that allows us to assign a priori the bays of a containership to the set of containers to be loaded according to their final destination, such that different portions of the ship are independently considered for the stowage. Then, we find the optimal solution of each subset of bays by using a 0/1 Linear Programming model. Finally, we check the global ship stability of the overall stowage plan and look for its feasibility by using an exchange algorithm which is based on local search techniques. The validation of the proposed approach is performed with some real life test cases. This work has been developed within the research area: “The harbour as a logistic node” of the Italian Centre of Excellence on Integrated Logistics (CIELI) of the University of Genoa, Italy     

The k-means range algorithm for personalized data clustering in e-commerce

This paper describes the k-means range algorithm, a combination of the partitional k-means clustering algorithm with a well known spatial data structure, namely the range tree, which allows fast range searches. It offers a real-time solution for the development of distributed interactive decision aids in e-commerce since it allows the consumer to model his preferences along multiple dimensions, search for product information, and then produce the data clusters of the products retrieved to enhance his purchase decisions. This paper also discusses the implications and advantages of this approach in the development of on-line shopping environments and consumer decision aids in traditional and mobile e-commerce applications.     

Response to high acidity and basicity at a platinum electrode in chronopotentiometry

A simple and rapid method is developed to determine the high acidity and the basicity of solutions by chronopotentiometry with a platinum working electrode. The acidity range from 5.0 mol/l H⁺ to 1.0 mol/l OH⁻ can be measured by the adjustment of deposition potential and time. The response mechanism to acidity and basicity has been explored. The transition potential plateau in chronopotentiograms is caused from the oxidation of hydrogen adsorbed on electrode surface.     

基于遗传禁忌算法的双资源约束下并行生产线调度研究

并行生产线调度问题兼有并行机器和流程车间调度问题的特点,是一类新型的调度问题。在考虑遗传算法早熟收敛特性和禁忌搜索法自适应优点的基础上,将遗传算法和禁忌搜索法结合起来,提出了基于遗传算法和禁忌搜索算法的双资源并行作业车间的调度优化问题算法,即考虑到了产品的调度受到机器、工人等资源制约的影响,对算法中种群的构造,适应度计算,遗传操作等方面进行了研究,最后给出了实例仿真和结论。