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

A note on 1-2-3 and 1-2 conjectures for 3-regular graphs

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Chang, Jing-Zhi Yang, Chao Yin, Zhi-Xiang Yao, Bing School of Mathematics Physics and Statistics Center of Intelligent Computing and Applied Statistics Shanghai University of Engineering Science Shanghai201620 China College of Mathematics and Statistics Northwest Normal University Lanzhou730070 China

The 1-2-3 Conjecture, posed by Karoński, Luczak and Thomason, asked whether every connected graph G different from K2 can be 3-edge-weighted so that every two adjacent vertices of G get distinct sums of incident weights. The 1-2 Conjecture states that if vertices also receive colors and the vertex color is added to the sum of its incident edges, then adjacent vertices can be distinguished using only {1, 2}. In this paper we confirm 1-2 Conjecture for 3-regular graphs. Meanwhile, we show that every 3-regular graph can achieve a neighbor sum distinguishing edge coloring by using 4 colors, which answers 1-2-3 Conjecture *** Codes 05C15. Copyright © 2021, The Authors. All rights reserved.

关键词： Color

A Stochastic Flight Problem Simulation to Minimize Cost of Refuelling

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2021年第10期69卷 849-871页

作者： Said Ali Hassan Khalid Alnowibet Miral H.Khodeir Prachi Agrawal Adel F.Alrasheedi Ali Wagdy Mohamed Department of Operations Research and Decision Support Faculty of Computers and Artificial IntelligenceCairo UniversityGiza12613Egypt Department of Statistics and Operations Research College of ScienceKing Saud UniversityRiyadh11451Kingdom of Saudi Arabia Department of Mathematics and Scientific Computing National Institute of Technology HamirpurHimachal Pradesh177005India Department of Operations Research Faculty of Graduate Studies for Statistical ResearchCairo UniversityGiza12613Egypt Wireless Intelligent Networks Center(WINC) School of Engineering and Applied SciencesNile UniversityGizaEgypt

Commercial airline companies are continuously seeking to implement strategies for minimizing costs of fuel for their flight routes as acquiring jet fuel represents a significant part of operating and managing expenses for airline activities.A nonlinear mixed binary mathematical programming model for the airline fuel task is presented to minimize the total cost of refueling in an entire flight route *** model is enhanced to include possible discounts in fuel prices,which are performed by adding dummy variables and some restrictive constraints,or by fitting a suitable distribution function that relates prices to purchased *** obtained fuel plan explains exactly the amounts of fuel in gallons to be purchased from each airport considering tankering strategy while minimizing the pertinent cost of the whole flight *** relation between the amount of extra burnt fuel taken through tinkering strategy and the total flight time is also considered.A case study is introduced for a certain flight rotation in domestic US air transport *** mathematical model including stepped discounted fuel prices is *** problem has a stochastic nature as the total flight time is a random variable,the stochastic nature of the problem is realistic and more appropriate than the deterministic *** stochastic style of the problem is simulated by introducing a suitable probability distribution for the flight time duration and generating enough number of runs to mimic the probabilistic real *** similar real application problems are modelled as nonlinear mixed binary ones that are difficult to handle by exact ***,metaheuristic approaches are widely used in treating such different optimization *** this paper,a gaining sharing knowledge-based procedure is used to handle the mathematical *** algorithm basically based on the process of gaining and sharing knowledge throughout the human *** generated simulation runs of

关键词： Stochastic flight problem cost of refuelling ferrying strategy tankering discounted prices simulation procedure nonlinear mixed binary model metaheuristic algorithm gaining-sharing knowledge-based algorithm

Optimum Location of Field Hospitals for COVID-19: A Nonlinear Binary Metaheuristic Algorithm

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2021年第7期68卷 1183-1202页

作者： Said Ali Hassan Khalid Alnowibet Prachi Agrawal Ali Wagdy Mohamed Department of Operations Research and Decision Support Faculty of Computers and Artificial IntelligenceCairo UniversityGiza12613Egypt College of Science Department of Statistics and Operations ResearchKing Saud UniversityRiyadhSaudi Arabia Department of Mathematics and Scientific Computing National Institute of Technology HamirpurHimachal Pradesh177005India Department of Operations Research Faculty of Graduate Studies for Statistical ResearchCairo UniversityGiza12613Egypt Wireless Intelligent Networks Center(WINC) School of Engineering and Applied SciencesNile UniversityGizaEgypt

Determining the optimum location of facilities is critical in many fields,particularly in *** study proposes the application of a suitable location model for field hospitals during the novel coronavirus 2019(COVID-19)*** used model is the most appropriate among the three most common location models utilized to solve healthcare problems(the set covering model,the maximal covering model,and the P-median model).The proposed nonlinear binary constrained model is a slight modification of the maximal covering model with a set of nonlinear *** model is used to determine the optimum location of field hospitals for COVID-19 risk *** designed mathematical model and the solution method are used to deploy field hospitals in eight governorates in Upper *** this case study,a discrete binary gaining–sharing knowledge-based optimization(DBGSK)algorithm is *** DBGSK algorithm is based on how humans acquire and share knowledge throughout their *** DBGSK algorithm mainly depends on two junior and senior binary *** two stages enable DBGSK to explore and exploit the search space efficiently and effectively,and thus it can solve problems in binary space.

关键词： Facility location nonlinear binary model field hospitals for COVID-19 gaining-sharing knowledge-based metaheuristic algorithm

Topological Authentication Technique In Topologically Asymmetric Cryptosystem

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Yao, Bing Su, Jing Ma, Fei Wang, Hongyu Yang, Chao College of Mathematics and Statistics Northwest Normal University Lanzhou730070 China School of Electronics Engineering and Computer Science Peking University Beijing100871 China National Computer Network Emergency Response Technical Team Coordination Center of China Beijing100029 China School of Mathematics Physics and Statistics Shanghai University of Engineering Science Shanghai 201620 China Center of Intelligent Computing and Applied Statistics Shanghai University of Engineering Science Shanghai 201620 China

Making topological authentication from theory to practical application is an important and challenging task. More and more researchers pay attention on coming quantum computation, privacy data protection, lattices and cryptography. Research show the advantages of topological authentications through graph operations, various matrices, graph colorings and graph labelings are: related with two or more different mathematical areas, be not pictures, there are huge number of colorings and labelings, rooted on modern mathematics, diversity of asymmetric ciphers, simplicity and convenience, easily created, irreversibility, computational security, provable security, and so on. Topological authentications based on various graph homomorphisms, degree-sequence homomorphisms, graph-set homomorphisms. Randomly topological coding and topological authentications are based on Hanzi authentication, randomly adding-edge-removing operation, randomly leaf-adding algorithms, graph random increasing techniques, operation graphic lattice and dynamic networked models and their spanning trees and maximum leaf spanning trees. Realization of topological authentication is an important topic, we study: number-based strings generated from colored graphs, particular graphs (complete graphs, trees, planar graphs), some methods of generating public-keys. some techniques of topologically asymmetric cryptosystem are: W-type matching labelings, dual-type labelings, reciprocal-type labelings, topological homomorphisms, indexed colorings, graphic lattices, degree-sequence lattices, every-zero Cds-matrix groups of degree-sequences, every-zero graphic groups, graphic lattices having coloring closure property, self-similar networked lattices. We propose two problems: Parameterized Number-based String Partition Problem (PNBSPP) and Number-Based String No-order Decomposition Problem (NBSNODP). It is preliminarily concluded that the graph lattice based on PNBSPP and NBSNODP can resist quantum computing. We, al

关键词： Authentication

Nonlinear Classifiers Based on DNA Logic Circuits for Cancer Diagnosis

学校读者我要写书评

暂无评论

ACS synthetic biology 2025年 2025 May 22页

作者： Chunlin Chen Zhixiang Yin Shiyin Li Wenhui Lian Zhen Tang School of Mathematics Physics and Statistics Shanghai University of Engineering Science Shanghai 201620 China. Institute for Frontier Medical Technology Shanghai Frontiers Science Research Center for Druggability of Cardiovascular Noncoding RNA Center of Intelligent Computing and Applied Statistics Shanghai University of Engineering Science Shanghai 201620 China.

DNA logical circuits can be applied to accurate classification of cancer status, benefiting from their excellent biocompatibility and parallelism. However, the existing cancer diagnosis models based on DNA logic circuits mainly adopt a linear structure, which makes it difficult to fully capture the complex nonlinear distribution characteristics in the disease data. In addition, DNA logic circuits cannot directly sense the expression levels of microRNAs (miRNAs). Here, we constructed a nonlinear classifier based on DNA logic circuits with the random forest algorithm. The classifier can directly sense the expression level of miRNAs in serum samples without isolating specific miRNAs and transmit the signals to the logic classification module and complete the nonlinear classification of cancer status. We validated the classification performance of the constructed nonlinear classifiers by using miRNA expression level samples to diagnose adenocarcinoma, ductal and lobular neoplasms, and squamous cell carcinoma with accuracies of 95.4%, 96.6%, and 97.2%, respectively. The classification results generated using the nonlinear classifiers based on DNA logic circuits showed a strong agreement with the actual disease states labeled in TCGA, as well as with the random forest algorithm, and had high parallelism and stability in the multiclassification of three different cancers. This work shows the great potential of DNA logic circuit-based nonlinear classifiers in cancer diagnosis, which provides a new approach to design efficient, accurate, and intelligent integrated disease diagnosis schemes.

关键词： DNA computing DNA logic circuits cancer diagnosis nonlinear classifiers

Managing Delivery of Safeguarding Substances as a Mitigation Against Outbreaks of Pandemics

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2021年第7期68卷 1161-1181页

作者： Said Ali Hassan Khalid Alnowibet Prachi Agrawal Ali Wagdy Mohamed Department of Operations Research and Decision Support Faculty of Computers and Articial IntelligenceCairo UniversityGiza12613Egypt Department of Statistics and Operations Research College of ScienceKing Saud UniversityRiyadhSaudi Arabia Trafc Safety Technologies Chair Vice Deanship of Scientic ResearchKing Saud UniversityRiyadhSaudi Arabia Department of Mathematics and Scientic Computing National Institute of TechnologyHamirpur177005India Operations Research Department Faculty of Graduate Studies for Statistical ResearchCairo UniversityGiza12613Egypt School of Engineering and Applied Sciences Wireless Intelligent Networks Center(WINC)Nile UniversityGizaEgypt

The optimum delivery of safeguarding substances is a major part of supply chain management and a crucial issue in the mitigation against the outbreak of pandemics.A problem arises for a decision maker who wants to optimally choose a subset of candidate consumers to maximize the distributed quantities of the needed safeguarding substances within a specic time period.A nonlinear binary mathematical programming model for the problem is *** decision variables are binary ones that represent whether to choose a specic consumer,and design constraints are formulated to keep track of the chosen *** better illustrate the problem,objective,and problem constraints,a real application case study is *** case study involves the optimum delivery of safeguarding substances to several hospitals in the Al-Gharbia Governorate in *** hospitals are selected to represent the consumers of safeguarding substances,as they are the rst crucial frontline for mitigation against a pandemic outbreak.A distribution truck is used to distribute the substances from the main store to the hospitals in specied required quantities during a given working *** objective function is formulated in order to maximize the total amount of delivered quantities during the specied time *** case study is solved using a novel Discrete Binary Gaining Sharing Knowledge-based Optimization algorithm(DBGSK),which involves two main stages:discrete binary junior and senior gaining and sharing *** has the ability of nding the solutions of the introduced problem,and the obtained results demonstrate robustness and convergence toward the optimal solutions.

关键词： Safeguarding substances mitigation against pandemic outbreaks supply chain management metaheuristic optimization

Nest-DGIL: Nesterov-optimized Deep Geometric Incremental Learning for CS Image Reconstruction

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Fan, Xiaohong Yang, Yin Chen, Ke Feng, Yujie Zhang, Jianping The School of Mathematics and Computational Science Xiangtan University Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan411105 China The School of Mathematics and Computational Science Xiangtan University Hunan National Applied Mathematics Center Xiangtan411105 China The Centre for Mathematical ImagingTechniques Department of Mathematical Sciences The University of Liverpool Department of Mathematics and Statistics University of Strathclyde Glasgow United Kingdom The School of Mathematics and Computational Science Xiangtan University The Key Laboratory of Intelligent Computing & Information Processing The Ministry of Education Xiangtan411105 China

Proximal gradient-based optimization is one of the most common strategies to solve inverse problem of images, and it is easy to implement. However, these techniques often generate heavy artifacts in image reconstruction. One of the most popular refinement methods is to fine-tune the regularization parameter to alleviate such artifacts, but it may not always be sufficient or applicable due to increased computational costs. In this work, we propose a deep geometric incremental learning framework based on the second Nesterov proximal gradient optimization. The proposed end-to-end network not only has the powerful learning ability for high-/low-frequency image features, but also can theoretically guarantee that geometric texture details will be reconstructed from preliminary linear reconstruction. Furthermore, it can avoid the risk of intermediate reconstruction results falling outside the geometric decomposition domains and achieve fast convergence. Our reconstruction framework is decomposed into four modules including general linear reconstruction, cascade geometric incremental restoration, Nesterov acceleration, and post-processing. In the image restoration step, a cascade geometric incremental learning module is designed to compensate for missing texture information from different geometric spectral decomposition domains. Inspired by the overlap-tile strategy, we also develop a post-processing module to remove the block effect in patch-wise-based natural image reconstruction. All parameters in the proposed model are learnable, an adaptive initialization technique of physical parameters is also employed to make model flexibility and ensure converging smoothly. We compare the reconstruction performance of the proposed method with existing state-of-the-art methods to demonstrate its superiority. Our source codes are available at https://***/fanxiaohong/Nest-DGIL. Copyright © 2023, The Authors. All rights reserved.

关键词： Image reconstruction

Building Surrogate Models of Nuclear Density Functional Theory with Gaussian Processesand Autoencoders

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Verriere, Marc Schunck, Nicolas Kim, Irene Marević, Petar Quinlan, Kevin NGo, Michelle N. Regnier, David Lasseri, Raphael David Nuclear and Data Theory group Nuclear and Chemical Science Division Lawrence Livermore National Laboratory LivermoreCA94550 United States Machine Intelligence group Center for Applied Scientific Computing Lawrence Livermore National Laboratory LivermoreCA94550 United States Sensing and Intelligent Systems group Global Security Computing Applications Division Lawrence Livermore National Laboratory LivermoreCA94550 United States Centre Borelli ENS Paris-Saclay Université Paris-Saclay Gif-sur-Yvette91190 France Physics Department Faculty of Science University of Zagreb Zagreb10000 Croatia Applied Statistics Group Lawrence Livermore National Laboratory LivermoreCA94551 United States Center for Complex Biological Systems University of California Irvine IrvineCA92697 United States Université Paris-Saclay CEA Laboratoire Matière en Conditions Extrêmes Bruyères-le-Châtel91680 France CEA DAM DIF Arpajon91297 France

From the lightest Hydrogen isotopes up to the recently synthesized Oganesson (Z = 118), it is estimated that as many as about 3000 atomic nuclei could exist in nature. Most of these nuclei are too short-lived to be occurring on Earth, but they play an essential role in astrophysical events such as supernova explosions or neutron star mergers that are presumed to be at the origin of most heavy elements in the Universe. Understanding the structure, reactions, and decays of nuclei across the entire chart of nuclides is an enormous challenge because of the experimental difficulties in measuring properties of interest in such fleeting objects and the theoretical and computational issues of simulating strongly-interacting quantum many-body systems. Nuclear density functional theory (DFT) is a fully microscopic theoretical framework which has the potential of providing such a quantitatively accurate description of nuclear properties for every nucleus in the chart of nuclides. Thanks to high-performance computing facilities, it has already been successfully applied to predict nuclear masses, global patterns of radioactive decay like β or γ decay, and several aspects of the nuclear fission process such as, e.g., spontaneous fission half-lives. Yet, predictive simulations of nuclear spectroscopy – the low-lying excited states and transitions between them – or of nuclear fission, or the quantification of theoretical uncertainties and their propagation to basic or applied nuclear science applications, would require several orders of magnitude more calculations than currently possible. However, most of this computational effort would be spent into generating a suitable basis of DFT wavefunctions. Such a task could potentially be considerably accelerated by borrowing tools from the field of machine learning and artificial intelligence. In this paper, we review different approaches to applying supervised and unsupervised learning techniques to nuclear DFT. © 2022, CC BY.

关键词： Density functional theory

Understanding metric-related pitfalls in image analysis validation

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Reinke, Annika Tizabi, Minu D. Baumgartner, Michael Eisenmann, Matthias Heckmann-Nötzel, Doreen Kavur, A. Emre Rädsch, Tim Sudre, Carole H. Acion, Laura Antonelli, Michela Arbel, Tal Bakas, Spyridon Benis, Arriel Blaschko, Matthew B. Buettner, Florian Cardoso, M. Jorge Cheplygina, Veronika Chen, Jianxu Christodoulou, Evangelia Cimini, Beth A. Collins, Gary S. Farahani, Keyvan Ferrer, Luciana Galdran, Adrian van Ginneken, Bram Glocker, Ben Godau, Patrick Haase, Robert Hashimoto, Daniel A. Hoffman, Michael M. Huisman, Merel Isensee, Fabian Jannin, Pierre Kahn, Charles E. Kainmueller, Dagmar Kainz, Bernhard Karargyris, Alexandros Karthikesalingam, Alan Kenngott, Hannes Kleesiek, Jens Kofler, Florian Kooi, Thijs Kopp-Schneider, Annette Kozubek, Michal Kreshuk, Anna Kurc, Tahsin Landman, Bennett A. Litjens, Geert Madani, Amin Maier-Hein, Klaus Martel, Anne L. Mattson, Peter Meijering, Erik Menze, Bjoern Moons, Karel G.M. Müller, Henning Nichyporuk, Brennan Nickel, Felix Petersen, Jens Rafelski, Susanne M. Rajpoot, Nasir Reyes, Mauricio Riegler, Michael A. Rieke, Nicola Saez-Rodriguez, Julio Sánchez, Clara I. Shetty, Shravya Summers, Ronald M. Taha, Abdel A. Tiulpin, Aleksei Tsaftaris, Sotirios A. van Calster, Ben Varoquaux, Gaël Yaniv, Ziv R. Jäger, Paul F. Maier-Hein, Lena Faculty of Mathematics and Computer Science Heidelberg University Heidelberg Germany Heidelberg Division of Intelligent Medical Systems Germany NCT Heidelberg A Partnership Between DKFZ University Medical Center Heidelberg Germany Heidelberg Division of Medical Image Computing Germany Heidelberg Division of Intelligent Medical Systems Germany MRC Unit for Lifelong Health and Ageing UCL Centre for Medical Image Computing Department of Computer Science University College London London United Kingdom School of Biomedical Engineering and Imaging Science King’s College London London United Kingdom Instituto de Cálculo CONICET – Universidad de Buenos Aires Buenos Aires Argentina Centre for Medical Image Computing University College London London United Kingdom McGill University Montreal Canada Division of Computational Pathology Dept of Pathology & Laboratory Medicine Indiana University School of Medicine IU Health Information and Translational Sciences Building Indianapolis United States University of Pennsylvania Richards Medical Research Laboratories FL7 PhiladelphiaPA United States Department of Digital Medical Technologies Holon Institute of Technology Holon Israel European Federation for Medical Informatics Le Mont-sur-Lausanne Switzerland Center for Processing Speech and Images Department of Electrical Engineering KU Leuven Leuven Belgium partner site Frankfurt/Mainz a partnership between DKFZ and UCT Frankfurt Marburg Germany Heidelberg Germany Goethe University Frankfurt Department of Medicine Germany Goethe University Frankfurt Department of Informatics Germany and Frankfurt Cancer Insititute Germany Department of Computer Science IT University of Copenhagen Copenhagen Denmark Leibniz-Institut für Analytische Wissenschaften – ISAS – e.V. Dortmund Germany Imaging Platform Broad Institute of MIT and Harvard CambridgeMA United States Centre for Statistics in Medicine University of Oxford Oxford United Kingdom Center for Biomedical In

Validation metrics are key for tracking scientific progress and bridging the current chasm between artificial intelligence (AI) research and its translation into practice. However, increasing evidence shows that particularly in image analysis, metrics are often chosen inadequately. While taking into account the individual strengths, weaknesses, and limitations of validation metrics is a critical prerequisite to making educated choices, the relevant knowledge is currently scattered and poorly accessible to individual researchers. Based on a multi-stage Delphi process conducted by a multidisciplinary expert consortium as well as extensive community feedback, the present work provides the first reliable and comprehensive common point of access to information on pitfalls related to validation metrics in image analysis. While focused on biomedical image analysis, the addressed pitfalls generalize across application domains and are categorized according to a newly created, domain-agnostic taxonomy. The work serves to enhance global comprehension of a key topic in image analysis validation. © 2023, CC BY.

关键词： Computer vision