A pseudo-Boolean function is a function from a 0/1-vector to the reals. Minimizing pseudo-Boolean functions is a very general problem with many applications. In image analysis, the problem arises in segmentation or as a subroutine in task like stero estimation and image denoising. Recent years have seen an increased interest in higher-degree problems, as opposed to quadratic pseudo-Boolean func...

Let (M, θ) be a strictly pseudoconvex pseudo-Hermitian compact hypersurface in C in the sense of Webster [34] with a pseudo-Hermitian real oneform θ on M . Let Rθ be the Webster pseudo scalar curvature for M with respect to θ. By the solution of the CR Yamabe problem given by Jerison and Lee [18], Gamara and Yacoub [10] and Gamara [9] (for n = 1), there is a pseudo-Hermitian real one-form θ so ...

Corrosion in general is a complex interaction between water and metal surfaces and materials in which the water is stored or transported. Water quality monitoring in terms of corrosion and scaling is crucial, and a key element of preventive maintenance, given the economic and health hurts caused by corrosion and scaling in water utilities. The aim of this study is to determine the best model fo...

We present the pseudo-ǫ expansions (τ -series) for the critical exponents of a λφ4 threedimensional O(n)-symmetric model obtained on the basis of six-loop renormalization-group expansions. Concrete numerical results are presented for physically interesting cases n = 1, n = 2, n = 3 and n = 0, as well as for 4 ≤ n ≤ 32 in order to clarify the general properties of the obtained series. The pseudo...

In the first part of this work, we introduce a new type of pseudo-random function for which “aggregate queries” over exponential-sized sets can be efficiently answered. We show how to use algebraic properties of underlying classical pseudo random functions, to construct such “aggregate pseudo-random functions” for a number of classes of aggregation queries under cryptographic hardness assumptio...

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...

Hamsi is one of the second round candidates of the SHA-3 competition. In this study, we present non-random differential properties for the compression function of the hash function Hamsi-256. Based on these properties, we first demonstrate a distinguishing attack that requires a few evaluations of the compression function and extend the distinguisher to 5 rounds with complexity 2. Then, we pres...

A pseudo-random function is a fundamental cryptographic primitive that is essential for encryp-tion, identiication and authentication. We present a new cryptographic primitive called pseudo-random synthesizer and show how to use it in order to get a parallel construction of a pseudo-random function. We show several NC 1 implementations of synthesizers based on concrete intractability assumption...

We propose hierarchical clustering and filtering methods for the analysis of spatio–temporal multidimensional time series, where both methods are based on a new pseudo distance. The pseudo distance is determined between orthogonal matrices, which are derived by eigenvalue decomposition of the variance–covariance matrix of the time series. Because the grouping algorithm is also important in clus...