search for: oei

...1 insertion(+), 1 deletion(-) diff --git a/xen/drivers/char/pl011.c b/xen/drivers/char/pl011.c index 0e1eb64..e4bd702 100644 --- a/xen/drivers/char/pl011.c +++ b/xen/drivers/char/pl011.c @@ -140,7 +140,7 @@ static void __init pl011_init_postirq(struct serial_port *port) pl011_write(uart, ICR, OEI|BEI|PEI|FEI); /* Unmask interrupts */ - pl011_write(uart, IMSC, OEI|BEI|PEI|FEI|TXI|RXI); + pl011_write(uart, IMSC, RTI|OEI|BEI|PEI|FEI|TXI|RXI); } static void pl011_suspend(struct serial_port *port) -- 1.7.10.4

Hi, I am using RH 7.2 Enigma and with ext3 filesystem. Before installing RH Linux, I used Partition Magic 7 in Windows to prepare partition ext2 for Linux which was then converted to ext3 when installing RH 7.2. Now that I want to expand the space for the Linux partition, I find out that PM 7 does not support and recognize ext3 filesystem. My questions then are: 1. How do I convert ext3 to

On Tue 2015-05-26 12:57:05 -0400, Hubert Kario wrote: > creating composites that will pass even 100000 rounds of Miller-Rabin is > relatively simple.... > (assuming the values for M-R tests are picked randomly) Can you point me to the algorithms for doing that? This would suggest that we really do want primality proofs (and a good way to verify them). Do those algorithms hold for

...lkin CompactFlash reader instead, that's very, very slow indeed. The greatest data rate I see is about 4KB/sec, although no errors are reports. Needless to say, this works much faster under Windows :( Any suggestions gratefully received: mkn@shrewd$ sudo camcontrol inquiry da0 pass0: <OEI-USB CompactFlash 5.00> Removable Direct Access SCSI-0 device pass0: Serial Number pass0: 650KB/s transfers mkn@shrewd$ sudo usbdevs -v Controller /dev/usb0: addr 1: self powered, config 1, UHCI root hub(0x0000), Intel(0x0000), rev 1.00 port 1 addr 2: self powered, config 1, USB2.0 Hub Controll...

...-0400, Hubert Kario wrote: >> > creating composites that will pass even 100000 rounds of Miller-Rabin is >> > relatively simple.... >> > (assuming the values for M-R tests are picked randomly) >> >> Can you point me to the algorithms for doing that? > > OEIS A014233 Hm, this is a sequence, but not an algorithm. It looks to me like it is not exhaustive, just a list of those integers which are known to have the stated property ("Smallest odd number for which Miller-Rabin primality test on bases <= n-th prime does not reveal compositeness"...

Hi, I am trying to get different combinations of a vector of different size and find their sum. For example, if I have a vector (i,j) where i and j can be anything from 0 to 5, i get these combinations (0,0), (0,1), (1,0), (1,1), (2,0), ...... (5,5) and find sum of these as 0, 1, 1, 2, ..... , 10. I used outer functions to get this and it worked. What if I have a vector (i,j,k) where all i, j ,

On Wed 2015-05-27 05:23:41 -0400, Hubert Kario wrote: > On Tuesday 26 May 2015 15:10:01 Daniel Kahn Gillmor wrote: >> On Tue 2015-05-26 14:02:07 -0400, Hubert Kario wrote: >> > OEIS A014233 >> >> Hm, this is a sequence, but not an algorithm. It looks to me like it is >> not exhaustive, just a list of those integers which are known to have >> the stated property ("Smallest odd number for which Miller-Rabin >> primality test on bases <= n...

...pport = yes * dns proxy = yes * time server = yes * encrypt passwords = yes * smb passwd file = ... * unix password sync = yes * passwd program = changepass %u * passwd chat = (check necessity for alternate Redhat compatible chat script.) * workgroup = OEI * printing-related configs + CUPS printcap name = lpstat printing = cups print command = lpr -P %p -oraw %s lpq command = /usr/bin/lp...