MIT Uncertainty Quantification Group

We demonstrate an algorithm for efficient rare event sampling in a rotorcraft model. Helicopter design parameters are typically chosen for efficient performance in cruise and hover. At the same time, structural components such as the length of the tail are chosen so that the rotorcraft is stable under perturbation by environmental factors such as noisy wind. In the face of stochastic forcing, however, environmental conditions may still lead to rare accidents despite good engineering design. We adapt a recent dynamic importance sampling algorithm for small-noise diffusions, derived from the theory of large deviations, to efficient sampling of rare events in a model rotorcraft system. The method achieves variance reduction in estimating the probabilities of stall events, and helps identify the dynamics leading to these phenomena.

@inproceedings {conf_32,
  address    = "2018 AIAA SciTech Forum and 20th AIAA Non-Deterministic Approaches Conference",
  author     = "B. J. Zhang and B.-Y. Min and T. Sahai and Y. M. Marzouk",
  title      = "Rare event simulation of rotorcraft systems",
  year       = "2018",
  abstract   = "We demonstrate an algorithm for efficient rare event sampling in a rotorcraft model. Helicopter design parameters are typically chosen for efficient performance in cruise and hover. At the same time, structural components such as the length of the tail are chosen so that the rotorcraft is stable under perturbation by environmental factors such as noisy wind. In the face of stochastic forcing, however, environmental conditions may still lead to rare accidents despite good engineering design. We adapt a recent dynamic importance sampling algorithm for small-noise diffusions, derived from the theory of large deviations, to efficient sampling of rare events in a model rotorcraft system. The method achieves variance reduction in estimating the probabilities of stall events, and helps identify the dynamics leading to these phenomena."
}

Integration-based Gaussian filters such as unscented, cubature, and Gauss-Hermite filters are effective ways to assimilate data and models within nonlinear systems. Traditionally, these filters have only been applicable for systems with a handful of states due to stability and scalability issues. In this paper, we present a new integration method for scaling quadrature-based filters to higher dimensions. Our approach begins by decomposing the dynamics and observation models into separated, low-rank tensor formats. Once in low-rank tensor format, adaptive integration techniques may be used to efficiently propagate the mean and covariance of the distribution of the system state with computational complexity that is polynomial in dimension and rank. Simulation results are shown on nonlinear chaotic systems with 20 state variables.

@inproceedings {conf_30,
  address    = "56th IEEE Conference on Decision and Control (CDC)",
  author     = "A. Gorodetsky and S. Karaman and Y. M. Marzouk",
  title      = "Low-rank tensor integration for Gaussian filtering of continuous time nonlinear systems",
  year       = "2017",
  abstract   = "Integration-based Gaussian filters such as unscented, cubature, and Gauss-Hermite filters are effective ways to assimilate data and models within nonlinear systems. Traditionally, these filters have only been applicable for systems with a handful of states due to stability and scalability issues. In this paper, we present a new integration method for scaling quadrature-based filters to higher dimensions. Our approach begins by decomposing the dynamics and observation models into separated, low-rank tensor formats. Once in low-rank tensor format, adaptive integration techniques may be used to efficiently propagate the mean and covariance of the distribution of the system state with computational complexity that is polynomial in dimension and rank. Simulation results are shown on nonlinear chaotic systems with 20 state variables."
}

We propose an algorithm for fitting $C^1$ piecewise-Bézier curves to (possibly corrupted) data points on manifolds. The curve is chosen as a compromise between proximity to data points and regularity. We apply our algorithm as an example to fit a curve to a set of low-rank covariance matrices, a task arising in wind field modeling. We show that our algorithm has denoising abilities for this application.

@inproceedings {conf_29,
  address    = "25th European Symposium on Artificial Neural Networks, Computational Intelligence, and Machine Learning (ESANN 2017)",
  author     = "P.-Y. Gousenbourger and E. M. Massart and A. Musolas and P.-A. Absil and J. M. Hendrickx and L. Jacques and Y. M. Marzouk",
  title      = "Piecewise-Bézier C^1 smoothing on manifolds with application to wind field estimation",
  year       = "2017",
  abstract   = "We propose an algorithm for fitting $C^1$ piecewise-Bézier curves to (possibly corrupted) data points on manifolds. The curve is chosen as a compromise between proximity to data points and regularity. We apply our algorithm as an example to fit a curve to a set of low-rank covariance matrices, a task arising in wind field modeling. We show that our algorithm has denoising abilities for this application."
}

Design of complex engineering systems requires coupled analyses of the multiple disciplines affecting system performance. The coupling among disciplines typically contributes significantly to the computational cost of analyzing the system, and can become particularly burdensome when coupled analyses are embedded within a design or optimization loop. In many cases, disciplines may be weakly coupled, so that some of the coupling or interaction terms can be neglected without significantly impacting the accuracy of the system output. However, typical practice derives such approximations in an ad hoc manner using expert opinion and domain experience. This paper proposes a new approach that formulates an optimization problem to find an optimal model that balances accuracy of the model outputs with the sparsity of the discipline couplings. An adaptive sequential Monte Carlo sampling technique is used to efficiently search the combinatorial model space of different discipline couplings. Finally, an algorithm for optimal model selection is presented and applied to identify the important discipline couplings in a fire detection satellite model and a turbine engine cycle analysis model.

@inproceedings {conf_28,
  address    = "2017 AIAA SciTech Forum and 19th AIAA Non-Deterministic Approaches Conference",
  author     = "R. Baptista and Y. M. Marzouk and K. Willcox and B. Peherstorfer",
  title      = "Optimal approximations of coupling in multi-disciplinary models",
  year       = "2017",
  abstract   = "Design of complex engineering systems requires coupled analyses of the multiple disciplines affecting system performance. The coupling among disciplines typically contributes significantly to the computational cost of analyzing the system, and can become particularly burdensome when coupled analyses are embedded within a design or optimization loop. In many cases, disciplines may be weakly coupled, so that some of the coupling or interaction terms can be neglected without significantly impacting the accuracy of the system output. However, typical practice derives such approximations in an ad hoc manner using expert opinion and domain experience. This paper proposes a new approach that formulates an optimization problem to find an optimal model that balances accuracy of the model outputs with the sparsity of the discipline couplings. An adaptive sequential Monte Carlo sampling technique is used to efficiently search the combinatorial model space of different discipline couplings. Finally, an algorithm for optimal model selection is presented and applied to identify the important discipline couplings in a fire detection satellite model and a turbine engine cycle analysis model."
}

Measure transport provides a useful tool for characterizing multivariate non-Gaussian target distributions arising in Bayesian inference. The transport approach seeks a parametric map that pushes forward a chosen reference distribution to the target/posterior distribution, through minimization of a certain Kullback–Leibler divergence. Among the distinguishing features of this approach is the availability of a tractable error estimator for posterior approximation, along with the idea that transport can be cast as an infinite dimensional optimization problem whose variations can be evaluated in closed form. We use these ingredients to develop a method for adaptively constructing transport maps–-balancing the complexity of the map representation, approximation error, and computational cost.

@inproceedings {conf_27,
  address    = "NIPS 2016 workshop on Advances in Approximate Bayesian Inference",
  author     = "D. Bigoni and A. Spantini and Y. M. Marzouk",
  title      = "Adaptive construction of measure transports for Bayesian inference",
  year       = "2016",
  abstract   = "Measure transport provides a useful tool for characterizing multivariate non-Gaussian target distributions arising in Bayesian inference. The transport approach seeks a parametric map that pushes forward a chosen reference distribution to the target/posterior distribution, through minimization of a certain Kullback--Leibler divergence. Among the distinguishing features of this approach is the availability of a tractable error estimator for posterior approximation, along with the idea that transport can be cast as an infinite dimensional optimization problem whose variations can be evaluated in closed form. We use these ingredients to develop a method for adaptively constructing transport maps---balancing the complexity of the map representation, approximation error, and computational cost."
}

We describe a variational inference method that approximates an intractable target measure as the pushforward of a tractable distribution (e.g., a Gaussian) through a transport map. We then show how such transport maps can be decomposed–-i.e., factorized into the composition of finitely many low-dimensional maps. We use the notion of decomposable transports to derive new deterministic online algorithms for Bayesian filtering and smoothing in nonlinear/non-Gaussian state-space models with static parameters, and illustrate the theory on a stochastic volatility model.

@inproceedings {conf_26,
  address    = "NIPS 2016 workshop on Advances in Approximate Bayesian Inference",
  author     = "A. Spantini and D. Bigoni and Y. M. Marzouk",
  title      = "Variational inference via decomposable transports: new algorithms for Bayesian filtering and smoothing",
  year       = "2016",
  abstract   = "We describe a variational inference method that approximates an intractable target measure as the pushforward of a tractable distribution (e.g., a Gaussian) through a transport map. We then show how such transport maps can be decomposed---i.e., factorized into the composition of finitely many low-dimensional maps. We use the notion of decomposable transports to derive new deterministic online algorithms for Bayesian filtering and smoothing in nonlinear/non-Gaussian state-space models with static parameters, and illustrate the theory on a stochastic volatility model."
}

Correct-by-design automated construction of control systems has attracted a tremendous amount of attention. However, most existing algorithms for automated construction suffer from the curse of dimensionality, i.e., their run time scales exponentially with increasing dimensionality of the state space. As a result, typically, systems with only a few degrees of freedom are considered. In this paper, we propose a novel algorithm based on the tensor-train decomposition that solves stochastic optimal control problems with syntactically co-safe linear temporal logic specifications. We show that, under certain conditions, the run time of the proposed algorithm scales polynomially with the dimensionality of the state space and the rank of the optimal cost-to-go function. We demonstrate the algorithm in a six-dimensional problem instance involving a simple airplane model. In this example, the proposed algorithm provides up to four orders of computational savings when compared to the standard value iteration algorithm.

@inproceedings {conf_25,
  address    = "55th IEEE Conference on Decision and Control (CDC)",
  author     = "J. Alora and A. Gorodetsky and S. Karaman and Y. M. Marzouk and N. Lowry",
  title      = "Automated synthesis of low-rank control systems from sc-LTL specifications using tensor-train decompositions",
  year       = "2016",
  abstract   = "Correct-by-design automated construction of control systems has attracted a tremendous amount of attention. However, most existing algorithms for automated construction suffer from the curse of dimensionality, i.e., their run time scales exponentially with increasing dimensionality of the state space. As a result, typically, systems with only a few degrees of freedom are considered. In this paper, we propose a novel algorithm based on the tensor-train decomposition that solves stochastic optimal control problems with syntactically co-safe linear temporal logic specifications. We show that, under certain conditions, the run time of the proposed algorithm scales polynomially with the dimensionality of the state space and the rank of the optimal cost-to-go function. We demonstrate the algorithm in a six-dimensional problem instance involving a simple airplane model. In this example, the proposed algorithm provides up to four orders of computational savings when compared to the standard value iteration algorithm."
}

Many simulation tools for airfoil analysis and design are based on an integral approximation of the boundary layer. This approximate formulation cannot resolve the full dynamics of boundary layer flows, and hence requires additional models to account for unresolved effects. We introduce a new, data-driven, probabilistic model of these unresolved effects for the incompressible and laminar regime. To construct this model, we apply methods from supervised learning to a dataset containing over 1,550 airfoils. The result is a model that (i) is based on a large dataset of realistic airfoil configurations, and (ii) quantifies the model inadequacy associated with the use of an approximate boundary layer formulation. We also create a stochastic version of the airfoil design tool XFOIL by replacing its original boundary layer model with the probabilistic model developed here. We apply this stochastic version of XFOIL to compute the drag polars of two airfoils at low Reynolds numbers, and compare the results with experimental data.

@inproceedings {conf_24,
  address    = "34th AIAA Applied Aerodynamics Conference, AIAA AVIATION Forum",
  author     = "A. Marques and Q. Wang and Y. M. Marzouk",
  title      = "Data-driven probabilistic boundary layer modeling for airfoil performance prediction",
  year       = "2016",
  abstract   = "Many simulation tools for airfoil analysis and design are based on an integral approximation of the boundary layer. This approximate formulation cannot resolve the full dynamics of boundary layer flows, and hence requires additional models to account for unresolved effects. We introduce a new, data-driven, probabilistic model of these unresolved effects for the incompressible and laminar regime. To construct this model, we apply methods from supervised learning to a dataset containing over 1,550 airfoils. The result is a model that (i) is based on a large dataset of realistic airfoil configurations, and (ii) quantifies the model inadequacy associated with the use of an approximate boundary layer formulation. We also create a stochastic version of the airfoil design tool XFOIL by replacing its original boundary layer model with the probabilistic model developed here. We apply this stochastic version of XFOIL to compute the drag polars of two airfoils at low Reynolds numbers, and compare the results with experimental data."
}

Stochastic optimal control problems frequently arise as motion control problems in the context of robotics. Unfortunately, all existing approaches that guarantee arbitrary precision suffer from the curse of dimensionality: the computational effort invested by the algorithm grows exponentially fast with increasing dimensionality of the state space of the underlying dynamic system governing the robot. In this paper, we propose a novel algorithm that utilizes compressed representations to efficiently solve stochastic optimal control problems with arbitrary precision. The running time of the new algorithms scale linearly with increasing dimensionality of the state space! The running time also depends polynomially on the rank of the value function, a measure that quantifies the intrinsic geometric complexity of the value function, due to the geometry and physics embedded in the problem instance at hand. The new algorithms are based on the recent analysis and algorithms for tensor decomposition, generalizing matrix decomposition algorithms, e.g., the singular value decomposition, to three or more dimensions. In computational experiments, we show the computational effort of the new algorithm also scales linearly with the discretization resolution of the state space. We also demonstrate the new algorithm on a problem involving the perching of an aircraft, represented by a nonlinear non-holonomic longitudinal model with a seven-dimensional state space, the full numerical solution to which was not obtained before. In this example, we estimate that the proposed algorithm runs more than seven orders of magnitude faster than the naive value iteration.

@inproceedings {conf_23,
  address    = "Robotics: Science and Systems (RSS) XI. Rome, Italy.",
  author     = "A. Gorodetsky and S. Karaman and Y. M. Marzouk",
  title      = "Efficient high-dimensional stochastic optimal motion control using tensor-train decomposition",
  year       = "2015",
  abstract   = "Stochastic optimal control problems frequently arise as motion control problems in the context of robotics. Unfortunately, all existing approaches that guarantee arbitrary precision suffer from the curse of dimensionality: the computational effort invested by the algorithm grows exponentially fast with increasing dimensionality of the state space of the underlying dynamic system governing the robot. In this paper, we propose a novel algorithm that utilizes compressed representations to efficiently solve stochastic optimal control problems with arbitrary precision. The running time of the new algorithms scale linearly with increasing dimensionality of the state space! The running time also depends polynomially on the rank of the value function, a measure that quantifies the intrinsic geometric complexity of the value function, due to the geometry and physics embedded in the problem instance at hand. The new algorithms are based on the recent analysis and algorithms for tensor decomposition, generalizing matrix decomposition algorithms, e.g., the singular value decomposition, to three or more dimensions. In computational experiments, we show the computational effort of the new algorithm also scales linearly with the discretization resolution of the state space. We also demonstrate the new algorithm on a problem involving the perching of an aircraft, represented by a nonlinear non-holonomic longitudinal model with a seven-dimensional state space, the full numerical solution to which was not obtained before. In this example, we estimate that the proposed algorithm runs more than seven orders of magnitude faster than the naive value iteration."
}

Optimizing wells placement may help in better understanding subsurface solute transport and detecting contaminant plumes. In this work, we use the ensemble Kalman filter (EnKF) as a data assimilation tool and propose a greedy observational design algorithm to optimally select aquifer wells locations for updating the prior contaminant ensemble. The algorithm is greedy in the sense that it operates sequentially, without taking into account expected future gains. The selection criteria is based on maximizing the information gain that the EnKF carries during the update of the prior uncertainties. We test the efficiency of this algorithm in a synthetic aquifer system where a contaminant plume is set to migrate over a 30 years period across a heterogenous domain.

@inproceedings {conf_22,
  address    = "Dynamic Data-Driven Environmental Systems Science (DyDESS), Cambridge, MA.",
  author     = "M. E. Gharamti and Y. M. Marzouk and X. Huan and I. Hoteit",
  title      = "A greedy approach for placement of subsurface aquifer wells in an ensemble filtering framework",
  year       = "2015",
  abstract   = "Optimizing wells placement may help in better understanding subsurface solute transport and detecting contaminant plumes. In this work, we use the ensemble Kalman filter (EnKF) as a data assimilation tool and propose a greedy observational design algorithm to optimally select aquifer wells locations for updating the prior contaminant ensemble. The algorithm is greedy in the sense that it operates sequentially, without taking into account expected future gains. The selection criteria is based on maximizing the information gain that the EnKF carries during the update of the prior uncertainties. We test the efficiency of this algorithm in a synthetic aquifer system where a contaminant plume is set to migrate over a 30 years period across a heterogenous domain."
}

@inproceedings {conf_21,
  address    = "First SIGPLAN Workshop on Probabilistic and Approximate Computing (Collocated with PLDI 2014). Edinburgh, UK.",
  author     = "F. Augustin and Y. M. Marzouk",
  title      = "Uncertainty quantification in high-performance computing",
  year       = "2014"
}

We present a texton-based, multi-stage Bayesian level set algorithm which we use to segment colony images of hESC and their derivatives. We extend our previous research segmenting stem cells according to multiresolution texture methods to accommodate colonies and tissues with diffuse and varied textures via a filter bank approach similar to the MR8. Texture features computed for test images are classified via comparison with learned sets of class-specific textural primitives, known as textons. Encompassing this texture model is the new Bayesian level set algorithm, which smoothes and regularizes classification similar to level sets but is simpler in its probabilistic implementation. The resulting algorithm accurately and automatically classifies images of pluripotent hESC and trophectoderm colonies for high-content screening applications.

@inproceedings {conf_20,
  address    = "9th IEEE International Symposium on Biomedical Imaging (ISBI). Barcelona, Spain.",
  author     = "N. Lowry and R. Mangoubi and M. Desai and Y. M. Marzouk and P. Sammak",
  title      = "Texton-based segmentation and classification of human embryonic stem cell colonies using multi-stage Bayesian level sets",
  year       = "2012",
  abstract   = "We present a texton-based, multi-stage Bayesian level set algorithm which we use to segment colony images of hESC and their derivatives. We extend our previous research segmenting stem cells according to multiresolution texture methods to accommodate colonies and tissues with diffuse and varied textures via a filter bank approach similar to the MR8. Texture features computed for test images are classified via comparison with learned sets of class-specific textural primitives, known as textons. Encompassing this texture model is the new Bayesian level set algorithm, which smoothes and regularizes classification similar to level sets but is simpler in its probabilistic implementation. The resulting algorithm accurately and automatically classifies images of pluripotent hESC and trophectoderm colonies for high-content screening applications."
}

Chemical kinetic systems contain both considerable uncertainty in their rate parameters and dynamics at multiple time scales. The latter feature aids model reduction in the deterministic case, but model reduction under uncertainty raises new challenges. We use computational singular perturbation (CSP) to calculate probabilistic “importance indices” for species-reaction pairs. Distributions of these indices are used to form reduced models that yield predictions within probabilistic bounds determined by the full model, or, alternatively, preserve entire output distributions of the full model.

@inproceedings {conf_19,
  address    = "International Workshop on Model Reduction in Reacting Flow/13th International Conference on Numerical Combustion. Corfu, Greece",
  author     = "T. Coles and H. Najm and Y. M. Marzouk",
  title      = "CSP simplification of chemical kinetic systems under uncertainty",
  year       = "2011",
  abstract   = "Chemical kinetic systems contain both considerable uncertainty in their rate parameters and dynamics at multiple time scales. The latter feature aids model reduction in the deterministic case, but model reduction under uncertainty raises new challenges. We use computational singular perturbation (CSP) to calculate probabilistic “importance indices” for species-reaction pairs. Distributions of these indices are used to form reduced models that yield predictions within probabilistic bounds determined by the full model, or, alternatively, preserve entire output distributions of the full model."
}

@inproceedings {conf_18,
  address    = "IEEE International Symposium on Biomedical Imaging. Chicago, IL",
  author     = "N. Lowry and R. Mangoubi and M. Desai and Y. M. Marzouk and P. Sammak",
  title      = "A unified approach to expectation maximization and level set segmentation applied to stem cell and brain MRI images",
  year       = "2011"
}

@inproceedings {conf_17,
  address    = "49th AIAA Aerospace Sciences Meeting. Orlando, FL",
  author     = "X. Huan and Y. M. Marzouk",
  title      = "Optimal Bayesian experimental design for combustion kinetics.",
  year       = "2011"
}

@inproceedings {conf_16,
  address    = "Western States Section of the Combustion Institute, Fall Meeting, Irvine, CA",
  author     = "B. Debusschere and B. Rhoads and H. Najm and Y. M. Marzouk and D. Goussis and M. Valorani and M. Frenklach",
  title      = "Time integration of chemical kinetics with computational singular perturbation and tabulation",
  year       = "2009"
}

@inproceedings {conf_15,
  address    = "Second International Workshop on Model Reduction in Reacting Flows, Notre Dame, IN",
  author     = "Y. M. Marzouk and B. Debusschere and H. Najm and D. Goussis and M. Valorani and M. Frenklach",
  title      = "Time integration of reacting flows with CSP tabulation",
  year       = "2009"
}

no abstract

@inproceedings {conf_14,
  address    = "SciDAC 2008, Seattle, WA.",
  author     = "Najm, H.N. and Safta, C. and Marzouk, Y.M. and Ray, J. and Valorani, M. and Goussis, D.",
  title      = "High-order AMR computations of reacting flow with adaptive reduction of chemical stiffness",
  year       = "2008"
}

@inproceedings {conf_13,
  address    = "Proceedings of the 2008 Joint Statistical Meetings; Denver, CO.",
  author     = "Ray, J. and Marzouk, Y.M.",
  title      = "A Bayesian method for inferring transmission chains in a partially observed epidemic",
  year       = "2008"
}

no abstract

@inproceedings {conf_12,
  address    = "RAND/ASA Conference on Quantitative Methods & Statistical Applications in Defense and National Security., Santa Monica, CA, USA",
  author     = "Ray, J. and Marzouk, Y.M. and Najm, H.N. and Kraus, M. and Fast, P.",
  booktitle  = "Proceedings of the American Statistical Association.",
  title      = "Estimating bioterror attacks from patient data: a Bayesian approach",
  year       = "2006"
}

@inproceedings {conf_11,
  address    = "AIAA paper 2006-1492",
  author     = "Marzouk, Y.M. and Ghoniem, A.F.",
  title      = "Actuating transverse jets via nozzle-edge vortical perturbations",
  year       = "2006"
}

no abstract

@inproceedings {conf_10,
  address    = "Bayesian Inference and Maximum Entropy Methods in Science and Engineering",
  author     = "Marzouk, Y.M. and Najm, H.N. and Rahn, L.A.",
  title      = "Stochastic spectral methods for efficient Bayesian solution of inverse problems",
  year       = "2005"
}

no abstract

@inproceedings {conf_9,
  address    = "Third MIT Conference on Computational Fluid and Solid Mechanics",
  author     = "Speth, R.L. and Marzouk, Y.M. and Ghoniem, A.F.",
  title      = "A quasi-one-dimensional unsteady laminar flame formulation with independent strain rate and curvature",
  year       = "2005"
}

@inproceedings {conf_8,
  address    = "AIAA paper 2005-0308",
  author     = "Marzouk, Y.M. and Ghoniem, A.F.",
  title      = "Simulations of high Reynolds number transverse jets and analysis of the underlying vortical structures",
  year       = "2005"
}

@inproceedings {conf_7,
  address    = "AIAA paper 2005-0291",
  author     = "Wee, D.H. and Marzouk, Y.M. and Ghoniem, A.F.",
  title      = "Lagrangian simulation of a jet in crossflow at finite Reynolds number",
  year       = "2005"
}

@inproceedings {conf_6,
  address    = "AIAA paper 2005-0143",
  author     = "Speth, R.L. and Marzouk, Y.M. and Ghoniem, A.F.",
  title      = "Impact of hydrogen addition on flame response to stretch and curvature",
  year       = "2005"
}

@inproceedings {conf_5,
  address    = "AIAA paper 2004-0096",
  author     = "Marzouk, Y.M. and Ghoniem, A.F.",
  title      = "Vorticity formulation for an actuated jet in crossflow",
  year       = "2004"
}

no abstract

@inproceedings {conf_4,
  address    = "Proceedings of the Second MIT Conference on Computational Fluid and Solid Mechanics",
  author     = "Marzouk, Y.M. and Ghoniem, A.F.",
  title      = "Vorticity generation mechanisms and correct boundary conditions for transverse jet simulation",
  year       = "2003"
}

@inproceedings {conf_3,
  address    = "AIAA paper 2002-1063",
  author     = "Marzouk, Y.M. and Ghoniem, A.F. and Najm, H.N.",
  title      = "Mechanism of streamwise vorticity formation in a transverse jet",
  year       = "2002"
}

no abstract

@inproceedings {conf_2,
  address    = "Proceedings of the Second Mediterranean Combustion Symposium: 372--383",
  author     = "Marzouk, Y.M. and Ghoniem, A.F. and Najm, H.N.",
  title      = "Can a one-dimensional strained flame model flame-vortex interactions?",
  year       = "2002"
}

@inproceedings {conf_1,
  address    = "AIAA paper 2000-0866",
  author     = "Marzouk, Y.M. and Ghoniem, A.F. and Najm, H.N.",
  title      = "A flame embedding model for turbulent combustion simulation",
  year       = "2000"
}