{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/24117"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/24117","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Geometric methods for optimizing ramified flow networks","abstract":"Using geometrically based approaches, optimal characteristics of nonlinear flow networks were examined. The first model studied was that of a fractal-like desalination plant. Solving the equations of diffusion by analogy to electrostatics, desalination graphs superimposed on the diffusion gradients were optimized to produce maximal water flow. Graphs were generated while varying branching angles and ratios to determine optimal morphologies. Three different boundary conditions are discussed, those of constant pressure difference, constant water flow rate, and constant absorber salinity. Another type of flow network, that of the perceptron, was analyzed from the point of view of its attractors in order to determine which patterns resonated with the network. Using the definition of resonance as learning rapidity, convergence rates were studied by calculating the mean paths to convergence for perceptron weights. Polynomial expressions were given for the mean and variance steps to convergence, which depended upon two dimensionless geometric parameters.","abstract_html":"Using geometrically based approaches, optimal characteristics of nonlinear flow networks were examined. The first model studied was that of a fractal-like desalination plant. Solving the equations of diffusion by analogy to electrostatics, desalination graphs superimposed on the diffusion gradients were optimized to produce maximal water flow. Graphs were generated while varying branching angles and ratios to determine optimal morphologies. Three different boundary conditions are discussed, those of constant pressure difference, constant water flow rate, and constant absorber salinity. Another type of flow network, that of the perceptron, was analyzed from the point of view of its attractors in order to determine which patterns resonated with the network. Using the definition of resonance as learning rapidity, convergence rates were studied by calculating the mean paths to convergence for perceptron weights. Polynomial expressions were given for the mean and variance steps to convergence, which depended upon two dimensionless geometric parameters.","abstract_has_math":false,"creators":["Singleton, Martin S."],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Physics","degree_department":null,"school":null,"contributors":["Hubler, Alfred W.","Oono, Yoshitsugu","Weissman, Michael B.","Stack, John D."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-25T14:53:40Z","date_published":"2011-05-25T14:53:40Z","updated_at":"2026-07-22T22:25:23Z","subjects":["nonlinear networks","flow networks","ramified networks","neural networks","constructal theory","perceptrons","optimization","fractal networks","smart materials"],"languages":["en"],"rights":["Copyright 2010 by Martin S. Singleton. All rights reserved."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/24117","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Hubler, Alfred W.","Oono, Yoshitsugu","Weissman, Michael B.","Stack, John D."]},{"key":"dc:creator","label":"Author","values":["Singleton, Martin S."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-25T14:53:40Z","2011-05"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Physics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["nonlinear networks","flow networks","ramified networks","neural networks","constructal theory","perceptrons","optimization","fractal networks","smart materials"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2010 by Martin S. Singleton. All rights reserved."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/24117"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Using geometrically based approaches, optimal characteristics of nonlinear flow networks were examined. The first model studied was that of a fractal-like desalination plant. Solving the equations of diffusion by analogy to electrostatics, desalination graphs superimposed on the diffusion gradients were optimized to produce maximal water flow. Graphs were generated while varying branching angles and ratios to determine optimal morphologies. Three different boundary conditions are discussed, those of constant pressure difference, constant water flow rate, and constant absorber salinity. Another type of flow network, that of the perceptron, was analyzed from the point of view of its attractors in order to determine which patterns resonated with the network. Using the definition of resonance as learning rapidity, convergence rates were studied by calculating the mean paths to convergence for perceptron weights. Polynomial expressions were given for the mean and variance steps to convergence, which depended upon two dimensionless geometric parameters.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2010-12-10T14:42:07Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 3 MartinSSingletonThesis.tex: 189579 bytes, checksum: 3614721ec45259ccac3924a05d88e32c (MD5) MartinSSingletonThesis.bib: 21950 bytes, checksum: 4a78bef20599e005b14dfa4199fcdfea (MD5) MartinSSingletonThesis.pdf: 4952217 bytes, checksum: 9851560730d616de8cd6b14bdaff61a8 (MD5)","Made available in DSpace on 2011-05-25T14:53:40Z (GMT). No. of bitstreams: 4 Singleton_Martin.bib: 21950 bytes, checksum: 4a78bef20599e005b14dfa4199fcdfea (MD5) Singleton_Martin.pdf: 4961533 bytes, checksum: 1fff472c32b7eb6ecac5d0116b4ca58b (MD5) Singleton_Martin.tex: 189698 bytes, checksum: 241f4be186b7aaf044d095a365e2e8ee (MD5) license.txt: 4066 bytes, checksum: d335494e3a89a8e19c921dd4db4a69b6 (MD5)"]},{"key":"dc:title","label":"Title","values":["Geometric methods for optimizing ramified flow networks"]}]}],"canonical_facts":{"dc:contributor":["Hubler, Alfred W.","Oono, Yoshitsugu","Weissman, Michael B.","Stack, John D."],"dc:creator":["Singleton, Martin S."],"dc:date":["2011-05-25T14:53:40Z","2011-05"],"dc:description":["Using geometrically based approaches, optimal characteristics of nonlinear flow networks were examined. The first model studied was that of a fractal-like desalination plant. Solving the equations of diffusion by analogy to electrostatics, desalination graphs superimposed on the diffusion gradients were optimized to produce maximal water flow. Graphs were generated while varying branching angles and ratios to determine optimal morphologies. Three different boundary conditions are discussed, those of constant pressure difference, constant water flow rate, and constant absorber salinity. Another type of flow network, that of the perceptron, was analyzed from the point of view of its attractors in order to determine which patterns resonated with the network. Using the definition of resonance as learning rapidity, convergence rates were studied by calculating the mean paths to convergence for perceptron weights. Polynomial expressions were given for the mean and variance steps to convergence, which depended upon two dimensionless geometric parameters.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2010-12-10T14:42:07Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 3 MartinSSingletonThesis.tex: 189579 bytes, checksum: 3614721ec45259ccac3924a05d88e32c (MD5) MartinSSingletonThesis.bib: 21950 bytes, checksum: 4a78bef20599e005b14dfa4199fcdfea (MD5) MartinSSingletonThesis.pdf: 4952217 bytes, checksum: 9851560730d616de8cd6b14bdaff61a8 (MD5)","Made available in DSpace on 2011-05-25T14:53:40Z (GMT). No. of bitstreams: 4 Singleton_Martin.bib: 21950 bytes, checksum: 4a78bef20599e005b14dfa4199fcdfea (MD5) Singleton_Martin.pdf: 4961533 bytes, checksum: 1fff472c32b7eb6ecac5d0116b4ca58b (MD5) Singleton_Martin.tex: 189698 bytes, checksum: 241f4be186b7aaf044d095a365e2e8ee (MD5) license.txt: 4066 bytes, checksum: d335494e3a89a8e19c921dd4db4a69b6 (MD5)"],"dc:identifier":["http://hdl.handle.net/2142/24117"],"dc:language":["en"],"dc:rights":["Copyright 2010 by Martin S. Singleton. All rights reserved."],"dc:subject":["nonlinear networks","flow networks","ramified networks","neural networks","constructal theory","perceptrons","optimization","fractal networks","smart materials"],"dc:title":["Geometric methods for optimizing ramified flow networks"],"thesis:degree_discipline":["Physics"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:23Z"}