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

2nd International Conference on Robotics, Artificial Intelligence and Intelligent Control, RAIIC 2023

作者： Liang, Yihui Gou, Hongshan Liu, Guisong Huang, Sibo University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu China University of Electronic Science and Technology of China Zhongshan Institute School of Computer Zhongshan China Guiyang Institute of Humanities and Technology College of Big Data and Information Engineering Guiyang China Southwestern University of Finance and Economics School of Computing and Artificial Intelligence Chengdu China Huizhou University Network and Information Centre Huizhou China

ISBN: (纸本)9798350328004

Image matting is a foundation task in the field of computer vision. Pixel-pair-optimization-based image matting methods have attracted lots of attention due to their distinct advantages on parallelization and handling spatially disconnected foregrounds. However, these methods struggle when the computing time is limited. To address this issue, this study presents the image matting method based on matting pyramid and surrogate model (IMMPSM). IMMPSM speeds up the process of pixel pair optimization by replaces the evolutionary algorithm in the pyramid matting framework, which consumes a lot of computing time, with the efficient surrogate-model-based method. The constructed surrogate model is reused by the presented surrogate model share strategy to save computing time. Specifically, the constructed surrogate model is shared with the pixel pair optimization subproblem adjacent to current subproblem avoiding repeated computation on the surrogate model construction. Extensive experimental results show that IMMPSM can provide acceptable alpha mattes even under limited computing time. © 2023 IEEE.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Unlocking the Capabilities of Thought: A Reasoning Boundary Framework to Quantify and Optimize Chain-of-Thought 38

Unlocking the Capabilities of Thought: A Reasoning Boundary ...

引用

38th Conference on Neural information Processing Systems, NeurIPS 2024

作者： Chen, Qiguang Qin, Libo Wang, Jiaqi Zhou, Jinxuan Che, Wanxiang Research Center for Social Computing and Information Retrieval China Harbin Institute of Technology China School of Computer Science and Engineering Central South University China The Chinese University of Hong Kong Hong Kong

Chain-of-Thought (CoT) reasoning has emerged as a promising approach for enhancing the performance of large language models (LLMs) on complex reasoning tasks. Recently, a series of studies attempt to explain the mechanisms underlying CoT, aiming to deepen the understanding of its efficacy. Nevertheless, the existing research faces two major challenges: (1) a lack of quantitative metrics to assess CoT capabilities and (2) a dearth of guidance on optimizing CoT performance. Motivated by this, in this work, we introduce a novel reasoning boundary framework (RBF) to address these challenges. To solve the lack of quantification, we first define a reasoning boundary (RB) to quantify the upper-bound of CoT and establish a combination law for RB, enabling a practical quantitative approach applicable to various real-world CoT tasks. To address the lack of optimization, we propose three categories of RBs. We further optimize these categories with combination laws focused on RB promotion and reasoning path optimization for CoT improvement. Through extensive experiments on 27 models and 5 tasks, the study validates the existence and rationality of the proposed framework. Furthermore, it explains the effectiveness of 10 CoT strategies and guides optimization from two perspectives. We hope this work can provide a comprehensive understanding of the boundaries and optimization strategies for reasoning in LLMs. Our code and data are available at https://***/LightChen233/reasoning-boundary. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficiency Management of Electronic Communication information Storage in Multithreaded Networks 3

Efficiency Management of Electronic Communication Informatio...

引用

3rd International Conference on Machine Learning and Big Data Analytics for IoT Security and Privacy, SPIoT2023

作者： Yang, Xinsheng Qi, Yongjun Zhang, Shukun School of Electrical and Information Engineering Guangdong Baiyun University Guangdong Guangzhou510450 China Faculty of Megadata and Computing Guangdong Baiyun University Guangdong Guangzhou510450 China School of Information and Communication Technology Mongolian University of Science and Technology Bayanzurkh district Ulaanbaatar13341 Mongolia

The emergence of the Internet has brought revolutionary changes to modern information technology. The development of electronic communication information storage technology facilitates people to access information anytime and anywhere, effectively achieving resource sharing. However, traditional methods scatter communication information to all nodes, but neglect the extraction of electronic communication information association features, resulting in low information storage efficiency. This article analyzes the efficiency management of electronic communication information storage in multi-threaded networks and sets up a control experiment. Comparing the method proposed in this article with traditional methods, this study focuses on five aspects: information redundancy storage, information space utilization, productivity, data accuracy, and data transmission efficiency. It is concluded that the average information redundancy storage capacity of traditional electronic information storage methods is 8.35 x 107 T which is 6 x 107 T higher than using multi wire network electronic communication information storage methods. It indicates that traditional redundant information occupies a large amount of storage space, and its storage value exceeds the upper limit of electronic communication information storage. This means that the stored information may be overwritten by redundant information, resulting in the loss of stored information. The experimental results show that using the method proposed in this paper for electronic communication information storage results in a high distribution density of storage space and a significant improvement in information storage efficiency. © 2023 The Authors. Published by Elsevier B.V.

关键词： Storage efficiency

来源：评论

学校读者我要写书评

暂无评论

CurvDrop: A Ricci Curvature Based Approach to Prevent Graph Neural Networks from Over-Smoothing and Over-Squashing 23

CurvDrop: A Ricci Curvature Based Approach to Prevent Graph ...

引用

32nd ACM World Wide Web Conference, WWW 2023

作者： Liu, Yang Zhou, Chuan Pan, Shirui Wu, Jia Li, Zhao Chen, Hongyang Zhang, Peng Academy of Mathematics and Systems Science Chinese Academy of Sciences China Amss Chinese Academy of Science School of Cyber Security University of Chinese Academy of Science China School of Information and Communication Technology Griffith University Australia School of Computing Macquarie University Australia Hangzhou link2do Technology China Research Center for Graph Computing Zhejiang Lab China Cyberspace Institute of Advanced Technology Guangzhou University China

ISBN: (纸本)9781450394161

Graph neural networks (GNNs) are powerful models to handle graph data and can achieve state-of-the-art in many critical tasks including node classification and link prediction. However, existing graph neural networks still face both challenges of over-smoothing and over-squashing based on previous literature. To this end, we propose a new Curvature-based topology-aware Dropout sampling technique named CurvDrop, in which we integrate the Discrete Ricci Curvature into graph neural networks to enable more expressive graph models. Also, this work can improve graph neural networks by quantifying connections in graphs and using structural information such as community structures in graphs. As a result, our method can tackle the both challenges of over-smoothing and over-squashing with theoretical justification. Also, numerous experiments on public datasets show the effectiveness and robustness of our proposed method. The code and data are released in https://***/liu-yang-maker/Curvature-based-Dropout. © 2023 ACM.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Fake Twitter Followers Detection using Machine Learning Approach 2

Fake Twitter Followers Detection using Machine Learning Appr...

引用

2nd International Conference on Business Analytics for technology and Security, ICBATS 2023

作者： Zeshan Shabbir, Muhammad Naseer, Iftikhar Akhter, Shamim Abubakar, Muhammad Issa, Ghassan F. Hassaan Mehmood, Muhammad Comsats University Faculty of Information and Technology Islamabad Pakistan The Superior University Faculty of Computer Science & Information Technology Lahore Pakistan Minhaj University School of Library & Information Sciences Lahore Pakistan Fast School of Computing National University of Computer and Emerging Sciences Lahore Pakistan Skyline University College School of Information Technology University City Sharjah Sharjah1797 United Arab Emirates NCBA&E School of Computer Science Lahore Pakistan Applied Science Private Universit Applied Science Research Center Amman11937 Jordan

ISBN: (纸本)9798350335644

Fake user accounts on social media are a serious threat. Artificial intelligence can play an important role in getting rid of fake user accounts. Twitter has a problem with fake accounts that are run by automated bots. These bots are used for bad things like spamming, sabotaging trends, and getting more followers. In this research, publicly available information about Twitter users, such as their activity patterns, profile information, and tweets, to figure out how real each one is. Twitter's API and other ways of getting information will be used to get user data. The proposed model consists of a machine learning technique, and it detects whether the user accounts are real or fake. Various algorithms such as logistic regression, long short-term memory, K-mean, and random forest are applied to evaluate the proposed model. The experimental results show that the random forest algorithm has obtained the highest accuracy 0.7557, a precision of 0.7277, and F1 of 0.7943 among all other algorithms. © 2023 IEEE.

关键词： Logistic regression

来源：评论

学校读者我要写书评

暂无评论

DeepWare: Imaging Performance Counters With Deep Learning to Detect Ransomware

引用

IEEE Transactions on Computers 2023年第3期72卷 600-613页

作者： Ganfure, Gaddisa Olani Wu, Chun-Feng Chang, Yuan-Hao Shih, Wei-Kuan Dire Dawa University Institute of Technology School of Computing Department of Computer Science Dire Dawa1487 Ethiopia Harvard University Department of Computer Science Cambridge United States Academia Sinica Institute of Information Science Taipei115 Taiwan National Tsing Hua University Department of Computer Science Hsinchu City300 Taiwan

In the year passed, rarely a month passes without a ransomware incident being published in a newspaper or social media. In addition to the rise in the frequency of ransomware attacks, emerging attacks are very effective as they utilize sophisticated techniques to bypass existing organizational security perimeter. To tackle this issue, this paper presents 'DeepWare,' which is a ransomware detection model inspired by deep learning and hardware performance counter (HPC). Different from previous works aiming to check all HPC results returned from a single timing for every running process, DeepWare carries out a simple yet effective concept of 'imaging hardware performance counters with deep learning to detect ransomware,' so as to identify ransomware efficiently and effectively. To be more specific, DeepWare monitors the system-wide change in the distribution of HPC data. By imaging the HPC values and restructuring the conventional CNN model, DeepWare can address HPC's nondeterminism issue by extracting the event-specific and event-wise behavioral features, which allows it to distinguish the ransomware activity from the benign one effectively. The experiment results across ransomware families show that the proposed DeepWare is effective at detecting different classes of ransomware with the 98.6% recall score, which is 84.41%, 60.93%, and 21% improvement over RATAFIA, OC-SVM, and EGB models respectively. DeepWare achieves an average MCC score of 96.8% and nearly zero false-positive rates by using just a 100 ms snapshot of HPC data. This timeliness of DeepWare is critical on the ground that organizations and individuals have the opportunity to take countermeasures in the first stage of the attack. Besides, the experiment conducted on unseen ransomware families such as CoronaVirus, Ryuk, and Dharma demonstrates that DeepWare has excellent potential to be a useful tool for zero-day attack detection. © 1968-2012 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Empowering Diagnosis: Cutting-Edge Segmentation and Classification in Lung Cancer Analysis

引用

Computers, Materials & Continua 2024年第6期79卷 4963-4977页

作者： Iftikhar Naseer Tehreem Masood Sheeraz Akram Zulfiqar Ali Awais Ahmad Shafiq Ur Rehman Arfan Jaffar Faculty of Computer Sciences&Information Technology The Superior UniversityLahore54000Pakistan Intelligent Data Visual Computing Research(IDVCR) Lahore54000Pakistan Information System Department College of Computer and Information SciencesImam Mohammad Ibn Saud Islamic University(IMSIU)Riyadh11432Saudi Arabia School of Computer Science and Electronic Engineering(CSEE) University of EssexWivenhoe ParkColchesterCO43SQUK

Lung cancer is a leading cause of global mortality *** detection of pulmonary tumors can significantly enhance the survival rate of ***,various Computer-Aided Diagnostic(CAD)methods have been developed to enhance the detection of pulmonary nodules with high ***,the existing method-ologies cannot obtain a high level of specificity and *** present study introduces a novel model for Lung Cancer Segmentation and Classification(LCSC),which incorporates two improved architectures,namely the improved U-Net architecture and the improved AlexNet *** LCSC model comprises two distinct *** first stage involves the utilization of an improved U-Net architecture to segment candidate nodules extracted from the lung ***,an improved AlexNet architecture is employed to classify lung *** the first stage,the proposed model demonstrates a dice accuracy of 0.855,a precision of 0.933,and a recall of 0.789 for the segmentation of candidate *** suggested improved AlexNet architecture attains 97.06%accuracy,a true positive rate of 96.36%,a true negative rate of 97.77%,a positive predictive value of 97.74%,and a negative predictive value of 96.41%for classifying pulmonary cancer as either benign or *** proposed LCSC model is tested and evaluated employing the publically available dataset furnished by the Lung Image Database Consortium and Image Database Resource Initiative(LIDC-IDRI).This proposed technique exhibits remarkable performance compared to the existing methods by using various evaluation parameters.

关键词： Lung cancer segmentation AlexNet U-Net classification

来源：评论

学校读者我要写书评

暂无评论

Local and Global Feature-Aware Dual-Branch Networks for Plant Disease Recognition

引用

植物表型组学（英文） 2024年第4期6卷 828-840页

作者： Jianwu Lin Xin Zhang Yongbin Qin Shengxian Yang Xingtian Wen Tomislav Cernava Quirico Migheli Xiaoyulong Chen Text Computing & Cognitive Intelligence Engineering Research Center of National Education Ministry College of Computer Science and TechnologyGuizhou UniversityGuiyang 550025China State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang 550025China College of Big Data and Information Engineering Guizhou UniversityGuiyang 550025China Guizhou-Europe Environmental Biotechnology and Agricultural Informatics Oversea Innovation Center in Guizhou University Guizhou Provincial Science and Technology DepartmentGuiyang 550025China Text Computing & Cognitive Intelligence Engineering Research Center of National Education Ministry College of Computer Science and TechnologyGuizhou UniversityGuiyang 550025China State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang 550025China College of Big Data and Information Engineering Guizhou UniversityGuiyang 550025China Guizhou-Europe Environmental Biotechnology and Agricultural Informatics Oversea Innovation Center in Guizhou University Guizhou Provincial Science and Technology DepartmentGuiyang 550025China College of Big Data and Information Engineering Guizhou UniversityGuiyang 550025China School of Biological Sciences Faculty of Environmental and Life SciencesUniversity of SouthamptonSouthampton S017 1BJUK Dipartimento di Agraria and NRD-Nucleo di Ricerca sulla Desertificazione Università degli Studi di SassariSassariItaly Guizhou-Europe Environmental Biotechnology and Agricultural Informatics Oversea Innovation Center in Guizhou University Guizhou Provincial Science and Technology DepartmentGuiyang 550025China College of Life Sciences Guizhou UniversityGuiyang 550025China

Accurate identification of plant diseases is important for ensuring the safety of agricultural *** neural networks(CNNs)and visual transformers(VTs)can extract effective representations of images and have been widely used for the intelligent recognition of plant disease ***,CNNs have excellent local perception with poor global perception,and VTs have excellent global perception with poor local *** makes it difficult to further improve the performance of both CNNs and VTs on plant disease recognition *** this paper,we propose a local and global feature-aware dual-branch network,named LGNet,for the identification of plant *** specifically,we first design a dual-branch structure based on CNNs and VTs to extract the local and global ***,an adaptive feature fusion(AFF)module is designed to fuse the local and global features,thus driving the model to dynamically perceive the weights of different ***,we design a hierarchical mixed-scale unit-guided feature fusion(HMUFF)module to mine the key information in the features at different levels and fuse the differentiated information among them,thereby enhancing the model's multiscale perception ***,extensive experiments were conducted on the Al Challenger 2018 dataset and the self-collected corn disease(SCD)*** experimental results demonstrate that our proposed LGNet achieves state-of-the-art recognition performance on both the Al Challenger 2018 dataset and the SCD dataset,with accuracies of 88.74％and 99.08％,respectively.

关键词： global plant disease dual-branch feature-aware local networks recognition

来源：评论

学校读者我要写书评

暂无评论

Online Dynamic Scaling of Microservices with Fair Probabilistic Routing 22

Online Dynamic Scaling of Microservices with Fair Probabilis...

引用

22nd IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2024

作者： Chen, Yang Lin, Shisheng Hu, Yi Wang, Liangyuan Hu, Menglan Lai, Pan Xie, Yuanai College of Computer Science South-Central Minzu University China Key Laboratory of Cyber-Physical Fusion Intelligent Computing State Ethnic Affairs Commission China School of Electronic Information and Communications Huazhong University of Science and Technology China Hubei Key Laboratory of Smart Internet Technology China

ISBN: (纸本)9798331509712

Microservice architecture, as an emerging network architecture, has gained widespread adoption in latency-sensitive applications within the realm of mobile edge computing (MEC). In MEC networks, these latency-sensitive applications necessitate the concurrent processing of numerous service requests, which are composed of microservices. The complex dependencies between microservices and frequent data communication between servers contribute to the intricacy of deploying and routing microservice instances within the network. Moreover, the dynamic and unpredictable nature of service request traffic significantly complicates the timeliness and efficiency of service deployment and request routing strategies. However, existing research predominantly focuses on static network environments and neglects the time-varying characteristics of service request traffic in realistic scenarios. Consequently, we address the joint optimization problem of service deployment and request routing in the presence of dynamic service request traffic. To model the inherent data dependencies and analyze service request response latency, we employ the open Jackson queuing network. We propose a fine-grained microservice dynamic scaling (FMDS) algorithm to capture the dynamic fluctuations in service request traffic within the network. This algorithm scales microservice instances based on the principle of equal proportional change, obtaining a service deployment scheme that minimizes costs while satisfying latency constraints. Furthermore, we introduce a recursive path search algorithm that explores the service deployment scheme to determine the node forwarding probability for the entire network, adhering to the principles of fair routing. Simulation results show that the proposed method effectively improves network latency stability by 75% and enhances the timeliness of the service deployment strategy. © 2024 IEEE.

关键词： microservice request routing service deployment services computing

来源：评论

学校读者我要写书评

暂无评论

Feature Extraction to Evaluate the Quality of Data Using Machine Learning Technique

Feature Extraction to Evaluate the Quality of Data Using Mac...

引用

Distributed computing and Electrical Circuits and Electronics (ICDCECE), IEEE International Conference on

作者： R Pratheesh V. Divya School of Computing Sciences Vels Institute of Science Technology & Advanced Studies Chennai India Department of Information Technology School of Computing Sciences Vels Institute of Science Technology & Advanced Studies Chennai India

ISBN: (数字)9798350318609

ISBN: (纸本)9798350318616

Data quality analysis is a crucial step in ensuring the reliability and accuracy of data used in machine learning models. The proposed approach utilized with machine learning algorithms to identify outliers in the data. Outliers can indicate errors are anomalies that might affect the quality of the dataset. Data Profiling is used to identify patterns and distributions. Missing Data Imputation predict the missing values. Data Validation and Cleansing, Data Duplication Detection, Inconsistency Detection are considered as the primary analysis to be done. The feature extraction process read the sample test dataset, pre-process the dataset by cleaning the data for data duplication, inconsistency through dynamic algorithms principal component analysis (PCA), Linear Discriminant Analysis (LDA) and independent component analysis (ICA) is considered here. The proposed feature extraction data is further opted for pattern validation through isolated forest algorithm. The performance of the system is evaluated using accuracy, precision, and Recall. The LDA model outperforms with accuracy of 99% for the given testset.

关键词： Machine learning algorithms Heuristic algorithms System performance Machine learning Independent component analysis Feature extraction Cleaning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：