The well understood structure of $U_{pmns}$ matrix mandates a Cabibbo mixing in the first two generations charged lepton sector if we assume Tri-bimaximal neutrino sector. This ansatz, called Tri-bimaximal-Cabibbo mixing, is ruled out immediately by experiments searching for flavour violating currents. In this article, aim to show that resurrection theoretically motivated scenario comes natural...

For pension-savers, a low payoff is a financial disaster. Such investors will most likely prefer left-skewed payoff distributions over right-skewed payoff distributions. We explore how such distributions can be delivered. Cautious-relaxed utility measures are cautious in ensuring that payoffs don’t fall much below a reference value, but relaxed about exceeding it. We find that the payoff distri...

We consider an optimal control problem described by a second order elliptic boundary value problem, jointly nonlinear in the state and control with high monotone nonlinearity in the state, with control and state constraints, where the state constraints and cost functional involve also the state gradient. Since no convexity assumptions are made, the problem may have no classical solutions, and s...

The composite-likelihood estimator (CLE) of the population recombination rate considers only sites with exactly two alleles under a finite-sites mutation model (McVean, G. A. T., P. Awadalla, and P. Fearnhead. 2002. A coalescent-based method for detecting and estimating recombination from gene sequences. Genetics 160:1231-1241). While in such a model the identity of alleles is not considered, t...

The synthesis of pharmaceuticals and catalysts more and more relies on enantiopure chiral building blocks. These can be produced in an environmentally benign and efficient way via bioreduction of prochiral ketones catalyzed by dehydrogenases. A productive source of these biocatalysts is the yeast Saccharomyces cerevisiae, whose genome also encodes a reductase catalyzing the sequential reduction...

This paper presents a newmodel of support vector machines (SVMs) that handle data with tolerance and uncertainty. The constraints of the SVM are converted to fuzzy inequality. Giving more relaxation to the constraints allows us to consider an importance degree for each training samples in the constraints of the SVM. The new method is called relaxed constraints support vector machines (RSVMs). A...

In previous work, we have introduced the technique of relaxed power series computations. With this technique, it is possible to solve implicit equations almost as quickly as doing the operations which occur in the implicit equation. Here almost as quickly means that we need to pay a logarithmic overhead. In this paper, we will show how to reduce this logarithmic factor in the case when the cons...