We exhibit a probabilistic symbolic algorithm for solving zero-dimensional sparse systems. Our algorithm combines a symbolic
homotopy procedure, based on a flat deformation of a certain morphism of affine varieties, with the polyhedral deformation
of Huber and Sturmfels. The complexity of our algorithm is cubic in the size of the combinatorial structure of the input system.
This size is mainly represented by the cardinality and mixed volume of Newton polytopes of the input polynomials and an arithmetic
analogue of the mixed volume associated to the deformations under consideration.
Research was partially supported by the following grants: UBACyT X112 (2004–2007), UBACyT X847 (2006–2009), PIP CONICET 2461,
PIP CONICET 5852/05, ANPCyT PICT 2005 17-33018, UNGS 30/3005, MTM2004-01167 (2004–2007), MTM2007-62799 and CIC 2007–2008. 相似文献
The interplay of such cornerstones of modern nonlinear fiber optics as a nonlinearity, stochasticity and polarization leads to variety of the noise induced instabilities including polarization attraction and escape phenomena harnessing of which is a key to unlocking the fiber optic systems specifications required in high resolution spectroscopy, metrology, biomedicine and telecommunications. Here, by using direct stochastic modeling, the mapping of interplay of the Raman scattering‐based nonlinearity, the random birefringence of a fiber, and the pump‐to‐signal intensity noise transfer has been done in terms of the fiber Raman amplifier parameters, namely polarization mode dispersion, the relative intensity noise of the pump laser, fiber length, and the signal power. The obtained results reveal conditions for emergence of the random birefringence‐induced resonance‐like enhancement of the gain fluctuations (stochastic anti‐resonance) accompanied by pulse broadening and rare events in the form of low power output signals having probability heavily deviated from the Gaussian distribution.
A sparse representation-based two-phase classification algorithm is proposed for off-line handwritten Tibetan character recognition. The first phase realizes coarse classification with the K-NN classifier by finding the K nearest neighbours of a test sample in the dictionary constructed by K-SVD with samples of all classes, and the classes of these neighbours are regarded as the candidate classes of the test sample. The second phase performs fine classification with the sparse representation classifier by sparsely representing the test sample with all elements of the dictionary constructed by K-SVD with samples of all candidate classes, and the test sample is finally classified into the candidate class with the maximal contribution in sparse representation. Experiments on the Tibetan off-line handwritten character database show that an optimal recognition rate of 97.17% has been reached and it is 2.12% higher than that of K-NN. 相似文献