Visit Our UNIX and Linux User Community

Full Discussion: Debian, digitemp, rrdtool
Top Forums Shell Programming and Scripting Debian, digitemp, rrdtool Post 302369976 by redhead on Tuesday 10th of November 2009 05:13:21 AM
Old 11-10-2009
Hej Per,

Du er vel klar over dette forum for det meste er engelsktalene ?

Jeg har kigget din kode nærmere igennem og syntes du lige skal kigge din update() lidt nærmere efter:
Code:
    RRDs::update "$rrd/temperature.rrd",
       "-t", "out", "N:$read_out";
       "-t", "in",    "N:$read_in";

Hvis det ikke er fejlen, så prøv eventuelt at ændre det til
Code:
RRDs::update ("$rrd/temperature.rrd", "N:" . $read_out. ":" .$read_in);

Selvom du påstår du ikke er programmør, lader det til at være en rimelig pænt program, selve fejlen kan alle lave, det er jo svært på de sene nattetimer at se skoven for træer Smilie
 

5 More Discussions You Might Find Interesting

1. HP-UX

compiling the RRDtool

I tried to compile the RRDtool on HP-UX (IA56). I have gcc-3.4.3 and perl 5.8.0 I got this: Writing Makefile for RRDs cd perl-shared && make /opt/perl/bin/perl /opt/perl/lib/5.8.0/ExtUtils/xsubpp -typemap /opt/perl/lib/5.8.0/ExtUtils/typemap RRDs.xs > RRDs.xsc && mv... (2 Replies)
Discussion started by: Kalin
2 Replies

2. UNIX for Dummies Questions & Answers

rrdtool question

Hi, DEF:clients=cccam.rrd:kliensek:AVERAGE DEF:activeclients=cccam_actclient.rrd:activeclients:AVERAGE "LINE1:clients#0000FF:Connected clients" COMMENT:" \n" "LINE2:activeclients#99FF00:Active clients" COMMENT:" \n" GPRINT:clients:LAST:'Current'\%5.0lf%s COMMENT:" \n"... (2 Replies)
Discussion started by: adriankoooo
2 Replies

3. Red Hat

Why do we use RRDtool in MRTG?

Hi Guys, Why do we use RRDtool in MRTG? I have implemented MRTG for some routers, I have read some notes about RRDTOOL also but don't know what is use of these tool. Any one one please explain me the use of RRDTOOL in their own words? (1 Reply)
Discussion started by: manalisharmabe
1 Replies

4. Shell Programming and Scripting

Bash script for rrdtool

Hello all, I am very new to shell scripting. I messed with basic examples in college, but this this the first work related project I am trying to work on. I am trying to test the rrdtool on our office wan link by measuring the bandwidth utilization. The script concept is fairly easy, but I am... (2 Replies)
Discussion started by: AdrianT04
2 Replies

5. Shell Programming and Scripting

Python-rrdtool try except rrdtool.error module object has no attribute error

I have this code that gives this error on Linux and will be grateful if you can help import rrdtool try: ret_asd = rrdtool.update(myfile.rrd,'N:%s:%s' %(metric1, metric2)); except rrdtool.error, e: print e When i run the above i get the below error except... (1 Reply)
Discussion started by: kaf3773
1 Replies
Math::Symbolic::MiscAlgebra(3pm)			User Contributed Perl Documentation			  Math::Symbolic::MiscAlgebra(3pm)

NAME
Math::Symbolic::MiscAlgebra - Miscellaneous algebra routines like det() SYNOPSIS
use Math::Symbolic qw/:all/; use Math::Symbolic::MiscAlgebra qw/:all/; # not loaded by Math::Symbolic @matrix = (['x*y', 'z*x', 'y*z'],['x', 'z', 'z'],['x', 'x', 'y']); $det = det @matrix; @vector = ('x', 'y', 'z'); $solution = solve_linear(@matrix, @vector); DESCRIPTION
This module provides several subroutines related to algebra such as computing the determinant of quadratic matrices, solving linear equation systems and computation of Bell Polynomials. Please note that the code herein may or may not be refactored into the OO-interface of the Math::Symbolic module in the future. EXPORT None by default. You may choose to have any of the following routines exported to the calling namespace. ':all' tag exports all of the following: det linear_solve bell_polynomial SUBROUTINES
det det() computes the determinant of a matrix of Math::Symbolic trees (or strings that can be parsed as such). First argument must be a literal array: "det @matrix", where @matrix is an n x n matrix. Please note that calculating determinants of matrices using the straightforward Laplace algorithm is a slow (O(n!)) operation. This implementation cannot make use of the various optimizations resulting from the determinant properties since we are dealing with symbolic matrix elements. If you have a matrix of reals, it is strongly suggested that you use Math::MatrixReal or Math::Pari to get the determinant which can be calculated using LR decomposition much faster. On a related note: Calculating the determinant of a 20x20 matrix would take over 77146 years if your Perl could do 1 million calculations per second. Given that we're talking about several method calls per calculation, that's much more than todays computers could do. On the other hand, if you'd be using this straightforward algorithm with numbers only and in C, you might be done in 26 years alright, so please go for the smarter route (better algorithm) instead if you have numbers only. linear_solve Calculates the solutions x (vector) of a linear equation system of the form "Ax = b" with "A" being a matrix, "b" a vector and the solution "x" a vector. Due to implementation limitations, "A" must be a quadratic matrix and "b" must have a dimension that is equivalent to that of "A". Furthermore, the determinant of "A" must be non-zero. The algorithm used is devised from Cramer's Rule and thus inefficient. The preferred algorithm for this task is Gaussian Elimination. If you have a matrix and a vector of real numbers, please consider using either Math::MatrixReal or Math::Pari instead. First argument must be a reference to a matrix (array of arrays) of symbolic terms, second argument must be a reference to a vector (array) of symbolic terms. Strings will be automatically converted to Math::Symbolic trees. Returns a reference to the solution vector. bell_polynomial This functions returns the nth Bell Polynomial. It uses memoization for speed increase. First argument is the n. Second (optional) argument is the variable or variable name to use in the polynomial. Defaults to 'x'. The Bell Polynomial is defined as follows: phi_0 (x) = 1 phi_n+1(x) = x * ( phi_n(x) + partial_derivative( phi_n(x), x ) ) Bell Polynomials are Exponential Polynimals with phi_n(1) = the nth bell number. Please refer to the bell_number() function in the Math::Symbolic::AuxFunctions module for a method of generating these numbers. AUTHOR
Please send feedback, bug reports, and support requests to the Math::Symbolic support mailing list: math-symbolic-support at lists dot sourceforge dot net. Please consider letting us know how you use Math::Symbolic. Thank you. If you're interested in helping with the development or extending the module's functionality, please contact the developers' mailing list: math-symbolic-develop at lists dot sourceforge dot net. List of contributors: Steffen Mueller, symbolic-module at steffen-mueller dot net Stray Toaster, mwk at users dot sourceforge dot net Oliver Ebenhoeh SEE ALSO
New versions of this module can be found on http://steffen-mueller.net or CPAN. The module development takes place on Sourceforge at http://sourceforge.net/projects/math-symbolic/ Math::Symbolic perl v5.10.1 2011-01-01 Math::Symbolic::MiscAlgebra(3pm)

Featured Tech Videos

All times are GMT -4. The time now is 06:36 AM.
Unix & Linux Forums Content Copyright 1993-2021. All Rights Reserved.
Privacy Policy