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

arXiv 2025年

作者： Pan, Wenxuan Yang, Yang Chen, Mingzhe Wei, Dong Guo, Caili Mao, Shiwen Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China Department of Electrical and Computer Engineering the Institute for Data Science and Computing University of Miami Coral GablesFL33146 United States Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China Beijing Laboratory of Advanced Information Networks School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China Wireless Engineering Research and Education Center Auburn University AuburnAL36849 United States

Floor plans can provide valuable prior information that helps enhance the accuracy of indoor positioning systems. However, existing research typically faces challenges in efficiently leveraging floor plan information and applying it to complex indoor layouts. To fully exploit information from floor plans for positioning, we propose a floor plan-assisted fusion positioning algorithm (FP-BP) using Bluetooth low energy (BLE) and pedestrian dead reckoning (PDR). In the considered system, a user holding a smartphone walks through a positioning area with BLE beacons installed on the ceiling, and can locate himself in real time. In particular, FP-BP consists of two phases. In the offline phase, FP-BP programmatically extracts map features from a stylized floor plan based on their binary masks, and constructs a mapping function to identify the corresponding map feature of any given position on the map. In the online phase, FP-BP continuously computes BLE positions and PDR results from BLE signals and smartphone sensors, where a novel grid-based maximum likelihood estimation (GML) algorithm is introduced to enhance BLE positioning. Then, a particle filter is used to fuse them and obtain an initial estimate. Finally, FP-BP performs post-position correction to obtain the final position based on its specific map feature. Experimental results show that FP-BP can achieve a real-time mean positioning accuracy of 1.19 m, representing an improvement of over 28% compared to existing floor plan-fused baseline algorithms. Copyright © 2025, The Authors. All rights reserved.

关键词： Photomapping

来源：评论

学校读者我要写书评

暂无评论

Big POI data integration with linked data technologies 22

Big POI data integration with linked data technologies

引用

22nd International Conference on Extending database Technology, EDBT 2019

作者： Athanasiou, Spiros Giannopoulos, Giorgos Graux, Damien Karagiannakis, Nikos Lehmann, Jens Ngomo, Axel-Cyrille Ngonga Patroumpas, Kostas Sherif, Mohamed Ahmed Skoutas, Dimitrios Information Management Systems Institute Athena Research Center Greece Enterprise Information Systems Department Fraunhofer IAIS Germany Smart Data Analytics Group University of Bonn Germany Computing Center Universität Leipzig Germany Data Science Group Universität Paderborn Germany

ISBN: (纸本)9783893180813

Point of Interest (POI) data constitutes the cornerstone in many modern applications. From navigation to social networks, tourism, and logistics, we use POI data to search, communicate, decide and plan our actions. POIs are semantically diverse and spatiotemporally evolving entities, having geographical, temporal, and thematic relations. Currently, integrating POI datasets to increase their coverage, timeliness, accuracy and value is a resource-intensive and mostly manual process, with no specialized software available to address the specific challenges of this task. In this paper, we present an integrated toolkit for transforming, linking, fusing and enriching POI data, and extracting additional value from them. In particular, we demonstrate how Linked data technologies can address the limitations, gaps and challenges of the current landscape in Big POI data integration. We have built a prototype application that enables users to define, manage and execute scalable POI data integration workflows built on top of state-of-the-art software for geospatial Linked data. This application abstracts and hides away the underlying complexity, automates quality-assured integration, scales efficiently for world-scale integration tasks, and lowers the entry barrier for end-users. Validated against real-world POI datasets in several application domains, our system has shown great potential to address the requirements and needs of cross-sector, cross-border and cross-lingual integration of Big POI data. © 2019 Copyright held by the owner/author(s).

关键词： data integration

来源：评论

学校读者我要写书评

暂无评论

Non-parametric conditional mean cumulative function for random-interval observations in panel count data analysis

引用

AIP Conference Proceedings 2023年第1期2500卷

作者： Tan Pei Ling Noor Akma Ibrahim 1Department of Mathematical and Data Science Faculty of Computing and Information Technology Tunku Abdul Rahman University College 53300 Kuala Lumpur Malaysia. 2Institute for Mathematical Research University Putra Malaysia 43400 UPM Serdang Selangor Malaysia.

In medical follow-up study, patients are treated with different treatments may have different follow-up schedule and the number of patients assigned in each treatment group may not be balanced. To address this, a non-parametric test procedure is proposed. The proposed test statistics is constructed based on the integrated weighted differences between the mean cumulative function of the recurrences event with condition on treatment group. The analysis also includes the multi- type of panel count data that involves covariate, and the clinical follow-up pattern is different between treatment groups, which produce random interval observations. In medical follow-up study, one of the main interests is to analyse treatment effect given covariates. It becomes more challenging when the clinical follow-up times are different among patients and there exist multi-type event with multiple occurrences between sub-sequences follow-ups. The proposed non-parametric test procedure able to detect the departure from the null hypothesis based on weighted difference between conditional mean cumulative functions. The performance of the proposed non-parametric test procedure is evaluated through simulation study. The test procedure gives a good empirical power based on the tested situations for random-interval observation processes. In addition, the efficiency of the proposed method is examined through the real data analysis obtained from the skin cancer chemoprevention trial conducted by the University of Wisconsin Comprehensive Cancer Center. The multivariate analysis shows that the overall DFMO treatment effect on reducing the recurrent of non-melanoma skin cancers are not statistically significant related to gender and number of prior skin cancers which are in line with existing study. The proposed test procedure is concerned on non-parametric comparisons with time independent covariates and non- informative censoring processes. Further work such as assessing the time dependent covaria

关键词：

来源：评论

学校读者我要写书评

暂无评论

Consensus-Based Optimization Methods Converge Globally

arXiv

引用

arXiv 2021年

作者： Fornasier, Massimo Klock, Timo Riedl, Konstantin Technical University of Munich School of Computation Information and Technology Department of Mathematics Munich Germany Munich Center for Machine Learning Munich Germany Munich Data Science Institute Munich Germany Simula Research Laboratory Department of Numerical Analysis and Scientific Computing Oslo Norway University of San Diego Department of Mathematics San DiegoCA United States

In this paper, we study consensus-based optimization (CBO), which is a multi-agent metaheuristic derivative-free optimization method that can globally minimize nonconvex nonsmooth functions and is amenable to theoretical analysis. Based on an experimentally supported intuition that, on average, CBO performs a gradient descent of the squared Euclidean distance to the global minimizer, we devise a novel technique for proving the convergence to the global minimizer in mean-field law for a rich class of objective functions. The result unveils internal mechanisms of CBO that are responsible for the success of the method. In particular, we prove that CBO performs a convexification of a large class of optimization problems as the number of optimizing agents goes to infinity. Furthermore, we improve prior analyses by requiring mild assumptions about the initialization of the method and by covering objectives that are merely locally Lipschitz continuous. As a core component of this analysis, we establish a quantitative nonasymptotic Laplace principle, which may be of independent interest. From the result of CBO convergence in mean-field law, it becomes apparent that the hardness of any global optimization problem is necessarily encoded in the rate of the mean-field approximation, for which we provide a novel probabilistic quantitative estimate. The combination of these results allows to obtain probabilistic global convergence guarantees of the numerical CBO *** Codes 65K10, 90C26, 90C56, 35Q90, 35Q84 Copyright © 2021, The Authors. All rights reserved.

关键词： Fokker Planck equation

来源：评论

学校读者我要写书评

暂无评论

Event extraction by associating event types and argument roles

arXiv

引用

arXiv 2021年

作者： Li, Qian Guo, Shu Wu, Jia Li, Jianxin Sheng, Jiawei Wang, Lihong Dong, Xiaohan Peng, Hao Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing China School of Computer Science and Engineering Beihang University Beijing China National Computer Network Emergency Response Technical Team Coordination Center of China Beijing China Department of Computing Macquarie University Sydney Australia Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China

Event extraction (EE), which acquires structural event knowledge from texts, can be divided into two sub-tasks: event type classification and element extraction (namely identifying triggers and arguments under different role patterns). As different event types always own distinct extraction schemas (i.e., role patterns), previous work on EE usually follows an isolated learning paradigm, performing element extraction independently for different event types. It ignores meaningful associations among event types and argument roles, leading to relatively poor performance for less frequent types/roles. This paper proposes a novel neural association framework for the EE task. Given a document, it first performs type classification via constructing a document-level graph to associate sentence nodes of different types, and adopting a graph attention network to learn sentence embeddings. Then, element extraction is achieved by building a universal schema of argument roles, with a parameter inheritance mechanism to enhance role preference for extracted elements. As such, our model takes into account type and role associations during EE, enabling implicit information sharing among them. Experimental results show that our approach consistently outperforms most state-of-the-art EE methods in both sub-tasks. Particularly, for types/roles with less training data, the performance is superior to the existing methods. Copyright © 2021, The Authors. All rights reserved.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Topic specificity: A descriptive metric for algorithm selection and finding the right number of topics

Natural Language Processing Journal

引用

Natural Language Processing Journal 2024年 8卷

作者： Emil Rijcken Kalliopi Zervanou Pablo Mosteiro Floortje Scheepers Marco Spruit Uzay Kaymak Jheronimus Academy of Data Science Eindhoven University of Technology ’s Hertogenbosch The Netherlands Department of Information and Computing Sciences Utrecht University Utrecht The Netherlands Department of Methodology and Statistics Utrecht University Utrecht The Netherlands Psychiatry University Medical Center Utrecht Utrecht The Netherlands Leiden Institute of Advanced Computer Science Leiden The Netherlands Public Health & Primary Care Leiden University Medical Center Leiden The Netherlands

Topic modeling is a prevalent task for discovering the latent structure of a corpus, identifying a set of topics that represent the underlying themes of the documents. Despite its popularity, issues with its evaluation metric, the coherence score, result in two common challenges: algorithm selection and determining the number of topics . To address these two issues, we propose the topic specificity metric, which captures the relative frequency of topic words in the corpus and is used as a proxy for the specificity of a word. In this work, we formulate the metric firstly. Secondly, we demonstrate that algorithms train topics at different specificity levels. This insight can be used to address algorithm selection as it allows users to distinguish and select algorithms with the desired specificity level. Lastly, we show a strictly positive monotonic correlation between the topic specificity and the number of topics for LDA, FLSA-W, NMF and LSI. This correlation can be used to address the selection of the number of topics, as it allows users to adjust the number of topics to their desired level. Moreover, our descriptive metric provides a new perspective to characterize topic models, allowing them to be understood better.

关键词： Topic modeling Metric Algorithm selection

来源：评论

学校读者我要写书评

暂无评论

Overview of AI and Communication for 6G Network: Fundamentals, Challenges, and Future Research Opportunities

arXiv

引用

arXiv 2024年

作者： Cui, Qimei You, Xiaohu Ni, Wei Nan, Guoshun Zhang, Xuefei Zhang, Jianhua Lyu, Xinchen Ai, Ming Tao, Xiaofeng Feng, Zhiyong Zhang, Ping Wu, Qingqing Tao, Meixia Huang, Yongming Huang, Chongwen Liu, Guangyi Peng, Chenghui Pan, Zhiwen Sun, Tao Niyato, Dusit Chen, Tao Khan, Muhammad Khurram Jamalipour, Abbas Guizani, Mohsen Yuen, Chau National Engineering Research Center of Mobile Network Technologies Beijing University of Posts and Telecommunications Beijing100876 China Department of Broadband Communication Peng Cheng Laboratory Shenzhen518055 China National Mobile Communications Research Laboratory Southeast University Nanjing210096 China Fudan University Shanghai200433 China School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China CICT Mobile Communication Technology Co. Ltd. Beijing100020 China Department of Electronic Engineering Shanghai Jiao Tong University Shanghai200240 China Shanghai Jiao Tong University Shanghai200240 China College of Information Science and Electronic Engineering Zhejiang University Hangzhou310058 China China Mobile Research Institute Beijing100053 China Huawei Technologies Shanghai201206 China College of Computing and Data Science Nanyang Technological University Singapore117583 Singapore VTT Technical Research Centre of Finland Ltd. EspooFI-02044 VTT Finland Center of Excellence in Information Assurance King Saud University Riyadh11362 Saudi Arabia School of Electrical and Information Engineering University of Sydney NSW2006 Australia Abu Dhabi United Arab Emirates School of Electrical and Electronics Engineering Nanyang Technological University Singapore639798 Singapore

With the growing demand for seamless connectivity and intelligent communication, the integration of artificial intelligence (AI) and sixth-generation (6G) communication networks has emerged as a transformative paradigm. By embedding AI capabilities across various network layers, this integration enables optimized resource allocation, improved efficiency, and enhanced system robust performance, particularly in intricate and dynamic environments. This paper presents a comprehensive overview of AI and communication for 6G networks, with a focus on emphasizing their foundational principles, inherent challenges, and future research opportunities. We first review the integration of AI and communications in the context of 6G, exploring the driving factors behind incorporating AI into wireless communications, as well as the vision for the convergence of AI and 6G. The discourse then transitions to a detailed exposition of the envisioned integration of AI within 6G networks, delineated across three progressive developmental stages. The first stage, AI for Network, focuses on employing AI to augment network performance, optimize efficiency, and enhance user service experiences. The second stage, Network for AI, highlights the role of the network in facilitating and buttressing AI operations and presents key enabling technologies, such as digital twins for AI and semantic communication. The final stage, AI as a Service, it is anticipated that future 6G networks will innately provide AI functions as services, supporting application scenarios like immersive communication and intelligent industrial robots. Specifically, we have defined the quality of AI service, which refers to a framework for measuring AI services within the network. We further summarize the standardization process of AI for wireless networks, highlighting key milestones and ongoing efforts. In addition, we conduct an in-depth analysis of the critical challenges faced by the integration of AI and communications

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Expert Training: Task Hardness Aware Meta-Learning for Few-Shot Image Classification

arXiv

引用

arXiv 2020年

作者： Zhou, Yucan Wang, Yu Cai, Jianfei Zhou, Yu Hu, Qinghua Wang, Weiping Institute of Information Engineering Chinese Academy of Sciences Beijing100195 China College of Intelligence and Computing Tianjin University Tianjin300350 China Department of Data Science & AI Monash University Victoria3800 Australia

Deep neural networks are highly effective when a large number of labeled samples are available but fail with few-shot classification tasks. Recently, meta-learning methods have received much attention, which train a meta-learner on massive additional tasks to gain the knowledge to instruct the few-shot classification. Usually, the training tasks are randomly sampled and performed indiscriminately, often making the meta-learner stuck into a bad local optimum. Some works in the optimization of deep neural networks have shown that a better arrangement of training data can make the classifier converge faster and perform better. Inspired by this idea, we propose an easy-to-hard expert meta-training strategy to arrange the training tasks properly, where easy tasks are preferred in the first phase, then, hard tasks are emphasized in the second phase. A task hardness aware module is designed and integrated into the training procedure to estimate the hardness of a task based on the distinguishability of its categories. In addition, we explore multiple hardness measurements including the semantic relation, the pairwise Euclidean distance, the Hausdorff distance, and the Hilbert-Schmidt independence criterion. Experimental results on the miniImageNet and tieredImageNetSketch datasets show that the meta-learners can obtain better results with our expert training strategy. Copyright © 2020, The Authors. All rights reserved.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Correction: Extremely boosted neural network for more accurate multi-stage Cyber attack prediction in cloud computing environment

引用

Journal of Cloud computing 2023年第1期12卷 1-1页

作者： Dalal, Surjeet Manoharan, Poongodi Kumar, Lilhore Umesh Seth, Bijeta alsekait, Deema Mohammed Simaiya, Sarita Hamdi, Mounir Raahemifar, Kaamran Department of Computer Science and Engineering Amity University Haryana Gurugram India Division of Information and Computing Technology College of Science and Engineering Hamad Bin Khalifa University Qatar Foundation Doha Qatar School of Computing University of Louisiana Lafayette USA Department of Computer Science and Engineering Chandigarh University Mohali India Department of Computer Science and Engineering B. M. Institute of Engineering & Technology Sonipat India Department of Computer Science and Information Technology Applied College Princess Nourah Bint Abdulrahman University Riyadh Saudi Arabia College of Information Sciences and Technology Data Science and Artificial Intelligence Program State College USA School of Optometry and Vision Science Faculty of Science University of Waterloo Waterloo Canada Faculty of Engineering University of Waterloo Waterloo Canada

来源：评论

学校读者我要写书评

暂无评论

Discovering Traffic Anomaly Propagation in Urban Space Using Traffic Change Peaks 6th

Discovering Traffic Anomaly Propagation in Urban Space Using...

引用

6th International Conference on data science, ICDS 2019

作者： Huang, Guang-Li Ji, Yimu Liu, Shangdong Zarei, Roozbeh School of Science RMIT University MelbourneVIC3000 Australia School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Institute of High Performance Computing and Big Data Nanjing University of Posts and Telecommunications Nanjing210023 China Nanjing Center of HPC China Nanjing210003 China Jiangsu HPC and Intelligent Processing Engineer Research Center Nanjing210003 China School of Information Technology Deakin University GeelongVIC3125 Australia

ISBN: (纸本)9789811528095

Discovering traffic anomaly propagation enables a thorough understanding of traffic anomalies and dynamics. Existing methods, such as STOTree, are not accurate for two reasons. First, they discover the propagation pattern based on the detected anomalies. The imperfection of the detection method itself may introduce false anomalies and miss the real anomaly. Second, they develop a propagation tree of anomalies by searching continuous spatial and temporal neighborhoods rather than considering from a global perspective, and thus cannot find a complete propagation tree if a spatial or temporal gap exists. In this paper, we propose a novel discovering traffic anomaly propagation method using traffic change peaks, which can visualize the change of traffic anomalies (e.g., congestion and evacuation area) and thus accurately captures traffic anomaly propagation. Inspired by image processing techniques, the GPS trajectory dataset in each time period can be converted to one grid traffic image and be stored in the grid density matrix, in which the grid cell corresponds to the pixel and the density of grid cells corresponds to the Gray level (0–255) of pixels. An adaptive filter is developed to generate traffic change graphs from grid traffic images in consecutive periods, and clustering traffic change peaks along the road is to discover the propagation of traffic anomalies. The effectiveness of the proposed method has been demonstrated using a real-world GPS trajectory dataset. © Springer Nature Singapore Pte Ltd 2020.

关键词： Adaptive filters

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：