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

Intelligent Preamble Allocation for Coexistence of mMTC/URLLC Devices:A Hierarchical Q-Learning Based Approach

China Communications 2023年第8期20卷 44-53页

作者： Jiadai Wang Chaochao Xing Jiajia Liu National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology the School of CybersecurityNorthwestern Polytechnical UniversityXi’anShaanxi710072China

The emergence of various commercial and industrial Internet of Things(IoT)devices has brought great convenience to people’s life and *** low-power,massively connected mMTC devices(MDs)and highly reliable,low-latency URLLC devices(UDs)play an important role in different application ***,when dense MDs and UDs periodically initiate random access(RA)to connect the base station and send data,due to the limited preamble resources,preamble collisions are likely to occur,resulting in device access failure and data transmission *** the same time,due to the highreliability demands of UDs,which require smooth access and fast data transmission,it is necessary to reduce the failure rate of their RA *** this end,we propose an intelligent preamble allocation scheme,which uses hierarchical reinforcement learning to partition the UD exclusive preamble resource pool at the base station side and perform preamble selection within each RA slot at the device *** particular,considering the limited processing capacity and energy of IoT devices,we adopt the lightweight Qlearning algorithm on the device side and design simple states and actions for *** results show that the proposed intelligent scheme can significantly reduce the transmission failure rate of UDs and improve the overall access success rate of devices.

关键词： preamble allocation random access mMTC URLLC reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous-attributes enhancement deep framework for network embedding

引用

Frontiers of Computer Science 2021年第6期15卷 121-131页

作者： Lisheng QIAO Fan ZHANG Xiaohui HUANG Kai LI Enhong CHEN Anhui Province Key Laboratory of Big Data Analysis and Application University of Science and Technology of ChinaHefei 230022China National Key Laboratory of Blind Signal Processing Chengdu 610041China School of Computer Science and Technology University of Science and Technology of ChinaHefei 230022China

Network embedding,which targets at learning the vector representation of vertices,has become a crucial issue in network ***,considering the complex structures and heterogeneous attributes in real-world networks,existing methods may fail to handle the inconsistencies between the structure topology and attribute ***,more comprehensive techniques are urgently required to capture the highly non-linear network structure and solve the existing inconsistencies with retaining more *** that end,in this paper,we propose a heterogeneous-attributes enhancement deep framework(HEDF),which could better capture the non-linear structure and associated information in a deep learningway,and effectively combine the structure information of multi-views by the combining *** this line,the inconsistencies will be handled to some extent and more structure information will be preserved through a semi-supervised *** extensive validations on several real-world datasets show that our model could outperform the baselines,especially for the sparse and inconsistent situation with less training data.

关键词： network embedding heterogeneous-attributes deep framework inconsistent

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous pigeon-inspired optimization

引用

Science China(Information Sciences) 2019年第7期62卷 64-72页

作者： Hao WANG Zhuxi ZHANG Zhen DAI Jun CHEN Xi ZHU Wenbo DU Xianbin CAO School of Electronic and Information Engineering Frontier Institute of Science and Technology InnovationBeihang University National Transportation Preparation Office School of Engineering and Materials Science Queen Mary University of London National Engineering Laboratory of Big Data Application Technologies of Comprehensive Transportation

Pigeon-inspired optimization(PIO) is a swarm intelligence optimizer inspired by the homing behavior of pigeons. PIO consists of two optimization stages which employ the map and compass operator,and the landmark operator, respectively. In canonical PIO, these two operators treat every bird equally,which deviates from the fact that birds usually act heterogenous roles in nature. In this paper, we propose a new variant of PIO algorithm considering bird heterogeneity — HPIO. Both of the two operators are improved through dividing the birds into hub and non-hub roles. By dividing the birds into two groups, these two groups of birds are respectively assigned with different functions of "exploitation" and "exploration", so that they can closely interact with each other to locate the best promising solution. Extensive experimental studies illustrate that the bird heterogeneity produced by our algorithm can benefit the information exchange between birds so that the proposed PIO variant significantly outperforms the canonical PIO.

关键词： heuristic optimization pigeon-inspired optimization particle heterogeneity network-based topology scale-free network selective-informed learning

来源：评论

学校读者我要写书评

暂无评论

Clause-level Relationship-aware Math Word Problems Solver

引用

Machine Intelligence Research 2022年第5期19卷 425-438页

作者： Chang-Yang Wu Xin Lin Zhen-Ya Huang Yu Yin Jia-Yu Liu Qi Liu Gang Zhou Anhui Province Key Laboratory of Big Data Analysis and Application School of Data ScienceUniversity of Science and Technology of ChinaHefei 230026China Institute of Artificial Intelligence Hefei Comprehensive National Science CenterHefei 230088China Laboratory of Mathematical Engineering and Advanced Computing Information Engineering UniversityZhengzhou 450001China

Automatically solving math word problems,which involves comprehension,cognition,and reasoning,is a crucial issue in artificial intelligence *** math word problem solvers mainly work on word-level relationship extraction and the generation of expression solutions while lacking consideration of the clause-level *** this end,inspired by the theory of two levels of process in comprehension,we propose a novel clause-level relationship-aware math solver(CLRSolver)to mimic the process of human comprehension from lower level to higher ***,in the lower-level processes,we split problems into clauses according to their natural division and learn their *** the higher-level processes,following human′s multi-view understanding of clause-level relationships,we first apply a CNN-based module to learn the dependency relationships between clauses from word relevance in a local ***,we propose two novel relationship-aware mechanisms to learn dependency relationships from the clause semantics in a global ***,we enhance the representation of clauses based on the learned clause-level dependency *** expression generation,we develop a tree-based decoder to generate the mathematical *** conduct extensive experiments on two datasets,where the results demonstrate the superiority of our framework.

关键词： Artificial intelligence(AI) artificial neural network(ANN) computational mathematics machine intelligence machine learning

来源：评论

学校读者我要写书评

暂无评论

Inverse Markov Process Based Constrained Dynamic Graph Layout

引用

Journal of Computer Science & technology 2021年第3期36卷 707-718页

作者： Shi-Ying Sheng Sheng-Tao Chen Xiao-Ju Dong Chun-Yuan Wu Xiao-Ru Yuan ParisTech Elite Institute of Technology Shanghai Jiao Tong UniversityShanghai 200240China Department of Computer Science and Engineering Shanghai Jiao Tong UniversityShanghai 200240China Key Laboratory of Machine Perception(Ministry of Education) National Engineering Laboratory for Big Data Analysis and ApplicationPeking UniversityBeijing 100080China

In online dynamic graph drawing,constraints over nodes and node pairs help preserve a coherent mental map in a sequence of *** the constraints is challenging due to the requirements of both preserving mental map and satisfying the visual aesthetics of a graph *** existing algorithms basically depend on local changes but fail to do proper evaluations on the global propagation when setting *** solve this problem,we introduce a heuristic model derived from PageRank which simulates the node movement as an inverse Markov process hence to give a global analysis of the layout's change,according to which different constraints can be *** constraints,along with stress function,generate layouts maintaining spatial positions and shapes of relatively stable substructures between adjacent *** demonstrate that our method preserves both structure and position similarity to help users track graph changes visually.

关键词： graph drawing data stream dynamic graph layout

来源：评论

学校读者我要写书评

暂无评论

Illuminating Recommendation by Understanding the Explicit Item Relations

引用

Journal of Computer Science & technology 2018年第4期33卷 739-755页

作者： Qi Liu Hong-Ke Zhao Le Wu Zhi Li En-Hong Chen Anhui Province Key Laboratory of Big Data Analysis and Application University of Science and Technology of China Hefei 230027 China School of Computer and Information Hefei University of Technology Hefei 230009 China School of Software Engineering University of Science and Technology of China Hefei 230051 China

Recent years have witnessed the prevalence of recommender systems in various fields, which provide a personalized recommendation list for each user based on various kinds of information. For quite a long time, most researchers have been pursing recommendation performances with predefined metrics, e.g., accuracy. However, in real-world applications, users select items from a huge item list by considering their internal personalized demand and external constraints. Thus, we argue that explicitly modeling the complex relations among items under domain-specific applications is an indispensable part for enhancing the recommendations. Actually, in this area, researchers have done some work to understand the item relations gradually from ＂implicit＂ to ＂explicit＂ views when recommending. To this end, in this paper, we conduct a survey of these recent advances on recommender systems from the perspective of the explicit item relation understanding. We organize these relevant studies from three types of item relations, i.e., combination-effect relations, sequence-dependence relations, and external-constraint relations. Specifically, the combination-effect relation and the sequence-dependence relation based work models the intra-group intrinsic relations of items from the user demand perspective, and the external-constraint relation emphasizes the external requirements for items. After that, we also propose our opinions on the open issues along the line of understanding item relations and suggest some future research directions in recommendation area.

关键词： recommender system item relation recommendation interpretability

来源：评论

学校读者我要写书评

暂无评论

SketchConf: A Framework for Automatic Sketch Configuration 39

SketchConf: A Framework for Automatic Sketch Configuration

引用

39th IEEE International Conference on data engineering, ICDE 2023

作者： Miao, Ruijie Dong, Fenghao Zhao, Yikai Zhao, Yiming Wu, Yuhan Yang, Kaicheng Yang, Tong Cui, Bin Peking University School of Computer Science National Engineering Laboratory for Big Data Analysis Technology and Application Beijing China Peng Cheng Laboratory Shenzhen China

ISBN: (纸本)9798350322279

Sketches have risen as promising solutions for frequency estimation, which is one of the most fundamental tasks in approximate data stream processing. In many scenarios, users have a strong demand to apply sketches under the expected error constraints. In this paper, we explore how to configure sketch parameters to satisfy user-defined error constraints. We propose SketchConf, an automatic sketch configuration framework, which efficiently generates memory-optimal configurations for the first time. We show that SketchConf can be applied to order-independent sketches, including CM, Count, Tower, and Nitro sketches. We further discuss how to deal with the unknown and changeable workloads when applying SketchConf to the real scenarios of streaming data processing. Experimental results show that SketchConf can be up to 715.51 times faster than the baseline algorithm, and the outputted configurations save up to 99.99% memory and achieve up to 27.44 times throughput, compared with the theory-based configurations. The code is open sourced at Github. © 2023 IEEE.

关键词： Frequency estimation

来源：评论

学校读者我要写书评

暂无评论

SteadySketch: Finding Steady Flows in data Streams 31

SteadySketch: Finding Steady Flows in Data Streams

引用

31st IEEE/ACM International Symposium on Quality of Service, IWQoS 2023

作者： Li, Xiaodong Fan, Zhuochen Li, Haoyu Zhong, Zheng Guo, Jiarui Long, Sheng Yang, Tong Cui, Bin School of Computer Science Peking University National Engineering Laboratory for Big Data Analysis Technology and Application Beijing China Peng Cheng Laboratory Shenzhen China

ISBN: (纸本)9798350399738

In this paper, we study steady flows in data streams, which refers to those flows whose arrival rate is always non-zero and around a fixed value for several consecutive time windows. To find steady flows in real time, we propose a novel sketch, SteadySketch, aiming to accurately report steady flows with limited memory. To the best of our knowledge, this is the first work to define and find steady flows in data streams. The key novelty of SteadySketch is our proposed reborn technique, which reduces the required memory space by 75%. Experimental results show that SteadySketch improves the Precision Rate (PR) by 81.1% and reduces the Average Relative Error (ARE) by 955.3× compared with the strawman solution. Finally, we provide a concrete case: cache prefetch, and prove that SteadySketch can effectively improve the cache hit ratio. All related codes of SteadySketch are open-source and available at GitHub. © 2023 IEEE.

关键词： Steady flow

来源：评论

学校读者我要写书评

暂无评论

Role of mountains and rivers in the formation of logistics enterprises'spatial pattern in the central urban areas of Chongqing

引用

Journal of Mountain Science 2022年第7期19卷 2060-2074页

作者： LIU Si-jing ZHU Cheng-jia HE Nan-nan LI Guo-qi School of Transportation and Logistics Southwest Jiaotong UniversityChengdu611756China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Chengdu611756China National United Engineering Laboratory of Integrated and Intelligent Transportation Chengdu611756China

The complex landforms of a Shan-shui City(Shan-shui refers to mountains and rivers)significantly impact the selection of locations for logistics *** paper takes Chongqing,one of the most typical Shan-shui Cities in China,as the research object,and adopts spatial analysis methods and a mediating effect model,to explore the role of mountains and rivers in the formation of logistics enterprises’spatial pattern on the street *** study results reveal that 90% of the logistics enterprises in the central urban areas of Chongqing are located in the low-altitude area below 353m above sea level,and distributed in a north-south direction along the mountains,as a result of blockage by mountain ranges,such as those of Zhongliang Mountain and Tongluo *** than 70% of the logistics enterprises are located less than 5 km from either the Yangtze River or Jialing River,spreading along the *** addition,more than half of the logistics enterprises in commercial and financial,and residential land are located within the urban core area,while 80.83% of the logistics enterprises located in warehousing land and industrial land are concentrated in the urban expansion *** areas with high land prices,the negative effect of altitude on logistics enterprise agglomeration is weakened,while the promotion effect of river proximity on logistics enterprise agglomeration is *** the urban core area with the advantage of low altitude and proximity to the Jialing and Yangtze Rivers,the role of mountains and rivers on logistics enterprises is not apparent;in contrast,in the urban expansion area with more complex landforms,land price can be an effective means for the government to macro-manage the spatial pattern of logistics enterprises in a Shan-shui City.

关键词： Logistics enterprise Spatial pattern Influencing factors Driving mechanism Chongqing

来源：评论

学校读者我要写书评

暂无评论

Real-time distance field acceleration based free-viewpoint video synthesis for large sports fields

引用

Computational Visual Media 2024年第2期10卷 331-353页

作者： Yanran Dai Jing Li Yuqi Jiang Haidong Qin Bang Liang Shikuan Hong Haozhe Pan Tao Yang School of Telecommunications Engineering Xidian UniversityXi’an 710071China National Engineering Laboratory for Integrated AeroSpace-Ground-Ocean Big Data Application Technology SAIIPthe School of Computer ScienceNorthwestern Polytechnical UniversityXi’an 710129China

Free-viewpoint video allows the user to view objects from any virtual perspective,creating an immersive visual *** technology enhances the interactivity and freedom of multimedia ***,many free-viewpoint video synthesis methods hardly satisfy the requirement to work in real time with high precision,particularly for sports fields having large areas and numerous moving *** address these issues,we propose a freeviewpoint video synthesis method based on distance field *** central idea is to fuse multiview distance field information and use it to adjust the search step size *** step size search is used in two ways:for fast estimation of multiobject three-dimensional surfaces,and synthetic view rendering based on global occlusion *** have implemented our ideas using parallel computing for interactive display,using CUDA and OpenGL frameworks,and have used real-world and simulated experimental datasets for *** results show that the proposed method can render free-viewpoint videos with multiple objects on large sports fields at 25 ***,the visual quality of our synthetic novel viewpoint images exceeds that of state-of-the-art neural-rendering-based methods.

关键词： free-viewpoint video view synthesis camera array distance field sports video

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：