با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد).
ردیف | عنوان | نوع |
---|---|---|
1 |
Data Mining Strategies for Real-Time Control in New York City
استراتژی داده کاوی برای کنترل زمان واقعی در شهر نیویورک-2105 The Data Mining System (DMS) at New York City Department of Transportation (NYCDOT) mainly consists of four database
systems for traffic and pedestrian/bicycle volumes, crash data, and signal timing plans as well as the Midtown in Motion (MIM)
systems which are used as part of the NYCDOT Intelligent Transportation System (ITS) infrastructure. These database and
control systems are operated by different units at NYCDOT as an independent database or operation system. New York City
experiences heavy traffic volumes, pedestrians and cyclists in each Central Business District (CBD) area and along key arterial
systems. There are consistent and urgent needs in New York City for real-time control to improve mobility and safety for all
users of the street networks, and to provide a timely response and management of random incidents. Therefore, it is necessary to
develop an integrated DMS for effective real-time control and active transportation management (ATM) in New York City.
This paper will present new strategies for New York City suggesting the development of efficient and cost-effective DMS,
involving: 1) use of new technology applications such as tablets and smartphone with Global Positioning System (GPS) and
wireless communication features for data collection and reduction; 2) interface development among existing database and control
systems; and 3) integrated DMS deployment with macroscopic and mesoscopic simulation models in Manhattan. This study
paper also suggests a complete data mining process for real-time control with traditional static data, current real timing data from
loop detectors, microwave sensors, and video cameras, and new real-time data using the GPS data. GPS data, including using taxi
and bus GPS information, and smartphone applications can be obtained in all weather conditions and during anytime of the day.
GPS data and smartphone application in NYCDOT DMS is discussed herein as a new concept.
© 2014 The Authors. Published by Elsevier B.V.
Selection and peer-review under responsibility of Elhadi M. Shakshu
Keywords: Data Mining System (DMS), New York City, real-time control, active transportation management (ATM), GPS data |
مقاله انگلیسی |
2 |
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 |
مقاله انگلیسی |
3 |
IoT-based Prediction Models in the Environmental Context: A Systematic Literature Review
مدلهای پیشبینی مبتنی بر اینترنت اشیا در زمینه محیطی: مروری بر ادبیات سیستماتیک-2022 Undoubtedly, during the last years climate change has alerted the research community of the natural environment sector. Furthermore, the advent of Internet of Things (IoT) paradigm has enhanced the research activity in the environmental field offering low-cost sensors. Moreover, artificial
intelligence and more specifically, statistical and machine learning methodologies have proved their predictive power in many disciplines and various
real-world problems. As a result of the aforementioned, many scientists of
the environmental research field have performed prediction models exploiting
the strength of IoT data. Hence, insightful information could be extracted
from the review of these research works and for this reason, a Systematic
Literature Review (SLR) is introduced in the present manuscript in order to
summarize the recent studies of the field under specific rules and constraints.
From the SLR, 54 primary studies have been extracted during 2017-2021.
The analysis showed that many IoT-based prediction models have been applied the previous years in 10 different environmental issues, presenting in
the majority of the primary studies promising results.
keywords: Natural Environment | Internet of Things | Prediction Models | Systematic Literature Review |
مقاله انگلیسی |
4 |
Duality Between Source Coding With Quantum Side Information and Classical-Quantum Channel Coding
دوگانگی بین کدگذاری منبع با اطلاعات جانبی کوانتومی و کدگذاری کانال کوانتومی کلاسیک-2022 In this paper, we establish an interesting duality
between two different quantum information-processing tasks,
namely, classical source coding with quantum side information,
and channel coding over classical-quantum channels. The duality
relates the optimal error exponents of these two tasks, generalizing the classical results of Ahlswede and Dueck [IEEE
Trans. Inf. Theory, 28(3):430–443, 1982]. We establish duality
both at the operational level and at the level of the entropic
quantities characterizing these exponents. For the latter, the
duality is given by an exact relation, whereas for the former,
duality manifests itself in the following sense: an optimal coding
strategy for one task can be used to construct an optimal coding
strategy for the other task. Along the way, we derive a bound
on the error exponent for classical-quantum channel coding
with constant composition codes which might be of independent
interest. Finally, we consider the task of variable-length classical
compression with quantum side information, and a duality
relation between this task and classical-quantum channel coding
can also be established correspondingly. Furthermore, we study
the strong converse of this task, and show that the strong converse
property does not hold even in the i.i.d. scenario.
Index Terms: Duality | classical-quantum channel coding | quantum side information | error exponent | strong converse | Slepian-Wolf coding. |
مقاله انگلیسی |
5 |
A robust structural vibration recognition system based on computer vision
یک سیستم قوی تشخیص ارتعاش ساختاری بر اساس بینایی کامپیوتری-2022 Vibration-based structural health monitoring (SHM) systems are useful tools for assessing structural safety performance quantitatively. When employing traditional contact sensors, achieving high-resolution spatial measurements for large-scale structures is challenging, and fixed contact sensors may also lose dependability when the lifetime of the host structure is surpassed. Researchers have paid close attention to computer vision because it is noncontact, saves time and effort, is inexpensive, and has high efficiency in giving visual perception. In advanced noncontact measurements, digital cameras can capture the vibration information of structures remotely and swiftly. Thus, this work studies a system for recognizing structural vibration. The system ensures acquiring high-quality structural vibration signals by the following: 1) Establishing a novel image preprocessing, which includes visual partitioning measurement and image enhancement techniques; 2) initial recognition of structural vibration using phase-based optical flow estimation (POFE), which introduces 2-D Gabor wavelets to extract the independent phase information of the image to track the natural texture targets on the surface of the structure; 3) extracting the practical vibration information of the structure using mode decomposition to remove the complex environment of the camera vibration and other noises; 4) employing phase-based motion magnification (PMM) techniques to magnify small vibration signals, and then recognizing the complete information on the vibration time range of the structure. The research results of the laboratory experiments and field testing conducted under three different cases reveal that the system can recognize structural vibration in complicated environments.
keywords: Computer vision | Phase | Motion estimation | Motion magnification | Mode decomposition | Structural vibration |
مقاله انگلیسی |
6 |
Efficient Quantum Blockchain With a Consensus Mechanism QDPoS
بلاک چین کوانتومی کارآمد با مکانیزم اجماع QDPoS-2022 Quantum blockchain is expected to offer an alternative to classical blockchain to resist malicious attacks laughed by future quantum computers. Although a few quantum blockchain schemes have been constructed, their efficiency is low and unable to meet application requirements due to the fact that they lack of a suitable consensus mechanism. To tackle this issue, a consensus mechanism called quantum delegated proof of stake (QDPoS) is constructed by using quantum voting to provide fast decentralization for the quantum blockchain scheme at first. Then an efficient scheme is proposed for quantum blockchain based on QDPoS, where the classical information is initialized as a part of each single quantum state and these quantum states are entangled to form the chain. Compared with previous methods, the designed quantum blockchain scheme is more complete and carried out with higher efficiency, which greatly contributes to better adapting to the challenges of the quantum era.
Index Terms: Quantum blockchain | consensus mechanism | QDPoS | quantum voting | quantum entanglement. |
مقاله انگلیسی |
7 |
EntangleNetSat: A Satellite-Based Entanglement Resupply Network
-2022 In the practical context of quantum networks, quantum teleportation plays a key role in
transmitting quantum information. In the process of teleportation, a maximally entangled pair is consumed.
Through this paper, an efficient scheme of re-establishing entanglement between different nodes in a
quantum network is explored. A hybrid land-satellite network is considered, where the land-based links
are used for short-range communication, and the satellite links are used for transmissions between distant
nodes. This new scheme explores many different possibilities of resupplying the land nodes with entangled
pairs, depending on: the position of the satellites, the number of pairs available and the distance between
the nodes themselves. As to make the entire process as efficient as possible, we consider the situations of
direct transmissions of entangled photons and also the transmissions making use of entanglement swapping.
An analysis is presented for concrete scenarios, sustained by numerical data.
INDEX TERMS: Quantum communication | entanglement | teleportation | entanglement swapping | routing scheme | satellite. |
مقاله انگلیسی |
8 |
Entropic Proofs of Singleton Bounds for Quantum Error-Correcting Codes
اثبات های آنتروپیک کرانه های سینگلتون برای کدهای تصحیح خطای کوانتومی-2022 We show that a relatively simple reasoning using
von Neumann entropy inequalities yields a robust proof of the
quantum Singleton bound for quantum error-correcting codes
(QECC). For entanglement-assisted quantum error-correcting
codes (EAQECC) and catalytic codes (CQECC), a type of
generalized quantum Singleton bound [Brun et al., IEEE Trans.
Inf. Theory 60(6):3073–3089 (2014)] was believed to hold for
many years until recently one of us found a counterexample
[MG, Phys. Rev. A 103, 020601 (2021)]. Here, we rectify this state
of affairs by proving the correct generalized quantum Singleton
bound, extending the above-mentioned proof method for QECC;
we also prove information-theoretically tight bounds on the
entanglement-communication tradeoff for EAQECC. All of the
bounds relate block length n and code length k for given
minimum distance d and we show that they are robust, in the
sense that they hold with small perturbations for codes which
only correct most of the erasure errors of less than d letters.
In contrast to the classical case, the bounds take on qualitatively
different forms depending on whether the minimum distance
is smaller or larger than half the block length. We also provide a propagation rule: any pure QECC yields an EAQECC
with the same distance and dimension, but of shorter block
length.
Index Terms: Quantum codes | quantum entanglement | singleton bound. |
مقاله انگلیسی |
9 |
Epsilon-Nets, Unitary Designs, and Random Quantum Circuits
شبکه های اپسیلون، طرح های واحد و مدارهای کوانتومی تصادفی-2022 Epsilon-nets and approximate unitary t-designs are
natural notions that capture properties of unitary operations
relevant for numerous applications in quantum information
and quantum computing. In this work we study quantitative
connections between these two notions. Specifically, we prove
that, for d dimensional Hilbert space, unitaries constituting
δ-approximate t-expanders form -nets for t d5/2 and δ
3d/2 d2. We also show that for arbitrary t, -nets can be used
to construct δ-approximate unitary t-designs for δ t, where
the notion of approximation is based on the diamond norm.
Finally, we prove that the degree of an exact unitary t design
necessary to obtain an -net must grow at least as fast as 1 (for
fixed dimension) and not slower than d2 (for fixed ). This shows
near optimality of our result connecting t-designs and nets.
We apply our findings in the context of quantum computing.
First, we show that that approximate t-designs can be generated
by shallow random circuits formed from a set of universal twoqudit gates in the parallel and sequential local architectures
considered in (Brandão et al., 2016). Importantly, our gate sets
need not to be symmetric (i.e., contains gates together with
their inverses) or consist of gates with algebraic entries. Second,
we consider compilation of quantum gates and prove a nonconstructive Solovay-Kitaev theorem for general universal gate
sets. Our main technical contribution is a new construction of
efficient polynomial approximations to the Dirac delta in the
space of quantum channels, which can be of independent interest.]
Index Terms: Unitary designs, epsilon nets | random quantum circuits | compilation of quantum gates | unitary channels. |
مقاله انگلیسی |
10 |
A survey on adversarial attacks in computer vision: Taxonomy, visualization and future directions
بررسی حملات خصمانه در بینایی کامپیوتر: طبقه بندی، تجسم و جهت گیری های آینده-2022 Deep learning has been widely applied in various fields such as computer vision, natural language pro-
cessing, and data mining. Although deep learning has achieved significant success in solving complex
problems, it has been shown that deep neural networks are vulnerable to adversarial attacks, result-
ing in models that fail to perform their tasks properly, which limits the application of deep learning
in security-critical areas. In this paper, we first review some of the classical and latest representative
adversarial attacks based on a reasonable taxonomy of adversarial attacks. Then, we construct a knowl-
edge graph based on the citation relationship relying on the software VOSviewer, visualize and analyze
the subject development in this field based on the information of 5923 articles from Scopus. In the
end, possible research directions for the development about adversarial attacks are proposed based on
the trends deduced by keywords detection analysis. All the data used for visualization are available at:
https://github.com/NanyunLengmu/Adversarial- Attack- Visualization . keywords: یادگیری عمیق | حمله خصمانه | حمله جعبه سیاه | حمله به جعبه سفید | نیرومندی | تجزیه و تحلیل تجسم | Deep learning | Adversarial attack | Black-box attack | White-box attack | Robustness | Visualization analysis |
مقاله انگلیسی |