Cholesterol‐imprinted polymer receptor prepared by a hybrid imprinting method

A novel cholesterol‐imprinted polymer (CMIP‐H) was prepared by a hybrid method of covalent imprinting and non‐covalent imprinting. This approach involves the copolymerization of a template‐containing monomer, cholesteryl 2‐hydroxyethyl methacrylate carbonate, and a cross‐linker, followed by hydrolysis to afford a flexible guest‐binding site accompanied with the easy and efficient removal of a ‘sacrificial spacer’. The effect of solvent on the binding capacity of CMIP‐H towards cholesterol was studied, indicating that a good binding capacity towards cholesterol could be achieved in a less‐polar solvent. The binding experiments of CMIP‐H towards a series of structural analogues of cholesterol, including cholesterol acetate, progesterone and stigmasterol, were carried out in hexane. The results showed that CMIP‐H almost did not bind cholesterol acetate at all because the hydrogen‐bonding site is blocked. It exhibited a similar binding towards both cholesterol and stigmasterol, but much higher binding towards progesterone. Copyright © 2005 Society of Chemical Industry     

Effect of surfactants and liquid hydrocarbons on gas hydrate formation rate and storage capacity

Hydrate formation rate plays an important role in making hydrates for the storage and transport of natural gas. Micellar surfactant solutions were found to increase gas hydrate formation rate and storage capacity. With the presence of surfactant, hydrate could form quickly in a quiescent system and the energy costs of hydrate formation reduced. Surfactants (an anionic surfactant, a non‐ionic surfactant and their mixtures) and liquid hydrocarbons (cyclopentane and methylcyclohexane) were used to improve hydrate formation. The experiments of hydrate formation were carried out in the pressure range 3.69–6.82 MPa and the temperature range 274.05–277.55 K. The experimental pressures were kept constant during hydrate formation in each experimental run. The effect of anionic surfactant (sodium dodecyl sulphate (SDS)) on natural gas storage in hydrates is more pronounced compared to a non‐ionic surfactant (dodecyl polysaccharide glycoside (DPG)). The induction time of hydrate formation was reduced with the presence of cyclopentane (CP). Cyclopentane and methylcyclohexane (MCH) could increase hydrate formation rate, but reduced hydrate storage capacity The higher methylcyclohexane concentration, the lower the hydrate storage capacity. Copyright © 2003 John Wiley & Sons, Ltd.     

Softwarekartographie

Zusammenfassung  Anwendungslandschaften in Unternehmen sind langlebige hoch-komplexe Strukturen bestehend aus hunderten bis tausenden von miteinander vernetzten betrieblichen Informationssystemen, die von Personen mit sehr unterschiedlichen Interessen und Erfahrungshintergrund konzipiert, erstellt, modifiziert, betrieben, genutzt und finanziert werden. Die Softwarekartographie zielt darauf ab, die Kommunikation zwischen diesen Personen durch zielgruppenspezifische verst?ndliche graphische Visualisierungen zu unterstützen, die Gesch?fts- und Informatik-Aspekte gleicherma?en berücksichtigen, und die speziell für langfristige und strategische Management-Betrachtungen geeignet sind. In diesem Beitrag fassen wir zun?chst die in der betrieblichen Praxis wohlbekannten Probleme beim Management von Anwendungslandschaften zusammen und diagnostizieren erhebliche Kommunikationsdefizite. Da Anwendungslandschaften als Systeme von Systemen mit Menschen als integrale Systembestandteile zu verstehen sind, werden Karten als attraktiver L?sungsansatz identifiziert und die wesentlichen Konzepte der Softwarekartographie anhand von Beispielen vorgestellt. Dabei werden Querbezüge zu anderen Fachgebieten der Informatik und Wirtschaftsinformatik hergestellt, und die bisherige Nutzung der Forschungsergebnisse in der Praxis gezeigt.     

Average consensus in networks of dynamic agents with switching topologies and multiple time-varying delays

In this paper, we discuss average consensus problem in undirected networks of dynamic agents with fixed and switching topologies as well as multiple time-varying communication delays. By employing a linear matrix inequality method, we prove that all the nodes in the network achieve average consensus asymptotically for appropriate communication delays if the network topology is connected. Particularly, several feasible linear matrix inequalities are established to determine the maximal allowable upper bound of time-varying communication delays. Numerical examples are given to demonstrate the effectiveness and the sharpness of the theoretical results.     

Self-adjusting the intensity of assortative mating in genetic algorithms

Mate selection plays a crucial role in both natural and artificial systems. While traditional Evolutionary Algorithms (EA) usually engage in random mating strategies, that is, mating chance is independent of genotypic or phenotypic distance between individuals, in natural systems non-random mating is common, which means that somehow this mechanism has been favored during the evolutionary process. In non-random mating, the individuals mate according to their parenthood or likeness. Previous studies indicate that negative assortative mating (AM)—also known as dissortative mating—, which is a specific type of non-random mating, may improve EAs performance by maintaining the genetic diversity of the population at a higher level during the search process. In this paper we present the Variable Dissortative Mating Genetic Algorithm (VDMGA). The algorithm holds a mechanism that varies the GA’s mating restrictions during the run by means of simple rule based on the number of chromosomes created in each generation and indirectly influenced by the genetic diversity of the population. We compare VDMGA not only with traditional Genetic Algorithms (GA) but also with two preceding non-random mating EAs: the CHC algorithm and the negative Assortative Mating Genetic Algorithm (nAMGA). We intend to study the effects of the different methods in the performance of GAs and verify the reliability of the proposed algorithm when facing an heterogeneous set of landscapes. In addition, we include the positive Assortative Mating Genetic Algorithm (pAMGA) in the experiments in order test both negative and positive AM mechanisms, and try to understand if and when negative AM (or DM) speeds up the search process or enables the GAs to escape local optima traps. For these purposes, an extensive set of optimization test problems was chosen to cover a variety of search landscapes with different characteristics. Our results confirm that negative AM is effective in leading EAs out of local optima traps, and show that the proposed VDMGA is at least as efficient as nAMGA when applied to the range of our problems, being more efficient in very hard functions were traditional GAs usually fail to escape local optima. Also, scalability tests have been made that show VDMGA ability to decrease optimal population size, thus reducing the amount of evaluations needed to attain global optima. We like to stress that only two parameters need to be hand-tuned in VDMGA, thus reducing the tuning effort present in traditional GAs and nAMGA.     

Simulating a Smartboard by Real-Time Gesture Detection in Lecture Videos

Gesture plays an important role for recognizing lecture activities in video content analysis. In this paper, we propose a real-time gesture detection algorithm by integrating cues from visual, speech and electronic slides. In contrast to the conventional “complete gesture” recognition, we emphasize detection by the prediction from “incomplete gesture”. Specifically, intentional gestures are predicted by the modified hidden Markov model (HMM) which can recognize incomplete gestures before the whole gesture paths are observed. The multimodal correspondence between speech and gesture is exploited to increase the accuracy and responsiveness of gesture detection. In lecture presentation, this algorithm enables the on-the-fly editing of lecture slides by simulating appropriate camera motion to highlight the intention and flow of lecturing. We develop a real-time application, namely simulated smartboard, and demonstrate the feasibility of our prediction algorithm using hand gesture and laser pen with simple setup without involving expensive hardware.