Basically, I like to know how "mget" command work in terms of data/control channels and in terms of request-respond dialogue.
Also, when I try the command as an example below, is it true than for each file to be transferred, there is a new connection establish? (ie. transferred one file,... (5 Replies)
hello,
i was interested in knowing if you can mget or mput a sequence of files:
example- say i have a dir with 1000 files with the same extension e.g. *.sgi,
is there a way to mget only the last 200 files?
i would assume that there is a flag i would use, or something like:
mget... (14 Replies)
Hi All,
I am using mget (mget server.*) through ftp... ... i dont want to overwrite the files in my localmachine if it is already exists... is it possible through ftp ?? any other optios also mos t welcome
Thnks in advance (4 Replies)
Hi all,
I am currently in the process of setting up an FTP server with limited knowledge :p.
I have run into an issue that i need some help with.
Basically i want to be able to download files off another remote server twice a day every day but i want to make sure it only downloads new... (1 Reply)
Hi
I am trying to ftp all the files from a directory in server2 to server1 (both unix) The below code is in server1
ftpfile=/home/anitha/ftptxt
echo cd mydir >>$ftpfile
echo mget *.* >>$ftpfile
cat $ftpfile | ftp -i server2
mydir is a directory in server2 and there are some test files in... (4 Replies)
Hi Friends,
I need to use if then else logic with the mget command.I need to check if {JOURNAL_CODE}*_1_Audit*.txt exists then download it (using mget)and if not then leave it.Same for the {JOURNAL_CODE}*_2_Audit*.txt file.Can you please tell me how can i achive that?
sftp -b -... (3 Replies)
Hi I'm trying to get all files from a directory with a script. So i'm gone paste my script here:
cd /var/www/match_demos/speedgaming/
lftp -u Gudfaren,xxxxx ftp.speedgaming.pro -e cd 89.221.243.11_27500 -e mget *.dem
exit
when i run that i get:
"File name missed. Try `help mget' for more... (2 Replies)
Hi!
I'm a bit of a unix n00b so be gentle! I need to use ftp to download some files. I have the ftp running in a shell script which had been working perfectly last week. I downloaded around 400 files before it broke on friday.
Now whenever I try to run the script, it starts to download... (3 Replies)
I am writing a scritp in which first step is to get some files from a server.
I am using mget to do that.
here is my FTP code ...
HOST="XXX.XXX.com"
28 ftp -inv $HOST <<END &> $FTP_LOG
29 quote USER $USER
30 quote PASS $PASWD
31 cd log
32 prompt off
33 binary
34 mget... (0 Replies)
Discussion started by: shashidhar
0 Replies
LEARN ABOUT DEBIAN
algorithm::munkres
Algorithm::Munkres(3pm) User Contributed Perl Documentation Algorithm::Munkres(3pm)NAME
Algorithm::Munkres - Perl extension for Munkres' solution to
classical Assignment problem for square and rectangular matrices
This module extends the solution of Assignment problem for square
matrices to rectangular matrices by padding zeros. Thus a rectangular
matrix is converted to square matrix by padding necessary zeros.
SYNOPSIS
use Algorithm::Munkres;
@mat = (
[2, 4, 7, 9],
[3, 9, 5, 1],
[8, 2, 9, 7],
);
assign(@mat,@out_mat);
Then the @out_mat array will have the output as: (0,3,1,2),
where
0th element indicates that 0th row is assigned 0th column i.e value=2
1st element indicates that 1st row is assigned 3rd column i.e.value=1
2nd element indicates that 2nd row is assigned 1st column.i.e.value=2
3rd element indicates that 3rd row is assigned 2nd column.i.e.value=0
DESCRIPTION
Assignment Problem: Given N jobs, N workers and the time taken by
each worker to complete a job then how should the assignment of a
Worker to a Job be done, so as to minimize the time taken.
Thus if we have 3 jobs p,q,r and 3 workers x,y,z such that:
x y z
p 2 4 7
q 3 9 5
r 8 2 9
where the cell values of the above matrix give the time required
for the worker(given by column name) to complete the job(given by
the row name)
then possible solutions are:
Total
1. 2, 9, 9 20
2. 2, 2, 5 9
3. 3, 4, 9 16
4. 3, 2, 7 12
5. 8, 9, 7 24
6. 8, 4, 5 17
Thus(2) is the optimal solution for the above problem.
This kind of brute-force approach of solving Assignment problem
quickly becomes slow and bulky as N grows, because the number of
possible solution are N! and thus the task is to evaluate each
and then find the optimal solution.(If N=10, number of possible
solutions: 3628800 !)
Munkres' gives us a solution to this problem, which is implemented
in this module.
This module also solves Assignment problem for rectangular matrices
(M x N) by converting them to square matrices by padding zeros. ex:
If input matrix is:
[2, 4, 7, 9],
[3, 9, 5, 1],
[8, 2, 9, 7]
i.e 3 x 4 then we will convert it to 4 x 4 and the modified input
matrix will be:
[2, 4, 7, 9],
[3, 9, 5, 1],
[8, 2, 9, 7],
[0, 0, 0, 0]
EXPORT
"assign" function by default.
INPUT
The input matrix should be in a two dimensional array(array of
array) and the 'assign' subroutine expects a reference to this
array and not the complete array.
eg:assign(@inp_mat, @out_mat);
The second argument to the assign subroutine is the reference
to the output array.
OUTPUT
The assign subroutine expects references to two arrays as its
input paramenters. The second parameter is the reference to the
output array. This array is populated by assign subroutine. This
array is single dimensional Nx1 matrix.
For above example the output array returned will be:
(0,
2,
1)
where
0th element indicates that 0th row is assigned 0th column i.e value=2
1st element indicates that 1st row is assigned 2nd column i.e.value=5
2nd element indicates that 2nd row is assigned 1st column.i.e.value=2
SEE ALSO
1. http://216.249.163.93/bob.pilgrim/445/munkres.html
2. Munkres, J. Algorithms for the assignment and transportation
Problems. J. Siam 5 (Mar. 1957), 32-38
3. FranA~Xois Bourgeois and Jean-Claude Lassalle. 1971.
An extension of the Munkres algorithm for the assignment
problem to rectangular matrices.
Communication ACM, 14(12):802-804
AUTHOR
Anagha Kulkarni, University of Minnesota Duluth
kulka020 <at> d.umn.edu
Ted Pedersen, University of Minnesota Duluth
tpederse <at> d.umn.edu
COPYRIGHT AND LICENSE
Copyright (C) 2007-2008, Ted Pedersen and Anagha Kulkarni
This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the
hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation,
Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
perl v5.10.0 2008-10-22 Algorithm::Munkres(3pm)