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

International Applied Computational Electromagnetics Society Symposium (ACES)

作者： Guilin Hou Ziheng Song Guoda Xie Pan Pan Zhixiang Huang School of Electronic and Information Engineering Anhui university Hefei China Education of Anhui Province. Anhui Province Key Laboratory of Target Recognition and Feature Extraction (Luan Anhui 237000 China) Ministry of Education. the Key Laboratory of Intelligent Computing and Signal Processing Hefei China Anhui Province Anhui University. Key Laboratory of Electromagnetic Environmental Sensing (Hefei 230601 China) Anhui university Hefei China

This paper introduces the application of unconditionally stable locally one-dimensional finite-difference time-domain(LOD-FDTD) method to 3D multi-pole Debye dispersive media model. Compared with other methods for dispersive media, the Z-transform method does not need to retain the electromagnetic values of the previous moments, has less memory footprint, and its numerical implementation is more straightforward. Through numerical examples, ZT-LOD-FDTD shows the advantages of accuracy and high computational efficiency.

关键词： Solid modeling Three-dimensional displays Memory management Media Electromagnetic modeling Numerical models Time-domain analysis

来源：评论

学校读者我要写书评

暂无评论

A Low-Complexity and High-Efficient Pilot Allocation Scheme Based on User Grouping in Massive MIMO System 19

A Low-Complexity and High-Efficient Pilot Allocation Scheme ...

引用

19th IEEE International Conference on Communication Technology, ICCT 2019

作者： Zhao, Xinying Yao, Yijing Xu, Lei Fang, Hongyu Zhang, Hongwei Li, Xiaohui Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Hefei China

ISBN: (纸本)9781728105352

Pilot allocation is one of the effective means to reduce pilot pollution in massive Multiple-Input Multiple-Output (MIMO) systems. The goal of this paper is to improve the uplink achievable sum rates of strong users, and ensure the quality of service (QoS) requirements of weak users at the same time, so that the sum rates of system can be improved. Combining with the technical advantage of pilot grouping, a low complexity pilot allocation scheme based on matching algorithm is proposed, which divides the users in the target cell into weak user group and strong user group, and adopts the minimum-maximum matching method to allocate pilots in weak user group. Through the introduction of Hungarian algorithm, a pilot allocation method is designed to ensure the fairness of the strong users. The simulation results show that, compared with the smart pilot allocation scheme, the pilot allocation scheme based on Hungarian algorithm, the pilot allocation scheme based on user grouping and the random pilot allocation scheme, the system performance of the proposed scheme has been effectively improved. © 2019 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

A Millimeter-Wave Wideband Integrated Log-Periodic Antenna Array

A Millimeter-Wave Wideband Integrated Log-Periodic Antenna A...

引用

Cross Strait Quad-Regional Radio Science and Wireless Technology Conference (CSQRWC)

作者： Daosheng Huang Guanghui Xu Jie Wu Hui Xu Li-Xia Yang Zhi-Xiang Huang Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei China

ISBN: (数字)9781728181813

ISBN: (纸本)9781728181820

The millimeter-Wave (mm-Wave) wideband integrated log-periodic antenna array based on multilayer PCB is proposed in this paper. The antenna array is simulated and designed to operate at the mm-Wave band of 32-47 GHz with the impedance bandwidth of 37.5%. Differential feeding is adopted to reduce the cross polarization, and EBG structure is used to improve the back lobe. The simulated maximum gain of the array is 11 dBi and the cross-polarization ratio is less than -40 dB. Due to its wide bandwidth, high gain and low cross polarization, the proposed array will be a suitable scheme for many mm-Wave applications.

关键词： Millimeter wave technology Nonhomogeneous media Broadband antennas Gain Wideband Antenna arrays Periodic structures

来源：评论

学校读者我要写书评

暂无评论

Analysis of Asymptotically Tight Approximation ser for Cooperative NOMA Systems 19

Analysis of Asymptotically Tight Approximation ser for Coope...

引用

19th IEEE International Conference on Communication Technology, ICCT 2019

作者： Zhu, DIngcheng Yao, Yijing Xu, Lei Zhang, Hongwei Fang, Hongyu Li, Xiaohui Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Hefei China

ISBN: (纸本)9781728105352

The closed-form formula derivation of the power domain cooperative Non-Orthogonal Multiple Access (NOMA) system is of great significance for further improving the performance of the system. However, the system performance formulas of the channel capacity and the paired bit error rate Pairwise Error Probability (PEP) are too complicated, which have increased the difficulty in system performance optimization. Therefore, based on the Amplify Forward (AF) relay cooperative NOMA model, the signal Interference Noise Ratio (SINR) formulas of the two weak-user nodes are constructed. Through the assumption of that, the Symbol Error Rate (SER) of each user is fair, the simplification condition of Moment Generating Function (MGF) with the harmonic mean form is satisfied. Combined with the SER calculation formula of MGF, the system SER asymptotically tight approximation formula with simple structure is derived at high signal-to-noise ratio (SNR). The Monte Carlo simulation results show that, the formula can accurately describe the SER performance of the power domain cooperative NOMA system with the non-ideal Successive Interference Cancellation (SIC) system when SNR is high. Under the condition of certain total power, the optimal power distribution factor is solved in order to minimize the total system SER. © 2019 IEEE.

关键词： Bit error rate

来源：评论

学校读者我要写书评

暂无评论

A Novel FDTD Algorithm Based on the Vector and Scalar Potentials Equations 5

A Novel FDTD Algorithm Based on the Vector and Scalar Potent...

引用

5th IEEE International Conference on Computational Electromagnetics, ICCEM 2019

作者： Liu, Zhipeng Xie, Guoda Wu, Bo Ren, Xingang Fang, Ming Huang, Zhixiang Key Laboratory of Intelligent Computing Signal Processing Ministry of Education Anhui University Hefei China

ISBN: (纸本)9781538671115

As the advance in nanotechnology, the length of electronic devices down to nano-scale structure. It is important to consider multi-scale phenomena ruled by the Maxwell's equation in the finite-difference time-domain (FDTD) simulation. This paper provides an alternate approach for solving the vector and scalar potentials (A and Φ) formulation of Maxwell's equations instead of the fields (E and H) which might suffer from low frequency breakdown problem. This new approach is more suitable for multi-scale problem since it is stable in the long wavelength regime which established the proposed method as a better algorithm in the electromagnetic simulation. © 2019 IEEE.

关键词： Maxwell equations

来源：评论

学校读者我要写书评

暂无评论

A Verlet Time-stepping Nodal DGTD Method for Electromagnetic Scattering and Radiation 5

A Verlet Time-stepping Nodal DGTD Method for Electromagnetic...

引用

5th IEEE International Conference on Computational Electromagnetics, ICCEM 2019

作者： Wang, Yulong Zhao, Ran Huang, Zhixiang Wu, Xianliang Key Laboratory of Intelligent Computing Signal Processing Ministry of Education Anhui University Hefei China

ISBN: (纸本)9781538671115

In this paper, a discontinuous Galerkin time domain (DGTD) method is proposed to solve electromagnetic radiation and scattering problems. In this method, for the electromagnetic radiation problem, the dipole source excitation is introduced by the Total field / Scattering field (TF/SF) boundary condition. On the basis of TF/SF boundary condition, an equivalent principle (EP) based boundary condition is also introduced. For the electromagnetic scattering problem, the plane wave excitation is introduced by pure scattered field method. For all the cases, uniaxial perfectly matched layer (UPML) is used as the truncated boundary condition to enhance the reflection wave absorption. At the same time, the method uses nodal local basis function (for spatial discretization) and Verlet method (for time integration) to solve Maxwell equation. Numerical results show the effectiveness and accuracy of the algorithm. © 2019 IEEE.

关键词： Boundary conditions

来源：评论

学校读者我要写书评

暂无评论

Dynamic Multi-user Detection Scheme Based on CVA-SSAOMP Algorithm in Uplink Grant-Free NOMA 19

Dynamic Multi-user Detection Scheme Based on CVA-SSAOMP Algo...

引用

19th IEEE International Conference on Communication Technology, ICCT 2019

作者： Zhang, Jian Bai, Shichao Xu, Lei Zhang, Hongwei Fang, Hongyu Li, Xiaohui Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Hefei China

ISBN: (纸本)9781728105352

In the uplink grant-free non-orthogonal multiple access (NOMA) scenario, since the active user at the sender has a structured sparsity transmission characteristic, the compressive sensing recovery algorithm is initially applied to the joint detection of the active user and the transmitted data. However, the existing compressive sensing recovery algorithms with unknown sparsity often require noise power or signal-to-noise ratio (SNR) as the priori conditions, which greatly reduces the algorithm adaptability in multi-user detection. Therefore, an algorithm based on cross validation aided structured sparsity adaptive orthogonal matching pursuit (CVA-SSAOMP) is proposed to realize multi-user detection in dynamic change communication scenario of channel state information (CSI). The proposed algorithm transforms the structured sparsity model into a block sparse model, and without the priori conditions above, the cross validation method in the field of statistics and machine learning is used to adaptively estimate the sparsity of active user through the residual update of cross validation. The simulation results show that, compared with the traditional orthogonal matching pursuit (OMP) algorithm, subspace pursuit (SP) algorithm and cross validation aided block sparsity adaptive subspace pursuit (CVA-BSASP) algorithm, the proposed algorithm can effectively improve the accurate estimation of the sparsity of active user and the performance of system bit error ratio (BER), and has the advantage of low-complexity. © 2019 IEEE.

关键词： Multiuser detection

来源：评论

学校读者我要写书评

暂无评论

DMNER: Biomedical Named Entity Recognition by Detection and Matching

DMNER: Biomedical Named Entity Recognition by Detection and ...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Junyi Bian Rongze Jiang Weiqi Zhai Tianyang Huang Xiaodi Huang Hong Zhou Shanfeng Zhu School of Computer Science Fudan University Shanghai China Institute of Science and Technology for Brain-Inspired Intelligence Fudan University Shanghai China School of Computing Mathematics and Engineering Charles Sturt University New South Wales Australia Atypon Systems LLC UK Key Laboratory of Computational Neuroscience and Brain-Inspired Intelligence Institute of Science and Technology for Brain-Inspired Intelligence and MOE Frontiers Center for Brain Science Shanghai Key Lab of Intelligent Information Processing Zhangjiang Fudan International Innovation Center Fudan University Shanghai China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Biomedical Named Entity Recognition (NER) is a crucial task in extracting information from biomedical texts. However, the diversity of professional terminology, semantic complexity, and the widespread presence of synonyms pose significant challenges. Traditional methods that rely on sequence labeling training datasets often struggle to handle these complexities. To address this, we introduce a novel framework for BioNER, termed DMNER, which leverages external knowledge and operates in two steps: entity boundary detection and entity category identification through matching. The core of DMNER is its second step, which determines the entity category by retrieving similar entities and their categories from a knowledge dictionary using semantic similarity matching. Our experiments on 10 biomedical datasets demonstrate that DMNER outperforms baselines across these tasks, proving its effectiveness and adaptability. DMNER is versatile and can be applied to various NER tasks, including supervised NER, distantly supervised NER, and NER on multiple datasets with disjoint label sets. The DMNER code is publicly available 1 .

关键词： Training Dictionaries Codes Semantics Named entity recognition Complexity theory Labeling Data mining Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous influence of individuals’ behavior on mask efficacy in gathering environments

引用

Frontiers of Engineering Management 2022年第4期9卷 550-562页

作者： Haochen SUN Xiaofan LIU Zhanwei DU Ye WU Haifeng ZHANG Xiaoke XU College of Information and Communication Engineering Dalian Minzu UniversityDalian 116600China Web Mining Laboratory Department of Media and CommunicationCity University of Hong KongHong KongChina WHO Collaborating Centre for Infectious Disease Epidemiology and Control School of Public HealthLi Ka Shing Faculty of MedicineThe University of Hong KongHong KongChina Laboratory of Data Discovery for Health Hong Kong Science and Technology ParkHong KongChina Computational Communication Research Center Beijing Normal University(Zhuhai)Zhuhai 519087China School of Journalism and Communication Beijing Normal UniversityBeijing 100875China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Mathematical ScienceAnhui UniversityHefei 230601China

Wearing masks is an easy way to operate and popular measure for preventing *** masks can slow down the spread of viruses,their efficacy in gathering environments involving heterogeneous person-to-person contacts remains ***,we aim to investigate the epidemic prevention effect of masks in different real-life gathering *** study uses four real interpersonal contact datasets to construct four empirical networks to represent four gathering *** transmission of COVID-19 is simulated using the Monte Carlo simulation *** heterogeneity of individuals can cause mask efficacy in a specific gathering environment to be different from the baseline efficacy in general ***,the heterogeneity of gathering environments causes the epidemic prevention effect of masks to *** masks can greatly reduce the probability of clustered epidemics and the infection scale in primary schools,high schools,and ***,the use of masks alone in primary schools and hospitals cannot control *** high schools with social distancing between classes and in workplaces where the interpersonal contact is relatively sparse,masks can meet the need for *** the heterogeneity of individual behavior,if individuals who are more active in terms of interpersonal contact are prioritized for mask-wearing,the epidemic prevention effect of masks can be ***,asymptomatic infection has varying effects on the prevention effect of masks in different *** effect can be weakened or eliminated by increasing the usage rate of masks in high schools and ***,the effect on primary schools and hospitals cannot be *** study contributes to the accurate evaluation of mask efficacy in various gathering environments to provide scientific guidance for epidemic prevention.

关键词： COVID-19 masks behavioral heterogeneity asymptomatic infection

来源：评论

学校读者我要写书评

暂无评论

A Fast Method for Shortest-Path Cover Identification in Large Complex Networks

引用

Computers, Materials & Continua 2020年第5期63卷 705-724页

作者： Qiang Wei Guangmin Hu Chao Shen Yunfei Yin School of Information and Communication Engineering University of Electronic Science and Technology of ChinaChengdu611731China National Key Laboratory of Science and Technology on Blind Signal Processing Chengdu610041China MOE Key Lab for Intelligent Networks and Network Security Xi’an Jiaotong UniversityXi’an710049China The Electronic Engineering Department Universidad de SevillaSeville41004Spain School of Astronautics Harbin Institute of TechnologyHarbin150001China

Fast identifying the amount of information that can be gained by measuring a network via shortest-paths is one of the fundamental problem for networks exploration and ***,the existing methods are time-consuming for even moderate-scale *** this paper,we present a method for fast shortest-path cover identification in both exact and approximate scenarios based on the relationship between the identification and the shortest distance *** effectiveness of the proposed method is validated through synthetic and real-world *** experimental results show that our method is 105 times faster than the existing methods and can solve the shortest-path cover identification in a few seconds for large-scale networks with millions of nodes and edges.

关键词： Network discovery shortest-path cover shortest-path distance query large complex networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：