Do you want to publish a course? Click here

Law of the Large Numbers for Random Functions with two Variables

قانون الأعداد الكبيرة للدوال العشوائية بمتحولين

1353   0   16   0 ( 0 )
 Publication date 2013
and research's language is العربية
 Created by Shamra Editor




Ask ChatGPT about the research

In this research we will find a law of the large numbers for random convex – concave closed functions, and generalize some results related to lower semi- continuous functions to similar results concerning the convex– concave functions, and that will be done with using the parent convex functions and the Mosco-epi \ hypo-convergence.

References used
ARTSTEIN,Z. ; HART,S. : Law of large numbers for random sets and allocation processes, Mathematics of Operations Research 6 (1981), 482-492
ARTSTEIN,Z.; VITALE,R.A. : A strong law of large numbers for random compact sets, The Annals of Probability, vol. 3, no. 5(1975), 879–882
ATTOUCH, H. : Variational convergence for functions and operators, Pitman, London, 1984, 420
rate research

Read More

We present in this paper the neutrosophic randomized variables, which are a generalization of the classical random variables obtained from the application of the neutrosophic logic (a new nonclassical logic which was founded by the American philos opher and mathematical Florentin Smarandache, which he introduced as a generalization of fuzzy logic especially the intuitionistic fuzzy logic ) on classical random variables.
P-NP-problem is the most important issue in computing theory and computational complexity,Through her study has been defined and studied the ranks of other complexity such ascoNP, PP, P .. In this paper we have defined new complexity classes for polynomial time non deterministic Turing Machine using prime and composite numbers for k-prime numbers.
Sarcasm detection is of great importance in understanding people's true sentiments and opinions. Many online feedbacks, reviews, social media comments, etc. are sarcastic. Several researches have already been done in this field, but most researchers studied the English sarcasm analysis compared to the researches are done in Arabic sarcasm analysis because of the Arabic language challenges. In this paper, we propose a new approach for improving Arabic sarcasm detection. Our approach is using data augmentation, contextual word embedding and random forests model to get the best results. Our accuracy in the shared task on sarcasm and sentiment detection in Arabic was 0.5189 for F1-sarcastic as the official metric using the shared dataset ArSarcasmV2 (Abu Farha, et al., 2021).
Conditional Random Field (CRF) based neural models are among the most performant methods for solving sequence labeling problems. Despite its great success, CRF has the shortcoming of occasionally generating illegal sequences of tags, e.g. sequences c ontaining an I-'' tag immediately after an O'' tag, which is forbidden by the underlying BIO tagging scheme. In this work, we propose Masked Conditional Random Field (MCRF), an easy to implement variant of CRF that impose restrictions on candidate paths during both training and decoding phases. We show that the proposed method thoroughly resolves this issue and brings significant improvement over existing CRF-based models with near zero additional cost.
this paper, we generalize the study of the mathematical operations over (2x2), (3x3) and (4x4) real matrices by using the complex numbers which was introduced by (Ide. 1990,1993,1996), for any real matrices (nxm). This method of arithmetic operati ons of matrices by using the complex numbers and its properties is simple, easy and fast to program on computer. The importance of this method appears in the applications of problems which use the arithmetic operations of matrices, especially in physics.
comments
Fetching comments Fetching comments
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا