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

2005 International Conference on Communications, Circuits and Systems

作者： Xu, Li-Bo Wu, Guo-Xin Li, Jian-Fei Key Laboratory of Computer Network and Information Integration Southeast University Nanjing 210096 China

ISBN: (纸本)0780390156

In high-speed Internet links, effective and efficient packet sampling technology in traffic measurement becomes more and more indispensable for its benefits of reducing data quantity and saving various resources. We address the Issue of how to keep or improve sampling accuracy during burst or fluctuation periods. In the paper, an adaptive packet-level sampling method on different traffic fluctuation and burst scales is proposed. The method can dynamically adjust each packet sampling probability dependent on the magnitude of traffic fluctuation. The adjustment granularity is fine because it reaches single packet. By contrast to static random sampling method in experiments using real traffic trace, we show that the proposed adaptive sampling has great capability to trace traffic fluctuations and Improve sampling accuracy through capturing more fluctuation or burst details. © 2005 IEEE.

关键词： Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

Dynamic Bandwidth Allocation and Rate Coordination for DiffServ Environment

引用

Wuhan university Journal of Natural Sciences 2006年第1期11卷 248-252页

作者： CHEN Gang WU Guo-xin ZHANG San-feng YOU Feng-qin Department of Computer Science and Engineering Southeast University Nanjing 210096 Jiangsu China Key Laboratory of Computer Network and Information Integration of MOE Southeast University Nanjing 210096Jiangsu China

This paper presents a novel model for dynamic bandwidth allocation and rate coordination based on DiffServ and a bandwidth broker（BB）. In this model, assignment of bandwidth was made according to a periodic trace of network characteristics per application. And adjustment of transfer rate was accomplished through negotiation with applications by a bandwidth agent. This model was evaluated using network simulator 2 （NS-2）, and distinct improvements were found in respects of delay and packet loss of overall network and single flow. Finally, the model was suggested to be leveraged to multimedia applications with properties of lower delay and lower packet loss.

关键词： QoS bandwidth broker（BB） dynamic bandwidth allocation rate coordination

来源：评论

学校读者我要写书评

暂无评论

Dynamic Spectrum Aggregation and Access for Rescue Cognitive networks Using Multi-Agent Actor-Critic Reinforcement Learning

引用

IEEE Transactions on Cognitive Communications and networking 2025年

作者： Zhang, Wensheng Ding, Wenjiao Wang, Cheng-Xiang Chen, Yunfei Abreu, Giuseppe Liu, Zhi Sun, Jian Han, Zhu Shandong University School of Information Science and Engineering Shandong Key Laboratory of Intelligent Communication and Sensing-Computing Integration Qingdao266237 China Industrial and Commercial Bank Of China Limited Shandong Branch Jinan China Southeast University National Mobile Communications Research Laboratory School of Information Science and Engineering Nanjing211189 China Purple Mountain Laboratories Pervasive Communication Research Center Nanjing211111 China Durham University Department of Engineering DurhamDH1 3LE United Kingdom Constructor University Bremen GGMBH School of Computer Science and Engineering Campus Ring 1 Bremen28757 Germany University of Houston Department of Electrical and Computer Engineering HoustonTX77004 United States Kyung Hee University Department of Computer Science and Engineering Seoul446-701 Korea Republic of

Unmanned aerial vehicles (UAVs) based emergency communication is gaining more attention for disaster rescue, where the UAV can work as an aerial base station to provide spectrum access in areas with power outages or network interruptions. However, UAVs can only provide limited spectrum access for a short period of time due to limited battery energy. Aiming to providing spectrum access to more users under spectrum and energy limitations, a new dynamic spectrum aggregation and access scheme is proposed for rescue cognitive networks (RCNs), in which different kinds of users are modeled as primary users (PUs) and secondary users (SUs). In each time slot, SUs with different spectrum sensing capabilities, spectrum aggregation capabilities, and bandwidth demands need to sense and aggregate multiple spectrum slots that are not occupied by PUs for data transmission. Based on selected channel states, the reward is designed as a function of transmission rates and is fed back to SUs. A maximum entropy based multi-agent actor-critic (ME-MAAC) algorithm is proposed to optimize the action selection policy for SUs. Simulation results show that the proposed ME-MAAC algorithm can effectively achieve higher achievable rate, lower mean collision rate and lower power consumption, than state-of-the-art methods based on Deep Q-network (DQN) algorithm. The proposed RCNs provide a novel spectrum usage paradigm for emergency communication and rescue networks. © 2015 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Wireless sensor network-enabled intravenous infusion monitoring

Wireless sensor network-enabled intravenous infusion monitor...

引用

作者： Zhang, Y. Zhang, S.F. Ji, Y. Wu, G.X. Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

Considering that intravenous in blood infusion, usually applied without a proper control of the progress and velocity under unreliable manual monitoring practice, is the most popular and frequent clinical activity throughout the world, which can potentially endanger a patient's life, leads to a huge burden as patients, relatives and nursing staff can cause serious cases of medical negligence. In order to resolve this problem and provide a networkable solution the authors propose a novel radio frequency identification-based wireless sensor networkable intravenous infusion monitoring system. The proposed system is a wireless sensor system based on taking a fork-type light barrier as a sensor, a micro-control unit (MCU) as a ZigBee-based radio frequency device. The system's performance is evaluated through some laboratory experiments using tuning algorithm to demonstrate that the results show the required accuracy of the system to meet practical needs. © 2011 The Institution of Engineering and Technology.

关键词： Zigbee

来源：评论

学校读者我要写书评

暂无评论

Joint Beamforming Design for Integrated Sensing and Communication Systems with Hybrid-Colluding Eavesdroppers

arXiv

引用

arXiv 2025年

作者： Liu, Meiding Zhou, Zhengchun Shi, Qiao Li, Guyue Liu, Zilong Fan, Pingzhi Lee, Inkyu School of Information Science and Technology Southwest Jiaotong University Chengdu611756 China Key Laboratory of Analytical Mathematics and Applications [Fujian Normal University Ministry of Education China Purple Mountain Laboratories for Network and Communication Security Nanjing210096 China School of Cyber Science and Engineering Southeast University Nanjing210096 China School of Computer Science and Electronics Engineering University of Essex ColchesterCO4 3SQ United Kingdom Key Laboratory of Information Coding and Transmission Southwest Jiaotong University Chengdu611756 China School of Electrical Engineering Korea University Seoul02841 Korea Republic of

In this paper, we consider the physical layer security (PLS) problem for integrated sensing and communication (ISAC) systems in the presence of hybrid-colluding eavesdroppers, where an active eavesdropper (AE) and a passive eavesdropper (PE) collude to intercept the confidential information. To ensure the accuracy of sensing while preventing the eavesdropping, a base station transmits a signal consisting of information symbols and sensing waveform, in which the sensing waveform can be also used as artificial noise to interfere with eavesdroppers. Under this setup, we propose an alternating optimization-based two stage scheme (AO-TSS) for improving the sensing and communication performance. In the first stage, based on the assumptions that the perfect channel state information (CSI) of the AE and statistical CSI of the PE are known, the communication and sensing beamforming problem is formulated with the objective of minimizing the weighted sum of the beampattern matching mean squared error (MSE) and cross-correlation, subject to the secure transmission constraint. To tackle the non-convexity, we propose a semi-definite relaxation (SDR) algorithm and a reduced-complexity zero-forcing (ZF) algorithm. Then, the scenarios are further extended to more general cases with imperfect AE CSI and unknown PE CSI. To further improve the communication performance, the second-stage problem is developed to optimize the secrecy rate threshold under the radar performance constraint. Finally, numerical results demonstrate the superiority of the proposed scheme in terms of sensing and secure communication. © 2025, CC BY.

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

A structured P2P system with match path and probability balance tree

A structured P2P system with match path and probability bala...

引用

First International Multi- Symposiums on computer and Computational Sciences, IMSCCS'06

作者： Xu, L.B. Wu, G.X. You, F.Q. Key Laboratory of Computer Network and Information Integration Southeast University Nanjing 210096 China

ISBN: (纸本)0769525814

Excellent P2P network infrastructure should support scalability and efficient search simultaneity. The intelligent routing mechanisms have flexible query expression but hold low scalability and recall rate. Contrastively, DHTs are scalable but either difficult to organize or too expensive for maintenance. A new structured P2P model is proposed in which resource storages are organized by match path and random access method. When an approximately balance distributed character is obtained, nodes will keep high search efficiency and low maintenance cost. The system supports various query models, has load balancing capability and high scalability, and ensures search range of each node can cover entire network. The system runs without any center service while all nodes simultaneously take index storage, data storage and routing task to drive network by only maintaining a little local information. © 2006 IEEE.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Prompting Large Language Models with Knowledge-Injection for Knowledge-Based Visual Question Answering

引用

Big Data Mining and Analytics 2024年第3期7卷 843-857页

作者： Zhongjian Hu Peng Yang Fengyuan Liu Yuan Meng Xingyu Liu School of Computer Science and Engineering Southeast University the Key Laboratory of Computer Network and Information Integration(Southeast University) Ministry of Education of the People’s Republic of ChinaNanjing 211189China Southeast University-Monash University Joint Graduate School(Suzhou) Southeast UniversitySuzhou 215125China

Previous works employ the Large Language Model(LLM)like GPT-3 for knowledge-based Visual Question Answering(VQA).We argue that the inferential capacity of LLM can be enhanced through knowledge *** methods that utilize knowledge graphs to enhance LLM have been explored in various tasks,they may have some limitations,such as the possibility of not being able to retrieve the required *** this paper,we introduce a novel framework for knowledge-based VQA titled“Prompting Large Language Models with Knowledge-Injection”(PLLMKI).We use vanilla VQA model to inspire the LLM and further enhance the LLM with knowledge *** earlier approaches,we adopt the LLM for knowledge enhancement instead of relying on knowledge ***,we leverage open LLMs,incurring no additional *** comparison to existing baselines,our approach exhibits the accuracy improvement of over 1.3 and 1.7 on two knowledge-based VQA datasets,namely OK-VQA and A-OKVQA,respectively.

关键词： visual question answering knowledge-based visual question answering large language model knowledge injection

来源：评论

学校读者我要写书评

暂无评论

Some Issues on computer networks:Architecture and key Technologies

引用

Journal of computer Science & Technology 2006年第5期21卷 708-722页

作者：顾冠群罗军舟 School of Computer Science and Engineering Southeast UniversityNanjing 210096P.R.China Key Laboratory of Computer Network and Information Integration(Sout-heast University) Ministry of Education Nanjing 210096P.R.China

The evolution of computer networks has experienced several major steps, and research focus of each step has been kept changing and evolving, from ARPANET to OSI/RM, then HSN （high speed network） and HPN （high performance network）. During the evolution, computer networks represented by Internet have made great progress and gained unprecedented success. However, with the appearance and intensification of tussle, along with the three difficult problems （service customizing, resource control and user management） of modern network, it is found that traditional Internet and its architecture no longer meet the requirements of next generation network. Therefore, it is the next generation network that current Internet must evolve to. With the mindset of achieving valuable guidance for research on next generation network, this paper firstly analyzes some dilemmas facing current Internet and its architecture, and then surveys some recent influential research work and progresses in computer networks and related areas, including new generation network architecture, network resource control technologies, network management and security, distributed computing and middleware, wireless/mobile network, new generation network services and applications, and foundational theories on network modeling. Finally, this paper concludes that within the research on next generation network, more attention should be paid to the high availability network and corresponding architecture, key theories and supporting technologies.

关键词： computer network tussle resource control network management security middleware wireless/mobile network modeling high availability network

来源：评论

学校读者我要写书评

暂无评论

Automated Testing of Web Applications Using Combinatorial Strategies

引用

Journal of computer Science & Technology 2017年第1期32卷 199-210页

作者： Xiao-Fang Qi Zi-Yuan Wang Jun-Qiang Mao Peng Wang School of Computer Science and Engineering Southeast University Nanjing 211189 China Key Laboratory of Computer Network and Information Integration Ministry of Education Nanjing 211189 China School of Computer Science and Technology Nanjing University of Posts and Telecommunications Nanjing 210023 China

Recently, testing techniques based on dynamic exploration, which try to automatically exercise every possible user interface element, have been extensively used to facilitate fully testing web applications. Most of such testing tools are however not effective in reaching dynamic pages induced by form interactions due to their emphasis on handling client-side scripting. In this paper, we present a combinatorial strategy to achieve a full form test and build an automated test model. We propose an algorithm called pairwise testing with constraints （PTC） to iraplement the strategy. Our PTC algorithm uses pairwise coverage and handles the issues of semantic constraints and illegal values. We have implemented a prototype tool ComjaxTest and conducted an empirical study on five web applications. Experimental results indicate that our PTC algorithm generates less form test cases while achieving a higher coverage of dynamic pages than the general pairwise testing algorithm. Additionally, our ComjaxTest generates a relatively complete test model and then detects more faults in a reasonable amount of time, as compared with other existing tools based on dynamic exploration.

关键词： automated testing combinatorial testing web application

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：