MatLAB | Mathematica | MathCAD | Maple Answers

Questions: 245

Answers by our Experts: 142

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Search & Filtering

Consider a simple polymer, which consists of long chains of simple molecules attached to each other, for example: ..CH[2]-CH[2]-CH[2]-... If the interaction energy between consecutive sections can beignored or is low enough, the chains can be bend around at various places to form various configurations. let us make model of a simple polymer which is restricted to lie within a two-dimensional plane. one can start by fixing the first section to a particular coordinate and then add additional components by use of random walk with the condition that it may not intersect itself. it should be clear that when forming a polymer in this way, it can happen that you end up in a cul-de-sac, i.e. you can not add an additional component to lengthen it further, without intersecting with itself. when this happens the polymer is terminated. a general outline of the algorithm would be as follow: initialize an array that would be keep track of all the positions of the random walker start the random walk at a given coordinate after each move, the array storing the visited positions needs to be updated while it is still possible to add extra components to the polymer repeat the following "(*)" select a new direction randomly check whether the new move is allowed, by looking wether that coordinate has been visited before. if the new move is allowed, take it, and update the array. if the new move is not allowed, return to "(*)"and select a new random number when no more additional components can be added, stop the loop. 1. write a program to simulate the formulation of polymers as outlined above, by use of self-avoiding random walk. let it start at the origin, and let the walker have equal propability to movein any of the four directions: up, down, left or right. 2. repeat the move above lgorithm many times (without ploting ), to obtain a histogram on the polymer lengths that result from this simple model. also calculate the average length of all the polymers.
Consider a simple polymer, which consists of long chains of simple molecules attached to each other, for example: ..CH[2]-CH[2]-CH[2]-... If the interaction energy between consecutive sections can beignored or is low enough, the chains can be bend around at various places to form various configurations. let us make model of a simple polymer which is restricted to lie within a two-dimensional plane. one can start by fixing the first section to a particular coordinate and then add additional components by use of random walk with the condition that it may not intersect itself. it should be clear that when forming a polymer in this way, it can happen that you end up in a cul-de-sac, i.e. you can not add an additional component to lengthen it further, without intersecting with itself. when this happens the polymer is terminated. a general outline of the algorithm would be as follow: initialize an array that would be keep track of all the positions of the random walker start the random
1- Develop a user- defined function that will return the phasor form of complex vector. In addition, the user-defined function will indicate which quadrant the phasor vector is in.
All inputs to the executive will be via the input function. The executive program will pass the rectangular coordinates of the vector to the user-defined function through the arguments.
hello, i have a program written on mathlab simulink, and want to build a user interface using gui. so that i can inter the values for the input blocks from the gui, and also observe the corrensponding output values on the gui.

regards
if the arch is shaped according to this equation y= 693.8 - 68.8 cos h (x/99.7) ft
Make a plot of the arch for -299.25≤x≤299.95 ft
in Matlab
want to write a program to simulate a walk of a drunken sailor who walks out of a bar at the centre of a city. the city has a regular pattern of 24\24 square blocks. the sailor doesnt know where he is going and how to exist teh city. the question is how many blocks will he have to walk to exit the city?
let him start at the centre of the city and assume that he exists the city when he reaches either north, east, south or western borders. it can happen that he wlks...
I M JAYANTA, DEVELOPING A PROJECT "SEMANTIC IMAGE ANALYSIS" ..FACE A PROBLEM TO EDGE DETECTION PART.WHICH FUNCTION ON MATLAB GIVING ME EFFORT TO DO THIS???ITS FOR MULTIPLE OBJECT IN A IMAGE.
where can i find an accurate matlab code for Scale Invariant Feature Transform Algorithm and how can i add it to my matlab ????
The initial conditions are y(t = 0) = 2 and dy(t = 0)/dt = 0. The file VdP with the resulting right hand side
has been coded up for the given equation. Solve the equation for t = [0 : 0.01 : 32] using ode45. Is this the right code to solve for y(t)?
y0 = [2; 0];
[t,y1]=ode45(@VdP,[0:0.01:32],y0);
A4 = y1(:,1);
Map single greyscale pixel to label (e.g. in, out, membrane), using Multilayer Perceptron and RBF,train the network and. Compare.
LATEST TUTORIALS
New on Blog
APPROVED BY CLIENTS