812 resultados para Blind scholars
Resumo:
This issue of the QUT Law Review features an Emerging Scholars’ section containing contributions from early career researchers and doctoral students. This section was conceived by the previous General Editor of the journal, Prof Dan Hunter, as a forum to showcase high-quality legal scholarship from emerging scholars. We are grateful to Prof Hunter for his work on this initiative.
Resumo:
This issue of the QUT Law Review also features an Emerging Scholars’ section containing contributions from early career researchers and doctoral students. This section was conceived by the previous General Editor of the journal, Prof Dan Hunter, as a forum to showcase high-quality legal scholarship from emerging scholars. We are grateful to Prof Hunter for his work on this initiative.
Resumo:
Digital Image
Resumo:
Digital Image
Resumo:
Digital Image
Resumo:
Digital Image
Resumo:
We report a hierarchical blind script identifier for 11 different Indian scripts. An initial grouping of the 11 scripts is accomplished at the first level of this hierarchy. At the subsequent level, we recognize the script in each group. The various nodes of this tree use different feature-classifier combinations. A database of 20,000 words of different font styles and sizes is collected and used for each script. Effectiveness of Gabor and Discrete Cosine Transform features has been independently, evaluated using nearest neighbor linear discriminant and support vector machine classifiers. The minimum and maximum accuracies obtained, using this hierarchical mechanism, are 92.2% and 97.6%, respectively.
Resumo:
In this paper, we present robust semi-blind (SB) algorithms for the estimation of beamforming vectors for multiple-input multiple-output wireless communication. The transmitted symbol block is assumed to comprise of a known sequence of training (pilot) symbols followed by information bearing blind (unknown) data symbols. Analytical expressions are derived for the robust SB estimators of the MIMO receive and transmit beamforming vectors. These robust SB estimators employ a preliminary estimate obtained from the pilot symbol sequence and leverage the second-order statistical information from the blind data symbols. We employ the theory of Lagrangian duality to derive the robust estimate of the receive beamforming vector by maximizing an inner product, while constraining the channel estimate to lie in a confidence sphere centered at the initial pilot estimate. Two different schemes are then proposed for computing the robust estimate of the MIMO transmit beamforming vector. Simulation results presented in the end illustrate the superior performance of the robust SB estimators.
Resumo:
In this letter, we propose a method for blind separation of d co-channel BPSK signals arriving at an antenna array. Our method involves two steps. In the first step, the received data vectors at the output of the array is grouped into 2d clusters. In the second step, we assign the 2d d-tuples with ±1 elements to these clusters in a consistent fashion. From the knowledge of the cluster to which a data vector belongs, we estimate the bits transmitted at that instant. Computer simulations are used to study the performance of our method
Resumo:
The problem of estimating multiple Carrier Frequency Offsets (CFOs) in the uplink of MIMO-OFDM systems with Co-Channel (CC) and OFDMA based carrier allocation is considered. The tri-linear data model for generalized, multiuser OFDM system is formulated. Novel blind subspace based estimation of multiple CFOs in the case of arbitrary carrier allocation scheme in OFDMA systems and CC users in OFDM systems based on the Khatri-Rao product is proposed. The method works where the conventional subspace method fails. The performance of the proposed methods is compared with pilot based Least-Squares method.
Resumo:
Any waterway with one end closed and the other open is generally called a blind channel. The main flow tends to expand, separate, and cause circulation at the mouth of blind channels. The main flow continuously transfers momentum and sediment into the circulation region through the turbulent mixing region (TMR) between them, thus leading to a large amount of sediment deposition in the blind channels. This paper experimentally investigated the properties of the water flow and sediment diffusion in TMR, demonstrating that both water flow and sediment motion in TMR approximately coincide with a similar structure as in the free mixing layer induced by a jet. The similarity functions of flow velocity and sediment concentration are then assumed, based on observation, and the resulting calculation of these functions is substantially facilitated. For the kind of low velocity flow system of blind channels with a finite width, a simple formula for the sediment deposition rate in blind channels is established by analyzing the gradient of crosswise velocity and sediment concentration in TMR.
Resumo:
We consider the problem of blind multiuser detection. We adopt a Bayesian approach where unknown parameters are considered random and integrated out. Computing the maximum a posteriori estimate of the input data sequence requires solving a combinatorial optimization problem. We propose here to apply the Cross-Entropy method recently introduced by Rubinstein. The performance of cross-entropy is compared to Markov chain Monte Carlo. For similar Bit Error Rate performance, we demonstrate that Cross-Entropy outperforms a generic Markov chain Monte Carlo method in terms of operation time.
Resumo:
We present methods for fixed-lag smoothing using Sequential Importance sampling (SIS) on a discrete non-linear, non-Gaussian state space system with unknown parameters. Our particular application is in the field of digital communication systems. Each input data point is taken from a finite set of symbols. We represent transmission media as a fixed filter with a finite impulse response (FIR), hence a discrete state-space system is formed. Conventional Markov chain Monte Carlo (MCMC) techniques such as the Gibbs sampler are unsuitable for this task because they can only perform processing on a batch of data. Data arrives sequentially, so it would seem sensible to process it in this way. In addition, many communication systems are interactive, so there is a maximum level of latency that can be tolerated before a symbol is decoded. We will demonstrate this method by simulation and compare its performance to existing techniques.