Abstract:This study aims at measuring the relationship between students‟ attitude toward govern-ment‟s virtual social network policy making with social security feeling, in another word, to which extent social security feeling emphasizing on social networks is determined via users‟ attitude toward government‟s media policy making? Analytical-descriptive method including survey is used in ...

this research is about analysis of relation between trust and organizational commitment of personnel. statistic social in this research is the personnel of social welfare organization of qom state and education organization of qom state and statical sample is consist of 35 employees from social welfare organization and 54 employees from education organization of qom state. in analysis of organi...

In his 1984 proof of the Bieberbach and Milin conjectures de Branges used a positivity result of special functions which follows from an identity about Jacobi polynomial sums that was published by Askey and Gasper in 1976. The de Branges functions τ k (t) are defined as the solutions of a system of differential recurrence equations with suitably given initial values. The essential fact used in ...

For slowly evolving, discrete-time–dependent systems of difference equations (iterated maps), we believe that the simplest means of demonstrating the validity of the averaging method at first order is by way of a lemma that we call the Besjes inequality. In this paper, we develop the Besjes inequality for identity maps with perturbations that are (i) at low-order resonance (periodic with short ...

*Correspondence: [email protected] 2College of Sciences, Hebei University of Science and Technology, Shijiazhuang, Hebei 050018, P.R. China Full list of author information is available at the end of the article Abstract In this paper, we consider the existence of positive solutions for a second-order discrete boundary value problem (g(k – 1) u(k – 1)) +w(k)f (k,u(k)) = 0 subject to the bounda...

The performance attributes of a broad class of randomised algorithms can be described by a recurrence relation of the form T(x) = a(x)+T(H(x)), where a is a function and H(x) is a random variable. For instance, T(x) may describe the running time of such an algorithm on a problem of size x. Then T(x) is a random variable, whose distribution depends on the distribution of H(x). To give high proba...