Cholesterol synthesis and esterification in isolated enterocytes: Regulation by cholesterol and cholestyramine feeding

The purpose of the present study was to investigate the physiological control of the main regulatory enzymes of cholesterol metabolism in isolated enterocytes obtained from chick duodenum, jejunum and ileum. Cholesterol feeding resulted in an inhibition of 3-hydroxy-3-methylglutaryl-CoA reductase and mevalonate 5-pyrophosphate decarboxylase, while cholestyramine feeding increased reductase activity in all the regions studied and decarboxylase activity only in duodenum. Cholesterol feeding markedly increased acyl-CoA:cholesterol acyltransferase, but the effects of cholestyramine were less clear. The effects on transferase activity cannot be due to differences in the availability of acyl-CoA as exogenous substrate as no significant differences were found in acyl-CoA hydrolase activity after any of the dietary treatments. The effects of cholesterol feeding were related to changes in the cholesterol content of epithelial cells, whereas in the case of cholestyramine this relationship was less apparent.     

Online FPS games: effect of router buffer and multiplexing techniques on subjective quality estimators

First Person Shooters are a genre of online games in which users demand a high interactivity, because the actions and the movements are very fast. They usually generate high rates of small packets which have to be delivered to the server within a deadline. When the traffic of a number of players shares the same link, these flows can be aggregated in order to save bandwidth. Certain multiplexing techniques are able to merge a number of packets, in a similar way to voice trunking, creating a bundle which is transmitted using a tunnel. In addition, the headers of the original packets can be compressed by means of standard algorithms. The characteristics of the buffers of the routers which deliver these bundled packets may have a strong influence on the network impairments (mainly delay, jitter and packet loss) which determine the quality of the game. A subjective quality estimator has been used in order to study the mutual influence of the buffer and multiplexing techniques. Taking into account that there exist buffers which size is measured in terms of bytes, and others measured in packets, both kinds of buffers have been tested, using different sizes. Traces from real game parties have been merged in order to obtain the traffic of 20 simultaneous players sharing the same Internet access. The delay and jitter produced by the buffer of the access router have been obtained using simulations. In general, the quality is expected to be reduced as the background traffic grows, but the results show an anomalous region in which the quality rises with the background traffic amount. Small buffers present better subjective quality results than bigger ones. When the total traffic amount gets above the available bandwidth, the buffers measured in bytes add to the packets a fixed delay, which grows with buffer size. They present a jitter peak when the offered traffic is roughly the link capacity. On the other hand, buffers which size is measured in packets add a smaller delay, but they increase packet loss for gaming traffic. The obtained results illustrate the need of knowing the characteristics of the buffer in order to make the correct decision about traffic multiplexing. As a conclusion, it would be interesting for game developers to identify the behaviour of the router buffer so as to adapt the traffic to it.     

Model falsification using set‐valued observers for a class of discrete‐time dynamic systems: a coprime factorization approach

This article introduces a new method for model falsification using set‐valued observers, which can be applied to a class of discrete linear time‐invariant dynamic systems with time‐varying model uncertainties. In comparison with previous results, the main advantages of this approach are as follows: The computation of the convex hull of the set‐valued estimates of the state can be avoided under certain circumstances; to guarantee convergence of the set‐valued estimates of the state, the required number of previous steps is at most as large as the number of states of the nominal plant; and it provides a straightforward nonconservative method to falsify uncertain models of dynamic systems, including open‐loop unstable plants. The results obtained are illustrated in simulation, emphasizing the advantages and shortcomings of the suggested method. Copyright © 2013 John Wiley & Sons, Ltd.     

Approximate similarity search for online multimedia services on distributed CPU–GPU platforms

Similarity search in high-dimensional spaces is a pivotal operation for several database applications, including online content-based multimedia services. With the increasing popularity of multimedia applications, these services are facing new challenges regarding (1) the very large and growing volumes of data to be indexed/searched and (2) the necessity of reducing the response times as observed by end-users. In addition, the nature of the interactions between users and online services creates fluctuating query request rates throughout execution, which requires a similarity search engine to adapt to better use the computation platform and minimize response times. In this work, we address these challenges with Hypercurves, a flexible framework for answering approximate k-nearest neighbor (kNN) queries for very large multimedia databases. Hypercurves executes in hybrid CPU–GPU environments and is able to attain massive query-processing rates through the cooperative use of these devices. Hypercurves also changes its CPU–GPU task partitioning dynamically according to the observed load, aiming for optimal response times. In our empirical evaluation, dynamic task partitioning reduced query response times by approximately 50 % compared to the best static task partition. Due to a probabilistic proof of equivalence to the sequential kNN algorithm, the CPU–GPU execution of Hypercurves in distributed (multi-node) environments can be aggressively optimized, attaining superlinear scalability while still guaranteeing, with high probability, results at least as good as those from the sequential algorithm.     

Well-defined polymer precursors synthesized by RAFT polymerization of N,N-dimethylacrylamide/N-acryloxysuccinimide: random and block copolymers

N,N-dimethylacrylamide (DMA) and N-acryloxysuccinimide (NAS) were copolymerized by the reversible addition–fragmentation chain transfer (RAFT) polymerization technique, to obtain random and block copolymer precursors onto which different side-groups may be statistically grafted via the reactive NAS units. These reactive copolymers have interesting applications in various fields such as coatings and paints, water purification and biology. Random poly(DMA-co-NAS) copolymer chains were synthesized with a 75/25 molar ratio, high conversion, an excellent molecular weight (MW) control from 5000 to 130 000 g mol⁻¹, and low polydispersity index (M_w/M_n<1.1). Poly(DMA-b-NAS) block copolymers were synthesized by a two step method, in which a poly(DMA) homopolymer was prepared first and then used as macro-chain transfer agent to polymerize NAS. For example, a poly(DMA-b-NAS) sample was obtained with an average molecular weight of 44 300/7400 g mol⁻¹ corresponding to 447 DMA and 44 NAS units. Such block copolymers had not yet been synthesized by any controlled polymerization technique. They can be used to prepare polymers with exactly the same backbone and an increasing number of different side groups (e.g. hydrophobic, ionic or fluorescent).     

OpenCOPI: middleware integration for Ubiquitous Computing

In this paper, we present OpenCOPI (Open COntext Platform Integration), a Service-Oriented Architecture-based middleware platform that supports the integration of services provided by distinct sources, ranging from services offered by simple systems to more complex services provided by context-provision middleware. OpenCOPI offers selection and composition mechanisms to, respectively, select and compose services provided by different sources, considering applications of both Quality of Service and Quality of Context requirements. It also offers an adaptation mechanism that enables to adapt the application execution due to service failures, service quality fluctuation and user mobility. OpenCOPI allows the definition of applications in a higher abstraction level by the specification of a semantic workflow that contains abstract activities. This paper illustrates the use of OpenCOPI in an application from the Gas & Oil Industry and it also shows the evaluation of the main mechanisms of OpenCOPI: the service selection, composition, adaptation and workflow execution.     

Variational Foundations and Generalized Unified Theory of RVE-Based Multiscale Models

A unified variational theory is proposed for a general class of multiscale models based on the concept of Representative Volume Element. The entire theory lies on three fundamental principles: (1) kinematical admissibility, whereby the macro- and micro-scale kinematics are defined and linked in a physically meaningful way; (2) duality, through which the natures of the force- and stress-like quantities are uniquely identified as the duals (power-conjugates) of the adopted kinematical variables; and (3) the Principle of Multiscale Virtual Power, a generalization of the well-known Hill-Mandel Principle of Macrohomogeneity, from which equilibrium equations and homogenization relations for the force- and stress-like quantities are unequivocally obtained by straightforward variational arguments. The proposed theory provides a clear, logically-structured framework within which existing formulations can be rationally justified and new, more general multiscale models can be rigorously derived in well-defined steps. Its generality allows the treatment of problems involving phenomena as diverse as dynamics, higher order strain effects, material failure with kinematical discontinuities, fluid mechanics and coupled multi-physics. This is illustrated in a number of examples where a range of models is systematically derived by following the same steps. Due to the variational basis of the theory, the format in which derived models are presented is naturally well suited for discretization by finite element-based or related methods of numerical approximation. Numerical examples illustrate the use of resulting models, including a non-conventional failure-oriented model with discontinuous kinematics, in practical computations.     

Pose consensus in networks of heterogeneous robots with variable time delays

This paper proposes a novel pose (position and orientation) consensus controller for networks of heterogeneous robots modeled in the operational space. The proposed controller is a distributed proportional plus damping scheme that, with a slight modification, solves both the leader–follower and leaderless consensus problems. A singularity‐free representation, unit quaternion, is used to describe the robots orientation, and the network is represented by an undirected and connected interconnection graph. Furthermore, it is shown that the controller is robust to interconnection variable time delays. Experiments with a network of two 6‐degrees‐of‐freedom robots are presented to illustrate the performance of the proposed scheme. Copyright © 2014 John Wiley & Sons, Ltd.     

A two‐step control approach for docking of autonomous underwater vehicles

This paper presents a novel integrated guidance and control strategy for docking of autonomous underwater vehicles. The approach to the base, and hence the control design, is divided in two steps: (i) in the first, at higher speed, the vehicle dynamics is assumed to be underactuated, and an appropriate control law is derived to steer the vehicle towards the final docking path, achieving convergence to zero of the appropriate error variables for almost all initial conditions; (ii) in the second stage, at low speed, the vehicle is assumed to be fully actuated, and a robust control law is designed that achieves convergence to zero of the appropriate error variables for all initial conditions, in the presence of parametric model uncertainty. Simulations are presented illustrating the performance of the proposed controllers, including model uncertainty and sensor noise. Copyright © 2014 John Wiley & Sons, Ltd.