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

IEEE International Conference on Systems, Man and Cybernetics

作者： Yuansen Kuang Xitong Ma Jing Zhao Guangchen Wang Yijie Zeng Song Liu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

3D medical image segmentation is an essential task in the medical image field, which aims to segment organs or tumours into different labels. A number of issues exist with the current 3D medical image segmentation task: existing models cannot simultaneously obtain the space correlation and depth correlation of 3D slices; previous models suffer from local detail loss of positional embedding in 3D images; previous approaches often have blurring of boundaries in segmenting 3D images. To solve these shortcomings, we propose a 3D medical image segmentation model named TPM-SAM. In our model, we design a twinchannel image encoder to simultaneously capture the space correlation and depth correlation of 3D slices through a multi-head attention mechanism and improved adapters. Furthermore, we design a prompt encoding generator, which divides the volumetric image into small blocks and better captures the local detail information. In addition, we introduce a multi-layer aggregation decoder by employing U-Net with multi-level skip connection to solve the blurring of boundaries in processing 3D images. Finally, we experimented and evaluated our model on KiTS21 and LiTS17 datasets to compare with other baseline models.

关键词： Solid modeling Image segmentation Adaptation models Three-dimensional displays Correlation Image coding Self-supervised learning Generators Biomedical imaging Tumors

来源：评论

学校读者我要写书评

暂无评论

Contrastive Learning for Robust Android Malware Familial Classification

引用

IEEE Transactions on Dependable and Secure Computing 2022年 1-14页

作者： Wu, Yueming Dou, Shihan Zou, Deqing Yang, Wei Qiang, Weizhong Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai China University of Texas at Dallas Dallas USA 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 Huazhong University of Science and Technology Wuhan China

Due to its open-source nature, Android operating system has been the main target of attackers to exploit. Malware creators always perform different code obfuscations on their apps to hide malicious activities. Features extracted from these obfuscated samples through program analysis contain many useless and disguised features, which leads to many false negatives. To address the issue, in this paper, we demonstrate that obfuscation-resilient malware family analysis can be achieved through contrastive learning. The key insight behind our analysis is that contrastive learning can be used to reduce the difference introduced by obfuscation while amplifying the difference between malware and other types of malware. Based on the proposed analysis, we design a system that can achieve robust and interpretable classification of Android malware. To achieve robust classification, we perform contrastive learning on malware samples to learn an encoder that can automatically extract robust features from malware samples. To achieve interpretable classification, we transform the function call graph of a sample into an image by centrality analysis. Then the corresponding heatmaps can be obtained by visualization techniques. These heatmaps can help users understand why the malware is classified as this family. We implement IFDroid and perform extensive evaluations on two datasets. Experimental results show that IFDroid is superior to state-of-the-art Android malware familial classification systems. Moreover, IFDroid is capable of maintaining a 98.4% F1 on classifying 69,421 obfuscated malware samples. IEEE

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

PPIRB:Achieving an privacy-preserving image retrieval scheme Based on Blockchain 5

PPIRB:Achieving an privacy-preserving image retrieval scheme...

引用

5th International Conference on Data Science and information Technology, DSIT 2022

作者： Yuan, Bo Peng, Jiahui Li, Chunpei Qiu, Wangjie School of Computer Science and Engineering State Key Laboratory of Software Development Environment Beihang University Beijing100191 China Guangxi Key Lab of Multi-source Information Mining Security Guangxi Normal University GuiLin China State Key Laboratory of Software Development Environment Beihang University Advanced Innovation Center for Future Blockchain and Privacy Computing Beijing100191 China

ISBN: (数字)9781665498685

ISBN: (纸本)9781665498685

With the proliferation of cloud services, the work of large-scale image retrieval is carried out on remote cloud become a trend in order to get rid of the storage burden and computation. However, traditional retrieval work based on centralized cloud services is considered to take risk in giving away users' privacy in many researches. We need a secure way for retrieving and storing images by decentralized approach. In this paper, we propose a decentralized scheme named PPIRB(An Privacy-Preserving Image Retrieval Scheme Base on Blockchain) for retrieving images based on blockchain. We used the data structure called amplifying locality sensitive hashing (ALSH) to improve search accuracy. Searchable symmetric en-cryption(SSE) and ALSH used to realize the encryption retrieval of image index on the blockchain. Our scheme also uses IPFS to replace the cloud server to realize distributed storage, and uses secret sharing scheme to realize the access control. We implemented and evaluated the scheme in Ethereum, and the results show that our scheme is efficient and accurate in finding similar images while preserving privacy. The overall overhead is reasonable. © 2022 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Dense Cross-Query-and-Support Attention Weighted Mask Aggregation for Few-Shot Segmentation

arXiv

引用

arXiv 2022年

作者： Shi, Xinyu Wei, Dong Zhang, Yu Lu, Donghuan Ning, Munan Chen, Jiashun Ma, Kai Zheng, Yefeng School of Computer Science & Engineering Key Lab of Computer Network & Information Integration Ministry of Education Southeast Univ. Nanjing China Tencent Jarvis Lab Shenzhen China

Research into Few-shot Semantic Segmentation (FSS) has attracted great attention, with the goal to segment target objects in a query image given only a few annotated support images of the target class. A key to this challenging task is to fully utilize the information in the support images by exploiting fine-grained correlations between the query and support images. However, most existing approaches either compressed the support information into a few class-wise prototypes, or used partial support information (e.g., only foreground) at the pixel level, causing non-negligible information loss. In this paper, we propose Dense pixel-wise Cross-query-and-support Attention weighted Mask Aggregation (DCAMA), where both foreground and background support information are fully exploited via multi-level pixel-wise correlations between paired query and support features. Implemented with the scaled dot-product attention in the Transformer architecture, DCAMA treats every query pixel as a token, computes its similarities with all support pixels, and predicts its segmentation label as an additive aggregation of all the support pixels’ labels—weighted by the similarities. Based on the unique formulation of DCAMA, we further propose efficient and effective one-pass inference for n-shot segmentation, where pixels of all support images are collected for the mask aggregation at once. Experiments show that our DCAMA significantly advances the state of the art on standard FSS benchmarks of PASCAL-5i, COCO-20i, and FSS-1000, e.g., with 3.1%, 9.7%, and 3.6% absolute improvements in 1-shot mIoU over previous best records. Ablative studies also verify the design DCAMA. © 2022, CC BY-NC-ND.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Significance-aware Medication Recommendation with Medication Representation Learning

Significance-aware Medication Recommendation with Medication...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Yishuo Li Zhufeng Shao Weimin Chen Shoujin Wang Yuehan Du Wenpeng Lu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Mental Health Center Jinan China Data Science Institute University of Technology Sydney Sydney Australia Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

The goal of medication recommendation system is to recommend appropriate pharmaceutical interventions based on a patient’s diagnosis. Most of existing approaches often formulate these recommendations use data on diagnoses, procedures, and prescriptions accumulated in the electronic health records (EHR), and despite the great successes, they seem to have limitations on modelling the significance of medication to a patient’s current visit and mining fine-grained medication representation information. To address these issues, we propose a novel Significanceaware Medication Recommendation (SMRec) framework built on significance of medication to patients and fine-grained medication representation learning. Specifically, we first design a encoding mechanism to compute significance information of medications for each patient’s visit. Then, we utilize the set-level medication co-occurrence graph based on patients’ medical history which integrates temporal dependency to learn fine-grained medication representations. Experimental results on the publicly available MIMIC-III dataset demonstrate the superior effectiveness of our model compared to other approaches 1 .

关键词： Representation learning Drugs Federated learning Computational modeling MIMICs Encoding History

来源：评论

学校读者我要写书评

暂无评论

ERC DMSP: Emotion Recognition in Conversation Based on Dynamic Modeling of Speaker Personalities

ERC DMSP: Emotion Recognition in Conversation Based on Dynam...

引用

International Joint Conference on Neural networks (IJCNN)

作者： Xiaoyang Li Zhenyu Yang Zhijun Li Yiwen Li Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

Emotion Recognition in Conversations (ERC) is a widely applicable task, whether in emotional chatbots or recommender systems for dialog scenarios. The ability of systems to accurately identify human emotions is a crucial component in ERC success. In everyday conversations, a speaker’s emotional expression is closely tied to their individual characteristics and personality traits. Furthermore, individuals exhibit significant variations in their expressions of the same emotion. Traditional methods for ERC often overlook these personality differences and dynamic changes, leading to unreliable results. To address this issue, we propose a conversation emotion recognition model based on dynamic modeling of speaker’s personality (ERC DMSP). In our approach, to extract a speaker’s personality profile, we design a personality capture module to model the personalities of individuals based on their historical utterances. Moreover, a bidirectional influence exists between a speaker’s personality tendencies and their linguistic behavior. The speaker’s personality profile is thus continually updated based on the ongoing dialog. Additionally, since the personalities of other speakers in the conversation can also affect the form and intensity of a speaker’s emotional expression, we construct a conversation emotion representation utilizing group personality traits. We then comprehensively incorporate the speaker’s personality into the emotion representation of each utterance at both the group and individual levels through the personality engagement module. Throughout this process, the representation of dialog and the speaker’s personality undergo hierarchical updates, leading to more accurate conversation emotion recognition. We conducted extensive experiments on four commonly used public benchmark datasets for ERC to evaluate the effectiveness of our proposed ERC DMSP model. The results demonstrate its efficacy, as it exhibits a significant improvement over other methods in popular

关键词： Measurement Emotion recognition Accuracy Codes Neural networks Oral communication Color

来源：评论

学校读者我要写书评

暂无评论

Dynamic Pseudonym Semantic-location Privacy Protection Based on Continuous Query for Road network

引用

International Journal of network security 2021年第4期23卷 642-649页

作者： Wang, Yonglu Zuo, Kaizhong Liu, Rui Zhao, Jun School of Computer and Information Anhui Normal University Anhui Provincial Key Lab of Network and Information Security Anhui Normal University Wuhu241002 China

Continuous queries are one of the most common queries in location-based services, although particularly useful, such queries raise serious privacy concerns. Due to frequently updated continuous locations, continuous query privacy will be disclosed. Constructing a constant anonymous user set is one of the main methods used to protect privacy information. The exiting methods don’t consider query duration or users’ personalized privacy requirements, and the semantic information of location isn’t fully taken into account. In order to solve these problems, a dynamic pseudonym semantic-location privacy protection algorithm based on continuous query for road network is proposed in this paper. Firstly, the city road network in question is divided using the Voronoi diagram. Secondly, a secure anonymous region is generated by adopting the greedy strategy based on location and privacy requirement. Finally, the intersection of anonymous user sets at different times is calculated, and the user’s identity information is updated using the dynamic pseudonym mechanism. Experimental results show that the proposed method can satisfy users’ personalized privacy requirements and improve the security of privacy protection and query efficiency. © 2021

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

VULSEYE: Detect Smart Contract Vulnerabilities via Stateful Directed Graybox Fuzzing

arXiv

引用

arXiv 2024年

作者： Liang, Ruichao Chen, Jing Wu, Cong He, Kun Wu, Yueming Cao, Ruochen Du, Ruiying Liu, Yang Zhao, Ziming Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan University Wuhan430072 China Cyber Security Lab College of Computing and Data Science Nanyang Technological University Singapore Department of Computer Science and Engineering University at Buffalo New York United States

Smart contracts, the cornerstone of decentralized applications, have become increasingly prominent in revolutionizing the digital landscape. However, vulnerabilities in smart contracts pose great risks to user assets and undermine overall trust in decentralized systems. Fuzzing, a prominent security testing technique, is extensively explored to detect vulnerabilities. But current smart contract fuzzers fall short of expectations in testing efficiency for two primary reasons. Firstly, smart contracts are stateful programs, and existing approaches, primarily coverage-guided, lack effective feedback from the contract state. Consequently, they struggle to effectively explore the contract state space. Secondly, coverage-guided fuzzers, aiming for comprehensive program coverage, may lead to a wastage of testing resources on benign code areas. This wastage worsens in smart contract testing, as the mix of code and state spaces further complicates comprehensive testing. To address these challenges, we propose VULSEYE, a stateful directed graybox fuzzer for smart contracts guided by vulnerabilities. Different from prior works, VULSEYE achieves stateful directed fuzzing by prioritizing testing resources to code areas and contract states that are more prone to vulnerabilities. We introduce Code Targets and State Targets into fuzzing loops as the testing targets of VULSEYE. We use static analysis and pattern matching to pinpoint Code Targets, and propose a scalable backward analysis algorithm to specify State Targets. We design a novel fitness metric that leverages feedback from both the contract code space and state space, directing fuzzing toward these targets. With the guidance of code and state targets, VULSEYE alleviates the wastage of testing resources on benign code areas and achieves effective stateful fuzzing. In comparison with state-of-the-art fuzzers, VULSEYE demonstrated superior effectiveness and efficiency. Notably, it uncovered 4,845 vulnerabilities in 42,738 rea

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

LGDB-Net: Dual-Branch Path for Building Extraction from Remote Sensing Image

LGDB-Net: Dual-Branch Path for Building Extraction from Remo...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Ronghuan Zhang Jing Zhao Ming Li Qingzhi Zou Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China School of Intelligence and Information Engineering Shandong University of Traditional Chinese Medicine Jinan China

ISBN: (数字)9798331515966

ISBN: (纸本)9798331515973

Extracting buildings from remote sensing images using deep learning techniques is a widely applied and crucial task. Convolutional Neural networks (CNNs) adopt hierarchical feature representation, showcasing powerful capabilities in extracting local information but facing challenges in capturing global features. Transformers can address this limitation, but they perform poorly in extracting local features and significantly increase memory requirements and computational complexity. To overcome these challenges, we propose a method for building extraction from remote sensing images called LGDB-Net (Local-Global Dual-Branch network), employing a dual-branch approach. Firstly, inspired by Swin Transformer, we designed GB-Former(Global Branch-Former) as the backbone network to model global information. We use a linear multi-head self-attention mechanism to reduce time and memory complexity while maintaining a large global receptive field. Additionally, we replace the traditional multi-layer perceptron with a convolution-enhanced multi-layer perceptron to improve channel feature representation, reduce model parameters, and enhance segmentation performance. Secondly, we use multiple Depth-wise Conv3×3 + LN (Layer Normalization) + GeLU (Gaussian Error Linear Unit) modules as the auxiliary branch for local detailed feature extraction. Finally, we adopt a multi-scale feature fusion strategy to integrate feature information from both branches. We conduct a series of experiments on three datasets: WHU, Massachusetts, and Inria. The experimental results demonstrate that the proposed method not only effectively improves segmentation accuracy with lower building omission and commission rates but also significantly reduces model parameters and computational complexity.

关键词： Accuracy Computational modeling Memory management Neural networks Feature extraction Transformers Sensors Data mining Computational complexity Remote sensing

来源：评论

学校读者我要写书评

暂无评论

Estimator Meets Equilibrium Perspective: A Rectified Straight Through Estimator for Binary Neural networks Training

Estimator Meets Equilibrium Perspective: A Rectified Straigh...

引用

International Conference on computer Vision (ICCV)

作者： Xiao-Ming Wu Dian Zheng Zuhao Liu Wei-Shi Zheng School of Computer Science and Engineering Sun Yat-sen University China Pengcheng Lab China Guangdong Province Key Laboratory of Information Security Technology China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China

Binarization of neural networks is a dominant paradigm in neural networks compression. The pioneering work BinaryConnect uses Straight Through Estimator (STE) to mimic the gradients of the sign function, but it also causes the crucial inconsistency problem. Most of the previous methods design different estimators instead of STE to mitigate it. However, they ignore the fact that when reducing the estimating error, the gradient stability will decrease concomitantly. These highly divergent gradients will harm the model training and increase the risk of gradient vanishing and gradient exploding. To fully take the gradient stability into consideration, we present a new perspective to the BNNs training, regarding it as the equilibrium between the estimating error and the gradient stability. In this view, we firstly design two indicators to quantitatively demonstrate the equilibrium phenomenon. In addition, in order to balance the estimating error and the gradient stability well, we revise the original straight through estimator and propose a power function based estimator, Rectified Straight Through Estimator (ReSTE for short). Comparing to other estimators, ReSTE is rational and capable of flexibly balancing the estimating error with the gradient stability. Extensive experiments on CIFAR-10 and ImageNet datasets show that ReSTE has excellent performance and surpasses the state-of-the-art methods without any auxiliary modules or losses.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：