Displaying 20 results from an estimated 220 matches for "attain".
2011 Apr 13
1
Previously attainable fisher's exact test
I have a matrix say,
1 4
23 30
and I want to find the previously attainable fisher's exact test p-value. Is
there a way to do this in R?
--
Thanks,
Jim.
[[alternative HTML version deleted]]
2005 Jan 16
2
Empirical cumulative distribution with censored data
Dear list,
I would like to plot the empirical cumulative distribution of the time
needed by a treatment to attain a certain goal. A number of
experiments is run with a strict time limit. In some experiments the
goal is attained before the time limit, in other experiments time
expires before the goal is attained. The situation is very similar to
survivial analysis with censored data. I tryed the function:...
2004 Aug 06
2
XScale realtime encoding possible?
...at operations must be removed for the code to work properly. ...or
> > maybe there's a way to make the emulation in a library instead of making
> > the kernel trap illegal instructions.
>
> Is it a long job to remove the remaining floating point ops? Is it likely
> to be attainable this year? I would like to help if possible.
I think it's attainable. Of course, it depends on how much time I have
and how much help I get. I estimate that removing the remain float
operation would probably take about 20-40 hours of work for the plain
CBR (not including the VBR, VAD and...
2003 Sep 19
3
Locate first index
Hi, all. I'd like to know if exists a manner to get the first index where
a condition is attained in a vector. For example,
There is a better solution than
first.index <- table(subject[corretor==27])[1]
(give me the subject for the first time that corretor is 27)?
Thanks,
========================================
Cezar Freitas (ICQ 109128967)
IMECC - UNICAMP
Campinas, SP - Brasil
2015 Jun 25
5
Call for testing: OpenSSH 6.9
On 01/06/15 22:17, Tom G. Christensen wrote:
> On sparc-sun-solaris2.6 and sparc-sun-solaris2.7 the testsuite fails:
> run test cfgparse.sh ...
> reparse minimal config
> reparse regress config
> listenaddress order
> bad addr or host: ::1 (no address associated with name)
> listenaddress order 1
> bad addr or host: ::1 (no address associated with name)
> listenaddress
2008 May 28
4
centos 5.1 i386 on a 1GIG flash
I have found this link http://owlriver.com/tips/tiny-centos
for installing centos on a minimal system. I am looking at putting
centos on a 1 GIG flash drive. The above page talks about removing packages
after install to attain the small size.
however, I am getting blocked at the install page about not enough room
to install.
All I have selected is the base package. nothing else.
Is there a way to install "less thank" base... I tried to option off
items in the base package
but the last message I got was abou...
2019 Dec 21
2
Loop Access Analysis
Hi all,
What kind of input loop is expected for the loop-access pass to run
smoothly?
Also, what passes (like mem2reg) should be run to ensure the desired form
is attained. Is running mem2reg, indvars and loop-simplify enough for that?
Any help will be appreciated.
Thanks and regards,
Shraiysh
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20191221/c166aec1/attachment.html&g...
2006 Jan 03
1
need to know some basic functionality features of R-Proj
Hi,
I am new-comer to statistics and R-Project. I would like to know if these
features can be attained in R-Project.Please help.
1) beta 1 and Beta 2, or gamma one and gamma two for skewness and kurtosis,
respectively, including standard errors and tests for significance (relative
to values for a Gaussian distribution).
2) linear correlation
3) quadratic regression
4) polynomial regression
5)...
2014 Dec 11
2
Fwd: No source view when using gdb
...lt;- varbayes(as.matrix(iris)[,1:4], 2)
The breakpoint is indeed activated, seemingly at the correct position
in the source file, but instead of the actual text at the respective
line, I get the following :
69 varbayes.c: No such file or directory.
Issuing "next" afterwards seems to attain the expected purpose (step
by step progression), but source code lines are replaced by, e.g. :
72 in varbayes.c
There should be some way of "installing" the source code files, but I
did not find R-specific info there. Does someone have a clue for my
problem?
Thanks by advance,
Pierr...
2015 Jun 25
3
Call for testing: OpenSSH 6.9
On Thu, 25 Jun 2015, Michael Felt wrote:
> Just running a standard make, and then a make install to a packaging
> directory. It seems to be complaining about missing keys - not sure yet if
> this is a show stopper
For packaging you want the install-nokeys rule not install.
--
Tim Rice Multitalents
tim at multitalents.net
2016 May 02
2
[GSoC 2016] Attaining 90% of the turbo boost peak with a C version of Matrix-Matrix Multiplication
Hi Tobias,
according to [1], we can expect 90% of the turbo boost peak of the
processor with a C version of Matrix-Matrix Multiplication that is
similar to the one presented in [1]. In case of Intel Core i7-3820
SandyBridge, the theoretical maximal performance of the machine is
28.8 gflops and hence the expected number is 25,92 gflops.
However, in case of, for example, n = m = 1056 and k = 1024
2006 Apr 16
3
Encryption
...g up certain files on
a remote server ... in an encrypted format.
This got me seriously thinking about the possibility of doing such a thing
with rsync.
I am not too knowledgable about encryption and the mechanisms of the rsync
algorithm (at least as yet :), but I would like to know whether this is
attainable or 'far fetched' so to speak.
In other words, the requirement would be that rsync encrypts the data in
transmission (like is done with ssh), but the data is stored on the receiver
still encrypted.
The reverse (i.e. decryption with private key) would be done only when the
client is retre...
2012 Apr 09
2
Help with Book example of Matrix application
...r on Matrices and
Arrays
The array is
> m
[,1] [,2] [,3] [,4] [,5]
[1,] 0 12 13 8 20
[2,] 12 0 15 28 88
[3,] 13 15 0 6 9
[4,] 8 28 6 0 33
[5,] 20 88 9 33 0
The code is
#returns the minimum value of d[i,j], i !=j and the row attaining
#the minimum, for square symmetric d; no special policy on ties
mind <- function(d) {
n <- nrow(d)
# add a column to identify row number for apply()
dd <- cbind(d,1:n)
wmins <- apply(dd[-n,],1,imin)
# wins will be 2 X n, 1st row being indices and 2nd be...
2008 Dec 19
4
[LLVMdev] Unwinds gone missing
...is currently unimplemented and will remain so for the
forseeable future.
In the mean time, are there any examples available for implementing Java
or Python-style exceptions using __cxa_throw or something similar? I've
read and re-read the various docs on exception handling and I'm not
attaining understanding.
I'm mainly interested in knowing how to generate code that is as
efficient as possible while still allowing exception objects to live on
the garbage-collected heap.
-- Talin
2019 Dec 22
2
Loop Access Analysis
...at 3:33 PM Shraiysh Vaishay <cs17btech11050 at iith.ac.in <mailto:cs17btech11050 at iith.ac.in>> wrote:
> Hi all,
>
> What kind of input loop is expected for the loop-access pass to run smoothly?
> Also, what passes (like mem2reg) should be run to ensure the desired form is attained. Is running mem2reg, indvars and loop-simplify enough for that?
>
> Any help will be appreciated.
>
> Thanks and regards,
> Shraiysh
> _______________________________________________
> LLVM Developers mailing list
> llvm-dev at lists.llvm.org
> https://lists.llvm.org/...
2017 May 08
0
Supersize io operations (IO block size more than 4KiB) is split in to number of 4KiB blocks
...n Centos 7.3 ( where I don't see similar issue on 7.2). I have a
setup that involves TWO CentOS 7.3 servers. I tried to run 4MB IO on FC
LUN(s) on these servers discovered through Emulex LPe 16000 HBAs.
Changed ?options lpfc lpfc_sg_seg_cn =>1024? and ?max_secors_kb =>4MB?
params towards attaining supersize IO ( 4MB block size) , however there are
no improvements in getting more than 4K block size IO. There was no impact
from these changes.
Looking for a help to tune the system to attain supersize IO operation (4MB
writes)
Regards,
Sk
2017 May 15
0
Supersize io operations (IO block size more than 4KiB) is split in to number of 4KiB blocks
...n Centos 7.3 ( where I don't see similar issue on 7.2). I have a
setup that involves TWO CentOS 7.3 servers. I tried to run 4MB IO on FC
LUN(s) on these servers discovered through Emulex LPe 16000 HBAs.
Changed ?options lpfc lpfc_sg_seg_cn =>1024? and ?max_secors_kb =>4MB?
params towards attaining supersize IO ( 4MB block size) , however there are
no improvements in getting more than 4K block size IO. There was no impact
from these changes.
Looking for a help to tune the system to attain supersize IO operation (4MB
writes)
Regards,
Sk
2004 Aug 06
0
XScale realtime encoding possible?
...must be removed for the code to work properly. ...or
>>>maybe there's a way to make the emulation in a library instead of making
>>>the kernel trap illegal instructions.
>>
>>Is it a long job to remove the remaining floating point ops? Is it likely
>>to be attainable this year? I would like to help if possible.
>
>
> I think it's attainable. Of course, it depends on how much time I have
> and how much help I get. I estimate that removing the remain float
> operation would probably take about 20-40 hours of work for the plain
> CBR (...
2009 Jan 29
1
Server video card
I have a big (8 quad core opterons) TYAN server with only the most basic
mobo graphics capability and KDE under Xen is exceedingly slow and the
attainable resolution is not very high. Is there wisdom on a particular
card or chip that plays well with Xen (OpenSuSE 11.0)?
THANK YOU!
Patti
_______________________________________________
Xen-users mailing list
Xen-users@lists.xensource.com
http://lists.xensource.com/xen-users
2007 Feb 13
1
lag orders with ADF.test
...; follow a top-down strategy based on the Akaike's and Schwarz's information criteria
in the datails to the ADF.test function. What does a "top-down strategy" mean? Probably the respective criterion is minimized and the mode vector contains the lag orders at which the criterion attains it local minima? When the calculation is over, the ADF.test function gives info about "Lag orders". What are these lag orders? Are they the local minima of the criterion?
I will be very thankful if you clarify this to me. I browsed a lot, but I could not find a clear answer.
Than...