面向Ad-Hoc协作的局部观测重建方法

在多智能体强化学习的研究中,如何进行Ad-Hoc协作,也就是说如何适应种类和数量变化的队友,是一个关键问题。现有方法或者有很强的先验知识假设,或者使用硬编码的规则进行合作,缺乏通用性,无法泛化到更一般的Ad-Hoc协作场景。为解决该问题,提出一种面向Ad-Hoc协作的局部观测重建算法,利用注意力机制和采样网络对局部观测进行重建,使得算法认识到并充分利用不同局面中的高维状态表征,实现了在Ad-Hoc协作场景下的零样本泛化。在星际争霸微操环境和Ad-Hoc协作场景上与代表性算法的性能进行对比与分析,验证了算法的有效性。

VKFQ:A Verifiable Keyword Frequency Query Framework with Local Differential Privacy in Blockchain

With its untameable and traceable properties,blockchain technology has been widely used in the field of data sharing.How to preserve individual privacy while enabling efficient data queries is one of the primary issues with secure data sharing.In this paper,we study verifiable keyword frequency(KF)queries with local differential privacy in blockchain.Both the numerical and the keyword attributes are present in data objects;the latter are sensitive and require privacy protection.However,prior studies in blockchain have the problem of trilemma in privacy protection and are unable to handle KF queries.We propose an efficient framework that protects data owners’privacy on keyword attributes while enabling quick and verifiable query processing for KF queries.The framework computes an estimate of a keyword’s frequency and is efficient in query time and verification object(VO)size.A utility-optimized local differential privacy technique is used for privacy protection.The data owner adds noise locally into data based on local differential privacy so that the attacker cannot infer the owner of the keywords while keeping the difference in the probability distribution of the KF within the privacy budget.We propose the VB-cm tree as the authenticated data structure(ADS).The VB-cm tree combines the Verkle tree and the Count-Min sketch(CM-sketch)to lower the VO size and query time.The VB-cm tree uses the vector commitment to verify the query results.The fixed-size CM-sketch,which summarizes the frequency of multiple keywords,is used to estimate the KF via hashing operations.We conduct an extensive evaluation of the proposed framework.The experimental results show that compared to theMerkle B+tree,the query time is reduced by 52.38%,and the VO size is reduced by more than one order of magnitude.

Learned Distributed Query Optimizer:Architecture and Challenges

The query processing in distributed database management systems(DBMS)faces more challenges,such as more operators,and more factors in cost models and meta-data,than that in a single-node DMBS,in which query optimization is already an NP-hard problem.Learned query optimizers(mainly in the single-node DBMS)receive attention due to its capability to capture data distributions and flexible ways to avoid hard-craft rules in refinement and adaptation to new hardware.In this paper,we focus on extensions of learned query optimizers to distributed DBMSs.Specifically,we propose one possible but general architecture of the learned query optimizer in the distributed context and highlight differences from the learned optimizer in the single-node ones.In addition,we discuss the challenges and possible solutions.

A Systematic Review of Automated Classification for Simple and Complex Query SQL on NoSQL Database

A data lake(DL),abbreviated as DL,denotes a vast reservoir or repository of data.It accumulates substantial volumes of data and employs advanced analytics to correlate data from diverse origins containing various forms of semi-structured,structured,and unstructured information.These systems use a flat architecture and run different types of data analytics.NoSQL databases are nontabular and store data in a different manner than the relational table.NoSQL databases come in various forms,including key-value pairs,documents,wide columns,and graphs,each based on its data model.They offer simpler scalability and generally outperform traditional relational databases.While NoSQL databases can store diverse data types,they lack full support for atomicity,consistency,isolation,and durability features found in relational databases.Consequently,employing machine learning approaches becomes necessary to categorize complex structured query language(SQL)queries.Results indicate that the most frequently used automatic classification technique in processing SQL queries on NoSQL databases is machine learning-based classification.Overall,this study provides an overview of the automatic classification techniques used in processing SQL queries on NoSQL databases.Understanding these techniques can aid in the development of effective and efficient NoSQL database applications.

Large Language Model Based Semantic Parsing for Intelligent Database Query Engine

With the rapid development of artificial intelligence, large language models (LLMs) have demonstrated remarkable capabilities in natural language understanding and generation. These models have great potential to enhance database query systems, enabling more intuitive and semantic query mechanisms. Our model leverages LLM’s deep learning architecture to interpret and process natural language queries and translate them into accurate database queries. The system integrates an LLM-powered semantic parser that translates user input into structured queries that can be understood by the database management system. First, the user query is pre-processed, the text is normalized, and the ambiguity is removed. This is followed by semantic parsing, where the LLM interprets the pre-processed text and identifies key entities and relationships. This is followed by query generation, which converts the parsed information into a structured query format and tailors it to the target database schema. Finally, there is query execution and feedback, where the resulting query is executed on the database and the results are returned to the user. The system also provides feedback mechanisms to improve and optimize future query interpretations. By using advanced LLMs for model implementation and fine-tuning on diverse datasets, the experimental results show that the proposed method significantly improves the accuracy and usability of database queries, making data retrieval easy for users without specialized knowledge.

A Database Querying Language for Formulating Relational Queries on Small Devices

For small devices like the PDAs and mobile phones, formulation of relational database queries is not as simple as using conventional devices such as the personal computers and laptops. Due to the restricted size and resources of these smaller devices, current works mostly limit the queries that can be posed by users by having them predetermined by the developers. This limits the capability of these devices in supporting robust queries. Hence, this paper proposes a universal relation based database querying language which is targeted for small devices. The language allows formulation of relational database queries that uses minimal query terms. The formulation of the language and its structure will be described and usability test results will be presented to support the effectiveness of the language.

Exploring features for automatic identification of news queries through query logs

Purpose:Existing researches of predicting queries with news intents have tried to extract the classification features from external knowledge bases,this paper tries to present how to apply features extracted from query logs for automatic identification of news queries without using any external resources.Design/methodology/approach:First,we manually labeled 1,220 news queries from Sogou.com.Based on the analysis of these queries,we then identified three features of news queries in terms of query content,time of query occurrence and user click behavior.Afterwards,we used 12 effective features proposed in literature as baseline and conducted experiments based on the support vector machine(SVM)classifier.Finally,we compared the impacts of the features used in this paper on the identification of news queries.Findings:Compared with baseline features,the F-score has been improved from 0.6414 to0.8368 after the use of three newly-identified features,among which the burst point(bst)was the most effective while predicting news queries.In addition,query expression(qes)was more useful than query terms,and among the click behavior-based features,news URL was the most effective one.Research limitations:Analyses based on features extracted from query logs might lead to produce limited results.Instead of short queries,the segmentation tool used in this study has been more widely applied for long texts.Practical implications:The research will be helpful for general-purpose search engines to address search intents for news events.Originality/value:Our approach provides a new and different perspective in recognizing queries with news intent without such large news corpora as blogs or Twitter.

Ad-Hoc传感网络在智慧化露天矿山的应用

阐述了智慧化露天矿山的含义、标准,分析了智慧化露天矿的模块架构;以无线Ad-Hoc技术为载体对模块架构进行设计,利用无线传感网络对矿山进行实时感知、管理及控制。结果表明:无线Ad-Hoc传感网络技术以其投资少、自适应多种复杂环境的优势,必将带动矿业的长效发展,同时也将大力提升我国构建智慧化矿山的进程。

Query Optimization Framework for Graph Database in Cloud Dew Environment

The query optimizer uses cost-based optimization to create an execution plan with the least cost,which also consumes the least amount of resources.The challenge of query optimization for relational database systems is a combinatorial optimization problem,which renders exhaustive search impossible as query sizes rise.Increases in CPU performance have surpassed main memory,and disk access speeds in recent decades,allowing data compression to be used—strategies for improving database performance systems.For performance enhancement,compression and query optimization are the two most factors.Compression reduces the volume of data,whereas query optimization minimizes execution time.Compressing the database reduces memory requirement,data takes less time to load into memory,fewer buffer missing occur,and the size of intermediate results is more diminutive.This paper performed query optimization on the graph database in a cloud dew environment by considering,which requires less time to execute a query.The factors compression and query optimization improve the performance of the databases.This research compares the performance of MySQL and Neo4j databases in terms of memory usage and execution time running on cloud dew servers.

Application of Recursive Query on Structured Query Language Server

The advantage of recursive programming is that it is very easy to write and it only requires very few lines of code if done correctly.Structured query language(SQL)is a database language and is used to manipulate data.In Microsoft SQL Server 2000,recursive queries are implemented to retrieve data which is presented in a hierarchical format,but this way has its disadvantages.Common table expression(CTE)construction introduced in Microsoft SQL Server 2005 provides the significant advantage of being able to reference itself to create a recursive CTE.Hierarchical data structures,organizational charts and other parent-child table relationship reports can easily benefit from the use of recursive CTEs.The recursive query is illustrated and implemented on some simple hierarchical data.In addition,one business case study is brought forward and the solution using recursive query based on CTE is shown.At the same time,stored procedures are programmed to do the recursion in SQL.Test results show that recursive queries based on CTEs bring us the chance to create much more complex queries while retaining a much simpler syntax.

LSTDA: Link Stability and Transmission Delay Aware Routing Mechanism for Flying Ad-Hoc Network (FANET)

The paper presents a new protocol called Link Stability and Transmission Delay Aware(LSTDA)for Flying Adhoc Network(FANET)with a focus on network corridors(NC).FANET consists of Unmanned Aerial Vehicles(UAVs)that face challenges in avoiding transmission loss and delay while ensuring stable communication.The proposed protocol introduces a novel link stability with network corridors priority node selection to check and ensure fair communication in the entire network.The protocol uses a Red-Black(R-B)tree to achieve maximum channel utilization and an advanced relay approach.The paper evaluates LSTDA in terms of End-to-End Delay(E2ED),Packet Delivery Ratio(PDR),Network Lifetime(NLT),and Transmission Loss(TL),and compares it with existing methods such as Link Stability Estimation-based Routing(LEPR),Distributed Priority Tree-based Routing(DPTR),and Delay and Link Stability Aware(DLSA)using MATLAB simulations.The results show that LSTDA outperforms the other protocols,with lower average delay,higher average PDR,longer average NLT,and comparable average TL.

Visible-infrared person re-identification using query related cluster

Visible-infrared person re-identification(VIPR), is a cross-modal retrieval task that searches a target from a gallery captured by cameras of different spectrums.The severe challenge for VIPR is the large intra-class variation caused by the modal discrepancy between visible and infrared images.For that, this paper proposes a query related cluster(QRC) method for VIPR.Firstly, this paper uses an attention mechanism to calculate the similarity relation between a visible query and infrared images with the same identity in the gallery.Secondly, those infrared images with the same query images are aggregated by using the similarity relation to form a dynamic clustering center corresponding to the query image.Thirdly, QRC loss function is designed to enlarge the similarity between the query image and its dynamic cluster center to achieve query related clustering, so as to compact the intra-class variations.Consequently, in the proposed QRC method, each query has its own dynamic clustering center, which can well characterize intra-class variations in VIPR.Experimental results demonstrate that the proposed QRC method is superior to many state-of-the-art approaches, acquiring a 90.77% rank-1 identification rate on the RegDB dataset.

Multi-Agent Deep Reinforcement Learning for Cross-Layer Scheduling in Mobile Ad-Hoc Networks

Due to the fading characteristics of wireless channels and the burstiness of data traffic,how to deal with congestion in Ad-hoc networks with effective algorithms is still open and challenging.In this paper,we focus on enabling congestion control to minimize network transmission delays through flexible power control.To effectively solve the congestion problem,we propose a distributed cross-layer scheduling algorithm,which is empowered by graph-based multi-agent deep reinforcement learning.The transmit power is adaptively adjusted in real-time by our algorithm based only on local information(i.e.,channel state information and queue length)and local communication(i.e.,information exchanged with neighbors).Moreover,the training complexity of the algorithm is low due to the regional cooperation based on the graph attention network.In the evaluation,we show that our algorithm can reduce the transmission delay of data flow under severe signal interference and drastically changing channel states,and demonstrate the adaptability and stability in different topologies.The method is general and can be extended to various types of topologies.

A Collaborative Approach for Secured Routing in Mobile Ad-Hoc Network

Mobile computing is the most powerful application for network com-munication and connectivity,given recent breakthroughs in thefield of wireless networks or Mobile Ad-hoc networks(MANETs).There are several obstacles that effective networks confront and the networks must be able to transport data from one system to another with adequate precision.For most applications,a frame-work must ensure that the retrieved data reflects the transmitted data.Before driv-ing to other nodes,if the frame between the two nodes is deformed in the data-link layer,it must be repaired.Most link-layer protocols immediately disregard the frame and enable the high-layer protocols to transmit it down.In other words,because of asset information must be secured from threats,information is a valu-able resource.In MANETs,some applications necessitate the use of a network method for detecting and blocking these assaults.Building a secure intrusion detection system in the network,which provides security to the nodes and route paths in the network,is a major difficulty in MANET.Attacks on the network can jeopardize security issues discovered by the intrusion detection system engine,which are then blocked by the network’s intrusion prevention engine.By bringing the Secure Intrusion Detection System(S-IDS)into the network,a new technique for implementing security goals and preventing attacks will be developed.The Secure Energy Routing(SER)protocol for MANETs is introduced in this study.The protocol addresses the issue of network security by detecting and preventing attacks in the network.The data transmission in the MANET is forwarded using Elliptical Curve Cryptography(ECC)with an objective to improve the level of security.Network Simulator–2 is used to simulate the network and experiments are compared with existing methods.

Decentralized content sharing in mobile ad-hoc networks:A survey

The evolution of smart mobile devices has significantly impacted the way we generate and share contents and introduced a huge volume of Internet traffic.To address this issue and take advantage of the short-range communication capabilities of smart mobile devices,the decentralized content sharing approach has emerged as a suitable and promising alternative.Decentralized content sharing uses a peer-to-peer network among colocated smart mobile device users to fulfil content requests.Several articles have been published to date to address its different aspects including group management,interest extraction,message forwarding,participation incentive,and content replication.This survey paper summarizes and critically analyzes recent advancements in decentralized content sharing and highlights potential research issues that need further consideration.

面向云边端协同的多模态数据建模技术及其应用

云边端协同架构中数据类型多样,各级存储资源与计算资源存在差异,给数据管理带来新的挑战.现有数据模型或者数据模型的简单叠加,都难以同时满足云边端中多模态数据管理和协同管理需求.因此,研究面向云边端协同的多模态数据建模技术成为重要问题.其核心在于,如何高效地从云边端三层架构中得到满足应用所需的查询结果.从云边端三层数据的数据类型出发,提出了面向云边端协同的多模态数据建模技术,给出了基于元组的多模态数据模型定义,设计了6种基类,解决多模态数据统一表征困难的问题;提出了云边端协同查询的基本数据操作体系,以满足云边端业务场景的查询需求;给出了多模态数据模型的完整性约束,为查询优化奠定了理论基础.最后,给出了面向云边端协同多模态数据模型的示范应用,并从数据存储时间、存储空间和查询时间这3个方面对所提出的数据模型存储方法进行了验证.实验结果表明,所提方案能够有效地表示云边端协同架构中的多模态数据.

基于Ad-Hoc网络的物联网数据采集系统设计

在物联网系统中,需要终端设备采集数据并上传到服务器中进行计算和处理。如果终端设备中的通信模块信号不好或者出现异常情况,使得数据无法及时的上传到服务器中,会极大地影响到系统的正常工作。针对该上传异常情况,提出一种基于Ad-Hoc网络的系统方案。在终端设备原有的网络中增加一个Wi-Fi模块,用于终端设备之间组建Ad-Hoc网络,当一个设备的数据上传模块出现异常时,可以把数据通过Ad-Hoc网络发送到该网络中的其他设备上,并通过其他设备的数据上传模块,把实时数据上传到服务器中。通过测试表明,该方案能够把原来不能上传成功的数据通过Ad-Hoc网络及时上传到服务器中,保障了系统的稳定运行。

车联网POI查询中的位置隐私和查询隐私联合保护机制

在车联网中,基于位置的服务(LBS)的兴趣点(POI)查询被广泛用于车载应用中。但是,由于攻击者容易获取车辆位置、查询内容以及其它额外信息,单独对位置隐私或查询隐私进行保护很难保障车载用户的隐私安全,使得对位置隐私和查询隐私开展联合保护越发关键。为此,该文提出一种基于虚拟序列的位置隐私和查询隐私联合保护机制。首先根据POI查询的限制,分析位置隐私和查询隐私的相关性,运用欧几里得距离和关联规则算法对其建模描述,得到相关性判断模型;然后基于虚拟序列,根据影响隐私保护的因素和真实查询的相关性值,将联合保护转化为虚拟序列的选择问题,建立联合保护优化模型,得到匿名程度高且匿名区域大的匿名查询集,防止攻击者识别出真实查询。最后,实验结果表明,与现有方案相比,所提联合保护机制能抵御针对位置隐私和查询隐私的联合攻击(语义范围攻击、时间关联攻击和长期观察攻击),能更有效地保护用户的LBS隐私。

GPU数据库实现技术发展演进

爆炸式增长的数据对存储和处理数据提出了更高的需求,GPU数据库作为新硬件数据库的一个重要分支,在大容量和高性能处理方面有其独特的优势.GPU数据库作为高性能数据库的代表,在最近几年受到学术界和产业界的关注,一批具有代表性的研究成果和标志性的实际产品已经出现.GPU数据库的技术发展按照GPU加速型和GPU内存型两种技术路线展开.两种技术路线都有相应的原型系统或产品出现.虽然两种GPU数据库的发展路线在实现上有所不同,但GPU数据库最基本的功能部分和核心技术是相似的,都有查询编译、查询优化、查询执行以及存储管理等功能.当前主流的数据传输方案除了PCIe之外,NVLink、RDMA和CXL等传输方案也为不同处理器之间的数据传输提供了更多的可能性.大多数GPU数据库使用列存储模型来存储数据,少数GPU数据库(如PG-Strom)对两种存储模型都支持.在列存储模型上利用压缩技术能减少数据的存储空间和传输时延.在GPU数据库上进行的压缩和解压的时间应该在整个数据处理的过程中占比很少.在GPU数据库上建立和维护索引不应该有很大的系统开销.JIT编译时间短、编译效率高,是GPU数据库编译的主流.操作符对数据库查询性能的影响非常明显,连接操作、分组聚集和OLAP运算符是目前研究最多的三个类型.目前大多数的研究中,连接和分组聚集算子通常结合在一起研究.在连接算子执行的过程中还和表的连接顺序结合在一起进行考虑.OLAP算子是GPU数据库中的又一个被大量研究的算子,GPU数据库在OLAP算子和模型方面持续受到研究者的关注.GPU数据库有三种查询处理模型,即行处理、列处理和向量化处理.向量化处理和列处理在实际系统中应用较多.由于GPU加速型数据库技术的发展,CPU-GPU协同处理模型上的查询方案与查询引擎也有一定数量的研究成果出现.当前GPU数据库的查询优化研究主要有三部分:多表连接顺序、查询重写和代价模型.然而,GPU数据库的代价评估模型在目前还没有很好的解决方案,GPU数据库的查询优化在未来仍有很大的研究空间.事务在GPU数据库中没有得到很好的研究,尽管有单独的原型系统,但目前的研究还没有取得重大进展.本文总结了GPU数据库各种关键技术已有的研究成果,指出GPU数据库当前存在的问题和面临的挑战,对未来的研究方向进行了展望.

基于MPR算法的Ad-Hoc网络多跳语音通信方案设计

针对语音通信的实时性特点,在50 kHz带宽的超短波(Very High Frequency,VHF)通信信道上采用动态时分复用接入、高压缩语音编码方式,基于多点中继(Multipoint Relaying,MPR)广播协议的Ad-Hoc网络,提出一种低延时高覆盖率的多跳语音广播通信方案,以满足应急、户外探险以及军用班排级团队的无线通信需求。