The problem of portfolio optimization has made many advances since Markowitz proposed an average-variance-based optimization. It can be said that the most important achievement of the Markowitz model was the introduction of variance as a risk indicator and indeed, the introduction of a quantitative benchmark into it. This research is a model for predicting value at risk. This model extends the ...

The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...

In this paper, the authors present a method of measuring the switching time of a dual redundant NIC. The accuracy of the authors’ method of measuring switching time can reach milliseconds. The authors’ method uses Internet Control Message Protocol (ICMP) packets to test, is easy to operate, has high precision, and can be applied to all types of dual redundant device switching time measurement. ...

The energy recovery principle used in high-efficiency power supplies can be applied to digital CMOS logic to reduce dynamic power dissipation. We describe experiments with a custom linedriver chip and resonant power supply that can switch eight 100pF loads at 1MHz over 6 times more efficiently than conventional CMOS. The paper describes the adiabatic charging principle underlying this class of ...

We investigate the switching statistics dependence on cell geometry by means of systematic micromagnetic simulations. We find that MTJs with a free layer composed of two ellipses with the axes a/2 and b inscribed into a rectangle a × b are characterized by the same switching speed and thermal stability as MTJs with a composite free layer (C-MTJs). As has been shown, the C-MTJs demonstrate a sub...

In the paper an analogic CNN algorithm is presented for packet selection in a fast packet switching fabric. The algorithm, running on a 64×64 CNN-UM platform, is adaptable for optimal routing in a switch consisting of N input and M output links. The paper also includes a switching time analysis and an example of a 16×16 switching case.