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

39th IEEE International Conference on data Engineering, ICDE 2023

作者： Liu, Kangzheng Zhao, Feng Xu, Guandong Wang, Xianzhi Jin, Hai Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan China University of Technology Sydney Data Science and Machine Intelligence Lab Sydney Australia

ISBN: (纸本)9798350322279

Temporal knowledge graph (TKG) extrapolation aims to predict future unknown events (facts) based on historical information, and has attracted considerable attention due to its great practical significance. Accurate representations (embeddings) of entities and relations form the basis of TKG extrapolation. Recent work has been devoted to improving the rationality of entity representations. However, on the one hand, ignoring relation modeling results in incomplete relation representations;therefore, some approaches aggregate only immediately adjacent entities of relations, but this can lead to the "message islands"problem of relation modeling. On the other hand, ignoring the association constraints between relations and entities can make the embeddings of both relations and entities prone to overfitting. To address the abovementioned challenges, we propose an advanced method, namely, RETIA. For the former issue, we generate twin hyperrelation subgraphs for each historical subgraph and then aggregate both the adjacent entities and relations in the hyperrelation subgraphs through a graph convolutional network (GCN). About the latter concern, we propose a twin-interact module (TIM), which provides communication channels for relation aggregation and entity aggregation during the evolution of the historical sequence. Experiments conducted on five public datasets show that RETIA has made great improvements across several evaluation metrics. Our released code is available at https://***/CGCL-codes/RETIA. © 2023 IEEE.

关键词： Extrapolation

来源：评论

学校读者我要写书评

暂无评论

Gradient-Based Differential kWTA Network With Application to Competitive Coordination of Multiple Robots

引用

IEEE/CAA Journal of Automatica Sinica 2022年第8期9卷 1452-1463页

作者： Mei Liu Xiaoyan Zhang Mingsheng Shang Long Jin School of Information Science and Engineering Lanzhou UniversityLanzhou 730000 State Key Laboratory of Tibetan Intelligent Information Processing and Application Xining 810016China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714China Shenzhen Research Institute Lanzhou UniversityShenzhen 518063China

Aiming at the k-winners-take-all(kWTA)operation,this paper proposes a gradient-based differential kWTA(GDk WTA)*** obtaining the network,theorems and related proofs are provided to guarantee the exponential convergence and noise resistance of the proposed GD-kWTA ***,numerical simulations are conducted to substantiate the preferable performance of the proposed network as compared with the traditional ***,the GD-k WTA network,backed with a consensus filter,is utilized as a robust control scheme for modeling the competition behavior in the multi-robot coordination,thereby further demonstrating its effectiveness and feasibility.

关键词： Consensus filter k-winners-take-all(kWTA) multirobot coordination noise resistance

来源：评论

学校读者我要写书评

暂无评论

Some Thoughts on the Classification Standard of intelligent Autonomous Level of Measurement and Control System 9

Some Thoughts on the Classification Standard of Intelligent ...

引用

9th International Conference on big data and Information Analytics, bigDIA 2023

作者： Yuan, Guangfu Yang, Liu Han, Haoran Li, Yong Shao, Cong Zhan, Siyu Gansu Photoelectric Measurement Technology Research Laboratory Gansu735018 China University of Electronic Science and Technology of China Laboratory of Intelligent Collaborative Computing Chengdu China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Chengdu611731 China

ISBN: (纸本)9798350330076

Intelligence is an important trend in the development of measurement and control systems. However, there is still a lack of unified understanding of the intelligent autonomous classification of the measurement and control system. The establishment of intelligent evaluation standards in this field has become an urgent research topic. This paper first gives an overview of the aviation measurement and control system, and then takes the classification standards of autonomy in the fields of automobile driving automation in China and the United states, the autonomy and autonomy level of typical ships in China, and the automation of civil unmanned aircraft system in China as a reference. A 5-level intelligent grading standard based on task adaptability, environmental complexity and human-computer interaction is proposed. The classification standard is practical and easy to understand. It can provide reference for the establishment of intelligent standards for measurement and control systems, improve the application speed of intelligent autonomous technology in the field of measurement and control, and broaden the application prospect of intelligent measurement and control systems. © 2023 IEEE.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

DarkSAM: Fooling Segment Anything Model to Segment Nothing 38

DarkSAM: Fooling Segment Anything Model to Segment Nothing

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Zhou, Ziqi Song, Yufei Li, Minghui Hu, Shengshan Wang, Xianlong Zhang, Leo Yu Yao, Dezhong Jin, Hai National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Cluster and Grid Computing Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Computer Science and Technology Huazhong University of Science and Technology China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia

Segment Anything Model (SAM) has recently gained much attention for its outstanding generalization to unseen data and tasks. Despite its promising prospect, the vulnerabilities of SAM, especially to universal adversarial perturbation (UAP) have not been thoroughly investigated yet. In this paper, we propose DarkSAM, the first prompt-free universal attack framework against SAM, including a semantic decoupling-based spatial attack and a texture distortion-based frequency attack. We first divide the output of SAM into foreground and background. Then, we design a shadow target strategy to obtain the semantic blueprint of the image as the attack target. DarkSAM is dedicated to fooling SAM by extracting and destroying crucial object features from images in both spatial and frequency domains. In the spatial domain, we disrupt the semantics of both the foreground and background in the image to confuse SAM. In the frequency domain, we further enhance the attack effectiveness by distorting the high-frequency components (i.e., texture information) of the image. Consequently, with a single UAP, DarkSAM renders SAM incapable of segmenting objects across diverse images with varying prompts. Experimental results on four datasets for SAM and its two variant models demonstrate the powerful attack capability and transferability of DarkSAM. Our codes are available at: https://***/CGCL-codes/DarkSAM. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Knowledge Distillation Facilitates the Lightweight and Efficient Plant Diseases Detection Model

引用

Plant Phenomics 2023年第3期5卷 501-519页

作者： Qianding Huang Xingcai Wu Qi Wang Xinyu Dong Yongbin Qin Xue Wu Yangyang Gao Gefei Hao State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang 550025China Text Computing&Cognitive Intelligence Engineering Research Center of National Education Ministry Guizhou UniversityGuiyang 550025China National Key Laboratory of Green Pesticide Guizhou UniversityGuiyang 550025China

Plant disease diagnosis in time can inhibit the spread of the disease and prevent a large-scale drop in production,which benefits food *** detection-based plant disease diagnosis methods have attracted widespread attention due to their accuracy in classifying and locating ***,existing methods are still limited to single crop disease *** importantly,the existing model has a large number of parameters,which is not conducive to deploying it to agricultural mobile ***,reducing the number of model parameters tends to cause a decrease in model *** solve these problems,we propose a plant disease detection method based on knowledge distillation to achieve a lightweight and efficient diagnosis of multiple diseases across multiple *** detail,we design 2 strategies to build 4 different lightweight models as student models:the YOLOR-Light-v1,YOLOR-Light-v2,Mobile-YOLOR-v1,and Mobile-YOLOR-v2 models,and adopt the YOLOR model as the teacher *** develop a multistage knowledge distillation method to improve lightweight model performance,achieving 60.4%mAP@.5 in the PlantDoc dataset with small model parameters,outperforming existing ***,the multistage knowledge distillation technique can make the model lighter while maintaining high *** only that,the technique can be extended to other tasks,such as image classification and image segmentation,to obtain automated plant disease diagnostic models with a wider range of lightweight applicability in smart *** code is available at https://***/QDH/MSKD.

关键词： Plant diagnosis image

来源：评论

学校读者我要写书评

暂无评论

Toward High-Performance Delta-Based Iterative Processing with a Group-Based Approach

引用

Journal of Computer Science & technology 2022年第4期37卷 797-813页

作者： Hui Yu Xin-Yu Jiang Jin Zhao Hao Qi Yu Zhang Xiao-Fei Liao Hai-Kun Liu Fu-Bing Mao Hai Jin National Engineering Research Center for Big Data Technology and System Huazhong University of Science and TechnologyWuhan 430074China Service Computing Technology and System Laboratory Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory Huazhong University of Science and TechnologyWuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China

Many systems have been built to employ the delta-based iterative execution model to support iterative algorithms on distributed platforms by exploiting the sparse computational dependencies between data items of these iterative algorithms in a synchronous or asynchronous approach. However, for large-scale iterative algorithms, existing synchronous solutions suffer from slow convergence speed and load imbalance, because of the strict barrier between iterations;while existing asynchronous approaches induce excessive redundant communication and computation cost as a result of being barrier-free. In view of the performance trade-off between these two approaches, this paper designs an efficient execution manager, called Aiter-R, which can be integrated into existing delta-based iterative processing systems to efficiently support the execution of delta-based iterative algorithms, by using our proposed group-based iterative execution approach. It can efficiently and correctly explore the middle ground of the two extremes. A heuristic scheduling algorithm is further proposed to allow an iterative algorithm to adaptively choose its trade-off point so as to achieve the maximum efficiency. Experimental results show that Aiter-R strikes a good balance between the synchronous and asynchronous policies and outperforms state-of-the-art solutions. It reduces the execution time by up to 54.1% and 84.6% in comparison with existing asynchronous and the synchronous models, respectively.

关键词： iterative algorithm delta-based execution model efficiency

来源：评论

学校读者我要写书评

暂无评论

Discovering Cohesive Temporal Subgraphs with Temporal Density Aware Exploration

引用

Journal of Computer Science & technology 2022年第5期37卷 1068-1085页

作者： Chun-Xue Zhu Long-Long Lin Ping-Peng Yuan Hai Jin National Engineering Research Center for Big Data Technology and System Huazhong University of Science and TechnologyWuhan 430074China Service Computing Technology and System Laboratory Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory Huazhong University of Science and TechnologyWuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China

Real-world networks,such as social networks,cryptocurrency networks,and e-commerce networks,always have occurrence time of interactions between *** networks are typically modeled as temporal *** cohesive subgraphs from temporal graphs is practical and essential in numerous data mining applications,since mining cohesive subgraphs gets insights into the time-varying nature of temporal ***,existing studies on mining cohesive subgraphs,such as Densest-Exact and k-truss,are mainly tailored for static graphs(whose edges have no temporal information).Therefore,those cohesive subgraph models cannot indicate both the temporal and the structural characteristics of *** this end,we explore the model of cohesive temporal subgraphs by incorporating both the evolving and the structural characteristics of temporal ***,the volume of time intervals in a temporal network is *** a result,the time complexity of mining temporal cohesive subgraphs is *** efficiently address the problem,we first mine the temporal density distribution of temporal *** by the distribution,we can safely prune many unqualified time intervals with the linear time ***,the remaining time intervals where cohesive temporal subgraphs fall in are examined using the greedy *** results of the experiments on nine real-world temporal graphs indicate that our model outperforms state-of-the-art solutions in efficiency and ***,our model only takes less than two minutes on a million-vertex DBLP and has the highest overall average ranking in EDB and TC metrics.

关键词： temporal network temporal feature distribution cohesive subgraph convex property

来源：评论

学校读者我要写书评

暂无评论

A Distributed Framework for Large-scale Protein-protein Interaction data Analysis and Prediction Using MapReduce

引用

IEEE/CAA Journal of Automatica Sinica 2022年第1期9卷 160-172页

作者： Lun Hu Shicheng Yang Xin Luo Huaqiang Yuan Khaled Sedraoui MengChu Zhou School of Computer Science and Technology Dongguan University of TechnologyDongguan 523808China School of Computer Science and Technology Wuhan University of TechnologyWuhan 430070China Chongqing Engineering Research Center of Big Data Application for Smart Cities and Chongqing Key Laboratory of Big Data and Intelligent ComputingChongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714China Xinjiang Technical Institute of Physics and Chemistry Chinese Academy of SciencesUrumqi 830000China Center of Research Excellence in Renewable Energy and Power Systems and the Department of Electrical and Computer EngineeringFaculty of EngineeringKing Abdulaziz UniversityJeddah 21589Saudi Arabia Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewarkNJ 07102 USA

Protein-protein interactions are of great significance for human to understand the functional mechanisms of *** the rapid development of high-throughput genomic technologies,massive protein-protein interaction(PPI)data have been generated,making it very difficult to analyze them *** address this problem,this paper presents a distributed framework by reimplementing one of state-of-the-art algorithms,i.e.,CoFex,using *** do so,an in-depth analysis of its limitations is conducted from the perspectives of efficiency and memory consumption when applying it for large-scale PPI data analysis and *** solutions are then devised to overcome these *** particular,we adopt a novel tree-based data structure to reduce the heavy memory consumption caused by the huge sequence information of *** that,its procedure is modified by following the MapReduce framework to take the prediction task distributively.A series of extensive experiments have been conducted to evaluate the performance of our framework in terms of both efficiency and *** results well demonstrate that the proposed framework can considerably improve its computational efficiency by more than two orders of magnitude while retaining the same high accuracy.

关键词： Distributed computing large-scale prediction machine learning MapReduce protein-protein interaction(PPI)

来源：评论

学校读者我要写书评

暂无评论

Resource abstraction and data placement for distributed hybrid memory pool

引用

Frontiers of Computer Science 2021年第3期15卷 47-57页

作者： Tingting CHEN Haikun LIU Xiaofei LIAO Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab/Gluster and Grid Computing LabSchool of Gomputing Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Emerging byte-addressable non-volatile memory(NVM)technologies offer higher density and lower cost than DRAM,at the expense of lower performance and limited write *** have been many studies on hybrid NVM/DRAM memory management in a single physical ***,it is still an open problem on how to manage hybrid memories efficiently in a distributed *** paper proposes Alloy,a memory resource abstraction and data placement strategy for an RDMA-enabled distributed hybrid memory pool(DHMP).Alloy provides simple APIs for applications to utilize DRAM or NVM resource in the DHMP,without being aware of the hardware details of the *** propose a hotness-aware data placement scheme,which combines hot data migration,data replication and write merging together to improve application performance and reduce the cost of *** evaluate Alloy with several micro-benchmark workloads and public benchmark *** results show that Alloy can significantly reduce the DRAM usage in the DHMP by up to 95%,while reducing the total memory access time by up to 57%compared with the state-of-the-art approaches.

关键词： load balance distributed hybrid memory clouds

来源：评论

学校读者我要写书评

暂无评论

Leverage Learning Behaviour data for Students' Learning Performance Prediction and Influence Factor Analysis

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第5期5卷 2422-2433页

作者： Ni, Qin Zhu, Yanjin Zhang, Lingying Lu, Xiaochen Zhang, Lei Shanghai International Studies University Key Laboratory of Multilingual Education with AI Shanghai201620 China Donghua University College of Information Science and Technology Shanghai201620 China Donghua University Engineering Research Center of Digitized Textile and Apparel Technology Ministry of Education Shanghai201620 China Shanghai Normal University Shanghai Engineering Research Center of Intelligent Education and Bigdata and Lab for Educational Big Data and Policymaking Shanghai200234 China

Online education has become increasingly significant for university students and faculty, especially in the context of the modern remote education landscape. However, the inherent space-time separation in online education can create communication delays between teachers and students, making it challenging to monitor students' behaviors effectively. In an effort to understand the connection between students' online engagement and their learning performance, data annotation has been implemented to address the issue of accurately representing students' learning behaviors. Taking the online teaching data of Shanghai Normal University platform as the research object, the primary online education problem is explored through data mining, which includes correlation analysis, Gini importance ranking, and principal component analysis (PCA). Then, constructing the learning performance prediction model using random forest (RF) based on PCA by comparing various machine learning algorithms. As a consequence, the most influential online learning behaviors are course duration time, document learning time, test average score, and video completion rate. The overall classification accuracy of the learning performance prediction model is 87.45%, and the highest prediction accuracy for a single category is 96.52%. © 2020 IEEE.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：