Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Split algorithm.
Dissertationen zum Thema „Split algorithm“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-49 Dissertationen für die Forschung zum Thema "Split algorithm" 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
Liu, Rongrong. „A Novel Attack Method Against Split Manufactured Circuits“. University of Cincinnati / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1573812230926837.
Der volle Inhalt der Quelle
2
Shi, Haijian. „Best-first Decision Tree Learning“. The University of Waikato, 2007. http://hdl.handle.net/10289/2317.
Der volle Inhalt der QuelleAnnotation:
In best-first top-down induction of decision trees, the best split is added in each step (e.g. the split that maximally reduces the Gini index). This is in contrast to the standard depth-first traversal of a tree. The resulting tree will be the same, just how it is built is different. The objective of this project is to investigate whether it is possible to determine an appropriate tree size on practical datasets by combining best-first decision tree growth with cross-validation-based selection of the number of expansions that are performed. Pre-pruning, post-pruning, CART-pruning can be performed this way to compare.
3
Lian, Tea Sormbroen. „Computing Almost Split Sequences : An algorithm for computing almost split sequences of finitely generated modules over a finite dimensional algebra“. Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for matematiske fag, 2012. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-19355.
Der volle Inhalt der QuelleAnnotation:
An artin algebra $l$ over a commutative, local, artinian ring $R$ was fixed, and with this foundation some topics from representation theory were discussed. A series of functors of module categories were defined, and almost split sequences were introduced with some basic results. An isomorphism $omega_{delta,X} : D delta^* rightarrow delta_*(DTr(X))$ of $Gamma$-modules for an artin $R$-algebra $Gamma$ was constructed. The isomorphism $omega_{delta,X}$ was applied to a special case, yielding a deterministic algorithm for computing almost split sequences in the case that $R$ is a field.
4
Lakshman, Prabhashankar. „Parallel implementation of the split and merge algorithm on the hypercube machine“. Ohio : Ohio University, 1989. http://www.ohiolink.edu/etd/view.cgi?ohiou1182440993.
Der volle Inhalt der Quelle
5
Brochier, Felipe Osmar Berwanger. „Otimização de um condicionador de ar do tipo split com vazão variável de refrigerante“. Universidade do Vale do Rio dos Sinos, 2014. http://www.repositorio.jesuita.org.br/handle/UNISINOS/4619.
Der volle Inhalt der QuelleAnnotation:
Submitted by Fabricia Fialho Reginato (fabriciar) on 2015-07-23T01:11:46Z
No. of bitstreams: 1
FelipeBrochier.pdf: 2248315 bytes, checksum: 51a12fbb2e530bf08f1847557932b381 (MD5)Made available in DSpace on 2015-07-23T01:11:46Z (GMT). No. of bitstreams: 1 FelipeBrochier.pdf: 2248315 bytes, checksum: 51a12fbb2e530bf08f1847557932b381 (MD5) Previous issue date: 2014-02
Nenhuma
Este trabalho tem como objetivo otimizar o custo operacional dependente dos parâmetros de vazão de ar do condensador, número de aletas e de circuitos do condensador, frequência do compressor e parâmetros do dispositivo de expansão de um sistema de um condicionador de ar do tipo split hiwall unitário com vazão variável de refrigerante (VRV). Para a otimização foram consideradas as freqüências de ocorrência de quatro condições de temperatura do ambiente externo na cidade de Porto Alegre. O condicionador de ar abordado neste trabalho troca calor utilizando um ciclo de compressão de vapor de simples estágio, tendo como fluido de trabalho o refrigerante R-410A. O sistema completo, composto de um compressor, um condensador, um evaporador e tubo capilar, foi modelado analiticamente utilizando o software EES (Engineering Equation Solver) e ajustado de acordo com testes realizados em calorímetro. Para a otimização, um algoritmo genético foi programado no próprio EES. Após a otimização do custo operacional em função dos parâmetros físicos de projeto, o COP aumentou em até 12 % na condição de ar externo a 35 °C. A otimização em função dos parâmetros de controle mostrou aumento ainda mais significativo do COP do sistema. Também é feita uma comparação entre os valores de COP de um sistema de vazão constante de ar e refrigerante e um sistema com vazão variável de ar e refrigerante.
This work aims to optimize the operational cost of an air conditioning system with variable refrigerant flow (VRF). The cost is dependent of the following parameters: condenser air flow, number of condenser fins and circuits, compressor frequency and the expansion device. The optimization considered the frequencies of occurrence of four distinct ambient temperatures in the city of Porto Alegre. The air conditioner presented in this work exchange heat using a single stage vapor compression cycle, with the refrigerant R-410A as the working fluid. The complete system comprises a compressor, a condenser, an evaporator and a capillary tube and was analytically modeled using the EES (Engineering Equation Solver) software. The parameters were fitted according to results obtained in a calorimeter and for optimization, a genetic algorithm was programmed using the same software. After the optimization of the operational cost as a function of the project parameters, the COP was raised up to 12% in external ambient air at 35 °C. The optimization of the operational cost as a function of the control parameters showed even a more significant system COP raise. A comparison between the COP of a constant air and refrigerant flow system and a variable air and refrigerant flow system was also performed.
6
Shwayder, Kobey. „The best binary split algorithm a deterministic method for dividing vowel inventories into contrastive distinctive features /“. Waltham, Mass. : Brandeis University, 2009. http://dcoll.brandeis.edu/handle/10192/23254.
Der volle Inhalt der Quelle
7
Chen, Yuan. „A Fast, Passive and Accurate Model Generation Algorithm for RLCG Transmission Lines with Skin Effects“. University of Cincinnati / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1116250638.
Der volle Inhalt der Quelle
8
Rao, Michaël. „Décompositions de graphes et algorithmes efficaces“. Metz, 2006. http://docnum.univ-lorraine.fr/public/UPV-M/Theses/2006/Rao.Michael.SMZ0607.pdf.
Der volle Inhalt der QuelleAnnotation:
Ce mémoire traite de la décomposition modulaire ainsi que différentes de ses généralisations. Dans un premier temps, on explique comment se servir de décompositions pour résoudre efficacement certains problèmes sur les graphes. En particulier, en utilisant la décomposition modulaire, on obtient des algorithmes linéaires pour les problèmes " ensemble stable ", " clique ", " nombre chromatique " et " partition en cliques " sur les graphes sans P_5 et gem induit. On étudie également comment la décomposition en coupes peut servir pour calculer le nombre chromatique, et on exhibe une nouvelle classe de problèmes de partitionnements pour lesquels on peut obtenir des algorithmes polynomiaux sur les graphes de largeur de clique bornée. Dans un second temps, on s'intéresse à généraliser la décomposition modulaire. On étudiera une nouvelle décomposition appelée décomposition bi-joint. On donne notamment différentes caractérisations des graphes complètement décomposables par cette décomposition, et un algorithme linéaire pour la calculer. On donne également des généralisations paramétrées de la décomposition modulaire, qui s'avèrent relativement proches de la largeur de cliqueThis thesis deals with the modular decomposition and several of its generalizations. In a first time we show how graph decompositions can be used to solve efficiently some problems on graphs. We show how the modular decomposition can be used to obtain linear algorithms for " independent set ", " clique ", " chromatic number " and " partition into cliques " on (P_5,gem)-free graphs. We also show how the split decomposition can be used to compute the chromatic number, and we give a new class of vertex partitioning problems which can be solved in polynomial time on graphs of bounded clique width. In a second time, we are interested to generalize the modular decomposition. We study a new decomposition called the bi-join decomposition. We give in particular several characterizations of completely decomposable graphs, and a linear time decomposition algorithm. We introduce some parametrized generalization of the modular decomposition, and we show that theses generalizations are relatively close to the clique width
9
Frigo, Nadia. „Composite likelihood inference in state space models“. Doctoral thesis, Università degli studi di Padova, 2010. http://hdl.handle.net/11577/3426576.
Der volle Inhalt der QuelleAnnotation:
In general state space models, where the computational effort required in the evaluation of the full likelihood function is infeasible, we analyze the problem of static parameter estimation based on composite likelihood functions, in particular pairwise and split data likelihood functions. We discuss consistency and efficiency properties of these estimators (related to the characteristics of the model) and the bias in stationary models where the invariant distribution is unknown.
We focus on numerical methods to compute estimates of the parameter describing a general state space model. We develop an on line Expectation- Maximization algorithm in order to obtain the maximum pairwise likelihood estimate in a general state space framework. We illustrate this method for a linear gaussian model and we extend it to make inference also in jump Markov linear systems. In this framework, some sampling procedures need to be developed to estimate the parameters of the model. In particular, we present an algorithm to sample from the latent discrete state Markov chain given the pairs of observations.Nell’ambito di modelli state space, per i quali ricavare la funzione di verosimiglianza completa non è computazionalmente possibile, si è analizzato il problema della stima di parametri statici mediante funzioni di verosimiglianza composita, in particolare funzioni di verosimiglianza a coppie e a blocchi. L’interesse si è concentrato sullo studio delle proprietà di consistenza e di efficienza di tali stimatori (in relazione alle caratteristiche del processo stazionario sottostante il modello) nonchè su problemi di distorsione in modelli stazionari per i quali la distribuzione invariante non è nota. Sono stati presi in esame metodi numerici per il calcolo delle stime dei parametri che descrivono un modello state space generale. Si è sviluppato un algoritmo Expectation- Maximization sequenziale per ottenere stime di massima verosimiglianza a coppie nel contesto di modelli state space generali. Tale metodo è illustrato per modelli lineari gaussiani e viene esteso per l’inferenza in sistemi lineari markoviani con salti. In questo contesto, è stato necessario sviluppare adeguate procedure di campionamento. In particolare, viene presentato un algoritmo per campionare dalla catena markoviana a stati discreti date le coppie di osservazioni.
10
Perdigão, Martino Diego. „Stratégies d'optimisation pour le problème intégré de transport et de gestion de stock“. Electronic Thesis or Diss., Université Clermont Auvergne (2021-...), 2024. http://www.theses.fr/2024UCFA0139.
Der volle Inhalt der QuelleAnnotation:
Les problèmes de gestion de stock et de routage de véhicule sont des défis logistiques qui peuvent influencer de manière significative l'efficacité et l'efficience des opérations de la chaîne logistique et doivent être bien coordonnées et alignées. Les gérer conjointement est encore plus difficile lorsqu'on prend en compte le nombre de clients à servir et la durée de l'horizon de temps. Dans la littérature, ce problème est connu sous le nom de Inventory Routing Problem (IRP) et vise à trouver une solution de coût minimum qui traite les problèmes de stock et de transport simultanément. L'IRP a été introduit pour la première fois en 1983 par Bell et al. et a attiré jusqu'à présent l'attention de la communauté RO, qui a introduit de nombreuses extensions et fourni des données pour favoriser la recherche et les comparaisons justes.En recherche, certaines lacunes existent, et l'IRP n'est pas une exception. La plupart des travaux existants supposent que la flotte de véhicules utilisée pour les livraisons est homogène et que les coûts associés au stockage des produits et aux besoins des clients sont constants et égaux tout au long de l'horizon, ce qui ne correspond pas à un scénario réel. De plus, la livraison d'un seul produit par période est souvent considérée, ce qui n'est pas rentable.Cette thèse aborde l'IRP et introduit une nouvelle variante qui est plus proche d'un scénario logistique réel en incorporant une flotte de véhicules hétérogène, des demandes de clients et des coûts d'inventaire dépendants des périodes. De plus, on considère que les clients préfèrent recevoir des produits en lots plutôt qu'à l'unité. Pour cela, un nouveau jeu d'instances est introduit pour prendre en compte ces nouvelles caractéristiques. Cette variante, appelée Heterogeneous Inventory Routing Problem with Batch Size (HIRP-BS), est étudiée en utilisant trois approches.La première est un modèle mathématique qui étend une formulation de flux existante pour incorporer les caractéristiques du HIRP-BS. De nouvelles variables et contraintes sont alors nécessaires pour cela. Il n'est pas surprenant que la formulation ne soit pas capable de résoudre les instances à grande échelle et que même celles à échelle moyenne soient difficiles à résoudre dans un temps raisonnable.La deuxième méthode proposée est un algorithme itératif qui décompose l'IRP en autant de sous-problèmes que de périodes. Le but est de résoudre les sous-problèmes dans l'ordre chronologique et à chaque itération (à l'exception de la première, correspondant à la première période), d'utiliser la solution obtenue précédemment comme point de départ pour la période actuelle. Les changements sont limités par un paramètre d'entrée pour accélérer la convergence. L'idée générale est que pour une période donnée, les itérations suivantes devraient nécessiter de modifications intelligentes des solutions précédentes et que le nombre de changements devrait diminuer à mesure qu'on approche de la fin de l'horizon.La troisième méthode est une métaheuristique basée sur un algorithme emph{split} qui décompose une séquence multi-période de clients, appelée tour géant, en routes qui sont attribués à une période et à un type de véhicule. L'algorithme débute par le calcul des quantités estimées et des périodes pour le réapprovisionnement, en supposant les opérations de livraison au dernier moment. Il permet la définition d'un tour géant qui est évalué à l'aide d'un algorithme split responsable pour définir des solutions réalisables pour le problème. Ensuite, un mécanisme de recherche locale dédié au problème de routage utilise les opérateurs classiques basés sur les routes. A la fin, une phase de post-optimisation est considérée, améliorant la qualité de la solution en termes de stock et transport, basée sur une notion de distance. Les résultats sont prometteurs en termes de convergence et peuvent fournir des bornes supérieures valides dans un délai raisonnable, même pour les instances à grande échelleInventory management and vehicle routing problems are logistic challenges that can significantly influence the efficiency and effectiveness of supply chain operations and should be well-coordinated and aligned. Handling both jointly is even more challenging when considering the number of customers to be served and the length of the time horizon. In the literature, this problem is known as the Inventory Routing Problem (IRP) and aims to find a minimum-cost solution that addresses both inventory and transportation problems simultaneously. The IRP was first introduced in 1983 by Bell et al. and have received a lot of attention from the OR community so far, which has introduced numerous extensions and provided datasets to favor research and fair comparisons.In research, some gaps exist, and the IRP is not an exception. Most works in the literature so far assume that the fleet of vehicles used for the deliveries is homogeneous and that the costs associated with product storage and customer needs are constant and equal over the entire time horizon, which is not in accordance with a real scenario. Also, a single-item delivery per period is often considered by the formulation, which is clearly not cost-effective.This thesis addresses the IRP and introduces a new variant that is closer to a real logistic scenario by incorporating a heterogeneous vehicle fleet, customer demands, and inventory holding costs that are period-dependent. Additionally, it considers that customers may prefer receiving products in batches rather than in single units. For that, a new set of instances is introduced to handle these new features. This novel variant, named the Heterogeneous Inventory Routing Problem with Batch Size (HIRP-BS), is studied using three approaches. The first one is a mathematical formulation that extends a flow formulation initially designed to handle the HIRP-BS characteristics. New variables and constraints are then required to consider the new incorporated features. Not surprisingly, the formulation is not capable of handling large-scale instances and even the medium-scale ones are hard to solve in a timely manner. The second method is an iterative algorithm which decomposes the original IRP into as many sub-problems as periods of time are considered. The idea is to solve the sub-problems in chronological order such that at each iteration (except for the first, which corresponds to the first period), it uses the solution obtained in the previous as a starting point for the current one. The changes are limited by an input parameter to accelerate convergence. The overall idea is that for a given period, the following iterations should require smart modification of the previous solutions of the partial problem already solved and that the number of changes should decrease once it approaches the end of the time horizon.The third method is a split-based metaheuristic that decomposes a multi-period sequence of customers, called a giant tour, into routes that are assigned to a period and a vehicle type. The contribution leads to a new multi-period Split algorithm. It starts with the computation of the estimated quantities and periods for the replenishment, assuming the delivery operations at the latest possible moment. It allows the definition of a giant tour that is evaluated through a Split algorithm responsible for defining feasible solutions for the problem. Then, a local search mechanism dedicated to the routing problem takes advantage of classical route-based operators. Lastly, a post-optimization phase is considered, and slightly improve solution quality in terms of inventory and routing aspects based on a solution distance notion. Results are promising in terms of convergence and can provide valid upper bounds in a reasonable time even for the large-scale instances proposed
11
Qvarngård, Daniel. „Modeling Optical Parametric Generation in Inhomogeneous Media“. Thesis, Luleå tekniska universitet, Institutionen för teknikvetenskap och matematik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-74256.
Der volle Inhalt der Quelle
12
Silva, Leandro Mengue da. „Um modelo de otimização baseado em algoritmo memético para o escalonamento de ordens de produção utilizando divisão de lotes de tamanho variável“. Universidade do Vale do Rio dos Sinos, 2017. http://www.repositorio.jesuita.org.br/handle/UNISINOS/6353.
Der volle Inhalt der QuelleAnnotation:
Submitted by JOSIANE SANTOS DE OLIVEIRA (josianeso) on 2017-06-16T12:13:46Z
No. of bitstreams: 2
Leandro Mengue da Silva_.pdf: 1918963 bytes, checksum: 8d329d578b6f3672b670f65fd2f7ea08 (MD5)
Leandro Mengue da Silva_.pdf: 1918963 bytes, checksum: 8d329d578b6f3672b670f65fd2f7ea08 (MD5)Made available in DSpace on 2017-06-16T12:13:47Z (GMT). No. of bitstreams: 2 Leandro Mengue da Silva_.pdf: 1918963 bytes, checksum: 8d329d578b6f3672b670f65fd2f7ea08 (MD5) Leandro Mengue da Silva_.pdf: 1918963 bytes, checksum: 8d329d578b6f3672b670f65fd2f7ea08 (MD5) Previous issue date: 2017-03-23
CNPQ – Conselho Nacional de Desenvolvimento Científico e Tecnológico
A contribuição de metaheurísticas, em especial a dos algoritmos evolutivos, na área de otimização combinatória é de extrema relevância, pois auxiliam na busca de soluções próximas ao ótimo para problemas complexos da vida real cuja resolução em tempo aceitável é inviável devido a sua complexidade computacional, oferecendo uma flexibilidade importante na modelagem do problema. Este trabalho se propõe a apresentar e implementar um modelo computacional a ser utilizado na otimização do escalonamento de ordens de produção utilizando um Algoritmo Memético (AM), que permite a busca tanto da melhor sequência das ordens de produção quanto dos lotes de tamanho variável em que a quantidade de cada operação pode ser subdividida. A possibilidade de utilização de máquinas alternativas, de recursos secundários, de intervalos de indisponibilidade e de lotes de transferência, é apresentada no modelo, o que lhe proporciona grande robustez e aplicabilidade em ambientes de manufatura flexível, permitindo uma modelagem do Flexible Job Shop Scheduling Problem (FJSSP) que reflete com maior fidedignidade a realidade do ambiente fabril, gerando como resultado um escalonamento otimizado e aderente às necessidades da fábrica. Várias instâncias do FJSSP são utilizadas nos testes e os resultados obtidos comprovam que o algoritmo proposto consegue otimizar o escalonamento das ordens de produção de cada instância de maneira eficiente.
The contribution of meta-heuristics, especially evolutionary algorithms, in combinatorial optimization area is extremely important, as they help in finding near optimal solutions to complex real-life problems whose resolution is infeasible in acceptable time due to its computational complexity, offering an important flexibility in the modeling of problem. This study propose to present and implement a computational model to be used in optimizing the production scheduling of manufacturing orders using a Memetic Algorithm that allows to search both the best sequence of jobs as of variable size batches that the quantity of each operation can be subdivided. The possibility of using alternative resources, operations with secondary resources, unavailability intervals and batch transfer lots are features presented in the model, which lends it great robustness and applicability to flexible manufacturing environments, allowing the modeling of Flexible Job Shop Scheduling Problem (FJSSP) that reflects with higher accuracy the real manufacturing environment, generating optimized scheduling results that are adhering to the plant needs. Multiple instances of FJSSP are used in the tests and the results show that the proposed algorithm succeeds in optimizing the scheduling of production orders for each instance so efficient.
13
Franciosi, Felipe Mainieri. „Uma abordagem paralela para o algoritmo Split“. Pontifícia Universidade Católica do Rio Grande do Sul, 2008. http://hdl.handle.net/10923/1543.
Der volle Inhalt der QuelleAnnotation:
Made available in DSpace on 2013-08-07T18:42:48Z (GMT). No. of bitstreams: 1
000431851-Texto+Completo-0.pdf: 926379 bytes, checksum: 41dde88f7d4f933186ff71b29831c0c2 (MD5)
Previous issue date: 2008The behavioral analysis of a process allows the detection of deficiencies, as well as assessing performance impact caused by environmental changes. The use of analytical models to describe the observed process provides these data through the resolution of equation systems. In the case where modeling is made using formalisms such as Stochastic Automata Network, the resolution of these systems depends on the multiplication of vectors by structures defined using tensor algebra. In view of these multiplications having a high computational cost, various algorithms have been proposed to solve it. Recently, the Split iterative solution was proposed, and the goal of this work is to provide a parallel optimized alternative for it, looking for an improved performance of the solution.
A análise comportamental de um processo permite a detecção de deficiências, assim como avaliar o impacto no desempenho do mesmo causado por mudanças no ambiente. O uso de modelos analíticos para descrever o processo em observação fornece estes dados através da resolução de sistemas de equações. No caso de modelagens feitas com a utilização de formalismos como Rede de Autômatos Estocásticos, a resolução destes sistemas depende da multiplicação de vetores por estruturas definidas através da álgebra tensorial. Por ter um alto custo computacional, diversos algoritmos foram propostos para resolver esta multiplicação. Recentemente a solução iterativa Split foi proposta, e o objetivo deste trabalho é apresentar alternativas paralelas e otimizações para a mesma, buscando um melhor desempenho da solução.
14
Ma, Qi. „Reinforcement in Biology : Stochastic models of group formation and network construction“. Doctoral thesis, Uppsala universitet, Analys och tillämpad matematik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-186989.
Der volle Inhalt der QuelleAnnotation:
Empirical studies show that similar patterns emerge from a large number of different biological systems. For example, the group size distributions of several fish species and house sparrows all follow power law distributions with an exponential truncation. Networks built by ant colonies, slime mold and those are designed by engineers resemble each other in terms of structure and transportation efficiency. Based on the investigation of experimental data, we propose a variety of simple stochastic models to unravel the underlying mechanisms which lead to the collective phenomena in different systems. All the mechanisms employed in these models are rooted in the concept of selective reinforcement. In some systems the reinforcement can build optimal solutions for biological problem solving. This thesis consists of five papers. In the first three papers, I collaborate with biologists to look into group formation in house sparrows and the movement decisions of damsel fish. In the last two articles, I look at how shortest paths and networks are constructed by slime molds and pheromone laying ants, as well as studying speed-accuracy tradeoffs in slime molds' decision making. The general goal of the study is to better understand how macro level patterns and behaviors emerges from micro level interactions in both spatial and non-spatial biological systems. With the combination of mathematical modeling and experimentation, we are able to reproduce the macro level patterns in the studied biological systems and predict behaviors of the systems using minimum number of parameters.
15
Chen, Zhuo. „A split-and-merge approach for quadrilateral-based image segmentation“. Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B38749440.
Der volle Inhalt der Quelle
16
Cinnella, Pasquale. „Flux-split algorithms for flows with non-equilibrium chemistry and thermodynamics“. Diss., Virginia Polytechnic Institute and State University, 1989. http://hdl.handle.net/10919/54506.
Der volle Inhalt der QuelleAnnotation:
New flux-split algorithms are developed for high velocity, high-temperature flow situations, when finite-rate chemistry and non-equilibrium thermodynamics greatly affect the physics of the problem. Two flux-vector-split algorithms, of the Steger-Warming and of the Van Leer type, and one flux-difference-split algorithm of the Roe type are established and utilized for the accurate numerical simulation of flows with dissociation, ionization, and combustion phenomena. Several thermodynamic models are used, including a simplified vibrational non-equilibrium model and an equilibrium model based upon refined statistical mechanics properties. The framework provided is flexible enough to accommodate virtually any chemical model and a wide range of non-equilibrium, multi-temperature thermodynamic models.
A theoretical study of the main features of flows with free electrons, for conditions that require the use of two translational temperatures in the thermal model, is developed. Interesting and unexpected results are obtained, because acoustic wave speeds of the symmetric form u±α no longer appear. A simple but powerful asymptotic analysis is developed which allows the establishment of the fundamental gas-dynamic properties of flows with multiple translational temperatures.
The new algorithms developed demonstrate their accuracy and robustness for challenging flow problems. The influence of several assumptions on the chemical and thermal behavior of the flows is investigated, and a comparison with results obtained using different numerical approaches, in particular spectral methods, is provided, and proves to be favorable to the present techniques.
Other calculations in one and two space dimensions indicate large sensitivities with respect to chemical and thermodynamic modeling. The algorithms developed are of sufficient generality to begin to examine these effects in detail. Preliminary numerical simulations are performed using elementary modeling of transport phenomena.Ph. D.
17
Chen, Zhuo, und 陳卓. „A split-and-merge approach for quadrilateral-based image segmentation“. Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2006. http://hub.hku.hk/bib/B38749440.
Der volle Inhalt der Quelle
18
Holmgren, Cecilia. „Split Trees, Cuttings and Explosions“. Doctoral thesis, Uppsala universitet, Matematiska institutionen, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-112239.
Der volle Inhalt der QuelleAnnotation:
This thesis is based on four papers investigating properties of split trees and also introducing new methods for studying such trees. Split trees comprise a large class of random trees of logarithmic height and include e.g., binary search trees, m-ary search trees, quadtrees, median of (2k+1)-trees, simplex trees, tries and digital search trees. Split trees are constructed recursively, using “split vectors”, to distribute n “balls” to the vertices/nodes. The vertices of a split tree may contain different numbers of balls; in computer science applications these balls often represent “key numbers”. In the first paper, it was tested whether a recently described method for determining the asymptotic distribution of the number of records (or cuts) in a deterministic complete binary tree could be extended to binary search trees. This method used a classical triangular array theorem to study the convergence of sums of triangular arrays to infinitely divisible distributions. It was shown that with modifications, the same approach could be used to determine the asymptotic distribution of the number of records (or cuts) in binary search trees, i.e., in a well-characterized type of random split trees. In the second paper, renewal theory was introduced as a novel approach for studying split trees. It was shown that this theory is highly useful for investigating these types of trees. It was shown that the expected number of vertices (a random number) divided by the number of balls, n, converges to a constant as n tends to infinity. Furthermore, it was demonstrated that the number of vertices is concentrated around its mean value. New results were also presented regarding depths of balls and vertices in split trees. In the third paper, it was tested whether the methods of proof to determine the asymptotic distribution of the number of records (or cuts) used in the binary search tree, could be extended to split trees in general. Using renewal theory it was demonstrated for the overall class of random split trees that the normalized number of records (or cuts) has asymptotically a weakly 1-stable distribution. In the fourth paper, branching Markov chains were introduced to investigate split trees with immigration, i.e., CTM protocols and their generalizations. It was shown that there is a natural relationship between the Markov chain and a multi-type (Galton-Watson) process that is well adapted to study stability in the corresponding tree. A stability condition was presented to describe a phase transition deciding when the process is stable or unstable (i.e., the tree explodes). Further, the use of renewal theory also proved to be useful for studying split trees with immigration. Using this method it was demonstrated that when the tree is stable (i.e., finite), there is the same type of expression for the number of vertices as for normal split trees.
19
Rodrigues, Francisco Caio Maia. „Evolução de split grammars para otimização de construções procedurais“. reponame:Repositório Institucional da UFC, 2014. http://www.repositorio.ufc.br/handle/riufc/21500.
Der volle Inhalt der QuelleAnnotation:
RODRIGUES, Francisco Caio Maia. Evolução de split grammars para otimização de construções procedurais. 2014. 49 f. Dissertação (Mestrado em Ciência da Computação)-Universidade Federal do Ceará, Fortaleza, 2014.Submitted by Anderson Silva Pereira (anderson.pereiraaa@gmail.com) on 2017-01-10T18:58:03Z No. of bitstreams: 1 2014_dis_fcmrodrigues.pdf: 6745695 bytes, checksum: 7fd10d5fff50663bf084d4eb5ad0a949 (MD5)
Approved for entry into archive by Rocilda Sales (rocilda@ufc.br) on 2017-01-11T15:39:12Z (GMT) No. of bitstreams: 1 2014_dis_fcmrodrigues.pdf: 6745695 bytes, checksum: 7fd10d5fff50663bf084d4eb5ad0a949 (MD5)
Made available in DSpace on 2017-01-11T15:39:12Z (GMT). No. of bitstreams: 1 2014_dis_fcmrodrigues.pdf: 6745695 bytes, checksum: 7fd10d5fff50663bf084d4eb5ad0a949 (MD5) Previous issue date: 2014
Procedural modeling has been successfully applied to the automatic building generation problem. Among several techniques to tackle the problem of procedural building generation, the use of Split Grammars has increased, even being deployed in commercial CAAD (Computer-Aided Architectural Design) software. This work proposes a technique to optimize Split Grammars using Genetic Algorithm. The main goal is to automatically create grammars that only generate models with certain desirable characteristics, either from a series of manually written grammars or randomly created ones. The proposed thecnique searches the space of the input grammars’s rules to develop new better grammars, i.e., grammars that generate models with certain predefined feature. The proposed technique was successfully applied, as will be shown, to the maximization of symmetry of building facades, leading to the creation of realistic models.
Modelagem procedural tem sido aplicada com sucesso para resolver o problema da construção automática de ambientes urbanos. Dentre as várias técnicas existentes para a geração procedural de construções utilizando gramáticas, Split Grammars têm especial destaque devido ao seu amplo uso, estando presente até mesmo em softwares comerciais de CAAD (Computer-Aided Architectural Design). Este trabalho propõe uma técnica para otimização de Split Grammars utilizando algoritmos genéticos. O objetivo é gerar, automaticamente, gramáticas capazes de criar modelos que apresentem alguma característica desejada, seja a partir de uma série de gramáticas feitas manualmente por um usuário ou de gramáticas geradas aleatoriamente. O método proposto realiza uma busca no espaço das regras das gramáticas dadas como entrada a fim de criar novos tipos de gramáticas melhores, ou seja, que possuam uma boa estrutura de acordo com algum critério pré-definido pelo usuário. Assim, é demonstrada a eficácia da técnica proposta aplicando-a ao problema de maximização de simetria em fachadas de construções, obtendo modelos realisticamente plausíveis.
20
Tanis, Mehmet Celaleddin. „Prestack split-step fourier depth migration algorithms and parallel implementations on Cray T3E /“. Digital version accessible at:, 1998. http://wwwlib.umi.com/cr/utexas/main.
Der volle Inhalt der Quelle
21
Watanabe, Kanno Cynthia Lidia. „Diseño de la transformada rápida de Fourier con algoritmo Split-Radix en FPGA“. Bachelor's thesis, Pontificia Universidad Católica del Perú, 2009. http://tesis.pucp.edu.pe/repositorio/handle/123456789/295.
Der volle Inhalt der QuelleAnnotation:
La Transformada Rápida de Fourier SplitRadix (SRFFT) es un algoritmo computacionalmente eficiente que se utiliza para calcular la Transformada Discreta de Fourier (DFT), la cual a partir
de una secuencia finita de datos, obtiene otra que describe su comportamiento en el dominio de la frecuencia. Esta herramienta se utiliza en óptica, acústica, física cuántica, teorías de sistemas, tratamiento de señales, reconocimiento de voz, entre otros.Tesis
22
Papoutsellis, Evangelos. „First-order gradient regularisation methods for image restoration : reconstruction of tomographic images with thin structures and denoising piecewise affine images“. Thesis, University of Cambridge, 2016. https://www.repository.cam.ac.uk/handle/1810/256216.
Der volle Inhalt der QuelleAnnotation:
The focus of this thesis is variational image restoration techniques that involve novel non-smooth first-order gradient regularisers: Total Variation (TV) regularisation in image and data space for reconstruction of thin structures from PET data and regularisers given by an infimal-convolution of TV and $L^p$ seminorms for denoising images with piecewise affine structures. In the first part of this thesis, we present a novel variational model for PET reconstruction. During a PET scan, we encounter two different spaces: the sinogram space that consists of all the PET data collected from the detectors and the image space where the reconstruction of the unknown density is finally obtained. Unlike most of the state of the art reconstruction methods in which an appropriate regulariser is designed in the image space only, we introduce a new variational method incorporating regularisation in image and sinogram space. In particular, the corresponding minimisation problem is formed by a total variational regularisation on both the sinogram and the image and with a suitable weighted $L^2$ fidelity term, which serves as an approximation to the Poisson noise model for PET. We establish the well-posedness of this new model for functions of Bounded Variation (BV) and perform an error analysis through the notion of the Bregman distance. We examine analytically how TV regularisation on the sinogram affects the reconstructed image especially the boundaries of objects in the image. This analysis motivates the use of a combined regularisation principally for reconstructing images with thin structures. In the second part of this thesis we propose a first-order regulariser that is a combination of the total variation and $L^p$ seminorms with $1 < p \le \infty$. A well-posedness analysis is presented and a detailed study of the one dimensional model is performed by computing exact solutions for simple functions such as the step function and a piecewise affine function, for the regulariser with $p = 2$ and $p = 1$. We derive necessary and sufficient conditions for a pair in $BV \times L^p$ to be a solution for our proposed model and determine the structure of solutions dependent on the value of $p$. In the case $p = 2$, we show that the regulariser is equivalent to the Huber-type variant of total variation regularisation. Moreover, there is a certain class of one dimensional data functions for which the regularised solutions are equivalent to high-order regularisers such as the state of the art total generalised variation (TGV) model. The key assets of our regulariser are the elimination of the staircasing effect - a well-known disadvantage of total variation regularisation - the capability of obtaining piecewise affine structures for $p = 1$ and qualitatively comparable results to TGV. In addition, our first-order $TVL^p$ regulariser is capable of preserving spike-like structures that TGV is forced to smooth. The numerical solution of the proposed first-order model is in general computationally more efficient compared to high-order approaches.
23
Marcinko, Tomáš. „Rozvozný problém s delenou dodávkou“. Master's thesis, Vysoká škola ekonomická v Praze, 2008. http://www.nusl.cz/ntk/nusl-10514.
Der volle Inhalt der QuelleAnnotation:
This thesis focuses on a description of the split delivery vehicle routing problem (SDVRP), in which the restriction that each customer has to be visited exactly once is not assumed, contrary to the classical vehicle routing problem, and split deliveries are allowed. Considering the fact that the split delivery vehicle routing problem in NP-hard, a number of heuristic algorithms proposed in the literature are presented. Computational experiments are reported and the results show that the largest benefits of split deliveries are obtained in case of instances with fairly specific characteristics and also several drawbacks of implemented Tabu Search algorithm (SPLITABU) are point out.
24
Sjöberg, Mattias. „Analysis of autonomous flight algorithms for an unmanned aerial vehicle“. Thesis, Umeå universitet, Institutionen för fysik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-147625.
Der volle Inhalt der QuelleAnnotation:
Unmanned Aerial Vehicles (UAV) have been heavily studied in the past decade, where autonomous flights have been a popular subject. More complex applications have led to higher requirements on the autonomous flight algorithms and the absence of performance data complicates the selection of what algorithm to use for various applications. Therefore, this thesis focused in analyzing the performance difference between two methods, Simultaneous Localization AndMapping (SLAM) and Artificial Potential Field Approach (APFA), which are planning and reactive algorithms, respectively. Fundamental dynamics were applied, Feedback Linear Controllers (FBLC)s for stabilization and an odometry position model combined with an inverse dynamics technique that linearizes the non-linear odometry model. The SLAM approach was set up in four steps: landmark extraction which uses a point distance based method for segment separation, combined with a Split-And-Merge algorithm for extracting linear landmarks, data association that validates the landmarks, Extended Kalman Filter (EKF) that uses the landmarks together with the odometry model for estimating the position of the UAV, and a modified TangentBug as the reactive algorithm. The APFA was constructed of two functions, an attractive and a repulsive function. The two methods were implemented on the robotics simulation platform Virtual Robot Experimentation Platform (V-REP), where a quadcopter was used as the model for the UAV. All theory was implemented onto the quadcopter model and embedded scripts were used for communication within V-REP, mainly through internal Application Programming Interface (API)-functions. Furthermore, a script was written that randomly generates three different types of simulation environments. The implementation of both methods was analyzed in reaching an arbitrary goal position in terms of: the most successful, the most time efficient and the safest navigation path. Another thing analyzed was the time- and space-complexity of both implemented methods. The results stated that the implemented APFA and the SLAM approach had approximately equal success rate, SLAM had the safest navigation, was the most time efficient, and had the highest time- and space-complexity for a worst case scenario. One of the conclusions were that improvements could be done in the implementations. Future work includes adding a proper damping method, improving the flaws in the implemented methods as well as to use V-REP as a Robot Operating System (ROS)-node for creating a Software In The Loop (SITL)-simulation, in order to achieve more realistic simulations.
25
Juříčková, Ivana. „Optimalizace tras při rozvozu europalet“. Master's thesis, Vysoká škola ekonomická v Praze, 2014. http://www.nusl.cz/ntk/nusl-194529.
Der volle Inhalt der QuelleAnnotation:
This diploma thesis describes a logistic problem of the company JACER-CZ Ltd. The main focus is on identifying optimal routes about the Euro pallets distribution. The Euro pallets are standardized at length replaceable transport pallets which are in Europe. The aim of this thesis is to find a solution which will meet requirements of all thirteen customers and simultaneously a total route length of all vans will be minimalized. At first there is the mathematical model about the delivery assignment with the split delivery vehicle calculated by solvers CPLEX and Gurobi. Then the original and the modified example is solved manually by heuristic algorithms. It is concerned the nearest neighbour algorithm, savings algorithm, the insertion algorithm and the heuristic method for the split delivery vehicle routing problem.
26
VENTURA, V. A. „Representação de Imagens Através de Grafos Utilizando o Algoritmo Split And Merge Combinado Com Descritores de Cor e Textura“. Universidade Federal do Espírito Santo, 2009. http://repositorio.ufes.br/handle/10/4210.
Der volle Inhalt der QuelleAnnotation:
Made available in DSpace on 2016-08-29T15:33:09Z (GMT). No. of bitstreams: 1
tese_2815_.pdf: 3059796 bytes, checksum: a6d79c5c2a1e17afae9982552dffcc95 (MD5)
Previous issue date: 2009-08-27Desde os tempos mais remotos, o homem procura e desenvolve ferramentas para facilitar sua vida. O ser humano busca maneiras de serem mais produtivos, eliminando, se possível, as limitações que encontram em seu caminho. Uma das maiores limitações é a ausência de recursos para automatizar tarefas que sem alguma ferramenta significam muito trabalho braçal e muito risco agregado. Limites de orçamento, prazos e recursos também se fazem presentes no cotidiano de pessoas que acabam sendo nem tão eficientes quanto podem, nem tão eficazes quanto querem. Não obstante, automação de determinadas tarefas representa um aumento substancial de produtividade e diminuição de riscos. Ter ferramentas para auxiliar neste trabalho é ter um recurso que permite a várias áreas se comunicar de maneira linear e multi-direcional. Não é diferente na área de reconhecimento de cenas, uma das linhas de pesquisa mais importantes da área de processamento de imagens. Como o sistema de inspeção visual adotado por algumas empresas é manual, realizado a olho nu, e totalmente dependente do fator humano utilizado no processo, o mesmo não pode garantir totalmente a correspondência entra uma imagem e outra, além de ser uma tarefa trabalhosa, cara e demorada. Muitos algoritmos que tratam do problema de reconhecimento de cenas utilizam a representação da imagem através de grafos em seus trabalhos. Nessas representações, vértices representam objetos e arestas representam as relações espaciais entre os objetos, e informações relevantes ao processo de reconhecimento podem ser extraídos da cena e representadas como atributos do grafo. O reconhecimento de uma imagem através da comparação com um modelo, quando ambas são representadas por grafos, caracteriza um problema de correspondência de grafos, onde o critério para a correspondência é medido a partir de um valor que mede a similaridade entre vértices (resp. arestas) do modelo e a imagem a ser reconhecida, comumente armazenados em uma matriz de similaridade entre vértices (resp. arestas). Por vezes, a representação das imagens e a criação das matrizes de similaridades entre vértices (resp. arestas) eram feitos manualmente. Para suprir essa carência, uma interface para a manipulação das imagens e o desenho dos grafos correspondentes, denominada ImGraph, foi construída. A ferramenta permite a criação de grafos de atributos que representem imagens fornecidas como entrada. Dentre suas funcionalidades, destaca-se a geração de grafos para representação de imagens usadas como modelos e imagens a serem reconhecidas a partir dos modelos. Para isso, a ferramenta permite a segmentação manual (no caso do modelo) e automática (no caso da imagem a ser reconhecida) das imagens, além de utilizar funções que combinem os atributos em valores de similaridade. Portanto, esta dissertação consiste em uma extensão dessa interface. Como aperfeiçoamento da ferramenta, foi sugerida uma nova abordagem para a segmentação automática de imagens, incluindo uma análise mais detalhada da fase de pré-processamento, que consiste na segmentação e extração de características da imagem, ao qual a mesma é submetida antes de ser convertida em um grafo. Uma combinação de características de cor e textura para segmentação automática de imagens é investigada com o objetivo de aperfeiçoar sua representação através de grafos de atributos. Quanto melhor a segmentação da imagem, melhor será sua representação através de grafos. A análise de informações de cor nem sempre provê informações suficientemente acuradas para segmentação. Daí, características adicionais podem ser consideradas para aprimorar sua representação. A abordagem de segmentação split-and-merge é usada, dividindo a imagem recursivamente em regiões homogêneas cada vez menores, e então unindo-as de acordo com alguma medida de similaridade, computadas nesta dissertação através de medidas de distâncias probabilísticas. Também foi analisada a combinação com o descritor de textura denominado Local Binary Pattern (LBP) com o descritor de cor, partindo da premissa que algumas regiões da imagem avaliada podem ser melhor descritas não apenas por um descritor específico, mas por uma combinação dos mesmos. Também foi analisada a utilização do PCA (Principal Components Analysis - Análise de Componentes Principais), em que o espaço de cor RGB foi reduzido de três dimensões para uma dimensão através do método. Segmentada a imagem, a mesma será representada através de grafos de atributos que serão utilizados para a criação das Matrizes de Similaridade, que deverão conter informações acerca da similaridade entre vértices (resp. arestas) entre dois grafos de entrada: o grafo modelo e o grafo que se pretende reconhecer neste modelo. Para a construção das matrizes, foram estudadas duas funções para se verificar a similaridade entre vértices e de arestas Experimentos foram realizados utilizando-se uma imagem aérea de alta-resolução espacial do Rio Jucu, estado do Espírito Santo. Ao final, todas as novas contribuições foram acrescentadas ao ambiente.
27
Ermer, Thomas. „Mappingstrategien für Kommunikatoren“. Universitätsbibliothek Chemnitz, 2005. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200501073.
Der volle Inhalt der QuelleAnnotation:
Es werden Fragen der effektiven Kommunikation in parallelen FEM-Systemen behandelt. Durch geschickte Partitionierung des betrachteten Gebietes und Verteilung auf die vorhandenen Prozessoren kann man versuchen, die Kommunikationslast zu minimieren, z. B. mit dem Programmsystem chaco. Ein möglichst paralleler Datenaustausch wird durch Anordnung der Kommunikationsschritte in so genannten Linkleveln versucht. In der vorliegenden Arbeit wird ausgehend von der MPI-basierten Koppelrandkommunikation ein Split-Algorithmus vorgestellt, der versucht, die Koppelranddaten großer Kommunikatoren auf die kleinerer Sub-Kommunikatoren abzubilden und damit die Anzahl der zu übertragenden Datenpakete zu minimieren.
28
Calixto, Alexandre Pitangui. „Algoritmo ejeção-absorção metropolizado para segmentação de imagens“. Universidade Federal de São Carlos, 2014. https://repositorio.ufscar.br/handle/ufscar/4496.
Der volle Inhalt der QuelleAnnotation:
Made available in DSpace on 2016-06-02T20:04:53Z (GMT). No. of bitstreams: 1
6510.pdf: 2213423 bytes, checksum: 0c9b206a1b5f88772031ed160e9691b3 (MD5)
Previous issue date: 2014-12-19Financiadora de Estudos e Projetos
We proposed a new split-merge MCMC algorithm for image segmentation. We describe how an image can be subdivided into multiple disjoint regions, with each region having an associated latent indicator variable. The latent indicator variables are modeled with a prior Gibbs distribution governed by a spatial regularization parameter. Regions with same label define a component. Pixels within a component are distributed according to a Gaussian distribution. We treat the spatial regularization parameter and the number of components K as unknown. To estimate K, the spatial regularization parameter and the component parameters we propose the Metropolised split-merge (MSM) algorithm. The MSM comprises two type of moves. The first one, is a data-driven split-merge move. These movements change the number of components K in the neighborhood K _ 1 and are accepted according to Metropolis-Hastings acceptance probability. After a split-merge step, the component parameters, the spatial regularization parameter and latent allocation variables are updated conditional on K by using the Gibbs sampling, the Metropolis- Hastings and Swendsen-Wang algorithm, respectively. The main advantage of the proposed algorithm is that it is easy to implement and the acceptance probability for split-merge movements depends only of the observed data. The performance of the proposed algorithm is verified using artificial datasets as well as real datasets.
Nesta tese, modelamos uma imagem através de uma grade regular retangular e assumimos que esta grade é dividida em múltiplas regiões disjuntas de pixels. Quando duas ou mais regiões apresentam a mesma característica, a união dessas regiões forma um conjunto chamado de componente. Associamos a cada pixel da imagem uma variável indicadora não observável que indica a componente a que o pixel pertence. Estas variáveis indicadoras não observáveis são modeladas através da distribuição de probabilidade de Gibbs com parâmetro de regularização espacial _. Assumimos que _ e o número de componentes K são desconhecidos. Para estimação conjunta dos parâmetros de interesse, propomos um algoritmo MCMC denominado de ejeção-absorção metropolizado (EAM). Algumas vantagens do algoritmo proposto são: (i) O algoritmo não necessita da especificação de uma função de transição para realização dos movimentos ejeção e absorção. Ao contrário do algoritmo reversible jump (RJ) que requer a especificação de boas funções de transição para ser computacionalmente eficiente; (ii) Os movimentos ejeção e absorção são desenvolvidos com base nos dados observados e podem ser rapidamente propostos e testados; (iii) Novas componentes são criadas com base em informações provenientes de regiões de observações e os parâmetros das novas componentes são gerados das distribuições a posteriori. Ilustramos o desempenho do algoritmo EAM utilizando conjuntos de dados simulados e reais.
29
Shinde, Swapnil Sadashiv. „Radio Access Network Function Placement Algorithms in an Edge Computing Enabled C-RAN with Heterogeneous Slices Demands“. Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020. http://amslaurea.unibo.it/20063/.
Der volle Inhalt der QuelleAnnotation:
Network slicing provides a scalable and flexible solution for resource allocation with performance guaranty and isolation from other services in the 5G architecture. 5G has to handle several active use cases with different requirements. The single solution to satisfy all the extreme requirements requires overspecifies and high-cost network architecture. Further, to fulfill the diverse requirements, each service will require different resources from a radio access network (RAN), edge, and central offices of 5G architecture and hence various deployment options. Network function virtualization allocates radio access network (RAN) functions in different nodes. URLLC services require function placement nearer to the ran to fulfill the lower latency requirement while eMBB require cloud access for implementation. Therefore arbitrary allocation of network function for different services is not possible. We aim to developed algorithms to find service-based placement for RAN functions in a multitenant environment with heterogeneous demands. We considered three generic classes of slices of eMBB, URLLC, mMTC. Every slice is characterized by some specific requirements, while the nodes and the links are resources constrained. The function placement problem corresponds to minimize the overall cost of allocating the different functions to the different nodes organized in layers for respecting the requirements of the given slices. Specifically, we proposed three algorithms based on the normalized preference associated with each slice on different layers of RAN architecture. The maximum preference algorithm places the functions on the most preferred position defined in the preference matrix. On the other hand, the proposed modified preference algorithm provides solutions by keeping track of the availability of computational resources and latency requirements of different services. We also used the Exhaustive Search Method for solving a function allocation problem.
30
Vilanova, Antonio Carlos. „Otimização de um modelo de propagação com múltiplos obstáculos na troposfera utilizando algoritmo genético“. Universidade Federal de Uberlândia, 2013. https://repositorio.ufu.br/handle/123456789/14317.
Der volle Inhalt der QuelleAnnotation:
Coordenação de Aperfeiçoamento de Pessoal de Nível SuperiorThis thesis presents an evaluation methodology to optimize parameters in a model of propagation of electromagnetic waves in the troposphere. The propagation model is based on parabolic equations solved by Split-Step Fourier. This propagation model shows good efficiency and rough terrain situations where the refractivity varies with distance. The search for optimal parameters in models involving electromagnetic waves requires a large computational cost, especially in large search spaces. Aiming to reduce the computational cost in determining the parameter values that maximize the field strength at a given position of the observer was developed an application called EP-AG. The application has two main modules. The first is the propagation module that estimates the value of the electric field in the area of a given terrain irregularities and varying with the refractivity with distance. The second is the optimization module which finds the optimum antenna height and frequency of operation that lead the field to the maximum value of the land in a certain position. Initially performed only the propagation module using different profiles of land and refractivity. The results shown by contours and profile field shown the efficiency of the model. Subsequently to evaluate the optimization by genetic algorithms were used two different settings as well as the irregularity of the terrain, refractivity profile and size of the search space. In each of these settings picked up a point observation in which the value of the electric field served as a metric for comparison. At this point, we determined the optimal values of the parameters by the brute force method and the genetic algorithm optimization. The results showed that for small search spaces virtually no reduction of the computational cost, however for large search spaces, the decrease was very significant and relative errors much smaller than those obtained by the method of brute force.
Esta tese apresenta uma avaliação metodológica para otimizar parâmetros em um modelo de propagação de ondas eletromagnéticas na troposfera. O modelo de propagação é baseado em equações parabólicas resolvidas pelo Divisor de Passos de Fourier. Esse modelo de propagação apresenta boa eficiência em terrenos irregulares e situações em que a refratividade varia com a distância. A busca de parâmetros ótimos em modelos que envolvem ondas eletromagnéticas demanda um grande custo computacional, principalmente em grandes espaços de busca. Com o objetivo de diminuir o custo computacional na determinação dos valores dos parâmetros que maximizem a intensidade de campo em uma determinada posição do observador, foi desenvolvido um aplicativo denominado EP-AG. O aplicativo possui dois módulos principais. O primeiro é o módulo de propagação, que estima o valor do campo elétrico na área de um determinado terreno com irregularidades e com a refratividade variando com a distância. O segundo é o módulo de otimização, que encontra o valor ótimo da altura da antena e da frequência de operação que levam o campo ao valor máximo em determinada posição do terreno. Inicialmente, executou-se apenas o módulo de propagação utilizando diferentes perfis de terrenos e de refratividade. Os resultados apresentados através de contornos e de perfis de campo mostraram a eficiência do modelo. Posteriormente, para avaliar a otimização por algoritmos genéticos, foram utilizadas duas configurações bem diferentes quanto à irregularidade do terreno, perfil de refratividade e tamanho de espaço de busca. Em cada uma dessas configurações, escolheu-se um ponto observação no qual o valor do campo elétrico serviu de métrica para comparação. Nesse ponto, determinou-se os valores ótimos dos parâmetros pelo método da força bruta e pela otimização por algoritmo genético. Os resultados mostraram que, para pequenos espaços de busca, praticamente não houve redução do custo computacional, porém, para grandes espaços de busca, a redução foi muito significativa e com erros relativos bem menores do que os obtidos pelo método da força bruta.
Doutor em Ciências
31
Dugge, Birgit. „Ein simultanes Erzeugungs-, Verteilungs-, Aufteilungs- und Routenwahlmodell“. Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2006. http://nbn-resolving.de/urn:nbn:de:swb:14-1162994071370-87705.
Der volle Inhalt der QuelleAnnotation:
In dieser Arbeit wird ein simultanes Quell-, Ziel-, Verkehrsmittel- und Routenwahlmodell (Modell EVA-U) entwickelt, welches ein stochastisches Nutzergleichgewicht erreicht. Die Routenwahlmodelle der Verkehrsarten sind nicht mehr Teil der Umlegungsalgorithmen, sondern in das Nachfragemodell integriert. Dadurch ist eine konsistente Bewertung aller Alternativen (der Verkehrsarten) möglich. Das Simultanmodell EVA-U stellt eine Weiterentwicklung des Simultanmodells EVA von LOHSE dar. Das EVA-U-Modell ist den universalen Logit-Modellen zuzuordnen. Die Randsummenbedingungen der Verkehrsverteilung werden beachtet. Die Bewertung der Alternativen erfolgt mittels Generalisierter Kosten. Die Abhängigkeit von Routen wird berücksichtigt, ebenso die Tagesganglinie der Verkehrsnachfrage und die Fahrpläne des ÖV-Systems. Das Modell EVA-U erlaubt auch die Berücksichtigung von Routen intermodaler Verkehrsarten (z.B. P+R). Darüber hinaus ist die Integration eines Modells des ruhenden Verkehrs möglichIn this thesis a simultaneous Trip Generation-, Distribution-, Modal-Split and Route Choice Model (modell EVA-U) is elaborated. The model tends to reach a stochastic user equilibrium. The route choice algorithms are not longer part of an assignment procedure but part of the demand model. A consistent assessment of properties of all transport systems is possible. The simultaneous model EVA-U is an advancement of the EVA-Model by Lohse. The model EVA-U is to be assigned to the generalised logit-models. All matrix constrains are taken into account. The assessment is effected by generalised costs. The dependence of routes is taken into account. Moreover, the integration of day time and the schedules of private transport lines is possible. Furthermore, it is possible to integrate a model of parked cars and circuits of inter-modal traffic forms (park and ride) in the Model EVA-U
32
Dugge, Birgit. „Ein simultanes Erzeugungs-, Verteilungs-, Aufteilungs- und Routenwahlmodell“. Doctoral thesis, Technische Universität Dresden, 2005. https://tud.qucosa.de/id/qucosa%3A24840.
Der volle Inhalt der QuelleAnnotation:
In dieser Arbeit wird ein simultanes Quell-, Ziel-, Verkehrsmittel- und Routenwahlmodell (Modell EVA-U) entwickelt, welches ein stochastisches Nutzergleichgewicht erreicht. Die Routenwahlmodelle der Verkehrsarten sind nicht mehr Teil der Umlegungsalgorithmen, sondern in das Nachfragemodell integriert. Dadurch ist eine konsistente Bewertung aller Alternativen (der Verkehrsarten) möglich. Das Simultanmodell EVA-U stellt eine Weiterentwicklung des Simultanmodells EVA von LOHSE dar. Das EVA-U-Modell ist den universalen Logit-Modellen zuzuordnen. Die Randsummenbedingungen der Verkehrsverteilung werden beachtet. Die Bewertung der Alternativen erfolgt mittels Generalisierter Kosten. Die Abhängigkeit von Routen wird berücksichtigt, ebenso die Tagesganglinie der Verkehrsnachfrage und die Fahrpläne des ÖV-Systems. Das Modell EVA-U erlaubt auch die Berücksichtigung von Routen intermodaler Verkehrsarten (z.B. P+R). Darüber hinaus ist die Integration eines Modells des ruhenden Verkehrs möglich.In this thesis a simultaneous Trip Generation-, Distribution-, Modal-Split and Route Choice Model (modell EVA-U) is elaborated. The model tends to reach a stochastic user equilibrium. The route choice algorithms are not longer part of an assignment procedure but part of the demand model. A consistent assessment of properties of all transport systems is possible. The simultaneous model EVA-U is an advancement of the EVA-Model by Lohse. The model EVA-U is to be assigned to the generalised logit-models. All matrix constrains are taken into account. The assessment is effected by generalised costs. The dependence of routes is taken into account. Moreover, the integration of day time and the schedules of private transport lines is possible. Furthermore, it is possible to integrate a model of parked cars and circuits of inter-modal traffic forms (park and ride) in the Model EVA-U.
33
Guibadj, Rym Nesrine. „Problèmes de tournées de véhicules et application industrielle pour la réduction de l'empreinte écologique“. Phd thesis, Université de Technologie de Compiègne, 2013. http://tel.archives-ouvertes.fr/tel-00966428.
Der volle Inhalt der QuelleAnnotation:
Dans cette thèse, nous nous sommes intéressés à la résolution approchée de problèmes de tournées de véhicules. Nous avons exploité des travaux menés sur les graphes d'intervalles et des propriétés de dominance relatives aux tournées saturées pour traiter les problèmes de tournées sélectives plus efficacement. Des approches basées sur un algorithme d'optimisation par essaim particulaire et un algorithme mémétique ont été proposées. Les métaheuristiques développées font appel à un ensemble de techniques particulièrement efficaces telles que le découpage optimal, les opérateurs de croisement génétiques ainsi que des méthodes de recherches locales. Nous nous sommes intéressés également aux problèmes de tournées classiques avec fenêtres de temps. Différents prétraitements ont été introduits pour obtenir des bornes inférieures sur le nombre de véhicules. Ces prétraitements s'inspirent de méthodes issues de modèles de graphes, de problème d'ordonnancement et de problèmes de bin packing avec conflits. Nous avons montré également l'utilité des méthodes développées dans un contexte industriel à travers la réalisation d'un portail de services mobilité.
34
Douchin, Nicolas. „Étude de l'influence du conduit d'évaporation atmosphérique sur des liaisons satellite-navire entre 1 et 10 GHz : contribution à l'élaboration d'une méthode de caractérisation de ce conduit“. Toulouse, ENSAE, 1992. http://www.theses.fr/1992ESAE0017.
Der volle Inhalt der QuelleAnnotation:
Le conduit d'évaporation, presque toujours présent à la surface des océans, peut engendrer une modification sensible de la couverture à site bas des systèmes radioélectriques embarqués sur les navires. C'est pourquoi la connaissance, à tout instant, de ce conduit est essentielle. Or, il n'existe actuellement aucun moyen de mesure directe du profil d'indice de réfraction, utilisable opérationnellement. Nous avons donc étudié la possibilité de caractériser le conduit d'évaporation à partir des effets engendrés par celui-ci sur les liaisons satellite-navire à élévation très faible. Nos travaux ont porté d'abord sur l'élaboration d'un logiciel de simulation qui prend en compte les effets dus au conduit d'évaporation: la méthode de l'équation parabolique a été utilisée pour le calcul de la propagation en milieu non homogène, puis il a fallu raccorder deux types de propagation différents sur une interface dont la procédure de détermination constitue le point le plus original de cette étude. En outre, l'outil développé permet de prendre en compte les ondes de gravité à la surface de la mer et l'existence de gradients horizontaux de l'indice de réfraction. Ensuite, une étude fréquentielle a démontré l'adéquation d'une fréquence voisine de 5 GHz pour la caractérisation du conduit d'évaporation, ainsi que l'intérêt de la diversité de fréquence. L'influence de la rugosité de la mer et des gradients horizontaux d'indice a été également examinée. Cette étude paramétrique a montré alors que la comparaison signaux mesures/signaux simulés devait porter non seulement sur la position en élévation, des extrema du signal reçu, mais aussi sur l'évolution de ce niveau de porteuse lorsque la liaison est légèrement transhorizon.
35
Yang, Wan-Ching, und 楊琬晴. „A Genetic Algorithm for the Split Pickup and Delivery Problem“. Thesis, 2014. http://ndltd.ncl.edu.tw/handle/31885129319477937162.
Der volle Inhalt der QuelleAnnotation:
碩士國立中正大學
資訊工程研究所
102
Abstract The pickup and delivery problem (PDP) is an important logistic problem aiming for the shortest route that can provide delivery nodes with commodities collected from pickup nodes, subject to the vehicle load constraint. This study proposes a new PDP variant, called the split pickup and delivery problem (SpPDP), in which the split feature allows multiple visits to a node and thus enables the vehicle to load or discharge an arbitrary portion of commodities along the route. This problem considers the practical situations of limited capacity and insufficient commodities left for subsequent service. To resolve the SpPDP, this study develops a genetic algorithm (GA) using variable-length representation. The variable-length chromosome representation addresses the issue of variable number of visiting nodes in the SpPDP. To handle the customers scheduling, we propose the adjacency matrix crossover (AMC) to preserve low-cost edges from legal routes. Moreover, two local enhancement operators, i.e., split and merge, are designed to repair an infeasible solution into a feasible solution and to reduce the transportation cost without destroying the route feasibility, respectively. A series of experiments is conducted to compare the solution quality and convergence speed of GA using fixed-length and variable-length representation. Experimental results validate the optimization efficacy of the proposed GA with variable-length representation. In addition, the two local enhancement operators show their effectiveness on arranging the visiting order and demand of each customer. The results further validate the utility of the split feature and the proposed SpPDP in dealing with limited vehicle capability and insufficient commodities.
36
Hu, Yahong, Wen Jing Hsu und Xiang Xu. „Efficient Algorithms for Load Shuffling in Split-Platform AS/RS“. 2003. http://hdl.handle.net/1721.1/3856.
Der volle Inhalt der QuelleAnnotation:
We address the issue of shuffling loads in Automated Storage/Retrieval Systems (AS/RS) in this paper. The objective is to pre-sort the loads into any specified locations in order to minimize the response time of retrievals. 1D, 2D and 3D AS/RS racks have been designed in order to achieve the shuffling efficiently. The shuffling algorithms are described in detail. The response time of retrieval, the lower and upper bounds of energy consumption are also derived. Results of the analysis and numerical experiments show that the shuffling algorithms are quite efficient.Singapore-MIT Alliance (SMA)
37
Shiu, Jy-Yuan, und 許智淵. „Index-Split and Probability-Fitted Algorithm for Finite-Precision Arithmetic Codes“. Thesis, 2004. http://ndltd.ncl.edu.tw/handle/20854144388328007607.
Der volle Inhalt der QuelleAnnotation:
碩士義守大學
資訊工程學系
91
This paper proposes an index split-connection algorithm which is composed of an index-splitting (IS) algorithm and a probability-fitting (PF) algorithm (abbreviated as the fitting-by-splitting algorithm, FS algorithm), to regularly and effectively the finite-precision arithmetic coding, which is here named as the FSAS code. The FS algorithm can generate FSAC codes of arbitrarily specified length without using the post-appended sentinel symbol or pre-affixed side-information. In the FS procedure, the IS process splits the input symbols into the paired indices to let split indices as possibly as reuse the residual information space at the end of each FSAC codeword. And, the PF process performs behind each IS process for enhancing the reuse efficiency through a fast adaptation process of probability table. Through with the proper collaboration of IS and PF processes, the proposed algorithm can nearly obtain coding efficiency of unlimited precision arithmetic coding, especially for the binary sources. In addition, the consecutive output FSAC codes can be mutually independent to avoid the error propagation. Due to with the properties of regularity and error propagation limit, the FS algorithm is suitable for realizing arithmetic codes as short packets transmitted in the high speed wired and wireless networks.
38
Chu, Chih-Wen, und 朱志文. „Fuzzy Modeling and Control of Air-Conditioned Rooms with Clusters Split/Merge Algorithm“. Thesis, 2002. http://ndltd.ncl.edu.tw/handle/15857516124513949174.
Der volle Inhalt der QuelleAnnotation:
碩士大同大學
機械工程研究所
90
In air-conditioned room, the main factors that affect the human comfort are air velocity and temperature. To describe the relation among these state variables all over the air-conditioned room, the TS fuzzy models of real system are built by using data clustering algorithms. To increase the accuracy of models, the number and center of clusters are automatically and quickly adjusted according to certain criteria we proposed. That is, a fast and rough clustering is first performed by K-means algorithm. Then a clusters split/merge algorithm is applied which can automatically find suitable cluster centers for fuzzy clustering with Fuzzy c-means algorithm. Also, to demonstrate the feasibility of the clusters split/merge algorithm, the built fuzzy model of air-conditioned room is applied in various control approaches.
39
Pan, Li-Chun, und 潘立鈞. „Optimal Bayesian D-optimal split-plot supersaturated mixture designs by swarm intelligence algorithm“. Thesis, 2019. http://ndltd.ncl.edu.tw/cgi-bin/gs32/gsweb.cgi/login?o=dnclcdr&s=id=%22107NCHU5337016%22.&searchmode=basic.
Der volle Inhalt der Quelle
40
Chen, Lu-Wei, und 陳陸威. „Design and Implementation of CID Merge/Split Algorithm for IEEE 802.16 Wireless Metropolitan Area Network“. Thesis, 2004. http://ndltd.ncl.edu.tw/handle/00094739690576775626.
Der volle Inhalt der QuelleAnnotation:
碩士淡江大學
電機工程學系碩士班
94
Mobile communication system providers already invest money on deploying 3G mobile communication networks. Computer-based industry proposes another wireless communication technology: IEEE 802.16 WMAN (Worldwide Interoperability for Microwave Access), which is also known as IEEE 802.16-2004/16e standards. It is a new wireless communication technology that is designed to provide users wireless data services, and this technique also has the potential to be the Last-mile solution for connecting residential networks to Internet. The Cid Merging and Splitting Mechanism (CID MSM) enhance the IEEE 802.16-2004 MAC protocol when the ability of QoS scheduler that is designed by us is overload. It means that more cids lead more bandwidth allocated time. Because of promoting the performance, we design the Cid Merging and Splitting Mechanism to reach our goal. The IEEE 802.16 CPE (Customer Premise Equipment) will perform cid merging algorithm when our QoS scheduler was overload. As long as the number of cid is reach threshold, the QoS scheduler will send control message with “merge” to the CID MS Engine to tell it the status of QoS scheduler. So, when a new traffic injects into CPE after QoS scheduler was overload, first, the Packet Classifier will search the CID table regularly to know the traffic was recoded or not. Second, if the result is “miss”, the CPE will perform CAC (Call Admission Control) Algorithm. Then the CID MS Engine will judge the status of QoS scheduler, and perform CID Merging algorithm. The major conditions for selecting the target CID are the QoS type and maximum size that the PHS can suppress. So we define priority order, for selecting the suitable target. When the QoS scheduler can’t process more cids, the CID MS engine will perform search algorithm to choose the suitable target cid from CID table according to the header information of new traffic, and it will reference the SFID table to combine the QoS parameters of the new traffic and target cid into a new QoS parameter set. After selecting the target cid, the Dynamic Service Engine will use this new parameter set to find a most corresponding SFID. If the SFID is existence, it will send DSC with this SFID to BS. Otherwise, DSA will be sent.
41
Jhang, Jia-Ming, und 張家銘. „Analysis on Dengue Fever Infection Hotspot Using the Split Feasibility Common Fixed Point Algorithm - Tainan Cases as Example“. Thesis, 2016. http://ndltd.ncl.edu.tw/handle/at7f99.
Der volle Inhalt der QuelleAnnotation:
碩士國立屏東科技大學
工業管理系所
104
In recent years, related diseases of the vector mosquito, such as dengue fever, have been rapid spread. In Taiwan, dengue fever always breaks out during summers and falls. The number of dengue fever cases in Tainan city is more than 20,000, a historical high, at 2015. Dengue virus is spread by two kinds of mosquitos, Aedes aegypti and Aedes albopictus. Most of the past literatures of dengue fever focus on discussing about environment, behavior and insecticides. This study focuses on identifying the high infecting hotspots. First, we use image reconstruction to calculate the infecting rate for each infected spot in Taiwan for each time periods (ten days as a period from 8/1~12/31, 2015). Then, we show that we can use the high-infecting-rate spot at 8/1~9/10 (period 1) to predict the high-infecting-rate ones at 9/11~12/31 (period 2) with around 70% accuracy. Meanwhile, we also use the change of calculated infecting abilities of each infected spots in those two periods to study the factors that cause the breakout of dengue fever at 2015 in Tainan city. Finally, we study the change of the infecting rate of these insecticide-applied spots. The result shows that insecticide always cannot reduce the infecting ability of hotspots.
42
楊佩蓉. „Hybrid Proximal Gradient Algorithm and Convergence Theorem for The Split DC Program in Finite Dimensional Real Hilbert Space“. Thesis, 2018. http://ndltd.ncl.edu.tw/handle/xu8ee7.
Der volle Inhalt der QuelleAnnotation:
碩士國立嘉義大學
應用數學系研究所
106
In this paper, we consider the split DC program (split minimization problems for DC functions): (SDCP) Find x 2 H1 such that x 2 arg min x2H1 f1(x) and Ax 2 arg min y2H2 f2(y); where H1 and H2 are real Hilbert spaces, A : H1 ! H2 is a linear and bounded mapping with adjoint A, f1 = g1
43
Trunkát, Marek. „Algoritmy v teorii reprezentací“. Master's thesis, 2013. http://www.nusl.cz/ntk/nusl-328276.
Der volle Inhalt der QuelleAnnotation:
This thesis deals with an implementation of algorithm for computation of generator of almost split sequences ending at an indecomposable nonprojective module of path algebra over finite quiver. Algorithm is implemented in algebra system GAP (Groups, Algorithms, Programming) with additional package QPA (Quivers and Path Algebras). Powered by TCPDF (www.tcpdf.org)
44
„Split algorithms for LMS adaptive systems“. Chinese University of Hong Kong, 1991. http://library.cuhk.edu.hk/record=b5886875.
Der volle Inhalt der QuelleAnnotation:
by Ho King Choi.Thesis (Ph.D.)--Chinese University of Hong Kong, 1991.
Includes bibliographical references.
Chapter 1. --- Introduction --- p.1
Chapter 1.1 --- Adaptive Filter and Adaptive System --- p.1
Chapter 1.2 --- Applications of Adaptive Filter --- p.4
Chapter 1.2.1 --- System Identification --- p.4
Chapter 1.2.2 --- Noise Cancellation --- p.6
Chapter 1.2.3 --- Echo Cancellation --- p.8
Chapter 1.2.4 --- Speech Processing --- p.10
Chapter 1.3 --- Chapter Summary --- p.14
References --- p.15
Chapter 2. --- Adaptive Filter Structures and Algorithms --- p.17
Chapter 2.1 --- Filter Structures for Adaptive Filtering --- p.17
Chapter 2.2 --- Adaptation Algorithms --- p.22
Chapter 2.2.1 --- The LMS Adaptation Algorithm --- p.24
Chapter 2.2.1.1 --- Convergence Analysis --- p.28
Chapter 2.2.1.2 --- Steady State Performance --- p.33
Chapter 2.2.2 --- The RLS Adaptation Algorithm --- p.35
Chapter 2.3 --- Chapter Summary --- p.39
References --- p.41
Chapter 3. --- Parallel Split Adaptive System --- p.45
Chapter 3.1 --- Parallel Form Adaptive Filter --- p.45
Chapter 3.2 --- Joint Process Estimation with a Split-Path Adaptive Filter --- p.49
Chapter 3.2.1 --- The New Adaptive System Identification Configuration --- p.53
Chapter 3.2.2 --- Analysis of the Split-Path System Modeling Structure --- p.57
Chapter 3.2.3 --- Comparison with the Non-Split Configuration --- p.63
Chapter 3.2.4 --- Some Notes on Even Filter Order Case --- p.67
Chapter 3.2.5 --- Simulation Results --- p.70
Chapter 3.3 --- Autoregressive Modeling with a Split-Path Adaptive Filter --- p.75
Chapter 3.3.1 --- The Split-Path Adaptive Filter for AR Modeling --- p.79
Chapter 3.3.2 --- Analysis of the Split-Path AR Modeling Structure --- p.84
Chapter 3.3.3 --- Comparison with Traditional AR Modeling System --- p.89
Chapter 3.3.4 --- Selection of Step Sizes --- p.90
Chapter 3.3.5 --- Some Notes on Odd Filter Order Case --- p.94
Chapter 3.3.6 --- Simulation Results --- p.94
Chapter 3.3.7 --- Application to Noise Cancellation --- p.99
Chapter 3.4 --- Chapter Summary --- p.107
References --- p.109
Chapter 4. --- Serial Split Adaptive System --- p.112
Chapter 4.1 --- Serial Form Adaptive Filter --- p.112
Chapter 4.2 --- Time Delay Estimation with a Serial Split Adaptive Filter --- p.125
Chapter 4.2.1 --- Adaptive TDE --- p.125
Chapter 4.2.2 --- Split Filter Approach to Adaptive TDE --- p.132
Chapter 4.2.3 --- Analysis of the New TDE System --- p.136
Chapter 4.2.3.1 --- Least-mean-square Solution --- p.138
Chapter 4.2.3.2 --- Adaptation Algorithm and Performance Evaluation --- p.142
Chapter 4.2.4 --- Comparison with Traditional Adaptive TDE Method --- p.147
Chapter 4.2.5 --- System Implementation --- p.148
Chapter 4.2.6 --- Simulation Results --- p.148
Chapter 4.2.7 --- Constrained Adaptation for the New TDE System --- p.156
Chapter 4.3 --- Chapter Summary --- p.163
References --- p.165
Chapter 5. --- Extension of the Split Adaptive Systems --- p.167
Chapter 5.1 --- The Generalized Parallel Split System --- p.167
Chapter 5.2 --- The Generalized Serial Split System --- p.170
Chapter 5.3 --- Comparison between the Parallel and the Serial Split Adaptive System --- p.172
Chapter 5.4 --- Integration of the Two Forms of Split Predictors --- p.177
Chapter 5.5 --- Application of the Integrated Split Model to Speech Encoding --- p.179
Chapter 5.6 --- Chapter Summary --- p.188
References --- p.139
Chapter 6. --- Conclusions --- p.191
References --- p.197
45
蘇信銘. „Parallel algorithms on split-and-merge segmentation“. Thesis, 1992. http://ndltd.ncl.edu.tw/handle/43280454489135631024.
Der volle Inhalt der Quelle
46
Wu, Guo-Shuo, und 吳國碩. „A heuristic algorithm approach to reverse logistics network for resolving splits in location/allocation problems“. Thesis, 2008. http://ndltd.ncl.edu.tw/handle/68282674462485938192.
Der volle Inhalt der QuelleAnnotation:
碩士雲林科技大學
工業工程與管理研究所碩士班
96
Recycling conscious has been rising in recent years, and action taken frequently is setting a collection point, and it has been shown in some past research. In facility location-allocation that only addresses on p-median location model but not is pq-median. Therefore, for conforming to practical situation in this research, in limited capacity of collection points and centralized return centers, bringing up nonlinear mixed-integer programming model by pq-median location model reduces total cost in reverse logistics because of the connection among the best quantities and places of collection points and centralized return center, holding period for each collection point, and customers, collection points and centralized return center. Figuring out location allocation problem in reverse logistics by building heuristic algorithm compared with genetic algorithm for solving quality and solving time; this report proves that heuristic algorithm is better than genetic algorithm in three different illustrations. In sensitivity analysis, further demonstration to the maximum of holding period is for decision maker reference.
47
Medina, Raúl Ezequiel. „Optimización de dominios de Planning“. Bachelor's thesis, 2016. http://hdl.handle.net/11086/3216.
Der volle Inhalt der QuelleAnnotation:
Tesis (Lic. en Ciencias de la Computación)--Universidad Nacional de Córdoba, Facultad de Matemática, Astronomía, Física y Computación, 2016.En este trabajo se describe una técnica de optimización de dominios de Planning. Primero se presenta una introducción cerca de la inteligencia artificial en general. Luego se aborda el problema de planning revisando los momentos históricos más importantes hasta llegar al estado del arte. También se introduce el lenguaje PDDL para poder presentar nuevos dominios que se implementaron. Luego se presenta la técnica de optimización propuesta, la cual incluye el algoritmo de Split y Unsplit. Con el fin de poder estudiar el rendimiento de la técnica de optimización propuesta, se realizan pruebas de rendimiento sobre los dominios presentados y un dominio clásico. Por último se estudian los resultados obtenidos para poder dar una conclusión sobre la técnica en general.
This work explain an optimization technique for planning domains. First comes an introduction about artificial intelligence in general. Then describes the planning problem, the most important historical moments are reviewd until the state of the art. After that, the language PDDL is introduced, to understand the new domains implemented. Then the Split and Unsplit algorithms are presented. Finally after running tests, the results and conclusion are shown.
48
Hahmann, Stefanie. „Modélisation géométrique de surfaces lisses: Design et Fairing“. Habilitation à diriger des recherches, 2001. http://tel.archives-ouvertes.fr/tel-00011422.
Der volle Inhalt der QuelleAnnotation:
Les travaux présentés dans ce mémoire d'habilitation portent sur deux aspects de la modélisation géométrique de surfaces lisses.
L'ambition des recherches menées sur le thème de l'interpolation de triangulations
polygonales quelconques par des surfaces polynomiales a été de revenir à la source du
problème en introduisant un autre découpage, régulier en quatre cette fois ci, des
triangles données en entrée. Nous présentons de nouvelles approches en insistant sur
la résolution du problème de raccordement lisse de patchs triangulaires en un sommet
commun ainsi que sur le choix optimal des paramètres de forme permettant de contrôler
la qualité esthétique de la surface. De plus, l'invariance par subdivision d'un des
schémas permet une hiérarchisation des procédés d'interpolation. Il devient alors
possible d'avoir un modèle de surface multirésolution paramétrique, et permettant
de décrire de topologies quelconques, applicable dans des domaines aussi divers que
la CAO, la réalité virtuelle ou la médecine.
Le deuxième thème concerne le lissage de surfaces B-splines. Deux types de méthodes,
basées sur la diminution de la variation de courbures, sont présentés. Les premières
utilisent des stratégies de recherche heuristiques ou systématiques. Les secondes
reposent sur la convolution du réseau des points de contrôle de la surface par des
filtres discrets.
49
Hahmann, Stéfanie. „Modélisation géométrique de surfaces lisses : design et fairing“. Habilitation à diriger des recherches, 2001. http://tel.archives-ouvertes.fr/tel-00004681.
Der volle Inhalt der QuelleAnnotation:
Les travaux présentés dans ce mémoire portent sur deux aspects de la modélisation géométrique de surfaces lisses. L'ambition des recherches menées sur le thème de l'interpolation de triangulations polygonales quelconques par des surfaces polynomiales a été de revenir à la source du problème en introduisant un autre découpage, régulier en quatre cette fois ci, des triangles données en entrée. Nous présentons de nouvelles approches en insistant sur la résolution du problème de raccordement lisse de patchs triangulaires en un sommet commun ainsi que sur le choix optimal des paramètres de forme permettant de contrôler la qualité esthétique de la surface. De plus, l'invariance par subdivision d'un des schémas permet une hiérarchisation des procédés d'interpolation. Il devient alors possible d'avoir un modèle de surface multirésolution paramétrique, et permettant de décrire de topologies quelconques, applicable dans des domaines aussi divers que la CAO, la réalité virtuelle ou la médecine. Le deuxième thème concerne le lissage de surfaces B-splines. Deux types de méthodes, basées sur la diminution de la variation de courbures, sont présentés. Les premières utilisent des stratégies de recherche heuristiques ou systématiques. Les secondes reposent sur la convolution du réseau des points de contrôle de la surface par des filtres discrets.