7 resultados para Cryptographically strong pseudorandom bit generators
em Bulgarian Digital Mathematics Library at IMI-BAS
Resumo:
The National Institute for Statistics is the organism responsible for acquiring economical data for governmental statistics purposes. Lisbon agreements establish a framework in which this acquisition process shall be available through Internet, so each survey should be considered as a little software project to be developed and maintained. Considering the great amount of different surveys and all changes produced per year on each make impossible this task. An application generator has been developed to automate this task, taking as a start point the Word or PDF template of a survey, and going through a graphical form designer as all human effort, all HTML, Java classes and Oracle database resources are generated and sent from backoffice to frontoffice servers, reducing the team to carry out the whole set of electronic surveys to two people from non I.T. staff.
Resumo:
A new approach is proposed for the quantum mechanics of guiding center motion in strong magnetic field. This is achieved by use of the coherent state path integral for the coupled systems of the cyclotron and the guiding center motion. We are specifically concerned with the effective action for the guiding center degree, which can be used to get the Bohr- Sommerfeld quantization scheme. The quantization rule is similar to the one for the vortex motion as a dynamics of point particles.
Resumo:
We are concerned with two-level optimization problems called strongweak Stackelberg problems, generalizing the class of Stackelberg problems in the strong and weak sense. In order to handle the fact that the considered two-level optimization problems may fail to have a solution under mild assumptions, we consider a regularization involving ε-approximate optimal solutions in the lower level problems. We prove the existence of optimal solutions for such regularized problems and present some approximation results when the parameter ǫ goes to zero. Finally, as an example, we consider an optimization problem associated to a best bound given in [2] for a system of nondifferentiable convex inequalities.
Resumo:
2000 Mathematics Subject Classification: Primary 47A48, Secondary 60G12.
Resumo:
2000 Mathematics Subject Classification: Primary: 62M10, 62J02, 62F12, 62M05, 62P05, 62P10; secondary: 60G46, 60F15.
Resumo:
2000 Mathematics Subject Classification: 60J45, 60K25