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

A Reduced State Space Generation Method for Concurrent Systems Based on CPN-PR Model

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2024年第6期44卷 2328-2342页

作者： Zhong, Wenjie Sun, Tao Zhou, Jian-Tao Wang, Zhuowei Song, Xiaoyu Inner Mongolia Engineering Laboratory for Big Data Analysis Technology College of Computer Science Inner Mongolia University Engineering Research Center of Ecological Big Data Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Hohhot010000 China Guangdong University of Technology School of Computer Science and Technology Guangzhou China Portland State University Department of Electrical and Computer Engineering PortlandOR97207 United States

Colored Petri Nets (CPNs) provide descriptions of the concurrent behaviors for software and hardware. Model checking based on CPNs is an effective method to simulate and verify the concurrent behavior in system design. However, the model checking method traverses the full state space, which suffers from the state space explosion problem. A reduced state space generation method related to the property of concurrent systems is proposed. Specifically, we extend CPNs to define a property-related model (CPN-PR) and give a property-related analysis method whose results can be used to generate the CPN-PR model. A reduced state space generation method is developed based on enabled binding element filtering rules. The stutter trace equivalence between the state spaces of CPN and CPN-PR has been proven by showing that the reduced state space may not change the model checking result. A comparison experiment is conducted to demonstrate the effectiveness of our method. © 1982-2012 IEEE.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

A Facial Expression Recognition Method Integrating Uncertainty Estimation and Active Learning

引用

computers, Materials & Continua 2024年第10期81卷 533-548页

作者： Yujian Wang Jianxun Zhang Renhao Sun School of Computer Science and Engineering Chongqing University of TechnologyChongqing400054China Data Space Research Institute of Hefei Comprehensive National Science Center Hefei230088China

The effectiveness of facial expression recognition(FER)algorithms hinges on the model’s quality and the availability of a substantial amount of labeled expression ***,labeling large datasets demands significant human,time,and financial *** active learning methods have mitigated the dependency on extensive labeled data,a cold-start problem persists in small to medium-sized expression recognition *** issue arises because the initial labeled data often fails to represent the full spectrum of facial expression *** paper introduces an active learning approach that integrates uncertainty estimation,aiming to improve the precision of facial expression recognition regardless of dataset scale *** method is divided into two primary ***,the model undergoes self-supervised pre-training using contrastive learning and uncertainty estimation to bolster its feature extraction ***,the model is fine-tuned using the prior knowledge obtained from the pre-training phase to significantly improve recognition *** the pretraining phase,the model employs contrastive learning to extract fundamental feature representations from the complete unlabeled *** features are then weighted through a self-attention mechanism with rank ***,data from the low-weighted set is relabeled to further refine the model’s feature extraction *** pre-trained model is then utilized in active learning to select and label information-rich samples more *** results demonstrate that the proposed method significantly outperforms existing approaches,achieving an improvement in recognition accuracy of 5.09%and 3.82%over the best existing active learning methods,Margin,and Least Confidence methods,respectively,and a 1.61%improvement compared to the conventional segmented active learning method.

关键词： Expression recognition active learning self-supervised learning uncertainty estimation

来源：评论

学校读者我要写书评

暂无评论

Distributed Truss Computation in Dynamic Graphs

引用

Tsinghua science and Technology 2023年第5期28卷 873-887页

作者： Ziwei Mo Qi Luo Dongxiao Yu Hao Sheng Jiguo Yu Xiuzhen Cheng School of Computer Science and Technology Shandong UniversityQingdao 266200China State Key Laboratory of Software Development Environment School of Computer Science and Engineering and the Beijing Advanced Innovation Center for Big Data and Brain ComputingBeihang UniversityBeijing 100191China Big Data Institute Qilu University of Technology(Shandong Academy of Sciences)Jinan 250353China

Large-scale graphs usually exhibit global sparsity with local cohesiveness,and mining the representative cohesive subgraphs is a fundamental problem in graph *** k-truss is one of the most commonly studied cohesive subgraphs,in which each edge is formed in at least k 2 triangles.A critical issue in mining a k-truss lies in the computation of the trussness of each edge,which is the maximum value of k that an edge can be in a *** works mostly focus on truss computation in static graphs by sequential ***,the graphs are constantly changing dynamically in the real *** study distributed truss computation in dynamic graphs in this *** particular,we compute the trussness of edges based on the local nature of the k-truss in a synchronized node-centric distributed *** decomposing the trussness of edges by relying only on local topological information is possible with the proposed distributed decomposition ***,the distributed maintenance algorithm only needs to update a small amount of dynamic information to complete the *** experiments have been conducted to show the scalability and efficiency of the proposed algorithm.

关键词： distributed algorithm dynamic graph graph mining cohesive subgraph k-truss

来源：评论

学校读者我要写书评

暂无评论

XGCN:a library for large-scale graph neural network recommendations

引用

Frontiers of computer science 2024年第3期18卷 247-249页

作者： Xiran SONG Hong HUANG Jianxun LIAN Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Microsoft Research Asia Beijing 100080China

1 Introduction Graph Neural Networks(GNNs)have gained widespread adoption in recommendation systems,and nowadays there is a pressing need to effectively manage large-scale graph data[1].When it comes to large graphs,GNNs may encounter the scalability issue stemming from their multi-layer messagepassing ***,scaling GNNs has emerged as a crucial research area in recent years,with numerous scaling strategies being proposed.

关键词： scaling gained operations

来源：评论

学校读者我要写书评

暂无评论

FedTop:a constraint-loosed federated learning aggregation method against poisoning attack

引用

Frontiers of computer science 2024年第5期18卷 233-235页

作者： Che WANG Zhenhao WU Jianbo GAO Jiashuo ZHANG Junjie XIA Feng GAO Zhi GUAN Zhong CHEN School of Computer Science Peking UniversityBeijing 100871China Peking University Chongqing Research Institute of Big Data Chongqing 401329China China Unicom Beijing 100033China National Engineering Research Center for Software Engineering Peking UniversityBeijing 100871China

Federated learning(FL)is a decentralized machine learning paradigm,which has significant advantages in protecting data privacy[1].However,FL is vulnerable to poisoning attacks that malicious participants perform attacks by injecting dirty data or abnormal model parameters during the local model training and aim to manipulate the performance of the global model[2].

关键词： constraint loose aggregation

来源：评论

学校读者我要写书评

暂无评论

An Entorhinal-Hippocampal Loop Model Based on Non-negative Sparse Coding

引用

Journal of The Institution of Engineers (India): Series B 2025年第1期106卷 113-127页

作者： Zhao, Kaixin Ren, Menghui College of Computer Science and Technology Henan Institute of Technology Xinxiang453003 China School of Electrical and Information Engineering Zhengzhou University Zhengzhou450001 China Manufacturing IoT Big Data Engineering Technology Research Center of Henan Province Xinxiang453003 China

In our study, we investigate how the brain maps environmental spaces into understandable maps through hippocampal place cells and entorhinal cortex grid cells. We uncover that the hippocampus and entorhinal cortex are not just directly connected but also engage in a sophisticated feedback loop crucial for spatial encoding during navigation. We developed an innovative network model based on this feedback mechanism, linking entorhinal inputs to hippocampal spatial encoding cells through a non-negative sparse coding, using grid cells and weak spatial cells as inputs. Our findings demonstrate that the model learns and adjusts the characteristics of spatial encoding cells, successfully learning the specific spatial selectivities of place cells even with inputs from cells carrying weaker spatial information. This highlights the critical role of feedback encoding in refining spatial representations, an indispensable component of the brain’s navigation system. Moreover, experiments comparing our model with others validate our model’s exceptional ability in generating precise spatial encodings, underscoring its superiority. This research not only deepens our understanding of the brain’s navigational mechanisms but also offers a robust computational framework for future neuroscience studies, emphasizing the intricate interplay between feedback loops and spatial encoding in the brain’s navigation system. © The Institution of Engineers (India) 2024.

关键词： Brain

来源：评论

学校读者我要写书评

暂无评论

ViGT: proposal-free video grounding with a learnable token in the transformer

引用

science China(Information sciences) 2023年第10期66卷 196-212页

作者： Kun LI Dan GUO Meng WANG School of Computer Science and Information Engineering Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Intelligent Interconnected Systems Laboratory of Anhui Province Institute of Artificial Intelligence Hefei Comprehensive National Science Center

The video grounding(VG) task aims to locate the queried action or event in an untrimmed video based on rich linguistic descriptions. Existing proposal-free methods are trapped in the complex interaction between video and query, overemphasizing cross-modal feature fusion and feature correlation for VG. In this paper, we propose a novel boundary regression paradigm that performs regression token learning in a transformer. Particularly, we present a simple but effective proposal-free framework, namely video grounding transformer(ViGT), which predicts the temporal boundary using a learnable regression token rather than multi-modal or cross-modal features. In ViGT, the benefits of a learnable token are manifested as follows.(1) The token is unrelated to the video or the query and avoids data bias toward the original video and query.(2) The token simultaneously performs global context aggregation from video and query ***, we employed a sharing feature encoder to project both video and query into a joint feature space before performing cross-modal co-attention(i.e., video-to-query attention and query-to-video attention) to highlight discriminative features in each modality. Furthermore, we concatenated a learnable regression token [REG] with the video and query features as the input of a vision-language transformer. Finally, we utilized the token [REG] to predict the target moment and visual features to constrain the foreground and background probabilities at each timestamp. The proposed ViGT performed well on three public datasets:ANet-Captions, TACoS, and YouCookⅡ. Extensive ablation studies and qualitative analysis further validated the interpretability of ViGT.

关键词： video grounding temporal sentence grounding boundary regression token learning proposal-free

来源：评论

学校读者我要写书评

暂无评论

Fine extraction of multi-crop planting area based on deep learning with Sentinel- 2 time-series data

引用

Environmental science and Pollution research 2025年第19期32卷 11931-11949页

作者： Jiang, Jingmin Zhang, Jiahua Wang, Xue Zhang, Shichao Kong, Delong Wang, Xiaopeng Ali, Shawkat Ullah, Hidayat Space Information and Big Earth Data Research Center School of Computer Science and Technology Qingdao University Qingdao266071 China Key Laboratory of Digital Earth Science Aerospace Information Research Institute Chinese Academy of Sciences Beijing100094 China

Accurate and timely access to the spatial distribution of crops is crucial for sustainable agricultural development and food security. However, extracting multi-crop areas based on high-resolution time-series data and deep learning still faces challenges. Therefore, this study aims to provide an effective model for multi-crop classification using high-resolution remote sensing time-series data. We designed two deep learning models based on convolutional neural network-long short-term memory (CNN-LSTM) and bidirectional long short-term memory (Bi-LSTM). The monthly synthetic time series of the normalized difference vegetation index (NDVI) from Sentinel-2 data will be used as input features to extract the multi-crop planting area in Shandong province’s northwestern, southwestern, and eastern regions. The results showed that deep learning models achieved higher accuracy compared to the random forest (RF) and extreme gradient boosting (XGBoost) models, with CNN-LSTM achieving the highest overall accuracy of 96.48%. At the county level, the coefficients of determination (R2) for the CNN-LSTM model were 0.91 for wheat, 0.88 for maize, and 0.73 for spring cotton. This study demonstrates that the CNN-LSTM model combined with monthly synthetic time-series NDVI provides a feasible approach for accurately mapping high-resolution multi-crop planting areas and also contributes significantly to decision support and resource management in agricultural production. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Deep learning High-resolution Monthly synthetic time-series NDVI Multi-crop classification Remote sensing Sentinel- 2

来源：评论

学校读者我要写书评

暂无评论

Ghost Module Based Residual Mixture of Self-Attention and Convolution for Online Signature Verification

引用

computers, Materials & Continua 2024年第4期79卷 695-712页

作者： Fangjun Luan Xuewen Mu Shuai Yuan Department of Computer Technology School of Computer Science and EngineeringShenyang Jianzhu UniversityShenyang110168China Liaoning Province Big Data Management and Analysis Laboratory of Urban Construction Shenyang Jianzhu UniversityShenyang110168China Shenyang Branch of National Special Computer Engineering Technology Research Center Shenyang Jianzhu UniversityShenyang110168China

Online Signature Verification (OSV), as a personal identification technology, is widely used in various ***, it faces challenges, such as incomplete feature extraction, low accuracy, and computational heaviness. Toaddress these issues, we propose a novel approach for online signature verification, using a one-dimensionalGhost-ACmix Residual Network (1D-ACGRNet), which is a Ghost-ACmix Residual Network that combines convolutionwith a self-attention mechanism and performs improvement by using Ghost method. The Ghost-ACmix Residualstructure is introduced to leverage both self-attention and convolution mechanisms for capturing global featureinformation and extracting local information, effectively complementing whole and local signature features andmitigating the problem of insufficient feature extraction. Then, the Ghost-based Convolution and Self-Attention(ACG) block is proposed to simplify the common parts between convolution and self-attention using the Ghostmodule and employ feature transformation to obtain intermediate features, thus reducing computational ***, feature selection is performed using the random forestmethod, and the data is dimensionally reducedusing Principal Component Analysis (PCA). Finally, tests are implemented on the MCYT-100 datasets and theSVC-2004 Task2 datasets, and the equal error rates (EERs) for small-sample training using five genuine andforged signatures are 3.07% and 4.17%, respectively. The EERs for training with ten genuine and forged signaturesare 0.91% and 2.12% on the respective datasets. The experimental results illustrate that the proposed approacheffectively enhances the accuracy of online signature verification.

关键词： Online signature verification feature selection ACG block ghost-ACmix residual structure

来源：评论

学校读者我要写书评

暂无评论

Efficient Relaxed Functional Dependency Discovery with Minimal Set Cover 40

Efficient Relaxed Functional Dependency Discovery with Minim...

引用

40th IEEE International Conference on data engineering, ICDE 2024

作者： Ding, Xiaoou Liu, Yida Wang, Hongzhi Wang, Chen Song, Yichen Yang, Donghua Wang, Jianmin School of Computer Science and Technology Harbin Institute of Technology China National Engineering Research Center for Big Data Software EIRI Tsinghua University China

ISBN: (纸本)9798350317152

Assessing data quality through Functional Depen-dencies (FDs) is a crucial aspect of data governance. However, with the diverse range of data sources and the exponential growth in data volume, exact FDs can sometimes be impractical for real-world applications. In contrast, relaxed functional dependencies (RFDs), which allows for some flexibility in attribute value comparisons, demonstrates greater adaptability and flexibility for big data scenarios. To address the efficient discovery of RFDs, this paper proposes a novel mining method to supplement the current research gaps. By establishing a difference table for tuples, we transform the problem into a specialized minimal set covering problem. Additionally, we introduce two optimization strategies: reducing the time complexity of enumerating the left-hand side of the base RFDs to 0 (1) and decreasing the search complexity for feasible LHS attributes and threshold candidates from O(2m-l) to O(1.5m-1). We rigorously proof that our mining approach guarantees the identification of validity and minimal RFDs. Experiments on nine real-world datasets reveal that our method significantly improves efficiency compared to existing techniques. Furthermore, it uncovers more concise and higher-quality RFDs. Importantly, the RFDs extracted through our methodology exhibit better performance in downstream cleaning tasks. © 2024 IEEE.

关键词： Quality management

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：