Set A={y1,y2,y3} How can i find set B={y2-y1,y3-y2,y3-y1} in a fast way? Thanks! -Bob Bob Jenkins wrote: > Set A={y1,y2,y3} > How can i find set B={y2-y1,y3-y2,y3-y1} in a fast way? Perhaps you could tell us what 'yN' is and what you consider "fast". By "Set" or "set" do you mean 'std::set' or something else? Is your question about C++ language or about a general programming technique? Bob Jenkins wrote: > Set A={y1,y2,y3} > How can i find set B={y2-y1,y3-y2,y3-y1} in a fast way? > Thanks! > > -Bob How fast does it n...

i want to measure the shortest distance between cities in java island,one of my friend already used dijkstra,so i need to use another method.could you please advice me? appreciate you'r help. sekolah dimana? hendra wrote: > > > i want to measure the shortest distance between cities in java > island,one of my friend already used dijkstra,so i need to use > another method.could you please advice me? > > appreciate you'r help. ...

Regarding Hotelling's test, look at a post I wrote several months ago: http://www.listserv.uga.edu/cgi-bin/wa?A2=ind0904D&L=sas-l&P=R50242 A reasonably good summary for the correlation question is found on pages 23-25 of "Correlation", by Chen and Popovich (Sage QASS series vol 139) which refers to an article by Steiger "Tests for comparing elements of a correlation matrix" from Psychological Bulletin, (1980), pp. 245-251. I also recall that PROC CALIS can make a similar test, so you might want to check the archives for it. Robin High UNMC OR Stats &l...

Hi all : I have a rather simple question : I have a distance matrix from SAS proc distance for 1000 variables which have exotic but meaningful names. The sas dataset has 1001 variables and 1000 rows, the upper half is missing. The first variable is named type and contains the names of the variables, say, V1 to V1000 (in reality there is no easy naming scheme in these names!). The varibles No. 2 to No. 1001 are also named V1 to V1000. This is standard SAS. What I need is a new dataset with 3 variables from | to | and DIST . DIST is the numeric value of all non-missing and non-null dis...

Hi all, Here is my problem: I have 3 functions (of 2 variables) to draw on the same graph: f1(x1,x2), f2(x1,x2), f3(x1,x2) with x1 and x2 in [xmin,xmax] .... with the meshgrid ... it is very simple BUT the trouble is that i have 3 inequality constraints that have to be satisfied: g1(x1,x2) <0 g2(x1,x2) <0 g3(x1,x2) <0 and i want to see on the graph, only the value of f1, f2, and f3 that correspond ton feasible points (meaning satisfying the 3 constraints) How can I do that ? Here it is the drawing of my unconstraint problem: n=100 x1=linspace(-4,4,n); x2=linspace(-4,4,n); [...

Log Message: ----------- Mark as done: < * Point-in-time data recovery using backup and write-ahead log, < * Create native Win32 port, http://momjian.postgresql.org/main/writings/pgsql/project/win32.html > * -Point-in-time data recovery using backup and write-ahead log > * -Create native Win32 port 470c470 < o Fix PL/pgSQL RENAME to work on variables other than OLD/NEW > o Fix PL/pgSQL RENAME to work on variables other than OLD/NEW Modified Files: -------------- pgsql-server/doc: TODO (r1.1351 -> r1.1352) (http://developer.postgre...

I have results for 250 people who were solving three different tests. All of my subjects solved all three tests and now I want to compare means of those three tests. I know that I should do analysis of variance for paired samples, but I don't know how to do it in SPSS (I have version 11.01), so can anyone help me? miroslav.rajter@gmail.com wrote: > I have results for 250 people who were solving three different tests. > All of my subjects solved all three tests and now I want to compare > means of those three tests. I know that I should do analysis of > variance fo...

Hi Everyone, Can you guide me through the following problem: in the shortest path problem if we have vertex costs in addition to edge lengths how is the algorithm changed! I am trying to modify the Dijkstra and Bellman_ford algorithm to answer this but i am stuck!!! any Hints thx On Feb 27, 12:02 pm, "Ez_Alg" <virtualreal...@gmail.com> wrote: > Hi Everyone, > Can you guide me through the following problem: > in the shortest path problem if we have vertex costs in addition to > edge lengths how is the algorithm changed! I am trying to modify the > Dijkstra a...

Hi all, I am trying to find all possible shortest paths ( the path itself not the distance) for a undirected graph for which all weights are equal. The function "graphshortestpath" gives only one possible shortest path between any two nodes while there may be many. How can I find the rest?? For my data, I have 64-node undirected graph for which the shortest path between nodes 1 and 3: [dist,path,pred] = graphshortestpath(UG,1,3,'directed',false); path path = 1 7 55 3 and funny enough if you try to exchange the nodes you get another possible root for the s...

************************************************************** JobCircle.com is the largest regional job board in the Mid-Atlantic region, with tens of thousands of job offerings in PA, NJ, DE, MD, NY, and Washington D.C. To learn more, visit http://www.jobcircle.com?source=ng ************************************************************** Job Title: Summer Internship 2009 - Developer, Technology... Job Location: PA: West Point Pay Rate: Open Job Length: full time Start Date: 2009-02-07 Company Name: Merck Contact: HR Phone: email only please ...

Hi, Dear all, I am using feedforward neural networks to develop time series prediction (one step). There are few data points (sample points), 15. I construct a network, small, but have weights larger than the sample no. Generaltion / regulation is used for training. THe prediction is good/acceptable. But it seems this is not right, for No. of Sample Size < No. of weights. How to validate/justify my predictions? Thanks Regards, Qingpei The problem is the number of data points. 15 is really small to get good result with NN. My advice is to use other method. Hope that helps. ...

My brother and I picked up a hitch hiker about a hundred years ago (ok, maybe it was 25 to 30 years) ago. He had a backpack, and was from England. We picked him up at the East end of Arizona (on I-40) and he was hitch hiking his way across America for the summer. We had several laughs about him and with him. Some of his thoughts were: No one in Europe could ever even begin to conceive just how hot Arizona is (it was well into June and well over a 100 degrees), after working his way across California and Arizona, he was stupefied by the sheer size and magnitude of the two states and was alr...

I have created mesh and surface files from a 3d laser scan of a surface, point cloud of (x,y,z). I have used linear and cubic interpolants with the griddata function and i am finding that the output mesh and surface have a relative amount of noise, spikes at radom intervals. It is clear that the input 3d point cloud has noisy data, or overlapping data. I would like to smooth the data by taking some sort of average of near points or even eliminating some of the data??? I see that there is a 3d smoothing function, but i am not sure how to get my 3d point cloud data into the necessary 3d nxn vec...

#include <iostream> int main() { int i =3D 1; std::cout << i << i++ << i << "\n"; } Compiling this code in g++ prints out 212 . Is this correct? If so, I don't= understand why.=20 Shouldn't this actually be equivalent to f(f(f(f(std::cout,i),i++),i),"\n")= where f is operator<< ? In that case, each time a function is entered, the= re should be a sequence point which makes the side effects happen. So I'd e= xpect the output to be 112 instead.=20 % g++ --version g++ (Debian 4.6.1-4) 4.6.1 Best regards, Laird Breyer On...

Does anyone know how to control the size of a point light source in photoworks. I am wanting light a neon bulb in an assembly but the point light is larger than the bulb it self. Martin The size of the graphic is only a reference it shouldn't make any difference when rendered. All the light is emited from the center of the ball. I'm assuming you mean the size of the light beam. Where do you want to control it? At the source of the light? Or at the surface where it is being projected onto? Richard "Martin Scottorn" <marty@spam.co.nz> wrote in message new...

Does the connection speed slow down as you move further from the AirPort base stationand the signal level drops? It may be my imagination but this apears to be hapening to me. Entity Dennis spoke thus: > Does the connection speed slow down as you move further from the > AirPort base stationand the signal level drops? Yes. -- Gnarlie ...

Chrisantha, It always helps if a poster can supply some actual sample data. Then a responder doesn't have to make up data that may not reflect your actual form of data. In any case, here is some sample data where the third item is a Hue color. data = Table[{x, Sin[x], Hue[x/(2Pi)]}, {x, 0.0, 2Pi, 2Pi/20}] Show[Graphics[ {AbsolutePointSize[6], {Part[#, 3], Point[Take[#, 2]]} & /@ data}], Frame -> True, ImageSize -> 450]; What I did was use a pure function, {Part[#, 3], Point[Take[#, 2]]} &, that extracted the third part of the data list...

Hello, I copied an old HD with Linux RH8.0 and Win98 to a bigger disk. On my all HD Linux had 3 pimary partitions - one for /boot, one for / and one for swap and Win98 had another primary partition. On a new disk I made one extended partition for Linux - with 3 logical partitions. I had problem with booting, so I put in MBR original boot record by issuing command: FDISK /MBR. I have Partition Magic 5.0 on my Win98 partition, so I thought with help of this software I could correct Lilo problem. Now I can boot Win, PM is seeing Linux partitions, but PQ Boot (multi boot part of Partit...

Hi, I have an undirected and unweighted graph. I can easily compute the shortest path between a node i and j. However, often there are more than one shortest paths between i and j and I would like to find all of them. Is there an algorithm/implementation out there that can compute this? many thanks Hi, May be the following would work : While using Dijkstra's algorithm we maintain a set of nodes L , one whose shortest distance from the node u has already been found out and let d[] denote the array/storage of all values. what we do in the algorithm is that we find the node A which is the ...

Hi, Can any one show me the shortest path to become lisp guru... Sorry if it is a faq. (hope not waste than ad's posted) Thanks lboard1947@gmail.com writes: > Can any one show me the shortest path to become lisp guru... > > Sorry if it is a faq. (hope not waste than ad's posted) A man from AI walked across the mountains to SAIL to see the Master, Knuth. When he arrived, the Master was nowhere to be found. "Where is the wise one named Knuth?", he asked a passing student. "Ah," said the student," you have not heard. He has gone on a pilgrimage a...

Hello, I need to calculate the distance between a line segment and a triangle. Unfortunately Google was no good helper this time. So i thought of something like that: (When speaking of plane i mean the plane defined by the triangles points and when speaking of line its the infinite line defined by the line segment) First test if the endpoints of this given Line Segment are on opposite sides of the plane. If so calculate the intersection point between this plane and test if its inside the triangle. In this case the distance would be zero. If not: project both endpoints orthogonally ont...

Hi to all, I'd like to know if there exists some readily available function in Matlab which can be used to generate samples of data out of a given list of data points? Thanks a lot in advance and good day. - Fiona "Fiona Sammut" <fionasammut@yahoo.com> wrote in message news:eeef33f.-1@webx.raydaftYaTP... > Hi to all, > > I'd like to know if there exists some readily available function in > Matlab which can be used to generate samples of data out of a given > list of data points? > > Thanks a lot in advance and good day. > > - Fiona help r...

On 11/8/06 at 6:06 AM, andrew.j.moylan@gmail.com (Andrew Moylan) wrote: >Please consider the following code, which asks FindMinimum to >minimise a simple parabolic function while tracking at which which >points FindMinimum evaluates the function: >func[x_?NumericQ] := (Print[x]; 1 + (x - 1)^2) FindMinimum[func[x], >{x, 0.1}] >The output is: >0.1 0.1 0.1 0.6 0.6 0.6 1. 1. 1. 1. 1. 1. >But I would have expected output more like: >0.1 0.6 1. 1. >Can anyone explain why FindMinimum evaluates func three times at >each test point, instead of ...

I have an integer, IPTR which holds the address of a bit of memory in which resides some character data. I want to capture that character data in a character variable, but not sure how to do that. I tried the old equivalence but that didn't work. Can anyone help? ferrad <acfer@hotmail.com> wrote: > I have an integer, IPTR which holds the address of a bit of memory in > which resides some character data. I want to capture that character > data in a character variable, but not sure how to do that. I tried the > old equivalence but that didn't work. Can anyone h...

********************************************************************** This job posting is brought to you by ISHUNTER.COM, offering computer jobs for programmers, engineers, systems analysts, network administrators and other high technology professionals. Search over 3,000 IS/IT jobs in the United States by clicking on http://www.ISHunter.com ********************************************************************** Title ...... Recruiter - Scientific Skills ..... COMMUNICATION Location ... WEST POINT, PA Area Code .. 610 Term ....... Contract Length ..... PERM Pay ....