similar to: h extension and channel variables

Displaying 20 results from an estimated 30000 matches similar to: "h extension and channel variables"

2006 Jun 11
2
OLD PA system.
I need to be able to connect an old PA system to an asterisk box, which basically works as a couple of amplifiers taking an analogue phone signal and playing whatever it produces out of some speakers. There is no on-hook state in the whole setup. Obviously If I just connect the input to a port on an ATA, I'll just get a dialtone played through the speakers. Can anyone think of a way I can
2006 Jun 09
1
hangup extension
I've been testing the debug version of AstTAPI, which worked for a few calls, then a bit later in the day (and ever since), when the call is hung up, the TAPI client doesn't get notified. Looking at the server logs, The TAPI message that is sent upon hangup, isn't being sent. exten => h,1,UserEvent(TAPI|TAPIEVENT: LINE_CALLSTATE LINECALLSTATE_IDLE) This is in the same context as
2007 Oct 02
4
Queue members, URI.
Is there an advantage to having a Queue members URI in the form: SIP/User (or indeed IAX2/User) Over Local/<number>@context ? I know that the latter will allow you to do things like set counting logic etc. through dialplan operations, but the former appears to be a more direct route to calling the party. (and if need be, there is the ability in queues to run a script on connection iirc).
2005 Nov 03
1
Help in expand.grid() (Restricted combination)
Dear Rs: BY having the following code: candidates<-expand.grid(e=c("nearest-neighbor","exaustive"), d=c(70,75,80,85,90,92,94,96,98,99), n=c(20,25,30,35,40)) results in : e d n 1 nearest-neighbor 70 20 2 exaustive 70 20 3 nearest-neighbor 75 20 4 exaustive 75 20 ................ 90 exaustive 90 40 91 nearest-neighbor 92 40 92 exaustive 92 40 93 nearest-neighbor 94 40 94
2006 May 16
3
Having a Blonde moment.
I know I must be being daft, but is there a way to set which context the queuing system uses when it dials the operators/agents? By default it appears to use the default context. I've looked through voip-info.org and can't find anything, someone please put me out of my misery.
2008 Oct 09
2
Asterisk 1.6.0 CDR billsec and duration not working from h extension
Can someone tell me what I am doing wrong? Why doesn't CDR(duration) or CDR(billsec) return the correct values? cdr.conf endbeforehexten=yes extensions.conf [macro-Dial] ; ${ARG1} - Dial String exten => s,1,Dial(${ARG1},,M(post-dial)) exten => h,1,NoOp(Call was hung up - ${CDR(duration)} seconds long, billed for ${CDR(billsec)} seconds) The log shows: -- Executing [h
2004 Feb 02
2
Nearest Neighbor Algorithm in R -- again.
Several of the methods I use for analyzing large data sets, such as WinGamma: determining the level of noise in data Relief-F: estimating the influence of variables depend on finding the k nearest neighbors of a point in a data frame or matrix efficiently. (For large data sets it is not feasible to compute the 'dist' matrix anyway.) Seeing the proposed solution to "[R] distance
2006 Sep 28
2
Re-doing the MBR
I tried to install CentOS 4.4. This was on a machine where I've got Windows XP on the first partition (hda1). CentOS, like most of the distros will automatically install Grub in the MBR unless you tell it not to. In fact it will wipe the MBR first pretty early in the install. Here was my problem. During the install, the second CD had some sort of read issue. So I had to abort the install
2011 Apr 15
1
Idetntifying nearest topographic contours to data points
Hi there, I have two data sets, one of locations at different elevations (x,y,z) and the other of points that make up topographic contours (also x,y,z). I have used: result<-apply(distppll(data2,cbind(topocon[-nrow(topocon),],topocon[-1,])),1,min) where 'data2' are my measurement coordinates (x, y) and 'topocon' are my topographic contours (x,y). While this gives me an output
2012 Jul 24
3
Nearest Neighbors
I was wondering if there is a way in R to find k nearest neighbors of various orders, say order 2, 3, or 4. In otherwords neighbors of neighbors of neighbors. You get the idea. I know that I can use knearneigh(matrix.data, k) but this only gives me the k nearest neighbors and not of a particular order. Thanks in advance. -- View this message in context:
2020 Sep 04
2
Misleading documentation on FP to integer conversion instructions?
The LLVM IR reference manual states, for fptosi: "The ‘fptosi’ instruction converts its floating-point <http://llvm.org/docs/LangRef.html#t-floating> operand into the nearest (rounding towards zero) signed integer value." I interpreted this to mean that it rounds: The nearest integer to 0.3 is 0. The nearest integer to 0.9 is 1. The nearest integer to 0.5 is either 0 or 1. And
2007 Feb 22
2
AG-188
Does anyone know why when calling out with an ATCOM AG-188 registered with IAX (haven't tried SIP), there is no ring. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.digium.com/pipermail/asterisk-users/attachments/20070222/a4f29a97/attachment.htm
2007 Feb 23
1
H extension don't work with parked calls
Hi all, I'm having a problem, with the h extension. I have an application, when I call it check for the line requested and then direct the call to a predefined context. In this context I play a message (the message according to the line called) and then park the call. The dialplan does some other things, but my problem is that if I hung the phone the h extension don't run, this is my dial
2008 Jan 14
6
Ceiling to the nearest ten?
R-users, Is there a function for ceiling to the nearest ten? a <- 1:10*4 a [1] 4 8 12 16 20 24 28 32 36 40 The resulting vector should look like this ("ceiling to the nearest ten") [1] 10 10 20 20 20 30 30 40 40 40 Thanks in advance Lauri
2020 Sep 04
4
Misleading documentation on FP to integer conversion instructions?
If fptosi takes 0.9 -> 0, then that is not 'rounding' in any sense I'm aware of (IEEE754 or otherwise). Rounding (in the IEE754 sense) determines how a number is converted when it is halfway between two candidate results. (see round(), ceil(), floor()). fptosi seems to model the behavior of a C cast from float to int, which truncates the fractional bits (as in trunc()). Steve
2012 Jun 20
1
nearest neighbours and their ID
Dear R users, I used nndist() to gain the distance of 2 nearest neighbours of the points in my dataset. Is there a way of getting the ID numbers of these nearest neighbours (along with their distances). The command I used: nn2 <- nndist(X2, k=1:2). This is the output of the nearest neighbour distances I got (the IDs of the given points are there but their IDs aren't). Any help or
2012 Jul 19
1
Truncating (rounding down) to nearest half hour.
I couldn't find anything in the chron or timeDate packages, and a good search yielded rounding to the nearest half hour, which I don't want. The data: structure(list(Date = structure(c(1209625080, 1209641460, 1209652500, 1209676800, 1209682860, 1209692100, 1209706980, 1209722580, 1209726300, 1209739620, 1209762780, 1209765720, 1209770520, 1209791040, 1209812580, 1209829920,
2020 Sep 04
3
Misleading documentation on FP to integer conversion instructions?
> On Sep 4, 2020, at 2:40 PM, Neil Nelson via llvm-dev <llvm-dev at lists.llvm.org> wrote: > >> If fptosi takes 0.9 -> 0, then that is not 'rounding' in any sense I'm aware of (IEEE754 or otherwise). >> Rounding (in the IEE754 sense) determines how a number is converted when it is halfway between two >> candidate results. (see round(), ceil(),
2004 Apr 06
1
k nearest neighbours
I want to 1) Select for each of the n points in a matrix A, those of the m points in B that lay within a given radius. 2) Of those points within the radius, select the k nearest ones. What I now do is 1) Create an n*m matrix C were I put the distances from all the points in B to the points in A and make NA those cells were the distance is larger than the radius. (The points are geographical
2011 Jun 09
1
k-nn hierarchical clustering
Hi there, is there any R-function for k-nearest neighbour agglomerative hierarchical clustering? By this I mean standard agglomerative hierarchical clustering as in hclust or agnes, but with the k-nearest neighbour distance between clusters used on the higher levels where there are at least k>1 distances between two clusters (single linkage is 1-nearest neighbour clustering)? Best regards,