EFFECT OF CRYSTAL-FIELD AND BONDING PROPERTIES ON SPECTRAL STRUCTURE OF EU-2+

Five Eu~(2+)-doped simple fluorides and six Eu~(2+)-doped complex fluorides are synthesized by solid reactions. The strength of the crystal-field at the sites of Eu~(2+) ion, and the degroe of covalenco of Eu—F bond in these hosts are discussed. The f-f transition emission of Eu~(2+) ion is observed in the hosts which has lower coordination number and strong crystal-field. The f-f transition emission of Eu~(2+) ion is observed for the first time in the simple fluoride AlF_3.

SPECTROPHOTOMETRIC DETERMINATION OF LANTHANUM AND SUM OF OTHER LIGHT RARE-EARTHS BY FLEXIBLE TOLERANCE SIMPLEX-METHOD

The absorptivities of color elements in a mixture can be obtained by using Gauas' elimination with selection of principal element in matrix to the standards. These values can be applied to flexible tolerance simplex method to give the composition of samples. In the exprimental design and data treatment, an effort was made to minimize the errors of results according the principal of optimization. When the difference of absorptivities of color material is significant to the exprimental error, the pr...

Spectral changes of C-phycocyanin with different molar ratios of SPDP

Pure C-phycocyanin was prepared from Spirulina platensis using one-step anion-exchange chromatography. The C-PC obtained was with an absorption maximum at 620 nm and a fluorescence emission maximum at 640 nm when excited by 580 nm. SPDP is an excellent heterobifunctional crosslinker for thiolating amines. Different molar ratios of SPDP have remarkable influence on the absorption and fluorescence spectra of C-phycocyanin. The absorption maximum and fluorescence emission maximum both decreased and blue-shifted from 640 run to 630 nm as the molar ratios of SPDP increased. It was found that the molar ratios of SPDP to C-phycocyanin was not more than 100 was appropriate to being conjugated with other biomolecules from the absorption and fluorescence spectra of C-phycocyanin.

成批生产计划调度的集成建模与优化

针对多品种批量生产类型,建立了调度约束的生产计划与调度集成优化模型。模型的目标函数是使总调整费用、库存费用及生产费用之和最小,约束函数包括库存平衡约束和生产能力约束,同时考虑了调度约束,即工序顺序约束和工件在单机上的加工能力约束,保证了计划可行性。该模型为两层混合整数规划模型,对其求解综合运用了遗传算法和启发式规则,提出了混合启发式求解算法。最后,针对某机床厂多品种批量生产类型车间进行了实例应用,对车间零件月份作业计划进行分解,得到各工段单元零件周作业计划,确定了零件各周生产批量与投产顺序。

Meta-Rules: Reasoning About Control

How can we insure that knowledge embedded in a program is applied effectively? Traditionally the answer to this question has been sought in different problem solving paradigms and in different approaches to encoding and indexing knowledge. Each of these is useful with a certain variety of problem, but they all share a common problem: they become ineffective in the face of a sufficiently large knowledge base. How then can we make it possible for a system to continue to function in the face of a very large number of plausibly useful chunks of knowledge? In response to this question we propose a framework for viewing issues of knowledge indexing and retrieval, a framework that includes what appears to be a useful perspective on the concept of a strategy. We view strategies as a means of controlling invocation in situations where traditional selection mechanisms become ineffective. We examine ways to effect such control, and describe meta-rules, a means of specifying strategies which offers a number of advantages. We consider at some length how and when it is useful to reason about control, and explore the advantages meta-rules offer for doing this.

Basis Reduction Algorithms and Subset Sum Problems

This thesis investigates a new approach to lattice basis reduction suggested by M. Seysen. Seysen's algorithm attempts to globally reduce a lattice basis, whereas the Lenstra, Lenstra, Lovasz (LLL) family of reduction algorithms concentrates on local reductions. We show that Seysen's algorithm is well suited for reducing certain classes of lattice bases, and often requires much less time in practice than the LLL algorithm. We also demonstrate how Seysen's algorithm for basis reduction may be applied to subset sum problems. Seysen's technique, used in combination with the LLL algorithm, and other heuristics, enables us to solve a much larger class of subset sum problems than was previously possible.

Breaking the Rules: writing reflectively for yourself.

The rules which epitomise good writing may on occasions be broken, deliberately and with what the writers judge to be good purpose. This can well occur when students or staff set out to engage effectively with their personal and professional development, through personal reflection on and in experiences. They may do this in what has been called “stream of consciousness” writing, which is deliberately compiled in a manner at variance with the general rules for best practice. The rationale for such an unusual decision, namely to engage in what is frankly disorderly writing, is set out briefly in this chapter. Its characteristics are summarised, in implicit contrast with more conventional styles of writing. Examples are included of claims for the effectiveness of this style when used for developmental purposes by students and staff; and reference is made to the publications of some of those who have endorsed this approach.

Adaptive denoising in spectral analysis by genetic programming

Rowland, J.J. and Taylor, J. (2002). Adaptive denoising in spectral analysis by genetic programming. Proc. IEEE Congress on Evolutionary Computation (part of WCCI), May 2002. pp 133-138. ISBN 0-7803-7281-6