Search results for "Process"
showing 10 items of 22310 documents
Automatic program for peak detection and deconvolution of multi-overlapped chromatographic signals
2005
Several interlinked algorithms for peak deconvolution by non-linear regression are presented. These procedures, together with the peak detection methods outlined in Part I, have allowed the implementation of an automatic method able to process multi-overlapped signals, requiring little user interaction. A criterion based on the evaluation of the multivariate selectivity of the chromatographic signal is used to auto-select the most efficient deconvolution procedure for each chromatographic situation. In this way, non-optimal local solutions are avoided in cases of high overlap, and short computation times are obtained in situations of high resolution. A new algorithm, fitting both the origin…
Sparse Deconvolution Using Support Vector Machines
2008
Sparse deconvolution is a classical subject in digital signal processing, having many practical applications. Support vector machine (SVM) algorithms show a series of characteristics, such as sparse solutions and implicit regularization, which make them attractive for solving sparse deconvolution problems. Here, a sparse deconvolution algorithm based on the SVM framework for signal processing is presented and analyzed, including comparative evaluations of its performance from the points of view of estimation and detection capabilities, and of robustness with respect to non-Gaussian additive noise. Publicado
A sensor-data-based denoising framework for hyperspectral images
2015
Many denoising approaches extend image processing to a hyperspectral cube structure, but do not take into account a sensor model nor the format of the recording. We propose a denoising framework for hyperspectral images that uses sensor data to convert an acquisition to a representation facilitating the noise-estimation, namely the photon-corrected image. This photon corrected image format accounts for the most common noise contributions and is spatially proportional to spectral radiance values. The subsequent denoising is based on an extended variational denoising model, which is suited for a Poisson distributed noise. A spatially and spectrally adaptive total variation regularisation term…
Iterative sparse matrix-vector multiplication for accelerating the block Wiedemann algorithm over GF(2) on multi-graphics processing unit systems
2012
SUMMARY The block Wiedemann (BW) algorithm is frequently used to solve sparse linear systems over GF(2). Iterative sparse matrix–vector multiplication is the most time-consuming operation. The necessity to accelerate this step is motivated by the application of BW to very large matrices used in the linear algebra step of the number field sieve (NFS) for integer factorization. In this paper, we derive an efficient CUDA implementation of this operation by using a newly designed hybrid sparse matrix format. This leads to speedups between 4 and 8 on a single graphics processing unit (GPU) for a number of tested NFS matrices compared with an optimized multicore implementation. We further present…
On the Statistical Properties of Capacity Outage Intervals in OSTBC-MIMO Rayleigh Fading Channels
2016
This paper deals mainly with the study of the asymptotic probability density functions (PDFs) of the outage durations of the instantaneous capacity of orthogonal space-time block code (OSTBC) multiple-input multiple-output (MIMO) systems over Rayleigh channels. Drawing upon known statistical properties for the asymptotic behavior of chi-squared processes at low levels, we provide approximate solutions for the PDF, the cumulative distribution function (CDF), and the $k$ th-order moments of the outage intervals of the underlying capacity processes. Then, as an application of the derived PDF, the performance assessment of capacity simulators is reported. Following this, we introduce the newly …
Exact Closed-Form Expressions for the Distribution, the Level-Crossing Rate, and the Average Duration of Fades of the Capacity of OSTBC-MIMO Channels
2009
Article from the journal: IEEE Transactions on Vehicular Technology Official site: http://dx.doi.org/10.1109/TVT.2008.927038 This paper deals with some important statistical properties of the channel capacity of multiple-input-multiple-output (MIMO) systems with orthogonal space-time block code (OSTBC) transmission. We assume that all the subchannels are uncorrelated. For OSTBC-MIMO systems, exact closed-form expressions are derived for the probability density function (PDF), the cumulative distribution function (CDF), the level-crossing rate (LCR), and the average duration of fades (ADF) of the channel capacity. Furthermore, it will be shown that these exact closed-form expressions can be …
On the decomposition of prefix codes
2017
Abstract In this paper we focus on the decomposition of rational and maximal prefix codes. We present an effective procedure that allows us to decide whether such a code is decomposable. In this case, the procedure also produces the factors of some of its decompositions. We also give partial results on the problem of deciding whether a rational maximal prefix code decomposes over a finite prefix code.
Optimal Sampling Period and Required Number of Samples for OSTBC-MIMO Rayleigh Fading Channel Capacity Simulators
2014
The purpose of this paper is to contribute to the performance assessment of channel capacity simulators. Here, we consider the instantaneous capacity (also referred to as the mutual information) in orthogonal space-time block code (OSTBC) transceiver systems over multiple-input multiple-output (MIMO) Rayleigh fading channels. To ensure that the level-crossing rate (LCR) of the instantaneous capacity can efficiently and accurately be simulated, we derive closed-form approximate solutions to the optimal sampling period and the required number of samples to be generated. Several numerical examples will be presented to illustrate the usefulness of our procedure. It will also be shown that the d…
Determinants of Blockchain Technology Introduction in Organizations: an Empirical Study among Experienced Practitioners
2021
Abstract Blockchain is expected to enable new types of interorganizational relationships, new approaches to governance and new approaches to settlement and clearing processes. Neverthless, although the interest on blockchain is on the rise, there are not many blockchain implementations in organizations and there is limited empirical research investigating the reasons for this. This paper contributes to filling this gap by investigating the following research question: what are the impeding and motivating factors for organizational blockchain adoption? Data were collected through a survey based on pairwise comparisons of key factors identified in the literature. The data collected were analy…
Low light level in vitro monitoring of cellular and antigen-antibody reactions using a photon detection camera system — New perspectives for clinical…
1990
This article briefly describes the use of a photon counting system (ARGUS-100) in the detection of low levels of light. The ARGUS-100 was used in determining ATP in cell sections from tumor tissues and in measuring a luminescence-enhanced immunoluminometric assay, using ferritin as the analyte, based on the luminol-peroxide-4-iodophenol reaction with peroxidase as the enzyme. The aim is not so much the presentation of data, but rather to show the potentials of the photon counting camera in increasing our knowledge of the cellular and subcellular levels, as well as lowering the detection limits in already sensitive systems, such as immunoassays.