| Richard H. Baker: Computer Security Handbook, 2nd Edition, TAB Professional and Reference Books, McGraw-Hill Inc, ISBN 0-8306-7592-2, 1991. |
....can be attacked, for example, by theft of magnetic tapes; a legal user may be bribed (i.e. attacked) etc. Thus, there is a need to divide security into different forms which will keep similar security characteristics together. There are some (somewhat disagreeing) approaches to this problem [4][7] 43] In this paper, most of the security forms are similar to ones found elsewhere, but here they are grouped into a completely different hierarchical structure. This structure is based on where in a system vulnerabilities may be found: vulnerabilities in the hardware, vulnerabilities in ....
Richard H. Baker: Computer Security Handbook, 2nd Edition, TAB Professional and Reference Books, McGraw-Hill Inc, ISBN 0-8306-7592-2, 1991.
....a way to salvage Kulikova s results and extend the ideas also to the computability of ff, which would have direct implications about the computability of elements in (0; 1) n K where K is the Koksma s exceptional set. It requires first a careful choice of a suitable model of computation (see [1], 3] 8] 10] and then, to modify the construction so that it can be carried out in an algorithmic way. The purpose of my research in this area is to explore the computability of numbers with given mathematical properties, such as the elements of (0; 1) n K, paying special attention to the ....
Oliver Aberth. Computable Analysis. McGraw-Hill Inc., 1980.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC