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

science, engineering and Business for Sustainable Development Goals (SEB-SDG), International Conference on

作者： Damola Gideon Akinola Emmanuel Adetiba Abdultaofeek Abayomi Uche Nnaji Surendra Thakur Sibusiso Moyo Department of Electrical and Information Engineering Covenant Applied Informatics and Communications African Center of Excellence Covenant University Ota Nigeria HRA Institute for Systems Science Durban University of Technology Durban South Africa Department of Information and Communication Technology Mangosuthu University of Technology Durban South Africa Dept. of Computer and Information Science Covenant Applied Informatics and Communications African Center of Excellence Covenant University Ota Nigeria KZN e-Skills CoLab Durban University of Technology Durban South Africa School for Data Science and Computational Thinking and Department of Mathematical Sciences Stellenbosch University Stellenbosch South Africa

ISBN: (数字)9798350358155

ISBN: (纸本)9798350358162

The emergence of cloud computing technology has motivated a very high number of users in different organizations to access its services in running and delivering their various operations and services. However, this surge of cloud users has led to the problem of uneven load sharing among the cloud computing infrastructures. As a result, federated cloud infrastructure was initiated to provide more cloud computing resources to accommodate more cloud users’ requests and also to provide equal requests mapping with the available cloud resources. Nevertheless, the issue of unequal allocation of requests within the datacenter(s) that makes up the federated cloud environment still persists. This research work presents an intra-datacenter load balancing algorithm in a federated cloud environment named; the intra-balancer adapted throttled algorithm to evenly distribute requests in each datacenter that formulate the federated cloud infrastructures. The simulation of the intra-balancer was carried out in CloudAnalyst, the results of the implementation showed that the intra-balancer outperformed the Round-Robin and ESCE with 98.93ms and 2.26ms for the response and processing time respectively. The results assert that the intra-balancer algorithm provides a better load balancing solution in a federated cloud environment.

关键词： Computers Cloud computing Organizations Load management Resource management Time factors Task analysis

来源：评论

学校读者我要写书评

暂无评论

Temporal networks provide a unifying understanding of the evolution of cooperation

arXiv

引用

arXiv 2023年

作者： Li, Aming Meng, Yao Zhou, Lei Masuda, Naoki Wang, Long Center for Systems and Control College of Engineering Peking University Beijing100871 China Center for Multi-Agent Research Institute for Artificial Intelligence Peking University Beijing100871 China School of Automation Beijing Institute of Technology Beijing100081 China Department of Mathematics State University of New York at Buffalo BuffaloNY14260 United States Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo BuffaloNY14260 United States

Understanding the evolution of cooperation in structured populations represented by networks is a problem of long research interest, and a most fundamental and widespread property of social networks related to cooperation phenomena is that the node’s degree (i.e., number of edges connected to the node) is heterogeneously distributed. Previous results indicate that static heterogeneous (i.e., degree-heterogeneous) networks promote cooperation in stationarity compared to static regular (i.e., degree-homogeneous) networks if equilibrium dynamics starting from many cooperators and defectors is employed. However, the above conclusion reverses if we employ non-equilibrium stochastic processes to measure the fixation probability for cooperation, i.e., the probability that a single cooperator successfully invades a population. Here we resolve this conundrum by analyzing the fixation of cooperation on temporal (i.e., time-varying) networks. We theoretically prove and numerically confirm that on both synthetic and empirical networks, contrary to the case of static networks, temporal heterogeneous networks can promote cooperation more than temporal regular networks in terms of the fixation probability of cooperation. Given that the same conclusion is known for the equilibrium fraction of cooperators on temporal networks, the present results provide a unified understanding of the effect of temporal degree heterogeneity on promoting cooperation across two main analytical frameworks, i.e., equilibrium and non-equilibrium ones. Copyright © 2023, The Authors. All rights reserved.

关键词： Heterogeneous networks

来源：评论

学校读者我要写书评

暂无评论

Vus from kaon semileptonic form factor in N f = 2 + 1 QCD at the physical point on (10 fm)4

arXiv

引用

arXiv 2023年

作者： Yamazaki, Takeshi Ishikawa, Ken-Ichi Ishizuka, Naruhito Kuramashi, Yoshinobu Namekawa, Yusuke Taniguchi, Yusuke Ukita, Naoya Yoshié, Tomoteru Institute of Pure and Applied Sciences University of Tsukuba Ibaraki Tsukuba305-8571 Japan Center for Computational Sciences University of Tsukuba Ibaraki Tsukuba305-8577 Japan Core of Research for the Energetic Universe Graduate School of Advanced Science and Engineering Hiroshima University Higashi-Hiroshima739-8526 Japan Education and Research Center for Artificial Intelligence and Data Innovation Hiroshima University Higashi-Hiroshima739-8521 Japan

We present a preliminary result of the kaon semileptonic form factor calculated at the smallest lattice spacing in the PACS10 configurations, whose physical volumes are more than (10 fm)4 at the physical point. The configurations were generated using the Iwasaki gauge action and N f = 2 + 1 stout-smeared nonperturbatively O (a) improved Wilson quark action at the three lattice spacings, 0.085, 0.063, and 0.041 fm. The value of |Vus | in the continuum limit is estimated from our results including the preliminary one. We compare our result of |Vus | with the previous results and those through the kaon leptonic decay. Copyright © 2023, The Authors. All rights reserved.

关键词： Hadrons

来源：评论

学校读者我要写书评

暂无评论

Hierarchical bucket tree: An efficient account structure for blockchain-based system

Hierarchical bucket tree: An efficient account structure for...

引用

作者： Chen, Weili Zheng, Zibin Ma, Mingjie He, Pinjia Zhou, Yuren Bian, Jing School of Data and Computer Science National Engineering Research Center of Digital Life Sun Yat-sen University Guangzhou510006 China Department of Computer Science ETH Zurich Switzerland School of Data and Computer Science Sun Yat-sen University Guangzhou China Guangdong Province Key Laboratory of Computational Science Guangzhou China

Systems built on top of blockchain are often inefficient. One reason for the inefficiency is that these systems include too many hash operations. To address this problem, we conduct an empirical study on the transaction history of a real-world blockchain-based system (i.e., Ethereum), which contains 300,821 accounts and 14,240,095 transactions. We found that the account usage frequency is highly heterogeneous. Based on this finding, this paper presents hierarchy bucket tree (HBT), an efficient account structure with user transaction behaviour information embedded, to reduce the number of hash operations and thus enhance the efficiency of blockchain-based systems. Extensive experiments have been conducted and the experimental results show that HBT reduces hash operations by nearly 80% compared with the existing account structure. Copyright © 2020 Inderscience Enterprises Ltd.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

On Generalizations of the Nonwindowed Scattering Transform

arXiv

引用

arXiv 2022年

作者： Chua, Albert Hirn, Matthew Little, Anna Department of Mathematics Michigan State University East LansingMI48824 United States Department of Computational Mathematics Science & Engineering Michigan State University East LansingMI48824 United States Center for Quantum Computing Science & Engineering Michigan State University East LansingMI48824 United States Department of Mathematics the Utah Center For Data Science University of Utah Salt Lake CityUT84112 United States

In this paper, we generalize finite depth wavelet scattering transforms, which we formulate as Lq(Rn) norms of a cascade of continuous wavelet transforms (or dyadic wavelet transforms) and contractive nonlinearities. We then provide norms for these operators, prove that these operators are well-defined, and are Lipschitz continuous to the action of C2 diffeomorphisms in specific cases. Lastly, we extend our results to formulate an operator invariant to the action of rotations R ∈ SO(n) and an operator that is equivariant to the action of rotations of R ∈ SO(n). © 2022, CC BY.

关键词： Wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

Exploring Noncollinear Magnetic Energy Landscapes with Bayesian Optimization

arXiv

引用

arXiv 2024年

作者： Baumsteiger, Jakob Celiberti, Lorenzo Rinke, Patrick Todorović, Milica Franchini, Cesare Department of Physics and Astronomy Augusto Righi Alma Mater Studiorum Univeristà di Bologna Bologna40127 Italy Faculty of Physics Center for Computational Materials Science University of Vienna Vienna1090 Austria Physics Department TUM School of Natural Sciences Technical University of Munich Garching Germany Department of Applied Physics Aalto University AaltoFI-00076 Finland Atomistic Modelling Center Munich Data Science Institute Technical University of Munich Garching Germany Germany Department of Mechanical and Materials Engineering University of Turku TurkuFI-20014 Finland

The investigation of magnetic energy landscapes and the search for ground states of magnetic materials using ab initio methods like density functional theory (DFT) is a challenging task. Complex interactions, such as superexchange and spin-orbit coupling, make these calculations computationally expensive and often lead to non-trivial energy landscapes. Consequently, a comprehensive and systematic investigation of large magnetic configuration spaces is often impractical. We approach this problem by utilizing Bayesian Optimization, an active machine learning scheme that has proven to be efficient in modeling unknown functions and finding global minima. Using this approach we can obtain the magnetic contribution to the energy as a function of one or more spin canting angles with relatively small numbers of DFT calculations. To assess the capabilities and the efficiency of the approach we investigate the noncollinear magnetic energy landscapes of selected materials containing 3d, 5d and 5 f magnetic ions: Ba3MnNb2O9, LaMn2Si2, β-MnO2, Sr2IrO4, UO2 and Ba2NaOsO6. By comparing our results to previous ab initio studies that followed more conventional approaches, we observe significant improvements in efficiency. © 2024, CC BY.

关键词： Uranium dioxide

来源：评论

学校读者我要写书评

暂无评论

New bounds and generalizations of locally recoverable codes with availability

New bounds and generalizations of locally recoverable codes ...

引用

作者： Kruglik, Stanislav Nazirkhanova, Kamilla Frolov, Alexey Center for Computational and Data-Intensive Science and Engineering Skolkovo Institute of Science and Technology Moscow121205 Russia Department of Radio Engineering and Cybernetics Moscow Institute of Physics and Technology Moscow141701 Russia

We investigate the distance properties of linear locally recoverable codes (LRC codes) with all-symbol locality and availability. New upper and lower bounds on the minimum distance of such codes are derived. The upper bound is based on the shortening method and generalized Hamming weights that are fundamental parameters of any linear codes with many useful applications. This bound improves existing upper bounds. To reduce the gap in between upper and lower bounds, we do not restrict the alphabet size and propose explicit constructions of codes with locality and availability via rank-metric codes. The first construction relies on expander graphs and is better in low rate region. The second construction utilizes the LRC codes developed by Wang et al. as inner codes and is better in high rate region. We also suggest one possible generalization of LRC codes in which the recovering sets can intersect in a small number of coordinates. This feature allows us to increase the achievable code rate and still meet load balancing requirements. We derive upper and lower bounds on the parameters of such codes and present explicit constructions of codes with such a property. © 1963-2012 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

HOW DOES THE BRAIN COMPUTE WITH PROBABILITIES?

arXiv

引用

arXiv 2024年

作者： Haefner, Ralf M. Beck, Jeff Savin, Cristina Salmasi, Mehrdad Pitkow, Xaq Department of Brain and Cognitive Sciences University of Rochester RochesterNY United States Department of Neurobiology Duke University DurhamNC United States Departments of Neural Science and Data Science New York University New YorkNY United States Gatsby Computational Neuroscience Unit Max Planck UCL Centre for Computational Psychiatry and Ageing Research University College London United Kingdom Neuroscience Institute Department of Machine Learning Carnegie Mellon University PittsburghPA United States Department of Neuroscience Center for Neuroscience and Artificial Intelligence Baylor College of Medicine HoustonTX United States Department of Electrical and Computer Engineering Department of Computer Science Rice University HoustonTX United States

This perspective piece is the result of a Generative Adversarial Collaboration (GAC) tackling the question 'How does neural activity represent probability distributions?'. We have addressed three major obstacles to progress on answering this question: first, we provide a unified language for defining competing hypotheses. Second, we explain the fundamentals of three prominent proposals for probabilistic computations - Probabilistic Population Codes (PPCs), Distributed Distributional Codes (DDCs), and Neural Sampling Codes (NSCs) - and describe similarities and differences in that common language. Third, we review key empirical data previously taken as evidence for at least one of these proposal, and describe how it may or may not be explainable by alternative proposals. Finally, we describe some key challenges in resolving the debate, and propose potential directions to address them through a combination of theory and *** Codes 92 Copyright © 2024, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Registration-Enhanced Segmentation Method for Prostate Cancer in Ultrasound Images

arXiv

引用

arXiv 2025年

作者： Sang, Shengtian Jahanandish, Hassan Li, Cynthia Xinran Bhattachary, Indrani Lee, Jeong Hoon Zhang, Lichun Vesal, Sulaiman Ghanouni, Pejman Fan, Richard Sonn, Geoffrey A. Rusu, Mirabela Stanford University Department of Radiology 300 Pasteur Drive StanfordCA94305 United States University of Miami Department of Computer Science Coral GablesFL33124 United States Stanford University Department of Urology 300 Pasteur Drive StanfordCA94305 United States Stanford University Institute of Computational and Mathematical Engineering 475 Via Ortega StanfordCA94305 United States Dartmouth College Department of Biomedical Data Science 1 Medical Center Drive LebanonNH03756 United States

Prostate cancer is a major cause of cancer-related deaths in men, where early detection greatly improves survival rates. Although MRI-TRUS fusion biopsy offers superior accuracy by combining MRI’s detailed visualization with TRUS’s real-time guidance, it is a complex and time-intensive procedure that relies heavily on manual annotations, leading to potential errors. To address these challenges, we propose a fully automatic MRI-TRUS fusion-based segmentation method that identifies prostate tumors directly in TRUS images without requiring manual annotations. Unlike traditional multimodal fusion approaches that rely on naive data concatenation, our method integrates a registration-segmentation framework to align and leverage spatial information between MRI and TRUS modalities. This alignment enhances segmentation accuracy and reduces reliance on manual effort. Our approach was validated on a dataset of 1,747 patients from Stanford Hospital, achieving an average Dice coefficient of 0.212, outperforming TRUS-only (0.117) and naive MRI-TRUS fusion (0.132) methods, with significant improvements (p Copyright © 2025, The Authors. All rights reserved.

关键词： Urology

来源：评论

学校读者我要写书评

暂无评论

Multimodal MRI-Ultrasound AI for Prostate Cancer Detection Outperforms Radiologist MRI Interpretation: A Multi-center Study

arXiv

引用

arXiv 2025年

作者： Jahanandish, Hassan Sang, Shengtian Li, Cynthia Xinran Vesal, Sulaiman Bhattacharya, Indrani Lee, Jeong Hoon Fan, Richard Sonn, Geoffrey A. Rusu, Mirabela Stanford University Department of Urology 300 Pasteur Drive StanfordCA94305 United States Stanford University Department of Radiology 300 Pasteur Drive StanfordCA94305 United States University of Miami Department of Computer Science Coral GablesFL33124 United States Stanford University Institute of Computational and Mathematical Engineering 475 Via Ortega StanfordCA94305 United States Dartmouth College Department of Biomedical Data Science 1 Medical Center Drive LebanonNH03756 United States

Pre-biopsy magnetic resonance imaging (MRI) is increasingly used to target suspicious prostate lesions. This has led to artificial intelligence (AI) applications improving MRI-based detection of clinically significant prostate cancer (CsPCa). However, MRI-detected lesions must still be mapped to transrectal ultrasound (TRUS) images during biopsy, which results in missing CsPCa. This study systematically evaluates a multimodal AI framework integrating MRI and TRUS image sequences to enhance CsPCa identification. The study included 3110 patients from three cohorts across two institutions who underwent prostate biopsy. The proposed framework, based on the 3D UNet architecture, was evaluated on 1700 test cases, comparing performance to unimodal AI models that use either MRI or TRUS alone. Additionally, the proposed model was compared to radiologists in a cohort of 110 patients. The multimodal AI approach achieved superior sensitivity (80%) and Lesion Dice (42%) compared to unimodal MRI (73%, 30%) and TRUS models (49%, 27%). Compared to radiologists, the multimodal model showed higher specificity (88% vs. 78%) and Lesion Dice (38% vs. 33%), with equivalent sensitivity (79%). Our findings demonstrate multimodal AI’s potential to improve CsPCa lesion targeting during biopsy and treatment planning, surpassing current unimodal models and radiologists;ultimately improving outcomes for prostate cancer patients. Copyright © 2025, The Authors. All rights reserved.

关键词： Biopsy

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：