Future pathways for combinatorial chemistry

Summary Investment in combinatorial chemistry (combichem) in the pharmaceutical industry is being driven by the need for increased efficiency. Results from pioneers in the field have demonstrated where mixture or discrete compound synthesis is useful, and what mixture sizes and compound concentrations are appropriate. To make the techniques of combichem of general utility in drug discovery, a broad range of advances is still required. Conversion of organic chemistry to solid phase conditions is key, as are developments in linkers and resins. Library design methodology requires further development. Combinatorial biosynthesis of focused libraries of natural products holds great promise for capitalising on hardwon natural product leads. Miniaturisation of screens is required to reduce the cost of screening combinatorial libraries. Developments in the processes preceding and following synthesis are required to enable the flow of increased numbers of compounds without new bottlenecks developing. The impact of combinatorial chemistry will be greatly enhanced by synergy with ongoing parallel developments in genetic technologies, screening technologies and bioinformatics.     

An optimization algorithm for a penalized knapsack problem

We study a variation of the knapsack problem in which each item has a profit, a weight and a penalty; the sum of profits of the selected items minus the largest penalty associated with the selected items must be maximized. We present an ILP formulation and an exact optimization algorithm.     

Jack van Lint (1932-2004): A survey of his scientific work

When Jack van Lint was appointed as full professor at the Eindhoven University of Technology at the age of 26 he combined a PhD in number theory with a very open scientific mind. It took a sabbatical visit to Bell Laboratories in 1966 to make him understand that a new and fascinating field of applied mathematics was emerging: discrete mathematics. It fascinated and inspired him for the rest of his life. When he passed away on September 28, 2004, he left behind a legacy of 18 books and 177 articles, covering many aspects of coding theory, combinatorics, and finite geometry.van Lint was also a strong international advocate of the role that discrete mathematics ought to play in modern applied mathematics curricula. Quite a few departments sought his advice. Years later, four different universities showed their appreciation by awarding him an honorary degree.This overview is an homage to van Lint's academic achievements and can serve as an introduction to his work for younger generations.     

Biomagnetic measurements utilising a superparamagnetic marker: a feasibility study

Summary A preliminary study is here reported on a new potential marker for biomagnetic measurements. The marker consists of superparamagnetic polymer microspheres which were detected in the presence of external steady magnetic fields by means of an r.f.-SQUID magnetometer. The particles were prepared in samples differing in the concentration value and immersed in a homogeneous magnetic field of variable intensity. A simple model was taken into account for the distribution of the microspheres in the samples, so that the theoretical values were compared to the marker field values measured by the biomagnetic sensor. The overall sensitivity of the experimental apparatus and the minimum concentration value of the marker were then estimated.     

Combinatorial computational chemistry approach of tight-binding quantum chemical molecular dynamics method to the design of the automotive catalysts

Recently, we have developed a new tight-binding quantum chemical molecular dynamics program “Colors” for combinatorial computational chemistry approach. This methodology is based on our original tight-binding approximation and realized over 5000 times acceleration compared to the conventional first-principles molecular dynamics method. In the present study, we applied our new program to the simulations on various realistic large-scale models of the automotive three-way catalysts, ultrafine Pt particle/CeO₂(111) support. Significant electron transfer from the Pt particle to the CeO₂(111) surface was observed and it was found to strongly depend on the size of the Pt particle. Furthermore, our simulation results suggest that the reduction of the Ce atom due to the electron transfer from the Pt particle to the CeO₂ surface is a main reason for the strong interaction of the Pt particle and CeO₂(111) support.     

Bioaccumulation and excretion of arsenic compounds by a marine unicellular alga,polyphysa peniculus

Polyphysa peniculus was grown in artificial seawater in the presence of arsenate, arsenite, monomethylarsonate and dimethylarsinic acid. The separation and identification of some of the arsenic species produced in the cells as well as in the growth medium were achieved by using hydride generation–gas chromatography–atomic absorption spectrometry methodology. Arsenite and dimethylarsinate were detected following incubation with arsenate. When the alga was treated with arsenite, dimethylarsinate was the major metabolite in the cells and in the growth medium; trace amounts of monomethylarsonate were also detected in the cells. With monomethylarsonate as a substrate, the metabolite is dimethylarsinate. Polyphysa peniculus did not metabolize dimethylarsinic acid when it was used as a substrate. Significant amounts of more complex arsenic species, such as arsenosungars, were not observed in the cells or medium on the evidence of flow injection–microwave digestion–hydride generation–atomic absorption spectrometry methodology. Transfer of the exposed cells to fresh medium caused release of most cell–associated arsenicals to the surrounding environment.     

中国西南武陵山区跳蛛新种记述（蜘蛛目：跳蛛科）

本文记述跳蛛科13个新种,采自西南武陵山地区。暗跳蛛Asemonea、列锡蛛Lycidas和法老蛛Pharacocerus 3属为我国新记录属。     

搜索三个目标

本文通过建立简洁而有效的搜索方法 ,证明了对于无穷多个n来说 ,三个目标的最优搜索问题的最小试验次数等于信息论下界 .同时也研究了上述问题的修正情形 ,证明了对于所有整数n来说 ,对应的最小试验次数或者等于信息论下界或者超过信息论下界 1次并且对于无穷多个区间 ,信息论下界均是可以达到的 .     

Near-optimal design of Global Positioning System (GPS) networks using the Tabu Search technique

This paper describes an optimization technique based on an heuristic procedure which is applied to analyse and improve the efficiency of the design of Global Positioning System (GPS) surveying networks. GPS is a valuable survey tool because of its ability to increase the accuracy, speed and flexibility of a survey. A GPS network can be defined as a number of stations, which are co-ordinated by a series of sessions, formed by placing receivers on stations. The goal is to select the best order in which these sessions can be organised to give the best possible schedule. Generally, solving large networks to optimality requires impractical computational time. This paper proposes a Tabu Search technique which provides optimal or near-optimal solutions for large networks with an acceptable amount of computational effort. Computational results for several case studies with known and unknown optimal schedules have been presented to assess the performance of the proposed technique.