This paper presents a method of searching for the shortest route via the most designated points with the length not exceeding the preset upper bound. The proposed algorithm can obtain the quasi-optimum route efficiently and its effectiveness is verified by applying the algorithm to the actual map data. key words: routing, genetic algorithm, designated points, upper bound constraint, building bl...

A new azide functionalized Anderson polyoxometalate was synthesized, fully characterized and subsequently used as a building block for further POM post-functionalization with organic compounds through a copper catalyzed azide-alkyne cycloaddition (CuAAC) reaction. Optimization of the reaction conditions led to an efficient, fast, convenient and versatile POM coupling method.

This paper presents the first application of two recently developed reactions to natural product synthesis. The first method involves a 6-endo-trig cyclization to prepare a versatile chiral enaminone building block. The second is a direct C-H arylation reaction. As a showcase for the utility of these methods, (+)-antofine and (+)-ipalbidine were synthesized in only 8 steps and 24-26% overall yi...

One pragmatic way to improve compound quality, while enhancing and accelerating drug discovery projects, is the ability to access a high quality, novel, diverse building block collection. Here, we outline general principles that should be applied to ensure that a building block collection has the greatest impact on drug discovery projects, by discussing design principles for novel reagents and ...

We introduce a method for computing the difference between a pattern string (data block or file) and a much larger, iteratively updated set of strings (an entire file system or cache thereof), while only examining a small fraction of this set. We show how our method generalizes existing algorithms used in a unique block storage system (venti), and a low bandwidth network file system (LBFS), and...

This paper presents a new simple and straightforward method for designing Self-Testing Embedded (STE) parity checkers. The building block is the two-input XOR gate. During normal, fault-free operation, each XOR gate receives all possible input vectors. The great advantage of the proposed method is that it is the only one that gives, in a simple and straightforward way, optimal STE realizations ...