Tuesday, April 26, 2011
Wednesday, April 20, 2011
Postdoctoral Position at Arizona State University
- Job Description: Open postdoctoral associate position on a project supported by INTEL with a grant to Dieter Armbruster.
- Starting date: Anytime after May 15, 2011, at the latest on August 15, 2011.
- Length: 10 months, extension possible, depending on results and funds.
- Benefits: The position is considered full time employment at ASU and hence includes certain benefits like health insurance etc.
- Teaching required: One course of calculus per semester.
- Requirement: Ph.D. in Mathematics, Computer Science, Industrial Engineering or related fields
Project: A group of researchers from ASU led by D. Armbruster (Mathematics) and Hongmin Li (Business School) and a group from INTEL led by Karl Kempf are modeling the sale of INTEL chips. We have developed a semi-automatic way to extract the rules by which the OEMs decide to pick up a product that INTEL introduces into the market as well as the rules by which the OEMs drop an INTEL product out of their product palette. The project so far has included data mining and agent based simulations. We expect these activities to continue and expand to include stochastic optimization and game-theoretic aspects. The project features a unique and close interplay between industrial problems and applied mathematics and business considerations. The goal is to generate insight and concepts for INTEL that can at the same time be published in regular academic journals and be presented at regular INFORMS conferences.
Contact: Please send an application and CV to Dieter Armbruster <armbruster@asu.edu>.
Applications received before May 15, 2011 will receive full consideration.
Thursday, April 14, 2011
Lehigh University Sixth Annual High Performance Computing Symposium
I am thrilled by the opportunities Lehigh University provides us. I just finished the first day symposium. My understanding of MPI is strengthened and really appreciate experts from Pittsburgh Supercomputing Center. Actually there are quite useful resources as listed below
http://www.psc.edu/training/
The whole program can be reached at
http://hpcsymposium.lehigh.edu/2011/program.html
http://hpcsymposium.lehigh.edu/2011/program.html
Day 1 - Thursday, April 14, 2011
Lehigh University in conjunction with the Pittsburgh Supercomputing Center are pleased to offer a full day of High Performance Computing instruction. Participants will receive a comprehensive introduction to current scientific computing techniques, including a hands-on introduction to distributed computing with MPI. Pittsburgh Supercomputing Center instructors will cover all of the significant computing paradigms such as GPGPU computing and new parallel languages. Students will learn the most popular and effective technique, MPI programming, in detail, followed by hands-on exercises and real problems. Participants are encouraged to bring their own code(s) and seek advice from the instructors. Walk away with the tools necessary to take advantage of the parallel computing facilities available to you at Lehigh. Practical knowledge of C or Fortran is required.
NSF AWARD : Distribution and Moment-Robust Optimization Models and Algorithms
Recently, one NSF funding is awarded to Sanjay Mehrotra.
Abstract:
Optimization models and methods are widely used in decision problems. Incorporating parameter uncertainty is important in constructing representative optimization models. This parameter uncertainty may be described by a probability distribution, the moments of a probability distribution, or using bounds and confidence intervals on moments. When estimating uncertain parameters, information is also available on the error distribution of the estimated parameter. The research objective of this award is to study properties and develop algorithmic methods for solving multivariate optimization models that incorporate parameter uncertainty using limited knowledge on their distribution, and the parameter estimation errors. The optimization models will be based on using parameter distribution moment estimates. The models will incorporate moment estimation errors using a suitable penalty approach.
If successful, the results of this research will lead to the development of a new class of decision optimization modeling tools with associated algorithmic techniques for solving these models. This award will contribute to better handling of parameter uncertainty in single and two-stage inventory planning models, the classical least squares model, and the models involving objectives described by quadratic functions. A better understanding of algorithmic implications of parameter uncertainty in these problems will provide foundation for handling parameter uncertainty in other application models that use the planning, the least squares and quadratic objectives as basic building blocks. The award will also contribute to the development of computational tools implementing the algorithms solution techniques. Experiments will be performed to validate the algorithms, and to compare the properties of the solutions generated from the models incorporating distributional knowledge with those that ignore this information.
Abstract:
Optimization models and methods are widely used in decision problems. Incorporating parameter uncertainty is important in constructing representative optimization models. This parameter uncertainty may be described by a probability distribution, the moments of a probability distribution, or using bounds and confidence intervals on moments. When estimating uncertain parameters, information is also available on the error distribution of the estimated parameter. The research objective of this award is to study properties and develop algorithmic methods for solving multivariate optimization models that incorporate parameter uncertainty using limited knowledge on their distribution, and the parameter estimation errors. The optimization models will be based on using parameter distribution moment estimates. The models will incorporate moment estimation errors using a suitable penalty approach.
If successful, the results of this research will lead to the development of a new class of decision optimization modeling tools with associated algorithmic techniques for solving these models. This award will contribute to better handling of parameter uncertainty in single and two-stage inventory planning models, the classical least squares model, and the models involving objectives described by quadratic functions. A better understanding of algorithmic implications of parameter uncertainty in these problems will provide foundation for handling parameter uncertainty in other application models that use the planning, the least squares and quadratic objectives as basic building blocks. The award will also contribute to the development of computational tools implementing the algorithms solution techniques. Experiments will be performed to validate the algorithms, and to compare the properties of the solutions generated from the models incorporating distributional knowledge with those that ignore this information.
Seminar : PageRank- some methods, models and regularizations
* Time: 11am- 12noon, Thursday, April 14, 2011
* Location: Instructional Center, IC 211
* Speaker: Prof. Boris Polyak
* Title: PageRank: some methods, models and regularizations
* Abstract:
PageRank problem is one of challenging problems in information
technologies and numerical analysis due to its huge dimension and wide
range of applications. It also attracts great attention of experts in
control theory; it is closely related to consensus in multiagent
systems. The traditional approach to PR goes back to the pioneering
paper by Brin and Page. The original problem is replaced with finding
the eigenvector of the modified matrix which can be effectively solved
by the power method. In this paper we demonstrate that the solution of
the modified problem can be far enough from the original one and propose
an iterative regularization method which allows to find the desired
solution. We also propose an l1-regularization; its solution of the PR
problem ignores low-ranking pages. All methods are illustrated on two
examples of PR problems which have many attractive features as
simulation tests.
* Bio:
Boris Polyak currently serves as the head of Adaptive and Robust Control
Systems Laboratory at the Institute for Control Sciences, Russian
Academy of Sciences and as a professor at the Department of Engineering
and Cybernetics of Moscow Institute of Physics and Technology. He earned
his PhD in Mathematics (1963) from Moscow State University and Doctor of
Science degree in Engineering (1978) from the Institute of Control
Sciences. After working as a researcher at the Moscow State University
for several years, Boris joined the Institute of Control Sciences at
1971. He is an author of 4 monographs and more than 180 journal papers
in different fields including mathematical programming, control,
numerical analysis, stochastic optimization, and statistics. Boris is an
IFAC fellow. His numerous awards include Meyerhoff Fellowship in 1991
and Andronov's Award of Russian Academy of Science in 1994. Last but not
the least, he is a nice and cheerful fellow.
* Location: Instructional Center, IC 211
* Speaker: Prof. Boris Polyak
* Title: PageRank: some methods, models and regularizations
* Abstract:
PageRank problem is one of challenging problems in information
technologies and numerical analysis due to its huge dimension and wide
range of applications. It also attracts great attention of experts in
control theory; it is closely related to consensus in multiagent
systems. The traditional approach to PR goes back to the pioneering
paper by Brin and Page. The original problem is replaced with finding
the eigenvector of the modified matrix which can be effectively solved
by the power method. In this paper we demonstrate that the solution of
the modified problem can be far enough from the original one and propose
an iterative regularization method which allows to find the desired
solution. We also propose an l1-regularization; its solution of the PR
problem ignores low-ranking pages. All methods are illustrated on two
examples of PR problems which have many attractive features as
simulation tests.
* Bio:
Boris Polyak currently serves as the head of Adaptive and Robust Control
Systems Laboratory at the Institute for Control Sciences, Russian
Academy of Sciences and as a professor at the Department of Engineering
and Cybernetics of Moscow Institute of Physics and Technology. He earned
his PhD in Mathematics (1963) from Moscow State University and Doctor of
Science degree in Engineering (1978) from the Institute of Control
Sciences. After working as a researcher at the Moscow State University
for several years, Boris joined the Institute of Control Sciences at
1971. He is an author of 4 monographs and more than 180 journal papers
in different fields including mathematical programming, control,
numerical analysis, stochastic optimization, and statistics. Boris is an
IFAC fellow. His numerous awards include Meyerhoff Fellowship in 1991
and Andronov's Award of Russian Academy of Science in 1994. Last but not
the least, he is a nice and cheerful fellow.
Wednesday, April 13, 2011
Post Doctoral Research Opportunity at Purdue University
Transportation Network Mobility Lab at Purdue University is currently
looking for postdoctorate or experienced researchers to work in our
Research group. We have a number of projects on disaster management,
dynamic equilibrium, network science, mobile sensor networks, freight
logistics and we would expect that the successful applicant(s) would
also be collaborating with interdisciplinary scholars on campus.
The ideal applicant would have:
* A PhD or industry experience in an area related to Transportation
Modeling, Operations Research or Computer Science.
* Good knowledge of Mathematical Programming optimization techniques.
* Familiarity with emerging techniques in network science,
algorithmic game theory, simulation and resilience.
* Experience, aptitude or interest in solving transportation
modeling related problems with interfaces with wireless networking,
other infrastructure systems and policy.
* Excellent computer programming skills in any of the languages such
as C++, Java and Perl.
* Excellent written and oral English communication skills.
The position can start immediately or in the next few months.
The successful candidate will have the opportunity to work in an
exciting and dynamic research environment. The candidate will have the
opportunity to work on both fundamental research and applied research,
shape their research projects, attend conferences and lead research
meetings with collaborators. The researcher is expected to work in a
interdisciplinary setting and hence good interpersonal skills are
required.
Interested candidates should send an email to Professor Satish Ukkusuri
(sukkusur@purdue.edu) along with a CV including the names of at least
three references and two sample publications.
looking for postdoctorate or experienced researchers to work in our
Research group. We have a number of projects on disaster management,
dynamic equilibrium, network science, mobile sensor networks, freight
logistics and we would expect that the successful applicant(s) would
also be collaborating with interdisciplinary scholars on campus.
The ideal applicant would have:
* A PhD or industry experience in an area related to Transportation
Modeling, Operations Research or Computer Science.
* Good knowledge of Mathematical Programming optimization techniques.
* Familiarity with emerging techniques in network science,
algorithmic game theory, simulation and resilience.
* Experience, aptitude or interest in solving transportation
modeling related problems with interfaces with wireless networking,
other infrastructure systems and policy.
* Excellent computer programming skills in any of the languages such
as C++, Java and Perl.
* Excellent written and oral English communication skills.
The position can start immediately or in the next few months.
The successful candidate will have the opportunity to work in an
exciting and dynamic research environment. The candidate will have the
opportunity to work on both fundamental research and applied research,
shape their research projects, attend conferences and lead research
meetings with collaborators. The researcher is expected to work in a
interdisciplinary setting and hence good interpersonal skills are
required.
Interested candidates should send an email to Professor Satish Ukkusuri
(sukkusur@purdue.edu) along with a CV including the names of at least
three references and two sample publications.
Tuesday, April 12, 2011
Post-Doctoral Position Center for eHealth Innovation and Process Transformation (CeHIPT)
The Center for eHealth Innovation and Process Transformation (CeHIPT, http://cehipt.wpi.edu) at Worcester Polytechnic Institute (WPI) is seeking an outstanding researcher for a post-doctoral position, to begin June 1, 2011. The initial length of appointment is 6 months, which may be extended upon successful performance and availability of funding for an additional 6 months. Candidates should have expertise and interest in survey design and analysis, simulation and/or optimization modeling, and health care system redesign enabled by information technology. The ideal candidate will have a Ph.D. in Information Systems with an MS in Industrial Engineering (IE) or Operations Research (OR), or a Ph.D. in IE/OR or Operations Management with an MS in Information Systems.
The successful candidate will be part of CeHIPT’s interdisciplinary research team, which develops recommendations and tools that health care organizations can use to successfully transform their care delivery processes. To achieve this goal, CeHIPT takes a systems approach to research, drawing on and integrating core concepts from industrial and systems engineering, biomedical and health informatics, and information systems research. CeHIPT ensures that the problems being investigated and the solutions being proposed are relevant to the health care community through partnerships with health care organizations.
As part of the New England Veterans Engineering Resource Center (VERC), CeHIPT is working with the VA New England Health Care System to improve the delivery of healthcare to veterans. The New England VERC, a partnership between the VA New England and three academic institutions, was established to integrate systems engineering principles and methods into the fabric of VA healthcare operations. The successful candidate will contribute to ongoing work focused on streamlining administrative processes, as well as contribute to new projects related to patient portals, personal health records, and coordinating care.
WPI is a selective private university located in Worcester, Massachusetts, with an innovative curriculum centered on engineering, science, technology, and business. Ranked highly by US News & World Report among national comprehensive universities, WPI enjoys close working relationships with many organizations, due in part to its project-enriched curriculum that engages students and faculty in real-world problem solving.
Applications should be sent to postdoc@wpi.edu. Applications should include a curriculum vitae and a list of three professional references (with contact information). Applications will be considered on a continuing basis beginning April 25, 2011 until the position is filled. Questions can be addressed to Sharon Johnson, postdoc@wpi.edu.
WPI is an affirmative action, equal opportunity
The successful candidate will be part of CeHIPT’s interdisciplinary research team, which develops recommendations and tools that health care organizations can use to successfully transform their care delivery processes. To achieve this goal, CeHIPT takes a systems approach to research, drawing on and integrating core concepts from industrial and systems engineering, biomedical and health informatics, and information systems research. CeHIPT ensures that the problems being investigated and the solutions being proposed are relevant to the health care community through partnerships with health care organizations.
As part of the New England Veterans Engineering Resource Center (VERC), CeHIPT is working with the VA New England Health Care System to improve the delivery of healthcare to veterans. The New England VERC, a partnership between the VA New England and three academic institutions, was established to integrate systems engineering principles and methods into the fabric of VA healthcare operations. The successful candidate will contribute to ongoing work focused on streamlining administrative processes, as well as contribute to new projects related to patient portals, personal health records, and coordinating care.
WPI is a selective private university located in Worcester, Massachusetts, with an innovative curriculum centered on engineering, science, technology, and business. Ranked highly by US News & World Report among national comprehensive universities, WPI enjoys close working relationships with many organizations, due in part to its project-enriched curriculum that engages students and faculty in real-world problem solving.
Applications should be sent to postdoc@wpi.edu. Applications should include a curriculum vitae and a list of three professional references (with contact information). Applications will be considered on a continuing basis beginning April 25, 2011 until the position is filled. Questions can be addressed to Sharon Johnson, postdoc@wpi.edu.
WPI is an affirmative action, equal opportunity
Subscribe to:
Posts (Atom)