دانلود و نمایش مقالات مرتبط با Resource::صفحه 1
بلافاصله پس از پرداخت دانلود کنید

با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد). 

نتیجه جستجو - Resource

تعداد مقالات یافته شده: 1802
ردیف عنوان نوع
1 Intelligent authentication of 5G healthcare devices: A survey
احراز هویت هوشمند دستگاه های مراقبت بهداشتی 5G: یک مرور-2022
The dynamic nature of wireless links and the mobility of devices connected to the Internet of Things (IoT) over fifth-generation (5G) networks (IoT-5G), on the one hand, empowers pervasive healthcare applications. On the other hand, it allows eavesdroppers and other illegitimate actors to access secret information. Due to the poor time efficiency and high computational complexity of conventional cryptographic methods and the heterogeneous technologies used, it is easy to compromise the authentication of lightweight wearable and healthcare devices. Therefore, intelligent authentication, which relies on artificial intelligence (AI), and sufficient network resources are extremely important for securing healthcare devices connected to IoT- 5G. This survey considers intelligent authentication and includes a comprehensive overview of intelligent authentication mechanisms for securing IoT-5G devices deployed in the healthcare domain. First, it presents a detailed, thoughtful, and state-of-the-art review of IoT-5G, healthcare technologies, tools, applications, research trends, challenges, opportunities, and solutions. We selected 20 technical articles from those surveyed based on their strong overlaps with IoT, 5G, healthcare, device authentication, and AI. Second, IoT-5G device authentication, radiofrequency fingerprinting, and mutual authentication are reviewed, characterized, clustered, and classified. Third, the review envisions that AI can be used to integrate the attributes of the physical layer and 5G networks to empower intelligent healthcare devices. Moreover, methods for developing intelligent authentication models using AI are presented. Finally, the future outlook and recommendations are introduced for IoT-5G healthcare applications, and recommendations for further research are presented as well. The remarkable contributions and relevance of this survey may assist the research community in understanding the research gaps and the research opportunities relating to the intelligent authentication of IoT-5G healthcare devices.
keywords: اینترنت اشیا (IoT) | امنیت اینترنت اشیا | احراز هویت دستگاه | هوش مصنوعی | امنیت مراقبت های بهداشتی | شبکه های 5g | InternetofThings(IoT) | InternetofThingssecurity | Deviceauthentication | Artificialintelligence | Healthcaresecurity | 5Gnetworks
مقاله انگلیسی
2 Eigen-Spectrum Estimation and Source Detection in a Massive Sensor Array Based on Quantum Assisted Hamiltonian Simulation Framework
تخمین طیف ویژه و تشخیص منبع در یک آرایه حسگر عظیم بر اساس چارچوب شبیه‌سازی همیلتونی به کمک کوانتومی-2022
In this work, we propose quantum assisted eigenvalue estimation and target detection algorithms for a large sensor array via Hamiltonian simulation. Quantum algorithms provide complexity advantage of a certain class of problems on a quantum computer with fewer physical resources as compared to their classical counterparts. The proposed algorithms make use of the quantum phase estimation (QPE) as its core computing component. We have introduced an analytical quantum framework to map from classical to quantum in the context of target detection. Target detection involves an appropriate choice of threshold based on the probability of detection or false alarm. We exploited the massive sensor array structure and invoked the random matrix theory to propose an optimal threshold. It also takes into account the quantum measurement noise in the framework. Numerical simulations are performed to ascertain the efficacy of the proposed framework. The results suggest near term applications of the quantum algorithm for large-scale linear systems. Index Terms: Quantum signal processing | quantum eigenvalue estimation | quantum phase estimation | Hamiltonian simulation | array signal processing.
مقاله انگلیسی
3 Grover on KATAN: Quantum Resource Estimation
گروور در کاتان: برآورد منابع کوانتومی-2022
This article presents the cost analysis of mounting Grover’s key search attack on the family of KATAN block cipher. Several designs of the reversible quantum circuit of KATAN are proposed. Owing to the National Insitute of Standards and Technology’s (NIST) proposal for postquantum cryptography standardization, the circuits are designed focusing on minimizing the overall depth. We observe that the reversible quantum circuits designed using and gates and T-depth one Toffoli gate give more shallow circuits. Grover oracle for KATAN is designed based on the reversible circuits, which are used further to mount Grover’s key search attack on KATAN. The designs are implemented using the software framework ProjectQ, which provides a resource estimation tool to perform an appropriate cost analysis in an automated way. While estimating the resources, NIST’s depth restrictions are also respected.
INDEX TERMS: Grover’s algorithm | KATAN | postquantum cryptography (PQC) | ProjectQ implementation | quantum cryptanalysis.
مقاله انگلیسی
4 Hybrid CV-DV Quantum Communications and Quantum Networks
ارتباطات کوانتومی ترکیبی CV-DV و شبکه های کوانتومی-2022
Quantum information processing (QIP) opens new opportunities for high-performance computing, high-precision sensing, and secure communications. Among various QIP features, the entanglement is a unique one. To take full advantage of quantum resources, it will be necessary to interface quantum systems based on different encodings of information both discrete and continuous. The goal of this paper is to lay the groundwork for the development of a robust and efficient hybrid continuous variable-discrete variable (CV-DV) quantum network, enabling the distribution of a large number of entangled states over hybrid DV-CV multi-hop nodes in an arbitrary topology. The proposed hybrid quantum communication network (QCN) can serve as the backbone for a future quantum Internet, thus providing extensive longterm impacts on the economy and national security through QIP, distributed quantum computing, quantum networking, and distributed quantum sensing. By employing the photon addition and photon subtraction modules we describe how to generate the hybrid DV-CV entangled states and how to implement their teleportation and entanglement swapping through entangling measurements. We then describe how to extend the transmission distance between nodes in hybrid QCN by employing macroscopic light states, noiseless amplification, and reconfigurable quantum LDPC coding. We further describe how to enable quantum networking and distributed quantum computing by employing the deterministic cluster state concept introduced here. Finally, we describe how the proposed hybrid CV-DV states can be used in an entanglement-based hybrid QKD.
INDEX TERMS: Entanglement | photon addition | photon subtraction | hybrid CV-DV entangled states | teleportation | entanglement swapping | entanglement distribution | hybrid quantum communication networks | entanglement-based hybrid QKD.
مقاله انگلیسی
5 A turnaround control system to automatically detect and monitor the time stamps of ground service actions in airports: A deep learning and computer vision based approach
یک سیستم کنترل چرخش برای شناسایی و نظارت خودکار بر مهرهای زمانی اقدامات خدمات زمینی در فرودگاه‌ها: یک رویکرد مبتنی بر یادگیری عمیق و بینایی کامپیوتری-2022
As it is widely known, several ground services are provided by the airports for the domestic and international flights of the commercial passenger aircraft. Some of these services are conducted during the period called as the turnaround which starts with the parking of the aircraft in the aprons before the flight and ends with their leave from the aprons for the flight. Turnaround processes achieved in short time periods allow using the limited airport resources including the service vehicles and staff effectively. In addition, commercial reputation losses and financial losses that may arise from delays can be reduced as well as the delay-associated turnaround penalties. In this article, a deep learning and computer vision based system that detects and allows monitoring the airport service actions is proposed. The proposed system is capable of analyzing all the primary ground services for an aircraft parking on its apron by employing the RGB video frame sequences obtained from a single fixed camera focusing on the apron. In the service detection and analysis modules of the proposed airport ground service analysis system, some deep learning-based subsystems and in-house-developed algorithms were included and utilized. For the training of the machine learning models, a study-specific dataset was used and the constructed learning models were evaluated on real-life cases. Experimental results obtained as a result of the performance evaluations show that the proposed system is quite successful with precision rates over 90% in the detection and analysis of the airport ground services. This study is one of the limited research studies in which deep learning and computer vision techniques have been applied to detect and analyze the ground service actions. The proposed system is also capable of real-time data processing/analysis and concurrent service action monitoring. Furthermore, it allows monitoring when the service is received by stamping the times of service start/end. In a consideration of industrial relevance or operational perspective, such a system may facilitate the airport ground service management noticeably and reduce the delay-associated costs caused by the timing of the ground services.
keywords: سیستم کنترل گردش فرودگاه | نظارت بر حرکت چرخشی | شناسایی وسایل نقلیه فرودگاهی | تشخیص چرخش | خدمات فرودگاهی | Airportturnaroundcontrolsystem | Turnaroundactionmonitoring | Airportvehicledetection | Turnaroundactiondetection | Airportgroundservices
مقاله انگلیسی
6 Implementing Graph-Theoretic Feature Selection by Quantum Approximate Optimization Algorithm
پیاده سازی انتخاب ویژگی گراف-نظری توسط الگوریتم بهینه سازی تقریبی کوانتومی-2022
Feature selection plays a significant role in computer science; nevertheless, this task is intractable since its search space scales exponentially with the number of dimensions. Motivated by the potential advantages of near-term quantum computing, three graph-theoretic feature selection (GTFS) methods, including minimum cut (MinCut)-based, densest k -subgraph (DkS)-based, and maximal-independent set/minimal vertex cover (MIS/MVC)-based, are investigated in this article, where the original graph-theoretic problems are naturally formulated as the quadratic problems in binary variables and then solved using the quantum approximate optimization algorithm (QAOA). Specifically, three separate graphs are created from the raw feature set, where the vertex set consists of individual features and pairwise measure describes the edge. The corresponding feature subset is generated by deriving a subgraph from the established graph using QAOA. For the above three GTFS approaches, the solving procedure and quantum circuit for the corresponding graph-theoretic problems are formulated with the framework of QAOA. In addition, those proposals could be employed as a local solver and integrated with the Tabu search algorithm for solving large-scale GTFS problems utilizing limited quantum bit resource. Finally, extensive numerical experiments are conducted with 20 publicly available datasets and the results demonstrate that each model is superior to its classical scheme. In addition, the complexity of each model is only O(pn2) even in the worst cases, where p is the number of layers in QAOA and n is the number of features.
Index Terms: Feature selection | graph theory | parameterized quantum circuit | quantum approximation optimization algorithm | quantum computing.
مقاله انگلیسی
7 Memristor Crossbar Arrays Performing Quantum Algorithms
آرایه های ضربدری ممریستور که الگوریتم های کوانتومی را انجام می دهند-2022
There is a growing interest in quantum computers and quantum algorithm development. It has been proved that ideal quantum computers, with zero error rates and large decoherence times, can solve problems that are intractable for today’s classical computers. Quantum computers use two resources, superposition and entanglement, that have no classical analog. Since quantum computer platforms that are currently available comprise only a few dozen of qubits, the use of quantum simulators is essential in developing and testing new quantum algorithms. We present a novel quantum simulator based on memristor crossbar circuits and use them to simulate well-known quantum algorithms, namely the Deutsch and Grover quantum algorithms. In quantum computing the dominant algebraic operations are matrix-vector multiplications. The execution time grows exponentially with the simulated number of qubits, causing an exponential slowdown in quantum algorithm execution using classical computers. In this work, we show that the inherent characteristics of memristor arrays can be used to overcome this problem and that memristor arrays can be used not only as independent quantum simulators but also as a part of a quantum computer stack where classical computers accelerators are connected. Our memristive crossbar circuits are re-configurable and can be programmed to simulate any quantum algorithm.
Index Terms— Memristors | memristor crossbars | quantum algorithms | quantum simulators.
مقاله انگلیسی
8 Computer vision for assessing species color pattern variation from web-based community science images
بینایی کامپیوتری برای ارزیابی تنوع الگوی رنگ گونه ها از تصاویر علم جامعه مبتنی بر وب-2022
Openly available community science digital vouchers provide a wealth of data to study phenotypic change across space and time. However, extracting phenotypic data from these resources requires significant human effort. Here, we demonstrate a workflow and computer vision model for automatically categorizing species color pattern from community science images. Our work is focused on documenting the striped/unstriped color polymorphism in the Eastern Red-backed Salamander (Plethodon cinereus). We used an ensemble convolutional neural network model to analyze this polymorphism in 20,318 iNaturalist images. Our model was highly accurate (∼98%) despite image heterogeneity. We used the resulting annotations to document extensive niche overlap between morphs, but wider niche breadth for striped morphs at the range-wide scale. Our work showcases key design principles for using machine learning with heterogeneous community science image data to address questions at an unprecedented scale.
keywords: Computer science | Ecology | Evolutionary biology
مقاله انگلیسی
9 On the Realistic Worst-Case Analysis of Quantum Arithmetic Circuits
در مورد تحلیل واقعی بدترین حالت مدارهای محاسباتی کوانتومی-2022
We provide evidence that commonly held intuitions when designing quantum circuits can be misleading. In particular, we show that 1) reducing the T-count can increase the total depth; 2) it may be beneficial to trade controlled NOTs for measurements in noisy intermediate-scale quantum (NISQ) circuits; 2) measurement-based uncomputation of relative phase Toffoli ancillae can make up to 30% of a circuit’s depth; and 4) area and volume cost metrics can misreport the resource analysis. Our findings assume that qubits are and will remain a very scarce resource. The results are applicable for both NISQ and quantum errorcorrected protected circuits. Our method uses multiple ways of decomposing Toffoli gates into Clifford+T gates. We illustrate our method on addition and multiplication circuits using ripple-carry. As a byproduct result, we show systematically that for a practically significant range of circuit widths, ripple-carry addition circuits are more resource-efficient than the carry-lookahead addition ones. The methods and circuits were implemented in the open-source QUANTIFY software.
مقاله انگلیسی
10 Oscillator-to-Oscillator Codes Do Not Have a Threshold
کدهای نوسان ساز به نوسان ساز آستانه ندارند-2022
It is known that continuous variable quantum information cannot be protected against naturally occurring noise using Gaussian states and operations only. Noh et al. proposed bosonic oscillator-to-oscillator codes relying on nonGaussian resource states as an alternative, and showed that these encodings can lead to a reduction of the effective error strength at the logical level as measured by the variance of the classical displacement noise channel. An oscillator-to-oscillator code embeds K logical bosonic modes (in an arbitrary state) into N physical modes by means of a Gaussian N-mode unitary and N-K auxiliary one-mode Gottesman-Kitaev-Preskill-states. Here we ask if – in analogy to qubit error-correcting codes – there are families of oscillator-to-oscillator codes with the following threshold property: They allow to convert physical displacement noise with variance below some threshold value to logical noise with variance upper bounded by any (arbitrary) constant. We find that this is not the case if encoding unitaries involving a constant amount of squeezing and maximum likelihood error decoding are used. We show a general lower bound on the logical error probability which is only a function of the amount of squeezing and independent of the number of modes. As a consequence, any physically implementable family of oscillator-to-oscillator codes combined with maximum likelihood error decoding does not admit a threshold.
Index Terms: Bosonic codes | continuous-variable quantum information | fault-tolerance threshold | modulo reduced Gaussian vectors | quantum error correction | quantum fault-tolerance.
مقاله انگلیسی
rss مقالات ترجمه شده rss مقالات انگلیسی rss کتاب های انگلیسی rss مقالات آموزشی
logo-samandehi
بازدید امروز: 6751 :::::::: بازدید دیروز: 0 :::::::: بازدید کل: 6751 :::::::: افراد آنلاین: 77