968 resultados para Ponzi Schemes (Pyramids)
Resumo:
Frontispiece, v. 1, by C. Grignion after S. Wale.
Resumo:
First ed. pub. under title: An alphabetical compendium of the various sects which have appeared in the world from the beginning of the Christian ara to the present day.
Resumo:
Includes index.
Resumo:
Includes index.
Resumo:
Mode of access: Internet.
Resumo:
"Written by Stephen A. Wandner, John G. Robinson and Helen S. Manheimer."
Resumo:
Mode of access: Internet.
Resumo:
"Short account of the women of Egypt, Nubia, and Syria; by Mrs. Belzoni": v. 2, p. [241]-327.
Resumo:
Vol. 3 has title: Appendix to Operations carried on at the pyramids of Gizeh in 1837. Containing a survey by J. S. Perring ... of the pyramids at Abou Roash, and to the southward, including those in the Falyoum ... London, J. Weale [etc.] 1842.
Resumo:
Includes index.
Resumo:
Mode of access: Internet.
Resumo:
We extend our earlier work on ways in which defining sets of combinatorial designs can be used to create secret sharing schemes. We give an algorithm for classifying defining sets or designs according to their security properties and summarise the results of this algorithm for many small designs. Finally, we discuss briefly how defining sets can be applied to variations of the basic secret sharing scheme.
Resumo:
The US Securities and Exchange Commission requires registered management investment companies to disclose how they vote proxies relating to portfolio securities they hold. The primary purpose of this rule is to enable fund investors to monitor the role of institutional shareholders in the corporate governance practices of public companies. In Australia, despite reform proposals, there are no regulations requiring institutional investors to report proxy voting procedures and practices. There is little evidence of voluntary disclosure of proxy voting by Australian managed investment schemes in equities, indicating that there are costs involved in such disclosure.
Resumo:
We present unified, systematic derivations of schemes in the two known measurement-based models of quantum computation. The first model (introduced by Raussendorf and Briegel, [Phys. Rev. Lett. 86, 5188 (2001)]) uses a fixed entangled state, adaptive measurements on single qubits, and feedforward of the measurement results. The second model (proposed by Nielsen, [Phys. Lett. A 308, 96 (2003)] and further simplified by Leung, [Int. J. Quant. Inf. 2, 33 (2004)]) uses adaptive two-qubit measurements that can be applied to arbitrary pairs of qubits, and feedforward of the measurement results. The underlying principle of our derivations is a variant of teleportation introduced by Zhou, Leung, and Chuang, [Phys. Rev. A 62, 052316 (2000)]. Our derivations unify these two measurement-based models of quantum computation and provide significantly simpler schemes.