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

Compact Broadband Rectifier With Wide Input Power Range Based on Adaptive Input Power Distribution

学校读者我要写书评

暂无评论

TechRxiv 2022年

作者： Liu, Xin Li, Yingsong Zhang, Dawei College of Information and Communication Engineering Harbin Engineering University Harbin150001 China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Anhui Hefei China

This paper presents a novel compact rectifier array with both broadband and wide input power range characteristics. The rectifier array consists of two rectifier units operating at low-power and high-power levels, respectively, and an adaptive input power distribution network (AIPDN) enabling automatic distribution of radio frequency (RF) energy at different power levels. In addition, a matching inductance is introduced to counteract the capacitance of the diode. As a result, the high RF-DC power conversion efficiency (PCE) is achieved in both broadband and wide input power range. For demonstration, a prototype of the presented rectifier array is fabricated and measured. The measured results are in good accordance with the simulated results. With an input power range of 8 – 25 dBm and a bandwidth of 1.82 – 2.75 GHz (fractional bandwidth of 40.7%), the PCE is greater than 50%. At 2.4 GHz, the input power ranges from -5.5 to 27.5 dBm with PCE greater than 50%. Besides, a peak PCE of 72.1% is obtained at an input power of 25 dBm. This work can lay the foundation for the development of a new RF energy harvest systems with wide frequency band and dynamic input power. © 2022, CC BY.

关键词： Horn antennas

Improved Uniform Linear Array Fitting Scheme with Increased Lower Bound on Uniform Degrees of Freedom for DOA Estimation

学校读者我要写书评

暂无评论

TechRxiv 2022年

作者： Shi, Wanlu Li, Yingsong The College of Information and Communication Engineering Harbin Engineering University Harbin150001 China The Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Anhui Hefei China

Recently, uniform linear array (ULA) fitting (UF) principle is proposed for sparse array (SA) design using pseudo-polynomial equations. Typically, it is verified that the designed SAs via UF enjoy a lower bound on uniform degrees of freedom (uDOF), which is approximately 0.5N2 with N sensors. Herein, an improved UF (IUF) scheme is proposed to significantly increase the lower bound on uDOF, which is realized by introducing two sub-ULAs, with name of adjoint transfer arrays (ATAs), on both sides of a transfer sub-ULA. The ATAs together with the transfer sub-ULA serve as a new layer to construct an adjoint transfer layer (ATL) that has improved aperture in comparison with traditional transfer layer to improve the lower bound on uDOF, which is derived in detail. Furthermore, two novel SAs are developed based on the ATL to verify the effectiveness of the proposed IUF scheme to increase the uDOF. Numerical simulations verify the superiority of devised SAs for direction-of-arrival (DOA) estimations. © 2022, CC BY.

关键词： Polynomials

Nonnegative Maximum Correntropy Adaptive Algorithm and Its Statistical Analysis

学校读者我要写书评

暂无评论

TechRxiv 2022年

作者： Sun, Zeyang Li, Yingsong College of Information and Communication Engineering Harbin Engineering University Harbin150001 China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Anhui Hefei China

Dynamic system modeling methods have become a hot topic for stationary and nonstationary signal processing. Nonnegativity is a desired constraint that usually exerts on to be estimated parameters, and its generation usually based on the inherent physical characteristics of unknown system. Moreover, non-Gaussian noise is present in many practical system identification situations. In this paper, an adaptive nonnegative maximum correntropy criterion (NNMCC) algorithm is proposed for system identification under non-negativity constraints. We derive the NNMCC algorithm based on the Karush-Kuhn-Tucker conditions and a fixed-point iteration scheme. The first-order and second-order moments of the NNMCC algorithm adaptive weights are theoretically analyzed. Experimental results validate the theoretical analysis and illustrate the superior performance of NNMCC in non-Gaussian noise environments. © 2022, CC BY.

关键词： Adaptive filtering

Transient Convergence Analysis of Least Lncosh Algorithm

学校读者我要写书评

暂无评论

TechRxiv 2022年

Lncosh function has been used for constructing a cost function for devising an adaptive filter algorithm to provide a desired performance under non-Gaussian noise, naming as least Lncosh algorithm (LLA). However, its transient behavior analysis has not been analyzed and investigated. As an important characteristic for the LLA, the transient behavior affects its performance in real-world applications. Herein, we present the theoretical model for evaluating the mean weight behavior and the transient excess mean square error (EMSE) behavior of the LLA. In addition, the proposed models can also be used to predict the transient behavior of the adaptive filtering algorithms with error nonlinearities under non-Gaussian noises. The experiment results have verified the validity of the presented models. © 2022, CC BY.

关键词： Adaptive filters

Extended Coprime Arrays with Sum-Difference Coarray for DOA Estimation 5

学校读者我要写书评

暂无评论

Extended Coprime Arrays with Sum-Difference Coarray for DOA ...

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

作者： Xin, Wei Xu, Lin Gao, Jincheng Li, Yingsong Huang, Zhixiang College of Information and Communication Engineering Harbin Engineering University Harbin150001 China Wuhan Second Ship Design and Research Institute Wuhan China Zhaojin Mining Industry Co. Ltd. Zhaoyuan China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education China

ISBN: (数字)9781665472111

ISBN: (纸本)9781665472111

A modified coprime array (CA) with a name of extended CA (ECA) is presented and constructed to reduce over-lapping sensors between sum and difference coarray using conventional CA (CCA) to get a sum-difference coarray with high degrees- of-freedoms (DOFs). The devised ECA is to shift a sub array of CCA to reduce redundancy and then to flip part of shifted sub array around zero point that is regarded as symmetric center. The onstructed ECA expands the inter-element separations with lower mutual coupling. Numerical simulation are provided to verify superiority of the devised ECA. © 2022 IEEE.

关键词： Direction of arrival

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

学校读者我要写书评

暂无评论

Interpersonal Relationship Analysis with Dyadic EEG Signals...

4th International Workshop on Human Brain and Artificial Intelligence, HBAI 2024

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

ISBN: (纸本)9789819640003

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. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Deep neural networks

Design and Implementation of Links Generation for Inter Domain Routing System 12

学校读者我要写书评

暂无评论

Design and Implementation of Links Generation for Inter Doma...

12th International Conference on Information Science and Technology, ICIST 2022

作者： Wang, Yu Qiao, Zhi Yin, Junru Zhang, Mingliang College of Software Henan University of Engineering Zhengzhou China College of Information and Electrical Engineering China Agriculture University Beijing China College of Computer and Communication Engineering Zhengzhou University of Light Industry Zhengzhou China State Key Laboratory of Mathematical Engineering and Advanced Computing Network Research Department Zhengzhou China

ISBN: (数字)9781665485821

ISBN: (纸本)9781665485821

Due to the inherent flaws of BGP protocol, the security of inter domain routing system has been regularly threatened. Since it is difficult to achieve collaborative defense against existing resources and strategies of multiple autonomous systems, this paper designs and organizes them into autonomous system community. Within the community, a precomputing multi-link generation mechanism is proposed based on genetic algorithm. Before the inter domain routing system is attacked, the link set can be generated as complete as possible in advance. Once an attack occurs, the community will quickly select proper precomputing links to replace the failed ones, in order to ensure the stability of inter domain communication. The effectiveness of the mechanism has been proved in function and performance through simulation experiments. © 2022 IEEE.

关键词： Genetic algorithms

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

学校读者我要写书评

暂无评论

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

International Conference on Computer Supported Cooperative Work in Design

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

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.

关键词：

Talking Head Generation for Media Interaction System with Feature Disentanglement

学校读者我要写书评

暂无评论

Talking Head Generation for Media Interaction System with Fe...

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Lei Zhang Qingyang Chen Zhilei Liu College of Intelligence and Computing School of New Media and Communication Tianjin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun P.R. China State Key Laboratory for Novel Software Technology Nanjing University P.R. China School of New Media and Communication Tianjin University Tianjin China College of Intelligence and Computing Tianjin University Tianjin China

The task of talking head generation for the media interaction system is to take images and audio clips of the target face as input, and generate a realistic video of the target synchronized with the audio. Most of the existing works directly take all the information in the image as input, which causes the problem of feature information redundancy. At the same time, in the stage of feature fusion, the image and audio information is directly spliced, and the relationship between the two modal information is ignored. To solve the problems, we initially implement the disentanglement of image by introducing a loss function to separate the image into identity features and content-related features. Besides, we introduce a multi-head selfattention mechanism to learn the relationship between the two modal information of image and audio, and implement the full fusion of multi-modal information. In addition, we validate the effectiveness of our model through extensive quantitative and qualitative analysis of two datasets. Extensive experiments show the superiority of the proposed model in all aspects.

关键词： Analytical models Redundancy Media Synchronization Task analysis Faces