نتایج جستجو برای: renyi inequality
تعداد نتایج: 57804 فیلتر نتایج به سال:
Recently Habibi et al. (2006) defined a pre-experimental criterion for the potential strength of evidence provided by an experiment, based on Kullback-Leibler distance. In this paper, we investigate the potential statistical evidence in an experiment in terms of Renyi distance and compare the potential statistical evidence in lower (upper) record values with that in the same number of ii...
In this paper, we discuss the usual stochastic‎, ‎likelihood ratio, ‎dispersive and convex transform order between two parallel systems with independent heterogeneous extended generalized exponential components. ‎We also establish the usual stochastic order between series systems from two independent heterogeneous extended generalized exponential samples. ‎Finally, ‎we f...
This work investigates three aspects: (a) a network vulnerability as the non-uniform vulnerable-host distribution, (b) threats, i.e., intelligent malwares that exploit such a vulnerability, and (c) defense, i.e., challenges for fighting the threats. We first study five large data sets and observe consistent clustered vulnerable-host distributions. We then present a new metric, referred to as th...
Partial discharge (PD) detection can effectively achieve the status maintenance of XLPE (Cross Linked Polyethylene) cable, so it is the direction of the development of equipment maintenance in power systems. At present, a main method of PD detection is the broadband electromagnetic coupling with a high-frequency current transformer (HFCT). Due to the strong electromagnetic interference (EMI) ge...
we derive whole series of new integral inequalities of the hardy-type, with non-conjugate exponents. first, we prove and discuss two equivalent general inequa-li-ties of such type, as well as their corresponding reverse inequalities. general results are then applied to special hardy-type kernel and power weights. also, some estimates of weight functions and constant factors are obtained. ...
Exploration is essential for reinforcement learning (RL). To face the challenges of exploration, we consider a reward-free RL framework that completely separates exploration from exploitation and brings new algorithms. In phase, agent learns an exploratory policy by interacting with environment collects dataset transitions executing policy. planning computes good any reward function based on wi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید