similar to: Intransitive DAG

Aloha all, I love using ggplot. It took a while to get used to the grammar of graphics, but it is starting to get easy now that I am thinking in a more structured way. A question. I'm making a wind rose that I'd like to be oriented with due north straight up. I've discovered that the orientation is sensitive to how north is represented. When north is represented as 0,

Aloha all, I have a data frame with 4 columns. The first three are factors (f1, f2, f3) and the fourth is numeric. I'd like to explore these data using median polish. To do that I plan to use medpolish() on the matrix[f1,f2xf3], then medpolish on the resulting matrix[f2,f3]. This approach is described by Cook on page 141 of Exploring Data Tables, Trends, and Shapes. split()

Given two numeric vectors of possibly unequal length, I'd like to pair each element of the shorter vector with an element of the longer vector such that the sum of squared differences between the pairs is minimized. Can someone point me to an R function or an algorithm for accomplishing this? All the best, Tom Thomas S. Dye, Ph.D. T. S. Dye & Colleagues, Archaeologists, Inc.

An embedded and charset-unspecified text was scrubbed... Name: not available URL: <https://stat.ethz.ch/pipermail/r-help/attachments/20091123/f708f94d/attachment-0001.pl>

This message is in MIME format. The first part should be readable text, while the remaining parts are likely unreadable without MIME-aware tools. Send mail to mime@docserver.cac.washington.edu for more info. --1465796871-645734172-974620647=:18687 Content-Type: TEXT/PLAIN; charset=US-ASCII Hi all, I've discovered and (hopefully) fixed a bug in the stars function I wrote some time ago.

Can anyone help with scripting the commands below? 1. Add/create a new column to df and name it as ShortPause . 2. Convert ShortPause as a factor variable. 3. ShortPause will have two levels (short and long). Assign short if pause is smaller than 0.1, and assign long otherwise. 4. How many ?syntax==intransitive? observations were realized with a tap (tapped==Tapped)? (Use xtabs() and ftable() to

I'm developing the ABCD algorithm for LLVM, and I will need to store some information as a digraph. I was thinking of a list of adjacency, implemented with a map<Instruction, Set<Node>>. The node would have an Instruction and a value. I opted for map and set, because I will create the graph once and will search on it a bunch of times, and will never remove a node. Is there

Hi, I work on DDC, the compiler of a research Haskell dialect, Disciple (disciple.ouroborus.net (http://disciple.ouroborus.net)). We are looking to make use of LLVM's type-based alias analysis metadata to encode non-aliasing information between variables. We have found that the tbaa structure is somewhat limited in its expressivity. In particular we couldn't encode intransitive

Hi all, Please let me know if this isn't the correct place to report bugs in contributed code. Otherwise, the following code contains one additional line and a short comment above it. The extra line of code catches the unusual situation where a data column contains all 0 values. The corrected code is below the signature. Thanks for your help. Tom Thomas S. Dye, Ph.D.

On Monday 06 July 2009 14:32, Andre Tavares wrote: > I'm developing the ABCD algorithm for LLVM, and I will need to store > some information as a digraph. > > I was thinking of a list of adjacency, implemented with a > map<Instruction, Set<Node>>. The node would have an Instruction and a > value. I opted for map and set, because I will create the graph once and

Hi all, A while ago there was a discussion on changing the current "set of trees" representation of TBAA metadata to be more expressive, prompted by the need to support C structs. Dan Gohman also talked about the issue here: http://llvm.org/devmtg/2012-11/Gohman-AliasAnalysis.pdf. It was suggested that the trees be replaced by a type DAG then. While working on this compiler

Hello R-users, I am currently trying to learn how to use the function gls of the nlme library. I fitted the following model: Generalized least squares fit by REML Model: response ~ array + dye + genes + variety + variety * genes + array * genes + dye * genes Data: data I have 11 arrays, 2 dyes, 2 varieties, 3200 genes, and 2 replications for each. Therefore I should have the corresponding

Hi, I have network data in the form of a couple of edgelists containing weights in the format "x,y,weight" whereby x represents row header and y represents column header. All edgelists are based on links among 634 nodes and I need to convert them into a 634*634 weighted matrix. I searched for online help using possible keywords I know, but I could not find a clue how to do this in

I encountered the following problem, can anyone help me? when i use "nmblookup -B 192.168.1.255 redmaple" on my linux box named redmaple, something like "(tdb(null)): could not open file /usr/local/samba/var/locks/unexpected.tdb. No such file or directory" is output, and the name lookup failes. my samba is 2.2.3a, IP address of redmaple is 192.168.1.5 rgds aloha

Aloha, Has anyone written an XML application for a Ciso 7960 phone running SIP? I can't find any examples anywhere! Anyone know of any resources for this? I have read it can render XML & can get input from the keypad & softkeys. Aloha, Matt

Aloha all, I know too little about what I'm about to write and hope I'm not wasting your time. For a class I'm teaching in archaeological data analysis, I'm trying to put together a routine that calculates the so-called Petersen index and, especially, confidence intervals for the index. This was introduced to archaeologists by N.R.J. Fieller and A. Turner in an article

hi all got a windows 2008 server using samba as a primary domain controller. also got terminal services on the windows box for remote desktops, got some clients set up with thinstation to automatically connect to the terminal server with rdesktop. got a problem with logging on and off, its taking about 2 minutes to log in, "please wait for the user profile service", time increases if

I'm confused about how to specify DAG patterns for a given instruction Here is an example for my target class ALU1_RR<bits<4> subOp, string asmstr, SDNode OpNode> : ALU_RR<subOp, asmstr, [(set GPR:$rD, (OpNode (i32 GPR:$rA), (i32 GPR:$rB)))]>; def ADD : ALU1_RR<0x0, "l.add", add>; The set operation simply creates a list. The add operation

Hi, Regarding the mischeduler, I wonder // For loops that are acyclic path limited, aggressively schedule for // latency. This can result in very long dependence chains scheduled in // sequence, so once every cycle (when CurrMOps == 0), switch to normal // heuristics. if (Rem.IsAcyclicLatencyLimited && !Zone->getCurrMOps() && tryLatency(TryCand, Cand, *Zone))

Hi all, when i run this script: >read.table("Angelika.txt",header=T,sep="\t") >mytable=read.table("Angelika.txt",header=T,sep="\t") >for ( dye in c("A","B","C","F","G","K","L","M")) + { + for (cond in 1:8) + { + measurement =