Добірка наукової літератури з теми "Variantes du problème du p-Centre"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Variantes du problème du p-Centre".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Variantes du problème du p-Centre":
1
K, Toungara. "Contribution à l'amélioration de la qualité de prise en charge du paludisme au Centre de Santé Communautaire de Sanankoroba dans le district sanitaire de Kalabancoro, Mali." Mali Santé Publique 10, no. 02 (April 20, 2021): 34–39. http://dx.doi.org/10.53318/msp.v10i02.1794.
Анотація:
Introduction : Le paludisme constitue un véritable problème de santé publique dans le monde et majeur dans les pays subsahariens. Sa prise en charge selon les recommandations de l'OMS n'est pas correctement effectuée partout. Le but de notre travail était de contribuer à l'amélioration de la qualité de la prise en charge du paludisme dans le centre de santé communautaire de Sanankoroba. Matériel et méthodes : Il s'agissait d'une étude transversale à passage répété de recherche action de Susman. Elle s'est déroulée en quatre mois allant du 1ier juillet au 31 octobre 2019 dans le centre de santé de Sanankoroba. Ont été inclus dans cette étude les cas présumés ou confirmés du paludisme par les prestataires de santé du CSCom de Sanankoroba. Résultats : Après la mise en place du plan d'action entre l'évaluation initiale et finale, nous avons constaté une évolution de la concordance entre signes et classification du paludisme de 51% à 93,3% (Chi2 = 40,848 ; p<10-3). Le suivi et l'évolution appliqués par les prestataires étaient passés de 0% à 82,7% (Chi2 = 105,7 ; p = 0,765) au cours de l'évaluation finale. Les conseils sur les mesures de prévention de 0% à 81.3 % après le plan d'action. Conclusion : Les insuffisances constatées au cours de cette étude ont été corrigées grâce à des planifications faites et leur mise en œuvre.Mots clés : paludisme, centre de santé communautaire, Sanankoroba, Mali
2
Angelova, Lyudmila, Maria Tsvetkova, and Mariya Levkova. "CHROMOSOMAL POLYMORPHISM IN BULGARIAN PATIENTS WITH REPRODUCTIVE PROBLEMS – ONE GENETIC CENTRE EXPERIENCE." Journal of IMAB - Annual Proceeding (Scientific Papers) 27, no. 4 (December 2, 2021): 4133–38. http://dx.doi.org/10.5272/jimab.2021274.4133.
Анотація:
Chromosomal polymorphism is described as normal variants at chromosomal regions with no impact on the phenotype but a possible correlation to infertility and recurrent spontaneous abortions. The aim of this study was to evaluate the effect of the chromosomal polymorphisms involved in families with reproductive failures in the Bulgarian population. Material and methods: A total of 1733 patients with unexplained reproductive failures who visited the Laboratory of Medical Genetics – Varna, Bulgaria, (2004 - 2019) were investigated by conventional cytogenetic analysis GTG and CBG differential banding techniques and analyzed at the resolution 400-550 GTG bands. Results: Chromosomal polymorphisms were found in 173 infertile patients (9,98%). The sex distribution was 6,52% males and 3,46% females. The most frequent finding was inv(9)(qh) (23,7%). The other chromosomal variants, which were found, consisted: 9qh+/- variants (15,1%); polymorphisms on the short arms of the acrocentric chromosomes (21,4%); 16qh+ (12,7%) and 1qh+ (6,9%). Y chromosome polymorphism was found in 27,4% of the males with polymorphisms. Two rare cases of polymorphism involving the centromere regions - 19qcenh+ and 20pcenh+ were also found. Conclusion: There is growing evidence that polymorphisms may have a clinical impact on fertility and could take part in the etiology of RF. In this study, we found a significantly high percentage of polymorphisms (9,98%) among the tested patients, and they were more common among males. The statistical significance of increased incidence of chromosome variations found in our study emphasizes the need for routine evaluation of their role in families with RF in our country.
3
Lima de Paulo, Wanderlei, Marta Ines Velazco Fontova, and Renato Canil de Souza. "An analysis of a mean-variance enhanced index tracking problem with weights constraints." Investment Management and Financial Innovations 15, no. 4 (November 19, 2018): 183–92. http://dx.doi.org/10.21511/imfi.15(4).2018.15.
Анотація:
In this paper, the authors deal with a mean-variance enhanced index tracking (EIT) problem with weights constraints. Using a shrinkage approach, they show that constructing the constrained EIT portfolio is equivalent to constructing the unconstrained EIT portfolio. This equivalence allows to study the effect of weights constraints on the covariance matrix and on the EIT portfolio. In general, the effects of weights constraints on the EIT portfolio are different from those observed in the case of global minimum variance portfolio. Finally, the authors present a numerical asset allocation example, where the S&amp;P 500 index is used as the market index to be tracked using a portfolio composed of ten stocks, in which the constrained EIT portfolio shows a satisfactory performance when compared to the unconstrained case.
4
Dupin, Nicolas, Frank Nielsen, and El-Ghazali Talbi. "Unified Polynomial Dynamic Programming Algorithms for P-Center Variants in a 2D Pareto Front." Mathematics 9, no. 4 (February 23, 2021): 453. http://dx.doi.org/10.3390/math9040453.
Анотація:
With many efficient solutions for a multi-objective optimization problem, this paper aims to cluster the Pareto Front in a given number of clusters K and to detect isolated points. K-center problems and variants are investigated with a unified formulation considering the discrete and continuous versions, partial K-center problems, and their min-sum-K-radii variants. In dimension three (or upper), this induces NP-hard complexities. In the planar case, common optimality property is proven: non-nested optimal solutions exist. This induces a common dynamic programming algorithm running in polynomial time. Specific improvements hold for some variants, such as K-center problems and min-sum K-radii on a line. When applied to N points and allowing to uncover M<N points, K-center and min-sum-K-radii variants are, respectively, solvable in O(K(M+1)NlogN) and O(K(M+1)N2) time. Such complexity of results allows an efficient straightforward implementation. Parallel implementations can also be designed for a practical speed-up. Their application inside multi-objective heuristics is discussed to archive partial Pareto fronts, with a special interest in partial clustering variants.
5
YANG, LINMIN, ZHE DANG, and OSCAR H. IBARRA. "ON STATELESS AUTOMATA AND P SYSTEMS." International Journal of Foundations of Computer Science 19, no. 05 (October 2008): 1259–76. http://dx.doi.org/10.1142/s0129054108006261.
Анотація:
We introduce the notion of stateless multihead two-way (respectively, one-way) NFAs and stateless multicounter systems and relate them to P systems and vector addition systems. In particular, we investigate the decidability of the emptiness and reachability problems for these stateless automata and show that the results are applicable to similar questions concerning certain variants of P systems, namely, token systems and sequential tissue-like P systems.
6
Sáez-Aguado, Jesús, та Paula Camelia Trandafir. "Variants of the $$ \varepsilon $$ ε -constraint method for biobjective integer programming problems: application to p-median-cover problems". Mathematical Methods of Operations Research 87, № 2 (22 жовтня 2017): 251–83. http://dx.doi.org/10.1007/s00186-017-0618-9.
7
Andrei, Ionica. "Existence Theorems for Some Classes of Boundary Value Problems Involving the P(X)-Laplacian." Nonlinear Analysis: Modelling and Control 13, no. 2 (April 25, 2008): 145–58. http://dx.doi.org/10.15388/na.2008.13.2.14575.
Анотація:
We prove an alternative for a nonlinear eigenvalue problem involving the p(x)-Laplacian and study a subcritical boundary value problem for the same operator. The theoretical approach is the Mountain Pass Lemma and one of its variants, which is very useful in the study of eigenvalue problems.
8
Захаров, И. В., В. Г. Терехов, А. Н. Соколовский, and С. С. Зыкова. "Reconfiguration of the on-board complex of a mobile object based on modeling of variants of its structural degradation." Vestnik of Russian New University. Series «Complex systems: models, analysis, management», no. 4 (January 23, 2023): 41–48. http://dx.doi.org/10.18137/rnu.v9187.22.04.p.39.
Анотація:
Решение задач применения бортовых вычислительных комплексов подвижных объектов в условиях влияния неблагоприятных факторов различного происхождения требует гибкого управления режимами работы. Предлагаемый способ функционально-параметрического конфигурирования бортовых вычислительных комплексов подвижных объектов основан на оперативном управлении составом выполняемых задач и параметрами функционирования элементов бортовых вычислительных комплексов на основе анализа ресурса системы, условий функционирования и прогнозирования ее состояния. Solving the problems of using on-board computing systems of mobile objects under the influence of adverse factors of various origins requires flexible control of operating modes. The proposed method of functional parametric configuration of on-board computing complexes of mobile objects is based on operational management of the composition of tasks performed and the parameters of the functioning of the elements of on-board computing complexes based on the analysis of the system resource, operating conditions and forecasting of its condition.
9
Hampl, Martin. "Territorial Administrative Division of Czech Republic - Conception Problems and Variants of Solution." Geografie 95, no. 4 (1990): 248–59. http://dx.doi.org/10.37040/geografie1990095040248.
Анотація:
The paper deals with general problems and possible variants of solution of the new territorial administrative arrangement. A special attention is paid to the application of geographical knowledge, especially the results of the social-geographical regionalization in the solution of these problems. Apart from general problems, variants on central, regional and local levels are dealt with in more detail.
10
Diallo, MB, and Et Al. "Séroprévalence de l’hépatite B chez les femmes enceintes en consultation prénatale au centre de sante urbain Mafoudia de Dubreka (République de Guinée)." Revue Malienne d'Infectiologie et de Microbiologie 18, no. 1 (June 23, 2023): 6–10. http://dx.doi.org/10.53597/remim.v18i1.2623.
Анотація:
Introduction : Le virus de l’hépatite B (VHB) est un virus à ADN enveloppé, de la famille des Hepadnaviridae. Elle est l’une des maladies infectieuses les plus courantes dans le monde. On estime qu'il y a 350 millions de porteurs chroniques du virus de l'hépatite B (VHB) dans le monde avec un risque important chez les femmes enceintes. La présente étude avait pour but d’évaluer la séroprévalence de l’AgHBs chez les femmes enceintes reçues en consultation prénatale au centre de sante urbain Mafoudia de Dubreka. Méthode : Il s'agissait d'une étude transversale d’une durée de trois (03) mois allant du 18 novembre 2020 au 18 février 2021. Résultats : Durant cette étude, nous avons testé 250 femmes enceintes venues en consultation prénatale au centre de santé, une séroprévalence de 10,6% a été obtenue. La tranche d’âge de 15-24 ans était la plus représentée avec 8,6% des cas. Les femmes fonctionnaires étaient les plus touchées avec 16,7%. Les universitaires étaient les plus représentés avec 20,8%. La plupart des femmes enceintes étaient au 3ème trimestre avec 13.7% des cas. Les facteurs de risques associés à ce portage sont entre autres les soins dentaires, piercing et les comportements sexuels à risques avec p ≤ 0,05. Conclusion : Notre étude montre que l’hépatite B représente bien un problème de santé publique chez les gestantes de la ville de Dubréka. Ce constat a pour conséquence d’impacter significativement dans la prise en charge des nouveaux nés sur le plan clinique et économique dans un contexte de pays à ressources limitées
Дисертації з теми "Variantes du problème du p-Centre":
1
Haddad, Marcel Adonis. "Nouveaux modèles robustes et probabilistes pour la localisation d'abris dans un contexte de feux de forêt." Electronic Thesis or Diss., Université Paris sciences et lettres, 2020. http://www.theses.fr/2020UPSLD021.
Анотація:
A cause du réchauffement climatique, le nombre et l’intensité des feux de forêts augmentent autour du globe. Dansce contexte, la construction de refuges contre le feu est une solution de plus en plus envisagée. Le problème consisteessentiellement à localiser p refuges de sorte à minimiser la distance maximale qui sépare un usager du plus procherefuge accessible en cas de feux. Le territoire considéré est divisé en zones et est modélisé comme un graphe auxarêtes pondérées. Un départ de feux sur une seule zone (c’est-à-dire sur un sommet). La principale conséquence d’unfeu est que les chemins d’évacuation sont modifiés de deux manières. Premièrement, un chemin d’évacuation ne peutpas traverser le sommet en feu. Deuxièmement, le fait qu’une personne proche de l’incendie puisse avoir un choix limitéde direction d’évacuation, ou être sous stress, est modélisé à l’aide d’une stratégie d’évacuation nouvellement définie.Cette stratégie d’évacuation induit des distances d’évacuation particulières qui rendent notre modèle spécifique. Selon letype de données considéré et l’objectif recherché, nous proposons deux problèmes avec ce modèle: le Robust p-CenterUnder Pressure et le Probabilistic p-Center Under Pressure. Nous prouvons que ces deux problèmes sont NP-difficilessur des classes de graphes pertinentes pour notre contexte. Nous proposons également des résultats d’approximationet d’inapproximation. Finalement, nous développons des algorithmes polynomiaux sur des classes de graphes simples,et nous développons des algorithmes mathématiques basés sur la programmation linéaireThe location of shelters in different areas threatened by wildfires is one of the possible ways to reduce fatalities in acontext of an increasing number of catastrophic and severe forest fires. The problem is basically to locate p sheltersminimizing the maximum distance people will have to cover to reach the closest accessible shelter in case of fire. Thelandscape is divided in zones and is modeled as an edge-weighted graph with vertices corresponding to zones andedges corresponding to direct connections between two adjacent zones. Each scenario corresponds to a fire outbreak ona single zone (i.e., on a vertex) with the main consequence of modifying evacuation paths in two ways. First, an evacuationpath cannot pass through the vertex on fire. Second, the fact that someone close to the fire may have limited choice, ormay not take rational decisions, when selecting a direction to escape is modeled using a new kind of evacuation strategy.This evacuation strategy, called Under Pressure, induces particular evacuation distances which render our model specific.We propose two problems with this model: the Robust p-Center Under Pressure problem and the Probabilistic p-CenterUnder Pressure problem. First we prove hardness results for both problems on relevant classes of graphs for our context.In addition, we propose polynomial exact algorithms on simple classes of graphs and we develop mathematical algorithmsbased on integer linear programming
2
Yang, Chih-Shiang, and 楊智翔. "New Algorithmic Results on the Connected p-Center Problem and Its Variants." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/91313818201500460028.
Анотація:
碩士世新大學
資訊管理學研究所(含碩專班)
98
The essential p-Center problem is to determine a set of p vertices of a graph G for building facilities. The objective is to minimize the maximum access distance of clients at all vertices. Let G(V, E, l, w) be a n-vertex and m-edge graph with lengths on edges and weights on vertices. Given a graph G(V, E, l, w), a practical variant, called the Weighted Connected p-Center problem (the WCpC problem), is to find a p-center of G such that the maximum weighted access distance of clients at all vertices is minimized under the additional restriction in which requires the selected p-center induce a connected subgraph of G. If w(v) = 1, for all v in V, then the problem is abbreviated as the CpC problem. We first prove that the CpC problem is NP-Hard on planar graphs and interval graphs, respectively. Second, we propose two algorithms for the WCpC problem on trees with time-complexities O(pn) and O(n log2n), respectively, by different approaches. Meanwhile, if w(v) ? C, for all v in V, where C is a set of k numbers, for some small integer k, then another algorithm with time-complexity O(kn) is proposed. Next, the extension to graphs with forbidden vertices, called the Forbidden Weighted Connected p-Center problem (the FWCpC problem) is discussed. We show that the FWCpC problem can be also solved in O(n log2n) time. Finally, we propose an O(n) time algorithm for the FCpC problem on interval graphs with unit vertex-weights and unit edge-lengths.
3
Zhang, G., Marian Gheorghe, L. Q. Pan, and M. J. Perez-Jimenez. "Evolutionary membrane computing: A comprehensive survey and new results." 2014. http://hdl.handle.net/10454/10830.
Анотація:
NoEvolutionary membrane computing is an important research direction of membrane computing that aims to explore the complex interactions between membrane computing and evolutionary computation. These disciplines are receiving increasing attention. In this paper, an overview of the evolutionary membrane computing state-of-the-art and new results on two established topics in well defined scopes (membrane-inspired evolutionary algorithms and automated design of membrane computing models) are presented. We survey their theoretical developments and applications, sketch the differences between them, and compare the advantages and limitations. (C) 2014 Elsevier Inc. All rights reserved.
Книги з теми "Variantes du problème du p-Centre":
1
Gleń-Karolczyk, Katarzyna. Zabiegi ochronne kształtujące plonowanie zdrowotność oraz różnorodność mikroorganizmów związanych z czernieniem pierścieniowym korzeni chrzanu (Atmoracia rusticana Gaertn.). Publishing House of the University of Agriculture in Krakow, 2019. http://dx.doi.org/10.15576/978-83-66602-39-7.
Анотація:
Horseradish roots, due to the content of many valuable nutrients and substances with healing and pro-health properties, are used more and more in medicine, food industry and cosmetics. In Poland, the cultivation of horseradish is considered minor crops. In addition, its limited size causes horseradish producers to encounter a number of unresolved agrotechnical problems. Infectious diseases developing on the leaves and roots during the long growing season reduce the size and quality of root crops. The small range of protection products intended for use in the cultivation of horseradish generates further serious environmental problems (immunization of pathogens, low effectiveness, deterioration of the quality of raw materials intended for industry, destruction of beneficial organisms and biodiversity). In order to meet the problems encountered by horseradish producers and taking into account the lack of data on: yielding, occurrence of infectious diseases and the possibility of combating them with methods alternative to chemical ones in the years 2012–2015, rigorous experiments have been carried out. The paper compares the impact of chemical protection and its reduced variants with biological protection on: total yield of horseradish roots and its structure. The intensification of infectious diseases on horseradish leaves and roots was analyzed extensively. Correlations were examined between individual disease entities and total yield and separated root fractions. A very important and innovative part of the work was to learn about the microbial communities involved in the epidemiology of Verticillium wilt of horseradish roots. The effect was examined of treatment of horseradish cuttings with a biological preparation (Pythium oligandrum), a chemical preparation (thiophanate-methyl), and the Kelpak SL biostimulator (auxins and cytokinins from the Ecklonia maxima algae) on the quantitative and qualitative changes occurring in the communities of these microorganisms. The affiliation of species to groups of frequencies was arranged hierarchically, and the biodiversity of these communities was expressed by the following indicators: Simpson index, Shannon–Wiener index, Shannon evenness index and species richness index. Correlations were assessed between the number of communities, indicators of their biodiversity and intensification of Verticillium wilt of horseradish roots. It was shown that the total yield of horseradish roots was on average 126 dt · ha–1. Within its structure, the main root was 56%, whereas the fraction of lateral roots (cuttings) with a length of more than 20 cm accounted for 26%, and those shorter than 20 cm for 12%, with unprofitable yield (waste) of 6%. In the years with higher humidity, the total root yield was higher than in the dry seasons by around 51 dt · ha–1 on average. On the other hand, the applied protection treatments significantly increased the total yield of horseradish roots from 4,6 to 45,3 dt · ha–1 and the share of fractions of more than 30 cm therein. Higher yielding effects were obtained in variants with a reduced amount of foliar application of fungicides at the expense of introducing biopreparations and biostimulators (R1, R2, R3) and in chemical protection (Ch) than in biological protection (B1, B2) and with the limitation of treatments only to the treatment of cuttings. The largest increments can be expected after treating the seedlings with Topsin M 500 SC and spraying the leaves: 1 × Amistar Opti 480 SC, 1 × Polyversum WP, 1 × Timorex Gold 24 EC and three times with biostimulators (2 × Kelpak SL + 1 × Tytanit). In the perspective of the increasing water deficit, among the biological protection methods, the (B2) variant with the treatment of seedlings with auxins and cytokinins contained in the E. maxima algae extract is more recommended than (B1) involving the use of P. oligandrum spores. White rust was the biggest threat on horseradish plantations, whereas the following occurred to a lesser extent: Phoma leaf spot, Cylindrosporium disease, Alternaria black spot and Verticillium wilt. In turn, on the surface of the roots it was dry root rot and inside – Verticillium wilt of horseradish roots. The best health of the leaves and roots was ensured by full chemical protection (cuttings treatment + 6 foliar applications). A similar effect of protection against Albugo candida and Pyrenopeziza brassicae was achieved in the case of reduced chemical protection to one foliar treatment with synthetic fungicide, two treatments with biological preparations (Polyversum WP and Timorex Gold 24 EC) and three treatments with biostimulators (2 × Kelpak SL, 1 × Tytanit). On the other hand, the level of limitation of root diseases comparable with chemical protection was ensured by its reduced variants R3 and R2, and in the case of dry root rot, also both variants of biological protection. In the dry years, over 60% of the roots showed symptoms of Verticillium wilt, and its main culprits are Verticillium dahliae (37.4%), Globisporangium irregulare (7.2%), Ilyonectria destructans (7.0%), Fusarium acuminatum (6.7%), Rhizoctonia solani (6.0%), Epicoccum nigrum (5.4%), Alternaria brassicae (5.17%). The Kelpak SL biostimulator and the Polyversum WP biological preparation contributed to the increased biodiversity of microbial communities associated with Verticillium wilt of horseradish roots. In turn, along with its increase, the intensification of the disease symptoms decreased. There was a significant correlation between the richness of species in the communities of microbial isolates and the intensification of Verticillium wilt of horseradish roots. Each additional species of microorganism contributed to the reduction of disease intensification by 1,19%.
2
Svrakic, Dragan M., and Mirjana Divac Jovanovic. The Fragmented Personality. Oxford University Press, 2018. http://dx.doi.org/10.1093/med/9780190884574.001.0001.
Анотація:
This book pioneers a new model of personality disorder primarily intended to serve mental health professionals, those already in practice and equally those in training. In contrast to the static concepts of mental normalcy and pathology, the presented nosology is dynamic (accounts for the reversibility of mental functioning) and personalized, context- and time sensitive. In a 3D diagnostic cylinder, the coordinates cross match the person’s common level of mental functioning (vertical diagnosis) with his or her behavior style (horizontal diagnosis) at a point in space and a unit of time, giving the clinician precise milestones to monitor changes in diagnosis and progress in therapy. The central problem with persons suffering from personality disorder does not rest in their extreme behaviors but rather underneath the surface, in the fragmented substrate of personality (a core deficit sine qua non shared by all individual variants), while extreme behaviors merely represent variable compensatory strategies. Based on this model, mechanism-based treatments are outlined: reconstructive interpersonal psychotherapy (a novel, integrative, transtheoretical approach which relies on psychoanalytic and humanist traditions) and mechanism-based pharmacotherapy of neurobiological vulnerabilities associated with excessive temperament traits.
3
Shapiro, Marc B. Between the Yeshiva World and Modern Orthodoxy. Liverpool University Press, 1999. http://dx.doi.org/10.3828/liverpool/9781874774525.001.0001.
Анотація:
The span of Rabbi Jehiel Jacob Weinberg's life (1884–1966) illuminates the religious and intellectual dilemmas that traditional Jewry has faced over the past century. Rabbi Weinberg became a central ideologue of modern Orthodoxy because of his positive attitude to secular studies and Zionism and his willingness to respond to social change in interpreting the halakhah. But Weinberg was an unusual man: even at a time when he was defending the traditional yeshiva against all attempts at reform, he always maintained an interest in the wider world. He left Lithuania for Germany at the beginning of the First World War, attended the University of Giessen, and increasingly identified with the Berlin school of German Orthodoxy. He was soon recognized as German Orthodoxy's most eminent halakhic authority in its efforts to maintain religious tradition in the face of Nazi persecution. His approach derived from the conviction that the attempt to shore up Orthodoxy by increased religious stringency would only reduce its popular appeal. This book discusses many aspects of Weinberg's life. It elucidates many institutional and intellectual phenomena of the Jewish world: the yeshivas of Lithuania; the state of the Lithuanian rabbinate; the musar movement; the Jews of eastern Europe in Weimar Germany; the Torah im Derekh Eretz movement and its variants; Orthodox Jewish attitudes towards Wissenschaft des Judentums; and the special problems of Orthodox Jews in Nazi Germany. Throughout, the book shows the complex nature of Weinberg's character and the inner struggles of a man being pulled in different directions.
Частини книг з теми "Variantes du problème du p-Centre":
1
Hofman, Piotr, Filip Mazowiecki, and Philip Offtermatt. "Fast Termination and Workflow Nets." In Computer Aided Verification, 132–55. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37706-8_7.
Анотація:
AbstractPetri nets are an established model of concurrency. A Petri net is terminating if for every initial marking there is a uniform bound on the length of all possible runs. Recent work on the termination of Petri nets suggests that, in general, practical models should terminate fast, i.e. in polynomial time. In this paper we focus on the termination of workflow nets, an established variant of Petri nets used for modelling business processes. We partially confirm the intuition on fast termination by showing a dichotomy: workflow nets are either non-terminating or they terminate in linear time.The central problem for workflow nets is to verify a correctness notion called soundness. In this paper we are interested in generalised soundness which, unlike other variants of soundness, preserves desirable properties like composition. We prove that verifying generalised soundness is coNP-complete for terminating workflow nets.In general the problem is PSPACE-complete, thus intractable. We utilize insights from the coNP upper bound to implement a procedure for generalised soundness using MILP solvers. Our novel approach is a semi-procedure in general, but is complete on the rich class of terminating workflow nets, which contains around 90% of benchmarks in a widely-used benchmark suite. The previous state-of-the-art approach for the problem is a different semi-procedure which is complete on the incomparable class of so-called free-choice workflow nets, thus our implementation improves on and complements the state-of-the-art.Lastly, we analyse a variant of termination time that allows parallelism. This is a natural extension, as workflow nets are a concurrent model by design, but the prior termination time analysis assumes sequential behavior of the workflow net. The sequential and parallel termination times can be seen as upper and lower bounds on the time a process represented as a workflow net needs to be executed. In our experimental section we show that on some benchmarks the two bounds differ significantly, which agrees with the intuition that parallelism is inherent to workflow nets.
2
Roux, Nicolas, Rachel Chase, Ines van den Houwe, Chih-Ping Chao, Xavier Perrier, Jean-Pierre Jacquemoud-Collet, Julie Sardos, and Mathieu Rouard. "Somaclonal variation in clonal crops: containing the bad, exploring the good." In Mutation breeding, genetic diversity and crop adaptation to climate change, 355–65. Wallingford: CABI, 2021. http://dx.doi.org/10.1079/9781789249095.0037.
Анотація:
Abstract Somaclonal variation describes random cellular changes in plants regenerated through tissue culture. It occurs in certain crops that undergo micropropagation and has been recorded in different explant sources, from leaves and shoots to meristems and embryos. In banana (Musa spp.), a clonal crop conserved in vitro, somaclonal variation has been observed after prolonged periods in tissue culture, resulting from an increase in subcultures performed on a given clone. According to scientific literature, variants, or off-types, often show characteristics such as abnormal growth and flower or fruit defects in frequencies ranging from 1% to 32%. This variation poses a problem for gene bank managers, whose mandate is to maintain the genetic integrity of their collections for research and breeding. In the case of the Bioversity International Musa Germplasm Transit Centre (ITC), stress during the in vitro process is minimized by various techniques and plants are regenerated after 10 years, making it a long and costly process. Identifying somaclonal variation at an early stage would be an ideal solution; however, this requires suitable molecular markers. Recent studies revealed that techniques such as direct DNA sequencing and single nucleotide polymorphisms (SNPs) are able to detect the underlying factors of somaclonal variation and are becoming more accessible. On the other hand, somaclonal variation can be beneficial as it allows the natural development of new varieties and supplies genetic stocks used for future genetic studies. Harnessing the diversity of somaclones is easier, faster and cheaper compared with other methods of crop improvement, although it is also less predictable. So far, variants of crops such as apple, strawberry, potato and banana have been successfully adopted into global markets. In this chapter, we will discuss how to minimize the adverse effects of somaclonal variation while maximizing its benefits for greater crop diversity, with a particular focus on banana.
3
Pillonetto, Gianluigi, Tianshi Chen, Alessandro Chiuso, Giuseppe De Nicolao, and Lennart Ljung. "Classical System Identification." In Regularized System Identification, 17–31. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-95860-2_2.
Анотація:
AbstractSystem identification as a field has been around since the 1950s with roots from statistical theory. A substantial body of concepts, theory, algorithms and experience has been developed since then. Indeed, there is a very extensive literature on the subject, with many text books, like [5, 8, 12]. Some main points of this “classical” field are summarized in this chapter, just pointing to the basic structure of the problem area. The problem centres around four main pillars: (1) the observed data from the system, (2) a parametrized set of candidate models, “the Model structure”, (3) an estimation method that fits the model parameters to the observed data and (4) a validation process that helps taking decisions about the choice of model structure. The crucial choice is that of the model structure. The archetypical choice for linear models is the ARX model, a linear difference equation between the system’s input and output signals. This is a universal approximator for linear systems—for sufficiently high orders of the equations, arbitrarily good descriptions of the system are obtained. For a “good” model, proper choices of structural parameters, like the equation orders, are required. An essential part of the classical theory deals with asymptotic quality measures, bias and variance, that aim at giving the best mean square error between the model and the true system. Some of this theory is reviewed in this chapter for estimation methods of the maximum likelihood character.
4
Klar, M., J. Mertes, M. Glatt, B. Ravani, and J. C. Aurich. "A Holistic Framework for Factory Planning Using Reinforcement Learning." In Proceedings of the 3rd Conference on Physical Modeling for Virtual Manufacturing Systems and Processes, 129–48. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-35779-4_8.
Анотація:
AbstractThe generation of an optimized factory layout is a central element of the factory planning process. The generated factory layout predefines multiple characteristics of the future factory, such as the operational costs and proper resource allocations. However, manual layout planning is often time and resource-consuming and involves creative processes. In order to reduce the manual planning effort, automated, computer-aided planning approaches can support the factory planner to deal with this complexity by generating valuable solutions in the early phase of factory layout planning. Novel approaches have introduced Reinforcement Learning based planning schemes to generate optimized factory layouts. However, the existing research mainly focuses on the technical feasibility and does not highlight how a Reinforcement Learning based planning approach can be integrated into the factory planning process. Furthermore, it is unclear which information is required for its application. This paper addresses this research gap by presenting a holistic framework for Reinforcement Learning based factory layout planning that can be applied at the initial planning (greenfield planning) stages as well as in the restructuring (brownfield planning) of a factory layout. The framework consists of five steps: the initialization of the layout planning problem, the initialization of the algorithm, the execution of multiple training sets, the evaluation of the training results, and a final manual planning step for a selected layout variant. Each step consists of multiple sub-steps that are interlinked by an information flow. The framework describes the necessary and optional information for each sub-step and further provides guidance for future developments.
5
Franke, Jörg, Peter Wasserscheid, Thorsten Ihne, Peter Lamp, Jürgen Guldner, and Oliver Zipse. "The Power of Technological Innovation." In Road to Net Zero, 215–64. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-42224-9_8.
Анотація:
AbstractAchieving the urgent need for rapid decarbonization to meet the 1.5 °C target requires disruptive technological change. In the automotive industry, technological progress is closely linked to improved sustainability, and sustainability goals drive the need for technological innovation. However, new technologies in the mobility sector are fraught with uncertainties that challenge both original equipment manufacturers (OEMs) and their stakeholders, such as suppliers, customers, and policy-makers. Therefore, this chapter focuses on the technical, economic, and environmental evaluation of alternative powertrain concepts and the management of uncertainties associated with emerging technological innovation as part of the broader transition to net zero.Electric mobility plays a central role in the sustainability transition and is characterized by a high degree of variance. Battery electric vehicles (BEVs) are expected to dominate private transport in the future due to their greenhouse gas and pollutant-free operation and high efficiency. In addition to charging infrastructure, the technical challenges currently lie primarily in cell chemistry and power electronics. Advances in battery technology and infrastructure electrification will help eliminate the range problem in the future. Another important future fuel is hydrogen. One application is the fuel cell vehicle, which combines the advantages of a chemical energy carrier with high gravimetric energy density with those of an electrical energy converter. Hydrogen also plays an important role as an energy carrier for specific energy supply processes in manufacturing processes and simplifies the transport of regeneratively generated energy. In addition, hybrid vehicles are a transitional technology, and alternative fuel internal combustion engines can contribute to the decarbonization of the existing fleet and to specific applications.This chapter assesses the performance of alternative powertrains; highlights the interrelationship between powertrain systems, energy ecosystems, and sustainability goals; and identifies future research directions for electric and hydrogen mobility.
6
"Children with Externalizing Behavior Problems." In The Power of Positive Parenting, edited by Matthew R. Sanders, Trevor G. Mazzucchelli, Trevor G. Mazzucchelli, and Matthew R. Sanders, 85–96. Oxford University Press, 2017. http://dx.doi.org/10.1093/med-psych/9780190629069.003.0006.
Анотація:
Externalizing behavior problems characterized by behaviors such as aggression, destruction of property, and stealing are among the most common childhood adjustment problems and the most reliable predictor of adult mental health problems. This chapter briefly reviews the parenting and family factors that have been implicated in the etiology, maintenance, and exacerbation of these problems. A number of variants of the Triple P—Positive Parenting Program have been developed to address these factors, including individual face-to-face, group, and self-help interventions. These variants are described, and the evidence indicating their effectiveness in reducing externalizing behavior problems is reviewed. It is proposed that a multilevel system population approach in which all variants of Triple P are incorporated and delivered simultaneously by existing services has the potential to achieve a population-level decrease in rates of externalizing behavior problems.
7
Greenlaw, Raymond, H. James Hoover, and Walter L. Ruzzo. "The Circuit Value Problem." In Limits to Parallel Computation. Oxford University Press, 1995. http://dx.doi.org/10.1093/oso/9780195085914.003.0010.
Анотація:
In this chapter we return to the Circuit Value Problem, introduced in Section 4.2. First, we will give the formal proof of Theorem 4.2.2 that CVP is P-complete, which we only sketched previously. Then we will show that a number of useful variants and restricted versions of CVP are also P-complete. Recall the definition of the Circuit Value Problem (Definition 4.2.1) in which given an encoding ᾱ of a Boolean circuit α, a designated output y , and values for the inputs x1,..., xn, we ask if output y of α is TRUE. To show CVP is P-complete under ≤mNC1 reducibility requires showing CVP is in P, and that each language L in P is ≤mNC1 reducible to CVP. It is easy to see that given the encoding ᾱ of a circuit and the values of its inputs, one can compute the value of each gate in a number of steps that is polynomial in the size of α. On a random access machine this can be done in linear time by considering the gates in topological order (which also can be computed in linear time; see Gormen, Leiserson, and Rivest [70], for example). On a deterministic Turing machine the process is a bit more clumsy but can still be done in polynomial time. Pippenger shows that even time O(nlogn) suffices, where n is the length of the encoding of α [284]. Thus, we have the following lemma. Lemma 6.1.1 The Circuit Value Problem is in P. The more difficult step in proving that CVP is P-complete under ≤mNC1 reducibility is showing there is a ≤mNC1 reduction from each language in P to CVP. Ladner proved this by simulating Turing machines with circuits. The idea is as follows. First, recall that for each language L in P, there is a 1-tape Turing machine M that on input x = x1,..., xn halts in time t(n) = nO(1) with output equal to 1 if and only if x is in L. Note that, for each n, the machine M uses at most t(n) space on its tape.
8
Sahoo, Prasanta, Supriyo Roy, and J. Paulo Davim. "Design and Selection of Chemically Deposited Ni-P-W Coatings for Optimum Tribological Behavior." In Surface Engineering Techniques and Applications, 45–72. IGI Global, 2014. http://dx.doi.org/10.4018/978-1-4666-5141-8.ch002.
Анотація:
Chemically deposited nickel coatings possess superior tribological properties such as high hardness, good wear, and corrosion resistance. The quest for improved tribological performance has led to the design and selection of newer variants of these coatings. The present chapter deals with the development of Ni-P-W coating on mild steel substrate and the improvement of tribological characteristics through modification of the coating process parameters. Three coating process parameters, concentration of nickel source, concentration of reducing agent, and concentration of tungsten source along with the annealing temperature, are optimized for minimum friction and wear of the coating. Friction and wear tests are carried out in a multi-tribotester using block on roller configuration under dry conditions. Taguchi-based grey relational analysis is employed for the optimization of this multiple response problem using L27 orthogonal array. Analysis of variance shows that the concentration of nickel source, the interaction between nickel source concentration, and reducing agent concentration, and also the interaction between nickel source concentration and tungsten source concentration have significant influence in controlling the friction and wear behavior of chemically deposited Ni-P-W coating. It is observed that wear mechanism is a mild adhesive in nature. The structural morphology, composition, and phase structure of the coating are studied with the help of Scanning Electron Microscopy (SEM), Energy Dispersive X-Ray analysis (EDX), and X-Ray Diffraction analysis (XRD), respectively.
9
Naifar, Fraj, Mariem Gzara, and Taicir Loukil Moalla. "Scheduling in Flexible Manufacturing Systems." In Handbook of Research on Applied Optimization Methodologies in Manufacturing Systems, 1–19. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-2944-6.ch001.
Анотація:
Flexible manufacturing systems have many advantages like adaptation to changes and reduction of lateness. But flexible machines are expensive. The scheduling is a central functionality in manufacturing systems. Optimizing the job routing through the system, while taking advantage from the flexibility of the machines, aims at improving the system's profitability. The introduction of the flexibility defines a variant of the scheduling problems known as flexible job shop scheduling. This variant is more difficult than the classical job shop since two sub-problems are to be solved the assignment and the routing. To guarantee the generation of efficient schedules in reasonable computation time, the metaheuristic approach is largely explored. Particularly, much research has addressed the resolution of the flexible job shop problem by genetic algorithms. This chapter presents the different adaptations of the genetic scheme to the flexible job shop problem. The solution encodings and the genetic operators are presented and illustrated by examples.
10
Tambouratzis, Tatiana, John Giannatsis, Andreas Kyriazis, and Panayiotis Siotropos. "Applying the Computational Intelligence Paradigm to Nuclear Power Plant Operation." In Research Anthology on Artificial Intelligence Applications in Security, 1507–78. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-7705-9.ch068.
Анотація:
In the guise of artificial neural networks (ANNs), genetic/evolutionary computation algorithms (GAs/ECAs), fuzzy logic (FL) inference systems (FLIS) and their variants as well as combinations, the computational intelligence (CI) paradigm has been applied to nuclear energy (NE) since the late 1980s as a set of efficient and accurate, non-parametric, robust-to-noise as well as to-missing-information, non-invasive on-line tools for monitoring, predicting and overall controlling nuclear (power) plant (N(P)P) operation. Since then, the resulting CI-based implementations have afforded increasingly reliable as well as robust performance, demonstrating their potential as either stand-alone tools, or - whenever more advantageous - combined with each other as well as with traditional signal processing techniques. The present review is focused upon the application of CI methodologies to the - generally acknowledged as - key-issues of N(P)P operation, namely: control, diagnostics and fault detection, monitoring, N(P)P operations, proliferation and resistance applications, sensor and component reliability, spectroscopy, fusion supporting operations, as these have been reported in the relevant primary literature for the period 1990-2015. At one end, 1990 constitutes the beginning of the actual implementation of innovative, and – at the same time – robust as well as practical, directly implementable in H/W, CI-based solutions/tools which have proved to be significantly superior to the traditional as well as the artificial-intelligence-(AI)derived methodologies in terms of operation efficiency as well as robustness-to-noise and/or otherwise distorted/missing information. At the other end, 2015 marks a paradigm shift in terms of the emergent (and, swiftly, ubiquitous) use of deep neural networks (DNNs) over existing ANN architectures and FL problem representations, thus dovetailing the increasing requirements of the era of complex - as well as Big - Data and forever changing the means of ANN/neuro-fuzzy construction and application/performance. By exposing the prevalent CI-based tools for each key-issue of N(P)P operation, overall as well as over time for the given 1990-2015 period, the applicability and optimal use of CI tools to NE problems is revealed, thus providing the necessary know-how concerning crucial decisions that need to be made for the increasingly efficient as well as safe exploitation of NE.
Тези доповідей конференцій з теми "Variantes du problème du p-Centre":
1
Silva, Jardell, Flavio Martins, Maria Silva, and Sérgio Souza. "Algoritmo Genético Aplicado à Solução do Problema p-hub Centro Não Capacitado de Múltiplas Alocações." In Encontro Nacional de Inteligência Artificial e Computacional. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/eniac.2019.9340.
Анотація:
Este trabalho estuda a solução de uma variante do problema p-Hub Centro (pHCP), denominada problema p-Hub Centro não capacitado de múltipla alocação (UMApHCP), usando algoritmo genético híbrido. O problema consiste em definir p hubs em um grafo completo, de forma que o custo máximo de transporte do grafo seja minimizado. Para a geração da população inicial, usa-se a fase de construção da metaheurística GRASP. Além disso, para cada configuração de hub gerada pelo AG, um algoritmo de tempo polinomial é aplicado para determinar a alocação ótima dos nós do grafo. Para avaliar esta implementação, utilizou-se de 2 conjuntos de instâncias, disponíveis na literatura, com até 300 nós e até 40 hubs. Testes computacionais são realizados para comprovar a eficiência da proposta.
2
Curdulino, Raucer, Pedro Yuri Araujo Lima Alves, and Karina Valdivia Delgado. "Sistema para Resolver o Problema de Roteamento de Estoque Baseado em Técnicas de Monte Carlo." In XII Simpósio Brasileiro de Sistemas de Informação. Sociedade Brasileira de Computação, 2016. http://dx.doi.org/10.5753/sbsi.2016.5984.
Анотація:
O Problema de Roteamento de Estoque com Demanda Estocástica (SIRP–Stochastic Inventory Routing Problem) é uma combinação dos problemas de controle de inventários com demandas estocásticas por mercadorias em centros comerciais e do roteamento de veículos utilizados no abastecimento desses centros a partir de um único centro de distribuição. Este trabalho apresenta uma variante do algoritmo proposto por [8] para o SIRP utilizando técnicas de Monte Carlo. O novo algoritmo foiimplementado e comparado ao algoritmo original considerando diversas políticas, tendo demonstrado resultados semelhantes em alguns casos e melhores em outros em termos de eficiência de tempo e custo total da solução. A análise, comparação e avaliação dos algoritmos foram feitas com base em benchmarks de problemas existentes na literatura.
3
Balbino de Souza, Vinícius, and Lehilton Lelis Chaves Pedrosa. "Algoritmos de Aproximação para o Problema de Alocação de p-Terminais e Variantes." In XXV Congresso de Iniciação Cientifica da Unicamp. Campinas - SP, Brazil: Galoa, 2017. http://dx.doi.org/10.19146/pibic-2017-78671.
4
Solov'eva, Anastasiya, Sergey Solov'ev, Leonid Shevcov, and Valeriya Piven'. "ANALYSIS OF RELIABILITY OF FLAT TROUSERS BASED ON P-BLOCKS." In PROBLEMS OF APPLIED MECHANICS. Bryansk State Technical University, 2020. http://dx.doi.org/10.30987/conferencearticle_5fd1ed0352ef87.51750998.
Анотація:
The paper considers an approach to the probabilistic analysis of the reliability of flat trusses based on
p-boxes (probability boxes, p-boxes). Modeling of stochastic parameters in the form of p-blocks is justified for building pavement structures due to significant variability of climatic loads, variations in the physical and mechanical properties of coating materials, installation tolerances and other uncertainties. The advantage of this method is the possibility of using it with incomplete (limited) statistical information - when it is difficult to determine the probability distribution law or the parameters of a random variable. Variants of constructing p-blocks are illustrated for various types of incompleteness of statistical information: for an unknown distribution law using Chebyshev's inequality, for interval estimates of the parameters of random variables, etc. Information is given on the possibility of performing algebraic operations on p-blocks. The probability of no-failure operation with such approaches will be presented as an interval of values. If the interval is too wide (uninformative), the quality of statistical information should be improved by conducting additional tests. The paper presents mathematical models of limiting states taking into account the variability of the basic random variables. The possibility of using the proposed approach in the framework of most practical problems in the construction industry for assessing the safety of statically definable farms is shown. As a result, a formula is given for assessing the reliability of a truss as a conditional mechanical sequential system (in terms of the theory of reliability), taking into account the lack of information about the dependence of its elements. The algorithm for analyzing reliability is considered on a numerical example. The developed approach can be used for other types of statically definable hinge-rod systems.
5
Gurskaya, N. A., and K. V. Kobets. "THE RELATIONSHIP OF POLYMORPHIC VARIANTS OF ESTROGEN RECEPTOR GENES WITH THE DEVELOPMENT OF OSTEOPOROSIS IN THE BELARUSIAN POPULATION." In SAKHAROV READINGS 2021: ENVIRONMENTAL PROBLEMS OF THE XXI CENTURY. International Sakharov Environmental Institute, 2021. http://dx.doi.org/10.46646/sakh-2021-1-245-248.
Анотація:
A violation of the hormonal balance is considered one of the factors affecting the development of osteoporosis (OP). The study of the molecular and genetic aspects of this fact will allow us to select a more effective course of OP therapy in the future. Sex hormones, as activators of the expression of a number of genes that regulate bone metabolism, act indirectly through specific receptors. We considered polymorphic variants of the estrogen receptor genes ESR1 and ESR2, encoding the a and в subunits of the estrogen receptor, respectively. Among the studied polymorphic variants of ESR1 (rs9340799, rs2234693, rs1801132) and ESR2 (rs3020444), we identified an association of the T/T genotype of the ESR1 (PvuII) rs2234693 gene with the risk of developing OP (p=0.026) in the Belarusian population.
6
"Dravet syndrome and Dravet-like phenotype: a systematic review of the SCN1A and PCDH19 variants." In XIII Congresso Paulista de Neurologia. Zeppelini Editorial e Comunicação, 2021. http://dx.doi.org/10.5327/1516-3180.229.
Анотація:
Background: Dravet syndrome (DS) is a rare and severe epileptic syndrome of childhood with a prevalence around 1/40,000 people worldwide. Approximately 80% of patients with DS present SCN1A pathogenic variants, which encodes an alpha subunit of a neural voltage- dependent sodium channel. SCN1A variants were also related to DS. There is a correlation between PCDH19 pathogenic variants, encodes the protocadherin 19, and a similar disease to DS known as DS-like phenotype. Objectives: To clarify the differences between DS and DS-like phenotype according to the SCN1A and PCDH19 variants. Methodology: A review from March/2019 to November/2020 was conducted in PubMed and VHL databases, following PRISMA criteria. Results: 19 studies were included and a significant proportion of patients with DS carrying SCN1A was greater than patients with DS-like phenotype harboring PCDH19 variants (76.6% vs. 23.4%). Considering SCN1A and PCDH19, 47 variants were pathogenic and 12 of uncertain significance; 25% were deletions and 75% were single- nucleotide variants. Autism was predominantly observed in patients with DS-like carrying PCDH19 variants compared to SCN1A variants carriers (62.5% vs. 37.5%, p=0.044). In addition, it was noticed a significant predisposition to hyperthermia during seizures in patients with variants in the PCDH19 (p=0.003). There was no significance differences between both groups and cognitive deficit, ataxia, behavior problems, and motor deficit. Conclusions: The study is the first to point out differences between the DS and DS-like phenotype according to the SCN1A and PCDH19 variants.
7
Gómez, Renzo. "Vertex-disjoint path covers in graphs." In II Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2017. http://dx.doi.org/10.5753/etc.2017.3205.
Анотація:
Seja G um grafo conexo e P um conjunto de caminhos disjuntos nos vértices em G. Dizemos que P é uma cobertura por caminhos se cada vértice de G pertence a algum caminho em P . No problema da cobertura mínima por caminhos, o objetivo é encontrar uma cobertura com o menor número de caminhos. Nesse problema, que é sabido ser NP-difícil, o conjunto P pode conter caminhos triviais. Estudamos uma variante desse problema onde o objetivo é encontrar uma cobertura sem caminhos triviais. Usando a decomposição de Edmonds-Gallai, mostramos que o problema de decidir se um grafo tem tal cobertura pode ser reduzido a um problema de emparelhamento em um grafo bipartido. Além disso, mostramos resultados de inaproximabilidade para ambos os problemas de cobertura: com e sem caminhos triviais.
8
de Weerdt, Mathijs, Michael Albert, Vincent Conitzer, and Koos van der Linden. "Complexity of Scheduling Charging in the Smart Grid." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/658.
Анотація:
The problem of optimally scheduling the charging demand of electric vehicles within the constraints of the electricity infrastructure is called the charge scheduling problem. The models of the charging speed, horizon, and charging demand determine the computational complexity of the charge scheduling problem. We show that for about 20 variants the problem is either in P or weakly NP-hard and dynamic programs exist to compute optimal solutions. About 10 other variants of the problem are strongly NP-hard, presenting a potentially significant obstacle to their use in practical situations of scale. An experimental study establishes up to what parameter values the dynamic programs can determine optimal solutions in a couple of minutes.
9
Suprovych, Tetiana, Mykola Suprovych, Vasyl Bandura, Ihor Chornyi, and Yuliia Perehniak. "BoLA DRB3 gene's polymorphism of Ukrainian cattle breeds in relation to mastitis." In Scientific and practical conference with international participation: "Management of the genetic fund of animals – problems, solutions, outlooks". Scientific Practical Institute of Biotechnologies in Animal Husbandry and Veterinary Medicine, 2023. http://dx.doi.org/10.61562/mgfa2023.58.
Анотація:
The results of studying the polymorphism of the BoLA-DRB3.2 gene and identifying the associations of its alleles with mastitis for three Ukrainian breeds are presented: Black-and-White milk (UBW), Red-and-White milk (URW) and White-Headed (UWH). In 162 UBP cows, 28 alleles were detected, six of which were determined with a frequency of over 5% (55.3% in total). The *22 allele is detected more frequently (12%). Four alleles are reliably associated with mastitis: susceptibility - *24 (P<0.05) and *26 (P<0.01); resistance - *13 (P<0.05) and *22 (P<0.05). For 117 URP cows 22 alleles were detected. Of these, seven were detected with a frequency of more than 5% (64.5% in total). The most common allele was *07 (15.4%). Four alleles were found to be significantly sensitive to mastitis: *07 (P<0.01) and *08 (P<0.05) are associated with the disease, *22 (P<0.001) and *24 (P<0.05) - with mastitis resistance. In 77 UWH blood samples, 28 alleles were detected, seven of which had a frequency of more than 5% (for a total of 59.6%). The most common variant in this population was *24 (12.3%). Two mastitis-sensitive alleles have been conclusively established: *22 variant (P<0.05) is associated with resistance and *24 with susceptibility to the disease (P<0.001). Alleles for which a statistically significant association with predisposition to the disease has been established can be used as DNA markers to improve the selection of cattle in order to create herds resistant to diseases, including mastitis.
10
Shrinidhi, M., T. K. Kaushik Jegannathan, and R. Jeya. "Classification of Imbalanced Datasets Using Various Techniques along with Variants of SMOTE Oversampling and ANN." In International Research Conference on IOT, Cloud and Data Science. Switzerland: Trans Tech Publications Ltd, 2023. http://dx.doi.org/10.4028/p-338i7w.
Анотація:
Using Machine Learning and / or Deep Learning for early detection of diseases can help save people’s lives. AI has already been making progress in healthcare as there are newer and improved software to maintain patient records, produce better imaging for error free diagnosis and treatment. One drawback working with real-life datasets is that they are predominantly imbalanced in nature. Most ML and DL algorithms are defined keeping in mind that the dataset is equally distributed. Working on such imbalanced datasets cause the models to end up having high type-1 and type-2 error which is not ideal in the medical field as it can misdiagnose and be fatal. Handling class imbalance thus becomes a necessity lest the ML/DL model fails to learn and starts memorizing the features and noises belonging to the majority class. PIMA Dataset is one such dataset with imbalances in classes as it contains 500 instances of one type and 268 instances of another type. Similarly, the Wisconsin Breast Cancer (Original) Dataset is also a dataset containing imbalanced data related to breast cancer with a total of 699 instances where 458 instances are of one class (Benign tumor images) while 241 instances belong to the other class (Malignant tumor images). Prediction/detection of onset of diabetes or breast cancer with these datasets would be grossly erroneous and hence the need for handling class imbalance increases. We aim at handling the class imbalance problem in this study using various techniques available like weighted class approach, SMOTE (and its variants) with a simple Artificial Neural Network model as the classifier.