با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد).
ردیف | عنوان | نوع |
---|---|---|
11 |
A graphics-based digital twin framework for computer vision-based post-earthquake structural inspection and evaluation using unmanned aerial vehicles
یک چارچوب دیجیتال دوقلوی مبتنی بر گرافیک برای بازرسی و ارزیابی ساختاری پس از زلزله مبتنی بر بینایی کامپیوتری با استفاده از وسایل نقلیه هوایی بدون سرنشین-2022 Rapid structural inspections and evaluations are critical after earthquakes. Computer vision-based methods have attracted the interest of researchers for their potential to be rapid, safe, and objective. To provide an end-to-end solution for computer vision-based post-earthquake inspection and evaluation of a specific as-built structure, the concepts of physics-based graphics model (PBGM) and digital twin (DT) are combined to develop a graphics-based digital twin (GBDT) framework. The GBDT framework comprises a finite element (FE) model and a computer graphics (CG) model whose state is informed by the FE analysis, representing the state of the structure before and after an earthquake. The CG model is first created making use of the FE model and the photographic survey of the structure, yielding the virtual counterpart of the as-built structure quickly and accurately. Then damage modelling approaches are proposed to predict the location and extent of structural and nonstructural damage under seismic loading, from which photographic representation of the predicted damage is realized in the CG model. The effectiveness of the GBDT framework is demonstrated using a five-story reinforced concrete benchmark building through the design and assessment of various UAV (Unmanned Aerial Vehicle) inspection trajectories for post-earthquake scenarios. The results demonstrate that the proposed GBDT framework has significant potential to enable rapid structural inspection and evaluation, ultimately leading to more efficient allocation of scarce resources in a post-earthquake setting.
keywords: بینایی کامپیوتر | مهندسی زلزله | دوقلو دیجیتال | ارزیابی پس از زلزله | دوقلو دیجیتال مبتنی بر گرافیک | مدل گرافیکی مبتنی بر فیزیک | Computer vision | Earthquake engineering | Digital twin | Post-earthquake assessment | Graphics-based digital twin | Physics-based graphics model |
مقاله انگلیسی |
12 |
Post-Quantum Era in V2X Security: Convergence of Orchestration and Parallel Computation
دوران پسا کوانتومی در امنیت V2X: همگرایی ارکستراسیون و محاسبات موازی-2022 Along with the potential emergence of quantum computing, safety and security of new and
complex communication services such as automated driving need to be redefined in the post-quantum era. To ensure reliable, continuous, and
secure operation of these scenarios, quantum-resistant security algorithms (QRSAs) that enable
secure connectivity must be integrated into the
network management and orchestration systems
of mobile networks. This article explores a roadmap study of post-quantum era convergence with
cellular connectivity using the Service & Computation Orchestrator (SCO) framework for enhanced
data security in radio access and backhaul transmission with a particular focus on vehicle-to-everything services. Using NTRU as a QSRA, we
show that the parallelization performance of the
Toom-Cook and Karatsuba computation methods
can vary based on different CPU load conditions
through extensive simulations, and that the SCO
framework can facilitate the selection of the most
efficient computation for a given QRSA. Finally,
we discuss the evaluation results, identify the current standardization efforts, and present possible
directions for the coexistence of post-quantum
and mobile network connectivity through an SCO
framework that leverages parallel computing.
|
مقاله انگلیسی |
13 |
Quantum Annealing Methods and Experimental Evaluation to the Phase-Unwrapping Problem in Synthetic Aperture Radar Imaging
روشهای آنیل کوانتومی و ارزیابی تجربی مسئله بازکردن فاز در تصویربرداری رادار دیافراگم مصنوعی-2022 The focus of this work is to explore the use of quantum annealing solvers for the problem of
phase unwrapping of synthetic aperture radar (SAR) images. Although solutions to this problem exist based
on network programming, these techniques do not scale well to larger sized images. Our approach involves
formulating the problem as a quadratic unconstrained binary optimization (QUBO) problem, which can
be solved on a quantum annealer. Given that present embodiments of quantum annealers remain limited
in the number of qubits they possess, we decompose the problem into a set of subproblems that can be
solved individually. These individual solutions are close to optimal up to an integer constant, with one
constant per subimage. In a second phase, these integer constants are determined as a solution to yet another
QUBO problem. This basic idea is extended to several passes, where each pass results in an image which is
subsequently decomposed to yet another set of subproblems until the resulting image can be accommodated
by the annealer at hand. Additionally, we explore improvements to the method by decomposing the original
image into overlapping subimages and ignoring the results on the overlapped (marginal) pixels. We test our
approach with a variety of software-based QUBO solvers and on a variety of images, both synthetic and real.
Additionally, we experiment using D-wave systems’ quantum annealer, the D-wave 2000Q_6 and developed
an embedding method which, for our problem, yielded improved results. Our method resulted in high quality
solutions, comparable to state-of-the-art phase-unwrapping solvers.
INDEX TERMS: Interferometric synthetic aperture radar (SAR) | phase unwrapping, quadratic unconstrained binary optimization (QUBO) | quantum annealing. |
مقاله انگلیسی |
14 |
Quantum Dimension Reduction for Pattern Recognition in High-Resolution Spatio-Spectral Data
کاهش ابعاد کوانتومی برای تشخیص الگو در داده های فضایی-طیفی با وضوح بالا-2022 The promises of advanced quantum computing technology have driven research in the simulation of quantum computers on
classical hardware, where the feasibility of quantum algorithms for real-world problems can be investigated. In domains such as High
Energy Physics (HEP) and Remote Sensing Hyperspectral Imagery, classical computing systems are held back by enormous readouts
of high-resolution data. Due to the multi-dimensionality of the readout data, processing and performing pattern recognition operations
for this enormous data are both computationally intensive and time-consuming. In this article, we propose a methodology that utilizes
Quantum Haar Transform (QHT) and a modified Grover’s search algorithm for time-efficient dimension reduction and dynamic pattern
recognition in data sets that are characterized by high spatial resolution and high dimensionality. QHT is performed on the data to
reduce its dimensionality at preserved spatial locality, while the modified Grover’s search algorithm is used to search for dynamically
changing multiple patterns in the reduced data set. By performing search operations on the reduced data set, processing overheads
are minimized. Moreover, quantum techniques produce results in less time than classical dimension reduction and search methods.
The feasibility of the proposed methodology is verified by emulating the quantum algorithms on classical hardware based on field
programmable gate arrays (FPGAs). We present designs of the quantum circuits for multi-dimensional QHT and multi-pattern Grover’s
search. We also present two emulation techniques and the corresponding hardware architectures for this methodology. A high
performance reconfigurable computer (HPRC) was used for the experimental evaluation, and high-resolution images were used as the
input data set. Analysis of the methods and implications of the experimental results are discussed.
Index Terms— Quantum computing | field-programmable gate arrays (FPGAs) |
مقاله انگلیسی |
15 |
Quantum Pythagorean Fuzzy Evidence Theory: A Negation of Quantum Mass Function View
نظریه شواهد فازی کوانتومی فیثاغورث: نفی عملکرد جرم کوانتومی-2022 Dempster–Shafer (D-S) evidence theory is an effective methodology to handle unknown and imprecise information
because it can assign probability into the power set. However, the
process of obtaining information is a complex task, which can consider the rational, conscious, objective evaluation of utility with behavioral effects. Besides, in most cases, information can be obtained
from different angles at the same time. The quantum model of mass
function (QM) uses amplitude and phase angle to easily express
those properties of information that can extend D-S evidence theory
to the unit circle in a complex plane. Moreover, everything in nature
will have its opposite, which is a kind of universality. The Bayes
theorem is essentially the process of negation. However, in most
cases, decisions can be made by only fully considering the known
information without considering the other side of the information.
Hence, considering the negation of information is a question to
be investigated deeply, which can analyze information from the
other point. This article proposes negation of QM by using the
subtraction of vectors in the unit circle, which can degenerate into
negation proposed by Yager in standard probability theory and
negation proposed by Yin et al. in D-S evidence theory. Negation
can provide us more information to consider the problem from
both positive and negative aspects. In this article, negation can be
understood information, which does not belong to event A, that is
to say, negation can be regarded as nonmembership by using the
fuzzy terms. Based on the above discussion, this article proposes the
quantum pythagorean fuzzy evidence theory (QPFET), which is the
novel work to consider QPFET from the point of negation. Besides,
there are some numerical examplesto explainthe proposed method.
In order to explore the applications of QPFET, this article discusses
the possibility ofthe VIsˇekriterijumskoKompromisno Rangiranje
method underQPFETto handle multicriteria decision-makingthat
enables us to capture 2-D data, considering not only amplitude but
also phase angle.
IndexTerms— Dempster–Shafer(D-S) evidencetheory | negation | pythagorean fuzzy sets (PFSs) | quantum mass function | quantum pythagorean fuzzy evidence theory (QPFET). |
مقاله انگلیسی |
16 |
Quantum SVR for Chlorophyll Concentration Estimation in Water With Remote Sensing
-2022 The increasing availability of quantum computers
motivates researching their potential capabilities in enhancing
the performance of data analysis algorithms. Similarly, as in
other research communities, also in remote sensing (RS), it is
not yet defined how its applications can benefit from the usage
of quantum computing (QC). This letter proposes a formulation
of the support vector regression (SVR) algorithm that can be
executed by D-Wave quantum computers. Specifically, the SVR
is mapped to a quadratic unconstrained binary optimization
(QUBO) problem that is solved with quantum annealing (QA).
The algorithm is tested on two different types of computing
environments offered by D-Wave: the advantage system, which
directly embeds the problem into the quantum processing unit
(QPU), and a hybrid solver that employs both classical and
QC resources. For the evaluation, we considered a biophysical
variable estimation problem with RS data. The experimental
results show that the proposed quantum SVR implementation
can achieve comparable or, in some cases, better results than the
classical implementation. This work is one of the first attempts to
provide insight into how QA could be exploited and integrated in
future RS workflows based on machine learning (ML) algorithms.
Index Terms: Quantum annealing (QA) | quantum computing (QC) | quantum machine learning (QML) | remote sensing (RS) | support vector regression (SVR). |
مقاله انگلیسی |
17 |
یک مدل ریاضی چند منظوره برای زنجیره تامین داروسازی با توجه به تراکم دارو در کارخانهها
سال انتشار: 2022 - تعداد صفحات فایل pdf انگلیسی: 15 - تعداد صفحات فایل doc فارسی: 47 مدیریت زنجیره تامین ( SCM ) , به روش یکی از مسائل مهم در جنبه مدیریتی , نقش مهمی در مقابله با مسایل انسانی و مشکلات ایفا میکند . به دلیل برخی محدودیتها ( به عنوان مثال , ظرفیت تولید و ظرفیت ذخیرهسازی ) و خواسته ها( به عنوان مثال , کاهش هزینه و افزایش درآمد ) , مدیران زنجیره تامین همیشه به دنبال بهترین پاسخ به مقدار و نوع ارتباط بین سطوح مختلف SCM هستند . در تحقیقات آتی , یک زنجیره تامین دارو ( PSC ) با سه تابع هدف توسعهیافته , با هدف به حداقل رساندن هزینههای کلی , خواستههای برآورده نشده , و کاهش زمان انتظار در ورودی کارخانه . در تحقیقات آتی , موضوع کلی و تحقیقات در مدلسازی PSC و حل مساله مورد بحث قرار گرفتهاند . سپس یک مدل برنامهریزی غیرخطی با تحقیقات قبلی برای حل کاستیهای موجود پیشنهاد شدهاست.
همچنین روشهای تصمیمگیری چند هدفه برای انطباق با اهداف متناقض مدل به طور همزمان استفاده میشوند . سپس نرمافزار تجاری GAMS برای حل مشکل اندازههای مختلف به کار میرود . در نهایت ، تحلیل حساسیت گسترده و ارزیابی نتایج مورد بحث قرار میگیرد و پیشنهادهای توسعه آتی ارایه میشوند. واژه های کاربردی : زنجیره تامین دارو | فسادپذیری | زمانبندی | فهرست | نظریه کیوینگ |
مقاله ترجمه شده |
18 |
Multi-Ontology Mapping Generative Adversarial Network in Internet of Things for Ontology Alignment
نگاشت چند هستی شناسی شبکه متخاصم مولد در اینترنت اشیا برای تراز هستی شناسی-2022 On the Semantic web, ontologies are thought to be the remedy to data heterogeneity, and
correlating ontologies is a highly effective technique. Although the use of representation
learning approaches to a variety of applications has showed significant promise, they have had
little effect on the issue of ontology matching and classification. In order to establish
alignments between two ontologies, this research presents the Multi-Ontology Mapping
Generative Adversarial Network in Internet of Things (MOMGANI). For the instance of
ontology mapping, we suggest using a two-system representation learning network consisting
of a Generator and Discriminator. The Generator applies a probabilistic softmax classifier to
the different Name, Label, Comments, Properties, Instance descriptions, concept
characteristics, and the neighbourhood concepts for each of the ontologys properties. In order
to support the assertions that the Generator has generated, the Discriminator network employs
a novel Bidirectional Long Short-Term Memory (Bi-LSTM network) with an Ontology
Attention mechanism enhanced by the concept’s descriptions. As a result, both systems are in
a feedback mechanism where they can learn from one another. The system will produce a set
of triples that list all the associated concepts from various ontologies as its final product.
Domain experts will review these triples outside of the band to ensure that only true concepts
and triples are chosen for the alignment. In comparison to using the ontologies separately, the
aligned ontology enables extended querying and inference across related ontologies and
domains. Considering metrics like recall, precision, and F-measure, the experimental
evaluation was performed utilizing the datasets for classes alignment, property alignment, and
instances alignment. The proposed architecture provides a recall, precision, and F-measure of
0.92, 0.99, and 0.83 respectively which reveals that this model outperforms the traditional
methods.
Keywords: Generative adversarial network | Ontology alignment | IoT and OntoGenerator and OntoLSTM |
مقاله انگلیسی |
19 |
Performance evaluation of Focused Beam Routing for IoT applications in underwater environment
ارزیابی عملکرد مسیریابی پرتو متمرکز برای کاربردهای اینترنت اشیا در محیط زیر آب-2022 Underwater applications are becoming more and more interesting to industry and academy.
They include data gathering for human safety and environment monitoring, control of underwater robots for various tasks and so on. Because of the accessibility limitations in underwater
environment, applications tend to be automated and delay tolerant. In this paper, we consider
IoT applications in underwater environment, while using Delay Tolerant Networking (DTN)
carry–store–forwarding paradigm. DTN routing protocols are used to forward data from the
monitoring mobile sensors to collecting devices at the water surface and vice-versa. One
characteristic of routing protocols for DTN is flooding of messages to increase the delivery
probability. For instance, Epidemic Routing (ER) protocol creates a copy of each message for
each new node that does not already have the message in its memory. This increases the
probability of delivery, but on the other hand, creates overhead in each node’s buffer, and uses
a lot of valuable energy from the forwarding and receiving nodes. This work aims to analyze by
simulations the performance of Focused Beam Routing (FBR) protocol for different FBR angles
and different applications. We use Delivery Probability, Average Number of Hops, Overhead
Ratio and Buffer Occupancy to simulate our scenarios by The ONE simulator. Simulation results
show that for narrow angles of FBR the performance is better. In case of FBR-45, average
hop count and overhead ratio are decreased by 10.9% and 16.6% respectively, compared to
FBR-180. However, delivery probability decreases by only 3.9%.
Keywords: Underwater environment | Delay tolerant network | DTN | Focused Beam Routing | FBR the ONE simulator |
مقاله انگلیسی |
20 |
Publish–Subscribe approaches for the IoT and the cloud: Functional and performance evaluation of open-source systems
رویکردهای انتشار – اشتراک برای اینترنت اشیا و ابر: ارزیابی عملکرد و کارایی سیستمهای منبع باز-2022 Publish–Subscribe systems facilitate the communication between services or applications. A
typical system comprises the publisher, the subscriber, and the broker but, may also feature
message queues, databases, clusters, or federations of brokers, apply message delivery policies,
communication protocols, security services, and a streaming API. Not all these features are
supported by all systems or, others may be optional. As a result, there is no common ground
for the comparison of Publish–Subscribe systems. This paper presents a critical survey and
taxonomy of Publish–Subscribe systems, of their design features and technologies. The concepts
of message queuing, publish–subscribe systems, and publish–subscribe protocols for the cloud
and the IoT are discussed and clarified. The respective evaluation is about seven state-of-the-art
open-source systems namely, Apache Kafka, RabbitMQ, Orion-LD, Scorpio, Stellio, Pushpin, and
Faye. For the sake of fair comparison, a minimum set of common features is identified in all
systems. All systems are evaluated and compared in terms of functionality and performance
under real-case scenarios.
keywords: صف پیام | انتشار – اشتراک | معیارها | ارزیابی | Message queue | Publish–subscribe | Benchmarks | Evaluation |
مقاله انگلیسی |