In this paper a new fast mode decision method for H.264 /AVC intra coding is developed, which is based on the analysis of edge filter and more efficient mode selection. We analysis the edge detection algorithm from the perspective of edge filters and make it more efficient at mode selecting. In the proposed edge filters, differ from those existing methods which select several neighbor modes onl...

background: the aim of the study was to discuss on the influential factors of the mode of classification of partition management in the emergency triage. method: retrospectively analyzing the effects of emergency triage of 156 cases who adopted the classification partition management mode during oct 2014 to oct 2015 in xuzhou central hospital (xuzhou, jiangsu province, china). they were divided...

At present, the exploitation mode for network information has some serious drawbacks such as non-aftereffect, independence of each other and point-to-point in the massive, stochastic, parallel and distributed networks. Thus, this paper is devoted to a novel self-organizing exploitation mode for network information which is proposed in [1], and a new generalized cellular automaton (GCA) is used ...

In this paper we present a new method for achieving a higher cost{eeciency on parallel computers. We insert routines into a program which detect the amount of computational work without using problem{ speciic parameters and adapt the number of used CPUs at runtime under given speedup/eeciency constraints. Several user{tunable strategies for selecting the number of processors are presented and c...

The security of many cryptographic constructions depends on random number generators for providing unpredictable keys, nonces, initialization vectors and other parameters. Modern operating systems implement cryptographic pseudo-random number generators (PRNGs) to fulfill this need. Performance counters and other system parameters are often used as a low-entropy source to initialize (seed) the g...

We consider the partial observability model for multi-armed bandits, introduced by Mannor and Shamir [11]. Our main result is a characterization of regret in the directed observability model in terms of the dominating and independence numbers of the observability graph. We also show that in the undirected case, the learner can achieve optimal regret without even accessing the observability grap...

We consider the partial observability model for multi-armed bandits, introducedby Mannor and Shamir [11]. Our main result is a characterization of regret inthe directed observability model in terms of the dominating and independencenumbers of the observability graph. We also show that in the undirected case, thelearner can achieve optimal regret without even accessing the observ...

In this paper we present a new method for achieving a higher cost{e ciency on parallel computers. We insert routines into a program which detect the amount of computational work without using problem{ speci c parameters and adapt the number of used CPUs at runtime under given speedup/e ciency constraints. Several user{tunable strategies for selecting the number of processors are presented and c...