COMPGROUPS.NET | Search | Post Question | Groups | Stream | About | Register

### Hold Function On Simulink (for graph)

• Email
• Follow

```hi.

i am wondering about is there a 'hold' function on simulink.

for example..

i simulated the system at 0 centigrade, and i have a i-v curve. then i simulated it at 25 centigrade and i have a new i-v curve.

is there a possible show this curves on same graph?

thanks.
```
 0
Reply muscle 12/31/2010 4:13:05 PM

See related articles to this posting

```There is no hold in Simulink.
You'll need to save each run to the MATLAB workspace and then plot them in MATLAB.

Phil.
```
 0
Reply Phil 1/4/2011 4:16:04 AM

1 Replies
637 Views

Similar Articles

12/6/2013 1:37:24 PM
page loaded in 76058 ms. (0)

 Reply:

Similar Artilces:

graph this
sold for \$.50. I need to put this on a graph to show which salesperson had the most dominant price. I had in mind putting price on the X-axis such that it ranges from \$.10 to \$.75 and have names stack up by price. I could do it manually, but any suggestions in SAS? Thanks, it. --------------------------------- Ahhh...imagining that irresistible "new car" smell? Check outnew cars at Yahoo! Autos. Your data, at least as it appears on my email, has all of the numbers in a single column so I can't really see what they are supposed to look like. Could you retype them and we can... graph this 04/16/2007 09:02 AM Please respond to Syb it <sas_datalover@YA HOO.COM> Dear All, I have sales data that looks like this: Tom James Chris Mike Sean 0.07 0.70 0.07 0.09 0.70 0.07 0.09 0.75 0.08 0.09 0.10 0.67 0.70 0.10 0.10 0.10 0.10 0.10 0.11 0.10 0.63 0.70 0.70 0.10

Graph generation ?
they seem a bit more complicated. Thanks for this solution, it was close of what my customer wants. Close, because he wants to have interactivity ; zooming and modifying data on the fly, making the graph immediatly appears modified, are essential functionnalities... it does not help me ;-) With such needs, I think that I have to develop want he wants in an applet, or something like that : I didn't see anything which offers interactivity on the plots of the graph So I should look for an open source solution to start from.. but which one ? I did not practice any one. :( shakah... -- at the time I used KavaChart they had simple > licensing structure, looking at the site now they seem a bit more > complicated. DeMZed wrote: > Thanks for this solution, it was close of what my customer wants. > > Close, because he wants to have interactivity ; zooming and modifying > data on the fly, making the graph immediatly appears modified, are > essential functionnalities... it does not help me ;-) > > With such needs, I think that I have to develop want he wants in an > applet, or something like that : I didn't see anything which offers >

4D Graph
I have a 3 dimensional matrix (nxnxm) that contains velocity measurements. I was wondering if there was a way to make a contour map of the velocity in the 3D cube made by the 3D matrix. "Matthew Allen" <allenmatthew@yahoo.com> wrote in message news:fuqenl\$r0t\$1@fred.mathworks.com... >I have a 3 dimensional matrix (nxnxm) that contains > velocity measurements. I was wondering if there was a way > to make a contour map of the velocity in the 3D cube made > by the 3D matrix. I interpret your question as asking for the 3D equivalent of a contour,

Drawing a graph
Hello list, I need to draw a graph, 2 axes, 2D, nothing fancy. One of the axes is time, the other one is a series of integers. I don't care much about the output format. Are there any specialized libraries for this, or should i use PIL? Thanks. -- Regards, Ghirai. Ghirai wrote: > Hello list, > > I need to draw a graph, 2 axes, 2D, nothing fancy. > One of the axes is time, the other one is a series of integers. > > I don't care much about the output format. > > Are there any specialized libraries for this, or should i use PIL? > What about Gnuplot.py http://gnuplot-py.sourceforge.net/ -- Helmut Jarausch Lehrstuhl fuer Numerische Mathematik RWTH - Aachen University D 52056 Aachen, Germany Ghirai wrote: > Hello list, > > I need to draw a graph, 2 axes, 2D, nothing fancy. > One of the axes is time, the other one is a series of integers. > > I don't care much about the output format. > > Are there any specialized libraries for this, or should i use PIL? > What about Gnuplot.py http://gnuplot-py.sourceforge.net/ -- Helmut Jarausch Lehrstuhl fuer Numerische Mathematik RWTH - Aachen University D

aligning of graph
the scale). Which property should be modified? Hello labmaster, I am attaching a VI and a control to demonstrate what I believe that you are trying to do.It seems that your smaller graph control itself (if you open it and look inside) was not aligned to either extremity of the control, which made it hard to use the values from the property nodes. Also, note that the Position and Bounds is for the control itself, but these values are different from the bounds and size of the Plot Area.Please take a look at the VI, and let me know whether this is what you were trying to achieve. Control 1.ctl

Determining the type of the graph
Given adjacency matrix or adjacency list, how does one determine the type of a graph? Is it a tree, st-graph, biconnected, planar, etc. I did Google search but most of the references are useless. I would appreciate references that don't include obscure and expensive journal subscriptions. Tony Tony <tonkoj@gmail.com> wrote: > Given adjacency matrix or adjacency list, how does one determine the > type of a graph? Is it a tree, st-graph, biconnected, planar, etc. By looking up the definition of that type of graph, and testing the given graph for its defining properties. > I did Google search but most of the references are useless. I would > appreciate references that don't include obscure and expensive journal > subscriptions. Any textbook on (algorithms of) graph theory should do --- it's actually hard to come across any of the above types of graph without it being accompanied by an algorithmically applicable definition of what it means. -- Hans-Bernhard Broeker (broeker@physik.rwth-aachen.de) Even if all the snow were burnt, ashes would remain. Hans-Bernhard Broeker wrote: > By looking up the definition of that type of graph

Graph Legend question
Hi all, I had a quick question on SAS Graph legend values. I am trying to display legend value descriptions with 40 char length, but they are being chopped off at 32 chars. Is there a limit on how many characters the descriptions can have? Here is the legend: +---------------------------------------+ | Legend variable: | |---- Treatment Group 1 - Drug 0 (Plac | |==== Treatment Group 2 - Drug 1 (Drug | +---------------------------------------+ '(Plac' should be '(Placebo)' '(Drug' should be '(Drug 1)' Here is my legend statement: legend1 position=(inside left bottom) mode=protect across=1 offset=(3 pct, 4 pct) label=(h=.8 f='Helvetica' position=top j=c "Legend variable:") value=(h=.8 f='Helvetica') shape=symbol(6,.8) frame fwidth=4 ; Thanks in advance, Amit On Wed, 6 Oct 2004 11:31:46 -0400, Dhameja, Amit <amit.dhameja@LX.STATPROBE.COM> wrote: >Hi all, > >I had a quick question on SAS Graph legend values. > >I am trying to display legend value descriptions with 40 char length, but >they are being chopped off at 32

algorithm to untangle a graph
Hi, Does anyone know of a good algorithm to untangle a graph? Or to be more precise: Does anyone know of a good algorithm that will determine the arrangement of vertices and edges of a graph such that the number of edges that cross is minimized? I am thinking I could use a brute force method that would add vertices in every possible order in every possible region and add in each new edge for a vertex in every possible order. Would this work? Is there a more efficient (time and/or space) algorithm? Any help would be appreciated. Thanks, John Hi, grasp06110@yahoo.com wrote: > Hi, > > Does anyone know of a good algorithm to untangle a graph? Or to be > more precise: Does anyone know of a good algorithm that will determine > the arrangement of vertices and edges of a graph such that the number > of edges that cross is minimized? This is not a Java related question... > I am thinking I could use a brute force method that would add vertices > in every possible order in every possible region and add in each new > edge for a vertex in every possible order. Would this work? Is there > a more efficient (time and/or space) algorithm? Bruce

graph plot problem
Hi all, I am unable to plot a basic graph (at least it seems so !). I am sure I am making a very basic conceptual mistake and I am here to get it corrected. I have two functions 'final' and 'work3' defined in their respective m-files. 'final' uses the ode45 routine to solve an ode for a volume in a piston cylinder. 'work3' is for volume. Please have a look at the code before I put my query. <<work3.m>> function dv=work3(x); %x=[-180:0.1:180]; b=0.1; s=0.1; l=0.15; R=(2*l)/s; %r=10; Vd=(pi/4)*(b^2)*s; dv=((Vd/2).*sind(x).*(1+cosd(x).*(R^2-sind(x).^2).^(-0.5))) <<final.m>> function dP=final(x,P) w=1; b=0.1; s=0.1; l=0.15; R=(2*l)/s; n=3; a=5; r=10; Q=1800; z=40; y=-20; Xb=0.99; Vd=(pi/4)*(b^2)*s; dP=((-1.4)*(P/((Vd/(r-1))+(Vd/2)*(R+1-cosd(x)-((R^2)-sind(x)^2)^0.5)))*((Vd/2)*sind(x)*(1+cosd(x)*(R^2-sind(x)^2)^(-0.5))))+((1.4-1)/((Vd/(r-1))+(Vd/2)*(R+1-cosd(x)-((R^2)-sind(x)^2)^0.5)))*n*a*(Q/z)*(1-Xb)*((x-y)/z)^(n-1) w=work3(x)*dP Query : As you can see I am calling 'work3' from within 'final.m' and so when I try to plot a graph between w and x I get the error '

Re: Special graph #2
GA.EDU> Subject Re: Special graph 10/19/2005 01:19 PM Please respond to "Karl K." <karlstudboy@HOTM AIL.COM> It appears that SAS Code Sample 364 will do what you want (uses the annotate dataset). http://support.sas.com/ctx/samples/index.jsp?sid=364