国产乱妇一级a视频,欧美亚洲国产激情一区二区,国产精品片免费看,国产精品xxxx国产喷水

<ol id="yumkc"><nobr id="yumkc"><kbd id="yumkc"></kbd></nobr></ol>

<output id="yumkc"><center id="yumkc"><ol id="yumkc"></ol></center></output>

        1. ENGLISH
          您所在的位置: 首頁» 新聞中心» 講座預告

          7-28 美國喬治梅森大學徐捷教授學術(shù)講座:Concurrent Engineering: An Optimization Approach for Team Coordination and Information Sharing

          題目:Concurrent Engineering: An Optimization Approach for Team Coordination and Information Sharing
          主講人:徐捷 教授(美國喬治梅森大學)
          時間:2017年7月28日下午17點
          地點:主樓418
          主講人介紹:
              Dr. Jie Xu is an Associate Professor of Systems Engineering & Operations Research at George Mason University, Fairfax, VA, USA. He received his Ph.D. in Industrial Engineering & Management Sciences at Northwestern University in 2009. Dr. Xu’s primary research interest is simulation optimization and its applications in aviation, health care, energy systems, etc. His research has been sponsored by NSF, AFOSR, Oak Ridge Associated Universities, ONR, and Jeffress Trust Awards Program in Interdisciplinary Research. He is an Associate Editor for the Journal of Simulation and the Asia-Pacific Journal of Operational Research.
          內(nèi)容介紹:
              Team coordination and information sharing are important in concurrent engineering (CE), where multiple design teams execute their tasks simultaneously and then share information to update their designs, e.g., through integrated tests. The process then iterates until the global design objective is optimized. When properly controlled and executed, CE can be an effective method to speed up the design process for complex and large-scale projects thanks to its parallel nature. In this talk, we propose a coordinate optimization framework to model and control the information sharing in CE. It can be shown that under a convexity assumption, CE converges to a globally optimal design. We further study how the coordinate optimization framework can be applied to CE in a general environment where the objective function is nonconvex. We propose a simulation optimization method using a domain space cutting and optimal computing budget allocation to efficiently select the initial points from which the coordinate optimization can be applied under a mild local convexity condition.

           

          (承辦:管理科學與物流系 ,科研與學術(shù)交流中心)

          TOP