[
    {
        "id": "thesis:5944",
        "collection": "thesis",
        "collection_id": "5944",
        "cite_using_url": "https://resolver.caltech.edu/CaltechTHESIS:06092010-140839602",
        "primary_object_url": {
            "basename": "main.pdf",
            "content": "final",
            "filesize": 39636782,
            "license": "other",
            "mime_type": "application/pdf",
            "url": "/5944/1/main.pdf",
            "version": "v4.0.0"
        },
        "type": "thesis",
        "title": "Neuro-Evolution Using Recombinational Algorithms and Embryogenesis for Robotic Control",
        "author": [
            {
                "family_name": "Roy",
                "given_name": "Anthony Mathew",
                "clpid": "Roy-Anthony-Mathew"
            }
        ],
        "thesis_advisor": [
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "clpid": "Antonsson-E-K"
            },
            {
                "family_name": "Shapiro",
                "given_name": "Andrew A.",
                "clpid": "Shapiro-A-A"
            },
            {
                "family_name": "Burdick",
                "given_name": "Joel Wakeman",
                "clpid": "Burdick-J-W"
            }
        ],
        "thesis_committee": [
            {
                "family_name": "Burdick",
                "given_name": "Joel Wakeman",
                "clpid": "Burdick-J-W"
            },
            {
                "family_name": "Abu-Mostafa",
                "given_name": "Yaser S.",
                "clpid": "Abu-Mostafa-Y-S"
            },
            {
                "family_name": "Daraio",
                "given_name": "Chiara",
                "clpid": "Daraio-C"
            },
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "clpid": "Antonsson-E-K"
            },
            {
                "family_name": "Shapiro",
                "given_name": "Andrew A.",
                "clpid": "Shapiro-A-A"
            }
        ],
        "local_group": [
            {
                "literal": "div_eng"
            }
        ],
        "abstract": "Control tasks involving dramatic nonlinearities, such as decision making, can be challenging for classical design methods. However, autonomous, stochastic design methods such as evolutionary computation have proved effective. In particular, genetic algorithms that create designs via the application of recombinational rules are robust and highly scalable. Neuro-Evolution Using Recombinational Algorithms and Embryogenesis (NEURAE) is a genetic algorithm that creates C++ programs that in turn create neural networks which can function as logic gates. The neural networks created are scalable and robust enough to feature redundancies that allow the network to function despite internal failures. An analysis of NEURAE evinces how biologically inspired phenomena apply to simulated evolution. This allows for an optimization of NEURAE that enables it to create controllers for a simulated swarm of Khepera-inspired robots.",
        "doi": "10.7907/YNED-VN66",
        "publication_date": "2010",
        "thesis_type": "phd",
        "thesis_year": "2010"
    },
    {
        "id": "thesis:208",
        "collection": "thesis",
        "collection_id": "208",
        "cite_using_url": "https://resolver.caltech.edu/CaltechETD:etd-01162009-072031",
        "primary_object_url": {
            "basename": "yogev2008.pdf",
            "content": "final",
            "filesize": 14831508,
            "license": "other",
            "mime_type": "application/pdf",
            "url": "/208/1/yogev2008.pdf",
            "version": "v2.0.0"
        },
        "type": "thesis",
        "title": "Computational Evolutionary Embryogeny",
        "author": [
            {
                "family_name": "Yogev",
                "given_name": "Or",
                "clpid": "Yogev-Or"
            }
        ],
        "thesis_advisor": [
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "clpid": "Antonsson-E-K"
            },
            {
                "family_name": "Shapiro",
                "given_name": "Andrew A.",
                "clpid": "Shapiro-A-A"
            }
        ],
        "thesis_committee": [
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "clpid": "Antonsson-E-K"
            },
            {
                "family_name": "Shapiro",
                "given_name": "Andrew A.",
                "clpid": "Shapiro-A-A"
            },
            {
                "family_name": "Daraio",
                "given_name": "Chiara",
                "clpid": "Daraio-C"
            },
            {
                "family_name": "Ravichandran",
                "given_name": "Guruswami",
                "clpid": "Ravichandran-G"
            }
        ],
        "local_group": [
            {
                "literal": "div_eng"
            }
        ],
        "abstract": "<p>Evolution and development (Evo-Devo), are the two main processes which produce all of the different kinds of phenotypes we see in nature. Evolutionary process is responsible for eliminating the genetic information of weak phenotypes through natural selection, and also for exploring novel genotypes through genetic operations; crossover, mutation. The development process is the process of using the set of rules (codons) written in a genome, to turn a single set (zygote) into a mature phenotype. In this thesis, evolutionary and developmental processes are used to evolve the configurations of three-dimensional structures in silico to achieve desired performances. Although natural systems utilize the combination of both evolution and development processes to produce remarkable performance and diversity, this approach has not yet been applied extensively to the design of continuous three-dimensional load-supporting structures. Beginning with a single artificial cell containing information analogous to a DNA sequence, a structure is grown according to the rules encoded in the sequence. Each artificial cell in the structure contains the same sequence of growth and development rules, and each artificial cell is an element in a finite element mesh representing the structure of the mature individual. Rule sequences are evolved over many generations through selection and survival of individuals in a population.</p>\r\n\r\n<p>Modularity and symmetry are visible in nearly every natural and engineered structure. Understanding of the evolution and expression of symmetry and modularity is emerging from recent biological research. Initial evidence of these attributes is present in the phenotypes that are developed from the artificial evolution, although neither characteristic is imposed nor selected for directly.</p>\r\n\r\n<p>The computational evolutionary development approach presented here shows promise for synthesizing novel configurations of high-performance systems. The approach may advance system design to a new paradigm, where current design strategies have difficulty producing useful solutions. In addition to a new design approach perse, this model gives us the ability to explore the development process, from the standpoint of complex systems analysis. The phenotypes in our system have been grown under a highly stochastic environment, which serves as a triggered mechanism for gene expression. Still, evolution was able to find solutions which are robust to these stochastic elements, both at the phenotype level (the phenotype ability to function under the environment) and the growth process itself. In addition we have also explored the effects of symmetric and nonsymmetric environment over the topology of the phenotypes; we have found strong evidence that indicates a high correlation between the two. Finally we have also established a tool which enables us to understand the relationship between the environment and the degree of modularity of the phenotype.</p>\r\n",
        "doi": "10.7907/N4XG-F402",
        "publication_date": "2009",
        "thesis_type": "phd",
        "thesis_year": "2009"
    },
    {
        "id": "thesis:5231",
        "collection": "thesis",
        "collection_id": "5231",
        "cite_using_url": "https://resolver.caltech.edu/CaltechETD:etd-06102008-153834",
        "primary_object_url": {
            "basename": "main.pdf",
            "content": "final",
            "filesize": 8339626,
            "license": "other",
            "mime_type": "application/pdf",
            "url": "/5231/1/main.pdf",
            "version": "v4.0.0"
        },
        "type": "thesis",
        "title": "Automated Design Synthesis of Structures using Growth Enhanced Evolution",
        "author": [
            {
                "family_name": "Nicaise",
                "given_name": "Fabien",
                "clpid": "Nicaise-Fabien"
            }
        ],
        "thesis_advisor": [
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "clpid": "Antonsson-E-K"
            }
        ],
        "thesis_committee": [
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "clpid": "Antonsson-E-K"
            },
            {
                "family_name": "Adami",
                "given_name": "Christoph Carl",
                "clpid": "Adami-C-C"
            },
            {
                "family_name": "Burdick",
                "given_name": "Joel Wakeman",
                "clpid": "Burdick-J-W"
            },
            {
                "family_name": "Pickar",
                "given_name": "Kenneth A.",
                "clpid": "Pickar-K-A"
            }
        ],
        "local_group": [
            {
                "literal": "div_eng"
            }
        ],
        "abstract": "<p>Engineering design is a complex problem on generating and evaluating a variety of options.  In traditional methods, this typically involves evaluating up to a dozen different point designs.  The limit on the process is the amount of time to generate, refine, and evaluate the various concepts.  Using a computer helps to speed up the process, but human involvement still remains the weakest link.</p>\r\n\r\n<p>The natural extension of this process is to continually and rapid generate, refine, and evaluate concepts entirely automatically.  Evolutionary Algorithms provide such a method, by emulating natural evolution.  The computer maintains a population point design, each of which is represented by a gene string that is allowed to change (mutate) and combine with other genes (crossover).  At each generation, every individual is modified then evaluated and the improved solutions proceed to the next generation.</p>\r\n\r\n<p>This thesis will extend the biological model by introducing a growth process to each individual.  This is akin to the concept of a multi-cellular organism developing in the womb.  An encoding for  discrete truss structures is described that provides for such an extension.  The truss grows from a few basic elements.  After showing several examples demonstrating the growth process, the method is applied to a couple simple examples using evolutionary algorithms.</p>",
        "doi": "10.7907/28H7-E831",
        "publication_date": "2008",
        "thesis_type": "phd",
        "thesis_year": "2008"
    },
    {
        "id": "thesis:2202",
        "collection": "thesis",
        "collection_id": "2202",
        "cite_using_url": "https://resolver.caltech.edu/CaltechETD:etd-05282007-183612",
        "primary_object_url": {
            "basename": "thesis.pdf",
            "content": "final",
            "filesize": 3357446,
            "license": "other",
            "mime_type": "application/pdf",
            "url": "/2202/1/thesis.pdf",
            "version": "v4.0.0"
        },
        "type": "thesis",
        "title": "Information-Theoretic Methods for Modularity in Engineering Design",
        "author": [
            {
                "family_name": "Wang",
                "given_name": "Bingwen",
                "clpid": "Wang-Bingwen"
            }
        ],
        "thesis_advisor": [
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "clpid": "Antonsson-E-K"
            }
        ],
        "thesis_committee": [
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "clpid": "Antonsson-E-K"
            },
            {
                "family_name": "Burdick",
                "given_name": "Joel Wakeman",
                "clpid": "Burdick-J-W"
            },
            {
                "family_name": "Pickar",
                "given_name": "Kenneth A.",
                "clpid": "Pickar-K-A"
            },
            {
                "family_name": "McEliece",
                "given_name": "Robert J.",
                "clpid": "McEliece-R-J"
            }
        ],
        "local_group": [
            {
                "literal": "div_eng"
            }
        ],
        "abstract": "<p>Due to their many advantages, modular structures commonly exist in artificial and natural systems, and the concept of modular product design has recently received extensive attention from the engineering research community. Although some work has been done on modularity, most of it is qualitative and exploratory in nature, and little is quantitative. One reason for this gap is the lack of a clear definition of modularity. This thesis begins with a detailed discussion on the concepts of \u201cmodularity\u201d and \u201cmodule.\u201d</p>\r\n\r\n<p>Based on the background presented here, a mutual information-based method is proposed to quantify modularity. The method is based on the view that coupling is information flow instead of real physical interactions. Information flow can be quantified by mutual information, which is based on randomness (or uncertainty). Since most engineering products can be modeled as stochastic systems and therefore have randomness, the mutual information-based method can be applied in very general cases, and it is shown that the commonly existing linkage counting modularity measure is a special case of the mutual information-based modularity measure.</p>\r\n\r\n<p>The mutual information-based method is applicable to final design products. But at the early stage of the engineering design process, there are generally only function diagrams. To exploit the benefits of modularity as early as possible, a minimal description length principle-based modularity measure is proposed to determine the modularity of graph structures, which can represent function diagrams. The method is used as criteria to hierarchically decompose abstract graph structures and the real function structure of an HP printer by evolutionary computation. Due to the specialty of genome representations in evolutionary computation, new genetic operators are developed to determine optimal hierarchical decompositions.</p>\r\n\r\n<p>This quantitative modularity measure has been developed to synthesize modular engineering products, especially by evolutionary design. There are many factors affecting evolving modular structures, such as genome representation, fitness function, learning, and task structure. The thesis preliminarily studies the effects of the modularity of tasks on the modularity of products in evolutionary computation. Using feed-forward neural networks as examples, the results show that the effects are task-dependent and rely on the amount of resources available for the tasks.</p>",
        "doi": "10.7907/ZBBK-JM82",
        "publication_date": "2007",
        "thesis_type": "phd",
        "thesis_year": "2007"
    },
    {
        "id": "thesis:2062",
        "collection": "thesis",
        "collection_id": "2062",
        "cite_using_url": "https://resolver.caltech.edu/CaltechETD:etd-05252006-221412",
        "primary_object_url": {
            "basename": "thesis052606.pdf",
            "content": "final",
            "filesize": 3500508,
            "license": "other",
            "mime_type": "application/pdf",
            "url": "/2062/1/thesis052606.pdf",
            "version": "v3.0.0"
        },
        "type": "thesis",
        "title": "Engineering Design Synthesis of Sensor and Control Systems for Intelligent Vehicles",
        "author": [
            {
                "family_name": "Zhang",
                "given_name": "Yizhen",
                "clpid": "Zhang-Yizhen"
            }
        ],
        "thesis_advisor": [
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "clpid": "Antonsson-E-K"
            }
        ],
        "thesis_committee": [
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "clpid": "Antonsson-E-K"
            },
            {
                "family_name": "Martinoli",
                "given_name": "Alcherio",
                "clpid": "Martinoli-A"
            },
            {
                "family_name": "Burdick",
                "given_name": "Joel Wakeman",
                "clpid": "Burdick-J-W"
            },
            {
                "family_name": "Pickar",
                "given_name": "Kenneth A.",
                "clpid": "Pickar-K-A"
            },
            {
                "family_name": "Murray",
                "given_name": "Richard M.",
                "clpid": "Murray-R-M"
            }
        ],
        "local_group": [
            {
                "literal": "div_eng"
            }
        ],
        "abstract": "<p>This thesis investigates the application of formal engineering design synthesis methodologies to the development of sensor and control systems for intelligent vehicles.</p>\r\n\r\n<p>A formal engineering design synthesis methodology based on evolutionary computation is presented, with special emphasis on dealing with modern engineering design challenges, such as high or variable complexity of design solutions, multiple conflicting design objectives, and noisy evaluation results, etc. The efficacy of the evolutionary design synthesis method is validated through multiple different case studies, where a variety of novel design solutions are generated to represent different engineering design trade-offs, and they have achieved performances comparable to, if not better than, that of hand-coded solutions in the same simplified environment. More importantly, this automatic design synthesis method shows great potential to handle more complex design problems, where a good hand-coded solution may be very difficult or even impossible to obtain. Moreover, the evolutionary design synthesis methodology appears promising to deal with uncertainty in the problem efficiently and adapt to the collective task nature well.</p>\r\n\r\n<p>In addition, multiple levels of vehicle simulation models with different computational cost and fidelity as well as necessary driver behaviors are implemented for different types of simulation experiments conducted for different research purposes. Efforts are made to try to generate good candidate solutions efficiently with less computational time and human engineering effort.</p>\r\n\r\n<p>Furthermore, a new threat assessment measure, time-to-last-second-braking (<i>T<sub>lsb</sub></i>), is proposed, which directly characterizes human natural judgment of the urgency and severity of threats in terms of time. Based on driver reaction time experimental results, new warning and overriding criteria are proposed in terms of the new <i>T<sub>lsb</sub></i> measure, and the performance is analyzed statistically in terms of two typical sample pre-crash traffic scenarios. Less affected by driver behavior variability, the new criteria characterize the current dynamic situations better than the previous ones, providing more appropriate warning and more effective overriding at the last moment. Finally, the possibility of frontal collision avoidance through steering (lane-changing) is discussed, and similarly the time-to-last-second-steering (<i>T<sub>lss</sub></i>) measure is proposed and compared with <i>T<sub>lsb</sub></i>.</p>",
        "doi": "10.7907/NB6H-S822",
        "publication_date": "2006",
        "thesis_type": "phd",
        "thesis_year": "2006"
    },
    {
        "id": "thesis:3884",
        "collection": "thesis",
        "collection_id": "3884",
        "cite_using_url": "https://resolver.caltech.edu/CaltechETD:etd-10032002-214953",
        "primary_object_url": {
            "basename": "main.pdf",
            "content": "final",
            "filesize": 2300841,
            "license": "other",
            "mime_type": "application/pdf",
            "url": "/3884/1/main.pdf",
            "version": "v3.0.0"
        },
        "type": "thesis",
        "title": "Set Mapping in the Method of Imprecision",
        "author": [
            {
                "family_name": "Wang",
                "given_name": "Xiaoou",
                "clpid": "Wang-Xiaoou"
            }
        ],
        "thesis_advisor": [
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "clpid": "Antonsson-E-K"
            }
        ],
        "thesis_committee": [
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "clpid": "Antonsson-E-K"
            },
            {
                "family_name": "Beck",
                "given_name": "James L.",
                "clpid": "Beck-J-L"
            },
            {
                "family_name": "Pickar",
                "given_name": "Kenneth A.",
                "clpid": "Pickar-K-A"
            },
            {
                "family_name": "Murray",
                "given_name": "Richard M.",
                "orcid": "0000-0002-5785-7481",
                "clpid": "Murray-R-M"
            }
        ],
        "local_group": [
            {
                "literal": "div_eng"
            }
        ],
        "abstract": "<p>The Method of Imprecision, or MoI, is a semi-automated set-based approach which uses mathematics of fuzzy sets to aid the designer making decisions with imprecise information in the preliminary design stage.</p>\r\n\r\n<p>The Method of Imprecision uses preference to represent the imprecision in engineering design. The preferences are specified both in the design variable space (DVS) and the performance variable space (PVS). To reach the overall preference which is needed to evaluate designs, the mapping between the DVS and the PVS should be explored. Many engineering design tools can only produce precise results with precise specifications, and usually the cost is high. In the preliminary stage, the specifications are imprecise and resources are limited. Hence, it is not cost-effective nor necessary to use these engineering design tools directly to study the mapping between the DVS and the PVS. An interpolation model is introduced to the MoI to construct metamodels for the actual mapping function between the DVS and the PVS. Due to the nature of engineering design, multistage metamodels are needed. Experimental design is used to choose design points for the first metamodel. In order to find an efficient way to choose design points when a priori information is available, many sampling criteria are discussed and tested on two specific examples. The difference between different sampling criteria when the number of added design points is small, while more design points do improve the accuracy of the metamodel substantially.</p>\r\n\r\n<p>The metamodels can be used to induce preferences in the DVS or the PVS according to the extension principle. The Level Interval Algorithm (LIA) is a discrete approximate implementation of the extension principle. The resulting preference by the LIA is presented as an alpha-cut, which is the set of designs or performances with a certain level of preference. There are some limitations of the LIA, especially for multidimensional DVS and PVS. A new extension of the LIA is proposed to compute alpha-cuts with more accuracy and less limitations. The designers have more control over the trade-off between the cost and accuracy of the computation with the new extension of the LIA.</p>\r\n\r\n<p>The results of the Method of Imprecision should be the set of alternative designs in the DVS at a certain preference level, and the set of achievable performances in the PVS. The information about preferences in the DVS and the PVS is needed to transfer back and forth. Usually the mapping from the PVS to the DVS is unavailable, while it is needed to induce preference in the DVS from the PVS. A new method is constructed to compute the alpha-cuts in both spaces from preferences specified in the DVS and the PVS.</p>\r\n\r\n<p>Finally, a new measure is proposed to find the most cost-effective sampling region of new design points for a metamodel. Also, the full implementation of the Method of Imprecision is listed in detail. Then it is applied to an example of the structure design of a passenger vehicle, and comparisons are made between the new results and previous results.</p>",
        "doi": "10.7907/J0JH-M190",
        "publication_date": "2003",
        "thesis_type": "phd",
        "thesis_year": "2003"
    },
    {
        "id": "thesis:6369",
        "collection": "thesis",
        "collection_id": "6369",
        "cite_using_url": "https://resolver.caltech.edu/CaltechTHESIS:05032011-082523919",
        "primary_object_url": {
            "basename": "Lee_c_2002.pdf",
            "content": "final",
            "filesize": 55596551,
            "license": "other",
            "mime_type": "application/pdf",
            "url": "/6369/1/Lee_c_2002.pdf",
            "version": "v5.0.0"
        },
        "type": "thesis",
        "title": "Efficient Automatic Engineering Design Synthesis Via Evolutionary Exploration",
        "author": [
            {
                "family_name": "Lee",
                "given_name": "Cin-Young",
                "clpid": "Lee-Cin-Young"
            }
        ],
        "thesis_advisor": [
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "orcid": "0009-0009-4668-8289",
                "clpid": "Antonsson-E-K"
            }
        ],
        "thesis_committee": [
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "orcid": "0009-0009-4668-8289",
                "clpid": "Antonsson-E-K"
            },
            {
                "family_name": "Arnold",
                "given_name": "Frances Hamilton",
                "orcid": "0000-0002-4027-364X",
                "clpid": "Arnold-F-H"
            },
            {
                "family_name": "Goodwin",
                "given_name": "David G.",
                "clpid": "Goodwin-D-G"
            },
            {
                "family_name": "Martinoli",
                "given_name": "Alcherio",
                "clpid": "Martinoli-A"
            },
            {
                "family_name": "Pickar",
                "given_name": "Kenneth A.",
                "clpid": "Pickar-K-A"
            }
        ],
        "local_group": [
            {
                "literal": "div_eng"
            }
        ],
        "abstract": "The evolution of designs in nature has been the inspiration for this thesis, which seeks to develop a framework for efficient automatic engineering design synthesis based on evolutionary methods.\r\n\r\nThe design synthesis process is equated to an evolutionary process. Because of this, the same formalization for evolution, the evolution algorithm, is used as a design synthesis formalism. Implementation of the evolution algorithm on a computer allows evolution of non-biological systems, and, hence, automatic engineering design synthesis. The early and canonical versions of such evolutionary computation are bare bones evolution tools that neglect several key aspects of evolutionary systems. Some universal aspects of good designs are identified, three of which are dealt with in this thesis. These are variable complexity, modularity, and speciation.\r\n\r\nFramed in an evolutionary context, each of these characteristics are requisites for being able to evolve in correspondence with a dynamic environment. Those that are most evolvable will survive.  After all, if a species cannot evolve quickly enough with changes in the environment, it will perish.  In a design context, this indicates that the characteristics are vital for efficiency and shorter design cycles.\r\n\r\nAn integrated framework is developed to address all three aspects individually or in any combination thereof, which has not been done heretofore. Because of the poor theoretical foundations of evolutionary computation, the effectiveness of the developed approach is determined through computer experimentation on several test and design problems. Results are promising as all three\r\naspects were successfully achieved in comparison to canonical evolutionary computation.\r\n",
        "doi": "10.7907/5HRP-ND58",
        "publication_date": "2002",
        "thesis_type": "phd",
        "thesis_year": "2002"
    },
    {
        "id": "thesis:3279",
        "collection": "thesis",
        "collection_id": "3279",
        "cite_using_url": "https://resolver.caltech.edu/CaltechETD:etd-08302005-131428",
        "primary_object_url": {
            "basename": "Ma_l_2001.pdf",
            "content": "final",
            "filesize": 13132146,
            "license": "other",
            "mime_type": "application/pdf",
            "url": "/3279/1/Ma_l_2001.pdf",
            "version": "v3.0.0"
        },
        "type": "thesis",
        "title": "Robust mask-layout and process synthesis in micro-electro-mechanical-systems (MEMS) using genetic algorithms",
        "author": [
            {
                "family_name": "Ma",
                "given_name": "Lin",
                "clpid": "Ma-L"
            }
        ],
        "thesis_advisor": [
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "clpid": "Antonsson-E-K"
            }
        ],
        "thesis_committee": [
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "clpid": "Antonsson-E-K"
            },
            {
                "family_name": "Goodwin",
                "given_name": "David G.",
                "clpid": "Goodwin-D-G"
            },
            {
                "family_name": "Burdick",
                "given_name": "Joel Wakeman",
                "clpid": "Burdick-J-W"
            },
            {
                "family_name": "Pickar",
                "given_name": "Kenneth A.",
                "clpid": "Pickar-K-A"
            }
        ],
        "local_group": [
            {
                "literal": "div_eng"
            }
        ],
        "abstract": "This thesis reports a Genetic Algorithm approach for the mask-layout and process flow synthesis problem. For a given desired target shape, an optimal mask-layout and process flow can be automatically generated using the Genetic Algorithm synthesis approach. The Genetic Algorithm manipulates and evolves a population of candidate solutions (mask-layouts and process parameters) by utilizing a process simulation tool to evaluate the performance of the candidate solutions. For the mask-layout and process flow synthesis problem, encoding schemes, selection schemes, and genetic operations have been developed to effectively explore the solution space and control the evolution and convergence of the solutions.\n\nThe synthesis approach is tested for mask-layout and process synthesis for bulk wet etching. By integrating a bulk wet etching simulation tool into the Genetic Algorithm iterations, the algorithm can automatically generate proper mask-layout and process flow which can fabricate 3-D geometry close to the desired 3-D target shape. For structures with convex corners, complex compensation structures can be synthesized by the algorithm. More importantly, the process flow can also be synthesized. For multi-step wet etching processes, proper etchant sequence and etch times for each etch step can be synthesized automatically by the algorithm. When the choice of different process flows exists, the enlarged solution space makes the design problem more challenging. The ability to synthesize process flows makes the automatic design method more complete and more valuable.\n\nThe algorithm is further extended to achieve robust design. Since fabrication variations and modeling inaccuracy always exist, the synthesized solutions without considering these variations may not generate satisfactory results in actual fabrication. Robust design methods are developed to synthesize robust mask-layouts and process flows in \"noisy\" environment. Since the synthesis procedure considers the effect of variations in the fabrication procedures, the final synthesized solution will have high robustness to the variations, and will generate satisfactory results under a variety of fabrication conditions. The robust design approaches are implemented and tested for robust mask-layout design for mask misalignment and etch rate variations. Mask-layouts robust to mask misalignment noise and etch rate variations during the fabrication can be synthesized. The synthesized mask-layouts generally improve the yield significantly by exhibiting consistent performance under a variety of fabrication conditions.",
        "doi": "10.7907/e8hm-z754",
        "publication_date": "2001",
        "thesis_type": "phd",
        "thesis_year": "2001"
    },
    {
        "id": "thesis:4166",
        "collection": "thesis",
        "collection_id": "4166",
        "cite_using_url": "https://resolver.caltech.edu/CaltechETD:etd-10182007-093223",
        "primary_object_url": {
            "basename": "Perez_fa_1995.pdf",
            "content": "final",
            "filesize": 9343145,
            "license": "other",
            "mime_type": "application/pdf",
            "url": "/4166/1/Perez_fa_1995.pdf",
            "version": "v3.0.0"
        },
        "type": "thesis",
        "title": "Hue Segmentation, Color Circuitry, and the Mantis Shrimp",
        "author": [
            {
                "family_name": "Perez",
                "given_name": "Frank Allen",
                "clpid": "Perez-Frank-Allen"
            }
        ],
        "thesis_advisor": [
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "orcid": "0009-0009-4668-8289",
                "clpid": "Antonsson-E-K"
            },
            {
                "family_name": "Koch",
                "given_name": "Christof",
                "orcid": "0000-0001-6482-8067",
                "clpid": "Koch-C"
            }
        ],
        "thesis_committee": [
            {
                "family_name": "Koch",
                "given_name": "Christof",
                "orcid": "0000-0001-6482-8067",
                "clpid": "Koch-C"
            },
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "orcid": "0009-0009-4668-8289",
                "clpid": "Antonsson-E-K"
            },
            {
                "family_name": "Allman",
                "given_name": "John Morgan",
                "clpid": "Allman-J-M"
            },
            {
                "family_name": "Barr",
                "given_name": "Alan H.",
                "clpid": "Barr-A-H"
            },
            {
                "family_name": "Culick",
                "given_name": "Fred E. C.",
                "clpid": "Culick-F-E-C"
            },
            {
                "family_name": "Mead",
                "given_name": "Carver",
                "orcid": "0000-0003-4051-0462",
                "clpid": "Mead-C-A"
            },
            {
                "family_name": "Perona",
                "given_name": "Pietro",
                "orcid": "0000-0002-7583-5809",
                "clpid": "Perona-P"
            }
        ],
        "local_group": [
            {
                "literal": "div_eng"
            }
        ],
        "abstract": "<p>The focus of this thesis is on engineering effective color vision subsystems for object segmentation based on hue and discontinuities in hue. Hue, which encodes color, is a psychophysical scalar variable defined on the ring [0, [pi]]. A computational theory justifying the use of hue for distinguishing material differences is established and novel algorithms are developed to detect its discontinuity. Although the focus of this thesis has been on anthropocentrically based trichromatic systems, some effort is placed in exploring the multi-dimensional spaces of more than three primary colors. A hypothetical explanation is proposed of the 11 spectral sensors of the Mantis shrimp, which performs functionally as a biological spectrum analyzer. The importance of the opponency calculation is emphasized. Its role in optimum filter design offers hyperacuity in the spectral domain.</p>\r\n\r\n<p>This work encompasses spectral filter design, color space evaluation, computer vision algorithm development, and hardware implementation in custom analog VLSI circuitry. A one pixel (zero dimension) \"intensity/normalized-color/hue\" sensor is built based on a trichromatic system. For the basic analog circuit element required in hue segmentation, the current-fuse is developed. Guidelines for building higher dimensional sensors in both spatial and spectral domains are presented. Practical offshoots from this research range from color quality sensors for inexpensive printing to vision systems for robotics and autonomous vehicles.</p>",
        "doi": "10.7907/zev6-6330",
        "publication_date": "1995",
        "thesis_type": "phd",
        "thesis_year": "1995"
    },
    {
        "id": "thesis:3565",
        "collection": "thesis",
        "collection_id": "3565",
        "cite_using_url": "https://resolver.caltech.edu/CaltechETD:etd-09162005-134646",
        "primary_object_url": {
            "basename": "Hubbard_tj_1994.pdf",
            "content": "final",
            "filesize": 13320389,
            "license": "other",
            "mime_type": "application/pdf",
            "url": "/3565/1/Hubbard_tj_1994.pdf",
            "version": "v2.0.0"
        },
        "type": "thesis",
        "title": "MEMS design : the geometry of silicon micromachining",
        "author": [
            {
                "family_name": "Hubbard",
                "given_name": "Ted J.",
                "clpid": "Hubbard-T-J"
            }
        ],
        "thesis_advisor": [
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "clpid": "Antonsson-E-K"
            }
        ],
        "thesis_committee": [
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "clpid": "Antonsson-E-K"
            }
        ],
        "local_group": [
            {
                "literal": "div_eng"
            }
        ],
        "abstract": "The design of MEMS (Micro Electro Mechanical Systems) on the millimeter to micron length scales will be examined in this thesis.\n\nA very broad base of knowledge has been developed concerning the etching processes commonly used in MEMS fabrication. The fundamental problem we have sent out to study is how to model the shape transformations that occur in MEMS fabrication. The ultimate goal is to determine the required input mask geometry for a desired output etched shape.\n\nThe body of work begins with the crystal structure of silicon and ends with etched shapes. The underlying crystal structure causes different rates for different directions; this behavior has been modeled to obtain rate models. The information in these rate models has then been used in a number of shape modelers. High level models like the Eshape model provide not only simulation but a framework for true design. Other models such as the Cellular Automata model take a different approach and provide flexible and robust simulators. The tools were used to develop real world MEMS applications such as compensation structures.\n\nAs important as the individual models, is the ability to integrate them together to a coherent design tool and allow information to flow between different parts. This synthesis allows a fuller understanding of the etching process from start to finish.\n\nIt is important to note that while this thesis deals with etching, the methods developed are very general and are applicable to many shape transformation processes.\n",
        "doi": "10.7907/TK4C-M144",
        "publication_date": "1994",
        "thesis_type": "phd",
        "thesis_year": "1994"
    },
    {
        "id": "thesis:3268",
        "collection": "thesis",
        "collection_id": "3268",
        "cite_using_url": "https://resolver.caltech.edu/CaltechETD:etd-08292007-091850",
        "primary_object_url": {
            "basename": "Hsueh_wj_1993.pdf",
            "content": "final",
            "filesize": 5869705,
            "license": "other",
            "mime_type": "application/pdf",
            "url": "/3268/1/Hsueh_wj_1993.pdf",
            "version": "v3.0.0"
        },
        "type": "thesis",
        "title": "High-resolution optoelectronic and photogrammetic 3-D surface geometry acquisition and analysis",
        "author": [
            {
                "family_name": "Hsueh",
                "given_name": "Wen-Jean",
                "clpid": "Hsueh-W"
            }
        ],
        "thesis_advisor": [
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "clpid": "Antonsson-E-K"
            }
        ],
        "thesis_committee": [
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "clpid": "Antonsson-E-K"
            },
            {
                "family_name": "Culick",
                "given_name": "Fred E. C.",
                "clpid": "Culick-F-E-C"
            },
            {
                "family_name": "Burdick",
                "given_name": "Joel Wakeman",
                "clpid": "Burdick-J-W"
            }
        ],
        "local_group": [
            {
                "literal": "div_eng"
            }
        ],
        "abstract": "A high-resolution, high-speed, automatic, and non-contact 3-D surface geometry measuring system has been developed. It is based on a photogrammetric and optoelectronic technique that adopts lateral-photoeffect diode detectors sensitive in the near-infrared range. Two cameras in stereo positions are both equipped with the large 2-axis analog detectors. A light beam is focused and scanned onto the surface of an object as a very small light spot. Excitations on detectors generated by the reflected light from the spot create photocurrents that are transformed into 2-D position signals in a very short time. A simple set of calculations is done to photogrammetrically triangulate two sets of 2-D coordinates from the detectors into the 3-D coordinates of the light spot. Because only one small light spot in the scene is illuminated at a time, the stereo-correspondence problem is solved in real time. The detectors are able to collect data at 10 KHz with 4,096x4,096 resolution based on a 12-bit A/D converter. The resolution and precision can be improved up to eight times by oversampling. The system is able to resolve, for example, less than 10 \u00b5m from 47 cm away with a nominal viewing volume of (22 cm)[superscript 3]. Its performance is better than contemporary coordinate measuring, range finding, shape digitizing, and machine vision systems, and is comparable to the best aspects of each existing system. The irregular 3-D data it generates can be regularized so that data processing algorithms designed for image systems may be applied. The system is designed for the acquisitions of general surface geometries, such as fabricated parts, machined surfaces, biological surfaces, and deformed parts. The system will be useful in solving a variety of 3-D surface geometry measuring problems in engineering design, manufacturing, inspection, robot kinematics measurement, and vision.\n",
        "doi": "10.7907/wn0s-6y22",
        "publication_date": "1993",
        "thesis_type": "phd",
        "thesis_year": "1993"
    },
    {
        "id": "thesis:4581",
        "collection": "thesis",
        "collection_id": "4581",
        "cite_using_url": "https://resolver.caltech.edu/CaltechETD:etd-11152007-080746",
        "primary_object_url": {
            "basename": "Wood_kl_1990.pdf",
            "content": "final",
            "filesize": 10254488,
            "license": "other",
            "mime_type": "application/pdf",
            "url": "/4581/1/Wood_kl_1990.pdf",
            "version": "v3.0.0"
        },
        "type": "thesis",
        "title": "A method for the representation and manipulation of uncertainties in preliminary engineering design",
        "author": [
            {
                "family_name": "Wood",
                "given_name": "Kristin Lee",
                "clpid": "Wood-K-L"
            }
        ],
        "thesis_advisor": [
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "clpid": "Antonsson-E-K"
            }
        ],
        "thesis_committee": [
            {
                "family_name": "Antonsson",
                "given_name": "Erik K.",
                "clpid": "Antonsson-E-K"
            },
            {
                "family_name": "Brennen",
                "given_name": "Christopher E.",
                "clpid": "Brennen-C-E"
            },
            {
                "family_name": "Beck",
                "given_name": "James L.",
                "clpid": "Beck-J-L"
            },
            {
                "family_name": "Franklin",
                "given_name": "Joel N.",
                "clpid": "Franklin-J-N"
            },
            {
                "family_name": "Burdick",
                "given_name": "Joel Wakeman",
                "clpid": "Burdick-J-W"
            },
            {
                "family_name": "Dubowsky",
                "given_name": "Steven",
                "clpid": "Dubowsky-S"
            }
        ],
        "local_group": [
            {
                "literal": "div_eng"
            }
        ],
        "abstract": "Each stage of the engineering design process, and particularly the preliminary phase, includes imprecision, stochastic uncertainty, and possibilistic uncertainty. A technique is presented by which the various levels of imprecision (where imprecision is: \"uncertainty in choosing among alternatives\") in the description of design elements may be represented and manipulated. The calculus of Fuzzy Sets provides the foundation of the approach. An analogous method to representing and manipulating imprecision using probability calculus is presented and compared with the fuzzy calculus technique. Extended Hybrid Numbers are then introduced to combine the effects of imprecision with stochastic and possibilistic uncertainty. Using the results, a preliminary set of metrics is proposed by which a designer can make decisions among alternative configurations in preliminary design.\n\nIn general, the hypothesis underlying the techniques described above is that making more information available than conventional approaches will enhance the decision-making capability of the designer in preliminary design. A number of elemental concepts toward this hypothesis have been formulated during the evolution of this work:\n\t\u2022 Imprecision is a hallmark of preliminary engineering design. To carry out decisions based on the information available to the designer and on basic engineering principles, the imprecise descriptions of possible solution technologies must be formalized and quantified in some way. The application of the fuzzy calculus along with a fundamental interpretation provides a new and straight-forward means by which imprecision can be represented and manipulated.\n\t\u2022 Besides imprecision, other uncertainties, categorized as stochastic and possibilistic, are prevalent in design, even in the early stages of the design process.  Providing a method by which these uncertainties can be represented in the context of the imprecision is an important and necessary step when considering the evaluation of a design's performance. Extended Hybrid Numbers have been introduced in this work in order to couple the stochastic and possibilistic components of uncertainty with imprecision such that no information is lost in the process.\n\t\u2022 Because of the size, coupling, and complexity of the functional requirement space in any realistic design, it is difficult to make decisions with regard to the performance of a design, even with an Extended Hybrid Number representation.  Defining and utilizing metrics (or figures of merit) in the evaluation of how well a design meets the functional requirements reduces the complexity of this process.  \t  Such metrics also have merit when we begin to think of languages of design and adding the necessary pragmatics of \"will a generated or proposed design satisfy the performance requirements with respect to the ever-present and unavoidable \t  uncertainties?\".  These concepts form the central focus of this work. The mathematical methods presented here were developed to support and formalize these ideas.",
        "doi": "10.7907/g1hs-p655",
        "publication_date": "1990",
        "thesis_type": "phd",
        "thesis_year": "1990"
    }
]