Summary We introduce a new online algorithm for expected loglikelihood maximization in situations where the objective function is multimodal or has saddle points. The key element underpinning probability distribution that concentrates on target parameter value as sample size increases and can be efficiently estimated by means of standard particle filter algorithm. This depends learning rate, su...

In this paper, we present the pseudo-collision, pseudo-second-preimage and pseudo-preimage attacks on the SHA-3 candidate algorithm Luffa. The pseudocollisions and pseudo-second-preimages can be found easily by computing the inverse of the message injection function at the beginning of Luffa. We explain in details the pseudo-preimage attacks. For Luffa-224/256, given the hash value, only 2 iter...

We consider pseudo-unitary quantum systems and discuss various properties of pseudounitary operators. In particular we prove a characterization theorem for block-diagonalizable pseudo-unitary operators with finite-dimensional diagonal blocks. Furthermore, we show that every pseudo-unitary matrix is the exponential of i = √ −1 times a pseudo-Hermitian matrix, and determine the structure of the L...

We introduce the notion of pseudo-Hermiticity and show that every Hamiltonian with a real spectrum is pseudo-Hermitian. We point out that all the PT -symmetric non-Hermitian Hamiltonians studied in the literature are pseudo-Hermitian and argue that the structure responsible for the reality of the spectrum of these Hamiltonian is their pseudo-Hermiticity not PT -symmetry. We explore the basic pr...

We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents determine whether they are the lectically first n pseudo-intents. We show that this problem is coNPhard. We thereby show that there cannot be an algorithm with a good theoretical complexity for enumerating pseudo-intents...

This paper presents a new pseudo pin assignment algorithm for crosstalk noise control in multi-layer gridless general area routing. It also tends to minimize the number of vias needed in detailed routing. Our approach consists of two steps: coarse pseudo pin assignment and detailed pseudo pin assignment. Coarse pseudo pin assignment uses the crosstalk noise constraints to estimate the spacing r...

a pseudo aneurysm results from leakage of blood from an artery after trauma or dehiscence or separation of a surgical anastomosis. the reported rate of pseudo aneurysm in access sites range from 0.88% to 8%. it has some cause like penetrating trauma, blunt trauma and endovascular procedure. the differential diagnoses of this lesion are hematoma, av fistula, lymphadenopathy, lymphocele, dvt, com...

Pseudo-Laplace transform is an important notion from pseudo-analysis’ framework that is often used in dealing with differential or integral equation. The (⊕, ̄)-Laplace transform considered here is a generalization of the pseudo-Laplace transform based on a special class of generalized pseudo-operations that need not be commutative nor associative. This pseudo-Laplace type transform has been use...

We introduce the notion of pseudo-Hermiticity and show that every Hamiltonian with a real spectrum is pseudo-Hermitian. We point out that all the PT -symmetric non-Hermitian Hamiltonians studied in the literature belong to the class of pseudo-Hermitian Hamiltonians, and argue that the basic structure responsible for the particular spectral properties of these Hamiltonians is their pseudo-Hermit...

Pseudo-BCK algebras were introduced by G. Georgescu and A. Iorgulescu as a generalization of BCK algebras. Their properties and connections with other fuzzy structures were established by A. Iorgulescu and J. Kühr. In this paper we study the class of perfect pseudo-BCK algebras with pseudo-product and we prove that any perfect pseudo-BCK algebra with pseudo-product is strongly bipartite. Anothe...