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

2021 International Conference on Networking and Network Applications, NaNA 2021

作者： Ma, Sugang Zhang, Zixian Zhang, Lei Chen, Yanping Yang, Xiaobao Pu, Lei Hou, Zhiqiang Xi'an University of Posts and Telecommunications School of Computer Science and Technology Shaanxi Xi'an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an Key Laboratory of Big Data and Intelligent Computing Xi'an University of Posts and Telecommunications Shaanxi Xi'an710121 China School of Information and Navigation Air Force Engineering University Shaanxi Xi'an710077 China School of Information Engineering Chang'an University Shaanxi Xi'an710064 China

ISBN: (纸本)9781665441582

In an effort to the problem of insufficient tracking performance of the Fully-convolutional Siamese network (SiamFC) in complex scenarios, a dual attention mechanism object tracking algorithm based on the Fully-convolutional Siamese network is proposed to improve the generalization capability of the tracker by ameliorating the robustness of the template characteristics. Firstly, a global context attention module is appended after the backbone network of SiamFC to ameliorate the power of original feature extraction from two dimensions of spatial and channel. Then, a coordinate attention module is introduced to augment the capability of feature extraction in the channel dimension. Finally, the model of the proposed algorithm is trained on the Got-10k dataset. Five related algorithms are tested on the OTB2015 dataset, the results of experiments manifest that our algorithm outperforms the baseline trackers, the success and precision rate of the proposed algorithm are improved by 3.3% and 6.3%. The average tracking speed is 145FPS, which can demand the requirement of real-time tracking. © 2021 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Communication Encryption Scheme of 5G Power Trading Private Network Based on Dynamic key 2

Communication Encryption Scheme of 5G Power Trading Private ...

引用

2nd Asia Conference on Electrical, Power and Computer engineering, EPCE 2023

作者： Zhou, Rui Song, Yiyang Xu, Ying Harbin Institute of Technology Electrical Engineering and Automation School Harbin China Guangdong Power Exchange Center Information Data Department Guangzhou China Beijing University of Posts and Telecommunications Key Laboratory of Trustworthy Distributed Computing and Service Beijing China

ISBN: (纸本)9798350310818

Security has been the primary concern for the 5G power trading private network, which involves a large amount of power trading information. The communication must be encrypted to prevent the leakage of important information. The communication encryption scheme for 5G power trading private network should meet the characteristics of small communication overhead, low storage space requirement and strong resistance to attack. Based on these characteristics, the dynamic key-based encryption scheme is designed. To ensure the security and reduce the computation overhead, the optimized symmetric encryption algorithm is used to update the shared key. And the dynamic key generation method is improved by adding random numbers to solve the problem that the correct transmission of the data link does not have true randomness. The encryption mode used can generate dynamic keys directly and synchronously at both ends of the communication, reducing the overhead of key exchange and eliminating the need for trusted third parties. The algorithm is also analyzed for security and efficiency and compared with other algorithms. The experimental results show that the improved algorithm enhances security with guaranteed efficiency. © 2023 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

A Three-party Repeated Game Model for data Privacy in Mobile Edge Crowdsensing of IoT 13

A Three-party Repeated Game Model for Data Privacy in Mobile...

引用

13th EAI International Conference on Mobile Multimedia Communications, Mobimedia 2020

作者： Zhao, Mingfeng Chen, Lei Xiong, Jinbo Tian, Youliang Fujian Provincial Key Laboratory of Network Security and Cryptology College of Mathematics and Informatics Fujian Normal University Fuzhou350117 China College of Engineering and Computing Georgia Southern University GA30458 United States State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China

ISBN: (纸本)9781631902710

The low request response delay of mobile edge crowdsensing (MECS) paradigm allows quick interactions among entities in practical scenarios. However, there often exist dishonest behaviors in such interactions, and the personal information leakage involved seriously threatens the privacy and security of sensing users. To tackle this problem, previously we had proposed a non-repeated three-party game model, without the consideration of multiple interactions in the actual scenario. Based on game theory, this research therefore proposes a three-party repeated game model. Specifically, we propose the corresponding social norms for different phases of sensing data. It analyzes all possible behaviors deviating from rationality, calculates the change of corresponding payoff function, and explores the influencing factors and constraints of players' honest behaviors based on the premise of maximizing interests. Finally, a significant number of simulations and numerical analyse indicate that the proposed model is feasible and effective in maximizing the benefits of game participants. Copyright © 2020 EAI.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Thematic Event Extraction Based on Event-Related Sentence Detection 1

Thematic Event Extraction Based on Event-Related Sentence De...

引用

1st IEEE International Conference on Medical Artificial Intelligence, MedAI 2023

作者： Zhang, Xing Guo, Yucan Jin, Xiaolong Liang, Haozhe Guan, Saiping School of Computer Science and Technology University of Chinese Academy of Sciences China Institute of Computing Technology Chinese Academy of Sciences Cas Key Laboratory of Network Data Science and Technology China Institute of Systems Engineering Academy of Military Science Australia

ISBN: (纸本)9798350358780

Existing works in event extraction typically extract event arguments within the sentence scope. However, besides the sentence level, events may also be naturally presented at the document level. A document-level event usually reflects, to some extent, the theme (i.e., the main content) of the document (e.g., electronic medical records and news articles), which is thus referred to as the thematic event. Thematic Event Extraction (TEE) aims to extract the arguments of thematic events. TEE faces a major challenge, i.e., the sparsity and dispersion of arguments, which means that the arguments of a thematic event are dispersed in different sentences of the document. To overcome this challenge, we propose an Event-related Sentence Detection based TEE model, called ESDTEE, which first detects the sentences related to the thematic event and then extracts the arguments only within these detected sentences using existing models. Extensive experiments with comprehensive analyses demonstrate the effectiveness of ESDTEE. © 2023 IEEE.

关键词： Medical computing

来源：评论

学校读者我要写书评

暂无评论

Parallel generated method of transcriptional regulatory networks

Parallel generated method of transcriptional regulatory netw...

引用

作者： Liu, Shuai Ta, Na Lu, Mengye Liu, Gaocheng Bai, Weiling Li, Wenhui College of Computer Science Inner Mongolia University Hohhot010012 China Inner Mongolia Key Laboratory of Social Computing and Data Processing Hohhot010012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China

Generated method of transcriptional regulatory networks remains an important research in biology. Many approaches have been proposed to construct transcriptional regulatory networks. However, with the increase of ChIP-seq and RNA-seq data, the speed of constructing transcriptional regulation networks is still a challenge. Moreover, parallel computing lacks application in constructing gene regulatory networks through the analysis of the relationships between transcription factors (TFs) and target genes (TGs). Therefore, in this paper, a parallel generated method of transcriptional regulatory networks was proposed. First, two datasets, Michigan Cancer Foundation – 7 (MCF-7) and Cardiomyocytes (CM) were applied. Then, a parallel method was used to generate transcriptional regulatory network with their transcription factors (TFs) and target genes (TGs). Finally, experimental results showed that 61% regulatory relations in MCF-7 were validated in the Gene Expression Omnibus (GEO), while 29% results needed further experimental verification. Besides, 56% regulatory relations in CM were consistent with GEO, while 33% results were not yet verified. Furthermore, speed of parallel algorithm was faster than traditional serial algorithm in generating transcriptional regulatory networks. © 2018 John Wiley & Sons, Ltd.

关键词： Transcription factors

来源：评论

学校读者我要写书评

暂无评论

Collusion Resistant Identity-based Proxy Re-encryption Scheme on Lattice 6

Collusion Resistant Identity-based Proxy Re-encryption Schem...

引用

6th International Conference on Computer Information Science and Application Technology, CISAT 2023

作者： Deng, Xiaohong Xie, Hua Xiong, Weizhi School of Electronics and Information Engineering Gannan University of Science and Technology Ganzhou341000 China College of Information Science Jiangxi University of Science and Technology Ganzhou341000 China Key Laboratory of Cloud Computing and Big Data Ganzhou341000 China

ISBN: (纸本)9781510668546

Proxy re-encryption plays an important role for data security in cloud computing and big data, but the traditional reencryption scheme based on the classical number theory problem cannot resist quantum attack, and the lattice based cryptosystem has been proved to have the ability to resist quantum attack, so the lattice based re-encryption scheme has always been a research hotspot. In view of the problem that collusion-resistance and multi-hop can not be satisfied at the same time in existing schemes, this paper proposes a new identity-based proxy re-encryption scheme on lattice. Firstly, the scheme uses trapdoors as private keys to achieve one-way anti-collusion. In addition, we constructs a variant of learning with errors (LWE), which uses a convert algorithm to transform the user matrix and replace the vector with a uniform matrix, so that the scheme can meet the requirements of multi-hop and encrypt multiple bits of messages at one time. Theoretical analysis and experimental simulation prove that the security of the new scheme can be reduced to a decision LWE problem, which can reach the IND-sID-CPA security in the standard model, and can improve the encryption efficiency while ensuring the security. © 2023 SPIE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

A holistic stream partitioning algorithm for distributed stream processing systems 20

A holistic stream partitioning algorithm for distributed str...

引用

20th International Conference on Parallel and Distributed computing, Applications and Technologies, PDCAT 2019

作者： Li, Kejian Liu, Gang Lu, Minhua Guangdong Province Key Laboratory of Popular High Performance Computers Guangdong Province Engineering Center of China-made High Performance Data Computing System College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China School of Biomedical Engineering Shenzhen University Shenzhen518060 China

ISBN: (纸本)9781728126166

The performances of modern distributed stream processing systems are critically affected by the distribution of the load across workers. Skewed data streams in real world are very common and pose a great challenge to these systems, especially for stateful applications. key splitting, which allows a single key to be routed to multiple workers, is a great idea to achieve good balance of load in the cluster. However, it comes with the cost of increased memory consumption and computation overhead as well as network communication. In this paper, we present a new definition of metric to model the cost of key splitting for intra-operator parallelism in stream processing systems and provide a novel perspective to reduce replication factor while keeping both overall load imbalance and processing latency low. Similar to previous work, our approach treats the head and the tail of the distribution differently in order to reduce memory requirements. For the head, it uses our proposed notion of regional load imbalance to decide dynamically whether to make one more worker responsible for the heavy hitter or not. For the tail, it simply uses hash partitioning to keep the size of the routing table for the head as small as possible. Extensive experimental evaluation demonstrates that our approach provides superior performance compared to the state-of-the-art partitioning algorithms in terms of load imbalance, replication factor and latency over different levels of skewed stream distributions. © 2019 IEEE.

关键词： Distributed parameter control systems

来源：评论

学校读者我要写书评

暂无评论

Research on Star/Galaxy Classification Based on Stacking Ensemble Learning

引用

Chinese Astronomy and Astrophysics 2020年第3期44卷 345-355页

作者： Chao, L.I. Wen-hui, ZHANG Ran, L.I. Jun-yi, W.A.N.G. Ji-ming, L.I.N. College of Information and Communication Engineering Guilin University of Electronic Technology Guilin 541004 Key Laboratory of Education Ministry for Cognitive Radio and Information Processing Guilin University of Electronic Technology Guilin 541004 Guangxi Cooperative Innovation Center of Cloud Computing and Big Data Guilin University of Electronic Technology Guilin 541004 Guangxi College and University Key Laboratory for Cloud Computing and Complex Systems Guilin University of Electronic Technology Guilin 541004 Guangxi Key Laboratory for Wireless Wideband Communication and Signal Processing Guilin University of Electronic Technology Guilin 541004 Guangxi College and University Key Laboratory for Satellite Navigation and Position Sensing Guilin 541004

Machine learning has achieved great success in many areas today, but the forecast effect of machine learning often depends on the specific problem. An ensemble learning forecasts results by combining multiple base classifiers. Therefore, its ability to adapt to various scenarios is strong, and the classification accuracy is high. In response to the low classification accuracy of the darkest source magnitude set of stars/galaxies in the Sloan Digital Sky Survey (SDSS), a star/galaxy classification algorithm based on the stacking ensemble learning is proposed in this paper. The complete photometric data set is obtained from the SDSS data Release (DR) 7, and divided into the bright source magnitude set, dark source magnitude set, and darkest source magnitude set according to the stellar magnitude. Firstly, the 10-fold nested cross-validation method is used for the darkest source magnitude set, then the Support Vector Machine (SVM), Random Forest (RF), and eXtreme Gradient Boosting (XGBoost) algorithms are used to establish the base-classifier model;the Gradient Boosting Decision Tree (GBDT) is used as the meta-classifier model. Finally, based on the classification accuracy of galaxies and other indicators, the classification results are analyzed and compared with the results obtained by the Function Tree (FT), SVM, RF, GBDT, Stacked Denoising Autoencoders (SDAE), Deep Belief Nets (DBN), and Deep Perception Decision Tree (DPDT) models. The experimental results show that the stacking ensemble learning model has improved the classification accuracy of galaxies in the darkest source magnitude set by nearly 10% compared to the function tree algorithm. Compared with other traditional machine learning algorithm, stronger lifting algorithm, and deep learning algorithm, the stacking ensemble learning model also has different degrees of improvement. © 2020

关键词： Galaxies: fundamental parameters methods: data analysis Stars: fundamental parameters techniques: photometric

来源：评论

学校读者我要写书评

暂无评论

Feature Rotation Invariance Learning for Point Cloud Analysis 10

Feature Rotation Invariance Learning for Point Cloud Analysi...

引用

10th IEEE Smart World Congress, SWC 2024

作者： Shi, Lu Cao, Qi Zhang, Guoqing Yi, Jin Huang, Yansen Cen, Yigang Beijing Jiaotong University State Key Laboratory of Advanced Rail Autonomous Operation The School of Computer Science and Technology Visual Intellgence +X International Cooperation Joint Laboratory of Moe Beijing100044 China University of Glasgow The School of Computing Science 567739 Singapore Beijing Jiaotong University With the Key Laboratory of Big Data & Artificial Intelligence in Transportation Ministry of Education The State Key Laboratory of Advanced Rail Autonomous Operation The School of Computer and Information Technology Beijing100044 China Guizhou University Guizhou Lianjian Civil Engineering Quality Testing Monitoring Center Co. Ltd The College of Civil Engineering Guizhou550025 China

ISBN: (纸本)9798331520861

While deep learning has significantly advanced point cloud analysis, extracting effective features from their disordered structure remains challenging. Existing approaches often rely on complex network architectures or manual feature engineering to achieve rotation invariance, which increases inference latency. This paper offers a novel perspective on this challenge, showing that rotation-sensitive models can achieve performance comparable to rotation-invariant models when trained with rotation-augmented data. Given the significant differences in the feature distributions of rotation-sensitive and rotation-invariant models, we propose Feature Rotation Invariance Learning (FRIL), a framework that leverages Distance Metric Learning and rotation-based constraints to help rotation-sensitive models extract rotation-invariant features. This approach eliminates the need for additional modules, enabling robust performance against rotations. Extensive experiments demonstrate that FRIL consistently outperforms existing rotation-invariant methods across various visual tasks. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

An Advanced Quantum-Resistant Signature Scheme for Cloud Based on Eisenstein Ring

引用

Computers, Materials & Continua 2018年第7期56卷 19-34页

作者： Faguo Wu Xiao Zhang Wang Yao Zhiming Zheng Lipeng Xiang Wanpeng Li Key Laboratory of Mathematics Informatics and Behavioral SemanticsMinistry of EducationSchool of Mathematics and Systems ScienceBeihang UniversityBeijing100191China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang UniversityBeijing100191China The Fifth Electronics Research Institute of Ministry of Industry and Information Technology Guangzhou510610China Department of Electrical and Electronic Engineering City University of LondonUK

Signature,widely used in cloud environment,describes the work as readily identifying its *** existing signature schemes in the literature mostly rely on the Hardness assumption which can be easily solved by quantum *** this paper,we proposed an advanced quantum-resistant signature scheme for Cloud based on Eisenstein Ring(ETRUS)which ensures our signature scheme proceed in a lattice with higher *** proved that ETRUS highly improve the performance of traditional lattice signature ***,the Norm of polynomials decreases significantly in ETRUS which can effectively reduce the amount of polynomials convolution ***,storage complexity of ETRUS is smaller than classical ***,according to all convolution of ETRUS enjoy lower degree polynomials,our scheme appropriately accelerate 56.37%speed without reducing its security level.

关键词： Signature quantum-resistant Eisenstein Ring ETRUS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：