Double emulsion‐encapsulated guggul exhibits improved in vivo hypocholesterolaemic action in rats

Guggul tree or Commiphora mukul is a small thorny herb having remarkable hypocholesterolaemic properties. Its therapeutic effects are because of its biocomponent guggulsterones, especially guggulsterone E and Z. In this research, double emulsion‐based spread was tried to improve the bioavailability of the herb guggul in in vivo rat model. The effect of the different diets with encapsulated and nonencapsulated guggul was evaluated and compared after 6 weeks, based on the final body weight and analysis of organs, serum and faeces of normal and hypercholesterolaemic (H) rats. It was evident from the results that double emulsion‐encapsulated guggul showed better control on weight of H rats (25.98% lower), inhibition of HMG CoA reductase (3.95 times less) activity and reduction in atherosclerotic index (47.2%), as compared to diet with unencapsulated guggul. Encapsulation of guggul also improved faecal excretion of bile acids, lipids and total cholesterol in H and normal rats.     

Whole grains and resistant starch rich,reduced‐calorie biscuit diet as a hypoglycaemic,hypolipidaemic and insulin stimulator in streptozotocin‐induced diabetic rats

A fibre‐enriched, reduced‐calorie biscuit [formulated biscuit (FB)] was evaluated for its antidiabetic and antilipidaemic potential in streptozotocin‐induced diabetes in Wistar rats against control biscuit (CB) having high calorie and low fibre content. Animals were allocated into five groups: a control group fed with synthetic diet, two diabetes‐induced groups (CBD and FBD) and two nondiabetic groups (CBND and FBND). CBD and CBND were fed with synthetic diet + CB while FBD and FBND were fed with synthetic diet + FB. After 6 weeks of feeding, the change in weight of nondiabetic group fed with FB (+16.20%) was nonsignificantly lower compared to control (+33.01%) and CB‐fed (+34.55%) group. Nonsignificant loss in body weight was observed among diabetic group fed with FB (?11.76%) or CB (?36.88%). Feeding of FB led to a significant decrease in fasting and postprandial blood glucose levels, total cholesterol, triglycerides, LDL‐C, VLDL‐C and atherosclerotic index and increase the HDL‐C. Histological examination showed that feeding of FB was able to partially recover the destroyed β‐cell in STZ‐induced diabetic rats.     

Improved sampling of the pareto-front in multiobjective genetic optimizations by steady-state evolution: a pareto converging genetic algorithm

Previous work on multiobjective genetic algorithms has been focused on preventing genetic drift and the issue of convergence has been given little attention. In this paper, we present a simple steady-state strategy, Pareto Converging Genetic Algorithm (PCGA), which naturally samples the solution space and ensures population advancement towards the Pareto-front. PCGA eliminates the need for sharing/niching and thus minimizes heuristically chosen parameters and procedures. A systematic approach based on histograms of rank is introduced for assessing convergence to the Pareto-front, which, by definition, is unknown in most real search problems. We argue that there is always a certain inheritance of genetic material belonging to a population, and there is unlikely to be any significant gain beyond some point; a stopping criterion where terminating the computation is suggested. For further encouraging diversity and competition, a nonmigrating island model may optionally be used; this approach is particularly suited to many difficult (real-world) problems, which have a tendency to get stuck at (unknown) local minima. Results on three benchmark problems are presented and compared with those of earlier approaches. PCGA is found to produce diverse sampling of the Pareto-front without niching and with significantly less computational effort.     

RISCBOT: A WWW-Enabled Mobile Surveillance and Identification Robot

This article describes RISCBOT (RISCBOT name has been derived from RISC lab and ‘bot’ of robot, a modular 802.11 b-enabled mobile autonomous robot built at the RISC lab of the University of Bridgeport. RISCBOT localizes itself and successfully fulfills www – enabled online user requests and navigates to various rooms, employing a visual recognition algorithm. This article describes the mechanical design, hardware and software algorithms of the robot, and the web-based interface for communicating with the robot. ^⋆RISC lab: Interdisciplinary Robotics, Intelligent Sensing and Control laboratory at the University of Bridgeport.     

Design of a notch filter with improved performance

The frequency response of a constrained notch filter (CNF) of Rao and Kung or Nehorai becomes ideal as the polecontraction factor α approaches unity while the transient duration approaches infinity. However, for practically useful values of α the phase and magnitude distortions so caused can reduce the allpass nature of the CNFs (i.e. the transparency property) and cause large errors. In this paper we define a measure for the transparency misadjustment and propose two suboptimal methods of minimizing these distortions. One of these methods is based on increasing the filter order by a strategic pole/zero placement. We present a closed-form solution for this method. In the second method we increase the order by manipulating the error filter associated with the standard CNF; the coefficients of the resulting filter are determined directly. an important feature of these methods is the significant improvement in the transient performance.     

Tracking set-expression cardinalities over continuous update streams

There is growing interest in algorithms for processing and querying continuous data streams (i.e., data seen only once in a fixed order) with limited memory resources. In its most general form, a data stream is actually an update stream, i.e., comprising data-item deletions as well as insertions. Such massive update streams arise naturally in several application domains (e.g., monitoring of large IP network installations or processing of retail-chain transactions). Estimating the cardinality of set expressions defined over several (possibly distributed) update streams is perhaps one of the most fundamental query classes of interest; as an example, such a query may ask what is the number of distinct IP source addresses seen in passing packets from both router R ₁ and R ₂ but not router R ₃?. Earlier work only addressed very restricted forms of this problem, focusing solely on the special case of insert-only streams and specific operators (e.g., union). In this paper, we propose the first space-efficient algorithmic solution for estimating the cardinality of full-fledged set expressions over general update streams. Our estimation algorithms are probabilistic in nature and rely on a novel, hash-based synopsis data structure, termed 2-level hash sketch. We demonstrate how our 2-level hash sketch synopses can be used to provide low-error, high-confidence estimates for the cardinality of set expressions (including operators such as set union, intersection, and difference) over continuous update streams, using only space that is significantly sublinear in the sizes of the streaming input (multi-)sets. Furthermore, our estimators never require rescanning or resampling of past stream items, regardless of the number of deletions in the stream. We also present lower bounds for the problem, demonstrating that the space usage of our estimation algorithms is within small factors of the optimal. Finally, we propose an optimized, time-efficient stream synopsis (based on 2-level hash sketches) that provides similar, strong accuracy-space guarantees while requiring only guaranteed logarithmic maintenance time per update, thus making our methods applicable for truly rapid-rate data streams. Our results from an empirical study of our synopsis and estimation techniques verify the effectiveness of our approach.Received: 20 October 2003, Accepted: 16 April 2004, Published online: 14 September 2004Edited by: J. Gehrke and J. Hellerstein.Sumit Ganguly: sganguly@cse.iitk.ac.in Current affiliation: Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India     

Sampled-data control of a nonlinear system

Sampled-data proportional control of an exothermic CSTR has been studied using the classical linear analysis and by the application of the averaging te     

RE-tree: an efficient index structure for regular expressions

Due to their expressive power, regular expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of these applications have to manage huge databases of RE specifications and need to provide an effective matching mechanism that, given an input string, quickly identifies the REs in the database that match it. In this paper, we propose the RE-tree, a novel index structure for large databases of RE specifications. Given an input query string, the RE-tree speeds up the retrieval of matching REs by focusing the search and comparing the input string with only a small fraction of REs in the database. Even though the RE-tree is similar in spirit to other tree-based structures that have been proposed for indexing multidimensional data, RE indexing is significantly more challenging since REs typically represent infinite sets of strings with no well-defined notion of spatial locality. To address these new challenges, our RE-tree index structure relies on novel measures for comparing the relative sizes of infinite regular languages. We also propose innovative solutions for the various RE-tree operations including the effective splitting of RE-tree nodes and computing a "tight" bounding RE for a collection of REs. Finally, we demonstrate how sampling-based approximation algorithms can be used to significantly speed up the performance of RE-tree operations. Preliminary experimental results with moderately large synthetic data sets indicate that the RE-tree is effective in pruning the search space and easily outperforms naive sequential search approaches.Received: 16 September 2002, Published online: 8 July 2003Edited by R. Ramakrishnan