No abstract uploaded!

We describe the potential functions for N= 4B supersymmetric quantum mechanics with D (2, 1; ) symmetry.

We develop an expectation-maximization algorithm with local adaptivity for image segmentation and classification. The key idea of our approach is to combine global statistics extracted from the Gaussian mixture model or other proper statistical models with local statistics and geometrical information, such as local probability distribution, orientation, and anisotropy. The combined information is used to design an adaptive local classification strategy that improves the robustness of the algorithm and also keeps fine features in the image. The proposed methodology is flexible and can be easily generalized to deal with other inferred information/quantities and statistical methods/models.

We consider the zero heat conductivity limit to a contact discontinuity for the mono-dimensional full compressible Navier--Stokes--Fourier system. The method is based on the relative entropy method and does not assume any smallness conditions on the discontinuity nor on the bounded variation norm of the initial data. It is proved that for any viscosity , the solution of the compressible Navier--Stokes--Fourier system (with well-prepared initial value) converges, when the heat conductivity tends to zero, to the contact discontinuity solution to the corresponding Euler system. We obtain the decay rate . It implies that the heat conductivity dominates the dissipation in the regime of the limit to a contact discontinuity. This is the first result, based on the relative entropy, of an asymptotic limit to a discontinuous solution for a system.

We use an RLWE-based key exchange scheme to construct a simple and efficient post-quantum oblivious transfer based on the Ring Learning with Errors assumption. We prove that our protocol is secure in the Universal Composability framework against static malicious adversaries in the random oracle model. The main idea of the protocol is that the receiver and the sender interact using the RLWE-based key exchange in such a way that the sender computes two keys, one of them shared with the receiver. It is infeasible for the sender to know which is the shared key and for the receiver to get information about the other one. The sender encrypts each message with each key using a symmetric-key encryption scheme and the receiver can only decrypt one of the ciphertexts. The protocol is extremely efficient in terms of computational and communication complexity, and thus a strong candidate for post-quantum applications.