No abstract uploaded!

We study a certain improved fractional Sobolev–Poincaré inequality on domains, which can be considered as a fractional counterpart of the classical Sobolev–Poincaré inequality. We prove the equivalence of the corresponding weak and strong type inequalities; this leads to a simple proof of a strong type inequality on John domains. We also give necessary conditions for the validity of an improved fractional Sobolev–Poincaré inequality, in particular, we show that a domain of finite measure, satisfying this inequality and a ‘separation property’, is a John domain.

No abstract uploaded!

Very few previous studies have examined the forecast and delimiting of TV dramas evaluating indicators problem from the machine learning and statistic perspective. In this paper, we designed a series of web crawlers for collecting TV-drama-related indicators as raw data. The accurate prediction of the TV drama audience ratings and online views is achieved by the ARIMA model, RNNs, CLDNNs and RVM model. Statistical methods are applied to analyze and compare the TV ratings and the online views. Factor analysis is used to give a definition and calculation method of heat of TV dramas and rankings of the TV dramas based on heat. Finally, mixed CNNs is employed to predict heat of TV dramas using data of different dimensions. In this paper, web-crawler, traditional statistical method and the state-of-the art deep learning techniques are combined to give a basic application for predicting and ranking in TV drama industry.

In this article, we define a “ recursive local” algorithm in order to construct two reccurent numerical sequences of positive prime numbers (𝑈2𝑛) and (𝑉2𝑛), ((𝑈2𝑛) function of (𝑉2𝑛)), such that for any integer n≥ 2, their sum is 2n. To build these , we use a third sequence of prime numbers (𝑊2𝑛) defined for any integer n≥ 3 by : 𝑊2𝑛 = Sup(p∈IP : p ≤ 2n-3), where IP is the infinite set of positive prime numbers. The Goldbach conjecture has been verified for all even integers 2n between 4 and 4.1018. . In the Table of Goldbach sequence terms given in paragraph § 10, we reach values of the order of 2n= 101000 . Thus, thanks to this algorithm of “ascent and descent”, we can validate the strong Euler-Goldbach conjecture.