نتایج جستجو برای: strong element

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

Journal: :Discrete Mathematics & Theoretical Computer Science 2004
Josef Pieprzyk Xian-Mo Zhang

The paper addresses the cheating prevention in secret sharing. We consider secret sharing with binary shares. The secret also is binary. This model allows us to use results and constructions from the well developed theory of cryptographically strong boolean functions. In particular, we prove that for given secret sharing, the average cheating probability over all cheating vectors and all origin...

Journal: :Int. J. Comput. Math. 2015
Jong H. Chung Pantelimon Stanica Chik How Tan Qichun Wang

The two important qualities of a cipher is security and speed. Frequently, to satisfy the security of a Boolean function primitive, speed may be traded-off. In this paper we present a general construction that addresses both qualities. The idea of our construction is to manipulate a cryptographically strong base function and one of its affine equivalent functions, using concatenation and negati...

Journal: :Applied Mathematics and Computation 2011
Eric Goncalvès Regiane Fortes Patella

Thermodynamic effects play an important role in the cavitation dynamics of cryogenics fluids. Such flows are characterized by strong variations in fluid properties with the temperature. A compressible, multiphase, one-fluid solver was developed to study and to predict thermodynamic effects in cavitating flows. To close the system, a cavitation model is proposed to capture metastable behaviours ...

Journal: :Discrete Mathematics 2009
K. L. Ng

For a connected graph G containing no bridges, let D(G) be the family of strong orientations of G; and for any D ∈ D(G), we denote by d(D) the diameter of D. The orientation number −→ d (G) of G is defined by −→ d (G) = min{d(D)|D ∈ D(G)}. Let G(p, q;m) denote the family of simple graphs obtained from the disjoint union of two complete graphs K p and Kq by adding m edges linking them in an arbi...

2009
HANNA K. JANKOWSKI LARISSA I. STANBERRY

Let p1 ≤ p2 and consider estimating a fixed set {x : p1 ≤ f(x) ≤ p2} by the random set {x : p1 ≤ f̂n(x) ≤ p2}, where f̂n is a consistent estimator of the continuous function f . This paper gives consistency conditions for these sets, and provides a new method to construct confidence regions from empirical averages of sets. The method can also be used to construct confidence regions for sets of th...

2015
Ijlal Loutfi Audun Jøsang

Consuming services online is an exponentially growing trend within different industries. A robust online authentication solution to these services is a critical requirement for establishing trust between end users and service providers. Currently, the shortcomings of password based authentication solutions are well recognized.Hence, many alternative strong authentication solutions are being ado...

2010
A. Razani

Let X be a reflexive Banach space which has a weakly sequentially continuous duality mapping. In this paper, we consider the following viscosity approximation sequence x n λ n fx n 1−λ n T n x n , where λ n ∈ 0, 1, {T n } is a uniformly asymptotically regular sequence, and f is a weakly contractive mapping. Strong convergence of the sequence {x n } is proved.

Journal: :European Journal of Operational Research 2000
Xinmin Yang X. Q. Yang Kok Lay Teo

A pair of Wolfe type non-differentiable second order symmetric primal and dual problems in mathematical programming is formulated. The weak and strong duality theorems are then established under second order F-convexity assumptions. Symmetric minimax mixed integer primal and dual problems are also investigated. 2002 Elsevier Science B.V. All rights reserved.

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

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