similar to: Model Based Bootstrap

Hello. I have some further problems with modelling an optimization problem in R: How can I model some optimization problem in R with a linear objective function with subject to some nonlinear constraints? I would like to use "optim" or "constrOptim", maybe with respect to methods like "Simulated Annealing" or "Sequential Quadric Programming" or something

Hi all, I've got a question on regarding how to find out the duration of an ogg vorbis file. Sorry if it should already be mentioned somewhere in the docs, but I couldn't find out how to do it the best way. So, I can read the [bitrate_nominal] field from the identification header (if it is set), find out the size of the audio data (by subtracting the size of the three headers from the

Hi, As I mentioned some time ago on the mailing list, I'm working on the implementation of the Sarkar's Extended Linear Scan algorithm for LLVM. For testing and debugging of this algorithm, I need some good test-cases that check different functionalities of the register allocator, e.g.: - test-cases involving a lot of spilling - test-cases using pre-colored registers, e.g. like the EAX

Hi, I'm trying to sketch an LLVM-based implementation of the Extended Linear Scan algorithm, described in this Vivek Sarkar's paper: http://www.cs.rice.edu/~vs3/PDF/cc2007.pdf Sarkar reports that this version of Linear Scan produces better code than graph-coloring regallocs and is also much faster (15x to 68x). I already started work on the implementation of this algorithm and have a few

Hi, While profiling LLVM using my test-cases with huge MBBs, I noticed that FoldingSetNodeID operations (ComputeHash,insertion,etc) may become really inefficient for the nodes, which have very many operands. I can give you an example of what is meant by "very many". In my test-case (you can fetch it from here http://llvm.org/bugs/attachment.cgi?id=1275), which is just one HUGE MBB

Hi David, --- David Greene <dag at cray.com> schrieb: > On Thursday 31 January 2008 07:05, Roman Levenstein wrote: > > > I already started work on the implementation of this algorithm and > have > > a few hopefully rather simple questions: > > Roman, > > I'm excited to hear that you are working on this algorithm. Do you > plan to contribute it

On Jan 31, 2008, at 5:05 AM, Roman Levenstein wrote: > Hi, > > I'm trying to sketch an LLVM-based implementation of the Extended > Linear Scan algorithm, described in this Vivek Sarkar's paper: > http://www.cs.rice.edu/~vs3/PDF/cc2007.pdf > Sarkar reports that this version of Linear Scan produces better code > than graph-coloring regallocs and is also much faster (15x

Hi Chris, This is a good idea and I started thinking in that direction already. But what I don't quite understand the TFs, how TFs are formed and which rules they should obey to. For example now: > PendingLoads created by the SelectionDAGLowering::getLoadFrom and then copied into the > TokenFactor node by SelectionDAGLowering::getRoot called from the >

Hi Chris, Your were totally right with your suggestion. I have implemented the code that : a) does not merge multiple TokenFactor nodes in the DAGCombiner::visitTokenFactor(), if the resulting TF node would contain more than 64 operands. b) produces a bunch of TokenFactor nodes with at most 64 operands, instead of one huge TokenFactor in the SelectionDAGLowering::getRoot(). If we have n

German: Hallo, kann mir jemand helfen Gomez Peer unter Ubuntu zu emulieren? Ich bekomme es nicht hin Installation geht wunderbar nur wenn ich da Programm starte dann ist das Fenster durchsichtig kann also nichts lesen :( Kann mir jemand via Teamviewer helfen? Einfach mir eine PN schreiben ... --- English: Hello, Gomez Peer can someone help emulate under Ubuntu? I get it to install is

Hello. I have some problems, when I try to model an optimization problem with some constraints. The original problem cannot be solved analytically, so I have to use routines like "Simulated Annealing" or "Sequential Quadric Programming". But to see how all this works in R, I would like to start with some simple problem to get to know the basics: The Problem: min f(x1,x2)=

Liebe Liste, bin noch absoluter R-Anf?nger und trotz flei?igen Lesens der Dokumentation noch nicht zur L?sung des folgenden Problems vorgedrungen. Die Werte einer 2D-Matrix sollen in einem einzigen 2D-Plot dargestellt werden, in dem jeweils f?r die Werte einer Zeile ein Graph aus mit Linien verbundenen Punkten gezeichnet wird. Die Matrix besitzt zw?lf Spalten, die x-Achse soll einfach mit 1:12

Hi all, Yesterday, i changed from samba 2.2.3 to samba 3.0, and also i changed the machines which samba is running on. Samba worked and should work as a PDC. It runs on a Debian sid, the test client is a notebook with XP Professional. Yesterday, immediately after migrating, everything worked fine. Even after several reboots, i could logon as a domain user, and i could use the shares. Today, i

Tom Cohen <tom.cohen78@yahoo.se> skrev: Thanks Prof Brian for your suggestion. I should know that for right-skewed data, one should generate the samples from a lognormal. My problem is that x and y are two instruments that were thought to be measured the same thing but somehow show a wide confidence interval of the difference between the two intruments.This may be true that these

Hi Roman, > I already started work on the implementation of this algorithm and have > a few hopefully rather simple questions: > > 1) What is the easiest way to understand which MBB a given instruction > index belongs to? All the required information is available in the > MBB2IdxMap of the LiveIntervalAnalysis class. Would it be useful to add > a small function

On Thursday 31 January 2008 07:05, Roman Levenstein wrote: > I already started work on the implementation of this algorithm and have > a few hopefully rather simple questions: Roman, I'm excited to hear that you are working on this algorithm. Do you plan to contribute it to the public llvm repository? -Dave

Hi, I have a survey dataset of about 20000 observations where for 2 factor variables I have about 200 missing values each. I want to impute these using 10 possibly explanatory variables which are a mixture of integers and factors. Since I was quite intrigued by the concept of rrp I wanted to use it but it takes ages and terminates with an error. First time it stopped complaining about too little

[Postbank-Geldautomaten - Alle Infos zu Standorten, H?chstbetr?gen und vergessenem Geld] Sehr geehrter Kunde, Unsere BestSign App ist keine weitere Banking-App, sondern eine separate Anwendung nur f?r Ihr BestSign-Sicherheitsverfahren. Sie wollen Ihre Auftr?ge einfach mit Ihrem Mobilger?t freigeben, Ohne viel Drumherum oder viele Klicks, Nur schnell, einfach und sicher. Mit der BestSign App

Hi, folks, Here are the codes: ############## y=1:10 x=c(1:9,1) lin=lm(log(y)~x) ### log(y) is following Normal distribution x=5:14 prediction=predict(lin,newdata=x) ##prediction=predict(lin) ############### 1. The codes do not work, and give the error message: Error in eval(predvars, data, env) : numeric 'envir' arg not of length one. But if I use the code after the pound sign, it

On Wednesday 02 April 2008 03:06, Roman Levenstein wrote: > Hi, > > As I mentioned some time ago on the mailing list, I'm working on the > implementation of the Sarkar's Extended Linear Scan algorithm for LLVM. Cool! > For testing and debugging of this algorithm, I need some good > test-cases that check different functionalities of the register > allocator, e.g.: