Effect of residual water content on the physico-chemical properties of sucralfate dried gel obtained by microwave drying

The purpose of this study was to investigate the physico-chemical characteristics of sucralfate humid gel dried by microwaves, in relation to the residual water content. Differential scanning calorimetry (DSC) allowed for the determination of the water state in sucralfate samples. Fourier-transform infrared (FT-IR) spectroscopy was used to monitor the changes in sucralfate gel structure induced by the microwave drying. A boundary value of total water content for sucralfate gel samples was found at 42% (w/w). Below this value only bound water was present, whereas above this value, the increase in total water was due to free water. In the physical form of gel, the strength of the coordination between sulfate anions and the positively charged aluminum hydroxide was dependent on the residual water content. The study of the sedimentation behavior of water suspensions prepared with dried sucralfate allowed for the evaluation of the retention of gel properties. We found that the microwave drying process affected the sedimentation of sucralfate dried gel suspensions independent of the residual water content: when suspensions were prepared from sucralfate dried gel powders containing more than 42% (w/w) of residual water, the sedimentation ratio was higher than 0.9. The non-gel powder suspension showed a sedimentation ratio of 0.68 ± 0.02, whereas the sucralfate humid gel suspension did not sediment.     

Believing what you feel: Using proprioceptive feedback to reduce unilateral neglect.

Unilateral spatial neglect declines when participants reach to grip the center of long metal rods compared with when they point to the perceived center, suggesting that visuomotor control systems are less affected by neglect than other representational systems (I. H. Robertson, D. Nico, & B. Hood, 1995). In this study, 16 participants with unilateral left neglect actually picked up rods, and we predicted short-term improvements in neglect because of induced conflict between a phenomenally symmetrical visual world on the one hand and a proprioceptively conveyed rightward-biased world on the other. With participants serving as their own controls, significant short-term improvements in neglect were found on 2 out of 4 neglect tasks after participants experienced proprioceptive feedback discrepant from the judgments they made on the basis of visual information alone. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Global asymptotic stabilization of the attitude and the angular rates of an underactuated non-symmetric rigid body

The paper deals with the global stabilization of both the attitude and the angular velocities of an underactuated rigid body. First a stability theorem is proven for a class of systems; subsequently, the equations describing the physics of the rigid body are presented, showing that the rigid body belongs to the considered class of systems, and a sufficient condition for the application of the theorem to the stability of the rigid body equilibrium is pointed out. Finally, some simulation results are reported showing the effectiveness of the proposed methodology.     

The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem

The capacitated vehicle routing problem (CVRP) is a well known problem which has long been tackled by researchers for several decades now, not only because of its potential applications but also due to the fact that CVRP can be used to test the efficiency of new algorithms and optimization methods. The objective of our work is to present SR-GCWS, a hybrid algorithm that combines a CVRP classical heuristic with Monte Carlo simulation using state-of-the-art random number generators. The resulting algorithm is tested against some well-known benchmarks. In most cases, our approach is able to compete or even outperform much more complex algorithms, which is especially interesting if we consider that our algorithm does not require any previous parameter fine-tuning or set-up process. Moreover, our algorithm has been able to produce high-quality solutions almost in real-time for most tested instances. Another important feature of the algorithm worth mentioning is that it uses a randomized constructive heuristic, capable of generating hundreds or even thousands of alternative solutions with different properties. These alternative solutions, in turn, can be really useful for decision-makers in order to satisfy their utility functions, which are usually unknown by the modeler. The presented methodology may be a fine framework for the development of similar algorithms for other complex combinatorial problems in the routing arena as well as in some other research fields.     

Fitting genetic algorithms to distributed on-line evolution of network protocols

In this work, we introduce a framework for enabling the on-line evolution of network protocols. The proposed approach is based on the use of techniques and tools drawn from evolutionary computing research, and it enables embedding evolutionary features in the operation of network protocols. In this way, it becomes possible to build a system in which the operation of the network changes at run-time to adapt to the current conditions. As a case study, we apply the proposed framework to the evolution of forwarding schemes in intermittently connected wireless networks. Simulation results are reported to validate the ability of the proposed scheme to converge to the optimal operating point and to explore the various trade-offs deriving from its design and implementation.     

An application of kernel methods to gene cluster temporal meta-analysis

The application of various clustering techniques for large-scale gene-expression measurement experiments is a well-established method in bioinformatics. Clustering is also usually accompanied by functional characterization of gene sets by assessing statistical enrichments of structured vocabularies, such as the gene ontology (GO) [Gene Ontology Consortium. The gene ontology (GO) project in 2006. Nucleic Acids Research (Database issue), vol. 34; 2006. p. D322–6]. If different clusters are generated for correlated experiments, a machine learning step termed cluster meta-analysis may be performed, in order to discover relations among the components of such sets. Several approaches have been proposed: in particular, kernel methods may be used to exploit the graphical structure of typical ontologies such as GO. Following up the formulation of such approach [Merico D, Zoppis I, Antoniotti M, Mauri G. Evaluating graph kernel methods for relation discovery in GO-annotated clusters. In: KES-2007/WIRN-2007, Part IV, Lecture notes in artificial intelligence, vol. 4694. Berlin: Springer; 2007. p. 892–900; Zoppis I, Merico D, Antoniotti M, Mishra B, Mauri G. Discovering relations among GO-annotated clusters by graph kernel methods. In: Proceedings of the 2007 international symposium on bioinformatics research and applications. Lecture notes in computer science, vol. 4463. Berlin: Springer; 2007], in this paper we discuss, from an information-theoretic point of view, further results about its applicability and its performance.     

Numerical Simulation of Electromagnetic Solitons and Their Interaction with Matter

A suitable correction of the Maxwell model brings to an enlargement of the space of solutions, allowing for the existence of solitons in vacuum. We review the basic achievements of the theory and discuss some approximation results based on an explicit finite-difference technique. The experiments in two dimensions simulate travelling solitary electromagnetic waves, and show their interaction with conductive walls. In particular, the classical dispersion, exhibited by the passage of a photon through a small aperture, is examined.     

Optimal local refinable interpolants

In this paper we construct a set of refinable functions that enjoy some useful properties: they have compact support, satisfy suitable interpolation conditions and constitute the basis for constructing a local interpolatory approximant having arbitrary exactness order of polynomial reproduction.