similar to: Handling Missing Data

Apologies for the obvious, but just to clarify: there is no reason to "justify" a PCA -- it's just an eigen decomposition of a matrix and is therefore "justified" by linear algebra. If one wants to determine whether some subset of the eigenvectors = principal components suffice to "represent" the data in some sense, then that is where distributional

Hi, I would like to ask how can I do the problem as follows by R. Thank you very much. Q: Create a list of twenty distinct first names, ten male and ten female, and store them into an array. Write a routine for selecting a simple random sample of five names and counts the number of male and female names in the sample when the sample is drawn : (a) with replacement (b) without

Good afternoon. I am a master student in University of Porto in Portugal. At this moment I’m starting to use R, so I have some doubts. The aim of my analysis is: calculate a pairwise FST matrix from fasta file and creat a principal component analyses with adegenet package (I use seqinr and ape package to read this file, then I convert this file into a genind object with DNA2genind function

I'd like to perform return variable assignments like matlab. For example, the following function would return A, B, and c to the script that called it. ================================= function [A,B,c] = simple(m,n) A=[ 3 2; 3 3] B=m c=1:n ================================= I'd like to do similar assignments in R, but I seem to be able to only return one variable. I tried to use a

Hi all, I have a set of elements (1, 1, 0,1,1,0,1,0,1,1) with ten elements. I have to construct the permutation matrix of this set which is of the size 10 by 2^10. Can some one help how is this possible? Is there is a particular function in R or I need to make function? Best [[alternative HTML version deleted]]

I'm trying to get R to simulate the sum of the values on 10 fair dice (yes, it's related to a homework problem, but is not the problem itself). I tried to do this: > rep(sum(sample(1:6,100,replace=T)), times=10) [1] 341 341 341 341 341 341 341 341 341 341 and noticed that sum(sample()) seems to be only evaluated once. How can I overcome this, so that I get a vector of values that

Hi, I am teaching a one month class in applied statistics and want to bring my students up to speed in R without devoting much/any lecture time to R instruction. I think that the best way to do this is to provide them with a lot of R questions for homework. These questions would be numerous (there is a lot of material to cover), go from very simple to somewhat complex, and focus on all the

Hi, This is a spin-off of previous Windows SEH RFC below. This RFC only focus on supporting HW Exception Handling. A detailed implementation can be seen in here: https://github.com/tentzen/llvm-project/commit/8a2421c274b683051e456cbe12c177e3b934fb5e It passes all MSVC SEH suite (excluding those with “Jumping out of _finally” ( _Local_Unwind)). Thanks, --Ten **** The rules for C code: ****

As stated in the design paragraph, this design does not intend to model precise CFG at instruction level since it’s complicated and unnecessary. As long as we comply C and C++ rules listed below, we achieve -EHa semantic. There is NO need to precisely model HW exception control flow at instruction-level. Your example about memcpy() is just a bug in current implementation. I will fix it so that

Many published analyses which build on post-dominance assume a canonical single-dominator-tree form induced by unifying all exits (and often adding a virtual edge from START to END). In contrast, it seems that the current LLVM post-dominator analysis only operates in a mode in which it generates a forest of post-dominator trees, with one rooted at each exit node. The problem this can cause is

Fedor Sergeev <fedor.sergeev at azul.com> writes: >> Ok. The way I envision this working from a user standpoint is >> -opt-bisect-limit <n> would mean "n applications of code >> transformation." where "code transformation" could mean an entire pass >> run or individual transforms within a pass. Each pass would decide what >> it

* When a goto in a _finally occurs, we must "unwind" to the target code, not just "jump" to target label I'm not sure what you're trying to say here. In the Microsoft ABI, goto out of a catch block also calls into the unwinder. We have to run any destructors, and return from the funclet (catchret/cleanupret). * The call inside a _try is an invoke with EH

Hi, Eli, Why are you under the impression that threw_exception() will not be called if optimizations are enabled? I don’t know if the -EHa Spec is clearly described in MSFT Webs. At least this proposal has described the rules for both C & C++ code. The very first rule clearly said that “no exception can move in or out of _try region., i.e., no potential faulty instruction can be moved

Resending; I accidentally dropped llvm-dev. -Eli From: Eli Friedman Sent: Wednesday, April 1, 2020 1:01 PM To: Ten Tzen <tentzen at microsoft.com> Cc: aaron.smith at microsoft.com Subject: RE: [EXT] [llvm-dev] [RFC] [Windows SEH] Local_Unwind (Jumping out of a _finally) and -EHa (Hardware Exception Handling) This looks like it outlines the implementation pretty well. For goto in finally,

Hello all. Thanks for all the support. I'm at the very beginning stage of an upgrade. I'm trying to # sh makerpms.sh, but it complains about there not being /usr/src/redhat/something/something, and I check and its not there. I went to my router which is running RedHat 7.1, and its there. Does 7.1 & 7.3 have different directory structures, or what's the story? Did I delete

Yes tell that to the people that create rhel6, rhel7 and rhel8 and give lts support. Unless google pays you to train your software to mark their messages as spam, you might want to consider yourself not to smart as well ;) My solution would solve the problem others create (see the other mail). Your solution wastes your time and will always be carrying water to the sea. I think if 50% of

Reply inline From: Ten Tzen <tentzen at microsoft.com> Sent: Wednesday, April 1, 2020 3:54 PM To: Eli Friedman <efriedma at quicinc.com>; llvm-dev <llvm-dev at lists.llvm.org> Cc: aaron.smith at microsoft.com Subject: [EXT] RE: [llvm-dev] [RFC] [Windows SEH] Local_Unwind (Jumping out of a _finally) and -EHa (Hardware Exception Handling) ? For goto in finally, why are you

Fedor Sergeev <fedor.sergeev at azul.com> writes: > On 06/12/2018 12:04 AM, David A. Greene wrote: >> // PIA - PassInstrumentationAnalysis >> if (PIA->skipTransformation()) { >> return; >> } >> // Do it. >> PIA->didTransformation(); > That should be easily doable (though the interface would be part of > PassInstrumentation > rather

Hello, I want to know if LLVM support static taint analysis now ? and how to implement static taint analysis code in term of LLVM pass or something else ? can anyone help me?Thank you very much! zhaoqian -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20150717/0236bed3/attachment.html>

The EuroLLVM'18 Developers’ Meeting relies on volunteers to keep things running smoothly. Moderators are critical to this as they keep speakers on track and facilitate Q&A after the talk. I’m looking for community members who would be attending specific talks anyway, to volunteer to moderate the sessions. If you are interested in volunteering, *please respond to this email with your first