search for: log_2

...mp; 0x00000002) ? 1 : 0) -#define __L4(_x) (((_x) & 0x0000000c) ? ( 2 + __L2( (_x)>> 2)) : __L2( _x)) -#define __L8(_x) (((_x) & 0x000000f0) ? ( 4 + __L4( (_x)>> 4)) : __L4( _x)) -#define __L16(_x) (((_x) & 0x0000ff00) ? ( 8 + __L8( (_x)>> 8)) : __L8( _x)) -#define LOG_2(_x) (((_x) & 0xffff0000) ? (16 + __L16((_x)>>16)) : __L16(_x)) - void __dummy__(void) { OFFSET(UREGS_sp, struct cpu_user_regs, sp); diff --git a/xen/arch/x86/x86_64/asm-offsets.c b/xen/arch/x86/x86_64/asm-offsets.c index b6d1919..6dc832c 100644 --- a/xen/arch/x86/x86_64/asm-offsets....

In mdct.c there's some functions including some-point butterfly. In 32-point and 16-point there are calling of smaller-point function everytime twice on each half of data. When I looked on it I found that's just linear algebra. So it can be rewritten to matrix multiplication. Some one can say: there's optimization on in register working. But imagine there's one calling 32-point,

Dear R users, I am looking for a reference to an algorithm for estimation of sample quantiles which does not require bringing the whole data into memory (more precisely its memory complexity should be much less than linear, ideally constant). I realize that such an algorithm can only be approximate and actually quite wrong for some samples, but that's fine with me. Thank you, Vadim

Hi all, I don't find the solution to my problem . I represent some points and i would like a title for the x axis. I would like to write log_2 where 2 is a subscript of log. I think i have to use the functions parse or expression but i have some difficulties to understand how i should use them. Thanks -- -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- Olivier MARTIN PhD student phon...

Full_Name: Morten Welinder Version: snapshot OS: Submission from: (NULL) (65.213.85.129) Two things are wrong. 1. There is nan test outside IEEE_754. 2. The meat part of the function should really be something like... if (!lower_tail) x = -x; if (fabs (x) > 1) { double temp = atan (1 / x) / M_PI; return (x > 0) ? R_D_Clog (temp) : R_D_val (-temp); } else

...tegers between 1 and n. (If we are reading the code correctly, the method is to multiply a pseudo-random binary fraction by n, take the floor, and add 1; this suffers from quantization effects that can get quite large when n is just below 2^31). A better method, used in Python, is to generate ceil(log_2(n)) pseudo-random bits, add 1, and discard values bigger than n. Attached is a short document explaining the issue in more detail. Best, Kellie -- Kellie Ottoboni Ph.D. Statistics '19, University of California, Berkeley Fellow at Berkeley Institute for Data Science Mobile: (650) 520-5056 W...

Hi, I have a directed graph and wants to find is there any cycle in it? If it is, which nodes or edges are in the cycle. Is there any way to find the cycle in a directed graph in R? Regards, Amir

...data/snmp/ , but i have a problem when i run it , i get an error rtnetlink call failed, reason: 2 , no such file or directory i found this line in the file delete_object_util.c rtnl_talk(&rth, &req.n, 0, 0, NULL,NULL,NULL); result=errno; if(result!=0) syslog(LOG_2,"rtnetlink call failed, reason: %i, %s", result, strerror(result)); rtnl_close(&rth); return(result); whatis rtnl_talk() do ?? help me please, thanks ragu --------------------------------- Blab-away for as little as 1¢/min. Make PC-to-Phone Calls using Y...

...s or thousands of taint labels, as the label union operation becomes O(n) in the number of supported labels, and data associated with it will quickly dominate the live variable set, causing register spills and hampering performance. Instead, a low overhead approach is proposed which is best-case O(log_2 n) during execution. The underlying assumption is that the required space of label unions is sparse, which is a reasonable assumption to make given that we are optimizing for the case where applications mostly copy data from one place to another, without often invoking the need for an actual union...

...s or thousands of taint labels, as the label union operation becomes O(n) in the number of supported labels, and data associated with it will quickly dominate the live variable set, causing register spills and hampering performance. Instead, a low overhead approach is proposed which is best-case O(log_2 n) during execution. The underlying assumption is that the required space of label unions is sparse, which is a reasonable assumption to make given that we are optimizing for the case where applications mostly copy data from one place to another, without often invoking the need for an actual union...

...unt -o recovery and even btrfs-restore. I find this discussion: http://www.mail-archive.com/linux-btrfs@vger.kernel.org/msg25990.html So I tried several times with btrfs chunk-recover: If I keep all the disks, it goes like this: [root@tambura btrfs-progs]# ./btrfs chunk-recover -v /dev/sdb1 > log_2.txt All Devices: Device: id = 3, name = /dev/sdc2 Device: id = 4, name = /dev/sda2 Device: id = 1, name = /dev/sdb1 btrfs: cmds-chunk.c:125: process_extent_buffer: Assertion `!(exist->nmirrors >= 2)'' failed. So I did try removing sdc2 (that is the drive where...

...e SUM_1^inf 0.1/n is infinite. If we assume (in the absence of any better estimate) that the formula p_n = 0.1/n holds out to the n at which the total probability is unity, and that p_n = 0 for larger n; we find that the critical n is the word rank 8,727. The entropy is then: -SUM_1^8727 p_n log_2 p_n = 11.82 bits per word." YHNBT. YHL. HAND. I, Zone Lee Free, encrypted, secure Web-based email at www.hushmail.com

Hello guys.I am working on implementing the PL2 weighting scheme of the DFR framework by Gianni Amati. It uses the Poisson approximation of the Binomial as the probabilistic model (P), the Laplace law of succession to calculate the after effect of sampling or the risk gain (L) and within document frequency normalization H2(2) (as proposed by Amati in his PHD thesis). The formula for w(t,d) in

..., as the label > union operation becomes O(n) in the number of supported labels, and > data associated with it will quickly dominate the live variable set, > causing register spills and hampering performance. > > Instead, a low overhead approach is proposed which is best-case > O(log_2 n) during execution. The underlying assumption is that the > required space of label unions is sparse, which is a reasonable > assumption to make given that we are optimizing for the case where > applications mostly copy data from one place to another, without often > invoking the need...

The self_nmi() code cause''s an NMI to be triggered by sending an APIC message to the local processor. However, NMIs are blocked by the VMEXIT, until the next iret or VMENTER. Volume 3 Chapter 27 Section 1 of the Intel SDM states: An NMI causes subsequent NMIs to be blocked, but only after the VM exit completes. As a result, as soon as the VMENTER happens, an immediate VMEXIT happens

This round implements all of the review comments from V2 and all patches are now acked. Unless there are any objections I intend to apply later this morning. Ian.

First off, Apologies for the massive patch series... This series boots a 32-bit dom0 kernel to a command prompt on an ARMv8 (AArch64) model. The kernel is the same one as I am currently using with the 32 bit hypervisor I haven''t yet tried starting a guest or anything super advanced like that ;-). Also there is not real support for 64-bit domains at all, although in one or two places I

Hello everyone, this is the fourth version of the patch series that introduces ARMv7 with virtualization extensions support in Xen. The series allows Xen and Dom0 to boot on a Cortex-A15 based Versatile Express simulator. See the following announce email for more informations about what we are trying to achieve, as well as the original git history: See

Hello everyone, this is the very first version of the patch series that introduces ARMv7 with virtualization extensions support in Xen. The series allows Xen and Dom0 to boot on a Cortex-A15 based Versatile Express simulator. See the following announce email for more informations about what we are trying to achieve, as well as the original git history: See