Fiber fermentability effects on energy and macronutrient digestibility, fecal traits, postprandial metabolite responses, and colon histology of overweight cats

Considering the different potential benefits of divergent fiber ingredients, the effect of 3 fiber sources on energy and macronutrient digestibility, fermentation product formation, postprandial metabolite responses, and colon histology of overweight cats (Felis catus) fed kibble diets was compared. Twenty-four healthy adult cats were assigned in a complete randomized block design to 2 groups of 12 animals, and 3 animals from each group were fed 1 of 4 of the following kibble diets: control (CO; 11.5% dietary fiber), beet pulp (BP; 26% dietary fiber), wheat bran (WB; 24% dietary fiber), and sugarcane fiber (SF; 28% dietary fiber). Digestibility was measured by the total collection of feces. After 16 d of diet adaptation and an overnight period without food, blood glucose, cholesterol, and triglyceride postprandial responses were evaluated for 16 h after continued exposure to food. On d 20, colon biopsies of the cats were collected under general anesthesia. Fiber addition reduced food energy and nutrient digestibility. Of all the fiber sources, SF had the least dietary fiber digestibility (P < 0.05), causing the largest reduction of dietary energy digestibility (P < 0.05). The greater fermentability of BP resulted in reduced fecal DM and pH, greater fecal production [g/(cat x d); as-is], and greater fecal concentration of acetate, propionate, and lactate (P < 0.05). For most fecal variables, WB was intermediate between BP and SF, and SF was similar to the control diet except for an increased fecal DM and firmer feces production for the SF diet (P < 0.05). Postprandial evaluations indicated reduced mean glucose concentration and area under the glucose curve in cats fed the SF diet (P < 0.05). Colon mucosa thickness, crypt area, lamina propria area, goblet cell area, crypt mean size, and crypt in bifurcation did not vary among the diets. According to the fiber solubility and fermentation rates, fiber sources can induce different physiological responses in cats, reduce energy digestibility, and favor glucose metabolism (SF), or improve gut health (BP).

SYNCHRONIZATION OF CHAOS AND THE TRANSITION TO WAVE TURBULENCE

We investigated the transition to wave turbulence in a spatially extended three-wave interacting model, where a spatially homogeneous state undergoing chaotic dynamics undergoes spatial mode excitation. The transition to this weakly turbulent state can be regarded as the loss of synchronization of chaos of mode oscillators describing the spatial dynamics.

ENERGY AND VOLUME OF VECTOR FIELDS ON SPHERICAL DOMAINS

We present a "boundary version" for theorems about minimality of volume and energy functionals on a spherical domain of an odd-dimensional Euclidean sphere.

ACTIVE NETWORKS THAT MAXIMIZE THE AMOUNT OF INFORMATION TRANSMISSION

This work clarifies the relationship between network circuit (topology) and behavior (information transmission and synchronization) in active networks, e. g. neural networks. As an application, we show how to determine a network topology that is optimal for information transmission. By optimal, we mean that the network is able to transmit a large amount of information, it possesses a large number of communication channels, and it is robust under large variations of the network coupling configuration. This theoretical approach is general and does not depend on the particular dynamic of the elements forming the network, since the network topology can be determined by finding a Laplacian matrix (the matrix that describes the connections and the coupling strengths among the elements) whose eigenvalues satisfy some special conditions. To illustrate our ideas and theoretical approaches, we use neural networks of electrically connected chaotic Hindmarsh-Rose neurons.

Regularity at infinity of real mappings and a Morse-Sard theorem

We prove a new Morse-Sard-type theorem for the asymptotic critical values of semi-algebraic mappings and a new fibration theorem at infinity for C-2 mappings. We show the equivalence of three different types of regularity conditions which have been used in the literature in order to control the asymptotic behaviour of mappings. The central role of our picture is played by the p-regularity and its bridge toward the rho-regularity which implies topological triviality at infinity.

STRUCTURE AND DYNAMICS: THE TRANSITION FROM NONEQUILIBRIUM TO EQUILIBRIUM IN INTEGRATE-AND-FIRE DYNAMICS

The transient and equilibrium properties of dynamics unfolding in complex systems can depend critically on specific topological features of the underlying interconnections. In this work, we investigate such a relationship with respect to the integrate-and-fire dynamics emanating from a source node and an extended network model that allows control of the small-world feature as well as the length of the long-range connections. A systematic approach to investigate the local and global correlations between structural and dynamical features of the networks was adopted that involved extensive simulations (one and a half million cases) so as to obtain two-dimensional correlation maps. Smooth, but diverse surfaces of correlation values were obtained in all cases. Regarding the global cases, it has been verified that the onset avalanche time (but not its intensity) can be accurately predicted from the structural features within specific regions of the map (i.e. networks with specific structural properties). The analysis at local level revealed that the dynamical features before the avalanches can also be accurately predicted from structural features. This is not possible for the dynamical features after the avalanches take place. This is so because the overall topology of the network predominates over the local topology around the source at the stationary state.

TYPE-ZERO SADDLE-NODE BIFURCATIONS AND STABILITY REGION ESTIMATION OF NONLINEAR AUTONOMOUS DYNAMICAL SYSTEMS

A complete characterization of the stability boundary of a class of nonlinear dynamical systems that admit energy functions is developed in this paper. This characterization generalizes the existing results by allowing the type-zero saddle-node nonhyperbolic equilibrium points on the stability boundary. Conceptual algorithms to obtain optimal estimates of the stability region (basin of attraction) in the form of level sets of a given family of energy functions are derived. The behavior of the stability region and the corresponding estimates are investigated for parameter variation in the neighborhood of a type-zero saddle-node bifurcation value.

Dynamical changes from harmonic vibrations of a limited power supply driving a Duffing oscillator

The harmonic oscillations of a Duffing oscillator driven by a limited power supply are investigated as a function of the alternative strength of the rotor. The semi-trivial and non-trivial solutions are derived. We examine the stability of these solutions and then explore the complex behaviors associated with the bifurcations sequences. Interestingly, a 3D diagram provides a global view of the effects of alternate strength on the appearance of chaos and hyperchaos on the system.

An anatomical analysis of the mini-modified orbitozygomatic and supra-orbital approaches

Seven sides of cadaver heads were used to compare the surgical exposures provided by the mini-modified orbitozygomatic (MOz) and supra-orbital (SO) approaches. The Optotrak 3020 computerized tracking system (Northern Digital, Waterloo, ON, Canada) was utilized to evaluate the area of anatomical exposure defined by six points: (1) ipsilateral sphenoid ridge; (2) most distal point of the ipsilateral middle cerebral artery (MCA); (3) most distal point of the ipsilateral posterior cerebral artery (PCA); (4) most distal point of the contralateral PCA; (5) most distal point of the contralateral MCA; and (6) contralateral sphenoid ridge. Additionally, angles of approach for the ipsilateral MCA bifurcation, ipsilateral ICA bifurcation, basilar artery tip, contralateral MCA and ICA bifurcation and anterior communicating artery (AcomA) were evaluated, first for SO and then for MOz. An image guidance system was used to evaluate the limits of surgical exposure. No differences in the area of surgical exposure were noted (p > 0.05). Vertical angles were significantly wider for the ipsilateral and contralateral ICA bifurcation, AcomA, contralateral MCA and basilar tip (p < 0.05) for MOz. No differences in horizontal angles were observed between the approaches for the six targets (p > 0.05). There were no differences in the limits of exposure. MOz affords no additional surgical working space. However, our results demonstrate systematically that vertical exposure is improved. The MOz should be performed while planning an approach to these regions and a wider exposure in the vertical axis is needed. (C) 2012 Elsevier Ltd. All rights reserved.

Rationale, study design, and analysis plan of the Alveolar Recruitment for ARDS Trial (ART): Study protocol for a randomized controlled trial

Background: Acute respiratory distress syndrome (ARDS) is associated with high in-hospital mortality. Alveolar recruitment followed by ventilation at optimal titrated PEEP may reduce ventilator-induced lung injury and improve oxygenation in patients with ARDS, but the effects on mortality and other clinical outcomes remain unknown. This article reports the rationale, study design, and analysis plan of the Alveolar Recruitment for ARDS Trial (ART). Methods/Design: ART is a pragmatic, multicenter, randomized (concealed), controlled trial, which aims to determine if maximum stepwise alveolar recruitment associated with PEEP titration is able to increase 28-day survival in patients with ARDS compared to conventional treatment (ARDSNet strategy). We will enroll adult patients with ARDS of less than 72 h duration. The intervention group will receive an alveolar recruitment maneuver, with stepwise increases of PEEP achieving 45 cmH(2)O and peak pressure of 60 cmH2O, followed by ventilation with optimal PEEP titrated according to the static compliance of the respiratory system. In the control group, mechanical ventilation will follow a conventional protocol (ARDSNet). In both groups, we will use controlled volume mode with low tidal volumes (4 to 6 mL/kg of predicted body weight) and targeting plateau pressure <= 30 cmH2O. The primary outcome is 28-day survival, and the secondary outcomes are: length of ICU stay; length of hospital stay; pneumothorax requiring chest tube during first 7 days; barotrauma during first 7 days; mechanical ventilation-free days from days 1 to 28; ICU, in-hospital, and 6-month survival. ART is an event-guided trial planned to last until 520 events (deaths within 28 days) are observed. These events allow detection of a hazard ratio of 0.75, with 90% power and two-tailed type I error of 5%. All analysis will follow the intention-to-treat principle. Discussion: If the ART strategy with maximum recruitment and PEEP titration improves 28-day survival, this will represent a notable advance to the care of ARDS patients. Conversely, if the ART strategy is similar or inferior to the current evidence-based strategy (ARDSNet), this should also change current practice as many institutions routinely employ recruitment maneuvers and set PEEP levels according to some titration method.

Analysis of nonlinear dynamics of vocal folds using high-speed video observation and biomechanical modeling

Primary voice production occurs in the larynx through vibrational movements carried out by vocal folds. However, many problems can affect this complex system resulting in voice disorders. In this context, time-frequency-shape analysis based on embedding phase space plots and nonlinear dynamics methods have been used to evaluate the vocal fold dynamics during phonation. For this purpose, the present work used high-speed video to record the vocal fold movements of three subjects and extract the glottal area time series using an image segmentation algorithm. This signal is used for an optimization method which combines genetic algorithms and a quasi-Newton method to optimize the parameters of a biomechanical model of vocal folds based on lumped elements (masses, springs and dampers). After optimization, this model is capable of simulating the dynamics of recorded vocal folds and their glottal pulse. Bifurcation diagrams and phase space analysis were used to evaluate the behavior of this deterministic system in different circumstances. The results showed that this methodology can be used to extract some physiological parameters of vocal folds and reproduce some complex behaviors of these structures contributing to the scientific and clinical evaluation of voice production. (C) 2010 Elsevier Inc. All rights reserved.

The tangential variation of a localized flux-type eigenvalue problem

In this work the differentiability of the principal eigenvalue lambda = lambda(1)(Gamma) to the localized Steklov problem -Delta u + qu = 0 in Omega, partial derivative u/partial derivative nu = lambda chi(Gamma)(x)u on partial derivative Omega, where Gamma subset of partial derivative Omega is a smooth subdomain of partial derivative Omega and chi(Gamma) is its characteristic function relative to partial derivative Omega, is shown. As a key point, the flux subdomain Gamma is regarded here as the variable with respect to which such differentiation is performed. An explicit formula for the derivative of lambda(1) (Gamma) with respect to Gamma is obtained. The lack of regularity up to the boundary of the first derivative of the principal eigenfunctions is a further intrinsic feature of the problem. Therefore, the whole analysis must be done in the weak sense of H(1)(Omega). The study is of interest in mathematical models in morphogenesis. (C) 2011 Elsevier Inc. All rights reserved.

Assessing the effects of multiple infections and long latency in the dynamics of tuberculosis

In order to achieve a better understanding of multiple infections and long latency in the dynamics of Mycobacterium tuberculosis infection, we analyze a simple model. Since backward bifurcation is well documented in the literature with respect to the model we are considering, our aim is to illustrate this behavior in terms of the range of variations of the model's parameters. We show that backward bifurcation disappears (and forward bifurcation occurs) if: (a) the latent period is shortened below a critical value; and (b) the rates of super-infection and re-infection are decreased. This result shows that among immunosuppressed individuals, super-infection and/or changes in the latent period could act to facilitate the onset of tuberculosis. When we decrease the incubation period below the critical value, we obtain the curve of the incidence of tuberculosis following forward bifurcation; however, this curve envelops that obtained from the backward bifurcation diagram.

Conceptual problem for noncommutative inflation and the new approach for nonrelativistic inflationary equation of state

In a previous paper, we connected the phenomenological noncommutative inflation of Alexander, Brandenberger and Magueijo [ Phys. Rev. D 67 081301 (2003)] and Koh and Brandenberger [ J. Cosmol. Astropart Phys. 2007 21 ()] with the formal representation theory of groups and algebras and analyzed minimal conditions that the deformed dispersion relation should satisfy in order to lead to a successful inflation. In that paper, we showed that elementary tools of algebra allow a group-like procedure in which even Hopf algebras (roughly the symmetries of noncommutative spaces) could lead to the equation of state of inflationary radiation. Nevertheless, in this paper, we show that there exists a conceptual problem with the kind of representation that leads to the fundamental equations of the model. The problem comes from an incompatibility between one of the minimal conditions for successful inflation (the momentum of individual photons being bounded from above) and the Fock-space structure of the representation which leads to the fundamental inflationary equations of state. We show that the Fock structure, although mathematically allowed, would lead to problems with the overall consistency of physics, like leading to a problematic scattering theory, for example. We suggest replacing the Fock space by one of two possible structures that we propose. One of them relates to the general theory of Hopf algebras (here explained at an elementary level) while the other is based on a representation theorem of von Neumann algebras (a generalization of the Clebsch-Gordan coefficients), a proposal already suggested by us to take into account interactions in the inflationary equation of state.

Algorithms for network design and routing problems

In this thesis we study three combinatorial optimization problems belonging to the classes of Network Design and Vehicle Routing problems that are strongly linked in the context of the design and management of transportation networks: the Non-Bifurcated Capacitated Network Design Problem (NBP), the Period Vehicle Routing Problem (PVRP) and the Pickup and Delivery Problem with Time Windows (PDPTW). These problems are NP-hard and contain as special cases some well known difficult problems such as the Traveling Salesman Problem and the Steiner Tree Problem. Moreover, they model the core structure of many practical problems arising in logistics and telecommunications. The NBP is the problem of designing the optimum network to satisfy a given set of traffic demands. Given a set of nodes, a set of potential links and a set of point-to-point demands called commodities, the objective is to select the links to install and dimension their capacities so that all the demands can be routed between their respective endpoints, and the sum of link fixed costs and commodity routing costs is minimized. The problem is called non- bifurcated because the solution network must allow each demand to follow a single path, i.e., the flow of each demand cannot be splitted. Although this is the case in many real applications, the NBP has received significantly less attention in the literature than other capacitated network design problems that allow bifurcation. We describe an exact algorithm for the NBP that is based on solving by an integer programming solver a formulation of the problem strengthened by simple valid inequalities and four new heuristic algorithms. One of these heuristics is an adaptive memory metaheuristic, based on partial enumeration, that could be applied to a wider class of structured combinatorial optimization problems. In the PVRP a fleet of vehicles of identical capacity must be used to service a set of customers over a planning period of several days. Each customer specifies a service frequency, a set of allowable day-combinations and a quantity of product that the customer must receive every time he is visited. For example, a customer may require to be visited twice during a 5-day period imposing that these visits take place on Monday-Thursday or Monday-Friday or Tuesday-Friday. The problem consists in simultaneously assigning a day- combination to each customer and in designing the vehicle routes for each day so that each customer is visited the required number of times, the number of routes on each day does not exceed the number of vehicles available, and the total cost of the routes over the period is minimized. We also consider a tactical variant of this problem, called Tactical Planning Vehicle Routing Problem, where customers require to be visited on a specific day of the period but a penalty cost, called service cost, can be paid to postpone the visit to a later day than that required. At our knowledge all the algorithms proposed in the literature for the PVRP are heuristics. In this thesis we present for the first time an exact algorithm for the PVRP that is based on different relaxations of a set partitioning-like formulation. The effectiveness of the proposed algorithm is tested on a set of instances from the literature and on a new set of instances. Finally, the PDPTW is to service a set of transportation requests using a fleet of identical vehicles of limited capacity located at a central depot. Each request specifies a pickup location and a delivery location and requires that a given quantity of load is transported from the pickup location to the delivery location. Moreover, each location can be visited only within an associated time window. Each vehicle can perform at most one route and the problem is to satisfy all the requests using the available vehicles so that each request is serviced by a single vehicle, the load on each vehicle does not exceed the capacity, and all locations are visited according to their time window. We formulate the PDPTW as a set partitioning-like problem with additional cuts and we propose an exact algorithm based on different relaxations of the mathematical formulation and a branch-and-cut-and-price algorithm. The new algorithm is tested on two classes of problems from the literature and compared with a recent branch-and-cut-and-price algorithm from the literature.