You searched for subject:(Domain Optimization)
.
Showing records 1 – 30 of
68 total matches.
◁ [1] [2] [3] ▶

University of New Mexico
1.
Kaile, Liang.
Optimization Design for Multi-Domain Optical Network Provisioning and Survivability.
Degree: Electrical and Computer Engineering, 2014, University of New Mexico
URL: http://hdl.handle.net/1928/24625
► User bandwidth demands have continued to expand at an unprecedented rate over the past two decades. This growth has been driven by the emergence of…
(more)
▼ User bandwidth demands have continued to expand at an unprecedented rate over the past two decades. This growth has been driven by the emergence of many new applications across a wide range of sectors, including commercial, private, and scientific computing. As a result, network carriers and operators have deployed a wide range of high-speed technologies to meet their growing needs. In particular, these solutions include state-of-the-art Internet Protocol (IP) and Ethernet systems as well as optical wavelength division multiplexing (WDM) networking platforms. In particular, the latter solutions provide unmatched terabit-per-second speeds and are commonly used to provide underlying lightpath' connectivity between IP and Ethernet devices. Now researchers have developed a range of schemes for lightpath provisioning and survivability in WDM networks. Most notably these solutions include
optimization and heuristic-based strategies to solve the routing and wavelength assignment (RWA) problem. However, as WDM deployments have expanded, there is a further need to provision lightpath connections across multiple network domains. For example, these domains can be delineated in a variety of manners, including administrative ownership (intra- and inter-carrier), vendor or technology type, geographic, etc. Given the above, multi-
domain (optical) network provisioning and survivability has become a key focus area. Indeed, this is a rather challenging problem as scalability and privacy concerns limit the amount and type of information that can be shared across
domain boundaries, i.e., particularly in inter-carrier settings. Hence researchers have developed various solutions, with most using distributed graph-based heuristics to resolve connection routes with partial (dated, inaccurate) network state. Nevertheless, it is well-understood that heuristic schemes are sub-optimal in nature and cannot provide any bounds on network performance. As a result, most multi-
domain studies have used other heuristics for comparison purposes. In light of this, it is very difficult for network carriers to gauge the true achievable performance of their multi-
domain networking setups. However,
optimization-based methods offer a very effective means of formally analyzing network performance under idealized conditions with full a-priori knowledge of user demands. Moreover, these schemes have been widely-used to bound lightpath RWA performance in single-
domain settings. Nevertheless, the further application of such methods in multi-
domain network settings has not yet been considered. To address these concerns, this dissertation presents a comprehensive
optimization-based study of lightpath routing and survivability in multi-
domain optical networks. First, a novel (two-stage) hierarchical model is introduced to optimize lightpath routes over inter-/intra-
domain topologies pursuant to several traffic engineering (TE) objectives, i.e., including throughput maximization, resource minimization, and load balancing. Next, this model is extended to…
Advisors/Committee Members: Nasir, Ghani, Nasir, Ghani, Wei, Sh, Marios, Pattichis, Patrick, Bridges.
Subjects/Keywords: Multi-Domain; Optical Network; Optimization; Provisioning; Survivability
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Kaile, L. (2014). Optimization Design for Multi-Domain Optical Network Provisioning and Survivability. (Doctoral Dissertation). University of New Mexico. Retrieved from http://hdl.handle.net/1928/24625
Chicago Manual of Style (16th Edition):
Kaile, Liang. “Optimization Design for Multi-Domain Optical Network Provisioning and Survivability.” 2014. Doctoral Dissertation, University of New Mexico. Accessed April 10, 2021.
http://hdl.handle.net/1928/24625.
MLA Handbook (7th Edition):
Kaile, Liang. “Optimization Design for Multi-Domain Optical Network Provisioning and Survivability.” 2014. Web. 10 Apr 2021.
Vancouver:
Kaile L. Optimization Design for Multi-Domain Optical Network Provisioning and Survivability. [Internet] [Doctoral dissertation]. University of New Mexico; 2014. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/1928/24625.
Council of Science Editors:
Kaile L. Optimization Design for Multi-Domain Optical Network Provisioning and Survivability. [Doctoral Dissertation]. University of New Mexico; 2014. Available from: http://hdl.handle.net/1928/24625

Louisiana State University
2.
Wan, Shenghua.
Surface parameterization over regular domains.
Degree: MSEE, Electrical and Computer Engineering, 2011, Louisiana State University
URL: etd-10242011-153604
;
https://digitalcommons.lsu.edu/gradschool_theses/2736
► Surface parameterization has been widely studied and it has been playing a critical role in many geometric processing tasks in graphics, computer-aided design, visualization, vision,…
(more)
▼ Surface parameterization has been widely studied and it has been playing a critical role in many geometric processing tasks in graphics, computer-aided design, visualization, vision, physical simulation and etc. Regular domains, such as polycubes, are favored due to their structural regularity and geometric simplicity. This thesis focuses on studying the surface parameterization over regular domains, i.e. polycubes, and develops effective computation algorithms. Firstly, the motivation for surface parameterization and polycube mapping is introduced. Secondly, we briefly review existing surface parameterization techniques, especially for extensively studied parameterization algorithms for topological disk surfaces and parameterizations over regular domains for closed surfaces. Then we propose a polycube parameterization algorithm for closed surfaces with general topology. We develop an efficient optimization framework to minimize the angle and area distortion of the mapping. Its applications on surface meshing, inter-shape morphing and volumetric polycube mapping are also discussed.
Subjects/Keywords: Domain Optimization; Polycube Mapping; Surface Parameterization
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Wan, S. (2011). Surface parameterization over regular domains. (Masters Thesis). Louisiana State University. Retrieved from etd-10242011-153604 ; https://digitalcommons.lsu.edu/gradschool_theses/2736
Chicago Manual of Style (16th Edition):
Wan, Shenghua. “Surface parameterization over regular domains.” 2011. Masters Thesis, Louisiana State University. Accessed April 10, 2021.
etd-10242011-153604 ; https://digitalcommons.lsu.edu/gradschool_theses/2736.
MLA Handbook (7th Edition):
Wan, Shenghua. “Surface parameterization over regular domains.” 2011. Web. 10 Apr 2021.
Vancouver:
Wan S. Surface parameterization over regular domains. [Internet] [Masters thesis]. Louisiana State University; 2011. [cited 2021 Apr 10].
Available from: etd-10242011-153604 ; https://digitalcommons.lsu.edu/gradschool_theses/2736.
Council of Science Editors:
Wan S. Surface parameterization over regular domains. [Masters Thesis]. Louisiana State University; 2011. Available from: etd-10242011-153604 ; https://digitalcommons.lsu.edu/gradschool_theses/2736

Georgia Tech
3.
Dong, Xinjun.
Finite element model updating through smooth nonconvex optimization.
Degree: PhD, Civil and Environmental Engineering, 2019, Georgia Tech
URL: http://hdl.handle.net/1853/62625
► During the past few decades, great efforts have been devoted towards finite element (FE) modeling of structures, in order to simulate the structural behavior under…
(more)
▼ During the past few decades, great efforts have been devoted towards finite element (FE) modeling of structures, in order to simulate the structural behavior under various loading conditions. Due to the complexity of large-scale civil structures, the simulation results generated by an FE model are usually different from these of the as-built structure. To reduce the difference, selected structural parameters can be updated by utilizing the data collected from the actual structure. This process is known as FE model updating. This research explores FE model updating utilizing the measured frequency-
domain modal properties, i.e. resonance frequencies and mode shapes. Naturally, frequency-
domain FE model updating is formulated as
optimization problem aiming to minimize the difference between simulated and experimentally-measured modal properties. This research focuses on three frequency-
domain model updating formulations, i.e. MAC value, eigenvector difference and modal dynamic residual formulations. Local search
optimization algorithms are first studied for comparison. The performance of model updating formulations and local search
optimization algorithms are validated through numerical simulations, laboratory and field experiments. To collect structural vibration data from the actual structure, a new wireless sensing node, named Martlet, is developed. To overcome the limitation of local search
optimization algorithms, this research also investigates two global
optimization algorithms, i.e. branch-and-bound and primal-relaxed dual algorithms to solve the
optimization problems in FE model updating. Again, the performance of the two global
optimization algorithms are validated through both numerical simulation and laboratory experiment.
Advisors/Committee Members: Wang, Yang (advisor), Fedele, Francesco (advisor), Muhanna, Rafi L. (advisor), Dey, Santanu S. (committee member), Paulino, Glaucio (committee member), Suryanarayana, Phanish (committee member).
Subjects/Keywords: Finite element model updating; Frequency-domain formulations; Local search optimization algorithm; Global search optimization algorithm
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Dong, X. (2019). Finite element model updating through smooth nonconvex optimization. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/62625
Chicago Manual of Style (16th Edition):
Dong, Xinjun. “Finite element model updating through smooth nonconvex optimization.” 2019. Doctoral Dissertation, Georgia Tech. Accessed April 10, 2021.
http://hdl.handle.net/1853/62625.
MLA Handbook (7th Edition):
Dong, Xinjun. “Finite element model updating through smooth nonconvex optimization.” 2019. Web. 10 Apr 2021.
Vancouver:
Dong X. Finite element model updating through smooth nonconvex optimization. [Internet] [Doctoral dissertation]. Georgia Tech; 2019. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/1853/62625.
Council of Science Editors:
Dong X. Finite element model updating through smooth nonconvex optimization. [Doctoral Dissertation]. Georgia Tech; 2019. Available from: http://hdl.handle.net/1853/62625

University of Ottawa
4.
Vandervoort, Allan.
New Multi-Objective Optimization Techniques and Their Application to Complex Chemical Engineering Problems
.
Degree: 2011, University of Ottawa
URL: http://hdl.handle.net/10393/19785
► In this study, two new Multi-Objective Optimization (MOO) techniques are developed. The two new techniques, the Objective-Based Gradient Algorithm (OBGA) and the Principal Component Grid…
(more)
▼ In this study, two new Multi-Objective Optimization (MOO) techniques are developed. The two new techniques, the Objective-Based Gradient Algorithm (OBGA) and the Principal Component Grid Algorithm (PCGA), were developed with the goals of improving the accuracy and efficiency of the Pareto domain approximation relative to current MOO techniques. Both methods were compared to current MOO techniques using several test problems. It was found that both the OBGA and PCGA systematically produced a more accurate Pareto domain than current MOO techniques used for comparison, for all problems studied. The OBGA requires less computation time than the current MOO methods for relatively simple problems whereas for more complex objective functions, the computation time was larger. On the other hand, the efficiency of the PCGA was higher than the current MOO techniques for all problems tested.
The new techniques were also applied to complex chemical engineering problems. The OBGA was applied to an industrial reactor producing ethylene oxide from ethylene. The optimization varied four of the reactor input parameters, and the selectivity, productivity and a safety factor related to the presence of oxygen in the reactor were maximized. From the optimization results, recommendations were made based on the ideal reactor operating conditions, and the control of key reactor parameters. The PCGA was applied to a PI controller model to develop new tuning methods based on the Pareto domain. The developed controller tuning methods were compared to several previously developed controller correlations. It was found that all previously developed controller correlations showed equal or worse performance than that based on the Pareto domain. The tuning methods were applied to a fourth order process and a process with a disturbance, and demonstrated excellent performance.
Subjects/Keywords: Multi-Objective Optimization;
Pareto Domain;
PI Controller;
Ethylene Oxide Reactor
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Vandervoort, A. (2011). New Multi-Objective Optimization Techniques and Their Application to Complex Chemical Engineering Problems
. (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/19785
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Vandervoort, Allan. “New Multi-Objective Optimization Techniques and Their Application to Complex Chemical Engineering Problems
.” 2011. Thesis, University of Ottawa. Accessed April 10, 2021.
http://hdl.handle.net/10393/19785.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Vandervoort, Allan. “New Multi-Objective Optimization Techniques and Their Application to Complex Chemical Engineering Problems
.” 2011. Web. 10 Apr 2021.
Vancouver:
Vandervoort A. New Multi-Objective Optimization Techniques and Their Application to Complex Chemical Engineering Problems
. [Internet] [Thesis]. University of Ottawa; 2011. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/10393/19785.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Vandervoort A. New Multi-Objective Optimization Techniques and Their Application to Complex Chemical Engineering Problems
. [Thesis]. University of Ottawa; 2011. Available from: http://hdl.handle.net/10393/19785
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Delft University of Technology
5.
de Zeeuw, Alwin (author).
Topology Optimization of Wave Barriers: Development of a tool for use in engineering practice.
Degree: 2018, Delft University of Technology
URL: http://resolver.tudelft.nl/uuid:83784e45-abe6-4800-b862-42d7dba09c75
► Wave barriers are a common mitigation measure when dealing with environmentally induced vibrations. These wave barriers generally consist of stiff vertical walls buried in the…
(more)
▼ Wave barriers are a common mitigation measure when dealing with environmentally induced vibrations. These wave barriers generally consist of stiff vertical walls buried in the soil to impede waves on their path from the source to the receiver. The geometries of the wave barriers that are used in practice are very simple. More complex geometries have not often been considered as it is difficult to estimate which changes would increase the effectiveness. In literature, topology
optimization was explored as a method to design wave barriers. This method was applied while modelling the soil as a homogeneous elastic half-space. The resulting wave barriers showed a significant increase in the achieved vibration reduction. However, the designs were often very complex and hard to manufacture. In this thesis the method was improved by introducing a layered soil and by ensuring the manufacturability of the designed wave barriers. The improved method was then applied to multiple situations in order to investigate aspects of wave barrier design and effectiveness.
Optimization of a wave barrier for a two-layered soil model showed the significance of implementing a layered soil model. The interface between two layers resulted in reflections that could diminish the effectiveness of a wave barrier if not accounted for. The
optimization algorithm responded to these reflections by placing material in the path of waves that would otherwise reflect back to the surface. A wave barrier optimized for a three-layered soil model that consisted of a softer layer embedded in a stiff layer and a stiff half-space showed a different approach to reflections. The wave barrier appeared to use the softer layer as a waveguide in order to reduce the energy at the surface. The manufacturability was increased by adding constraints. This resulted in wave barriers with a more manufacturable design at the cost of a decrease in vibration reduction. In three of the four cases, the optimized wave barrier still performed significantly better than the reference wave barrier. In one case, the final design reverted back to the reference wave barrier when the manufacturability conditions were applied. The goals set at the start of the thesis were largely accomplished. The model was able to more accurately reflect soil profiles found in practice by using a layered soil model and the topology
optimization algorithm resulted in wave barriers that are relatively easy to manufacture while still showing a significant improvement over the standard reference wave barriers. The possible use of soft embedded layers as waveguides was discovered during the
optimization. Future research into this possibility could prove valuable. Some concerns are posited with regards to the reliability of the wave barriers. In some cases, the optimized wave barrier appeared to abuse the idealized representation of the interface between layers. An initial investigation showed that in those cases, the effectiveness of the wave barrier was…
Advisors/Committee Members: Metrikine, Andrei (mentor), van Dalen, Karel (mentor), Steenbergen, Michael (mentor), Stuit, Herke (mentor), Delft University of Technology (degree granting institution).
Subjects/Keywords: Topology Optimization; Wave Barriers; Railway-induced vibration; frequency domain; 2D
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
de Zeeuw, A. (. (2018). Topology Optimization of Wave Barriers: Development of a tool for use in engineering practice. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:83784e45-abe6-4800-b862-42d7dba09c75
Chicago Manual of Style (16th Edition):
de Zeeuw, Alwin (author). “Topology Optimization of Wave Barriers: Development of a tool for use in engineering practice.” 2018. Masters Thesis, Delft University of Technology. Accessed April 10, 2021.
http://resolver.tudelft.nl/uuid:83784e45-abe6-4800-b862-42d7dba09c75.
MLA Handbook (7th Edition):
de Zeeuw, Alwin (author). “Topology Optimization of Wave Barriers: Development of a tool for use in engineering practice.” 2018. Web. 10 Apr 2021.
Vancouver:
de Zeeuw A(. Topology Optimization of Wave Barriers: Development of a tool for use in engineering practice. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2021 Apr 10].
Available from: http://resolver.tudelft.nl/uuid:83784e45-abe6-4800-b862-42d7dba09c75.
Council of Science Editors:
de Zeeuw A(. Topology Optimization of Wave Barriers: Development of a tool for use in engineering practice. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:83784e45-abe6-4800-b862-42d7dba09c75

University of Victoria
6.
Karimi, Meysam.
Frequency domain modeling and multidisciplinary design optimization of floating offshore wind turbines.
Degree: Department of Mechanical Engineering, 2018, University of Victoria
URL: https://dspace.library.uvic.ca//handle/1828/10172
► Offshore floating wind turbine technology is growing rapidly and has the potential to become one of the main sources of affordable renewable energy. However, this…
(more)
▼ Offshore floating wind turbine technology is growing rapidly and has the potential to become one of the main sources of affordable renewable energy. However, this technology is still immature owing in part to complications from the integrated design of wind turbines and floating platforms, aero-hydro-servo-elastic responses, grid integrations, and offshore wind resource assessments. This research focuses on developing methodologies to investigate the technical and economic feasibility of a wide range of floating offshore wind turbine support structures. To achieve this goal, interdisciplinary interactions among hydrodynamics, aerodynamics, structure and control
subject to constraints on stresses/loads, displacements/rotations, and costs need to be considered. Therefore, a multidisciplinary design
optimization approach for minimum levelized cost of energy executed using parameterization schemes for floating support structures as well as a frequency
domain dynamic model for the entire coupled system. This approach was based on a tractable framework and models (i.e. not too computationally expensive) to explore the design space, but retaining required fidelity/accuracy.
In this dissertation, a new frequency
domain approach for a coupled wind turbine, floating platform, and mooring system was developed using a unique combination of the validated numerical tools FAST and WAMIT. Irregular wave and turbulent wind loads were incorporated using wave and wind power spectral densities, JONSWAP and Kaimal. The system submodels are coupled to yield a simple frequency
domain model of the system with a flexible moored support structure. Although the model framework has the capability of incorporating tower and blade structural DOF, these components were considered as rigid bodies for further simplicity here. A collective blade pitch controller was also defined for the frequency
domain dynamic model to increase the platform restoring moments. To validate the proposed framework, predicted wind turbine, floating platform and mooring system responses to the turbulent wind and irregular wave loads were compared with the FAST time
domain model.
By incorporating the design parameterization scheme and the frequency
domain modeling the overall system responses of tension leg platforms, spar buoy platforms, and semisubmersibles to combined turbulent wind and irregular wave loads were determined. To calculate the system costs, a set of cost scaling tools for an offshore wind turbine was used to estimate the levelized cost of energy. Evaluation and comparison of different classes of floating platforms was performed using a Kriging-Bat
optimization method to find the minimum levelized cost of energy of a 5 MW NREL offshore wind turbine across standard operational environmental conditions. To show the potential of the method, three baseline platforms including the OC3-Hywind spar buoy, the MIT/NREL TLP, and the OC4-DeepCwind semisubmersible were compared with the results of design
optimization. Results for the tension leg and spar buoy…
Advisors/Committee Members: Crawford, Curran (supervisor), Buckham, Bradley Jason (supervisor).
Subjects/Keywords: Wind turbine; Optimization; Floating platforms; Frequency domain model
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Karimi, M. (2018). Frequency domain modeling and multidisciplinary design optimization of floating offshore wind turbines. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/10172
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Karimi, Meysam. “Frequency domain modeling and multidisciplinary design optimization of floating offshore wind turbines.” 2018. Thesis, University of Victoria. Accessed April 10, 2021.
https://dspace.library.uvic.ca//handle/1828/10172.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Karimi, Meysam. “Frequency domain modeling and multidisciplinary design optimization of floating offshore wind turbines.” 2018. Web. 10 Apr 2021.
Vancouver:
Karimi M. Frequency domain modeling and multidisciplinary design optimization of floating offshore wind turbines. [Internet] [Thesis]. University of Victoria; 2018. [cited 2021 Apr 10].
Available from: https://dspace.library.uvic.ca//handle/1828/10172.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Karimi M. Frequency domain modeling and multidisciplinary design optimization of floating offshore wind turbines. [Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/10172
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Minnesota
7.
Sullivan, Thomas Adam.
Multi-domain multi-objective optimization of mechanisms: a general method with two case studies.
Degree: MS, 2013, University of Minnesota
URL: http://hdl.handle.net/11299/162401
► While the design of mechanisms is a well-studied field, current optimization techniques generally focus on the kinematics and dynamics and relegate other aspects of the…
(more)
▼ While the design of mechanisms is a well-studied field, current optimization techniques generally focus on the kinematics and dynamics and relegate other aspects of the analysis to separate stages of the overall design process, resulting in a loss of optimality when the entire multi-domain system is considered. This thesis presents a general method by which a mechanism optimization problem may be efficiently formulated and solved, considering multiple competing design objectives across multiple analysis domains. Two case studies illustrate the practical application of this general method. The first is the kinematic-structural optimization of a hydraulic rescue spreader ("jaws of life"). The second is the kinematic-dynamic-thermodynamic optimization of a novel six-bar linkage for an internal combustion engine. A variety of powerful general-purpose multi-objective algorithms are available from the literature. In particular, genetic algorithms are well-suited to multi-objective problems, and the NSGA-II algorithm from this category is employed here. Three strategies are presented to formulate multi-domain mechanism optimizations in a way that can be solved efficiently by a multi-objective genetic algorithm and is free of explicit constraint functions even for complex problems. First, it is shown that the use of non-traditional design variables, such as angles and adaptive interpolations, can result in smaller design spaces to be searched and can guarantee that all optima lie within the selected range of a given design variable. It is also shown that traditional precision-position synthesis techniques can in some cases be employed in a preliminary analysis to reduce the dimension of the design space. Finally, a nested optimization structure is proposed in which kinematic design variables and objectives are optimized in an outer loop, with the non-kinematic problem being optimized in an inner loop at every outer loop iteration, improving the efficiency and stability of the optimization process. These techniques were applied to the hydraulic rescue spreader problem in order to design a six-bar mechanism that could exert a 10,000 pound force through a pair of jaws over a 24 inch spreading distance while maintaining performance-critical kinematic behavior and remaining light and compact enough to be a handheld tool. The structural stresses in each part of the linkage were modeled, using a combination of analytical methods and finite element analysis. The final optimization result was superior to a similar commercially available model with respect to all four kinematic and structural objectives. Having successfully optimized a low-speed mechanism with a structural motivation, the method was also applied to a high-speed mechanism with a thermodynamic motivation. A Stephenson-III six-bar linkage was developed in order to optimize the motion of the piston in an internal combustion engine and achieve a cylinder volume as a function of time most conducive to efficient combustion. A number of mechanical objectives relating to…
Subjects/Keywords: Evolutionary Algorithm; Genetic Algorithm; Mechanisms; Multi-domain; Multi-objective; Optimization
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sullivan, T. A. (2013). Multi-domain multi-objective optimization of mechanisms: a general method with two case studies. (Masters Thesis). University of Minnesota. Retrieved from http://hdl.handle.net/11299/162401
Chicago Manual of Style (16th Edition):
Sullivan, Thomas Adam. “Multi-domain multi-objective optimization of mechanisms: a general method with two case studies.” 2013. Masters Thesis, University of Minnesota. Accessed April 10, 2021.
http://hdl.handle.net/11299/162401.
MLA Handbook (7th Edition):
Sullivan, Thomas Adam. “Multi-domain multi-objective optimization of mechanisms: a general method with two case studies.” 2013. Web. 10 Apr 2021.
Vancouver:
Sullivan TA. Multi-domain multi-objective optimization of mechanisms: a general method with two case studies. [Internet] [Masters thesis]. University of Minnesota; 2013. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/11299/162401.
Council of Science Editors:
Sullivan TA. Multi-domain multi-objective optimization of mechanisms: a general method with two case studies. [Masters Thesis]. University of Minnesota; 2013. Available from: http://hdl.handle.net/11299/162401

Virginia Tech
8.
Young, Alexander Rian.
Unified Multi-domain Decision Making: Cognitive Radio and Autonomous Vehicle Convergence.
Degree: PhD, Electrical Engineering, 2013, Virginia Tech
URL: http://hdl.handle.net/10919/19295
► This dissertation presents the theory, design, implementation and successful deployment of a cognitive engine decision algorithm by which a cognitive radio-equipped mobile robot may adapt…
(more)
▼ This dissertation presents the theory, design, implementation and successful deployment of a cognitive engine decision algorithm by which a cognitive radio-equipped mobile robot may adapt its motion and radio parameters through multi-objective
optimization. This provides a proof-of-concept prototype cognitive system that is aware of its envirionment, its userâ •s needs, and the rules governing its operation. It is to take intelligent action based on this awareness to optimize its performance across both the mobility and radio domains while learning from experience and responding intelligently to ongoing environmental mission changes. The prototype combines the key features of cognitive radios and autonomous vehicles into a single package whose behavior integrates the essential features of both. The use case for this research is a scenario where a small unmanned aerial vehicle (UAV) is traversing a nominally cyclic or repeating flight path (an â •orbitâ •) seeking to observe targets and where possible avoid hostile agents. As the UAV traverses the path, it experiences varying RF effects, including multipath propagation and terrain shadowing. The goal is to provide the capability for the UAV to learn the flight path with respect both to motion and RF characteristics and modify radio parameters and flight characteristics proactively to optimize performance. Using sensor fusion techniques to develop situaitonal awareness, the UAV should be able to adapt its motion or communication based on knolwedge of (but not limited to) physical location, radio performance, and channel conditions. Using sensor information from RF and mobility domains, the UAV uses the mission objectives and its knowledge of the world to decide on a course of action. The UAV develops and executes a multi-
domain action; action that crosses domains, such as changing RF power and increasing its speed. This research is based on a simple observation, namely that cognitive radios and autonomous vehicles perform similar tasks, albeit in different domains. Both analyze their environment, make and execute a decision, evaluate the result (learn from experience), and repeat as required. This observation led directly to the creation of a single intelligent agent combining cognitive radio and autonomous vehicle intelligence with the ability to leverage flexibility in the radio frequency (RF) and motion domains. Using a single intelligent agent to optimize decision making across both mobility and radio domains is unified multi-
domain decision making (UMDDM).
Advisors/Committee Members: Bostian, Charles W. (committeechair), Reed, Jeffrey H. (committee member), Meehan, Kathleen (committee member), Woolsey, Craig A. (committee member), Pratt, Timothy J. (committee member).
Subjects/Keywords: Cognitive Radio; Autonomous Vehicles; Multi-domain Decision Making; Multi-objective Optimization
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Young, A. R. (2013). Unified Multi-domain Decision Making: Cognitive Radio and Autonomous Vehicle Convergence. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/19295
Chicago Manual of Style (16th Edition):
Young, Alexander Rian. “Unified Multi-domain Decision Making: Cognitive Radio and Autonomous Vehicle Convergence.” 2013. Doctoral Dissertation, Virginia Tech. Accessed April 10, 2021.
http://hdl.handle.net/10919/19295.
MLA Handbook (7th Edition):
Young, Alexander Rian. “Unified Multi-domain Decision Making: Cognitive Radio and Autonomous Vehicle Convergence.” 2013. Web. 10 Apr 2021.
Vancouver:
Young AR. Unified Multi-domain Decision Making: Cognitive Radio and Autonomous Vehicle Convergence. [Internet] [Doctoral dissertation]. Virginia Tech; 2013. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/10919/19295.
Council of Science Editors:
Young AR. Unified Multi-domain Decision Making: Cognitive Radio and Autonomous Vehicle Convergence. [Doctoral Dissertation]. Virginia Tech; 2013. Available from: http://hdl.handle.net/10919/19295

University of Texas – Austin
9.
-7800-228X.
Implementing efficient global optimization methods in full waveform inversion.
Degree: PhD, Geological Sciences, 2018, University of Texas – Austin
URL: http://dx.doi.org/10.26153/tsw/9514
► Full Waveform Inversion (FWI) is slowly becoming the standard for velocity estimation from seismic data. It uses the full wave equation to estimate high resolution…
(more)
▼ Full Waveform Inversion (FWI) is slowly becoming the standard for velocity estimation from seismic data. It uses the full wave equation to estimate high resolution models capable of recovering finer details compared to traditional methods like tomography. FWI is constructed as a least squares
optimization problem that iteratively updates an initial model until the misfit between modeled and observed data are within a pre-specified tolerance. The local nature of FWI makes it sensitive to the choice of starting model which has to be in the global minimum trough of the misfit function. If the starting model lies outside the global minimum trough, FWI converges to a local minima giving an incorrect estimation of subsurface properties. In this thesis, I eliminate the sensitivity to the starting model when performing FWI. This is done by recasting FWI into a global
optimization problem using a combination of sparse parameterization methods. The starting model is generated by a global
optimization method that is not sensitive to the starting model. The result from the global
optimization method is then used as a starting model for conventional FWI using a dense set of parameters. In chapter 2, I apply global
optimization with a sparse parameterization technique for 2D models using a combination of interfaces and velocities. Chapter 3 extends the sparse parameterization for salt bodies using ellipse sets and level-set methods. Lastly, chapter 4 extends sparse parameterization in three dimensions to perform FWI without a starting guess. I demonstrate that the proposed approaches are not sensitive to the source of starting model and discuss some sources of uncertainty.
Another issue that prevents implementation of FWI on a regular basis is its computational cost. Expensive forward evaluations need to be performed multiple times across several iterations to obtain the final model. It is of particular significance in 3D where in addition to posing a computational cost problem, it also creates a data reversal problem when computing the gradient. I propose two approaches to reduce the computational cost of forward modeling and gradient computation in the time and frequency domains. The frequency
domain approach discussed in chapter 5 exploits the contribution of unchanging zones in an inversion workflow to be reused over subsequent iterations of FWI. The final chapter discusses how to run a gradient computation on GPUs using faster interconnect and on-node memory. I provide a template to apply it to a general adjoint problem with specific example on FWI. I obtain a 20-40% and 82-207% improvement in runtimes in the frequency and time
domain, respectively, using the proposed methods.
Advisors/Committee Members: Sen, Mrinal K. (advisor), Fomel, Sergey (committee member), Spikes, Kyle T (committee member), Grand, Steve (committee member), Jordan, Kirk E (committee member).
Subjects/Keywords: Full waveform inversion; Global optimization; Sparse parameterization; GPU; Frequency domain
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-7800-228X. (2018). Implementing efficient global optimization methods in full waveform inversion. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://dx.doi.org/10.26153/tsw/9514
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-7800-228X. “Implementing efficient global optimization methods in full waveform inversion.” 2018. Doctoral Dissertation, University of Texas – Austin. Accessed April 10, 2021.
http://dx.doi.org/10.26153/tsw/9514.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-7800-228X. “Implementing efficient global optimization methods in full waveform inversion.” 2018. Web. 10 Apr 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-7800-228X. Implementing efficient global optimization methods in full waveform inversion. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2018. [cited 2021 Apr 10].
Available from: http://dx.doi.org/10.26153/tsw/9514.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-7800-228X. Implementing efficient global optimization methods in full waveform inversion. [Doctoral Dissertation]. University of Texas – Austin; 2018. Available from: http://dx.doi.org/10.26153/tsw/9514
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
10.
Moreira, João Baptista Dias.
Otimização topológica multiescala aplicada a problemas dinâmicos.
Degree: 2018, Brazil
URL: http://hdl.handle.net/10183/184868
► Em áreas que demandam componentes de alto desempenho como a indústria automotiva, aeronáutica e aeroespacial, a otimização do desempenho dinâmico de estruturas é buscada através…
(more)
▼ Em áreas que demandam componentes de alto desempenho como a indústria automotiva, aeronáutica e aeroespacial, a otimização do desempenho dinâmico de estruturas é buscada através de diferentes abordagens, como o projeto de materiais específicos à aplicação, ou otimização estrutural topológica. Em particular, o método de otimização estrutural evolucionária bidirecional BESO (Bi-directional Evolutionary Structural Optimization) tem sido utilizado no projeto simultâneo de estruturas hierárquicas, o que significa que o domínio estrutural consiste não somente na estrutura como também na topologia microestrutural dos materiais empregados. O objetivo desse trabalho consiste em aplicar a metodologia BESO na resolução de problemas multiescala bidimensionais visando à maximização da frequência fundamental de estruturas, assim como a minimização de sua resposta quando sujeitas a excitações forçadas numa determinada faixa de frequências. O método da
homogeneização é introduzido e aplicado na integração entre as diferentes escalas do problema. Em especial, o modelo de interpolação material é generalizado para o uso de dois materiais no caso de otimização da resposta no domínio da frequência. A metodologia BESO foi aplicada a casos de otimização tomando como domínio estrutural somente a macroescala (projeto estrutural), somente a microescala (projeto material), assim como ambas as escalas concomitantemente (projeto multiescala). Para os casos estudados, a redistribuição de material na macroescala levou a resultados melhores em relação à otimização que modifica a microestrutura. Para a maximização da frequência fundamental, a otimização multiescala obteve os melhores resultados, já para a minimização da resposta em frequência, a otimização somente na macroescala se mostrou mais eficiente.
In areas which demand high performance components, such as automotive, aeronautics and aerospace, the design of application deppendent
materials and structural topology optimization are two approaches used in order to optimize structures‟ dynamic behaviour. In particular, the Bi-directional Evolutionary Structural Optimization (BESO) method has been applied to the simultaneous project of hierarchical structures, meaning that the project‟s domain consists not only on the structure on the macroscale, but also on the representative volume element (RVE) associated with the microstructure of the employed materials. The objective of this work is to apply the BESO method in order to solve multiscale bidimensional problems, more specifically, topology optimization problems for fundamental frequency maximization and minimization of the response in the frequency domain under harmonic excitation. The homogenization method is introduced and used to integrate the macro and microscales considered. Furthermore, the material interpolation model in generalized for two material domains in the response minimization problem. The BESO
method was applied to optimizations problems where the structural domain was eiher the macrostructure (structural project),…
Advisors/Committee Members: Casas, Walter Jesus Paucar.
Subjects/Keywords: Solução de problemas; Otimização topológica; Homogeneização; Topology optimization; Homogenization; Frequency domain
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Moreira, J. B. D. (2018). Otimização topológica multiescala aplicada a problemas dinâmicos. (Masters Thesis). Brazil. Retrieved from http://hdl.handle.net/10183/184868
Chicago Manual of Style (16th Edition):
Moreira, João Baptista Dias. “Otimização topológica multiescala aplicada a problemas dinâmicos.” 2018. Masters Thesis, Brazil. Accessed April 10, 2021.
http://hdl.handle.net/10183/184868.
MLA Handbook (7th Edition):
Moreira, João Baptista Dias. “Otimização topológica multiescala aplicada a problemas dinâmicos.” 2018. Web. 10 Apr 2021.
Vancouver:
Moreira JBD. Otimização topológica multiescala aplicada a problemas dinâmicos. [Internet] [Masters thesis]. Brazil; 2018. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/10183/184868.
Council of Science Editors:
Moreira JBD. Otimização topológica multiescala aplicada a problemas dinâmicos. [Masters Thesis]. Brazil; 2018. Available from: http://hdl.handle.net/10183/184868

University of Illinois – Urbana-Champaign
11.
Santos Faria Xavier Teixeira, Thiago.
A language and a system for program optimization.
Degree: PhD, Computer Science, 2020, University of Illinois – Urbana-Champaign
URL: http://hdl.handle.net/2142/109371
► Hardware complexity has increased over time, and as architectures evolve and new ones are adopted, programs must often be altered by numerous optimizations to attain…
(more)
▼ Hardware complexity has increased over time, and as architectures evolve and new ones are adopted, programs must often be altered by numerous optimizations to attain maximum computing power on each target environment. As a result, the code becomes unrecognizable over time, hard to maintain, and challenging to modify. Furthermore, as the code evolves, it is hard to keep the optimizations up to date. The need to develop and maintain separate versions of the application for each target platform is an immense undertaking, especially for the large and long-lived applications commonly found in the high-performance computing (HPC) community.
This dissertation presents Locus, a new system, and a language for optimizing complex, long-lived applications for different platforms. We describe the requirements that we believe are necessary for making automatic performance tuning widely adopted. We present the design and implementation of a system that fulfills these requirements. It includes a
domain-specific language that can represent complex collections of transformations, an interface to integrate external modules, and a database to manage platform-specific efficient code. The database allows the system’s users to access optimized code without having to install the code generation toolset. The Locus language allows the definition of a search space combined with the programming of
optimization sequences separated from the application’s reference code. After all, we present an approach for performance portability.
Our thesis is that we can ameliorate the difficulty of optimizing applications using a methodology based on
optimization programming and automated empirical search. Our system automatically selects, generates, and executes candidate implementations to find the one with the best performance.
We present examples to illustrate the power and simplicity of the language. The experimental evaluation shows that exploring the space of candidate implementations typically leads to better performing codes than those produced by conventional compiler optimizations that are based solely on heuristics. Locus was able to generate a matrix-matrix multiplication code that outperformed the IBM XLC internal hand-optimized version by 2× on the Power 9 processors. On Intel E5, Locus generates code with performance comparable to Intel MKL’s. We also improve performance relative to the reference implementation of up to 4× on stencil computations.
Locus ability to integrate complex search spaces with
optimization sequences can result in very complicated
optimization programs. Locus compiler applies optimizations to remove from the
optimization sequences unnecessary search statements making the exploration for faster implementations more accessible.
We optimize matrix transpose, matrix-matrix multiplication, fast Fourier transform, symmetric eigenproblem, and sparse matrix-vector multiplication through divide and conquer. We implement three strategies using the Locus language to create search spaces to find the best shapes of the base case…
Advisors/Committee Members: Padua, David (advisor), Gropp, William (Committee Chair), Adve, Vikram (committee member), Ancourt, Corinne (committee member), Amarasingue, Saman (committee member).
Subjects/Keywords: compilers; code generation; program optimization; domain-specific language
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Santos Faria Xavier Teixeira, T. (2020). A language and a system for program optimization. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/109371
Chicago Manual of Style (16th Edition):
Santos Faria Xavier Teixeira, Thiago. “A language and a system for program optimization.” 2020. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 10, 2021.
http://hdl.handle.net/2142/109371.
MLA Handbook (7th Edition):
Santos Faria Xavier Teixeira, Thiago. “A language and a system for program optimization.” 2020. Web. 10 Apr 2021.
Vancouver:
Santos Faria Xavier Teixeira T. A language and a system for program optimization. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2020. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/2142/109371.
Council of Science Editors:
Santos Faria Xavier Teixeira T. A language and a system for program optimization. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2020. Available from: http://hdl.handle.net/2142/109371

Indian Institute of Science
12.
Bharat, Patil Tejas.
Matching Domain Model with Source Code using Relationships.
Degree: MSc Engg, Faculty of Engineering, 2018, Indian Institute of Science
URL: http://etd.iisc.ac.in/handle/2005/3047
► We address the task of mapping a given domain model (e.g., an industry-standard reference model) for a given domain (e.g., ERP), with the source code…
(more)
▼ We address the task of mapping a given
domain model (e.g., an industry-standard reference model) for a given
domain (e.g., ERP), with the source code of an independently developed application in the same
domain. This has applications in improving the understandability of an existing application, migrating it to a more flexible architecture, or integrating it with other related applications. We build on a previous approach, which uses relationships among source code elements for improving the precision of the mapping process. We extend this approach by considering relationships among
domain model elements in addition to relationships among source code elements, and also by stating the mapping process as an
optimization problem. We have implemented our approach, and compared it with the previous approach. We show that our approach gives significantly better precision as well as recall than the previous approach when applied on a real industry-standard
domain model and an open-source application.
Advisors/Committee Members: Raghavan, K V (advisor).
Subjects/Keywords: Information Retrieval; Optimization Framework; Domain Models; Source Code; Vector Space Model; Enterprise Resource Planning (ERP) Domain Models; Customer Relationship Management (CRM) Domain Models; VSM Model; Computer Science
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Bharat, P. T. (2018). Matching Domain Model with Source Code using Relationships. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3047
Chicago Manual of Style (16th Edition):
Bharat, Patil Tejas. “Matching Domain Model with Source Code using Relationships.” 2018. Masters Thesis, Indian Institute of Science. Accessed April 10, 2021.
http://etd.iisc.ac.in/handle/2005/3047.
MLA Handbook (7th Edition):
Bharat, Patil Tejas. “Matching Domain Model with Source Code using Relationships.” 2018. Web. 10 Apr 2021.
Vancouver:
Bharat PT. Matching Domain Model with Source Code using Relationships. [Internet] [Masters thesis]. Indian Institute of Science; 2018. [cited 2021 Apr 10].
Available from: http://etd.iisc.ac.in/handle/2005/3047.
Council of Science Editors:
Bharat PT. Matching Domain Model with Source Code using Relationships. [Masters Thesis]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3047

Indian Institute of Science
13.
Vasista, Vinay V.
Automatic Optimization of Geometric Multigrid Methods using a DSL Approach.
Degree: MSc Engg, Faculty of Engineering, 2018, Indian Institute of Science
URL: http://etd.iisc.ac.in/handle/2005/3707
► Geometric Multigrid (GMG) methods are widely used in numerical analysis to accelerate the convergence of partial differential equations solvers using a hierarchy of grid discretizations.…
(more)
▼ Geometric Multigrid (GMG) methods are widely used in numerical analysis to accelerate the convergence of partial differential equations solvers using a hierarchy of grid discretizations. These solvers find plenty of applications in various fields in engineering and scientific domains, where solving PDEs is of fundamental importance. Using multigrid methods, the pace at which the solvers arrive at the solution can be improved at an algorithmic level. With the advance in modern computer architecture, solving problems with higher complexity and sizes is feasible - this is also the case with multigrid methods. However, since hardware support alone cannot achieve high performance in execution time, there is a need for good software that help programmers in doing so.
Multiple grid sizes and recursive expression of multigrid cycles make the task of manual program
optimization tedious and error-prone. A high-level language that aids
domain experts to quickly express complex algorithms in a compact way using dedicated constructs for multigrid methods and with good
optimization support is thus valuable. Typical computation patterns in a GMG algorithm includes stencils, point-wise accesses, restriction and interpolation of a grid. These computations can be optimized for performance on modern architectures using standard parallelization and locality enhancement techniques.
Several past works have addressed the problem of automatic optimizations of computations in various scientific domains using a
domain-specific language (DSL) approach. A DSL is a language with features to express
domain-specific computations and compiler support to enable optimizations specific to these computations. Halide and PolyMage are two of the recent works in this direction, that aim to optimize image processing pipelines. Many computations like upsampling and downsampling an image are similar to interpolation and restriction in geometric multigrid methods.
In this thesis, we demonstrate how high performance can be achieved on GMG algorithms written in the PolyMage
domain-specific language with new optimizations we added to the compiler. We also discuss the implementation of non-trivial optimizations, on PolyMage compiler, necessary to achieve high parallel performance for multigrid methods on modern architectures. We realize these goals by:
• introducing multigrid
domain-specific constructs to minimize the verbosity of the algorithm specification;
• storage remapping to reduce the memory footprint of the program and improve cache locality exploitation;
• mitigating execution time spent in data handling operations like memory allocation and freeing, using a pool of memory, across multiple multigrid cycles; and
• incorporating other well-known techniques to leverage performance, like exploiting multi-dimensional parallelism and minimizing the lifetime of storage buffers.
We evaluate our optimizations on a modern multicore system using five different benchmarks varying in multigrid cycle structure, complexity and size, for two-and…
Advisors/Committee Members: Uday Kumar Reddy, B (advisor).
Subjects/Keywords: Geometric Multigrid Methods; Automatic Optimization; Geometric Multigrid Method; Compiler Optimizations; PolyMage Compiler; DSL Approach; Automatic Optimization; Domain-specific Language Approach; GMG Algorithm; Polyhedral Optimization; Storage Optimization; Computer Science
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Vasista, V. V. (2018). Automatic Optimization of Geometric Multigrid Methods using a DSL Approach. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3707
Chicago Manual of Style (16th Edition):
Vasista, Vinay V. “Automatic Optimization of Geometric Multigrid Methods using a DSL Approach.” 2018. Masters Thesis, Indian Institute of Science. Accessed April 10, 2021.
http://etd.iisc.ac.in/handle/2005/3707.
MLA Handbook (7th Edition):
Vasista, Vinay V. “Automatic Optimization of Geometric Multigrid Methods using a DSL Approach.” 2018. Web. 10 Apr 2021.
Vancouver:
Vasista VV. Automatic Optimization of Geometric Multigrid Methods using a DSL Approach. [Internet] [Masters thesis]. Indian Institute of Science; 2018. [cited 2021 Apr 10].
Available from: http://etd.iisc.ac.in/handle/2005/3707.
Council of Science Editors:
Vasista VV. Automatic Optimization of Geometric Multigrid Methods using a DSL Approach. [Masters Thesis]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3707
14.
Raja murugadoss J.
Domain based multiple ant colony Algorithm for discrete
structural Optimization a metaheuristic approach;.
Degree: Domain based multiple ant colony Algorithm for
discrete structural Optimization a metaheuristic
approach, 2014, Anna University
URL: http://shodhganga.inflibnet.ac.in/handle/10603/29898
► newlineMany research works have been successfully carried out on newlineoptimum structural designs by means of several soft computing tools such as newlineGenetic Algorithm GA Simulated…
(more)
▼ newlineMany research works have been successfully
carried out on newlineoptimum structural designs by means of
several soft computing tools such as newlineGenetic Algorithm GA
Simulated Annealing SA and so on Most of these newlineoptimization
techniques encounter some common limitations such as
newlineenormous computational time premature convergence and
algorithm newlinetermination at sub optimal points Therefore the
chance of generating a newlineglobal optimum or a near optimal
solution in a reasonable amount of newlinecomputational time
becomes less newlineMore recently the Ant Colony Optimization ACO
algorithm newlineinspired from the foraging strategy of social ants
is gaining much popularity newlineover other heuristic approaches
due to its peculiar characteristics ACO is a newlinemetaheuristic
decentralized and combinatorial optimization algorithm by
newlinewhich a wide spectrum of problems has been successfully
solved in the field newlineof networking and only limited research
has been carried out in the field of newlinestructural optimization
Hence, in the present work an attempt has been made newlineto
develop an enhanced version of ACO namely Domain Based Multiple
newlineAnt Colony Optimization DB MACO algorithm for structural
newlineOptimization DB MACO algorithm has been developed by
blending multiple ant newlinecolonies with two powerful local
search procedures such as Tabu Search TS newlineand Cost
Minimization algorithm CM algorithm newline
newline
appendix p174-183, appendix
p184-190.
Advisors/Committee Members: Rajendran M G.
Subjects/Keywords: Ant Colony Optimization; Cost Minimization algorithm; Domain Based Multiple Ant Colony
Optimization; Genetic Algorithm; Simulated Annealing; Tabu Search
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
J, R. m. (2014). Domain based multiple ant colony Algorithm for discrete
structural Optimization a metaheuristic approach;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/29898
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
J, Raja murugadoss. “Domain based multiple ant colony Algorithm for discrete
structural Optimization a metaheuristic approach;.” 2014. Thesis, Anna University. Accessed April 10, 2021.
http://shodhganga.inflibnet.ac.in/handle/10603/29898.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
J, Raja murugadoss. “Domain based multiple ant colony Algorithm for discrete
structural Optimization a metaheuristic approach;.” 2014. Web. 10 Apr 2021.
Vancouver:
J Rm. Domain based multiple ant colony Algorithm for discrete
structural Optimization a metaheuristic approach;. [Internet] [Thesis]. Anna University; 2014. [cited 2021 Apr 10].
Available from: http://shodhganga.inflibnet.ac.in/handle/10603/29898.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
J Rm. Domain based multiple ant colony Algorithm for discrete
structural Optimization a metaheuristic approach;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/29898
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

George Mason University
15.
Caiseda, Carmen A.
Development of Numerical Optimization Techniques for Optimal Design of Nanophotonic and Nanoplasmonic Systems
.
Degree: 2012, George Mason University
URL: http://hdl.handle.net/1920/7951
► There is a steadily growing interest in building new photonic and plasmonic nanosystems capable of tailoring the electromagnetic properties of light. An optimal design of…
(more)
▼ There is a steadily growing interest in building new photonic and plasmonic nanosystems
capable of tailoring the electromagnetic properties of light. An optimal design of these
nanosystems is critical for their efficiency. One essential component of optimal design of
nanodevices is numerical simulation and
optimization that provide the optimal structure to
be tested experimentally, and eventually implemented as actual device. This dissertation
focuses on the development of numerical
optimization techniques to analyze and design efficient nanoplasmonic and nanophotonic systems. In this work the electromagnetic field
is modeled through the numerical solution of Maxwell's equations in the frequency
domain,
and numerical techniques that address
optimization problems with these PDE constraints
are developed. Application of the techniques to problems of i) maximization of light absorption by metal nanoparticle and ii) efficient surface plasmon generation demonstrate
considerable practical value of the developed methodology
No preferred strategy has yet emerged from the nanophotonic research community to solve
optimization problems with partial differential equation constraints, despite continuous theoretical developments in topology and shape
optimization, large-scale nonlinear
optimization and sensitivity analysis. This dissertation considers two approaches to the problem.
The first approach is to discretize and incorporate the PDE into a constrained
optimization
problem to solve with an appropriate nonlinear programming algorithm. The second
optimization approach is to formulate and compute the gradient and modify the parameters
accordingly, using the current data and PDE solution obtained from the solver. The first
approach has been implemented in AMPL modeling language for problem i). The second
numerical
optimization approach is the main strategy implemented for both problems i)and ii) using COMSOL Multiphysics and MATLAB.
Although this effort to solve a design
optimization problem is specific to nanophotonic/nanoplasmonic
systems, the result of this work afford computational tools with broader applications to advance the wider problem of
optimization with PDE constraints.
Advisors/Committee Members: Griva, Igor (advisor).
Subjects/Keywords: finite element methods;
numerical optimization;
nanoplasmonics;
gradient based optimization;
Maxwell's Equations in the frequency domain;
COMSOL/MATLAB
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Caiseda, C. A. (2012). Development of Numerical Optimization Techniques for Optimal Design of Nanophotonic and Nanoplasmonic Systems
. (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/7951
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Caiseda, Carmen A. “Development of Numerical Optimization Techniques for Optimal Design of Nanophotonic and Nanoplasmonic Systems
.” 2012. Thesis, George Mason University. Accessed April 10, 2021.
http://hdl.handle.net/1920/7951.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Caiseda, Carmen A. “Development of Numerical Optimization Techniques for Optimal Design of Nanophotonic and Nanoplasmonic Systems
.” 2012. Web. 10 Apr 2021.
Vancouver:
Caiseda CA. Development of Numerical Optimization Techniques for Optimal Design of Nanophotonic and Nanoplasmonic Systems
. [Internet] [Thesis]. George Mason University; 2012. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/1920/7951.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Caiseda CA. Development of Numerical Optimization Techniques for Optimal Design of Nanophotonic and Nanoplasmonic Systems
. [Thesis]. George Mason University; 2012. Available from: http://hdl.handle.net/1920/7951
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Rochester Institute of Technology
16.
Minnehan, Breton Lawrence.
Deep Grassmann Manifold Optimization for Computer Vision.
Degree: PhD, Engineering, 2019, Rochester Institute of Technology
URL: https://scholarworks.rit.edu/theses/10122
► In this work, we propose methods that advance four areas in the field of computer vision: dimensionality reduction, deep feature embeddings, visual domain adaptation,…
(more)
▼ In this work, we propose methods that advance four areas in the field of computer vision: dimensionality reduction, deep feature embeddings, visual
domain adaptation, and deep neural network compression. We combine concepts from the fields of manifold geometry and deep learning to develop cutting edge methods in each of these areas. Each of the methods proposed in this work achieves state-of-the-art results in our experiments. We propose the Proxy Matrix
Optimization (PMO) method for
optimization over orthogonal matrix manifolds, such as the Grassmann manifold. This
optimization technique is designed to be highly flexible enabling it to be leveraged in many situations where traditional manifold
optimization methods cannot be used.
We first use PMO in the field of dimensionality reduction, where we propose an iterative
optimization approach to Principal Component Analysis (PCA) in a framework called Proxy Matrix
optimization based PCA (PM-PCA). We also demonstrate how PM-PCA can be used to solve the general L
p-PCA problem, a variant of PCA that uses arbitrary fractional norms, which can be more robust to outliers. We then present Cascaded Projection (CaP), a method which uses tensor compression based on PMO, to reduce the number of filters in deep neural networks. This, in turn, reduces the number of computational operations required to process each image with the network. Cascaded Projection is the first end-to-end trainable method for network compression that uses standard backpropagation to learn the optimal tensor compression. In the area of deep feature embeddings, we introduce Deep Euclidean Feature Representations through Adaptation on the Grassmann manifold (DEFRAG), that leverages PMO. The DEFRAG method improves the feature embeddings learned by deep neural networks through the use of auxiliary loss functions and Grassmann manifold
optimization. Lastly, in the area of visual
domain adaptation, we propose the Manifold-Aligned Label Transfer for
Domain Adaptation (MALT-DA) to transfer knowledge from samples in a known
domain to an unknown
domain based on cross-
domain cluster correspondences.
Advisors/Committee Members: Andreas Savakis.
Subjects/Keywords: Computer vision; Deep learning; Domain adaption; Feature learning; Manifold optimization; Network compression
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Minnehan, B. L. (2019). Deep Grassmann Manifold Optimization for Computer Vision. (Doctoral Dissertation). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/10122
Chicago Manual of Style (16th Edition):
Minnehan, Breton Lawrence. “Deep Grassmann Manifold Optimization for Computer Vision.” 2019. Doctoral Dissertation, Rochester Institute of Technology. Accessed April 10, 2021.
https://scholarworks.rit.edu/theses/10122.
MLA Handbook (7th Edition):
Minnehan, Breton Lawrence. “Deep Grassmann Manifold Optimization for Computer Vision.” 2019. Web. 10 Apr 2021.
Vancouver:
Minnehan BL. Deep Grassmann Manifold Optimization for Computer Vision. [Internet] [Doctoral dissertation]. Rochester Institute of Technology; 2019. [cited 2021 Apr 10].
Available from: https://scholarworks.rit.edu/theses/10122.
Council of Science Editors:
Minnehan BL. Deep Grassmann Manifold Optimization for Computer Vision. [Doctoral Dissertation]. Rochester Institute of Technology; 2019. Available from: https://scholarworks.rit.edu/theses/10122

Penn State University
17.
Gregory, Micah Dennis.
New Methods in Ultra-Wideband Array Design and Finite-Difference Time-Domain Modeling of Memristive Devices.
Degree: 2013, Penn State University
URL: https://submit-etda.libraries.psu.edu/catalog/19084
► This dissertation covers two electromagnetics topics, the first is the design of ultra-wideband antenna array layouts. The second is the design of reconfigurable radio frequency…
(more)
▼ This dissertation covers two electromagnetics topics, the first is the design of ultra-wideband antenna array layouts. The second is the design of reconfigurable radio frequency devices with a newly discovered circuit element, the memristor. The two concepts are seemingly unrelated, however, reconfigurable devices are often used in antennas with multi-band abilities, sometimes switching between frequencies that can be octaves apart. In order to efficiently use these reconfigurable antennas in phased arrays they must be placed in a proper layout, the focus of the first topic.
The primary focus of the first topic is the elimination of grating lobes and minimization of peak sidelobe levels in the radiation pattern of antenna arrays. The occurrence of grating lobes in array factors is very similar to aliasing in a digital system when the sampling frequency is below twice the maximum frequency content (i.e. the Nyquist frequency). These lobes appear in the array factor or radiation pattern of periodic arrays when the distance between elements becomes greater than one wavelength (for an unsteered array, and less for a steered phased array), resulting in radiation and reception in undesired directions. Strong mutual coupling negatively affects antenna performance when elements are placed less than a half-wavelength apart, limiting the closest that common antenna elements can be placed. These two phenomena generally limit the usable frequency bandwidth of conventional periodic array systems to about 2:1. As many emerging radio frequency systems that utilize multiple frequencies and ultra-wide bandwidths require high directivity, the need for capable array layout designs becomes apparent. The goal of this portion of research is the creation of design techniques which are capable of readily producing array layouts which yield no grating lobes and low sidelobe levels over vary large frequency bandwidths.
The second focus involves a new type of electronic device called the memristor. Their existence was speculated by Leon Chua in the 1970s as the fourth basic circuit element which relates flux to charge. The result is a passive component with a charge or flux dependent resistance, allowing for design of interesting reconfigurable electromagnetic devices without active circuit elements such as transistors. It has received significant interest after a research team at Hewlett-Packard labs successfully fabricated a device using titanium dioxide and platinum which exhibits properties that can be modeled by a memristor. Most excitement resides around their potential for computer memory applications, however, their properties are also useful for other devices. Many frequency selective surface and antenna structures can have adjustable performance characteristics based on the values of embedded lumped resistor elements. Replacing the resistors with memristors allows reconfigurability without the use of significant controlling circuitry that is usually necessary with other reconfigurable devices such as active parts…
Advisors/Committee Members: Douglas Henry Werner, Dissertation Advisor/Co-Advisor, Douglas Henry Werner, Committee Chair/Co-Chair, Ram Mohan Narayanan, Committee Member, Douglas Edward Wolfe, Committee Member, Jack Brenizer Jr., Committee Member, Victor P Pasko, Committee Member.
Subjects/Keywords: Ultra-Wideband Array; CMA-ES; Optimization; Aperiodic Arrays; Memristor; Reconfigurable Antennas; Finite-Difference Time-Domain
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Gregory, M. D. (2013). New Methods in Ultra-Wideband Array Design and Finite-Difference Time-Domain Modeling of Memristive Devices. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/19084
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Gregory, Micah Dennis. “New Methods in Ultra-Wideband Array Design and Finite-Difference Time-Domain Modeling of Memristive Devices.” 2013. Thesis, Penn State University. Accessed April 10, 2021.
https://submit-etda.libraries.psu.edu/catalog/19084.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Gregory, Micah Dennis. “New Methods in Ultra-Wideband Array Design and Finite-Difference Time-Domain Modeling of Memristive Devices.” 2013. Web. 10 Apr 2021.
Vancouver:
Gregory MD. New Methods in Ultra-Wideband Array Design and Finite-Difference Time-Domain Modeling of Memristive Devices. [Internet] [Thesis]. Penn State University; 2013. [cited 2021 Apr 10].
Available from: https://submit-etda.libraries.psu.edu/catalog/19084.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Gregory MD. New Methods in Ultra-Wideband Array Design and Finite-Difference Time-Domain Modeling of Memristive Devices. [Thesis]. Penn State University; 2013. Available from: https://submit-etda.libraries.psu.edu/catalog/19084
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

McMaster University
18.
Aziz, Malik Junaid.
WORKBENCH FOR MODELING AND OPTIMIZATION OF DIVERSE NETWORKS.
Degree: MCS, 2012, McMaster University
URL: http://hdl.handle.net/11375/12046
► This work describes an architecture which enables experiments in optimization of networks that represent systems in diverse application domains, e.g. multi-product food production plants,…
(more)
▼ This work describes an architecture which enables experiments in optimization of networks that represent systems in diverse application domains, e.g. multi-product food production plants, gasoline blending and shipment, heat exchanger networks in refineries, etc. The prototype implementation is a web-based workbench (NOPT). Design of the workbench enables instantiation of different application domains via attributes describing entities (materials, energy) flowing through network arcs, and via node models relevant to the domain. From data describing the network attributes, NOPT generates a mathematical model described by a set of linear equations and provides a user with abilities to select appropriate solution algorithms. Multi-step composite algorithms, each solving a subnetwork or an entire network for specific time periods can be constructed with input from the user. Some of the steps in the algorithm can be non-linear procedures which compute specific model parameters. Hence, the architecture enables solution of bi linear systems of type “x*y” (e.g. energy balances) by first solving for “x’ (e.g. mass flows) from some other set of equations (e.g. mass balances) and then solve for “y” since “x’ is known. Current architecture of NOPT also supports the inclusion of external node models that helps user to import his customized node models into the workbench via the feature called User Node.
Master of Computer Science (MCS)
Advisors/Committee Members: Mahalec, Vladimir, Computing and Software.
Subjects/Keywords: Network Modeling; Optimization; Diverse Domain Networks; Chemical Engineering; Computer and Systems Architecture; Chemical Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Aziz, M. J. (2012). WORKBENCH FOR MODELING AND OPTIMIZATION OF DIVERSE NETWORKS. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/12046
Chicago Manual of Style (16th Edition):
Aziz, Malik Junaid. “WORKBENCH FOR MODELING AND OPTIMIZATION OF DIVERSE NETWORKS.” 2012. Masters Thesis, McMaster University. Accessed April 10, 2021.
http://hdl.handle.net/11375/12046.
MLA Handbook (7th Edition):
Aziz, Malik Junaid. “WORKBENCH FOR MODELING AND OPTIMIZATION OF DIVERSE NETWORKS.” 2012. Web. 10 Apr 2021.
Vancouver:
Aziz MJ. WORKBENCH FOR MODELING AND OPTIMIZATION OF DIVERSE NETWORKS. [Internet] [Masters thesis]. McMaster University; 2012. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/11375/12046.
Council of Science Editors:
Aziz MJ. WORKBENCH FOR MODELING AND OPTIMIZATION OF DIVERSE NETWORKS. [Masters Thesis]. McMaster University; 2012. Available from: http://hdl.handle.net/11375/12046

University of Adelaide
19.
Bi, Weiwei.
Improved evolutionary algorithm optimisation of water distribution systems using domain knowledge.
Degree: 2016, University of Adelaide
URL: http://hdl.handle.net/2440/112041
► Water distribution systems (WDSs) are becoming increasingly complex and larger in scale due to the rapid growth of population and fast urbanization. Hence, they require…
(more)
▼ Water distribution systems (WDSs) are becoming increasingly complex and larger in scale due to the rapid growth of population and fast urbanization. Hence, they require high levels of investment for their construction and maintenance. This motivates the need to optimally design these systems, with the aim being to minimize the investment budget while maintaining high service quality. Over the past 25 years, a number of evolutionary algorithms (EAs) have been developed to achieve optimal design solutions for WDSs, representing a focal point of much research in this area. One issue that hinders EAs’ wide application in industry is their significant demand on computational resources when handling real-world WDSs. In recognition of this, there has been a move from aiming to find the globally optimal solutions to identifying the best possible solutions within constrained computational resources. While many studies have been undertaken to attain this goal, there have been limited efforts that use engineering knowledge to reduce the computational effort. The research undertaken in this thesis is such an attempt, as it aims to efficiently identify near-optimal solutions with the aid of WDS design knowledge. This thesis presents a
domain-knowledge based
optimization framework that enables the near-optimal solutions (fronts) of WDS problems to be identified within constrained computing time. The knowledge considered includes (i) the relationship between pipe size and distance to the water source(s); (ii) the impact of flow velocities on optimal solutions; and (iii) the relationship between flow velocities and network resilience. This thesis consists of an Introduction, three chapters that are based around a series of three journal papers and a set of Conclusions and Recommendations for Further Work. The first paper introduces a new initialization method to assist genetic algorithms (GAs) to identify near-optimal solutions in a computationally efficient manner. This is attained by incorporating
domain knowledge into the generation of the initial population of GAs. The results show that the proposed method performs better than the other three initialization methods considered, both in terms of computational efficiency and the ability to find near-optimal solutions. The second paper investigates the relative impact of different algorithm initializations and searching mechanisms on the speed with which near-optimal solutions can be identified for large WDS design problems. Results indicate that EA parameterizations, that emphasize exploitation relative to exploration, enable near-optimal solutions to be identified earlier in the search, which is due to the “big bowl” shape of the fitness function for all of the WDS problems considered. Using initial solutions that are informed using
domain knowledge can further increase the speed with which near-optimal solutions can be identified. The third publication extends the single-objective method in the first paper to a two-objective problem. The objectives considered are the minimization…
Advisors/Committee Members: Dandy, Graeme Clyde (advisor), Maier, Holger R. (advisor), School of Civil, Environmental and Mining Engineering (school).
Subjects/Keywords: optimization; evolutionary algorithm; water distribution systems; domain knowledge; heuristics; computational efficiency; Research by Publication
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Bi, W. (2016). Improved evolutionary algorithm optimisation of water distribution systems using domain knowledge. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/112041
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Bi, Weiwei. “Improved evolutionary algorithm optimisation of water distribution systems using domain knowledge.” 2016. Thesis, University of Adelaide. Accessed April 10, 2021.
http://hdl.handle.net/2440/112041.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Bi, Weiwei. “Improved evolutionary algorithm optimisation of water distribution systems using domain knowledge.” 2016. Web. 10 Apr 2021.
Vancouver:
Bi W. Improved evolutionary algorithm optimisation of water distribution systems using domain knowledge. [Internet] [Thesis]. University of Adelaide; 2016. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/2440/112041.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Bi W. Improved evolutionary algorithm optimisation of water distribution systems using domain knowledge. [Thesis]. University of Adelaide; 2016. Available from: http://hdl.handle.net/2440/112041
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Manchester
20.
Erfani, Tohid.
An efficient analysis of pareto optimal solutions in multidisciplinary design.
Degree: PhD, 2011, University of Manchester
URL: https://www.research.manchester.ac.uk/portal/en/theses/an-efficient-analysis-of-pareto-optimal-solutions-in-multidisciplinary-design(9bcf3c8f-4922-48a7-a829-1efce3d804ab).html
;
http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553325
► Optimisation is one of the most important and challenging part of any engineering design. In real world design problems one faces multiobjective optimisation under constraints.…
(more)
▼ Optimisation is one of the most important and challenging part of any engineering design. In real world design problems one faces multiobjective optimisation under constraints. The optimal solution in these cases is not unique because the objectives can contradict each other. In such cases, a set of optimal solutions which forms a Pareto frontier in the objective space is considered. There are many algorithms to generate the Pareto frontier. However, only a few of them are potentially capable of providing an evenly distributed set of the solutions. Such a property is especially important in real-life design because a decision maker is usually able to analyse only a very limited quantity of solutions. This thesis consists of two main parts. At first, it develops and gives the detailed description of two different algorithms that are able to generate an evenly distributed Pareto set in a general formulation. One is a classical approach and called Directed Search Domain (DSD) and the other, the cylindrical constraint evolutionary algorithm (CCEA), is a hybrid population based method. The efficiency of the algorithms are demonstrated by a number of challenging test cases and the comparisons with the results of the other existing methods. It is shown that the proposed methods are successful in generating the Pareto solutions even when some existing methods fail. In real world design problems, deterministic approaches cannot provide a reliable solution as in the event of uncertainty, deterministic optimal solution would be infeasible in many instances. Therefore a solution less sensitive to problem perturbation is desirable. This leads to the robust solution which is the focus of the second part of the thesis. In the literature, there are some techniques tailored for robust optimisation. However, most of them are either computationally expensive or do not systematically articulate the designer preferences into a robust solution. In this thesis, by introducing a measure for robustness in multiobjective context, a tunable robust function (TRF) is presented. Including the TRF in the problem formulation, it is demonstrated that the desirable robust solution based on designer preferences can be obtained. This not only provides the robust solution but also gives a control over the robustness level. The method is efficient as it only increases the dimension of the problem by one irrespective of the dimension of the original problem.
Subjects/Keywords: 620.0042; Directed Search Domain; Multiobjective optimization; Robust design; Uncertainty analysis; Evolutionary algorithm; DSD
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Erfani, T. (2011). An efficient analysis of pareto optimal solutions in multidisciplinary design. (Doctoral Dissertation). University of Manchester. Retrieved from https://www.research.manchester.ac.uk/portal/en/theses/an-efficient-analysis-of-pareto-optimal-solutions-in-multidisciplinary-design(9bcf3c8f-4922-48a7-a829-1efce3d804ab).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553325
Chicago Manual of Style (16th Edition):
Erfani, Tohid. “An efficient analysis of pareto optimal solutions in multidisciplinary design.” 2011. Doctoral Dissertation, University of Manchester. Accessed April 10, 2021.
https://www.research.manchester.ac.uk/portal/en/theses/an-efficient-analysis-of-pareto-optimal-solutions-in-multidisciplinary-design(9bcf3c8f-4922-48a7-a829-1efce3d804ab).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553325.
MLA Handbook (7th Edition):
Erfani, Tohid. “An efficient analysis of pareto optimal solutions in multidisciplinary design.” 2011. Web. 10 Apr 2021.
Vancouver:
Erfani T. An efficient analysis of pareto optimal solutions in multidisciplinary design. [Internet] [Doctoral dissertation]. University of Manchester; 2011. [cited 2021 Apr 10].
Available from: https://www.research.manchester.ac.uk/portal/en/theses/an-efficient-analysis-of-pareto-optimal-solutions-in-multidisciplinary-design(9bcf3c8f-4922-48a7-a829-1efce3d804ab).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553325.
Council of Science Editors:
Erfani T. An efficient analysis of pareto optimal solutions in multidisciplinary design. [Doctoral Dissertation]. University of Manchester; 2011. Available from: https://www.research.manchester.ac.uk/portal/en/theses/an-efficient-analysis-of-pareto-optimal-solutions-in-multidisciplinary-design(9bcf3c8f-4922-48a7-a829-1efce3d804ab).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553325

Delft University of Technology
21.
Van der Linde, T.M. (author).
Fast topology optimization for transient mechanical problems.
Degree: 2016, Delft University of Technology
URL: http://resolver.tudelft.nl/uuid:2aa17c56-66a2-41c8-95fc-a1af50dc52dd
► Topology optimization is increasingly used as a design tool in engineering. Within structural mechanics, most applications focus on statics. An extension to time-domain (transient) dynamics…
(more)
▼ Topology optimization is increasingly used as a design tool in engineering. Within structural mechanics, most applications focus on statics. An extension to time-domain (transient) dynamics will have many useful applications, but this is currently hindered by high computational costs. The goal of this research is to reduce these costs by applying model order reduction. In model order reduction, the full coordinates of a system are approximated by a much smaller number of reduced coordinates and associated basis vectors. A few options for these vectors will be discussed. It is shown that using load-based methods results in high accuracy, especially the Ritz vector method. In the total optimization this leads to significant reduction of both CPU-time and memory requirements.
Engineering Mechanics
Precision and Microsystems Engineering
Mechanical, Maritime and Materials Engineering
Advisors/Committee Members: Langelaar, M. (mentor).
Subjects/Keywords: topology optimization; time-domain dynamics; transient dynamics; model order reduction; Ritz vectors
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Van der Linde, T. M. (. (2016). Fast topology optimization for transient mechanical problems. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:2aa17c56-66a2-41c8-95fc-a1af50dc52dd
Chicago Manual of Style (16th Edition):
Van der Linde, T M (author). “Fast topology optimization for transient mechanical problems.” 2016. Masters Thesis, Delft University of Technology. Accessed April 10, 2021.
http://resolver.tudelft.nl/uuid:2aa17c56-66a2-41c8-95fc-a1af50dc52dd.
MLA Handbook (7th Edition):
Van der Linde, T M (author). “Fast topology optimization for transient mechanical problems.” 2016. Web. 10 Apr 2021.
Vancouver:
Van der Linde TM(. Fast topology optimization for transient mechanical problems. [Internet] [Masters thesis]. Delft University of Technology; 2016. [cited 2021 Apr 10].
Available from: http://resolver.tudelft.nl/uuid:2aa17c56-66a2-41c8-95fc-a1af50dc52dd.
Council of Science Editors:
Van der Linde TM(. Fast topology optimization for transient mechanical problems. [Masters Thesis]. Delft University of Technology; 2016. Available from: http://resolver.tudelft.nl/uuid:2aa17c56-66a2-41c8-95fc-a1af50dc52dd
22.
Khalilov, Eldar.
ClaferMPS: Modeling and Optimizing Automotive Electric/Electronic Architectures Using Domain-Specific Languages.
Degree: 2017, University of Waterloo
URL: http://hdl.handle.net/10012/11249
► Modern automotive electric/electronic (E/E) architectures are growing to the point where architects can no longer manually predict the effects of their design decisions. Thus, in…
(more)
▼ Modern automotive electric/electronic (E/E) architectures are growing to the point where architects can no longer manually predict the effects of their design decisions. Thus, in addition to applying an architecture reference model to decompose their architectures, they also require tools for synthesizing and evaluating candidate architectures during the design process. Clafer is a modeling language, which has been used to model variable multi-layer, multi-perspective automotive system architectures according to an architecture reference model. Clafer tools allow architects to synthesize optimal candidates and evaluate effects of their design decisions. However, since Clafer is a general-purpose structural modeling language, it does not help the architects in building models conforming to the given architecture reference model. In this work, we present ClaferMPS, a set of extensible languages and IDE for modeling E/E architectures using Clafer. First, we present an E/E architecture domain-specific language (DSL) built on top of Clafer, which embodies the reference model and which guides the architects in correctly applying the reference model. We then evaluate the DSL and its implementation by modeling two existing automotive systems, which were originally modeled in plain Clafer. The evaluation showed that by using the DSL, an evaluator obtained correct models by construction because the DSL helped prevent typical errors that are easy to make in plain Clafer. The evaluator was also able to synthesize and evaluate candidate architectures as with plain Clafer. Finally, we demonstrate extensibility capabilities of ClaferMPS. Our implementation is built on top of the JetBrains Meta Programming System, which supports language modularization and composition, multi-stage transformations and projectional editing. As a result, ClaferMPS allows third parties to seamlessly add extensions to both Clafer and the E/E architecture DSL without invasive changes. To illustrate this approach, we consider the Robot Operating System (ROS) communications infrastructure, a case study, which is outside the scope of the existing reference model. We show how the E/E architecture DSL can be adapted to the new domain using MPS language modularization and composition.
Subjects/Keywords: architecture; modeling; optimization; synthesis; language engineering; domain-specific language; DSL; MPS; Meta-Programming System
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Khalilov, E. (2017). ClaferMPS: Modeling and Optimizing Automotive Electric/Electronic Architectures Using Domain-Specific Languages. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/11249
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Khalilov, Eldar. “ClaferMPS: Modeling and Optimizing Automotive Electric/Electronic Architectures Using Domain-Specific Languages.” 2017. Thesis, University of Waterloo. Accessed April 10, 2021.
http://hdl.handle.net/10012/11249.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Khalilov, Eldar. “ClaferMPS: Modeling and Optimizing Automotive Electric/Electronic Architectures Using Domain-Specific Languages.” 2017. Web. 10 Apr 2021.
Vancouver:
Khalilov E. ClaferMPS: Modeling and Optimizing Automotive Electric/Electronic Architectures Using Domain-Specific Languages. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/10012/11249.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Khalilov E. ClaferMPS: Modeling and Optimizing Automotive Electric/Electronic Architectures Using Domain-Specific Languages. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/11249
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Kent State University
23.
Alqarni, Mohammed Zaidi A.
PRECONDITIONERS FOR PDE-CONSTRAINED OPTIMIZATION
PROBLEMS.
Degree: PhD, College of Arts and Sciences / Department of
Mathematical Science, 2019, Kent State University
URL: http://rave.ohiolink.edu/etdc/view?acc_num=kent1573148003180191
► Finding the solution for PDE-Constrained Optimization Problems can be accomplished in two ways: optimize-then-discretize and discretize-then-optimize. Both techniques lead to either a linear or non-linear…
(more)
▼ Finding the solution for PDE-Constrained
Optimization
Problems can be accomplished in two ways: optimize-then-discretize
and discretize-then-optimize. Both techniques lead to either a
linear or non-linear system of equations. To obtain the optimal
solution (to solve the system of equations), it's more practical to
use numerical methods than analytical ones. Numerical methods can
be direct or iterative. Generally, direct solvers tend to be more
costly than iterative ones in terms of memory utilization and
computational time. Moreover, they are less flexible in taking
advantage of multiple processors in parallel computers than
iterative methods. Preconditioners are essential for the
performance of iterative methods. They are beneficial in
diminishing the overall computational time as a reduction in
iteration counts and ideally their computing cost. Over the past
few decades, a stack of preconditioners has been developed. Here,
we propose preconditioners that reduce both the number of
iterations and the computational time for a specific type of
PDE-Constrained
Optimization problems, that is optimal control
problems. Subsequently, for the sake of clarity, we apply those
preconditioners to these problems.
Advisors/Committee Members: Li, Jing (Advisor).
Subjects/Keywords: Applied Mathematics; Mathematics; PRECONDITIONERS; PDE-CONSTRAINED OPTIMIZATION PROBLEMS; PDE; OVERLAPPING SCHWARZ; DOMAIN DECOMPOSITION; FEM
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Alqarni, M. Z. A. (2019). PRECONDITIONERS FOR PDE-CONSTRAINED OPTIMIZATION
PROBLEMS. (Doctoral Dissertation). Kent State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=kent1573148003180191
Chicago Manual of Style (16th Edition):
Alqarni, Mohammed Zaidi A. “PRECONDITIONERS FOR PDE-CONSTRAINED OPTIMIZATION
PROBLEMS.” 2019. Doctoral Dissertation, Kent State University. Accessed April 10, 2021.
http://rave.ohiolink.edu/etdc/view?acc_num=kent1573148003180191.
MLA Handbook (7th Edition):
Alqarni, Mohammed Zaidi A. “PRECONDITIONERS FOR PDE-CONSTRAINED OPTIMIZATION
PROBLEMS.” 2019. Web. 10 Apr 2021.
Vancouver:
Alqarni MZA. PRECONDITIONERS FOR PDE-CONSTRAINED OPTIMIZATION
PROBLEMS. [Internet] [Doctoral dissertation]. Kent State University; 2019. [cited 2021 Apr 10].
Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1573148003180191.
Council of Science Editors:
Alqarni MZA. PRECONDITIONERS FOR PDE-CONSTRAINED OPTIMIZATION
PROBLEMS. [Doctoral Dissertation]. Kent State University; 2019. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1573148003180191

Virginia Tech
24.
Xue, Weicheng.
CPU/GPU Code Acceleration on Heterogeneous Systems and Code Verification for CFD Applications.
Degree: PhD, Aerospace Engineering, 2021, Virginia Tech
URL: http://hdl.handle.net/10919/102073
► Computational Fluid Dynamics (CFD) is a numerical method to solve fluid problems, which usually requires a large amount of computations. A large CFD problem can…
(more)
▼ Computational Fluid Dynamics (CFD) is a numerical method to solve fluid problems, which usually requires a large amount of computations. A large CFD problem can be decomposed into smaller sub-problems which are stored in discrete memory locations and accelerated by a large number of compute units. In addition to code acceleration, it is important to ensure that the code and algorithm are implemented correctly, which is called code verification. This dissertation focuses on the CFD code acceleration as well as the code verification for turbulence model implementation. In this dissertation, multiple Graphic Processing Units (GPUs) are utilized to accelerate two CFD codes, considering that the GPU has high computational power and high memory bandwidth. A variety of optimizations are developed and applied to improve the performance of CFD codes on different parallel computing systems. The program execution time can be reduced significantly especially when multiple GPUs are used. In addition, code-to-code comparisons with some NASA CFD codes and the method of manufactured solutions are utilized to verify the correctness of a research CFD code.
Advisors/Committee Members: Roy, Christopher John (committeechair), Wang, Kevin Guanyuan (committee member), De Sturler, Eric (committee member), Srinivasan, Bhuvana (committee member).
Subjects/Keywords: GPU; OpenACC; MPI; Domain Decomposition; Performance Optimization; GPUDirect; Code Verification; OOA; Discretization Error
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Xue, W. (2021). CPU/GPU Code Acceleration on Heterogeneous Systems and Code Verification for CFD Applications. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/102073
Chicago Manual of Style (16th Edition):
Xue, Weicheng. “CPU/GPU Code Acceleration on Heterogeneous Systems and Code Verification for CFD Applications.” 2021. Doctoral Dissertation, Virginia Tech. Accessed April 10, 2021.
http://hdl.handle.net/10919/102073.
MLA Handbook (7th Edition):
Xue, Weicheng. “CPU/GPU Code Acceleration on Heterogeneous Systems and Code Verification for CFD Applications.” 2021. Web. 10 Apr 2021.
Vancouver:
Xue W. CPU/GPU Code Acceleration on Heterogeneous Systems and Code Verification for CFD Applications. [Internet] [Doctoral dissertation]. Virginia Tech; 2021. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/10919/102073.
Council of Science Editors:
Xue W. CPU/GPU Code Acceleration on Heterogeneous Systems and Code Verification for CFD Applications. [Doctoral Dissertation]. Virginia Tech; 2021. Available from: http://hdl.handle.net/10919/102073
25.
Drehmer, Luis Roberto Centeno.
Otimização de parâmetros concentrados de suspensão para conforto e segurança veicular.
Degree: 2012, Brazil
URL: http://hdl.handle.net/10183/61012
► O presente trabalho avalia a otimização de parâmetros concentrados de suspensão em veículos e considera a importância deste processo para minimizar a aceleração vertical rms…
(more)
▼ O presente trabalho avalia a otimização de parâmetros concentrados de suspensão em veículos e considera a importância deste processo para minimizar a aceleração vertical rms transmitida para garantir conforto e segurança ao motorista. Dessa forma, o trabalho objetiva desenvolver uma modelagem capaz de representar o veículo completo para então otimizar os parâmetros de rigidez e amortecimento no domínio da frequência e identificar, em torno do ponto ótimo, quais desses parâmetros mais influenciam nessa minimização. Para atingir esses objetivos, dois modelos veiculares (com dois e oito graus de liberdade respectivamente) são propostos conforme as orientações das normas BS 6841 (1987), ISO 8608 (1995) e ISO 2631 (1997). Os modelos são analisados linearmente e otimizados por um algoritmo heurístico de enxame de partículas. Finalmente, os resultados de rigidez e amortecimento da suspensão são obtidos e reduzem em até 35,3% a aceleração vertical rms
transmitida ao motorista. Por meio de uma análise de sensibilidade, as variáveis de projeto que mais contribuem para essa redução são identificadas.
The present work evaluates the optimization of lumped parameters of suspension on vehicles and considers the importance of this process to minimize the rms vertical acceleration transmitted to ensure comfort and safety to the driver. Thus, this work aims to develop a model able to represent the whole vehicle and, then, optimize the parameters of stiffness and damping in the frequency domain and identify, around the optimal point, those parameters which most influence in this minimization. To achieve these goals, two vehicle models (with two and eight degrees of freedom respectively) are proposed according to the guidelines of the standards BS 6841 (1987), ISO 8608 (1995) and ISO 2631 (1997). The models are linearly analyzed and optimized by a heuristic algorithm of particle swarm. Finally, the results of stiffness and damping of
suspension are obtained and reduces up to 35,3% of rms vertical acceleration transmitted to the driver. Through a sensitivity analysis, the design variables that most contribute to this reduction are identified.
Advisors/Committee Members: Gomes, Herbert Martins, Casas, Walter Jesus Paucar.
Subjects/Keywords: Otimização matemática; Motoristas; Veículos; Vibração; Vehicle model; Frequency domain; Comfort; Safety; Particle swarm optimization
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Drehmer, L. R. C. (2012). Otimização de parâmetros concentrados de suspensão para conforto e segurança veicular. (Masters Thesis). Brazil. Retrieved from http://hdl.handle.net/10183/61012
Chicago Manual of Style (16th Edition):
Drehmer, Luis Roberto Centeno. “Otimização de parâmetros concentrados de suspensão para conforto e segurança veicular.” 2012. Masters Thesis, Brazil. Accessed April 10, 2021.
http://hdl.handle.net/10183/61012.
MLA Handbook (7th Edition):
Drehmer, Luis Roberto Centeno. “Otimização de parâmetros concentrados de suspensão para conforto e segurança veicular.” 2012. Web. 10 Apr 2021.
Vancouver:
Drehmer LRC. Otimização de parâmetros concentrados de suspensão para conforto e segurança veicular. [Internet] [Masters thesis]. Brazil; 2012. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/10183/61012.
Council of Science Editors:
Drehmer LRC. Otimização de parâmetros concentrados de suspensão para conforto e segurança veicular. [Masters Thesis]. Brazil; 2012. Available from: http://hdl.handle.net/10183/61012
26.
Seppälä, Eira.
Ground State Structure, Domain Walls, and External Field Response in Random Magnets.
Degree: 2001, Helsinki University of Technology
URL: http://lib.tkk.fi/Diss/2001/isbn951225459X/
► The ground state structure and domain walls in Ising-like magnets with quenched randomness are studied at zero temperature. The methods employed are exact ground state…
(more)
▼ The ground state structure and domain walls in Ising-like magnets with quenched randomness are studied at zero temperature. The methods employed are exact ground state calculations using graph-theoretical optimization and extreme statistics arguments. The elastic manifolds, i.e., domain walls, with random-bond disorder are investigated with two different types of periodicity. The first type of periodicity is when the randomness is periodically repeated. It is shown to lead after a cross-over to the periodic elastic media universality class, whenever the period lambda is finite. The second periodicity is due to an additional modulating potential. There are two types of intermittence seen before the asymptotic random-bond roughness behavior is reached. The first type is when the manifolds jump between the minima of the periodic potential and the second type is when the interfaces roughen over pinning energy barriers. An external field is applied to the random manifolds. An energy minimization argument based on the glassy energy landscape indicates that in an equilibrium system the manifolds move by sharp jumps between nearly degenerate energy minima in analogy to a first-order transition. A mean field argument for the finite-size scaling of the first jump field is derived and numerically confirmed. Using extreme statistics and probabilistic arguments, the probability distribution of the first jump field and its finite size scaling are calculated. Based on these the susceptibility of the manifolds is derived. Random field magnets are studied in two dimensions. The break-up of long-range order is shown to have a first-order character. The domain wall behavior is studied, leading to an interface scaling with a roughness exponent greater than unity below the break-up length scale. The domain wall energy is demonstrated to vanish logarithmically confirming the destruction of the long-range order. The magnetization and susceptibility versus the external field are investigated, and they show continuous behaviors and are independent of the break-up length scale. However, another long-range order, percolation, is found in two-dimensional random field magnets. The percolation transition with respect to the external field belongs to the standard short-range correlated two-dimensional percolation universality class. The whole phase diagram for percolation as a function of the random field strength and the external field is predicted.
Dissertations / Laboratory of Physics, Helsinki University of Technology, ISSN 1455-1802; 112
Advisors/Committee Members: Helsinki University of Technology, Department of Engineering Physics and Mathematics, Laboratory of Physics.
Subjects/Keywords: quenched randomness; Ising model; domain walls; optimization; percolation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Seppälä, E. (2001). Ground State Structure, Domain Walls, and External Field Response in Random Magnets. (Thesis). Helsinki University of Technology. Retrieved from http://lib.tkk.fi/Diss/2001/isbn951225459X/
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Seppälä, Eira. “Ground State Structure, Domain Walls, and External Field Response in Random Magnets.” 2001. Thesis, Helsinki University of Technology. Accessed April 10, 2021.
http://lib.tkk.fi/Diss/2001/isbn951225459X/.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Seppälä, Eira. “Ground State Structure, Domain Walls, and External Field Response in Random Magnets.” 2001. Web. 10 Apr 2021.
Vancouver:
Seppälä E. Ground State Structure, Domain Walls, and External Field Response in Random Magnets. [Internet] [Thesis]. Helsinki University of Technology; 2001. [cited 2021 Apr 10].
Available from: http://lib.tkk.fi/Diss/2001/isbn951225459X/.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Seppälä E. Ground State Structure, Domain Walls, and External Field Response in Random Magnets. [Thesis]. Helsinki University of Technology; 2001. Available from: http://lib.tkk.fi/Diss/2001/isbn951225459X/
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign
27.
Zhang, Kedi.
Advanced finite-element techniques for simulation of composite materials and large-scale scattering problems.
Degree: PhD, Electrical & Computer Engr, 2018, University of Illinois – Urbana-Champaign
URL: http://hdl.handle.net/2142/101108
► This dissertation aims at developing sophisticated finite-element based numerical algorithms for efficient electromagnetic modeling and design of composite materials, fast frequency-domain scattering analysis of electrically…
(more)
▼ This dissertation aims at developing sophisticated finite-element based numerical algorithms for efficient electromagnetic modeling and design of composite materials, fast frequency-
domain scattering analysis of electrically large problems on massive parallelized computers, and efficient broadband analysis of resonant waveguide structures. To these ends, first, an interface-enriched generalized finite-element method (IGFEM) is introduced for electromagnetic analysis of heterogeneous materials. To avoid using conformal meshes, the method assigns generalized degrees of freedom at material interfaces to capture the discontinuities of the field and its derivatives, and maintains the same level of solution accuracy and computational complexity as the standard FEM based on conformal meshes. The fixed mesh nature combined with an analytical sensitivity analysis significantly reduces the computational cost in gradient-based shape
optimization. Second, an efficient parallelization strategy is proposed for the
domain decomposition based dual-primal finite-element tearing and interconnecting (FETI-DP) algorithm. Load balancing, global, neighboring, inter-processor communication minimization, and preconditioning techniques are adopted to improve the computational and parallel efficiency. An inhomogeneous truncation boundary condition is presented to enable the FETI-DP simulation of a stratified medium. The parallel FETI-DP algorithm is also combined with a fast near- to far-field transformation and a linear interpolation technique for efficient vectorial field imaging of electrically large objects. Finally, a hybrid technique that consists of the time- and frequency-
domain computations and model-order reduction strategy is developed for the efficient simulations of resonant waveguide structures. Numerous results are presented to demonstrate the accuracy, efficiency, and capability of the proposed methods.
Advisors/Committee Members: Jin, Jianming (advisor), Jin, Jianming (Committee Chair), Geubelle, Philippe H. (committee member), Goddard, Lynford L. (committee member), Gong, Songbin (committee member), Schutt-Aine, Jose E. (committee member).
Subjects/Keywords: computational electromagnetics; generalized finite element method; domain decomposition method; hybrid method; parallel computing; radar cross-section; shape optimization; large-scale simulation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Zhang, K. (2018). Advanced finite-element techniques for simulation of composite materials and large-scale scattering problems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/101108
Chicago Manual of Style (16th Edition):
Zhang, Kedi. “Advanced finite-element techniques for simulation of composite materials and large-scale scattering problems.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 10, 2021.
http://hdl.handle.net/2142/101108.
MLA Handbook (7th Edition):
Zhang, Kedi. “Advanced finite-element techniques for simulation of composite materials and large-scale scattering problems.” 2018. Web. 10 Apr 2021.
Vancouver:
Zhang K. Advanced finite-element techniques for simulation of composite materials and large-scale scattering problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/2142/101108.
Council of Science Editors:
Zhang K. Advanced finite-element techniques for simulation of composite materials and large-scale scattering problems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/101108

Queens University
28.
Li, Dan.
Benders Decomposition-based Global Optimization for Natural Gas and Power Flow Systems
.
Degree: Chemical Engineering, 2016, Queens University
URL: http://hdl.handle.net/1974/14316
► Mixed-integer nonlinear programming (MINLP) framework has been attracting more and more attention since late last century. It can be applied to address various process systems…
(more)
▼ Mixed-integer nonlinear programming (MINLP) framework has been attracting more and more attention since late last century. It can be applied to address various process systems engineering problems, such as process design and operation, large-scale system scheduling, and supply chain management [19,42]. As a class of the many such problems, integrated design and operation of large-scale energy system is to determine both the network design decisions and the flows in operation to achieve the best expected profit, while meeting the customer demands and product specifications. It is well known that these integrated design and operation problems are nonconvex MINLPs, and therefore inherently difficult for which classical gradient-based optimization methods cannot guarantee an optimal solution. Decomposition-based methods have been used to achieve global optimal solutions for nonconvex MINLPs. One of the popular decomposition-based optimization methods is Benders decomposition. Its extensions, generalized Benders decomposition (GBD) [16] and nonconvex generalized Benders decomposition (NGBD) [27], can guarantee the convergence to a global optimum with mild assumptions.
In this thesis, our primary goal is to incorporate domain reduction into Benders decomposition-based global optimization methods for a class of large-scale energy systems that are MINLP problems with separable structure, which not only ensures a global optimum but also converges faster than the standard Benders decomposition-based methods and commercial global optimization solvers. The research objective is twofold. One is how to reduce the search domain and feasible region with a minimum amount of computation; to achieve this, the domain reduction methods based on convex nonlinear programming (NLP) relaxations [37] are extended to Benders decomposition-based methods. The other is customization of decomposition-based methods for large-scale energy systems; to demonstrate this, an integrated design and operation of natural gas production network problem that addresses gas flows, pressures and uncertainties is proposed with multi-loop NGBD, a customized Benders decomposition-based method that is faster than the regular method by at least an order of magnitude.
Subjects/Keywords: Global Optimization
;
MINLP
;
Domain Reduction
;
Chemical Engineering
;
Natural Gas Systems
;
Pressure Flow Relation
;
Benders Decomposition
;
Large-scale Systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Li, D. (2016). Benders Decomposition-based Global Optimization for Natural Gas and Power Flow Systems
. (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/14316
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Li, Dan. “Benders Decomposition-based Global Optimization for Natural Gas and Power Flow Systems
.” 2016. Thesis, Queens University. Accessed April 10, 2021.
http://hdl.handle.net/1974/14316.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Li, Dan. “Benders Decomposition-based Global Optimization for Natural Gas and Power Flow Systems
.” 2016. Web. 10 Apr 2021.
Vancouver:
Li D. Benders Decomposition-based Global Optimization for Natural Gas and Power Flow Systems
. [Internet] [Thesis]. Queens University; 2016. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/1974/14316.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Li D. Benders Decomposition-based Global Optimization for Natural Gas and Power Flow Systems
. [Thesis]. Queens University; 2016. Available from: http://hdl.handle.net/1974/14316
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Purdue University
29.
Chung, Haejun.
Time Domain Simulation of Novel Photovoltaic Materials.
Degree: MSECE, Electrical and Computer Engineering, 2013, Purdue University
URL: http://docs.lib.purdue.edu/open_access_theses/22
► Thin-film silicon-based solar cells have operated far from the Shockley- Queisser limit in all experiments to date. Novel light-trapping structures, however, may help address…
(more)
▼ Thin-film silicon-based solar cells have operated far from the Shockley- Queisser limit in all experiments to date. Novel light-trapping structures, however, may help address this limitation. Finite-difference time
domain simulation methods offer the potential to accurately determine the light-trapping potential of arbitrary dielectric structures, but suffer from materials modeling problems. In this thesis, existing dispersion models for novel photovoltaic materials will be reviewed, and a novel dispersion model, known as the quadratic complex rational function (QCRF), will be proposed. It has the advantage of accurately fitting experimental semiconductor dielectric values over a wide bandwidth in a numerically stable fashion. Applying the proposed dispersion model, a statistically correlated surface texturing method will be suggested, and light absorption rates of it will be explained. In future work, these designs will be combined with other structures and optimized to help guide future experiments.
Advisors/Committee Members: Peter A. Bermel, David B. Janes, Muhammad A. Alam.
Subjects/Keywords: Amorphous Silicon; Dispersion Modeling; FDTD; Optimization; Photovoltaic; Time Domain Simulation; Electrical and Electronics; Electromagnetics and Photonics
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chung, H. (2013). Time Domain Simulation of Novel Photovoltaic Materials. (Thesis). Purdue University. Retrieved from http://docs.lib.purdue.edu/open_access_theses/22
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Chung, Haejun. “Time Domain Simulation of Novel Photovoltaic Materials.” 2013. Thesis, Purdue University. Accessed April 10, 2021.
http://docs.lib.purdue.edu/open_access_theses/22.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Chung, Haejun. “Time Domain Simulation of Novel Photovoltaic Materials.” 2013. Web. 10 Apr 2021.
Vancouver:
Chung H. Time Domain Simulation of Novel Photovoltaic Materials. [Internet] [Thesis]. Purdue University; 2013. [cited 2021 Apr 10].
Available from: http://docs.lib.purdue.edu/open_access_theses/22.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Chung H. Time Domain Simulation of Novel Photovoltaic Materials. [Thesis]. Purdue University; 2013. Available from: http://docs.lib.purdue.edu/open_access_theses/22
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin
30.
-6232-4946.
Data-scalable Hessian preconditioning for distributed parameter PDE-constrained inverse problems.
Degree: PhD, Computational Science, Engineering, and Mathematics, 2019, University of Texas – Austin
URL: http://dx.doi.org/10.26153/tsw/2663
► Hessian preconditioners are the key to efficient numerical solution of large-scale distributed parameter PDE-constrained inverse problems with highly informative data. Such inverse problems arise in…
(more)
▼ Hessian preconditioners are the key to efficient numerical solution of large-scale distributed parameter PDE-constrained inverse problems with highly informative data. Such inverse problems arise in many applications, yet solving them remains computationally costly. With existing methods, the computational cost depends on spectral properties of the Hessian which worsen as more informative data are used to reconstruct the unknown parameter field. The best case scenario from a scientific standpoint (lots of high-quality data) is therefore the worst case scenario from a computational standpoint (large computational cost).
In this dissertation, we argue that the best way to overcome this predicament is to build data-scalable Hessian/KKT preconditioners – preconditioners that perform well even if the data are highly informative about the parameter. We present a novel data-scalable KKT preconditioner for a diffusion inverse problem, a novel data-scalable Hessian preconditioner for an advection inverse problem, and a novel data-scalable
domain decomposition preconditioner for an auxiliary operator that arises in connection with KKT preconditioning for a wave inverse problem. Our novel preconditioners outperform existing preconditioners in all three cases: they are robust to large numbers of observations in the diffusion inverse problem, large Peclet numbers in the advection inverse problem, and high wave frequencies in the wave inverse problem.
Advisors/Committee Members: Ghattas, Omar N. (advisor), Bui-Thanh, Tan (advisor), Biros, George (committee member), Dhillon, Inderjit (committee member), Fomel, Sergey (committee member), Oden, John T (committee member).
Subjects/Keywords: Inverse problems; Hessian; KKT matrix; Preconditioning; Data scalability; Numerical optimization; Augmented Lagrangian; Product-convolution; Domain decomposition; Hierarchical matrix
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-6232-4946. (2019). Data-scalable Hessian preconditioning for distributed parameter PDE-constrained inverse problems. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://dx.doi.org/10.26153/tsw/2663
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-6232-4946. “Data-scalable Hessian preconditioning for distributed parameter PDE-constrained inverse problems.” 2019. Doctoral Dissertation, University of Texas – Austin. Accessed April 10, 2021.
http://dx.doi.org/10.26153/tsw/2663.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-6232-4946. “Data-scalable Hessian preconditioning for distributed parameter PDE-constrained inverse problems.” 2019. Web. 10 Apr 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-6232-4946. Data-scalable Hessian preconditioning for distributed parameter PDE-constrained inverse problems. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2019. [cited 2021 Apr 10].
Available from: http://dx.doi.org/10.26153/tsw/2663.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-6232-4946. Data-scalable Hessian preconditioning for distributed parameter PDE-constrained inverse problems. [Doctoral Dissertation]. University of Texas – Austin; 2019. Available from: http://dx.doi.org/10.26153/tsw/2663
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
◁ [1] [2] [3] ▶
.