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

2024 International Telecommunications Conference, ITC-Egypt 2024

作者： El-Sheikh, Mohamed M. Bayoumy, Aya Ahmed, Nada M. Mohamed Eldeeb, Amany Rabea, Fatma I. Nawar, Amira A. Khattap, Mohamed G. Galal Eldeen Mohamed Ali Hassan, Hend Mostafa, Mariam Ibrahim, Nayra Ramadan, Reem Refaat, Yomna Khaled, Mennatallah Maher, Ali Abd Elaziz, Mohamed Gamal Abdellatif Ibrahim, Ahmed Radiology and Medical Imaging Faculty of Applied Health Sciences Galala University Suez435611 Egypt Faculty of Computer Science and Engineering Galala University Suez435611 Egypt Artificial Intelligence Science Program Faculty of Computer Science and Engineering Galala University Suez435611 Egypt Air Defense College Department of Electronics and Electrical Communications Engineering Alexandria Egypt

ISBN: (纸本)9798350351408

This paper introduces an alternative technique for diagnosing Acute Ischemic Stroke within the IoMT environment. In the proposed approach, the collected data is transmitted to a cloud-based center where the technique utilizes EfficientNet, a deep learning model, designed to extract features from MRI images thereby enhancing the detection of acute ischemic infarctions. The performance of EfficientNet is compared against two other models, CNN and MobileNet, demonstrating its superior efficacy through metrics such as accuracy, precision, recall, and F1-score, which stand at 92.31%, 92.28%, 92.33%, and 92.30%, respectively. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

FPGA implementation of low cost and low power chaotic encryption scheme based on a discrete-space chaotic map

引用

Multimedia Tools and Applications 2025年 1-22页

作者： Moreira Bezerra, João Inácio Machado, Gustavo Iankowski Soares, Rafael Valduga de Almeida Camargo, Vinícius Molter, Alexandre Post Graduate Program in Computer Science Universidade Federal de Pelotas Rio Grande do Sul Pelotas96010610 Brazil Graduate Program in Computer Engineering Universidade Federal de Pelotas Rio Grande do Sul Pelotas96010610 Brazil Post Graduate Program in Mathematical Modeling Universidade Federal de Pelotas Rio Grande do Sul Capão do Leão96160000 Brazil

The exponential growth of the number of devices connected to the Internet and the use of IoT applications increases the amount of data exchange over public channels in low-cost and low-power embedded systems. Images are the most widely shared files, and standard symmetric algorithms such as the Advanced Encryption Standard (AES) are optimized for text but not image encryption. Consequently, new approaches like chaotic encryption have attracted researchers’ interest. Chaotic encryption schemes have been analyzed mostly from a software standpoint, but recent advancements in the field, through the use of discrete chaotic maps, enabled the development of simpler hardware implementations of ciphers with promising reductions in power and cost and increased performance. This work presents the Field-programmable Gate Array (FPGA) implementation of a simultaneous permutation-diffusion chaotic encryption scheme utilizing a discrete-space chaotic map. The FPGA implementation of the cipher is analyzed considering area, maximum frequency, and power consumption, and comparisons are made with the AES. The proposed algorithm has a satisfactory trade-off between area, power and performance, obtaining a peak throughput 59% higher than state-of-the-art symmetric ciphers in the literature. Thus, the proposed cipher shows that chaotic ciphers are viable for both high-performance and low-power embedded devices. Tests verified the security of the proposed cipher against statistical, differential, brute-force, and chosen plain-text attacks. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Optimization of Node Reduction Using BRKGA for GNN-Based Traffic Speed Forecasting 13

Optimization of Node Reduction Using BRKGA for GNN-Based Tra...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Inokuchi, Yuto González, Pedro Henrique Mendonça, Israel Aritsugi, Masayoshi Graduate School of Science and Technology Kumamoto University Kumamoto Japan Federal University of Rio de Janeiro System Engineering and Computer Science Program Rio de Janeiro Brazil Kumamoto University Faculty of Advanced Science and Technology Kumamoto Japan

ISBN: (纸本)9798350308365

While Spatio-Temporal Graph Convolutional Networks (STGCNs) are an effective method for traffic speed fore-casting, their training and inference tend to be time-consuming. In this paper, we aim to refine these networks by strategically reducing their number of nodes, thereby boosting computational efficiency. The nodes in these graphs represent data observed for road segments, and by analyzing the interconnections and layout of the graph, we can identify nodes with minimal contribution to overall performance. Removing these nodes can potentially decrease computation time while maintaining the prediction accuracy. We employ the Biased Random-Key Genetic Algorithm (BRKGA) to identify a good set of nodes for removal, based on a predefined percentage reduction of the original graph size (e.g., retaining 95 % of the original graph). We evaluate different graph size configurations, ranging from 95 % to 70 % node retention, to determine the least impactful node set performance. Our experiments on three real-world datasets reveal that reducing nodes can decrease computation time by up to 29%, and as a byproduct of removing noise, even improve the prediction accuracy. © 2024 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Speaker Motion Patterns during Self-repairs in Natural Dialogue 24

Speaker Motion Patterns during Self-repairs in Natural Dialo...

引用

24th ACM International Conference on Multimodal Interaction, ICMI 2022

作者： Ozkan, Elif Ecem Gurion, Tom Hough, Julian Healey, Patrick G.T. Jamone, Lorenzo School of Electronic Engineering and Computer Science Queen Mary University of London United Kingdom Cognitive Science Research Group School of Electronic Engineering and Computer Science Queen Mary University of London United Kingdom

ISBN: (纸本)9781450393898

An important milestone for any agent in interaction with humans on a regular basis is to achieve natural and efficient methods of communication. Such strategies should be derived on the hallmarks of human-human interaction. So far, the work in embodied conversational agents (ECAs) implementing such signals has been predominantly through imitating human-like positive back-channels, such as nodding, rather than active interaction. The field of Conversation Analysis (CA) focusing on natural human dialogue suggests that people continuously collaborate on achieving mutual understanding by frequently repairing misunderstandings as they happen. Detecting repairs from speech in real-time is challenging, even with state-of-the-art Natural Language Processing (NLP) models. We present specific human motion patterns during key moments of interaction, namely self initiated self-repairs, which would help agents to recognise and collaboratively solve speaker trouble. The features we present in this paper are the pairwise joint distances of head and hands which are more discriminative than the positions themselves. © 2022 ACM.

关键词： Motion analysis

来源：评论

学校读者我要写书评

暂无评论

Asynchronous I/O Persistence for In-Memory Database Servers: Leveraging io_uring to Optimize Redis Persistence 17th

Asynchronous I/O Persistence for In-Memory Database Servers:...

引用

17th International Conference on Cloud Computing, CLOUD 2024, Held as Part of the Services Conference Federation, SCF 2024

作者： Chen, Le-Gao Li, Yanzhi Laohakangvalvit, Tipporn Sugaya, Midori Innovative Global Program College of Engineering Shibaura Institute of Technology Tokyo Koto City Japan Department of Computer Science and Engineering College of Engineering Shibaura Institute of Technology Tokyo Koto City Japan

ISBN: (纸本)9783031771521

With constant hardware improvements allowing for increasingly large memory sizes, in-memory database servers have become an attractive option for various cloud applications. Even though in-memory database servers store all data in memory, there is still a need to persist data onto an I/O device for maintenance, updates, or protection against server crashes. In high throughput environments, persistence happens often, significantly hindering server throughput performance. Although popular in-memory database servers such as Redis or Dragonfly DB have adopted asynchronous I/O for socket operations, none have extended this approach for persistence. This results in significantly longer time taken for persistence, leading to prolonged reduced throughput. Given the recent introduction of io_uring, which has demonstrated significant performance improvements over past asynchronous I/O APIs, we have decided to implement it into Redis to evaluate its effectiveness in reducing these performance overheads. Our findings indicate that io_uring can significantly enhance performance in use cases with medium to large payload sizes but may hinder performances in use cases involving small payload sizes due to higher complexity and higher operation cost per datapoint. This method can likely be applied to other servers, such as Dragonfly DB and Memcached, to achieve similar benefits in appropriate scenarios. Additionally, in-memory database server persistence can serve as valuable benchmarks for further io_uring development and optimization. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Efficient Hyperparameter Optimization Using Deep Q-Network and BRKGA 13

Efficient Hyperparameter Optimization Using Deep Q-Network a...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Kobayashi, Kosei Aritsugi, Masayoshi González, Pedro Henrique Mendonça, Israel Graduate School of Science and Technology Kumamoto University Kumamoto Japan Faculty of Advanced Science and Technology Kumamoto University Kumamoto Japan System Engineering and Computer Science Program Federal University of Rio de Janeiro Rio de Janeiro Brazil

ISBN: (纸本)9798350308365

Hyperparameter optimization (HPO) is paragon to maximize performance when designing machine learning models. Among different HPO methods, Genetic Algorithm (GA) based optimization is considered effective because it allows a wide and diverse range of solutions to be explored. However, GA's exploratory nature makes this type of algorithm to evaluate many solutions that do not improve the overall performance. This is specially costly when the objective function to be evaluated is time-consuming, like in the HPO field. In this paper, we propose an efficient hybrid algorithm that is able to reduce computational cost by combining deep reinforcement learning with the Biased Random Key Genetic Algorithm (BRKGA), a variant of genetic algorithms. Our reinforcement learning agent has a decision-making role during the population's fitness calculation, in which it filters out chromosomes that would not improve the overall fitness of the population. The agent uses small amounts of pre-trained data to identify trends in potentially good solutions, and carry out its decision process. We conduct experiments on eight different datasets to assess the effectiveness of the proposed method, and the results show that the proposed method can significantly reduce the computation time of hyperparameter search using BRKGA (up to 44% reduction in computational time) without compromising the quality of the solution (no statistically difference in results). © 2024 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Correntropy-Based Data Selective Adaptive Filtering

引用

IEEE Transactions on Circuits and Systems I: Regular Papers 2024年第2期71卷 754-766页

作者： Chien, Ying-Ren Wu, Sheng-Teng Tsao, Hen-Wai Diniz, Paulo S.R. Adaptive and Autonomous Communication Laboratory Department of Electrical Engineering National Ilan University Yilan City260007 Taiwan College of Electrical Engineering and Computer Science Graduate Institute of Communication Engineering National Taiwan University Taipei10617 Taiwan Program of Electrical Engineering Department of Electronics and Computer Engineering COPPE/Poli Universidade Federal do Rio de Janeiro Rio de Janeiro68504 Brazil

Data selection can be used in conjunction with adaptive filtering algorithms to avoid unnecessary weight updating and thereby reduce computational overhead. This paper presents a novel correntropy-based data selection method as an alternative to conventional data selection mechanisms based on squared error values. We developed a variable correntropy sensing algorithm to maximize the instantaneous correntropy function for the Gaussian kernel function to mitigate the impact of impulse noise and other forms of noise that can be disregarded in data selection. The proposed data selection mechanism can be implemented with any adaptive filtering algorithm. In simulations, the proposed method (implemented with the least mean squared algorithm) outperformed comparable error-based data selection schemes in terms of hit rate and miss rate, and the resulting weight updating ratio was close to the expected weight updating ratio. © 2023 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.

关键词： Adaptive filters

来源：评论

学校读者我要写书评

暂无评论

Efficient Node Reduction Heuristic for GNN-Based Traffic Speed Forecasting 11

Efficient Node Reduction Heuristic for GNN-Based Traffic Spe...

引用

11th IEEE/ACM International Conference on Big Data Computing, Applications and Technologies, BDCAT 2024

作者： Inokuchi, Yuto Gonzalez, Pedro Henrique Aritsugi, Masayoshi Mendonca, Israel Kumamoto University Graduate School of Science and Technology Kumamoto Japan Federal University of Rio de Janeiro System Engineering and Computer Science Program Rio de Janeiro Brazil Kumamoto University Faculty of Advanced Science and Technology Kumamoto Japan

ISBN: (纸本)9798350367300

In this paper, we aim to reduce the number of nodes from Graph Neural Networks (GNNs), thereby simplifying models and reducing computational costs. GNNs are highly effective for various tasks, such as prediction, classification, and clustering, due to their ability to learn node and edge attributes and relationships, and they have been utilized for intelligent transportation systems recently by converting sensor networks into graph structures. Deep spatio-temporal neural networks, including Spatio-Temporal Graph Convolutional Networks (STGCNs), capture spatial and temporal dependencies, making them suitable for traffic speed forecasting, traffic demand prediction, and travel time estimation. Despite their success, GNNs face challenges in industrial applications due to significant memory usage and time consumption. In this paper, we propose a new approach to node reduction that outperforms existing methods in computational efficiency. Our experiments on two real-world traffic datasets demonstrate that using the heuristic and edge information to reduce nodes can cut computation time of optimization up to 95% and, by eliminating noise, can even enhance prediction accuracy. © 2024 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

PROM: A Phrase-level Copying Mechanism with Pre-training for Abstractive Summarization 30

PROM: A Phrase-level Copying Mechanism with Pre-training for...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Ma, Xinbei Gong, Yeyun He, Pengcheng Zhao, Hai Duan, Nan Department of Computer Science and Engineering Shanghai Jiao Tong University China Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Shanghai Jiao Tong University China Microsoft Research Asia China

ISBN: (纸本)9782493814104

Based on the remarkable achievements of pre-trained language models in abstractive summarization, the copying mechanism has proved helpful by improving the factuality, stability, and overall performance. This work proposes PROM, a new PhRase-level cOpying Mechanism that enhances attention on n-grams, which can be applied to zero-shot summarization with pre-training. PROM adds an indicator layer to explicitly pick up tokens in n-gram that can be copied from the source, and calculates an auxiliary loss for the copying prediction. Empirical studies show that PROM makes significant improvements in fine-tuning on benchmarks. In the zero-shot setting, PROM is utilized in the self-supervised pre-training on raw corpora and provides new general baselines on a wide range of summarization datasets. Further analysis shows that PROM performs more reasonable copying and contributes to faithfulness. Our code is publicly available at https://***/xbmxb/PROM. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Towards Efficient and Diverse Generative Model for Unconditional Human Motion Synthesis 24

Towards Efficient and Diverse Generative Model for Unconditi...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Yu, Hua Liu, Weiming Bai, Jiapeng Gui, Xu Hou, Yaqing Ong, Yewsoon Zhang, Qiang Key Laboratory of Social Computing and Cognitive Intelligence Ministry of Education School of Computer Science and Technology Dalian University of Technology Dalian China College of Computer Science Zhejiang University Hangzhou China National and Local Joint Engineering Laboratory of Computer Aided Design School of Software Engineering Dalian University Dalian China College of Computing and Data Science Nanyang Technological University Singapore Singapore Yonsei University Seoul Korea Republic of

ISBN: (纸本)9798400706868

Recent generative methods have revolutionized the way of human motion synthesis, such as Variational Autoencoders (VAEs), Generative Adversarial Networks (GANs), and Denoising Diffusion Probabilistic Models (DMs). These methods have gained significant attention in human motion fields. However, there are still challenges in unconditionally generating highly diverse human motions from a given distribution. To enhance the diversity of synthesized human motions, previous methods usually employ deep neural networks (DNNs) to train a transport map that transforms Gaussian noise distribution into real human motion distribution. According to Figalli's regularity theory, the optimal transport map computed by DNNs frequently exhibits discontinuities. This is due to the inherent limitation of DNNs in representing only continuous maps. Consequently, the generated human motions tend to heavily concentrate on densely populated regions of the data distribution, resulting in mode collapse or mode mixture. To address the issues, we propose an efficient method called MOOT for unconditional human motion synthesis. First, we utilize a reconstruction network based on GRU and transformer to map human motions to latent space. Next, we employ convex optimization to match the noise distribution with the latent space distribution of human motions through the Optimal Transport (OT) map. Then, we combine the extended OT map with the generator of reconstruction network to generate new human motions. Thereby overcoming the issues of mode collapse and mode mixture. MOOT generates a latent code distribution that is well-behaved and highly structured, providing a strong motion prior for various applications in the field of human motion. Through qualitative and quantitative experiments, MOOT achieves state-of-the-art results surpassing the latest methods, validating its superiority in unconditional human motion generation. © 2024 ACM.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：