High Efficiency Video Coding (HEVC/H265) is the most contemporary video compression standard, jointly developed by ITU-T VCEG and ISO/IEC MPEG standard bodies. HEVC, successor of H.264/AVC, is targeted to achieve half the bit-rate compared to its predecessor for the same video quality. Along with primary goal of achieving higher compression and accommodating support for higher resolutions like ...

We show how to find series expansions for π of the form π = ∞ n=0 S(n) mn pn a n , where S(n) is some polynomial in n (depending on m, p, a). We prove that there exist such expansions for m = 8k, p = 4k, a = (−4) k , for any k, and give explicit examples for such expansions for small values of m, p and a.

We show how to find series expansions for π of the form π = ∞ n=0 S(n) mn pn a n , where S(n) is some polynomial in n (depending on m, p, a). We prove that there exist such expansions for m = 8k, p = 4k, a = (−4) k , for any k, and give explicit examples for such expansions for small values of m, p and a.

We report a low-pressure microfluidic deoxyribonucleic acid (DNA) fragmentation device based on a combination of mechanical hydrodynamic shearing and low temperature sample heating. Conventional DNA fragmentation based on hydrodynamic shearing is capable of achieving fragment lengths (FL) < 10k bp with pressures ∆P > 1 bar. The application of a small amount of additional thermal energy to the b...

coincidences o b s e r v e d 9 between the 3 8 1 and 6 2 0 keV y rays. The log ft value of the ß branch feeding the 1 1 4 2 keV level is 7 . 5 , whidi indicates that a spin assignment of 1 / 2 — or 3 / 2 — is likely. The K-conversion coefficient of the 1 0 0 2 keV transition determined gives an M 2 character for that transition, while the 3 8 1 keV transition is found to have M 1 + E 2 characte...

! " #$ % &" '( ') '* + ,$./ 0 ( '%12 3 & & % " #4" 5,67 2 %'( & 8 % 9 : ; $ " < => 0 "> ')? " #> .@ & &# # # %#& &"A'( CB %=7 %'D " EF G;@ % &=7. " #H < : '( ? ; ./ B 'I '( " #D B 'J "8 K => &"MLJN-B 'J./ .@ JO ') P. &.@ '( %' 9.8 &; ; ') D'( QB %=7 < R &.@ & # > #&# #S "T "7 # D" (? ,U 6 ' ,!B QBV W X'( %" '( S LYN-B Z. .@ &'( :E['( QB %=7 ' ; '( :EZ &"Z " K => &"Z B % : J % " % . '%L2N\ Q &E8...

An edge (vertex) cut X of G is r-essential if G−X has two components each which at least r edges. A graph r-essentially k-edge-connected (resp. k-connected) it no vertex) cuts size less than k. If r=1, we simply call essential. Recently, Lai and Li proved that every m-edge-connected essentially h-edge-connected contains k edge-disjoint spanning trees, where k,m,h are positive integers such k+1≤...