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

arXiv 2024年

作者： Zhou, Jincheng Zhang, Jin Zhang, Xiang Xiao, Tiaojie Ma, Di Gong, Chunye School of Computer AND Communication Engineering Changsha University of Science and Technology Changsha410114 China College of Computer National University of Defense Technology HuNan Changsha410073 China Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology Changsha410073 China National Supercomputer Center in Tianjin Tianjin300457 China

Sorting algorithms are the most extensively researched topics in computer science and serve for numerous practical applications. Although various sorts have been proposed for efficiency, different architectures offer distinct flavors to the implementation of parallel sorting. In this paper, we propose a hybrid vectorized merge sort on ARM NEON, named NEON Merge Sort for short (NEON-MS). In detail, according to the granted register functions, we first identify the optimal register number to avoid the register-to-memory access, due to the write-back of intermediate outcomes. More importantly, following the generic merge sort framework that primarily uses sorting network for column sort and merging networks for three types of vectorized merge, we further improve their structures for high efficiency in an unified asymmetry way: 1) it makes the optimal sorting networks with few comparators become possible;2) hybrid implementation of both serial and vectorized merges incurs the pipeline with merge instructions highly interleaved. Experiments on a single FT2000+ core show that NEON-MS is 3.8 and 2.1 times faster than std::sort and boost::block_sort, respectively, on average. Additionally, as compared to the parallel version of the latter, NEON-MS gains an average speedup of 1.25. Copyright © 2024, The Authors. All rights reserved.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Understanding Heterophily for Graph Neural Networks

arXiv

引用

arXiv 2024年

作者： Wang, Junfu Guo, Yuanfang Yang, Liang Wang, Yunhong State Key Laboratory of Software Development Environment Beihang University Beijing China School of Computer Science and Engineering Beihang University Beijing China Shen Yuan Honors College Beihang University Beijing China School of Artificial Intelligence Hebei University of Technology Tianjin China

Graphs with heterophily have been regarded as challenging scenarios for Graph Neural Networks (GNNs), where nodes are connected with dissimilar neighbors through various patterns. In this paper, we present theoretical understandings of heterophily for GNNs by incorporating the graph convolution (GC) operations into fully connected networks via the proposed Heterophilous Stochastic Block Models (HSBM), a general random graph model that can accommodate diverse heterophily patterns. Our theoretical investigation comprehensively analyze the impact of heterophily from three critical aspects. Firstly, for the impact of different heterophily patterns, we show that the separability gains are determined by two factors, i.e., the Euclidean distance of the neighborhood distributions and pE [deg], where E [deg] is the averaged node degree. Secondly, we show that the neighborhood inconsistency has a detrimental impact on separability, which is similar to degrading E [deg] by a specific factor. Finally, for the impact of stacking multiple layers, we show that the separability gains are determined by the normalized distance of the lpowered neighborhood distributions, indicating that nodes still possess separability in various regimes, even when over-smoothing occurs. Extensive experiments on both synthetic and real-world data verify the effectiveness of our theory. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Generative Positive-Unlabeled Classification for Hunting Small Open Reading Frames

Generative Positive-Unlabeled Classification for Hunting Sma...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Jie Chen Wenbin Liao Du Wen Jianqiang Li Fangzhong Wang College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Laboratory of Synthetic Microbiology School of Chemical Engineering & Technology Tianjin University China

The annotation of Open Reading Frames (ORFs) is a crucial step in gene annotation, as it precisely delineates the specific regions of expressed genes. However, small Open Reading Frames (smORFs), in comparison to ORFs, are shorter in length, exhibit lower expression abundance, and are more challenging to predict. Particularly in the presence of noise in prokaryotic data and limited availability of positive sample data, the difficulty of prediction is amplified. Therefore, it is necessary to study smORF prediction methods. However, current machine learning models use limited data for modeling and overlook the existence of undiscovered positive samples within the negative samples. Additionally, they do not incorporate prior knowledge that can be calibrated to enhance the 3-nt periodicity. This work utilizes a multimodal VAE for data dimensionality reduction and employs a GAN to generate latent vectors for data augmentation. It incorporates PU learning to leverage unknown samples and combines Riboseq data from experiments with and without antibiotic treatment. Additionally, an adversarial training mechanism is employed to enhance the model’s robustness.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CalibNet: Dual-branch Cross-modal Calibration for RGB-D Salient Instance Segmentation

arXiv

引用

arXiv 2023年

作者： Pei, Jialun Jiang, Tao Tang, He Liu, Nian Jin, Yueming Fan, Deng-Ping Heng, Pheng-Ann The School of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong The School of Software Engineering Huazhong University of Science and Technology Wuhan China The Computer Vision Department Mohamed Bin Zayed University of Artificial Intelligence Abu Dhabi United Arab Emirates The Department of Electrical and Computer Engineering National University of Singapore Singapore Nankai University Shenzhen China College of Computer Science Nankai University Tianjin China

In this study, we propose a novel approach for RGB-D salient instance segmentation using a dual-branch cross-modal feature calibration architecture called CalibNet. Our method simultaneously calibrates depth and RGB features in the kernel and mask branches to generate instance-aware kernels and mask features. CalibNet consists of three simple modules, a dynamic interactive kernel (DIK) and a weight-sharing fusion (WSF), which work together to generate effective instance-aware kernels and integrate cross-modal features. To improve the quality of depth features, we incorporate a depth similarity assessment (DSA) module prior to DIK and WSF. In addition, we further contribute a new DSIS dataset, which contains 1,940 images with elaborate instance-level annotations. Extensive experiments on three challenging benchmarks show that CalibNet yields a promising result, i.e., 58.0% AP with 320×480 input size on the COME15K-E test set, which significantly surpasses the alternative frameworks. Our code and dataset will be publicly available at: https://***/PJLallen/CalibNet. Copyright © 2023, The Authors. All rights reserved.

关键词： Calibration

来源：评论

学校读者我要写书评

暂无评论

A Heuristic-based Dynamic Scheduling and Routing Method for Industrial TSN Networks

A Heuristic-based Dynamic Scheduling and Routing Method for ...

引用

IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)

作者： Honglong Chen Mindong Liu Jing Huang Zhiling Zheng Weihong Huang Yufeng Xiao School of Computer Science and Engineering Hunan University of Science and Technology Hunan Key Laboratory for Service Computing and Novel Software Technology Xiangtan China Information Center Hunan Industry Polytechnic Changsha China

In the industrial environment, machines often need to reflect the anomaly detection results to the total control center in time, and the general industrial network can not achieve high real-time. In order to solve such challenges, a set of protocol standards developed by IEEE802.1 working group, namely Time-sensitive Networking (TSN), has been introduced into industrial networks. TSN can provide high real-time and reliability for data transmission, where the reliability is achieved by Frame duplication and Frame Elimination (FRER). In the realization process of FRER, it is necessary to determine the source node, destination node, and multiple disjoint paths to transmit redundant data. However, the transmission of these redundant traffic may result in the delay of other flows, and then affects the user experience. Therefore, it is very important to choose excellent redundant traffic paths to ensure reliability and reduce the impact on other flows. In the existing research, there are many dynamic scheduling and routing heuristics to determine the path, but they do not consider the influence of the location of the source node on the whole route scheduling. This paper proposes an improved dynamic scheduling and routing heuristic method, which takes the source node into account in the routing selection. In the flow test experiments of different magnitudes, it is found that the total delay of all flows is reduced by 1.4%-4.5% under the same magnitude of schedulability compared with Ant Colony Optimization.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Quality Evaluation in Guavas using Deep Learning Architectures: An Experimental Review 4

Quality Evaluation in Guavas using Deep Learning Architectur...

引用

4th International Congress on Human-computer Interaction, Optimization and Robotic Applications, HORA 2022

作者： Choudhury, Tanupriya Mahdi, Hussain Falih Agarwal, Archit Chakraborty, Arnav Arunachalaeshwaran, V R Sarkar, Tanmay Tomar, Ravi Uttarakhand Dehradun2480007 India University of Diyala Department of Computer and Software Engineering Baqubah Iraq School of Computing National University of Singapore Kent Ridge119007 Singapore School of Computer Science Lambton College ONL4Z3E9 Canada Malda Polytechnic Department of Food Processing West Bengal Malda732102 India

ISBN: (纸本)9781665468350

Determining the quality of fruit can be very challenging without the proper understanding. There are many factors that can result in determining the quality and therefore the actual taste of any given fruit. In this paper we attempt to determine the quality of the guava fruit on what are considered the three most important aspects of flavour by experts, those being, Colour, Shape and texture. All three of these aspects will be determined on a scale of 1-5. In order to produce these results, we are using an exceptional deep learning architecture and a primary dataset curated by a panel of experts who photographed the fruits in six-hour intervals for many days. We have compared the results over multiple deep learning architectures to find the most accurate results. This paper shows the importance of deep learning as a potential future tool for assessing the quality of fruits. © 2022 IEEE.

关键词： Fruits

来源：评论

学校读者我要写书评

暂无评论

A Novel Logic-Based Adaptive Monitoring for Composite Edge Services

A Novel Logic-Based Adaptive Monitoring for Composite Edge S...

引用

IEEE International Conference on Web Services (ICWS)

作者： Deng Zhao Zhangbing Zhou Xiao Xue Jin Diao Sami Yangui Bo Liu Walid Gaaloul School of Information Engineering China University of Geosciences (Beijing) Beijing China Department of Computer Science TELECOM SudParis Evry France College of Intelligence and Computing Tianjin University Tianjin China LAAS-CNRS University of Toulouse Toulouse France School of Software Engineering Beijing University of Technology Beijing China

With the wide-adoption of edge computing, the functionalities of Internet of Things (IoT) devices can be encapsulated as edge services, to facilitate domain applications through edge service compositions. Considering the capacity-fluctuating and resource-varying of IoT devices, edge service monitoring is essential to guarantee the healthy of their compositions at runtime. Current techniques focus mostly on the monitoring of atomic edge services, which, however, are inadequate for that of inter-and composite services. Besides, constraints to be monitored are usually pre-specified, although certain parameters may have to be adapted online according to execution context. To address these challenges, this paper proposes a novel logic-based adaptive monitoring mechanism, to achieve the interpretation of temporal constraints and time-dependent QoS constraints upon intra-, inter-, and composite services. Leveraging our proposed Compositional Signal Temporal Logic (CSTL) with extended compositional modalities and online parameter settings, constraints can be converted to CSTL formulae, and QoS variations and temporal violations are interpreted qualitatively and quantitatively at runtime. Extensive experiments are conducted upon publicly-available datasets, and evaluation results demonstrate that our CSTL performs better than baseline techniques in terms of expressiveness, applicability, and robustness.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Multi-Feature Learning Model with Enhanced Local Attention for Vehicle Re-Identification

引用

computers, Materials & Continua 2021年第12期69卷 3549-3561页

作者： Wei Sun Xuan Chen Xiaorui Zhang Guangzhao Dai Pengshuai Chang Xiaozheng He Jiangsu Collaborative Innovation Center of Atmospheric Environment and Equipment Technology Nanjing University of Information Science&TechnologyNanjing210044China School of Automation Nanjing University of Information Science&TechnologyNanjing210044China Engineering Research Center of Digital Forensics Ministry of EducationJiangsu Engineering Center of Network MonitoringSchool of Computer and SoftwareNanjing University of Information Science&TechnologyNanjing210044China Rensselaer Polytechnic Institute TroyNY12180USA

Vehicle re-identification(ReID)aims to retrieve the target vehicle in an extensive image gallery through its appearances from various views in the cross-camera *** has gradually become a core technology of intelligent transportation *** existing vehicle re-identification models adopt the joint learning of global and local ***,they directly use the extracted global features,resulting in insufficient feature ***,local features are primarily obtained through advanced annotation and complex attention mechanisms,which require additional *** solve this issue,a multi-feature learning model with enhanced local attention for vehicle re-identification(MFELA)is proposed in this *** model consists of global and local *** global branch utilizes both middle and highlevel semantic features of ResNet50 to enhance the global representation *** addition,multi-scale pooling operations are used to obtain multiscale *** the local branch utilizes the proposed Region Batch Dropblock(RBD),which encourages the model to learn discriminative features for different local regions and simultaneously drops corresponding same areas randomly in a batch during training to enhance the attention to local *** features from both branches are combined to provide a more comprehensive and distinctive feature *** experiments on VeRi-776 and VehicleID datasets prove that our method has excellent performance.

关键词： Vehicle re-identification region batch dropblock multi-feature learning local attention

来源：评论

学校读者我要写书评

暂无评论

PCA: Semi-Supervised Segmentation with Patch Confidence Adversarial Training

引用

IEEE Transactions on Network science and engineering 2025年

作者： Xu, Zhenghua Yang, Runhe Xu, Zihang Zhang, Shuo Yang, Yuchen Liu, Weipeng Xu, Weichao Chen, Junyang Lukasiewicz, Thomas Leung, Victor C. M. Hebei University of Technology State Key Laboratory of Reliability and Intelligence of Electrical Equipment School of Health Sciences and Biomedical Engineering Tianjin China The University of Hong Kong Department of Electrical and Electronic Engineering Hong Kong The Johns Hopkins University Department of Applied Mathematics and Statistic Baltimore United States Hebei University of Technology School of Artificial Intelligence Tianjin China Hebei Provincial Hospital of Traditional Chinese Medicine Digestive Disease Center Shijiazhuang China Shenzhen University College of Computer Science and Software Engineering Shenzhen China University of Oxford Department of Computer Science University of Oxford United Kingdom Department of Computer Science United Kingdom Vienna University of Technology institute of Logic and Computation nstitute of Logic and Computation Vienna Austria

Deep-learning-based semi-supervised learning (SSL) methods have achieved a strong performance in medical image segmentation, which can alleviate doctors' expensive annotation by utilizing a large amount of unlabeled data. Unlike most existing semi-supervised learning methods, adversarial training methods distinguish samples from different sources by learning the data distribution of the segmentation map, leading the segmenter to generate more accurate predictions. We argue that the current performance restrictions for such approaches are the problems of feature extraction and learning preferences. In this paper, we propose a new semi-supervised adversarial method called Patch Confidence Adversarial Training (PCA) for medical image segmentation. The PCA method's discriminator penalizes patch-level structures, guiding the generator to optimize different patch areas, by leveraging pixel context, the generator is driven to focus on high-frequency features, making it harder to deceive the discriminator and easy to converge to an ideal state, which more effectively guides the segmenter to generate high-quality pseudo-labels. Furthermore, at the discriminator's input, we supplement image information constraints, making it simpler to fit the expected data distribution. Extensive experiments on the Automated Cardiac Diagnosis Challenge (ACDC) 2017 dataset and the Brain Tumor Segmentation (BraTS) 2019 challenge dataset show that our method outperforms the state-of-the-art semi-supervised methods, which demonstrates its effectiveness for medical image segmentation. © 2025 IEEE. All rights reserved.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Hyper-IIoT: A Smart Contract-inspired Access Control Scheme for Resource-constrained Industrial Internet of Things

IEEE Transactions on Sustainable Computing

引用

IEEE Transactions on Sustainable Computing 2025年

作者： Li, Dun Li, Hongzhi Crespi, Noel Minerva, Roberto Li, Ming Liang, Wei Li, Kuan-Ching Tsinghua University Department of Industrial Engineering China Institut Polytechnique de Paris Samovar Telecom SudParis Palaiseau91120 France Chizhou University College of Big Data and Artificial Intelligence Chizhou247100 China The Hong Kong Polytechnic University Research Institute for Advanced Manufacturing Hung Hom Hong Kong Hunan University of Science and Technology School of Computer Science and Engineering Hunan University of Science and Technology Sanya Research Institute Hunan Key Laboratory for Service Computing and Novel Software Technology China Providence University Dept. of Computer Science and Information Engineering Taiwan

In recent years, the refinements in industrial processes and the increasing complexity of managing privacy-sensitive data in Industrial Internet of Things (IIoT) devices have highlighted the need for secure, robust, and adaptive data management solutions. In this work, we propose a smart contract-assisted access control scheme for IIoT, which employs the Attribute-Based Access Control (ABAC) model to set access permissions for different industrial components. Besides, we defined a storage model and data format for private data by designing and deploying smart contracts to manage system operations and access policies. In addition, the bloom filter component is deployed to optimize the efficiency of contract management and system performance. Experimental results show that in real-world simulations, Hyper-IIoT demonstrates excellent contract execution time control, stable system throughput, and rapid consensus processes that are capable of handling high throughput and efficient consensus in distributed systems, even in large-scale request scenarios. © 2016 IEEE.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：