{"id":{"repo_id":"utahstate","oai_identifier":"oai:digitalcommons.usu.edu:etd-8232"},"canonical_url":"https://search.ndltd.org/etd/utahstate/oai:digitalcommons.usu.edu:etd-8232","repository":{"repo_id":"utahstate","name":"Utah State University","base_url":"https://digitalcommons.usu.edu/do/oai/"},"display":{"title":"An Inverse Approach to a Probability Model for Fractured Networks","abstract":"A common problem in science and engineering applications deals with finding information about a system where only limited information is known. One example of this problem is determining the geometry of an aquifer or oil reservoir based on well tests taken at the site. The Conditional Coding Method attacks this type of problem. This method uses the Simulated Annealing Algorithm in conjunction with a probability model which generates possible solutions based on a uniform random number list. The Annealing Algorithm generates a conditional probability distribution on all possible solutions generated by the probability model, conditioned on the observed data set. The problem is attacked by sampling from this distribution. This method accounts for the noise inherent in the data set as well as the uncertainty due to the limited amount of data available.","abstract_html":"A common problem in science and engineering applications deals with finding information about a system where only limited information is known. One example of this problem is determining the geometry of an aquifer or oil reservoir based on well tests taken at the site. The Conditional Coding Method attacks this type of problem. This method uses the Simulated Annealing Algorithm in conjunction with a probability model which generates possible solutions based on a uniform random number list. The Annealing Algorithm generates a conditional probability distribution on all possible solutions generated by the probability model, conditioned on the observed data set. The problem is attacked by sampling from this distribution. This method accounts for the noise inherent in the data set as well as the uncertainty due to the limited amount of data available.","abstract_has_math":false,"creators":["Vail, Stacy G."],"institution":"Hosted by Utah State University Libraries","degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Mathematics and Statistics","degree_department":null,"school":null,"contributors":["Kevin Hestir","Joseph Koebbe","James Evans"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:57:13Z","subjects":["inverse","probability model","fractured networks","Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/9056-00f5"],"render_values":[{"text":"https://doi.org/10.26076/9056-00f5","href":"https://doi.org/10.26076/9056-00f5","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usu.edu/etd/7128","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usu.edu/etd/7128","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.usu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usu.edu%3Aetd-8232","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Kevin Hestir","Joseph Koebbe","James Evans"]},{"key":"dc:creator","label":"Author","values":["Vail, Stacy G."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2010-01-01T08:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["1994-05-01T07:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["Hosted by Utah State University Libraries"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics and Statistics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["inverse","probability model","fractured networks","Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usu.edu/etd/7128"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/9056-00f5"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["A common problem in science and engineering applications deals with finding information about a system where only limited information is known. One example of this problem is determining the geometry of an aquifer or oil reservoir based on well tests taken at the site. The Conditional Coding Method attacks this type of problem. This method uses the Simulated Annealing Algorithm in conjunction with a probability model which generates possible solutions based on a uniform random number list. The Annealing Algorithm generates a conditional probability distribution on all possible solutions generated by the probability model, conditioned on the observed data set. The problem is attacked by sampling from this distribution. This method accounts for the noise inherent in the data set as well as the uncertainty due to the limited amount of data available."]},{"key":"dc:title","label":"Title","values":["An Inverse Approach to a Probability Model for Fractured Networks"]}]}],"canonical_facts":{"dc:contributor":["Kevin Hestir","Joseph Koebbe","James Evans"],"dc:creator":["Vail, Stacy G."],"dc:date.available":["2010-01-01T08:00:00Z"],"dc:date.created":["1994-05-01T07:00:00Z"],"dc:description.abstract":["A common problem in science and engineering applications deals with finding information about a system where only limited information is known. One example of this problem is determining the geometry of an aquifer or oil reservoir based on well tests taken at the site. The Conditional Coding Method attacks this type of problem. This method uses the Simulated Annealing Algorithm in conjunction with a probability model which generates possible solutions based on a uniform random number list. The Annealing Algorithm generates a conditional probability distribution on all possible solutions generated by the probability model, conditioned on the observed data set. The problem is attacked by sampling from this distribution. This method accounts for the noise inherent in the data set as well as the uncertainty due to the limited amount of data available."],"dc:identifier":["https://digitalcommons.usu.edu/etd/7128"],"dc:identifier.doi":["https://doi.org/10.26076/9056-00f5"],"dc:publisher":["Hosted by Utah State University Libraries"],"dc:subject":["inverse","probability model","fractured networks","Mathematics"],"dc:title":["An Inverse Approach to a Probability Model for Fractured Networks"],"thesis:degree_discipline":["Mathematics and Statistics"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T08:57:13Z"}