Characterization of rheological properties of systems containing sugar substitutes and carrageenan

The effects of addition of κ-carrageenan to solutions containing 40% (w/w) sugar substitute on the rheological properties of these systems were investigated at 25 °C using a rotational viscometer at rotational speeds of 6, 12, 30, and 60 rev min⁻¹. The flow behaviour of the solutions was adequately described by the power law model with or without yield stress. The consistency index ( K ) and the flow behaviour index ( n ) were determined from shear stress vs. shear rate data. The flow parameters of the solutions depended on the carrageenan concentration. The apparent viscosities of the systems decreased with increasing shear rate, indicating pseudoplastic behaviour. The final carrageenan concentration was found to be an effective factor controlling the degree of sliminess of the model food systems studied.     

Synthesis and characterization of poly(N‐vinyl‐2‐pyrrolidone) grafted sodium alginate hydrogel beads for the controlled release of indomethacin

Graft copolymers of sodium alginate (NaAlg) with N‐vinyl‐2‐pyrrolidone were prepared using azobisisobutyronitrile as initiator. The graft copolymers (NaAlg‐g‐PVP) were characterized with Fourier transform infrared spectroscopy, elemental analysis, and differential scanning calorimetry. Polymeric hydrogel beads of NaAlg and NaAlg‐g‐PVP were prepared by crosslinking method using glutaraldehyde (GA) as a crosslinker in the hydrochloric acid catalyst (HCl) and these beads were used to deliver anti‐inflammatory drug, indomethacin (IM). Chemical stability of the IM after encapsulation into beads was confirmed by FTIR. Preparation conditions of the NaAlg‐g‐PVP beads were optimized by considering the percentage entrapment efficiency, particle size, swelling capacity and their release data. In vitro release studies were performed in simulated gastric fluid (pH 1.2) for the initial 2 h, followed by simulated intestinal fluid (pH 7.4) for 4 h. Effects of GA concentration, exposure time to GA, drug/polymer (d/p) ratio, and concentration of HCl on the release of IM were discussed. It was observed that IM release from the beads decreased with increasing GA concentration and exposure time. IM release also decreases with increasing d/p ratio and HCl concentration. The highest IM release was obtained to be 77% for beads crosslinked with 0.027M GA. Swelling experiments were also performed to compute molecular mass between crosslinks of the beads. © 2008 Wiley Periodicals, Inc. J Appl Polym Sci, 2008     

Methacrylic acid–acrylamide-g-poly(ethyleneterephthalate) fibres for urea hydrolysis

This paper presents the results of urease immobilization onto methacrylic acid–acrylamide grafted poly(ethyleneterephthalate) fibres. The graft yield strongly affected the maximum activity of the immobilized enzyme up to a value of 70·2%. Higher grafting caused a decline in urease activity and led to the degradation of the fibres. The minor changes observed in K_m and V_max demonstrated that the conformational changes existed during immobilization were not extensive. However, 70·2% methacrylic acid–acrylamide-g-fibres containing urease were more stable towards acidic and alkaline pH, high temperature and storage conditions compared with free enzyme. Apart from the increase in stability to heat inactivation, the initial enzymatic activity of the urease–fibre system remained almost unchanged even after 40 repeated assays corresponding to 10 h of operation in 4 months, indicating the excellent durability of the system.     

HihO: accelerating artificial intelligence interpretability for medical imaging in IoT applications using hierarchical occlusion

Neural Computing and Applications - In the medical imaging domain, nonlinear warping has enabled pixel-by-pixel mapping of one image dataset to a reference dataset. This co-registration of data...     

Equilibrium-independent passivity: A new definition and numerical certification

We extend the traditional notion of passivity to a forced system whose equilibrium is dependent on the control input by defining equilibrium-independent passivity, a system property characterized by a dissipation inequality centered at an arbitrary equilibrium point. We provide a necessary input/output condition which can be tested for systems of arbitrary dimension and sufficient conditions to certify this property for scalar systems. An example from network stability analysis is presented which demonstrates the utility of this new definition. We then proceed to numerical certification of equilibrium-independent passivity using sum-of-squares programming. Finally, through numerical examples we show that equilibrium-independent passivity is less restrictive than incremental passivity.     

Synchronization of diffusively-coupled limit cycle oscillators

We develop analytical and numerical conditions to determine whether limit cycle oscillations synchronize in diffusively coupled systems. We examine two classes of systems: reaction–diffusion PDEs with Neumann boundary conditions, and compartmental ODEs, where compartments are interconnected through diffusion terms with adjacent compartments. In both cases the uncoupled dynamics are governed by a nonlinear system that admits an asymptotically stable limit cycle. We provide two-time scale averaging methods for certifying stability of spatially homogeneous time-periodic trajectories in the presence of sufficiently small or large diffusion and develop methods using the structured singular value for the case of intermediate diffusion. We highlight cases where diffusion stabilizes or destabilizes such trajectories.     

Superresolution video reconstruction with arbitrary samplinglattices and nonzero aperture time

Printing from an NTSC source and conversion of NTSC source material to high-definition television (HDTV) format are some of the applications that motivate superresolution (SR) image and video reconstruction from low-resolution (LR) and possibly blurred sources. Existing methods for SR image reconstruction are limited by the assumptions that the input LR images are sampled progressively, and that the aperture time of the camera is zero, thus ignoring the motion blur occurring during the aperture time. Because of the observed adverse effects of these assumptions for many common video sources, this paper proposes (i) a complete model of video acquisition with an arbitrary input sampling lattice and a nonzero aperture time, and (ii) an algorithm based on this model using the theory of projections onto convex sets to reconstruct SR still images or video from an LR time sequence of images. Experimental results with real video are provided, which clearly demonstrate that a significant increase in the image resolution can be achieved by taking the motion blurring into account especially when there exists large interframe motion.     

Dirichlet Priors for MAP Inference of Protein Conformation Abundances from SAXS

Estimation of mixture coefficients of protein conformations in solution find applications in understanding protein behavior. We describe a method for maximum a posteriori (MAP) estimation of the mixture coefficients of ensemble of conformations in a protein mixture solution using measured small angle X-ray scattering (SAXS) intensities. The proposed method builds upon a model for the measurements of crystallographically determined conformations. Assuming that a priori information on the protein mixture is available, and that priori information follows a Dirichlet distribution, we develop a method to estimate the relative abundances with MAP estimator. The Dirichlet distribution depends on concentration parameters which may not be known in practice and thus need to be estimated. To estimate these unknown concentration parameters we developed an expectation-maximization (EM) method. Adenylate kinase (ADK) protein was selected as the test bed due to its known conformations Beckstein et al. (Journal of Molecular Biology, 394(1), 160 1). Known conformations are assumed to form the full vector bases that span the measurement space. In Monte Carlo simulations, mixture coefficient estimation performances of MAP and maximum likelihood (ML) (which assumes a uniform prior on the mixture coefficients) estimators are compared. MAP estimators using known and unknown concentration parameters are also compared in terms of estimation performances. The results show that prior knowledge improves estimation accuracy, but performance is sensitive to perturbations in the Dirichlet distribution’s concentration parameters. Moreover, the estimation method based on EM algorithm shows comparable results to approximately known prior parameters.     

Efficient Filtering and Clustering Methods for Temporal Video Segmentation and Visual Summarization

Automatic temporal segmentation and visual summary generation methods that require minimal user interaction are key requirements in video information management systems. Clustering presents an ideal method for achieving these goals, as it allows direct integration of multiple information sources. This paper proposes a clustering-based framework to achieve these tasks automatically and with a minimum of user-defined parameters. The use of multiple frame difference features and short-time techniques are presented for efficient detection of cut-type shot boundaries. Generic temporal filtering methods are used to process the signals used in shot boundary detection, resulting in better suppression of false alarms. Clustering is also extended to the key frame extraction problem: Color-based shot representations are provided by average and intersection histograms, which are then used in a clustering scheme to identify reference key frames within each slot. The technique achieves good compaction with a minimum number of visually nonredundant key frames.     

Genetic Algorithm for the Multiple-Query Optimization Problem

Producing answers to a set of queries with common tasks efficiently is known as the multiple-query optimization (MQO) problem. Each query can have several alternative evaluation plans, each with a different set of tasks. Therefore, the goal of MQO is to choose the right set of plans for queries which minimizes the total execution time by performing common tasks only once. Since MQO is an NP-hard problem, several, mostly heuristics based, solutions have been proposed for solving it. To the best of our knowledge, this correspondence is the first attempt to solve MQO using an evolutionary technique, genetic algorithms