Digestibility of resistant starch containing preparations using two in vitro models

BACKGROUND: Resistant starch (RS) is known for potential health benefits in the human colon. To investigate these positive effects it is important to be able to predict the amount, and the structure of starch reaching the large intestine. AIM OF THE STUDY: The aim of this study was to compare two different in vitro models simulating the digestibility of two RS containing preparations. METHODS: The substrates, high amylose maize (HAM) containing RS type 2, and retrograded long chain tapioca maltodextrins (RTmd) containing RS type 3 were in vitro digested using a batch and a dynamic model, respectively. Both preparations were characterized before and after digestion by using X-Ray and DSC, and by measuring their total starch, RS and protein contents. RESULTS: Using both digestion models, 60-61 g/100 g of RTmd turned out to be indigestible, which is very well in accordance with 59 g/100 g found in vivo after feeding RTmd to ileostomy patients. In contrast, dynamic and batch in vitro digestion experiments using HAM as a substrate led to 58 g/100 g and 66 g/100 g RS recovery. The degradability of HAM is more affected by differences in experimental parameters compared to RTmd. The main variations between the two in vitro digestion methods are the enzyme preparations used, incubation times and mechanical stress exerted on the substrate. However, for both preparations dynamically digested fractions led to lower amounts of analytically RS and a lower crystallinity. CONCLUSIONS: The two in vitro digestion methods used attacked the starch molecules differently, which influenced starch digestibility of HAM but not of RTmd

Strategic Alliance Management

Strategic Alliance Management presents an academically grounded alliance development framework, detailing eight stages of alliance development with consideration for specific management challenges. For each stage, readers are presented with theoretical insights, evidence-based managerial guidelines and a business case illustration. Other chapters consider alliance attributes, alliance competences, and alliance challenges, and cover topics such as innovation, co-branding, co-opetition, business ecosystems, alliance professionals, alliance capabilities, societal alliances and a tension-based alliance mindset.This fully revised 3rd edition leverages the book’s strengths in marrying theory with practical insight. All the chapters have been updated to reflect the current academic literature, whilst new international case studies are incorporated throughout. Two new chapters feature in this edition, considering the importance of the mindset required to successfully navigate alliance arrangements, and emerging alliance practices, exploring how new technologies, sustainability and the external environment have disrupted alliance management. In-chapter text boxes discussing emerging themes provide opportunity for discussion and analysis.The textbook remains highly valuable core and recommended reading for postgraduate students of Strategic Management and Corporate Strategy, MBA and Executive MBA, as well as reflective practitioners in the field. Online resources include chapter-by-chapter lecture slides, two long case studies and short interviews with alliance executives

Approximation algorithms for the test cover problem

In the test cover problem a set of m items is given together with a collection of subsets, called tests. A smallest subcollection of tests is to be selected such that for each pair of items there is a test in the selection that contains exactly one of the two items. It is known that the problem is NP-hard and that the greedy algorithm has a performance ratio O(log m). We observe that, unless P=NP, no polynomial-time algorithm can do essentially better. For the case that each test contains at most k items, we give an O(log k)-approximation algorithm. We pay special attention to the case that each test contains at most two items. A strong relation with a problem of packing paths in a graph is established, which implies that even this special case is NP-hard. We prove APX-hardness of both problems, derive performance guarantees for greedy algorithms, and discuss the performance of a series of local improvement heuristics

GLUE:twenty years on

This paper reviews the use of the Generalized Likelihood Uncertainty Estimation (GLUE) methodology in the 20 years since the paper by Beven and Binley in Hydrological Processes in (1992), which is now one of the most highly cited papers in hydrology. The original conception, the on-going controversy it has generated, the nature of different sources of uncertainty and the meaning of the GLUE prediction uncertainty bounds are discussed. The hydrological, rather than statistical, arguments about the nature of model and data errors and uncertainties that are the basis for GLUE are emphasized. The application of the Institute of Hydrology distributed model to the Gwy catchment at Plynlimon presented in the original paper is revisited, using a larger sample of models, a wider range of likelihood evaluations and new visualization techniques. It is concluded that there are good reasons to reject this model for that data set. This is a positive result in a research environment in that it requires improved models or data to be made available. In practice, there may be ethical issues of using outputs from models for which there is evidence for model rejection in decision making. Finally, some suggestions for what is needed in the next 20 years are provided

Supplementary data for the paper: Optimization of a decatungstate-catalyzed C(sp³)-H alkylation using a continuous oscillatory milli-structured photoreactor

This dataset contains data relative to a flow photochemical method for the alkylation of aliphatic C-H bonds in a specific reactor type. Data include numerical and graphical data relative to reaction yields, conversions, and productivity