similar to: ModularIT, the GPL modular service architecture, based on CENTOS

Say I have a tab-delimited table I want to read into R. What should I expect to happen if some of the entries contain the character " ' "? I thought it would read the file fine, but that is not what happens. Instead, all the values in between two " ' "s get read into one field, and things are just seriously messed up. Is this a bug, and besides removing the offending

On Wed, Mar 10, 2004 at 11:31:40PM -0800, Andrew Morton wrote: >... > ext3-journalled-quotas-2.patch > ext3: journalled quota >... This patch broke modular quota: WARNING: /lib/modules/2.6.4-mm1/kernel/fs/quota_v2.ko needs unknown symbol mark_info_dirty cu Adrian -- "Is there not promise of rain?" Ling Tan asked suddenly out of the darkness. There

Subject says it all. Jan _______________________________________________ Xen-devel mailing list Xen-devel@lists.xensource.com http://lists.xensource.com/xen-devel

I am developing a CMS using act_as_tree for the pages and act_as _list to order them (as shown on Railscasts). Each page can load a custom ERB template, for instance I have one to display a standard article and one to display a group of articles (so acting as a category of underling articles). If I want to develop a forum, let''s say that I have a page with id 5, with name forum, how can

Hi Keir: It has been brought to my attention that modular oprofile is broken because it now calls get_vm_area which is not an exported function. This appears to be the result of the changeset that removed vm_map_xen_pages which was only used by oprofile. So we either need to export get_vm_area in Xen, or put that function back. What do you think about this? Thanks, -- Visit Openswan at

Hello everybody, I''ve just started studying Rails and I love it already for its simple, pragmatic spirit and the effectiveness and productivity that its approach brings. I''m thinking about building new applications on top of it and about rebuilding existing J2EE applications in Rails as well, but I''ve come across an architectural problem: we need to structure

The virtio configuration options are inconsistent. According to this, every options that needs virtio will select it: # Virtio always gets selected by whoever wants it. config VIRTIO tristate Note that it's not user-selectable, so any config file that tries to set it will be ignored when kconfig loads those options. And yet we have a whole set of options that depend on VIRTIO, like

The virtio configuration options are inconsistent. According to this, every options that needs virtio will select it: # Virtio always gets selected by whoever wants it. config VIRTIO tristate Note that it's not user-selectable, so any config file that tries to set it will be ignored when kconfig loads those options. And yet we have a whole set of options that depend on VIRTIO, like

Hi all, I've been having a look to all OOP functionallity in R, basically I've been reading "Statistics and Computing" book by Chambers. My problem is that I'm thinking about refactoring many functions of the applications I work with (which is quite huge), in order to modularize its components. I believe that trying to use OOP functionality may help to reorganize and

hello, i wonder what command should i used in R to do the modular. right now i have a vector v <- c(3, 4, 5, 6), but i have tried v%2 or v mod 2 or mod(v, 2) or modular(v, 2), and none of these works. Also, how can i find more function command online, i have to search in the mailing list questions, but it is not enough, is that a better website i can search more about R online. Thank you

I want to find the inverse of an integer k mod p (prime.) Is there a function that can do this for me? I know i could simply write (k^(p-2)) %% p, but i need to do this for large primes (above 100) and this gives the warning message: Warning message: probable complete loss of accuracy in modulus so this method does not work. Any ideas? Thanks, Samuel --

Hi, I know there's been some talk about bignums already, this is similar to it, but not exactly the same. I'm currently using LLVM for my master thesis. The goal is to make a compiler for zero-knowledge proofs of knowledge protocols. This compiler should target embedded devices. There's a language called the protocol implementation language in which these protocols should be

Hi, I'm using the '%%' operator in some code, and am running into the following erroneous outcome: > 1.2 %% 0.2 [1] 0.2 Unless I'm very mistaken, the result should be 0 (indeed, 12 %% 2 does result in 0). Furthermore: > 1.20000000000000001 %% 0.2 [1] 0.2 > (1.2+1e17) %% .2 [1] 0 Warning message: probable complete loss of accuracy in modulus (Warning

Signed-off-by: Jeremy Fitzhardinge <jeremy.fitzhardinge@citrix.com> diff -r cfb49fe940fd -r 81f75ed45ec2 tools/hotplug/Linux/init.d/xencommons --- a/tools/hotplug/Linux/init.d/xencommons Tue Aug 16 16:56:16 2011 -0700 +++ b/tools/hotplug/Linux/init.d/xencommons Tue Aug 16 17:05:18 2011 -0700 @@ -29,12 +29,18 @@ XENCONSOLED_PIDFILE=/var/run/xenconsoled.pid shopt -s extglob -if [

Hi, My personal opinion: Just to be sure I understand what you're considering: you want to write a backend that will produce optimized machine code for a device with modular arithmetic instructions (not simulate such a device on a standard CPU)? In which case, won't the same assumptions that are embodied in the transformations for the case of unsigned 2's complement arithmetic (in

I've been playing around with LLVM to write a backend for a rather "simple" (co-)processor. Assume that only three arithmetic instructions exist: ADD mod N, SUB mod N and MUL mod N. The modulus N is programmable and stored in a register. No ordinary arithmetic instructions are available. The word size is 256-bit. In other words, the following function, b + c mod N, corresponds to

Thanks for your insightful suggestions. Yes, I am programming for a real device that does modular arithmetic (and only modular arithmetic). The modulus N is fixed during a single launch of a program. One way I could also come up with is to simply use add i256 %a, %b to represent a + b mod n, and let LLVM passes to reason about possible optimizations. However these are not semantically identical

It seems to me that Xen is full of stuff that aren''t beneficial for everybody, this includes NUMA, ACM and other stuff that certain companies try to introduce... In a better world, the Xen binary would have been more sleek and fast, and those extra features should be loaded via stating a Module boot line in Grub. This way, testing would be easy and it''s more elegant than using a