text:
Thursday, November 18, 2010
A Google Interviewing Story
One of the first places I interviewed was a company called gofish.com. As far as I know - gofish is an utterly different company now than when I interviewed there. I'm almost sure that everyone I met there no longer works there, so the actual company isn't terribly relevant to the story. But the interviewer is. My technical interview there was with a guy named Guy.
Guy wore leather pants. Its a well-known fact that interviewers in leather pants are "extra" scary. And Guy was by no means a let down. He was also a technical crack-shot. And he was a technical crack-shot in leather pants - seriously, I didn't have a chance.
One question he asked me I'll never forget. In truth, its a pretty innocuous question - but it's also pretty standard fare for silicon valley interviewing questions at that time.
Here it is:
Say you have one string of alphabetic characters, and say you have another, guaranteed smaller string of alphabetic characters. Algorithmically speaking, what's the fastest way to find out if all the characters in the smaller string are in the larger string?
For example, if the two strings were:
String 1: ABCDEFGHLMNOPQRS
String 2: DCGSRQPOM
You'd get true as every character in string2 is in string1. If the two strings were:
String 1: ABCDEFGHLMNOPQRS
String 2: DCGSRQPOZ
you'd get false as Z isn't in the first string.
When he asked the question I literally jumped to my feet. Finally, a question I could answer with some confidence. (Note my answer to him was solely considering the worst cases as there are plenty enough nuances there for an interview question).
The naive way to do this operation would be to iterate over the 2nd string once for each character in the 1st string. That'd be O(n*m) in algorithm parlance where n is the length of string1 and m is the length of string2. Given the strings in our above example, thats 16*8 = 128 operations in the worst case.
A slightly better way would be to sort each string and then do a stepwise iteration of both sorted strings simultaneously. Sorting both strings would be (in the general case) O(m log m) + O(n log n) and the linear scan after that is O(m+n). Again for our strings above, that would be 16*4 + 8*3 = 88 plus a linear scan of both strings at a cost of 16 + 8 = 24. Thats 88 + 24 = 112 total operations. Slightly better. (As the size of the strings grow, this method would start to look better and better)
Finally, I told him the best method would simply be O(n+m). That is, iterate through the first string and put each character in a hashtable (cost of O(n) or 16). Then iterate the 2nd string and query the hashtable for each character you find. If its not found, you don't have a match. That would cost 8 operations - so both operations together is a total of 24 operations. Not bad and way better than the other solutions.
Guy wasn't impressed. He showed it by rustling his leather pants a bit. "Can you do better?" he asked.
What the heck? What did this guy want? I looked at the whiteboard and turned back to him. "No, O(n+m) is the best you have - I mean, you can't do this without looking at each character at least once - and this solution is looking at each character precisely once". The more I thought about it, the more I knew I was right.
He stepped up to the whiteboard, "What if - given that we have a limited range of possible characters - I assigned each character of the alphabet to a prime number starting with 2 and going up from there. So A would be 2, and B would be 3, and C would be 5, etc. And then I went through the first string and 'multiplied' each character's prime number together. You'd end up with some big number right? And then - what if I iterated through the 2nd string and 'divided' by every character in there. If any division gave a remainder - you knew you didn't have a match. If there was no remainders through the whole process, you knew you had a subset. Would that work?"
Every once in awhile - someone thinks so fantastically far out of your box you really need a minute to catch up. And now that he was standing, his leather pants weren't helping with this.
Now mind you - Guy's solution (and of course, needless to say I doubt Guy was the first to ever think of this) was algorithmically speaking no better than mine. Even practically, you'd still probably use mine as it was more general and didn't make you deal with messy big integers. But on the "clever scale", Guy's was way, way, (way) more fun.
I didn't get the job. Or I think they offered me some trial position or something that I refused, but it didn't matter. I was on to bigger and better things.
Next, I interviewed at become.com. After a phone interview with the CTO he sent me a "programming assignment". It was a bit over the top - but in retrospect, worth the 3 days it took me to complete. I got an interview and a job offer - but the biggest value was what the programming assignment forced me to go out and learn. I had to build a web-crawler, a spellchecker/fixer, and a few other things. Good stuff. In the end however, I turned down the offer.
Finally, I had an interview at Google. I've written before that the Google interviewing process does tend to live up to the hype. Its long - its rigorous and in all honesty, pretty darn fair. They do as best they can to learn about you and your abilities in an interview setting. By no means is that an exact science, but I'm convinced they give it a good try.
My 4th technical interview at Google was with a woman engineer that honestly seemed a bit bored of interviewing. I had done well in all my previous interviews there and was feeling pretty good about my chances. I was confident that if I did nothing ridiculously silly - I'd get the job.
She asked me a few softball questions about sorting or design, I'm not sure. But towards the end of our 45 minutes she told me "I have one more question. Let's say you have a string of alphabetic characters of some length. And you have another, shorter string of characters. How would you go about finding if all the characters in the smaller string are in the larger string?"
Woah. Deja-Guy.
Now, I could have probably stopped the interview right there. I could have said "Ahee! I just got this question a few weeks ago!" which was true. But when I was asked it a few weeks previous - I did get it right. It truly was a question I knew the answer to. Almost as if Guy had been one of my study partners for this very interview. And heck, people study interview questions on the internet all the time - by me non-chalantly answering the question I wouldn't be "lying" in any way. I did know the answer on my own!
Now you might think, that in the instant after her asking, and before the moment of time that I began speaking that the entire last paragraph sequenced through my thought process rationalizing that I was, indeed, morally in the right to calmly answer the question and take credit for the answer. But sadly, that wasn't the case. Metaphorically, it was more like she asked the question and my brain immediately raised its hand and started shouting "Me! ooh! ooh! ooh me! I know! ask me!" My brain kept trying to wrestle mouth-control away from me (which happens plenty) but only by stalwart resolve was I able to retain composure.
So I answered. Calmly. With almost unearthly grace and poise. And with a purposeful demeanor - with, I think, a confidence that only someone with complete and encyclopedic knowledge of this timeless and subtle problem would hold.
I breezed over the naive solution as if it were unworthy. I mentioned the sorting solution as if it were wearing a red-shirt on an early episode of Star Trek. And finally, nonchalantly, almost as if I had invented all things good and algorithmically efficient, mentioned the O(n+m) linear solution.
Now mind you - despite my apparent poise - the entire time I was fighting my brain who, internally, was screaming at me -- "TELL HER THE PRIME NUMBER SOLUTION YOU DIMWIT !"
I ignored his pitiful pleas.
As I finished the linear solution explanation, her head dutifully sank with complete non-surprise and she started writing in her notes. She had probably asked that question a hundred times before and I'd guess most people got it right. She probably wrote "yep. boring interview. got boring string question right. no surprise. boring guy but probable hire"
I waited a moment. I let the suspense build as long as possible. I am truly convinced that even a moment longer would have resulted in my brain throwing itself fully into an embolism resulting in me blurting out unintelligible mis-facts about prime numbers.
I broke the calm. "You know, there is another, somewhat cleverer solution"
She lethargically looked up with only a glimmer of hope.
"Given that our range of characters is limited. We could assign each character to a prime number starting at 2. After that we could 'multiply' each character of the large string and then 'divide' by each character of the small string. If the division operation left no remainder, we'd know we have a subset."
I'm guessing that at this point, she looked pretty much as I did when Guy had said the same thing to me. General loss of composure, one pupil was dilated, slight spitting while talking.
After a moment, she blurted "But.. wait that wouldn'... yes it would! But how.. what if.. wow. wow. that works! Neat!"
I sniffed triumphantly. I wrote down "She gave me a 'Neat!'" in my interviewing notes. I'm pretty sure I was getting the job before that question, but it was pretty clear that I was in for sure now. What's more, I'm pretty confident that I (or more precisely, Guy) had just made her day.
I spent 3 years working at Google and had a great time. I quit in 2008 to CTO a new startup and have subsequently started another of my own after that. About a year ago I randomly met Guy at a start-up party who had no idea who I was but when I recounted this story he nearly peed his leather pants laughing.
Again, if there is a moral here - it's to never chase your dream job before you chase a few you're willing to fail at. Apart from the interviewing experience you'll gain, you never know who might just get you ready for that big interview. In fact, that rule just might work for a lot of things in life.
And seriously, if you get the chance and you're looking to hire a crackshot engineer - you could do far worse than hiring Guy. That dude knows things.
(a bit of nitpicky technical detail for the fusty: characters may repeat so strings can be very long and thus counts must be kept. The naive solution can remove a character when it finds it from the large string to do that but its remains O(n*m). The hashtable solution can keep a count as the value of the key->value. Guy's solution still works just fine)
Edit: 11/30/10 - Guy from the story has found this post and gave some clarification in the comments. Worth the read.
50 comments:
Guy's solution is strictly worse than having two arrays of size 26 with counts of how many 'A's, 'B's, ..., 'Z's are there in each string. Those can clearly be filled in linear time, and a single pass through them in constant time (assuming a constant alphabet size) allows us to determine if one string is a subset of the other.
The reason Guy's solution is strictly worse is because you are going to need big integers to represent the constructed product of primes once the strings get large enough (you already need it for a string that has 10 'Z' characters, for example), and big integer multiplication and division can't really be assumed to take constant time: their complexity is proportional to the number of digits of the number; all you can do is pick a large enough base to make the number of digits a bit smaller.
That's original, but not practical.
You have to either use a hash table for primes or be forced to use bignums.
Division is relatively expensive, and you'd be doing O(m) of them. I think it would be better to assign each of the 26 characters to the lower 26 bits of an integer, then OR the bitmasks together as you traverse the first string. As you process each character of the second string, AND its bitmask with the result from the first string to see if it's there. ANDs and ORs are much quicker, and this method will take constant space. (Multiplying the primes in the first string risks integer overflow for sufficiently lengthy strings.)
Interesting solution using algebraic properties of prime numbers. Don't you think, however, that it's a little unpractical?
1) you have to precompute the prime numbers for all characters or add the n-th prime computation complexity to you problem's complexity
2) assuming only uppercase letters you'd need at least 26 prime numbers which means value 101 for Z. If my quick estimate is correct, you could overflow the 64bit integer with 10 character string. Sure, you could use something as Java's BigInteger but then the math is more complex and adds to the overal complexity of the solution
3) code would be hard to understand by anyone else than the author (yes, I've heard of the invention of commenting code, but this still is a valid point).
Don't get me wrong, I liked the idea behind Guy's solution, but even now (knowing his solution) I wouldn't use it in my code, would you?
- Otto said...
The prime number solution would be faster if the larger string was a constant that you were comparing to often. Then it's O(m).
However, division of large numbers is an algorithmic pain in the ass as well, so you'd have to take that into account for any real-world use case.
Why use a hashtable when an array would work perfectly well? Or did I misread part of the problem?
also, regarding the bitmask one from above, it requires variable shifts which on some hardware stall the *entire* core (all threads)
cleverness almost never gets you where you want to be.
- Tom Jiang said...
Interesting story, Paul, but I have to agree -- a bit mask would beat both the multiplication and the hash-table solution, if you don't need to keep counts.
Previous commenters seem to be missing the point- any good dev can come up with the right answer. A great dev can think of alternate solutions outside the box. It isn't about finding the right or best answer. It's about creativity.
Instead of using multiplication, you could use a bit-shift and OR. Then instead of division, you do an AND.
Assuming the number has enough bits for the limited character set, it will work (and it's faster than division). Also, you can fit 32 chars optimally into a 32-bit integer, while 32 primes will require a larger integer.
You should note that Guy's solution becomes very slow and problematic if you use unicode which the number of characters is so large than division becomes non-trivial, and generating the prime number array is a task in itself.
Again, if there is a moral here - it's to never chase your dream job before you chase a few you're willing to fail at......wow this is so true...for too many other things....you give me hope....
If it really is a string of alphabetic characters, then assign each letter of the alphabet a bit and build masks from the long string and the short string.
Then just bitwise compare the masks to see if any characters overlap.
It's still O(m+n), but each operation will be much faster than loading or reading from a hash.
It's also extremely space efficient. Each string could be stored as a single 32-bit integer, so the algorithm only requires 8 additional bytes of storage. (4 if you don't need to keep the encoding of the short string.)
Once the initial encoding of a string is done, any comparisons with previously encoded strings will be done in constant time.
In addition to the problems mentioned earlier, how are you going to store the mapping between characters and prime numbers? Assuming that there can be an arbitrary number of characters, you need to store which character 2 maps to, which one 3 maps to, which one 5 maps to, etc.
Then, when you do the division, you may need need to lookup each character's mapping once. If you don't store the mappings in a hashtable, the best you're going to get is logarithmic time for the lookups, which is no better than the sorting solution.
If you do store them in a hashtable, then the solution is basically exactly the same as the pure hashtable solution, except that it will be slower.
In short, the prime solution is worse than the other solutions in terms of run time and it involves the same data structures being used in pretty much the same ways, so I would say it is neither clever nor fast.
Also, your runtime analysis assumes that hashtable lookups are constant time. In practice, they will tend to be constant-ish, but technically, they can take linear time in the worst case. This means that the best solution in terms of worst case performance is the sorting one.
I actually used a very similar trick when I was 14 or 15 to store names => phone number relationships in TI-BASIC. The TI-82 lacked proper string handling so I decided that A would be 2, B would be 3, etc... Typing SARAH on input would yield the number S*A*R*A*H. I stored two separate arrays (one with the product of the and another with the phone number) as a crude hashmap.
When I thought of this I felt a bit like Guy. It worked since most names weren't an anagram of another name.
The search was linear but hey, I hadn't that much friends to register anyway :)
- Gleb Kurtsou said...
Why nobody suggests using a bit set. In this case 26 items would fit in a single int.
- Christian Nunciato said...
Good read, thanks for sharing!
Did guy have an australian accent? Because that would certainly up the scariness
- Ralph said...
The product of the primes is effectively an array with a zero or 1 at each location. Multiplying by a prime is just a way to set the corresponding array location to a 1. Testing the product for divisibility by a prime is just a way to read the contents of the corresponding array location. The hash table in this case reduces to a simple array, so the two solutions are identical up to implementation details.
Thanks for this post. I had to learn this the hard way. My first interview in over 8 years was at what I consider my dream job. I felt like somebody smacked me with a wet trout 3/4 of the way through the second round of interviews. The questions headed in a direction that I never imagined. Needless to say, I did not get the position. But I did learn that I need to prepare myself a bit with some interviews I don't care as much about before moving on to the dream interviews.
- Infenwe said...
Copy/pasting my answer from reddit:
I'm surprised noone has mentioned the obvious algorithm for solving this problem.
We use Counting-Sort(A,B,k), i.e. A is the input to be sorted, B is the sorted output, and k is the number of different elements that are allowed to occur in A. Counting-Sort is Θ(n+k). In our case k is the constant 26, so Counting-Sort runs in Θ(n) time.
Make arrays A' and B' with lengths equal to resp. A and B.
(a,b) <- (1,1)
while b ≤ length(B') do
if B'[b] < A'[a] then
return False // e.g. A' = [B,C,D,...], B' = [A,B,C,...]
if B'[b] > A'[a] then
a <- a+1
if B'[b] = A'[a] then
(a,b) <- (a+1,b+1)
return True
Obviously the question is asking for Subset(A,B,[a..z]) where length(B) ≤ length(A). It's easy to show that this has running time Θ(length(A)).
PS: Damn this bleep to bleep for not allowing bleeping pre or code tags.
What's the computational complexity of this fancy algorithm?
HINT: It's >> O(M+N)
Thanks for sharing.. :)
- rick said...
Gödel numbers. See also incompleteness theorem. One of the cooler things that are part of any basic computer science curriculum.
Now, we know that there are 25 prime Numbers less than 100, so number 26 must be... 101. This means any time you're multiplying by z, you're adding two decimal digits to the length of your decimal number.
And 2^10 is approximately 10^3. So if you ran into Z three times in the string you'd have added 20 bits to the length of the integer ((10^2) x 3 = 10^6 = 2 x 10^3 ~ (2 x 2^10) = 2^20)...
...once you play around with Gödel numbers you realise that they get super ridiculously large very quickly.
Simply multiplying all of the alphabet once would give 2.32862e+38 (according to my spreadsheet), a number 16 Bytes long (128 bits). We could say that on average each new letter adds almost 5 bits to the length of the number. On average, a string of 7 characters will make your naive implementation of the algorithm cack itself (!!!), even if you were cunning and used a long instead of an int, it would still cack itself at 14 characters (on average).
Anyway, I like the hashing solution better, and the idea about using two 32 bit ints with each bit as a flag for a character, and then just OR them (no division, no hash collisions).
In any case, it is instructive to see what happens when you expand the range slightly, lets say you treat upper case and lower case separately. The Gödel numbering solution gets enormously worse, the hashing algorithm it isn't a problem, and depending on how you did your bit flagging ops the int flag just expands to a long flag.
Start looking at a wider range, like ascii, or the values on your keyboard, or latin + greek, or, heaven forbid, some large subset of unicode, and suddenly the hashmap is really the only practical way to do this....
...except that for relatively short strings, you might actually fall back on the 'naive' (sorting) solution as being simpler, easier to implement and much easier to maintain and/or localise. Depending on the overhead imposed by the hashmap, it might even be faster.
- Jamie McCarthy said...
"what's the fastest way to find out if all the characters in the smaller string are in the larger string?"
Any solution for this that always scans the entire larger string is incorrect.
Consider the case where the smaller string is the single letter "A" and the larger string is a long string that starts with "A." Your algorithm can return true after reading two characters.
Guy's solution is just silly. Its only use seems to be in interviews, where you can ask the potential hire to explain why it's inappropriate. What if the small string is "A" and the large string is "A" followed by a trillion "Z"'s? A trillion multiplications and divisions, and several trillion bits of storage, right?
Try this: If these are really alphabetic uppercase characters, and the smaller string is a set (repeats ignored), it fits in a 26-bit bitmask, which fits in a single CPU register. Load it up with 1's for every character in the smaller string, and scan the larger string masking off ~(1 << (ord(x)-65)) for every letter found. Return true as soon as the register is zero, false if it's nonzero after the larger string is scanned.
I hope that you complete the series ... cause i want really this story ,,, thanks a lot :)
- Andres Santana said...
I'll do it with just one array of flags for each letter.
public static void main(String[] args) {
String s1 = "ABCDEFGHLMNOPQRS";
String s2 = "TDCGSRQPOM";
boolean[] b = new boolean[26];
// fill array
for (char c : s1.toCharArray())
b[c - 'A'] = true;
boolean res = true;
for (char c : s2.toCharArray())
if (!b[c - 'A']) {
res = false;
This advice works for pursuing women, too.
Great post!!! I kinda liked d humor that graced the post.. Your points are very much valid..
- Jim said...
set intersections?
str1 = "ABFKSOOKERWWERKEKFSLDFKVVMXASDFAF"
str2 = "ABDV"
if len(set(list(str1)).intersection(list(str2))) == len(str2):
print "String 2 is fully included in String 1"
print "Not true"
- Ralph said...
Jamie McCarthy, you are correct, of course, about not needing to scan the whole first string all the time. However, there will always be a worst case in which you do have to touch every character in the first string. In academic computer science algorithm study, it is often desired to calculate the worst case performance, even if this is not a situation likely to be encountered in the real world. I think that is the desired assumption for this problem.
good read.. thanks for posting.
And for all of you with your brilliant solutions, the solution to the problem is not the point of this blog i think!! you guys are way too geeky :(
- mudeltasigma said...
I keep seeing comments on how the prime number solution is not practical. I found it the most practical and efficient solution to a particular problem that I had about 15 years ago. I would be interested if someone can supply a more efficient solution. In short, the problem is to write a python script that given a file of common English words (eg. /usr/dict/words) will find all words that can be made from a 9-letter word (eg. 'chocolate'). I have written a short blog about my results.
nice story, thanks for sharing
- Gaurav said...
I think I have a better solution.
create an array of 26characters and initiate it to 0.
now while reading first (big) string:
set the value of each character (found in string) to some value say 1.
a[(char)-65] = 1; (Reducing ASCII)
now while reading second string:
chk = chk * (a[(char) - 65])
where variable chk has initail value of 1. Now whenever value of chk reaches 0, first string is not part of second string.
So the worst case is m+n.
Using sets would of course miss the entire point. It would inform someone you know of a language feature, not that you have any clue what goes on.
Besides that, you even apply it inefficiently:
would save you 2 length calculations, 1 comparison and an superfluous list.
Doesn't it bother anyone here that Paul knew the answer ahead of time and didn't admit that he knew it?
I expected this story to end with Guy, now working for Google, walking in at the end of the interview...
I think any moral answer should start with "I just encountered this exact problem recently..." to let the interviewer know you're reciting rather than inventing the answer.
- Guy Argo said...
I'm the Guy in the leather pants. :)
Thanks - that's the nicest compliment I've been paid in a long time. I'm also impressed that you gave me due credit for my prime solution. Respect! Your account is pretty much on the money.
Let me clarify a few things for your readers:
- I would never expect anyone to come up with this solution in an interview situation (and no-one ever has) - the purpose was to see whether the candidate could understand the solution and tell me something about its pros and cons.
Until this blog post, they were extremely unlikely to have encountered this solution prior.
- My version of the question starts out by restricting the input to seven letters (for Scrabble) and it was assumed you'd discard any word longer than the rack or shorter than the current best solution so a 32-bit word suffices with some finesses hinted below.
What I love about this interview question is how such a seemingly innocuous problem can have such a variety of obvious and not so obvious solutions. (Candidates who think a bitmask alone would suffice, don't understand the distinction between a bag and a set.)
I've also noticed that after I showed the candidate my solution, they were invariably a lot more interested in working with me - sometimes the interview process is as much about impressing the candidate as it is about the candidate impressing the interviewer.
- Guy Argo said...
continued from previous comment...
There are a couple of extra credit questions I ask if I have time:
- How can you optimize the mapping of letters to primes?
- Can you suggest a way to combine the prime representation with a bitmask to improve performance?
- What changes would you need to make if we allow the rack of letters to be of arbitrary size?
- If you had to perform this test for many different racks of letters, how would you change the representation of the dictionary?
- How practical is it to cache the answers for racks of letters that you've seen already?
- Could you precompute this cache?
Thanks again for the mention. And I'm glad my solution helped you make a big impression on Google. I never regretted hiring any of the candidates who could grasp this solution. I'm just sad we couldn't make you a compelling offer. GoFish went down the toilet so if definitely worked out best for Paul. LOL
Guy Argo
p.s. I retired the leather pants after the motorcycle accident, alas.
But they did save my skin...
You should have told Guy that's his solution was utterly stupid. Turning such a simple question into a messy thing that requires big numbers. You don't need to be crazy to be creative!
- Full Decent said...
I didn't read the question as requiring counts. I was thinking
bits[256] = {0,0,0,0,...,1,2,4,8,16,...};
On a 32 bit machine with uppercase letters, lookup letters on string 1 and OR them. And then lookup letters on string 2 and AND each with the result.
- Hy said...
Am I missing something, the prime number method does not work if there are more than one instance of "A" or any letters.
- George said...
I have no comments about what's the best solution, but that story is awesome.
- ←ЯAIHAN || MAZUMDER→ said...
Nice Story.. :)
- Eric Bäcker said...
Cool story, bro. I liked your writing style.
- Zaheer said...
Hi Paul,
I really really enjoyed this post. Very well written and the insights were amazing. Guy's solution really blew me away at first - very unique. I featured this interview question in my side project recently and while looking up different solutions did not come across Guy's solution once. It definitely is out of the box and interesting.
A little on my side project: I recently launched a service that emails you a new technical interview question every other day. I think you and your readers might be interested in it. I thought I'd share it with you and would love to get your expert feedback! Here's the site with more info: InterTechTion - Technical Interview Questions
Once again thanks for the great article and wish you success on your latest startup!
- Xiaonan Ji said...
While some of you focus on the right or wrong of any of the answers posted in this article, my biggest take-away is that if you want to do one big thing and want to do it as much right as possible, try to do some small things that you can afford to lose beforehead. As Paul said, this is true for interviews but may be true for many other things.
And Guy's comment said things very clear. His purpose of providing his solution is 1st, see whether the interviewees can understand it and tell pros and cons and 2nd, to impress the interviewees. To all of us the 1st purpose is well served and to many of us the 2nd purpose is achived in some degrees. That makes his tactic logically sound. Full stop.
Can't believe someone even tries to argue multiplication overflowing and using big integers. Completely miss the point. Typical nurd response. (Sorry for being rude)
- TJ said...
I hope Guy's question was an attempt to see whether you'd speak up about a really stupid idea. His approach fails both from a computational complexity point of view and from a speed point of view. If you assume the kind of arithmetic he assumes, you might just use bitsets, and you can even express those using integer arithmetic.
x = logical_or.reduce([(1<<ord(c)) for c in "ABCDEFG"])
y = logical_or.reduce([(1<<ord(c)) for c in "ABCDE"])
result = ((x&y)==y)
In addition, to any experienced programmer in the 21st century, "character" means "Unicode character"...
And as the developers spend an unknown amount of time finding the best solution... The competition has beat you in the 'time to market' game and snapped up your potential clients. Perfection and fine tuning of algorithms have their time and place. In the end business is about profits and making money.
Most of you are doing this problem backwards.
You can beat O(n+m) on average for matches, only failure-to-match is provably O(n+m).
You walk the *second* string first, mapping it's characters into a hashmap or bitset.
Then you walk the first string, removing each character from the set once it's seen. When the set is empty you stop and return subset-match. If you reach the end without emptying the set, you return mis-match.
For a sort-based solution sorting the second, smaller string is good enough!
Then the complexity would become ((m+n)log(n)) + n


text:
Welcome to COMER Security Systems (ww w.holderprotection.com), one of the Chinese leading suppliers of exhibition equipment and smart home products. With many years experience of supplying an extensive range of exhibition stands and display equipment, we have refined our range to bring you the very best in quality, modular exhibition security display solutions. (www.smartcomer.com, skype ID: securitydisplaystand) (Email: email@example.com)
We manufacture:
Security retail display products:
cell phone display holder, mobile phone mounting , security tablet
display mount devices, security laptop cable lock, security alarm
system. Mobile Phone Security Stands, Alarm System, tablet cable
lock, smart watch security, Camera Display Holder, security mobile
display, pad display holder, camera security stands, tablet holder,
tablet alarm stands, display racks, SECURITY MOBILE PHONE, SECURITY
CAMERA, SECURITY TABLET PC, ALARM SYSTEM, display system, phone
mount, cellphone bracket, smart phone holder, security systems for
mobile phone, laptop computer security cable locks, anti theft
devices, retail secure display, security control for mobile phone
with 4 ports, 6 ports and 8 ports, security hook display locks
Dongguan Comer Electronic Technology Co., Ltd.
COMER wall mount anti-theft lock for tablet ipad in shop, hotels, restaurant
display holder fit for IPAD air ipad pro 9.7, IPAD2, IPAD3 and
IPAD4, NOTE: no alarm function
Material: Aluminum alloy ,Surface treatment: painting
Color: silver, Note: No alarm.
Size:24.7*19.5*1.0CM .
COMER wall mount display brackets for tablet ipad in shop, hotels, restaurant Images
Home| Products| Suppliers| Quality Suppliers| Site Map |About Us |Contact Us |Help |关于我们 |联系我们
Copyright © 2009 - 2019 airmaxssale.com. All rights reserved.

subset: commoncrawl


text:
Gift Planning
Gift Planning
SIU Foundation
Main Content
Wednesday October 23, 2019
Washington News
Small Business TCJA Tax Changes
In IR-2018-2003, the IRS reminded small business owners that the Tax Cuts and Jobs Act (TCJA) includes many changes that may reduce or change their taxes. While there are approximately two months left in the calendar year, many small businesses may still benefit from making changes before December 31.
- Qualified Business Income Deduction - The 20% deduction for qualified business income (QBI) will be available for 2018 federal income tax returns. The Sec. 199A deduction is generally available to pass-through businesses. More information is available through the Sec. 199A frequently asked questions (FAQs) on www.IRS.gov. There are complex phaseout rules for business owners with higher-income levels.
- 100% Expensing - Most depreciable assets may be deducted if they are placed in service during 2018. The 100% depreciation deduction generally is applicable for machinery, equipment, computers, appliances and furniture with a recovery period of 20 years or less.
- Entertainment and Meals - Many of the prior deductions for business expenses related to entertainment, amusement or recreation were reduced or eliminated. There is still a 50% deduction for the cost of business meals if all IRS requirements are met and meals are provided to a current or potential customer, client, consultant or other business contact.
- Transportation - Most deductions for fringe benefits related to transportation or commuting have been eliminated. An exception may apply if the transportation expense is necessary for employee safety.
- Bicycle Commuting - Employers may deduct qualified bicycle commuting reimbursements. While this is a qualified business expense for the employer, the employee will report the reimbursement as wages.
- Moving Expenses - Most moving expenses in 2018 are now taxable income for the employee.
- Estimated Taxes - If a sole proprietor, partner or subchapter S corporation shareholder has substantial income, he or she may be required to make quarterly estimated tax payments. Taxpayers are excluded from estimated payments if they owe less than $1,000 in tax in 2018 or had no tax liability in 2017 (with some limitations). The IRS website has a "Pay As You Go" page and also Pub. 505, Tax Withholding and Estimated Tax. The website and the publication may help business owners determine whether they will need to pay estimated taxes.
Published October 19, 2018
Previous Articles
Social Security Benefits Increase by 2.8% in 2019


text:
Top Items:
Nate Silver / FiveThirtyEight:
Democrats Are Way More Obsessed With Impeachment Than Republicans — House Speaker John Boehner said Tuesday that Republicans have no plans to impeach President Obama, and that all the impeachment talk was driven by Democrats hoping to stir up their base. — Boehner's statement isn't literally true …
Discussion: The Atlantic Online, RedState, PJ Media, Bloomberg View, National Review, Politico, Yahoo! News, CNN and NationalJournal.com
David A. Graham / The Atlantic Online: 21 Emails From the Democratic Party About Impeachment
Dan McLaughlin / RedState: Obama Peddles Impeachment Conspiracy Theories To Raise Money
Jonathan Bernstein / Bloomberg View: Impeachment Idiocy's Republican Enablers
Edward-Isaac Dovere / Politico: W.H. mum on impeachment fundraising
Ron Fournier / NationalJournal.com: When Impeachment Becomes Fundraising Bait
Amie Parnes / The Hill:
Obama to GOP: Stop hating — President Obama asked Republicans to stop "hating" and "being mad all the time" during a Wednesday speech in Kansas City, Mo., focused on the economy. — The president accused GOP lawmakers of needlessly suing him, instead of doing their jobs.
Discussion: Politico and Taegan Goddard's …
Kendall Breitman / Politico: Obama to GOP: Stop hating
Igor Volsky / ThinkProgress:
House Republican Insists He's Not Considering Impeaching Obama, Then Admits He Is, All In Less Than 60 Seconds — Since Sarah Palin called for impeaching President Obama earlier this month, most Republican lawmakers have distanced themselves from her comments and blamed Democrats for seizing on the issue to grow their campaign coffers.
Discussion: Slate, Bloomberg View, his vorpal sword, The Huffington Post, ABC News, Democratic Policy & …, CBS News, Washington Post and BuzzFeed
David Weigel / Slate: The conservatives who wanted to impeach Obama are acting like it was never their idea.
Albert R. Hunt / Bloomberg View: Why Shouldn't Democrats Fan the Impeachment Flames?
Hart Williams / his vorpal sword: If It Bit Them In The Posterior ... The GOP Poster Boy: And he'll lie to you about it ...
Sara Bondioli / The Huffington Post: Steve King Was For Impeachment, Before He Was Against It, Before He Was For It
Democratic Policy & Communications Center: Despite Speaker's Claims to the Contrary, Dozens of Republicans Irresponsibly Float Impeachment
Rebecca Kaplan / CBS News: John Boehner: Obama impeachment talk a Democratic scam
Philip Bump / Washington Post: Impeachment talk is back. Here's a timeline of how we got here. Again.
Andrew Kaczynski / BuzzFeed: GOP Congressman: Would Be "Dream Come True" To Submit Obama Impeachment Bill
Josh Israel / ThinkProgress:
House Republicans Vote To Sue Obama
House Republicans Vote To Sue Obama
Discussion: Daily Kos and Associated Press
Susan Gardner / Daily Kos: House Republicans vote to sue Obama over hated healthcare law not implemented fast enough
Robert Costa / Washington Post:
Cruz whipping tonight against Boehner border bill
Cruz whipping tonight against Boehner border bill
Discussion: CNN, Talking Points Memo and Hot Air
Ted Barrett / CNN:
Senate votes to start debate on emergency border bill
Senate votes to start debate on emergency border bill
Discussion: Politico, The Hill, Immigration Impact and The Daily Caller
Burgess Everett / Politico: Dem border strategy: immigration reform
Amanda Peterson Beadle / Immigration Impact: House Hearing Exploits Children's Misery, Highlights Ideological Differences
Bob Cusack / The Hill:
GOP lawmaker: No to Obama lawsuit
GOP lawmaker: No to Obama lawsuit
Discussion: Talking Points Memo
Michael A. Memoli / Los Angeles Times:
Boehner rules out impeachment, but Democrats cash in on the threat
Boehner rules out impeachment, but Democrats cash in on the threat
Discussion: Washington Post, Liberal Values, Independent Journal Review and National Review
Chris Cillizza / Washington Post: Impeachment talk is the dumbest possible move for Republicans
Caroline Schaeffer / Independent Journal Review: Truth Bomb: Speaker Boehner Calls Out Democrats' Impeachment Fundraising For What It Really Is
Andrew Johnson / National Review: More Evidence of the Left's Drumming Up Impeachment Talk
Stephen Ohlemacher / Associated Press:
Former IRS Official Called GOP 'Crazies' in Email — A former IRS official at the heart of the agency's tea party controversy called Republicans "crazies" and more in newly released emails. — Lois Lerner used to head the IRS division that handles applications for tax-exempt status.
Discussion: CNN
Dana Davidsen / CNN: Emails show Lerner dissing conservatives
Rachael Bade / Politico:
Lois Lerner email: Some in GOP 'crazies'
Lois Lerner email: Some in GOP 'crazies'
Discussion: Business Insider
Camp Sends More Evidence of Criminal Wrongdoing to DOJ
Camp Sends More Evidence of Criminal Wrongdoing to DOJ
Discussion: Daily Signal, Hit & Run, Independent Journal Review and Hot Air
Melissa Quinn / Daily Signal: In IRS Emails, Lois Lerner Calls Conservatives 'Crazies' and ... Worse
J.D. Tuccille / Hit & Run: The Problem Isn't That Lois Lerner Doesn't Like Conservatives, It's That the IRS Gave Her a Weapon Against Them
Soopermexican / Independent Journal Review: Smoking Gun: Newly Surfaced Email Shows Concrete Evidence of Lois Lerner's Feelings on Conservatives
David Frum / The Atlantic Online:
An Apology: On Images From Gaza — I questioned the authenticity of a photo from Khan Younis hospital. It was a mistake. — I made a mistake earlier this week in a series of Twitter posts. It's not a mistake to which Atlantic editors were party in any way.
Discussion: Politico, Thomas Wictor, VICE, Mediaite, Firedoglake, The Huffington Post, The Dish, LobeLog.com, Pressing Issues, New York Times, Poynter and BAGnewsNotes
Dylan Byers / Politico: David Frum apologizes for Gaza skepticism
Evan McMurry / Mediaite: David Frum Apologizes for Accusing News Agencies of Running Faked Gaza Photos
DSWright / Firedoglake: David Frum Accuses New York Times And Reuters Of Faking Gaza Hospital Photos
Jack Mirkinson / The Huffington Post: David Frum Retracts Claim That NYT Ran Faked Gaza Photo
Andrew Sullivan / The Dish: Correction Of The Day II … It's an honorable apology and correction.
Ali Gharib / LobeLog.com: David Frum's Sources
Greg Mitchell / Pressing Issues: David Frum Axes Evil (or So He Thought)
James Estrin / New York Times: Photographing on the Ground in Gaza
Kristen Hare / Poynter: NYT says its Gaza photos are real
David Wasserman / Washington Post:
The most frightening candidate I've met in seven years interviewing congressional hopefuls — As a House analyst for the nonpartisan Cook Political Report, I've personally interviewed over 300 congressional candidates over the course of seven years, both to get to know them and evaluate their chances of winning.
Discussion: Business Insider, The Daily Caller, Washington Monthly, Liberaland and The Raw Story
Colin Campbell / Business Insider: Louisiana Republican Flees Interview When Asked About Obama's Birthplace
Alex Pappas / The Daily Caller: Conservative Female Candidate Fires Back After Analyst Calls Her 'Frightening'
Ed Kilgore / Washington Monthly: Fleeing the Scene of the Crime
ABC News:
US Condemns Shelling of UN School in Gaza — The White House condemned the shelling Wednesday of a U.N. school in the Gaza Strip that was sheltering Palestinians displaced by the fighting between Israel and Hamas militants in Gaza. — The U.S. didn't assign responsibility for the shelling …
Discussion: Rush Limbaugh and Gawker
Washington Post:
Israel presses attack; 20 killed at U.N. school
Israel presses attack; 20 killed at U.N. school
Discussion: Outside the Beltway and Hot Air
Doug Mataconis / Outside the Beltway: Despite International Pressure, Israeli Public Supports Netanyahu On The War In Gaza
Christopher Gunness / UNRWA:
Discussion: Global Voices, New York Times, emptywheel, Mondoweiss, ThinkProgress, Guardian, Israellycool, Pressing Issues and The Huffington Post
Sahar Habib Ghazi / Global Voices: As Another School and Shelter in Gaza is Bombed, a UN Spokesman Breaks Down in Tears in a Video Interview
Alex Kane / Mondoweiss: 'Children killed in their sleep': Israeli artillery fire hits UN school, killing at least 20
Alexandra Topping / Guardian: Gaza crisis: US condemns fatal attack on UN school, says culprit unknown as it happened
Greg Mitchell / Pressing Issues: Wednesday Updates (From the Top) on Gaza-Israel Tragedy
Charlotte Alfred / The Huffington Post: UN Official Chris Gunness Breaks Down On Air After School Bombing
Nathan Schacht / Media Trackers:
Secretive Leftwing Network Discovered through WI Records Law — A low-profile Google Group used by over 1,000 state and national leftwing leaders and activists has been discovered thanks to Wisconsin's open records law. A Media Trackers inquiry into the actions of a University …
Discussion: RedState and Vox Popoli
Damian Paletta / Wall Street Journal:
Paul Ryan on Immigration, Inversions, Impeachment and 2016 — House Budget Committee Chairman Paul Ryan (R., Wis.) weighed in on virtually every issue percolating in Washington Wednesday, from immigration to impeachment, during a wide-ranging breakfast with reporters hosted by the Christian Science Monitor.
Discussion: National Review and Washington Post
Sahil Kapur / Talking Points Memo:
Paul Ryan: I'll Consider Presidential Run After 2014 Elections
Paul Ryan: I'll Consider Presidential Run After 2014 Elections
Discussion: Booman Tribune
BooMan / Booman Tribune: Casual Observation
David Dayen / Salon:
Rick Perlstein: "Ronald Reagan absolved America almost in a priestly role not to have to contend with sin. The consequences are all around us today" — From climate change to foreign affairs, Reagan pushed America toward easy lies, just as reckoning seemed possible
Discussion: Brad DeLong's Grasping Reality
Sam R. Hall / The Clarion-Ledger:
Hood calls out 'political blogger' in pay-to-lie scheme — PHILADELPHIA — Attorney General Jim Hood said his office is investigating whether a "political blogger" paid a Meridian man to lie about a vote-buying scheme. — During his speech at the Neshoba County Fair …
Discussion: Talking Points Memo, Little Green Footballs and Mediaite
Tom Kludt / Talking Points Memo: Charles C. Johnson Openly Wonders If He'll Be Assassinated Over Cochran Coverage
Little Green Footballs: MS Attorney General Says Blogger Chuck C. Johnson Paid a Pastor to Lie About Thad Cochran
Mitch Ginsburg / The Times of Israel:
3 IDF soldiers killed in booby-trapped UNRWA clinic — Forces were trying to safeguard building before demolishing a tunnel there when device exploded, also injuring 15 other troops — Three IDF soldiers were killed on Wednesday in an explosion at a booby-trapped UNRWA health clinic that housed the opening of a tunnel.
Discussion: Business Insider, Israel Matzav, The Jawa Report and The Gateway Pundit
Armin Rosen / Business Insider: Israel's Tech Scene Is Having A Banner Week Despite Horrific Israel-Palestinian Violence
Carl / Israel Matzav: 3 IDF soldiers killed in booby-trapped terror tunnel beneath...what else?... an UNRWA clinic
DMartyr / The Jawa Report: UN Health Clinic Hid Tunnel Entrance; Booby-Trap In Building Kills Three IDF Soldiers
Ricardo Alonso-Zaldivar / Associated Press:
PROBE EXPOSES FLAWS BEHIND HEALTHCARE.GOV ROLLOUT — FILE - This Nov. 5, 2013 file photo shows Medicare chief Marilyn Tavenner testifying on Capitol Hill in Washington. Management failures by the Obama administration set the stage for the computer woes that paralyzed the president's …
Discussion: The Daily Caller, Mediaite and The PJ Tatler
Sarah Hurtubise / The Daily Caller: HealthCare.gov Already Cost $840 Million — And It's Not Even Finished
NBC News:
Analysis: Impeachment Talk Becomes a Cynical Game — So both sides are playing this cynical game, turning the midterms into a base election that will be decided by who best motivates their base rather than by trying to fix the country's problems. (Republicans: "This President is breaking the law!"
Discussion: New York Times, CNN, msnbc.com, Real Clear Politics and The Daily Beast
Brendan Nyhan / New York Times: Why Impeachment Talk Is a Wedge Pulling the G.O.P Apart
Paul Steinhauser / CNN: Top House Democrat: 'You bet we're going to run' on impeachment
Mark Murray / msnbc.com: Steyer group kicks off ads by blasting Iowa's Ernst
Patricia Murphy / The Daily Beast: Red State Democrats Ditch Obama
Sean Kennedy / CNN:
Climate group attacks Ernst on tax pledge, not climate
Climate group attacks Ernst on tax pledge, not climate
Discussion: The Hill, ThinkProgress and Washington Free Beacon
Katherine Miller / BuzzFeed:
We Never Tried To Impeach Bush, Says Democratic Lawmaker Who Cosponsored Bush Impeachment Bill — "We did not seek an impeachment of President Bush, because as an executive, he had his authority." — View Video › — Texas Democratic Rep. Sheila Jackson Lee argued Wednesday …
Discussion: Mediaite
Ezra Klein / Vox:
Why I have become more pessimistic about Israel — TWEET SHARE +1 LINKEDIN EMAIL PRINT — "I have become less pro-Israel," admits Jonathan Chait in a powerful piece for New York Magazine. But I don't think Chait has become less pro-Israel. I think he's become more pessimistic about Israeli policy.
Discussion: Hot Air, Washington Monthly, The Dish, New York Magazine and American Prospect
Noah Rothman / Hot Air: Is the world giving up on a two-state solution?
Andrew Sullivan / The Dish: The Best Of The Dish Today
Jonathan Chait / New York Magazine: Why I Have Become Less Pro-Israel
Evan Thomas / The Atlantic Online:
The Untapped Secrets of the Nixon Tapes — Forty years after Watergate, it's easy to imagine we know all there is to know about Tricky Dick. Two new books show how wrong that is. — Richard Nixon taped roughly 3,700 hours of his conversations as president.
Discussion: The Moderate Voice


text:
Chapel Cottage - Historic Russell
Chapel Cottage is located in the centre of the historic village of Russell, about 75 meters to many restaurants, cafe's, Russell Museum and the waterfront where many activities can be accessed from. Such a great place to be based while on holiday.
- Por noite
- $495 - $695
Entre em contato conosco
1 / 10
Chapel Cottage is an independently managed and run cottage located within the Russell Cottages complex.
The cottage is modern and luxurious, 3 bedrooms, 2/12 bathrooms, over 2 stories, the living area is all on the ground floor and has access to a outside balcony which leads to a garden area, the upper floor has 3 bedrooms, with an en-suite off the master bedroom (queen bed), the main bathroom, bed 2 has a queen bed, bed 3 has 2 singles (can be made into a super king bed).
We offer complimentary tea, coffee, sugar, milk, SKY TV, DVD player, DVD library, mini stereo system, parking for 2 cars and boat parking. "FREE Wireless Broadband" and quality linen and towels.
The cottage is 3/12 hours from Auckland, a great place to stay...
Endereço físico
Chapel Cottage - Historic Russell, 2/16 Chapel Street, Bay of Islands, Russell, Northland, 0202, New Zealand.
Horários de abertura
- Expediente:
- 8am - 8pm
- Meses de funcionamento
- Todos os meses do ano
Instalações e recursos
- BBQ Facility
- Children Welcome
- Playground
- Spa Pool
- Swimming Pool
- Proximidade do aeroporto:
- 45 kilometres
- Proximidade do terminal de ônibus:
- Across the bay in Paihia - access by vehicle or passenger ferry
- Proximidade da cidade:
- 75 meters
Preços e condições
|Alta temporada
|Baixa temporada
|(Mar - Dec)
|(Jan - Feb)
|Por noite
|$595.00 - $695.00
|$495.00 - $595.00
- Outros encargos:
- Shoulder and Low season rates also apply - please request
- Informações de preço adicionais:
- Cancellation Policy: Tariffs: All tariffs are quoted in New Zealand Dollars only. Are subject to change without prior notice especially for the peak holiday periods. When a booking has been confirmed by receipt of a deposit, the tariff and the house booking will be honoured. They are based on a per house, per night price for the number of persons specified with a 2 or 3 night minimum stay period on non holiday season times and a 3 - 7 day minimum for some holiday homes and seasons. All NZ public holidays will be charged at the peak tariff and have minimum stay periods. GST (Good & Services Tax) of 15% is inclusive in all per night tariffs, it is not included in additional services. Payment Terms: Please read the following booking conditions carefully, as they set out the terms and conditions of the contract between you and the owner of your chosen Holiday Home. No verbal alteration can be made to the terms and conditions described here or in our website. Any such change must be confirmed by BOIHA in writing. When you make a booking you guarantee that you have the authority to accept and do accept on behalf of your group the terms of these booking conditions. A contract will exist as soon as we issue our confirmation. This contract is made on the terms of these booking conditions which are governed by Law and we both agree to submit to the jurisdiction of the Courts at all times. When you make your booking you must complete our online booking form, accepting on behalf of your entire group the terms of these booking terms and conditions, the general holiday information, and pay a deposit of 30% of the total cost of your booking. A contract only exists between us when we have received your completed booking form together with your deposit and we have issued our confirmation. Once we have received your booking form and booking deposit, we will, subject to availability, confirm your stay by issuing a confirmation by email. This confirmation will be sent to the group leader. Please check this confirmation carefully as soon as you receive it. Contact us immediately if any information which appears on the confirmation or any other document appears to be incorrect or incomplete as it may not be possible to make changes later. We regret we cannot accept any liability if we are not notified of any inaccuracies in any document within 5 working days of our sending it out. A 30% deposit is required to confirm your booking and is payable at the time of making the booking - this will be taken from the credit card when you submit with the booking. The balance of the price of the cost of your stay must be paid at least 30 day/s before your arrival date (or at the time of booking if this date has passed). If the balance is not paid in time, we reserve the right to cancel your booking and retain the deposit paid. Once all parties have accepted a booking confirmation, any requests to alter dates already confirmed are subject to approval by BOIHA and the property owner. Changes to confirmed bookings will incur an administration fee of NZ$50.00. BOIHA will acknowledge all amendments/changes/cancellations in writing. Credit Card Surcharge: All payments by credit card are charged in New Zealand Dollars only and will incur a surcharge of 2.5%. Security Deposit: If required a refundable bond of (if applicable) is required to cover service charges, accidental damage, breakage or loss. This amount will be added to your invoice and is payable with the balance of your booking cost, as specified above. Provided the keys have been returned as specified and we have been advised that everything is in order your security deposit will be refunded for the full amount, within 1 week/s of the end of your stay, less, if necessary, the cost of any replacements, repairs or charges. Should the security deposit prove inadequate to fully cover any costs that may arise, we reserve the right to invoice you for the immediate payment of the outstanding amount. Travel Insurance: We strongly advise you to protect yourself and the rest of your group by taking out adequate travel insurance. We cannot accept liability should you later find yourselves not to be adequately insured. Please note that if the reason for cancellation is covered under your travel insurance, you may be able to reclaim these charges. Force Majeure: No liability can be accepted by us if we are forced to change or cancel your booking due to force majeure reasons, which include, but are not limited to war, threat of war, riot, civil strife, industrial dispute, terrorist activity, natural or nuclear disaster, fire, flood, adverse weather conditions, transportation or any other circumstances beyond our control. If this occurs before your arrival we will do our best to inform you although we are under no obligation to do so, nor are we obliged to pay compensation. Linen: Pillows, duvets, and/or blankets are available at the holiday home. You will be required to bring your own linen (BYO) (top & bottom sheet and pillowcases) bath towels, beach towels, and tea towels unless the provision of these is otherwise specified in the property page details or your have agreed to pay for hire linen. Linen Hire is charged on a per person basis @ NZ$30.00 per person per 7 days or part thereof. Arrival Time: Your holiday home accommodation will be available for occupation at 3.00pm & 4pm on the day of your arrival. Please contact us on 0274 416-378 or (09) 403-7188 as you depart the Fullers Car Ferry at the Okiato side to arrange for us to meet you at the property and hand over the keys. A map of the exact address can be downloaded from http://maps.google.co.nz Please note that all check-in's after 8pm in the evening will incur a late check-in charge of NZ$85.00 Departure Time: Your holiday home must be vacated no later than 10.00am on the day of your departure, later departures are often available please ask if this is possible, we will endeavour to accommodate your request. Departures later than 12.00 noon will be charged at half of the nightly tariff on all occasions. Goods and Service Tax (GST): Goods and Services Tax @ 15 % will be charged on all services provided to guests. Conditions of Rental: You and your group will be responsible for the holiday home for the duration of your stay and are responsible for leaving the holiday accommodation occupied together with all furniture and fittings, clean and in good order and condition. You undertake to inform us of any damages to the accommodation or its contents during your occupation and to pay for any damage or missing items, and excessive or unusual services consumed. This includes cleaning all utensils and equipment, returning furniture and appliances to their original position and disposal of all rubbish. We or our representatives shall be permitted access to the holiday accommodation at all reasonable times during your occupancy. We reserve the right at all times to cancel or terminate a booking completely if the conduct of any member of any party is considered likely to cause offence, danger, damage or distress to others. Our representatives, where they consider the behaviour to be unacceptable, are authorised to cancel a booking wherever and whenever necessary. Our responsibility will cease, and there will be no obligation to cover any expenses incurred by the party as a result of cancellation brought about in these circumstances. No claims will be accepted for refunds or compensation whatsoever. If your rubbish has not been disposed of appropriately on your departure, there will be a chargeable cost of NZ$5.00 per rubbish bag. If BOIHA finds that the holiday home has not been left clean and tidy, BOIHA will invoice the guest for the extra time required for cleaning. In some cases, BOIHA can offer the services of a representative to do the cleaning upon departure of the guest but this must be discussed and agreed upon directly with the representative upon arrival at the holiday home. The guest covenants on behalf of himself/herself and all their guests staying at the holiday home that nothing will be done by them which would in any way invalidate, adversely affect the validity or viability of any insurance policy maintained by the holiday home owner. Because these properties are privately owned and un-serviced Bay Of Islands Holiday Accommodation cannot accept any responsibility for the condition of any property after the owners or any tenants have vacated. Where additional amenities such as swimming pools, moorings, dinghies, BBQ's etc are mentioned as being available, the use of any additional amenities is entirely at the tenant's risk. Bay Of Islands Holiday Accommodation as agent/representative of the owner accepts no responsibility for any injury or loss to the guests or their belongings. The Accommodation may only be used for the persons named on the booking form unless otherwise agreed in writing by us. Sub-letting or assignment arrangements are not permitted. No property is to be used for parties, weddings etc, without the prior permission of the owner or Bay Of Islands Holiday Accommodation. Please ensure that all vehicles/boats/jet skis and motor bikes are parked in the designated areas. No pets are allowed without the prior approval of the property owner. Tents are not allowed unless; the property owner has given prior approval. BOIHA will endeavour to ensure that the holiday home and its facilities as stated in the confirmation will be available to the guest. Should circumstances arise that are beyond the control of BOIHA and make the property unavailable due to (i.e. flood, fire etc) then BOIHA may be forced to cancel the holiday booking. Should such circumstances arise BOIHA will endeavour to relocate the guest to another holiday home of similar standard in the same location. Where this is not possible BOIHA will refund all deposits/balances back to the guest. The guest will have no further claim against BOIHA or the holiday home property owner. Website Description/Property Page Details/Pricing: The information provided on the BOIHA WEBSITE contains statements representing our honest belief that the facts as shown are correct. Every reasonable effort has been made to describe as fully and as accurately as possible the Accommodation offered and every reasonable attempt will be made to supply what has been described. All bookings are made and accepted on the basis of the descriptions contained in the website, or as varied by BOIHA. Prices shown on our website may have changed by the time you come to book your stay. Whilst every effort is made to ensure the accuracy of the website and prices at the time of requesting the booking, regrettably errors do occasionally occur. You must therefore ensure you check all details of your stay (including the price) on your booking acceptance. BOIHA accepts no responsibility for any alterations to the holiday home description that is deemed to be out of their control ie; damage caused by exceptional weather conditions, breakdown of appliances, wiring or plumbing, invasion of pests or negligence on the part of the holiday home owner causing loss, accident, or injury. BOIHA will however make every effort to remedy any such situation by contacting the holiday home owner for instructions eg; organising trades people for repairs, this being at the sole discretion of the holiday home owner. All information that is contained in the current property's page supersedes all previous issues. Limitation of Liability: BOIHA and our suppliers, have to the best of our knowledge and capabilities provided a safe environment, and by accepting the conditions of booking you and all members of your group are accepting that we or 3rd parties, will not at any time accept liability under any circumstances for any instances that may affect any member of your group's personal well being, including personal injury, illness or death. Nor can BOIHA or 3rd parties accept liability for circumstances that are due to your own actions, or to the actions of a third party, or to an unusual and unforeseeable circumstance whose consequences could not have been prevented by us or our suppliers, even exercising all due care. Furthermore, BOIHA or 3rd parties are unable to accept responsibility for any aspect of your booking affected by force majeure, however such eventualities may be covered by your travel Insurance. BOIHA do not accept any liability for any loss, expense, damage, claim or injury either directly or indirectly, consequential or otherwise whatsoever, however caused or incurred, whether arising in contract or otherwise in law or equity as a result of rendering of the services or accommodations as described or substituted, or by reason of terrorist or military action, riots, revolution, insurgency, civil war, adverse government action or inaction or acts of God, or by any agents, employees, subcontractors, servants or third parties whatsoever supplying any of the services or accommodations as described or as substituted. Services: BOIHA cannot be held liable for loss of services such as electricity or water supplies, nor any actions taken in the vicinity of your accommodation by any person(s) or authority over whom we have no control. Similarly, you should be aware that there may be occasions when an advertised facility is either modified or not available. Such situations may be dictated by local circumstances, breakdown of machinery and/or the necessity for maintenance, unsuitable weather conditions, fuel shortages, power cuts and other circumstances beyond our control. If we are advised of this we will endeavour to inform you in advance, but cannot be held liable in such circumstances. Complaints and problems: In the unlikely event that you have any reason to complain or experience any problems with your stay, you must immediately inform BOIHA. Any verbal notification must be put in writing and given to BOIHA as soon as possible. Until BOIHA know about a problem or complaint, BOIHA cannot begin to resolve it. Most problems can be dealt with quickly. In the event that the guests fails to adhere to these procedures, BOIHA and the property owner will not under any circumstance entertain any claims arising from the guest's grievance. Should any dispute arise between the owner/agent and the guest which cannot be resolved mutually the matter will referred to the arbitrator or a single arbitrator if one can be agreed upon, and failing agreement, to the President of the Arbitrators and Mediators Institute of New Zealand who will appoint a sole arbitrator. Any such arbitration is to be carried out in accordance with the provisions of the Arbitration Act 1996 and will be deemed as final. Subject to the laws and regulations of the country in which your claim or complaint occurred will be used as the basis for deciding whether the accommodation in question had been properly provided. If the particular accommodation which gave rise to the claim or complaint complied with local laws and regulations applicable to that accommodation at the time, the accommodation will be treated as having been properly provided. This will be the case even if the accommodation did not comply with the laws and regulations of. Law and Jurisdiction: Any disputes will be governed by Law and both parties shall submit to the jurisdiction of the Courts at all times. The submission by the parties to such jurisdiction shall not limit our right to commence any proceedings arising out of this Agreement in any other jurisdiction we may consider appropriate. Any notice of proceedings or other notices in connection with or which would give effect to any such proceedings may without prejudice to any other method of service be served on any party in accordance with the notice provisions of this Agreement subject always to any mandatory provisions of Law. In the event that the you are resident outside your address for service shall be the your place of residence or business last known to us and any time limits in any proceedings shall not be extended by virtue only of your foreign residence. Notices: Any notice required or authorised to be served in relation to this Agreement may be signed by the person giving the notice or that person's agent and may be served: (a) By delivering it to the addressee personally; or (b) By posting it by registered letter addressed to the addressee at the addressee's place of residence or business last known to the sender; or. In the case of a company, by leaving it at its registered office or by posting it by registered letter addressed to the addressee at its registered office or addressed to it at its place of business last known to the sender or by delivering it to any person who is named on the public register as a director of the company. In the case of a Company, individual or other entity: (a) by transmission by fax to the fax number of the addressee last known to the sender PROVIDED THAT such notice shall be deemed to have been served on the next working day following the date of transmission. (b) by email to the email address of the addressee last known to the sender PROVIDED THAT such notice must be sent with a "Request a Read Receipt" and shall be deemed to have been served when an acknowledgement of receipt has been emailed back to the sender. Where a demand or notice is not served in accordance with any of the foregoing methods, it shall still nevertheless be sufficiently served if actually received by the addressee. A demand or notice posted by registered letter pursuant to these provisions shall be deemed to have been served on the third working day after posting. The modes of service provided by this clause: (a) Do not limit any other sufficient and lawful modes of service (b) Are subject to any mandatory provisions in any statute.


text:
A place for students and teachers to discuss aspects of the GCSE syllabus and examinations
Use this control to limit the display of threads to those newer than the specified time frame.
Allows you to choose the data by which the thread list will be sorted.
Order threads in...
Note: when sorting by date, 'descending order' will show the newest results first.
Forum Rules


text:
Moderators: Three Stars, dagny, pfim, netwolf
Pavel Bure wrote:Might as well get one of these official things started since the deadline is coming up.
Jack Johnson huh? No one likes him, no one wants him... what if he's not the target though, WHAT IF it's James Wisniewski that wants out? Would he screw the Pens cap situation and re-signing Letang? Who would go the other way? What would it take to make it work.
Pipe dreams I know but I do like The Wiz, at that price though I don't think it could work.
MRandall25 wrote:James Wisniewski is on IR with a broken foot.
slappybrown wrote:I'm stunned no one made a Mike Komisarek thread after he requested a trade a few days ago.
no name wrote:I don't see Jack Johnson being traded here. His cap hit and ability would not be a smart pick up.
slappybrown wrote:FYI, this is a pretty helpful addition to the capgeek site:
slappybrown wrote:FYI, this is a pretty helpful addition to the capgeek site:
slappybrown wrote:FYI, this is a pretty helpful addition to the capgeek site:
FreeCandy44 wrote:We can't trade Kennedy! Who else will shoot over the net?
Joe Starkey @JoeStarkey1
Kevin Allen believes 1st-rd pick and a prospect would be price for any team to get Iginla, whom he says doesn't really want to leave Calgary
no name wrote:Any major deal happening at the deadline will involve a top 4 defenceman and maybe in the same deal or a seperate deal a forward for Malkin and Neal. I get the feeling Sid is comfortable with the Kunitz and Dupuis.
I just don't see that top 4 guy being Jack Johnson.
Users browsing this forum: Antonio, BurghThing, Crashguy66, DelPen, Eddie Spaghetti, FLPensFan, largegarlic, NJ Penguins Fan, Pitts, Pruezy11881 and 88 guests


text:
Download the CPSP Accreditation Manual (click below):
QUESTIONS? Contact us at email@example.com
Click below to visit the Commission on Accreditation of Pastoral & Psychotherapy Training:
Accredited Training Centers Data Form (for new centers or to update a center's Directory profile.)
Unit Verification Form (new 12/16)
Registry of Supervisors-in-Training*
*You must log-in to access this link


text:
I think one of the best things to come out of the Sacramento conference was the idea of raising local queens. The term "micro-breeder" was raised, kind of like those "micro-brewers" who brew local beer with the time, patience and specialities that the mega-suds cannot replicate.
But several speakers also noted that one of the defining characteristics of high quality queens was the necessity of leaving the newly mated queen in the mating nuc for 3 to 4 weeks so she can continue to lay eggs and develop her queen scent. This also gives you a chance to test her, or at least observe her egg laying pattern.
As a micro-breeder, I would have the time and I can easily afford to tie up my equipment for that length of time. I wouldn't have to "mate and bank" my queens for a quick turnover of the mating nuc.
Jackson, MO http://www.25hives.homestead.com


text:
Zombies are an aggressive Mob that spawn at night or in unlit areas and will burn to death in sunlight. They are the easiest mob to deal with, since they do not have any special abilities and move quite slowly. They look akin the default player model. Their only attack is to rush at the player and punch it.
Zombies, before 1.8, used to drop Feathers, but since the update now only consistently drop Rotten Flesh. Zombies as of the 1.3 update can now drop a range of items such as iron gear, poisonous potatoes, etc. If the Zombie is wearing any armor, there is a chance it will drop the armor. Rotten flesh is not recommended to be eaten. This is because, though it does raise your Hunger bar, it has a large (80%) chance of triggering a hunger effect upon the player. A similar 'food poisoning' effect can be obtained by eating Raw Chicken. This causes hunger to drain faster than normal, but the effects do not stack. Drinking a Bucket of Milk will cure the player of any such effects. Rotten Flesh can also be fed to Wolves without any bad side effects.
Health Points; 10 Hearts
Damage; Easy = 1 Heart, Normal = 2.5 Hearts, Hard = 3.5 Hearts
Dealing with Zombies
Dealing with zombies is relatively easy when compared to other mobs. Due to their slow moving speed, they can be easily outrun but may pose problems in groups. Zombies can be taken out with a Bow and Arrow with ease, or with a Sword, but this is the only technique that is recommended as it wastes no arrows and is incredibly easy. As long as you are swinging your sword vigorously the zombies can not cause any damage. Like most creatures, the Sprint + Attack technique (double press forward and attack while sprinting) is useful in utilising the increased knockback, which can allow you more time to manouevre between shots, and to avoid retaliation attacks.
Was this guide helpful?


text:
You have not viewed any products recently.
Share This Product
100.0% would recommend this item to a friend.
8 out of 11 people found the following review helpful:
What are the pros?
What are the cons?
Plant is vigorous. Off to a slow start but looking good. Flowers are awesome.
Would you recommend this product to a friend?


text:
Please note: As a courtesy, please do not reproduce these comments to newsgroups, forums or other online places. Links only please.
Welcome once again to our annual "first look" at the broadcast networks' offerings for the 2008-2009 season. Each day we'll walk you through one of the new series set to premiere next season and go over our initial impressions after viewing the pilot - or in this new post-strike/straight-to-series world, reading the pilot script. We'll start with the ones that were actually filmed and move on to the others in the coming weeks.
For our final two weeks, we're going to shift gears a little and look at the scripts for 10 high-concept projects in the works for midseason. All of them have just started or recently completed production so it may be some time before we hear when and if they make the cut.
As always a lot can change from what's on the page right now but we couldn't resist taking a peek.
[EDITOR'S NOTE: To read our review of the final product, click here.]
(written by Rob Thomas; 65 pages)
The network's description: "Like any big city, Los Angeles has its share of characters. But the newest one isn't like the rest. For starters, his goal in life is to help people fall in love, which isn't such a bad thing. But he says he must create 100 happily-ever-afters in order to return to his home�Mount Olympus. Because he's Cupid, the ancient Roman god of love. Duh. He claims being punished by the other Gods for the modern world's sorry state of love, and was sent to Earth without his famed bow and arrow, to rediscover what really makes love work. As fate would have it, Cupid, sometimes known as Trevor Hale, is under the care of famous psychologist and self-help author Dr. Claire Allen. Even though Claire disagrees with Trevor's methods, she can't argue with the sentiment, since she too is dedicated to helping lonely hearts find their soul mates. But these two experts in love couldn't be more different: he believes love blooms fast and carnal and passionate, while she thinks it grows slowly, moderately and sensibly. While he busies himself making matches, she endeavors to figure out who Trevor really is. Is he a man who's losing his mind after the loss of his one true love? Is he really crazy? Or (gulp) is he really Cupid? From writer-creator Rob Thomas (Veronica Mars) comes a re-imagining of his 1998 cult favorite series of the same name. Bobby Cannavale stars in this romantic-comedy procedural that will match up a new loving couple each week, though romance may not always bloom quite where we expect it to. This warm, witty series is a charming reminder that even though true love may be madness... it's the only thing keeping us sane."
What did they leave out: Jeremy Piven and Paula Marshall starred in the original 1998-99 version, which aired on Saturday nights at 10:00/9:00c (yikes!) before moving to Thursdays at 9:00/8:00c for its final four broadcasts.
The plot in a nutshell: Meet Cupid 2.0 (Bobby Cannavale). Dressed in a "Virginia is for Lovers" T-shirt, he's helping Dave (yet to be cast) pull off a grand, romantic gesture - using spray-painted tarps to make the Hollywood sign in Los Angeles read "Holly?" It seems that Dave, while working at a pub in Ireland, became smitten with an American girl who stopped to ask for directions. Now, armed with only her first name and her destination city, Dave has taken on a Quixotic quest to find Holly. It's only natural then that the God of Love is aiding him. Unfortunately, the cops don't take vandalism lightly - even if it's in the name of love. Meet Dr. Claire Allen 2.0 (Sarah Paulson). She runs the "Dating for Life" seminar every Tuesday and Friday night at the Border's on Sunset. Today's hot topic: some idiot went and changed the Hollywood sign to read "Holly?" The room - filled with an array of characters (which Thomas amusingly names things like "Guy's Guy," "Obligatory Brassy Redhead" and "Just-Off-The-Bus Ingenue") - seems split as to whether whoever did it is crazy or romantic beyond belief. Claire's take: why would this Holly person want to be with someone who has no respect for the law? In any case, one of Claire's colleagues calls her with the news that the Cupid in question is being held for observation at Cedars-Sinai and they'd like her take on him. You see, Cupid genuinely thinks he is the Cupid, banished from Olympus ("Oh, at my expulsion, they yammered on about relearning my craft, the screwed up state of love and romance. Frankly, I had trouble taking the whole thing seriously," he notes.) until he can unite 100 couples - sans his bow and arrows.
And despite her best efforts (from drugs to mythology quizzes), Claire can't seem to punch any holes in his "delusion" - that is until she mentions Psyche, a mortal whom Cupid fell in love with and married, despite the gods' objections. Cupid scoffs that he never heard of her and notes "You're saying Cupid was married?" A deflated Cupid - who now offers up his name as Trevor Hale - then is released with the caveat he must remain under Claire's care. Unfortunately for her, Cupid/Trevor just played everyone in order to get out. Now with her professional reputation - and his freedom - on the line, the pair must find a way to co-exist, no easy feat considering their opposite opinions about love and romance. Making matters worse - Trevor has turned his attention back to Dave's quest and the two find themselves in a war over convincing him how to proceed. Along the way we also learn that Trevor has a job at Tres Equis, a former adult movie theater that's been converted to a Mexican-themed bar, where he also rents a room from its owner Felix Arroyo (Rick Gomez) and his sister Lita (Camille Guaty); while Claire has hired a P.I. to find out who Trevor really is and has a father who's been battling a much more tragic form of mental illness. In the end, Trevor and Claire discover that Dave's path involves a happy medium between their two ideologies. (And yes, Trevor's behind-the-back dart bull's-eye and the pool hall counter are back too.)
What works/What doesn't: The good news is the new "Cupid" is almost exactly like the old one. The bad news is the new "Cupid" is almost exactly like the old one. And I say both these things as someone who holds the original show near and dear to my TV-watching heart. In other words, part of me is thrilled beyond belief that what I just read is up to said standards while another part of me is horrified at the prospect of people other than Piven and Marshall saying the words. Not because of some bias on part - but because it literally feels and plays like a lost episode from the original show, making the comparison almost impossible to ignore (that is of course if you are aware of the old show - it has been 10 years after all). I was actually hoping "Cupid" would take the "Battlestar Galactica" route and completely reinvent itself - after all the dating world has changed quite a bit in the past decade. Between MySpace, Match.com and the decline in marriage rates, singlehood is a much different thing now than it was in 1998. So if there were any show to having something to say about those changes - it would "Cupid." (It would also have made the casting changes easier to digest.)
As it is though, this new "Cupid" is very much in the 1998 mold (none of the previous concepts are even mentioned) - as I said, it feels like a lost episode of the original show (minus the change in locale of course). That's not to say it isn't a wonderful script (Claire: "Trevor, you don't have believers." Trevor: "Is that so? Then why is there a Temple of Eros down on Melrose?" Claire: "They sell trashy lingerie." Trevor: "Of course they do! It�s one of the sacraments.") or it doesn't tickle my fanboy bones (the sketch of Psyche that Claire shows Trevor resembles her), it just isn't in a 2008 mold. Everything said here has been said before by Piven and Marshall, again making the comparison impossible to ignore. Conversely, I'll take more "Cupid" over no "Cupid" any day - not to mention more Rob Thomas over no Rob Thomas. He has a genuine talent for create a living breathing world - in this case a slightly romanticized version of Los Angeles - with amusingly chirpy characters. He has the is-he-or-isn't-he dichotomy of Trevor down pat, from the humor of it to the pathos. Now it's just a question of how Cannavale and Paulson fit into his vision.
The bottom line: The idea of having an hour of television devoted to not cops or dead bodies or mysterious illnesses - but to a weekly debate about what love is - is what drew me to the original "Cupid." I'm thrilled beyond belief about the prospect of having that debate come back to television - even if part of me is horrified (and legitimately so as detailed above) it's not Piven and Marshall.
[EDITOR'S NOTE: To read our review of the final product, click here.]


text:
Fans of Glendale's Titanium cab-over front cap system for fifth-wheel units will be pleased to learn that Heartland RV is bringing it back. According to a release, Heartland RV will be incorporating the distinctive, aerodynamic design to its fifth-wheel lines.
Heartland announced that it had acquired the Titanium's intellectual property from Glendale several months back after Glendale filed for bankruptcy. Glendale one dominated the Canadian fifth-wheel marketplace with its Titanium lineup and Heartland RV is clearly hoping there is still some interest in the brand.
"We acquired all the patents, so we will be the only company offering this highly innovative design," says Coley Brady, vice president of sales for Heartland. "Everyone familiar with the industry – trade and consumer – recognizes the Titanium cab-over cap as one of those engineering advances that really impacts the market. We will be offering the Titanium front cap in our luxury Bighorn fifth-wheel brand along with the Road Warrior and Cyclone toy hauler lines.


text:
De plus, c'est un système de triche 100 % indétectables et sans virus. Vous ne risquez donc nullement d'être bloqué sur la plateforme du jeu
Popular Guides
View more guides at Linux Wiki Guides
Maurice Ling
This is a guide to getting Linux running on the Panasonic Toughbook W8 laptop. The Toughbook W8 is great for running Linux, especially with Fedora 23. Earlier distributions require minor tweaking to get the sound card working through the speakers. The distribution I used was Fedora Core 23 (with notes on FC14, my original install), but other than the installation section, this document should help you get other distributions working as well. In the interest of full disclosure, I am an employee of a subsidiary of Panasonic Corporation.
For a general discussion about this laptop you can visit the Panasonic Toughbook W8 page on LapWik.
If you would like to edit this page please first view our Editing Guidelines.
For full specifications see the Panasonic Toughbook W8 specifications page.
|Panasonic Toughbook W8
|Intel Core2 Duo Processor SU9300 : 1.2 GHz, 800MHz FSB, 3 MB On-Die L2 cache;
|Intel GMA 4500MHD
|Up to 4GB
|Optical Drive
|DVD Super Multi
Intel Wireless WiFi Link 5100
|Optical Drive
|Reads CD's ok. Have not tested burning discs yet.
|For speakers to work, you need to tweak the module options for distributions before FC23. See below
|Able to browse files on my cell phone
|Not Tested
|Card Reader
|Successful reading 16Gb SDHC Card
|Not Tested
|Fingerprint Reader
|Not Tested
|Eco Mode
|Only settable in Windows, but persists after reboot
FC23 installs via Live USB easily. I upgraded from my previous installs. Pleasantly, the sound worked out of the box with no manual tweaking required.
FC16 installs normally on the W8 via the Live USB stick. Since I was upgrading from FC14, I didn't need to repartition (see FC14 installation section). You should make sure you put your home/data directory on a different partition to make upgrading easier. I did a fresh installation (preserving my previous home directory partition via the custom partition option), set up the users, installed the usual (see http://fedorafaq.org), and configured the sound module (see below). The new Gnome 3 interface works great on this laptop.
The W8 started up without a hitch from the FC14 Live via USB stick. Wireless LAN works without any hassles. If you want to boot from CD/DVD, please check out the DVD/CD Drive section below. I set up the laptop as a dual boot system. First, I resized the NTFS (Windows XP) partition to 60Gb using the ntfsresize utility (after backing up using ntfsclone to a USB hard drive). Next, I wanted to resize the partition itself. I tried using fdisk, but could not get the partition to start at the exact sector that the NTFS partition originally started at. Instead, I used gparted, which has a handy resize capability.
After resizing the partition, I ran the "Install to Hard Disk" utility. Unfortunately, the resulting installation did not work correctly and resulted in some kernel errors at boot up. Weird, since the Live USB seemed to work so well. For less installation hassle, I recommend that you install from the Fedora DVD and add the Fedora 14 Updates repository rather than install from the live CD. See the CD/DVD Drive section below regarding booting from CD/DVD. Be sure to connect your laptop to the network during installation to get the latest updates.
Since I had a partially installed Fedora system now, I decided to try a network install using the latest kernel and updates. I followed the Installing Without Media instructions and added the Fedora 14 and Fedora 14 Updates repositories in the install process. This way, you get the latest updates during your install. After going through the install process, the laptop booted into Linux with no difficulties.
After using the laptop a bit, I realized two things. First, the CD/DVD drive did not open when I pushed the open button. Second, there was no sound coming out of the speakers. I knew that these should work properly, since they worked when I booted into Windows. The next two sections describe how to get the CD drive to open and the speakers to work.
The CD drive is located at the lower right of the keyboard and should pop open when you push/slide the open button. The key here is going into the BIOS configuration (press F2 at the Panasonic screen) and setting the "Optical Drive Power" setting to "On" instead of "Off". This way, the drive will be on continuously, allowing you to boot from the CD drive. Linux will also then recognize the drive and pop it open when you eject the CD.
The drive, however, does not open automatically when the laptop is turned off and you hit the switch. The only way to open it to insert a CD for booting is to use a paper clip or other suitably thin pin. Insert the pin into the "emergency open" hole underneath the laptop to the front of the CD location until it stops, then slide it to the left and the CD door will pop up easily.
Note: FC23 speaker sound works out of the box, with no sound card configuration tweaking.
Debugging the sound issues was a bit more challenging. I realized I could use head phones to hear the sound card output, but no sound came through the speaker. The W8 speakers are mono-output, but the headphone output is stereo. A quick internet search revealed that this problem is not unique to this brand and model of laptop. The cause of this non-operation is due to the fact that the same audio codec is used in desktop, laptops, and, apparently other portable devices. The default setting in the Linux module is the desktop setting, which means that the codec needs to be configured to "laptop" mode for it to work properly.
In general, you can find out what kind of sound card you're using via the /proc/asound/cards file, or by typing "aplay -l". The specific codec may be found in /proc/asound/card0/codec*. In this case, we're running a hda-intel sound card with an Analog Devices AD1883 codec. You can find specific configuration in ALSA-Configuration.txt located in the ALSA distribution documentation.
To get the sound to come through the speaker, all you have to do is add a configuration file to /etc/modprobe.d. Create a file, /etc/modprobe.d/sound.conf and add the following line to it:
options snd-hda-intel model=laptop
Now, reboot the system and the sound should work! For other distributions, you may need to modify /etc/modprobe.conf instead. As a side note, in GNOME, the System→Preferences→Sound utility is very useful for testing the sound configuration.
Eco mode is a special mode that causes the battery to stop charging when it reaches 80% of full capacity. According to the documentation, this mode extends the over all life of the battery. As far as I know, the only way to toggle the Eco mode is through Windows. The setting is persistent, so once you set it in Windows, it will stay set. If we can find some documentation about how to set the Eco bit programmatically, it should be fairly simple to implement a driver or utility for it. If you're deciding whether or not to dual boot your system, this is one aspect to consider.
The Pansonic Toughbook W8 runs Linux 64-bit very smoothly. It is a welcome upgrade to the factory-installed operating system. FC23 installation via Live USB install went without a hitch and there was no need to tweak anything. The laptop itself is solidly built, is extremely light, and has a long battery life.
Mesin CTCP
Mesin digital printing
Mesin printing digital
Mesin cutting sticker
Mesin fiber laser
Mesin cutting laser
Mesin laser cutting
Gentong kayu
Informasi mesin advertising
Mesin digital printing outdoor
Mesin digital printing indoor
Supplyer mesin digital printing
Usaha digital printing
Mesin digital print
Alat digital print
Jual mesin CTCP
Jual kaca mobil
Jual mesin cutting laser
Mesin advertising


text:
Saturday, December 17, 2011
Fan Packages at Winter Lake Lodge available in 2012
Winter Lake Lodge is offering fan packages at special rates for race fans for the 2012 Iditarod Trail Invitational. Fly out to this remote lodge and check point of the Invitational race and watch the racers come through. Check out dog mushing with Carl and enjoy Kirsten Dixon's award-winning cuisine. Contact WithinTheWild directly at:
Subscribe to: Posts (Atom)


text:
Feb. 26, 2007
CAMBRIDGE, Mass. - The MIT women's fencing team finished as the runner-up at the New England Championship for the second year in a row on Saturday. Brandeis University captured the team crown as it picked up 11 more wins than the Engineers.
Each member of the foil squad placed second in their respective pools en route to a second-place team finish. Cordelia Link led the way with a 10-2 ledger, followed by Nancy Hua's 10-2 mark in the "B" pool and Lindley Graham's total of 11-1 in the "C" pool.
The sabre team placed sixth with a record of 18-17. Yushin Chen paced MIT with a 6-5 performance for seventh in the top tier. In the "B" pool, Hareem Ahmad ranked ninth (4-3) while Heather Pressler was 12th (1-4). Laura Evans notched a total of 7-5 to place fourth in the "C" pool.
Zhenya Gu's ledger of 7-1 resulted in a fourth-place ranking in the epee "C" pool and lifted the team to a seventh-place finish and an overall mark of 21-13. Stephanie Shin finished fifth with a total of 8-4 while Joanna Tong went 6-6 on the day for sixth place. Nicole Koulisis rounded out the team with a 0-2 mark and a ranking of 13th.


text:
In the foreground, a woman, terrified, lifts herself off the bloodied ground.
Behind her, a man kneels over a badly injured woman, her right leg torn to shreds.
The photo, snapped by the Boston Globe's John Tlumacki, has become one of the iconic images of the Boston Marathon bombing.
The New York Daily News chose the photo for its wraparound cover on Tuesday. But problematically, the image appears to be altered to clean up the injured woman's leg.
After disasters like Monday's, news organizations must grapple with how much of the devastation to show -- if they choose to show it at all.
Another image that made the rounds after the bombing was 27-year-old Jeff Bauman, being wheeled off the road, his feet blown off and his calves in shreds.
Most news organizations chose to crop the photo below the knee, hiding the worst of the gore, but the Atlantic published the whole image, with Bauman's face pixelated. [Trigger warning: It's quite graphic.]
What do you think:


text:
Type of Station: regular
Originating Trains: 0
Terminating Trains: 0
Total Platform: 0
Train Stop Here: 0
Nearest Airport: imphal municipal airport/imf
Distance From Airport: 25 km
sagolband rd, manipur
All train Times provide complete information of tupul (tupul) Railway Stations Train Time Table & Schedule. tupul Station is one of the cleanest railway stations of sagolband rd, manipur. The passengers who are planning to board the train from tupul Station must acquire the complete details of the trains passing through it. There are around 0 trains that you can board from tupul station. It is a regular type of station with the nearest airport being the imphal municipal airport/imf. The airport is around 25 km away from the station, which can easily be reached. To add on, there are various trains passing through tupul station and the trains that stop at tupul. The information about originating trains, terminating trains and total number of platforms can be availed from the station itself.
|Train No.
|Train Name All Type
|Stop time
|Days Of Run
Sorry! No Records
Please note all the information shared on this site are intended for general usage. We hereby confirm that www.alltraintimes.com is a private portal and claim no direct connection with Government of India Railway sites or Indian railways official sites in any ways. Content available in this website is for information only; all the information available are personal in nature and for non-commercial use only.
Minor discrepancy may occur in case of data fetched from the sources are not updated; please note All Train Times holds no responsibility of such discrepancies. Read more...
This platform fetches data from various sources to come up with information regarding PNR Status, various Train Routes, availability of trains, train Running Status, Departure and Arrival of Trains at various Stations, Fare Chart and are subjected to change without any prior notification. We intend to provide the best and most accurate data however, passenger enquiries should always be re-verified at the official sites (www.irctc.co.in) before processing any request or making a plan.


text:
Walking the Rawnsley Bluff Trail
Approx 34cm x 48cm
Pastel on Colourfix Paper
Copyright Susan Borgas
Wow I can't get over the amount of time that has passed since my last post.
Blogger has kindly given us some new templates to play with and hope you like the new look. It took me ages to work out what design to settle with and felt this one gave a nice clean visual, so decided to keep this one. I will tweak the colour to suit my work at a later time.
Even though I haven't been blogging, painting is still high on my priority list with numerous paintings done throughout the year. Tomorrow is a big day with the opening of the Painters of the Flinders Ranges exhibition opening in Port Pirie of South Australia. I am also working towards the annual exhibition at Wilpena Pound later in the year. The painting above is a part of the Port Pirie exhibition.
An effort is going to be made to update this blog often, although daily will not be an option because I found it does put a lot of pressure on my artwork. I do use Facebook and you are welcome to join me there. Please let me know where you found me so that I know to accept your friendship. I tend to turn people away on Facebook if I think it is a random invite from someone I have nothing in common with.
Take care, SusanQuick links: