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

Service decoupling for open and intelligent service-based RAN

Frontiers of Information technology & Electronic Engineering 2025年第2期26卷 230-245页

作者： Chunjing YUAN Tong LEI Ze XUE Lin TIAN Shuyuan ZHANG Na LI Zhou TONG Institute of Computing Technology Chinese Academy of SciencesBeijing 100190China Hubei Intelligent Cloud Network Operation Center China TelecomWuhan 430024China Nanjing Institute of InforSuperBahn Nanjing 210008China Future Research Lab China Mobile Research InstituteBeijing 100053China

Task diversity is one of the biggest challenges for future sixth-generation(6G)*** the task as the center and driving the dynamic 6G radio access network(RAN)with artificial intelligence(AI)are necessary to accurately meet the personalized demands of ***,AI can only configure the parameters of a monolithic RAN and cannot schedule the *** development trend of 6G RANs is to enhance dynamic capability and scheduling *** this paper,we propose a service-based RAN architecture that can deploy decoupled RAN functions and customize networks according to *** analysis shows that the interactive relationship between RAN control plane(CP)functions is complex and needs to be decoupled according to the principles of high cohesion and low *** on the graph theory rather than expert experience,we design a RAN decoupling *** functional connection and interaction of the CP are represented by constructing an undirected weighted graph,followed by achieving decoupling of the CP through a minimum spanning *** an integration decoupling scheme of a RAN-CN(core network)is introduced considering the duplicate and redundant functions of the RAN and *** granularity of decoupling in a service-based RAN is determined by analyzing the flexibility of decoupling,complexity of signaling,and processing *** find that it is more appropriate to decouple the RAN CP into four *** integration decoupling of the RAN-CN resolves the technical bottleneck of low serial efficiency in the Ng interface,supporting AI-based global service scheduling.

关键词： Service decoupling Open and intelligent Service-based radio access network(RAN) Graph theory Full-service 6G network

来源：评论

学校读者我要写书评

暂无评论

All-in-one Cascadable Dynamic Terahertz Logic Gates Enabled by Polarization Encoding and Multiplexing

引用

Laser and Photonics Reviews 2025年

作者： Wang, Yu Cheng, Jierong Fan, Fei Peng, Yan Liu, Yan Chang, Shengjiang Zhuang, Songlin Nankai University Institute of Modern Optics 38 Tongyan Road Tianjin300350 China Tianjin Key Laboratory of Micro-Scale Optical Information Science and Technology Tianjin300350 China Tianjin Key Laboratory of Optoelectronic Sensor and Sensing Network Technology Tianjin300350 China University of Shanghai for Science and Technology Terahertz Technology Innovation Research Institute Shanghai200093 China Shandong Inspur Artificial Intelligence Research Institute Co. Ltd Shandong Yunhai Guochuang Cloud Computing Equipment Industry Innovation Co. Ltd. Shandong250013 China

Metasurfaces bring an advanced paradigm for optical computing through extraordinary beam manipulation. A metasurface logic gate needs function multiplexing to process different input signals. Integration of multiple gates in one design further increases the multiplexing channels, which necessitates the diffractive neural networks with challenges of decreased system stability, difficulty for connection, and large insertion loss. Here an optical logic gate is demonstrated by sequentially encoding the input signals into polarization and decoding through a 4-polarization-multiplexed metasurface. By introducing an idler polarization state, a convenient strategy is developed to integrate and dynamically switch 4 or full 7 logic gates in a single module through overall polarization rotation and proper polarization-truth multiplexing relation. The all-in-one logic gate is validated at 140 GHz through the steady-state and dynamic test, with the resulting contrast of 6.5 dB, flexible test ranges of 80 mm, and insertion loss of 2.2 dB. The computing result is represented by both the focusing position and the polarization, with the later as a consistent input and output physical quantity for cascading. Cascaded AND–AND gates and AND-OR gates are demonstrated with 6 dB result contrast, showing great promise for building robust logic systems for future optical signal processing. © 2025 Wiley-VCH GmbH.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

Leveraging VOSviewer approach for mapping, visualisation, and interpretation of crisis data for disaster management and decision-making

引用

International Journal of Information Management Data Insights 2025年第1期5卷

作者： Bukar, Umar Ali Sayeed, Md Shohel Amodu, Oluwatosin Ahmed Razak, Siti Fatimah Abdul Yogarayan, Sumendra Othman, Mohamed Centre for Intelligent Cloud Computing (CICC) Faculty of Information Science and Technology Multimedia University Jalan Ayer Keroh Lama Melaka Bukit Beruang 75450 Malaysia Department of Electronics Electrical and System Engineering Universiti Kebangsaan Malaysia Bangi 43600 Malaysia Department of Communication Technology and Network Universiti Putra Malaysia UPM Serdang Selangor 43400 Malaysia Laboratory of Computational Science and Mathematical Physics Institute for Mathematical Research Universiti Putra Malaysia UPM Serdang Selangor 43400 Malaysia

Analysing social media data is crucial for crisis management organisations to make timely decisions. Researchers in crisis informatics have devised various methods and systems to process and classify large volumes of crisis-related social media data for effective crisis response and recovery. However, the complexity of previous solutions hampers the timely processing of this data, its visualisation, and its interpretation, which is necessary for effective crisis response. Hence, this study addresses this challenge by employing visualisation of similarities to analyse and visualise crisis datasets to aid crisis management and decision-making. The results reveal a "nine-cluster community” of relevant keywords comprising “Green, Brown, Red, Blue, Pink, Purple, Yellow, Orange, and Cyan” colours, in both binary and full count. Specifically, the findings reveal various keywords such as the needs for food, water, shelter, medicine, and electricity. Thereafter, the study discusses the implications of VOSviewer for analysing crisis data theoretically and practically. © 2024

关键词： Co-occurrence networks Data analysis Decision-making Disaster management Social media Visualisation VOSviewer

来源：评论

学校读者我要写书评

暂无评论

DDOS: data dissemination with optimized and secured path using modified particle swarm optimization in vehicular communication network (VCN)

引用

International Journal of Information technology (Singapore) 2022年第4期14卷 1855-1868页

作者： Tripathi, Kuldeep Narayan Yadav, Ashish Mohan Sharma, S.C. Wireless Network and Cloud Computing (WNCC) Lab Electronics and Computer Discipline DPT Indian Institute of Technology Roorkee Uttarakhand Roorkee 247667 India

The high mobility of vehicles is the most dominating feature of vehicular communication networks (VCN). Due to the increased mobility, it suffers frequent breakage in the communication link, results in degradation of network performance in terms of data delivery and time delay. The timely delivery of critical information is the main concern in a vehicular communication network. The vehicular ad-hoc communication network is a special type of wireless network having fast-moving vehicles as a node. In the vehicular network, data forwarding is based on network connectivity and topology. Due to the limited vehicle communication range, selecting appropriate next-hop vehicles is critical in VCN. Vehicle selects the optimal route to transfer the messages from source to destination by using intermediate relay vehicles. Optimal path selection enables timely, reliable, and QoS-aware data transfer in a vehicular network. So we required an optimized, secure, and efficient technique for the secure and timely transmission of data packets in the network. We proposed a PSO-based optimized and secured routing scheme in which data forwarding is based on the trustworthiness of the neighbouring nodes. In the proposed algorithm, PSO optimizes the link stability and packet delivery ratio of hop-based communication. The proposed algorithm isolates various packet dropping attacks and provides a secure and optimized route from source to destination. Furthermore, the proposed DDOS algorithm helps to reduce the transmission delay and enhances the security and delivery ratio of the messages in the network. It also increases the network lifetime and optimizes the data delivery and other network parameters. Performance comparison using network simulator NS-2 shows the significant growth in the performance of the vehicular network in terms of well-defined QoS parameters like successful packet delivery ratio, transmission delay, throughput, and control overhead. © 2021, Bharati Vidyapeeth's Institu

关键词： Cross-layer optimization Data dissemination Link stability PSO QoS aware routing Trust VANETs

来源：评论

学校读者我要写书评

暂无评论

WordTopic-MultiRank: A New Method for Automatic Keyphrase Extraction 6

WordTopic-MultiRank: A New Method for Automatic Keyphrase Ex...

引用

6th International Joint Conference on Natural Language Processing, IJCNLP 2013

作者： Zhang, Fan Huang, Lian'en Peng, Bo Shenzhen Key Lab for Cloud Computing Technology and Applications Peking University Shenzhen Graduate School Shenzhen518055 China Institute of Network Computing and Information Systems Peking University Beijing100871 China

ISBN: (纸本)9784990734800

Automatic keyphrase extraction aims to pick out a set of terms as a representation of a document without manual assignment efforts. Supervised and unsupervised graph-based ranking methods have been studied for this task. However, previous methods usually computed importance scores of words under the assumption of single relation between words. In this work, we propose WordTopic-MultiRank as a new method for keyphrase extraction, based on the idea that words relate with each other via multiple relations. First we treat various latent topics in documents as heterogeneous relations between words and construct a multi-relational word network. Then, a novel ranking algorithm, named Biased-MultiRank, is applied to score the importance of words and topics simultaneously, as words and topics are considered to have mutual influence on each other. Experimental results on two different data sets show the outstanding performance and robustness of our proposed approach in automatic keyphrase extraction task. © IJCNLP *** right reserved.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

cloud computing

引用

China Communications 2014年第4期11卷 I0001-I0002页

作者：崔勇 Rajkumar Buyya 刘江川 Tsinghua University Network Technology in Institute Tsinghua University IPv6 Transition Softwire WG of IETF Tsinghua University Computer Science and Software Engineering at the University of Melbourne Cloud Computing and Distributed Systems(CLOUDS) Laboratory at the University of Melbourne School of Computing Science at Simon Fraser University

cloud computing is a novel computing paradigm that utilizes remote cloud resources to achieve a high-performance *** provides infrastructure,platform and software as different on-demand *** has made remarkable progress in cloudbased products and operating system *** government,enterprises and research institutions are all active in the development of cloud computing-related *** the progress,many important

关键词：计算模式性能计算基础设施操作系统科研机构远程软件

来源：评论

学校读者我要写书评

暂无评论

General Self-repairing Codes for Distributed Storage Systems

General Self-repairing Codes for Distributed Storage Systems

引用

IEEE International Conference on Communications

作者： Hanxu Hou Hui Li Kenneth W. Shum Shenzhen Eng. Lab of Converged Networks Technology Shenzhen Key Lab of Cloud Computing Tech. and App. Shenzhen Graduate School Peking University Shenzhen China Institute of Network Coding The Chinese University of Hong Kong Shatin Hong Kong

In distributed storage systems, a data file is encoded and distributed to storage nodes, such that the data file can be recovered from some subsets of the nodes. Upon the failure of a storage node, we want to repair it efficiently by contacting and downloading some encoded bits from a small number of surviving nodes. Using projective-geometric self-repairing codes (PSRC), proposed by Oggier and Datta, one can repair a failed node by contacting only two nodes. However, in their construction, the number of storage nodes in the storage system is a large number, and thus the storage efficiency is low. In this paper, we investigate how to be more flexible in the number of storage nodes. The proposed code in this paper is called general projective geometric self-repairing codes (GPSRC). GPSRC reduces high redundancy of PSRC, while retains the basic property of PSRC. We present some methods for repairing a failed node, in which the number of contacted surviving nodes is flexible. These repairing methods provide tradeoff between repair-degree and repair-bandwidth.

关键词： Maintenance engineering Vectors Encoding Finite element analysis Bandwidth Galois fields Educational institutions

来源：评论

学校读者我要写书评

暂无评论

BASIC regenerating code: Binary addition and shift for exact repair

BASIC regenerating code: Binary addition and shift for exact...

引用

IEEE International Symposium on Information Theory

作者： Hanxu Hou Kenneth W. Shum Minghua Chen Hui Li Peking University Beijing Beijing CN Institute of Network Coding Chinese University of Hong Kong Hong Kong China Department of Information Engineering Chinese University of Hong Kong Hong Kong China Shenzhen Engineering Laboratory of Converged Networks Technology Shenzhen Key Laboratory of Cloud Computing Technology and App. Shenzhen Graduate School Peking University Shenzhen China

ISBN: (纸本)9781479904440

Regenerating code is a class of storage codes that achieve the optimal trade-off between storage capacity and repair bandwidth, which are two important performance metrics in data storage systems. However, existing constructions of regenerating codes rely on expensive computational operations such as finite field multiplication. The high coding and repair complexity limit their applications in large-scale practical storage systems. In this paper, we show that it is possible to achieve the full potential of regenerating codes with low computational complexity. In particular, we propose a new class of regenerating codes, called BASIC codes, that can achieve two specific points (i.e., minimum-bandwidth and minimum-storage regenerating points) on the storage and repair bandwidth trade-off curve, using only binary addition and shift operations in the coding and repair processes. Although in this paper we focus on constructing and analyzing BASIC codes for two specific exact-repair settings, our framework can be generalized to develop BASIC codes for more general exact- and functional-repair regenerating codes.

关键词： Maintenance engineering Encoding Polynomials Vectors Symmetric matrices Bandwidth Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Self-adaptive anonymous communication scheme under SDN architecture

Self-adaptive anonymous communication scheme under SDN archi...

引用

IEEE International Conference on Performance, computing and Communications (IPCCC)

作者： Tingting Zeng Meng Shen Mingzhong Wang Liehuang Zhu Fan Li Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications Beijing Institute of Technology P. R. China Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education P. R. China Faculty of Arts and Business University of the Sunshine Coast Queensland Australia

Communication privacy and latency perceived by users have become great concerns for delay-sensitive Internet services. Existing anonymous communication systems either provide high anonymity at an expense of prolonged latency (e.g., mix-net), or offer better real-time performance by sacrificing the ability against traffic analysis attacks (e.g., Onion Routing). The emerging Software-Defined networking (SDN) introduces additional challenges to communication anonymity, due to the existence of a centralized controller that has a global view of the entire network traffic. In this paper, we propose a new anonymous communication scheme for delay-sensitive services under SDN scenarios, which can simultaneously protect communication privacy and reduce the end-to-end latency. A self-adaptive method based on the mix-net framework is designed to dynamically modify the waiting threshold of mix nodes, which helps to reduce the communication latency. In order to preserve the degree of anonymity, the self-adaptive method is incorporated with a random walking strategy for packets forwarding. Both theoretical analysis and experimental results prove that our scheme provides a moderate degree of anonymity and effectively reduces the latency derived from mix-net by up to 50%.

关键词： Real-time systems Relays Entropy Lead Distance measurement Annealing Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

Latency-aware routing with bandwidth assignment for Software Defined networks

Latency-aware routing with bandwidth assignment for Software...

引用

IEEE International Conference on Performance, computing and Communications (IPCCC)

作者： Qiongyu Zhang Liehuang Zhu Meng Shen Mingzhong Wang Fan Li Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications Beijing Institute of Technology P. R. China Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education P. R. China Faculty of Arts and Business University of the Sunshine Coast Queensland Australia

Reducing the flow latency is of great importance in traffic management, which benefits both service providers and end users. Routing design and flow scheduling are typical ways to improve the flow transmission efficiency. However, existing studies usually consider them separately, due to the complexity of joint consideration. Here, we propose a latency-aware routing scheme with bandwidth assignment in the Software Defined networks, which can efficiently reduce the flow latency with a moderate complexity, to combine the routing and scheduling together.

关键词： Routing Bandwidth Processor scheduling Complexity theory Bismuth Software Mathematical model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：