در سال­های اخیر سعی بر آن بوده است که با توجه به پیچیدگی محاسباتی کمتر و استحکام بیشتر مساله­ی لگاریتم گسسته در منحنی بیضوی نسبت به سایر مسائل سخت، در کاربردهایی همچون امضای کور، روش رمزنگاری منحنی بیضوی جایگزین سایر روش­ها همچون رمزنگاری DLP شود. در این مقاله، یک طرح امضای کور جدید مبتنی بر سیستم رمزنگاری منحنی بیضوی پیشنهاد شده است. طرح ارائه شده، به شیوه­ای امن و کارآمد قادر است نیازهای یک سیستم امضای دیجیتال کور را برآورده کند. تحلیل و ارزیابی کارایی پروتکل ارائه شده در مقایسه با روش­های که در گذشته مطرح شده است، برتری روش پیشنهادی را نشان می­دهد. پرونده مقاله

The development of modular courses at the conservatory and theoretical courses throughout the country is being developed by the organization of education to design effective and appropriate systems for the development and use of information on the learner's progress. So, in this paper, we try to identify factors that contribute to increasing the efficiency of evaluating the learning - studying processes and teaching modular courses. In the first step, 16 factors influencing the assessment and teaching of conservatory courses were identified using the experts’ opinions and identifying the important criteria of modular courses. Finally, we measured the strengths and weaknesses of the modular courses in the conservatories of Chamestan using the fuzzy Delphi technique. Also, the results of the viewpoints of the lecturers in these courses indicate that one of the strengths of these courses is the revaluation factor in each module that makes it impossible to create an atmosphere of anxiety during the study and evaluation for the student. On the other hand, one of the weaknesses of these courses is the lack of space and workshops with courses content, which prevents from the fulfilment of the appropriate effect that the student expects for these courses. پرونده مقاله

A graph structure is a useful tool in solving the combinatorial problems in different areas of computer science and computational intelligence systems. In this paper, we apply the concept of vague sets to graph structures. We introduce certain notions, including vague graph structure (VGS), strong vague graph structure, vague i-cycle, and illustrate these notions by several examples. We study ϕ-complement, self-complement, strong self-complement, totally strong self-complement in vague graph structures, and investigate some of their properties. Finally, an application of vague infuence graph structure is given. پرونده مقاله