Marketing plays a role in the transfer of consumer desires through research, studies and satisfy the needs process, and with the technical development has evolved and marketing departments in the world of commerce has made great strides since the expansion of the trade deal, especially in light of spread of the Internet and the culture of use where he became a lot as individuals or institutions are dealings via electronic shopping . In all cases, we find that the consumer is important party, and that the legal rules did not leave the shopping process or contracting E without protection and I've dealt with so many studies through the civil protection for the consumer in electronic contracts legally with an analytical study of the

Blockchain has garnered the most attention as the most important new technology that supports recent digital transactions via e-government. The most critical challenge for public e-government systems is reducing bureaucracy and increasing the efficiency and performance of administrative processes in these systems since blockchain technology can play a role in a decentralized environment and execute a high level of security transactions and transparency. So, the main objectives of this work are to survey different proposed models for e-government system architecture based on blockchain technology implementation and how these models are validated.  This work studies and analyzes some research trends focused on blockchain

The aim of this paper is introducing the concept of (ɱ,ɳ) strong full stability B-Algebra-module related to an ideal. Some properties of (ɱ,ɳ)- strong full stability B-Algebra-module related to an ideal have been studied and another characterizations have been given. The relationship of (ɱ,ɳ) strong full stability B-Algebra-module related to an ideal that states,  a B- -module Ӽ is (ɱ,ɳ)- strong full stability B-Algebra-module related to an ideal  , if and only if  for any two ɱ-element sub-sets and of Ӽ^ɳ, if , for each j = 1, …, ɱ,  i = 1,…, ɳ  and   implies _Ạɳ( ) _Ạɳ(  have been proved..

One of the concerns of adopting an e-voting systems in the pooling place of any critical elections is the possibility of compromising the voting machine by a malicious piece of code, which could change the votes cast systematically. To address this issue, different techniques have been proposed such as the use of vote verification techniques and the anonymous ballot techniques, e.g., Code Voting. Verifiability may help to detect such attack, while the Code Voting assists to reduce the possibility of attack occurrence. In this paper, a new code voting technique is proposed, implemented and tested, with the aid of an open source voting. The anonymous ballot improved accordingly the paper audit trail used in this machine. The developed system,

تتبلور فكرة البحث حول التوصل لنوع العلاقة التي تربط التعليم الالكتروني خلال جائحة كورونا برفع المهارات التكنولوجية للأساتذة والطلاب، وتبرز أهمية البحث في ان نجاح الوصول لهذه العلاقة يمكن الإفادة منها في تغيير منهجية تطوير المهارات التكنولوجية مستقبلا وذلك باعتماد الجوانب التطبيقية الفعلية بدلا من الدورات وورش العمل والتي قد لا تضاهي الطريقة العملية في رفع مستوى المهارات المختلفة سواء التدريسية او التكنو

Discrete   logarithms  are applied      in many    cryptographic problems  . For instance ,   in public   key .  and for construction of sets with disti nct sums of  k-clcments.  The   purpose o r  this   paper

is  to  modify  the  method ol' informationl1·iding  using        discrete logarithms  , introduce new properties of St - sets ,   uscdthe direct product   of    groups   to construct  cyclic group and finally, present modified   method   for   knapsack &

      In this work, we introduced and studied  a new kind of soft mapping  on soft topological spaces with an ideal, which we called  soft strongly generalized mapping with respect an ideal I, we studied the concepts like SSIg-continuous, Contra-SSIg-continuous, SSIg-open, SSIg-closed and SSIg-irresolute mapping  and  the relations between these kinds of mappings and the composition of two mappings of the same type of two different types, with proofs or counter examples