2,005 research outputs found
Strong fairness and ultra metrics
AbstractWe answer an open question of Costa and Hennessy and present a characterization of the infinite fair computations in finite labeled transition systems—without any structure of the states—as cluster points in metric spaces. This technique is applied to reduce the logical complexity of several known fairness concepts from Π03 to Π02 and from Σ11 to Π03, respectively
Open-Source Telemedicine Platform for Wireless Medical Video Communication
An m-health system for real-time wireless communication of medical video based on open-source software is presented. The objective is to deliver a low-cost telemedicine platform which will allow for reliable remote diagnosis m-health applications such as emergency incidents, mass population screening, and medical education purposes. The performance of the proposed system is demonstrated using five atherosclerotic plaque ultrasound videos. The videos are encoded at the clinically acquired resolution, in addition to lower, QCIF, and CIF resolutions, at different bitrates, and four different encoding structures. Commercially available wireless local area network (WLAN) and 3.5G high-speed packet access (HSPA) wireless channels are used to validate the developed platform. Objective video quality assessment is based on PSNR ratings, following calibration using the variable frame delay (VFD) algorithm that removes temporal mismatch between original and received videos. Clinical evaluation is based on atherosclerotic plaque ultrasound video assessment protocol. Experimental results show that adequate diagnostic quality wireless medical video communications are realized using the designed telemedicine platform. HSPA cellular networks provide for ultrasound video transmission at the acquired resolution, while VFD algorithm utilization bridges objective and subjective ratings
Geometric creation of quantum vorticity
We consider superfluidity and quantum vorticity in rotating spacetimes. The
system is described by a complex scalar satisfying a nonlinear Klein-Gordon
equation. Rotation terms are identified and found to lead to the transfer of
angular momentum of the spacetime to the scalar field. The scalar field
responds by rotating, physically behaving as a superfluid, through the creation
of quantized vortices. We demonstrate the vortex nucleation through numerical
simulation.Comment: 10 pages, 1 figure, updated to closely resemble published versio
Probabilistic Shaping for Finite Blocklengths: Distribution Matching and Sphere Shaping
In this paper, we provide for the first time a systematic comparison of
distribution matching (DM) and sphere shaping (SpSh) algorithms for short
blocklength probabilistic amplitude shaping. For asymptotically large
blocklengths, constant composition distribution matching (CCDM) is known to
generate the target capacity-achieving distribution. As the blocklength
decreases, however, the resulting rate loss diminishes the efficiency of CCDM.
We claim that for such short blocklengths and over the additive white Gaussian
channel (AWGN), the objective of shaping should be reformulated as obtaining
the most energy-efficient signal space for a given rate (rather than matching
distributions). In light of this interpretation, multiset-partition DM (MPDM),
enumerative sphere shaping (ESS) and shell mapping (SM), are reviewed as
energy-efficient shaping techniques. Numerical results show that MPDM and SpSh
have smaller rate losses than CCDM. SpSh--whose sole objective is to maximize
the energy efficiency--is shown to have the minimum rate loss amongst all. We
provide simulation results of the end-to-end decoding performance showing that
up to 1 dB improvement in power efficiency over uniform signaling can be
obtained with MPDM and SpSh at blocklengths around 200. Finally, we present a
discussion on the complexity of these algorithms from the perspective of
latency, storage and computations.Comment: 18 pages, 10 figure
Improving the Hardware Performance of Arithmetic Circuits using Approximate Computing
An application that can produce a useful result despite some level of computational error is said to be error resilient. Approximate computing can be applied to error resilient applications by intentionally introducing error to the computation in order to improve performance, and it has been shown that approximation is especially well-suited for application in arithmetic computing hardware. In this thesis, novel approximate arithmetic architectures are proposed for three different operations, namely multiplication, division, and the multiply accumulate (MAC) operation. For all designs, accuracy is evaluated in terms of mean relative error distance (MRED) and normalized mean error distance (NMED), while hardware performance is reported in terms of critical path delay, area, and power consumption.
Three approximate Booth multipliers (ABM-M1, ABM-M2, ABM-M3) are designed in which two novel inexact partial product generators are used to reduce the dimensions of the partial product matrix. The proposed multipliers are compared to other state-of-the-art designs in terms of both accuracy and hardware performance, and are found to reduce power consumption by up to 56% when compared to the exact multiplier. The function of the multipliers is verified in several image processing applications.
Two approximate restoring dividers (AXRD-M1, AXRD-M2) are proposed along with a novel inexact restoring divider cell. In the first divider, the conventional cells are replaced with the proposed inexact cells in several columns. The second divider computes only a subset of the trial subtractions, after which the divisor and partial remainder are rounded and encoded so that they may be used to estimate the remaining quotient bits. The proposed dividers are evaluated for accuracy and hardware performance alongside several benchmarking designs, and their function is verified using change detection and foreground extraction applications.
An approximate MAC unit is presented in which the multiplication is implemented using a modified version of ABM-M3. The delay is reduced by using a fused architecture where the accumulator is summed as part of the multiplier compression. The accuracy and hardware savings of the MAC unit are measured against several works from the literature, and the design is utilized in a number of convolution operations
Gravitating discs around black holes
Fluid discs and tori around black holes are discussed within different
approaches and with the emphasis on the role of disc gravity. First reviewed
are the prospects of investigating the gravitational field of a black
hole--disc system by analytical solutions of stationary, axially symmetric
Einstein's equations. Then, more detailed considerations are focused to middle
and outer parts of extended disc-like configurations where relativistic effects
are small and the Newtonian description is adequate.
Within general relativity, only a static case has been analysed in detail.
Results are often very inspiring, however, simplifying assumptions must be
imposed: ad hoc profiles of the disc density are commonly assumed and the
effects of frame-dragging and completely lacking. Astrophysical discs (e.g.
accretion discs in active galactic nuclei) typically extend far beyond the
relativistic domain and are fairly diluted. However, self-gravity is still
essential for their structure and evolution, as well as for their radiation
emission and the impact on the environment around. For example, a nuclear star
cluster in a galactic centre may bear various imprints of mutual star--disc
interactions, which can be recognised in observational properties, such as the
relation between the central mass and stellar velocity dispersion.Comment: Accepted for publication in CQG; high-resolution figures will be
available from http://www.iop.org/EJ/journal/CQ
- …