نتایج جستجو برای: almost multiplicative linear functional

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

2005
M. U. Akhmet

In this paper we establish asymptotic (biasymptotic) equivalence between spaces of solutions of a given linear homogeneous system and a perturbed system. The perturbations are of either linear or weakly linear characters. Existence of a homeomorphism between subspaces of almost periodic and asymptotically (biasymptotically) almost periodic solutions is also obtained.

Journal: :JSW 2013
Jingben Yin Yutang Liu Baolin Ma Dongwei Shi

In this paper, an effective computational algorithm is proposed for a class of linear multiplicative problem (P), which have broad applications in financial optimization, economic plan, engineering designs and stability analysis of nonlinear systems, and so on. By utilizing piecewise linearization technique underestimates the objective function, linear relaxation programming of the original lin...

Journal: :Electronic Proceedings in Theoretical Computer Science 2012

2007
Emilia Käsper Ventzislav Nikov Svetla Nikova

We consider multi-party computation (MPC) in a hierarchical setting, where participants have different capabilities depending on their position in the hierarchy. First, we give necessary conditions for multiplication of secrets in a hierarchical threshold linear secret sharing scheme (LSSS). Starting with known ideal constructions, we then propose a modified scheme with improved multiplication ...

Journal: :Applied Mathematics and Computation 2008
Guangxi Cao Yongzhong Song

Keywords: Additive/multiplicative splitting iteration method Singular linear systems Hermitian matrix Semiconvergence a b s t r a c t In this paper, we investigate the additive, multiplicative and general splitting iteration methods for solving singular linear systems. When the coefficient matrix is Hermitian, the semiconvergence conditions are proposed, which generalize some results of Bai [Z....

2013
Joan Boyar Magnus Find René Peralta

Cryptographic applications, such as hashing, block ciphers and stream ciphers, make use of functions which are simple by some criteria (such as circuit implementations), yet hard to invert almost everywhere. A necessary condition for the latter property is to be “sufficiently distant” from linear, and cryptographers have proposed several measures for this distance. In this paper, we show that f...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه پیام نور - دانشکده علوم پایه 1388

چکیده ندارد.

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

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