Porous mullite ceramics through diphasic gels of large boehmite and small silica particles

Mullite formation process has been studied in stoichiometric mullite (3Al₂O₃·2SiO₂) diphasic gel containing large boehmite (1 m) and small silica (10 nm) particles. It has been found that initial mullitization did not take place inside the silica phase (cristobalite), but took place in the defect -alumina phase. -alumina was stabilized by silica when the temperature was below 1350°C. At temperatures above 1350°C, mullite crystallized directly. It was suggested that silica diffused into the pores (<1.8 nm) of -alumina and prevented the collapse of -alumina pore structure. On the other hand, when silica was not present, the pore structure of -alumina collapsed and -alumina crystallized at 1100°C. Porous mullite ceramics were obtained by using special diphasic gels containing large boehmite and small silica particles.     

Nanocomposite route to the stabilization of porous ϑ-alumina

Stabilization of -alumina phase by silica was studied in nanocomposite (diphasic) alumina-silica gels by XRD and BET surface areas measurements. Five wt.% of silica (22 nm particles) increased the crystallization temperature of to -alumina by about 100°C from boehmite (10 nm particles) derived alumina. Stabilization of -alumina was caused by the formation of intimate contact (Al-O-Si) between components by diffusion of silica into the defect alumina structure.Also with the Department of Agronomy.     

Study of the telomerization of dimethylaminoethyl methacrylate (DMAEMA) with mercaptoethanol. Application to the synthesis of a new macromonomer

The telomerization of dimethylaminoethyl methacrylate (DMAEMA) with mercaptoethanol initiated by 2,2′-azobisisobutyronitrile was first investigated at 70 °C and the influence of the type of solvent was studied. The results showed that well-defined telomers of DMAEMA could not be synthetized via telomerization of DMAEMA in water or water/acetonitrile mixture since the telomerization reaction is in competition with the nucleophilic addition of thiol onto the monomer. Transfer constants for mercaptoethanol in benzene and acetonitrile were determined by Mayo's and O'Brien's methods. The transfer constant obtained in acetonitrile (0,6) was higher than that obtained in benzene. This difference can be explained by the fact that the thiol was consumed by two reactions: nucleophilic addition and telomerization. The influence of solvents on the polymerization kinetics was enlightened. These results were applied to the synthesis of macromonomers of DMAEMA with isocyanatoethyl methacrylate (IEM). These macromonomers were copolymerized with styrene.     

Sinusoidal disturbance induced topology identification of Hindmarsh-Rose neural networks正弦扰动诱导复杂网络拓扑识别

Topology identification of complex networks is an important problem. Existing research shows that the synchronization of network nodes is an obstacle in the identification of network topology. Identification of the structure of the network presents an interesting challenge during the synchronization of complex networks. We developed a new method using the sinusoidal disturbance to identify the topology when the complex network achieves synchronization. Compared with the disturbance of all the nodes, the disturbance of the key nodes alone can achieve a very good effect. Finally, numerical simulation data are provided to validate our hypothesis.     

Iterative delta debugging

Automated debugging attempts to locate the reason for a failure. Delta debugging minimizes the difference between two inputs, where one input is processed correctly while the other input causes a failure, using a series of test runs to determine the outcome of applied changes. Delta debugging is applicable to inputs or to the program itself, as long as a correct version of the program exists. However, complex errors are often masked by other program defects, making it impossible to obtain a correct version of the program through delta debugging in such cases. Iterative delta debugging extends delta debugging and removes a series of defects step by step, until the originally unresolved defect is isolated. The method is automated and managed to localize a bug in some real-life examples.     

A multi-step differential transform method and application to non-chaotic or chaotic systems

The differential transform method (DTM) is an analytical and numerical method for solving a wide variety of differential equations and usually gets the solution in a series form. In this paper, we propose a reliable new algorithm of DTM, namely multi-step DTM, which will increase the interval of convergence for the series solution. The multi-step DTM is treated as an algorithm in a sequence of intervals for finding accurate approximate solutions for systems of differential equations. This new algorithm is applied to Lotka–Volterra, Chen and Lorenz systems. Then, a comparative study between the new algorithm, multi-step DTM, classical DTM and the classical Runge–Kutta method is presented. The results demonstrate reliability and efficiency of the algorithm developed.     

Large scale multiple robot visual mapping with heterogeneous landmarks in semi-structured terrain

This paper addresses the cooperative localization and visual mapping problem with multiple heterogeneous robots. The approach is designed to deal with the challenging large semi-structured outdoors environments in which aerial/ground ensembles are to evolve. We propose the use of heterogeneous visual landmarks, points and line segments, to achieve effective cooperation in such environments. A large-scale SLAM algorithm is generalized to handle multiple robots, in which a global graph maintains the relative relationships between a series of local sub-maps built by the different robots. The key issue when dealing with multiple robots is to find the link between them, and to integrate these relations to maintain the overall geometric consistency; the events that introduce these links on the global graph are described in detail. Monocular cameras are considered as the primary extereoceptive sensor. In order to achieve the undelayed initialization required by the bearing-only observations, the well-known inverse-depth parametrization is adopted to estimate 3D points. Similarly, to estimate 3D line segments, we present a novel parametrization based on anchored Plücker coordinates, to which extensible endpoints are added. Extensive simulations show the proposed developments, and the overall approach is illustrated using real-data taken with a helicopter and a ground rover.     

Weaving patterns of lines and line segments in space

Aweaving W is a simple arrangement of lines (or line segments) in the plane together with a binary relation specifying which line is above the other. A system of lines (or line segments) in 3-space is called arealization ofW, if its projection into the plane isW and the above-below relations between the lines respect the specifications. Two weavings are equivalent if the underlying arrangements of lines are combinatorially equivalent and the above-below relations are the same. An equivalence class of weavings is said to be aweaving pattern. A weaving pattern isrealizable if at least one element of the equivalence class has a three-dimensional realization. A weaving (pattern)W is calledperfect if, along each line (line segment) ofW, the lines intersecting it are alternately above and below. We prove that (i) a perfect weaving pattern ofn lines is realizable if and only ifn 3, (ii) a perfect m byn weaving pattern of line segments (in a grid-like fashion) is realizable if and only if min(m, n) 3, (iii) ifn is sufficiently large, then almost all weaving patterns ofn lines are nonrealizable.Jànos Pach has been supported in part by Hungarian NFSR Grant 1812, NSF Grant CCR-8901484, and the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS), a National Science Foundation Science and Technology Center, under NSF Grant STC88-09648. Richard Pollack has been supported in part by NSA Grant MDA904-89-H-2030, NSF Grants DMS-85-01947 and CCR-8901484, and DIMACS. Emo Welzl has been supported in part by the ESPRIT II Basic Research Actions Program of the EC under Contract No. 3075 (project ALCOM) and DIMACS.     

Heterarchical production control in manufacturing systems using the potential fields concept

This article deals with the potential field concept and its application to dynamic task allocation and dynamic routing controls of flexible manufacturing systems (FMS). This potential field approach requires increasing the interaction capabilities of the different entities, not only resources but also products themselves. In this approach, products request services from resources, sensing the fields emitted by resources and selecting the field that best satisfies the service request. Many already published approaches that are capable of modelling systems based on the interactions between the entities in manufacturing systems are presented. Then, the potential field concept and its application to FMS control are explained in detail. Next, a potential field model and its application are proposed in the real-time heterarchical control of dynamic resource allocation and dynamic product routing. Using a NetLogo simulation, the potential field model supports hard assumptions, such as dynamic transportation times, limited storage capacities and breakdown events. To validate this model, an ongoing real implementation is presented with the AIP-PRIMECA FMS.     

Space-Time Hierarchical Radiosity with Clustering and Higher-Order Wavelets

We address in this paper the issue of computing diffuse global illumination solutions for animation sequences. The principal difficulties lie in the computational complexity of global illumination, emphasized by the movement of objects and the large number of frames to compute, as well as the potential for creating temporal discontinuities in the illumination, a particularly noticeable artifact. We demonstrate how space‐time hierarchical radiosity, i.e. the application to the time dimension of a hierarchical decomposition algorithm, can be effectively used to obtain smooth animations: first by proposing the integration of spatial clustering in a space‐time hierarchy; second, by using a higher‐order wavelet basis adapted for the temporal dimension. The resulting algorithm is capable of creating time‐dependent radiosity solutions efficiently.