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

2023 IEEE International Workshop on Electromagnetics: Applications and Student Innovation Competition, iWEM 2023

作者： Li, Wen Xue, Wei Li, Yingsong Loh, Tian Hong Chung, Kwok L. Harbin Engineering University College of Information and Communication Engineering Harbin150001 China Anhui University The Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Hefei China National Physical Laboratory Electromagnetic and Eletrochemical Technologies Department Middlesex United Kingdom Huizhou University School of Computing Science and Engineering Huizhou516007 China

ISBN: (纸本)9798350336740

This paper introduced a dual-layer broadband high-gain circularly polarized (CP) antenna. The proposed broadband CP antenna consists of the radiating patch and couping structure, which is made up of opening slot patch and L-shaped stub. An axial-ratio bandwidth of 26 % (4.36-5.66 GHz) is shown by this proposed dual-layer CP patch antenna with a simulated -10-dB reflection coefficient bandwidth of 37 % (4.23-6.15 GHz). The broadband characteristics offered by this CP antenna are promising for a wide range of future applications. © 2023 IEEE.

关键词： Microstrip antennas

来源：评论

学校读者我要写书评

暂无评论

A Gong-Si-Shaped Heterogeneous Circular-Polarization Array for 5G Application 5

A Gong-Si-Shaped Heterogeneous Circular-Polarization Array f...

引用

5th IEEE International Conference on Electronic Information and communication Technology, ICEICT 2022

作者： Zhou, Wei Qi, Junwei Li, Yingsong Huang, Zhixiang Yang, Lixia College of Information and Communication Engineering Harbin Engineering University Harbin150001 China Anhui Province Key Laboratory of Target Recognition and Feature Extraction LuAn230088 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Hefei China

ISBN: (数字)9781665472111

ISBN: (纸本)9781665472111

In this work, a Gong-Si-shaped circularly polarized (CP) array with power driver for 5G is proposed. The radiator of the constructed CP array consists of two Chinese-like characters ' and '' with the similar size and pronunciation of 'gong' and 'si', Two L-shaped feeding probes of the same size are connected to the designed power driver printed on the bottom layer of ground plate, and the array can radiate circular polarization electromagnetic waves by changing the positions of the L-shaped probes and the angle of the horizontal parts of the L-shaped probes. From the simulating and optimizing, it is finally obtained that the -15 dB bandwidth of modeled Gong-Si-like CP antenna lies in 2.49 - 2.81 GHz and the presented Gong-Si-like CP antenna has a axial bandwidth covering 2.36 - 2.82 GHz, which meets the n41 5G band implementing at 2.515 - 2.675 GHz. © 2022 IEEE.

关键词： Circular polarization

来源：评论

学校读者我要写书评

暂无评论

Cost-Optimized Microservice Deployment for IoT Application in Cloud-Edge Collaborative Environment 26

Cost-Optimized Microservice Deployment for IoT Application i...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Zhang, Xiaoyuan Tang, Bing Yang, Qing Xu, Wei Guo, Feiyan Hunan University of Science and Technology Hunan Key Laboratory for Service Computing and Novel Software Technology School of Computer Science and Engineering Xiangtan411201 China Guangzhou Maritime University School of Information and Communication Engineering Guangzhou510725 China

ISBN: (纸本)9798350331684

With the popularity of cloud native and DevOps, container technology is widely used and combined with microservices. The deployment of container-based microservices in distributed cloud-edge infrastructure requires suitable strategies to ensure the quality of service for users. However, the existing container orchestration tools cannot flexibly select the best deployment location according to the user's cost budget, and are insufficient in personalized deployment solutions. From the perspective of application providers, this paper considers the location distribution of users, application dependencies, and server price differences, and proposes a genetic algorithm-based Internet-of-Things (IoT) application deployment strategy for personalized cost budgets. The application deployment problem is defined as an optimization problem that minimizes user service latency under cost constraints. This problem is an NP-hard problem, and genetic algorithm is introduced to solve the optimization problem effectively and improve the deployment efficiency. The proposed algorithm is compared with four baseline algorithms, Time-Greedy, Cost-Greedy, Random and PSO, using real datasets and some synthetic datasets. The results show that the proposed algorithm outperforms other competing baseline algorithms. © 2023 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Asymmetric Group key Agreement Protocol from Short Signatures 8

Asymmetric Group Key Agreement Protocol from Short Signature...

引用

8th IEEE International Conference on Computer and communications, ICCC 2022

作者： Shen, Kunyu Zhang, Lei Zhang, Rui Fang, Qihao Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute East China Normal University Shanghai200062 China Science and Technology on Communication Security Laboratory Sichuan Chengdu610041 China

ISBN: (纸本)9781665450515

Asymmetric group key agreement allows a group of users to negotiate a public encryption key that corresponds to several decryption keys, and each decryption key can only be computed by one group member. This novel notion ensures the confidentiality of communication among group members and allows any external entity to send messages to the group. However, the existing authenticated asymmetric group key agreement protocols are designed in identity-based cryptosystem or certificateless public key cryptosystem, which are not widely deployed. In this paper, we propose an efficient authenticated asymmetric group key agreement protocol. The protocol captures the security of secrecy, known-key security, key-compromise impersonation, unknown key-share and key control while being resistant to active attacks. The security of our protocol is reduced to the k-BDHE problem. © 2022 IEEE.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

MPC-Based Privacy-Preserving Serverless Federated Learning 3

MPC-Based Privacy-Preserving Serverless Federated Learning

引用

3rd International Conference on Big Data, Artificial Intelligence and Internet of Things Engineering, ICBAIE 2022

作者： Zhong, Liangyu Zhang, Lei Xu, Lin Wang, Lulu East China Normal University Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute Shanghai200062 China Science and Technology on Communication Security Laboratory Sichuan Chengdu610041 China

ISBN: (数字)9781665451604

ISBN: (纸本)9781665451604

Federated learning (FL) enables multiple users to collaboratively train a global model by keeping their data sets local. Since a single server is used, traditional FL faces the single point of failure problem. An available approach is to adopt a serverless architecture. However, most of existing serverless FL schemes fail to protect gradient privacy, except for a few schemes that adopt differential privacy (DP) where the global model accuracy will decrease. To address these problems, we propose a privacy-preserving serverless FL scheme based on secure multiparty computation (MPC). Combining multiple cryptographic primitives (e.g., key agreement and symmetric encryption), our scheme protects gradient privacy in FL and it is accuracy-lossless. By secret sharing, our scheme supports users to quit an FL task in each round during training. © 2022 IEEE.

关键词： Privacy-preserving techniques

来源：评论

学校读者我要写书评

暂无评论

Adaptively feature matching via joint transformational-spatial clustering

Adaptively feature matching via joint transformational-spati...

引用

作者： Wang, Linbo Tan, Li Fang, Xianyong Guo, Yanwen Wan, Shaohua MOE Key Laboratory of Intelligent Computing and Signal Processing School of Computer Science and Technology Anhui University Hefei China National Key Lab for Novel Software Technology Nanjing University Nanjing China School of Information and Safety Engineering Zhongnan University of Economics and Law Wuhan China

The transformational and spatial proximities are important cues for identifying inliers from an appearance based match set because correct matches generally stay close in input images and share similar local transformations. However, most existing approaches only check one type of them or both types consecutively with manually set thresholds, and thus their matching accuracy and flexibility in handling large-scale images are limited. In this paper, we present an efficient clustering based approach to identify match inliers with both proximities simultaneously. It first projects the putative matches into a joint transformational-spatial space, where mismatches tend to scatter all around while correct matches gather together. A mode-seeking process based on joint kernel density estimation is then proposed to obtain significant clusters in the joint space, where each cluster contains matches mapping the same object across images with high accuracy. Moreover, kernel bandwidths for measuring match proximities are adaptively set during density estimation, which enhances its applicability for matching different images. Experiments on three standard datasets show that the proposed approach delivers superior performance on a variety of feature matching tasks, including multi-object matching, duplicate object matching and object retrieval. © 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Clustering Density estimation Feature matching Mode-seeking

来源：评论

学校读者我要写书评

暂无评论

An efficient group key agreement protocol with administrator 3

An efficient group key agreement protocol with administrator

引用

3rd International Conference on Internet of Things and Smart City, IoTSC 2023

作者： Fang, Qihao Zhang, Lei Zhang, Mingrui Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai200062 China Science and Technology on Communication Security Laboratory Chengdu610041 China Engineering Research Center of Software/Hardware Co-design Technology and Application Ministry of Education Shanghai200062 China

ISBN: (纸本)9781510666375

Group key agreement technology is one of the most popular solution to establish a reliable secure channel between communicating entities of a group. Group key agreement protocol with administrator (GKAA) can handle a large number of group operations in sequence to resolve disorder problem and it is widely used in practical applications. However, in most of existing protocol, the administrator has to compute materials for each participant in the group which brings huge calculate overhead. In this paper, we propose an efficient group key agreement protocol with Administrator. Our GKAA protocol is able to perform group operation in a high efficacy way with the help of a key tree. It is also flexible and scalable since it suits for any network communication environment like IoT, video meeting, social applications, etc. Our protocol satisfies the properties including forward secrecy, PCS and key control resistance. © 2023 SPIE.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Practical privacy-preserving mixing protocol for Bitcoin 26

Practical privacy-preserving mixing protocol for Bitcoin

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Chang, Qianqian Xu, Lin Zhang, Lei Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai200062 China Science and Technology on Communication Security Laboratory Chengdu610041 China Engineering Research Center of Software/Hardware Co-design Technology and Application Ministry of Education Shanghai200062 China

ISBN: (纸本)9798350331684

The privacy of Cryptocurrencies are of great concern in various fields. Researches has shown that pseudonyms, which are used in Bitcoin, only provide weak privacy. The privacy of users may be put at risk under deanonymization attacks. The exisiting schemes typically require a trusted-third party to achieve anonymity, however this usually faces a single-point fault. In addition, existing schemes suffer from high communication complexity and impracticality. This paper proposes a practical privacy-preserving mixing protocol for Bitcoin to achieve unlink-ability of input and output address of transactions. Compared to existing schemes, our protocol improves practicality. The communication complexity of our protocol is linearly related to the number of peers. Moreover, our protocol is scalable as it works not only for Bitcoin, but also for other cryptocurrencies. © 2023 IEEE.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Edge-Preserving Multi-Exposure Fusion with Guided Filtering for Structural Patch Decomposition 6

Edge-Preserving Multi-Exposure Fusion with Guided Filtering ...

引用

6th IEEE International Conference on Electronic Information and communication Technology, ICEICT 2023

作者： Zhen, Yang Qi, Junwei Li, Yingsong College of Information and Communication Engineering Harbin Engineering University Harbin150001 China Ministry of Education Anhui University Key Laboratory of Intelligent Computing and Signal Processing Hefei China College of Computer Science and Technology Harbin Engineering University Harbin150001 China

ISBN: (纸本)9798350399059

Multi-exposure image fusion (MEF) is one of the effective ways to obtain high dynamic range (HDR) images. Multi-scale structural patch decomposition based MEF(MSPD) and edge-preserving structural patch decomposition (MESPD) have achieved state-of-the-art fusion quality. MESPD incorporates edge-preserving factors into MSPD to preserve details in a single-scale setting. However, we find that the edge-preserving factors put too much emphasis on the edge, resulting in artifacts on some edges and loss of details. To tackle this issue, guided filter is introduced into MSPD, which is directly used as an edge-preserving filter instead of mean filter to implicitly decompose images. In addition, we have designed a flexible adaptive weight, which can further maintain details of the light and dark areas. Likewise, we inherit MESPD and MSPD to extend our method to multi-scale framework. Extensive experimental results demonstrate our method can produce satisfactory results in both static and dynamic scenes with fewer artifacts and low computational cost. © 2023 IEEE.

关键词： Image fusion

来源：评论

学校读者我要写书评

暂无评论

Interpersonal Relationship Analysis with Dyadic EEG Signals via Learning Spatial-Temporal Patterns

arXiv

引用

arXiv 2024年

作者： Ji, Wenqi Liu, Fang Du, Xinxin Liu, Niqi Zhou, Chao Yu, Minjing Zhao, Guozhen Liu, Yong-Jin BNRist Department of Computer Science and Technology MOE Key Laboratory of Pervasive Computing Tsinghua University China State Key Laboratory of Media Convergence and Communication Communication University of China China Institute of Software Chinese Academy of Sciences China College of Intelligence and Computing Tianjin University China CAS Key Laboratory of Behavioral Science Institute of Psychology China

Interpersonal relationship quality is pivotal in social and occupational contexts. Existing analysis of interpersonal relationships mostly rely on subjective self-reports, whereas objective quantification remains challenging. In this paper, we propose a novel social relationship analysis framework using spatio-temporal patterns derived from dyadic EEG signals, which can be applied to quantitatively measure team cooperation in corporate team building, and evaluate interpersonal dynamics between therapists and patients in psychiatric therapy. First, we constructed a dyadic-EEG dataset from 72 pairs of participants with two relationships (stranger or friend) when watching emotional videos simultaneously. Then we proposed a deep neural network on dyadic-subject EEG signals, in which we combine the dynamic graph convolutional neural network for characterizing the interpersonal relationships among the EEG channels and 1-dimension convolution for extracting the information from the time sequence. To obtain the feature vectors from two EEG recordings that well represent the relationship of two subjects, we integrate deep canonical correlation analysis and triplet loss for training the network. Experimental results show that the social relationship type (stranger or friend) between two individuals can be effectively identified through their EEG data. Copyright © 2024, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：