search for: ewww

Dear R users, the way I understand the documentation of sub() and regexp the following code: sub('[[:digit:]]{1,2}', '', '9ewww') ... should yield: 'ewww' It returns, however: 'www' Why is this the case? My code should just substitute 1 (minimum) or up to 2 (maximum) digits, i.e. numbers and not the 'e' in the string. Do I misinterpret something here? Thanks for any ideas Jannis >...

Hi I have set of records seperated by a separator say "$$$" i want to get the values in a dataframe. eq qwer$$12$$qwre ewrtr$7789$ewwe I want the output as\ V1 V2 V3 qwer 12 qwre ewrtr 7789 ewwwe Please help me ----- Thanks in Advance Arun -- View this message in context: http://r.789695.n4.nabble.com/Help-in-splitting-the-records-tp4650827.html Sent from the R help mailing list archive at Nabble.com.

...re unable to patch to the jump table in the .rodata segment unless we force that segment to load in the low 2GB of the address range. Currently we just request pages of memory from the OS and that memory is much deeper in the address space. Is there proper way to patch the address or instruction (ewww) or have the ELF emitter generate a RIP based instruction. If a real linker doesn't patch the instruction, does the ELF loader always try to load .rodata segments in the low 2GB of memory regardless of if it is from the main image or from a shared library? Thanks for any help. --- Tim Smith...

...p table in the .rodata segment unless we force that segment to load > in the low 2GB of the address range.  Currently we just request pages of > memory from the OS and that memory is much deeper in the address space. > > > > Is there proper way to patch the address or instruction (ewww) or have the > ELF emitter generate a RIP based instruction.  If a real linker doesn’t > patch the instruction, does the ELF loader always try to load .rodata > segments in the low 2GB of memory regardless of if it is from the main image > or from a shared library? > > > > T...

...p table in the .rodata segment unless we force that segment to load > in the low 2GB of the address range.  Currently we just request pages of > memory from the OS and that memory is much deeper in the address space. > > > > Is there proper way to patch the address or instruction (ewww) or have the > ELF emitter generate a RIP based instruction.  If a real linker doesn't > patch the instruction, does the ELF loader always try to load .rodata > segments in the low 2GB of memory regardless of if it is from the main image > or from a shared library? > > > &g...

Hi, i am looking now at the code which i assume loads the rest of isolinux.bin. The entry point for program execution from the MBR is obviously at http://git.zytor.com/syslinux/syslinux.git/tree/core/isolinux.asm#n186 (Do i get it right that this is the Intel syntax ? (Gronfff)) If POP yields the victim of the most recent not yet popped PUSH, then this does not look correctly coordinated

...BIOS after andw $1,%cx /* Bit 0 = fixed disk subset */ jz 1f jz jumps because CX is 0. This gets pushed to the stack. (So the code around the int 13 assumes that either int 13 fails and returns CX == 0, or the reply is good enough to reach "andw 1,%cx". Ewww ...) Now in isolinux.asm we have this test, quite immediately after the stack was exploited: mov si,bios_cbios jcxz _start_common mov si,bios_ebios jmp _start_common If CX is 4 (= EDD) here, then we go to LBA addressing and the confused geometry is not of interest on the first try. At le...

lol, your right john, i was also looking at http://savannah.gnu.org/bzr/?group=librefm better? -winn On Tue, Jun 7, 2011 at 1:10 PM, Jonathan Nalley <jnalley at jnalley.com> wrote: > Flash? ? ewww.... That's not very freedom-loving. > > On Tue, Jun 7, 2011 at 11:29 AM, Winn Johnston <winnjohnston at gmail.com> wrote: >> Anyone using this for their streams? >> >> http://barelyfocused.net/blog/2008/10/03/flash-vorbis-player/ >> >> Thanks >> -...

...pro4r is a set of bindings for [2]Verisign''s Payflow Pro SDK. If you''re distributing an app in Ruby/Rails and you use Verisign''s Payflow Pro, you basically have three options (paraphrased from the [3]RoR Wiki): 1. Call the Java/Perl/PHP API from Ruby. (Ewww...) 2. Call Verisign''s command line scripts. (DO NOT DO THIS. This is highly vulnerable to [4]shell injection attacks.) 3. Code a ruby extension which makes use of the Payflow shared library API and make calls directly from Ruby. pfpro4r is an implementatio...

...$1,%cx /* Bit 0 = fixed disk subset */ > jz 1f > > jz jumps because CX is 0. This gets pushed to the stack. > (So the code around the int 13 assumes that either int 13 fails and returns > CX == 0, or the reply is good enough to reach "andw 1,%cx". Ewww ...) Well... I'm not quite following you. If it reaches andw 1,%cx then CX will indicate if wanted EBIOS calls are supported or not as the and will mask away all but the interesting bit. The code: /* Check to see if we have EBIOS */ pushw %dx /* drive number */...

...p table in the .rodata segment unless we force that segment to load > in the low 2GB of the address range.  Currently we just request pages of > memory from the OS and that memory is much deeper in the address space. > > > > Is there proper way to patch the address or instruction (ewww) or have the > ELF emitter generate a RIP based instruction.  If a real linker doesn't > patch the instruction, does the ELF loader always try to load .rodata > segments in the low 2GB of memory regardless of if it is from the main image > or from a shared library? > > > &g...

.../* Bit 0 = fixed disk subset */ >> jz 1f >> >> jz jumps because CX is 0. This gets pushed to the stack. >> (So the code around the int 13 assumes that either int 13 fails and returns >> CX == 0, or the reply is good enough to reach "andw 1,%cx". Ewww ...) > > Well... I'm not quite following you. > If it reaches andw 1,%cx then CX will indicate if wanted EBIOS calls > are supported or not as the and will mask away all but the interesting > bit. > > > The code: > /* Check to see if we have EBIOS */ >...

Dear all, I am finding difficulty in the following, I would like to create an empty matrix e.g. 10x10 of 0s and sequentially fill this matrix with randomly placed a 1s until it is saturated. Producing 100 matrices of sequentially increasing density., This process needs to be randomized 1000 times., I assume i should run this along the following lines, 1) Create 1000 matrices all zeros, 2) add

Hey guys, I have several Linux routers in place at high-usage locations (student apartment complexes). I''m having trouble with some of the routers which use 6Mbit DSL lines as their Internet feed. The routers use PPPoE and perform NAT. During peak usage periods, the routers are dropping alot of packets. I''m lead to believe this is because there are too many active

Hi Sean, > Rafael gave me some of the backstory on this. Basically it is to work around some buggy behavior in the Darwin ar. Adding that on the front of the bitcode file just to get a version doesn't seem > like a very clean thing to do. > > Doug, what other alternatives did you guys consider before settling on this? > > As for #2 above, the non-universality of the wrapper

Hi, Is the http://xenbits.xensource.com/linux-2.6-xen.hg tree still being updated? if not, what''s the preferred Linux tree to track that has all of the Xen bits? Thanks, Muli _______________________________________________ Xen-devel mailing list Xen-devel@lists.xensource.com http://lists.xensource.com/xen-devel