This paper is concerned with the purpose and form of representations of strategic knowledge in design. A number of issues concerning the role of representations in design are considered. A distinction is made between representations for describing design and representations for guiding or prescribing design. Issues about the role and form of representations ‘of’ and ‘for’ design are considered ...

We present extensions to the GRJunction computer algebra program, which allow the study of null boundary surfaces and thin shells in general relativity. We summarize the null formalism due to Barrabès and Israel and highlight those steps which differ from the timelike/spacelike cases. GRJunction has been used to verify a number of results from the literature. We then present two new results cal...

The graph coloring problem (GCP) is a widely studied combinatorial optimization problem due to its numerous applications in many areas, including time tabling, frequency assignment, and register allocation. The need for more efficient algorithms has led to the development of several GC solvers. In this paper, the authors introduce a team of Finite Learning Automata, combined with the random wal...

METHODS The effect of glucose, cellobiose and xylose on the regulation of cellulolytic activity in Cellulomonas sp. ZZbc was investigated. The addition of 1% glucose, cellobiose or xylose to actively growing bagasse pith cultures repressed the cellulose system. No enzyme inactivation by sugar concentrations up to 1.5% was detected. Both cellobiose and xylose, at concentrations ranging from 0.00...

Hormone therapy is a viable technique used to treat endocrine receptor positive cancers. Using the recently developed theory of cancer networks, we create a mathematical model describing the growth of an estrogen-receptive cancer governed by a linear cancer network. We then present hormone therapy as a drug that blocks the estrogen receptors of different cells in the network. Depending on the e...

Modern metaheuristic methodologies rely on well defined neighborhood structures and efficient means for evaluating potential moves within these structures. Move mechanisms range in complexity from simple 1-flip procedures where binary variables are “flipped” one at a time, to more expensive, but more powerful, r-flip approaches where “r” variables are simultaneously flipped. These multi-exchang...