The first synthesis of a water-soluble alpha-cyclodextrin/C-60 supramolecular complex using anionic C-60 as a building block

A novel supramolecular inclusion complex of alpha-CD/C-60 was synthesized using anionic C-60. The reaction progress was monitored in situ by visible and near-IR spectroscopy. The obtained complex was characterized by UV-vis, C-13 NMR, MALDI-TOF, and cyclic voltammetry. The induction and dispersion forces are considered to be the major driving forces for the formation of a resulting alpha-CD/C-60(.-) inclusion complex.

Mercaptoethane sulfonate protected, water-soluble gold and silver nanoparticles: Syntheses, characterization and their building, multilayer films with polyaniline via ion-dipole interactions

Mercaptoethane sulfonate protected, water-soluble gold and silver nanoparticles (Au-MES and Ag-MES) are synthesized by one-phase method and characterized by TEM, TGA and XPS techniques, UV-vis and FTIR spectra. Both Au-MES and Ag-MES nanoparticles are soluble in the water up to 2.0 mg/ml and the stability of AU-MES is much better than that of Ag-MES. When dissolved in the water. they behave like a polyanion and can be used to build multilayer films with polyaniline (PANI) by way of layer-by-layer. A new approach is presented to fabricate the Multilayer films of Au-MES/PANI and Ag-MES/PAN]. The assembly mechanism of these multilayer films is also discussed. We anticipate highly conducting PANI films can be obtained by doping with these nanoparticles.

New high-dimensional networks based on polyoxometalate and crown ether building blocks

Three novel supramolecular assemblies constructed from polyoxometalate and crown ether building blocks, [(DB18C6)Na(H2O)(1.5)](2)Mo6O19.CH3CN, 1, and [{Na(DB18C6)(H2O)(2)}(3)(H2O)(2)]XMo12O40.6DMF.CH3CN (X = P, 2, and As, 3; DB18C6 = dibenzo-18-crown-6; DMF = N,N-dimethylfomamide), have been synthesized and characterized by elemental analyses, IR, UV-vis, EPR, TG, and single crystal X-ray diffraction. Compound 1 crystallizes in the tetragonal space group P4/mbm with a = 16.9701(6) Angstrom, c = 14.2676(4) Angstrom, and Z = 2. Compound 2 crystallizes in the hexagonal space group P6(3)/m with a = 15,7435(17) Angstrom, c = 30.042(7) Angstrom, gamma = 120degrees, and Z = 2. Compound 3 crystallizes in the hexagonal space group P6(3)/m with a = 15.6882(5) Angstrom, c = 29.9778(18) Angstrom, gamma = 120degrees, and Z = 2. Compound 1 exhibits an unusual three-dimensional network with one-dimensional sandglasslike channels based on the extensive weak forces between the oxygen atoms on the [Mo6O19](2-) polyoxoanions and the CH2 groups of crown ether molecules, Compounds 2 and 3 are isostructural, and both contain a novel semiopen cagelike trimeric cation [{Na(DB18C6)(H2O)(2)}(3)(H2O)(2)](3+). In their packing arrangement, an interesting 2-D "honeycomblike" "host" network is formed, in which the [XMo12O40](3-) (X = As and P) polyoxoanion "guests" resided.

Olympic Robot Building Manual

The 1989 AI Lab Winter Olympics will take a slightly different twist from previous Olympiads. Although there will still be a dozen or so athletic competitions, the annual talent show finale will now be a display not of human talent, but of robot talent. Spurred on by the question, "Why aren't there more robots running around the AI Lab?", Olympic Robot Building is an attempt to teach everyone how to build a robot and get them started. Robot kits will be given out the last week of classes before the Christmas break and teams have until the Robot Talent Show, January 27th, to build a machine that intelligently connects perception to action. There is no constraint on what can be built; participants are free to pick their own problems and solution implementations. As Olympic Robot Building is purposefully a talent show, there is no particular obstacle course to be traversed or specific feat to be demonstrated. The hope is that this format will promote creativity, freedom and imagination. This manual provides a guide to overcoming all the practical problems in building things. What follows are tutorials on the components supplied in the kits: a microprocessor circuit "brain", a variety of sensors and motors, a mechanical building block system, a complete software development environment, some example robots and a few tips on debugging and prototyping. Parts given out in the kits can be used, ignored or supplemented, as the kits are designed primarily to overcome the intertia of getting started. If all goes well, then come February, there should be all kinds of new members running around the AI Lab!

Image Chunking: Defining Spatial Building Blocks for Scene Analysis

Rapid judgments about the properties and spatial relations of objects are the crux of visually guided interaction with the world. Vision begins, however, with essentially pointwise representations of the scene, such as arrays of pixels or small edge fragments. For adequate time-performance in recognition, manipulation, navigation, and reasoning, the processes that extract meaningful entities from the pointwise representations must exploit parallelism. This report develops a framework for the fast extraction of scene entities, based on a simple, local model of parallel computation.sAn image chunk is a subset of an image that can act as a unit in the course of spatial analysis. A parallel preprocessing stage constructs a variety of simple chunks uniformly over the visual array. On the basis of these chunks, subsequent serial processes locate relevant scene components and assemble detailed descriptions of them rapidly. This thesis defines image chunks that facilitate the most potentially time-consuming operations of spatial analysis---boundary tracing, area coloring, and the selection of locations at which to apply detailed analysis. Fast parallel processes for computing these chunks from images, and chunk-based formulations of indexing, tracing, and coloring, are presented. These processes have been simulated and evaluated on the lisp machine and the connection machine.

Inspection Methods in Programming

The work reported here lies in the area of overlap between artificial intelligence software engineering. As research in artificial intelligence, it is a step towards a model of problem solving in the domain of programming. In particular, this work focuses on the routine aspects of programming which involve the application of previous experience with similar programs. I call this programming by inspection. Programming is viewed here as a kind of engineering activity. Analysis and synthesis by inspection area prominent part of expert problem solving in many other engineering disciplines, such as electrical and mechanical engineering. The notion of inspections methods in programming developed in this work is motivated by similar notions in other areas of engineering. This work is also motivated by current practical concerns in the area of software engineering. The inadequacy of current programming technology is universally recognized. Part of the solution to this problem will be to increase the level of automation in programming. I believe that the next major step in the evolution of more automated programming will be interactive systems which provide a mixture of partially automated program analysis, synthesis and verification. One such system being developed at MIT, called the programmer's apprentice, is the immediate intended application of this work. This report concentrates on the knowledge are of the programmer's apprentice, which is the form of a taxonomy of commonly used algorithms and data structures. To the extent that a programmer is able to construct and manipulate programs in terms of the forms in such a taxonomy, he may relieve himself of many details and generally raise the conceptual level of his interaction with the system, as compared with present day programming environments. Also, since it is practical to expand a great deal of effort pre-analyzing the entries in a library, the difficulty of verifying the correctness of programs constructed this way is correspondingly reduced. The feasibility of this approach is demonstrated by the design of an initial library of common techniques for manipulating symbolic data. This document also reports on the further development of a formalism called the plan calculus for specifying computations in a programming language independent manner. This formalism combines both data and control abstraction in a uniform framework that has facilities for representing multiple points of view and side effects.

Building with Scottish Stone.

Building with Scottish Stone aims to encourage more use of stone sourced from Scotland’s working quarries and to provide a better understanding of those mineralogical properties which give each stone its distinctive quality. The nation’s architectural history is synonymous with the use of natural stone, and the principles of construction developed over generations in response to Scotland’s particular climatic conditions still find relevance today in the design and detailing of new buildings. Equally, an understanding of the ways in which stone is extracted and processed is as fundamental to its contemporary use as having up-to-date knowledge of the continuously changing legislation that affects its specification and procurement. Building with Scottish Stone is a stimulating introduction to these and many other factors to be considered when using this richly-varied and timeless resource in the design of new buildings.

Building knowledge repositories: partnership of sectors

Tedd, L.A. (2008). Building knowledge repositories: partnership of sectors. Presentation given at conference on Building Knowledge Repositories organised by the National Institute of Fashion Technology in Delhi, 7-9 February 2008. Delhi, India, February 2008.

Review of inspection techniques based on the elastic and inelastic scattering of X-rays and their potential in the food and agricultural industry

C.R. Bull, R. Zwiggelaar and R.D. Speller, 'Review of inspection techniques based on the elastic and inelastic scattering of X-rays and their potential in the food and agricultural industry', Journal of Food Engineering 33 (1-2), 167-179 (1997)

Inspection of teats by colour image analysis for automatic milking systems

C.R. Bull, N.J.B. McFarlane, R. Zwiggelaar, C.J. Allen and T.T. Mottram, 'Inspection of teats by colour image analysis for automatic milking systems', Computers and Electronics in Agriculture 15 (1), 15-26 (1996)

Building Responsive Systems from Physically-correct Specifications

Predictability - the ability to foretell that an implementation will not violate a set of specified reliability and timeliness requirements - is a crucial, highly desirable property of responsive embedded systems. This paper overviews a development methodology for responsive systems, which enhances predictability by eliminating potential hazards resulting from physically-unsound specifications. The backbone of our methodology is the Time-constrained Reactive Automaton (TRA) formalism, which adopts a fundamental notion of space and time that restricts expressiveness in a way that allows the specification of only reactive, spontaneous, and causal computation. Using the TRA model, unrealistic systems - possessing properties such as clairvoyance, caprice, in finite capacity, or perfect timing - cannot even be specified. We argue that this "ounce of prevention" at the specification level is likely to spare a lot of time and energy in the development cycle of responsive systems - not to mention the elimination of potential hazards that would have gone, otherwise, unnoticed. The TRA model is presented to system developers through the CLEOPATRA programming language. CLEOPATRA features a C-like imperative syntax for the description of computation, which makes it easier to incorporate in applications already using C. It is event-driven, and thus appropriate for embedded process control applications. It is object-oriented and compositional, thus advocating modularity and reusability. CLEOPATRA is semantically sound; its objects can be transformed, mechanically and unambiguously, into formal TRA automata for verification purposes, which can be pursued using model-checking or theorem proving techniques. Since 1989, an ancestor of CLEOPATRA has been in use as a specification and simulation language for embedded time-critical robotic processes.