نتایج جستجو برای: narcotics anonymous na

تعداد نتایج: 288353  

Journal: :American Journal of Public Health 1998

Journal: :Al-Ijtima'i: international journal of government and social science 2023

This research examines the circulation of narcotics in Aceh, which is increasingly very worrying. Narcotics Aceh are now a real threat that must be considered by all components society. The location Province, Malacca Strait, makes strategic area. So this serious to especially related smuggling and illicit narcotics. study aims find out how collaborative governance used carrying implementation Q...

Journal: :international journal of high risk behaviors and addiction 0
kolthoum tayyebi department of clinical psychology, islamic azad university, ardabil branch, ardabil, ir iran; department of clinical psychology, islamic azad university, ardabil branch, ardabil, ir iran. tel.: +98-9198865541, fax: +98-2517838014 abbas abolghasemi department of psychology, university of mohaghegh ardabili, ardabil, ir iran majid mahmood alilu department of clinical psychology, university of tabriz, tabriz, ir iran nader monirpoor department of clinical psychology, islamic azad university, qom branch, qom, ir iran

results result shows that there is a significant difference between methamphetamine addicts and narcotics addicts and non-addicts in self-regulation and affective control (p = 0.001). conclusions this finding indicates that low self-regulation and affective control is a risky factor in psychoactive drugs abuse. materials and methods in this causative-comparative study, 80 addicts (40 methamphet...

2002

We propose considering the problem of electronic cash i n the context of a network in which anonymous, untraceable commiinicatlon is assumed to be possible. We present a formal model for such a network, and define security criteria for an electronic cash system in such a setting. Finally, we show that there exists a remarkably simple electrortic cash system which meets the security criteria of ...

1988
Hagit Attiya Marc Snir

We consider a bidirectional ring of n processors, where processors are anonymous, i.e., are indistinguishable. In this model it is known that “most” functions (in particular XOR and orientation) have worst case message complexity @(n’) for asynchronous computations, and O(n log n) for synchronous computations. The average case behavior is different; an algorithm that computes XOR asynchronously...

Journal: :Rivista di estetica 2018

Journal: :Theoretical Computer Science 1995

Journal: :Journal of Epidemiology & Community Health 1990

Journal: :International Journal of Advanced Computer Science and Applications 2013

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید