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

Quantum Learning Based Nonrandom superimposed coding for Secure Wireless Access in 5G URLLC

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2021年 16卷 2429-2444页

作者： Xu, Dongyang Ren, Pinyi Xi An Jiao Tong Univ Sch Informat & Commun Engn Xian 710049 Peoples R China Xi An Jiao Tong Univ Shaanxi Smart Networks & Ubiquitous Access Res Ct Xian 710049 Peoples R China

Secure wireless access in ultra-reliable low-latency communications (URLLC), which is a critical aspect of 5G security, has become increasingly important due to its potential support of grant-free configuration. In grant-free URLLC, precise allocation of different pilot resources to different users that share the same time-frequency resource is essential for the next generation NodeB (gNB) to exactly identify those users under access collision and to maintain precise channel estimation required for reliable data transmission. However, this process easily suffers from attacks on pilots. We in this article propose a quantum learning based nonrandom superimposed coding method to encode and decode pilots on multidimensional resources, such that the uncertainty of attacks can be learned quickly and eliminated precisely. Particularly, multiuser pilots for uplink access are encoded as distinguishable subcarrier activation patterns (SAPs) and gNB decodes pilots of interest from observed SAPs, a superposition of SAPs from access users, by joint design of attack mode detection and user activity detection though a quantum learning network (QLN). We found that the uncertainty lies in the identification process of codeword digits from the attacker, which can be always modelled as a black-box model, resolved by a quantum learning algorithm and quantum circuit. Novel analytical closed-form expressions of failure probability are derived to characterize the reliability of this URLLC system with short packet transmission. Simulations how that our method can bring ultra-high reliability and low latency despite attacks on pilots.

关键词： Ultra reliable low latency communication Encoding Uplink Security Channel estimation 5G mobile communication Reliability 5G URLLC secure access pilot quantum learning superimposed coding

来源：评论

学校读者我要写书评

暂无评论

Comparison of signature file models with superimposed coding

引用

INFORMATION PROCESSING LETTERS 1998年第2期65卷 101-106页

作者： Dervos, D Manolopoulos, Y Linardis, P Aristotelian Univ Salonika Dept Informat GR-54006 Salonika Greece Inst Educ Technol Dept Informat Salonika 54101 Greece

The current study considers the superimposed coding variation of the signature file method (SC-SF). A number of issues which are not clearly specified in the literature are addressed by adopting a unified approach which makes possible the comparison of two SC-SF models. Heuristic analytic derivations of earlier studies are shown to be valid by analysis and calculation. The study identifies a clear advantage of one model over the other, in a way which is quite the opposite to what has been suggested in the past. (C) 1998 Elsevier Science B.V.

关键词： signature file superimposed coding analysis of algorithms

来源：评论

学校读者我要写书评

暂无评论

Generalised hough accumulator space compactification by superimposed coding

引用

Pattern Recognition Letters 1990年第5期11卷 321-329页

作者： Ullmann, Julian R. Department of Computing King's College London Strand London WC2R 2LS United Kingdom

For recognising shifted and rotated images we use a small number, b, of n×n×n Hough accumulator spaces instead of a single N×N×N space, such that bn33. The projection from the N3 space to n3 spaces... 详细信息

For recognising shifted and rotated images we use a small number, b, of n×n×n Hough accumulator spaces instead of a single N×N×N space, such that bn³3. The projection from the N³ space to n³ spaces is via hash functions. Economy is achieved at the cost of unreliability, which has been investigated experimentally. © 1990.

关键词： Generalised Hough transform object recognition pattern matching superimposed coding

来源：评论

学校读者我要写书评

暂无评论

MULTIKEY ACCESS METHODS BASED ON superimposed coding TECHNIQUES

引用

ACM TRANSACTIONS ON DATABASE SYSTEMS 1987年第4期12卷 655-696页

作者： SACKSDAVIS, R KENT, A RAMAMOHANARAO, K UNIV MELBOURNE DEPT COMP SCIPARKVILLEVIC 3052AUSTRALIA

Both single-level and two-level indexed descriptor schemes for multikey retrieval are presented and compared. The descriptors are formed using superimposed coding techniques and stored using a bit-inversion technique. A fast-batch insertion algorithm for which the cost of forming the bit-inverted file is less than one disk access per record is presented. For large data files, it is shown that the two-level implementation is generally more efficient for queries with a small number of matching records. For queries that specify two or more values, there is a potential problem with the two-level implementation in that costs may accrue when blocks of records match the query but individual records within these blocks do not. One approach to overcoming this problem is to set bits in the descriptors based on pairs of indexed terms. This approach is presented and analyzed.

关键词： Descriptors hashing partial match retrieval record signatures superimposed coding

来源：评论

学校读者我要写书评

暂无评论

FRAME-SLICED SIGNATURE FILES

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1992年第3期4卷 281-289页

作者： LIN, Z FALOUTSOS, C UNIV MARYLAND INST ADV COMP STUDIESCOLLEGE PKMD 20742

A new superimposed coding method, frame-sliced signature file, is proposed. Performance of this method is studied and compared with other signature file methods. The response time of the new method is improved due to its ability to effectively partition the signature file so that fewer random disk accesses are required on both retrieval and insertion, while the good characteristics of conventional signature file, i.e., low space overhead, low maintenance cost, and the write-once property, are retained. The generalized version of the method is shown to be a unified framework for several popular signature file methods including the sequential signature file (SSF) method , bit-sliced signature file (BSSF) method, and its enhanced version of B'SSF. A prototype system based on the proposed methods were implemented on Unix workstations with the C language. We presented experimental results on a 2.8-Mb database consisting of 2800 technical reports, and a 28-Mb database with 28 000 technical reports. Results from experiments agree well with the theoretical analysis. Particularly, the average response time measured by a real-time clock for a single word query is 127 ms for the 2.8-Mbyte database, and 720 ms for the 28-Mbyte database, with 18% space overhead, on a Unix workstation without buffering.

关键词： INFORMATION RETRIEVAL HASHING OPTICAL DISKS PERFORMANCE SIGNATURE FILE superimposed coding TEXT SEARCH

来源：评论

学校读者我要写书评

暂无评论

Bayesian Learning for Double-RIS Aided ISAC Systems With superimposed Pilots and Data

引用

IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING 2024年第5期18卷 766-781页

作者： Gan, Xu Huang, Chongwen Yang, Zhaohui Zhong, Caijun Chen, Xiaoming Zhang, Zhaoyang Guo, Qinghua Yuen, Chau Debbah, Merouane Zhejiang Univ Hangzhou Coll Informat Sci & Elect Engn Hangzhou 310027 Peoples R China Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Peoples R China Zhejiang Prov Key Lab Info Proc Commun & Netw IPCA Hangzhou 310027 Peoples R China Univ Wollongong Sch Elect Comp & Telecommun Engn Wollongong NSW 2522 Australia Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore Khalifa Univ Sci & Technol KU Res Ctr 6G Abu Dhabi 127788 U Arab Emirates Univ Paris Saclay Cent Supelec F-91192 Gif Sur Yvette France

Reconfigurable intelligent surface (RIS) has great potential to improve the performance of integrated sensing and communication (ISAC) systems, especially in scenarios where line-of-sight paths between the base station and users are blocked. However, the spectral efficiency (SE) of RIS-aided ISAC uplink transmissions may be drastically reduced by the heavy burden of pilot overhead for realizing sensing capabilities. In this paper, we tackle this bottleneck by proposing a superimposed symbol scheme, which superimposes sensing pilots onto data symbols over the same time-frequency resources. Specifically, we develop a structure-aware sparse Bayesian learning framework, where decoded data symbols serve as side information to enhance sensing performance and increase SE. To meet the low-latency requirements of emerging ISAC applications, we further propose a low-complexity simultaneous communication and localization algorithm for multiple users. This algorithm employs the unitary approximate message passing in the Bayesian learning framework for initial angle estimate, followed by iterative refinements through reduced-dimension matrix calculations. Moreover, the sparse code multiple access technology is incorporated into this iterative framework for accurate data detection which also facilitates localization. Numerical results show that the proposed superimposed symbol-based scheme empowered by the developed algorithm can achieve centimeter-level localization while attaining up to 96% of the SE of conventional communications without sensing capabilities. Moreover, compared to other typical ISAC schemes, the proposed superimposed symbol scheme can provide an effective throughput improvement over 133%.

关键词： Sensors Location awareness Symbols Uplink Millimeter wave communication Reconfigurable intelligent surfaces Channel estimation Integrated sensing and communication (ISAC) reconfigurable intelligent surface (RIS) superimposed coding Bayesian learning unitary approximate message passing (UAMP)

来源：评论

学校读者我要写书评

暂无评论

Distributed associative memories for high-speed symbolic reasoning

引用

FUZZY SETS AND SYSTEMS 1996年第2期82卷 223-233页

作者： Austin, J Department of Computer Science Advanced Computer Architecture Group University of York York YO1 5DD UK

This paper briefly introduces a novel symbolic reasoning system based upon distributed associative memories which are constructed from correlation matrix memories (CMM). The system is aimed at high-speed rule-based symbolic operations. It has the advantage of very fast rule matching without the long training times normally associated with neural-network-based symbolic manipulation systems. In particular, the network is able to perform partial matching on symbolic information at high speed. As such, the system is aimed at the practical use of neural networks in high-speed reasoning systems. The paper describes the advantages and disadvantages of using CMM and shows how the approach overcomes those disadvantages. It then briefly describes a system incorporating CMM.

关键词： neural networks associative memory superimposed coding rule-based systems

来源：评论

学校读者我要写书评

暂无评论

Asymptotic bounds for the rate of colored superimposed codes

引用

PROBLEMS OF INFORMATION TRANSMISSION 2008年第2期44卷 112-118页

作者： Lebedev, V. S. RAS Kharkevich Inst Informat Transmiss Problems Moscow 117901 Russia

We introduce the notion of a q-ary (r (0), r (1), ..., r (q-1)) superimposed code. We obtain upper and lower asymptotic bounds for the rate of these (colored) codes.

关键词： COMMUNICATING Bound secret key Keys Locks superimposed coding

来源：评论

学校读者我要写书评

暂无评论

A two-level signature file based on a block-oriented data model for spatial match retrieval

引用

JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS 1998年第4期21卷 467-478页

作者： Chang, CC Lee, CF Natl Chung Cheng Univ Dept Comp Sci & Informat Engn Chiayi 621 Taiwan

Signature file methods have good retrieval properties and require little storage overhead. Applying a signature file method to the retrieval of images from iconic image databases can reduce the number of blocks to be examined when answering a query and can thus save processing time. The main concern in the construction of signature files is how to minimize the average false drop rate to avoid unnecessary accesses. In this paper, we propose a two-level signature file system for spatial match retrieval based on a block-oriented data model. An algorithm is presented to determine a set of good integer solutions in the signature size assignment problem. In addition, our signature file system has taken into consideration a flexible solution to the false drop problem and other realistic factors.

关键词： spatial relations 2-D string false drop superimposed coding

来源：评论

学校读者我要写书评

暂无评论

Distributed broadcast in radio networks of unknown topology

引用

THEORETICAL COMPUTER SCIENCE 2003年第1-3期302卷 337-364页

作者： Clementi, AEF Monti, A Silvestri, R Univ Roma Tor Vergata Dipartimento Matemat I-00133 Rome Italy Univ Roma La Sapienza Dipartimento Informat Rome Italy

A multi-hop synchronous radio network is said to be unknown if the nodes have no knowledge of the topology. A basic task in radio network is that of broadcasting a message (created by a fixed source node) to all nodes of the network. Typical operations in real-life radio networks is the multi-broadcast that consists in performing a set of r independent broadcasts. The study of broadcast operations on unknown radio network is started by the seminal paper of Bar-Yehuda et al. [J. Comput. System Sci. 45 (1992) 104] and has been the subject of several recent works. In this paper, we study the completion and the termination time of distributed protocols for both the (single) broadcast and the multi-broadcast operations on unknown networks as functions of the number of nodes n, the maximum eccentricity D, the maximum in-degree Delta, and the congestion c of the networks. We establish new connections between these operations and some combinatorial concepts, such as selective families, strongly selective families (also known as superimposed codes), and pairwise r-different families. Such connections, combined with a set of new lower and upper bounds on the size of the above families, allow us to derive new lower bounds and new distributed protocols for the broadcast and multi-broadcast operations. In particular, our upper bounds are almost tight and strongly improve over the previous bounds for a large class of networks. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： Time Families topology Upper bound distributed protocol superimposed coding Radio networks Surgery Lower bound Unknown Ganglia Radio Network broadcasting family

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：