Hyper-minimisation of deterministic nite automata is a recently introduced state reduction technique that allows a nite change in the recognised language. A generalisation of this lossy compression method to the weighted setting over semi elds is presented, which allows the recognised formal power series to di er for nitely many input strings. First, the structure of hyper-minimal deterministic...

Hyper-minimisation of deterministic finite automata is a recently introduced state reduction technique that allows a finite change in the recognised language. A generalisation of this lossy compression method to the weighted setting over semifields is presented, which allows the recognised formal power series to differ for finitely many input strings. First, the structure of hyper-minimal deter...

This paper proposes two new soft-switching transformerless converters with high voltage conversion ratio. These proposed converters achieve soft-switching each with a single auxiliary resonant cell. The merit of these converters is reduced switching losses with lesser number of devices. The main switching devices are turned off with zero current switching (ZCS). Apart from the soft-switching fe...

The major objective of this study is to find accuracy in movie suggestion systems using machine learning algorithms namely Empirical Risk Minimisation Algorithm and Decision Tree Algorithm. algorithm with sample size N = 10 was iterated 20 times for finding systems.The riskminimisation produces a better [92.02%] than the tree [80.58%]. significance risk minimisation[p<0.05] independent T-tes...

We propose a technique for transferring the multiplet spin polarization (CIDNP or PHIP, or one created by any other method), which is the mutual entanglement of spins, into net hyper-polarization with respect to the direction of a high magnetic field by slowly (adiabatically) switching-off a strong external RF-field with a specially selected frequency. The net hyper-polarized molecules can then...

We introduce a new correctness criterion for multiplicative non commutative proof nets which can be considered as the non-commutative counterpart to the Danos-Regnier criterion for proof nets of linear logic. The main intuition relies on the fact that any switching for a proof net (obtained by mutilating one premise of each disjunction link) can be naturally viewed as a series-parallel order va...