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

A novel RSA algorithm for secured key transmission in a centralized cloud environment

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2020年第5期33卷 e4280-e4280页

作者： Ambika, S. Rajakumar, S. Anakath, A. S. Univ Coll Engn Ariyalur Comp Sci & Engn Ariyalur India Univ Coll Engn Ariyalur Dept Math Ariyalur India EGS Pillay Engn Coll Sch Comp Nagapattinam India

Cloud computing has been gaining widespread significance in recent times, especially with the advent of state-of-the-art communication technologies and data-handling systems. Large volumes of data are being handled in real time and their availability is made feasible to consumers in an efficient manner through cloud computing networks. However, security of such data being transferred through clouds characterized in a centralized configuration is of prime concern, which has been investigated in this research paper. Secured transmission of data through a secured key transmission using appropriate authentication mechanism has been the driving force behind the research carried out in this paper. In order to resolve the existing issues in clouds in terms of computational as well as storage complexities, a secure key transmission Rivest-Shamir-Adleman (SKT-RSA) protocol is proposed based on the secure key transmission. Key distribution between the certified authority and the end user is proposed. The proposed protocol is a tree-based cluster key distribution scheme.

关键词： cloud computing computation complexity key distribution key transmission storage complexity wireless networks

来源：评论

学校读者我要写书评

暂无评论

EAdderSR: enhanced AdderSR for single image super resolution

引用

APPLIED INTELLIGENCE 2023年第18期53卷 20998-21011页

作者： Song, Jie Yi, Huawei Xu, Wenqian Li, Xiaohui Li, Bo Liu, Yuanyuan Liaoning Univ Technol Sch Elect & Informat Engn Jinzhou 121001 Peoples R China Dalian Univ Key Lab Adv Design & Intelligent Comp Minist Educ Dalian 116622 Peoples R China

Replacing multiplication with addition can effectively reduce the computational complexity. Based on this idea, adder neural networks (AdderNets) are proposed. Thereafter, AdderNets are applied to super-resolution (SR) task to obtain AdderSR, which significantly reduces the energy consumption caused by SR models. However, the weak fitting ability of AdderNets makes AdderSR only applicable to the low-complexity pixel-wise loss, and the performance of the model drops sharply when the high-complexity perceptual loss is used. Enhanced AdderSR (EAdderSR) is proposed to overcome the limitations of AdderSR in SR tasks. Specifically, current adder networks have serious gradient precision loss problem, which affects the training stability. The normalization layer is adjusted to normalize the output of the adder layer to a reasonably narrow range, which can reduce the amount of precision loss. Then, a coarse-grained knowledge distillation (CGKD) method is developed to give adder networks an efficient guidance to reduce the fitting burden. The experimental results show that the proposed method not only further improves the performance of adder networks, but also ensures the quality of the output results when the complexity of the loss function increases.

关键词： Super resolution Adder neural network computation complexity Knowledge distillation

来源：评论

学校读者我要写书评

暂无评论

Beamspace reduced-dimension space-time adaptive processing for multiple-input multiple-output radar based on maximum cross-correlation energy

引用

IET RADAR SONAR AND NAVIGATION 2015年第7期9卷 772-777页

作者： Zhang, Wei He, Zishu Li, Jun Li, Chaohai Univ Elect Sci & Technol China Sch Elect Engn Chengdu 610054 Peoples R China

A new method for selecting auxiliary channels in reduced-dimension space-time adaptive processing (STAP) based on maximum cross-correlation energy has been proposed for airborne multiple-input multiple-output radar. It is demonstrated that the proposed algorithm can achieve the same output signal-to-interference-noise ratio (SINR) performance as the multistage multiple-beam STAP algorithm which can assure the optimal performance when the number of auxiliary channels is fixed, but the auxiliary channels selecting process of the proposed algorithm is extremely simplified. Hence, the computation complexity is reduced dramatically. Practical considerations dictate that only the minimum number of auxiliary channels [(adaptive degrees of freedom (DoFs)] is required to achieve the desired array performance. The proposed approach can achieve the desired output signal-to-interference-noise performance with the minimum number of auxiliary channels. Consequently, the proposed approach can reduce the requirement of the sample support dramatically. It is demonstrated that the SINR loss will be <3 dB when only one channel is selected as the auxiliary channel. Generally, two to three channels are enough even when the clutter covariance matrix is unknown. This will be more obvious advantage when the number of independent and identically distributed secondary samples is limited. The reduction in DoFs can make the proposed approach more suitable for the practical clutter environments.

关键词： MIMO radar array signal processing correlation methods airborne radar computational complexity radar clutter covariance matrices multiple input multiple output radar beamspace reduced-dimension space time adaptive processing maximum cross correlation energy auxiliary channels airborne radar signal-to-interference–noise ratio SINR multistage multiple-beam STAP computation complexity array performance clutter covariance matrix clutter environments

来源：评论

学校读者我要写书评

暂无评论

Optimal Power Allocation for Low complexity Channel Estimation and Symbol Detection Using Superimposed Training

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2019年第5期E102B卷 1027-1036页

作者： Wang, Qingbo Dou, Gaoqi Gao, Jun He, Xianwen Naval Univ Engn Dept Commun Engn Wuhan Hubei Peoples R China

A low complexity channel estimation scheme using datadependent superimposed training (DDST) is proposed in this paper, where the pilots are inserted in more than one block, rather than the single block of the original DDST. Comparing with the original DDST (which improves the performance of channel estimation at the cost of huge computational overheads), the proposed DDST scheme improves the performance of channel estimation with only a slight increase in the consumption of computation resources. The optimal precoder is designed to minimize the data distortion caused by the rank-deficient precoding. The optimal pilots and placement are also provided to improve the performance of channel estimation. In addition, the impact of power allocation between the data and pilots on symbol detection is analyzed, the optimal power allocation scheme is derived to maximize the effective signal-to-noise ratio at the receiver. Simulation results are presented to show the computational advantage of the proposed scheme, and the advantages of the optimal pilots and power allocation scheme.

关键词： channel estimation superimposed training computation complexity power allocation

来源：评论

学校读者我要写书评

暂无评论

Deep ReLU neural networks in high-dimensional approximation

引用

NEURAL NETWORKS 2021年 142卷 619-635页

作者： Dung, Dinh Nguyen, Van Kien Vietnam Natl Univ Informat Technol Inst Hanoi 144 Xuan Thuy Hanoi Vietnam Univ Transport & Commun Fac Basic Sci 3 Cau Giay St Hanoi Vietnam

We study the computation complexity of deep ReLU (Rectified Linear Unit) neural networks for the approximation of functions from the Holder-Zygmund space of mixed smoothness defined on the d-dimensional unit cube when the dimension d may be very large. The approximation error is measured in the norm of isotropic Sobolev space. For every function f from the Holder-Zygmund space of mixed smoothness, we explicitly construct a deep ReLU neural network having an output that approximates f with a prescribed accuracy epsilon, and prove tight dimension-dependent upper and lower bounds of the computation complexity of the approximation, characterized as the size and depth of this deep ReLU neural network, explicitly in d and epsilon. The proof of these results in particular, relies on the approximation by sparse-grid sampling recovery based on the Faber series. (C) 2021 Elsevier Ltd. All rights reserved.

关键词： Deep ReLU neural network computation complexity High-dimensional approximation Sparse-grid sampling Continuous piece-wise linear functions Holder-Zygmund space of mixed smoothness

来源：评论

学校读者我要写书评

暂无评论

computationally efficient and secure anonymous authentication scheme for cloud users

引用

PERSONAL AND UBIQUITOUS COMPUTING 2021年第1期28卷 111-121页

作者： Arasan, Anakath Sadaiyandi, Rajakumar Al-Turjman, Fadi Rajasekaran, Arun Sekar Karuppuswamy, Kalai Selvi EGS Pillay Engn Coll Sch Comp Nagapattinam TN India Univ Coll Engn Ariyalur Dept Math Ariyalur TN India Near East Univ Res Ctr AI & IoT Artificial Intelligence Engn Dept 10 Mersin Nicosia Turkey GMR Inst Technol Dept ECE Rajam Andhra Pradesh India SNS Coll Technol Coimbatore 35 Tamil Nadu India

In cloud computing, the combinations of various computing units are globally separated, however, electronically connected. In recent years, the number of cloud users has adequately increased in the modern societies. In order to restrict the illegal access of the intruders, a strong user authentication is required for cloud computing environment. In this regard, in this paper, we came up with a computationally productive and safer anonymous authentication pattern for cloud users. Moreover, in our scheme, mutual authentication is performed in an anonymous way between the cloud user and the cloud server to strongly verify the legitimacy of each user before providing an access into the cloud. After the successful anonymous mutual authentication, the targeted cloud service provider and the cloud users make mutual communication between them. In case of any misbehaviouring after successful mutual authentication, an efficient revocation mechanism is proposed through which the trusted third party (TTP) can revoke the cloud users or service providers from the cloud environment. Even though there were many anonymous cloud computing authentication schemes, the previously proposed authentication schemes suffered from high computational cost during certificate verification. Moreover, the section related to analysis proves that the explained scheme is robust enough in terms of security strength to avoid various security attacks and breeches.

关键词： Authentication computation complexity Privacy Conditional tracking Data integrity

来源：评论

学校读者我要写书评

暂无评论

Two secret sharing schemes based on Boolean operations

引用

PATTERN RECOGNITION 2007年第10期40卷 2776-2785页

作者： Wang, Daoshun Zhang, Lei Ma, Ning Li, Xiaobo Tsinghua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China Univ Alberta Dept Comp Sci Edmonton AB Canada

Traditional secret sharing schemes involve complex computation. A visual secret sharing (VSS) scheme decodes the secret without computation, but each shadow is m times as big as the original. Probabilistic VSS solved the computation complexity and space complexity problems at once. In this paper we propose a probabilistic (2, n) scheme for binary images and a deterministic (n, n) scheme for grayscale images. Both use simple Boolean operations and both have no pixel expansion. The (2, n) scheme provides a better contrast and significantly smaller recognized areas than other methods. The (n, n) scheme gives an exact reconstruction. (c) 2006 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

关键词： secret sharing scheme visual secret sharing visual cryptography computation complexity pixel expansion

来源：评论

学校读者我要写书评

暂无评论

Joint frequency and two-dimensional direction of arrival estimation for Electronic Support systems based on sub-Nyquist sampling

引用

IET RADAR SONAR AND NAVIGATION 2018年第8期12卷 889-899页

作者： Ramezani, Esmaeil Sabahi, Mohamad Farzan Saberali, Seyyed Mohammad Univ Isfahan Dept Elect Engn Esfahan Iran

The electronic support (ES) receivers require wide instantaneous bandwidth as a result of a wide-frequency range of modern radar signals. Thus, analogue-to-digital converters (ADCs) with high sampling rates are required for digital ES receivers. One of the bottlenecks in designing such systems is the high power consumption of the back-end ADCs at high sampling rates. In this study, a system-level approach with the goal of minimising the required digitisation rate is presented by exploiting compressive sampling. Using the proposed receiver structure, the location finding of pulsed radars in wideband scenarios is studied. To fulfil the need for frequency and position finding, the proposed receiver employs a three-dimensional antenna array, followed by radio-frequency back-end and ADC blocks, inspired by the modulated wideband converter technique. Furthermore, an algorithm based on Bayesian compressed sensing, incorporating off-grid techniques, is employed to jointly estimate the azimuth and the elevation angles of incoming signals, as well as their carrier frequencies. Simulation results are provided to support the theoretical results obtained in this study. The results show that the proposed off-grid Bayesian method has a significantly lower mean square estimation error than the conventional deterministic approaches, while its average computation complexity can be reduced in multi-snapshot scenarios.

关键词： direction-of-arrival estimation electronic warfare radar antennas antenna arrays radionavigation compressed sensing radar signal processing analogue-digital conversion radar receivers Bayes methods signal sampling mean square error methods joint frequency two-dimensional direction-of-arrival estimation ES systems subNyquist sampling electronic support receivers wide instantaneous bandwidth wide-frequency range modern radar signals analogue-to-digital converters high sampling rates digital ES receivers back-end ADC system-level approach required digitisation rate minimisation compressive sampling location finding pulsed radars frequency finding position finding three-dimensional antenna array ADC blocks modulated wideband converter technique Bayesian compressed sensing off-grid techniques joint azimuth estimation joint elevation angles estimation off-grid Bayesian method mean square estimation error computation complexity multisnapshot scenarios electronic warfare nomenclature

来源：评论

学校读者我要写书评

暂无评论

Hybrid intelligence system using fuzzy inference in cluster architecture for secured group communication

引用

SOFT COMPUTING 2019年第8期23卷 2727-2734页

作者： Sayeekumar, M. Karthik, G. M. Puhazholi, S. SRM Inst Sci & Technol Dept Informat Technol Kattankulathur Tamil Nadu India

The complication of efficient group communication design in real-world application has been continuously increasing. More factors have to be taken into account continuously before any decision about the rekeying process in cluster architecture could be derived. In this scenario the decision-making process should be efficient and optimal;therefore, fuzzy inference system can be implemented for fast decision making in rekeying process. Secured and efficient group communication can be attained by deploying fuzzy-based inference system in hybrid clustered architecture of group communication. The aim of this proposed model is to reduce the communication and computation complexity of the system using fuzzy-based inference system. In this proposed model, a fuzzy inference system is designed with the function for membership in the group, and the manipulation on input-output relations is concluded. Moreover, by implementing the proposed system, complexity overhead is reduced due to efficient framework and minimized key management. Simulation is done to verify the efficiency of proposed model for the members, to subscribe the service pack with a requested time slot.

关键词： Fuzzy inference system Hybrid intelligence Secure group communication Rekeying computation complexity

来源：评论

学校读者我要写书评

暂无评论

computational Scheme of Ordinary Differential Equations Integration on the Basis of Differential Taylor Transformation with Automatic Step and Order Selection

引用

JOURNAL OF AUTOMATION AND INFORMATION SCIENCES 2012年第12期44卷 12-22页

作者： Rakushev, M. Yu. Natl Aviat Univ Zhitomir SP Korolev Mil Inst Kiev Ukraine

The computational scheme of ordinary differential equations integration with the automatic step size and order selection of the scheme developed on the basis of differential Taylor transformation is offered. The adapt ation at each step of integration is conducted based on providing the desired precision at the minimum computational efforts. The results of simulation are presented.

关键词： ordinary differential equations differential Taylor transformation computation complexity automatic step size and order selection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：