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

arXiv 2023年

作者： Zhi, Q.J. Bai, J.T. Dai, S. Xu, X. Dang, S.J. Shang, L.H. Zhao, R.S. Li, D. Zhu, W.W. Wang, N. Yuan, J.P. Wang, P. Zhang, L. Feng, Y. Wang, J.B. Wang, S.Q. Wu, Q.D. Dong, A.J. Yang, H. Tian, J. Zhong, W.Q. Luo, X.H. Filipović, Miroslav D. Qiao, G.J. School of Physics and Electronic Science Guizhou Provincial Key Laboratory of Radio Astronomy and Data Processing Guizhou Normal University Guiyang550001 China Xinjiang Astronomical Observatory Chinese Academy of Sciences Xinjiang Urumqi830011 China School of Science Western Sydney University Locked Bag 1797 Penrith South DCNSW2751 Australia School of Mathematical Sciences Guizhou Provincial Key Laboratory of Radio Astronomy and Data Processing Guizhou Normal University Guiyang550001 China National Astronomical Observatories Chinese Academy of Sciences Beijing100101 China University of Chinese Academy of Sciences Beijing100049 China Research Center for Intelligent Computing Platforms Zhejiang Laboratory Hangzhou311100 China Key Laboratory of Radio Astronomy Chinese Academy of Sciences Xinjiang Urumqi830011 China Xinjiang Key Laboratory of Radio Astrophysics 150 Science1-Street Xinjiang Urumqi830011 China Zhejiang Lab Zhejiang Hangzhou311121 China Institute of Optoelectronic Technology Lishui University Lishui323000 China School of Astronomy and Space Science University of Chinese Academy of Sciences Beijing100049 China School of Physics Peking University Beijing100871 China

We present the discovery and timing results of four pulsars discovered in a pilot survey at intermediate Galactic latitudes with the Five-hundred Aperture Spherical Telescope (FAST). Among these pulsars, two belong to the category of millisecond pulsars (MSPs) with spin periods of less than 20 ms. The other two fall under the classification of "mildly recycled" pulsars, with massive white dwarfs as companions. Remarkably, this small survey, covering an area of 4.7 deg2, led to the discovery of four recycled pulsars. Such success underscores the immense potential of future surveys at intermediate Galactic latitudes. In order to assess the potential yield of MSPs, we conducted population simulations and found that both FAST and Parkes new phased array feed surveys, focusing on intermediate Galactic latitudes, have the capacity to uncover several hundred new MSPs. Copyright © 2023, The Authors. All rights reserved.

关键词： Pulsars

来源：评论

学校读者我要写书评

暂无评论

Survey of key technologies on millimeter-wave CMOS integrated circuits

引用

IOP Conference Series: Materials Science and Engineering 2018年第1期351卷

作者： Fei Yu Lei Gao Lixiang Li Shuo Cai Wei Wang Chunhua Wang Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation & School of Computer and Communication Engineering Changsha University of Science and Technology Changsha 410114 China College of Information Science and Engineering Hunan University Changsha 410082 China

In order to provide guidance for the development of high performance millimeter-wave complementary metal oxide semiconductor (MMW-CMOS) integrated circuits (IC), this paper provides a survey of key technologies on MMW-CMOS IC. Technical background of MMW wireless communications is described. Then the recent development of the critical technologies of the MMW-CMOS IC are introduced in detail and compared. A summarization is given, and the development prospects on MMW-CMOS IC are also discussed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Depth-Aware Multi-Modal Fusion for Generalized Zero-Shot Learning

Depth-Aware Multi-Modal Fusion for Generalized Zero-Shot Lea...

引用

IEEE International Conference on Industrial Informatics (INDIN)

作者： Weipeng Cao Xuyang Yao Zhiwu Xu Yinghui Pan Yixuan Sun Dachuan Li Bohua Qiu Muheng Wei Guangdong Laboratory of Artificial Intelligence and Digital Economy (Shenzhen) Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Stony Brook University New York United States Research Institute of Trustworthy Autonomous Systems Southern University of Science and Technology Shenzhen China Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China ZhenDui Industry Artificial Intelligence Co. Ltd Shenzhen China Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China

ISBN: (数字)9798331527471

ISBN: (纸本)9798331527488

Realizing Generalized Zero-Shot Learning (GZSL) based on large models is emerging as a prevailing trend. However, most existing methods merely regard large models as black boxes, solely leveraging the features output by the final layer while disregarding potential performance enhancements from other layers. Indeed, numerous researchers have visually depicted variations in the features learned across different layers of neural networks. Motivated by this observation, we propose a Vision Transformer (ViT)-based GZSL method named Depth-Aware Multi-Modal ViT (DAM2ViT), which exploits multi-level features of ViT. DAM2ViT incorporates a multi-modal interaction block to align semantic information of categories across multiple layers, thereby augmenting the model's capacity to learn associations between visual and semantic spaces. Extensive experiments conducted on three benchmark datasets (i.e., CUB, SUN, AWA2) have showcased that DAM2ViT achieves competitive results compared to state-of-the-art methods.

关键词： Visualization Adaptation models Semantics Zero shot learning Neural networks Termination of employment Transformers Market research Sun Optimization

来源：评论

学校读者我要写书评

暂无评论

A Relation-Constraint Link Prediction Model for Dynamic Knowledge Graphs with Entity Drift

引用

ACM Transactions on Knowledge Discovery from data 1000年

作者： Xiulin Zheng Peipei Li Zan Zhang Jia Wu Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology China and School of Computer Science and Information Engineering Hefei University of Technology China School of Computing Faculty of Science and Engineering Macquarie University Australia

Knowledge Graphs (KGs) often suffer from incompleteness and this issue motivates the task of Knowledge Graph Completion (KGC). Traditional KGC models mainly concentrate on static KGs with a fixed set of entities and relations, or dynamic KGs with temporal characteristics, faltering in their generalization to constantly evolving KGs with possible irregular entity drift. Thus, in this paper, we propose a novel link prediction model based on the embedding representation to handle the incompleteness of KGs with entity drift, termed as DCEL. Unlike traditional link prediction, DCEL could generate precise embeddings for drifted entity without imposing any regular temporal characteristic. The drifted entity is added into the KG with its links to the existing entity predicted in an incremental fashion with no requirement to retrain the whole KG for computational efficiency. In terms of DCEL model, it fully takes advantages of unstructured textual description, and is composed of four modules, namely MRC (Machine Reading Comprehension), RCAA (Relation Constraint Attentive Aggregator), RSA (Relation Specific Alignment) and RCEO (Relation Constraint Embedding Optimization). Specifically, the MRC module is first employed to extract short texts from long and redundant descriptions. Then, RCAA is used to aggregate the embeddings of textual description of drifted entity and the pre-trained word embeddings learned from corpus to a single text-based entity embedding while shielding the impact of noise and irrelevant information. After that, RSA is applied to align the text-based entity embedding to graph-based space to obtain the corresponding graph-based entity embedding, and then the learned embeddings are fed into the gate structure to be optimized based on the RCEO to improve the accuracy of representation learning. Finally, the graph-based model TransE is used to perform link prediction for drifted entity. Extensive experiments conducted on benchmark datasets in terms of evaluat

关键词： dynamic knowledge graph entity drift link prediction relation constraint

来源：评论

学校读者我要写书评

暂无评论

Rate-Splitting for Cell-Free Massive MIMO: Performance Analysis and Generative AI Approach

arXiv

引用

arXiv 2024年

作者： Zheng, Jiakang Zhang, Jiayi Du, Hongyang Zhang, Ruichen Niyato, Dusit Dobre, Octavia A. Ai, Bo The School of Electronic and Information Engineering Beijing Jiaotong University Beijing100044 China The Frontiers Science Center for Smart High-speed Railway System Beijing Jiaotong University Beijing100044 China The Department of Electrical and Electronic Engineering University of Hong Kong Pok Fu Lam Hong Kong The College of Computing and Data Science Nanyang Technological University Singapore Faculty of Engineering and Applied Science Memorial University Canada The State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing100044 China The Frontiers Science Center for Smart High-speed Railway System China Henan Joint International Research Laboratory of Intelligent Networking and Data Analysis Zhengzhou University Zhengzhou450001 China Research Center of Networks and Communications Peng Cheng Laboratory Shenzhen China

Cell-free (CF) massive multiple-input multiple-output (MIMO) provides a ubiquitous coverage to user equipments (UEs) but it is also susceptible to interference. Rate-splitting (RS) effectively extracts data by decoding interference, yet its effectiveness is limited by the weakest UE. In this paper, we investigate an RS-based CF massive MIMO system, which combines strengths and mitigates weaknesses of both approaches. Considering imperfect channel state information (CSI) resulting from both pilot contamination and noise, we derive a closed-form expression for the sum spectral efficiency (SE) of the RS-based CF massive MIMO system under a spatially correlated Rician channel. Moreover, we propose low-complexity heuristic algorithms based on statistical CSI for power-splitting of common messages and power-control of private messages, and genetic algorithm is adopted as a solution for upper bound performance. Furthermore, we formulate a joint optimization problem, aiming to maximize the sum SE of the RS-based CF massive MIMO system by optimizing the power-splitting factor and power-control coefficient. Importantly, we improve a generative AI (GAI) algorithm to address this complex and non-convexity problem by using a diffusion model to obtain solutions. Simulation results demonstrate its effectiveness and practicality in mitigating interference, especially in dynamic environments. Copyright © 2024, The Authors. All rights reserved.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Practical Interference Exploitation Precoding without Symbol-by-Symbol Optimization: A Block-Level Approach

arXiv

引用

arXiv 2022年

作者： Li, Ang Shen, Chao Liao, Xuewen Masouros, Christos Lee Swindlehurst, A. The School of Information and Communications Engineering Faculty of Electronic and Information Engineering Xi'an Jiaotong University Shaanxi Xi'An710049 China The State Key Laboratory of Integrated Services Networks Xidian University Shaanxi Xi'An China The Shenzhen Research Institute of Big Data Shenzhen518172 China The Department of Electronic and Electrical Engineering University College London Torrington Place LondonWC1E 7JE United Kingdom The Center for Pervasive Communications and Computing Henry Samueli School of Engineering University of California IrvineCA92697 United States

In this paper, we propose a constructive interference (CI)-based block-level precoding (CI-BLP) approach for the downlink of a multi-user multiple-input single-output (MU-MISO) communication system. Contrary to existing CI precoding approaches which have to be designed on a symbol-by-symbol level, here a constant precoding matrix is applied to a block of symbol slots within a channel coherence interval, thus significantly reducing the computational costs over traditional CI-based symbol-level precoding (CI-SLP) as the CI-BLP optimization problem only needs to be solved once per block. For both PSK and QAM modulation, we formulate an optimization problem to maximize the minimum CI effect over the block subject to a block- rather than symbol-level power budget. We mathematically derive the optimal precoding matrix for CI-BLP as a function of the Lagrange multipliers in closed form. By formulating the dual problem, the original CI-BLP optimization problem is further shown to be equivalent to a quadratic programming (QP) optimization. Numerical results validate our derivations, and show that the proposed CI-BLP scheme achieves improved performance over the traditional CI-SLP method, thanks to the relaxed power constraint over the considered block of symbol slots. Copyright © 2022, The Authors. All rights reserved.

关键词： Lagrange multipliers

来源：评论

学校读者我要写书评

暂无评论

Ed-Tgan: A Methodology on Temporal Generative Gan for Imbalanced data for Predicting Academic Performance of Students

SSRN

引用

SSRN 2022年

作者： Waheed, Hajra Zhou, Jia Aljohani, Naif R. Tuarob, Suppawong Nawaz, Raheel Herrera, Francisco Hassan, Saeed-Ul Information Technology University 346-B Ferozepur Road Lahore Pakistan Key Laboratory of Intelligent Education Technology and Application of Zhejiang Province Zhejiang Normal University Zhejiang Jinhua321004 China Faculty of Computing and Information Technology King Abdulaziz University Jeddah Saudi Arabia Faculty of Information and Communication Technology Mahidol University Thailand Staffordshire University Stoke-on-Trent United Kingdom Andalusian Research Institute in Data Science and Computational Intelligence University of Granada Granada Spain Manchester Metropolitan University Manchester United Kingdom

With the increase in the self-paced learning phenomenon, class imbalance in the learning analytics community has become more prevalent, with lesser students dropping out than students who intend to pursue. Similarly, an imbalance in the behavioral performances of students is also observed. This imbalance problem becomes more complicated for temporal data, where each time sequence represents a particular student, and several sequences formulate the overall engagement of students throughout a course. The conventional methods for generating synthetic data do not account for this association of sequences, where each synthetically generated student is associated with its previous sequence. Generative Adversarial Networks (GANs) have been rapidly adopted in the machine learning discipline for synthetic data generation to reduce the class imbalance. In this study, we propose a deep learning-powered methodology called Educational Temporal Generative Adversarial Networks (Ed-TGANs) methodology comprising the following steps: a) Smart data Processing for Actionable data, b) GANs for Temporal data Generation, and c) Learning Approach. Furthermore, the Open University Learning Analytics dataset was deployed as a case study comprising 69% pass and 31% fail students to validate the effectiveness of our proposed methodology, encompassing discrete and continuous features. The results are compared with GAN-based and non-GAN upsampling approaches to demonstrate the proposed methodology's effectiveness, which shows an increase in accuracy of up to 5.33% compared to classic GANs, resulting in improved understating of student behavior. We believe that the presented methodology can be used as a starting point for various areas for upsampling jobs with temporal longitudinal data. © 2022, The Authors. All rights reserved.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Hierarchical taxonomy-aware and attentional graph capsule RCNNs for large-scale multi-label text classification

arXiv

引用

arXiv 2019年

作者： Peng, Hao Li, Jianxin Gong, Qiran Wang, Senzhang He, Lifang Li, Bo Wang, Lihong Yu, Philip S. Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100083 State Key Laboratory of Software Development Environment Beihang University Beijing100083 China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing211106 China Department of Biostatistics and Epidemiology University of Pennsylvania PhiladelphiaPA19104 United States National Computer Network Emergency Response Technical Team Coordination Center of China Beijing100029 China Department of Computer Science University of Illinois at Chicago ChicagoIL60607 United States

CNNs, RNNs, GCNs, and CapsNets have shown significant insights in representation learning and are widely used in various text mining tasks such as large-scale multi-label text classification. However, most existing deep models for multi-label text classification consider either the non-consecutive and long-distance semantics or the sequential semantics, but how to consider them both coherently is less studied. In addition, most existing methods treat output labels as independent medoids, but ignore the hierarchical relations among them, leading to useful semantic information loss. In this paper, we propose a novel hierarchical taxonomy-aware and attentional graph capsule recurrent CNNs framework for large-scale multi-label text classification. Specifically, we first propose to model each document as a word order preserved graph-of-words and normalize it as a corresponding words-matrix representation which preserves both the non-consecutive, long-distance and local sequential semantics. Then the words-matrix is input to the proposed attentional graph capsule recurrent CNNs for more effectively learning the semantic features. To leverage the hierarchical relations among the class labels, we propose a hierarchical taxonomy embedding method to learn their representations, and define a novel weighted margin loss by incorporating the label representation similarity. Extensive evaluations on three datasets show that our model significantly improves the performance of large-scale multi-label text classification by comparing with state-of-the-art approaches. Copyright © 2019, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Applications of Game Theory in Vehicular Networks: A Survey

arXiv

引用

arXiv 2021年

作者： Sun, Zemin Liu, Yanheng Wang, Jian Li, Guofa Anil, Carie Li, Keqiang Guo, Xinyu Sun, Geng Tian, Daxin Cao, Dongpu College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Institute of Human Factors and Ergonomics College of Mechatronics and Control Engineering Shenzhen University Guangdong Shenzhen518060 China School of Computer Science and Engineering VIT-AP Andhra Pradesh Amaravati522237 India College of Engineering Nanjing Agricultural University Nanjing210031 China State Key Laboratory of Automotive Safety and Energy Department of Automotive Engineering Tsinghua University Beijing100084 China Beijing Advanced Innovation Center for Big Data and Brain Computing Beijing Key Laboratory for Cooperative Vehicle Infrastructure Systems and Safety Control School of Transportation Science and Engineering Beihang University Beijing100191 China Waterloo Cognitive Autonomous Driving Lab University of Waterloo N2L 3G1 Canada

In the Internet of things (IoT) era, vehicles and other intelligent components in an intelligent transportation system (ITS) are connected, forming vehicular networks (VNs) that provide efficient and safe traffic and ubiquitous access to various applications. However, as the number of nodes in an ITS increases, it is challenging to satisfy a varied and large number of service requests with different quality of service (QoS) and security requirements in highly dynamic VNs. intelligent nodes in VNs can compete or cooperate for limited network resources to achieve the objective for either an individual or a group. Game theory (GT), a theoretical framework designed for strategic interactions among rational decision makers sharing scarce resources, can be used to model and analyze individual or group behaviors of communicating entities in VNs. This paper primarily surveys the recent developments of GT in solving various challenges of VNs. This survey starts with an introduction to the background of VNs. A review of GT models studied in the VNs is then introduced, including the basic concepts, classifications, and applicable vehicular issues. After discussing the requirements of VNs and the motivation of using GT, a comprehensive literature review on GT applications in dealing with the challenges of current VNs is provided. Furthermore, recent contributions of GT to VNs that are integrated with diverse emerging 5G technologies are surveyed. Finally, the lessons learned are given, and several key research challenges and possible solutions of applying GT in VNs are outlined. Copyright © 2021, The Authors. All rights reserved.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

BAR: Blockwise adaptive recoding for batched network coding

arXiv

引用

arXiv 2021年

作者： Yin, Hoover H.F. Yang, Shenghao Zhou, Qiaoqiao Yung, Lily M.L. Ng, Ka Hei The Institute of Network Coding The Chinese University of Hong Kong Hong Kong Hong Kong The School of Science and Engineering The Chinese University of Hong Kong Shenzhen Shenzhen China Shenzhen Key Laboratory of IoT Intelligent Systems and Wireless Network Technology Shenzhen Research Institute of Big Data Shenzhen China The Department of Information Engineering The Chinese University of Hong Kong Hong Kong Hong Kong The Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong Hong Kong The Department of Physics The Chinese University of Hong Kong Hong Kong Hong Kong

Multi-hop networks become popular network topologies in various emerging Internet of things applications. Batched network coding (BNC) is a solution to reliable communications in such networks with packet loss. By grouping packets into small batches and restricting recoding to the packets belonging to the same batch, BNC has a much smaller computational and storage requirements at the intermediate nodes compared with a direct application of random linear network coding. In this paper, we propose a practical recoding scheme called blockwise adaptive recoding (BAR) which learns the latest channel knowledge from short observations so that BAR can adapt to the fluctuation of channel conditions. We focus on investigating practical concerns such as the design of efficient BAR algorithms. We also design and investigate feedback schemes for BAR under imperfect feedback systems. Our numerical evaluations show that BAR has significant throughput gain for small batch size compared with the existing baseline recoding scheme. More importantly, this gain is insensitive to inaccurate channel knowledge. This encouraging result suggests that BAR is suitable to be realized in practice as the exact channel model and its parameters could be unknown and subject to change from time to time. Copyright © 2021, The Authors. All rights reserved.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：