Fixed set and applications

The dissertation has five chapters and a list of references. The chapters concentrate on the following issues: In Chapter 1, we recall some classical results of the problem and some basic concepts from variational analysis and nonsmooth analysis. In Chapter 2, we investigate some new models of nonlinear nonlocal regularity; Chapter 3 is devoted to the study of metric perturbation of Milyutin-type regularity on a fixed set under composition of a set-valued mapping and a Lipschitz single-valued mapping;...

145p visteveballmer 06-11-2021 15 3   Download

Any message written over a fixed set of symbols can be represented as a binary string (a sequence of 0's and 1's) Binary digits 0 and 1 are called bits To reduce computation overhead, encryption algorithms should only use operations that are easy to implement For a binary string X: The length of X, denoted by |X|, is the number of bits in X If |X| = l, X is an l-bit binary string Let a be a binary bit and k a non-negative integer. Denote by ak a binary string consisting of k copies of a Denote the concatenation of X and Y by XY or...

25p muathu_102 28-01-2013 53 2   Download

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article Remarks on Separation of Convex Sets, Fixed-Point Theorem, and Applications in Theory of Linear Operators

14p sting10 07-03-2012 45 6   Download