Tumblelog by Soup.io
Newer posts are loading.
You are at the newest post.
Click here to check if anything new just came in.

March 16 2017

nichtderschonwieder
http://www.ni.com/example/25012/en/



ein heap sort mit functioneller globaler variable - zum lernen
nichtderschonwieder

This example was written in conjunction with the "Can LabVIEW C? - Example 1: Basic Structures and Methods" document linked below, which compares functionality between C and LabVIEW.

nichtderschonwieder

March 09 2017

nichtderschonwieder

March 08 2017

nichtderschonwieder

Using the 3-D Parametric Surface Graph

http://www.ni.com/tutorial/4984/en/

The 3-D parametric surface graph is the most complex of the 3-D surface and the most difficult with which to work. The key to understanding the 3-D parametric surface graph is in understanding that the surfaces are described parametrically with 2 parameters -- call them i and j. Therefore, in order to draw a three dimensional surface, we need three equations:
    x = fx(i, j)

y = fy(i, j)
z = fz(i, j)
We then plot these three equations into three matrices, using the indices of the arrays for our i and j values:

A good example of how to use parameterized equations is converting from spherical to Cartesian coordinates and drawing a sphere. The equation for a sphere in spherical coordinates is quite simplistic:
    r = const, (for every value of q, the rotation, and f, the elevation). The constant is the radius of the sphere.

To parameterize this we will simply convert the equation into Cartesian coordinates using the standard transform:
    x = r cos(q)cos(f)

y = r sin(q)cos(f)
z = r sin(f)
Running q from 0 to 2p and f from -p to +p generates all of the points in the sphere. Hence this is the Cartesian form of a sphere parameterized in q and f. However, we don't really want all the points in the sphere, (since that would take an infinite amount of time to plot!). Rather, we would like a few representative points from which we can draw the sphere. These we will place into our arrays. Remember that i and j, the indices of the arrays will ultimately become our parameters, so we must also convert q and f to i and j.

First, we must choose an array size to contain the points. This is largely a decision of how many points are deemed necessary to sufficiently represent the structure. For this example, I will choose arrays that are 25 by 25 elements. Therefore, both i and j will run from 0 to 24. Using this, we must map q to i and f to j (or vice-versa).
     and 
    Note that for , and for . Therefore, rewriting the equations:



      With these three equations, we can fill three matrices with values for x, y, and zbased on the parameters i and j, which are the indices of the values in the array.

      Then all that is left is to plot the arrays: 




      Another way of thinking about the 3-D parametric surface graph is to think of the arrays as one 2-D array of 3-D vectors, (rather than three 2-D arrays of scalars). With this concept, we can easily see that the 3-D graph draws a rectangle for each set or four adjacent elements of the array. In the pictures below, we see a portion of this sphere's data array represented as a 2-D array of 3-D vectors. Notice that every adjacent cell generates a rectangle on the 3-D representation.

nichtderschonwieder

March 05 2017

nichtderschonwieder
nichtderschonwieder
nichtderschonwieder

March 01 2017

nichtderschonwieder
nichtderschonwieder

2017-03-01_121816_gui

(GIF, 531 KB)
ein funktionsfähiges pse
Tags: labview demo gui
nichtderschonwieder

2017-03-01_121258_pse_no-typdefs

(PNG, 205 KB)
labview demo code
Tags: labview demo

Windows Media Player 9 Skins

neural-entropy:

winternull:

lokiseto:

sinbadism:

ms-dos5:

imageimageimageimageimageimageimageimageimageimageimageimageimageimageimageimageimageimageimageimageimageimageimage

this is hell

Fucking flashbacks….

what a wonderful time to have been alive

An elegant weapon, for a more civilized age

Reposted frombwana bwana viaPorcelain Porcelain

February 26 2017

nichtderschonwieder
Play fullscreen
krabbeltierchen ;)
Tags: mining klauben
nichtderschonwieder

Street Fighter 2 - state machine

I ought to mention that all AI behavior is completely editable without bothering with assembly. For reference, I have the AI state machine for Guile completely decoded.

http://forums.sonicretro.org/index.php?showtopic=26391

Other instructions can directly manipulate variables in the AI state machine, test for certain conditions, and form primitive IF…END blocks. Here’s one of Ryu’s typical ‘easy’ attack routines: Throw three fireballs at you, and if you’re somehow silly enough to catch all three and get dizzy, run up to you and throw you.

https://sf2platinum.wordpress.com/

ORG 0x99c88 sf2ua.bin
0x02,                   ; script header, type 2 
0x10, 0x50, 0x04, 0x00, ; throw a hi str fireball
0x00, 0x80,             ; wait until I have no fireball
0x10, 0x50, 0x04, 0x00, ; another hi str fireball
0x00, 0x80,             ; wait again
0x10, 0x50, 0x04, 0x00, ; another hi str fireball
0x92,                   ; are they dizzy?
0x04, 0x00, 0x18,       ;    walk until we're within 24 pixels  
0x00, 0x82,             ;    wait if they're still getting up
0x10, 0x84, 0x00, 0x00, ;    throw(4)
0x94,                   ; end if
0x00, 0x00, 
0x00, 0x00,             ; wait four frames
0x00, 0x00, 
0x00, 0x00, 
0x86,                   ; chain to another randomly chosen script
and sometimes bugs in the AI make it feel smarter/more realistic

https://blogs.msdn.microsoft.com/shawnhar/2009/12/29/bug-or-feature/

February 24 2017

nichtderschonwieder
lvlib sorgt dafür (access scop = private, public) das ein vi nicht ohne sub-vis oder benutzerdefinierte ctls weitergegeben wird
Tags: labview cld

February 22 2017

nichtderschonwieder

logical sorting mit FGV

logicalstringarraysort.llb

http://www.ni.com/example/25012/en/

The sorting algorithm used is a stack based Quick Sort so it runs very fast. Implementing it using recursive VI calls is more elegant, however due to the number of calls involved and the overhead of such recursive calls in LabVIEW the sorting is much faster this way.

February 21 2017

nichtderschonwieder
9648 5243
learning
nichtderschonwieder
nichtderschonwieder
9650 ab8e
man beachte die case struktur! das sind gleich 3 implementierungen des bubblesort algorithmus, alle im formula node o_O
Older posts are this way If this message doesn't go away, click anywhere on the page to continue loading posts.
Could not load more posts
Maybe Soup is currently being updated? I'll try again automatically in a few seconds...
Just a second, loading more posts...
You've reached the end.

Don't be the product, buy the product!

Schweinderl