similar to: making IMAP quicker on LAN

On Thu, Apr 6, 2017 at 9:22 PM, Christian Balzer <chibi at gol.com> wrote: > > Hello, > > On Thu, 6 Apr 2017 22:13:07 +0300 Timo Sirainen wrote: > > > On 6 Apr 2017, at 21.14, Mark Moseley <moseleymark at gmail.com> wrote: > > > > > >> > > >> imap-hibernate processes are similar to imap-login processes in that > they > >

I've gotten this Polycom 501 pretty much licked, but I need to know if there's a way in a dialplan to say if someone dials their own extension it goes straight to voicemail and asks them for their password. I thought I saw an example of this on the web but I can't seem to find it. Any advice appreciated! Phil -------------- next part -------------- An HTML attachment was

If I want to drop columns x, y, z from dataframe df, is there a better alternative to df$x = NULL df$y = NULL df$z = NULL There are sufficiently many columns remaining to make df = subset(df, select = c(a,b,c,d[etc])) cumbersome. Thank you. -- View this message in context: http://n4.nabble.com/Is-there-a-quicker-way-to-drop-a-data-frame-column-than-setting-it-to-NULL-tp1288617p1288617.html

Hi, I don't know if this is possible - but can I set up asterisk to answer the FSO line after one or two rings rather than four? I haven't (yet) found a configuration variable to let me do this... Thanks in advance, Andrew _________________________ Andrew Yager Real World Technology Solutions Real People, Real SolUtions (tm) ph: (02) 9945 2567 fax: (02) 9945 2566 mob: 0405 15 2568

On 7/4/19 8:43 AM, Jobst Schmalenbach wrote: > Clearly the development server is hardware wise way below the specs of the Dell but > software wise they are identical (they get upgraded at the same time). As a first step, you have to test subsystems one by one. Try this to see how fast the CPU and kernel are (including meltdown/spectre slowdowns): time dd 2>/dev/null if=/dev/zero

On 7/3/19 11:43 PM, Jobst Schmalenbach wrote: > - How can it be that the DELL takes so much longer alltough on the far better hardware? It looks like the DIY system has a CPU that's nearly twice as fast as the Dell's.? The additional CPU in the Dell will run more tasks concurrently, but it won't make a single process faster. You might also think that the SSD RAID would make

On Thu, Jul 04, 2019 at 10:46:19AM -0700, Gordon Messmer (gordon.messmer at gmail.com) wrote: > On 7/3/19 11:43 PM, Jobst Schmalenbach wrote: > > - How can it be that the DELL takes so much longer alltough on the far better hardware? > It looks like the DIY system has a CPU that's nearly twice as fast > as the Dell's.? The additional CPU in the Dell will run more tasks >

Hi all, myint=function(mu,sigma){ integrate(function(x) dnorm(x,mu,sigma)/(1+exp(-x)),-Inf,Inf)$value } mymu=seq(-3,3,length(1000)) mysigma=seq(0,1,length(500))[-1] k=1 v=c() for (j in 1:length(mymu)) { for (i in 1:length(mysigma)) { v[k]=myint(mymu[j],mysigma[i]) k=k+1 } } Basically, I want to investigate for what values of mu and sigma, the integral is divergent. Is there another way

dear all, i have a quite simple question, i want to fill up a Matrix like done in the following function, but the performance is very bad for large dimensions is there a way to do this like with apply or something similar? makeMatrix <- function(a, b,dim) { X=matrix(0,ncol=dim,nrow=dim) for (i in c(1:dim)){ for (j in c(1:dim)) { if (i==j) {X[i,j]<-a} else { X[i,j]<- exp((

On Thu, Jul 4, 2019 at 2:43 AM Jobst Schmalenbach <jobst at barrett.com.au> wrote: > the development and life server in question run the same software setup: > - CentOS Linux release 7.6.1810 > - bind 32:9.9.4-74.el7_6.1 > - Apache/2.4.6 (CentOS) > - PHP 7.1.29 > - mysqld Ver 5.7.26 > - wordpress, woocommerce, wishlistmember, Sensei etc > - software

Hi Oddsock, Like Clement, I am sure Nullsoft is still "offering" AOL's bandwidth since I think Nullsoft is not part of AOL anymore. About the new broadcasting methods, is the multicast technology already available? I have heard only few providers are equipped with multicast enabled routers. What about p2p streaming, is it really reliable? When I see Peercast's statistics, only

> Hi > > I need some advice what to do next, even if someone tells me to > check out (an)other mailing list(s), tuning site or point me in a better > direction how to solve my annoying problem: one server is much faster > for certain tasks although on "shitty" hardware. > > I have tried many things to solve my issue > - changed buffer/pool/cache/etc mysqld

Motivated by Deepayan's recent inquiries about the efficiency of the R 'quantile' function: http://tolstoy.newcastle.edu.au/R/devel/05/11/3305.html http://tolstoy.newcastle.edu.au/R/devel/06/03/4358.html I decided to try to revive an old project to implement a version of the Floyd and Rivest (1975) algorithm for finding quantiles with O(n) comparisons. I used

Hello, I have thousands of this messages on my servers ?? Is this a Problem on my site or is the infrastructure broken?? /etc/cron.hourly/0yum-hourly.cron: Could not get metalink https://mirrors.fedoraproject.org/metalink? repo=epel-7&arch=x86_64 error was 14: HTTPS Error 503 - Service Unavailable Thanks for a answer, -- mit freundlichen Gr?ssen / best regards, G?nther J. Niederwimmer

Dear R-help, I have a loop, which is set to take about 26 hours to run at the rate it's going - this is ridiculous and I really need your help to find a more efficient way of loading up my array gpcc.array: #My data is stored in a table format with all the data in one long column #running though every longitute, for every latitude, for every year. The #original data is sotred as

Hi, In a function, I compute 10 (un-named) vectors of reasonable length (4471 in the particular example I have to hand) that I want to combine into a data frame object, that the function will return. This is very slow, so *I'm* doing something wrong if I want it to be quick and efficient, though I'm not sure what the best way to do this would be. I know it is the combining into data

On 6 Apr 2017, at 21.14, Mark Moseley <moseleymark at gmail.com> wrote: > >> >> imap-hibernate processes are similar to imap-login processes in that they >> should be able to handle thousands or even tens of thousands of connections >> per process. >> > > TL;DR: In a director/proxy setup, what's a good client_limit for >

On Mon, Mar 01, 2004 at 01:25:00PM -0600, oddsock wrote: > the "listener-bandwidth-sharing" aspects of p2p broadcasting has had about > 2 years now to mature. I've talked with people at Abacast, peercast, etc > and they've all said the same thing... "We've got it licked, we have a > viable solution"...however, it's been 2 years now since it all

This is a school project, but you might find it interresting anyways ;-) We have one server running Debian and a client also running Debian. On top of this we have ~5 mixed clients (windows and linux). This LAN will be merged with other LAN's later on (all of them running Windows 2000 Active Directory) The original plan was to use kerberos for one-login auth, OpenLDAP as directory

Hi I need some advice what to do next, even if someone tells me to check out (an)other mailing list(s), tuning site or point me in a better direction how to solve my annoying problem: one server is much faster for certain tasks although on "shitty" hardware. I have tried many things to solve my issue - changed buffer/pool/cache/etc mysqld - changed server settings apache/php -