search for: algorithms

Hi, We have seen a huge performance drop in 1.6.3, due to the checksum being enabled by default. I looked at the algorithm being used, and it is actually a CRC32, which is a very strong algorithm for detecting all sorts of problems, such as single bit errors, swapped bytes, and missing bytes. I''ve been experimenting with using a simple XOR algorithm. I''ve been able to recover

...t resides in function do_sample in https://svn.r-project.org/R/trunk/src/main/random.c Its complexity is obviously O(n), where the sample is selected from 1...n, since the algorithm has to create a vector of length n. So when the sample size is much lesser than n, the algorithm is not effective. Algorithms with average complexity O(s log s), were s is the sample size, were described long ago. E.g. see https://www.degruyter.com/view/j/mcma.1999.5.issue-1/mcma.1999.5.1.39/mcma.1999.5.1.39.xml Here the Tree algorithm has complexity O(s log s). I suppose that there may be algorithms with complexity clo...

On Fri, Jan 26, 2024 at 7:24?PM Jochen Bern <Jochen.Bern at binect.de> wrote: > On 25.01.24 14:09, Kaushal Shriyan wrote: > > I am running the below servers on Red Hat Enterprise Linux release 8.7 > > How do I enable strong KexAlgorithms, Ciphers and MACs > > On RHEL 8, you need to be aware that there are "crypto policies" > modifying sshd's behaviour, and it would likely be the *preferred* > method to inject your intended config changes *there* (unless they > happen to already be part of an existing po...

On 25.01.24 14:09, Kaushal Shriyan wrote: > I am running the below servers on Red Hat Enterprise Linux release 8.7 > How do I enable strong KexAlgorithms, Ciphers and MACs On RHEL 8, you need to be aware that there are "crypto policies" modifying sshd's behaviour, and it would likely be the *preferred* method to inject your intended config changes *there* (unless they happen to already be part of an existing policy, like FUTURE)....

Hi When I type: > ?nls I come across this section: algorithm: character string specifying the algorithm to use. The default algorithm is a Gauss-Newton algorithm. Other possible values are '"plinear"' for the Golub-Pereyra algorithm for partially linear least-squares models and '"port"' for the 'nl2sol'

Hi, Is in R any "fast" algorithm for correlation? What I mean is: I have very large dataset (microarray) with 55000 rows and 100 columns. I want to count correlation (p-value and cor.coef) between each row of dataset and some vector (of course length of this vector is equal to number of columns of dataset). In short words: For t-test we have: "normal" algorithm - t.test

...th <dexonsmith at apple.com> wrote: > There’s a decent selection of range adaptors in Boost.Range [1]. I’m not sure the license [2] allows copying the source (IANAL), but any reason not use the same names? I don’t see any reason to reinvent the wheel here. > > Because I think that algorithms (and functions more generally) should be verbs. The names will be very similar all the same. I agree. Algorithms should be verbs. However, I disagree that range adaptors are algorithms. “reverse” sounds like an algorithm. Consider, from the STL: template <class Iterator> void revers...

...ormation is near the top, but it''s all quite good... :-) -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- There is no intrinsic difference between algorithm and data, the same information can be viewed as data in one context and as algorithm in another. Why then do so many people claim that encryption algorithms should be made public and only the key should be kept secret? (This is the famous and derisive mantra about "security through obscurity".) There are several answers: a) Some people, with little understanding about computer technology, try to keep secret what their programs do, even thoug...

I am looking for packages that can run a branch-and-bound algorithm to maximize a distance measure (such as Bhattacharyya or Mahalanobis) on a set of features. I would like this to be learning algorithm independent, so that the method just looks at the features, and selects the subset of a user-defined size that maximizes a distance criteria such as those stated above. Can anyone give some

...gister allocation algorithm in LLVM!!! Could you elaborate a bit on the following topics: 1) Do you have any plans to publish something more formal and detailed about this algorithm, e.g. a paper or something similar?  It would be nice to better understand how this algorithm relates to well-known algorithms described in the literature, e.g. linear scan, graph coloring, iterated register coalescing by Chaitin-Briggs, register allocation by priority-based coloring by Chow and Hennesey and if it represents an extension of one of those algorithms or if it is a totally new algorithm. And of course it would...

There is no hash algorithm associated with SSH keys. The key format for RSA keys is always ?ssh-rsa?, and it is capable of being used with any of the available signature algorithms (ssh-rsa for SHA-1 and rsa-sha2-256 or rsa-sha2-512 for SHA-2). See section 3 in https://www.rfc-editor.org/rfc/rfc8332: rsa-sha2-256 RECOMMENDED sign Raw RSA key rsa-sha2-512 OPTIONAL sign Raw RSA key These algorithms are suitable for use both in the SS...

A few questions regarding the OpenSSH support for the Diffie Hellman key exchange algorithms: (1) Are the diffie-hellman-group-exchange-sha256", "diffie-hellman-group-exchange-sha1" , "diffie-hellman-group14-sha1" "diffie-hellman-group1-sha1" (as defined in RFCs 4253 and RFC 4419) the complete list of key exchange algorithms supported by OpenSSH? (2) Is...

Hello, I have a question about multichannel and the load-balancing algorithm. What kind of algorithm is it? (Roud-robin, dynamic round-robin, ...) What are the arguments the algorithm compute to load-balance the network traffic on the interfaces? I already know that if a 10Gb/s interface and a 1Gb/s interfaces are in the multichannel connection the 1Gb/s one will be ignored until the 10Gb/s goes

...generic optimisation > algorithm; so perhaps start at the task view: > https://cran.r-project.org/web/views/Optimization.html > > What you describe is a combinatorial problem: select k > from N features, with k (much) smaller than N. So I'd > suggest to also look at heuristic algorithms that can > deal with such problems (e.g. genetic algorithms). > > > -- > Enrico Schumann > Lucerne, Switzerland > http://enricoschumann.net > [[alternative HTML version deleted]]

...exactly the reason chris specifies. In fact, until we started local SSA updating (which is now many years ago, but ...), dominance frontier calculation for ssa updating was in the top 10 profile functions for GCC compiles of large source files. I had tried a number of the linear time phi placement algorithms instead, but sadly, none were fast enough in practice (I believe someone later published a paper comparing them all and finding the same thing). As a completely random aside, the algorithm given in the original paper you cited is actually not quite the best way in practice. It performs more compa...

Dear all, I would like to use the Levenberg-Marquardt algorithm for non-linear least-squares regression using function nls.lm. Can anybody help me to find a a way to compute confidence intervals on the fitted parameters as it is possible for nls (using confint.nls, which does not work for nls.lm)? Thank you for your help Michael

...t seems you are looking for a generic optimisation algorithm; so perhaps start at the task view: https://cran.r-project.org/web/views/Optimization.html What you describe is a combinatorial problem: select k from N features, with k (much) smaller than N. So I'd suggest to also look at heuristic algorithms that can deal with such problems (e.g. genetic algorithms). -- Enrico Schumann Lucerne, Switzerland http://enricoschumann.net

I just uploaded a blog post outlining the new register allocation algorithm in LLVM 3.0. http://blog.llvm.org/2011/09/greedy-register-allocation-in-llvm-30.html Please direct comments here. /jakob

Hi, I am just starting up on SPEEX AEC algorithm and have couple of questions around echo cancelation algorithm used in SPEEX. 1) Usually Echo Cancelation Algorithm has support for number of components ? - Non-Linear Processor (NLP) - Automatic Microphone Gain Control (AGC) - Transducer Equalization (EQ) - Dynamic Range Compression (DRC) - Ambient

Dear R-Users, I have a model with a latent variable for a spatio-temporal process. I would like to use EM algorithm to estimate the parameters. Does anybody know how to implement the algorithm in R? Thank you very much in advance, Michela