similar to: Adding up intervals by activity

Hello all, Simple version of my problem: I've got a list of data frames, where each data frame has the same number of columns and the same column names. I'd like to flatten the list into one large data frame. Is there an easy way to do this? Quick example code: a <- data.frame(x=c(1,2,3),y=c(5,7,9) b <- data.frame(x=c(2,4,7,9),y=c(2,3,5,4)) z <- list(a,b) # Do

Hello: I''m trying to put a puppet master on an EC2 instance, and have it be accessible to agentes using either its EC2 DNS name (e.g., ec2-xxx-xxx-xxx-xxx.compute-1.amazonaws.com) or a friendlier alias (e.g., puppet.example.com). My /etc/puppet/puppet.conf looks like: [master] certname=ec2-xxx-xxx-xxx-xxx.compute-1.amazonaws.com

Hello all, (Apologies in advance if my terminology is incorrect, I'm relatively new to R and statistics). I have data from a factorial design with two treatments (CRF-23), and I'm trying to compute treatment-contrast interactions through analysis of variance. I can't figure out how to do contrasts properly, despite reading the help for "C" and "contrasts"

Modify the cpufreq ondemand governor so that it can get idle and total ticks from the Xen hypervisor. Linux and Xen have different ideas of what an idle tick is, so the Xen values for both have to be returned in the same platform hypercall. Otherwise, use basically the same scheme as native Linux. Signed-off-by: Mark Langsdorf <mark.langsdorf@amd.com> iff -r 9bf1ddd0f6bf

Modify the cpufreq ondemand governor so that it can get idle and total ticks from the Xen hypervisor. Linux and Xen have different ideas of what an idle tick is, so the Xen values for both have to be returned in the same platform hypercall. Signed-off-by: Mark Langsdorf <mark.langsdorf@amd.com> diff -r b4278beaf354 xen/arch/x86/platform_hypercall.c --- a/xen/arch/x86/platform_hypercall.c

Hello, I'm trying to get the pointer to the first element of a string (so that I can pass it to a function). The string itself is a constant kept in a global variable. My end goal is to generate the IR for something like "puts("Hello World")"; I'm stuck on the parameter part of the call instruction. So far I have something like this: const std::string& str =

Greetings listeRs - Given a data frame such as times time1 time2 time3 time4 1 70.408543 48.92378 7.399605 95.93050 2 17.231940 27.48530 82.962916 10.20619 3 20.279220 10.33575 66.209290 30.71846 4 NA 53.31993 12.398237 35.65782 5 9.295965 NA 48.929201 NA 6 63.966518 42.16304 1.777342 NA one can use "transform" to

Hi, Speex-dev I've been able to get Speex to compile on SM400M(MIPSII) with problems. ------ Rebuild All started: Project: speexenc, Configuration: Debug SM400M (MIPSII) ------ Deleting intermediate and output files for project 'speexenc', configuration 'Debug|SM400M (MIPSII)' Compiling... getopt.c getopt1.c skeleton.c speexenc.c .\speexenc.c(501) : warning

Hi! Here''s what I want: root class 0010 premium parent class 1000 premium child classes 1xyz best-effort parent class 2000 best-effort child classes 2xyz default class 3000 Here''s how I do it: eth1: DEFAULT=3000 eth1-0010.root: RATE=100Mbit LEAF=sfq eth1-0010:1000.premium CEIL=352Kbit RATE=352Kbit PRIO=2 LEAF=sfq eth1-0010:1000:1xyx.child1 CEIL=32Kbit RATE=8Kbit

I have some problem with traffic shaping on debian testing. I actually posted a full config on the list a while ago but didn''t get any answers. The problem is that traffic doesn''t get into the user classes (~150) when I associate a class with a qdisc. I tried sfq, fifo but none works. If I dont''t associate a qdisc with a class classification occurs well.

A friend and I have recently added the ability to announce the callers position in the call queue every x seconds.. or even just inject an anouncement every x seconds. All setup in queues.conf and can be setup per queue. My next project is to add the ability to announce the callers estimated wait time. I want some feedback to see whats the best method to calculate that? What do you want just

Hi, I would really appreciate if I could get some help here. I'm using nlm to minimize my negative log likelihood function. What I did is as follows: My log likelihood function (it returns negative log likelihood) with 'gradient' attribute defined inside as follows: # ==========Method definition====================== logLikFunc3 <- function(sigma, object, totalTime) { y <-

I like the new difftime functionality. Here's a dataframe of 5k run times: > r5k race date totaltime pace mile 1 RUDOLPH 2004-12-03 19:00:00 27.76667 mins 8.937224 mins 3.106856 2 RUDOLPH 2005-12-02 18:30:00 25.28333 mins 8.137916 mins 3.106856 3 FROSTBITE 2005-12-10 07:00:00 24.75000 mins 7.966253 mins 3.106856 4 JUDICATA 2006-03-04

Like we saw in console or rails log show totaltime, database time, rendering time. on my page footer in production. is it possible to acces those information from controller or view template with out time it again ? -- Posted via http://www.ruby-forum.com/. -- You received this message because you are subscribed to the Google Groups "Ruby on Rails: Talk" group. To post to this

Hello, friends! I vahe a problem using prototype1.4 in IE6. I am trying to create bandwidth speed test tool. The idea is to download one by one X times (i.e. 10) one and the same ASCII-file with size = 1MB. I would like to measure time and speed of each run, to display the intermediate results after aech run and finally after all X rund display total results as average of all runs. But when I

Hello, I have start and end coordinates from different experiments (DNase hypersensitivity data) and now I would like to combine overlapping intervals. For instance (see my test data below) (2) 30-52 and (3) 49-101 are combined to 30-101. But 49-101 and 70-103 would not be combined because they are on different chromosomes (chr a and chr b). Does anybody have an idea? Thanks Hermann > df

I can get the size of a ulaw file using STAT. And I can get the duration in seconds by doing filesize/8000. Your tea-break challenge is to help me find the shortest most Asterisk-like way of saying: "The following file is [<n> minutes and] <s> seconds long". ...without referring to external applications! Yes, I'm aware of the math behind it, but I was hoping for a

Hi, We would like to inform the community that we're releasing a version of our research compiler, "AESOP", developed at UMD using LLVM. AESOP is a distance-vector-based autoparallelizing compiler for shared-memory machines. The source code and some further information is available at http://aesop.ece.umd.edu The main components of the released implementation are loop memory

Good afternoon. First my information Code: $ uname -a Linux Oreste 3.0-ARCH #1 SMP PREEMPT Tue Aug 30 08:53:25 CEST 2011 x86_64 Intel(R) Core(TM)2 Duo CPU T9300 @ 2.50GHz GenuineIntel GNU/Linux $ kded --version Qt: 3.3.8 KDE: 3.5.10 KDE Daemon: $Id: kded.cpp 711061 2007-09-11 09:42:51Z tpatzig $ $ lspci | grep "VGA" 01:00.0 VGA compatible controller: nVidia Corporation G84 [GeForce

Dear all, I have some very big data files that look something like this: id chr pos ihh1 ihh2 xpehh rs5748748 22 15795572 0.0230222 0.0268394 -0.153413 rs5748755 22 15806401 0.0186084 0.0268672 -0.367296 rs2385785 22 15807037 0.0198204 0.0186616 0.0602451 rs1981707 22 15809384 0.0299685 0.0176768 0.527892 rs1981708 22 15809434 0.0305465 0.0187227 0.489512 rs11914222 22 15810040 0.0307183