02-19-2007
gtp' server
I have one. See
http://ipantenna.com
I use cisco csg as client.
I can send to you sources if you will share your CDR generator code with me.
(I am now developing commercial gtp' server and i will use your system for testing).
_
Roman
9 More Discussions You Might Find Interesting
1. IP Networking
Can anyone tell me how I can find out if a server has a SNA connection to a mainframe ?
I need to find out at my work which servers use SNA by telnetting to that server and search for it, I just don't know what and where to look for...
Any help appreciated !
Ron (2 Replies)
Discussion started by: ronw
2 Replies
2. UNIX for Dummies Questions & Answers
I need to accomodate terminals running off an NCR UNIX SCO server. I need the protocol so I can get the correct S/W image for the router. (3 Replies)
Discussion started by: de2934
3 Replies
3. UNIX for Advanced & Expert Users
Is there any way to access http page from UNIX command line....
eg: http://www.abc.xyz (5 Replies)
Discussion started by: bishweshwar
5 Replies
4. UNIX for Advanced & Expert Users
hello
is there any implementation of msopf and pim protocoles in unix?
:confused: (1 Reply)
Discussion started by: jalil smail
1 Replies
5. SCO
Dear All,
Kindly guide how to stop UDP protocol on Sco Unix release 5.0
Regards (2 Replies)
Discussion started by: sak900354
2 Replies
6. UNIX for Dummies Questions & Answers
Hi all,
I just downloaded this example from the net. I was looking around for a hash table like implementation in unix when I came across this.
ARRAY=( "cow:moo"
"dinosaur:roar"
"bird:chirp"
"bash:rock" )
for animal in ${ARRAY} ; do
KEY=${animal%%:*}
... (8 Replies)
Discussion started by: anindyabecs
8 Replies
7. UNIX for Dummies Questions & Answers
So we know that Unix is free source software. And we know that Unix have support for FAT 16 and FAT 32. Does anyone know where can I found that implementation in code ?
Thank you. (2 Replies)
Discussion started by: medolina
2 Replies
8. Shell Programming and Scripting
I want to know about the time command flow of execution.
I have a doubt in the time calculation for the command execution.
Whether the real time is sum of (time taken to open the unix window + execute the command given infront of the "time" command + close the unix window)
or Just the time... (1 Reply)
Discussion started by: sateesh Solapur
1 Replies
9. Shell Programming and Scripting
I was asked this question on the interview. I know ftp, sftp, scp, rcp. They said one more indi or indy
Could you please let me know it?
Thanks,
Oleg (2 Replies)
Discussion started by: digioleg54
2 Replies
LEARN ABOUT DEBIAN
math::vector::real::kdtree
Math::Vector::Real::kdTree(3pm) User Contributed Perl Documentation Math::Vector::Real::kdTree(3pm)
NAME
Math::Vector::Real::kdTree - kd-Tree implementation on top of Math::Vector::Real
SYNOPSIS
use Math::Vector::Real::kdTree;
use Math::Vector::Real;
use Math::Vector::Real::Random;
my @v = map Math::Vector::Real->random_normal(4), 1..1000;
my $tree = Math::Vector::Real::kdTree->new(@v);
my $ix = $tree->find_nearest_neighbor(V(0, 0, 0, 0));
say "nearest neighbor is $ix, $v[$ix]";
DESCRIPTION
This module implements a kd-Tree data structure in Perl and some related algorithms.
The following methods are provided:
$t = Math::Vector::Real::kdTree->new(@points)
Creates a new kdTree containing the gived points.
$t->insert($p)
Inserts the given point into the kdTree.
$s = $t->size
Returns the number of points inside the tree.
$p = $t->at($ix)
Returns the point at the given index inside the tree.
$t->move($ix, $p)
Moves the point at index $ix to the new given position readjusting the tree structure accordingly.
($ix, $d) = $t->find_nearest_neighbor($p, $max_d, $but_ix)
Find the nearest neighbor for the given point $p and returns its index and the distance between the two points (in scalar context the
index is returned).
If $max_d is defined, the search is limited to the points within that distance
If $but_ix is defined, the point with the given index is not considered.
@ix = $t->find_nearest_neighbor_all_internal
Returns the index of the nearest neighbor for every point inside the tree.
It is equivalent to (though, internally, it uses a better algorithm):
@ix = map {
scalar $t->nearest_neighbor($t->at($_), undef, $_)
} 0..($t->size - 1);
@ix = $t->find_in_ball($z, $d, $but)
$n = $t->find_in_ball($z, $d, $but)
Finds the points inside the tree contained in the hypersphere with center $z and radius $d.
In scalar context returns the number of points found. In list context returns the indexes of the points.
If the extra argument $but is provided. The point with that index is ignored.
@ix = $t->ordered_by_proximity
Returns the indexes of the points in an ordered where is likely that the indexes of near vectors are also in near positions in the
list.
SEE ALSO
http://en.wikipedia.org/wiki/K-d_tree <http://en.wikipedia.org/wiki/K-d_tree>
Math::Vector::Real
COPYRIGHT AND LICENSE
Copyright (C) 2011, 2012 by Salvador FandiA~Xo <sfandino@yahoo.com>
This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself, either Perl version 5.12.3 or,
at your option, any later version of Perl 5 you may have available.
perl v5.14.2 2012-06-18 Math::Vector::Real::kdTree(3pm)