با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد).
ردیف | عنوان | نوع |
---|---|---|
1 |
Intelligent context-aware fog node discovery
کشف گره مه آگاه از زمینه هوشمند-2022 Fog computing has been proposed as a mechanism to address certain issues in
cloud computing such as latency, storage, network bandwidth, etc. Fog computing brings the processing, storage, and networking to the edge of the network
near the edge devices, which we called fog consumers. This decreases latency,
network bandwidth, and response time. Discovering the most relevant fog node,
the nearest one to the fog consumers, is a critical challenge that is yet to be addressed by the research. In this study, we present the Intelligent and Distributed
Fog node Discovery mechanism (IDFD) which is an intelligent approach to enable fog consumers to discover appropriate fog nodes in a context-aware manner.
The proposed approach is based on the distributed fog registries between fog consumers and fog nodes that can facilitate the discovery process of fog nodes. In
this study, the KNN, K-d tree, and brute force algorithms are used to discover
fog nodes based on the context-aware criteria of fog nodes and fog consumers.
The proposed framework is simulated using OMNET++, and the performance of
the proposed algorithms is compared based on performance metrics and execution
time. The accuracy and execution time are the major points of consideration in
the selection of an optimal fog search algorithm. The experiment results show
that the KNN and K-d tree algorithms achieve the same accuracy results of 95 %.
However, the K-d tree method takes less time to find the nearest fog nodes than
KNN and brute force. Thus, the K-d tree is selected as the fog search algorithm
in the IDFD to discover the nearest fog nodes very efficiently and quickly.
keywords: Fog node | Discovery | Context-aware | Intelligent | Fog node discovery |
مقاله انگلیسی |
2 |
Internet of Things-enabled Passive Contact Tracing in Smart Cities
ردیابی تماس غیرفعال با قابلیت اینترنت اشیا در شهرهای هوشمند-2022 Contact tracing has been proven an essential practice during pandemic outbreaks and is a
critical non-pharmaceutical intervention to reduce mortality rates. While traditional con-
tact tracing approaches are gradually being replaced by peer-to-peer smartphone-based
systems, the new applications tend to ignore the Internet-of-Things (IoT) ecosystem that is
steadily growing in smart city environments. This work presents a contact tracing frame-
work that logs smart space users’ co-existence using IoT devices as reference anchors. The
design is non-intrusive as it relies on passive wireless interactions between each user’s
carried equipment (e.g., smartphone, wearable, proximity card) with an IoT device by uti-
lizing received signal strength indicators (RSSI). The proposed framework can log the iden-
tities for the interacting pair, their estimated distance, and the overlapping time duration.
Also, we propose a machine learning-based infection risk classification method to char-
acterize each interaction that relies on RSSI-based attributes and contact details. Finally,
the proposed contact tracing framework’s performance is evaluated through a real-world
case study of actual wireless interactions between users and IoT devices through Bluetooth
Low Energy advertising. The results demonstrate the system’s capability to accurately cap-
ture contact between mobile users and assess their infection risk provided adequate model
training over time.
© 2021 Elsevier B.V. All rights reserved. keywords: بلوتوث کم انرژی | ردیابی تماس | اینترنت اشیا | طبقه بندی خطر عفونت | Bluetooth Low Energy | Contact Tracing | Internet of Things | Infection Risk Classification |
مقاله انگلیسی |
3 |
IoT architecture for continuous long term monitoring: Parkinson’s Disease case study
معماری اینترنت اشیا برای نظارت طولانی مدت مداوم: مطالعه موردی بیماری پارکینسون-2022 In recent years, technological advancements and the strengthening of the Internet of Things
concepts have led to significant improvements in the technology infrastructures for remote
monitoring. This includes telemedicine which is the ensemble of technologies and tools involved
in medical services, from consultations, to diagnosis, prescriptions, treatment and patient
monitoring, all done remotely via an Internet connection.
Developing a telemedicine framework capable of monitoring patients over a continuous long-term monitoring window may encounter various issues related to the battery life of the device or the accuracy of the retrieved data. Moreover, it is crucial to develop an IoT architecture that is adaptable to various scenarios and the ongoing changes of the application scenario under analysis. In this work, we present an IoT architecture for continuous long-term monitoring of patients. Furthermore, as a real scenario case study, we adapt our IoT architecture for Parkinson’s Disease management, building up the PDRMA (Parkinson’s disease remote monitoring architecture). Performance analysis for optimal operation with respect to temperature and daily battery life is conducted. Finally, a multi-parameter app for the continuous monitoring of Parkinson’s patients is presented. keywords: IoT | Telemedicine | Continuous long term monitoring | Parkinson’s disease | e-Health |
مقاله انگلیسی |
4 |
Direct Quantum Communications in the Presence of Realistic Noisy Entanglement
ارتباطات کوانتومی مستقیم در حضور درهم تنیدگی پر سر و صدا واقعی-2022 To realize the Quantum Internet, quantum
communications require pre-shared entanglement among quantum nodes. However, both the generation and the distribution
of the maximally-entangled quantum states are inherently contaminated by quantum decoherence. Conventionally, the quantum
decoherence is mitigated by performing the consecutive steps of
quantum entanglement distillation followed by quantum teleportation. However, this conventional approach imposes a long delay.
To circumvent this impediment, we propose a novel quantum
communication scheme relying on realistic noisy pre-shared
entanglement, which eliminates the sequential steps imposing
delay in the standard approach. More precisely, our proposed
scheme can be viewed as a direct quantum communication
scheme capable of improving the quantum bit error ratio (QBER)
of the logical qubits despite relying on realistic noisy pre-shared
entanglement. Our performance analysis shows that the proposed
scheme offers competitive QBER, yield, and goodput compared
to the existing state-of-the-art quantum communication schemes,
despite requiring fewer quantum gates.
Index Terms: Quantum communication | quantum entanglement | quantum error-correction | quantum stabilizer codes | Quantum Internet. |
مقاله انگلیسی |
5 |
IoTracker: A probabilistic event tracking approach for data-intensive IoT Smart Applications
IoTracker: یک رویکرد ردیابی رویداد احتمالی برای برنامههای هوشمند اینترنت اشیا با داده های فشرده-2022 Smart Applications for cities, industry, farming and healthcare use Internet of Things (IoT)
approaches to improve the general quality. A dependency on smart applications implies that any
misbehavior may impact our society with varying criticality levels, from simple inconveniences
to life-threatening dangers. One critical challenge in this area is to overcome the side effects
caused by data loss due to failures in software, hardware, and communication systems, which
may also affect data logging systems. Event traceability and auditing may be impaired when an
application makes automated decisions and the operating log is incomplete. In an environment
where many events happen automatically, an audit system must understand, validate, and
find the root causes of eventual failures. This paper presents a probabilistic approach to track
sequences of events even in the face of logging data loss using Bayesian networks. The results of
the performance analysis with three smart application scenarios show that this approach is valid
to track events in the face of incomplete data. Also, scenarios modeled with Bayesian subnets
highlight a decreasing complexity due to this divide and conquer strategy that reduces the
number of elements involved. Consequently, the results improve and also reveal the potential
for further advancement.
Keywords: Smart applications | Event tracker | Probabilistic tracker | Bayesian networks |
مقاله انگلیسی |
6 |
Discriminating Quantum States in the Presence of a Deutschian CTC: A Simulation Analysis
حالت های کوانتومی متمایز در حضور CTC Deutschian: یک تحلیل شبیه سازی-2022 In an article published in 2009, Brun et al. proved that in the presence of a “Deutschian”
closed timelike curve, one can map K distinct nonorthogonal states (hereafter, input set) to the standard
orthonormal basis of a K-dimensional state space. To implement this result, the authors proposed a quantum
circuit that includes, among SWAP gates, a fixed set of controlled operators (boxes) and an algorithm for
determining the unitary transformations carried out by such boxes. To our knowledge, what is still missing
to complete the picture is an analysis evaluating the performance of the aforementioned circuit from an
engineering perspective. The objective of this article is, therefore, to address this gap through an in-depth
simulation analysis, which exploits the approach proposed by Brun et al. in 2017. This approach relies on
multiple copies of an input state, multiple iterations of the circuit until a fixed point is (almost) reached. The
performance analysis led us to a number of findings. First, the number of iterations is significantly high even
if the number of states to be discriminated against is small, such as 2 or 3. Second, we envision that such
a number may be shortened as there is plenty of room to improve the unitary transformation acting in the
aforementioned controlled boxes. Third, we also revealed a relationship between the number of iterations
required to get close to the fixed point and the Chernoff limit of the input set used: the higher the Chernoff
bound, the smaller the number of iterations. A comparison, although partial, with another quantum circuit
discriminating the nonorthogonal states, proposed by Nareddula et al. in 2018, is carried out and differences
are highlighted.
INDEX TERMS: Benchmarking and performance characterization | classical simulation of quantum systems. |
مقاله انگلیسی |
7 |
DOPIV: Post-Quantum Secure Identity-Based Data Outsourcing with Public Integrity Verification in Cloud Storage
DOPIV: برون سپاری داده مبتنی بر هویت امن پس از کوانتومی با تأیید صحت عمومی در فضای ذخیره سازی ابری-2022 Public verification enables cloud users to employ a third party auditor (TPA) to check the data integrity. However, recent
breakthrough results on quantum computers indicate that applying quantum computers in clouds would be realized. A majority of existing
public verification schemes are based on conventional hardness assumptions, which are vulnerable to adversaries equipped with
quantum computers in the near future. Moreover, new security issues need to be solved when an original data owner is restricted or
cannot access the remote cloud server flexibly. In this paper, we propose an efficient identity-based data outsourcing with public integrity
verification scheme (DOPIV) in cloud storage. DOPIV is designed on lattice-based cryptography, which achieves post-quantum security.
DOPIV enables an original data owner to delegate a proxy to generate the signatures of data and outsource them to the cloud server.
Any TPA can perform data integrity verification efficiently on behalf of the original data owner, without retrieving the entire data set.
Additionally, DOPIV possesses the advantages of being identity-based systems, avoiding complex certificate management procedures.
We provide security proofs of DOPIV in the random oracle model, and conduct a comprehensive performance evaluation to show that
DOPIV is more practical in post-quantum secure cloud storage systems.
Index Terms: Cloud storage | public verification | lattice-based cryptography | identity-based data outsourcing | post-quantum security |
مقاله انگلیسی |
8 |
Effects of Dynamical Decoupling and Pulse-Level Optimizations on IBM Quantum Computers
اثرات جداسازی دینامیکی و بهینه سازی سطح پالس بر روی کامپیوترهای کوانتومی IBM-2022 Currently available quantum computers are prone to errors. Circuit optimization and error
mitigation methods are needed to design quantum circuits to achieve better fidelity when executed on NISQ
hardware. Dynamical decoupling (DD) is generally used to suppress the decoherence error, and different DD
strategies have been proposed. Moreover, the circuit fidelity can be improved by pulse-level optimization,
such as creating hardware-native pulse-efficient gates. This article implements all the popular DD sequences
and evaluates their performances on IBM quantum chips with different characteristics for various wellknown quantum applications. Also, we investigate combining DD with the pulse-level optimization method
and apply them to QAOA to solve the max-cut problem. Based on the experimental results, we find that DD
can be a benefit for only certain types of quantum algorithms, while the combination of DD and pulse-level
optimization methods always has a positive impact. Finally, we provide several guidelines for users to learn
how to use these noise mitigation methods to build circuits for quantum applications with high fidelity on
IBM quantum computers.
INDEX TERMS: Error mitigation | noisy intermediate-scale quantum (NISQ) hardware. |
مقاله انگلیسی |
9 |
The physical and mechanical properties for flexible biomass particles using computer vision
خواص فیزیکی و مکانیکی ذرات زیست توده انعطاف پذیر با استفاده از بینایی کامپیوتری-2022 The combustion and fluidization behavior of biomass depend on the physical properties (size, morphology, and
density) and mechanical performances (elastic modulus, Poisson’s ratio, tensile strength and failure strain), but
their quantitative models have rarely been focused in previous researchers. Hence, a static image measurement
for particle physical properties is studied. Combining the uniaxial tension and digital image correlation tech-
nology, the dynamic image measurement method for the mechanical properties is proposed. The results indicate
that the average roundness, rectangularity, and sphericity of present biomass particles are 0.2, 0.4, and 0.16,
respectively. The equivalent diameter and density obey the skewed normal distribution. The tensile strength and
failure stress are sensitive to stretching rate, fiber size and orientation. The distribution intervals of elastic
modulus and Poisson’s ratio are 30–600 MPa and 0.25–0.307, respectively. The stress–strain curves obtained
from imaging experiments agree well with the result of finite element method. This study provides the operating
parameters for the numerical simulation of particles in the fluidized bed and combustor. Furthermore, the
computer vision measurement method can be extended to the investigations of fossil fuels. keywords: ذرات زیست توده | مشخصات فیزیکی | اجرای مکانیکی | تست کشش | آزمایش تصویربرداری | بینایی کامپیوتر | Biomass particle | Physical properties | Mechanical performances | Tensile testing | Imaging experiment | Computer vision |
مقاله انگلیسی |
10 |
Efficient Floating Point Arithmetic for Quantum Computers
محاسبات ممیز شناور کارآمد برای کامپیوترهای کوانتومی-2022 One of the major promises of quantum computing is the realization of SIMD (single
instruction - multiple data) operations using the phenomenon of superposition. Since the dimension of the
state space grows exponentially with the number of qubits, we can easily reach situations where we pay less
than a single quantum gate per data point for data-processing instructions, which would be rather expensive
in classical computing. Formulating such instructions in terms of quantum gates, however, still remains
a challenging task. Laying out the foundational functions for more advanced data-processing is therefore a
subject of paramount importance for advancing the realm of quantum computing. In this paper, we introduce
the formalism of encoding so called-semi-boolean polynomials. As it turns out, arithmetic Z=2nZ ring
operations can be formulated as semi-boolean polynomial evaluations, which allows convenient generation
of unsigned integer arithmetic quantum circuits. For arithmetic evaluations, the resulting algorithm has been
known as Fourier-arithmetic. We extend this type of algorithm with additional features, such as ancillafree in-place multiplication and integer coefficient polynomial evaluation. Furthermore, we introduce a
tailor-made method for encoding signed integers succeeded by an encoding for arbitrary floating-point
numbers. This representation of floating-point numbers and their processing can be applied to any quantum algorithm that performs unsigned modular integer arithmetic. We discuss some further performance
enhancements of the semi boolean polynomial encoder and finally supply a complexity estimation. The
application of our methods to a 32-bit unsigned integer multiplication demonstrated a 90% circuit depth
reduction compared to carry-ripple approaches.
INDEX TERMS: Quantum arithmetic | quantum computing | floating point arithmetic. |
مقاله انگلیسی |