نتایج جستجو برای: eternal m secure set

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

This paper includes a simulation model built in order to predict the performance indicessuch aswaiting time by analyzing queue’s components in the real world under uncertain and subjective situation. The objective of this paper is to predict the waiting time of each customer in an M/M/C queuing model. In this regard, to enable decision makers to obtain useful results with enough knowledge on th...

Journal: :Research Journal of Applied Sciences, Engineering and Technology 2014

Journal: :CoRR 2014
Calvin Beideman Jeremiah Blocki

A (n, l, γ)-sharing set family of sizem is a family of sets S1, . . . , Sm ⊆ [n] s.t. each set has size l and each pair of sets shares at most γ elements. We let m (n, l, γ) denote the maximum size of any such set family and we consider the following question: How large can m (n, l, γ) be? (n, l, γ)-sharing set families have a rich set of applications including the construction of pseudorandom ...

Journal: :Vestnik Moskovskogo gosudarstvennogo oblastnogo universiteta 2022

Рецензируемые научные журналы МГОУ. Журналы МГОУ входящие в перечень ВАК: География, История, Международные отношения, Политология, Лингвистика, Педагогика, Психология, Филология, Физика-математика, Философия, Экономика, Юриспруденция

,

Social Adjustment and Academic Achievement of Female Children with Secure and Insecure Attachment Patterns E. Ghorbanian, M.A. T. PourEbrahim, Ph.D. P.S. Seyed Mousavi, Ph.D.   M. Habibi, Ph.D. This study was undertaken to compare social adjustment and academic achievement of female children with secure and insecure attachment patterns. The research type was descript...

2014
V. S. Aravind Nambala Y. Ramesh kumar H. Deva Raj

The Internet traffic is increasing day by day. Also, secure data communication is the need of the hour. But the standard compression techniques which are in use, are independent and do not consider the security issues. Hence, we present a general encoding technique for secure data communication over a language L with a finite alphabet set ˇ. The encoded message is a bi-tuple of which, the first...

2014
Juan A. Garay Ran Gelles David S. Johnson Aggelos Kiayias Moti Yung

Secure multiparty computation (MPC) as a service is becoming a tangible reality. In such a service, a population of clients wish to utilize a set of servers to delegate privately and reliably a given computation on their inputs. MPC protocols have a number of desired properties including tolerating active misbehavior by some of the servers and guaranteed output delivery. A fundamental result is...

A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...

Journal: :Lancet 2013
Janice Halpern Stephen H Halpern

The use of the word “eternal” in the title of Richard Horton's piece “Occupied Palestine, an eternal alliance for health” (March 30, p 1084)1 is apt. It fits with his evangelical intentions “to put science in the service of social justice and selfdetermination.”2 However, Horton omits important data, leading to the spurious conclusion that President Obama, by disappointing the Palestinians, is ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شهید مدنی آذربایجان - دانشکده علوم پایه 1392

let g=(v,e) be a graph with vertex set v and edge set e.for two vertices u,v of g ,the closed interval i[u,v] ,consists of u,v and all vertices lying in some u-v geodesic in g.if s is a set of vertices of g then i[s]is the union of all sets i[u,v]for u,v ? s. if i[s]=v(g) , then s is a geodetic set for g.the geodetic number g(g) is the minimum cardinality of geodetic set.the maximum cardinalit...

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

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