با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (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 |
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. |
مقاله انگلیسی |
3 |
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. |
مقاله انگلیسی |
4 |
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 |
مقاله انگلیسی |
5 |
Head tremor in cervical dystonia: Quantifying severity with computer vision
لرزش سر در دیستونی دهانه رحم: کمی کردن شدت با دید کامپیوتری-2022 Background: Head tremor (HT) is a common feature of cervical dystonia (CD), usually quantified by subjective
observation. Technological developments offer alternatives for measuring HT severity that are objective and
amenable to automation.
Objectives: Our objectives were to develop CMOR (Computational Motor Objective Rater; a computer vision-
based software system) to quantify oscillatory and directional aspects of HT from video recordings during a
clinical examination and to test its convergent validity with clinical rating scales.
Methods: For 93 participants with isolated CD and HT enrolled by the Dystonia Coalition, we analyzed video
recordings from an examination segment in which participants were instructed to let their head drift to its most
comfortable dystonic position. We evaluated peak power, frequency, and directional dominance, and used
Spearman’s correlation to measure the agreement between CMOR and clinical ratings.
Results: Power averaged 0.90 (SD 1.80) deg2/Hz, and peak frequency 1.95 (SD 0.94) Hz. The dominant HT axis
was pitch (antero/retrocollis) for 50%, roll (laterocollis) for 6%, and yaw (torticollis) for 44% of participants.
One-sided t-tests showed substantial contributions from the secondary (t = 18.17, p < 0.0001) and tertiary (t =
12.89, p < 0.0001) HT axes. CMOR’s HT severity measure positively correlated with the HT item on the Toronto
Western Spasmodic Torticollis Rating Scale-2 (Spearman’s rho = 0.54, p < 0.001).
Conclusions: We demonstrate a new objective method to measure HT severity that requires only conventional
video recordings, quantifies the complexities of HT in CD, and exhibits convergent validity with clinical severity
ratings. keywords: لرزش سر | ویدیو | بینایی کامپیوتر | درجه بندی شدت | TWSTRS | Head tremor | Video | Computer vision | Severity rating | TWSTRS |
مقاله انگلیسی |
6 |
Efficient Quantum State Preparation for the Cauchy Distribution Based on Piecewise Arithmetic
آماده سازی حالت کوانتومی کارآمد برای توزیع کوشی بر اساس حساب تکه ای-2022 The benefits of the quantum Monte Carlo algorithm heavily rely on the efficiency of the
superposition state preparation. So far, most reported Monte Carlo algorithms use the Grover–Rudolph state
preparation method, which is suitable for efficiently integrable distribution functions. Consequently, most reported works are based on log-concave distributions, such as normal distributions. However, non-log-concave
distributions still have many uses, such as in financial modeling. Recently, a new method was proposed
that does not need integration to calculate the rotation angle for state preparation. However, performing
efficient state preparation is still difficult due to the high cost associated with high precision and low error
in the calculation for the rotation angle. Many methods of quantum state preparation use polynomial Taylor
approximations to reduce the computation cost. However, Taylor approximations do not work well with
heavy-tailed distribution functions that are not bounded exponentially. In this article, we present a method
of efficient state preparation for heavy-tailed distribution functions. Specifically, we present a quantum
gate-level algorithm to prepare quantum superposition states based on the Cauchy distribution, which is a
non-log-concave heavy-tailed distribution. Our procedure relies on a piecewise polynomial function instead
of a single Taylor approximation to reduce computational cost and increase accuracy. The Cauchy distribution is an even function, so the proposed piecewise polynomial contains only a quadratic term and a constant
term to maintain the simplest approximation of an even function. Numerical analysis shows that the required
number of subdomains increases linearly as the approximation error decreases exponentially. Furthermore,
the computation complexity of the proposed algorithm is independent of the number of subdomains in the
quantum implementation of the piecewise function due to quantum parallelism. An example of the proposed
algorithm based on a simulation conducted in Qiskit is presented to demonstrate its capability to perform
state preparation based on the Cauchy distribution.
INDEX TERMS: Algorithms | gate operations | quantum computing. |
مقاله انگلیسی |
7 |
A computer vision-based method for bridge model updating using displacement influence lines
یک روش مبتنی بر بینایی کامپیوتری برای بهروزرسانی مدل پل با استفاده از خطوط موثر جابجایی-2022 This paper presents a new computer vision-based method that simultaneously provides the moving vehicle’s
tire loads, the location of the loads on a bridge, and the bridge’s response displacements, based on which the
bridge’s influence lines can be constructed. The method employs computer vision techniques to measure the
displacement influence lines of the bridge at different target positions, which is then later used to perform
model updating of the finite element models of the monitored structural system.
The method is enabled by a novel computer vision-based vehicle weigh-in-motion method which the coauthors recently introduced. A correlation discriminating filter tracker is used to estimate the displacements at target points and the location of single or multiple moving loads, while a low-cost, non-contact weigh-in-motion technique evaluates the magnitude of the moving vehicle loads. The method described in this paper is tested and validated using a laboratory bridge model. The system was loaded with a vehicle with pressurized tires and equipped with a monitoring system consisting of laser displacement sensors, accelerometers, and cameras. Both artificial and natural targets were considered in the experimental tests to track the displacements with the cameras and yielded robust results consistent with the laser displacement measurements. The extracted normalized displacement influence lines were then successfully used to perform model updating of the structure. The laser displacement sensors were used to validate the accuracy of the proposed computer vision-based approach in deriving the displacement measurements, while the accelerometers were used to derive the system’s modal properties employed to validate the updated finite element model. As a result, the updated finite element model correctly predicted the bridge’s displacements measured during the tests. Furthermore, the modal parameters estimated by the updated finite element model agreed well with those extracted from the experimental modal analysis carried out on the bridge model. The method described in this paper offers a low-cost non-contact monitoring tool that can be efficiently used without disrupting traffic for bridges in model updating analysis or long-term structural health monitoring. keywords: Computer vision | Displacement influence line | Vehicle weigh-in-motion | Structural identification | Finite element method model | Model updating | Modal analysis | Bridge systems |
مقاله انگلیسی |
8 |
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. |
مقاله انگلیسی |
9 |
Fuzzy Logic on Quantum Annealers
منطق فازی در آنیل های کوانتومی-2022 Quantum computation is going to revolutionize the world of
computing by enabling the design of massive parallel algorithms that solve
hard problems in an efficient way, thanks to the exploitation of quantum
mechanics effects, such as superposition, entanglement, and interference.
These computational improvements could strongly influence the way how
fuzzy systems are designed and used in contexts, such as Big Data, where
computational efficiency represents a nonnegligible constraint to be taken
into account. In order to pave the way toward this innovative scenario,
this article introduces a novel representation of fuzzy sets and operators
based on quadratic unconstrained binary optimization problems, so as to
enable the implementation of fuzzy inference engines on a type of quantum
computers known as quantum annealers.
Index Terms: Fuzzy logic | quantum computing | simulated annealing. |
مقاله انگلیسی |
10 |
General Mixed-State Quantum Data Compression With and Without Entanglement Assistance
فشرده سازی داده های کوانتومی حالت مخلوط عمومی با و بدون کمک درهم تنیدگی-2022 We consider the most general finite-dimensional
quantum mechanical information source, which is given by a
quantum system A that is correlated with a reference system R.
The task is to compress A in such a way as to reproduce the
joint source state ρAR at the decoder with asymptotically high
fidelity. This includes Schumacher’s original quantum source
coding problem of a pure state ensemble and that of a single
pure entangled state, as well as general mixed state ensembles.
Here, we determine the optimal compression rate (in qubits per
source system) in terms of the Koashi-Imoto decomposition of
the source into a classical, a quantum, and a redundant part.
The same decomposition yields the optimal rate in the presence
of unlimited entanglement between compressor and decoder, and
indeed the full region of feasible qubit-ebit rate pairs.
keywords: Quantum information | source coding | entanglement. |
مقاله انگلیسی |