|
Thanks! I was looking this info
|
|
|
|
|
Well I'm still working on it!, but taking a break on it today.
It needs improvement on the Common items, and a better way to arrange the items.
I'm thinking aspect ratios today, to treat each item by aspect ratio or shape, to determine how to stack them, then take a measurement of the dimensional weight.
|
|
|
|
|
Hello.
I'm making a racing game. I've been messing around with numbers and stuff to make a script for simulating car engine temp which weather temperature, weather humidity, the power of radiator, Engine output and engine oil play a role in increasing/decreasing the temp.
For the wheels, only weather temp and humidity, Wheel air pressure and engine power is needed (I guess).
I just can't make an accurate one. Would be happy if someone suggests an algorithm to simulate car heat temperature.
Remember that it is only a game, not a military-grade advanced simulation software .
|
|
|
|
|
Apparently using Nitrogen in the tires is a factor...
Engine temp increases with loss of oil pressure / oil volume
Engine temp increases with engine RPM
Ambient temp increases engine temp
Humidity affects air density which decreases combustibility which affects engine power causing more work and more heat (?)
Bigger / better radiators allow for running at (what would be) a higher temperature
|
|
|
|
|
Not any help here
But turning raises tire heat.
Radius of the turn, plus speed increases heat. Steering wheel marked in degrees, say 270 indicates a sharp left turn.
Front or rear wheel drive? A sharp left turn on front wheel drive will raise the right front tire temp, then the left rear tire temp. vice versus for rear wheel drive.
Track temp, asphalt gets very hot and tacky in the sun, cold and slippery in the rain or ice.
Tire type, summer tire vs winter tire. Summer tires run hotter.
Tire pressure, more is cooler, less is hotter. Just like water which boils at 212F at sea level, you can increase the pressure and raise the boil point like the coolant system of a car.
|
|
|
|
|
Am currently working on a project relating to quantum cryptography
|
|
|
|
|
|
I don't think that you could find a source code for QKD.. There is only some general info and schemes..Well it seems to me so.
|
|
|
|
|
Hi,
I tried your code to protect PDF file.
I registered the DLL : ProtectPDF and added it's reference to Excel VBA.
But when I am trying to run the code I am getting the error 'ActiveX component can't create object'
Please help!
Thank you!
|
|
|
|
|
Member 12611971 wrote: I tried your code Presumably you are talking about some article here on CodeProject. If so, then you need to post your question in the forum at the end of the article.
|
|
|
|
|
I would also like to point out that we are volunteers; it is not urgent here.
Bastard Programmer from Hell
If you can't read my code, try converting it here[^]
|
|
|
|
|
Is there any algorithm to map these two fields
if n = 5
field 1 Field 2
1 (1)
2 (1,2)
3 (1,2,3)
4 (1,2,3,4)
5 (1,2,3,4,5)
6 (2)
7 (2,3)
8 (2,3,4)
9 (2,3,4,5)
10 (3)
11 (3,4)
12 (3,4,5)
13 (4)
14 (4,5)
15 (5)
I want a function which can give the second field as output for input of first field .
Expect to have a simple mathematical algorithm.
Please help me with this problem.
hint: 1 | 2 | 3 | 4 | 5
* * * * *
* * * *
* * *
* *
*
|
|
|
|
|
Probably homework, solvable with a couple of loops.
|
|
|
|
|
Thank you. Looking forward to have the answer..
|
|
|
|
|
We look forward to you coming up with the answer. You've had the hint on how to solve it. Think about how loops work and you should get the solution.
This space for rent
|
|
|
|
|
I'm trying figure out the best way to distort given image on chess-boarded mask.
http://i.stack.imgur.com/NRoWt.jpg[^]
Both have the same aspect ratio. Theoretically, I could calculate square edges and build a grid of points. And after, extrapolate each pattern pixel to approximate destination on mask based on parent square edges.
But maybe there is more elegant way to do it? With openCV or anything of computer vision algorithms?
|
|
|
|
|
I have n points in the plane and I need to find a pair of concentric circles such that all the points lie between the cicels and the area between the cicels is minimal.
I have an O(n^2) algorithm but it seems that it's possible to improve.
|
|
|
|
|
If you would share your algorithms, someone may have an opinion/idea about it...
Skipper: We'll fix it.
Alex: Fix it? How you gonna fix this?
Skipper: Grit, spit and a whole lotta duct tape.
|
|
|
|
|
How did you even do it? The best I could do so far is using this QCQP
minimize 2 d r + d^2
s.t.
d >= 0
r >= 0
for each point x,y:
(x-cx)^2 + (y-cy)^2 >= r
(x-cx)^2 + (y-cy)^2 <= r+d
The point constraints work out to something like cx^2 + cy^2 - 2xcx - 2ycy - r + x^2 + y^2 >= 0 (with all the squared terms on the left, linear variables in the middle and finally some constants). The square terms are all non-negative so the matrixes that define them are positive semi-definite, so it can be solved with SDP.
|
|
|
|
|
Hey im having trouble in finishing this algo:
A robot engine warms up with his trip and cooled down by a fan.
The robot required to ensure that the engine is not overheating.
Given that the temperature versus time engine is
1.2t=Tm
Temperature of the enviroment is 15=Te
Constant k=0.8
It i1s known that the rate of the cooling is define by
dT/dt = -k(T-Te)+Tm
Also known that the speed of the robot is 25m/s And the starting temparture of the engine is 35.
We need to find the Differential Equations for the road founded in the last question for Each Δt=0.1
This is the answers that i dont know how to get to.
temp is:
Time Temp[degC]
0.0 35.00
0.0 33.40
0.1 31.94
0.2 30.61
0.3 29.40
0.4 28.29
0.5 27.29
0.6 26.38
0.7 25.55
0.8 24.80
0.9 24.13
1.0 23.52
And when its getting warmer:
2.7 19.44
2.8 19.42
2.9 19.42
3.0 19.42
3.1 19.44
3.2 19.47
3.3 19.51
3.4 19.56
3.5 19.61
3.6 19.68
3.7 19.75
And the Path from the last question:
0 0
24 11
7 34
78 196
218 308
289 461
344 412
380 451
516 451
543 554
605 591
600 600
Thank you alot in advence!
|
|
|
|
|
|
============ REPEAT QUESTION FROM C# FORUM
Hello there. We take the example of Bubble Sort Algo.
Time Complexity
Best O(n)
Worst O(n^2)
Space Complexity
Worst O(1)
Let us suppose a simple array contains 25 elements. What does above information mean and how should I visualize it?? Thanks for clearing some basics.
|
|
|
|
|
An algorithm presents a method to do something which ideally works for all manner of inputs. As you know, there are lots of different sorting algorithms, but bearing in mind they are all meant to do the same thing, why so many?
It's to do with the starting condition. If a list is sorted already when you give it to a sorting algorithm, it doesn't have to do any sorting but merely determine that it is already sorted and nothing needs to be done. You can do this by making sure each item is bigger (or equal) to the last. This would be a best case scenario, but each of your N items in the list need to be checked so you end up with O(n) - this means linear performance. A list twice as long takes twice as long.
The worst possible case is when the list is sorted the wrong way around. In this case there are more items, and each item has to bubble up further so you end up with something like n * (n/2) required ops which becomes O(n*n). Each operation takes time so number of ops/time are the same thing here. Double the size and it takes 4 times as long.
In the space complexity O(1) means constant. No new space is required as the sort is contained within the datastructure.
In your case with 25 elements, best case means checking those 25 elements are in order. Worse case is bubbling each the furthest possible distance. A randomized list will be somewhere in between the extremes.
Regards,
Rob Philpott.
|
|
|
|
|
|
Just look up the definition.
f(n) ∈ O(g(n)) iff there exists an n0 and c such that for all n > n0, f(n) < c g(n)
This quite technical definition means the whole big O deal is really a statement about membership of a function in some set of functions that, informally, all "grow about the same". But they only have to start growing about the same after some point n0 (which you don't know) and an arbitrary constant is hidden.
For time complexity that function we make statements about is the function that counts how many "elementary operations" some algorithm takes a function of the size of its input. In order to do that, one must agree about what kind of operations are elementary. There are several models for that, the "usual one" has the at first sight odd property that mathematical operations on integers of size O(log n) run in constant time. This is necessary to prevent the following problem: suppose you could only do operations on constant-length integers in constant time, and you want to manipulate an index into an array. That array has length n, so the index must have size (you guessed it) log n. It would therefore take non-constant space to even just have an index, and non-constant time to do anything with an index, which usually no one wants.
It should be clear from the n0 that big O notation explicitly says nothing about the behaviour of the function at any particular constant. It also says nothing about what happens when you double that constant, a mistake that is commonly made, leading to questions such as "it took x milliseconds for an input of size 10, how long will it take for an input of size 20" - you cannot know based on some big O.
Django_Untaken wrote: Let us suppose a simple array contains 25 elements So it should be clear by now that you can't say much about that situation. Bubble sort (and literally anything else) is going to take some constant number of elementary operations (aka "time") on that input, because there is no variable to vary. You cannot compute the number of operations based on the big O (but based on detailed knowledge of the algorithm, you can).
|
|
|
|