High-throughput screening of fuel cell electrocatalysts

The drawbacks of our earlier report of preparing fuel cell catalyst arrays by borohydride reduction of inkjet prepared arrays of metal salts are discussed along with the need for inclusion of state-of-the-art metrics in all array screening. An alternative method for screening of hydrogen/air cathode catalysts, direct methanol fuel cell (DMFC) anode catalysts, and catalyst loading studies is provided. State-of-the-art Johnson Matthey catalysts were used in control experiments to demonstrate the utility of the array fuel cell for high throughput screening of fuel cell catalysts in the 3-4 mg/cm² range. This report lays out hard learned rules for high throughput screening and demonstrates that the array fuel cell can be used for very precise screening of libraries of membrane electrode assembly (MEA) components without the pitfalls discussed in the introduction.     

Searching in trees

In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given.     

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.     

A comparison of two algorithms for the assignment problem

State-of-the-art computational results have shown that the shortest augmenting path (SAP) methods are more efficient than other primal-dual and primal-simplex based methods for solving the linear assignment problem on uniprocessor computers. There is, however, some controversy concerning their merits when compared with Bertsekas' auction algorithm on multiprocessor computers. In this study we investigate the performance of these competing methods on the Alliant FX/8. For each method, theoretical motivation, sources of parallelism and computational results are presented.     

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.     

搜索三个目标

本文通过建立简洁而有效的搜索方法 ,证明了对于无穷多个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.     

Branch and win: OR tree search algorithms for solving combinatorial optimisation problems

Currently, most combinatorial optimisation problems have to be solved, if the optimum solution is sought, using general techniques to explore the space of feasible solutions and, more specifically, through exploratory enumerative procedures in trees and search graphs. We propose Branch and Win, a general formulation for understanding and synthesising the different tree search procedures that have been presented in the literature of operations research as well as in that of artificial intelligence. Several general ideas are also presented, whose application allows designing new hybrid search algorithms, in order to implement the procedure.     

A Relationship Among Gentzen's Proof-Reduction,Kirby-Paris' Hydra Game and Buchholz's Hydra Game

We first note that Gentzen's proof-reduction for his consistency proof of PA can be directly interpreted as moves of Kirby-Paris' Hydra Game, which implies a direct independence proof of the game (Section 1 and Appendix). Buchholz's Hydra Game for labeled hydras is known to be much stronger than PA. However, we show that the one-dimensional version of Buchholz's Game can be exactly identified to Kirby-Paris' Game (which is two-dimensional but without labels), by a simple and natural interpretation (Section 2). Jervell proposed another type of a combinatorial game, by abstracting Gentzen's proof-reductions and showed that his game is independent of PA. We show (Section 3) that this Jervell's game is actually much stronger than PA, by showing that the critical ordinal of Jervell's game is φ_ω (0) (while that of PA or of Kirby-Paris' Game is φ₁ (0) = ?₀) in the Veblen hierarchy of ordinals.