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

Parametric heart activity condensed photoacoustic stimulation from MRI images

AIP Conference Proceedings 2023年第1期2523卷

作者： T. Senthil Kumar Maram Ashok M. Suresh Anand Karthikeyan Palaniappan 1Department of Electronics and Communication Engineering GRT Institute of Engineering and Technology Tiruttani Tamil Nadu India. 2Department of Computer Science and Engineering Malla Reddy Institute of Engineering and Technology Secunderabad Telangana India. 3Department of Computer Science and Engineering Sri Sairam Engineering College Chennai Tamil Nadu India. 4Department of Centre for System Design Computer Science and Engineering Chennai Institute of Technology Chennai Tamil Nadu India.

In this article, we propose a computer research approach that uses only a few tomographic optoacoustic projections to analyze main components for high-frame volumetric heart imagery is seen herein in the non-invasive imaging of a smoking rodent. This approach is beneficial for discerning periodic movements. The training process allows the heart motion information to be effectively compressed and used in a higher frame rate as prior information for image restoration. Image consistency with report book decrease in the data flow is seen to be safeguarded. We prove that the parametric motion can be effectively obtained under such conditions by focusing on moment data from a single tomographic detector. A visualization of perfusing a contrast agent in vivo indicates the possibility of recording intermittent (quasi) events not recorded in the training process. The proposed method can be used to dramatically improve optoacoustic imaging time resolution and help create more accessible and data efficiency systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Solving multi-armed bandit problems using a chaotic microresonator comb

arXiv

引用

arXiv 2023年

作者： Cuevas, Jonathan Iwami, Ryugo Uchida, Atsushi Minoshima, Kaoru Kuse, Naoya Graduate School of Sciences and Technology for Innovation Tokushima University 2-1 Minami-Josanjima Tokushima Tokushima770-8506 Japan Department of Information and Computer Sciences Saitama University 255 Shimo-okubo Sakura-ku Saitama Saitama City338-8570 Japan Graduate School of Informatics and Engineering The University of Electro-Communications 1-5-1 Chofugaoka Chofu Tokyo182-8585 Japan Institute of Post-LED Photonics Tokushima University 2-1 Minami-Josanjima Tokushima Tokushima770-8506 Japan

—The Multi-Armed Bandit (MAB) problem, foundational to reinforcement learning-based decision-making, addresses the challenge of maximizing rewards amidst multiple uncertain choices. While algorithmic solutions are effective, their computational efficiency diminishes with increasing problem complexity. Photonic accelerators, leveraging temporal and spatial-temporal chaos, have emerged as promising alternatives. However, despite these advancements, current approaches either compromise computation speed or amplify system complexity. In this paper, we introduce a chaotic microresonator frequency comb (chaos comb) to tackle the MAB problem, where each comb mode is assigned to a slot machine. Through a proof-of-concept experiment, we employ 44 comb modes to address an MAB with 44 slot machines, demonstrating performance competitive with both conventional software algorithms and other photonic methods. Further, the scalability of decision making is explored with up to 512 slot machines using experimentally obtained temporal chaos in different time slots. Power-law scalability is achieved with an exponent of 0.96, outperforming conventional software-based algorithms. Moreover, we find that a numerically calculated chaos comb accurately reproduces experimental results, paving the way for discussions on strategies to increase the number of slot machines. © 2023, CC BY.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

A Comparison Study of Constriction and Random Inertia Weight Router Replacement Methods for WMNs Using WMN-PSODGA Hybrid Intelligent System

A Comparison Study of Constriction and Random Inertia Weight...

引用

Workshops of the 34th International Conference on Advanced information Networking and Applications, WAINA 2020

作者： Ohara, Seiji Barolli, Admir Ampririt, Phudit Sakamoto, Shinji Barolli, Leonard Takizawa, Makoto Graduate School of Engineering Fukuoka Institute of Technology 3-30-1 Wajiro-Higashi Higashi-KuFukuoka811-0295 Japan Department of Information Technology Aleksander Moisiu University of Durres L.1 Rruga e Currilave Durres Albania Department of Computer and Information Science Seikei University 3-3-1 Kichijoji-Kitamachi Musashino-shiTokyo180-8633 Japan Department of Information and Communication Engineering Fukuoka Institute of Technology 3-30-1 Wajiro-Higashi Higashi-KuFukuoka811-0295 Japan Department of Advanced Sciences Faculty of Science and Engineering Hosei University Kajino-Machi Koganei-ShiTokyo184-8584 Japan

ISBN: (纸本)9783030440374

Wireless Mesh Networks (WMNs) are becoming an important networking infrastructure because they have many advantages such as low cost and increased high-speed wireless Internet connectivity. In our previous work, we implemented a Particle Swarm Optimization (PSO) based simulation system, called WMN-PSO, and a simulation system based on Genetic Algorithm (GA), called WMN-GA, for solving node placement problem in WMNs. Then, we implemented a hybrid simulation system based on PSO and distributed GA (DGA), called WMN-PSODGA. Moreover, we added in the fitness function a new parameter for the load balancing of the mesh routers called NCMCpR (Number of Covered Mesh Clients per Router). In this paper, we consider Constriction Method (CM) and Random Inertia Weight Method (RIWM). The simulation results show that CM has better performance than RIWM. © 2020, Springer Nature Switzerland AG.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of WMNs Using WMN-PSOHC-DGA Considering LDVM and RDVM Replacement Methods 34th

Performance Evaluation of WMNs Using WMN-PSOHC-DGA Consideri...

引用

34th International Conference on Advanced information Networking and Applications, AINA 2020

作者： Barolli, Admir Ohara, Seiji Sakamoto, Shinji Takizawa, Makoto Barolli, Leonard Department of Information Technology Aleksander Moisiu University of Durres L.1 Rruga e Currilave Durres Albania Graduate School of Engineering Fukuoka Institute of Technology 3-30-1 Wajiro-Higashi Higashi-Ku Fukuoka811-0295 Japan Department of Computer and Information Science Seikei University 3-3-1 Kichijoji-Kitamachi Tokyo Musashino-shi180-8633 Japan Department of Advanced Sciences Faculty of Science and Engineering Hosei University Kajino-Machi Tokyo Koganei-Shi184-8584 Japan Department of Information and Communication Engineering Fukuoka Institute of Technology 3-30-1 Wajiro-Higashi Higashi-Ku Fukuoka811-0295 Japan

ISBN: (纸本)9783030440404

The Wireless Mesh Networks (WMNs) are becoming an important networking infrastructure because they have many advantages such as low cost and increased high speed wireless Internet connectivity. In our previous work, we implemented a simulation system considering Particle Swarm Optimization (PSO), Hill Climbing (HC) and Distributed GA (DGA), called WMN-PSOHC-DGA. In this paper, we present the performance of WMNs using WMN-PSOHC-DGA simulation system considering Linearly Decreasing Vmax Method (LDVM) and Rational Decrement of Vmax Method (RDVM). Simulation results show that a good performance is achieved for RDVM compared with the case of LDVM. © 2020, Springer Nature Switzerland AG.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

A novel fuzzy trust-based secure routing scheme in flying ad hoc networks

引用

Vehicular Communications 2023年 44卷

作者： Hosseinzadeh, Mehdi Mohammed, Adil Hussein Alenizi, Farhan A. Malik, Mazhar Hussain Yousefpoor, Efat Yousefpoor, Mohammad Sadegh Ahmed, Omed Hassan Rahmani, Amir Masoud Tightiz, Lilia Institute of Research and Development Duy Tan University Da Nang Viet Nam School of Medicine and Pharmacy Duy Tan University Da Nang Viet Nam Department of Communication and Computer Engineering Faculty of Engineering Cihan University-Erbil Kurdistan Region Iraq Electrical Engineering Department College of Engineering Prince Sattam Bin Abdulaziz University Al-Kharj 11942 Saudi Arabia School of Computing and Creative Technologies College of Arts Technology and Environment (CATE) University of the West of England Frenchay Campus Coldharbour Lane Bristol BS16 1QY United Kingdom Department of Computer Engineering Dezful Branch Islamic Azad University Dezful Iran Department of Information Technology University of Human Development Sulaymaniyah Iraq Future Technology Research Center National Yunlin University of Science and Technology Yunlin Taiwan School of Computing Gachon University 1342 Seongnamdaero Seongnam 13120 South Korea

Today, many studies assess vulnerabilities, threats, and attacks in flying ad hoc networks (FANETs) to provide solutions for countermeasures. Protecting FANETs against attackers and coordinating connections are challenging. The purpose of this study is to increase and maintain communication security. In this paper, a fuzzy trust-based secure routing scheme (FTSR) is presented in FANETs. FTSR utilizes two trust assessment mechanisms, namely local trust and path trust. Local trust strategy is a distributed process for finding reliable neighboring nodes and isolating hostile nodes on the network. In this regard, only reliable nodes are allowed to contribute to the path discovery procedure. This lowers the risk of forming fake paths in FANETs. Path trust strategy is responsible for identifying hostile nodes that are not identified in the local trust process. This strategy shows a general view of the trust status of the desired path. To design this mechanism, the source node runs a fuzzy system to select the safest path between source and the destination. Finally, network simulator 2 (NS2) implements FTSR, and the results such as malicious detection rate, packet delivery ratio, packet loss, accuracy, and delay are obtained from the simulation process. These results indicate that FTSR presents better performance compared to TOPCM, MNRiRIP, and MNDA. However, FTSR takes more time to find paths compared to TOPCM. © 2023 Elsevier Inc.

关键词： Artificial intelligence (AI) Cybersecurity Flying ad hoc networks (FANETs) Fuzzy logic Routing

来源：评论

学校读者我要写书评

暂无评论

Theoretical analysis of medical healthcare chatbot system

引用

AIP Conference Proceedings 2022年第1期2446卷

作者： M. Suguna D. Prakash A. Amritha M. Saumiya A. Devi Prabha 1Department of Information Science and Engineering Kumaraguru College of Technology Coimbatore Tamilnadu India 2Electrical Engineer ThinkAside Technology Coimbatore Tamilnadu India 3Department of Computer Science and Engineering Kumaraguru College of Technology Coimbatore Tamilnadu India

A Chatbot is a computer program which enables us to make communication through our text or voice and get reply through Artificial Intelligence (AI) technology. A chatbot can be used in different applications like gaming, customer service and e-commerce site. Chatbots are developed to interact with received messages automatically presenting the experience of human-to-human interaction in digital mode. Chatbots provide responses to messages containing keywords that are matched using machine learning technique to adapt the responses to fit the respective situations. A developing number of hospitals, private health centers, and medical clinics currently utilize Chatbots on their internet sites. These chatbots connect with the potential patients to visit the location of the medical centers, to help themselves discovering the right specialists for their treatment, to book appointments with the doctors, and to get access to the right treatment for cure. Using AI in a domain where human lives have the chances of becoming a question brings up and act as replacement to the issues of the need to assign a human staff to a task. This theoretical analysis AI based healthcare chatbot system will help hospitals to offer healthcare online support 24 x 7, answering intense as well as general queries appropriately.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Compressive Sensing-Based Grant-Free Massive Access for 6G Massive Communication

arXiv

引用

arXiv 2023年

作者： Gao, Zhen Ke, Malong Mei, Yikun Qiao, Li Chen, Sheng Ng, Derrick Wing Kwan Poor, H. Vincent The MIIT Key Laboratory of Complex-Field Intelligent Sensing Beijing Institute of Technology Beijing100081 China Jiaxing314019 China The Advanced Technology Research Institute Beijing Institute of Technology Jinan250307 China The Wireless Product Division Ruijie Network Co. Ltd. Fuzhou350108 China The School of Information and Electronics Beijing Institute of Technology Beijing100081 China The School of Electronics and Computer Science University of Southampton SouthamptonSO17 1BJ United Kingdom The School of Electrical Engineering and Telecommunications University of New South Wales Sydney2052 Australia The Department of Electrical and Computer Engineering Princeton University PrincetonNJ08542 United States

The advent of the sixth-generation (6G) of wireless communications has given rise to the necessity to connect vast quantities of heterogeneous wireless devices, which requires advanced system capabilities far beyond existing network architectures. In particular, such massive communication has been recognized as a prime driver that can empower the 6G vision of future ubiquitous connectivity, supporting Internet of Human-Machine-Things for which massive access is critical. This paper surveys the most recent advances toward massive access in both academic and industry communities, focusing primarily on the promising compressive sensing-based grant-free massive access paradigm. We first specify the limitations of existing random access schemes and reveal that the practical implementation of massive communication relies on a dramatically different random access paradigm from the current ones mainly designed for human-centric communications. Then, a compressive sensing-based grant-free massive access roadmap is presented, where the evolutions from single-antenna to large-scale antenna array-based base stations, from single-station to cooperative massive multiple-input multiple-output systems, and from unsourced to sourced random access scenarios are detailed. Finally, we discuss the key challenges and open issues to shed light on the potential future research directions of grant-free massive access. Copyright © 2023, The Authors. All rights reserved.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

A survey on solving dilemmas of adapting blockchain in different applications

引用

AIP Conference Proceedings 2022年第1期2460卷

作者： C. Vijayalakshmi S. Metilda Florence S. Suthir 1Department of Computer Science and Engineering SRM Institute of Technology and Science Kattankulathur Tamilnadu India 2Department of Computer Science and Engineering Panimalar Engineering College Chennai Tamilnadu India 3Department of Information Technology SRM Institute of Technology and Science Kattankulathur Tamilnadu India 4Department of Computer science and engineering VIT Bhopal University Madhya Pradesh India

This work is going to address the dilemmas and challenges that researchers face when selecting blockchain to solve a problem in a particular domain. Since blockchain is an emerging technology and it is intended to solve many security issues in various domains, People have confusion when to use blockchain and when not to use it. The aim is to investigate which are the different applications where blockchain technology can be a solution and also it aims to discuss which type of applications does not need blockchain to be incorporated. The main contribution of this paper is Survey on blockchain technology analyzing when to use blockchain technology, Survey on when need not use blockchain technology, some research problems where blockchain can be implemented and a final discussion about blockchain adaption.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Design of an IoT approach for security surveillance system for industrial process monitoring using Raspberry-Pi

引用

AIP Conference Proceedings 2022年第1期2519卷

作者： G. Manikandan D. Karunkuzhali D. Geetha V. Kavitha 1Department of Computer Science and Engineering Kings Engineering College Sriperumbudur Tamil Nadu India 2Department of Information Technology Panimalar Engineering College Chennai Tamil Nadu India 3Department of Information Science and Engineering BNM Institute of Technology Bengaluru Karnataka India 4Department of Computer Science and Engineering Sri Sairam Engineering College Chennai Tamil Nadu India

The Internet of Things (IoT) is a new development for several applications, including intelligent cities, physical security, intelligent grids, asset management and logistics, e-health, etc. Security issues now face industry for a day. The gas created by the machinery and stored asset concentrations are highly risky. Maintenance has become a major problem in maintaining the minimal rights and safety of clothing workers The technicians of clothing plants face labyrinths, and one of them is undoubtedly broken out of fire. Investors lose their right and the sector’s importance gets untouched. We have suggested in this study a system that can detect fires but provide a spot for the area impacted. For control combined with several sensors and camera, Raspberry Pi 3 is employed. In order to prevent false alert, we supplied validation of the fire suspected system. In addition to the image of the afflicted area and device, the service will next deliver a message. If the administration can confirm or reject the conviction, the system raises an alert quickly and a computerized message is sent to the local fire department if the admin is confirming that the issue breaks out.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improving the security of asymmetric secret sharing scheme and its new applications

引用

Journal of information Security and Applications 2025年 93卷

作者： Keiichi Iwamura Ahmad Akmal Aminuddin Mohd Kamal Department of Electrical Engineering Tokyo University of Science 6-3-1 Niijuku Katsushika 125-8585 Tokyo Japan Department of Information and Computer Technology Tokyo University of Science 6-3-1 Niijuku Katsushika 125-8585 Tokyo Japan

In conventional ( k , n ) threshold secret sharing, secret information or input can be recovered by collecting k shares from n servers, regardless of the honesty of the player. However, in asymmetric secret sharing, the input remains unrecoverable even if the attacker collects all shares from all data servers. Asymmetric secret sharing provides an asymmetric structure in which only an honest/authorized player can regain the input by combining shares from the data servers with pseudorandom numbers that are generated by the authorized player to complete the required k shares. Nevertheless, the asymmetric secret sharing scheme does not rely on information-theoretic security but rather on computational security. In this study, we first demonstrate the vulnerability of the conventional computationally secure asymmetric secret sharing scheme by presenting possible attacks on the scheme. We then show that by introducing true random numbers, an asymmetric secret sharing scheme with information-theoretic security can be achieved under certain conditions. We also identify and provide a detailed discussion of the conditions required to achieve information-theoretic security. However, the required conditions result in a reduction in storage efficiency on the server. We implemented our proposed method and evaluated its efficiency under these conditions, and showed that the execution time remains within the acceptable range and has a minimal effect on practical use. Moreover, we show that the proposed method can realize new applications that are not possible with conventional secret sharing schemes, such as secure data management that does not leak secret information even if the entire dataset in the cloud containing the shares is compromised, and communication, including IoT communication.

关键词： Secret sharing Asymmetric secret sharing information-theoretic security Tampering detection Secure communication Data storage Cloud storage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：