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

An Overview on Economic Analysis of Internet of Everything

IEEE Communications Surveys and Tutorials 2025年

作者： Ding, Ningning Ouyang, Xiaomin Gao, Lin Huang, Jianwei Xing, Guoliang Guangzhou511453 China Hong Kong University of Science and Technology Department of Computer Science and Engineering 999077 Hong Kong Harbin Institute of Technology School of Electronics and Information Engineering Guangdong Provincial Key Laboratory of Aerospace Communication and Networking Technology Shenzhen China Chinese University of Hong Kong School of Science and Engineering Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen Key Laboratory of Crowd Intelligence Empowered Low-Carbon Energy Network CSIJRI Joint Research Centre on Smart Energy Storage Guangdong Shenzhen518172 China The Chinese University of Hong Kong Department of Information Engineering 999077 Hong Kong

The Internet of Everything (IoE) integrates people, processes, data, and things into a unified network, enabling highly interconnected systems with enhanced performance in terms of delay, reliability, and connection density. With the advent of next-generation networks, IoE has garnered significant attention for its transformative potential across various domains. However, while most existing studies focus on developing enabling technologies and deployment frameworks, the economic dimensions of IoE systems remain critically underexplored, despite being essential for ensuring their sustainability and scalability. This paper addresses this gap by providing a comprehensive review of the economic analysis of IoE systems. Specifically, we categorize existing research into four key aspects: information collection, information transmission, information fusion, and service application. We identify major economic challenges and propose modeling approaches, including game-theoretic and learning-based methods. Furthermore, we explore diverse IoE application scenarios, such as metaverse solutions and large-scale industrial systems, and summarize prevailing business patterns in the industry. By highlighting the economic dimension as a core component of IoE systems, this survey offers valuable insights into future research directions and outlines critical open challenges. © 1998-2012 IEEE.

关键词： Internet of Everything

来源：评论

学校读者我要写书评

暂无评论

A novel quantum multiparty summation protocol based on a cooperative random number mechanism

引用

EPJ Quantum Technology 2025年第1期12卷 1-19页

作者： Zhang, Kejia Zhang, Yu Zhang, Xue Liu, Hongyan Song, Tingting Du, Gang School of Computer Science and Big Data (School of Cybersecurity) Heilongjiang University Harbin China State Key Laboratory of Public Big Data Guizhou University Guiyang China School of Mathematical Science Heilongjiang University Harbin China Institute for Cryptology and Network Security Heilongjiang University Harbin China School of China Construction Bank University Northeastern Institute Harbin China College of Information Science and Technology Jinan University Guangzhou China

As a particular area of quantum security multiparty computation, quantum secure multiparty summation plays a critical role in modern cryptography. It is widely known that most of the existing quantum summation protocols are based on an honest or semi-honest third party (TP). However, the introduced TP makes the protocol difficult to implement in practice, as it may face a single-point-of-failure attack on TP. Although some TP-free protocols are proposed to mitigate this risk, the increased cost of communication reduces its efficiency. To address these issues, a novel quantum-secure multiparty summation protocol based on a cooperative random number distribution mechanism (QMS-CRM) is proposed in this paper for the first time. During it, this mechanism is designed using Shamir’s secret sharing scheme. Furthermore, this approach eliminates the requirement for random number exchange between participants without the help of TP, enhancing the efficiency of the protocol. The security analysis demonstrates that the proposed protocol can resist both external attacks and collusion attacks by up to $n - 2$ participants. Finally, we simulated the protocol on the IBM Quantum Cloud platform, confirming its feasibility.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Compromising Rechargeable Sensor networks in Marine Environment

引用

IEEE Transactions on Mobile Computing 2025年

作者： Wang, Qiwei Lin, Chi Dai, Haipeng Obaidat, Mohammad S. Hsiao, Kuei-Fang Fan, Xin Dalian University of Technology School of Software Technology & DUT-RU International School of Information Science and Engineering China Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province Dalian116620 China Nanjing University State Key Laboratory for Novel Software Technology Nanjing210023 China University of Science and Technology Beijing School of Computer and Communication Engineering Beijing100083 China SRM University Department of Computational Intelligence School of Computing SRM Nagar TN Kattankulathur603203 India The Amity University School of Engineering UP Noida201301 India The King Abdullah II School of Information Technology The University of Jordan Amman11942 Jordan

Marine Wireless Rechargeable Sensor networks (MWRSNs), enhanced by recent Wireless Power Transfer (WPT) technology, present a significant advancement in extending network life. Traditional methods improve network performance through algorithm optimization, but neglect charging security, exposing networks to potential attacks. This paper addresses this problem from an adversarial view and develops a novel attack for MWRSN through Denying of Charge (DoC) to maximize network destructiveness. We start by establishing a generalized on-demand charging model, essential for developing DoC tactics. Subsequently, we unveil the Collaborative DoC (CoDoC) algorithm, capable of manipulating and falsifying charging requests. Central to CoDoC is the Request Prediction Method (RPM), which forecasts the initiation of charging requests and facilitates rapid request surges to enhance the attack's efficacy. CoDoC is able to disguise the presence of the attack, which is able to escape from being detected by the base station. Theoretical analyses are provided to explore the features of the proposed scheme. To demonstrate the outperformed features of the proposed schemes, extensive simulations and test-bed experiments are conducted. Our analysis and extensive simulations demonstrate that CoDoC increases sensor node failures by 20% to 142% compared to traditional methods, highlighting its effectiveness in marine environments. © 2002-2012 IEEE.

关键词： Charging stations

来源：评论

学校读者我要写书评

暂无评论

Non-uniform spacing clustering interval multi-hop routing leach algorithms for wireless sensor network

引用

Journal of Computational information Systems 2015年第10期11卷 3613-3622页

作者： Wang, Honglin Shen, Jun School of computer Science and Engineering of Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration of Southeast University Nanjing China School of Electronic & Information Engineering of Nanjing University of Information Science & Technology Nanjing China

For mine tunnel distances ribbon special communications environment, proposed a non-uniform spacing clustering multi-hop routing algorithm. The core idea is: to change the cluster head election strategy, considering the position of the node, energy and networks, such as the number of current network cluster heads forming weighting function, optimize partitions, away from the base station to partition larger than the nearby district comprehensive node energy consumption;the original single-hop communication mode optimized for single-hop and multi-hop mixed-mode, single-hop and multi-hop network choices to lower the overall energy consumption of the standard;in order to protect the communication mode of the multi-hop cluster heads near the base station using the multi-hop mode interval, so that a larger area of nodes sharing a base station adjacent to a node energy consumption. Experiments show that the protocol has better stability and significantly extend the life cycle of the network. ©, 2015, Binary information Press. All right reserved.

关键词： Base stations

来源：评论

学校读者我要写书评

暂无评论

Examining the Fourier Spectrum of Speech Signal from a Time-Frequency Perspective for Automatic Depression Level Prediction

引用

IEEE Transactions on Affective Computing 2025年

作者： Niu, Mingyue Tao, Jianhua He, Yongjun Zhang, Shiqing Li, Ming YanShan University School of Information Science and Engineering Qinhuangdao066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province China Tsinghua University Department of Automation Bejing100190 China University of Chinese Academy of Sciences School of Artificial Intelligence Beijing100049 China Harbin Institute of Technology School of Computer Science and Technology Harbin150001 China Taizhou University Institute of Intelligent Information Processing Taizhou318000 China Zhejiang Normal University Zhejiang Key Laboratory of Intelligent Education Technology and Application Jinhua321004 China Zhejiang Institute of Optoelectronics Jinhua321004 China

Currently, many studies use Fourier amplitude spectra of speech signals to predict depression levels. However, those works often treat Fourier amplitude spectra as images or sequences to capture depression cues using convolutional neural networks or multilayer perceptrons. Therefore, they ignore the complex element composition and time-frequency attributes of Fourier spectra, which is not conducive to capturing the differences among individuals with different depression levels. For this reason, we construct a Time-Frequency Self-Embedding (TFSE) module, which not only stores the correlation relationship among real (imaginary) parts of Fourier spectra of different subjects from the time-frequency perspective, but also maintain the physical properties of data through the weight embedding process. Besides, Global Average Pooling (GAP) or linear layers are difficult to balance both temporal and frequency dimensions in the vectorization process. Therefore, we construct a Time-Frequency Tensor Vectorization (TFTV) module, which summarizes each channel along time and frequency dimensions, and then generates the vectorization result by integrating various channels. In this way, we combine TFSE and TFTV modules to form our SpectrumFormer model for predicting depression levels. Evaluation indicators on AVEC 2013 and AVEC 2014 depression databases imply the progressiveness of our model. © 2010-2012 IEEE.

关键词： Depression level prediction Real and imaginary parts Tensor vectorization Time-frequency attributes

来源：评论

学校读者我要写书评

暂无评论

A Memory-efficient Simulation Method of Grover’s Search Algorithm

引用

computers, Materials & Continua 2018年第11期57卷 307-319页

作者： Xuwei Tang Juan Xu Bojia Duan College of Computer Science and Technology Nanjing University of Aeronautics and AstronauticsNanjingChina Institute for Quantum Computing University of WaterlooCanada Key Laboratory of Computer Network and Information Integration(Southeast University) Ministry of EducationChina

Grover’s search algorithm is one of the most significant quantum algorithms,which can obtain quadratic speedup of the extensive search *** Grover's search algorithm cannot be implemented on a real quantum computer at present,its quantum simulation is regarded as an effective method to study the search *** simulating the Grover's algorithm,the storage space required is exponential,which makes it difficult to simulate the high-qubit Grover’s *** this end,we deeply study the storage problem of probability amplitude,which is the core of the Grover simulation *** propose a novel memory-efficient method via amplitudes compression,and validate the effectiveness of the method by theoretical analysis and simulation *** results demonstrate that our compressed simulation search algorithm can help to save nearly 87.5%of the storage space than the uncompressed *** under the same hardware conditions,our method can dramatically reduce the required computing nodes,and at the same time,it can simulate at least 3 qubits more than the uncompressed ***,our memory-efficient simulation method can also be used to simulate other quantum algorithms to effectively reduce the storage costs required in simulation.

关键词： Grover’s search algorithm probability amplitude quantum simulation memory compression

来源：评论

学校读者我要写书评

暂无评论

Towards kernelizing the classifier for hyperbolic data

引用

Frontiers of computer Science 2024年第1期18卷 17-31页

作者： Meimei YANG Qiao LIU Xinkai SUN Na SHI Hui XUE School of Computer Science and Engineering Southeast UniversityNanjing 210096China MOE Key Laboratory of Computer Science and Information Integration(Southeast University) Nanjing 210096China

Data hierarchy,as a hidden property of data structure,exists in a wide range of machine learning applications.A common practice to classify such hierarchical data is first to encode the data in the Euclidean space,and then train a Euclidean ***,such a paradigm leads to a performance drop due to distortion of data embedding in the Euclidean *** relieve this issue,hyperbolic geometry is investigated as an alternative space to encode the hierarchical data for its higher ability to capture the hierarchical *** methods cannot explore the full potential of the hyperbolic geometry,in the sense that such methods define the hyperbolic operations in the tangent plane,causing the distortion of data *** this paper,we develop two novel kernel formulations in the hyperbolic space,with one being positive definite(PD)and another one being indefinite,to solve the classification tasks in hyperbolic *** PD one is defined via mapping the hyperbolic data to the Drury-Arveson(DA)space,which is a special reproducing kernel Hilbert space(RKHS).To further increase the discrimination of the classifier,an indefinite kernel is further defined in the Krein ***,we design a 2-layer nested indefinite kernel which first maps hyperbolic data into the DA spaces,followed by a mapping from the DA spaces to the Krein *** experiments on real-world datasets demonstrate the superiority ofthe proposed kernels.

关键词： data hierarchy hyperbolic cgeometry drury-arveson space krein space

来源：评论

学校读者我要写书评

暂无评论

Steganalysis and improvement of a quantum steganography protocol via a GHZ_4 state

引用

Chinese Physics B 2013年第6期22卷 199-202页

作者：徐淑奖陈秀波钮心忻杨义先 Information Security Center State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and Telecommunications Shandong Provincial Key Laboratory of Computer Network Shandong Computer Science Center State Key Laboratory of Information Security (Institute of Information EngineeringChinese Academy of Sciences)

Quantum steganography that utilizes the quantum mechanical effect to achieve the purpose of information hiding is a popular topic of quantum information. Recently, E1 Allati et al. proposed a new quantum steganography using the GHZ4 state. Since all of the 8 groups of unitary transformations used in the secret message encoding rule change the GHZ4 state into 6 instead of 8 different quantum states when the global phase is not considered, we point out that a 2-bit instead of a 3-bit secret message can be encoded by one group of the given unitary transformations. To encode a 3-bit secret message by performing a group of unitary transformations on the GHZ4 state, we give another 8 groups of unitary transformations that can change the GHZ4 state into 8 different quantum states. Due to the symmetry of the GHZ4 state, all the possible 16 groups of unitary transformations change the GHZ4 state into 8 different quantum states, so the improved protocol achieves a high efficiency.

关键词： quantum steganography GHZ4 entangled state quantum cryptography quantum communication

来源：评论

学校读者我要写书评

暂无评论

Traffic classification based on port connection pattern

Traffic classification based on port connection pattern

引用

2011 International Conference on computer Science and Service System, CSSS 2011

作者： Cheng, Guang Wang, Song Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing 210096 China

ISBN: (纸本)9781424497638

While the traditional Web, Email and other Internet applications are still used large-scale, Internet applications, such as typical P2P resource sharing, streaming, games, instant messaging and other new applications emerging, is generating the rapid growth traffic. Connection pattern approach is to observe and identify connection patterns of host behavior at the transport layer. This method has no access to packet payload, no knowledge of port numbers and no additional information other than what current flow collectors provide. But traffic classification method based on host connection pattern can't distinguish some similar applications provided by one server. This paper analyzes the connection pattern between servers for SMTP, POP3, Web, BT traffic, and the distribution of simultaneous connections for each server port, and then propose a new traffic classified approach based on port connection pattern and the simultaneous connection number. The classified method can distinguish WEB, SMTP, POP3, and BT traffic each port in a server without any knowledge of port. The experimental result shows that this method is effective. © 2011 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

SEE-Few: Seed, Expand and Entail for Few-shot Named Entity Recognition 29

SEE-Few: Seed, Expand and Entail for Few-shot Named Entity R...

引用

29th International Conference on Computational Linguistics, COLING 2022

作者： Yang, Zeng Zhang, Linhai Zhou, Deyu School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University China

Few-shot named entity recognition (NER) aims at identifying named entities based on only few labeled instances. Current few-shot NER methods focus on leveraging existing datasets in the rich-resource domains which might fail in a training-from-scratch setting where no source-domain data is used. To tackle training-from-scratch setting, it is crucial to make full use of the annotation information (the boundaries and entity types). Therefore, in this paper, we propose a novel multi-task (Seed, Expand and Entail) learning framework, SEE-Few, for Few-shot NER without using source domain data. The seeding and expanding modules are responsible for providing as accurate candidate spans as possible for the entailing module. The entailing module reformulates span classification as a textual entailment task, leveraging both the contextual clues and entity type information. All the three modules share the same text encoder and are jointly learned. Experimental results on four benchmark datasets under the training-from-scratch setting show that the proposed method outperformed state-of-the-art few-shot NER methods with a large margin. Our code is available at https://***/unveiled-the-red-hat/SEE-Few. © 2022 Proceedings - International Conference on Computational Linguistics, COLING. All rights reserved.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：