Main navigation | Main content
University of Delaware | |
University of Minnesota, Twin Cities | |
University of Minnesota, Twin Cities |
Description
The IMA is holding a 10-day workshop on Mathematical Modeling in Industry. The workshop is designed to provide graduate students and qualified advanced undergraduates with first hand experience in industrial research.
Format
Students will work in teams of up to 6 students under the guidance of a mentor from industry. The mentor will help guide the students in the modeling process, analysis and computational work associated with a real-world industrial problem. A progress report from each team will be scheduled during the period. In addition, each team will be expected to make an oral final presentation and submit a written report at the end of the 10-day period.
Application Procedure
Graduate students and advanced undergraduates are invited to apply. An application form must be submitted to the IMA. In addition, two letters of recommendation are required; one must be from the student's advisor, director of graduate studies, or department chair. Prerequisites vary and depend on the project, but computational skills are important.
The IMA will cover local living expenses and will offer to pay airfare for the math modeling participants. Selection criteria will be based on background and statement of interest, as well as geographic and institutional diversity. Women and minorities are especially encouraged to apply. Applications must be completed by April 15, 2006 for full consideration. Early submissions are encouraged. Successful applicants will be notified by April 30, 2006.
Completed application forms and Letters of Recommendation should be addressed to "Math Modeling Committee" and emailed to mm-applications@ima.umn.edu. Text, pdf or postscript files are prefered.
The goal of this project is to develop a set of algorithms implemented in software (such as Matlab) that reads and analyzes a birefringence map for a glass sample after exposure to a UV laser. The purpose of the analysis is to characterize how much strain (density change) has been produced in the glass by the laser exposure. This result can be reduced to a single number (the density change) but should be accompanied by some kind of error bar or quality of fit assessment. The analysis is to be performed in several steps, each of which offers opportunities for algorithm design and optimization:
1. A baseline measurement is read from a data file. This gives the birefringence of the glass sample prior to any laser exposure.
2. An experimental data file is read in, giving the birefringence field of the same sample after laser exposure. It is necessary to align the two fields of data so that the baseline can be subtracted from the post-exposure field. The alignment involves a two-dimensional translation (no rotation or scale change), but the translation may well be a sub-pixel value. (Typically the data sets are on a uniform grid of 0.5 mm spacing, which is a little coarser than some of the features we hope to study.) After subtraction, the resulting field of data represents only the laser-induced birefringence, without artifacts due to the initial birefringence of the sample.
3. A theoretical birefringence field is read in. This has been calculated assuming a nominal fractional density change (e.g. 1ppm ) and takes into account the sample boundary conditions and exposure geometry. The theoretical birefringence field must be aligned with the subtracted file calculated above, again with a sub-pixel shift, and then a best-fit value of the density should be deduced to give the best agreement between theory and measurement. Theory and experiment are compared in Figure 1.
Figure 1. Calculated (left) and measured (right) birefringence maps for a laser-exposed sample. Small lines show slow axis orientation, blue regions have low birefringence and green regions have higher birefringence.
There are several features of this problem that makes it mathematically more interesting:
1. Birefringence (defined as the difference in optical index of refraction for orthogonal polarizations of light) is a quantity with both magnitude and direction, but is not a vector. Manipulating and calculating birefringence fields offers some challenges.
2. Sub-pixel alignment of data sets requires some kind of interpolation scheme, such as Fourier interpolation by use of FFTs or something else. Optimizing the alignment with slightly noisy data offers some challenges.
3. The underlying physics of birefringence and why the birefringence fields look as they do (e.g. zero in the center of the exposed region, peak value just outside the exposed region) is interesting to study and understand.
References:
J. Moll, D. C. Allan, and U. Neukirch, Advances in the use of birefringence to measure laser-induced density changes in fused silica," SPIE 5377, 1721-1726 (2004)
N.F. Borrelli, C. Smith, D.C. Allan, T.P. Seward III, "Densification of fused silica under 193-nm excitation",J. Opt. Soc. Am. B 14 (7), 1606-1615 (1997).
Prerequisites:
Required: computing skills, including familiarity with FFTs, manipulating data arrays, and plotting two-dimensional data fields.
Desired: some optics (not required), some physics (not required), familiarity continuum elastic theory (stress and strain)
One of the more intriguing choices of finite elements in the finite element method is B-splines. B-splines can be constructed to form a basis for any space of piecewise polynomial functions, including those which have specified continuity conditions at the junctions between the individual polynomial pieces. The classical finite element method based on B-splines for ODEs is de Boor - Swartz collocation at Gauss points. Until recently, however, extensions to more than one variable were hard to come by.
This project is straightforward: We will attempt to implement a finite element method for an elliptical PDE using WEB-splines. We will test the code on a fairly simple cylindrical beam that comes from an established multi-disciplinary design optimization problem. If time permits, we will perform the actual design optimization on the given part using the WEB-spline code that we will have developed.
References
Hoellig, Klaus. Finite Element Methods with B-splines. Philadelphia: SIAM Frontiers and Applied Mathematics Series, 2003.
de Boor, C. and B. Swartz. "Collocation at Gaussian points," SIAM Journal of Numerical Analysis 10, pp. 582-606 (1973).
Prerequisite:
Required: One semester of numerical analysis, knowledge of programming
Desired: One semester of partial differential equations.
Cell membrane forms a closed shell separating the cell content (cytoplasm) from the extra cellular matrix, both of which are simply aqueous solutions of electrolytes and neutral molecules. Typically, there is a net positive charge in the outside surface (extracellular) of the membrane and a net negative charge in the inside surface (cytoplamic) of the membrane. As such, there is a voltage drop from the outside surface to the inside surface across the membrane. However, the membrane itself is hydrophobic and deformable. When there is an external electric field, e.g. by a charged foreign particle, the surface charge densities of the membrane could be disturbed. Because the system is in electrolyte solutions, the static interactions need to be modeled with the Poisson-Boltzmann equation. The problems proposed here are: (1) How are the surface charge densities of the membrane disturbed by a charged particle? What are the interactions between the particle and the membrane? (2) If the particle is smaller than the cell, when it touches the membrane surface, how does it deform the membrane and can it pass through the membrane? Consider the following variables for the above analysis: the size and charge of the particle, surface charge density and surface tension of the membrane, membrane curvature and rigidity, and particle-membrane distance. One can assume that both the particle and the cell are spheres. The electrolyte solutions both inside and outside of the cell are the same. The membrane thickness (about 5 nm) is much smaller than cell size (1 to 10 micron).
References
W.B. Russel, D.A. Saville, W.R. Schowalter, Colloidal Dispersions, Cambridge Univ Pr., 1992
Jacob N. Israelachvili, Intermolecular and Surface Forces: With Applications to Colloidal and Biological Systems, Elsevier Science & Technology Books, 1992
Miles D. Houslay, Keith K. Stanley, Dynamics of Biological Membrane: Influence on Synthesis Structure and Functions, Wiley, John & Sons, 1982
Prerequisites:
Required: None
Desired: Familiarity with electromagnetics, statistical mechanics
Background:
Computerized reservoir simulation models are widely used in the industry to forecast the behavior of hydrocarbon reservoirs and connected surface facilities over long production periods. These simulation models are increasingly complex and costly to build and often use millions of individual cells in their discretization of the reservoir volume. Simulation processing time and memory requirements increase constantly and even the utilization of ever faster computers cannot stem the growth of simulation turnaround time.
On the other hand, decision makers in reservoir and field management need to quickly assess the risks associated with a certain model and production strategy and need to come up with high/low scenarios for NPV and the likelihood of these scenarios. To achieve reduced turnaround time in this difficult environment, reservoir engineers and applied mathematicians employ optimization techniques that use surrogate models (i.e. a response surface) to perform these tasks – the costly simulation model is used to seed the design space and to assist with local refinement of the surrogate model.
Task:
The project team will face an interesting and challenging task, subdivided into three steps:
The team creates a response surface model for a given reservoir using a simplified black-oil reservoir simulator to seed the design space. The challenge is to avoid factorial decomposition of the input parameters and still obtain a relevant distribution of points within the design space.
Once the response surface model is built, the team will use it to investigate certain scenarios and come up with P10, P50 and P90 parameter estimates. In part two of this step, the NPV will be optimized for each scenario.
The last step is to use the response surface and simulator to perform a simple history match. The emphasis here is on making use of the response surface model to reduce turnaround time. Local refinement of the response surface will be necessary.
Prerequisites:
Required: computing experience, some background in optimization and/or statistical modeling
Desired: geostatistics, control, reservoir simulation
Many kinds of image degradation, including blur due to defocus or camera motion, may be modeled by convolution of the unknown original image by an appropriate point spread function (PSF). Recovery of the original image is referred to as deconvolution. The more difficult problem of blind deconvolution arises when the PSF is also unknown.
The goal of the project is to design and implement an effective algorithm for blind deconvolution of images degraded by motion blur (see figures). The project will consist of the following stages:
Develop a theoretical and practical understanding (via computational experiments) of classical approaches to blind deconvolution.
Perform a literature survey to become acquainted with some of the more recent advanced approaches to this problem. For example, those based on total variation regularization ("Total Variation Blind Deconvolution", Tony F. Chan and Chiu-Kwong Wong, ftp://ftp.math.ucla.edu/pub/camreport/cam96-45.ps.gz, wavelet methods ("ForWaRD: Fourier-Wavelet Regularized Deconvolution for Ill-Conditioned Systems Ramesh Neelamani", Hyeokho Choi, and Richard Baraniuk, http://www-dsp.rice.edu/publications/pub/neelshdecon.pdf), or nonnegative matrix factorization ("Single-frame multichannel blind deconvolution by nonnegative matrix factorization with sparseness constraints", Ivica Kopriva, http://ol.osa.org/abstract.cfm?id=86353)
Devise one or two new or modified approaches to implement and pursue via computational experiment.
Figure 1. Motion-blurred image and deconvolved image. From Maximum Entropy Data Consultants Ltd (UK) http://www.maxent.co.uk/example_1.htm
References:
Deepa Kundur and Dimitrios Hatzinakos, Blind image deconvolution", IEEE Signal Processing Magazine, May 1996. PDF available at http://www.ece.tamu.edu/~deepa/pdf/KunHat96a.pdf (Also see their followup article at http://www.ece.tamu.edu/~deepa/pdf/00543976.pdf
Ming Jiang and Ge Wang, Development of blind image deconvolution and its applications, Journal of X-Ray Science and Technology, 11, 2003 PDF available at http://www.uiowa.edu/~mihpclab/papers/096-Jiang-Wang%20blind.pdf
Matlab Image Processing Toolbox tutorial on Image Deblurring, at http://www.mathworks.com/access/helpdesk/help/toolbox/images/deblurri.html
Prerequisites:
Required: 1 semester of Fourier analysis, good computing skills (Matlab, C, or Python preferred)
Desired: Some background in mathematics of digital signal processing.
Beneficial: Familiarity with convex optimization and regularization methods, wavelet analysis
Scheduling problems occur in many industrial settings and have been studied extensively. They are used in many applications ranging from determining manufacturing schedules to allocating memory in computer systems. In this project we study the scheduling problem known as the Carpool problem: suppose that a subset of the people in a neighborhood gets together to carpool to work every morning. What is the fairest way to choose the driver each day? This problem has applications to the scheduling of multiple tasks on a single resource. The goal of this project is to study various aspects of algorithms to solve the Carpool problem, including optimality and performance.
References:
M. Ajtai, J. Aspnes, M. Naor, Y. Rabani, L. J. Schulman, and O. Waarts, Fairness in scheduling, Journal ofAlgorithms, 29(2), 306-357, 1998.
S. K. Baruah, N. K. Cohen, C. G. Plaxton, and D. A. Varvel, Proportionate progress: A notion of fairness in resource allocation, Algorithmica, 15, 600-625, 1996.
R. Fagin and J. H. Williams, A fair carpool scheduling algorithm, IBM Journal of Research and Development, 27(2),133-139, 1983.
Prerequisites:
Required: 1 semester of computer science or computer programming course
Desired: 1 semester of optimization/mathematical programming course.
Wednesday | Thursday | Friday | Saturday | Sunday | Monday | Tuesday | Wednesday | Thursday | Friday | | |||
---|---|---|---|
Wednesday August 09, 2006 | |||
Workshop Outline: Posing of problems by the 6 industry mentors. Half-hour introductory talks in the morning followed by a welcoming lunch. In the afternoon, the teams work with the mentors. The goal at the end of the day is to get the students to start working on the projects. | |||
9:00am-9:30am | Coffee and Registration | EE/CS 3-176 | |
9:30am-9:40am | Welcome and Introduction | Douglas Arnold (University of Minnesota, Twin Cities) Richard Braun (University of Delaware) Fernando Reitich (University of Minnesota, Twin Cities) Fadil Santosa (University of Minnesota, Twin Cities) | EE/CS 3-180 |
9:40am-10:00am | Team 1:Birefringence data analysis | Douglas Allan (Corning Incorporated) | EE/CS 3-180 |
10:00am-10:20am | Team 2: WEB-spline Finite Elements | Thomas Grandine (The Boeing Company) | EE/CS 3-180 |
10:20am-10:40am | Team 3: Cell-Foreign Particle Interactions | Suping Lyu (Medtronic) | EE/CS 3-180 |
10:40am-11:00am | Break | EE/CS 3-176 | |
11:00am-11:20am | Team 4: Reservoir Model Optimization under Uncertainty | Klaus Wiegand (ExxonMobil) | EE/CS 3-180 |
11:20am-11:40am | Team 5: Blind Deconvolution of Motion Blur in Static Images | Brendt Wohlberg (Los Alamos National Laboratory) | EE/CS 3-180 |
11:40am-12:00pm | Team 6: Algorithms for the Carpool Problem | Chai Wah Wu (IBM) | EE/CS 3-180 |
12:00pm-1:30pm | Lunch | 400 Lind Hall | |
1:30pm-4:30pm | afternoon - start work on projects | Break-out Rooms | |
Thursday August 10, 2006 | |||
Students work on the projects. Mentors guide their groups through the modeling process, leading discussion sessions, suggesting references, and assigning work. | |||
Friday August 11, 2006 | |||
Students work on the projects. Mentors guide their groups through the modeling process, leading discussion sessions, suggesting references, and assigning work. | |||
Saturday August 12, 2006 | |||
Students and mentors work on the projects. | |||
Sunday August 13, 2006 | |||
Students and mentors work on the projects. | |||
Monday August 14, 2006 | |||
9:30am-9:50am | Team 6 Progress Report | EE/CS 3-180 | |
9:50am-10:00am | Team 3 Progress Report | EE/CS 3-180 | |
10:10am-10:30am | Team 2 Progress Report | EE/CS 3-180 | |
10:30am-11:00am | Break | EE/CS 3-176 | |
11:00am-11:20am | Team 4 Progress Report | EE/CS 3-180 | |
11:20am-11:40am | Team 5 Progress Report | EE/CS 3-180 | |
11:40am-12:00pm | Team 1 Progress Report | EE/CS 3-180 | |
12:00pm-2:00pm | Picnic | UofM East River Flats Park | |
Tuesday August 15, 2006 | |||
Students and mentors work on the projects. | |||
Wednesday August 16, 2006 | |||
Students and mentors work on the projects. | |||
Thursday August 17, 2006 | |||
Students and mentors work on the projects. | |||
Friday August 18, 2006 | |||
9:00am-9:30am | Team 5 Final Report | EE/CS 3-180 | |
9:30am-10:00am | Team 1 Final Report | EE/CS 3-180 | |
10:00am-10:30am | Team 4 Final Report | EE/CS 3-180 | |
10:30am-11:00am | Break | EE/CS 3-176 | |
11:00am-11:30am | Team 2 Final Report | EE/CS 3-180 | |
11:30am-12:00pm | Team 6 Final Report | EE/CS 3-180 | |
12:00pm-12:30pm | Team 3 Final Report | EE/CS 3-180 | |
12:30pm-2:00pm | Pizza party | Lind Hall 400 |
NAME | DEPARTMENT | AFFILIATION |
---|---|---|
Douglas Allan | Glass Research | Corning Incorporated |
Sasanka Are | University of Massachusetts | |
Douglas Arnold | Institute for Mathematics and its Applications | University of Minnesota, Twin Cities |
Donald Aronson | Institute for Mathematics and its Applications | University of Minnesota, Twin Cities |
Christopher Bailey | Kent State University | |
Joao Pedro Boavida | University of Minnesota, Twin Cities | |
Richard Braun | Department of Mathematical Sciences | University of Delaware |
Yanping Cao | bad address | University of California, Irvine |
Ginmo (Jason) Chung | University of California, Los Angeles | |
Benjamin Cook | University of California, Los Angeles | |
Paul Dostert | Texas A & M University | |
Bree Ettinger | University of Georgia | |
Thomas Grandine | Department of Applied Mathematics | The Boeing Company |
Alvaro Guevara | Louisiana State University | |
Sean Hardesty | Rice University | |
Vikram Kamat | Arizona State University | |
Tanya Kazakova | University of Notre Dame | |
Joseph Kenney | School of Mathematics | University of Minnesota, Twin Cities |
Felix Krahmer | New York University | |
Youzuo Lin | Arizona State University | |
Juan Liu | University of Florida | |
Suping Lyu | Materials and Biosciences Center | Medtronic |
Pedro Madrid | University of Puerto Rico | |
Bonnie McAdoo | Clemson University | |
Darshana Nakum | University of Nevada | |
Jeremy Neal | Liquid Crystal Institute | Kent State University |
Hung (Ryan) Nong | Rice University | |
Katharine Ott | University of Virginia | |
Miguel Pauletti | University of Maryland | |
Fernando Reitich | School of Mathematics | University of Minnesota, Twin Cities |
Fadil Santosa | School of Mathematics | University of Minnesota, Twin Cities |
Arnd Scheel | Institute for Mathematics and its Applications | University of Minnesota, Twin Cities |
Sarthok Sircar | Florida State University | |
Vadim Sokolov | Northern Illinois University | |
Olga Terlyga | Department of Mathematics | Northern Illinois University |
Jon Van Laarhoven | The University of Iowa | |
Jiakou Wang | Department of Mathematics | The Pennsylvania State University |
Ang Wei | University of Delaware | |
David Widemann | University of Maryland | |
Klaus Wiegand | Technical Software Division - Reservoir Simulation Development Section | ExxonMobil |
Brendt Wohlberg | Los Alamos National Laboratory | |
Chai Wah Wu | Thomas J. Watson Research Center | IBM |
Jianbao Wu | University of Georgia | |
Guangri Xue | The Pennsylvania State University | |
Ping Zhang | University of Kentucky | |
Xinyi Zhang | University of Delaware | |
Ruijun Zhao | Purdue University |
Connect With Us: |
© 2014 Regents of the University of Minnesota. All rights reserved.
The University of Minnesota is an equal opportunity educator and employer Last modified on December 18, 2014 |