A recipe-based, diet-planning modelling system.

P Leung; K Wanitprapha; L A Quinn

doi:10.1079/bjn19950119

Home/Archive/PubMed

PubMed · 7547833

A recipe-based, diet-planning modelling system.

P Leung·K Wanitprapha·L A Quinn

View original source ↗Export metadata ↓

Abstract

In a recent article in the British Journal of Nutrition, Sklan & Dariel (1993) presented a method for diet planning employing a mixed-integer programming algorithm for meeting nutritional requirements at minimum costs for institutions or individuals. They recognized that most food items are generally consumed in whole units and as such they are represented as integer variables. However, as in most previous studies, they derived the minimum cost diets by optimizing over purchased food items. The present paper presents a computer-assisted, diet-planning modelling system for individuals by optimizing over recipes instead of food items. This is accomplished by restricting the integer programming solutions to those bundles of food that represent reasonably popular meal recipes. The modelling system is composed of three main components: recipe data entry, database management, and the model. The recipe data entry component creates and stores recipes. It also provides nutritional analysis of the recipes. The database management component creates and maintains several databases necessary to build the modelling data file. The modelling component solves the user-specified model. Currently, the model component can solve for the optimal diet by minimizing cost or minimizing cooking and preparation time. The optimal diet is prepared to satisfy the recommended nutritional guidelines for a predefined group of individuals for 1 week. The system currently has 895 popular recipes found in Hawaii. Diet plans generated using this modelling system with differing objectives are discussed and compared.

Explore related subjects

Computer Simulation Costs and Cost Analysis Diet Food Handling Humans Mathematics Menu Planning Models, Theoretical Nutritive Value Time Factors Journal Article Research Support, U.S. Gov't, Non-P.H.S.

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

P Leung, K Wanitprapha, L A Quinn. 1995. A recipe-based, diet-planning modelling system.. https://doi.org/10.1079/bjn19950119

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

PubMed2025

Generating correlated data for omics simulation.

Simulation of realistic omics data is a key input for benchmarking studies that help users obtain optimal computational pipelines. Omics data involves large numbers of measured features on each sample and these measures are generally correlated with each other. However, simulation too often ignores these correlations, perhaps due to computational and statistical hurdles of doing so. To alleviate this, we describe three approaches for generating omics-scale data with correlated measures which mimic real datasets. These approaches are all based on a Gaussian copula approach with a covariance matrix that decomposes into a diagonal part and a low-rank part. This decomposition allows for extremely efficient simulation, overcoming a hurdle for adoption of past methods. We use these approaches to demonstrate the importance of including correlation in two benchmarking applications. First, we show that variance of results from the popular DESeq2 method increases when dependence is included. Second, we demonstrate that CYCLOPS, a method for inferring circadian time of collection from transcriptomics, improves in performance when given gene-gene dependencies in some circumstances. We provide an R package, dependentsimr, that has efficient implementations of these methods and can generate dependent data with arbitrary marginal distributions, including discrete (binary, ordered categorical, Poisson, negative binomial), continuous (normal), or with an empirical distribution.

Computer Simulation↗

PubMed2017

Addressing current challenges in cancer immunotherapy with mathematical and computational modelling.

The goal of cancer immunotherapy is to boost a patient's immune response to a tumour. Yet, the design of an effective immunotherapy is complicated by various factors, including a potentially immunosuppressive tumour microenvironment, immune-modulating effects of conventional treatments and therapy-related toxicities. These complexities can be incorporated into mathematical and computational models of cancer immunotherapy that can then be used to aid in rational therapy design. In this review, we survey modelling approaches under the umbrella of the major challenges facing immunotherapy development, which encompass tumour classification, optimal treatment scheduling and combination therapy design. Although overlapping, each challenge has presented unique opportunities for modellers to make contributions using analytical and numerical analysis of model outcomes, as well as optimization algorithms. We discuss several examples of models that have grown in complexity as more biological information has become available, showcasing how model development is a dynamic process interlinked with the rapid advances in tumour-immune biology. We conclude the review with recommendations for modellers both with respect to methodology and biological direction that might help keep modellers at the forefront of cancer immunotherapy development.

Computer Simulation↗

PubMed2004

Accurate and efficient description of protein vibrational dynamics: comparing molecular dynamics and Gaussian models.

Current all-atom potential based molecular dynamics (MD) allows the identification of a protein's functional motions on a wide-range of timescales, up to few tens of nanoseconds. However, functional, large-scale motions of proteins may occur on a timescale currently not accessible by all-atom potential based MD. To avoid the massive computational effort required by this approach, several simplified schemes have been introduced. One of the most satisfactory is the Gaussian network approach based on the energy expansion in terms of the deviation of the protein backbone from its native configuration. Here, we consider an extension of this model that captures in a more realistic way the distribution of native interactions due to the introduction of effective side-chain centroids. Since their location is entirely determined by the protein backbone, the model is amenable to the same exact and computationally efficient treatment as previous simpler models. The ability of the model to describe the correlated motion of protein residues in thermodynamic equilibrium is established through a series of successful comparisons with an extensive (14 ns) MD simulation based on the AMBER potential of HIV-1 protease in complex with a peptide substrate. Thus, the model presented here emerges as a powerful tool to provide preliminary, fast yet accurate characterizations of protein near-native motion.

Computer Simulation↗