检索结果-内蒙古大学图书馆

A two-phase service single server Morkovian queue under N-policy with a fuzzy environment

学校读者我要写书评

暂无评论

AIP Conference Proceedings 2024年第1期2512卷

作者： B. V. S. N. Hari Prasad Hanumantha Rao Sama Vasanta Kumar Vemuri Satish Kumar Kalapala Dhanekula Institute of Engineering &Technology Department of Basic sciences and Humanities Ganguru Vijayawada Krishna(Dt) Andhra Pradesh India-521139 Vignan’s Foundation for Science Technology and Research Department of Management Studies Vadlamudi Guntur (Dt) 522 213 Andhra Pradesh India Koneru Lakshmaiah EducationFoundation Department of Mathematics Vaddeswaram Guntur (Dt) 522 502 Andhra Pradesh India Department of Statistics KRU Dr.MRAR PG Centre Nuzvid Krishna (Dt) Andhrapradesh521201 India

In this paper a controllable two-phase service single server Morkovian queue under N-policy is examined. The queue parameters and cost elements are assumed as Fuzzy numbers. Parametric nonlinear programming problems are developed based on the a-cuts and Zadeh’s extension principle to determine the bounds of the minimum estimated cost per unit time(MEC) at the possibility level a. By considering the system parameters and cost elements as trapezoidal fuzzy numbers, numerical values for the bounds to the optimal threshold N and the MEC are computed by solving the nonlinear programming problems through MATLAB.

关键词：

On Integer Partitions and Continued Fraction Type Algorithms

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Baalbaki, Wael Bonanno, Claudio Del Vigna, Alessio Garrity, Thomas Isola, Stefano Fu Foundation School of Engineering and Applied Sciences Columbia University United States Dipartimento di Matematica Università di Pisa Largo Bruno Pontecorvo 5 PisaI-56127 Italy Department of Mathematics and Statistics Williams College WilliamstownMA01267 United States Scuola di Scienze e Tecnologie Università di Camerino via Madonna delle Carceri CamerinoI-62032 Italy

Our goal is to show that the additive-slow-Farey version of the Triangle map (a type of multidimensional continued fraction algorithm) gives us a method for producing a map from the set integer partitions of a positive number n into itself. We start by showing that the additive-slow-Farey version of the traditional continued fractions algorithm has a natural interpretation as a method for producing integer partitions of a positive number n into two smaller numbers, with multiplicity. We provide a complete description of how such integer partitions occur and of the conjugation for the corresponding Young shapes via the dynamics of the classical Farey tree. We use the dynamics of the Farey map to get a new formula for p(2, n), the number of ways for partitioning n into two smaller positive integers, with multiplicity. We then turn to the general case, using the the Triangle map to give a natural map from general integer partitions of a positive number n to integer partitions of n. This map will still be compatible with conjugation of the corresponding Young shapes. We will close by the observation that it appears few other multi-dimensional continued fraction algorithms can be used to study *** Codes 11P81, 11J70, 37E05 © 2021, CC BY-NC-SA.

关键词： Additives

Post-processing of MCMC

学校读者我要写书评

暂无评论

arXiv 2021年

作者： South, Leah F. Riabiz, Marina Teymur, Onur Oates, Chris J. School of Mathematical Sciences Queensland University of Technology BrisbaneQLD4000 Australia Department of Biomedical Engineering King’s College London SE1 7EH United Kingdom Alan Turing Institute LondonNW1 2DB United Kingdom School of Mathematics Statistics & Physics Newcastle University NE1 7RU United Kingdom

Markov chain Monte Carlo is the engine of modern Bayesian statistics, being used to approximate the posterior and derived quantities of interest. Despite this, the issue of how the output from a Markov chain is post-processed and reported is often overlooked. Convergence diagnostics can be used to control bias via burn-in removal, but these do not account for (common) situations where a limited computational budget engenders a bias-variance trade-off. The aim of this article is to review state-of-the-art techniques for post-processing Markov chain output. Our review covers methods based on discrepancy minimisation, which directly address the bias-variance trade-off, as well as general-purpose control variate methods for approximating expected quantities of interest. Copyright © 2021, The Authors. All rights reserved.

关键词： Monte Carlo methods

A parallel evolutionary multiple-try metropolis Markov chain monte carlo algorithm for sampling spatial partitions

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Tam Cho, Wendy K. Liu, Yan Y. Department of Political Science Department of Statistics Department of Mathematics Department of Asian American Studies College of Law National Center for Supercomputing Applications University of Illinois at Urbana-Champaign United States Computational Urban Sciences Group Computational Science and Engineering Division Oak Ridge National Laboratory United States

We develop an Evolutionary Markov Chain Monte Carlo (EMCMC) algorithm for sampling spatial partitions that lie within a large and complex spatial state space. Our algorithm combines the advantages of evolutionary algorithms (EAs) as optimization heuristics for state space traversal and the theoretical convergence properties of Markov Chain Monte Carlo algorithms for sampling from unknown distributions. Local optimality information that is identified via a directed search by our optimization heuristic is used to adaptively update a Markov chain in a promising direction within the framework of a Multiple-Try Metropolis Markov Chain model that incorporates a generalized Metropolis-Hasting ratio. We further expand the reach of our EMCMC algorithm by harnessing the computational power afforded by massively parallel architecture through the integration of a parallel EA framework that guides Markov chains running in parallel. Copyright © 2020, The Authors. All rights reserved.

关键词： Evolutionary algorithms

AN ALGEBRAIC CHARACTERIZATION OF k–COLORABILITY

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Flores, Ramón Kahrobaei, Delaram Koberda, Thomas Department of Geometry and Topology University of Seville Spain Department of Computer Science University of York UK New York University Tandon School of Engineering PhD Program in Computer Science CUNY Graduate Center Mathematics Department University of Virginia CharlottesvilleVA22904

We characterize k–colorability of a simplicial graph via the intrinsic algebraic structure of the associated right-angled Artin group. As a consequence, we show that a certain problem about the existence of homomorphisms from right-angled Artin groups to products of free groups is NP–complete. Copyright © 2020, The Authors. All rights reserved.

关键词： Algebra

Space-time theory of retail gravitation in economics of sun-earth relationships 18

学校读者我要写书评

暂无评论

Space-time theory of retail gravitation in economics of sun-...

18th Conference on Applied mathematics, APLIMAT 2019

作者： Zeithamer, Tomáš R. Pospíšil, Jiří Faculty of Informatics and Statistics Department of Mathematics Economic University Prague Ekonomická 957 Prague140 00 Czech Republic Faculty of Civil Engineering Czech Technical University in Prague Thákurova 7 Prague166 29 Czech Republic

ISBN: (纸本)9781510882140

This paper is dealing with space-time theory of retail gravitation in economics of Sun-Earth Relationships. The mathematical model for physical space-time with the field of retail gravitation is based on a four-dimensional differentiable manifold on which a symmetric covariant second-order tensor field is defined, i.e. metric tensor having Lorentzian signature. © Applied mathematics, APLIMAT *** right reserved.

关键词： Tensors

Sub-Exact Sequence On Hilbert Space

学校读者我要写书评

暂无评论

Journal of Physics: Conference Series 2021年第1期1751卷

作者： B H S Utami Fitriani M Usman Warsono J I Daoud Doctoral Program of Mathematics and Natural Science Faculty of Mathematics and Natural Science University of Lampung Bandar Lampung Indonesia Department of Information System STMIK Pringsewu Pringsewu Indonesia Department of Mathematics and Natural Science Faculty of Mathematics and Natural Science University of Lampung Bandar Lampung Indonesia Department of Science and Engineering Faculty of Engineering International Islamic University Malaysia P.O. Box 10 50728 Kuala Lumpur Malaysia

The notion of the sub-exact sequence is the generalization of exact sequence in algebra especially on a module. A module over a ring R is a generalization of the notion of vector space over a field F. Refers to a special vector space over field F when we have a complete inner product space, it is called a Hilbert space. A space is complete if every Cauchy sequence converges. Now, we introduce the sub-exact sequence on Hilbert space which can later be useful in statistics. This paper aims to investigate the properties of the sub-exact sequence and their relation to direct summand on Hilbert space. As the result, we get two properties of isometric isomorphism sub-exact sequence on Hilbert space.

关键词：

Multiwavelength Afterglow Analysis of GRB 221009A: Unveiling the Evolution of a Cooling Break in a Wind-like Medium

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Tak, Donggeun Uhm, Z. Lucas Paek, Gregory S.H. Im, Myungshin Arimoto, Makoto Choi, Hyeonho Kim, Sophia Omodei, Nicola Racusin, Judith Urata, Yuji Zhang, Bing SNU Astronomy Research Center Seoul National University Seoul08826 Korea Republic of Korea Astronomy and Space Science Institute Daejeon34055 Korea Republic of Astronomy Program Department of Physics and Astronomy Seoul National University Gwanak-gu Seoul08826 Korea Republic of Faculty of Mathematics and Physics Institute of Science and Engineering Kanazawa University Kakuma Ishikawa Kanazawa920-1192 Japan W. W. Hansen Experimental Physics Laboratory Kavli Institute for Particle Astrophysics and Cosmology Department of Physics SLAC National Accelerator Laboratory Stanford University StanfordCA94305 United States NASA Goddard Space Flight Center GreenbeltMD20771 United States Institute of Astronomy National Central University Chung-Li32054 Taiwan The Nevada Center for Astrophysics University of Nevada Las VegasNV89154 United States Department of Physics and Astronomy University of Nevada Las VegasNV89154 United States

Gamma-ray bursts (GRBs) are the most energetic explosions in the universe, and their afterglow emission provides an opportunity to probe the physics of relativistic shock waves in an extreme environment. Several key pieces for completing the picture of the GRB afterglow physics are still missing, including jet properties, emission mechanism, and particle acceleration. Here we present a study of the afterglow emission of GRB 221009A, the most energetic GRB ever observed. Using optical, X-ray, and gamma-ray data up to approximately two days after the trigger, we trace the evolution of the multi-wavelength spectrum and the physical parameters behind the emission process. The broadband spectrum is consistent with the synchrotron emission emitted by relativistic electrons with its index of p = 2.29 ± 0.02. We identify a break energy at keV and an exponential cutoff at GeV in the observed multi-wavelength spectrum. The break energy increases in time from 16.0+7.1−4.9 keV at 0.65 days to 46.8+25.0−15.5 keV at 1.68 days, favoring a stellar wind-like profile of the circumburst medium with k = 2.4 ± 0.1 as in ρ(r) ∝ r−k. The high-energy attenuation at around 0.4 to 4 GeV is attributed to the maximum of the particle acceleration in the relativistic shock wave. This study confirms that the synchrotron process can explain the multi-wavelength afterglow emission and its evolution. Copyright © 2024, The Authors. All rights reserved.

关键词： Gamma rays

Graph Kolmogorov-Arnold Networks for Multi-Cancer Classification and Biomarker Identification, An Interpretable Multi-Omics Approach

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Alharbi, Fadi Budhiraja, Nishant Vakanski, Aleksandar Zhang, Boyu Elbashir, Murtada K. Mohammed, Mohanad College of Engineering Department of Computer Science University of Idaho MoscowID83844 United States College of Computer and Information Sciences Department of Computer Science Jouf University Aljouf Sakaka72441 Saudi Arabia College of Computer and Information Sciences Department of Information Systems Jouf University Aljouf Sakaka72441 Saudi Arabia Faculty of Mathematical and Computer Sciences University of Gezira Wad Madani Sudan School of Mathematics Statistics and Computer Science University of KwaZulu-Natal Scottsville Pietermaritzburg3209 South Africa

The integration of multi-omics data presents a major challenge in precision medicine, requiring advanced computational methods for accurate disease classification and biological interpretation. This study introduces the Multi-Omics Graph Kolmogorov–Arnold Network (MOGKAN), a deep learning model that integrates messenger-RNA, micro-RNA sequences, and DNA methylation data with Protein-Protein Interaction (PPI) networks for accurate and interpretable cancer classification across 31 cancer types. MOGKAN employs a hybrid approach combining differential expression with DESeq2, Linear Models for Microarray (LIMMA), and Least Absolute Shrinkage and Selection Operator (LASSO) regression to reduce multi-omics data dimensionality while preserving relevant biological features. The model architecture is based on the Kolmogorov–Arnold theorem principle, using trainable univariate functions to enhance interpretability and feature analysis. MOGKAN achieves classification accuracy of 96.28% and demonstrates low experimental variability with a standard deviation that is reduced by 1.58–7.30% points compared to Convolutional Neural Networks (CNNs) and Graph Neural Networks (GNNs). The biomarkers identified by MOGKAN have been validated as cancer-related markers through Gene Ontology (GO) and Kyoto Encyclopedia of Genes and Genomes (KEGG) enrichment analysis. The proposed model presents an ability to uncover molecular oncogenesis mechanisms by detecting phosphoinositide-binding substances and regulating sphingolipid cellular processes. By integrating multi-omics data with graph-based deep learning, our proposed approach demonstrates superior predictive performance and interpretability that has the potential to enhance the translation of complex multi-omics data into clinically actionable cancer *** Codes 68 Copyright © 2025, The Authors. All rights reserved.

关键词： Convolutional neural networks