similar to: Error: Invalid SIP message - rejected , no call id

Hi All, I'm stumped on a weird problem. I have an * server working fine for local SIP phones and IAX2 connections. We just provisioned a second Ethernet port to attach to a local SIP provider. PSTN calls incoming work fine: PSTN -> SIP Provider -> SIP -> * but outgoing calls are not. Call setup takes place and the caller can hear about 1-2 seconds of audio before the SIP provider

I have verified that in the folder: */var/log/samba* in my workstations there are many logs archives of all the domain computers. Not is in server, but in *workstation*. A example: root at ubuntu33:/# ls -lh /var/log/samba/ ... -rw-r--r-- 1 root root 0 Jul 15 11:29 log.192.168.7.106 -rw-r--r-- 1 root root 0 Ago 5 08:26 log.192.168.7.12 -rw-r--r-- 1 root root 0 Ago 10 09:56 log.192.168.7.135

https://bugzilla.mindrot.org/show_bug.cgi?id=3214 Bug ID: 3214 Summary: Man page should specify which switches are incompatible with a 'command' Product: Portable OpenSSH Version: 8.3p1 Hardware: Other OS: Linux Status: NEW Severity: enhancement Priority: P5

Hi, I got this message on my Asterisk messages file and after it Asterisk went down... 2006-02-18 08:13:55 WARNING[3214] ast_expr2.fl: ast_yyerror(): syntax error: syntax error, unexpected TOK_PLUS, expecting TOK_MINUS or TOK_COMPL or TOK_LP or TOKEN; Input: + 1 ^ 2006-02-18 08:13:55 WARNING[3214] ast_expr2.fl: If you have questions, please refer to doc/README.variables in the asterisk source.

Hello, I have an Asterisk 13.6.0 PBX using PJSIP connected to the Twilio gateway. I am able to make calls outbound through the gateway, but I am not able to make calls into the PBX from external PSTN. Specifically, an incoming call is _received_ by Asterisk, but it is not able to route the call internally owing to the following error: [Feb 18 21:08:47] NOTICE[4606]:

On Sep 12, 2011, at 3:13 PM, Arnaud Quette wrote: > (forwarding because of message body too big) > > Author: fbohe-guest > Date: Mon Sep 12 14:50:47 2011 > New Revision: 3214 > URL: http://trac.networkupstools.org/projects/nut/changeset/3214 > > Log: > Add nut-scanner tool Due to the build failures, I recommend we revert this merge commit for 2.6.2, or simply make

Are there any particular licences under which R packages must be released or is it the discretion of the author? The same question if the package is to be destined for CRAN? Kind regards, Nathan -- -------------------------------------------------------- Dr. Nathan S. Watson-Haigh OCE Post Doctoral Fellow CSIRO Livestock Industries Queensland Bioscience Precinct St Lucia, QLD 4067 Australia

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I have a rectangular matrix of size 920 by 85. I'd like to coerce it into a square matrix such that all row/col names are present in the new matrix and the additional values are zero. As an example: A B C D A 1 2 3 4 E 5 6 7 8 F 9 10 11 12 Would be coerced to: A B C D E F A 1 2 3 4 5 9 B 2 0 0 0 6 10 C 3 0 0

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I'm generating a symmetric correlation matrix using a data matrix as input: mat <- cor(data.mat) My question is: Is there a more memory efficient way to store this data? For instance, since: all(mat == t(mat)) every value is duplicated, and I should be able to almost half the memory usage for large matrices. Any thoughts/comments? Cheers,

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I'm trying to add some Fortran 90 code to an existing package. When I compile and load the file manually like: SHELL> R CMD SHLIB file.f90 R> dyn.load("file.so") I can use the .Fortran() fine. However, when I try to build, install and load the library I seem to be missing something. I do a: SHELL> R CMD build dir SHELL> R

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I've written a function in R which takes a symmetrical matrix as input and processes all triplicate combinations of values from the matrix. The function looks something like: my_fun <- function(m) { if( nrow(mat) != ncol(mat) ) { stop("'m' must be a square matrix") } size <- nrow(m) for(x in 1:(size -2)) {

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I'd like to be able to colour histograms along the diagonal using the colours stored in colnames(d): > d black blue brown cyan 1 0.96405751 -0.02964390 -0.060147424 -0.06460070 2 -0.03614607 0.95475444 -0.152382053 -0.07767974 3 -0.07095613 -0.05884884 -0.061289399 -0.06445973 4 -0.03708223 -0.05997624

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I have the following data: > y [1] 0.000 0.004 0.008 0.016 0.024 0.032 0.044 0.064 0.072 0.088 0.108 0.140 [13] 0.156 0.180 0.208 0.236 0.264 0.296 0.320 0.360 0.408 0.444 0.472 0.524 [25] 0.576 > x [1] 100 200 300 400 500 600 700 800 900 1000 1100 1200 1300 1400 1500 [16] 1600 1700 1800 1900 2000 2100 2200 2300 2400 2500 I'd

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I was wondering if anyone could point me in the right direction for reading up on writing tests in R. I'm writing some functions for inclusion into a package and would like to test them to ensure they're doing what I expect them to do. Are these approaches used for testing packages in CRAN? Cheers, Nathan - -- -

https://bugzilla.samba.org/show_bug.cgi?id=3214 ------- Additional Comments From wayned@samba.org 2005-10-26 09:24 ------- *** Bug 3215 has been marked as a duplicate of this bug. *** -- Configure bugmail: https://bugzilla.samba.org/userprefs.cgi?tab=email ------- You are receiving this mail because: ------- You are the QA contact for the bug, or are watching the QA contact.

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I'm trying to calculate Pearson correlation coefficients for a large matrix of size 18563 x 18563. The following function takes about XX minutes to complete, and I'd like to do this calculation about 15 times and so speed is some what of an issue. Does anyone have any suggestions on ways to speed this up? I'd wondered if using C++ code to

On 29/08/2019 11:17, Benedikt Kale? via samba wrote: > Hi, > > I don't have the user root. > > No changes :( Sometimes a user gets permissions, sometimes not. > > This net conf is now running: > > [global] > ??? winbind refresh tickets = Yes > ??? winbind use default domain = yes > ??? template shell = /bin/bash > ??? idmap config * : range = 1000000

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Is there a library which is capable of identifying distinct clusters of size n from a series of XY coordinates? Failing this, I'd like to be able to to something like: Using a sliding window of size n along the x-axis I'd like to determine the distance between the center of the points in the window and the closest point outside the window. I

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I have some data generated as follows: <code> n <- 2000 work <- vector() for(x in 1:n) { work[x] <- sum(1:(n-x+1)) } plot(work) </code> What I want to do - ----------------- I want to split work into a number of unequal chunks such that the sum of the values in each chunk is approximately equal. The numbers in

I have a system setup with two T1 circuits, the customer complains of call quality issues. I've checked logs and don't see anything too strange, but when I run "dahdi show status" I see: Description Alarms IRQ bpviol CRC4 Fra Codi Options LBO T2XXP (PCI) Card 0 Span 1 OK 0 0 19 ESF B8ZS YEL 0 db