Overseas mining investment generally faces considerable risk due to a variety of complex risk factors. Therefore, indexes are often based on conditions of uncertainty and cannot be fully quantified. Guided by set pair analysis (SPA) theory, this study constructs a risk evaluation index system based on an analysis of the risk factors of overseas mining investment and determines the weights of factors using entropy weighting methods. In addition, this study constructs an identity-discrepancycontrary risk assessment model based on the 5-element connection number. Both the certainty and uncertainty of the various risks are treated uniformly in this model and it is possible to mathematically describe and quantitatively express complex system decisions to evaluate projects. Overseas mining investment risk and its changing trends are synthetically evaluated by calculating the adjacent connection number and analyzing the set pair potential. Using an actual overseas mining investment project as an example, the risk of overseas mining investment can be separated into five categories according to the risk field, and then the evaluation model is quantified and specific risk assessment results are obtained. Compared to the field investigation, the practicability and effectiveness of the evaluation method are illustrated. This new model combines static and dynamic factors and qualitative and quantitative information, which improves the reliability and accuracy of risk evaluation. Furthermore, this evaluation method can also be applied to other similar evaluations and has a certain scalability.
The article presents one of contemporary forms of Polish migration to other countries enabling migrants to gain new skills and experiences, namely the migration of Polish women taking part in the Au-pair program. The analyzed data were gathered through in-depth interviews with former participants of the Au-pair program in germany – one of the main destinations of this kind of migration from Poland.
In this paper we present a family of transforms that map existentially unforgeable signature schemes to signature schemes being strongly unforgeable. In spite of rising security, the transforms let us make a signature on a union of messages at once. The number of elements in this union depends on the signing algorithm of a scheme being transformed. In addition to that we define an existentially unforgeable signature scheme based on pairings, which satisfies all assumptions of the first part and is able to be subjected to transformation.