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

6th International Conference on Industry 4.0 and Smart Manufacturing, ISM 2024

作者： Putri Ardyanti, Anak Agung Ayu Xie, Zhiqiang Karnyoto, Andrea Stevens Pardamean, Bens Estiyanti, Ni Made School of Computer Science and Technology Harbin University of Science and Technology Harbin150000 China Faculty of Information Technology and Design Primakara University Bali 80226 Indonesia Bioinformatics and Data Science Research Center Bina Nusantara University Jakarta11480 Indonesia Computer Science Department BINUS Graduate Program Master of Computer Science Bina Nusantara University Jakarta 11480 Indonesia School of Management and Business University of Debrecen Debrecen Hungary

The industry is rapidly transitioning from the 4.0 era to the 5.0 era, prompting renewed interest among scholars in scheduling problems. They allow operations to process and assemble various components simultaneously. This bibliometric analysis provides a comprehensive understanding of the diverse research perspectives on the potential challenges of integrated scheduling within the framework. We identified 357 Scopus articles and analysed co-occurrence keyword (CNK) by VOSViewer tools and Global Citation Score (GCS) by Scopus tools. The research data obtained from 1993 to 2023 mainly in the subject areas of Engineering, computer science, Maths, and others. CNK identified six cluster keywords, and nine most cited articles based on normalised GCS. These results contribute to our understanding of the development of scheduling algorithms, shifting from an emphasis on manufacturing transfers to contemporary demand-centric research directions. Furthermore, this research provides a valuable perspective for policymakers, plant personnel, and manufacturing managers to make informed decisions. © 2025 The Authors. Published by Elsevier B.V.

关键词： Job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

Unleashing the Potential of Decentralized Federated Learning in Healthcare: A Comprehensive Survey on Insights and Challenges 9

Unleashing the Potential of Decentralized Federated Learning...

引用

9th IEEE International Conference on data science in Cyberspace, DSC 2024

作者： Cheng, Haibo Liu, Wenjian Qu, Youyang Fu, Kexue Wang, Qinyuan City University of Macau Faculty of Data Science China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Jinan China

ISBN: (纸本)9798350391367

Federated learning (FL) is a distributed learning method that reduces data transmission and privacy risks. However, the existence of a central server may become a target of attackers, resulting in an increased risk of user privacy leakage. The emergence of Decentralized Federated Learning (DFL) is posited to enhance data privacy and system reliability by reducing reliance on central servers and enhancing local data control, especially in the medical field, where personal health data is protected. This research investigates the application of (DFL) in the medical domain, focusing on its limitations. This study employs a systematic literature review, adhering to PRISMA guidelines, to comprehensively understand DFL's current landscape and challenges in healthcare. The key findings highlight four principal obstacles faced by DFL: security and privacy, communication efficiency, data and model heterogeneity, and incentive mechanisms. It also explores the potential for DFL to facilitate personalized healthcare treatments by large datasets distributed across various medical institutions. This research fills a significant void by systematically reviewing DFL technologies in healthcare. It provides insights into applications, challenges, and future directions for participants seeking secure and efficient healthcare data handling. © 2024 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Reversible data Hiding With Secret Encrypted Image Sharing and Adaptive Coding

引用

IEEE Internet of Things Journal 2025年第13期12卷 23933-23945页

作者： Fang, Guangtian Wang, Feng Zhao, Chenbin Qin, Chuan Chang, Ching-Chun Chang, Chin-Chen Fujian University of Technology College of Computer Science and Mathematics Fuzhou350118 China Fujian University of Technology College of Computer Science and Mathematics Key Laboratory of Big Data Mining and Applications Fuzhou350118 China Monash University Faculty of IT Department of Software Systems and Cybersecurity VIC3800 Australia Ministry of Education School of Cyber Science and Engineering Key Laboratory of Aerospace Information Security and Trusted Computing Wuhan430072 China University of Shanghai for Science and Technology School of Optical-Electrical and Computer Engineering Shanghai200093 China Feng Chia University Information and Communication Security Research Center Taichuang 40724 Taiwan Feng Chia University Department of Information Engineering and Computer Science Taichung40724 Taiwan

To ensure the security of image information and facilitate efficient management in the cloud, the utilization of reversible data hiding in encrypted images (RDHEI) has emerged as pivotal. However, most existing RDHEI schemes suffer from lower security and limited embedding capacity. To tackle these challenges, we propose a reversible data hiding with secret encrypted image sharing and adaptive coding scheme. Specifically, in the encryption phase, we introduce an improved secret sharing (SS) encryption method based on the chinese remainder theorem for polynomials (CRTP). This method not only improves the security of encrypted images but also vacates a larger room for embedding. In the embedding phase, we introduce an adaptive coding embedding approach using XOR preservation (XORP) and huffman coding, which provides high embedding capacity. Experimental results and security analysis demonstrate that our proposed encryption method achieves optimal values in security indicators for encrypted images, such as information entropy, histograms, NPCR and UACI. The proposed embedding method is superior to some state-of-the-art schemes in terms of embedding capacity. Furthermore, in datasets BOSSBase and BOWS2, the average embedding rates of the proposed embedding approach can reach 2.1745 bpp and 2.0656 bpp, respectively. © 2025 IEEE.

关键词： Cryptography Encryption Security data mining Adaptive coding Correlation Cloud computing Polynomials Image coding Streaming media

来源：评论

学校读者我要写书评

暂无评论

Pushing AI to wireless network edge: an overview on integrated sensing, communication, and computation towards 6G

引用

science China(Information sciences) 2023年第3期66卷 7-25页

作者： Guangxu ZHU Zhonghao LYU Xiang JIAO Peixi LIU Mingzhe CHEN Jie XU Shuguang CUI Ping ZHANG Shenzhen Research Institute of Big Data Future Network of Intelligence Institute (FNii) The Chinese University of Hong Kong (Shenzhen) School of Science and Engineering (SSE) The Chinese University of Hong Kong (Shenzhen) State Key Laboratory of Advanced Optical Communication Systems and Networks School of Electronics Peking University Department of Electrical and Computer Engineering and Institute for Data Science and Computing University of Miami Peng Cheng Laboratory State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications

Pushing artificial intelligence(AI) from central cloud to network edge has reached board consensus in both industry and academia for materializing the vision of artificial intelligence of things(AIoT) in the sixth-generation(6G) era. This gives rise to an emerging research area known as edge intelligence, which concerns the distillation of human-like intelligence from the vast amount of data scattered at the wireless network edge. Typically, realizing edge intelligence corresponds to the processes of sensing, communication,and computation, which are coupled ingredients for data generation, exchanging, and processing, ***, conventional wireless networks design the three mentioned ingredients separately in a task-agnostic manner, which leads to difficulties in accommodating the stringent demands of ultra-low latency, ultra-high reliability, and high capacity in emerging AI applications like auto-driving and metaverse. This thus prompts a new design paradigm of seamlessly integrated sensing, communication, and computation(ISCC) in a taskoriented manner, which comprehensively accounts for the use of the data in downstream AI tasks. In view of its growing interest, this study provides a timely overview of ISCC for edge intelligence by introducing its basic concept, design challenges, and enabling techniques, surveying the state-of-the-art advancements, and shedding light on the road ahead.

关键词： sixth-generation (6G) edge intelligence artificial intelligence of things (AIoT) integrated sensing communication and computation (ISCC)

来源：评论

学校读者我要写书评

暂无评论

Using GPT and authentic contextual recognition to generate math word problems with difficulty levels

引用

Education and Information Technologies 2024年第13期29卷 1-29页

作者： Hwang, Wu-Yuin Utami, Ika Qutsiati Graduate Institute of Network Learning Technology National Central University Taoyuan 320317 Taiwan Department of Computer Science and Information Engineering National Dong Hwa University Hualien 974301 Taiwan Data Science Technology Engineering Department Faculty of Advanced Technology and Multidiscipline Universitas Airlangga Surabaya 60115 Indonesia

Automatic generation of math word problems (MWPs) is a challenging task in Natural Language Processing (NLP), particularly connecting it to real-life problems because it can benefit students in developing a higher level of mathematical thinking. However, most of the MWPs are presented within a scholastic setting in a decontextualized way. This paper describes a prototype system that generates authentic math word problems (i.e., real-life problems) using authentic contextual recognition with controlled difficulty levels. Our innovative approach includes the acquisition of authentic contextual information through recognition technology, an instructional-based prompt generator for three different difficulty levels, and question generation through the Generative Pre-trained Transformer (GPT) model. We evaluated the performance of the system in terms of the quality of generated questions using automatic evaluation and human evaluation. Further, we assessed the usability of the system using heuristic evaluation. The automatic evaluation showed our generated MWPs were relevant for geometry topics and varied in sentence generation. The human evaluation found our system generated more realistic problems with satisfactory language quality and mathematical validity. Our system also produced more questions with higher difficulty levels based on human evaluation. Heuristic evaluation captured the usability of the system and highlighted the potential to be applied in a pedagogical context for mathematics learning. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Authentic context Difficulty level Math word problems Natural language processing Primary school Question generation Technology education

来源：评论

学校读者我要写书评

暂无评论

Logical Relation Modeling and Mining in Hyperbolic Space for Recommendation 40

Logical Relation Modeling and Mining in Hyperbolic Space for...

引用

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Tan, Yanchao Lv, Hang Zhou, Zihao Guo, Wenzhong Xiong, Bo Liu, Weiming Chen, Chaochao Wang, Shiping Yang, Carl College of Computer and Data Science Fuzhou University Fuzhou China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Institute for Artificial Intelligence University of Stuttgart Stuttgart Germany College of Computer Science Zhejiang University Hangzhou China Emory University Department of Computer Science Atlanta United States

ISBN: (纸本)9798350317152

The sparse interactions between users and items have aggravated the difficulty of their representations in recommender systems. Existing methods leverage tags to alleviate the sparsity problem but ignore prevalent logical relations among items and tags (e.g., membership, hierarchy, and exclusion), which can be leveraged to enhance the accuracy of modeling user preferences and conducting recommendations. To this end, we propose to extract logical relations among item tags from existing tag taxonomies and exploit the individual strengths of the Poincaré and the Lorentz models in hyperbolic space for logical relation modeling towards enhanced recommendations. Moreover, we find that the logical relations directly extracted from existing tag taxonomies can be inaccurate and coarse. Therefore, we further devise innovative consistency-based and granularity-based weighting mechanisms based on user behavior patterns for data-driven logical relation mining that can be jointly optimized along with recommendations in an end-to-end fashion. Extensive experiments on four real-world benchmark datasets show drastic performance gains brought by our proposed framework, which constantly achieves an average of 8.25% improvement over state-of-the-art competitors regarding both Recall and NDCG metrics. Insightful case studies further demonstrate that our automatically refined logical relations are highly accurate and interpretable. © 2024 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Movable Antenna-Aided Hybrid Beamforming for Multi-User Communications

引用

IEEE Transactions on Vehicular Technology 2025年第6期74卷 9899-9903页

作者： Zhang, Yichi Zhang, Yuchen Zhu, Lipeng Xiao, Sa Tang, Wanbin Eldar, Yonina C. Zhang, Rui University of Electronic Science and Technology of China National Key Laboratory of Wireless Communications Chengdu611731 China University of Electronic Science and Technology of China National Key Laboratory of Science and Technology on Communications Chengdu611731 China Kash Institute of Electronics and Information Industry Kash844000 China Weizmann Institute of Science Faculty of Mathematics and Computer Science Rehovot7610001 Israel National University of Singapore Department of Electrical and Computer Engineering 117583 Singapore Chinese University of Hon g Kong Shenzhen China Shenzhen Research Institute of Big Data Shenzhen518172 China

In this correspondence, we propose a movable antenna (MA)-aided multi-user hybrid beamforming scheme with a sub-connected structure, where multiple movable sub-arrays can independently change their positions within different local regions. To maximize the system sum rate, we jointly optimize the digital beamformer, analog beamformer, and positions of sub-arrays, under the constraints of unit modulus, finite movable regions, and power budget. Due to the non-concave/non-convex objective function/constraints, as well as the highly coupled variables, the formulated problem is challenging to solve. By employing fractional programming, we develop an alternating optimization framework to solve the problem via a combination of Lagrange multipliers, penalty method, and gradient descent. Numerical results reveal that the proposed MA-aided hybrid beamforming scheme significantly improves the sum rate compared to its fixed-position antenna (FPA) counterpart. Moreover, with sufficiently large movable regions, the proposed scheme with sub-connected MA arrays even outperforms the fully-connected FPA array. © 1967-2012 IEEE.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

A deep learning fusion model for accurate classification of brain tumours in Magnetic Resonance images

引用

CAAI Transactions on Intelligence Technology 2024年第4期9卷 790-804页

作者： Nechirvan Asaad Zebari Chira Nadheef Mohammed Dilovan Asaad Zebari Mazin Abed Mohammed Diyar Qader Zeebaree Haydar Abdulameer Marhoon Karrar Hameed Abdulkareem Seifedine Kadry Wattana Viriyasitavat Jan Nedoma Radek Martinek Department of Information Technology Lebanese French UniversityErbilIraq Department of Computer Science University of ZakhoZakhoKurdistan RegionIraq Department of Computer Science College of ScienceNawroz UniversityDuhokKurdistan RegionIraq Department of Artificial Intelligence College of Computer Science and Information TechnologyUniversity of AnbarRamadiIraq Department of Telecommunications VSB‐Technical University of OstravaOstravaCzech Republic Department of Cybernetics and Biomedical Engineering VSB‐Technical University of OstravaOstravaCzech Republic Department of Computer Network and Information Security Technical College of Informatics-AkreDuhok Polytechnic UniversityDuhokIraq Information and Communication Technology Research Group Scientific Research CenterAl‐Ayen UniversityThi‐QarIraq College of Computer Sciences and Information Technology University of KerbalaKarbalaIraq College of Agriculture Al‐Muthanna UniversitySamawahIraq Department of Applied Data Science Noroff University CollegeKristiansandNorway Faculty of Commerce and Accountancy Chulalongkorn Business SchoolChulalongkorn UniversityBangkokThailand

Detecting brain tumours is complex due to the natural variation in their location, shape, and intensity in images. While having accurate detection and segmentation of brain tumours would be beneficial, current methods still need to solve this problem despite the numerous available approaches. Precise analysis of Magnetic Resonance Imaging (MRI) is crucial for detecting, segmenting, and classifying brain tumours in medical diagnostics. Magnetic Resonance Imaging is a vital component in medical diagnosis, and it requires precise, efficient, careful, efficient, and reliable image analysis techniques. The authors developed a Deep Learning (DL) fusion model to classify brain tumours reliably. Deep Learning models require large amounts of training data to achieve good results, so the researchers utilised data augmentation techniques to increase the dataset size for training models. VGG16, ResNet50, and convolutional deep belief networks networks extracted deep features from MRI images. Softmax was used as the classifier, and the training set was supplemented with intentionally created MRI images of brain tumours in addition to the genuine ones. The features of two DL models were combined in the proposed model to generate a fusion model, which significantly increased classification accuracy. An openly accessible dataset from the internet was used to test the model's performance, and the experimental results showed that the proposed fusion model achieved a classification accuracy of 98.98%. Finally, the results were compared with existing methods, and the proposed model outperformed them significantly.

关键词： brain tumour deep learning feature fusion model MRI images multi‐classification

来源：评论

学校读者我要写书评

暂无评论

A Review of Social Media Sentiment Analysis Using Machine Learning To Enhance Stock Market Prediction 2

A Review of Social Media Sentiment Analysis Using Machine Le...

引用

2nd DMIHER International Conference on Artificial Intelligence in Healthcare, Education and Industry, IDICAIEI 2024

作者： Raut, Rohini Saratkar, Saniya Thakre, Gayatri Thute, Trupti Chaudhari, Aarti Gourshettiwar, Palash Datta Meghe Institute of Higher Education and Research Faculty of Engineering and Technology Department of Artificial Intelligence and Data Science Maharashtra Wardha442001 India Datta Meghe Institute of Higher Education and Research Faculty of Engineering and Technology Department of Computer Science and Medical Engineering Maharashtra Wardha442001 India

ISBN: (纸本)9798331528713

Predicting stock prices is a critical financial activity that is frequently impacted by sentiment analysis, machine learning, and data mining approaches. This examination looks at a variety of stock price prediction methods, including artificial neural networks, graph-based approaches, time series analysis, and classic machine learning techniques such as Support Vector Machine, K-Nearest Neighbor, and Random Forest. The article assesses the problems and efficacy of various methodologies, including a thorough examination of sentiment analysis in social media to enhance stock market predictions. By examining multiple research, this study provides a complete evaluation of various prediction algorithms and reveals their shortcomings, such as overfitting, non-stationary data, and the complexity of financial transactions. It helps academics and practitioners construct more accurate and dependable stock forecasting models by merging financial data with sentiment analysis. The study also discusses rising trends and new potential for further study, especially hybrid models and advanced deep learning approaches to improve the accuracy of stock forecasts. © 2024 IEEE.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

Bandit-feedback online multiclass classification: variants and tradeoffs 24

Bandit-feedback online multiclass classification: variants a...

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Yuval Filmus Steve Hanneke Idan Mehalel Shay Moran Faculty of Computer Science Faculty of Mathematics Technion Israel Department of Computer Science Purdue University Faculty of Computer Science Technion Israel Faculty of Mathematics Faculty of Computer Science Faculty of Data and Decision Sciences Technion Israel and Google research Israel

ISBN: (纸本)9798331314385

Consider the domain of multiclass classification within the adversarial online setting. What is the price of relying on bandit feedback as opposed to full information? To what extent can an adaptive adversary amplify the loss compared to an oblivious one? To what extent can a randomized learner reduce the loss compared to a deterministic one? We study these questions in the mistake bound model and provide nearly tight answers. We demonstrate that the optimal mistake bound under bandit feedback is at most O(k) times higher than the optimal mistake bound in the full information case, where k represents the number of labels. This bound is tight and provides an answer to an open question previously posed and studied by Daniely and Helbertal ['13] and by Long ['17, '20], who focused on deterministic learners. Moreover, we present nearly optimal bounds of 0(k) on the gap between randomized and deterministic learners, as well as between adaptive and oblivious adversaries in the bandit feedback setting. This stands in contrast to the full information scenario, where adaptive and oblivious adversaries are equivalent, and the gap in mistake bounds between randomized and deterministic learners is a constant multiplicative factor of 2. In addition, our results imply that in some cases the optimal randomized mistake bound is approximately the square-root of its deterministic parallel. Previous results show that this is essentially the smallest it can get. Some of our results are proved via a reduction to prediction with expert advice under bandit feedback, a problem interesting on its own right. For this problem, we provide a randomized algorithm which is nearly optimal in some scenarios.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：