Дисертації з теми "Modeling algorithms"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Modeling algorithms".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Frank, Matthew I. "LoPC-- modeling contention in parallel algorithms." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/47439.
Повний текст джерелаDeBrunner, Linda Sumners. "Modeling reconfiguration algorithms for regular architecture." Diss., Virginia Tech, 1991. http://hdl.handle.net/10919/29254.
Повний текст джерелаPh. D.
Zhang, Wangyang. "IC Spatial Variation Modeling: Algorithms and Applications." Research Showcase @ CMU, 2012. http://repository.cmu.edu/dissertations/136.
Повний текст джерелаYee, Seung Hee. "Three algorithms for planar-patch terrain modeling." Thesis, Monterey, California. Naval Postgraduate School, 1988. http://hdl.handle.net/10945/23136.
Повний текст джерелаChen, Lin. "Causal modeling in quantitative genomics /." Thesis, Connect to this title online; UW restricted, 2008. http://hdl.handle.net/1773/9577.
Повний текст джерелаBosson, Maël. "Adaptive algorithms for computational chemistry and interactive modeling." Phd thesis, Université de Grenoble, 2012. http://tel.archives-ouvertes.fr/tel-00846458.
Повний текст джерелаLam, Warren Michael. "Modeling algorithms for a class of fractal signals." Thesis, Massachusetts Institute of Technology, 1992. http://hdl.handle.net/1721.1/31034.
Повний текст джерелаIncludes bibliographical references (leaves 86-87).
by Warren Michael Lam.
M.S.
Stuhlmüller, Andreas. "Modeling cognition with probabilistic programs : representations and algorithms." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/100860.
Повний текст джерелаThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 167-176).
This thesis develops probabilistic programming as a productive metaphor for understanding cognition, both with respect to mental representations and the manipulation of such representations. In the first half of the thesis, I demonstrate the representational power of probabilistic programs in the domains of concept learning and social reasoning. I provide examples of richly structured concepts, defined in terms of systems of relations, subparts, and recursive embeddings, that are naturally expressed as programs and show initial experimental evidence that they match human generalization patterns. I then proceed to models of reasoning about reasoning, a domain where the expressive power of probabilistic programs is necessary to formalize our intuitive domain understanding due to the fact that, unlike previous formalisms, probabilistic programs allow conditioning to be represented in a model, not just applied to a model. I illustrate this insight with programs that model nested reasoning in game theory, artificial intelligence, and linguistics. In the second half, I develop three inference algorithms with the dual intent of showing how to efficiently compute the marginal distributions defined by probabilistic programs, and providing building blocks for process-level accounts of human cognition. First, I describe a Dynamic Programming algorithm for computing the marginal distribution of discrete probabilistic programs by compiling to systems of equations and show that it can make inference in models of "reasoning about reasoning" tractable by merging and reusing subcomputations. Second, I introduce the setting of amortized inference and show how learning inverse models lets us leverage samples generated by other inference algorithms to compile probabilistic models into fast recognition functions. Third, I develop a generic approach to coarse-to-fine inference in probabilistic programs and provide evidence that it can speed up inference in models with large state spaces that have appropriate hierarchical structure. Finally, I substantiate the claim that probabilistic programming is a productive metaphor by outlining new research questions that have been opened up by this line of investigation.
by Andreas Stuhlmüller.
Ph. D.
Chaudhari, Soumee. "Modeling distance functions induced by face recognition algorithms." [Tampa, Fla.] : University of South Florida, 2004. http://purl.fcla.edu/fcla/etd/SFE0000516.
Повний текст джерелаHedberg, Vilhelm. "Evaluation of Hair Modeling, Simulation and Rendering Algorithms for a VFX Hair Modeling System." Thesis, Linköpings universitet, Medie- och Informationsteknik, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-65592.
Повний текст джерелаPittman, Jennifer L. "Adaptive splines and genetic algorithms for optimal statistical modeling." Adobe Acrobat reader required to view the full dissertation, 2000. http://www.etda.libraries.psu.edu/theses/approved/WorldWideIndex/ETD-23/index.html.
Повний текст джерелаChoi, Jee Whan. "Power and performance modeling for high-performance computing algorithms." Diss., Georgia Institute of Technology, 2015. http://hdl.handle.net/1853/53561.
Повний текст джерелаSchmeißer, Andre [Verfasser]. "Contact Modeling Algorithms for Fiber Dynamics Simulations / Andre Schmeißer." München : Verlag Dr. Hut, 2016. http://d-nb.info/1115549960/34.
Повний текст джерелаPhanaphat, Piyajit 1980. "Modeling and algorithms for optimizing beam steering optical crossconnects." Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/29690.
Повний текст джерелаIncludes bibliographical references (p. 81).
One of the most significant applications of Micro-Electromechanical Systems (MEMS) technology in optical communications today is in building large non-blocking optical crossconnects based on arrays of tiltable micro-mirrors. The complexity for these crossconnects to make all possible connections lies in the calibration or fine-tuning of the mirror tilt angles to optimize the transmissivity through each possible input/output pair. The result from the fine-tuning process that produces optimization at one point in time, however, does not guarantee optimization for future attempts. This thesis models the transmissivity as a function of control variables in the vicinity of an optimal point and uses this model to re-optimize the connections quickly when a connection is reestablished. The re-optimization algorithm achieves the goal of optimizing quickly by requiring that some prior knowledge about each connection is already known. Scalable methods for representing the per-connection transmissivity model are also studied. Experimental results of the algorithm performance on real crossconnect systems are reported, including connection setup in under 50 milliseconds.
by Piyajit Phanaphat.
M.Eng.
Mahmood, Zohaib. "Algorithms for passive dynamical modeling and passive circuit realizations." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/97760.
Повний текст джерелаThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 163-174).
The design of modern electronic systems is based on extensive numerical simulations, aimed at predicting the overall system performance and compliance since early design stages. Such simulations rely on accurate dynamical models. Linear passive components are described by their frequency response in the form of admittance, impedance or scattering parameters which are obtained by physical measurements or electromagnetic field simulations. Numerical dynamical models for these components are constructed by a fitting to frequency response samples. In order to guarantee stable system level simulations, the dynamical models of the passive components need to preserve the passivity property (or inability to generate power), in addition to being causal and stable. A direct formulation results into a non-convex nonlinear optimization problem which is difficult to solve. In this thesis, we propose multiple algorithms that fit linear passive multiport dynamical models to given frequency response samples. The algorithms are based on convex relaxations of the original non-convex problem. The proposed techniques improve accuracy and computational complexity compared to the existing approaches. Compared to sub-optimal schemes based on singular value or Hamiltonian eigenvalue perturbation, we are able to guarantee convergence to the optimal solution within the given relaxation. Compared to convex formulations based on direct Bounded-Real (or Positive-Real) Lemma constraints, we are able to reduce both memory and time requirements by orders of magnitude. We show how these models can be extended to include geometrical and design parameters. We have applied our passive modeling algorithms and developed new strategies to realize passive multiport circuits to decouple multichannel radio frequency (RF) arrays, specifically for magnetic resonance imaging (MRI) applications. In a coupled parallel transmit array, because of the coupling, the power delivered to a channel is partially distributed to other channels and is dissipated in the circulators. This dissipated power causes a significant reduction in the power efficiency of the overall system. In this work, we propose an automated eigen-decomposition based approach to designing a passive decoupling matrix interfaced between the RF amplifiers and the coils. The decoupling matrix, implemented via hybrid couplers and reactive elements, is optimized to ensure that all forward power is delivered to the load. The results show that our decoupling matrix achieves nearly ideal decoupling. The methods presented in this work scale to any arbitrary number of channels and can be readily applied to other coupled systems such as antenna arrays.
by Zohaib Mahmood.
Ph. D.
Lashley, Matthew Bevly David M. Hung John Y. "Modeling and performance analysis of GPS vector tracking algorithms." Auburn, Ala., 2009. http://hdl.handle.net/10415/2009.
Повний текст джерелаNazarian, Bamshad. "Integrated Field Modeling." Doctoral thesis, Norwegian University of Science and Technology, Faculty of Engineering Science and Technology, 2003. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-84.
Повний текст джерелаThis research project studies the feasibility of developing and applying an integrated field simulator to simulate the production performance of an entire oil or gas field. It integrates the performance of the reservoir, the wells, the chokes, the gathering system, the surface processing facilities and, whenever applicable, gas and water injection systems.
The approach adopted for developing the integrated simulator is to couple existing commercial reservoir and process simulators using available linking technologies. The simulators are dynamically linked and customized into a single hybrid application that benefits from the concept of open software architecture. The integrated field simulator is linked to an optimization routine developed based on the genetic algorithm search strategies. This enables optimization of the system at field level, from the reservoir to the process. Modeling the wells and the gathering network is achieved by customizing the process simulator.
This study demonstrates that the integrated simulation improves currentcapabilities to simulate the performance of an entire field and optimize its design. This is achieved by evaluating design options including spread and layout of the wells and gathering system, processing alternatives, reservoir development schemes, and production strategies.
Effectiveness of the integrated simulator is demonstrated and tested through several field-level case studies that discuss and investigate technical problems relevant to offshore field development. The case studies cover topics such as process optimization, optimum tie-in of satellite wells into existing process facilities, optimal well location, and field layout assessment of a high pressure high temperature deepwater oil field.
Case study results confirm the viability of the total field simulator by demonstrating that the field performance simulation and optimal design were obtained in an automated process with reasonable computation time. No significant simplifying assumptions were required to solve the system and tedious manual data transfer between simulators, as conventionally practiced, was avoided.
Shi, Tian. "Novel Algorithms for Understanding Online Reviews." Diss., Virginia Tech, 2021. http://hdl.handle.net/10919/104998.
Повний текст джерелаDoctor of Philosophy
Nowadays, online reviews are playing an important role in our daily lives. They are also critical to the success of many e-commerce and local businesses because they can help people build trust in brands and businesses, provide insights into products and services, and improve consumers' confidence. As a large number of reviews accumulate every day, a central research problem is to build an artificial intelligence system that can understand and interact with these reviews, and further use them to offer customers better support and services. In order to tackle challenges in these applications, we first have to get an in-depth understanding of online reviews. In this dissertation, we focus on the review understanding problem and develop machine learning and natural language processing tools to understand reviews and learn structured knowledge from unstructured reviews. We have addressed the review understanding problem in three directions, including understanding a collection of reviews, understanding a single review, and understanding a piece of a review segment. In the first direction, we proposed a short-text topic modeling method to extract topics from review corpora that consist of primary complaints of consumers. In the second direction, we focused on building sentiment analysis models to predict the opinions of consumers from their reviews. Our deep learning models can provide good prediction accuracy as well as a human-understandable explanation for the prediction. In the third direction, we develop an aspect detection method to automatically extract sentences that mention certain features consumers are interested in, from reviews, which can help customers efficiently navigate through reviews and help businesses identify the advantages and disadvantages of their products.
Ravaglia, Leonardo. "Modeling and control algorithms for product phasing using smart belts." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2016.
Знайти повний текст джерелаIakymchuk, Roman [Verfasser]. "Performance modeling and prediction for linear algebra algorithms / Roman Iakymchuk." Aachen : Hochschulbibliothek der Rheinisch-Westfälischen Technischen Hochschule Aachen, 2012. http://d-nb.info/1026308690/34.
Повний текст джерелаO'Connor, Ruaidhrí M. (Ruaidhrí Manfried). "A distributed discrete element modeling environment : algorithms, implementation and applications." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/11184.
Повний текст джерелаLuo, Yuan Ph D. Massachusetts Institute of Technology. "Towards unified biomedical modeling with subgraph mining and factorization algorithms." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/101575.
Повний текст джерелаCataloged from PDF version of thesis.
Includes bibliographical references (pages 157-181).
This dissertation applies subgraph mining and factorization algorithms to clinical narrative text, ICU physiologic time series and computational genomics. These algorithms aims to build clinical models that improve both prediction accuracy and interpretability, by exploring relational information in different biomedical data modalities including clinical narratives, physiologic time series and exonic mutations. This dissertation focuses on three concrete applications: implicating neurodevelopmentally coregulated exon clusters in phenotypes of Autism Spectrum Disorder (ASD), predicting mortality risk of ICU patients based on their physiologic measurement time series, and identifying subtypes of lymphoma patients based on pathology report text. In each application, we automatically extract relational information into a graph representation and collect important subgraphs that are of interest. Depending on the degree of structure in the data format, heavier machinery of factorization models becomes necessary to reliably group important subgraphs. We demonstrate that these methods lead to not only improved performance but also better interpretability in each application.
by Yuan Luo.
Ph. D.
Lubin, Miles (Miles C. ). "Mixed-integer convex optimization : outer approximation algorithms and modeling power." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113434.
Повний текст джерелаThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 137-143).
In this thesis, we study mixed-integer convex optimization, or mixed-integer convex programming (MICP), the class of optimization problems where one seeks to minimize a convex objective function subject to convex constraints and integrality restrictions on a subset of the variables. We focus on two broad and complementary questions on MICP. The first question we address is, "what are efficient methods for solving MICP problems?" The methodology we develop is based on outer approximation, which allows us, for example, to reduce MICP to a sequence of mixed-integer linear programming (MILP) problems. By viewing MICP from the conic perspective of modern convex optimization as defined by Ben-Tal and Nemirovski, we obtain significant computational advances over the state of the art, e.g., by automating extended formulations by using disciplined convex programming. We develop the first finite-time outer approximation methods for problems in general mixed-integer conic form (which includes mixed-integer second-order-cone programming and mixed-integer semidefinite programming) and implement them in an open-source solver, Pajarito, obtaining competitive performance with the state of the art. The second question we address is, "which nonconvex constraints can be modeled with MICP?" This question is important for understanding both the modeling power gained in generalizing from MILP to MICP and the potential applicability of MICP to nonconvex optimization problems that may not be naturally represented with integer variables. Among our contributions, we completely characterize the case where the number of integer assignments is bounded (e.g., mixed-binary), and to address the more general case we develop the concept of "rationally unbounded" convex sets. We show that under this natural restriction, the projections of MICP feasible sets are well behaved and can be completely characterized in some settings.
by Miles Lubin.
Ph. D.
Nicholson, Bethany. "Applications, Modeling Tools, and Parallel Solution Algorithms for Dynamic Optimization." Research Showcase @ CMU, 2016. http://repository.cmu.edu/dissertations/732.
Повний текст джерелаKenniche, Hichem. "Large Wireless Sensor Networks : Some Contributions to Modeling and Algorithms." Paris 13, 2011. http://www.theses.fr/2011PA132021.
Повний текст джерелаLe concept des réseaux de capteurs sans fil , issu de la fusion des progrès en radiocommunication et en micro-électronique est apparu assez récemment et offre un nouveau paradigme pour la définition de l’intelligence ambiante. Les réseaux de capteurs sont constitués d’un ensemble de noeuds qui sont déployés en grand nombre et qui interagissent avec l’environnement (mesure ou action sur des paramètres), dont le large spectre applicatif s’étend de la surveillance environnementale à la détection de vie sur d’autres planètes. Cependant, la conception de tels réseaux de grande taille se heurte à un certain nombre de difficultés techniques provenant des contraintes imposés par les capacités réduites des capteurs (individuels): basse puissance, énergie limité, capacité de stockage et communication réduite. Cette thèse est consacrée d’abord aux problèmes de modélisation des réseaux de capteurs sans fil. A savoir, comment trouver un modèle de communication réaliste. Un réseau de communication se modélise par un graphe. Le cadre de réseaux de capteurs sans fil ne va pas déroger à la règle et les capteurs, les noeuds de communication seront modélisés par les sommets du graphe tandis que les arêtes représenteront les liens physiques de communication entre ces éléments communicants. La notion de graphe est importante car un grand nombre de paramètres employés en théorie des graphes permettent de quantifier des propriétés physique, topologiques ou des performances des réseaux modélisés. Toutefois, dans l’avenir les applications impliqueront un très grand nombre de capteurs à déployer sur de grande zones souvent inaccessibles, ce qui conduirait à un déploiement aléatoire rendant le les modèles de graphe classique obsolète. Nous montrons que la stratégie aléatoire est la seule facon de déployer les réseaux de capteurs et par conséquent la modélisation par les graphes aléatoires géométriques et les graphe de Poisson est la plus appropriée. Nous développons ensuite nos travaux concernant la k-couverture, définit comme tout point physique de la zone de d´ ploiement doit être couvert par au moins k noeuds actifs. Une notion très importante car nécessaire au bon fonctionnement du réseau car impliquant le connexion. Pour étudier les réseaux de capteurs aléatoires et pour pouvoir mettre à profit leurs densités afin de concevoir des protocoles qui permettent de maintenir un haut degré de couverture tout en prolongeant la durée de vie du réseau, nous étudions les limites fondamentales de la durée vie d’un réseau de capteurs que tout algorithme peut atteindre. Pour un ensemble de n points suivants un processus ponctuels de Poissons d’intensité lambda dans une région de taille S avec chaque point couvrant un disque unité, nous donnerons des résultats concernant les valeurs requise pour garantir la k-couverture pour toute valeurs de k. Nous terminons enfin par l’étude en moyenne d’algorithmes pour la recherche de stable maximal dans les graphes aléatoires. Nous examinons d’abord la performance du plus simple des algorithmes séquentiel sur deux types de graphes aléatoires. Dans le premier cas, nous considérons des graphes de Poisson, on établira que l’algorithme glouton trouve un ensemble indépendant maximal dont la loi limite est asymptotiquement normal. Dans le second cas, nous étudions le même algorithme sur les graphes d’Erd˝ os-Rényi et montreront que la distribution limite n’existe pas. Enfin, nous présenterons et analyserons un algorithmes distribués probabilistes optimal (en temps et en bits)
Choi, Bong-Jin. "Statistical Analysis, Modeling, and Algorithms for Pharmaceutical and Cancer Systems." Scholar Commons, 2014. https://scholarcommons.usf.edu/etd/5200.
Повний текст джерелаChu, Chung-kwan. "Computationally efficient passivity-preserving model order reduction algorithms in VLSI modeling." Click to view the E-thesis via HKUTO, 2007. http://sunzi.lib.hku.hk/hkuto/record/B38719551.
Повний текст джерелаSun, Mingxuan. "Visualizing and modeling partial incomplete ranking data." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/45793.
Повний текст джерелаTolentino, Sean Lucio. "Effective and efficient algorithms for simulating sexually transmitted diseases." Diss., University of Iowa, 2014. https://ir.uiowa.edu/etd/1509.
Повний текст джерелаBalmer, Michael. "Travel demand modeling for multi-agent transport simulations : algorithms and systems /." Zürich : ETH, 2007. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=17238.
Повний текст джерелаMüller, Johannes Christian [Verfasser]. "Auctions in Exchange Trading Systems: Modeling Techniques and Algorithms / Johannes Müller." Berlin : epubli GmbH, 2014. http://d-nb.info/106322747X/34.
Повний текст джерелаChu, Chung-kwan, and 朱頌君. "Computationally efficient passivity-preserving model order reduction algorithms in VLSI modeling." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2007. http://hub.hku.hk/bib/B38719551.
Повний текст джерелаWan, Jin Hao M. Eng Massachusetts Institute of Technology. "Geometric modeling and optimization in 3D solar cells : implementation and algorithms." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/92087.
Повний текст джерелаCataloged from PDF version of thesis.
Includes bibliographical references (page 63).
Conversion of solar energy in three-dimensional (3D) devices has been essentially untapped. In this thesis, I design and implement a C++ program that models and optimizes a 3D solar cell ensemble embedded in a given landscape. The goal is to find the optimum arrangement of these solar cells with respect to the landscape buildings so as to maximize the total energy collected. On the modeling side, in order to calculate the energies generated from both direct and reflected sunlight, I store all the geometric inputs in a binary space partition tree; this data structure in turn efficiently supports a crucial polygon clipping algorithm. On the optimization side, I deploy simulated annealing (SA). Both advantages and limitation of SA lead me to restrict the solar cell docking sites to orthogonal grids imposed on the building surfaces. The resulting program is an elegant trade-off between accuracy and efficiency.
by Jin Hao Wan.
M. Eng.
Jin, Fang. "Algorithms for Modeling Mass Movements and their Adoption in Social Networks." Diss., Virginia Tech, 2016. http://hdl.handle.net/10919/72292.
Повний текст джерелаPh. D.
Sun, Fangzhou. "Modeling, Analysis, and Algorithms for Some Supply Chain Logistics Optimization Problems." Diss., Virginia Tech, 2019. http://hdl.handle.net/10919/101054.
Повний текст джерелаDoctor of Philosophy
Williams, Kjerstin Irja Burdick Joel Wakeman. "Multi-robot systems : modeling swarm dynamics and designing inspection planning algorithms /." Diss., Pasadena, Calif. : Caltech, 2006. http://resolver.caltech.edu/CaltechETD:etd-05192006-063455.
Повний текст джерелаLadkau, Marcel. "Stochastic volatility Libor modeling and efficient algorithms for optimal stopping problems." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät, 2016. http://dx.doi.org/10.18452/17559.
Повний текст джерелаThe work presented here deals with several aspects of financial mathematics. An extended Libor market model is considered offering enough flexibility to accurately calibrate to various market data for caplets and swaptions. Moreover the evaluation of more complex financial derivatives is considered, for instance by simulation. In high dimension such simulations can be very time consuming. Possible improvements regarding the complexity of the simulation are shown, e.g. factor reduction. In addition the well known Andersen simulation scheme is extended from one to multiple dimensions using the concept of moment matching for the approximation of the vola process in a Heston model. This results in an improved convergence of the whole process thus yielding a reduced complexity. Further the problem of evaluating so called American options as optimal stopping problem is considered. For an efficient evaluation of these options, particularly in high dimensions, a simulation based approach offering dimension independent convergence often happens to be the only practicable solution. A new method of variance reduction given by the multilevel idea is applied to this approach. A lower bound for the option price is obtained using “multilevel policy iteration” method. Convergence rates for the simulation of the option price are obtained and a detailed complexity analysis is presented. Finally the valuation of American options under model uncertainty is examined. This lifts the restriction of considering one particular probabilistic model only. Different models might be plausible and may lead to different option values. This approach leads to a non-linear expectation functional, calling for a generalization of the standard expectation case. A generalized Snell envelope is obtained, enabling a backward recursion via Bellman principle. A numerical algorithm to valuate American options under ambiguity provides lower and upper price bounds.
Groder, Seth. "Modeling and synthesis of the HD photo compression algorithm /." Online version of thesis, 2008. http://hdl.handle.net/1850/7118.
Повний текст джерелаXu, Tianze. "Variational Inequality Based Dynamic Travel Choice Modeling." University of Cincinnati / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1234999856.
Повний текст джерелаLee, Kyoung-Jin. "Efficient ray tracing algorithms based on wavefront construction and model based interpolation method." Texas A&M University, 2005. http://hdl.handle.net/1969.1/3771.
Повний текст джерелаZhang, Yong. "Robust algorithms for property recovery in motion modeling, medical imaging and biometrics." [Tampa, Fla.] : University of South Florida, 2005. http://purl.fcla.edu/fcla/etd/SFE0001177.
Повний текст джерелаIentilucci, Emmett J. "Hyperspectral sub-pixel target detection using hybrid algorithms and physics based modeling /." Link to online version, 2005. https://ritdml.rit.edu/dspace/handle/1850/1185.
Повний текст джерелаChavannes, Nicolas Pierre. "Local mesh refinement algorithms for enhanced modeling capabilities in the FDTD method /." Konstanz : Hartung-Gorre, 2002. http://www.loc.gov/catdir/toc/fy0801/2006483066.html.
Повний текст джерелаMirikitani, Derrick Takeshi. "Sequential recurrent connectionist algorithms for time series modeling of nonlinear dynamical systems." Thesis, Goldsmiths College (University of London), 2010. http://research.gold.ac.uk/3239/.
Повний текст джерелаPang, Huey, and 彭栩怡. "Computer modeling of building-integrated photovoltaic systems using genetic algorithms for optimization." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B31227764.
Повний текст джерелаPedjeu, Jean-Claude. "Multi-time Scales Stochastic Dynamic Processes: Modeling, Methods, Algorithms, Analysis, and Applications." Scholar Commons, 2012. http://scholarcommons.usf.edu/etd/4383.
Повний текст джерелаFoulds, James Richard. "Latent Variable Modeling for Networks and Text| Algorithms, Models and Evaluation Techniques." Thesis, University of California, Irvine, 2014. http://pqdtopen.proquest.com/#viewpdf?dispub=3631094.
Повний текст джерелаIn the era of the internet, we are connected to an overwhelming abundance of information. As more facets of our lives become digitized, there is a growing need for automatic tools to help us find the content we care about. To tackle the problem of information overload, a standard machine learning approach is to perform dimensionality reduction, transforming complicated high-dimensional data into a manageable, low-dimensional form. Probabilistic latent variable models provide a powerful and elegant framework for performing this transformation in a principled way. This thesis makes several advances for modeling two of the most ubiquitous types of online information: networks and text data.
Our first contribution is to develop a model for social networks as they vary over time. The model recovers latent feature representations of each individual, and tracks these representations as they change dynamically. We also show how to use text information to interpret these latent features.
Continuing the theme of modeling networks and text data, we next build a model of citation networks. The model finds influential scientific articles and the influence relationships between the articles, potentially opening the door for automated exploratory tools for scientists. The increasing prevalence of web-scale data sets provides both an opportunity and a challenge. With more data we can fit more accurate models, as long as our learning algorithms are up to the task. To meet this challenge, we present an algorithm for learning latent Dirichlet allocation topic models quickly, accurately and at scale. The algorithm leverages stochastic techniques, as well as the collapsed representation of the model. We use it to build a topic model on 4.6 million articles from the open encyclopedia Wikipedia in a matter of hours, and on a corpus of 1740 machine learning articles from the NIPS conference in seconds.
Finally, evaluating the predictive performance of topic models is an important yet computationally difficult task. We develop one algorithm for comparing topic models, and another for measuring the progress of learning algorithms for these models. The latter method achieves better estimates than previous algorithms, in many cases with an order of magnitude less computational effort.
Toledo, Sivan Avraham. "Quantitative performance modeling of scientific computations and creating locality in numerical algorithms." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/37768.
Повний текст джерелаIncludes bibliographical references (p. 141-150) and index.
by Sivan Avraham Toledo.
Ph.D.
Alsadhan, Majed. "An application of topic modeling algorithms to text analytics in business intelligence." Thesis, Kansas State University, 2014. http://hdl.handle.net/2097/17580.
Повний текст джерелаDepartment of Computing and Information Sciences
Doina Caragea
William H. Hsu
In this work, we focus on the task of clustering businesses in the state of Kansas based on the content of their websites and their business listing information. Our goal is to cluster the businesses and overcome the challenges facing current approaches such as: data noise, low number of clustered businesses, and lack of evaluation approach. We propose an LSA-based approach to analyze the businesses’ data and cluster those businesses by using Bisecting K-Means algorithm. In this approach, we analyze the businesses’ data by using LSA and produce businesses’ representations in a reduced space. We then use the businesses’ representations to cluster the businesses by applying the Bisecting K-Means algorithm. We also apply an existing LDA-based approach to cluster the businesses and compare the results with our proposed LSA-based approach at the end. In this work, we evaluate the results by using a human-expert-based evaluation procedure. At the end, we visualize the clusters produced in this work by using Google Earth and Tableau. According to our evaluation procedure, the LDA-based approach performed slightly bet- ter then the LSA-based approach. However, with the LDA-based approach, there were some limitations which are: low number of clustered businesses, and not being able to produce a hierarchical tree for the clusters. With the LSA-based approach, we were able to cluster all the businesses and produce a hierarchical tree for the clusters.
Jin, Ying. "New Algorithms for Mining Network Datasets: Applications to Phenotype and Pathway Modeling." Diss., Virginia Tech, 2009. http://hdl.handle.net/10919/40493.
Повний текст джерелаPh. D.