نتایج جستجو برای: stream function theorem
تعداد نتایج: 1382610 فیلتر نتایج به سال:
the objective of this study was to diagnose integrative ecological health of an urban stream,which is located in the asian temperate region. the research approach was primarily based on the index ofbiological integrity (ibi) using fish assemblage and a qualitative habitat evaluation index (qhei). and these indexes were compared with long-term conventional chemical dataset during 1996-2005. for ...
Coinduction is often seen as a way of implementing innnite objects 8, 44. Since real numbers are typical innnite objects, it may not come as a surprise that calculus, when presented in a suitable way, is permeated by coinductive reasoning. What is surprising is that mathematical techniques, recently developed in the context of computer science, seem to be shedding a new light on some basic meth...
We present a practical attack on the Panama hash function that generates a collision in 2 evaluations of the state updating function. Our attack improves that of Rijmen and coworkers that had a complexity 2, too high to produce a collision in practice. This improvement comes mainly from the use of techniques to transfer conditions on the state to message words instead of trying many message pai...
using a generalized spherical mean operator, we obtain a generalization of titchmarsh's theorem for the dunkl transform for functions satisfying the ('; p)-dunkl lipschitz condition in the space lp(rd;wl(x)dx), 1 < p 6 2, where wl is a weight function invariant under the action of an associated re ection group.
We review and apply a computational theory of the feedforward path of the ventral stream in visual cortex based on the hypothesis that its main function is the encoding of invariant representations of images. A key justification of the theory is provided by a theorem linking invariant representations to small sample complexity for recognition that is, invariant representations allows learning f...
Consider a joint distribution (X,A) on a set X ×{0, 1}. We show that for any family F of distinguishers f : X × {0, 1} → {0, 1}, there exists a simulator h : X → {0, 1} such that 1. no function in F can distinguish (X,A) from (X,h(X)) with advantage ǫ, 2. h is only O(2ǫ) times less efficient than the functions in F . For the most interesting settings of the parameters (in particular, the crypto...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید