Статті в журналах з теми "Variants of the p-Center problem"
Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Variants of the p-Center problem.
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Variants of the p-Center problem".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
1
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.
2
Eskandari, Marzieh, Bhavika B. Khare, Nirman Kumar, and Bahram Sadeghi Bigham. "Red–Blue k-Center Clustering with Distance Constraints." Mathematics 11, no. 3 (February 2, 2023): 748. http://dx.doi.org/10.3390/math11030748.
Анотація:
We consider a variant of the k-center clustering problem in IRd, where the centers can be divided into two subsets—one, the red centers of size p, and the other, the blue centers of size q, such that p+q=k, and each red center and each blue center must be a distance of at least some given α≥0 apart. The aim is to minimize the covering radius. We provide a bi-criteria approximation algorithm for the problem and a polynomial time algorithm for the constrained problem where all centers must lie on a given line ℓ. Additionally, we present a polynomial time algorithm for the case where only the orientation of the line is fixed in the plane (d=2), although the algorithm works even in IRd by constraining the line to lie in a plane and with a fixed orientation.
3
BAREQUET, GILL, and SARIEL HAR-PELED. "POLYGON CONTAINMENT AND TRANSLATIONAL IN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE 3SUM-HARD." International Journal of Computational Geometry & Applications 11, no. 04 (August 2001): 465–74. http://dx.doi.org/10.1142/s0218195901000596.
Анотація:
The 3SUM problem represents a class of problems conjectured to require Ω(n2) time to solve, where n is the size of the input. Given two polygons P and Q in the plane, we show that some variants of the decision problem, whether there exists a transformation of P that makes it contained in Q, are 3SUM-hard. In the first variant P and Q are any simple polygons and the allowed transformations are translations only; in the second and third variants both polygons are convex and we allow either rotations only or any rigid motion. We also show that finding the translation in the plane that minimizes the Hausdorff distance between two segment sets is 3SUM-hard.
4
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.
5
Wen, Fayuan, Angela Rock, Juan Salomon-Andonie, Gulriz Kurban, Xiaomei Niu, Songping Wang, Xu Zhang, et al. "Genome Wide Association Analysis of Iron Overload in the Trans-Omics for Precision Medicine (TOPMed) Sickle Cell Disease Cohorts." Blood 136, Supplement 1 (November 5, 2020): 52. http://dx.doi.org/10.1182/blood-2020-142809.
Анотація:
Introduction: Transfusional iron (Fe) overload is a significant problem among patients with chronic, transfusion-dependent anemias. Iron overload is an important problem in pediatric sickle cell disease (SCD) patients on chronic transfusion regimens predominantly for primary and secondary prevention of stroke. Coexistent hereditary iron overload conditions contribute to the iron overload phenotype in SCD. For example, the Q248H mutation (rs11568350) in SLC40A1, which encodes ferroportin (FPN), is associated with a mild tendency to increase serum ferritin in the general population and with increased ferritin levels in SCD patients. Nevertheless, the molecular mechanisms underlying the progression to iron overload in SCD patients are poorly understood and more sensitive markers for outcome prediction that can be applied at early clinical stages are lacking. We hypothesize that genetic variation modifies the risk for iron overload in SCD patients and seek to validate previously identified mutation and identify novel genetic markers of iron overload among participants from TOPMed SCD cohorts by performing whole genome sequencing (WGS) association analyses. Methods: The WGS was performed by several national sequencing centers sponsored by NHLBI's TOPMed program at an average depth of 30× using DNA from SCD patient blood samples. Variant calling was performed jointly across TOPMed studies for all samples using the GotCloud pipeline by the TOPMed Informatics Research Center. The TOPMed data Coordinating Center performed quality control for sample identity. The data across the following studies were shared through the database of Genotype and Phenotype (dbGaP) exchange area: Howard PUSH SCD (N=370), OMG SCD (N=636), Walk PHaSST SCD (N=381) and REDS-III Brazil SCD (N=2620) with a total sample size of 4007. The study was approved by the appropriate institutional review boards (IRB) and informed consent was obtained from all participants. Genome Wide Association Analysis of iron overload was carried out using the University of Michigan ENCORE server. We performed single variant tests to test the association of log-transformed serum ferritin levels with single nucleotide variants (SNVs) while adjusting for sex, age, self-reported race, numbers of lifetime red blood transfusions and genetic substructure (PC's 1-10). We used a significance threshold of p<5×10-8 to report anassociation as genome-wide significant for common and rare genetic variants. Results: We first included PUSH SCD, OMG SCD and Walk PHaSST SCD cohorts with 840 serum ferritin samples in the WGS association analyses, which revealed at the genome-wide level a new rare variant rs137929759 (chr7:49538810 (GRCh38.p12), MAF=0.0043532, p=2.25×10−8). A few variants such as rs80097634 in gene AL163195.3 and RNASE11 (Chr14:20579417. MAF=0.050373, p=3.1×10-7) were close to the genome-wide significance level. We confirmed previously identified associations in SLC40A1 for ferritin (rs11568350, Chr2:189565370, MAF = 0.16853, p = 5.2×10−4). We also found several variants in AC105411.1, TJP1 and DCC that were close to genome-wide significance level. Further analysis will be carried out on the cloud-based platform provided by NHLBI BioData Catalyst using data from all the four cohorts to validate the previous analysis and expand to related phenotype such as transferrin, iron-overload status. Discussion: In this study we identified common and rare variants that associate with serum ferritin concentration. The results from this pilot study point to novel gene variants that might contribute to iron overload in SCD patients and serve as new biomarkers. Future analysis is needed to determine whether the identified variants can also help with therapeutics and outcome prediction for early stages of SCD-associated iron overload. Our findings will be useful for the future treatment of SCD patients and design of novel SCD therapeutics. ACKNOWLEDGMENTS: This work was supported by NIH Research Grants (1P50HL118006, and 1R01HL125005). The content is solely the responsibility of the authors and does not necessarily represent the official views of the National Institutes of Health. Disclosures Gordeuk: Imara: Research Funding; Global Blood Therapeutics: Consultancy, Research Funding; CSL Behring: Consultancy, Research Funding; Ironwood: Research Funding; Novartis: Consultancy. Telen:CSL Behring: Membership on an entity's Board of Directors or advisory committees, Research Funding; Forma Therapeutics: Research Funding; Novartis: Consultancy, Membership on an entity's Board of Directors or advisory committees; Pfizer: Consultancy, Membership on an entity's Board of Directors or advisory committees, Research Funding; GlycoMimetics Inc.: Consultancy.
6
Arya, Akschat, Boominathan Perumal, and Santhi Krishnan. "Parallelized solution to the asymmetric travelling salesman problem using central processing unit acceleration." Indonesian Journal of Electrical Engineering and Computer Science 25, no. 3 (March 1, 2022): 1795. http://dx.doi.org/10.11591/ijeecs.v25.i3.pp1795-1802.
Анотація:
<p><span>Travelling salesman problem is a well researched problem in computer science and has many practical applications. It is classified as a NP-hard problem as its exact solution can only be obtained in exponential time unless P = NP. There are different variants of the travelling salesman problem (TSP) and in this paper, asymmetric travelling salesman problem is addressed since this variant is quite often observed in real world scenarios. There are a number of heuristic approaches to this problem which provides approximate solutions in polynomial time, however this paper proposes an exact optimal solution which is accelerated with the help of multi-threading-based parallelization. In order to find the exact optimal solution, we have used the held-karp algorithm involving dynamic programming and to reduce the time taken to find the optimal path, we have used a multi-threaded approach to parallelize the processing of sub-problems by leveraging the central processing unit cores (CPUs). This method is an extension of a well researched solution to the TSP; however, this method shows that solutions to computationally intensive problems involving sub-problems such as the asymmetic travelling salesman problem (ATSP) can be accelerated with the help of modern CPUs.</span></p>
7
SEITBEKOVA, А., and А. AMIRBEKOVA. "PHONETIC VARIANTS OF LOANWORDS." Iasaýı ýnıversıtetіnіń habarshysy 125, no. 3 (September 15, 2022): 37–47. http://dx.doi.org/10.47526/2022-3/2664-0686.03.
Анотація:
Unification of different spelling of words is one of the most important problem in Kazakh linguistics. Especially noticeable is the number of words that occur in different spelling variants, in loanwords from Arabic and Persian origin. The heterogeneity and diversity of the spelling of borrowed words in the practice of writing remains an unsolved problem among linguists. In this regard, the purpose of our study is to identify the reasons for the use of Arabic, Persian words that are written in different versions of the same meaning, and an attempt to designate the main variant when switching to a new Latin alphabet. It is known that different spellings of words often occur between modern literary language and dialects. Regardless of the types of phonetic phenomena found in the dialects of our language, in general they are intertwined with the phonetic development of the Turkic languages. Therefore, the article analyzes the processes of mastering, starting from ancient and medieval Turkic written monuments and the features of the transition to modern Turkic languages. In order to determine the main variant, linguistic and statistical studies of phonetic variants of b/p, p/f are carried out on the basis of the «Large Explanatory Dictionary of the Kazakh literary language». The results of the study can serve in the unification of spelling norms of borrowed words, as well as the necessary linguistic information in the development of various dictionaries.
8
Păun, Gheorghe. "One More Universality Result for P Systems with Objects on Membranes." International Journal of Computers Communications & Control 1, no. 1 (January 1, 2006): 25. http://dx.doi.org/10.15837/ijccc.2006.1.2269.
Анотація:
<p>We continue here the attempt to bridge brane calculi with membrane computing, following the investigation started in [2]. Specifically, we consider P systems with objects placed on membranes, and processed by membrane operations. The operations used in this paper are membrane creation (cre), and membrane dissolution (dis), defined in a way which reminds the operations pino, exo from a brane calculus from [1]. For P systems based on these operations we prove the universality, for one of the two possible variants of the operations; for the other variant the problem remains open.</p>
9
Aksenova, Irina Vasil’evna, Yuliya Igorevna Naumova, and Vladimir Valentinovich Gridyushko. "Perspectives of the contemporary usage of circular locomotive depot buildings." Vestnik MGSU, no. 2 (February 2016): 9–19. http://dx.doi.org/10.22227/1997-0935.2016.2.9-19.
Анотація:
Variants of reshaping the objects of the industrial heritage, including the buildings of transport infrastructure located in central districts of historical towns are analyzed in the article. The evolution of the development of depots for maintaining and repairing the locomotives is represented. The uniqueness of the complex of buildings of Nikolaevskaya Railway in Moscow, an integrated historical and architectural ensemble, is noted. At the present moment one of few preserved buildings is a circular depot in the center of Moscow. The loss of this unique specimen of industrial architecture of the middle of 19th century would be an irreplaceable loss for the cultural heritage of the nation. The only way of its rescue from full destruction is its restoration and inclusion in the contemporary life of the city. The method of possible variants of the contemporary usage of historical building-monuments of the industrial heritage is proposed, which secures their safety on the basis of self-repayment. The preferable variants for reshaping the building of circular depot in Moscow are considered on the basis of qualitative criteria. Keeping in mind the location of the depot near railway stations - the sources of the main contingent being in need of short-term rent - the variant of placing a hotel-touristic center in the depot was chosen. This corresponds to the basic direction of the State Program of the City of Moscow for the period of 2012-2016, which provides the development of the hotel chain at the expense of the reconstruction and the creation of the touristic infrastructure. The authors considered in the article the variant of usage of the depot as a multifunctional hotel complex gives the possibility to solve the problem of shortage of two-stars hotels in the center of Moscow and, what is very important, to preserve the monument in an undistorted appearance.
10
Adamuthe, Amol C., and Smita M. Kagwade. "Hybrid and adaptive harmony search algorithm for optimizing energy efficiency in VMP problem in cloud environment." Decision Science Letters 11, no. 2 (2022): 113–26. http://dx.doi.org/10.5267/j.dsl.2022.1.001.
Анотація:
Data Center energy usage has risen dramatically because of the rapid growth and demand for cloud computing. This excessive energy usage is a challenge from an economic and environmental point. Virtual Machine Placement (VMP) along with virtualization technologies is widely used to manage power utilization in data centers. The assignment of virtual machines to physical machines affects energy consumption. VMP is a process of mapping VMs onto a set of PMs in a data center to minimize total power consumption and maximize resource utilization. The VMP is an NP-hard problem due to its constraints and huge combinations. In this paper, we formulated the problem as a single objective optimization problem in which the objective is to minimize the energy consumption in cloud data centers. The main contribution of this paper is hybrid and adaptive harmony search algorithm for optimal placements of VMs to PMs. HSA with adaptive PAR settings, simulated annealing and local search strategy aims at minimizing energy consumption in cloud data centers with satisfying given constraints. Experiments are conducted to validate the performance of these variations. Results show that these hybrid HSA variations produce better results than basic HSA and adaptive HSA. Hybrid HS with simulated annealing, and local search strategy gives better results than other variants for 80 percent datasets.
11
Ozsoy, Filiz, Ayse F. Nursal, Nevin Karakus, Meral O. Demir, and Serbulent Yigit. "Estrogen Receptor 1 Gene rs22346939 and rs9340799 Variants are Associated with Major Depressive Disorder and its Clinical Features." Current Neurovascular Research 18, no. 1 (August 11, 2021): 12–19. http://dx.doi.org/10.2174/1567202618666210531122239.
Анотація:
Objective: Major Depressive Disorder (MDD) is a major health problem worldwide. Estrogen interacts with the central nervous system and has been shown to affect anxiety and depressive behavior. Estrogen mediates its effects by connecting its receptors, estrogen receptors 1 and 2. The purpose of this case-control study was to clarify the association between MDD risk and estrogen receptor 1 (ESR1) gene variants. Methods: This study included 245 individuals (125 MDD patients and 120 healthy controls). Polymerase Chain Reaction (PCR) and Restriction Fragment Length Polymorphism (RFLP) technics were used for genotypingESR1XbaII (rs9340799) and PvuII (rs22346939) variants. Results: There were statistically significant differences between the groups in terms of genotype frequencies of the ESR1PvuII (-397 T > C) variant (p = 0.049) but not for the XbaII (-351 A > G) variant (p > 0.05). However, a correlation was observed between MDD and ESR1XbaII variant after male participants were excluded (p = 0.028). Also, the high pain score of MDD patients was associated with the ESR1PvuII variant, especially in female patients (p = 0.021). According to the results of combined genotype analysis, AA-TC combined genotype was correlated with a decreased risk in patients with MDD compared to controls (p = 0.016), while the combined genotype of GGCC was associated with increased risk in the patients with MDD compared to controls (p = 0.042). Conclusion: The two ESR1 variants were associated with MDD risk and its features in both individual and combined forms.
12
Lu, Chun, and Xingyi Zhang. "Solving Vertex Cover Problem by Means of Tissue P Systems with Cell Separation." International Journal of Computers Communications & Control 5, no. 4 (November 1, 2010): 540. http://dx.doi.org/10.15837/ijccc.2010.4.2512.
Анотація:
Tissue P systems is a computing model in the framework of membrane computing inspired from intercellular communication and cooperation between neurons. Many different variants of this model have been proposed. One of the most important models is known as tissue P systems with cell separation. This model has the ability of generating an exponential amount of workspace in linear time, thus it allows us to design cellular solutions to NP-complete problems in polynomial time. In this paper, we present a solution to the Vertex Cover problem via a family of such devices. This is the first solution to this problem in the framework of tissue P systems with cell separation.
13
Etemad, Roghayeh, and Behrooz Alizadeh. "Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms." Yugoslav Journal of Operations Research 27, no. 3 (2017): 367–84. http://dx.doi.org/10.2298/yjor160317012e.
Анотація:
This paper is concerned with two variants of the reverse selective center location problems on tree graphs under the Hamming and Chebyshev cost norms in which the customers are existing on a selective subset of the vertices of the underlying tree. The first model aims to modify the edge lengths within a given modification budget until a prespecified facility location becomes as close as possible to the customer points. However, the other model wishes to change the edge lengths at the minimum total cost so that the distances between the prespecified facility and the customers satisfy a given upper bound. We develop novel combinatorial algorithms with polynomial time complexities for deriving the optimal solutions of the problems under investigation.
14
Hu, Zhongbo, Shengwu Xiong, Xiuhua Wang, Qinghua Su, Mianfang Liu, and Zhong Chen. "Subspace Clustering Mutation Operator for Developing Convergent Differential Evolution Algorithm." Mathematical Problems in Engineering 2014 (2014): 1–18. http://dx.doi.org/10.1155/2014/154626.
Анотація:
Many researches have identified that differential evolution algorithm (DE) is one of the most powerful stochastic real-parameter algorithms for global optimization problems. However, a stagnation problem still exists in DE variants. In order to overcome the disadvantage, two improvement ideas have gradually appeared recently. One is to combine multiple mutation operators for balancing the exploration and exploitation ability. The other is to develop convergent DE variants in theory for decreasing the occurrence probability of the stagnation. Given that, this paper proposes a subspace clustering mutation operator, called SC_qrtop. Five DE variants, which hold global convergence in probability, are then developed by combining the proposed operator and five mutation operators of DE, respectively. The SC_qrtop randomly selects an elite individual as a perturbation’s center and employs the difference between two randomly generated boundary individuals as a perturbation’s step. Theoretical analyses and numerical simulations demonstrate that SC_qrtop prefers to search in the orthogonal subspace centering on the elite individual. Experimental results on CEC2005 benchmark functions indicate that all five convergent DE variants with SC_qrtop mutation outperform the corresponding DE algorithms.
15
Luévanos-Rojas, Arnulfo, Victor Manuel Moreno-Landeros, Griselda Santiago-Hurtado, Francisco Javier Olguin-Coca, Luis Daimir López-León, Miguel Ángel Baltazar-Zamora, and Eyran Roberto Diaz-Gurrola. "Mathematical Modeling for the Optimal Cost Design of Circular Isolated Footings with Eccentric Column." Mathematics 12, no. 5 (February 29, 2024): 733. http://dx.doi.org/10.3390/math12050733.
Анотація:
This article shows a model for the design of circular isolated footings and the column placed anywhere in the footing under minimum cost criteria. Some designs for obtaining the diameter, effective depth, and steel areas of the footing under biaxial bending assume the maximum and uniform pressure at the bottom of the footing supported on elastic soils. All these works consider the column placed at the center of the footing. Three numerical problems are given (each problem presents four variants) to determine the lowest cost to design the circular footings under biaxial bending. Problem 1: Column without eccentricity. Problem 2: Column with eccentricity in the direction of the X axis of one quarter of the diameter of the footing. Problem 3: Column placed at the end furthest from the center of the footing on the X axis. The results are verified by the balance of moments, one-way shear or shear and two-way shear or punching. The new model shows a saving of 17.92% in the contact area with soil and of 31.15% in cost compared to the model proposed by other authors. In this way, the proposed minimum cost design model for circular footings will be of great help for the design when the column is placed on the center or edge of the footing.
16
Alfiyah, Fifi, and Yunita Dyah Puspita Santik. "Perilaku Kepatuhan Masyarakat dalam Menerapkan Protokol Kesehatan Covid-19." Indonesian Journal of Public Health and Nutrition 3, no. 1 (March 31, 2023): 29–39. http://dx.doi.org/10.15294/ijphn.v3i1.58130.
Анотація:
Background: The Covid-19 pandemic in Indonesia is a health problem that has not yet ended. Covid-19 cases in Indonesia on 31 May 2022 were 6.054.973 cases. Indonesia ministry of Health informed that SARS-CoV-2 continues to mutate to form new variants. Therefore, efforts are needed to prevent the transmission of Covid-19 through the implementation of the Covid-19 health protocol. The purpose of this studi was to determine the factors related to community adherence in implementing the Covid-19 health protocol in the Karangsari Healthcare Center, Cirebon Regency. Method: This type of research uses an analytical survey with a cross sectional design. The research sampel is 99 respondents, with cluster sampling technique. The instrument used a questionnaire. Data were analyzed by chi square test and logostic regression. Results: The result show that knowledge (P=0,009, RP=1,470) and attitude (P=0,003, RP=1,564) are related to community adherence in implementing the Covid-19 health protocol in the Karangsari Healthcare Center, Cirebon Regency. Conclusion: There is a significant related between knowledge and attitude with adherence in implementing the Covid-19 health protocol. Attitude is the factors that most influence the adherence in implementing the Covid-19 health protocol in the Karangsari Healthcare Center, Cirebon Regency.
17
Pronnikova, T. I., and M. N. Rasskazova. "OPTIMIZATION OF BUSINESS PROCESSES OF CUSTOMER SERVICE IN A MULTI-FUNCTIONAL CENTER BASED ON SIMULATION MODELING." Applied Mathematics and Fundamental Informatics 9, no. 2 (2022): 39–49. http://dx.doi.org/10.25206/2311-4908-2022-9-2-39-49.
Анотація:
This article discusses the problem of building a simulation model of customer service in a multifunctional center providing public and municipal services to optimize business processes. The logical scheme of the simulation model based on UML-diagrams has been developed. A 3D model of customer location and service at the multifunctional center has been created. Experiments have been conducted for different variants of queuing. Proposals for optimizing the work has been developed. The software AnyLogic was used as an implementation tool.
18
Wojtas, Krzysztof, and Piotr Faliszewski. "Possible Winners in Noisy Elections." Proceedings of the AAAI Conference on Artificial Intelligence 26, no. 1 (September 20, 2021): 1499–505. http://dx.doi.org/10.1609/aaai.v26i1.8255.
Анотація:
We consider the problem of predicting winners in elections given complete knowledge about all possible candidates, all possible voters (together with their preferences), but in the case where it is uncertain either which candidates exactly register for the election or which voters cast their votes. Under reasonable assumptions our problems reduce to counting variants of election control problems. We either give polynomial-time algorithms or prove #P-completeness results for counting variants of control by adding/deleting candidates/voters for Plurality, k-Approval, Approval, Condorcet, and Maximin voting rules.
19
Alhazov, Artiom, Rudolf Freund, and Sergiu Ivanov. "When catalytic P systems with one catalyst can be computationally complete." Journal of Membrane Computing 3, no. 3 (August 3, 2021): 170–81. http://dx.doi.org/10.1007/s41965-021-00079-x.
Анотація:
AbstractCatalytic P systems are among the first variants of membrane systems ever considered in this area. This variant of systems also features some prominent computational complexity questions, and in particular the problem of using only one catalyst in the whole system: is one catalyst enough to allow for generating all recursively enumerable sets of multisets? Several additional ingredients have been shown to be sufficient for obtaining computational completeness even with only one catalyst. In this paper, we show that one catalyst is sufficient for obtaining computational completeness if either catalytic rules have weak priority over non-catalytic rules or else instead of the standard maximally parallel derivation mode, we use the derivation mode maxobjects, i.e., we only take those multisets of rules which affect the maximal number of objects in the underlying configuration.
20
Yıldırım, Ümit, and Yusuf Kuvvetli. "Solution of capacitated vehicle routing problem with invasive weed and hybrid algorithms." International Journal of Industrial Engineering Computations 12, no. 4 (2021): 441–56. http://dx.doi.org/10.5267/j.ijiec.2021.4.002.
Анотація:
The vehicle routing problem is widespread in terms of optimization, which is known as being NP-Hard. In this study, the vehicle routing problem with capacity constraints is solved using cost- and time-efficient metaheuristic methods: an invasive weed optimization algorithm, genetic algorithm, savings algorithm, and hybridized variants. These algorithms are tested using known problem sets in the literature. Twenty-four instances evaluate the performance of algorithms from P and five instances from the CMT data set group. The invasive weed algorithm and its hybrid variant with savings and genetic algorithms are used to determine the best methodology regarding time and cost values. The proposed hybrid approach has found optimal P group problem instances with a 2% difference from the best-known solution on average. Similarly, the CMT group problem is solved with about a 10% difference from the best-known solution on average. That the proposed hybrid solutions have a standard deviation of less than 2% on average from BKS indicates that these approaches are consistent.
21
Фролов, Виктор Петрович, та Дмитрий Васильевич Клименко. "АВІАЦІЙНЕ ТРАНСПОРТУВАННЯ РІДИННИХ РАКЕТ-НОСІЇВ". Aerospace Technic and Technology, № 2 (25 березня 2017): 22–25. http://dx.doi.org/10.32620/aktt.2017.2.02.
Анотація:
This paper concerns the problem of liquid propellant launch vehicles delivery to the launch center. The variants of launch vehicles transportation using rail, road and air transport were considered. The key problems of transportation using the aircrafts, such as overloads applied to the launch vehicle attake off and landing, variation of temperature inside the aircraft cargo compartment, difference in pressure inside the launch vehicle propellant tank sand aircraft cargo compartment, were studied. As a result the proposals for avoiding such problems at transportation using aircraft were stated. Also, the transportation using aircraft was selected for delivery of the Cyclone-4 orbital launch vehicle and the block of Taurus-II launch vehicle.
22
Zhao, Yan Ling, and Su Chang Ma. "Research on the Flexible Product Platform Technology of Machining Center." Advanced Materials Research 842 (November 2013): 596–601. http://dx.doi.org/10.4028/www.scientific.net/amr.842.596.
Анотація:
As the main production equipment in the machinery industry, machining center (MC) market is active, it is urgent to enhance its development and design ability. Product platform can be a good solution to this problem. In the constructing process, market segmentation grid of MC was created firstly, variants and part of future uncertainties were identified at the same time. Then the unknown uncertainties related to customer needs were analyzed to find out the key design parameters. Through the mapping between the parameters and structure, the critical flexible modules were determined. Finally, the flexible product platform was constructed by extracting the common and the flexible modules. Keywords: MC; Flexible product platform; Platform planning; Flexible modules
23
Zhbannikov, Ilya, Konstantin Arbeev, Olivia Bagley, Yuriy Loika, Alexander Kulminski, Svetlana Ukraintseva, Eric Stallard, and Anatoliy Yashin. "Using Threshold Regression as an Approach to Incorporate Informative Missingness in Long Life Family Study Data." Innovation in Aging 5, Supplement_1 (December 1, 2021): 668. http://dx.doi.org/10.1093/geroni/igab046.2520.
Анотація:
Abstract Genetics of aging is important since aging is a major risk factor in most diseases. Variables describing physiological state and cognitive functioning that influence morbidity and mortality risks can serve as biomarkers of aging. They change with increasing age and the ways in which these variables change can also influence these risks. Missing data due to dropout or death create problems in longitudinal studies producing biased results especially if the gap between exams is relatively long, as is the case in the Long Life Family Study (LLFS). We applied the threshold regression model to LLFS data to investigate the vitality and its rate, which are conceptualized as latent variables characterizing health and longevity, and to cope with such a problem. We performed genome-wide association study by sex and age groups to discover genetic signals on these phenotypes. We found 11 variants from the DACT2 gene, p-values < 1E-6 and variants rs12151399 (p-value = 8.43E-8, intron variant, gene AGAP1, in females), rs27958 (p-value = 8.39E-8, intron variant, gene ARHGAP26, in males) showing associations with the vitality. Olfactory receptors showed significant enrichment among the group of males over 80 years for the rate of aging phenotype. Results showed that vitality and its rate differ among sex and age groups. This work is an important step toward understanding the processes of aging linking the vitality with individual genetics using data from deceased and living individuals.
24
Cahyaningrum, Ika, and Errick Endra Cita. "Pengendalian Tekanan Darah dengan Black Garlic Varian Bawang Lanang pada Pasien Hipertensi." Jurnal Akademika Baiturrahim Jambi 11, no. 2 (September 15, 2022): 321. http://dx.doi.org/10.36565/jab.v11i2.581.
Анотація:
Cardiovascular disease is a major health problem in the world. Hypertension is one of the most common cardiovascular diseases. Efforts to control and treat hypertension are very important so as not to cause complications. Hypertension control can be done with pharmacological and non-pharmacological therapy. One of the non-pharmacological therapies is black garlic therapy with solo garlic variant. The type of research used is pre experimental with a one-group pretest and post-test design. Researchers analyzed the respondents' blood pressure before and after being given black garlic variant solo garlic therapy for 14 days. The research was carried out in the working area of the Gedangan Village Health Center, Malang Regency from March to June 2022. The population in this study were patients with hypertension in the working area of the Gedangan Health Center. The sampling technique used consecutive sampling with a total sampling of 20 samples. Analysis of the data used by using the paired t test. The results showed that there were differences in blood pressure values after consuming black garlic variants of garlic (systole -value 0.000, diastole -value 0.014). The hope is that the public can use non-pharmacological black garlic therapy, especially the solo garlick variant, as a complementary therapy in controlling blood pressure.
25
Arfat, Yasir, Muhammad Aqeel Ahmad Khan, Poom Kumam, Wiyada Kumam, and Kanokwan Sitthithakerngkiet. "Iterative solutions via some variants of extragradient approximants in Hilbert spaces." AIMS Mathematics 7, no. 8 (2022): 13910–26. http://dx.doi.org/10.3934/math.2022768.
Анотація:
<abstract><p>This paper provides iterative solutions, via some variants of the extragradient approximants, associated with the pseudomonotone equilibrium problem (EP) and the fixed point problem (FPP) for a finite family of $ \eta $-demimetric operators in Hilbert spaces. The classical extragradient algorithm is embedded with the inertial extrapolation technique, the parallel hybrid projection technique and the Halpern iterative methods for the variants. The analysis of the approximants is performed under suitable set of constraints and supported with an appropriate numerical experiment for the viability of the approximants.</p></abstract>
26
Tipka, Martin, Tadeáš Maceček, and Jitka Vašková. "Analysis of Position Effect of Vertical Load-Bearing Elements for Reinforcement of Steel Reinforced Concrete Floor Structures." Key Engineering Materials 976 (March 18, 2024): 11–20. http://dx.doi.org/10.4028/p-jmrgs4.
Анотація:
The paper deals with the problem of stress in the connection detail of vertical supporting structures with a flat slab and possible methods for its analysis. It mainly focuses on the problem of non-axial connection of columns and walls, which is typical for today's architectural designs. The parametric study compares the effect of the distance of the connected vertical support structures on reinforcement in the discontinuity region. Three different computational methods are used to stress analysis of this region - linear Finite Elements Method in SCIA Engineer software, 2D Strut-and-Tie Model and 2D non-linear Finite Elements Method in IDEA StatiCa software. The conclusion of the study is a comparison of the accuracy of different calculation methods and also a comparison of the solved design variants in terms of shear and bending stress and specific form of reinforcement.
27
Alhazov, Artiom, Rudolf Freund, Sergiu Ivanov, and Sergey Verlan. "Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete." Journal of Membrane Computing 3, no. 4 (November 15, 2021): 233–45. http://dx.doi.org/10.1007/s41965-021-00085-z.
Анотація:
AbstractCatalytic P systems are among the first variants of membrane systems ever considered in this area. This variant of systems also features some prominent computational complexity questions, and in particular the problem of using only one catalyst: is one catalyst enough to allow for generating all recursively enumerable sets of multisets? Several additional ingredients have been shown to be sufficient for obtaining even computational completeness with only one catalyst. Last year we could show that the derivation mode $$max_{objects}$$ m a x objects , where we only take those multisets of rules which affect the maximal number of objects in the underlying configuration one catalyst is sufficient for obtaining computational completeness without any other ingredients. In this paper we follow this way of research and show that one catalyst is also sufficient for obtaining computational completeness when using specific variants of derivation modes based on non-extendable multisets of rules: we only take those non-extendable multisets whose application yields the maximal number of generated objects or else those non-extendable multisets whose application yields the maximal difference in the number of objects between the newly generated configuration and the current configuration. A similar computational completeness result can even be obtained when omitting the condition of non-extendability of the applied multisets when taking the maximal difference of objects or the maximal number of generated objects. Moreover, we reconsider simple P system with energy control—both symbol and rule energy-controlled P systems equipped with these new variants of derivation modes yield computational completeness.
28
Feldman, Arthur M., Lilin She, Dennis M. McNamara, Douglas L. Mann, Michael R. Bristow, Alan S. Maisel, Daniel R. Wagner, et al. "Genetic Variants Are Not Associated with Outcome in Patients with Coronary Artery Disease and Left Ventricular Dysfunction: Results of the Genetic Substudy of the Surgical Treatment for Ischemic Heart Failure (STICH) Trials." Cardiology 130, no. 2 (2015): 69–81. http://dx.doi.org/10.1159/000368221.
Анотація:
Objectives and Background: We evaluated the ability of 23 genetic variants to provide prognostic information in patients enrolled in the Genetic Substudy of the Surgical Treatment for Ischemic Heart Failure (STICH) trials. Methods: Patients assigned to STICH Hypothesis 1 were randomized to medical therapy with or without coronary artery bypass grafting (CABG). Those assigned to STICH Hypothesis 2 were randomized to CABG or CABG with left ventricular reconstruction. Results: In patients assigned to STICH Hypothesis 2 (n = 714), no genetic variant met the prespecified Bonferroni-adjusted threshold for statistical significance (p < 0.002); however, several variants met nominal prognostic significance: variants in the β2-adrenergic receptor gene (β2-AR Gln27Glu) and in the A1-adenosine receptor gene (A1-717 T/G) were associated with an increased risk of a subject dying or being hospitalized for a cardiac problem (p = 0.027 and 0.031, respectively). These relationships remained nominally significant even after multivariable adjustment for prognostic clinical variables. However, none of the 23 genetic variants influenced all-cause mortality or the combination of death or cardiovascular hospitalization in the STICH Hypothesis 1 population (n = 532) by either univariate or multivariable analysis. Conclusion: We were unable to identify the predictive genotypes in optimally treated patients in these two ischemic heart failure populations.
29
Kundzer, A. V. "Recommendations on the management of patients with axial spondyloarthritis." Proceedings of the National Academy of Sciences of Belarus, Medical series 16, no. 1 (March 12, 2019): 117–28. http://dx.doi.org/10.29235/1814-6023-2019-16-1-117-128.
Анотація:
Spondyloarthritis is a group of diseases characterized by a primarily chronic, progressive inflammatory process with the affection of the axial skeleton (spine and sacroiliac joints) and peripheral joints having some common etiopathogenetic and clinical signs. The modern concept of spondyloarthritis involves the isolation of predominantly axial and predominantly peripheral variants of the disease. The problem of spondyloarthritis is in the center of attention of the medical community. Studies of the leading rheumatological centers are devoted to the aspects of the onset and development of the disease, therapy and prevention of disease progression. Signifcant progress has been made in the treatment of spondyloarthritis. The article contains the current recommendations on the management of patients with axial spondylitis.
30
Martínez-del-Amor, Miguel Ángel, David Orellana-Martín, Ignacio Pérez-Hurtado, Francis George C. Cabarle, and Henry N. Adorna. "Simulation of Spiking Neural P Systems with Sparse Matrix-Vector Operations." Processes 9, no. 4 (April 14, 2021): 690. http://dx.doi.org/10.3390/pr9040690.
Анотація:
To date, parallel simulation algorithms for spiking neural P (SNP) systems are based on a matrix representation. This way, the simulation is implemented with linear algebra operations, which can be easily parallelized on high performance computing platforms such as GPUs. Although it has been convenient for the first generation of GPU-based simulators, such as CuSNP, there are some bottlenecks to sort out. For example, the proposed matrix representations of SNP systems lead to very sparse matrices, where the majority of values are zero. It is known that sparse matrices can compromise the performance of algorithms since they involve a waste of memory and time. This problem has been extensively studied in the literature of parallel computing. In this paper, we analyze some of these ideas and apply them to represent some variants of SNP systems. We also provide a new simulation algorithm based on a novel compressed representation for sparse matrices. We also conclude which SNP system variant better suits our new compressed matrix representation.
31
ШВЕДЧИКОВА, І. О., and Ю. А. РОМАНЧЕНКО. "Research of influence of working area geometric dimensions on spatial distribution of magnetic field inside the matrix of a polygradient separator." Journal of Electrical and power engineering 14, no. 1 (February 27, 2020): 13–20. http://dx.doi.org/10.31474/2074-2630-2020-1-13-20.
Анотація:
The possibility of application of the Infolytica software package to solve the main tasks of work is substantiated. The computer 3D-model of electromagnetic separator was verified by solving of test problem. Comparison of results of magnetic induction research for characteristic points obtained during 3D modeling of electromagnetic separator with data obtained during experimental research showed a fairly high consistency. An analysis of geometric dimensions influence on distribution of magnetic field in a polygradient matrix was carried out for a random sampling containing three structural variants of an electromagnetic separator, the working air gap of which varies over a wide range. It is shown that determination of magnetic flux distribution for other structural variants of matrix that located inside sampling can be carried out by interpolation. For selected variants, three-dimensional computer models of electromagnetic separator are developed, their geometric characteristics and physical properties are described. A numerical-field analysis of magnetic field spatial distribution in working air gap of polygradient matrix of electromagnetic separator was carried out using Magnet module of Infolytica software package. For three three-dimensional models of electromagnetic system of separator, numerical values of magnetic induction and magnetic flux in working air gap of polygradient matrix in center of characteristic area are obtained. The obtained results for three models are compared and variant with rational parameters of working area of separator matrix is selected
32
Shmatov M. L. "On the problem of acceleration of fast ignition thermonuclear targets with two cones." Technical Physics 92, no. 5 (2022): 578. http://dx.doi.org/10.21883/tp.2022.05.53673.137-21.
Анотація:
The problems of acceleration of fast ignition thermonuclear targets with two cones for their high-precision injection into region near the center of the reactor chamber are considered and the possibility of solution of these problems is shown. A brief review of discussed variants of such targets and of their main advantages, related to ignition of microexplosion and simplicity of providing preservation of targets workability during their flight in the reactor chamber, is presented. Fast ignition by microexplosion of two-sided cone target and the method to estimate acceptable speed of stabilizing rotation of thermonuclear target are proposed. Keywords: controlled thermonuclear fusion, inertial confinement, fast ignition, two-sided cone targets, spin stabilization of flight.
33
Shnayder, Natalia A., Violetta V. Grechkina, Vera V. Trefilova, Mikhail Ya Kissin, Ekaterina A. Narodova, Marina M. Petrova, Mustafa Al-Zamil, Natalia P. Garganeeva, and Regina F. Nasyrova. "Ethnic Aspects of Valproic Acid P-Oxidation." Biomedicines 12, no. 5 (May 8, 2024): 1036. http://dx.doi.org/10.3390/biomedicines12051036.
Анотація:
The safety of the use of psychotropic drugs, widely used in neurological and psychiatric practice, is an urgent problem in personalized medicine. This narrative review demonstrated the variability in allelic frequencies of low-functioning and non-functional single nucleotide variants in genes encoding key isoenzymes of valproic acid β-oxidation in the liver across different ethnic/racial groups. The sensitivity and specificity of pharmacogenetic testing panels for predicting the rate of metabolism of valproic acid by P-oxidation can be increased by prioritizing the inclusion of the most common risk allele characteristic of a particular population (country).
34
Vasumathi, D., and Thangavelu S. "Scalarizing functions in solving multi-objective problem-an evolutionary approach." Indonesian Journal of Electrical Engineering and Computer Science 13, no. 3 (March 1, 2019): 974. http://dx.doi.org/10.11591/ijeecs.v13.i3.pp974-981.
Анотація:
<p><span>Scalarizing functions had long been observed for optimization of multi-objective problems. Scalarizing functions on multi-objective problem along with Differential Evolution (DE) algorithm variants had been used to analyze the effect of scalarizing functions. The main purpose is to find the better scalarizing function which can be applied for optimization. The effective solution of the multi-objective problem depends on the various factors like the DE algorithm and the scalarizing functions used. Multi objective evolutionary algorithm (MOEA) framework in java had been used for performing the analysis. The Obtained results showed that Tchebysheff scalarization function performs better than the other scalarizing functions on various indicator functions used.</span></p>
35
Fekete, Sándor P., Andreas Haas, Phillip Keldenich, Michael Perk, and Arne Schmidt. "Computing Area-Optimal Simple Polygonizations." ACM Journal of Experimental Algorithmics 27 (December 31, 2022): 1–23. http://dx.doi.org/10.1145/3503607.
Анотація:
We consider methods for finding a simple polygon of minimum ( Min-Area ) or maximum ( Max-Area ) possible area for a given set of points in the plane. Both problems are known to be NP-hard; at the center of the recent CG Challenge, practical methods have received considerable attention. However, previous methods focused on heuristic methods, with no proof of optimality. We develop exact methods, based on a combination of geometry and integer programming. As a result, we are able to solve instances of up to \( n=25 \) points to provable optimality. While this extends the range of solvable instances by a considerable amount, it also illustrates the practical difficulty of both problem variants.
36
Li, Juan, Dan-dan Xiao, Hong Lei, Ting Zhang, and Tian Tian. "Using Cuckoo Search Algorithm with Q-Learning and Genetic Operation to Solve the Problem of Logistics Distribution Center Location." Mathematics 8, no. 2 (January 21, 2020): 149. http://dx.doi.org/10.3390/math8020149.
Анотація:
Cuckoo search (CS) algorithm is a novel swarm intelligence optimization algorithm, which is successfully applied to solve some optimization problems. However, it has some disadvantages, as it is easily trapped in local optimal solutions. Therefore, in this work, a new CS extension with Q-Learning step size and genetic operator, namely dynamic step size cuckoo search algorithm (DMQL-CS), is proposed. Step size control strategy is considered as action in DMQL-CS algorithm, which is used to examine the individual multi-step evolution effect and learn the individual optimal step size by calculating the Q function value. Furthermore, genetic operators are added to DMQL-CS algorithm. Crossover and mutation operations expand search area of the population and improve the diversity of the population. Comparing with various CS algorithms and variants of differential evolution (DE), the results demonstrate that the DMQL-CS algorithm is a competitive swarm algorithm. In addition, the DMQL-CS algorithm was applied to solve the problem of logistics distribution center location. The effectiveness of the proposed method was verified by comparing with cuckoo search (CS), improved cuckoo search algorithm (ICS), modified chaos-enhanced cuckoo search algorithm (CCS), and immune genetic algorithm (IGA) for both 6 and 10 distribution centers.
37
Polyakova, Natalia M. "Initial Boundary Value Problem of the Flow in a Blood Vessel." UNIVERSITY NEWS. NORTH-CAUCASIAN REGION. NATURAL SCIENCES SERIES, no. 4-1 (216-1) (December 28, 2022): 42–54. http://dx.doi.org/10.18522/1026-2237-2022-4-1-42-54.
Анотація:
The solution of the initial boundary value problem for a system of two quasi-linear hyperbolic equations, which describes a rotationally symmetric vortex-free flow of a viscous incompressible fluid in an infinite cylindrical domain (pipe, blood vessel) is constructed. It is assumed that the side surface of the domain is a free (soft, compliant) boundary on which the kinematic condition is set. The dynamic condition at the boundary is modeled by some constitutive relation – the dependence of the pressure P on the cross-sectional area S of the cylindrical domain. To study the flow an asymptotic model based on the shallow water theory is used. When constructing the solution of the initial-boundary (as well as initial and boundary) problem for a system of two quasilinear partial differential equations of the first order, the hodograph method based on the conservation law is used. A variant of the polynomial constitutive relation is chosen for the study: P~S2β (β>0). In the case of the initial data problem which specified at the initial time the Riemann-Green function, allowing to construct an implicit analytical solution, and an algorithm (numerical) for constructing an explicit solution of the original problem are given. The main attention is focused on the special case P~S2, for which all the formulas necessary to construct a solution are written in explicit form. For P~S2, several variants of conditions (initial and boundary value) are considered for the initial boundary value problem, which allow us to trace the evolution of the solution in detail. Numerical calculations demonstrating the motion of shock waves and wave fronts are given. The results obtained, in practice, can be used to describe flows in blood vessels, as well as reliable tests for testing compu tational algorithms intended to solve such problems, in particular, systems of quasi-linear hyperbolic equations.
38
Lin, Min-Sheng. "Counting dominating sets in generalized series-parallel graphs." Discrete Mathematics, Algorithms and Applications 11, no. 06 (December 2019): 1950074. http://dx.doi.org/10.1142/s1793830919500745.
Анотація:
Counting dominating sets in a graph is a #P-complete problem even in planar graphs. This paper studies this problem for generalized series-parallel graphs, which are a subclass of planar graphs. This work develops some linear-time algorithms for counting dominating sets and their two variants, independent dominating sets and connected dominating sets in generalized series-parallel graphs.
39
Kurniawati, Eighty Mardiyan, Innas Safira Putri, Deandra Maharani Widiatmaja, Venansya Maulina Praba, Visuddho Visuddho, Faida Ufaira Prameswari, Marsha Zahrani, Felix Nugraha Putra, David Nugraha, and Antonio Ayrton Widiastara. "Effectiveness of convalescent plasma therapy for COVID-19 patients infected with variants of concerns." Anaesthesia, Pain & Intensive Care 26, no. 4 (August 21, 2022): 535–45. http://dx.doi.org/10.35975/apic.v26i4.1962.
Анотація:
COVID-19 cases in Indonesia seemed to be increasing by each passing day at the time of writing this review, more positive cases discovered than the recovered ones. With the highest rank within all ASEAN countries, and also a home of many variants of COVID-19, Indonesia had become a break off destination to others. Along with the problem associated with the pandemic, which all people had to face, the purpose of this review is to elaborate the use of convalescent plasma therapy on treatment against COVID-19, especially its different variants. We overview the evidence that we obtained from several databases using specific keywords. A large amount of evidence points out that the convalescent plasma therapy has shown a promising outcome against COVID-19 infection, as it did for infectious diseases. Although in COVID-19 variants of concern, convalescent plasma therapy showed a reduction in neutralization ~ 3-fold against P.1, and 7-13 folds against B.1.351 variant, it still can be used as a treatment for COVID-19 and its variants.
Abbreviations: PPE - personal protective equipment; VoC - Variants of concern; VoI - Variants of interest; CPT - convalescent plasma therapy; RBD - receptor-binding domain; ARDS - Acute Respiratory Distress Syndrome; ICU - Intensive Care Unit; IQR - Interquartile Range; RCT - Randomized Clinical Trial; RT-PCR - Reverse Transcriptase-Polymerase Chain Reaction; NAbs - neutralizing antibodies
Key words: Convalescent plasma therapy; COVID-19, Variants of Concern
Citation: Kurniawati EM, Putri IS, Widiatmaja DM, Praba VM, Visuddho 2, Prameswari FU, Zahrani M, Putra FN, Nugraha D, Widiastara AA. Effectiveness of convalescent plasma therapy for COVID-19 patients infected with variants of concerns. Anaesth. pain intensive care 2022;26(4):535-545; DOI: 10.35975/apic.v26i4.1962
Received: July 31, 2021; Reviewed: May 17, 2022; Accepted: May 18, 2022
40
Sarkar, Biswajit, Muhammad Tayyab, and Seok-Beom Choi. "Product Channeling in an O2O Supply Chain Management as Power Transmission in Electric Power Distribution Systems." Mathematics 7, no. 1 (December 20, 2018): 4. http://dx.doi.org/10.3390/math7010004.
Анотація:
With the aim of delivering goods and services to customers, optimal delivery channel selection is a significant part of supply chain management. Several heuristics have been developed to solve the variants of distribution center allocation and vehicle routing problems. In reality, small-scale suppliers cannot afford research and development departments to optimize their distribution networks. In this context, this research work develops a model for an online to offline (O2O) supply chain management network of a small-scale household electric components manufacturer for delivering goods to its distribution centers and retailers. Retailers are acquired by the company through investment in the O2O channel of e-commerce. Electric power transmission and distribution is considered as representative of the product distribution network. A model is developed using a combination of the supply chain management technique and power transmission terminologies. The constrained linear programming model is solved through the linear programming tool of the LINGO optimization software and the global optimum results for the proposed quantity allocation problem are achieved. A numerical experiment is provided to illustrate the practical applicability of the model and the optimal results are analyzed for model robustness.
41
Panyanak, Bancha, Chainarong Khunpanuk, Nattawut Pholasa, and Nuttapol Pakkaranang. "A novel class of forward-backward explicit iterative algorithms using inertial techniques to solve variational inequality problems with quasi-monotone operators." AIMS Mathematics 8, no. 4 (2023): 9692–715. http://dx.doi.org/10.3934/math.2023489.
Анотація:
<abstract><p>The theory of variational inequalities is an important tool in physics, engineering, finance, and optimization theory. The projection algorithm and its variants are useful tools for determining the approximate solution to the variational inequality problem. This paper introduces three distinct extragradient algorithms for dealing with variational inequality problems involving quasi-monotone and semistrictly quasi-monotone operators in infinite-dimensional real Hilbert spaces. This problem is a general mathematical model that incorporates a set of applied mathematical models as an example, such as equilibrium models, optimization problems, fixed point problems, saddle point problems, and Nash equilibrium point problems. The proposed algorithms employ both fixed and variable stepsize rules that are iteratively transformed based on previous iterations. These algorithms are based on the fact that no prior knowledge of the Lipschitz constant or any line-search framework is required. To demonstrate the convergence of the proposed algorithms, some simple conditions are used. Numerous experiments have been conducted to highlight the numerical capabilities of algorithms.</p></abstract>
42
Gao, Mingqiang, and Xu Yang. "APSO-SL: An Adaptive Particle Swarm Optimization with State-Based Learning Strategy." Processes 12, no. 2 (February 17, 2024): 400. http://dx.doi.org/10.3390/pr12020400.
Анотація:
Particle swarm optimization (PSO) has been extensively used to solve practical engineering problems, due to its efficient performance. Although PSO is simple and efficient, it still has the problem of premature convergence. In order to address this shortcoming, an adaptive particle swarm optimization with state-based learning strategy (APSO-SL) is put forward. In APSO-SL, the population distribution evaluation mechanism (PDEM) is used to evaluate the state of the whole population. In contrast to using iterations to just the population state, using the population spatial distribution is more intuitive and accurate. In PDEM, the population center position and best position for calculation are used for calculation, greatly reducing the algorithm’s computational complexity. In addition, an adaptive learning strategy (ALS) has been proposed to avoid the whole population’s premature convergence. In ALS, different learning strategies are adopted according to the population state to ensure the population diversity. The performance of APSO-SL is evaluated on the CEC2013 and CEC2017 test suites, and one engineering problem. Experimental results show that APSO-SL has the best performance compared with other competitive PSO variants.
43
van Beek, Jenny H. D. A., Gonneke Willemsen, Marleen H. M. de Moor, Jouke Jan Hottenga, and Dorret I. Boomsma. "Associations Between ADH Gene Variants and Alcohol Phenotypes in Dutch Adults." Twin Research and Human Genetics 13, no. 1 (February 1, 2010): 30–42. http://dx.doi.org/10.1375/twin.13.1.30.
Анотація:
AbstractRecently, Macgregor et al. (2009) demonstrated significant associations of ADH polymorphisms with reactions to alcohol and alcohol consumption measures in an Australian sample. The aim of the present study was to replicate these findings in a Dutch sample. Survey data on alcohol phenotypes came from 1,754 unrelated individuals registered with the Netherlands Twin Register. SNPs in the ADH gene cluster located on chromosome 4q (n= 491) were subdivided in seven gene sets: ADH5, ADH4, ADH6, ADH1A, ADH1B, ADH1C and ADH7. Within these sets associations of SNPs with alcohol consumption measures, age at onset variables, reactions to alcohol and problem drinking liability were examined. Of the original 38 SNPs studied by Macgregor et al. (2009), six SNPs were not available in our dataset, because one of them had a minor allele frequency < .01 (rs1229984) and five could not be imputed. The remaining SNP associations with alcohol phenotypes as identified by Macgregor et al. (2009) were not replicated in the Dutch sample, after correcting for multiple genotype and phenotype testing. Significant associations were found however, for reactions to alcohol with a SNP in ADH5 (rs6827292,p= .001) and a SNP just upstream of ADH5 (rs6819724,p= .0007) that is in strong LD with rs6827292. Furthermore, an association between age at onset of regular alcohol use and a SNP just upstream of ADH7 (rs2654849,p= .003) was observed. No significant associations were found for alcohol consumption and problem drinking liability. Although these findings do not replicate the earlier findings at the SNP level, the results confirm the role of the ADH gene cluster in alcohol phenotypes.
44
Rădulescu, Vicenţiu D. "Nontrivial solutions for a multivalued problem with strong resonance." Glasgow Mathematical Journal 38, no. 1 (January 1996): 53–59. http://dx.doi.org/10.1017/s0017089500031256.
Анотація:
The Mountain-Pass Theorem of Ambrosetti and Rabinowitz (see [1]) and the Saddle Point Theorem of Rabinowitz (see [21]) are very important tools in the critical point theory of C1-functional. That is why it is natural to ask us what happens if the functional fails to be differentiable. The first who considered such a case were Aubin and Clarke (see [6]) and Chang (see [12]),who gave suitable variants of the Mountain-Pass Theorem for locally Lipschitz functionals which are denned on reflexive Banach spaces. For this aim they replaced the usual gradient with a generalized one, which was firstly defined by Clarke (see [13], [14]).As observed by Brezis (see [12, p. 114]), these abstract critical point theorems remain valid in non-reflexive Banach spaces.
45
Bierzeņš, Aņss Ataols. "„f“ AND „h“ LETTERS' PROBLEM IN LATGALIAN LANGUAGE." Via Latgalica, no. 3 (December 31, 2010): 51. http://dx.doi.org/10.17770/latg2010.3.1671.
Анотація:
<p>In the article is told about the problem of letters’ (and sounds’) f and h in Latgalian language. These sounds have never been in any Latgalian dialect, in foreign words speakers always have been replaced them with other sounds. At the same time letters f and h have been used in written Latgalian at all times: from the first known book „Evangelia toto anno“ to the present day. What to do in this situation: to keep the way of the still alive traditional spoken language, or to yield to the pressure of other languages?</p><p>The author analyzes a variety of sources: tells about reconstructions of source languages and opinions of their researchers about presence/absence of these sounds in them, deals with f in contemporary Eurasian languages (Eastern Slavic: Russian, Ukrainian, Belarusian; Finnic: Finnish, Estonian, Vyru; Turkic: Kyrgyz, Kazakh, Chuvash, Yakut; Persian: Pashto; Baltic: Lithuanian, Samogitian) and h in contemporary Eurasian languages (French, Kazakh, Lithuanian, Samogitian). Latgalian and Latvian dialects’ recordings, folk songs, ancient texts (from XVI–XVIII centuries), as well as Latgalian contemporary literature are analyzed. The author also evaluates inclusion of letters f and h in alphabet of the official Latgalian terms of spelling in year 2007.</p><p>Author establishes that there are five possible paths:</p><p>1) to use the f and h in all the words where they are in Latvian, Russian or other languages;</p><p>2) to keep p, k, g and c in traditionally used words, but to put f and h in newly borrowed ones;</p><p>3) do not use the f and h at all;</p><p>4) to use both variants parallely in the same words;</p><p>5) to write f and h, but to pronounce them as p and k.</p><p>Author concludes that the actualy usable are only two of them: the second one – the way of a compromise, and the third one – as the most appropriate to Latgalian phonological system.</p>
46
MENKE, JOSHUA, and TONY MARTINEZ. "IMPROVING SUPERVISED LEARNING BY ADAPTING THE PROBLEM TO THE LEARNER." International Journal of Neural Systems 19, no. 01 (February 2009): 1–9. http://dx.doi.org/10.1142/s0129065709001793.
Анотація:
While no supervised learning algorithm can do well over all functions, we show that it may be possible to adapt a given function to a given supervised learning algorithm so as to allow the learning algorithm to better classify the original function. Although this seems counterintuitive, adapting the problem to the learner may result in an equivalent function that is "easier" for the algorithm to learn. One method of adapting a problem to the learner is to relabel the targets given in the training data. The following presents two problem adaptation methods, SOL-CTR-E and SOL-CTR-P, variants of Self-Oracle Learning with Confidence-based Target Relabeling (SOL-CTR) as a proof of concept for problem adaptation. The SOL-CTR methods produce "easier" target functions for training artificial neural networks (ANNs). Applying SOL-CTR over 41 data sets consistently results in a statistically significant (p < 0.05) improvement in accuracy over 0/1 targets on data sets containing over 10,000 training examples.
47
Mewes, Caspar, Tessa Alexander, Benedikt Büttner, José Hinz, Ayelet Alpert, Aron-F. Popov, Tim Beißbarth, et al. "Effect of the Lymphocyte Activation Gene 3 Polymorphism rs951818 on Mortality and Disease Progression in Patients with Sepsis—A Prospective Genetic Association Study." Journal of Clinical Medicine 10, no. 22 (November 15, 2021): 5302. http://dx.doi.org/10.3390/jcm10225302.
Анотація:
(1) Background: Sepsis is a leading cause of death and a global public health problem. Accordingly, deciphering the underlying molecular mechanisms of this disease and the determinants of its morbidity and mortality is pivotal. This study examined the effect of the rs951818 SNP of the negative costimulatory lymphocyte-activation gene 3 (LAG-3) on sepsis mortality and disease severity. (2) Methods: 707 consecutive patients with sepsis were prospectively enrolled into the present study from three surgical ICUs at University Medical Center Goettingen. Both 28- and 90-day mortality were analyzed as the primary outcome, while parameters of disease severity served as secondary endpoints. (3) Results: In the Kaplan–Meier analysis LAG-3 rs951818 AA-homozygote patients showed a significantly lower 28-day mortality (17.3%) compared to carriers of the C-allele (23.7%, p = 0.0476). In addition, these patients more often received invasive mechanical ventilation (96%) during the course of disease than C-allele carriers (92%, p = 0.0466). (4) Conclusions: Genetic profiling of LAG-3 genetic variants alone or in combination with other genetic biomarkers may represent a promising approach for risk stratification of patients with sepsis. Patient-individual therapeutic targeting of immune checkpoints, such as LAG-3, may be a future component of sepsis therapy. Further detailed investigations in clinically relevant sepsis models are necessary.
48
Al Hariri Mahmoud Jomaa, S. Semenenko, A. Semenenko, and Sergey Zaikov. "Clinical and epidemicological characteristics of acute rinosinusite by medical document recommended by multidisciplinary polyclinics." OTORHINOLARYNGOLOGY, no. 2(1) 2018 (June 11, 2018): 24–31. http://dx.doi.org/10.37219/2528-8253-2018-2-24.
Анотація:
Introduction. Despite the world practice, the problem of inflammatory diseases of the paranasal sinuses is still relevant and has an important social meaning. Despite the fact that rhinosinusitis is one of the most common diseases, the reisvery little accurate data on its epidemiology. Therefore, our goal was to conduct a clinical epidemiological analysis with the establishment of the role of rhinosinusitis in the structure of requests for medical care in multidisciplinary polyclinics. Materials and methods. The data on the prevalence of various forms of sinusitis in the structure of ambulatory-polyclinic patients in the period 2011-2015 have been studied. In patients with acute rhinosinusitis, the following parameters were analyzed: gender and age of patients, duration, clinical variant of the disease, duration of treatment. Results. A clinical and statistical analysis of medical aid appeals at the level of the multidisciplinary outpatient clinic of the Vinnytsia City Clinical Hospital of ambulatory care and the Communal Medical Center "City Medical and Diagnostic Center" of Vinnytsia during 2011-2015. A statistical analysis based on the criterion approach included 896 patients with rinosunsitis. The following parameters have been analyzed: gender and age of patients, duration, clinical variant of the disease, duration of treatment. The conducted researches indicate that in the structure of appeals to the otolaryngologist rhinosinusitis is dominated by acute rhinosinusitis, the frequency of which remained relatively stable for five consecutive years: 133 cases - in 2011, 143 in 2012, 168 in 2013, 150 and 151 in 2014 and 2015, respectively. Among ambulatory polyclinic patients with different clinical variants of sinusitis prevailing persons of young working age. In general, patients with acute bacterial rhinosinusitis in the age group up to 60 years old make up 90.6%, which emphasizes the socioeconomic significance of this pathology. The frequency of treatment with rhinosinusitis is dominated by maxillary sinus lesions. The median duration of treatment was greatest in the case of hemi-sinusitis and polysynytes – 11.27±3.69 and 11.23±3.99 days, respectively, and the lowest in patients with frontal lobe was 9.48±3,76 days (p=0.032). A reduction in the mean duration of treatment for patients during the last three years of observation was observed (p<0.001). Conclusions: The study of the main clinical and epidemiological indicators of rhinosinusitis in the Ukrainian population can be the basis for the in for medplanning of medical care and social activities for this category of otolaryngological patients.
49
Defant, Colin. "On ranges of variants of the divisor functions that are dense." International Journal of Number Theory 11, no. 06 (August 26, 2015): 1905–12. http://dx.doi.org/10.1142/s1793042115500827.
Анотація:
For a real number t, let st be the multiplicative arithmetic function defined by [Formula: see text] for all primes p and positive integers α. We show that the range of a function s-r is dense in the interval (0, 1] whenever r ∈ (0, 1]. We then find a constant ηA ≈ 1.9011618 and show that if r > 1, then the range of the function s-r is a dense subset of the interval [Formula: see text] if and only if r ≤ ηA. We end with an open problem.
50
Rubanik, L. V., and N. N. Poleshchuk. "Analysis of the problem of molecular identification of wild (wtCT), plasmidless (p-CT) and Swedish (SE-nvCT) variants of Chlamydia trachomatis in Belarus." Proceedings of the National Academy of Sciences of Belarus, Biological Series 69, no. 1 (February 8, 2024): 68–78. http://dx.doi.org/10.29235/1029-8940-2024-69-1-68-78.
Анотація:
To date, it is known that the population of Chlamydia trachomatis is genetically heterogeneous. Along with the originally described wild type (wtCT), mutant variants (mtCT) have been found in the world: plasmidless (p-CT), Swedish (SE-nvCT), Mexican (MX-nvCT), Finnish (FI-nvCT), with different virulence and tropicity to various organs and tissues. These variants may escape PCR diagnostics due to the absence of targets or the occurrence of changes in them, which makes it ineffective to use a number of diagnostic test systems for pathogen detection.Isolates of C. trachomatis collected on the territory of the Republic of Belarus during the period 2013–2022 in reproductive age persons with inflammatory urogenital tract diseases were analyzed. It was found that the dominant pathogen genovariant is the wild type wtCT ‒, approximately 93 %. Mutant strains that make up about 7 % of the pathogen population are represented by p-CT and SE-nvCT genovariants. There were no cases of identification of MX-nvCT and FI-nvCT genovariants in the analyzed sample of C. trachomatis isolates.It is necessary to further optimize the tactics of molecular biological identification of various C. trachomatis genovariants for effective microorganism detection and study of the chlamydial urogenital infection pathogenesis.