Literatura científica selecionada sobre o tema "Optmisation"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Optmisation".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Optmisation"
1
Ignácio, Renato Da Silva, Marianna Bosch e Marlene Alves Dias. "Parcours d’étude et de recherche : une étude sur les chemins minimauxStudy and research course: a study on minimal paths". Educação Matemática Pesquisa : Revista do Programa de Estudos Pós-Graduados em Educação Matemática 22, n.º 4 (15 de setembro de 2020): 801–8. http://dx.doi.org/10.23925/1983-3156.2020v22i4p801-808.
Texto completo da fonteResumo:
RésuméCette étude vise à exposer le progrès d'un projet de recherche doctorale dont l'objectif est d'analyser les limites et les possibilités d'un parcours d'étude et de recherche (PER) en tant que stratégie didactique pour faire face au paradigme monumentaliste des mathématiques scolaires. Nous ne présentons dans ce rapport que les résultats préliminaires.Mots-clés : Optmisation; Parcours d´étude et de recherche, Distance, Trajectoires.AbstractThe aim of this study is to expose the progress of a doctoral research project whose objective is the analysis of the limits and possibilities of a study and research course (SRC) as a didactical strategy to face the monumental paradigm of school mathematics. Only preliminaryr esults are presented in this report.Keywords: Optimization; Course of study and research, Distance, Trajectories.
2
Ignácio, Renato Da Silva, Marianna Bosch e Marlene Alves Dias. "Parcours d’étude et de recherche : une étude sur les chemins minimauxStudy and research course: a study on minimal paths". Educação Matemática Pesquisa : Revista do Programa de Estudos Pós-Graduados em Educação Matemática 22, n.º 4 (15 de setembro de 2020): 801–8. http://dx.doi.org/10.23925/1983-3156.2020v22i4p801-808.
Texto completo da fonteResumo:
RésuméCette étude vise à exposer le progrès d'un projet de recherche doctorale dont l'objectif est d'analyser les limites et les possibilités d'un parcours d'étude et de recherche (PER) en tant que stratégie didactique pour faire face au paradigme monumentaliste des mathématiques scolaires. Nous ne présentons dans ce rapport que les résultats préliminaires.Mots-clés : Optmisation; Parcours d´étude et de recherche, Distance, Trajectoires.AbstractThe aim of this study is to expose the progress of a doctoral research project whose objective is the analysis of the limits and possibilities of a study and research course (SRC) as a didactical strategy to face the monumental paradigm of school mathematics. Only preliminaryr esults are presented in this report.Keywords: Optimization; Course of study and research, Distance, Trajectories.
3
Xian, Guijun, Hong-Ting Pu, Xiao-Su Yi e Yi Pan. "Parametric Optmisation of Pin-assisted-melt Impregnation of Glass Fiber/Polypropylene by Taguchi Method". Journal of Composite Materials 40, n.º 23 (23 de março de 2006): 2087–97. http://dx.doi.org/10.1177/0021998306061321.
Texto completo da fonte
4
Zuturu, Arun Adithya. "A Mobile Application for Crop Optmisation using Satellite Imagery and Disease Detection using AI". International Journal for Research in Applied Science and Engineering Technology 12, n.º 4 (30 de abril de 2024): 1897–907. http://dx.doi.org/10.22214/ijraset.2024.60225.
Texto completo da fonteResumo:
Abstract: Despite being crucial to the world's food supply, small-scale farmers do not have access to resources or contemporary technologies. This makes it more difficult to make educated decisions, which lowers yields and causes financial hardship. To help farmers overcome this obstacle, our research uses satellite data to provide them with useful insights that will enable them to increase production and make wise decisions.
5
Addanki, Udaya Kumar, e B. Hemantha Kumar. "A Comparative Analysis of OLSR Routing Protocol based on PSO and Cuckoo Search Optimization (CSO) in Manets". International Journal on Recent and Innovation Trends in Computing and Communication 11, n.º 8s (18 de agosto de 2023): 483–90. http://dx.doi.org/10.17762/ijritcc.v11i8s.7229.
Texto completo da fonteResumo:
New developments in wireless communication have enabled the use of highly efficient and inexpensive wireless receivers in a variety of portable applications. Each node in a mobile network is a mobile device that independently organizes its own connection to the others and manages its own data transmissions. The adaptability, scalability, and cost reduction of mobile networks have attracted considerable attention. Because mobile networks are constantly changing, problems with routing and power usage are common. High error rates, energy limitations, and inadequate bandwidth are just a few of the issues plaguing mobile ad hoc networks. The relevance of routing protocols in dynamic multi-hop networks like Mobile Ad hoc Networks (MANET) has drawn the attention of many scholars. In this paper, we focus on implementing an OLSR(Optimised Link State Routing) protocol and evaluates its performance using two optmisation algorithm: Particle Swarm Optimization(OLSR) and Cuckoo Search Optimization (CSO). The simulation result suggests that PSO is superior to both CSO and the conventional OLSR routing technique. We implemented using NS-2 simulator for simulation and NAM for network animation.
6
Wilberforce, Tabbi, Ahmed Al Makky, A. Baroutaji, Rubal Sambi e A. G. Olabi. "Optmisation of bipolar plate through computational fluid dynamic simulation and modelling using nickle open pore cellular foam material". Renewable Energy and Power Quality Journal 1, n.º 15 (abril de 2017): 886–92. http://dx.doi.org/10.24084/repqj15.505.
Texto completo da fonte
7
Gniot, Marcelina, e Marek Jankiewicz. "Imaging in patients with ST-segment elevation myocardial infarction - a case report". Journal of Education, Health and Sport 13, n.º 5 (7 de março de 2023): 54–58. http://dx.doi.org/10.12775/jehs.2023.13.05.007.
Texto completo da fonteResumo:
Introduction and purpose: Intravascular ultrasound (IVUS) facilitates 3-dimensional visualization of the blood vessels. Nowadays, it becomes increasingly supportive in percutaneous coronary intervention (PCI) guiding in patients with acute myocardial infarction (AMI). This report presents IVUS-guided PCI performed on 43-year-old patient with ST-segment elevation myocardial infarction (STEMI).
Brief description of the state of knowledge: IVUS is an established intracoronary imaging technique that can be used in patients with AMI. It allows assessment of the plaque nature, stent selection and optmisation. An increasing body of evidence shows that IVUS-guided PCI is correlated with reduction in number of major adverse cardiovascular events (MACE), stent thrombosis and with less contrast use. Studies show, that IVUS can be used in patient with STEMI, as it is presented in this report.
Conclusion: This case illustrates IVUS-guided PCI performed on the patient with STEMI. It shows that it is crucial to consider using this technique in every patient with AMI, as it provides beneficial outcome of the treatment. It is particularly important in patients with complicated anatomy of the blood vessels and in patients with contraindications to the considerable contrast use.
8
Nutting, C. M., C. Rowbottom, V. P. Cosgrove, D. J. Convery, S. Webb e D. P. Dearnaley. "Evaluation of intensity modulated radiotherapy for tumours of the pelvis, head and neck, and thorax: optmisation and clinical implementation". International Journal of Radiation Oncology*Biology*Physics 48, n.º 3 (janeiro de 2000): 139. http://dx.doi.org/10.1016/s0360-3016(00)80073-5.
Texto completo da fonteTeses / dissertações sobre o assunto "Optmisation"
1
Mathey, Eliette. "Optmisation numérique du refroidissement des moules d'injection de thermoplastiques basée sur la simulation des transferts thermiques par la méthode des éléments frontières". Toulouse 3, 2004. http://www.theses.fr/2004TOU30264.
Texto completo da fonteResumo:
Nous proposons dans ce travail une procédure d'optimisation numérique du refroidissement des moules d'injection basée sur la simulation stationnaire ou transitoire de la phase de refroidissement du cycle d'injection. Les méthodes des éléments frontières et de la réciprocité duale ont été utilisées pour la résolution. Celle-ci a alors été intégrée dans une boucle d'optimisation de manière à déterminer la meilleure combinaison possible de paramètres de refroidissement. Le choix des objectifs, des paramètres et des contraintes est détaillé. L'optimisation est réalisée par une méthode de programmation quadratique séquentielle. L'analyse de sensibilité est faite par différences finies ou par différentiation directe. La procédure d'optimisation est appliquée à des sections de moules simples pour une étude des effets des hypothèses du problème d'optimisation. Enfin, les résultats de simulation et d'optimisation sont comparés à des mesures expérimentales réalisées sur des moules instrumentésIn this work, an optimization procedure of the cooling system is proposed. This procedure is based on numerical simulation of the cooling stage. Heat transfer during injection are simulated using a stationary or a transient model solved by the boundary element method and the dual reciprocity method. Numerical simulation is then used in an optimization loop to find the best combination of cooling system geometry and coolant parameters. A study of the possible parameters, objective functions, constraint handling techniques is carried out. Optimization is performed with a sequential quadratic programming method. Sensitivity analysis can be performed by a finite difference method or by direct differentiation. The optimization procedure is applied to 2D mould sections to study the effects of the objective function, the constraints and the simulation models used. Simulation results are also compared to experimental measures of mould temperatures
2
Zakrzewski, Jacek. "Design of flow processes for C-H activation-type reactions". Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/277176.
Texto completo da fonteResumo:
The last 15 years have seen tremendous advances in using different metal catalysts to functionalize traditionally unreactive C–H bonds. Given the high potential of these seemingly ideal strategic bond forming reactions, the uptake of C–H activation in fine chemical manufacture is slow. Part of the reason for this deficiency is limited mechanistic understanding of these complex reactions. This can preclude industrial applications of either batch or continuous C–H activation processes. Owing to the synthetic utility of C–H activation reactions, it is highly desirable to design intensified processes for this family of transformations, what can possibly facilitate industrialisation of C–H activation reactions. Firstly, an ab initio process design of a novel C(sp3)–H activation reaction giving access to aziridines yielded a predictive mechanistic model that has been used in an in silico optimisation. The identified set of conditions was suitable for a scalable continuous process. A separation technique was developed, and the utility of the process was extended by a subsequent reaction, a nucleophilic ring opening. Secondly, a black-box optimisation of the investigated reaction was performed. The applied algorithm was able to identify a set of conditions fulfilling the set targets within few experimental trails. The second project has set out to design a process for a C–H oxidative carbonylation. A kinetic study has shown that the reaction is CO-starved even at elevated pressures and that there is an optimal CO concentration. The turn-over number was increased from 8 to nearly 500. Two scalable processes were then developed. The first was a batch process, characterised by a very low catalyst loading. The second was, to the best of author’s knowledge, the first continuous process for an oxidative carbonylation reaction. The continuous process was tested on several oxidative carbonylations yielding excellent results with virtually no optimisation performed. Finally, an environmental sustainability assessment was performed using both, simplified metrics and an LCI analysis. The developed mechanistic understanding allowed identification of sources of inherent inefficiencies of C–H activation reactions. Appropriate solutions to these obstacles were suggested. Thus, it is believed that a step towards generic principles of design of intensified, scalable processes for C–H activation-type reactions has been made.
3
Sheppard, Nicholas Paul. "Self-Reduction for Combinatorial Optimisation". Thesis, The University of Sydney, 2001. http://hdl.handle.net/2123/797.
Texto completo da fonteResumo:
This thesis presents and develops a theory of self-reduction. This process is used to map instances of combinatorial optimisation problems onto smaller, more easily solvable instances in such a way that a solution of the former can be readily re-constructed, without loss of information or quality, from a solution of the latter. Self-reduction rules are surveyed for the Graph Colouring Problem, the Maximum Clique Problem, the Steiner Problem in Graphs, the Bin Packing Problem and the Set Covering Problem. This thesis introduces the problem of determining the maximum sequence of self-reductions on a given structure, and shows how the theory of confluence can be adapted from term re-writing to solve this problem by identifying rule sets for which all maximal reduction sequences are equivalent. Such confluence results are given for a number of reduction rules on problems on discrete systems. In contrast, NP-hardness results are also presented for some reduction rules. A probabilistic analysis of self-reductions on graphs is performed, showing that the expected number of self-reductions on a graph tends to zero as the order of the graph tends to infinity. An empirical study is performed comparing the performance of self-reduction, graph decomposition and direct methods of solving the Graph Colouring and Set Covering Problems. The results show that self-reduction is a potentially valuable, but sometimes erratic, method of finding exact solutions to combinatorial problems.
4
Sheppard, Nicholas Paul. "Self-Reduction for Combinatorial Optimisation". University of Sydney. Computer Science, 2001. http://hdl.handle.net/2123/797.
Texto completo da fonteResumo:
This thesis presents and develops a theory of self-reduction. This process is used to map instances of combinatorial optimisation problems onto smaller, more easily solvable instances in such a way that a solution of the former can be readily re-constructed, without loss of information or quality, from a solution of the latter. Self-reduction rules are surveyed for the Graph Colouring Problem, the Maximum Clique Problem, the Steiner Problem in Graphs, the Bin Packing Problem and the Set Covering Problem. This thesis introduces the problem of determining the maximum sequence of self-reductions on a given structure, and shows how the theory of confluence can be adapted from term re-writing to solve this problem by identifying rule sets for which all maximal reduction sequences are equivalent. Such confluence results are given for a number of reduction rules on problems on discrete systems. In contrast, NP-hardness results are also presented for some reduction rules. A probabilistic analysis of self-reductions on graphs is performed, showing that the expected number of self-reductions on a graph tends to zero as the order of the graph tends to infinity. An empirical study is performed comparing the performance of self-reduction, graph decomposition and direct methods of solving the Graph Colouring and Set Covering Problems. The results show that self-reduction is a potentially valuable, but sometimes erratic, method of finding exact solutions to combinatorial problems.
5
Ounnas, Badreddine. "Étude et optimisations de jets photoniques pour des applications non conventionnelles dans les domaines optique et hyperfréquences". Thesis, Saint-Etienne, 2015. http://www.theses.fr/2015STET4009/document.
Texto completo da fonteResumo:
Le travail de cette thèse est consacré à l’étude et l’optimisation d’un cas particulier de la diffusion des ondes électromagnétiques. Elle porte plus particulièrement sur un phénomène appelé le « jet photonique ou jet électromagnétique (jet EM)». Il s’agit d’un faisceau de lumière étroit et concentré en champ proche avec des caractéristiques physiques remarquables. Dans ce travail, un guide d’onde terminé par un embout de forme particulière est utilisé pour générer le jet photonique. Cette thèse a pour objectif l’étude, la caractérisation expérimentale et l’optimisation de jets photoniques pour des applications dans le domaine optique et hyperfréquences. Une méthode robuste et rapide a été développée pour calculer le champ électromagnétique généré par un objet diélectrique ou en sortie d’un guide d'onde avec un embout de forme particulière. Elle est basée sur la Méthode d'Equation Intégrale aux Frontière (MEIF) qui utilise la seconde identité Green. La caractérisation expérimentale des jets photoniques a été réalisée dans le domaine micro-ondes à des fréquences autour de 30 GHz. La possibilité de générer un jet simple et double en utilisant un guide d’onde à embout a été montrée expérimentalement et théoriquement par la méthode MEIF. Les jets EM simples et doubles ont été utilisés pour la détection d’objets métalliques de taille plus petite que la longueur d’onde et l'imagerie en champ proche à travers des structures optiquement opaques. Une procédure d’optimisation basée sur le couplage entre la MEIF et les algorithmes génétiques a été mise au point afin de générer des jets photoniques avec des caractéristiques a priori bien définie. Des optimisations des jets photoniques générés par un objet diélectrique et en sortie d’un guide d’onde avec embout ont été effectuées pour la micro-gravure laser et l’imagerie HFThe work of this thesis is devoted to the study and optimization of a particular case of the scattering of electromagnetic waves. Particularly, it is about a phenomenon called the "photonic jet or electromagnetic jet (EM jet)". This is a narrow light beam concentrated in near-field with remarkable physical characteristics. In this work, a waveguide terminated by a tip with special form is used to generate the photonic jet. This thesis performs the electromagnetic modeling, the experimental characterization and the optimization of photonic jets for applications in optic and microwave field. A robust and fast method was developed to calculate the electromagnetic field generated by a dielectric object or by a waveguide terminated with a tip. It is based on the boundary integral equation method (BIEM) which uses the second Green identity. Experimental characterization of photonic jets was conducted in the microwave field around 30 GHz. The ability to generate a single and double EM jet using a tipped waveguide has been shown experimentally and theoretically by BEIM method. The single and double EM jets were used for the detection of metal objects with a size smaller than the wavelength and for imaging through opaque structures in near field. An optimization procedure based on the coupling between the BEIM and genetic algorithms has been developed to generate photonic jets with properties well defined. Optimizations of photonic jets generated by a dielectric object and by a tipped waveguide have been realized for laser micro-etching and RF imaging
6
Pénuchot, Jules. "Advanced techniques for high performance code generation". Electronic Thesis or Diss., université Paris-Saclay, 2024. http://www.theses.fr/2024UPASG050.
Texto completo da fonteResumo:
En réponse à la demande croissante de puissance de calcul,les constructeurs de matériel proposent de nouvelles architectures parallèles de très différentes natures, et ayant chacune leurs propres API et modèle de programmation.Cela rend les applications haute performance plus complexes à développer avec des méthodes de programmation traditionnelles, d'autant plus lorsque plusieurs architectures sont ciblées.En réponse à cette demande, des bibliothèques exploitant la génération de code à la compilation furent développées pour faciliter la programmation haute performance avec des abstractions de haut niveau tels que les langages dédiés externes. Dans cette thèse, nous explorons en premier temps les techniques de métaprogrammation existant à travers un large panel de langages, puis nous évaluons les techniques actuelles de métaprogrammation de templates C++dans le cadre de la génération de noyaux de calculs de type BLAS. Nous couvrons ensuite de nouvelles techniques de métaprogrammation basées sur l'exécution de code C++ à la compilation en implémentant des parsers pour deux langages: Brainfuck, et un langage appelé Tiny Math Language (TML). Le parser Brainfuck est fourni avec plusieurs backends de génération de code pour étudier différentes techniques de génération de code, tandis que TML est utilisé pour étudier la génération de code en utilisant des bibliothèques portables haute performance. Pour évaluer l'impact de ces diverses techniques de métaprogrammation,nous proposons une nouvelle méthodologie de benchmarking qui exploite le profiler intégré de Clang, ce qui permet l'analyse de performance en temps de compilation au-delà des mesures de performance en boîte noireAs a response to an increasing demand for computing performance,hardware manufacturers propose new parallel hardware architectures of very different nature, each with their own API and programming model.This makes high performance applications more complex to develop with traditional programming practices, especially when multiple architectures are targeted.As a response, libraries leveraging compile-time code generation were developed to facilitate portable high performance programming with high level abstractions such as Domain-Specific Embedded Languages (DSELs).In this thesis, we first explore existing metaprogramming practices acrossa wide variety of languages, then evaluate current C++ template metaprogrammingtechniques in the framework of BLAS-like kernel generation.We then cover new metaprogramming techniques based on compile-time C++ code execution by implementing compile-time parsers for two languages:Brainfuck, and a language called Tiny Math Language (TML).The Brainfuck parser is provided with several code generation backends to study and compare different code generation techniques, whereas TML is usedto study code generation using portable high performance computing libraries.In order to assess the compile-time impact of these various metaprogramming techniques, we propose a new benchmarking methodology that usesClang's built-in profiler, enabling compile-time performance scaling analysis beyond black-box benchmarking
Capítulos de livros sobre o assunto "Optmisation"
1
Flower, J. R., e J. Pardoe. "STRATEGIES FOR DESALINATION OPTMISATION". In Process Optimisation, 299–310. Elsevier, 1987. http://dx.doi.org/10.1016/b978-0-85295-205-4.50027-x.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Optmisation"
1
Sourkounis, Constantinos, e Bingchang Ni. "Drive Train Control for Wind Energy Converters Based on Stochastic Dynamic Optmisation". In IECON 2006 - 32nd Annual Conference on IEEE Industrial Electronics. IEEE, 2006. http://dx.doi.org/10.1109/iecon.2006.347373.
Texto completo da fonte
2
Rahman, M. I., D. Jovcic e K. H. Ahmed. "Reactive current optmisation for high power dual active bridge DC/DC converter". In 2013 IEEE Grenoble PowerTech. IEEE, 2013. http://dx.doi.org/10.1109/ptc.2013.6652335.
Texto completo da fonte
3
Ekkawong, Peerapong, Parichat Loboonlert, Krongpol Seusutthiya, Kongphop Wongpattananukul, Nuntanut Laoniyomthai, Jiraphas Thapchim, Rutchanok Nasomsong, Tepporn Satsue, Thanawat Charucharana e Kasidis Lhosupasirirat. "Algorithm-Assisted Platform Location Optmisation Using Mixed-Integer Programming for Cluster Development Strategy in the Gulf of Thailand". In SPE/IATMI Asia Pacific Oil & Gas Conference and Exhibition. SPE, 2021. http://dx.doi.org/10.2118/205765-ms.
Texto completo da fonteResumo:
Abstract The unique characteristic of gas fields in the Gulf of Thailand is the compartmentalized reservoir that requires a huge number of producing wells. The task of locating platform locations for whole field perspectives that also meet all operational criteria while minimizing the number of needed platforms is challenging. This decisional task has a critical impact on project viability, especially for marginal fields. This paper proposes an innovative solution to strengthen success in this business decision by integrating subsurface domain knowledge and optimization algorithms. This study presents an optimization algorithm for determining the optimal locations of wellhead platforms with limited numbers to maximize hydrocarbon resources. Firstly, the algorithm performs verification matching between wellhead locations and subsurface targets throughout the field under drilling criteria. Next, the optimal platform locations are optimized using mixed-integer linear programming (MILP) with the primary objective of maximizing hydrocarbon resources. The algorithm literally runs with an increment in number of platforms until there is no incremental hydrocarbon resources gain and additionally summarizes the results as the number of platforms vs. coverage resources. The algorithm has proven its viability by recommending more optimal platform locations in an actual field in the Gulf of Thailand. This algorithm-assisted workflow was able to reduce the number of required platforms. The main driver for this improved decision is that the MILP algorithm manage to improve well targeting and platform location selection under a large set of practical constraints. In contrast, manual workflow retains its limitations to consider them all. This optimization also reduces the working time required for the whole process of well targeting and platform selection. Formerly, a typical workflow takes months of equivalent man-days. Conversely, this algorithm succeeded in completing the operation within just a few hours. Further, the subsurface team saved time by eliminating some repetitive tasks, i.e., they could focus on reviewing results extracted from the optimizer. Moreover, this work demonstrated the capability to extend and scaleup to other fields with similar concepts, which ultimately could lead to more benefits. This innovative workflow translates the complicated subsurface procedure to a numerical optimization problem with a solid proven benefit from real field implementation. Apart from the positive business impact, this study shows that we can promote integration between modern data analytics and domain knowledge in oil and gas industry.