We present the theoretical and technical foundations of the Amsterdam Density Functional (ADF) program with a survey of the characteristics of the code (numerical integration, density fitting for the Coulomb potential, and STO basis functions). Recent developments enhance the efficiency of ADF (e.g., parallelization, near order-N scaling, QM/MM) and its functionality (e.g., NMR chemical shifts,...

Boyland, E. & Manson, D. (1951). J. chem. Soc. p. 1837. Boyland, E., Ramsay, G. S. & Sims, P. (1961). Biochem. J. 78, 376. Boyland, E. & Sims, P. (1958). Biochem. J. 68, 440. Boyland, E. & Sims, P. (1960). Biochem. J. 77, 175. Boyland, E. & Sims, P. (1961). Rep. Brit. Emp. Cancer Campgn, 89, 50. Boyland, E. & Sims, P. (1962a). Biochem. J. 84, 564. Boyland, E. & Sims, P. (1962b). Biochem. J. 84,...

Balls, A. K., Thompson, R. R. & Walden, M. K. (1946). J. biol. Chem. 163, 571. Bals, A. K., Walden, M. K. & Thompson, R. R. (1948). J. biol. Chem. 178,9. Bell, D. J., Gutfreund, H., Cecil, R. & Ogston, A. G. (1948). Biochem. J. 42, 405. Bell, D. J. & Manners, D. J. (1952). J. chem. Soc. p. 3641. Bell, D. J. & Young, F. G. (1934). Biochem. J. 28, 882. Bird, R. & Hopkins, R. H. (1954). Biochem. J...

A graph G is said to be hyper-connected if the removal of every minimum cut creates exactly two connected components, one of which is an isolated vertex. In this paper, we first generalize the concept of hyper-connected graphs to that of semi-hyper-connected graphs: a graph G is called semi-hyper-connected if the removal of every minimum cut of G creates exactly two components. Then we characte...

Hyper-heuristics are methodologies used to search the space of heuristics for solving computationally di cult problems. We describe an object-oriented domain analysis for hyper-heuristics that orthogonally decomposes the domain into generative policy components. The framework facilitates the recursive instantiation of hyper-heuristics over hyper-heuristics, allowing further exploration of the p...

We compare deterministic finite automata (DFAs) and biautomata under the following two aspects: structural similarities between minimal and hyper-minimal automata, and computational complexity of the minimization and hyper-minimization problem. Concerning classical minimality, the known results such as isomorphism between minimal DFAs, and NL-completeness of the DFA minimization problem carry o...

This paper investigates a tabu assisted genetic algorithm based hyper-heuristic (hyper-TGA) for personnel scheduling problems. We recently introduced a hyper-heuristic genetic algorithm (hyper-GA) with an adaptive length chromosome which aims to evolve an ordering of low-level heuristics in order to find good quality solutions to given problems. The addition of a tabu method, the focus of this ...

1 The relationship between hypertext and L A T E X Unlike hyper market, hyper tension and hyper-activity, where the prefix hyper-expresses high quantity, and excess, hyper text is not a giant text, but a text with an internal structure that viewers can exploit to allow for non-linear navigation through the document.tian Rahtz, who apologize to Yannis for the massacre of his elegant writing styl...