Elecsol batteries (again)

Prompted by an email from another poster in a recent thread I took a
look here:-

http://www.elecsol.com/html/technical.html

Look at the graph at the bottom. However much I look at it, it makes no
sense.

At the top it says "life cycling data 50% D.O.D." For those who don't
know, D.O.D. means Depth of Discharge. Yet the graph then shows life
cycles for various D.O.D.s between 50% and 100%. So why that heading?

What I find more more concerning is that the graph shows that all these
batteries have a life cycle of zero at 50% D.O.D. and that the life
cycle increases the deeper the battery is discharged. This is clearly
garbage. Up to the point that the Elecsol, supposedly, lasts almost
1000 cycles at 100 D.O.D.

I can assure you that *any* battery discharged to 100% D.O.D. will last
probably zero cycles, and perhaps, at the most, 5 cycles.

The first thought I had was that one of the axes was labelled the wrong
way round. But whichever (or both) are relabelled the other way, the
graph still makes no sense.

If the D.O.D. axis was turned round, then that makes slightly more
sense in that the deeper the discharge, the less life cycles each
battery has. But it still leaves all the batteries having zero life
cycles at 50% D.O.D. Which, clearly, is complete rubbish.

If the "Number of cycles" axis is re-labelled the other way round then
that too makes more sense in that the heavier the discharge the less
the number of life cycles. However, that then means that the Elecsol
has the worst performance of the lot!

This leaves me with one conclusion. They *didn't* do tests then graph
the results, they simply made it up, and got the graph wrong. I can't
think of any other explanation. Can any one else come up with one?

If both axes are re-labelled the other way round, then the resultant
graph makes most sense in that the deeper the discharge, the less the
life cycles. And the Elecsol performs worse than any of the others!

Further, common (incorrect) opinion is that "sealed wets" will perform
better than "flooded" and this is what this graph seems to indicate. In
actual fact the flooded will perform better than the "sealed wet".
Which further points to the idea that the graph was simply made up by
someone who doesn't know very much.

Am I drunk already at this time of day?

Gibbo

.

Relevant Pages

  • Re: How come Ada isnt more popular?
    ... The difference is between a) graph treated as a mesh of nodes which "own" each other and b) graph treated as a collection of nodes. ... The former might have ownership cycles between nodes, but not the latter, where ownership is an acyclic relation between graph and nodes. ... there is a strong argument is that for some class of algorithms it might be beneficial to be able to "drop on the floor" a bigger part of the graph altogether. ...
    (comp.lang.ada)
  • Re: Graph to regions algorithm
    ... > My problem is that I need an algorithm witch will construct all regions ... The graph is convex and convex. ... To find cycles in a graph, you compute the "minimum spanning tree". ...
    (comp.graphics.algorithms)
  • Re: Finding simple cycles approximating target distance
    ... >best solve the following problem relating graph theory. ... I expect result cycles will consist of about 10 ... Assuming the weights are all positive and you want the total weight ... in the interval, you can do a depth-first search using the ...
    (sci.math)
  • Re: CLP(FD) Prolog: help needed with a simple problem
    ... Consider an undirected graph G= ... I should include at least two constrains for each cycle. ... You can use these algorithms with weight 1 for each edge. ... constraints for cycles. ...
    (comp.lang.prolog)