Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Generating trees.
Dissertationen zum Thema „Generating trees“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "Generating trees" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.
1
Belbaraka, Mounir. „Algorithms for generating and coding B-Trees“. Thesis, University of Ottawa (Canada), 1996. http://hdl.handle.net/10393/9826.
Der volle Inhalt der QuelleAnnotation:
Gupta, Lee and Wong described algorithms for generating 2-3 trees and B-trees with a given number of nodes and left as open problems whether algorithms exist that generate them in lexicographic order, and whether it is possible to generate 2-3 trees (GLW) or B-Trees (GLW1) in constant average delay, exclusive of the output. In this thesis, we propose solutions to the open problems in both (GLW) and (GLW1). The main results of this thesis are: introducing a new notation of B-Trees which provides lexicographic order and a proof that (GLW) and (GLW1) algorithms do have a constant average delay (thus solving two open problems posed by Gupta, Lee and Wong). A new algorithm for generating 2-3 trees, with a given number of nodes, in lexicographic order is also presented. This algorithm is an improvement over (GLW) in terms of time complexity and storage. An algorithm for lexicographic generation of B-Trees with a given number of leaves is described. Finally new algorithms for coding and decoding B-Trees sequentially are described.
2
Doherty, Kevin Anthony James. „Generating neural trees with topology preserving clustering“. Thesis, University of Hertfordshire, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.427540.
Der volle Inhalt der Quelle
3
PEREIRA, FELIPE DE ALBUQUERQUE MELLO. „A FRAMEWORK FOR GENERATING BINARY SPLITS IN DECISION TREES“. PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2018. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=35783@1.
Der volle Inhalt der QuelleAnnotation:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIROCONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO
Nesta dissertação é apresentado um framework para desenvolver critérios de split para lidar com atributos nominais multi-valorados em árvores de decisão. Critérios gerados por este framework podem ser implementados para rodar em tempo polinomial no número de classes e valores, com garantia teórica de produzir um split próximo do ótimo. Apresenta-se também um estudo experimental, utilizando datasets reais, onde o tempo de execução e acurácia de métodos oriundos do framework são avaliados.
In this dissertation we propose a framework for designing splitting criteria for handling multi-valued nominal attributes for decision trees. Criteria derived from our framework can be implemented to run in polynomial time in the number of classes and values, with theoretical guarantee of producing a split that is close to the optimal one. We also present an experimental study, using real datasets, where the running time and accuracy of the methods obtained from the framework are evaluated.
4
McCann, David Page. „Using GIS and landowner survey to determine if the Forest Stewardship Program is effective at generating involvement in forest health issues in West Virginia“. Morgantown, W. Va. : [West Virginia University Libraries], 2005. https://eidr.wvu.edu/etd/documentdata.eTD?documentid=4420.
Der volle Inhalt der QuelleAnnotation:
Thesis (M.S.)--West Virginia University, 2005.Title from document title page. Document formatted into pages; contains vii, 209 p. : ill., col. maps. Includes abstract. Includes bibliographical references (p. 49-52).
5
Cervetti, Matteo. „Pattern posets: enumerative, algebraic and algorithmic issues“. Doctoral thesis, Università degli studi di Trento, 2003. http://hdl.handle.net/11572/311140.
Der volle Inhalt der QuelleAnnotation:
The study of patterns in combinatorial structures has grown up in the past few
decades to one of the most active trends of research in combinatorics. Historically,
the study of permutations which are constrained by not containing subsequences
ordered in various prescribed ways has been motivated by the problem
of sorting permutations with certain devices. However, the richness of this notion
became especially evident from its plentiful appearances in several very different
disciplines, such as pure mathematics, mathematical physics, computer science,
biology, and many others. In the last decades, similar notions of patterns have
been considered on discrete structures other than permutations, such as integer
sequences, lattice paths, graphs, matchings and set partitions. In the first part of
this talk I will introduce the general framework of pattern posets and some classical
problems about patterns. In the second part of this talk I will present some
enumerative results obtained in my PhD thesis about patterns in permutations,
lattice paths and matchings. In particular I will describe a generating tree with
a single label for permutations avoiding the vincular pattern 1 - 32 - 4, a finite
automata approach to enumerate lattice excursions avoiding a single pattern and
some results about matchings avoiding juxtapositions and liftings of patterns.
6
Kubiš, František. „Generování 3D stromů na základě vzorových obrázků“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2013. http://www.nusl.cz/ntk/nusl-236420.
Der volle Inhalt der QuelleAnnotation:
Master's thesis studies the possibilities of generating 3D trees using variety of methods including context-free grammars and L-systems. Master's thesis also includes chapter on evolutionary and genetic algorithms, which briefly summarize their function. In this project genetic algorithm which takes 2D image of tree and the beginning of its trunk is proposed. Based on this information it will generate 3D tree which is visually close to the original image. In addition to methods of generating trees, reader will get information about processing input image and designing test application.
7
Cervetti, Matteo. „Pattern posets: enumerative, algebraic and algorithmic issues“. Doctoral thesis, Università degli studi di Trento, 2021. http://hdl.handle.net/11572/311152.
Der volle Inhalt der QuelleAnnotation:
The study of patterns in combinatorial structures has grown up in the past few decades to one of the most active trends of research in combinatorics. Historically, the study of permutations which are constrained by not containing subsequences ordered in various prescribed ways has been motivated by the problem of sorting permutations with certain devices. However, the richness of this notion
became especially evident from its plentiful appearances in several very different disciplines, such as pure mathematics, mathematical physics, computer science,biology, and many others. In the last decades, similar notions of patterns have been considered on discrete structures other than permutations, such as integer sequences, lattice paths, graphs, matchings and set partitions. In the first part of
this talk I will introduce the general framework of pattern posets and some classical problems about patterns. In the second part of this talk I will present some enumerative results obtained in my PhD thesis about patterns in permutations, lattice paths and matchings. In particular I will describe a generating tree with a single label for permutations avoiding the vincular pattern 1 - 32 - 4, a finite automata approach to enumerate lattice excursions avoiding a single pattern and some results about matchings avoiding juxtapositions and liftings of patterns.
8
Cervetti, Matteo. „Pattern posets: enumerative, algebraic and algorithmic issues“. Doctoral thesis, Università degli studi di Trento, 2021. http://hdl.handle.net/11572/311152.
Der volle Inhalt der QuelleAnnotation:
The study of patterns in combinatorial structures has grown up in the past few
decades to one of the most active trends of research in combinatorics. Historically,
the study of permutations which are constrained by not containing subsequences
ordered in various prescribed ways has been motivated by the problem
of sorting permutations with certain devices. However, the richness of this notion
became especially evident from its plentiful appearances in several very different
disciplines, such as pure mathematics, mathematical physics, computer science,
biology, and many others. In the last decades, similar notions of patterns have
been considered on discrete structures other than permutations, such as integer
sequences, lattice paths, graphs, matchings and set partitions. In the first part of
this talk I will introduce the general framework of pattern posets and some classical
problems about patterns. In the second part of this talk I will present some
enumerative results obtained in my PhD thesis about patterns in permutations,
lattice paths and matchings. In particular I will describe a generating tree with
a single label for permutations avoiding the vincular pattern 1 - 32 - 4, a finite
automata approach to enumerate lattice excursions avoiding a single pattern and
some results about matchings avoiding juxtapositions and liftings of patterns.
9
Ma̧dry, Aleksander. „Faster generation of random spanning trees“. Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/55126.
Der volle Inhalt der QuelleAnnotation:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.Cataloged from PDF version of thesis.
Includes bibliographical references (p. 39-40).
In this thesis, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is within a multiplicative (1+6) of uniform in expected time ... . This improves the sparse graph case of the best previously known worst-case bound of O(min{mn, n2. 376}), which has stood for twenty years. To achieve this goal, we exploit the connection between random walks on graphs and electrical networks to introduce a new approach to the problem that integrates discrete random walk-based techniques with continuous linear algebraic methods. We believe that our use of electrical networks and sparse linear system solvers in conjunction with random walks and combinatorial partitioning techniques is a useful paradigm that will find further applications in algorithmic graph theory. This work was done in collaboration with Jonathan Kelner.
by Aleksander Ma̧dry.
S.M.
10
Selley, Gordon. „TWIGS - Trees and Woods Image Generation System“. Thesis, Coventry University, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.305956.
Der volle Inhalt der Quelle
11
Cuadrado, Guevara Marlyn Dayana. „Multistage scenario trees generation for renewable energy systems optimization“. Doctoral thesis, Universitat Politècnica de Catalunya, 2020. http://hdl.handle.net/10803/670251.
Der volle Inhalt der QuelleAnnotation:
The presence of renewables in energy systems optimization have generated a high level of uncertainty in the data, which has led to a need for applying stochastic optimization to modelling problems with this characteristic. The method followed in this thesis is multistage Stochastic Programming (MSP). Central to MSP is the idea of representing uncertainty (which, in this case, is modelled with a stochastic process) using scenario trees. In this thesis, we developed a methodology that starts with available historical data; generates a set of scenarios for each random variable of the MSP model; define individual scenarios that are used to build the initial stochastic process (as a fan or an initial scenario tree); and builds the final scenario trees that are the approximation of the stochastic process. The methodology proposes consists of two phases. In the first phase, we developed a procedure similar to Muñoz et al. (2013), with the difference being that the VAR models are used to predict the next day for each random parameter of the MSP models. In the second phase, we build scenario trees from the Forward Tree Construction Algorithm(FTCA), developed by Heitsch and Römisch (2009a); and an adapted version of DynamicTree Generation with a Flexible Bushiness Algorithm (DTGFBA), developed by Pflugand Pichler (2014, 2015). This methodology was used to generate scenario trees for two MSP models. A first model, Multistage Stochastic Wind Battery Virtual Power Plantmodel (MSWBVPP model) and to a second model, which is the Multistage StochasticOptimal Operation of Distribution Networks model (MSOODN model). We developed extensive computational experiments for the MSWBVPP model and generated scenario trees with real data, which were based on MIBEL prices and wind power generation of the real wind farm called Espina, located in Spain. For the MSOODN model, we obtained scenario trees by also using real data from the power load provided by FEEC-UNICAMP and photovoltaic generation of a distribution grid located in Brazil. The results show that the scenario tree generation methodology proposed in this thesis can obtain suitable scenario trees for each MSP model. In addition, results were obtained for the model using the scenario trees as input data. In the case of the MSWBVPP model, we solved three different case studies corresponding to three different hypotheses on the virtual power plant’s participation in electricity markets. In the case of the MSOODN model, two test cases were solved, with the results indicating that the EDN satisfied the limits imposed for each test case. Furthermore, the BESS case gave good results when taking into account the uncertainty in the model. Finally, the MSWBVPP model was used to study the relative performance of the FTCA and DTGFBA scenario trees, specifically by analyzing the value of the stochastic solution for the 366 daily optimal bidding problems. To this end, a variation of the classical VSS (the so-called “Forecasted Value of the Stochastic Solution”, FVSS) was defined and used together with the classical VSS.a presencia de energías renovables en la optimización de sistemas energéticos hagenerado un alto nivel de incertidumbre en los datos, lo que ha llevado a la necesidad de aplicar técnicas de optimización estocástica para modelar problemas con estas características. El método empleado en esta tesis es programación estocástica multietapa (MSP, por sus siglas en inglés). La idea central de MSP es representar la incertidumbre (que en este caso es modelada mediante un proceso estocástico), mediante un árbol de escenarios. En esta tesis, desarrollamos una metodología que parte de una data histórica, la cual está disponible; generamos un conjunto de escenarios por cada variable aleatoria del modelo MSP; definimos escenarios individuales, que luego serán usados para construir el proceso estocástico inicial (como un fan o un árbol de escenario inicial); y, por último, construimos el árbol de escenario final, el cual es la aproximación del proceso estocástico. La metodología propuesta consta de dos fases. En la primera fase, desarrollamos un procedimiento similar a Muñoz et al. (2013), con la diferencia de que para las predicciones del próximo día para cada variable aleatoria del modelo MSP usamos modelos VAR. En la segunda fase construimos árboles de escenarios mediante el "Forward Tree Construction Algorithm (FTCA)", desarrollado por Heitsch and Römisch (2009a); y una versión adaptada del "Dynamic Tree Generation with a Flexible Bushiness Algorithm (DTGFBA)", desarrolado por Pflug and Pichler (2014, 2015). Esta metodología fue usada para generar árboles de escenarios para dos modelos MSP. El primer modelo fue el "Multistage Stochastic Wind Battery Virtual Power Plant model (modelo MSWBVPP)", y el segundo modelo es el "Multistage Stochastic Optimal Operation of Distribution Networks model (MSOODN model)". Para el modelo MSWBVPP desarrollamos extensivos experimentos computacionales y generamos árboles de escenarios a partir de datos realesde precios MIBEL y generación eólica de una granja eólica llamada Espina, ubicada en España. Para el modelo MSOODN obtuvimos árboles de escenarios basados en datos reales de carga, provistos por FEEC-UNICAMP y de generación fotovoltaica de una red de distribución localizada en Brasil. Los resultados muestran que la metodología de generación de árboles de escenarios propuesta en esta tesis, permite obtener árboles de escenarios adecuados para cada modelo MSP. Adicionalmente, obtuvimos resultados para los modelos MSP usando como datos de entrada los árboles de escenarios. En el caso del modelo MSWBVPP, resolvimos tres casos de estudio correspondiente a tres hipótesis basadas en la participación de una VPP en los mercados de energía. En el caso del modelo MSOODN, dos casos de prueba fueron resueltos, mostrando que la EDN satisface los límites impuestos para cada caso de prueba, y además, que el caso con BESS da mejores resultados cuando se toma en cuenta el valor la incertidumbre en el modelo. Finalmente, el modelo MSWBVPP fue usado para estudiar el desempeño relativo de los árboles de escenarios FTCA y DTGFBA, específicamente, analizando el valor de la solución estocástica para los 366 problemas de oferta óptima. Para tal fin, una variación del clásico VSS (denominado "Forecasted Value of the Stochastic Solution", FVSS) fue definido y usado junto al clásico VSS.
12
Juuso, Lina. „Procedural generation of imaginative trees using a space colonization algorithm“. Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-35577.
Der volle Inhalt der QuelleAnnotation:
The modeling of trees is challenging due to their complex branching structures. Three different ways to generate trees are using real world data for reconstruction, interactive modeling methods and modeling with procedural or rule-based systems. Procedural content generation is the idea of using algorithms to automate content creation processes, and it is useful in plant modeling since it can generate a wide variety of plants that can adapt and react to the environment and changing conditions. This thesis focuses on and extends a procedural tree generation technique that uses a space colonization algorithm to model the tree branches' competition for space, and shifts the previous works' focus from realism to fantasy. The technique satisfied the idea of using interaction between the tree's internal and external factors to determine its final shape, by letting the designer control the where and the how of the tree's growth process. The implementation resulted in a tree generation application where the user's imagination decides the limit of what can be produced, and if that limit is reached can the application be used to randomly generate a wide variety of trees and tree-like structures. A motivation for many researchers in the procedural content generation area is how it can be used to augment human imagination. The result of this thesis can be used for that, by stepping away from the restrictions of realism, and with ease let the user generate widely diverse trees, that are not necessarily realistic but, in most cases, adapts to the idea of a tree.
13
Andersson, Johan. „Automated Fault Tree Generation from Requirement Structures“. Thesis, Linköpings universitet, Fordonssystem, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-122471.
Der volle Inhalt der QuelleAnnotation:
The increasing complexity of today’s vehicles gives drivers help with everything from adaptive cruisecontrol to warning lights for low fuel level. But the increasing functionality also increases the risk offailures in the system. To prevent system failures, different safety analytic methods can be used, e.g.,fault trees and/or FMEA-tables. These methods are generally performed manually, and due to thegrowing system size the time spent on safety analysis is growing with increased risk of human errors. If the safety analysis can be automated, lots of time can be saved. This thesis investigates the possibility to generate fault trees from safety requirements as wellas which additional information, if any, that is needed for the generation. Safety requirements are requirements on the systems functionality that has to be fulfilled for the safety of the system to be guaranteed. This means that the safety of the truck, the driver, and the surroundings, depend on thefulfillment of those requirements. The requirements describing the system are structured in a graphusing contract theory. Contract theory defines the dependencies between requirements and connectsthem in a contract structure. To be able to automatically generate the fault tree for a system, information about the systems failure propagation is needed. For this a Bayesian network is used. The network is built from the contract structure and stores the propagation information in all the nodes of the network. This will result in a failure propagation network, which the fault tree generation will be generated from. The failure propagation network is used to see which combinations of faults in the system can violate thesafety goal, i.e., causing one or several hazards. The result of this will be the base of the fault tree. The automatic generation was tested on two different Scania systems, the fuel level displayand the dual circuit steering. Validation was done by comparing the automatically generated trees withmanually generated trees for the two systems showing that the proposed method works as intended. The case studies show that the automated fault tree generation works if the failure propagationinformation exists and can save a lot of time and also minimize the errors made by manuallygenerating the fault trees. The generated fault trees can also be used to validate written requirementsto by analyzing the fault trees created from them.
14
Säll, Martin, und Fredrik Cronqvist. „Real-time generation of kd-trees for ray tracing using DirectX 11“. Thesis, Blekinge Tekniska Högskola, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-15321.
Der volle Inhalt der QuelleAnnotation:
Context. Ray tracing has always been a simple but effective way to create a photorealistic scene but at a greater cost when expanding the scene. Recent improvements in GPU and CPU hardware have made ray tracing faster, making more complex scenes possible with the same amount of time needed to process the scene. Despite the improvements in hardware ray tracing is still rarely run at a interactive speed. Objectives. The aim of this experiment was to implement a new kdtree generation algorithm using DirectX 11 compute shaders. Methods. The implementation created during the experiment was tested using two platforms and five scenarios where the generation time for the kd-tree was measured in milliseconds. The results where compared to a sequential implementation running on the CPU. Results. In the end the kd-tree generation algorithm implemented did not run within our definition of real-time. Comparing the generation times from the implementations shows that there is a speedup for the GPU implementation compared to our CPU implementation, it also shows linear scaling for the generation time as the number of triangles in the scene increase. Conclusions. Noticeable limitations encountered during the experiment was that the handling of dynamic structures and sorting of arrays are limited which forced us to use less memory efficient solutions.
15
Andersson, Erik W. „Gain and diversity in multi-generation breeding programs /“. Umeå : Swedish Univ. of Agricultural Sciences (Sveriges lantbruksuniv.), 1999. http://epsilon.slu.se/avh/1999/91-576-5629-0.pdf.
Der volle Inhalt der Quelle
16
MA, YUN. „COMPARISON OF LOGISTIC REGRESSION TO LATEST CART TREE STRUCTURE GENERATING ALGORITHMS“. University of Cincinnati / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1123273128.
Der volle Inhalt der Quelle
17
Zornoza, Moreno Enrique. „Model-based approach for automatic generation of IEC-61025 standard compliant fault trees“. Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-40912.
Der volle Inhalt der QuelleAnnotation:
Reliability and safety of complex software-intensive systems are proved to be a crucial matter since most of these systems fulfil tasks, where a failure could lead to catastrophic consequences. For example, in space systems such as satellites, a failure could result in the loss of the satellite. Therefore, a certain level of reliability and safety must be assured for such systems to trust the services they provide. Standards set this level and put requirements for the analysis and assurance of these properties using documented evidence. In particular, European Cooperation for Space Standardization (ECSS) standards for space systems require Fault Tree Analysis(FTA) for identifying the causes of system failure and consequently safety hazards, as well as fault trees as evidence for the assurance of reliability and safety. In this thesis, we present a tool supported model-based approach to generate fault tree automatically from an existing system modelling and analysis toolset. CHESS is a system and dependability modelling toolset and integrates Concerto-FLA to enable the support of failure logic analysis. We proposed a model-based transformation from Concerto-FLA to fault tree model and implemented it as an Eclipse plugin in CHESS toolset. A case study is performed in the aerospace domain; more specifically we modelled Attitude Control System (ACS) and automatically generated IEC-61025-compliant fault trees.AMASS project
18
Walduck, Brett R. G. „Computer simulation of the generation of trees and their conversion into wood products“. Thesis, Queensland University of Technology, 1999. https://eprints.qut.edu.au/37028/1/37028_Walduck_1999.pdf.
Der volle Inhalt der QuelleAnnotation:
A computer simulation process to generate trees and then convert them into wood
products is described. This process was researched and developed to aid Foresters in
predicting the outcomes from varying forest management strategies. A number of
statistical prediction methods were analysed and tested. A nearest neighbour method of
prediction was chosen to generate the parameters of virtual trees with biological
variation taken into account. This prediction method was chosen mainly because of its
local nature and nonparametric form. The virtual trees are cut into various sized logs
and then sawn into boards using defined sawing patterns and stored as ranges in the
Cartesian coordinate system. Storage of the virtual trees and boards uses minimal
computer memory. Value attributes are added to the sawn boards and the recovered
volumes and values are analysed. A Visual Basic 5. 0 package was developed and is
used to simulate the generation and conversion process.
19
Geyer, Alois, Michael Hanke und Alex Weissensteiner. „Scenario Tree Generation and Multi-Asset Financial Optimization Problems“. Elsevier, 2013. http://dx.doi.org/10.1016/j.orl.2013.06.003.
Der volle Inhalt der QuelleAnnotation:
We compare two popular scenario tree generation methods in the
context of financial optimization: Moment matching and scenario reduction.
Using a simple problem with a known analytic solution, we
find that moment matching - accompanied by a check to ensure absence of arbitrage opportunities - replicates this solution precisely. On the other hand, even if the scenario trees generated by scenario reduction are arbitrage-free, the solutions to the approximate optimization
problem represented by the reduced tree are biased and highly variable.
These results hold for correlated and uncorrelated asset returns, as well as for normal and non-normal returns. (authors' abstract)
20
Kaut, Michal. „Scenario tree generation for stochastic programming : cases from finance“. Doctoral thesis, Norwegian University of Science and Technology, Department of Mathematical Sciences, 2003. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-1639.
Der volle Inhalt der QuelleAnnotation:
In recent years, stochastic programming has gained an increasing popularity within the mathematical programming community, mainly because the present computing power allows users to add stochasticity to models that were difficult to solve in deterministic versions only a few years ago. For general information about stochastic programming, see for example Dantzig (1955); Birge and Louveaux (1997), or Kall and Wallace (1994).
As a result, a lot of research has been done on various aspects of stochastic programming. However, scenario generation has remained out of the main field of interest. In this thesis, we try to explain the importance of scenario generation for stochastic programming, as well as provide some methods for both generating the scenarios and testing their quality.
21
Chu, Timothy Sui-Tim. „Genealogy Extraction and Tree Generation from Free Form Text“. DigitalCommons@CalPoly, 2017. https://digitalcommons.calpoly.edu/theses/1796.
Der volle Inhalt der QuelleAnnotation:
Genealogical records play a crucial role in helping people to discover their lineage and to understand where they come from. They provide a way for people to celebrate their heritage and to possibly reconnect with family they had never considered. However, genealogical records are hard to come by for ordinary people since their information is not always well established in known databases. There often is free form text that describes a person’s life, but this must be manually read in order to extract the relevant genealogical information. In addition, multiple texts may have to be read in order to create an extensive tree. This thesis proposes a novel three part system which can automatically interpret free form text to extract relationships and produce a family tree compliant with GED- COM formatting. The first subsystem builds an extendable database of genealogical records that are systematically extracted from free form text. This corpus provides the tagged data for the second subsystem, which trains a Naı̈ve Bayes classifier to predict relationships from free form text by examining the types of relationships for pairs of entities and their associated feature vectors. The last subsystem accumulates extracted relationships into family trees. When a multiclass Naı̈ve Bayes classifier is used, the proposed system achieves an accuracy of 54%. When binary Naı̈ve Bayes classifiers are used, the proposed system achieves accuracies of 69% for the child to parent relationship classifier, 75% for the spousal relationship classifier, and 73% for the sibling relationship classifier.
22
Suren, Haktan. „Sequence capture as a tool to understand the genomic basis for adaptation in angiosperm and gymnosperm trees“. Diss., Virginia Tech, 2017. http://hdl.handle.net/10919/86383.
Der volle Inhalt der QuelleAnnotation:
Forest trees represent a unique group of organisms combined with ecological and economic importance. Owing to their random mating system and widespread geographical distribution, they harbor abundance genetic variation both within and among populations. Despite their importance, research in forest trees has been underrepresented majorly due to their large and complex genome and scarce funding. However, recent climate change and other associated problems such as insect outbreaks, diseases and stress related damages have urged scientists to focus more on trees. Furthermore, the advent in high-throughput sequencing technologies have allowed trees to be sequenced and used as reference genome, which provided deeper understanding between genotype and environment. Whole genome sequencing is still not possible for organisms having large genomes including most tree species, and it is still not feasible economically for population genomic studies which require sequencing hundreds of samples. To get around this problem, genomic reduction is required. Sequence capture has been one of the genomic reduction techniques enabled studying the subset of the DNA of interest. In this paper, our primary goal is to outline challenges, provide guidance about the utility of sequence capture in trees, and to leverage such data in genome-wide association analyses to find the genetic variants that underlie complex, adaptive traits in spruce and pine, as well as poplar. Results of this research will facilitate bridging the genomic information gap between trees and other organisms. Moreover, it will provide better understanding how genetic variation governs phenotype in trees, which will facilitate both marker assisted selection for improved traits as well as provide guidance to determine forest management strategies for reforestation to mitigate the effects of climate change.Ph. D.
23
Erickson, Meiloni C. „Like Branches on a Tree“. ScholarWorks@UNO, 2016. http://scholarworks.uno.edu/td/2144.
Der volle Inhalt der Quelle
24
Luňák, Miroslav. „Generování realistických modelů stromů“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2011. http://www.nusl.cz/ntk/nusl-237017.
Der volle Inhalt der QuelleAnnotation:
This thesis deals with generation of realistic tree models. Implemented algorithm has many variable parameters, which allow generating large amount of species of broad-leaved trees. Generated models are also quite realistic looking.
25
Jones, Charles H., und Lee S. Gardner. „Automated Generation of Telemetry Formats“. International Foundation for Telemetering, 1996. http://hdl.handle.net/10150/611414.
Der volle Inhalt der QuelleAnnotation:
International Telemetering Conference Proceedings / October 28-31, 1996 / Town and Country Hotel and Convention Center, San Diego, CaliforniaThe process of generating a telemetry format is currently more of an ad-hoc art than a science. Telemetry stream formats conform to traditions that seem to be obsolete given today's computing power. Most format designers would have difficulty explaining why they use the development heuristics they use and even more difficulty explaining why the heuristics work. The formats produced by these heuristics tend to be inefficient in the sense that bandwidth is wasted. This paper makes an important step in establishing a theory on which to base telemetry format construction. In particular it describes an O(nlog n) algorithm for automatically generating telemetry formats. The algorithm also has the potential of efficiently filling a telemetry stream without wasting bits.
26
Hanumansetty, Reena Gowri. „Model based approach for context aware and adaptive user interface generation“. Thesis, Virginia Tech, 2004. http://hdl.handle.net/10919/10087.
Der volle Inhalt der QuelleAnnotation:
User interface design and development for ubiquitous software applications is challenged by the presence of varying contexts. Context comprises of user's computing platform, the environment in which the user is interacting with the application and user characteristics which comprise of user's behavior during interaction and user preferences for interface display and interaction. We present a framework for adaptive user interface generation where adaptation occurs when context changes. This framework introduces three new concepts. First, formalization for representing context is introduced. Our design of context specification is unique since it reflects the association of context with level and nature of user interface adaptation. Secondly, user interface generation life cycle is studied and we define a context model on top of task model to introduce the contextual conditions into user interface generation process. Using the context model, user interface designer can specify contextual requirements and its effect on the user interface. Third, context aware adaptation of user interfaces is achieved by mapping context specifications to various levels of user interface generation life cycle. We designed a specification language called rule specification using which the user interface designer can specify the mapping. With the new design of context representation, context model, and rule specification, we demonstrate how changes in contexts adapts task model which in turn adapts the user interface.Master of Science
27
Kim, Paul H. „Intelligent Maze Generation“. The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1563286393237089.
Der volle Inhalt der Quelle
28
Kruse, Peter Michael [Verfasser]. „Enhanced Test Case Generation with the Classification Tree Method / Peter Michael Kruse“. Berlin : Freie Universität Berlin, 2014. http://d-nb.info/1060717921/34.
Der volle Inhalt der Quelle
29
Nystad, Jørgen. „Parametric Generation of Polygonal Tree Models for Rendering on Tessellation-Enabled Hardware“. Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for datateknikk og informasjonsvitenskap, 2010. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-12211.
Der volle Inhalt der QuelleAnnotation:
The main contribution of this thesis is a parametric method for generation of single-mesh polygonal tree models that follow natural rules as indicated by da Vinci in his notebooks. Following these rules allow for a relatively simple scheme of connecting branches to parent branches. Proper branch connection is a requirement for gaining the benefits of subdivision. Techniques for proper texture coordinate generation and subdivision are also explored.The result is a tree model generation scheme resulting in single polygonal meshes susceptible to various subdivision methods, with a Catmull-Clark approximation method as the evaluated example.As realistic visualization of tree models is the overall objective, foliage appearance and the impression of a dense branching structure is considered. A shader-based method for accurately faking high branch density at a distance is explored.
30
Rokicki, Jonathan, und Henrik Pira. „Foliage generation tool based on a Lindenmeyer system : A study on branch density of trees in video games“. Thesis, Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-18402.
Der volle Inhalt der QuelleAnnotation:
Context. Procedurally generated content is a common way for companiesto save time and resources when creating modern video games.However, with generation of content there is often many variables controllingthe outcome that is tricky to get right. Objectives. The aim of this thesis is to research how people perceivethe branch density of trees used in video games. This will be done bycreating a foliage generation tool that is based on the functionality ofan L-system. The tool will be used to generate 12 trees with differentbranch densities which will be used for the questionnaire in the userexperiment. Method. A foliage generation tool has been created to be able togenerate trees with different branch and twig densities. The trees generatedwith the tool have been used in a user experiment in order tocome to a conclusion on how people perceive different branch densityin virtual trees. Result. Trees with higher branch and twig densities were rated higherthan trees with lower ones. The best rated tree in all regards was atree in the group with the second most main branches and had 0.6 intwig density. Conclusions. The results show that trees with a higher branch densitymade participants rate it as better looking in the user experiment.Although, trees with a high number of main branches and low twigdensity got the lowest score.
31
Zhou, Jianlong. „Semi-automatic transfer function generation for volumetric data visualization using contour tree analyses“. Phd thesis, Faculty of Engineering and Information Technologies, 2011. http://hdl.handle.net/2123/9326.
Der volle Inhalt der Quelle
32
Narayan, Shashi. „Generating and simplifying sentences“. Thesis, Université de Lorraine, 2014. http://www.theses.fr/2014LORR0166/document.
Der volle Inhalt der QuelleAnnotation:
Selon la représentation d’entrée, cette thèse étudie ces deux types : la génération de texte à partir de représentation de sens et à partir de texte. En la première partie (Génération des phrases), nous étudions comment effectuer la réalisation de surface symbolique à l’aide d’une grammaire robuste et efficace. Cette approche s’appuie sur une grammaire FB-LTAG et prend en entrée des arbres de dépendance peu profondes. La structure d’entrée est utilisée pour filtrer l’espace de recherche initial à l’aide d’un concept de filtrage local par polarité afin de paralléliser les processus. Afin nous proposons deux algorithmes de fouille d’erreur: le premier, un algorithme qui exploite les arbres de dépendance plutôt que des données séquentielles et le second, un algorithme qui structure la sortie de la fouille d’erreur au sein d’un arbre afin de représenter les erreurs de façon plus pertinente. Nous montrons que nos réalisateurs combinés à ces algorithmes de fouille d’erreur améliorent leur couverture significativement. En la seconde partie (Simplification des phrases), nous proposons l’utilisation d’une forme de représentations sémantiques (contre à approches basées la syntaxe ou SMT) afin d’améliorer la tâche de simplification de phrase. Nous utilisons les structures de représentation du discours pour la représentation sémantique profonde. Nous proposons alors deux méthodes de simplification de phrase: une première approche supervisée hybride qui combine une sémantique profonde à de la traduction automatique, et une seconde approche non-supervisée qui s’appuie sur un corpus comparable de WikipediaDepending on the input representation, this dissertation investigates issues from two classes: meaning representation (MR) to text and text-to-text generation. In the first class (MR-to-text generation, "Generating Sentences"), we investigate how to make symbolic grammar based surface realisation robust and efficient. We propose an efficient approach to surface realisation using a FB-LTAG and taking as input shallow dependency trees. Our algorithm combines techniques and ideas from the head-driven and lexicalist approaches. In addition, the input structure is used to filter the initial search space using a concept called local polarity filtering; and to parallelise processes. To further improve our robustness, we propose two error mining algorithms: one, an algorithm for mining dependency trees rather than sequential data and two, an algorithm that structures the output of error mining into a tree to represent them in a more meaningful way. We show that our realisers together with these error mining algorithms improves on both efficiency and coverage by a wide margin. In the second class (text-to-text generation, "Simplifying Sentences"), we argue for using deep semantic representations (compared to syntax or SMT based approaches) to improve the sentence simplification task. We use the Discourse Representation Structures for the deep semantic representation of the input. We propose two methods: a supervised approach (with state-of-the-art results) to hybrid simplification using deep semantics and SMT, and an unsupervised approach (with competitive results to the state-of-the-art systems) to simplification using the comparable Wikipedia corpus
33
Svanström, Martin. „Honeycomb & path generation : En struktur för en ständigt växande karta ochgenerell generation av slumpmässiga vägar“. Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-21244.
Der volle Inhalt der QuelleAnnotation:
Ett spels karta är begränsande i det att när man valt en viss storlek kan man inte gå utanför den ramen utan att göra relativt resurskrävande operationer. Denna undersökning genomfördes för att se om en trädstruktur kan användas som lösning att hantera en honeycomb-struktur på ett lämpligt sätt för att ständigt kunna utöka ett spels karta. Resultatet visar att det är möjligt att använda trädstrukturen relativt bra till växande kartor men att det inte är att rekommendera till spel, eftersom strukturen i sig är en omväg. I samband med denna karta skapades en slumpmässig path-generator som skulle kunna användas till att generellt skapa slumpmässiga kartor i spel. För att se vad försvårigheter man stöter på när man utvecklar en slumpad map-generator, vilket visade sig vara svårt i och med att man hittade många specialfall.
34
McKinley, Nathan D. „A Decision Theoretic Approach to Natural Language Generation“. Case Western Reserve University School of Graduate Studies / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=case1386188714.
Der volle Inhalt der Quelle
35
Aducci, Christopher John. „Itti'at akka' wáyya'ahookya ikkobaffo (Trees bend, but don’t break): Chickasaw family stories of historical trauma and resilience across the generations“. Diss., Kansas State University, 2013. http://hdl.handle.net/2097/15546.
Der volle Inhalt der QuelleAnnotation:
Doctor of PhilosophyDepartment of Family Studies and Human Services
Joyce A. Baptist
The Chickasaw represent one non-reservation bound American Indian tribe whose experiences of family life, historical trauma and resilience has not been fully understood. Therefore, this study sought to identify the qualities common to Chickasaw families, Chickasaw families' experiences of historical trauma and the factors that contribute to Chickasaw families' ability to persevere under adversarial circumstances. Using in-depth phenomenological interviews with nine (N = 9) three-generation minimum Chickasaw families, four central themes emerged that answered the four research questions. The first theme, "Chokka-chaffa' Nanna Mó̲́đma Ímmayya/The Family Is Everything" indicated that Chickasaw families were a heterogeneously complex system with a natural orientation toward the family unit itself, whereby the families valued emotional closeness, warmth and affection, quality time together, praise, respect and openness. Families were involved with one another and were active participants in strengthening their own families and communities. Families were prideful of family members' accomplishments and valued extended kin and spirituality. Further, families were confronted with challenges, but showed an ability to "bend, but not break," often citing the very same qualities, such as involvement, pride and an orientation toward family, as contributing to their ability to solve problems and keep the family unit intact. The second theme, "Impalahá̲mmi Bíyyi'ka/They Have It Really Bad," indicated the families experienced historical trauma by mourning the loss of land, language, culture and identity and that losses went unacknowledged by their non-Native counterparts and were ongoing, thus expecting to affect younger and future generations. The third theme, "Chikashsha Poyacha Ilaa-áyya'shakatí̲'ma/We Are Chickasaw, and We Are Still Here" indicated that despite hardships, families saw resilience as a trait found within their Chickasaw heritage. Maintaining a positive outlook, a spirit of determination, a fierce loyalty toward family members and a close connection to the Chickasaw Nation further contributed to families' resilience. The fourth theme, "Hooittapila/They Help One Another" indicated that resilient qualities were passed in a multidirectional pattern throughout all generations of family members, whereby family members from all generations supported and uplifted one another. Also discussed are the study's strengths and limitations and the clinical and research implications for Chickasaw families.
36
Jieke, Pan. „Cooperative Intrusion Detection For The Next Generation Carrier Ethernet“. Master's thesis, Department of Informatics, University of Lisbon, 2008. http://hdl.handle.net/10451/13881.
Der volle Inhalt der QuelleAnnotation:
Current OSI model layer 2 network elements (NEs, e.g., bridges, switches) are complex hardware and software boxes, often running an operating system, service and administration software, that can be vulnerable to attacks, including to remote code execution inside them. The purpose of this thesis is to present an architecture to protect the Carrier Ethernet network infrastructure from attacks performed by malicious NEs against the link management protocol, Spanning Tree Protocol, and its variations. This thesis proposes that NEs are equipped with an intrusion detection component. Each detector uses a specification-based intrusion detection mechanism in order to inspect the behaviour of other NEs through the analysis of the received messages. The correct behaviour of the NEs is crafted from the standard specification of the STP protocol. If there is a deviation between current and expected behaviour, then the NE is considered to be malicious. The specification is extended with temporal pattern annotations, in order to detect certain deviations from the protocol. The results of the local detection are then transmitted to the other NEs, in order to cooperatively establish a correlation between all the NEs, so that malicious NEs can be logically removed from the network (disconnecting the ports connected to them)
37
Högberg, Johanna. „Contributions to the theory and applications of tree languages“. Doctoral thesis, Umeå universitet, Institutionen för datavetenskap, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-1152.
Der volle Inhalt der QuelleAnnotation:
This thesis is concerned with theoretical as well as practical aspects of tree languages. It consists of an introduction and eight papers, organised into three parts. The first part is devoted to algorithmic learning of regular tree languages, the second part to bisimulation minimisation of tree automata, and the third part to tree-based generation of music. We now summarise the contributions made in each part. In Part I, an inference algorithm for regular tree languages is presented. The algorithm is a generalisation of a previous algorithm by Angluin, and the learning task is to derive, with the aid of a so-called MAT-oracle, the minimal (partial and deterministic) finite tree automaton M that recognises the target language U over some ranked alphabet Σ. The algorithm executes in time O(|Q| |δ| (m + |Q|)), where Q and δ are the set of states and the transition table of M , respectively, r is the maximal rank of any symbol in Σ, and m is the maximum size of any answer given by the oracle. This improves on a similar algorithm by Sakakibara as dead states are avoided both in the learning phase and in the resulting automaton. Part I also describes a concrete implementation which includes two extensions of the basic algorithm. In Part II, bisimulation minimisation of nondeterministic weighted tree automata (henceforth, wta) is introduced in general, and for finite tree automata (which can be seen as wta over the Boolean semiring) in particular. The concepts of backward and forward bisimulation are extended to wta, and efficient minimisation algorithms are developed for both types of bisimulation. In the special case where the underlying semiring of the input automaton is either cancellative or Boolean, these minimisation algorithms can be further optimised by adapting existing partition refinement algorithms by Hopcroft, Paige, and Tarjan. The implemented minimisation algorithms are demonstrated on a typical task in natural language processing. In Part III, we consider how tree-based generation can be applied to algorithmic composition. An algebra is presented whose operations act on musical pieces, and a system capable of generating simple musical pieces is implemented in the software Treebag: starting from input which is either generated by a regular tree grammar or provided by the user via a digital keyboard, a number of top-down tree transducers are applied to generate a tree over the operations provided by the music algebra. The evaluation of this tree yields the musical piece generated.
38
Boone, Rachel, Jacques Tardis und Richard Westwood. „Radial Growth of Oak and Aspen Near a Coal-Fired Station, Manitoba, Canada“. Tree-Ring Society, 2004. http://hdl.handle.net/10150/262615.
Der volle Inhalt der QuelleAnnotation:
Eighteen stands of bur oak (Quercus macrocarpa Michx.) and trembling aspen (Populus tremuloides Michx.) were sampled and analyzed using dendrochronological methods to study the potential effects on tree growth of emissions from a 132 MW coal-fired generating station. Sixteen stands were sampled within a 16-km radius of the station, and two control stands were sampled outside of the range of influence, at distances . 40 km. All stands showed similar radial growth patterns from 1960-2001, regardless of distance from or direction relative to the generating station, and a number of stands, including the controls, had below average growth after 1970. Both species were significantly affected by climatic factors, showing decreased radial growth with increasing June temperature. The species differed in their growth responses to spring precipitation and temperature in the previous October. One bur oak site displayed marked radial growth decline beginning in the mid-1970s, strongly pronounced following 1977. This decline does not appear to be related to emissions from the station, but is suspected to be a result of poor site conditions (shallow soil developed over calcareous till), confounded by a change in drainage (a road was built adjacent to the stand in 1977, perpendicular to the direction of drainage). The below average growth seen in 1970-2001 across most stands is likely attributable to stand dynamics and age effects.
39
BALAN, Bipin. „INVESTIGATION OF BIOTIC STRESS RESPONSES IN FRUIT TREE CROPS USING META-ANALYTICAL TECHNIQUES“. Doctoral thesis, Università degli Studi di Palermo, 2020. http://hdl.handle.net/10447/400369.
Der volle Inhalt der QuelleAnnotation:
In recent years, RNA sequencing and analysis using Next Generation Sequencing (NGS) methods have enabled to understand the gene expression pertaining to plant biotic and abiotic stress conditions in both quantitative and qualitative manner. The large number of transcriptomic works published in plants requires more meta-analysis studies that would identify common and specific features in relation of the high number of objective studies performed at different developmental and environmental conditions. Meta-analysis of transcriptomic data will identify commonalities and differences between differentially regulated gene lists and will allow screen which genes are key players in gene-gene and protein-protein interaction networks. These analyses will allow delivering important information on how a specific environmental factor affects plant molecular responses and how plants activate general stress responses to environmental stresses. The identification of common genes between different biotic stress will allow to gain insight into these general responses and help the diagnosis of an early “stress state” of the plants. These analyses help in monitoring stressed plants to start early specific management procedures for each disease or disorder. In this meta-analysis study, I considered all transcriptomic data related to biotic stresses in fruit tree crops, which are already published. The aim was to determine which genes, pathways, gene set categories and predicted protein-protein interaction networks may play key roles in specific responses to pathogen infections.
40
Majd, Farjam. „Two new parallel processors for real time classification of 3-D moving objects and quad tree generation“. PDXScholar, 1985. https://pdxscholar.library.pdx.edu/open_access_etds/3421.
Der volle Inhalt der QuelleAnnotation:
Two related image processing problems are addressed in this thesis. First, the problem of identification of 3-D objects in real time is explored. An algorithm to solve this problem and a hardware system for parallel implementation of this algorithm are proposed. The classification scheme is based on the "Invariant Numerical Shape Modeling" (INSM) algorithm originally developed for 2-D pattern recognition such as alphanumeric characters. This algorithm is then extended to 3-D and is used for general 3-D object identification. The hardware system is an SIMD parallel processor, designed in bit slice fashion for expandability. It consists of a library of images coded according to the 3-D INSM algorithm and the SIMD classifier which compares the code of the unknown image to the library codes in a single clock pulse to establish its identity. The output of this system consists of three signals: U, for unique identification; M, for multiple identification; and N, for non-identification of the object.
Second, the problem of real time image compaction is addressed. The quad tree data structure is described. Based on this structure, a parallel processor with a tree architecture is developed which is independent of the data entry process, i.e., data may be entered pixel by pixel or all at once. The hardware consists of a tree processor containing a tree generator and three separate memory arrays, a data transfer processor, and a main memory unit. The tree generator generates the quad tree of the input image in tabular form, using the memory arrays in the tree processor for storage of the table. This table can hold one picture frame at a given time. Hence, for processing multiple picture frames the data transfer processor is used to transfer their respective quad trees from the tree processor memory to the main memory. An algorithm is developed to facilitate the determination of the connections in the circuit.
41
Melero, Nogués Maria Teresa. „Combining machine learning and rule-based approaches in Spanish syntactic generation“. Doctoral thesis, Universitat Pompeu Fabra, 2006. http://hdl.handle.net/10803/7501.
Der volle Inhalt der QuelleAnnotation:
Aquesta tesi descriu una gramàtica de Generació que combina regles escrites a mà i tècniques d'aprenentatge automàtic. Aquesta gramàtica pertany a un sistema de Traducció Automàtica de qualitat comercial desenvolupat a Microsoft Research. La primera part presenta la gramàtica i les principals estratègies lingüístiques que aquesta gramàtica implementa. Els requeriments de robustesa que reclama l'ús real del sistema de TA, exigeix del Generador un esforç suplementari que es resol afegint un nivell de pre-generació, capaç de garantir la integritat de l'entrada, sense incorporar elements ad-hoc en les regles de la gramàtica. A la segona part, explorem l'ús dels classificadors d'arbres de decisió (DT) per tal d'aprendre automàticament una de les operacions que tenen lloc al mòdul de pre-generació, en concret la selecció lèxica del verb copulatiu en espanyol (ser o estar). Mostrem que és possible inferir a partir d'exemples els contextos per aquest fenòmen lingüístic no trivial, amb gran precisió.This thesis describes a Spanish Generation grammar which combines hand-written rules and Machine Learning techniques. This grammar belongs to a full-scale commercial quality Machine Translation system developed at Microsoft Research. The first part presents the grammar and the linguistic strategies it embodies. The need for robustness in real-world situations in the everyday use of the MT system requires from the Generator an extra effort which is resolved by adding a Pre-Generation layer which is able to fix the input to Generation, without contaminating the grammar rules. In the second part we explore the use of Decision Tree classifiers (DT) for automatically learning one of the operations that take place in the Pre-Generation component, namely lexical selection of the Spanish copula (i.e. ser and estar). We show that it is possible to infer from examples the contexts for this non-trivial linguistic phenomenon with high accuracy.
42
Pafčo, Tomáš. „Knihovna pro generování realistických modelů stromů“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2009. http://www.nusl.cz/ntk/nusl-236726.
Der volle Inhalt der QuelleAnnotation:
The goal of this thesis was to propose algorithms for procedural generation of realistic three-dimensional tree models and implement them as a library. This library uses a set of 92 mostly numerical parameters as an input and enables to export generated model into 3DS or OBJ file. It's an objective library, written in C++ language and designed mainly for MS Windows platform. Proposed algorithms are able to generate specific biologic species of broadleaf and coniferous trees.
43
D'Souza, Arun. „PathCaseMAW: A Workbench for Metabolomic Analysis“. Case Western Reserve University School of Graduate Studies / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=case1222895452.
Der volle Inhalt der Quelle
44
Doubleday, Kevin. „Generation of Individualized Treatment Decision Tree Algorithm with Application to Randomized Control Trials and Electronic Medical Record Data“. Thesis, The University of Arizona, 2016. http://hdl.handle.net/10150/613559.
Der volle Inhalt der QuelleAnnotation:
With new treatments and novel technology available, personalized medicine has become a key topic in the new era of healthcare. Traditional statistical methods for personalized medicine and subgroup identification primarily focus on single treatment or two arm randomized control trials (RCTs). With restricted inclusion and exclusion criteria, data from RCTs may not reflect real world treatment effectiveness. However, electronic medical records (EMR) offers an alternative venue. In this paper, we propose a general framework to identify individualized treatment rule (ITR), which connects the subgroup identification methods and ITR. It is applicable to both RCT and EMR data. Given the large scale of EMR datasets, we develop a recursive partitioning algorithm to solve the problem (ITR-Tree). A variable importance measure is also developed for personalized medicine using random forest. We demonstrate our method through simulations, and apply ITR-Tree to datasets from diabetes studies using both RCT and EMR data. Software package is available at https://github.com/jinjinzhou/ITR.Tree.
45
Käthner, Jana [Verfasser], und Oswald [Akademischer Betreuer] Blumenstein. „Interaction of spatial variability characterized by soil electrical conductivity and plant water status related to generative growth of fruit trees / Jana Käthner ; Betreuer: Oswald Blumenstein“. Potsdam : Universität Potsdam, 2016. http://d-nb.info/1218402342/34.
Der volle Inhalt der Quelle
46
von, Essen Rickard. „Threat Analysis of Video on Demand Services in Next Generation Networks“. Thesis, Linköpings universitet, Institutionen för datavetenskap, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-63082.
Der volle Inhalt der QuelleAnnotation:
IP Multimedia Subsystem (IMS) is the next generation of telecommunication systems. The system is based on an IP network and uses technologies from the Internet. The IMS system is designed to evolve from a telephone system into a general information and communication system. It is meant to include television, Video on Demand (VoD), interactive services etc, etc. It is designed to simplify the implementation of newservices in telecom networks. This report investigates security aspects of VoD services when merging an IP Television (IPTV) system with IMS. The investigation covers security functions in IMS, transitionsolutions for authentication of the Set-Top-Box (STB) in IMS, and identifies problems inthe integration of IPTV and IMS. The report concludes that IMS has good solid Authentication, Authorization, and Accounting (AAA) functions that will provide security and billing functionality. One problemis found in the media control between the STB and the streaming server. This interface lacked specification at the time of investigation, and some problems have been identified. These problems have to be solved before a system can be brought into service and beregarded as secure.
47
Svensk, Gustav. „TDNet : A Generative Model for Taxi Demand Prediction“. Thesis, Linköpings universitet, Programvara och system, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-158514.
Der volle Inhalt der QuelleAnnotation:
Supplying the right amount of taxis in the right place at the right time is very important for taxi companies. In this paper, the machine learning model Taxi Demand Net (TDNet) is presented which predicts short-term taxi demand in different zones of a city. It is based on WaveNet which is a causal dilated convolutional neural net for time-series generation. TDNet uses historical demand from the last years and transforms features such as time of day, day of week and day of month into 26-hour taxi demand forecasts for all zones in a city. It has been applied to one city in northern Europe and one in South America. In northern europe, an error of one taxi or less per hour per zone was achieved in 64% of the cases, in South America the number was 40%. In both cities, it beat the SARIMA and stacked ensemble benchmarks. This performance has been achieved by tuning the hyperparameters with a Bayesian optimization algorithm. Additionally, weather and holiday features were added as input features in the northern European city and they did not improve the accuracy of TDNet.
48
SOULI, NABIL. „Etude et realisation d'une source optique monolithique pour la generation et le codage d'impulsions solitons a tres haut debit“. Paris 11, 1996. http://www.theses.fr/1996PA112112.
Der volle Inhalt der QuelleAnnotation:
Une source monolithique a ete concue et realisee pour la generation et le codage d'impulsions solitons a haut debit pour la fenetre 1. 5 microns des fibres optiques. Celle-ci est constituee d'un laser monofrequence (dfb), d'un tandem de modulateurs a electro-absorption, et d'un amplificateur optique integres sur un substrat en inp. Cette integration repose sur une methode innovante, utilisant la meme couche active a multi-puits quantiques en ingaasp/ingaasp pour les quatre fonctions optiques. Une premiere realisation a valide le module tandem integrant deux modulateurs separes par un amplificateur, comme source a solitons. Les pertes fibre a fibre de ce composant sont de seulement 9 db, grace au gain que procure l'amplificateur integre. Le taux d'extinction de chaque modulateur est superieur a 10 db par volt applique. Ce composant a ete teste comme source a un debit record de 20 gbit/s. Dans une deuxieme phase, et toujours selon la meme approche technologique, nous avons integre le laser avec le tandem de modulateurs a electro-absorption. Le diagramme de l'il a 10 gbit/s obtenu sur le laser-tandem est parfaitement ouvert, avec une puissance crete des impulsions (couplees dans la fibre) de 0. 8 mw. Les performances dynamiques de ce composant sont compatibles avec un fonctionnement a 20 gbit/s. Parallelement, nous avons developpe une methodologie permettant de qualifier un modulateur electro-absorbant utilise comme source a impulsions solitons. Les impulsions generees a partir d'un composant test ont ete caracterisees dans le plan temporel et frequentiel. Notre etude a notamment mis en evidence la tres forte modulation de phase qui peut, selon les conditions operatoires du modulateur, accompagner la generation de ce type d'impulsion. Nous avons ensuite simule la propagation de ces impulsions dans un systeme soliton afin de comparer leurs performances en transmission. Cette analyse nous a permis de dessiner un abaque des tensions de commandes optimales a appliquer au modulateur teste en vue d'une utilisation comme source a solitons
49
Jangid, Anuradha. „Verifying IP-Cores by Mapping Gate to RTL-Level Designs“. Case Western Reserve University School of Graduate Studies / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=case1385975878.
Der volle Inhalt der Quelle
50
Buontempo, Frances Vivien. „Rapid toxicity prediction of organic chemicals using data mining techniques and SAR based on genetic programming for decision tree generation“. Thesis, University of Leeds, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.416813.
Der volle Inhalt der Quelle