Готові списки джерел за темами / Objectifs de parité

Зміст

  1. Статті в журналах
  2. Дисертації
  3. Книги
  4. Частини книг
  5. Тези доповідей конференцій
  6. Звіти організацій

Добірка наукової літератури з теми "Objectifs de parité"

Автор: Grafiati
Опубліковано: 4 квітня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Objectifs de parité".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Objectifs de parité"

1

Haou, Abir, Kamel Miroud, and Djallel Eddine Gherissi. "Impact des caractéristiques du troupeau et des pratiques d’élevage sur les performances de reproduction des vaches laitières dans le Nord-Est algérien." Revue d’élevage et de médecine vétérinaire des pays tropicaux 74, no. 4 (December 13, 2021): 183–91. http://dx.doi.org/10.19182/remvt.36798.

Повний текст джерела
Анотація:
L’étude a porté sur les effets des caractéristiques du troupeau (race, taille, parité et zone d’étude) et des pratiques d’élevage (chaleurs induites/naturelles, pratique du flushing ou non, et durée du tarissement) sur les taux de fécondité et de fertilité de 721 vaches laitières (VL) des races Montbéliarde (n = 379) et Prim’Holstein (n = 342) réparties sur 23 troupeaux, nées et mises à la reproduction en Algérie. Les paramètres de fécondité ont révélé un intervalle entre le vêlage et les premières chaleurs de 86,8 ± 48 jours, entre le vêlage et la première insémination artificielle (IA) de 108 ± 80,4 jours, entre la première IA et l’IA fécondante de 42,9 ± 85,2 jours, entre le vêlage et l’insémination fécondante de 152 ± 116 jours, et entre vêlages de 427 ± 122,8 jours. Un taux de réussite moyen en première IA de 54,8 % (VL) et 38,8 ± 20 % (troupeau), un index de fertilité apparent de 1,83, et 19,3 % de VL inséminées trois fois et plus (dans 16,2 ± 11 des troupeaux) ont été enregistrés. La fécondité plus que la fertilité était loin des objectifs. La race n’a eu aucun effet significatif sur la fertilité (p > 0,05), mais les performances de reproduction ont varié significativement (p < 0,05) en fonction de la taille du troupeau, de la parité, de la région d’étude, des chaleurs induites ou naturelles, et de la pratique ou non du flushing. La fécondité était plus faible chez les animaux dont la durée du tarissement dépassait 60 jours (p < 0,05). Une mise à la reproduction tardive au-delà de 80 jours post-partum a été le paramètre qui a affecté le plus les performances de reproduction des VL dans la zone d’étude.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Ivensky, Victoria, Romain Mandel, Annie-Claude Boulay, Christian Lavallée, Janie Benoît, and Annie-Claude Labbé. "Dépistage prénatal sous-optimal des infections à Chlamydia trachomatis et Neisseria gonorrhoeae dans un centre des naissances et de soins tertiaires de Montréal : une étude de cohorte rétrospective." Relevé des maladies transmissibles au Canada 47, no. 04 (May 7, 2021): 228–35. http://dx.doi.org/10.14745/ccdr.v47i04a05f.

Повний текст джерела
Анотація:
Contexte : La Société canadienne de pédiatrie ne recommande plus la prophylaxie oculaire universelle avec l’onguent d’érythromycine pour prévenir la conjonctivite néonatale. Le dépistage des infections à Chlamydia trachomatis et à Neisseria gonorrhoeae chez toutes les femmes enceintes est considéré comme le moyen le plus efficace de prévenir la transmission verticale et la conjonctivite néonatale. Objectif : Les objectifs de l’étude étaient d’évaluer les taux de dépistage prénatal des infections à C. trachomatis et à N. gonorrhoeae et de comparer les facteurs sociodémographiques entre les personnes ayant fait l’objet d’un dépistage et celles n’ayant pas fait l’objet d’un dépistage. Méthodes : La liste des femmes ayant accouché dans une maternité tertiaire de Montréal au Québec, entre avril 2015 et mars 2016, a été croisée avec la liste des résultats de dépistage. Les dossiers médicaux des mères ont été révisés pour les variables démographiques, prénatales et diagnostiques. Résultats : Sur 2 688 mères, 2 245 ont fait l’objet d’un dépistage au moins une fois, mais seulement 2 206 femmes avaient au moins un résultat valide pour C. trachomatis et N. gonorrhoeae le jour de l’accouchement (82,1 %, IC 95 % : 80,6 %–83,5 %). Une infection a été détectée chez 46 sur 2 206 femmes dépistées (2,1 %) : 42 présentaient une infection à C. trachomatis, deux avaient une infection à N. gonorrhoeae et deux étaient co-infectées. L’infection à C. trachomatis était plus fréquente chez les femmes de moins de 25 ans (9,8 %, IC 95 % : 6,7 %–13,8 %) que chez les femmes plus âgées (0,8 %, IC 95 % : 0,4 %–1,3 %, p < 0,001). Chaque augmentation de la parité diminuait la probabilité d’être testé (rapport de cote ajusté = 0,89, IC 95 % : 0,80 %–0,97 %, p = 0,01). Parmi celles dont le résultat initial était négatif, 35 sur 267 (13,1 %, IC 95 % : 9,3 %–17,8 %) femmes de moins de 25 ans et 122 sur 1 863 (6,6 %, IC 95 % : 5,5 %–7,8 %, p < 0,001) femmes âgées ont été retestées. Une infection subséquente a été détectée chez 4 femmes sur 35 (11 %), toutes dans le groupe des moins de 25 ans. Conclusion : Le taux sous-optimal de dépistage de C. trachomatis et N. gonorrhoeae suggère qu’actuellement, la prophylaxie oculaire universelle ne peut être abandonnée. La répétition du dépistage universel devrait être envisagée, en particulier chez les femmes de moins de 25 ans.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Červeňanská, Zuzana, Janette Kotianová, Pavel Važan, Bohuslava Juhásová, and Martin Juhás. "Multi-Objective Optimization of Production Objectives Based on Surrogate Model." Applied Sciences 10, no. 21 (November 6, 2020): 7870. http://dx.doi.org/10.3390/app10217870.

Повний текст джерела
Анотація:
The article addresses an approximate solution to the multi-objective optimization problem for a black-box function of a manufacturing system. We employ the surrogate of the discrete-event simulation model of a batch production system in an analytical form. Integration of simulation, Design of Experiments methods, and Weighted Sum and Weighted Product multi-objective methods are used in an arrangement of a priori defined preferences to find a solution near the Pareto optimal solution in a criterion space. We compare the results obtained through the analytical approach to the outcomes of simulation-based optimization. The observed results indicate a possibility to apply the suitable analytical model for quickly finding the acceptable approximate solution close to the Pareto optimal front.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Liu, Qi, Jiahao Liu, and Dunhu Liu. "Intelligent Multi-Objective Public Charging Station Location with Sustainable Objectives." Sustainability 10, no. 10 (October 18, 2018): 3760. http://dx.doi.org/10.3390/su10103760.

Повний текст джерела
Анотація:
This paper investigates a multi-objective charging station location model with the consideration of the triple bottom line principle for green and sustainable development from economic, environmental and social perspectives. An intelligent multi-objective optimization approach is developed to handle this problem by integrating an improved multi-objective particle swarm optimization (MOPSO) process and an entropy weight method-based evaluation process. The MOPSO process is utilized to obtain a set of Pareto optimal solutions, and the entropy weight method-based evaluation process is utilized to select the final solution from Pareto optimal solutions. Numerical experiments are conducted based on large-scale GPS data. Experimental results demonstrate that the proposed approach can effectively solve the problem investigated. Moreover, the comparison of single-objective and multi-objective models validates the efficiency and necessity of the proposed multi-objective model in public charging station location problems.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Li, Yifan, Hai-Lin Liu, and E. D. Goodman. "Hyperplane-Approximation-Based Method for Many-Objective Optimization Problems with Redundant Objectives." Evolutionary Computation 27, no. 2 (June 2019): 313–44. http://dx.doi.org/10.1162/evco_a_00223.

Повний текст джерела
Анотація:
For a many-objective optimization problem with redundant objectives, we propose two novel objective reduction algorithms for linearly and, nonlinearly degenerate Pareto fronts. They are called LHA and NLHA respectively. The main idea of the proposed algorithms is to use a hyperplane with non-negative sparse coefficients to roughly approximate the structure of the PF. This approach is quite different from the previous objective reduction algorithms that are based on correlation or dominance structure. Especially in NLHA, in order to reduce the approximation error, we transform a nonlinearly degenerate Pareto front into a nearly linearly degenerate Pareto front via a power transformation. In addition, an objective reduction framework integrating a magnitude adjustment mechanism and a performance metric [Formula: see text] are also proposed here. Finally, to demonstrate the performance of the proposed algorithms, comparative experiments are done with two correlation-based algorithms, LPCA and NLMVUPCA, and with two dominance-structure-based algorithms, PCSEA and greedy [Formula: see text]MOSS, on three benchmark problems: DTLZ5(I,M), MAOP(I,M), and WFG3(I,M). Experimental results show that the proposed algorithms are more effective.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Doerr, Benjamin, and Weijie Zheng. "Theoretical Analyses of Multi-Objective Evolutionary Algorithms on Multi-Modal Objectives." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 14 (May 18, 2021): 12293–301. http://dx.doi.org/10.1609/aaai.v35i14.17459.

Повний текст джерела
Анотація:
Previous theory work on multi-objective evolutionary algorithms considers mostly easy problems that are composed of unimodal objectives. This paper takes a first step towards a deeper understanding of how evolutionary algorithms solve multi-modal multi-objective problems. We propose the OneJumpZeroJump problem, a bi-objective problem whose single objectives are isomorphic to the classic jump functions benchmark. We prove that the simple evolutionary multi-objective optimizer (SEMO) cannot compute the full Pareto front. In contrast, for all problem sizes n and all jump sizes k in [4..n/2-1], the global SEMO (GSEMO) covers the Pareto front in Θ((n-2k)n^k) iterations in expectation. To improve the performance, we combine the GSEMO with two approaches, a heavy-tailed mutation operator and a stagnation detection strategy, that showed advantages in single-objective multi-modal problems. Runtime improvements of asymptotic order at least k^Ω(k) are shown for both strategies. Our experiments verify the substantial runtime gains already for moderate problem sizes. Overall, these results show that the ideas recently developed for single-objective evolutionary algorithms can be effectively employed also in multi-objective optimization.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Daly, Rich. "Parity Compromise Overcomes Most DB Objections." Psychiatric News 43, no. 19 (October 3, 2008): 16. http://dx.doi.org/10.1176/pn.43.19.0016.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Gong, Dunwei, Yiping Liu, and Gary G. Yen. "A Meta-Objective Approach for Many-Objective Evolutionary Optimization." Evolutionary Computation 28, no. 1 (March 2020): 1–25. http://dx.doi.org/10.1162/evco_a_00243.

Повний текст джерела
Анотація:
Pareto-based multi-objective evolutionary algorithms experience grand challenges in solving many-objective optimization problems due to their inability to maintain both convergence and diversity in a high-dimensional objective space. Exiting approaches usually modify the selection criteria to overcome this issue. Different from them, we propose a novel meta-objective (MeO) approach that transforms the many-objective optimization problems in which the new optimization problems become easier to solve by the Pareto-based algorithms. MeO converts a given many-objective optimization problem into a new one, which has the same Pareto optimal solutions and the number of objectives with the original one. Each meta-objective in the new problem consists of two components which measure the convergence and diversity performances of a solution, respectively. Since MeO only converts the problem formulation, it can be readily incorporated within any multi-objective evolutionary algorithms, including those non-Pareto-based ones. Particularly, it can boost the Pareto-based algorithms' ability to solve many-objective optimization problems. Due to separately evaluating the convergence and diversity performances of a solution, the traditional density-based selection criteria, for example, crowding distance, will no longer mistake a solution with poor convergence performance for a solution with low density value. By penalizing a solution in term of its convergence performance in the meta-objective space, the Pareto dominance becomes much more effective for a many-objective optimization problem. Comparative study validates the competitive performance of the proposed meta-objective approach in solving many-objective optimization problems.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Zhang, Han, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, and Sven Koenig. "Anytime Approximate Bi-Objective Search." Proceedings of the International Symposium on Combinatorial Search 15, no. 1 (July 17, 2022): 199–207. http://dx.doi.org/10.1609/socs.v15i1.21768.

Повний текст джерела
Анотація:
The Pareto-optimal frontier for a bi-objective search problem instance consists of all solutions that are not worse than any other solution in both objectives. The size of the Pareto-optimal frontier can be exponential in the size of the input graph, and hence finding it can be hard. Some existing works leverage a user-specified approximation factor epsilon to compute an approximate Pareto-optimal frontier that can be significantly smaller than the Pareto-optimal frontier. In this paper, we propose an anytime approximate bi-objective search algorithm, called Anytime Bi-Objective A*-epsilon (A-BOA*). A-BOA* is useful when deliberation time is limited. It first finds an approximate Pareto-optimal frontier quickly, iteratively improves it while time allows, and eventually finds the Pareto-optimal frontier. It efficiently reuses the search effort from previous iterations and makes use of a novel pruning technique. Our experimental results show that A-BOA* substantially outperforms baseline algorithms that do not reuse previous search effort, both in terms of runtime and number of node expansions. In fact, the most advanced variant of A-BOA* even slightly outperforms BOA*, a state-of-the-art bi-objective search algorithm, for finding the Pareto-optimal frontier. Moreover, given only a limited amount of deliberation time, A-BOA* finds solutions that collectively approximate the Pareto-optimal frontier much better than the solutions found by BOA*.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Daumas-Ladouce, Federico, Miguel García-Torres, José Luis Vázquez Noguera, Diego P. Pinto-Roa, and Horacio Legal-Ayala. "Multi-Objective Pareto Histogram Equalization." Electronic Notes in Theoretical Computer Science 349 (June 2020): 3–23. http://dx.doi.org/10.1016/j.entcs.2020.02.010.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Дисертації з теми "Objectifs de parité"

1

Sérée, Bastien. "Problèmes d'optimisation des les graphes paramétrés." Electronic Thesis or Diss., Ecole centrale de Nantes, 2022. http://www.theses.fr/2022ECDN0066.

Повний текст джерела
Анотація:
Nous considérons des graphes orientés pondérés dont l’énergie est paramétrée. Nous proposons dans un premier temps un algorithme qui, étant donné un graphe et un de ses sommets, renvoie des arbres, chaque arbre représentant les plus courtschemins depuis la source vers tous les autres sommets du graphe pour une zone particulière de l’espace des paramètres. De plus l’union de ces zones couvre l’espace des paramètres. Nous considérons ensuite l’accessibilité dans les graphes à énergie multidimensionnelle, avec un type de contraintes plus absolues qui imposent que l’énergie reste entre des bornes. Nous montrons la décidabilité et la complexité du problème quel que soit le nombre de paramètres et de dimensions lorsque les paramètres prennent des valeurs entières. Nous montrons également l’indécidabilité de ce problème avec au moins un paramètre lorsque la dimension est supérieure ou égale à deux. Nous étudions enfin des jeux de parité à un et deux joueurs sur les graphes paramétrés dont l’objectif est la conjonction d’une condition qualitative sur la parité et d’une condition quantitative : l’énergiedoit rester positive. Nous montrons la décidabilité et prouvons des bornes de la complexité du problème de la recherche d’une stratégie gagnante dans les cas à un et à deux joueurs
We are considering weighted oriented graphs with parametrized energy. Firstly we propose an algorithm that, given a graph and one of its vertices, returns trees, every tree representing shortest-paths from the source to every other vertex for a particular zone of the parameter space. Moreover, union of these zones is a covering of the parameter space. Then we consider reachability in graphs with multi-dimensional energy, with stricter constraints that enforce the energy to stay between bounds. We prove decidabilty and complexity of this problem regardless of the dimension and the number of parameters when parameters take integer values. We alsoprove the undecidability of this problem when there is at least one parameter and the dimension is at least two. Finally we study paritygames on parametrized graphs with one and two players whose objective is the conjunction of a qualitative condition on the parity andquantitative one : energy must stay positive. We show the decidability and prove bounds on the complexity of the problem of searchinga winning strategy in both cases with one and two players
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Ismaïli, Anisse. "Algorithms for Nash-equilibria in Agent Networks and for Pareto-efficiency in State Space Search : Generalizations to Pareto-Nash in Multiple Objective Games." Thesis, Paris 6, 2016. http://www.theses.fr/2016PA066148.

Повний текст джерела
Анотація:
Un agent est un élément qui décide une action. Par ce formalisme très général on peut aussi bien désigner deux enfants jouant à pierre-papier-ciseaux, des êtres humains choisissant des produits sur un marché, un logiciel de routage calculant un plus court chemin sur Internet pour transporter des informations sur des routes numériques encombrées, qu’une enchère combinatoire automatique pour vendre des liens commerciaux et rapportant des milliards à google. Les chercheurs en théorie de la décision algorithmique et en théorie des jeux algorithmique – des mathématiciens et informaticiens – aiment à penser que ces exemples concrets peuvent être modélisés au moyen de systèmes décisionnels rationnels, aussi complexe la réalité soit-elle. Les systèmes décisionnels modernes trouvent leur complexité dans plusieurs dimensions. D’une part, les préférences d’un agent peuvent être complexes à représenter avec de simples nombres réels, alors que de multiples objectifs conflictuels interviennent dans chaque décision. D’une autre part, les interactions entre agents font que les récompenses de chacun dépendent des actions de tous, rendant difficile la prédiction des actions individualistes résultantes. L’objet de cette thèse en théorie algorithmique des systèmes décisionnels interactifs (jeux) est de poursuivre des efforts de recherche menés sur ces deux sources de complexité, et in fine, de considérer les deux complexités dans un même modèle
An agent is an entity that decides an action. By using this abstraction, it is possible to model two children playing rock-paper-scissors, a software computing a shortest path on the internet for packet-routing on congest numerical networks, as well as an automatic combinatorial auction that sells commercial links in order to make google earn billions. The researchers in algorithmic decision theory and algorithmic game theory (mathematicians and computer scientists) like to think that these real-life examples can be modelled by mean of agents in an interaction decision system, no matter how complex is reality. The modern interactive decision systems find their complexity in multiple aspects. Firstly, the preferences of an agent can be complex to model with real numbers when there are multiple conflicting objectives resulting from every decision. Secondly, the interactions between agents are such that the payoff of every individual depends of the actions of all, making difficult the prediction of the resulting action-profile. This thesis aims at pursuing research efforts lead on these two sources of complexity, in order to consider ultimately both aspects in the same model
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Rohling, Gregory Allen. "Multiple Objective Evolutionary Algorithms for Independent, Computationally Expensive Objectives." Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/4835.

Повний текст джерела
Анотація:
This research augments current Multiple Objective Evolutionary Algorithms with methods that dramatically reduce the time required to evolve toward a region of interest in objective space. Multiple Objective Evolutionary Algorithms (MOEAs) are superior to other optimization techniques when the search space is of high dimension and contains many local minima and maxima. Likewise, MOEAs are most interesting when applied to non-intuitive complex systems. But, these systems are often computationally expensive to calculate. When these systems require independent computations to evaluate each objective, the computational expense grows with each additional objective. This method has developed methods that reduces the time required for evolution by reducing the number of objective evaluations, while still evolving solutions that are Pareto optimal. To date, all other Multiple Objective Evolutionary Algorithms (MOEAs) require the evaluation of all objectives before a fitness value can be assigned to an individual. The original contributions of this thesis are: 1. Development of a hierarchical search space description that allows association of crossover and mutation settings with elements of the genotypic description. 2. Development of a method for parallel evaluation of individuals that removes the need for delays for synchronization. 3. Dynamical evolution of thresholds for objectives to allow partial evaluation of objectives for individuals. 4. Dynamic objective orderings to minimize the time required for unnecessary objective evaluations. 5. Application of MOEAs to the computationally expensive flare pattern design domain. 6. Application of MOEAs to the optimization of fielded missile warning receiver algorithms. 7. Development of a new method of using MOEAs for automatic design of pattern recognition systems.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Teo, Jason T. W. Information Technology &amp Electrical Engineering Australian Defence Force Academy UNSW. "Pareto multi-objective evolution of legged embodied organisms." Awarded by:University of New South Wales - Australian Defence Force Academy. School of Information Technology and Electrical Engineering, 2003. http://handle.unsw.edu.au/1959.4/38682.

Повний текст джерела
Анотація:
The automatic synthesis of embodied creatures through artificial evolution has become a key area of research in robotics, artificial life and the cognitive sciences. However, the research has mainly focused on genetic encodings and fitness functions. Considerably less has been said about the role of controllers and how they affect the evolution of morphologies and behaviors in artificial creatures. Furthermore, the evolutionary algorithms used to evolve the controllers and morphologies are pre-dominantly based on a single objective or a weighted combination of multiple objectives, and a large majority of the behaviors evolved are for wheeled or abstract artifacts. In this thesis, we present a systematic study of evolving artificial neural network (ANN) controllers for the legged locomotion of embodied organisms. A virtual but physically accurate world is used to simulate the evolution of locomotion behavior in a quadruped creature. An algorithm using a self-adaptive Pareto multi-objective evolutionary optimization approach is developed. The experiments are designed to address five research aims investigating: (1) the search space characteristics associated with four classes of ANNs with different connectivity types, (2) the effect of selection pressure from a self-adaptive Pareto approach on the nature of the locomotion behavior and capacity (VC-dimension) of the ANN controller generated, (3) the effciency of the proposed approach against more conventional methods of evolutionary optimization in terms of computational cost and quality of solutions, (4) a multi-objective approach towards the comparison of evolved creature complexities, (5) the impact of relaxing certain morphological constraints on evolving locomotion controllers. The results showed that: (1) the search space is highly heterogeneous with both rugged and smooth landscape regions, (2) pure reactive controllers not requiring any hidden layer transformations were able to produce sufficiently good legged locomotion, (3) the proposed approach yielded competitive locomotion controllers while requiring significantly less computational cost, (4) multi-objectivity provided a practical and mathematically-founded methodology for comparing the complexities of evolved creatures, (5) co-evolution of morphology and mind produced significantly different creature designs that were able to generate similarly good locomotion behaviors. These findings attest that a Pareto multi-objective paradigm can spawn highly beneficial robotics and virtual reality applications.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Ribeiro, Marco Tulio Correia. "Multi-objective pareto-efficient algorithms for recommender systems." Universidade Federal de Minas Gerais, 2013. http://hdl.handle.net/1843/ESSA-9CHG5H.

Повний текст джерела
Анотація:
Recommender systems are quickly becoming ubiquitous in applications such as ecommerce, social media channels and content providers, acting as enabling mechanisms designed to overcome the information overload problem by improving browsing and consumption experience. A typical task in recommender systems is to output a ranked list of items, so that items placed higher in the rank are more likely to be interesting to the users. Interestingness measures include how accurate, novel and diverse the suggested items are, and the objective is usually to produce ranked lists optimizing one of these measures. Suggesting items that are simultaneously accurate, novel and diverse is much more challenging, since this may lead to a conflicting-objective problem, in which the attempt to improve a measure further may result in worsening other measures. In this thesis we propose new approaches for multi-objective recommender systems based on the concept of Pareto-efficiency -- a state achieved when the system is devised in the most efficient manner in the sense that there is no way to improve one of the objectives without making any other objective worse off. Given that existing recommendation algorithms differ in their level of accuracy, diversity and novelty, we exploit the Pareto-efficiency concept in two distinct manners: (i) the aggregation of ranked lists produced by existing algorithms into a single one, which we call Paretoefficient ranking, and (ii) the weighted combination of existing algorithms resulting in a hybrid one, which we call Pareto-efficient hybridization. Our evaluation involves two real application scenarios: music recommendation with implicit feedback (i.e., Last.fm) and movie recommendation with explicit feedback (i.e., MovieLens). We show that the proposed approaches are effective in optimizing each of the metrics without hurting the others, or optimizing all three simultaneously. Further, for the Pareto-efficient hybridization, we allow for adjusting the compromise between the metrics, so that the recommendation emphasis can be set dinamically according to the needs of different users.
Sistemas de recomendação tem se tornado cada vez mais populares em aplicações como e-commerce, mídias sociais e provedores de conteúdo. Esses sistemas agem como mecanismos para lidar com o problema da sobrecarga de informação. Uma tarefa comum em sistemas de recomendação é a de ordenar um conjunto de itens, de forma que os itens no topo da lista sejam de interesse para os usuários. O conceito de interesse pode ser medido observando a acurácia, novidade e diversidade dos itens sugeridos. Geralmente, o objetivo de um sistema de recomendação é gerar listas ordenadas de forma a otimizar uma dessas métricas. Um problema mais difícil é tentar otimizar as três métricas (ou objetivos) simultaneamente, o que pode levar ao caso onde a tentativa de melhorar em uma das métricas pode piorar o resultado nas outras métricas. Neste trabalho, propomos novas abordagens para sistemas de recomendaççao multi-objetivo, baseadas no conceito de Eficiência de Pareto -- um estado obtido quando o sistema é de tal forma que não há como melhorar em algum objetivo sem piorar em outro objetivo. Dado que os algoritmos de recomendação existentes diferem em termos de acurácia, diversidade e novidade, exploramos o conceito de Eficiência de Pareto de duas formas distintas: (i) agregando listas ordenadas produzidas por algoritmos existentes de forma a obter uma lista única - abordagem que chamamos de ranking Pareto-eficiente, e (ii), a combinação linear ponderada de algoritmos existentes, resultado em um híbrido, abordagem que chamamos de hibridização Pareto-eficiente. Nossa avaliação envolve duas aplicações reais: recomendação de música com feedback implícito (i.e., Last.fm) e recomendação de filmes com feedback explícito (i.e., Movielens). Nós mostramos que as abordagens Pareto-eficientes são efetivas em recomendar items com bons niveis de acurácia, novidade e diversidade (simultaneamente), ou uma das métricas sem piorar as outras. Além disso, para a hibridização Pareto-eficiente, provemos uma forma de ajustar o compromisso entre acurácia, novidade e diversidade, de forma que a ênfase da recomendação possa ser ajustada dinamicamente para usuários diferentes.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Nordström, Peter. "Multi-objective optimization and Pareto navigation for voyage planning." Thesis, Uppsala universitet, Avdelningen för systemteknik, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-220338.

Повний текст джерела
Анотація:
The shipping industry is very large and ships require a substantial amount of fuel. However, fuel consumption is not the only concern. Time of arrival, safety concerns, distance travelled etc. are also of importance and these objectives might be inherently conflicting. This thesis aims to demonstrate multi-objective optimization and Pareto navigation for application in voyage planning. In order to perform this optimization, models of weather, ocean conditions, ship dynamics and propulsion system are needed. Statistical methods for estimation of resistance experienced in calm and rough sea are used. An earlier developed framework is adopted to perform the optimization and Pareto navigation. The results show that it is a suitable approach in voyage planning. A strength of the interactive Pareto navigation is the overview of the solution space presented to the decision maker and the control of the spread of the objective space. Another benefit is the possibilities of assigning specific values on objectives and setting thresholds in order to narrow down the solution space. The numerical results reinforces the trend of slow steaming to decrease fuel consumption.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Zeng, Rong-Qiang. "Métaheuristiques multi-objectif basées sur des voisinages pour l'approximation d'ensembles de pareto." Angers, 2012. http://www.theses.fr/2012ANGE0054.

Повний текст джерела
Анотація:
L'intérêt porté sur l'optimisation multi-objectif n'a cessé de croitre ces vingt dernières années. L'objectif est de trouver l'ensemble des solutions Pareto, qui correspondent aux meilleurs compromis possibles sur un ensemble d'objectifs que l'on cherche à optimiser. En général, il n'est pas possible de calculer cet ensemble de manière exacte, c'est pourquoi de nombreuses méthodes heuristiques multi-objectif ont été proposées afin de trouver des approximations de cet ensemble. Cette thèse s'intéresse au développement de métaheuristiques pour l'optimisation multi-objectif de problèmes difficiles. Pour résoudre ces problèmes multi-objectif, nous proposons dans un premier l'algorithme HBMOLS, qui est une recherche locale multi-objectif itérée, où la qualité des solutions évaluée est calculée en fonction du reste de la population, selon un indicateur de qualité que nous définissons. Cet indicateur de qualité permet d'établir l'opérateur de sélection de notre algorithme. Ensuite, nous nous intéressons aux méthodes de path-relinking, et de leur intégration dans l'algorithme de recherche locale itérée proposée antérieurement. Nous proposons différentes versions de l'algorithme MOPR, que nous intégrons dans HBMOLS. Enfin, ces versions sont évaluées et comparées sur les deux problèmes cités précèdemment. Afin d'évaluer la qualité de nos approches, nous nous proposons de les évaluer sur deux problèmes multi-objectif difficiles et différents : un problème d'ordonnancement de type flow-shop et un problème d'assignement quadratique
Multi-objective optimization has received more and more attention in the late twenty years. The aim is to generate a Pareto optimal set, which keeps the best compromise among all the objectives. Since it is not possible to compute the Pareto optimal set in a reasonable time in most cases, many multi-objective metaheuristics have been established to approximate the Pareto optimal set. This thesis is devoted to developing metaheuristics to tackle multi-objective optimization problems in general. In order to solve these multi-objective optimization problems, we propose the Hypervolume-Based Multi-Objective Local Search algorithm (HBMOLS). This algorithm uses a hypervolume contribution indicator as the selection measure to compare and select solutions during the search process. Afterwards, we integrate path relinking techniques into the HBMOLS algorithm as a function which initializes new populations for HBMOLS. Then, we present and evaluate different versions of multi-objective hybrid path linking algorithm. To evaluate the efficiency and the generality of our approaches, we carry out experiments on a multi-objective flow shop problem and a multi-objective quadratic assignment problem
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Zhong, Hongliang. "Bandit feedback in Classification and Multi-objective Optimization." Thesis, Ecole centrale de Marseille, 2016. http://www.theses.fr/2016ECDM0004/document.

Повний текст джерела
Анотація:
Des problèmes de Bandit constituent une séquence d’allocation dynamique. D’une part, l’agent de système doit explorer son environnement ( à savoir des bras de machine) pour recueillir des informations; d’autre part, il doit exploiter les informations collectées pour augmenter la récompense. Comment d’équilibrer adéquatement la phase d’exploration et la phase d’exploitation, c’est une obscurité des problèmes de Bandit, et la plupart des chercheurs se concentrent des efforts sur les stratégies d’équilibration entre l’exploration et l’exploitation. Dans cette dissertation, nous nous concentrons sur l’étude de deux problèmes spécifiques de Bandit: les problèmes de Bandit contextuel et les problèmes de Bandit Multi- objectives. Cette dissertation propose deux aspects de contributions. La première concerne la classification sous la surveillance partielle, laquelle nous codons comme le problème de Bandit contextuel avec des informations partielles. Ce type des problèmes est abondamment étudié par des chercheurs, en appliquant aux réseaux sociaux ou systèmes de recommandation. Nous proposons une série d’algorithmes sur la base d’algorithme Passive-Aggressive pour résoudre des problèmes de Bandit contextuel. Nous profitons de sa fondations, et montrons que nos algorithmes sont plus simples à mettre en œuvre que les algorithmes en état de l’art. Ils réalisent des biens performances de classification. Pour des problèmes de Bandit Multi-objective (MOMAB), nous proposons une méthode motivée efficace et théoriquement à identifier le front de Pareto entre des bras. En particulier, nous montrons que nous pouvons trouver tous les éléments du front de Pareto avec un budget minimal dans le cadre de PAC borne
Bandit problems constitute a sequential dynamic allocation problem. The pulling agent has to explore its environment (i.e. the arms) to gather information on the one hand, and it has to exploit the collected clues to increase its rewards on the other hand. How to adequately balance the exploration phase and the exploitation phase is the crux of bandit problems and most of the efforts devoted by the research community from this fields has focused on finding the right exploitation/exploration tradeoff. In this dissertation, we focus on investigating two specific bandit problems: the contextual bandit problems and the multi-objective bandit problems. This dissertation provides two contributions. The first contribution is about the classification under partial supervision, which we encode as a contextual bandit problem with side informa- tion. This kind of problem is heavily studied by researchers working on social networks and recommendation systems. We provide a series of algorithms to solve the Bandit feedback problem that pertain to the Passive-Aggressive family of algorithms. We take advantage of its grounded foundations and we are able to show that our algorithms are much simpler to implement than state-of-the-art algorithms for bandit with partial feedback, and they yet achieve better perfor- mances of classification. For multi-objective multi-armed bandit problem (MOMAB), we propose an effective and theoretically motivated method to identify the Pareto front of arms. We in particular show that we can find all elements of the Pareto front with a minimal budget
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Cvetkovic, Dragan. "Evolutionary multi-objective decision support systems for conceptual design." Thesis, University of Plymouth, 2000. http://hdl.handle.net/10026.1/2328.

Повний текст джерела
Анотація:
In this thesis the problem of conceptual engineering design and the possible use of adaptive search techniques and other machine based methods therein are explored. For the multi-objective optimisation (MOO) within conceptual design problem, genetic algorithms (GA) adapted to MOO are used and various techniques explored: weighted sums, lexicographic order, Pareto method with and without ranking, VEGA-like approaches etc. Large number of runs are performed for findingZ Dth e optimal configuration and setting of the GA parameters. A novel method, weighted Pareto method is introduced and applied to a real-world optimisation problem. Decision support methods within conceptual engineering design framework are discussed and a new preference method developed. The preference method for translating vague qualitative categories (such as "more important 91 , 4m.9u ch less important' 'etc. ) into quantitative values (numbers) is based on fuzzy preferences and graph theory methods. Several applications of preferences are presented and discussed: * in weighted sum based optimisation methods; s in weighted Pareto method; * for ordering and manipulating constraints and scenarios; e for a co-evolutionary, distributive GA-based MOO method; The issue of complexity and sensitivity is addressed as well as potential generalisations of presented preference methods. Interactive dynamical constraints in the form of design scenarios are introduced. These are based on a propositional logic and a fairly rich mathematical language. They can be added, deleted and modified on-line during the design session without need for recompiling the code. The use of machine-based agents in conceptual design process is investigated. They are classified into several different categories (e. g. interface agents, search agents, information agents). Several different categories of agents performing various specialised task are developed (mostly dealing with preferences, but also some filtering ones). They are integrated with the conceptual engineering design system to form a closed loop system that includes both computer and designer. All thesed ifferent aspectso f conceptuale ngineeringd esigna re applied within Plymouth Engineering Design Centre / British Aerospace conceptual airframe design project.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Hartley, A. C. "The theory of parity non-conservation in atoms." Thesis, University of Oxford, 1989. https://ora.ox.ac.uk/objects/uuid:24d852a0-0f6f-4fea-8b41-db6a0b02b7c4.

Повний текст джерела
Анотація:
In this thesis we are concerned with calculating the parity non-conserving (PNC) E1 transition matrix elements for the caesium 6s1⁄2 → 7s1⁄2 transition and the thallium 6p1⁄2 → 7p1⁄2 and 6p1⁄2 → 6p3⁄2 transitions using the Equations of Motion (EOM) formalism. We add the weak interaction Hamiltonian to derive the PNC EOM. Taking a subset of the EOM terms gives the Random Phase Approximation equations and their PNC counterpart. Solving these, we obtain good agreement with similar calculations by other groups. In order to estimate correlation effects we use a parameterised semi-empirical potential which is adjusted to give the best fit with experimental data for the valence and excited state energy levels. Including the potential in the EOM and PNC EOM gives us very accurate values for the parity conserving transitions. For the PNC transitions we obtain

Caesium6s1⁄2 → 7s1⁄20.895(1±0.03) × 10-11 (-iea0QW/N)
Thallium6p1⁄2 → 7p1⁄2-7.85(1±0.05) × 10-11 (-iea0QW/N)
Thallium6p1⁄2 → 6p3⁄2-28.4(1±0.07) × 10-11 (-iea0QW/N)

These are in very good agreement with the most extensive Many-Body Perturbation Theory calculations performed. Using our value for the caesium transition matrix element and the latest experimental results gives a value of QW = ~ 71.8 ± 1.8 ± 2.1 where the first error is experimental and the second is theoretical. This corresponds to a value of the standard model sin2ΘW = 0.230 ± 0.009 which is to be compared with the current world average value of 0.230 ± 0.005. We investigate the single particle EOM terms that were not included in the above calculation and find that they are concerned with the Exclusion Principle violating terms that are implicitly included in an RPA calculation. Other terms represent the valence contribution to certain two particle effects. Since the main two particle terms have not been included however, these correction terms do not lead to a significant increase in the accuracy of the calculation.

Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Книги з теми "Objectifs de parité"

1

Morvan, Frédéric. Objectif Louvre: Le guide des visites en famille. Arles (Bouches-du-Rhône): Actes Sud junior, 2007.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

1968-, Sly Jonathan, ed. Objective Louvre: The guide to family visits. Arles: Actes Sud junior, 2011.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Les trésors du lettré: Objets de la chine impériale. [Paris, France]: Réunion des musées nationaux, 1993.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Han feng: Zhongguo Han dai wen wu zhan. Beijing: Ke xue chu ban she, 2014.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Snickare, Mårten. Colonial Objects in Early Modern Sweden and Beyond. Nieuwe Prinsengracht 89 1018 VR Amsterdam Nederland: Amsterdam University Press, 2022. http://dx.doi.org/10.5117/9789463728065.

Повний текст джерела
Анотація:
An elaborately crafted and decorated tomahawk from somewhere along the north American east coast: how did it end up in the royal collections in Stockholm in the late seventeenth century? What does it say about the Swedish kingdom’s colonial ambitions and desires? What questions does it raise from its present place in a display cabinet in the Museum of Ethnography in Stockholm? This book is about the tomahawk and other objects like it, acquired in colonial contact zones and displayed by Swedish elites in the seventeenth century. Its first part situates the objects in two distinct but related spaces: the expanding space of the colonial world, and the exclusive space of the Kunstkammer. The second part traces the objects’ physical and epistemological transfer from the Kunstkammer to the modern museum system. In the final part, colonial objects are considered at the centre of a heated debate over the present state of museums, and their possible futures.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

France), Musée Guimet (Paris, ed. 113 ors d'Asie. Cinisello Balsamo, Milano: Silvana editoriale, 2017.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Museum, J. Paul Getty, and Museum of Fine Arts, Houston, eds. Paris: Life & luxury in the eighteenth century. Los Angeles: J. Paul Getty Museum, 2011.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Delroy, Stephen H. Normes relatives aux noms d'objet et aux zones connexes. Ottawa: Réseau canadien d'information sur le patrimoine, 1994.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Paul, Bernard. L'agence. Geneva: Mamco, 2021.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Caporali, Enrica, and Atanasko Tuneski, eds. Towards a New Curriculum: The DEREC Experience. Florence: Firenze University Press, 2009. http://dx.doi.org/10.36253/978-88-8453-877-2.

Повний текст джерела
Анотація:
This volume presents the experience of developing a new undergraduate curriculum on "Environmental and Resources Engineering" at the Ss. Cyril and Methodius University of Skopje in FYR Macedonia, in the framework of the TEMPUS CD_JEP_19028_2004 DEREC – Development of Environmental and Resources Engineering Curriculum (2005-2008). This publication describes the methodology, instruments and processes employed in the curriculum development. It is divided into two main parts. The first part describes the European Consortium approach (including papers from all representatives of Consortium Member institutions in the European Union and the external project experts). The second part describes the approach adopted by the various faculty representatives of the Ss. Cyril and Methodius University in Skopje and the South East European University of Tetovo, in FYR Macedonia. This book is designed to serve as an updated, coherent and concrete set of instruments for the achievement of similar project objectives.
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Частини книг з теми "Objectifs de parité"

1

Mayr, Richard, Sven Schewe, Patrick Totzke, and Dominik Wojtczak. "Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP." In Lecture Notes in Computer Science, 427–47. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71995-1_22.

Повний текст джерела
Анотація:
AbstractWe study stochastic games with energy-parity objectives, which combine quantitative rewards with a qualitative $$\omega $$ ω -regular condition: The maximizer aims to avoid running out of energy while simultaneously satisfying a parity condition. We show that the corresponding almost-sure problem, i.e., checking whether there exists a maximizer strategy that achieves the energy-parity objective with probability 1 when starting at a given energy level k, is decidable and in $$\mathsf {NP}\cap \mathsf {coNP}$$ NP ∩ coNP . The same holds for checking if such a k exists and if a given k is minimal.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Main, James C. A., Mickael Randour, and Jeremy Sproston. "Timed Games with Bounded Window Parity Objectives." In Lecture Notes in Computer Science, 165–82. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-15839-1_10.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Chatterjee, Krishnendu, and Laurent Doyen. "Games and Markov Decision Processes with Mean-Payoff Parity and Energy Parity Objectives." In Mathematical and Engineering Methods in Computer Science, 37–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-25929-6_3.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Teich, Jürgen. "Pareto-Front Exploration with Uncertain Objectives." In Lecture Notes in Computer Science, 314–28. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44719-9_22.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Miettinen, Kaisa. "Graphical Illustration of Pareto Optimal Solutions." In Multi-Objective Programming and Goal Programming, 197–202. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-36510-5_27.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Pardalos, Panos M., Antanas Žilinskas, and Julius Žilinskas. "Visualization of a Set of Pareto Optimal Decisions." In Non-Convex Multi-Objective Optimization, 139–45. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61007-8_9.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Zhao, Hongjian, Shixiong Xia, Jiaqi Zhao, Dongjun Zhu, Rui Yao, and Qiang Niu. "Pareto-Based Many-Objective Convolutional Neural Networks." In Web Information Systems and Applications, 3–14. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-02934-0_1.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Isac, G. "The Ekeland’s Principle and the Pareto ε-Efficiency." In Multi-Objective Programming and Goal Programming, 148–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/978-3-642-87561-8_12.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Sultan, A. M., and A. B. Templeman. "Generation of Pareto Solutions by Entropy-Based Methods." In Multi-Objective Programming and Goal Programming, 164–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/978-3-642-87561-8_13.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Li, Jinlong, and Mingying Yan. "Pareto Partial Dominance on Two Selected Objectives MOEA on Many-Objective 0/1 Knapsack Problems." In Lecture Notes in Computer Science, 365–73. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11857-4_42.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Objectifs de parité"

1

Kiefer, Stefan, Richard Mayr, Mahsa Shirmohammadi, and Dominik Wojtczakz. "Parity objectives in countable MDPs." In 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2017. http://dx.doi.org/10.1109/lics.2017.8005100.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Mayr, Richard, Sven Schewe, Patrick Totzke, and Dominik Wojtczak. "MDPs with energy-parity objectives." In 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2017. http://dx.doi.org/10.1109/lics.2017.8005131.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Andersson, Johan, and Marcus Redhe. "Response Surface Methods and Pareto Optimization in Crashworthiness Design." In ASME 2003 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2003. http://dx.doi.org/10.1115/detc2003/dac-48752.

Повний текст джерела
Анотація:
This paper presents a method where a multi objective optimization technique is used together with response surface methods in order to support crashworthiness design. As in most engineering design problems there are several conflicting objectives that have to be considered when formulating a design problem as an optimization problem. Here this is exemplified by the desire to minimize the intrusion into the passenger compartment area and simultaneously obtain low maximum acceleration during vehicle impact. These two objectives are naturally conflicting, since low maximum acceleration implies large intrusion. The contribution of this paper is to show a successful application of a set of existing methods to solve a real world engineering problem. The paper also presents methods of illustrating the results obtained from the multi-objective optimization.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Jin, Yaochu. "Pareto-based Multi-Objective Machine Learning." In 7th International Conference on Hybrid Intelligent Systems (HIS 2007). IEEE, 2007. http://dx.doi.org/10.1109/ichis.2007.4344015.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Jin, Yaochu. "Pareto-based Multi-Objective Machine Learning." In 7th International Conference on Hybrid Intelligent Systems (HIS 2007). IEEE, 2007. http://dx.doi.org/10.1109/his.2007.73.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Svoreňová, Mária, Martin Chmelík, Kevin Leahy, Hasan Ferit Eniser, Krishnendu Chatterjee, Ivana Černá, and Calin Belta. "Temporal logic motion planning using POMDPs with parity objectives." In HSCC '15: 18th International Conference on Hybrid Systems: Computation and Control. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2728606.2728617.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Eddy, John, and Kemper Lewis. "Effective Generation of Pareto Sets Using Genetic Programming." In ASME 2001 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2001. http://dx.doi.org/10.1115/detc2001/dac-21094.

Повний текст джерела
Анотація:
Abstract Many designers concede that there is typically more than one measure of performance for an artifact. Often, a large system is decomposed into smaller subsystems each having its own set of objectives, constraints, and parameters. The performance of the final design is a function of the performances of the individual subsystems. It then becomes necessary to consider the tradeoffs that occur in a multi-objective design problem. The complete solution to a multi-objective optimization problem is the entire set of non-dominated configurations commonly referred to as the Pareto set. Common methods of generating points along a Pareto frontier involve repeated conversion of multi-objective problems into single objective problems using weights. These methods have been shown to perform poorly when attempting to populate a Pareto frontier. This work presents an efficient means of generating a thorough spread of points along a Pareto frontier using genetic programming.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Unal, Mehmet, Gordon P. Warn, and Timothy W. Simpson. "Quantifying the Shape of a Pareto Front in Support of Many-Objective Trade Space Exploration." In ASME 2016 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/detc2016-59716.

Повний текст джерела
Анотація:
Complex design optimization problems typically include many conflicting objectives, and the resulting trade space is comprised of numerous design solutions. To efficiently explore a many-objective trade space, form preferences, and select a final design, one must identify and negotiate tradeoffs between multiple, often conflicting, objectives. Identifying conflicting objective pairs allows decision-makers to concentrate on these objectives when selecting preferred designs from the non-dominated solution set, i.e., the Pareto front. Techniques exist to identify and visualize tradeoffs between these conflicting objectives to support trade space exploration; however, these techniques do not quantify, or differentiate, the shape of the Pareto front, which might be useful information for a decision-maker. More specifically, designers could gain insight from the degree of diminishing returns among solutions on the Pareto front, which can be used to understand the extent of the tradeoffs in the problem. Therefore, the shape of the Pareto front could be used to prioritize exploration of conflicting objective pairs. In this paper, we introduce a novel index that quantifies the shape of the Pareto front to provide information about the degree of diminishing returns. The aim of the index is to help designers gain insight into the underlying tradeoffs in a many-objective optimization problem and support trade space exploration by prioritizing the negotiation of conflicting objectives. The proposed Pareto Shape Index is based on analytical geometry and derived from the coordinates of the Pareto solutions in the n objective trade space. The utility of the Pareto Shape Index in differentiating diminishing returns between conflicting objectives is demonstrated by application to an eight-objective benchmark optimization problem.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Mohagheghi, Mahmood, Jayanta Kapat, and Narasimha Nagaiah. "Pareto-Based Multi-Objective Optimization of Recuperated S-CO2 Brayton Cycles." In ASME Turbo Expo 2014: Turbine Technical Conference and Exposition. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/gt2014-27152.

Повний текст джерела
Анотація:
In this paper, two configurations of the S-CO2 Brayton cycles (i.e., the single-recuperated and recompression cycles) are thermodynamically modeled and optimized through a multi-objective approach. Two semi-conflicting objectives, i.e., cycle efficiency (ηc) and cycle specific power (Φsp) are maximized simultaneously to achieve Pareto optimal fronts. The objective of maximum cycle efficiency is to have a smaller and less expensive solar field, and a lower fuel cost in case of a hybrid scheme. On the other hand, the objective of maximum specific power provides a smaller power block, and a lower capital cost associated with recuperators and coolers. The multi-objective optimization is carried out by means of a genetic algorithm which is a robust method for multidimensional, nonlinear system optimization. The optimization process is comprehensive, i.e., all the decision variables including the inlet temperatures and pressures of turbines and compressors, the pinch point temperature differences, and the mass flow fraction of the main compressor are optimized simultaneously. The presented Pareto optimal fronts provide two optimum trade-off curves enabling decision makers to choose their desired compromise between the objectives, and to avoid naive solution points obtained from a single-objective optimization approach. Moreover, the comparison of the Pareto optimal fronts associated with the studied configurations reveals the optimum operational region of the recompression configuration where it presents superior performance over the single-recuperated cycle.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Shi, Biao, Bo Deng, Li-mei Liu, and Xian-cheng Zhou. "Pareto Optimal Prediction for Moving Objects." In 2009 First International Conference on Information Science and Engineering. IEEE, 2009. http://dx.doi.org/10.1109/icise.2009.822.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Objectifs de parité"

1

Elsbernd, Amanda J., Anna K. Johnson, Kenneth J. Stalder, Robert F. Fitzgerald, Locke A. Karriker, Steven J. Hoff, and Gang Sun. Designing an Objective Static Force Plate to Measure Severity of Lameness in Multi-Parity Sows. Ames (Iowa): Iowa State University, January 2011. http://dx.doi.org/10.31274/ans_air-180814-274.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Musty, Michael, Vuong Truong, Jay Clausen, Susan Frankenstein, Christopher Williams, Andrew Trautz, Stacy Howington, and Raju Kala. Thermal infra-red comparison study of buried objects between humid and desert test beds. Engineer Research and Development Center (U.S.), August 2022. http://dx.doi.org/10.21079/11681/45064.

Повний текст джерела
Анотація:
This study pertains to the thermal variations caused by buried objects and their ramifications on soil phenomenology. A multitude of environmental conditions were investigated to observe the effect on thermal infrared sensor performance and detection capabilities. Correlations between these external variables and sensor contrast metrics enable determinable key factors responsible for sensor degradation. This document consists of two parts. The first part is a summary of data collected by the U.S. Army Corps of Engineers, Engineer and Research and Development Center Cold Regions Research and Engineering Laboratory (ERDC-CRREL), ERDC-Geotechnical Structures Laboratory, and Desert Research Institute at the Yuma Proving Ground (YPG) site in February 2020 and observations from this activity. The second part is a comparison of target visibility between data collected at YPG and data collected at the ERDC-CRREL test site in 2018.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Fernandez, Ruben, Hernando Lugo, and Georfe Dulikravich. Aerodynamic Shape Multi-Objective Optimization for SAE Aero Design Competition Aircraft. Florida International University, October 2021. http://dx.doi.org/10.25148/mmeurs.009778.

Повний текст джерела
Анотація:
The SAE Regular Class Aero Design Competition requires students to design a radio-controlled aircraft with limits to the aircraft power consumption, take-off distance, and wingspan, while maximizing the amount of payload it can carry. As a result, the aircraft should be designed subject to these simultaneous and contradicting objectives: 1) minimize the aerodynamic drag force, 2) minimize the aerodynamic pitching moment, and 3) maximize the aerodynamic lift force. In this study, we optimized the geometric design variables of a biplane configuration using 3D aerodynamic analysis using the ANSYS Fluent. Coefficients of lift, drag, and pitching moment were determined from the completed 3D CFD simulations. Extracted coefficients were used in modeFRONTIER multi-objective optimization software to find a set of non-dominated (Pareto-optimal or best trade-off) optimized 3D aircraft shapes from which the winner was selected based to the desired plane performance.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Modlo, Yevhenii O., та Serhiy O. Semerikov. Xcos on Web як перспективний засіб навчання моделювання технічних об’єктів бакалаврів електромеханіки. [б. в.], серпень 2018. http://dx.doi.org/10.31812/0564/2454.

Повний текст джерела
Анотація:
Research goals: to identify the perspective learning simulation tool for Bachelors of Electromechanics. Research objectives: to prove the feasibility of using the simulation system Xcos on Web as a tool of forming of future Bachelors of Electromechanics competence in modeling of technical objects. Research object: the use of imitative simulation systems to learning the Bachelors of Electromechanics. Research subject: the use Xcos on Web in learning modeling of technical objects the Bachelors of Electromechanics. Research methods used: the analysis of existing software usage experience. Research results. The imitative simulation system Xcos on Web is a promising cloud-based learning tool for Bachelor’s of Electromechanics modeling of technical objects. The main conclusions and recommendations: 1. The use of simulation systems, such as Scilab Xcos, is a necessary part of Bachelor of Electromechanics professional training. 2. Cloud-based learning environment built on the integrative usage of mobile Internet devices promotes the forming of Bachelor’s of Electromechanics professional competencies. 3. Implementation the full Scilab Xcos functionality at Xcos on Web creates conditions for transition in Bachelor’s of Electromechanics learning the simulation of technical objects to the use of mobile Internet devices.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Gregersen, Hans, Hosny El-Lakany, and Alain Frechette. Forests, Forest People, and UN 2030 Agenda’s Ethical Mandate: “LEAVE NO ONE BEHIND”. Rights and Resources Initiative, September 2020. http://dx.doi.org/10.53892/ynzm8033.

Повний текст джерела
Анотація:
The contributions of the forest, trees outside forests, and agroforestry sector (FTA) are crucial for achieving the United Nation’s (UN) 2030 Agenda for Sustainable Development fairly and inclusively. This paper reviews FTA sector contributions to the 17 Sustainable Development Goals (SDGs) of the Agenda—both individually and collectively—in the specific context of the development and well-being of the more isolated Indigenous Peoples and local communities (IPLCs) that are part of the explicit “leave no one behind” commitment expressed in the Agenda. The discussion is divided into four parts. Part One lays out the paper’s objectives, scope, and background. Part Two discusses how the FTA sector, working with and through other sectors, contributes to achieving the interconnected SDGs. It provides evidence of the breadth and strength of the FTA sector’s contributions across the SDGs to sustainable development. Part Three focuses on the prerequisites for strengthening the ability of IPLCs to sustainably use their forests to meet their livelihood needs and support their own sustainable development goals and approaches. Part Four provides conclusions and implications for the way forward in the context of achieving UN Agenda 2030.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Provenza, Frederick, Avi Perevolotsky, and Nissim Silanikove. Consumption of Tannin-Rich Forage by Ruminants: From Mechanism to Improved Performance. United States Department of Agriculture, April 2000. http://dx.doi.org/10.32747/2000.7695840.bard.

Повний текст джерела
Анотація:
Trees and shrubs are potentially important sources of food for livestock in many parts of the world, but their use is limited by tannins. Tannins reduce food intake by decreasing digestibility or by causing illness. Supplementing cattle, sheep, and goats with polyethylene glycol (PEG), which has a high affinity for binding tannins and thus attenuating their aversive effects, increases intake of high-tannin foods and improves weight gains and wool growth. The objectives of this proposal were: Objective 1: To further delineate the conditions under which PEG affects intake of high-tannin foods. Objective 2: To ascertain if animals self-regulate intake of PEG in accord with the tannin content of their diet under pen, paddock, and field conditions. Objective 3: To determine how nutritional status and PEG supplementation affect preference for foods varying in nutrients and tannins. Objective 4: To assess the effects of PEG on food selection, intake, and livestock performance in different production systems. The results from this research show that supplementing livestock with low doses of PEG increases intake of high-tannin foods and improves performance of cattle, sheep, and goats. Neutralizing the effects of tannins with supplemental PEG promotes the use of woody species usually considered useless as forage resources. Supplementing animals with PEG has the potential to improve the profitability - mainly milk production - of high-yielding dairy goats fed high-quality foods and supplemented with browse in Mediterranean areas. However, its contribution to production systems utilizing low-yielding goats is limited. Our findings also support the notion that supplemental PEG enhances the ability of livestock to control shrub encroachment and to maintain firebreaks. However, our work also suggests that the effectiveness of supplemental PEG may be low if alternative forages are equal or superior in nutritional quality and contain fewer metabolites with adverse effects.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Khoury, Fares. The Pivot Roadmap: From Dreams to Reality. Edited by Musheer O. Kamau, Sasha Baxter, Claudia Alcaraz-Irizarry, and Alan Mentis. Inter-American Development Bank, July 2021. http://dx.doi.org/10.18235/0003408.

Повний текст джерела
Анотація:
The objective of this report is to present an actionable programme to bring initial moonshot ideas into fully accomplishable projects, ready to be deployed. It comprises three parts. The first part, namely Section 2, provides a background and development avenues for three broad domains of Caribbean economies, namely electric vehicles, digital transformation, and tourism. The second part breaks down the realisation of moonshot ideas into steps using a comprehensive roadmap, which lays out, in sequential point-by-point form, how to steer the coherent long-term deployment of moonshot ideas into concrete actionable projects. Sections 3.1 (From Dreams to Deployment) and 3.2 (Overview of Sequential Tasks by Stakeholder Category) present this in detail. Finally, in the third part, Sections 3.3 and 3.4 define and illustrate the roadmap of moonshot ideas identified during the PIVOT Event. In elaborating these two sections, key emphasis was put on the tasks to be conducted during the preparedness phase (Phase 2 of the roadmap). The conclusion summarizes all dimensions of the roadmap into three illustrations, one for each domain, depicting all nine moonshots from the PIVOT Event.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Lai, Sharon, Kevin Lane, and Laura Nunn. The Term Funding Facility: Has It Encouraged Business Lending? Reserve Bank of Australia, December 2022. http://dx.doi.org/10.47688/rdp2022-07.

Повний текст джерела
Анотація:
The Reserve Bank of Australia's Term Funding Facility (TFF) was announced in March 2020 as part of a package of policy measures to support the Australian economy. It achieved a key objective of providing banks with three-year low-cost funding and was available for drawdown until 30 June 2021. This paper examines the effectiveness of the TFF in increasing the supply of credit to businesses, which was another one of the objectives of the program. Using bank-level data and a difference-in-differences approach, we find no statistically significant evidence that the TFF increased credit supply to businesses. However, our confidence intervals are wide and there are significant identification challenges involved in disentangling the effects of the TFF from the effects of pandemic-related disruptions and other policy interventions on credit supply and demand. Nonetheless, the TFF provided an assured source of funding at a time of considerable stress in the financial system and lowered banks' funding costs, and any effects on business lending via these channels may not be fully reflected in our results.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Vultur, Mircea, Lucie Enel, Louis-Pierre Barette, and Simon Viviers. Les travailleurs des plateformes numériques de transport de personnes et de livraison de repas au Québec : profil et motivations. CIRANO, June 2022. http://dx.doi.org/10.54932/xpzk8254.

Повний текст джерела
Анотація:
Cette étude vise deux objectifs : a) établir un profil des travailleurs qui utilisent une plateforme numérique de transport de personne et/ou de livraison de repas au Québec et b) d’analyser les motifs sous-jacents à leur engagement dans le travail sur une plateforme numérique. La structure des analyses se décline comme suit : dans une première partie, sur la base d’une revue de la littérature, nous présentons les caractéristiques des travailleurs des plateformes et divers types de motivations pour s’engager dans l’emploi sur les plateformes. Nous y exposons également le protocole méthodologique et les données à la source de nos analyses. Dans une deuxième partie, en utilisant des données statistiques secondaires et inédites, nous dressons un portrait des travailleurs engagés sur les plateformes de transport de personnes et de livraison de repas au Québec en faisant ressortir notamment les spécificités de la population des jeunes travailleurs. Dans une troisième partie, en analysant des données d’entrevues, nous exposons une typologie des motivations invoquées par les jeunes québécois de 18 à 34 ans pour travailler sur les plateformes Uber et Uber Eats. En conclusion, nous ferons une synthèse des constats significatifs issus des analyses.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Yermiyahu, Uri, Thomas Kinraide, and Uri Mingelgrin. Role of Binding to the Root Surface and Electrostatic Attraction in the Uptake of Heavy Metal by Plants. United States Department of Agriculture, 2000. http://dx.doi.org/10.32747/2000.7586482.bard.

Повний текст джерела
Анотація:
The principal accomplishment of the research supported by BARD was progress toward a comprehensive view of cell-surface electrical effects (both in cell walls [CWs] and at plasma membrane [PM] surfaces) upon ion uptake, intoxication, and amelioration. The research confirmed that electrostatic models (e.g., Gouy-Chapman-Stern [G-C-S]), with parameter values contributed by us, successfully predict ion behavior at cell surfaces. Specific research objectives 1. To characterize the sorption of selected heavy metals (Cu, Zn, Pb, Cd) to the root PM in the presence of other cations and organic ligands (citric and humic acids). 2. To compute the parameters of a G-C-S model for heavy-metal sorption to the root PM. 3. To characterize the accumulation of selected heavy metals in various plant parts. 4. To determine whether model-computed ion binding or ion activities at root PM surfaces predict heavy-metal accumulation in whole roots, root tips, or plant shoots. 5. To determine whether measured ion binding by protoplast-free roots (i.e., root CWs) predicts heavy-metal accumulation in whole roots, root tips, or plant shoots. 6. To correlate growth inhibition, and other toxic responses, with the measured and computed factors mentioned above. 7. To determine whether genotypic differences in heavy-metal accumulation and toxic responses correlate with genotypic differences in parameters of the G-C-S model. Of the original objectives, all except for objective 7 were met. Work performed to meet the other objectives, and necessitated on the basis of experimental findings, took the time that would have been required to meet objective 7. In addition, work with Pb was unsuccessful due to experimental complications and work on Cd is still in progress. On the other hand, the uptake and toxicity of the anion, selenate was characterized with respect to electrostatic effects and the influences of metal cations. In addition, the project included more theoretical work, supported by experimentation, than was originally planned. This included transmembrane ion fluxes considered in terms of PM-surface electrical potentials and the influence of CWs upon ion concentrations at PM surfaces. A important feature of the biogeochemistry of trace elements in the rhizosphere is the interaction between plant-root surfaces and the ions present in the soil solution. The ions, especially the cations, of the soil solution may be accumulated in the aqueous phases of cell surfaces external to the PMs, sometimes referred to as the "water free space" and the "Donnan free space". In addition, ions may bind to the CW components or to the PM surface with variable binding strength. Accumulation at the cell surface often leads to accumulation in other plant parts with implications for the safety and quality of foods. A G-C-S model for PMs and a Donnan-plus-binding model for CWs were used successfully to compute electrical potentials, ion binding, and ion concentration at root-cell surfaces. With these electrical potentials, corresponding values for ion activities may be computed that are at least proportional to actual values also. The computed cell-surface ion activities predict and explain ion uptake, intoxication, and amelioration of intoxication much more accurately than ion activities in the bulk-phase rooting medium.
Стилі APA, Harvard, Vancouver, ISO та ін.
Також вас можуть зацікавити розширені добірки на тему "Objectifs de parité" для конкретних типів джерел:
Статті в журналах Дисертації Книги
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії