نتایج جستجو برای: dynamic permission activation
تعداد نتایج: 849979 فیلتر نتایج به سال:
Abstract In this paper, we apply relating semantics to the widely discussed problem of free choice between permitted actions or situations in normative systems. Leaving aside contexts which principle is obviously unacceptable (weak permission understood as an absence prohibition) uncontroversially valid (strong within systems with a closed repertoire situations), concentrate on for explicit per...
dynamic assessment according to vygotskys sociocultural theory, states that instruction and assessment are interrelated. using static forms of assessment with second and foreign language students could do more harm than good. many teachers neglect to take account of the complexity involved in learning a second or foreign language and often wonder why learning of a language take so long. thi...
Permission-induced attacks, i.e., security breaches enabled by permission misuse, are among the most critical and frequent issues threatening the security of Android devices. By ignoring the temporal aspects of an attack during the analysis and enforcement, the state-of-the-art approaches aimed at protecting the users against such attacks are prone to have low-coverage in detection and highdisr...
Arjmand Samuel, Hammad Haseeb, Arif Ghafoor and Elisa Bertino Abstract Cyber Physical Systems (CPS) are complex systems that operate in a dynamic environment where security characteristics of contexts are unique, and uniform access to secure resources anywhere anytime to mobile entities poses daunting challenges. To capture context parameters such as location and time in an access control polic...
Permission contracts are being told that the main effect is to make leave or permission. These contracts are based not only on the composition but also on the willingness of people. In fact, the permission must be supported by its source, and if deprived of the support stand, it'll lose its life and identity. So this will result in the end of the legal acts. In the matter of dissolution of perm...
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید