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

A Second-order C-bandpass Frequency Selective Surface

学校读者我要写书评

暂无评论

A Second-order C-bandpass Frequency Selective Surface

International Conference on Microwave and Millimeter Wave Technology Proceedings

作者： Shenbing Wu Mingsheng Chen Meng Kong Liang Zhang Key Lab of Intelligent Computing & Signal Processing Ministry of Education Anhui University School of Electronic Engineering Huainan Normal University AnHui Province Key Laboratory of Simulation and Design for Electronic Information System Hefei Normal University

ISBN: (数字)9781728157337

ISBN: (纸本)9781728157344

A novel C-bandpass frequency selective surface(FSS) exhibiting miniaturized periodic parts is developed in this study. Such FSS acts as a bandpass filter at 4.03--7.87GHz. The proposed FSS exhibits miniaturization characteristics with the unit-cell dimension 0.12λ*0.12λ and the total thickness less than λ/28. Meantime, the simulation results reveal that the second-order FSS exhibits better stability under a variety of incident directions and polarization modes.

关键词： Frequency selective surfaces Microwave technology Surface waves Simulation Millimeter wave technology Stability analysis Periodic structures

Trajectory optimisation design of robot based on artificial intelligence algorithm

学校读者我要写书评

暂无评论

International Journal of Wireless and Mobile Computing 2019年第1期16卷 35-40页

作者： Huang, Li Zhang, Kai Hu, Wei Li, Chengcheng College of Computer Science and Technology Wuhan University of Science and Technology Hubei Wuhan430081 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology Hubei Wuhan430081 China Key Laboratory of Metallurgical Equipment and Control Technology Ministry of Education Wuhan University of Science and Technology Hubei Wuhan430081 China

Artificial intelligence has attracted more and more attention and has been widely used in all walks of life, especially in the education industry;artificial intelligence has gradually become the core. Aiming at the problem of robot trajectory planning in artificial intelligence, this paper applies the project teaching method to the course of artificial intelligence, regards trajectory planning as a project, analyses and studies it, uses ant colony algorithm to find the optimal planning path. Through the teaching of the project, the students will understand the ant colony algorithm more deeply. The algorithm is programmed independently to achieve the final trajectory optimisation. Students become the main body of the classroom, give full play to the initiative and enthusiasm of the students, through the operation of the project to train the students' innovative ability and cooperation ability, and improve the overall quality of the college students. Copyright © 2019 Inderscience Enterprises Ltd.

关键词： Students

Exploring Invariance Matters for Domain Generalization

学校读者我要写书评

暂无评论

IEEE Transactions on Image processing 2025年

作者： Wang, Shanshan He, Houmeng Yang, Xun Liu, Zhipu Zhong, Yuanhong Zhang, Xingyi Wang, Meng Anhui University National Key Laboratory of Opto-Electronic Information Acquisition and Protection Technology Institutes of Physical Science and Information Technology Hefei230601 China University of Science and Technology of China School of Information Science and Technology Department of Electronic Engineering and Information Science Hefei230026 China Chongqing University of Technology School of Computer Science and Engineering Chongqing400054 China Chongqing University School of Microelectronics and Communication Engineering Chongqing400030 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Computer Science and Technology Hefei230601 China Hefei University of Technology School of Computer Science and Information Engineering Hefei230009 China

Domain generalization (DG) aims to solve the problem of significant performance degradation when target domain data collected from the Out-Of-Distribution (O.O.D). Previous efforts try to exploit invariant features in the source domain through CNN networks. However, inspired by causal mechanisms, we find that the complex spurious-invariant information is still hidden in this view invariant features, and the impact of domain and class discrepancies on extracting invariance has not been effectively mitigated. To alleviate these issues, we propose a self-weighted multi-view mining invariance domain generalization framework (SMIDG). On the one hand, to make up for the insufficiency of traditional single-view convolutional feature extraction networks, we propose to mine features from another frequency view and use the self-adaptive adversarial masks to eliminate some spurious correlations, ensuring causal invariance in the coarse-grained generalization. However, due to inconsistencies in discriminative information between interdomain and intra-domain samples, as well as inter-class and intra-class samples, the coarse-grained elimination of spurious associations does not fully resolve this issue. On the other hand, we also consider the fine-grained generalization from two aspects. Firstly, to better tackle the domain discrepancies, we propose a novel progressive contrastive learning strategy that learns the underlying specific features of samples while gradually mitigating domain discrepancies, thereby ensuring domain invariance in fine-grained generalization. Secondly, due to the issue of feature inconsistency, we adopt a self-adaptive hard sample mining method with information gain to ensure that the model pays more attention on hard disentangled samples, thus maintaining feature invariance. Extensive experiments on five benchmark datasets demonstrate that our method outperforms state-of-the-art approaches. © 1992-2012 IEEE.

关键词：

Anomalydae: Dual autoencoder for anomaly detection onattributed networks

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Fan, Haoyi Zhang, Fengbin Li, Zuoyong School of Computer Science and Technology Harbin University of Science and Technology Harbin150080 Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou350121

Anomaly detection on attributed networks aims at finding nodes whose patterns deviate significantly from the majority of reference nodes, which is pervasive in many applications such as network intrusion detection and social spammer detection. However, most existing methods neglect the complex cross-modality interactions between network structure and node attribute. In this paper, we propose a deep joint representation learning framework for anomaly detection through a dual autoencoder (AnomalyDAE), which captures the complex interactions between network structure and node attribute for high-quality embeddings. Specifically, Anoma-lyDAE consists of a structure autoencoder and an attribute autoencoder to learn both node embedding and attribute embedding jointly in latent space. Moreover, attention mechanism is employed in structure encoder to learn the importance between a node and its neighbors for an effective capturing of structure pattern, which is important to anomaly detection. Besides, by taking both the node embedding and attribute embedding as inputs of attribute decoder, the cross-modality interactions between network structure and node attribute are learned during the reconstruction of node attribute. Finally, anomalies can be detected by measuring the reconstruction errors of nodes from both the structure and attribute perspectives. Extensive experiments on real-world datasets demonstrate the effectiveness of the proposed *** Codes 68T30 Copyright © 2020, The Authors. All rights reserved.

关键词： Anomaly detection

Rate Splitting Multiple Access for Next Generation Cognitive Radio Enabled LEO Satellite Networks

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Khan, Wali Ullah Ali, Zain Lagunas, Eva Mahmood, Asad Asif, Muhammad Ihsan, Asim Chatzinotas, Symeon Ottersten, Björn Dobre, Octavia A. University of Luxembourg Luxembourg City1855 Luxembourg Department of Electrical and Computer Engineering University of California Santa Cruz United States Guangdong Key Laboratory of Intelligent Information Processing College of Electronics and Information Engineering Shenzhen Univerisyt Guangdong Shenzhen China The School of Computer Science and Electronic Engineering Bangor University BangorLL57 1UT United Kingdom The Department of Electrical and Computer Engineering Faculty of Engineering and Applied Science Memorial University St. John’sNLA1B 3X9 Canada

Low Earth Orbit (LEO) satellite communication (SatCom) has drawn particular attention recently due to its high data rate services and low round-trip latency. It has low launching and manufacturing costs than Medium Earth Orbit (MEO) and Geostationary Earth Orbit (GEO) satellites. Moreover, LEO SatCom has the potential to provide global coverage with a high-speed data rate and low transmission latency. However, the spectrum scarcity might be one of the challenges in the growth of LEO satellites, impacting severe restrictions on developing ground-space integrated networks. To address this issue, cognitive radio and rate splitting multiple access (RSMA) are the two emerging technologies for high spectral efficiency and massive connectivity. This paper proposes a cognitive radio enabled LEO SatCom using RSMA radio access technique with the coexistence of GEO SatCom network. In particular, this work aims to maximize the sum rate of LEO SatCom by simultaneously optimizing the power budget over different beams, RSMA power allocation for users over each beam, and subcarrier user assignment while restricting the interference temperature to GEO SatCom. The problem of sum rate maximization is formulated as non-convex, where the global optimal solution is challenging to obtain. Thus, an efficient solution can be obtained in three steps: first we employ a successive convex approximation technique to reduce the complexity and make the problem more tractable. Second, for any given resource block user assignment, we adopt Karush–Kuhn–Tucker (KKT) conditions to calculate the transmit power over different beams and RSMA power allocation of users over each beam. Third, using the allocated power, we design an efficient algorithm based on the greedy approach for resource block user assignment. For comparison, we propose two suboptimal schemes with fixed power allocation over different beams and random resource block user assignment as the benchmark. Numerical results provided in this wo

关键词： Spectrum efficiency

Minimal Binary Linear Codes from Vectorial Boolean Functions

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Li, Yanjun Peng, Jie Kan, Haibin Zheng, Lijing Institute of Statistics and Applied Mathematics Anhui University of Finance & Economics Anhui Bengbu233030 China Mathematics and Science College of Shanghai Normal University Guilin Road #100 Shanghai200234 China Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University China Shanghai Engineering Research Center of Blockchain Shanghai Institute for Advanced Communication and Data Science Shanghai200433 China School of Mathematics and Physics University of South China Hunan Hengyang421001 China

Recently, much progress has been made to construct minimal linear codes due to their preference in secret sharing schemes and secure two-party computation. In this paper, we put forward a new method to construct minimal linear codes by using vectorial Boolean functions. Firstly, we give a necessary and sufficient condition for a generic class of linear codes from vectorial Boolean functions to be minimal. Based on that, we derive some new three-weight minimal linear codes and determine their weight distributions. Secondly, we obtain a necessary and sufficient condition for another generic class of linear codes from vectorial Boolean functions to be minimal and to be violated the AB condition. As a result, we get three infinite families of minimal linear codes violating the AB condition. To the best of our knowledge, this is the first time that minimal liner codes are constructed from vectorial Boolean functions. Compared with other known ones, in general the minimal liner codes obtained in this paper have higher dimensions. © 2022, CC BY-NC-SA.

关键词： Boolean functions

Chinese microblog rumor detection based on deep sequence context

学校读者我要写书评

暂无评论

Chinese microblog rumor detection based on deep sequence con...

作者： Lin, Dazhen Ma, Ben Cao, Donglin Li, Shaozi Department of Cognitive Science Xiamen University Xiamen China Fujian Key Laboratory of Brain-inspired Computing Technique and Applications Xiamen University Xiamen China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou China

Rumor is one of the main problems in social media, which often shows deeply and rapidly undesirable affection on the society. Although many rumor detection models consider content features and social features, all of them are based on the word independence assumption, which lacks the sequence context. Thus, if we use some words that often appear in rumors, our posts will be recognized as a rumor. To solve this problem, we propose a deep sequence context model (DSCM) for Chinese microblog rumor detection. This model considers two important factors of rumors: falsity and influence. Firstly, to learn falsity, we abolish the word independence assumption and use long short-term memory (LSTM) units to capture bi-direction sequence context information in content. Secondly, to learn influence, we combine the deep sequence context information with social features to learn the connection between content and social features. In our experiment, our results show that our approach outperforms several state-of-the-art machine learning approaches, including term frequency and inverse document frequency (TFIDF), LSTM, and gated recurrent unit (GRU) in rumor detection. © 2018 John Wiley & Sons, Ltd.

关键词： Long short-term memory

Learning with multiclass AUC: Theory and algorithms

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Yang, Zhiyong Xu, Qianqian Bao, Shilong Cao, Xiaochun Huang, Qingming The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China The School of Cyber Security University of Chinese Academy of Sciences Beijing100049 China School of Cyber Science and Technology Sun Yat-sen University Shenzhen518100 China University of Chinese Academy of Sciences Beijing101408 China Peng Cheng Laboratory Shenzhen518055 China

The Area under the ROC curve (AUC) is a well-known ranking metric for problems such as imbalanced learning and recommender systems. The vast majority of existing AUC-optimization-based machine learning methods only focus on binary-class cases, while leaving the multiclass cases unconsidered. In this paper, we start an early trial to consider the problem of learning multiclass scoring functions via optimizing multiclass AUC metrics. Our foundation is based on the M metric, which is a well-known multiclass extension of AUC. We first pay a revisit to this metric, showing that it could eliminate the imbalance issue from the minority class pairs. Motivated by this, we propose an empirical surrogate risk minimization framework to approximately optimize the M metric. Theoretically, we show that: (i) optimizing most of the popular differentiable surrogate losses suffices to reach the Bayes optimal scoring function asymptotically;(ii) the training framework enjoys an imbalance-aware generalization error bound, which pays more attention to the bottleneck samples of minority classes compared with the traditional O(p1/N) result. Practically, to deal with the low scalability of the computational operations, we propose acceleration methods for three popular surrogate loss functions, including the exponential loss, squared loss, and hinge loss, to speed up loss and gradient evaluations. Finally, experimental results on 11 real-world datasets demonstrate the effectiveness of our proposed framework.. © 2021, CC BY.

关键词： Machine learning

Tracking control with event-triggered strategy for multi-agent systems with noises

学校读者我要写书评

暂无评论

Tracking control with event-triggered strategy for multi-age...

作者： Tang, Zhaojun Li, Chuandong Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing Department of Electronics and Information Engineering Southwest University Chongqing400715 China School of Science Chongqing University of Technology Chongqing400054 China

This paper is concerned with a tracking control problem of multi-agent systems with noises. It is assumed that each agent in the network updates its state only at some discrete time instants, which determined by the event-triggered condition, and the agents are affected by noises. In order to attenuate the effect of noises, consensus-gain function is introduced in the control protocol. Centralized and decentralized event-triggered protocols are proposed to ensure that the followers track the considered leader. With the help of matrix theory and Lyapunov method, sufficient conditions are derived to solve the mean square tracking control. Simulation results are provided to illustrate the theoretical results. © 2018 John Wiley & Sons, Ltd.

关键词： Multi agent systems