text:
For the last two years, I have been using a website called Planboard to plan all of my lessons. I am one of those people that prefers using technology to writing on paper, so this is the perfect paperless solution for me. The best part is, all of the main lesson planning features of Planboard that an individual teacher would use are FREE. They do have premium pricing for some of the additional features, but I have never found that I have needed them.
Why I Love Planboard
Basically everything about Planboard is designed to make a teacher's life easier. It's an online tool, so you can access and edit your lesson plans from any computer, phone, or tablet. There's an iPhone app as well as one for Android available to download. I love this feature as I often use my phone to quickly glance over the day's lessons in the morning when I'm still at home so that I can remind myself what I have planned.
It's a bit time-consuming initially to set up your semester dates, holidays, off days, and custom timetable, but once it is done, you don't have to do it for another year. When you start planning, I recommend that you create one or more lesson templates. These templates that allow you to apply the same formatting to multiple lessons so you don't have to keep retyping the same elements of a lesson over and over again.
After you have created a template, you are ready to start writing your lesson plans and there are several ways to do this. Planboard has a daily, weekly, and monthly view, as well as my favourite – the unit view. Each day also has a virtual Post-It note where you can write daily reminders to yourself. Within each lesson, you can link the standards from your curriculum that relate to that specific lesson and also attach the files required for that lesson that are either on your computer or already in Google Drive.
Once your lesson plan is complete, you can print or save it as a PDF and even send it to someone (like an administrator) via email. This is why I like to use Planboard to write up and print out detailed sub plans for when I am away.
Finally, Planboard has amazing customer service. If I ever have a problem or don't know how to do something, I just open up the chat window at the bottom of the page and ask my question. I usually get an instant response!
How to Set Up Your Semester
When you sign up for a Planboard account, the first thing you will have to do is set up your semester. I like to use the whole school year as my "semester" simply because my schedule doesn't change from term to term. If yours does, you will want to set up multiple semesters for each term that you teach. On this screen you can also customize the days of the week that you teach if you only teach part-time.
How to Add Your Subjects
The first thing Planboard will direct you to do is to add your subjects that you teach. Since I teach Spanish to four different grades, I created one "subject" for each grade called Spanish 5, Spanish 6, Spanish 7, and Spanish 8 and then one called "Prep" for when I have my planning periods. Within each subject, you can also create sections. I have two to four sections of each grade level, so I put each class name in here. I like to colour code the subjects and sections in the same shade of one colour, but you can choose any colours you want.
This screen is also where you can link your curricular outcomes to each subject. On Planboard they are called "Standards". Many standards are already on Planboard, so I would search for yours first. To search, click on the subject you would like to search first, then click in the "Search for Standards & Expectations" text box. Try typing in your subject name, or your location. Usually there is a huge list to choose from, so make sure to scroll down. If you can't find your standards here, just leave this blank for now and I will describe how to upload your own standards later on.
When you are finished adding your subjects, sections, and standards, click the "Timetable" button in the top right corner of the screen.
How to Add Classes to Your Timetable
First of all, you will need to choose your Rotation Schedule. You can choose a weekly rotation or one with a specific number of days, up to 12 days. Then to add your classes, click the "Insert Class" button in the top left corner of the screen. To add each subject or section, you will have to choose one from the dropdown list. Then edit the star and end times of the class, and check the boxes to select the days of rotation you teach that class at that specific time. This is the most time-consuming part of the process, especially if you schedule is very irregular, like mine. I have to enter almost every class one-at-a-time as they don't usually happen during the same period. When you are finished, you screen should look something like the image below.
If you prefer to use letters instead of numbers in your rotation schedule, you can change this setting. Just open the main menu by clicking the three horizontal lines in the top left corner of your screen (beside the word "Planboard"). Then click on "Settings". Turn on the "Use Letters for Day Cycles" setting. I also recommend enabling the "Off-days Affect Rotation" setting if your rotation needs to regularly shift forward following a professional development day or another "Off-day". Otherwise you will miss those days on your rotation.
At this point, you should also add holidays and off-days to your schedule. To do this, open the main menu again and click "Semesters". By choosing the country you live in, Planboard can automatically add in any national holidays to your schedule. Then you will need to manually add any other off-days, including longer breaks, professional development days, and other organizational days. Now you are all set up and ready to start lesson planning!
How to Create a Template
I definitely recommend you take advantage of the Templates offered by Planboard, as it takes the repetition out of lesson planning. My template (seen below) is pretty simple, but it saves me from typing the same thing for every class that I teach. You can create a template like mine by opening the main menu and clicking on "Templates". From here, you will have to create a template using the "+" button. Give your template a name, and then get creating! Make sure you put any formatting in that you want to at this point, and then click the "Assign to Classes" button in the top right corner. Choose the classes that you want to use this template for and click the "Close" button. Everything will save automatically, just make sure the classes you picked have a checkmark beside them. The best part is you can create a different template for each subject that you teach. I only teach Spanish, but I also like to create a blank one for my Prep period and I just put a single space in it so that it stays blank.
How to Add Your Own Curricular Outcomes as Standards
If you didn't find your standards already on Planboard in the steps above, you will have to add your own if you want to include them in your lesson plans. From any screen, open the main menu by clicking the three horizontal lines in the top left corner of your screen (beside the word "Planboard"). Then click on "Standards" and click the "Upload Standards" button in the top right corner. Unfortunately you will have to individually type in (or copy and paste) each standard and give each a unique code as well. I did this for all four grades of Spanish that I teach, and it took a few hours, but it is doable and worthwhile if you have to include these in every lesson plan!
How to Set Up Units
I prefer to set up my units first, as it allows me to see the dates I have a lesson with each section. That way I can cross-reference this information with my year plan to see how many classes we have to complete a specific unit. To get to this screen, just click the "Unit" button on the home screen. From here, I select a class from the dropdown menu and click the "Units" button. Click "Add a New Unit" and give it a number (to help to keep your units in the right order) and a title. You can also change the colour of the unit by clicking on the eyedropper icon. Then you can leave the other boxes blank or fill them in with the relevant information (a description of the unit and standards covered within the unit). The resources used in the unit will show up automatically when you link them to a specific lesson plan within the unit.
How to Plan Your Lessons
I don't actually plan my lessons from the unit screen. Once I have the unit information filled out, I switch over to the Resources area. From any screen, open the main menu by clicking the three horizontal lines in the top left corner of your screen (beside the word "Planboard"). Then click on "Resources" and click the "Create New Lesson" button. Give your lesson a title and select a template to use. I recommend you give it a descriptive title (eg. Introduction to Ecuador) rather than a number in sequence (eg. Lesson 1). I like to use the tags to stay organized, as all of your lessons will be stored in the same area and it will be hard for you to find specific lessons later on if they have similar names. You can add a descriptive tag, like the novel title (as seen below) or the grade level, or both. Then just type out your lesson plan. Some things you can include directly in your plan are: bulleted or numbered lists, links to websites, images, YouTube videos, files on your computer, files in your Google Drive account. As of right now, you can't add standards in the Resources area, which is the only downfall. You will have to add the standards to individual lesson plans within the daily, weekly, or unit view.
When you have finished writing your lesson plan, you have several options. You can export it as a PDF, email it, share it with a colleague (although this requires a $60 per year Collaborate subscription), or import it to a class. To import your lesson, click the "Import" button and select the date you want the lesson to occur. Then select the class you want to import the lesson to. Unfortunately you can only choose one class at a time, but it still saves time over copying and pasting. If you simply copy and paste a lesson plan from one class to another, you will have to re-add the files to EVERY class and it won't preserve the formatting. Plus this way you have the lessons for years to come, and you don't have to look back at previous years' lesson plans to find them. Another great feature is that after you teach a lesson, you can write a comment on it! This is only available in the Resources area.
Are you ready to make the leap into online lesson-planning? It's easy to get started by visiting Planboard! Comment below if you have any questions or are thinking about signing up.


text:
Obituary: Frances Vestal Brintle
Frances Vestal Brintle, 100, of Barstow, Calif., formerly of Cornersville, died Tuesday, Feb. 1, 2011, at her residence.
Mrs. Brintle was a native of Maury County, and daughter of the late Maury Petway Sr. and May Eugenia Sowell Vestal. She taught school for many years at Cornersville High School and retired while teaching in the Davidson County School System. Mrs. Brintle was a writer of children's stories and had several published. She was also a gifted artist, sharing her paintings with many of her former students. She was a member of Cornersville First Baptist Church and did missionary work in the United States, as well as abroad when she was in her 90s.
In addition to her parents, she was preceded in death by her husband, James Garland Brintle Sr.
She is survived by two daughters, Betty Hooper of Barstow, Calif. and Mary Ellen Doggett of The Villages, Fla.; four sons, William Oscar Brintle and James Garland Brintle Jr., both of Las Vegas, Nev., Joseph V. Brintle of Nashville, and Robert "Bob" E. Brintle of San Juan Capistrano, Calif.; 17 grandchildren; 18 great-grandchildren; six great-great-grandchildren; and three half-sisters, Nancy Crowder of Lewisburg, and Betty Blackwood and Kathy Ingram, both of Chapel Hill.
Funeral services were conducted Tuesday, Feb. 8, from the chapel of Cornersville Funeral Home with burial to follow in Beechwood Cemetery.
In lieu of flowers, donations may be made to the Cornersville First Baptist Church Memorial Fund, 2966 Pulaski Hwy, Cornersville, TN 37047.

subset: commoncrawl


text:
The best makeup looks are often the result of a well-prepared base.
Using an organic primer under your makeup prepares your skin for the application of foundation, allowing you to achieve a nice even tone and flawless looking makeup.
An organic concealer allows you to effectively cover up any blemishes, pimples, uneven skin patches and dark circles while nurturing your skin at the same time.
Organic tinted moisturisers are perfect for adding a little colour & evening out your skin tone. They can be worn with or without makeup and often include sun protection too.
Organic BB Creams are the ideal multi-tasking skin care products. You get a moisturiser, foundation and SPF - all in one!


text:
DAR ES SALAAM, May 31 (Reuters) - Tanzania has awarded contracts to build new railway lines worth about $9 billion to Chinese firms, its transport minister said, expanding Beijing's presence in East Africa's second-biggest economy.
Transport Minister Samuel Sitta told parliament on Saturday a Chinese consortium had been awarded a contract to build a 2,561 km (1,536 miles) standard gauge railway connecting Dar es Salaam port to land-locked neighbours at a cost of $7.6 billion.
"A consortium of Chinese railway companies led by China Railway Materials (CRM) has been picked to help us build the railway line," he said.
The consortium will provide 10 percent of the funding for the project while financial adviser Rothschild is finalising procedures for financing of the project through banks, Sitta said.
The minister said construction of the railway line was expected to start in June.
He said Tanzania had signed a framework agreement with another Chinese company, China Railway No.2 Engineering Group Co. Ltd., to build a railway line linking coal and iron ore mine projects, also under development by a Chinese group, to the southern port of Mtwara near big offshore natural gas discoveries.
The 1,000 km standard gauge railway line is expected to cost at least $1.4 billion, according to the Tanzanian government estimates.
Tanzania said in March it planned to spend $14.2 billion to construct a new rail network in the next five years financed with commercial loans, as the country aims to become a regional transport hub.
Tanzania, like its neighbour Kenya, wants to profit from its long coastline and upgrade existing railways and roads to serve growing economies in the land-locked heart of Africa.
Oil discoveries in Kenya and Uganda and gas finds in Tanzania have turned East Africa into an exploration hotspot for oil firms but transport infrastructure in those countries has suffered from decades of under-investment.
Tanzania last year signed an agreement with China Merchant Holding International (CMHI) to build a new mega port and economic zone at Bagamoyo expected to cost at least $10 billion.
China is also financing a $1.2 billion, 532 km (330 mile) natural gas pipeline in Tanzania. (Reporting by Fumbuka Ng'wanakilala. Editing by Jane Merriman)


text:
Software Engineering Intern Interview Questions in United States
Software engineering intern interview questions shared by candidates
Top Interview Questions
Suppose you had eight identical balls. One of them is slightly heavier and you are given a balance scale . What's the fewest number of times you have to use the scale to find the heavier ball?48 Answers
3 times. (2^3 = 8)
Two. Split into three groups of three, three, and two. weigh the two groups of three against each other. If equal, weigh the group of two to find the heavier. If one group of three is heavier pick two of the three and compare them to find the heaviest.
Brian - this would be correct if you in fact were using a weighing scale, and not a balance scale. The ability to weigh one group against another with a balance scale allows Marty's answer to be a correct answer. Although - the question as worded provides a loophole. If it had been worded as "What's the fewest number of times you have to use the scale to CONSISTENTLY find the heavier ball", then Marty's answer would be the only correct answer. However, it is possible that you could get lucky and find the heavier ball in the first comparison. Therefore, the answer to the question as stated, is ONE.
Show More Responses
This question is from the book "How to move Mt Fuji".... Marty has already got the right answer.
Actually Bill, by your interpretation of the question the answer is zero, because you could just pick a ball at random. If you get lucky, then you've found the heaviest ball without using the scale at all, thus the least possible amount of times using the scale would be zero.
The answer is 2, as @Marty mentioned. cuz its the worst case scenario which u have to consider, otherwise as @woctaog mentioned it can be zero, u just got lucky picking the first ball....
None- weigh them in your hands.
Assuming that the balls cannot be discerned by physical touch, the answer is 3. You first divide the balls in two groups of 4, weigh, and discard the lighter pile. You do the same with the 4 remaining, dividing into two groups of 2, weighing, and discarding the lighter pile. Then you weigh the two remaining balls, and the heavier one is evident.
2 3a+3b+2 = 8 if wt(3a)==wt(3b) then compare the remaining 2 to find the heaviest if wt(3a) !== wt(3b) then ignore group of 2 discard lighter group of 3 divide the remaining group of 3 into 2+1 weigh those 2 If == the remaing 1 is the heaviest if !== the heaviest will be on the scale
With the systematic approach, the answer is 3. But, if you randomly choose 2 balls and weigh them, and by coincidence one of these two is the heavier ball, then the fewest number of times you'd have to use the scale is 1. Although the real question is: are the balls truly identical if one is heavier than the rest?
just once. Say you are lucky and pick the heavy ball. One use of the scale will reveal your lucky choice
so once, or the creative answer zero if you allow for weighing by hand
Without judging by hand: Put 4 balls on one side, and 4 on the other. Take the heavier group and divide again, put 2 balls on one side, and 2 on the other. Take the 2 that were heavier, and put one on each side. You've now found the heaviest ball. This is using the scale 3 times, and will always find the right ball.
Show More Responses
None. They are identical. None is heavier.
2 weighings to find the slightly heavier ball. Step 1. compare 2 groups of three balls. Case 1. if they are both equal in weight, compare the last 2 balls - one will be heavier. case 2. If either group of 3 balls is heavier, take 2 balls from the heavier side. compare 1 ball against the 2nd from the heavy group result 1. if one ball is heavier than the other, you have found the slightly heavier ball. result 2. if both balls are equal weight, the 3rd ball is the slightly heavier ball. Easy Shmeezi
Fewest - get lucky and pick the heaviest one. But wait! How would you know it is the heaviest one by just weighing one ball? Your logic is flawed. Two groups of four. Split heavier one, weigh. Split heavier one, weigh. 3 times.
i think its 3. i would take it like this OOOO OOOO then OO OO then OO problem solved. i do this everyday. bye. praise be to allah. thats it.
It's 2. Period. If you can't figure it out look it up online or in "How Would You Move Mount Fuji" (like somebody else said). This is one of the most basic brainteasers you could be asked in an interview.
The answer is 2. 1) Divide the balls into 3 groups. 2 piles with 3 balls each, 1 pile with 2 balls. 2) Weigh the 2 piles of 3 balls. If both piles are the same weight, discard all 6 and weigh the last 2 to find the heavier one. 3) If 1 pile of 3 is heavier than the other, discard the lighter pile and the pile of 2 balls. Weigh 2 of the remaining 3 balls from the heavier pile. If both of the weighed balls are equal, the last ball is the heavier one.
2=if all the balls are identical and you pick up the first...weigh it and the second one is lighter or heavier then you've found the heavier ball in the least amount of attempts.
1=if all the balls are identical and you pick up the first...balance it and the second one is lighter or heavier then you've found the heavier ball in the least amount of attempts.
Amy is 100% correct for the following reason: everyone (except Amy) is solving the theoretical problem. The practical side of the problem - notwithstanding jimwilliams57's brilliant observation that if one weighs more than the others IT IS NOT IDENTICAL (would have loved to see the interviewer's face on that one) - in order to 'weigh' them on a scale, one has to pick them up, therefore, you will immediately detect the heavier one without weighing: pick-up three and three ... no difference, no need to weight. Pick-up the remaining two to determine the heavier one. Steve
First off, take yourself through the process visually and forget square roots, that doesnt apply here and here is why: The question is the Minimum, not the MAXIMUM. BTW, the max would be 7 ( 8-1); you are comparing 2 objects, so 1 ball is eliminated automatically in the first step. Anyway, you have a fulcrom of which you are placing 2 of 8 objects on each end. If by chance you pick the slightly heavier object as one of the two balls, you have in fact, found the slightly heavier one in the first round... btw dont be a smartass with your interviewer, he is looking for smarts not smarmy;)
Show More Responses
Respectfully, the folks who are answering "3" are mathematically modeling the nature of the balance incorrectly. Performing a measurement on a balance scale is not binary. It is trinary. Each measurement gives you one of three responses: The left is heavier, the right is heavier, or they are equal. So while you do need three binary bits to specify a number from one to eight, you need only two TRINARY-DIGITS Formally, you want the smallest value of n such that 3^n >= 8. The answer is 2. Note that you could add a ninth ball, and still, you'd only need to make two measurements. Of course, the smarty pants answer would be one. Just pick two balls at random and be lucky to have chosen the heavy one. But you're not guaranteed to be able to do it in just one measurement.
English isn't my mother tongue... What is a balance scale? If looking up on Google, I find some devices with two bowls on a bar bearing in the center. Hence, the answer is once (if I'm luck enough to select the heavier ball in teh first measurement) If a balance scale allows to measure only one ball at a time, then it would take two measurements, unless you'd have more information on the weight, which is not listed here, hence doesn't exist in the context of the question^.
3 times. Not having looked at the other comments, hopefully, I am the 26th to get this right. Put the balls 4 and 4 on the scale, Take the heavier side and place those balls 2 and 2 on the scale. Take the heavier side and place them 1 and 1 giving the heaviest ball.
OK, now I read the comments and see that the people, like the question are divided into to groups, systematic approach people that say 3 (like I did) and analytic people that say 2. It takes a systematic person (me) a minute to get the answer. I'm guessing it took the analytic 5 minutes just to interpret all the ramifications of the question, i.e. they aren't idenitical if..., do it by hand..., get lucky.
minimum is 1 (if lucky - 25% chance by picking 2 balls at random) & max is 2 (using most efficientl process to absolutely determine without luck - 3/3/2 scenario)
While Symantec was busy weighing my balls I took a job with NetApp.... They need to focus on hiring good, capable security engineers, not weighing their balls.
The point of these interview questions is to both check your logical brain function and to hear how you think. Most of you are just posting jerk off answers trying to be funny, or you are really dumb. These answer get you nowhere with me in an interview. Think out loud, go down the wrong path back track try another logic path, find the answer. None of this "0 if you use your hands". That is fine if you are interviewing for a job in advertising where creativity is desired, nobody wants you writing code like an 8 year old.
You have 12 balls, equally big, equally heavy - except for one, which is a little heavier. How would you identify the heavier ball if you could use a pair of balance scales only twice?
The problem is based on Binary Search. Split the balls into groups of 4 each. Choose the heavier group. Continue till you get the heavier ball. This can be done in log(8) (base 2) operations, that is, 3.
Since there is only one scale available to weigh. You first divide the balls in half. Weigh each group, take the heaviest group. This is using the scale twice so far. Now, divide the previous heaviest group into half, weigh both groups. Take the heaviest. Divide this last group and take the heaviest. This is the heaviest ball. We have used the scale 5 times.
Show More Responses
Would it be wrong to say for a sample size as small as 8, we might as well not waste time thinking about an optimal solution and just use the scale 7 times, as this will be more efficient than coming up with an ideal solution prior to using the scale?
I stumbled across this while looking for something else on Google but I had to answer. It is 2, split balls into 2,3 and 3. weigh the 2 groups of 3 against each other. If equal weigh the group of 2 and the heaviest is obvious. If they are not equal keep heavy group of 3 and weigh 2 of the balls. if equal heaviest ball is one you didn't weigh. If not equal the heavy ball is obvious.
2 times. 8 balls. 1st step: [3] [3] [2] 2nd step: [[1] [1] [1]] [[1] [1] [1]] [[1] [1]]
No idea
The fewest number of times to use the scale to find the heavier would be Eight to One times ?
It will actually be 1 because the question asks what's the fewest amount of times which is one because you could just get lucky you can use any method you want it would still be one because that is the fewest amount of turns you can have
It's one. The fewest number of tries on using a balance scale would be one. If you put one ball on each side and one is heavier, you have the found the heavier ball.
Use an equilateral triangular lamina which is of uniform mass throughout. It is balanced on a pole or a similar structure. Steps: Place 2 balls at each corner (total 6 balls) i. if the odd ball is one of those, one side will either go up or go down. Now repeat the process with one ball at each corner including the 2 unbalanced ones. ii. if balance is perfect, repeat the process with the remaining two balls and one of the already weighed balls.
test answer 2016-01-12 00:34:07 +0000
Show More Responses
You would not be able to find a ball heavier than the others. All eight balls are identical; therefore, they must all be the same weight.
Correct answer has already been posted. I just want to contribute some theoretical analysis. Given N balls, one of them is heavier. Finding out the ball requires log3(N) trit of information. (trit is the 3-base version of bit). Each weighing may give you one of the three outcomes: equal, left-heavier, right-heavier. So the amount of information given by each weighing is upper-bounded at 1 trit. Therefore, theoretical lower-bound for number of weighings in the worst case is log3(N), which is actually attainable. So 27 such balls need only 3 weighings and 243 balls need only 5 weighings, etc.
2 as many have indicated above. The 3 is the kneejerk reaction but 2 is the correct answer.
Marty's answer is correct, but he does not explain why. The logic of the balance scale is three-valued: . Its most efficient use is the recursive application of the three-valued logic until there is only one item left. The integral ceiling of ln(x)/ln(3) thus gives the fewest number of times you have to use the balance scale to find the uniquely heaviest ball of x balls. Ceiling(ln(8)/ln(3)) = 2.
Implement a power function to raise a double to an int power, including negative powers.11 Answers
Could be implemented many ways. I got the feeling that the interviewer wanted to see you approach the problem in multiple ways and demonstrate confidence in your math and recursive skills.
#include #include #define MAX_ARRAY_LENGTH 256 double power(double, unsigned int); int main(int argc, char** argv) { double a = atof(argv[1]); int b = atoi(argv[2]); double result = power(a, b >> 31 == 0 ? b : -b); if ((unsigned int) b >> 31 == 1) { result = 1 / result; } printf("%f\n", result); return 0; } double power(double a, unsigned int b) { switch (b) { case 0: return 1.0; case 1: return a; default: return (b & 1) == 0 ? power(a * a, b >> 1) : power(a * a, b >> 1) * a; } }
c implementation of the above (no recursion): int ipow(int base, int exp){ int result = 1; while(exp){ if(exp & 1) { result *= exp; } exp >>= 1; base *= base; } return result; }
Show More Responses
int power(double n, int exp) { bool npower = (exp < 0) ? true : false; double result = 1; exp = abs(exp); // get the absolute value for (int i = 0; i < exp; i++) { if (npower) { result = result/n; } else { result = result*n; } } return result; }
C# code verified: static double Power(double d, int exp) { if (d == 0 || exp == 0) { if (exp >= 0) { return 1; } else { return double.PositiveInfinity; } } int expAbs = Math.Abs(exp); double res = d; for (int i = 1; i 0) ? (res) : (1 / res); }
double power(double x, int y) { if(y == 0) return 1; int sign = 1; if(y < 0) sign = -1; y = abs(y); double d = power(x, y/2); if(y%2 == 0) d = d*d; else d = x*d*d; if(sign == -1) return 1.0/d; else return d; }
I am surprised that not a single person here had noticed that the guy asked to raise a DOUBLE to a given power. Men, double are not integers. Their exponent is stored in a part of their binary representation. If you multiply n times a double you will make n times a rounding error and n useless calculations. Just changed the binary part of the double that is related to its exponent, and here it is, your double has been raised to a given power, a you absolutely lost no precision, and you've made 0 calculations. This is basic stuff, every university teaches that to its students... floating numbers representation...
I believe interviewer is expecting for this public static double Power(double x, int y) { double result = 1; bool isNegative = y 0) { if ((y & 1) > 0) { result *= x; } y = (y >> 1); x *= x; } if (isNegative) result = 1 / result; return result; }
Verified C# static double Pow(double b, double exp) { if (exp == 0) return 1; else if (exp > 0) return b * Pow(b, exp - 1); else return 1 / Pow(b, -exp); } Does it get more compact?
TD's answer is interesting, but not very useful. If you actually try it you'll find that since the double's base is 2, any changes to the exponent portion approximately multiply (or divide) numbers by a power of two. I say approximately here, since TD forgot to mention that the number itself isn't stored in float point numbers, only the digits after the implied 1. So yes, it's important to know how floating point numbers work, but modifying the exponent portion of a floating point number is a fundamentally incorrect solution.
public double power(double num, int exp) { if(exp == 0) return 1; double res = 1; for(int e=Math.abs(exp);e>0;num*=num,e>>=1) { if( (e&1) == 1) res *= num; } return (exp>0)?res:1.0/res; }
Describe a routine which returns the set of integers in {1..100} divisible without remainder by 3 but not by 9.12 Answers
I'm assuming the question wants us to find integers that are divisible by 3 but not by 9. This can be easily obtained using a mod function inside the following if statement: if(number % 3 == 0 && number % 9 != 0) Here is a short program I wrote in c++ to show how to solve this problem. Instead of returning the set of integer, I just printed them out on the screen: #include #include using namespace std; int main(int argc, char** argv) { int i = 0; vector list; vector::iterator it; for(i = 1; i <= 100; i++) { if(i%3 == 0 && i%9 != 0) { list.push_back(i); } } for(it = list.begin(); it != list.end(); it++) { cout << *it << endl; } return 0; } If I missed anything, please let me know. Happy coding and problem solving!
That'll certainly work, Tyler, but the OP indicated he was interviewing for a Ruby On Rails - not C++ - gig.
put those integers into an array, pick every third element, out of which discard every third element.
Show More Responses
python [x for x in range(0,100) if x % 3 == 0 and x % 9 != 0]
1) start from number = 3 Loop while(number <= 100) 2) display number 3) number = number+3, display number 4) number = number+6 Loop
(1..100).map { |i| (i % 3).zero? && !(i % 9).zero? ? i : nil }.compact
(1..100).select { |x| x%3 == 0 && x%9 != 0
matt has the best answer
A variation on Matt's answer: (1..100).select { |n| n % 3 == 0 }.reject { |n| n % 9 == 0 }
The requirement doesn't say if the input has to be a Range. If it doesn't have to be, then we don't need to traverse each element but to simply calculate it. def get_nums_by_3_not_by_9(max) arr = [] x = max.to_i / 3 x.times do |i| next if i % 3 == 0 arr << i * 3 end return arr end
(1..100).select do |n| n%3 ==0 and n%9 != 0 end
(1..100).to_a.delete_if{|x| !(x%3==0 && x%9>0)} or (1..100).to_a.select{|x| x%3==0 && x%9>0} or (1..100).to_a.map{|x| x%3==0 && x%9>0 ? x : nil}.compact or (1..100).to_a.reject{|x| !(x%3==0 && x%9>0)}
To find and return the common node of two linked lists merged into a 'Y' shape.13 Answers
how did the two linked lists make their poses to merge into a 'Y' shape, one's head attached to the waist? please explain more to help understand the question
The two linked lists were something like: 1->2->3->4->5 and 3->4->5->6->7->8.
For a Y shaped like this: 1 -> 2 -> 3 -> 4 ->7 -> 8 -> 9 5 -> 6 -> 7 -> 8 -> 9 where the trunk portion is of constant length, it is easy. Get the length of the first list. In our case 7. Get the length of the second list: 5. Difference is 2. This has to come from the legs. So, walk the difference in the larger list. Now node1 points to 3. node 2 points to 5. Now, walk through the two lists until the next pointers are the same.
Show More Responses
@kvr what if the lists are 1-2-3-4-7-8-9 and 12-13-14-5-6-8-9
Can this be done using hash tables? Or is there anything more efficient?
i think that kvr's answer is the best. @snv if the two lists are linked by the very last two nodes, then you would find out after you are checking the values of the second two last two nodes. you just got unlucky and basically have to check until the very end. so basically, as a diagram with your example, it would look like this 1 -2 -3 -4-7-8-9 x -x -x -x -x-o 12-13-14-5-6-8-9 (sorry about spacing) but because you know the difference in length is 0, you can start comparing the two lists of nodes one by one. from the very beginning.
HASH TABLE seems the only efficient wt. 1. add each element's address (of the smallest list)and push it to the hash table. 2. start walking second list. 3. get element compar eits address with hash table if match is found in hash table, return 4. if list is not exhausted, go to step 2. 5. return NULL
Hashtable is complete overkill. The point is to realize that the two linked lists have the same tail. That means if you traverse them with the same index but from the right you will eventually find the first similar node. It's almost as easy if the problem said the two linked lists had the same prefix, find the first node on which they split. Here you walk them with the same index from the left.
First reverse both list and find point where both gets diverged
For Y condition the list could be List 1: 1->2->3->4->5->6 List 2: 7->8->9->4->5->6 So reverse list would be 6->5->4->3->2->1 6->5->4->9->8->7 now compare two list and move forward the position where you find next node of both are different is the point of merging
Some of the above will work for doubly linked list. If not, travel node by node simultaneously from each end. When one traversal ends and the postion of cursor at the traversal is the answer
kvr's answer is good but I think it could be optimized better by using 2 stacks. Traverse both lists putting each value into 2 separate stacks. Then when both are fully traversed, the head of each stack will match. Pop one off each at a time till they don't match, return the last popped. But I suppose it comes down to where the first match is at. If its the beginning of the list, kvr's answer will be better, if its at the end or bottom half 2 stacks would be better.
Let's say L1 is the list starting with the lower number, and L2 is the other Set X = Head of L1 Set Y = Head of L2 While X <= Y Set X = Next(L1) End While If (X==Y) Return X Else While Y<=X Set Y = Next(L2) End While If X==Y Return X End If End If Repeat until you reach the end of either list.
Determine if an array from 1..n has a duplicate in constant time and space.12 Answers
Correct answer is to place each value in the array in its corresponding index (i.e. if array[x] = 3, put 3 into array[3]). If an index already contains its corresponding value, there's a duplicate.
^^ Sorry, that's linear time *and* at best linear space, you fail.
What are the properties of an array that affect time complexity? Usually we're talking about the size of the array, N, such that linear time operations, O(N), are those that perform an operation on each of the elements in the array. However, an important thing to consider is that you can evaluate N (the size of the array) itself in constant time. The only way this can be done in constant time is if the input satisfies the precondition that "1..n" means there are no *missing* values in that range. In other words, such an array from "1..5" must contain at least one instance of the numbers 1, 2, 3, 4, and 5. With that precondition, you know that the length of the array will be 5 if no duplicates and greater than 5 if it does contain duplicates.
Show More Responses
SUM(array) - (N(N+1)/2) = missing number.
@Facebook Intern: That wont help .. In case there are 2 duplicates this can be broken. {1, 1, 4, 4}
I attach pseudo code here: FindDuplicate(A) i = A.length j = 1 count = 0 while j < i if A[--j] - j == 0 j++ else count++ return count count holds the number of duplicated items
This cannot be done in linear time unless the data-structure used to hold the integers has a property that immediately flags duplicates upon insertion. For e.g. like in a Dictionary/HashMap.
I'm pretty sure OP posted something wrong there, and they were probably asking to do it in linear time and not constant. If it's constant, the way I would do it would be using a HashSet to check if the key (value in array) is contained, and if not add it to the set. If at any time I find an element that's already inside, return false;
If an array has elements from 1 to n the size of the array will be n, thus if the size of the array is greater than n, there must exist a duplicate.
I think they are just asking to determine if there is any duplicate number ir not. Its not mentioned to find out which number it is. So that we can find out by using sum of n numbers
I think they are just asking to determine if there is any duplicate number ir not. Its not mentioned to find out which number it is. So that we can find out by using sum of n numbers
They asked for constant time. So checking sum will not work. For zero indexed arrays, Check if arr[len(arr)-1] == len(arr) - 1.
Software Engineering Intern at Google was asked...
how would you find the shortest path between two nodes in a social network?7 Answers
do breadth first search from both ends at the same time. Keep a set of all nodes that each has reached. When the sets have any element in common, there is a path.
Does the above method have any advantage over the method in which we do bfs from one node of the nodes and stop when the other node is reached?
BFS from both sides is massively faster than just doing BFS from one. Suppose each person has k friends and that the two nodes are d apart. BFS from one node is O(k^d). BFS from both nodes is O(k^(d/2)) -- the exponent is half as big. To put some example numbers on it, if each person has 100 friends and they are 10 apart, then BFS from one node takes 10^20 operations, whereas BFS from both nodes is 2*100^5= 200 billion operations. BFS from one node is intractable. BFS from both nodes is slow, but tractable.
Show More Responses
How about using Dijkstra's shortest path algorithm? Isn't that more efficient than a bfs?
If you only care about the distance between two nodes and every edge length is 1 (both of which are true in this problem), then Dijkstra's shortest path algorithm basically is breadth first search (and BFS from both sides is faster than a simple BFS). If that doesn't make sense, then explain how http://en.wikipedia.org/wiki/Dijkstra's_algorithm#Pseudocode is different from a breadth first search in this case and I will clarify.
Aren't you ignoring the time taken for checking for a common element in the two sets (which will be O(k^d))?
Checking for set inclusion is constant time (assuming a reasonable hashset). Thus, it is O(1) to know whether or not a node that I add to one side's fringe is already in the other side's fringe. Does that make sense?
Given two strings representing integer numbers ("123" , "30") return a string representing the sum of the two numbers ("153")13 Answers
I don't understand...it's a very stupid question! return Integer.toString(Integer.parseInt("123") + Integer.parseInt("30));
It's not stupid a stupid question. What if the strings have 10000 characters?
It's not stupid question, but it's not hard either. I believe the way to do it is to implement the manual addition process by looping through the digits starting from the right to left and adding them one by one. This is an O(N) operation. I'm not sure if there is a better way to do it.
Show More Responses
lol it is a stupid question i agree. All you have to do is parse the strings add em parse em again and return em
It is basic but yet not stupid. I assume that the interviewer asked to implement atoi and itoa (in case the interview was in C/C++).
The interviewer wanted a loop through the digits starting form right to left, adding them one by one, and keeping track of the carriage.
public static String sumStrings(String a, String b){ char[] num1 = a.toCharArray(); char[] num2 = b.toCharArray(); int i = num1.length - 1; int j = num2.length - 1; StringBuilder sumString = new StringBuilder(); int carry = 0; while(i >= 0 || j >= 0){ int d1 = 0; int d2 = 0; if (i >= 0) d1 = num1[i--] - '0'; if (j >= 0) d2 = num2[j--] - '0'; int sum = d1 + d2 + carry; if (sum >= 10){ carry = sum / 10; sum = sum % 10; }else carry = 0; sumString.insert(0, sum); } return sumString.toString(); }
public class StringToInt { public int stringToInt(String str) { int tens = 1; int num = 0; for(int i = 0; i < str.length(); ++i) { num += (str.charAt(str.length() - 1 - i) - '0') * tens; tens *= 10; } return num; } public int addStrings(String str1, String str2) { return stringToInt(str1) + stringToInt(str2); } public static void main(String [] args) { StringToInt s = new StringToInt(); System.out.println(s.addStrings("145", "23")); } }
@Conner What if the strings are 1000 characters long? does your int tens and int num variables support that?
int stringToNumber(char *a){ char *end = a; int it = 1; int acum = 0; while (*end != NULL){ end++; //move pointer to last char of string } while (&end != &a){ acum+=((*end - '0') * it); it *= 10; end--; } return acum; } int sum (char *a, char *b){ return stringToNumber(a) + stringToNumber(b); }
import java.util.Arrays; import java.util.Scanner; public class AddNumericStrings { public static void main(String[] args) { final Scanner in = new Scanner(System.in); while (true) { System.out.println("Enter 2 numeric strings : "); String x = in.nextLine(); String y = in.nextLine(); System.out.println(add(x.toCharArray(), y.toCharArray())); } } private static char[] add(char[] big, char[] small) { char[] result = new char[big.length + 1]; Arrays.fill(result, '0'); for (int i = big.length - 1, j = small.length - 1; i >= 0 || j >= 0; i--, j--) { char x = big[i]; char y = '0'; if (j >= 0) { y = small[j]; } int val = x - '0'; val += (y - '0'); result[i+1] += val % 10; if (val > 10) { result[i] += (val/10); } } return result; } }
You all know that negative integers exist, right? The question does not specify if the integers are non-negative. One just assume, therefore, that negative integers are possible. It would not be called subtraction. Subtraction does not exist. It would just be addition of the additive inverse.
Software Engineer Intern at Facebook was asked...
Generate a new array from an array of numbers. Start from the beginning. Put the number of some number first, and then that number. For example, from array 1, 1, 2, 3, 3, 1 You should get 2, 1, 1, 2, 2, 3, 1, 1 Write a program to solve this problem.7 Answers
int[] Reformat(int[] original, int length) { LinkedList list = new LinkedList(); int currentCount; for(int i=0;i
function numberArray( $arr ){ $a = array(); $number = null; $c = -1; foreach( $arr as $v ){ if( $v != $number ){ if( $number ){ $a[] = $c; $a[] = $number; } $number = $v; $c = 1; } else { ++$c; } } if( $c > 0 ){ $a[] = $c; $a[] = $number; } return $a; } var_export( numberArray( array( 1,1,2,3,3,1 ) ) );
$val) { echo $val . "\t"; } echo " \n"; } ?>
Show More Responses
working in php: sizeof($list)-2) || ($list[$i]!=$list[$i+1])){ $result[]=$count; for($j=0;$j
vector reformat(int arr[], int size) { vector res; int j, count = 0; for(int i = 0; i < size; ) { cout << i << endl; count = 0; for(j = i; j < size; j++) { if(arr[j] != arr[i]) break; count++; } res.push_back(count); res.push_back(arr[i]); i = j; } return res; }
int i=0; int j=1; ArrayList array=new ArrayList(); while(i
@Anonymous: Your inner while loop will cause an out-of-bounds exception to be thrown when your scanning hits the end of the array. Your while loop will try to access givenArr[i+j] even when j increments to the point that surpasses the length of the array. You need while((i+j) != givenArr.length ... )
Software Engineer Intern at eBay was asked...
Questions related to data structures like "What data structure would you use for a browser's BACK & FORWARD ability"6 Answers
May be Stack , any one please correct me if I am wrong.
This can be implemented by using two different stacks, one for back and one for forward.
Command Pattern
Show More Responses
I would use doubly link list
Doubly linkedList
Use two stacks. Every time you visit a site, push its address in stack1. When you press back, pop from stack1 and also push in stack2. When user presses forward, pop from stack2 and also push in stack1.
25 racehorses, no stopwatch. 5 tracks. Figure out the top three fastest horses in the fewest number of races.11 Answers
We can do it in seven races, we'll call them races A-F. For notation, we'll say that the Nth horse in race X is called X.N. Races A-E: Divide the horses into 5 groups of 5 each such that each horse races only once. We can eliminate the slowest 2 horses in each of the five races because there are definitely 3 horses faster in each case. As a result, we eliminate 5x2 = 10 horses: {A.4,A.5,B.4,B.5,C.4,C.5,D.4,D.5,E.4,E.5} Race F: Race the fastest horses in each race A-E: {A.1, B.1, C.1, D.1, E.1}. To simplify notation, we'll label F.1 as horse A.1, F.2 as horse B.1, and so forth. That means the winner of this race is A.1, and it is the fastest horse of all. We don't have to race A.1 anymore. We can eliminate D.1 and E.1 = 2 horses. Because they are not in the top 3. As a result, we know that all remaining horses from D and E are eliminated. This is D.2,D.3,E.2,E.3 = 4 horses. We know that A.1,B.1, and B.2 are all faster than B.3 (and similar for C.3) so they are not in the top 3.We can eliminate B.3 and C.3 = 2 horses. Finally, we know that A.1 is faster than B.1, which is faster than C.1, and thus C.2, so we can remove C.2 = 1 horse. Race G: We have removed 19 horses from competition and are sure that A.1 is the fastest horse of them all. This leaves just 5 horses: {A.2,A.3,B.1,B.2,C.1}. We race them and select the top 2 to join A.1 as the top 3 fastest horses.
just run them all on the one track :) one race, and you get your 3 fastest horses in one go........or am I missing something!
6 races. Divide 25 horses into 5 groups. Each group races and the fastest is selected. The winner of each of the 5 races all race together. Pick Top 1,2 and 3. My only concern: Could the answer be this simple?
Show More Responses
B, you're mistaken. Imagine the top three fastest horses are Santa's Little Helper, Yojimbo, and I'm Number One. By random luck, in your first race, the five random horses you choose includes all three of those. I'm Number One wins and goes on to the final race; the other two do not.
8 5 top horses from each race of 5 races (25 / 5) 5 top contenders race; 1 wins--that's one top horse (5-1) 4 remaining top horses race, one wins; that's 2 top horses (4-1) 3 remaining top horses contend; winner is #3 That's 3 top horses from 8 races
Race#1 Race#2 Race#3 Race#4 Race#5 A1 B1 C1 D1 E1 A2 B2 C2 D2 E2 A3 B3 C3 D3 E3 A4 B4 C4 D4 E4 A5 B5 C5 D5 E5 Race#6 A1 B1 C1 D1 E1 Let's Say ranking 1st 2nd 3rd 4th 5th Eliminate D1 E1 D2 E2 D3 E3 A4 B4 C4 D4 E4 A5 B5 C5 D5 E5 Left with B1 C1 A2 B2 C2 A3 B3 C3 Eliminate C3 as there are more than three faster horses C2, C1, B1, A1 Eliminate C2 as there are three faster horses C1, B1, A1 Eliminate B3 as there are three faster horses B2, B1, A1 Left with 5 horses for Race#7 B1 C1 A2 B2 A3 So 7 races
7 races. put 25 horses in 5 group. and we will have 5 sorted list of horses in each group. put 1st place horse in each group, and we will have a sorted list X. X_1 is the 1st place horse, and X_2 is 2nd place horse's candidate, X_3 is 3rd place's candidate. 2nd place horse in X_1's group is candidate for 2nd place, 3rd place one is candidate for 3rd place. and 2nd place horse in X_2's group is a candidate for 3rd place. that's 5 horses in total, 2 from X_1's group, 2 from X_2's group, X_3. race them, and 1st place is 2nd place, 2nd place is 3rd place horse.
the answer is one race as the question doesn't specify all the horses have to run in separate races.
0 Races. Ask the jockeys to rate the 10 fastest horses and take the average of the top 3. Nobody knows the horses that are fast better than the jockeys. Race results can vary from race to race but the jockeys truly know the fastest and besides because race results vary anyway you will not find the fastest horses with the least races you will find the fastest on that day. Either way your results will not be accurate without a larger dataset. The jockeys however already have a deeper dataset.
Better yet find the local bookie for the track and ask for the odds on the horses. Why solve a problem that has already be solved.
See Interview Questions for Similar Jobs
- Software Engineer
- Intern
- Software Engineering Intern
- Software Developer
- Senior Software Engineer
- Software Development Engineer
- Software Engineering
- Data Scientist
- Technology Analyst
- Product Manager
- Engineering
- Analyst


text:
Register Now! 2017 College Board Regional Forums
This document will open in a new window.
If you are using assistive technology and need help accessing this document in another format, please contact us via this email address:
Register Now! 2017 College Board Regional ForumsCollege Board Communications
The College Board Regional Forums are the annual gathering of education professionals across the six regions.
Attend workshops and sessions to learn about successful strategies and best practices.
Meet and share insights with professionals from your region.
Find out about successful partnerships. Great things happen when professionals from different areas of education work together.
Find out more about your Regional Forum below.
Western Regional Forum
Feb. 8–10, 2017 | Orange County, CA
Find Out More About Western Forum
Southern Regional Forum
Feb. 15–17, 2017 | Atlanta, GA
Find Out More About Southern Forum
Southwestern Regional Forum
Feb. 22–24, 2017 | Houston, TX
Find Out More About Southwestern Forum
Midwestern Regional Forum
Feb. 26–28, 2017 | Indianapolis, IN
Find Out More About Midwestern Forum
New England Regional Forum
March 1–3, 2017 | Boston, MA
Find Out More About New England Forum
Middle States Regional Forum
March 15–17, 2017 | Brooklyn, NY
Find Out More About Middle States Forum
Add new commentYour email address will not be published.
* Required


text:
Aside from a couple of obvious bands the new thrash scene is really lacking in crossover bands. There's something oddly satisfying about adding more punk and hardcore elements to thrash, as the general barbarian attitude of crossover really compliments thrash well. Chemical Way joins the few new bands of this style with their first EP, "U.F.NO!", which was released last year. The release tends to feature pretty much all of the clichés of crossover: shortish songs (though not at S.O.D. levels), very basic shouting/yelling, gang vocals, samples to open songs, and relatively simplistic riffs. Even the lyrics are a bit outside the box from what you'd expect. This is usually a good thing, but in the appropriately titled "Final Crapper", they do interfere with the enjoyment of the song.
One pretty easy comparison for this release is Nuclear Assault, primarily because the style of Chemical Way's riffs can be quite similar. There are a few mid-paced riffs that much like Carnivore and Nuclear Assault, inevitably will lead to massive circle pits. With that said, the majority of songs are pretty fast throughout. It's just that the band knows when to slow it down. At certain points, you almost expect Peter Steele to jump in with "kill each other!", as the band speeds up again. The sound quality on "U.F.NO!" is pretty solid. None of the instruments sound particularly out of place or are poorly done. The bass is easy to hear (for thrash, at least), especially as it leads the intro of "Chain Reaction". At times, the drums can sound a bit noisy, but the playing is really tight, so it doesn't detract from the release. Overall, this is a pretty enjoyable release. It isn't perfect, but it's easy to see how Chemical Way could definitely grow into a great thrash band.
Be sure to check out and like Chemical Way on Facebook!
"Blood and Oil"
Final Rating
3.8/5 or 76%.
Written by Scott


text:
This California boy welcomes opportunity to play in New England
Note to readers: Beginning today and continuing throughout the Major League Soccer season, New England Revolution defenseman AJ Soares will be a guest contributor to Corner Kicks. This is his first entry.
How did I get here to the snowy banks of Boston? Well, Steve Nicol and the staff here at the New England Revolution picked me at No. 6 overall in the 2011 Major League Soccer SuperDraft. Of course, the first question that people ask is, will I be able to handle moving from California to Massachusetts? And the answer is, of course I will. The cold? I like it. The distance from home? I embrace it. And the Dunkin Donuts coffee? I love it. And the truth is, my brother lived in Boston for five years, so I know this is a place that will be my home as soon as I get settled in. In fact, the people here in New England have been so great that the transition has been easy.
The hardest thing so far was day one with my new car, shoveling the snow and scraping the windshield so I could get to training on time. And, even though Ive been told hundreds of times via Twitter that I will soon get sick of this, I actually didnt mind it at all.
So, if you want to give me the inside scoop on my new home, or hear how much Im liking the new spot, follow @AjSoares on Twitter, and check back in here for my next post. Its time for me to dip out, ice bath, and get ready to get to work again tomorrow with the team. Im looking forward to an awesome season in the great sporting region, New England.
The author is solely responsible for the content.
Translate this page
Loading menu...
To our readers,
We've added a translation feature to the Corner Kicks blog to assist readers who may be more comfortable reading another language.
Google Translate is not perfect -- we're aware of that -- but it is quite good at getting the main points of the story across. We've successfully used it on The Big Picture, Boston.com's extremely popular world photography site. I'd be eager to hear your feedback on its use in Corner Kicks, in whatever language.
David Beard, Editor, Boston.com


text:
Annuity Partners
Allianz NY
American Equity
American National
Athene Annexus
Atlantic Coast Life
Banker's Life
Colorado Banker's Life
Delaware Life
Fidelity & Guaranty
Global Atlantic Financial Group
Great American
Legacy Marketing Group
Lincoln Financial
Lincoln Financial NY
Minnesota Life
Mutual of Omaha
National Integrity NY
National Life Group (Life of the Southwest)
National Western Life
Nationwide Annexus
New York Life
North American
Oxford Life
Pacific Life
Penn Mutual
Protective Annuity
Reliance Standard
Royal Neighbors
State Life
The Standard
U.S. Life
Voya Financial
Note: Other carriers may be available. Some restrictions to proprietary products may apply.
Annuities You'd Sell To Your Family
If you could forget everything you know about annuities and create your own, what would it look like? That's the very question we asked hundreds of the top producers in the industry as we helped found Annexus, nearly ten years ago.
We then designed our own annuity products to compete directly with the insurance giants. Where insurance industry profits removed any motivation for them to invest in innovation, we saw an opportunity to create superior annuities that are intuitive to your clients.
A simple, transparent model
You know that the old annuities model contains hidden parts; costs and clauses that even top producers sometimes don't even know about. These don't serve your clients and they create a product that is harder for you to sell.
For example, many agents take it for granted that many issuing companies only track annuity interest on the anniversary date. That means if you sold the annuity in January and your client dies in November, the client's survivors lose out on eleven months of interest.
We have the ability, through technology, to track values daily. Your Annexus clients never lose hidden interest.
Setting new records
Starting in 2006, with the most successful annuity launch in history, our first year generated $1.125 billion in business with 3,300 agents. In 2010, we did approximately $3 billion with fewer than 5,000 agents.
Our largest competitor will do about the same dollar amount—with an army of 80,000 agents!
There's no doubting the uniqueness of our products and the level of professionalism of our agents.
Can anyone sell Annexus products?
Because of our focus on transparency, full disclosure, product suitability, and sales practices, you'll complete thorough training and testing before you can sell Annexus products. This level of training aids you because you'll be more comfortable selling Annexus products than any product you've sold before.
Agents tell us that because they understand Annexus products so much more than other products, they're more comfortable with the sale and so is their client. Many agents would prefer to sell nothing else.
Protecting your market
In order to give you an advantage in the marketplace, we have chosen to patent our leading-edge technologies. The industry is waking up and following the lead Annexus has set, but it is difficult for our competitors to offer products this attractive.
The right carriers
Finding the right insurance company to underwrite our proprietary Annexus products is essential. That's why we have interviewed many of the largest financial institutions in the industry to find the right carrier partners to manufacture the products.
Top insurance carriers are attracted to Annexus because we bring turnkey financial product innovation coupled with the most powerful distribution network in the country and we've aligned the interests of clients, reps, and carriers to deliver a new, transparent service model.
Annexus –success today and tomorrow
Our product development partners at The Genesis Group are constantly researching and developing new technologies for our future products. As the concepts materialize and the technologies mature, they are integrated into new product design and annuity prospecting ideas. We keep the pipeline full.
Our product development plans reflect changes in the markets. The results of demographic, regulatory, and legal changes shift the direction of our product development initiatives. We focus on strategic solutions positioned to provide superior products in these new environments.
The products you sell through Annexus today are only the beginning. We have products in the pipeline that won't be mature for four or five years. That's how far ahead we're planning your success and ours.
Annexus – unbridled growth potential fueled by unprecedented innovation.
Learn more about Annexus products at one of our agent training experiences in Scottsdale, Arizona.


text:
Today, most kitchens are the focal point of any family home. Open-planned spaces, island units and breakfast bars are the common ingredients used to make up a typical 21st century kitchen. Rewind 100 years though, and this wasn't the case. Discover how the kitchen has evolved from humble beginnings to the heart of the home as The LuxPad explores the history of kitchen design…
Cooking in the Middle Ages was, like today, a sociable and communal affair. As the only source of light and heat, all activity revolved around a central fire which was often placed in the middle of a large communal room.
A significant problem for these communities were the vast swathes of smoke and soot produced by their constantly lit open fire. It was not until the 16th century that chimneys were widely adopted throughout households in Europe. So large were the chimneys that they effectively separated the room into two areas, one for cooking and one for living. The kitchen as we know it today had begun to take shape…
The economic and social changes that occurred across the 18th and 19th centuries meant the kitchen was now more in demand than ever before. Increased trade and a growing appreciation of foreign cuisines encouraged more elaborate styles of cooking. For the wealthy, food was seen as a clear symbol of status and so servants were employed to create these lavish meals with countless courses. Even for the less wealthy, new technologies such as the cast iron stoves boosted productivity and efficiency in the kitchen.
At this time, the kitchen space itself was regarded as a necessary evil. Despite the large numbers of servants required for cooking and cleaning, the rooms were often dark, cramped and relegated to the back of the home – far away from any entertaining spaces. It was a sign of poor hospitality for any sounds or smells from the kitchen to permeate the rest of the house.
If the pace of change in the 18th and 19th centuries was quick, then by the 20th century it was unstoppable. With Europe and America gripped by industrialisation, the kitchen was one of the rooms where this change was most noticeable. Factories were now producing everything from cotton to steel, and soon mass-produced appliances for the kitchen began to find their way into people's homes. Crucially, cabinetry and storage units were produced in greater quantities and far cheaper than ever before. Most famous of these was the Hoosier Cabinet, a space-saving unit that was produced and distributed across America in the first half of the 20th century.
The introduction of gas stoves was another major development of the early 20th century. In previous decades households had relied on coal and charcoal to fuel their kitchen equipment, but gas was a much more convenient and efficient source of energy. Still, kitchens were viewed as a room that was only to be used for practicalities – socialising and entertaining were conducted elsewhere.
The 1920s was the decade which saw the most dramatic overhaul of the traditional 19th century kitchen, thanks to the efforts of one woman. Margarete Schütte-Lihotzky was an Austrian born architect who was asked to help solve the post-war housing crisis that existed in many of Germany's large cities. She wanted to design a kitchen that was practical, efficient and compact. Her revolutionary kitchen, known as the Frankfurt Kitchen, has been heralded as the prototype for modern-day, fitted kitchens. Its compact design meant everything was in arms reach, saving women valuable time on their domestic chores. It also gave birth to the idea of the 'golden triangle', in which the cooker, fridge and sink are ideally placed for maximum efficiency.
From the 1940s, integrated kitchens dramatically altered the look and feel of the space. Gone were the free-standing Hoosier cabinets and in their place came rows of gleaming, fully fitted cupboards, work surfaces and appliances. While the earlier decades of the 20th century concentrated on ergonomics and practicalities in the kitchen, the 1940-1980 period saw an emphasis on aesthetics. Homeowners became more demanding – matching appliances, utensils and cabinetry were common requests. In short, kitchens were now a room that homeowners wanted to be proud of.
The 1950s English Rose kitchen quickly became the pinnacle of interior fashion. With sleek cabinetry, built in white goods and a streamlined style – it was everything the 1950s housewife wanted it to be. Its hefty price tag only added to its luxury appeal. In fact, such was the allure of the English Rose kitchen, that imitations quickly began to spring up across Europe. By the 1960s and 70s, cheaper kitchens built from MDF replaced their sturdier predecessors, and nearly all English Rose kitchens were sent to the scrapheap. Today however, the English Rose kitchen is hailed as an iconic design of its time. Its revival in popularity has sparked many a contemporary kitchen designer to produce their own versions.
Today, kitchens have evolved to become the heart of the home. A culmination of the centuries that came before, kitchens are now designed to be one of the hardest working rooms in the house. Homeowners want their kitchens to be spacious, light, practical and stylish, with space for cooking, entertaining, relaxing and working.
But what is in store for the future of kitchen design? Gadgets like self-cleaning ovens, boiling water taps and instant ice machines are already a common feature of contemporary kitchens. Even more high-tech are the smart kitchen devices that are a hot topic of conversation in the technology space right now. From fridges that re-order your milk for you when it can sense you're running low, to knives and forks that send a signal to you to eat more slowly, the internet of things revolution is just around the corner. Bon appétit!


text:
Build a comment box widget using Javascript/HTML/CSS/Ruby on rails.
Rozpočet $15-25 AUD / hod.
Build a comment box widget using Javascript/HTML/CSS.
Requirements are below:
1) comment widget:
a) I need a comment widget that accepts testimonials from visiting users to a webpage.
b) It detects visiting user's facebook login status and display's his/her photo and name.
c) The widget then saves the comment with status as 'Pending' along with the user details through an application server connected into a mysql db server.
d) Widget shows photo, name, testimonial comment for all the entries that are saved in the DB with status as 'Approved'
e) The widget should be developed such that it can be placed into any web page by including JS/CSS in the page html.
f) The widget should allow page scrolling of comments (50 comments/page)
g) The widget can be resized through the parameters passed into the widget javascript
h) Number of comments to be shown through each page is also passed in as a parameter
2) comment moderation:
a) Comment moderation is done through a server site where admin can login
b) There are three tabs pending, approved, blocked
c) Pending tab displays the comments that have been posted by have not yet been approved by the admin
d) The pending comment can be approved or blocked
e) Approved comments are shown in approved comments tab
f) Blocked comments are shown in the blocked comments tab
30 freelanceů na tento projekt zveřejnilo nabídku v průměrné hodnotě $20/hod.
We are a London (Shoreditch) based rails studio. Please get in touch to discuss further. Following are some of our recent projects; [login to view URL] a freelancing marketplace built using Rails 4.2 a Další
Hello Sir, First of all, we would like to tell you how we will initialize the project with you. According to your project description, our team would like to discuss with you, to get more understanding of the Další
Hello, i have rich experience with Ruby on rails. Please contact with me so that we can start work now. If you hire me, you will get great chance~! I am ready for you right now. thank you.
Hello, I hope you are doing well, We are Sphinx solution, a Software Solutions and Services Company of 110+ in-house developers and designers specializing in Mobile Apps Development, Web Technologies, Software Testi Další
Hi, Greetings for the day, I have gone through the project description and this is definitely in our wheelhouse and we would love to help you out on this. We have been developing/maintaining various web applic Další
Dear, I have 5+ years experienced in Web Development. I'm full stack Ruby On Rails developer, I have experience in developing the application like you want with, i can do this job very well. Specialties: Ruby on Další
Hello there, I am a senior ruby on rails engineer with over 5 years of experience. I am so interested in your job as I've developed similar features before and I have good experience in haml, erb, coffee, javascript Další
I have read your project description, I feel very excited to be a part of your project and I love to share my great experience in your application. I have 5 +year experience in ruby on rails with other technologies, Další
Hi, I am looking for a good opportunity as a developer in Ruby on Rails. I have almost 7 years of experience with Rails development, among other technologies. I have experience working with the following technol Další
Hello, I have worked on widget before, please send me a message so i can share my work, I am a skilled and experienced Developer having 7+ years of experience in ROR Web Development, Front-end Development, API Devel Další
Hello, Hope you are well. I just read your project description and finds it a perfect match for me as I have an extensive experience relevant to this. Though I'm new to this site I have an extensive 9 years experien Další
Hi, I've huge working experience in rails as I have been working as web developer for 6.2 years and I've helped various business from start-ups to established companies in building web applications, fix bugs, mainte Další
Hi, Greetings from Young IT Minds!!! Thanks for the job posting. Yes, we are ready to assist you with your Development of a comment box widget project. We have highly qualified ROR Developer and have been doing grea Další
comment chat we integrate this in my current project so i have full understanding of this, lets have a call to discuss this in detail. I have more then 11 years of exp, successfully integrated Anjularjs, reactjs and Další


text:
Six Welsh businesses have been named among the winners of the Queen's Awards for Enterprise in celebration of Her Majesty The Queen's 91st birthday.
Business secretary Greg Clark today named the winners with six businesses from across Wales being recognised for their contribution to sustainable development, international trade and innovation.
The winners include businesses leading the way in a broad range of industries - from a remote water leak monitoring system, and an apprenticeship scheme in the construction industry, to development and manufacture of environmental packaging systems, and a sea salt manufacturer.
Now in its 51st year, the Queen's Awards for Enterprise are one of the most prestigious business awards in the country, with winning businesses able to use the esteemed Queen's Awards emblem for the next five years.
The businesses include:
Speaking about the winners, secretary of state for Wales, Alun Cairns, said: "The Queen's Awards highlight the best of British business – rewarding their strong entrepreneurial streak, their ambitions to succeed at home and overseas and the crucial contribution they make to our economy.
"From Anglesey to Monmouth, the Welsh companies awarded today are beacons of success, demonstrating that every corner of Wales is open for business. They can all be rightly proud of their achievements. I hope their successes will become the inspiration for other Welsh businesses to strive for this prestigious award in the future."
Business secretary Greg Clark added: "The Queen's Awards for enterprise highlights everything that's great about UK business today.
"We have some of the best entrepreneurs and innovative minds in the world who are at the heart of small start-ups providing excellent customer service to larger businesses developing global solutions. Over one million new businesses have been created since 2010, all playing a vital role in creating jobs and driving growth across the UK.
"I'm extremely proud to see such a wealth of businesses across Wales being recognised today. Through our Industrial Strategy we will be building on the successes of these award winning businesses, helping to build a stronger, more outward looking and prosperous global Britain."
Our BQ Bulletin emails will land in your inbox at 7.30am, Monday to Friday, with a mix of the latest local business news, national news, and features to inspire you. Sign up here!
Click here to read our privacy statement


text:
Trailer for season 4 of Lost Girl introduces new villain
Lost Girl Season 4 trailer for Syfy released.
Welcome to America, where Canadian shows take months and months to be released here (if at all). Lost Girl, unfortunately is no exception, although I can't understand why. So while our Canadian friends have already been enjoying the new season, we Americans have to wait until after the new year.
Fortunately for us, the new year is almost here. And with it being so close, the promo material for the new season of Lost Girl has started coming out. In this new trailer, for example, we get a sneak peek at season 4 of the series and are introduced to a brand new villain.
Don't miss the premiere of Lost Girl season 4 on Syfy on January 13th at 8/9c.
Related articles


text:
Following the launch of SymNet Composer 4.1, Symetrix has bolstered its control and command offering for Symnet open architecture Dante-scalable DSPs with the addition of three new control options.
The first of these options, the ARC-3 wall panel remote, was introduced to the systems integrator community at ISE 2015. Arriving in a single SKU with both surface- and flush-mount capabilities, ARC-3 incorporates a brand new capacitive touch interface with LED feedback, as well as a multi-lingual graphics-capable OLED display that is expected to resonate strongly with Symetrix' global customer base.
The second new option is the ARC-WEB browser-based dialler, which allows owners of iPhones, iPads, Android phones, tablets and network-enabled computers to control audio via embedded web servers running on SymNet Edge and SymNet Radius DSPs.
"With this option, end-users can control volume, mute, source selection and other critical parame-ters of their sound systems from the smartphones and tablets they already own," says Trent Wag-ner, senior product manager, Symetrix. "There is also the option to recall various presets from the ARC-WEB dialler, giving you all the functionality you require to, for example, run a full conference session from your smart-device or desktop browser."
Following on from its earlier update of Crestron modules to support the 2- and 3-Series, Symetrix adds multiple new control options for use with room automation systems available from AMX by Harman. Now available, the modules are designed to deliver accommodation of all pre-existing AMX systems as well as those currently shipping.


text: Clients We only take on projects with clients that we know we can hit a home run with (we call it 'breaching' internally). Click on some of our client case studies to see what we mean. If you'd like to see your logo on this list we'd love to hear from you. Let's Talk Some of our Breaching moments Browse more amazing nonprofit case studies Interested in breaching together? Let's Talk


text:
When we first got there, we changed into swimsuits and jumped into their pool for some night swimming. Penny was on the other side of the fence, trying to figure out what to do with herself. She's not used to a yard, so she was kind of awkward for the first little while – anxious about us in the pool, but excited to have room to run around. She ended up sticking her head through the pool fence bars a few minutes at a time, then running around and barking her head off at all the sights. Stacey and Dave's old Jack Russell terrier, Harley, came outside for a few minutes to check things out, then got sick of Penny trying to play with him, and ran back inside. He's such a sweet, round little thing. He looks almost like a cartoon – his little face is always so happy and he looks like he's smiling all the time. And he knows a couple of tricks, one of which Jon has dubbed the "Can o' Beans". He balances and holds his front feet up to beg, but he's so round that his whole body rocks back and he sits on his butt with his feet sticking straight out in front of him.
And he'll sit like that for as long as you hold the treat over his head. So hilarious. Anyway, we slept in the next morning until about 8, then just kind of had a lazy day. Jon made some phone calls to friends and family while I read a book. Stacey and Dave were nice enough to let us borrow their Lexus to take to lunch, then afterwards they treated us with a trip to the movie theater to see Kung Fu Panda, which was actually, surprisingly, really good. I wasn't expecting to like it, but it was just overall cleverness and fun. I really can't knock it. And the absence of potty humor (typically infused into all kids movies) was a plus. I don't remember rolling my eyes a single time.
Then that night, we all went to eat at a fun, wild west themed restaurant in north Scottsdale, way the heck outside of the city. On our way back to the car, Jon spotted a javelina wandering along the old rickety wooden walkway of the building. It's the first one we've seen that wasn't fenced into some sort of enclosure. I've heard enough horror stories about those things feeling threatened and goring people to death with their tusks, so I was maintaining a safe distance (read: I made sure there were other people that were closer to it than I was), but when this guy walked into the light of an overhead streetlamp, then turned to face us, I admit I got a little nervous and started to take a few steps back. In that exact same moment, a wild-eyed, crazed black devil of a cat came bolting out of the cactus that was between us and the pig, and my heart pretty much stopped. For about one-tenth of a second, I honestly, truly thought it was an angry javelina coming for my femoral artery. This crazy cat came right at us, then spun and almost ran into the javelina, then skittered away into the shadows. My heart was racing for a good minute afterwards, and we all had a big laugh at my terrified reaction. So IMAGINE HOW EXCITED I WAS TO DISCOVER that Jon had been taking a little movie of the pig with his phone AT THE EXACT MOMENT that the cat appeared! I couldn't believe my luck. Seriously, within three seconds of the event, I was already planning out my blog post about it, only to find out (the next day) that Jon had caught the whole thing with his phone. So I watched the video……..…and was really disappointed. It just doesn't do it any justice. For starters, it's way too dark to even see what's going on, and it's just not as exciting as it was in person. Although if you crank the volume and listen carefully, you can definitely hear me gasp, then say "oh my gosh, that scared me! I seriously thought it was a javelina! ahhh..."
I wish I had screamed bloody murder, so you could see how startled I was, but as it is, you'll just have to be content knowing that it was A LOT scarier than it seems in the video. You really only get a fraction of the drama. A clip of my face would have been way better.
Sunday we went to church, then had a yummy dinner of grilled chicken, fruit, and a salad with peas. I LOVE peas in salad. Really, there may be no other salad ingredient better than peas. Except maybe strawberries. My mom makes a killer strawberry salad. I attempted it once, but I put way too much poppyseed dressing in it, and haven't tried again since. Apparently I give up very easily.
Anyway, after dinner we just visited until the sun went down so we could begin our drive home. We hosed Penny down, stuffed her in the back seat, and away we went. I wish I could say our trip home was uneventful, but we got stuck in traffic for a good hour just outside of a little town called Eloy. By the time we got to the accident site, things had started moving along better, but every single news van in Southern Arizona was lining both sides of the street. There were a bunch of these huge, tall temporary spotlights set up so they could get a better shot of the accident - an overturned bus about 50 yards from the highway. I just felt sick to my stomach after seeing it, and we hurried home and made it back just in time for the 11:00 news. And not a SINGLE WORD was mentioned about it. The news here SUCKS. This isn't the first time that I've experienced a big newsworthy event and been disappointed in the local media. I was on my way home from work a couple of months ago, for example, and the entire city was being consumed by some huge fire...you could honestly only see about a half-mile in any direction, and ASH was falling from the sky...and there wasn't a single mention of it on the news. What?! And once, the main vein from East to West in this city was closed...completely shut down, and not even the TRAFFIC section of the local news said anything about it. It took me two hours to get to work that day because thousands and thousands of vehicles were creeping down back roads between o-1 mile per hour. No mention of it. Nothing. Anyway, so I wasn't too surprised that local news had let me down YET again. This morning, though, it was all over the papers - a bus carrying 30 kids home from a church youth group trip to California overcorrected and went off the highway. Thankfully, only three or four of the kids were considered in critical condition, and I heard later today that they were all being released. Scary, though, huh? Anyway, so sitting in traffic for an hour on our way home from Phoenix was our second hitch in the weekend. We ended up getting home way past my bedtime, and I fell asleep without taking a shower first. Kind of gross, considering how sweaty I was.
And that was our weekend. In general, it was perfect. Other things on my mind today include:
1) Why did Jon eat so many doughnuts at work today that he doesn't want to eat dinner?
2) What are we going to do with Penny at Christmas? She's too big to be a carry-on, and storing her under the plane is cruel. They say most dogs arrive at their destination foaming at the mouth because they've worked themselves into a nervous panic. Options include kenneling her for over a week, or renting a car and driving it up. According to Avis, there's no additional charge to take one of their cars to Canada, we just have to sign a waiver.
3) Speaking of Christmas, how early is too early to start thinking about Christmas presents? This year is HALFWAY OVER already.
4) Speaking of presents, we bought new couches and they arrive tomorrow! Pictures to follow, I'm sure.5) I'm sorry for how long this post was. I'll make up for it later on by posting a few really ugly pictures of myself. How's that sound?


text:
Bear Bones Books enters a new phase […]
Looking for some big Big BIG LOVE during Spookybear? Then grab your chubby (or chaser) and come to an author reading of the hot Bear Bones Books short fiction anthology, The Biggest Lover. […]
Bi Guys 2 CFS: ISO memorable stories of bi/poly/pan male sex, love, romance, family, and community 3,500 – 7,000 words long, 1st deadline September 1, 2015. […]
All written, graphic, audio, and other website content Copyright © 2019 Bear Bones Books - All Rights Reserved
This website includes frank discussion of sexuality and gender issues intended only for intellectually mature persons.
Powered by WordPress & Atahualpa


text:
firstname.lastname@example.com writes: > >Some work is already undertaken to add SSL support into Jigsaw. We'll > >make the appropriate announces once everything is ready (expect > >something within the upcomming month, but after the public release) > > For outside the U.S. too ? This work has been done in Canada, and we will try to distribute it from here. Anselm.Received on Thursday, 28 August 1997 02:54:59 UTC
This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 21:25:31 UTC


text:
Grand Theft Auto V News & Rumors
Now for some Grand Theft Auto V news and rumors. During a financial conference call from Take-Two Interactive, they revealed that Grand Theft Auto V may be launching in 2012.
According to rumors as reported by 1UP, Grand Theft Auto V's development is apparently "well underway" and on track for a big push next year for the title. Which is "pretty likely" they say.
Watch The Latest Gaming News:
At the conference call for the first quarter of fiscal year 2012 (April 1, 2011 through June 30th), Take Two revealed that they have a loss of $8.6 million compared to last year, due to the fact that L.A. Noire, which sold well, could not match the unbridled success of Red Dead Redemption. A game that has now sold through an astonishing 11 million units (includes "sold to retailers", not necessarily consumers).
However Take-Two states that they expect to make money on the critically panned Duke Nukem Forever, and revealed that digital sales from Take-Two games are more profitable than ever. Gaining the company a net revenue of $24.6 million, a 48% year-on-year increase for DLC.
Because of these reasons, it would make a lot of sense for Take-Two to launch a Grand Theft Auto V during this fiscal year. That would make up for the loss that they took.
And despite having a number of big games ready to launch in the 2012 fiscal year (like Bioshock Infinite and Borderlands 2), launching Grand Theft Auto V would secure the deal for them.
Note that Grand Theft Auto V is still technically unannounced, so we're just assuming it'll be coming to Xbox 360, PS3 and Wii U. Take all of this with a grain of salt until the game is actually revealed.
Hopefully Grand Theft Auto V will look even better than this realistic mod for the previous installment! Looks insane huh!
Tags: Grand Theft Auto V
Categories: News, Polls, PS3 News, Videos, Wii U News, Xbox 360 News


text:
In this post I'm going to test if the acoustic imaging method presented in the previous post actually works (spoiler: it does!). I will not go into too many details related to the theory and programming behind the stuff presented here (although if someone, somewhere, at some point asks for them, I might).
The setup
Let's say we have room, as in the following picture (an evaluation of V-Ray made Sketchup look nice):
The red pin shows the position of the listener (microphone). The yellow pin shows the location of the sound source. The blue area shows the field of view of the acoustic camera.
Calculating the response of the room
In this case, we'll calculate some early acoustical reflections (which might scramble the image in our acoustic camera, although hopefully this won't happen) using an image-source model. The name implies an analogy to optics. This analogy should also make the method relatively easy to understand.
Imagine that all walls are mirrors (we'll assume that the floor and ceiling are fully absorbing). Imagine that we're the red pin, looking in the direction of the yellow pin. We'll see a lot of reflections of the yellow pin.
Let's assume that the yellow pin radiates sound in all directions. Sound will bounce of the walls and (assuming that the walls are smooth and rigid) arrive at our location from exactly the same directions as the light. As such, it will seem as if the reflections themselves radiate sound. Remember that we're assuming that the ceiling and the floor absorb all sound. Also, in this case, we won't have to take diffraction into account.
This can be simplified further in 2D. A path of reflection can be drawn corresponding to all the virtual sources. The length of this path will always equal the length of the virtual path.
Using this method, the impulse response of the 2D room can be obtained. If you don't know what an impulse response is, I think you should look up convolution reverbs, their principle applies to this case. In signal processing terminology, an impulse response describes the behaviour of a linear, time-invariant system. The impulse response is very nearly the same thing as the sound you hear when you clap your hands in a room.
Our room will have numerous virtual sources, but I'll only calculate a handful of them. This is shown in the following figure.
We can see that there are numerous virtual sources in the field of view of the acoustic camera, and even more outside of the view. Will these hinder the localization of the sound source?
The result
The following figure shows the result of a test where I recorded and played back (using convolution with the impulse response) some of my voice at the position of the yellow pin (including all the virtual sources). I then calculated the expected direction of sound, in accordance with the previous blog post (Note that I used a different type of microphone array in this test!). The colors show the calculated sound pressure level arriving from each direction, with red corresponding to the highest level.
The result is transposed on top of the image showing the room in 3D. The "third dimension" in the image showing the direction of the sound is actually time (remember that the room was completely flat), but the result looks so much nicer like this.
I think the principle worked remarkably well!


text:
Large Memorial Rock Urn 938
or make 4 interest-free payments of $137.50 AUD fortnightly with More info
Proudly an original Australian product idea operating since 2009.
This price can include a 180mm x 120mm Quality Bronze Plaque
All prices quoted also include Australia wide delivery and GST.
Medium Size
Lightweight (approx. 27kg) Memorial Rock/Stone/Urn with a sealable internal cavity for the safe-keeping of a loved one's ashes. Holds one or two standard Australian sized ash containers, plus memorabilia.
Size Approx. 490mm x 410mm x 300mm (external). 320mm x 260mm x 170mm (internal)
Please call 0413770272 to arrange to visit our Gold Coast display if you wish to view our full range personally.
Please call to ask about our 'assistance package' for those in difficult financial circumstances.
If you have difficulties with transport our display van may be able to come to you. Please call to arrange.
We are also able to pick-up and inter a loved one's ashes if you wish.
NOTE: Payment of order can be made easily and securely with a Credit Card or Paypal. You do not need to join Paypal. For an alternative payment arrangement, please call us.
We also offer an " Afterpay " option.
To buy, simply click "Add to Cart".
To see order, click "View Cart", then to pay click "Check out".
For assistance please call Bud Manthey on 0413 770 272.