Re: fast drawing in delphi

Fran,
yeah, well, this is not a map that reflect the development of an algorithm.
The idea in this project is more complicated in term or time requirements

I will try briefly to explain it:

The problem:
-------------
We have a multichannel signal we have to screen in order to see the
development of a process
The process is very fast (in terms of microseconds to milliseconds). It
happens for several seconds and
then many other processes start to happen and then it becomes meaningless to
continue monitoring, but the first seconds are very significatives in terms
of valuable information.
We have sophisticated sensors that are able to monitor the process, but the
measured data comes from a huge amount of channels and we have to organize
that information somehow, if we want to understand what's going on.

Solution 1:
-----------
1) fast data AD acquisition, with 10 ms sampling interval
2) Use a SOM (Kohonen Self-Organizing Map) to organize the data
3) Plot the SOM (U-Matrix)

Here we are interested in the evolution of a process, not in the evolution
of an algorithm

Solution 2:
----------
1) Install 100 mini CCD cameras to observe the process
2) Video data processing

Theorem I
It is good to have an interesting research topic as job

Theorem II
after the job it is good to go out with some nice friends and have a good
beer!

Merry Christmas!


"Francis Burton" <fburton@xxxxxxx> a écrit dans le message de news:
1135339581.187611@xxxxxxxxxxxxxxx
> In article <43ab3c8c@xxxxxxxxxxxxx>, Maldona8 <maldona8@xxxxxxxxxxxx>
> wrote:
>>Unfortunately, almost each hexagon in the neural map is changing, little,
>>but changing...
>
> If the point of having a map displayed is to give the viewer
> information about the progress of the algorithm (or some such),
> it probably doesn't matter if the graphics are not an =exact=
> representation of the program state. So you could probably get
> away with not redrawing those hexagons which have changed less
> than some delta. For larger values of delta, that may introduce
> some "stepping" artefacts. Who knows, though, that might even
> improve the perceptual feedback!
>
> Francis


.

Relevant Pages

  • Re: A dungeon generator
    ... rooms will not fit in the map, so your algorithm will fail. ... each level has 16 possible starting templates. ...
    (rec.games.roguelike.development)
  • Re: one sentence proof of 4 Color Mapping Problem; direct method
    ... for you to determine whether you can color this map with THREE ... So an algorithm for this machine would look ... building the algorithm in P to solve the NP-complete problems, ... Perhaps the equivalency is the idea that Eucl geom is what is ...
    (sci.math)
  • Re: A dungeon generator
    ... then it automatically turns in the former kind of algorithm. ... If it fails to generate a map ... rooms, then after a hundred more fails, five rooms, etc. ... each level has 16 possible starting templates. ...
    (rec.games.roguelike.development)
  • A Random Town Generation Algorithm
    ... I have implemented a random town generation algorithm algorithm. ... Pick a random point close to the centre of the map. ... And do the same for each of the new rectangles created by this until you've reached a minimum size. ... Ideally all these new created subdivisions should be stored in some list. ...
    (rec.games.roguelike.development)
  • Re: Precise Permissive Field of View: Request for comments
    ... that convinced me to use it as a default FOV algorithm in RoguelikeLib:) ... The interface is not yet very swapable, I will work on it with a new version. ... map data structure, it should have a map interface (not necessarily ...
    (rec.games.roguelike.development)