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

A Novel High-Efficiency Transaction Verification Scheme for Blockchain Systems

computer Modeling in Engineering & sciences 2024年第5期139卷 1613-1633页

作者： Jingyu Zhang Pian Zhou Jin Wang Osama Alfarraj Saurabh Singh Min Zhu School of Computer&Communication Engineering Changsha University of Science&TechnologyChangsha410015China Science and Technology on Information Systems Engineering Laboratory School of Systems EngineeringNational University of Defense TechnologyChangsha410073China Computer Science Department King Saud UniversityRiyadh11437Saudi Arabia Department of Artificial Intelligence and Big Data Woosong UniversityDaejeon34606South Korea College of Information Science and Technology Zhejiang Shuren UniversityHangzhou310015China

Blockchain can realize the reliable storage of a large amount of data that is chronologically related and verifiable within the *** technology has been widely used and has developed rapidly in big data systems across various *** increasing number of users are participating in application systems that use blockchain as their underlying *** the number of transactions and the capital involved in blockchain grow,ensuring information security becomes *** the verification of transactional information security and privacy has emerged as a critical ***-based verification methods can effectively eliminate the need for centralized third-party ***,the efficiency of nodes in storing and verifying blockchain data faces unprecedented *** address this issue,this paper introduces an efficient verification scheme for transaction ***,it presents a node evaluation module to estimate the activity level of user nodes participating in transactions,accompanied by a probabilistic analysis for all ***,this paper optimizes the conventional transaction organization form,introduces a heterogeneous Merkle tree storage structure,and designs algorithms for constructing these heterogeneous *** analyses and simulation experiments conclusively demonstrate the superior performance of this *** verifying the same number of transactions,the heterogeneous Merkle tree transmits less data and is more efficient than traditional *** findings indicate that the heterogeneous Merkle tree structure is suitable for various blockchain applications,including the Internet of *** scheme can markedly enhance the efficiency of information verification and bolster the security of distributed systems.

关键词： Blockchain architecture transaction verification information security heterogeneous Merkle tree distributed systems

来源：评论

学校读者我要写书评

暂无评论

Improving Event Coreference Resolution Using Prompt Learning and U-shaped Module 4

Improving Event Coreference Resolution Using Prompt Learning...

引用

4th International Conference on computer science and Blockchain, CCSB 2024

作者： Zhang, Mengyao Long, Jun Huang, Wenti School of Software Xinjiang University Urumqi China Institute of Big Data Central South University Changsha China School of Computer Science and Engineering Hunan University of Science and Technology Changsha China

ISBN: (纸本)9798350356502

Event Coreference Resolution (ECR) focuses on clustering event mentions that allude to identical actual events. Previous research primarily focuses on encoding event mentions without incorporating human interpretations, making it difficult to integrate human-summarized rules for guiding the ECR task. Furthermore, the semantic relations between event mentions have not been thoroughly explored, which impacts coreference judgment. To address these issues, we first utilize the powerful Longformer to acquire event representations at the document level. In addition, we introduce a prompt learning template to better emphasize event types and parameters, enhancing the interaction between event modeling and coreference judgment. Ultimately, we create matching vectors for event mentions using tensor matching and incorporate a U-shaped module to effectively identify the semantic relationships among these mentions, which enhances coreference discrimination. DPTU surpasses other ECR models on the KBP2017 dataset in cause of some experiments. © 2024 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

PROVABLE SIM-TO-REAL TRANSFER IN CONTINUOUS DOMAIN WITH PARTIAL OBSERVATIONS 11

PROVABLE SIM-TO-REAL TRANSFER IN CONTINUOUS DOMAIN WITH PART...

引用

11th International Conference on Learning Representations, ICLR 2023

作者： Hu, Jiachen Zhong, Han Jin, Chi Wang, Liwei School of Computer Science Peking University China Center for Data Science Peking University China Department of Electrical and Computer Engineering Princeton University United States National Key Laboratory of General Artificial Intelligence School of Intelligence Science and Technology Peking University Center for Data Science Peking University Beijing Institute of Big Data Research China

Sim-to-real transfer, which trains RL agents in the simulated environments and then deploys them in the real world, has been widely used to overcome the limitations of gathering samples in the real world. Despite the empirical success of the sim-to-real transfer, its theoretical foundation is much less understood. In this paper, we study the sim-to-real transfer in continuous domain with partial observations, where the simulated environments and real-world environments are modeled by linear quadratic Gaussian (LQG) systems. We show that a popular robust adversarial training algorithm is capable of learning a policy from the simulated environment that is competitive to the optimal policy in the real-world environment. To achieve our results, we design a new algorithm for infinite-horizon average-cost LQGs and establish a regret bound that depends on the intrinsic complexity of the model class. Our algorithm crucially relies on a novel history clipping scheme, which might be of independent interest. © 2023 11th International Conference on Learning Representations, ICLR 2023. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Enhanced Identification of Care Preference Documentation in Patients’ Discharge Summaries Using Pre-trained Large Language Models 1

Enhanced Identification of Care Preference Documentation in ...

引用

1st IEEE International Conference on Artificial Intelligence for Medicine, Health and Care, AIMHC 2024

作者： Arora, Saksham Khayal, Inas S. Department of Computer Science Dartmouth College HanoverNH United States Dartmouth Institute & Biomedical Data Science Geisel School of Medicine at Dartmouth Dept. of Computer Science Dartmouth College HanoverNH United States

ISBN: (纸本)9798350371987

Improving patient-centered care necessitates accurate documentation of care preferences, a crucial aspect often underrepresented in administrative data. Most studies apply care documentation to specific patient populations, rather than the more appropriately broad population of ‘seriously ill’ patients. This study addresses this gap, first by matching decedent patients to non-decedent counterparts by using propensity score matching, accounting for important variables like age, gender, primary diagnoses, and patient co-morbidities, and then by leveraging transformer-based machine learning models, exhibiting an improvement over traditional keyword-based search methods. We trained and fine-tuned Bio_ClinicalBERT and ClinicalLongformer models on a large dataset of patient discharge summaries, enhancing their signal-to-noise ratio by focusing on key textual aspects, thereby capturing contextually nuanced mentions of care preference documentation. These models demonstrated high sensitivity and specificity compared to industry-standard keyword-search methods, proving adept at interpreting complex clinical concepts. This study highlights the potential of transformer-based models specifically trained for clinical domain tasks. Our findings not only contribute to enhancing end-of-life communication and aligning treatment with patients’ care objectives but also pave the way for future research in this promising domain, with potential implications for improving patient care quality. ©2024 IEEE.

关键词： Large datasets

来源：评论

学校读者我要写书评

暂无评论

A Deep Phishing Email Detection Model Combing Multi-Features Based on Word Frequency and Contextual Semantics 4

A Deep Phishing Email Detection Model Combing Multi-Features...

引用

4th International Conference on Communication Technology and Information Technology, ICCTIT 2024

作者： Liu, Yuntian Zhu, Erzhou Ma, Zhujuan Anhui University School of Computer Science and Technology Hefei230601 China Anhui Xinhua University School of Big Data and Artificial Intelligence Hefei230088 China

ISBN: (纸本)9798331528973

Due to the ability to automatically extract phishing features without relying on expert knowledge, deep learning methods have been widely applied in the research of phishing email classification and detection. However, the unique structure of emails and the complexity of publishing strategies mean that current deep learning-based phishing email detection studies still require further performance enhancement. To effectively detect phishing emails, this paper proposes TFW-CNBL (Term Frequency and Word2Vec-CNN and BiLSTM), a deep detection model for phishing emails based on the fusion of term frequency and contextual semantic multi-features. The TFW-CNBL model generates a hybrid feature vector that comprehensively understands the characteristics of phishing emails by integrating term frequency and contextual information. The model combines a convolutional neural network (CNN) with an attention mechanism and a bidirectional long short-term memory network (BiLSTM), creating an underlying architecture capable of rapid text classification. The paper utilized a publicly available dataset from Kaggle containing 18,650 samples to train and test the TFW-CNBL model. Experimental results indicate that the TFW-CNBL model can effectively detect phishing emails, achieving an average accuracy, precision, recall, and F1 score of 0.984, 0.986, 0.989, and 0.987, respectively. © 2024 IEEE.

关键词： Phishing

来源：评论

学校读者我要写书评

暂无评论

Automatic extraction of lightweight and efficient neural network architecture of heavy convolutional architectures to predict microsatellite instability from hematoxylin and eosin histology in gastric cancer

引用

Neural Computing and Applications 2024年第25期36卷 15295-15321页

作者： Rostami, Habib Ashkpour, Maryam Behzadi-Khormouji, Hamed Mokhtari, Maral Khayati, Armin Keshavarz, Ahmad Talatian Azad, Saeed Tabesh, Yahya Computer Engineering Department Faculty of Intelligent Systems Engineering and Data Science Persian Gulf University Bushehr75168 Iran Artificial Intelligence and Intelligent Healthcare Lab Artificial Intelligence and Data Mining Research Group Faculty of Intelligent Systems Engineering and Data Science ICT Research Institute Persian Gulf University Bushehr75168 Iran Faculty of New Science and Technologies University of Tehran Tehran Iran Department of Computer Science Imec-IDLab University of Antwerp Sint-Pietersvliet 7 Antwerp2000 Belgium Shahid Faghihi Hospital Shiraz University of Medical Sciences Shiraz Iran Department of Computer Science Engineering and IT School of Electrical and Computer Engineering Shiraz University Shiraz Iran Electrical Engineering Department Faculty of Intelligent Systems Engineering and Data Science Persian Gulf University Bushehr75168 Iran IoT and Signal Processing Research Group Faculty of Intelligent Systems Engineering and Data Science ICT Research Institute Persian Gulf University Bushehr75168 Iran Department of Mathematical Sciences Sharif University of Technology Tehran Iran

Cancers have emerged as a significant concern due to their impact on public health and society. The examination and interpretation of tissue sections stained with Hematoxylin and Eosin (H&E) play a crucial role in disease assessment, particularly in cases like gastric cancer. Microsatellite instability (MSI) is suggested to contribute to the carcinogenesis of specific gastrointestinal tumors. However, due to the nonspecific morphology observed in H&E-stained tissue sections, MSI determination often requires costly evaluations through various molecular studies and immunohistochemistry methods in specialized molecular pathology laboratories. Despite the high cost, international guidelines recommend MSI testing for gastrointestinal cancers. Thus, there is a pressing need for a new diagnostic modality with lower costs and widespread applicability for MSI detection. This study aims to detect MSI directly from H&E histology slides in gastric cancer, providing a cost-effective alternative. The performance of well-known deep convolutional neural networks (DCNNs) and a proposed architecture are compared. Medical image datasets are typically smaller than benchmark datasets like ImageNet, necessitating the use of off-the-shelf DCNN architectures developed for large datasets through techniques such as transfer learning. Designing an architecture proportional to a custom dataset can be tedious and may not yield desirable results. In this work, we propose an automatic method to extract a lightweight and efficient architecture from a given heavy architecture (e.g., well-known off-the-shelf DCNNs) proportional to a specific dataset. To predict MSI instability, we extracted the MicroNet architecture from the Xception network using the proposed method and compared its performance with other well-known architectures. The models were trained using tiles extracted from whole-slide images, and two evaluation strategies, tile-based and whole-slide image (WSI)-based, were employed and comp

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Aerial Reliable Collaborative Communications for Terrestrial Mobile Users via Evolutionary Multi-Objective Deep Reinforcement Learning

引用

IEEE Transactions on Mobile Computing 2025年第7期24卷 5731-5748页

作者： Sun, Geng Xiao, Jian Li, Jiahui Wang, Jiacheng Kang, Jiawen Niyato, Dusit Mao, Shiwen the College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China the College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore the School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore the School of Automation Guangdong University of Technology Guangzhou510641 China the Department of Electrical and Computer Engineering Auburn University AuburnAL36849-5201 United States

—Unmanned aerial vehicles (UAVs) have emerged as the potential aerial base stations (BSs) to improve terrestrial communications. However, the limited onboard energy and antenna power of a UAV restrict its communication range and transmission capability. To address these limitations, this work employs collaborative beamforming through a UAV-enabled virtual antenna array to improve transmission performance from the UAV to terrestrial mobile users, under interference from non-associated BSs and dynamic channel conditions. Specifically, we introduce a memory-based random walk model to more accurately depict the mobility patterns of terrestrial mobile users. Following this, we formulate a multi-objective optimization problem (MOP) focused on maximizing the transmission rate while minimizing the flight energy consumption of the UAV swarm. Given the NP-hard nature of the formulated MOP and the highly dynamic environment, we transform this problem into a multi-objective Markov decision process and propose an improved evolutionary multi-objective reinforcement learning algorithm. Specifically, this algorithm introduces an evolutionary learning approach to obtain the approximate Pareto set for the formulated MOP. Moreover, the algorithm incorporates a long short-term memory network and hyper-sphere-based task selection method to discern the movement patterns of terrestrial mobile users and improve the diversity of the obtained Pareto set. Simulation results demonstrate that the proposed method effectively generates a diverse range of non-dominated policies and outperforms existing methods. Additional simulations demonstrate the scalability and robustness of the proposed CB-based method under different system parameters and various unexpected circumstances. © 2025 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

A Novel Approach for Heart Disease Classification using Cascaded XGBoost Algorithm 3

A Novel Approach for Heart Disease Classification using Casc...

引用

3rd International Conference on Automation, Computing and Renewable Systems, ICACRS 2024

作者： Rajitha, M. Megala, S. Santhana School of Computer Studies RVS College of Arts and Science Sulur Coimbatore India Artificial Intelligence and Data Science SNS College of Engineering Coimbatore India Department of Computer technology Hindustan College of Arts and Science Coimbatore India

ISBN: (纸本)9798331532420

Heart disease remains a leading cause of mortality worldwide. Accurate and timely diagnosis is crucial for effective treatment and prevention. This research proposes a novel approach using a cascaded XGBoost model to improve the accuracy and efficiency of heart disease diagnosis. With gradient boosting, the cascaded XGBoost model effectively handles complex interactions within the dataset, leading to superior performance compared to traditional machine learning techniques like logistic regression, support vector machines, and decision trees. The proposed model was evaluated on a standard heart disease dataset, demonstrating significant improvements in terms of accuracy, precision, and recall. Furthermore, the model's ability to identify key factors contributing to heart disease provides valuable insights for clinical decision-making. This research highlights the potential of machine learning techniques, particularly cascaded XGBoost, in advancing the field of heart disease diagnosis and improving patient outcomes. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Image Matching Algorithm Under Adverse Conditions Based on SIFT 14

Image Matching Algorithm Under Adverse Conditions Based on S...

引用

14th International Conference on Information Technology in Medicine and Education, ITME 2024

作者： Chen, Hao Cao, Xinrong Li, Zuoyong Lin, Lihui Fuzhou University College of Computer and Big Data Fuzhou350108 China Minjiang University Fujian Provincial Key Laboratory of Information Processing and Intelligent Control School of Computer and Big Data Fuzhou350121 China Wuyi University Fujian Key Laboratory of Big Data Application and Intellectualization for Tea Industry School of Mathematics and Computer Science Fujian354300 China

ISBN: (纸本)9798350356670

Image matching technology is crucial in computer vision applications. However, the traditional SIFT (Scale-Invariant Feature Transform) algorithm often faces challenges under adverse conditions, such as a high number of mismatched points and few accurately matched points. Additionally, in practical scenarios, environmental factors like lighting changes and image blurring further reduce image similarity. Therefore, this paper proposes an improved SIFT-based image matching algorithm to address these challenges. First, SIFT is used to extract image features, and a bidirectional FLANN (Fast Library for Approximate Nearest Neighbors) matching strategy is employed to initially filter out incorrect features. Then, the RANSAC (Random Sample Consensus) algorithm is used to screen out unreliable matching point pairs. Finally, the matching accuracy is evaluated based on the remaining pure matching point pairs. Experimental results demonstrate that, compared to the traditional SIFT algorithm, this improved algorithm achieves higher matching accuracy and robustness under adverse conditions, exhibiting superior performance. © 2024 IEEE.

关键词： Image matching

来源：评论

学校读者我要写书评

暂无评论

Don’t Ignore the Drive of Curiosity: Rethinking Subtleties Between Universality of Commonsense Knowledge and Excellence of Large Language Models

引用

SN computer science 2024年第6期5卷 798页

作者： Wang, Chao Chen, Tao Liu, Jingping School of Future Technology Shanghai University Shanghai China Institute of Artificial Intelligence Shanghai University Shanghai China Shanghai Key Laboratory of Data Science School of Computer Science Fudan University Shanghai China School of Information Science and Engineering East China University of Science and Technology Shanghai China

Commonsense reasoning is one of the abilities necessary for artificial intelligence to be as intelligent as humans. However, how to make AI understand commonsense has been a problem that has plagued artificial intelligence for more than 60 years. Existing efforts focus more on the means of knowledge acquisition and strive to enrich the capacity of commonsense knowledge (CSK) bases and dimensions of CSK through advanced methods. Unfortunately, this exuberance has obscured a general consideration of CSK, such as how to follow human habits to obtain the most representative knowledge we need to understand the world. In this paper, this representative knowledge is referred to as core CSK. The influence of core CSK is extensive, and it constitutes almost the fundamental element of human life and the most fundamental cognition of the world. Harnessing human curiosity to find solutions to the above problems is an effective and straightforward route. Specifically, we focus on a special corpus to mine core CSK, namely, why-questions. For example, we can harvest “the sky is blue” from “why is the sky blue?”. To this end, we propose a novel method to extract CSK from why-questions, which mainly consist of two modules. The first is a question classification module used to determine whether a question contains CSK. In this module, we propose a classifier based on a one-sided bootstrapping method and design several informative features for the classifier. The second is a crowdsourcing module used to improve the quality of the extracted commonsense. We conduct extensive experiments, and the experimental results show that our method effectively mines CSK from question corpora. Furthermore, statistical analysis demonstrates the feasibility of this curiosity-driven approach, implying that we provide a basic idea for collecting core CSK. Remarkably, today’s outstanding large language models do not have such simple knowledge summarization capabilities, demonstrating the barrier between

关键词： Classification Core Commonsense knowledge Crowdsourcing Curiosity Psychologically

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：