search for: implemeting

> -----Original Message----- > From: asterisk-users-bounces@lists.digium.com [mailto:asterisk-users- > bounces@lists.digium.com] On Behalf Of Troy Settle > Sent: Wednesday, September 14, 2005 7:03 AM > To: Asterisk Users Mailing List - Non-Commercial Discussion > Subject: Re: [Asterisk-Users] MAX PRI for single server (was:Not > enoughlinesavailable for Asterisk implemetation)

https://bugzilla.mindrot.org/show_bug.cgi?id=2101 Bug ID: 2101 Summary: Unaligned memory access on sparc in UMAC implemetation Classification: Unclassified Product: Portable OpenSSH Version: 6.0p1 Hardware: Sparc OS: Solaris Status: NEW Severity: normal Priority: P5 Component: ssh

Hi all. I found some issue in implementation of finalizeObject function in MCJIT.cpp. If you look at the source code of the function, you can notice that machine code for second "owned" module will never be generated if it doesn't depend on the first one. More over it will cause a crash if entry point isn't in first module. Implementation of finalizeObject using for loop will

Hi all I am looking at implementing asterisk at a company with two ISDN bricks (60 lines). I know that the VoIP will absorb at least on brick worth of lines but that still leaves me with a need for 30 ISDN lines. As far as I can tell most of the Digicom cards have 4 FXS ports and I've read on this list that at most two could coincide in a box simultaneously without causing an interupt

If you are looking for real high density VOIP termination I would look at > something like a Lucent APX 8000, configure correctly it can pass 2500+ > g.729 calls to the PSTN course we paid lots of $ for ours. > > Chris > Chris, My experience has been that the APX and TNT products require a single SIP proxy, how are you load balancing 2500 calls? If all of the traffic is

Hi Radek, Sorry for the delayed response. I haven't had time to check your analysis yet, but you're probably right: MCJIT's support for multiple modules in a single instance is patchy at best. Do you have a test case (e.g. an lli invocation) that triggers this bug, or is this something you discovered just by reading the code? Cheers, Lang. On Thu, Nov 13, 2014 at 8:46 AM, David

On 06/12/2015 12:58 PM, Gordon Messmer wrote: > On 06/13/2015 09:55 AM, jd1008 wrote: >> The most offensive problems of using browsers is that >> they do not tell you nor ask your permission when javascripts >> spy on your entire storage contents. > > Neither javascript nor Java applets can access the local filesystem. > Applets launched by JNLP can do so, but that

regarding -------- Fixed address allocations weren't going to be part of that, but I see that it makes sense for a variety of use cases. One question I have here is how this is intended to work where the RM needs to make some of these allocations itself (for graphics context mapping, etc), how should potential conflicts with user mappings be handled? -------- As an initial implemetation you

On Wed, Jul 8, 2015 at 6:58 AM, Ben Skeggs <skeggsb at gmail.com> wrote: > On 8 July 2015 at 09:53, C Bergström <cbergstrom at pathscale.com> wrote: >> regarding >> -------- >> Fixed address allocations weren't going to be part of that, but I see >> that it makes sense for a variety of use cases. One question I have >> here is how this is intended

On Wed, Jul 8, 2015 at 7:08 AM, Ilia Mirkin <imirkin at alum.mit.edu> wrote: > On Tue, Jul 7, 2015 at 8:07 PM, C Bergström <cbergstrom at pathscale.com> wrote: >> On Wed, Jul 8, 2015 at 6:58 AM, Ben Skeggs <skeggsb at gmail.com> wrote: >>> On 8 July 2015 at 09:53, C Bergström <cbergstrom at pathscale.com> wrote: >>>> regarding >>>>

Adam Rosi-Kessel wrote: > I finally got something like an explanation from the Mediamonkey > developers. Here is their explanation as to why MM corrupted my files: > > > the problem was caused by the fact that Vorbis library uses alloca() > > function on several places, which allocates memory on stack. We > > changed it to alloc() and free() functions pair instead,

Hello to everybody ! I don't have a question directly connected with R, but it takes starting point from the use of the R function Krig for kriging interpolation and from the idea of making a different implemetation of the function for my purposes. Doas anyone know where can I find free C or C++ codes of kriging ? As always, thanks a lot in advance, Paola.

I would like to know if is it possible implemet a partitioning tree using a function like rpart, or mvpart, and with formula a glm-object (as a logistic models) or a robust linear regression (as least sum of absolute errors). In this case, the appropriate "method" to use is "mrt"? Or another one? Thanks, Anna Maria Paganoni

Hello, I'm currently experiencing the issue laid out in this thread from last year: http://marc.theaimsgroup.com/?l=openssh-unix-dev&m=106908815129641&w=2 The discussion that ensued resulted in a number of ideas on how best to 'fix' this issue. The two that seemed most reasonable were: 1. implement a pubkey-only option to PermitRootLogin that would only allow root to login

...authentication. I would like to implement a samba file server that authenticates of our existing ldap server. Would the best solution be to have samba authticate off of ldap through pam. Is this even available. Can anyone point me in the right direction. Everything out there talks about implemeting samba with a NEW openldap server. I would also consider making samba a PDC but thats not my main goal. What is the best way to go with what I want to do and with what I already have? Any good docs that could help me. All the normal docs dont fit to environment. Thanks in advance

Prasanth J wrote: > Hi, > > I can able to compile LLVM using armgcc_4.3.3 (codesourcery2009q1..).. > but when i tried to run it on target it shows GCC 4.3.0 version not > found. So i copied the runtime libraries (libc.so and libgcc_s.so) > from the toolchain to the target and exported its path in > LD_LIBRARY_PATH. But when i tried to run any llvm tools on target its >

I would like to solve the equation is is the sum from k = i to N of choose(N,k) * MR ^ k * (1 - MR) ^ (N - k) - 0.50 = 0 I want to solve for MR. This seems like a non-linear equation to me. But I am having a hard time writing the function that implements the above. I could use 'for(...) as a brute force appoarch but I would like a more "elegant" solution. The variables 'N'

On Tue, Jul 07, 2015 at 08:13:28PM -0400, Ilia Mirkin wrote: > On Tue, Jul 7, 2015 at 8:11 PM, C Bergström <cbergstrom at pathscale.com> wrote: > > On Wed, Jul 8, 2015 at 7:08 AM, Ilia Mirkin <imirkin at alum.mit.edu> wrote: > >> On Tue, Jul 7, 2015 at 8:07 PM, C Bergström <cbergstrom at pathscale.com> wrote: > >>> On Wed, Jul 8, 2015 at 6:58 AM, Ben

On 2014/10/26 19:52, Michael S. Tsirkin wrote: > On Sat, Oct 25, 2014 at 04:24:52PM +0800, john.liuli wrote: >> From: Li Liu <john.liuli at huawei.com> >> >> This set of patches try to implemet irqfd support of vhost-net >> based on virtio-mmio. >> >> I had posted a mail to talking about the status of vhost-net >> on kvm-arm refer to

On 2014/10/26 19:52, Michael S. Tsirkin wrote: > On Sat, Oct 25, 2014 at 04:24:52PM +0800, john.liuli wrote: >> From: Li Liu <john.liuli at huawei.com> >> >> This set of patches try to implemet irqfd support of vhost-net >> based on virtio-mmio. >> >> I had posted a mail to talking about the status of vhost-net >> on kvm-arm refer to