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

3rd International Conference on Intelligent Systems and Sustainable Computing, ICISSC 2023

作者： Ammasai, Viswanathan Katbar, Nek Muhammad Kothalanka, Amarendra Vandadi, Venkata Ramana Udhaya Shankar Latha, Sindhu Sharma, Dilip Kumar Sengan, Sudhakar School of Computer Science and Engineering Vellore Institute of Technology Tamil Nadu Vellore632 014 India School of Mathematics and Statistics Central South University Hunan Changsha410083 China Department of Computer Science and Engineering Koneru Lakshmaiah Education Foundation Andhra Pradesh Vaddeswaram522502 India Department of Computer Science and Engineering KSRM College of Engineering Andhra Pradesh Kadapa516003 India Department of Information Technology V.S.B. College of Engineering Technical Campus Tamil Nadu Coimbatore642109 India Department of Mathematics Jaypee University of Engineering and Technology Madhya Pradesh Guna473226 India Department of Computer Science and Engineering PSN College of Engineering and Technology Tamil Nadu Tirunelveli62745 India

ISBN: (纸本)9789819783540

The realm of Smart Grid Systems (SGS) has witnessed unprecedented progress, driven by increasing energy demands and the integration of Renewable Energy Sources (RES). While these grids promise enhanced efficiency and sustainability, their involved and dynamic nature poses significant optimization challenges. Existing solutions, although innovative, often overlook the intricate interplay between diverse factors, leaving room for potential improvements in optimization approaches. Recognizing this gap, the current study delves into developing a novel method that integrates Ant Colony Optimization (ACO) with domain-specific heuristics. By focusing on analytical sections like Load Forecasting, Renewable Energy Integration, Peak Shaving, and Grid Resilience, this method attempts to bridge the divide that existing approaches miss. The proposed method not only ensures optimal energy distribution but also tailors the solution to address the unique features and requirements of modern SGS. A more reliable, effective, and Renewable Energy (RE) future is within reach according to the outcomes of this investigation. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Clean energy

来源：评论

学校读者我要写书评

暂无评论

Time parallelization for hyperbolic and parabolic problems

arXiv

引用

arXiv 2025年

作者： Gander, Martin J. Wu, Shu-Lin Zhou, Tao Department of Mathematics University of Geneva CP64 Geneva 41211 Switzerland School of Mathematics and Statistics Northeast Normal University Changchun130024 China Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences China

Time parallelization, also known as PinT (Parallel-in-Time) is a new research direction for the development of algorithms used for solving very large scale evolution problems on highly parallel computing architectures. Despite the fact that interesting theoretical work on PinT appeared as early 1964, it was not until 2004, when processor clock speeds reached their physical limit, that research in PinT took off. A distinctive characteristic of parallelization in time is that information flow only goes forward in time, meaning that time evolution processes seem necessarily to be sequential. Nevertheless, many algorithms have been developed over the last two decades to do PinT computations, and they are often grouped into four basic classes according to how the techniques work and are used: shooting-type methods;waveform relaxation methods based on domain decomposition;multigrid methods in space-time;and direct time parallel methods. However, over the past few years, it has been recognized that highly successful PinT algorithms for parabolic problems struggle when applied to hyperbolic problems. We focus in this survey therefore on this important aspect, by first providing a summary of the fundamental differences between parabolic and hyperbolic problems for time parallelization. We then group PinT algorithms into two basic groups: the first group contains four effective PinT techniques for hyperbolic problems, namely Schwarz Waveform Relaxation with its relation to Tent Pitching;Parallel Integral Deferred Correction;ParaExp;and ParaDiag. While the methods in the first group also work well for parabolic problems, we then present PinT methods especially designed for parabolic problems in the second group: Parareal: the Parallel Full Approximation Scheme in Space-Time;Multigrid Reduction in Time;and Space-Time Multigrid. We complement our analysis with numerical illustrations using four time-dependent PDEs: the heat equation;the advection-diffusion equation;Burgers’ equa

关键词： Wave equations

来源：评论

学校读者我要写书评

暂无评论

Animal Shapes, Modal Analysis, and Visualization of Motion (III): Giraffe, Duck, Goose, T-Rex Dinosaur, and the Flying Modes of Eagle

引用

Journal of Geometric Analysis 2023年第10期33卷 1-28页

作者： Yang, Jing Chen, Goong Wei, Chunqiu Sergeev, Alexey Huang, Jingtong Scully, Matthew M. Krantz, Steven G. Yao, Pengfei Guo, Tiexin Wang, Junmin Chen, Ming-Chieh Corti, Darrell School of Mathematics and Statistics Beijing Institute of Technology Beijing 102488 China Department of Mathematics Texas A &M University College Station 77843 TX United States Institute for Quantum Science and Engineering Texas A &M University College Station 77843 TX United States Hsinchu Branch National Center for Theoretical Sciences National Tsing Hua University Hsinchu Taiwan Department of Mathematics and Data Science Beijing University of Civil Engineering and Architecture Beijing 100044 China Department of Mathematics Washington University at St. Louis St. Louis 63130 MO United States Key Laboratory of Complex Systems and Data Science of Ministry of Education School of Mathematics Shanxi University Shanxi Taiyuan 030006 China Institute of Systems Science Academy of Mathematics and Systems Science Academia Sinica Beijing 100190 China School of Mathematics and Statistice Central South University Hunan Changsha 410075 China Department of Mechanical Engineering Cheng Shiu University Kaohsiung Taiwan Corti Brothers 5810 Folsom Blvd. Sacramento 95819 CA United States

This paper contains more varieties of animals, including the giraffe, bird species duck, goose and eagle, and the T-Rex dinosaur. They range across mammals, birds and reptiles. For each of them, we present their first one hundred modes of motion. Three objectives of this paper are as follows: (i)To see more different types of modes of motion from a larger varieties of animals so as to make visual comparisons between interspecies behavioral patterns.(ii)To illustrate the wing-flapping flying modes of an eagle.(iii)To show the modes of motions of an extinct animal, the T-Rex dinosaur. © 2023, Mathematica Josephina, Inc.

关键词： Animal shapes Duck, Goose, Dinosaur, and the flying modes of an eagle Motion patterns

来源：评论

学校读者我要写书评

暂无评论

引用

7th International Conference of Computer and Informatics engineering, IC2IE 2024

作者： Wandy, Wandy Adi, Kusworo Ayu, Media Anugerah Diponegoro University Doctoral Program of Information Systems School of Postgraduate Studies Semarang Indonesia Diponegoro University Faculty of Science and Mathematics Department of Physics Semarang Indonesia Sampoerna University Faculty of Engineering and Technology Department of Computer Science South Jakarta Indonesia

ISBN: (纸本)9798331505530

Full-marathon and Half-marathon distances are categorized as road running. Full-marathon running is becoming increasingly popular, and Half-marathon is increasing worldwide in both sexes and all age groups. Some aspects might relate to Full-marathon and Half-marathon running performance during training and races. Technology also plays an essential role in supporting runners and running races. Technology like artificial intelligence (AI) now supports the running athlete, not only predicting performance and results. It can also be used later to help the coach generate training programs for the athlete. This research aimed to find many aspects of marathons and performance and analyze them to see if artificial intelligence could later support them. It used secondary data and a systematic literature review proposed by Kitchenham. Out of the 58 articles, 21 of them (36.21%) received a score of 1 from Q1. Additionally, 19 articles (32.76%) received a score of 1 from both Q2 and Q3. Among the 58 articles, 9 (15.52%) received a total score of 3, with all three Q1, Q2, and Q3 scores being 1. This indicates that artificial intelligence will likely support the content of these nine articles. Several factors were also discovered to be connected to marathons and athletic performance. These findings suggested that additional investigation into marathons and performance, later backed by artificial intelligence, remained pertinent and essential. © 2024 IEEE.

关键词： artificial intelligence aspects marathon performance

来源：评论

学校读者我要写书评

暂无评论

Generative Adversarial Networks for Semi-Supervised Learning in Clinical Decision Support Systems 3rd

Generative Adversarial Networks for Semi-Supervised Learning...

引用

3rd International Conference on Intelligent Systems and Sustainable Computing, ICISSC 2023

作者： Sengan, Sudhakar Katbar, Nek Muhammad Kothalanka, Amarendra Shelke, Mayura Chinnathambi, Kalimuthan Sharma, Dilip Kumar Ammasai, Viswanathan Department of Computer Science and Engineering PSN College of Engineering and Technology Tamil Nadu Tirunelveli627451 India School of Mathematics and Statistics Central South University Hunan Changsha410083 China Department of Computer Science and Engineering Koneru Lakshmaiah Education Foundation Andhra Pradesh Vaddeswaram522502 India Department of AI & DS AISSMS IOIT Pune411001 India Deprtment of Information Technology V.S.B. College of Engineering Technical Campus Tamil Nadu Coimbatore642109 India Department of Mathematics Jaypee University of Engineering and Technology Madhya Pradesh Guna473226 India School of Computer Science and Engineering Vellore Institute of Technology Tamil Nadu Vellore632014 India

ISBN: (纸本)9789819783540

Clinical Decision Support Systems (CDSS) have emerged as crucial tools in healthcare, leveraging vast amounts of data to aid clinicians in their decision-making processes. However, the challenge of efficiently utilizing limited labelled medical data remains. This paper introduces a novel approach using Semi-supervised DC-GAN to address this challenge. Building upon the foundational principles of Generative Adversarial Networks (GANs), this proposed model augments the capabilities of traditional semi-supervised methods, optimizing their performance in the CDSS landscape. Through extensive evaluations, they compared this approach with three widely accepted semi-supervised algorithms: MixMatch, Mean Teacher, and Π-Model. The results indicate that Semi-supervised DC-GAN enhances the data utilization process and significantly improves model training, especially when working with limited labelled datasets. This research underscores the potential of GANs in revolutionizing semi-supervised learning within CDSS, paving the way for more efficient and informed clinical decisions. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Decentralized Multi-Armed Bandit Can Outperform Classic Upper Confidence Bound: A Homogeneous Case over Strongly Connected Graphs

Decentralized Multi-Armed Bandit Can Outperform Classic Uppe...

引用

IEEE Conference on Decision and Control

作者： Jingxuan Zhu Ji Liu Zhejiang Lab Department of Applied Mathematics and Statistics Stony Brook University Department of Electrical and Computer Engineering Stony Brook University

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

This paper studies a homogeneous decentralized multi-armed bandit problem, in which a network of multiple agents faces the same set of arms, and each agent aims to minimize its own regret. A fully decentralized upper confidence bound (UCB) algorithm is proposed for a multi-agent network whose neighbor relations are described by a directed graph. It is shown that the decentralized algorithm guarantees each agent to achieve a lower logarithmic asymptotic regret compared to the classic UCB algorithm, provided the neighbor graph is strongly connected. The improved asymptotic regret upper bound is reciprocally related to the maximal size of a local neighborhood within the network. The roles of graph connectivity, maximum local degree, and network size are analytically elucidated in the expression of regret.

关键词： Upper bound Directed graphs Multi-armed bandit problem Faces

来源：评论

学校读者我要写书评

暂无评论

Online Optimization for Network Resource Allocation and Comparison with Reinforcement Learning Techniques

arXiv

引用

arXiv 2023年

作者： Sid-Ali, Ahmed Lambadaris, Ioannis Zhao, Yiqiang Q. Shaikhet, Gennady Asgharnia, Amirhossein School of Mathematics and Statistics Department of Systems and Computer Engineering Carleton University OttawaON Canada

We tackle in this paper an online network resource allocation problem with job transfers. The network is composed of many servers connected by communication links. The system operates in discrete time;at each time slot, the administrator reserves resources at servers for future job requests, and a cost is incurred for the reservations made. Then, after receptions, the jobs may be transferred between the servers to best accommodate the demands. This incurs an additional transport cost. Finally, if a job request cannot be satisfied, there is a violation that engenders a cost to pay for the blocked job. We propose a randomized online algorithm based on the exponentially weighted method. We prove that our algorithm enjoys a sub-linear in time regret, which indicates that the algorithm is adapting and learning from its experiences and is becoming more efficient in its decision-making as it accumulates more data. Moreover, we test the performance of our algorithm on artificial data and compare it against a reinforcement learning method where we show that our proposed method outperforms the latter. © 2023, CC BY.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Synergetic effects of multiple junction and surface hydroxyl in Cu/CuO/Cu2O/TiO2 heterostructures towards highly efficient photocatalysts for hydrogen generation

引用

Materials Science for Energy Technologies 2025年 8卷 131-142页

作者： Subagyo, Riki Anindika, Garcelina Rizky Aufkani, Afif Akmal Zhang, Lei Ardhyananta, Hosta Burhan, R.Y. Perry Nugraheni, Zjahra Vianita Akhlus, Syafsir Bahruji, Hasliza Prasetyoko, Didik Wellia, Diana Vanda Ivansyah, Atthar Luqman Arramel Kusumawati, Yuly Department of Chemistry Faculty of Science and Analytic Data Institut Teknologi Sepuluh Nopember Surabaya60111 Indonesia Center of Excellence Applied Physics and Chemistry Nano Center Indonesia Jl PUSPIPTEK South Tangerang Banten15314 Indonesia Department of Physics National University of Singapore Singapore117551 Singapore Department of Materials and Metallurgical Engineering Faculty of Industrial Technology and Systems Engineering Institut Teknologi Sepuluh Nopember Surabaya60111 Indonesia Centre of Advanced Material and Energy Science Universiti Brunei Darussalam Jalan Tungku Link BE 1410 Brunei Department of Chemistry Faculty of Mathematics and Natural Sciences Universitas Andalas Padang25163 Indonesia Master Program in Computational Science Faculty of Mathematics and Natural Science Institut Teknologi Bandung Jalan Ganesha No. 10 Bandung40132 Indonesia Instrumentation and Computational Physics Research Group Department of Physics Faculty of Mathematics and Natural Sciences Institut Teknologi Bandung Jalan Ganesha No.10 West Java Bandung40132 Indonesia

The implementation of titanium dioxide (TiO2) as a photocatalyst material in hydrogen (H2) evolution reaction (HER) has embarked renewed interest in the past decade. Rapid electron-hole pairs recombination and wide band gap of a photo-sensitive material of TiO2 are detrimental toward the targeted catalytical reaction. In this study, we present the rational design, fabrication, photocatalytic performance of TiO2-Cu/CuO/Cu2O heterostructures (CuTi) using viable chemical reduction method. The Z-scheme and S-scheme are succesfully generated across the TiO2/CuO/Cu2O interfaces, while the Schottky junction arises on the Cu perimeters. This is evidenced from the blue shifted about 0.3 eV of Cu 2p core level determined by using X-ray photoemission spectroscopy (XPS), in combination with the formation of inverse V-shape of the Mott-Schottky plots. In addition, we find that Cu/CuO/Cu2O facilitates photon absorption range up to the visible region. The multiple heterojunction and the large number of OHsurface enhanced charge carrier transfer are associated to the suppression of photoluminescence (PL) intensity, high surface hydroxyl (OHsurface) density in CuTi probed by XPS, and fast electron transfer based on the electrochemical measurements. The presence of OHsurface inhibits the recombination of electron. A significant H2 photogeneration rate enhancement is achieved when an optimized 5 wt% Cu/CuO/Cu2O concentration is used on TiO2 to achieve 7,157.19 μmol·g−1 (1,789.30 μmol·g−1·h−1). Based on this finding, zero emission energy innitiative could be materialized under multiple heterojunctions in photocatalytic process is beneficial for enhancing the H2 production. © 2025 The Authors

关键词： Titanium dioxide

来源：评论

学校读者我要写书评

暂无评论

Online Optimization for Randomized Network Resource Allocation with Long-Term Constraints

arXiv

引用

arXiv 2023年

作者： Sid-Ali, Ahmed Lambadaris, Ioannis Zhao, Yiqiang Q. Shaikhet, Gennady Kheradmand, Shima School of Mathematics and Statistics Department of Systems and Computer Engineering Carleton University OttawaON Canada

This paper studies an online optimal resource reservation problem in communication networks. A typical network is composed of compute nodes linked by communication links. The system operates in discrete time and at each time slot, the administrator reserves server resources to meet future client requests. A cost is incurred for the made reservations. Then, after the reception of the job requests, some may be transferred from one server to another to be best accommodated at an additional transport cost. In particular, if certain job requests cannot be satisfied, a violation engenders a cost to pay for each blocked job. The goal is to minimize the overall reservation cost over finite horizons while maintaining the cumulative violation and transport costs under a certain budget limit. To tackle this problem, we propose a randomized procedure where the reservations are drawn randomly according to a sequence of probability distributions over the space of allowable reservations. The distributions are derived from an online saddle-point algorithm. For this proposed algorithm we analyze its performance by first establishing an upper bound for the associated K-benchmark regret. We then develop an upper bound for the cumulative constraint violations. Finally, we present numerical experiments where we compare the performance of our algorithm with those of some basic deterministic resource allocation policies. © 2023, CC BY.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Improved Sampling Model for the Nyquist Folding Receiver

Improved Sampling Model for the Nyquist Folding Receiver

引用

IEEE National Conference on Aerospace and Electronics (NAECON)

作者： Peter Swartz Saiyu Ren Shuxia Sun Department of Electrical Engineering Wright State University Dayton Ohio Department of Mathematics and Statistics Wright State University Dayton Ohio

ISBN: (数字)9798350367621

ISBN: (纸本)9798350367638

The Nyquist Folding Receiver is an architecture that uses Compressed Sensing to convert analog Radio Frequency signals into digital signals. Analog-to-Digital Converter architectures that implement Compressed Sensing are collectively known as Analog-to-Information. Sparse bandlimited analog signals with frequency bands above the Nyquist frequency of a traditional Analog-to-Digital Converter can be recovered by Analog-to-Information. While most Analog-to-Information architectures use Gaussian distributed random variables for Compressed Sensing measurements, the Nyquist Folding Receiver uses structured Compressed Sensing measurements that are incoherent with general sparsifying bases like the Fourier Transform. The quality of the structured Compressed Sensing measurement model sets a baseline for how effective Compressed Sensing recovery algorithms will be. Current measurement models for the Nyquist Folding Receiver don't accurately capture all aspects of the architecture. The proposed structured Compressed Sensing measurement model for the Nyquist Folding Receiver should help improve Compressed Sensing signal reconstruction accuracy and push Analog-to-Information architectures towards broader adoption within commercial Radio Frequency communication devices.

关键词： Accuracy Machine learning algorithms Current measurement Receivers Reconstruction algorithms Frequency conversion Signal reconstruction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：