I see your point, Simon, anyway I've programmed this function and went with the following idea (for anybody who's interested).
1. I find the max and min of the set of times when people were last known to be home, then normalized these values between 0 and 1
2. I find the max and min of the...
Firstly the smallest number of houses visited would be zero which would mean zero travel-time...SOLVED! No the aim is to visit houses where people are in and not waste time traveling to empty houses
Then let's NOT assume that if a person is home at 2pm one day it means they'll be home at 2pm...
Yes, I just put this in for fun, and so people wouldn't make the argument about factoring in the travel time between each house.
Intuitively I'd say that if the last unsuccessful call was recent (say 20 minutes ago) and the last known time they were home was not (say 10 years ago), then it's...
I'm a salesman and I have a list of 100 addresses all equidistant from each other and from where I'm standing right now. (I know this is impossible in 3D space but just let's assume it is to make travel times equal). I only have time to call to 10 houses so I want to maximise the chances that...
I don't think you understand my question. I'm not concerned with sorting algorithms, I need a way of choosing which server to attempt to connect to based on the last time it was online and the time I last tried to connect to it.
I think I have it figured out though. As a general rule, if the...
I'm writing a piece of software and need to find an optimal algorithm for scanning servers. Basically I'm given a list of N IP addresses, each IP address has two associated datetime values: The time the server was last known to be online and the time of the last connection attempt.
Given these...
I was thinking about this problem last night, and I think I finally get it.
I'll do the vector addition part first:
Basically I need to show that 2 vectors: v and u (both elements of ker(T)) when added together will produce another vector (we'll call w). And w will itself always be an element...
I'm going to get really basic here because I have to understand this.
From what I understand: the kernel of a linear transformation T, from a vector space V to another vector space W, is:
A set of vectors
which all have the property that:
when "put through" T, they will come out at the...
Homework Statement
I've been stuck on this problem for a while, I actually have the answer (found it in my book), but I'm having trouble getting my head around the concept.
The question is:
Given a linear transformation T:V->W prove that kernel(T) : {vεV : TV=0W}
is a subspace of V...
Thank you,Well it all comes with experience.
And what exactly do you mean by an under-specified system? Is this a system with free variable(s)? Also when the det is equal to zero does this always mean either no solutions or infinite solutions but never 1 solution?
Homework Statement
Determine the value(s) of k for which the system
-2 1 -1 x 1
4 2 k . y = -4
k -1 1 z 2
(please excuse my formatting)
Homework Equations
The Attempt at a Solution
On my first attempt I tried making an augmented matrix and row-reducing...
Looking at my linear Algebra notes, there's something in here that says let "C" be the inverse of A
so
Let C be the inverse of A
so CA=AC=I
I'm given AB=I
B=IB (Identity property)
=> B=(CA)B (Substituton)
=> B=C(AB)
=> B=C(I) (Substitution of AB in place of I because it's given)
=> B=CI
=>...
I can't really conclude anything. There is only one matrix that can give the identity matrix when multiplied by A and that is A-1
Therefore B MUST be A-1
But this is stuff we were thought to assume to be true, anyway I just thought there might have been some neat quick way of proving it.
Homework Statement
A =
[
1 0 1 0
2 3 0 6
0 5 −5 0
0 0 0 2
]
Prove that if there is a 4 × 4-matrix B such that A · B = I4, then B = A−1.Homework Equations
The Attempt at a Solution
First of all I got the determinant of the matrix A which is -10
I'm just wondering if there's a shortcut to this...