Displaying 7 results from an estimated 7 matches for "musch".
Did you mean:
much
2003 Oct 25
0
memory optimization and use of recursion
...ditions. If I run them in a batch, say 100 initial conditions,
the whole procedure tends to run slower with each new additional condition.
I must tell you that not much of information is stored, just pooled results
over 1000 cycles and final calcualtions for each initial set.
I avoided FOR loops as musch as I could... I have just two: one for the
cycles and one for the initial conditions, everything else is vectorized.
What could I do to improve the procedure?
I am thinking to additionaly vectorize the last for loop (the initial
conditions)... would it make a difference?
(1)
>for (i in 1:100)...
2003 Oct 02
0
group export - print queue
...not
completly satisfied on 2 points.
1. Often, when I creat a windows file and print server; I creat it in
domain controler. Now I havn't find a possibility to export domain group
into local group in each client. Acctualy i must put each domain user into
the apporpriate local group. It make so musch time (principaly for a big
compagny) and it's not very professional ;-))
2. When I configure my server in print server it function nicely. But like
exportation group, I'm not completly satisfied. When a client send a print
it possible to look the print icon in the task bar but when you cli...
2003 Oct 16
2
OGG portable (iRiver iHP-120)
I remember seeing a post about a japanese link to a new portable with OGG support. I stumbled across this today and thought I'd throw it out there incase you guys hadn't seen it.
http://www.iriveramerica.com/products/iHP-120.asp
Looks pretty sweet to me.
--- >8 ----
List archives: http://www.xiph.org/archives/
Ogg project homepage: http://www.xiph.org/ogg/
To unsubscribe from this
2004 Aug 06
3
project 'Sphinx' kicked off
> I had the idea of implementing a lot of the operations in FFTs. ( for
> example, it is possible to do auto-correlation and FIR filtering using
> FFTs.) There are two advantages to this.
> 1. It's almost always faster
> 2. By swapping fft implementations, it could be easy to recompile for
> fixed or floating point versions.
No. FFT's require higher precision than
2013 Jul 16
0
Help with decyphering DND status
....7.4.8
Content-Length: 0
I see neither DND not CONNECTED an any of this. Either these phone
logs are incomplete or what is passed over the wire differs from what
is displayed in the Asterisk trace. I lack the knowledge to determine
which is the case.
In Asterisk -rvvvvvvvvvvv I see this (among musch else):
== Extension Changed 41712[ext-local] new state InUse for Notify
User 41720
-- Executing [*78 at from-internal-original:2]
Wait("SIP/41712-000009e4", "1") in new stack
-- Executing [*78 at from-internal-original:3]
Macro("SIP/41712-000009e4", "us...
2006 Aug 29
4
ftp 8x faster than samba
I've seen this problem mentioned many times in the various FAQs and
How-Tos on the Internet, but none of the solutions presented therein
have worked for me.
[global]
workgroup = UNIX
server string = OPTIMUS
interfaces = eth0
log level = 1
log file = /var/log/samba/%m.log
max log size = 0
# socket options = TCP_NODELAY
2006 Mar 10
27
Clustering
Hello All,
Ive been doing more and more research on trying to setup a cluster/load
balancer for Asterisk. All the Asterisk boxes would be using a config that
is the same between them all (via a DB), but we want one location to point
the phones to, and from there that machine/device will send it to a Asterisk
server so the call can be processed. I know you cant balance the whole call,
ie: once the