text: Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS4387340Jul 31, 1980Jun 7, 1983Metrotech, Inc.Apparatus for determining the distance to a concealed conductive object which is radiating an alternating current signalUS5467290 *Aug 18, 1993Nov 14, 1995Atlantic Richfield CompanySurvey system and methodUS5576973Apr 18, 1994Nov 19, 1996Radiodetection LimitedApparatus and method for obtaining geographical positional data for an object located undergroundUS5828219Aug 12, 1997Oct 27, 1998Radiodetection, Ltd.Method of detecting faults in the insulation layer of an insulated concealed conductorUS6127827Jul 21, 1995Oct 3, 2000Radiodetection LimitedMethod of identifying a buried cable by applying a low frequency signal to the cable and detecting the resultant fieldUS6549011Dec 12, 2001Apr 15, 2003Radiodetection LimitedConductor tracing systemUS6617855Mar 23, 2001Sep 9, 2003Radiodetection LimitedPipeline mapping and interrupter thereforUS6717392May 30, 2001Apr 6, 2004R�diodetection LimitedSignal generatorUS6777923Feb 19, 2003Aug 17, 2004Radiodetection LimitedSystem and method for detecting a concealed current carrying conductorUS6836231Jul 1, 2003Dec 28, 2004Radiodetection LimitedSignal generatorUS6954071Jul 1, 2003Oct 11, 2005Radiodetection LimitedPipeline mapping and interrupter thereforUS6965320Oct 31, 2001Nov 15, 2005Star Trak Pigging Technologies, Inc.Cathodic test lead and pig monitoring systemUS7113868 *Aug 11, 2004Sep 26, 2006Bell Geospace, Inc.Method and system for processing geophysical survey dataUS20030058108Aug 1, 2001Mar 27, 2003Radiodetection LimitedMethod and system for producing a magnetic field signal usable for locating an underground objectUS20030058961Aug 1, 2001Mar 27, 2003Radiodetection LimitedMethod and system for recovering information from a magnetic field signal usable for locating an underground objectUS20040004479Jul 1, 2003Jan 8, 2004Radiodetection Limited,Pipeline mapping and interrupter thereforUSD475936May 10, 2002Jun 17, 2003Metrotech CorporationLine locatorUSD488725May 13, 2002Apr 20, 2004Metrotech CorporationTransmitter for a line locating systemGB2108347A * Title not available* Cited by examinerClassifications U.S. Classification702/2, 702/5International ClassificationG06F17/00Cooperative ClassificationG01V3/36European ClassificationG01V3/36Legal EventsDateCodeEventDescriptionNov 13, 2012FPAYFee paymentYear of fee payment: 4Dec 20, 2006ASAssignmentOwner name: SPECTRUM EXTERNAL LINE INSPECTION TECHNOLOGY INC.,Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:MCDONNELL, SHAMUS;WESTMAN, MIKE;REEL/FRAME:018658/0270Effective date: 20061127RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services©2012 Google

value: This website is a search engine provided by Google. Handling over 3.5 billion searches per day, it has a 92% share of the global search engine market.


text:
Inpatient hospital care of children with trisomy ... [Pediatrics. 2012] - PubMed - NCBI
Display Settings:AbstractFormatSummarySummary (text)AbstractAbstract (text)MEDLINEXMLPMID ListApplySend to:Choose DestinationFileClipboardCollectionsE-mailOrderMy BibliographyCitation managerFormatSummary (text)Abstract (text)MEDLINEXMLPMID ListCSVCreate File1 selected item: 22492767FormatSummarySummary (text)AbstractAbstract (text)MEDLINEXMLPMID ListMeSH and Other DataE-mailSubjectAdditional textE-mail"SPAM" filtering software noticeAdd to ClipboardAdd to CollectionsOrder articlesAdd to My BibliographyGenerate a file for use with external citation management software.Create File
Pediatrics. 2012 May;129(5):869-76. doi: 10.1542/peds.2011-2139. Epub 2012 Apr 9.Inpatient hospital care of children with trisomy 13 and trisomy 18 in the United States.Nelson KE1, Hexem KR, Feudtner C.Author information 1Harvard Palliative Medicine Fellowship Program, Children’s Hospital Boston, Boston, Massachusetts, USA.AbstractBACKGROUND AND OBJECTIVE: Trisomy 13 and trisomy 18 are generally considered fatal anomalies, with a majority of infants dying in the first year after birth. The inpatient hospital care that these patients receive has not been adequately described. This study characterized inpatient hospitalizations of children with trisomy 13 and trisomy 18 in the United States, including number and types of procedures performed.METHODS: Retrospective repeated cross-sectional assessment of hospitalization data from the nationally representative US Kids' Inpatient Database, for the years 1997, 2000, 2003, 2006, and 2009. Included hospitalizations were of patients aged 0 to 20 years with a diagnosis of trisomy 13 or trisomy 18.RESULTS: The number of hospitalizations for each trisomy type ranged from 846 to 907 per year for trisomy 13 (P = .77 for temporal trend) and 1036 to 1616 per year for trisomy 18 (P < .001 for temporal trend). Over one-third (36%) of the hospitalizations were of patients older than 1 year of age. Patients underwent a total of 2765 major therapeutic procedures, including creation of esophageal sphincter (6% of hospitalizations; mean age 23 months), repair of atrial and ventricular septal defects (4%; mean age 9 months), and procedures on tendons (4%; mean age 8 years).CONCLUSIONS: Children with trisomy 13 and trisomy 18 receive significant inpatient hospital care. Despite the conventional understanding of these syndromes as lethal, a substantial number of children are living longer than 1 year and undergoing medical and surgical procedures as part of their treatment.PMID: 22492767 [PubMed - indexed for MEDLINE] Free full textMeSH Terms, Supplementary ConceptsMeSH TermsAdolescentChildChild, PreschoolChromosome Disorders/genetics*Chromosome Disorders/mortalityChromosome Disorders/therapy*Chromosomes, Human, Pair 13/geneticsChromosomes, Human, Pair 18/geneticsCross-Sectional StudiesDelivery of Health Care/statistics & numerical dataFemaleHospitalization/statistics & numerical data*HumansInfantInfant, NewbornMaleRetrospective StudiesSurgical Procedures, Operative/statistics & numerical dataSurvival RateTrisomy/genetics*United StatesYoung AdultSupplementary ConceptsChromosome 18, trisomy 18pPatau syndromeLinkOut - more resourcesFull Text SourcesHighWireMedicaltrisomy 13 - Genetics Home Referencetrisomy 18 - Genetics Home ReferencePubMed Commons home

type: global

value: This website is part of the United States National Library of Medicine , a branch of the National Institutes of Health . It is approved and funded by the government of the United States.


text:
Saint Vincent De Paul in Modesto, California with Reviews & Ratings - YP.comFind People•Advertise With UsBrowseFind PeopleFeatured CollectionsRestaurantsAutomotiveHome ImprovementHealth & WellnessAttorneysPeople Searched For...Bail BondsKaiser Permanente Urgent CareMemorial HospitalPlumbersComcast On Pelandale ModestoComputer Service Repair BusinessAir Conditioning Service RepairDoctors HospitalUsed Car DealersBeauty SchoolsFloristsFurniture StoresSex TherapistTire DealersLos Tres Amigos Auto Sales24 Hour Car RentalReal Estate AgentsHearing Aids Assistive DevicesMotelsNorth Adrians Beauty CollegeState Theater Modesto CaAuctionsMitsubishi DealershipAdvertise with usWe have plenty of solutions to help you grow your businessWhat do you want to find?Search by business name, or keywordnearWhere? Address, ZIP Code, or NeighborhoodMy current locationSearchSign In•JoinHomeModesto, CASaint Vincent De PaulModesto Saint Vincent De PaulSort:Most RelevantMost RelevantDistanceRatingName (A - Z)FiltersFiltersMore NeighborhoodsDowntown PattersonDoneClear AllMore CategoriesHuman Services OrganizationsMarriage, Family, Child & Individual CounselorsResale ShopsSecond Hand DealersSocial Service OrganizationsThrift ShopsDoneClear AllCategoryHuman Services OrganizationsMarriage, Family, Child & Individual CounselorsSocial Service OrganizationsMore »FeaturesBook A TableCouponsNeighborhoodsDowntown PattersonSponsored LinksAdd to mybookRemove from mybookAdded to your shopping collection!Error when adding to shopping collectionThis business was removed from the shopping collectionInaccurate Result?1.St Vincent de Paul Thrift Store58 South 3rd StreetPatterson, CA 95363(209) 892-7201Resale ShopsSecond Hand DealersDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your community collection!Error when adding to community collectionThis business was removed from the community collectionInaccurate Result?2.St Vincent De Pauls525 E North StManteca, CA 95336(209) 823-8099Social Service OrganizationsWebsiteDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your community collection!Error when adding to community collectionThis business was removed from the community collectionInaccurate Result?3.St Vincent De Paul Society1999 Juniper AveAtwater, CA 95301(209) 357-1464Social Service OrganizationsWebsiteDirectionsMore InfoRooms & Rates »Sponsored LinksShowing1-3
of 3resultsIf we're missing a business and you'd like to make a suggestion, please do! Add a business.Add a New CollectionOops! There was a problem saving the new custom collection.Please try again.Collection Name cannot be emptyUpload a Photo(optional)Remaining Characters: 100Remaining Characters: 500CancelSaveMap ViewFeatured Catholic Churchesin Modesto, CaliforniaAdd to mybookRemove from mybookAdded to your shopping collection!Error when adding to shopping collectionThis business was removed from the shopping collectionInaccurate Result?Buy-Rite Thrift Store1800 Prescott RdModesto, CA 95350(209) 572-15351000's of New & Used items added to the store dail...WebsiteDirectionsMore InfoAdd to mybookRemove from mybookAdded to your shopping collection!Error when adding to shopping collectionThis business was removed from the shopping collectionInaccurate Result?Priceless Treasures Thrift Shop(3)321 McHenry AveModesto, CA 95354(209) 579-5513One Person's Junk Is Another Person's TreasureWebsiteDirectionsMore InfoSponsored Modesto Saint vincent de paulPhoneWebsiteMoreAboutAbout UsSite FeedbackContact UsAdvertise with UsCareers - We're HiringEngineering BlogLegal

value: This website is a United States-based web site operated by YP Holdings that provides listings for local businesses. In 2013 it was re-branded as YP.com or simply "YP".


text:
TOTAL IMMERSION - Scarce Fine Copy of The First Hardcover Edition/First Printing: Signed by Allegra Goodman by Goodman, Allegra: New York City, NY: Harper & Row, 1989 9780060159986 Hardcover, 1st Edition., Signed by Author - Modern Rare
› Goodman, Allegra
› TOTAL IMMERSION - Scarce Fine Copy of The First Hardcover ...
TOTAL IMMERSION - Scarce Fine Copy of The First Hardcover Edition/First Printing: Signed by Allegra Goodman
Published by New York City, NY: Harper & Row, 1989
ISBN 10: 0060159987 / ISBN 13: 9780060159986 Used
Title: TOTAL IMMERSION - Scarce Fine Copy of The ...
Publisher: New York City, NY: Harper & Row, 1989
1st Printing. Signed. 260 pages. Published in 1989. The author's breakthrough debut collection of short stories. One of the most important literary debuts of our time. The First Hardcover Edition. Precedes and should not be confused with all other subsequent editions. Published in a small and limited first print run as a hardcover original only. The First Edition is now scarce. Presents Allegra Goodman's "Total Immersion". Written when she was still a student at Harvard University. The eleven stories in this collection received lavish praise from such established writers as Cynthia Ozick, Max Apple, and Chaim Potok. Among other things, Goodman seems to have pulled off two major feats: Capture the unique culture of Hawaii, where many of the stories take place, and evoke the claustrophobic atmosphere of the Jewish community there, a microcosm of Jewish communities everywhere in America. "Allegra Goodman is brilliant, knowing, alive: A marvel. All the muse-fairies were present at her birth!" (Cynthia Ozick). An absolute "must-have" title for Allegra Goodman collectors. This copy is very prominently, neatly, and beautifully signed in blue pen on the title page by Allegra Goodman. It is signed directly on the page itself, not on a tipped-in page. This title is a contemporary classic. This is one of very few such signed copies of the First Hardcover Edition/First Printing still available online and is in fine condition: Clean, crisp, and bright, a beauty. A scarce signed copy thus. Selected by The New Yorker Magazine as one of "Twenty Writers for the 21st Century". One of the finest American writers of our time. A fine copy. (SEE ALSO OTHER ALLEGRA GOODMAN TITLES IN OUR CATALOG) ISBN 0060159987. Bookseller Inventory # 5617

value: This website is an e-commerce global online marketplace with seven websites that offer books, fine art, and collectables from sellers in over 50 countries. Launched in 1996, it specialises in used, rare and out-of-print books.


text:
A simple STL based XML parser - CodeProject 12,756,437 members (32,746 online)
Umut Alev25-Jul-05 22:04 Perhaps this has been talked a lot but I can not stop my self from writing this. One of the reasons of XML is connecting platforms, apps through text encoded messages, to achieve this you need compliance. Implementing a fully (95%-98%) compliant XML parser is really hard. Usually an average Dev can get to 80% pretty quickly and the experienced can get to %90. The rest is all egde cases and getting them right requires extensive testing suites to ensure compat between different platforms. I know this by experience. There are quite a few xml parser implementations out there. Users are usually best served when the xml parser implementations are recognized by the W3C Recommendations. Other implementations can not go any further than academic studies as the cost of them making interop with the rest of the world sky rockets as dev's are trying to achieve %95 compat. Last Visit: 31-Dec-99 19:00 Last Update: 23-Feb-17 6:47Refresh1

value: This website is a community for computer programmers with articles on different topics and programming languages such as web development, software development, C++, Java, and other topics. Once a visitor registers a user account on the site, they can gain reputation which allows users to unlock different privileges such as the ability to store personal files in the user's account area, have live hyperlinks in their profile biography, and more.


text:
Karnaugh Map Minimizer (Three Variables) - CodeProject
14,424,945 members
Muhammad M. Osama
26 Nov 2013CPOL
Karnaugh Map Minimizer (three variables) using Quine-McClusky algorithm and Petrick's method.
Download executable - 12.73 KB
Entering inputs and sorting them
Performing the comparison
Determining prime implicants
Determining essential prime implicants
Forming the function
This program provides a general code in C language (you can call it pseudo code) that can be implemented in other languages to solve the 3-var Karnaugh map.
The program uses the Quine-McClusky algorithm and Petrick's method as they are easy to implement in programming.
Here are some tips to use this program:
Enter the minterms in decimal numbers, when you finish, enter 'q' character to quit.
Enter the Don't care terms (if they exist), when you finish, enter 'q' character to quit.
Choose the function form (SOP or POS).
I'll start first with the algorithm to make the code easy to understand.
The Quine - McClusky algorithm was developed to implement karnaugh maps that are too important in digital design or simplifying the boolean functions. The algorithm consists of some steps we must handle to make our project or code work perfectly without any errors.
Gather all minterms & don't care terms (if there are any) and convert them to binary form, then sort them in groups and list them in a list (call it List 1).
Example: If we have these terms (0,1,2,3,4,7,6), then the groups should be like this:
group 0 contains the binary [000]
group 1 contains the binaries [001 (0 in decimal) , 010 (2 in decimal), 100 (4 in decimal)]
group 2 contains the binaries [011 (3 in decimal), 110 (6 in decimal)]
group 3, final group, contains the binary [111 (7 in decimal)]
We can see in these groups that they are sorted according to the number of ones in each binary number.
Compare group 1 with group 2 & group 2 with group 3 & group 3 with group 4, the comparison is achieved by comparing each term in the first group with all terms in the next group.The comparison concept is that if two terms have only 1 different bit, then this bit must be replaced with (-) like: (000 , 001) ==> (00-).
After the comparison is done in (List 1), move to List 2 and do the same comparison, but we will find a new element, the dash (-) that we must handle it in the comparison. When we compare two dashed terms, the comparison is legal only if the dash position is the same in the two terms, otherwise we can't compare those terms like: (00- , 01-) ==> (0--), but (00- , 0-1) is illegal.
If two terms compared successfully, a check character is put next to the compared terms (say the check chr is 't'), if not, I mean that the two terms have more different bits or the dash position is not the same in the two terms, then a check character must be put next to the uncompared terms (say check chr is '*') to indicate something we will discuss in step 3.
Note: If two terms can't be compared say a term in group 2 & term in group 3, if the term that is in group 3 can be compared later with a term in group 4, then the ('*') indicator must be replaced or overwritten by ('t') indicator.
group 0 000t 00-t 0--*
0-0t --0*
-00t
group 1 001t 0-1t -1-*
010t 01-t
100t -10t
1-0t
group 2 011t -11t
110t 11-t
Determine the prime implicants (if they are found in any list above).
Note: The prime implicants are terms that can't be compared any more and indicated with '*', like: (0-- , --0 , -1-).
Form the coverage table to determine the essential prime implicants. To form this table, we will put the minterms horizontally & the prime implicants vertically, then we should determine which terms a prime implicant cover like (0--) covers 0,1,2,3. and put an indicator (say 'X') in the cells corresponding to the row of prime implicant and its terms.
0-- (0,1,2,3)
--0 (0,2,4,6)
-1- (2,3,6,7)
Now after we finished the table, we can determine the essential prime implicants by dominating the row and column of a term that has only 'X' in his column, like : (1 , 4 , 7). By dominating these rows, we can say that the prime implicants corresponding to these rows became essential prime implicants.
Finding the Simplified function. As we know, our example gives us these terms to simplify (0, 1, 2, 3, 4, 6, 7). Those terms without simplifying should form this function:
F = A'B'C' + A'B'C + A'BC' + A'BC + AB'C' + ABC' + ABC
where, A, B, C are variables and A', B', C' are their compliment variables & their compliments are called literals representing the binary form of the terms.
After simplifying, the function looks like this:
F = A' + C' + B
There is another step left before (step 5) that handles the prime implicants left in the table using the Petrick's method. We will discuss it with some conditions we may meet later in another example.
A group is missing, what happens if a group like group 2 is missing?
In this situation, group 0 & group 1 can be compared but group 1 can't be compared any more because group 2 is missing and therefore group 3 is left as it is and the term in group 3 considered as prime implicant.
Repeated terms, while we comparing terms with others, repeated terms we may meet in the results.
Example, in the previous example at list 2, the terms (00- , 01-) can be compared and the result will be the term (0--).The terms (0-0 , 0-1) can be compared too and the result will be (0--), so the term (0--) is repeated and we can't put it twice in list 3.
If we entered all minterms (0, 1, 2, 3, 4, 5, 6, 7), the resulted function can be considered directly as the value 1 (F = 1) without using any steps mentioned before.
The don't care terms, don't care terms need special handling in Quine-McClusky algorithm, so if a problem or an example has thus terms, we will execute the steps 1,2,3 considering thus terms are minterms which we handled in the previous example but in step 4 thus terms must not be added in the coverage table.
Example: If we have this problem, F = m(0,1,2,6) + d(4,5), all terms, minterms & don't cares are handled normally with steps 1,2,3 but terms (4, 5) must not be included in the coverage table.
To implement step 1, we should take the inputs (minterms & don't caresa) from user in numbers, storing minterms in array & don't care in another array, then converting these numbers to its binary equivalent. There are many approaches to convert decimal numbers to binary numbers, here is a common technique implemented in a function.
char *ConvertToBinary(int num, char *bin)
int size = BINSIZE;
for (i = size - 1; i >= 0; i--, num >>= 1)
bin[i] = (mask & num) + '0';
bin[size] = '\0';
When the inputs are all converted to binary numbers, we will sort it in groups using data structure that contains four 2-D arrays and dividing these groups to three lists using array of structures.
// The data structure that contains the groups from 0 ==> 3.
// Each array in this structure represents a group.
typedef struct q_mc {
char ar0[SIZE][ROWSIZE];
char ar1[SIZE][ROWSIZE];
char ar2[SIZE][ROWSIZE];
char ar3[SIZE][ROWSIZE];
}Q_MC;
// Array of structures contains the lists from 1 ==> 3.
// Each element in the array represents a list.
Q_MC ar[NUMLIST] = {""};
After storing the data that the user entered in the structure of first element (list1) in the array <code>ar, we should now compare the groups (data structures we just created) by using this function:
int CompareTerms(const char *ar1, const char *ar2, int size)
if (ar1[i] != ar2[i])
return (count == 1) ? temp : -1;
The previous function takes two strings 'ar1' & 'ar2', these strings represent the binary form of the terms like (01- , 11-).After the function takes its arguments, the for loop checks on every character in the two strings and if a character is different in a one string from another in the second string, the function returns the position of this character, else return (-1).
After completing the comparison, the check characters (t , *) should be attached next to the compared terms. We can do this by using the following piece of code:
if (bit_pos != -1)
for (j = 0; j < BINSIZE; j++)
if (j == bit_pos)
ar[1].ar0[_rows0][j] = '-';
ar[1].ar0[_rows0][j] = ar[0].ar1[index][j];
ar[0].ar0[0][BINSIZE] = 't';
ar[0].ar0[0][BINSIZE+CHKCHAR] = '\0';
ar[0].ar1[index][BINSIZE] = 't';
ar[0].ar1[index][BINSIZE+CHKCHAR] = '\0';
ar[1].ar0[_rows0][BINSIZE+CHKCHAR] = '\0';
_rows0++;
if (ar[0].ar0[0][BINSIZE] != 't')
ar[0].ar0[0][BINSIZE] = '*';
if (ar[0].ar1[index][BINSIZE] != 't')
ar[0].ar1[index][BINSIZE] = '*';
Let's start with the condition: if (bit_pos!= -1), bit_pos variable stores the returned value of the CompareTerms function. The for loop keeps track of the binary form of the term till j variable reaches the different bit's position, if so the bit replaced with dash '-', otherwise, do nothing, then put the new binary form in the new list.
After the new binary form was created, we will attach the character 't' to the two compared terms and a '*' to the uncompared terms, but if the terms are already attached with 't' character, it shouldn't replaced with '*' if they can't be compared with the other terms.
ar[0] refers to list 1.
ar[1] refers to list 2.
ar[0].ar0 refers to group 0 in list 1.
ar[0].ar1 refers to group 1 in list 1.
ar[1].ar0 refers to group 0 in list 2.
Determining the prime implicants. When we put the check characters, now determining which term is prime implicant or not became too easy in programming, the only thing we will do is using the "strchr" function to find if the '*' indicator is found in a string or not, remember '*' referes to prime implicants terms. As an example, I'll illustrate how we can catch the prime implicants at group 0 in list 2 with the following code:
for (index = 0; index < _rows0; index++)
if (strchr(ar[1].ar0[index], '*') != NULL)
prime_imp[k][j] = ar[1].ar0[index][j];
prime_imp[k++][BINSIZE] = '\0';
_rows0 is the number of terms at group 0 in list2, if the '*' character found in any term in the group, it will be copied to a new array holding the prime implicants.
Finding the essential prime implicants. This part determines the essential prime implicant that will form the boolean function we need.
The dashes in each prime implicant are converted first to the binary states, then the binaries converted to the decimal numbers. As an example, if the prime implicant has one dash, so we got only two states (0 or 1), if it has two dashes, we got four states (00 or 01 or 10 or 11).
After we finished this replacement, we will convert all the binaries resulted to the terms that has been covered by them.
Example: The prime implicant (0--) is manipulated as follows:
(-1-) = replace dashes => (010 , 011 , 110 , 111) When we get these binaries, now we can compare each one of them to the binary form of the inputs to determine the term identical to the state of prime implicant.
If the binaries of an input & a state of the prime implicant, the index of the input or the input itself stored in array.This code can implement the comparison part:
for ( m = 0; m < n; m++)
if (strcmp(store_inputs[m],prime_imp_bin) == 0)
store_index[l++] = m;
Where, n is the number of inputs.
store_inputs is a (2-D) array holds the binaries of the inputs.
prime_imp_bin array holds a state of the prime implicant.
store_index array stores the index of each input which is identical only to the states of prime implicant.
After storing the indices of our inputs which are identical to states of prime implicants, we will sort these indices in increasing order to remove the repeated indices easily.
Why we removed the repeated indices of minterms in the coverage table?
Answer: To pick up the rest of minterms' indices which are unreapted.The minterms referred by the unrepeated indices guide us to the essential prime implicants that will form our function.
Hint: The unrepeated minterms are terms that have only one 'X' (bolded one) marker that was indicated in the coverage table.
And here is the code that implements the sort and remove part:
qsort(store_index, l, sizeof(int), mycomp);
for (m = 0; m < l; m++)
if (store_index[m] == store_index[m+1])
else if (store_index[m] != store_index[m+1] && store_index[m] == store_index[m-1])
store_index2[j++] = store_index[m];
The qsort function is used to sort alphapetic & numeric characters, as we see, it takes an array that holds the data we want to sort, length of this array, size of data type held by the array and the mycomp function that is considered as a fuel to the function without mycomp function, qsort will do nothing.
If we have two numbers say (n1,n2), mycomp function returns -1 if n1 < n2 , 0 if n1 = n2 and the value 1 if n1 > n2.
Now after we got the minterms that refer to prime implicants which are supposed to be essential prime implicants, we will use these terms which their indices stored in store_index2 array to get our essential primes.
We can use the following block of code to get our target:
for ( m = 0; m < unrepeated_terms; m++)
if (strcmp(store_inputs[store_index2[m]],prime_imp_bin) == 0)
prime_imp[index][BINSIZE] = '*';
prime_imp[index][BINSIZE+CHKCHAR] = '\0';
strncpy(ess_pri_imp[p++], prime_imp[index], BINSIZE);
The unreapted_terms variable is the number of unrepeated terms (that have only one X in its column), the strcmp function compares between each input (binary form) and each state of a prime implicant, at any condition they are equal, the prime implicant itself is not a state of it copied to the ess_pri_imp array. See the complete code of finding the essential prime implicants part in 3_var.cpp file starting with line 473 to line 730.
Our function has two forms, SOP and POS. SOP means Sum Of Products and POS means Product of Sum.
To form the SOP function, first convert each essential prime implicant to alphapetic form.
Example: If we have these essential implicants (0-1, 111, --0), the alphapetic form of these terms should be like that:
0-1 ===> A|C
111 ===> ABC
--0 ===> C|
In the previous example, we used the letters A,B,C. Actually, we can use any letters like X,Y,Z. At any SOP form the zero bit takes the complement of the letter (letter + bar) and because we don't have bar symbol, I used this symbol '|' to represent the complement of a letter.
Second: Put after each term a '+' operator.
Example, the function that represents the previous terms is " F = A|C + ABC + C| ".
Let's see the code that can implement the SOP form:
printf("\n\n F = ");
for (index2 = 0; index2 < unrepeated_terms2; index2++)
if (ess_pri_imp2[index2][j] == '0')
printf("A|");
else if (ess_pri_imp2[index2][j] == '1')
printf("B|");
printf("C|");
putchar('C');
if (index2 % unrepeated_terms2 == index2 && (unrepeated_terms2 - index2) > 1)
putchar(' ');putchar('+');putchar(' ');
The outer loop checks the content of ess_pri_imp2 array that contains the essential prime implicants. The variable unrepeated_terms2 is the number of essential prime implicants we have.
The inner loop checks the bits of each essential implicant. Then I used a switch to divide each implicant to positions (0,1,2). Each position can take a letter or its complement according to the state of bit in that implicant.
The final if condition in the code controls adding '+' operators after each term except the final term in the function.
Forming the POS function, we use the same procedure as SOP but in POS we convert the zero bit to the complement of a letter and the one bit takes the normal letter and we put after each letter that represent a bit a '+' operator to separate the literals (letters that represent the bits), then we add each term in parenthesis to make each term looks like a sum term and the function looks like a product of sum.
http://en.wikipedia.org/wiki/Quine%E2%80%93McCluskey_algorithm
http://en.wikipedia.org/wiki/Petrick%27s_Method
Digital Design Fundamentals, 2nd Ed [Kenneth J. Breeding]
Digital Fundamentals 9e [Floyd]
My friend always says "Nobody is perfect, but a team can be", so I hope someone can complete this code to cover more than 3 variables.
Engineer Collage
TA at Minia University.
This code should be good for any number of variables
Abdelrahman Elzedy16-Jul-13 9:07
Abdelrahman Elzedy 16-Jul-13 9:07
//Karnaugh map
//This program make a simulation to Karnaugh map with any number of variables
//and minimizing it
//Written By A.Asem
//abdoasemelzedy@hotmail.com
class Kmap
int	value,	//read element values
type,	//k-map type 2,3 or 4
temp, temp1, temp2, temp3, //temprature variable
termCount, //one's count
saverCount ; //saving savers
vector<vector<int> >term;
vector<char>result; //results //I think we won't use it
//all using will be in term
vector<bool> save; //examing saving
vector<int>pos; //save positions
bool hasSave ; //checking having save
int readInt ();
bool isSub (vector<char> &term, vector<int> &ones, vector<bool> &subTerm); //check if the term is sub of ones
void getOnes (vector<int> &ones);
vector<char> process (int &myType, vector<int> &ones);
void setData (vector<int> ones);
void saveTerm ( int pos);
void simp (vector < vector< int >> &term); // simplify
void edit(vector <vector< int="">> &saver);
void saveValue(vector<int> &tempSave, vector<vector<int>> &saver, vector<bool> &hasSimp);
void addOther (vector<vector<int>> &saver,vector<bool> &hasSimp, int &saverCount);
vector<char> posToTerm(vector<vector<int>> &term); //converte position to its terms
vector<int> termToPos (vector<char> term, int &type);
void unrepeat (vector<vector<int>> &intVec); //delete repeated terms
void filter (vector<char> &result, vector<int> ones);
vector<char> getTerm (vector<char> &result, int &pos); //getting a term form an array
void remove ( vector<char> &term, vector<int> &ones);
void editPart(vector<char> &part,vector<char> &terms, int &type, int &pos);
vector <char> extract(vector<char> &terms, int &type);
//minimize with one's position
vector<char> minimize(int &myType, vector<int> &ones)
vector<char>result;
result = process(myType, ones);
Kmap () : termCount(0) {}
void setKmap();
};//end kmap
int Kmap :: readInt () //reading integer num
int intNum = 0;//for getting numers
bool firstDigit = true, //check first digit
sign = true; //saving sign, true for pos, false for neg
while(true) //reading integer nume
if(firstDigit && tempChar == '-')
sign= false; //the sign of the number is negative
cout<<tempchar; print="" -
="" else="" if(tempchar="">47 && tempChar < 58) //the character is number
intNum = intNum * 10 + (tempChar - 48);
cout<<tempchar; print="" char
="" else="" if="" (tempchar="=" 13="" ||="" tempchar="=" '="" ')
="" cout<<tempchar;
="" break;
="" if(tempchar="=" '\b'="" &&="" intnum=""> 0)
cout<<"\b \b"; //remove number
intNum /= 10; //remove digit
else if (tempChar != 13 && tempChar != ' ')
firstDigit = false; //first digit has gone
cout<<endl; going="" to="" next="" line
="" return="" (sign)?intnum:-1*intnum;="" integer="" num
}="" end="" readint
void="" kmap="" ::="" setkmap()
="" char="" tempchoice;
="" vector<int="">ones;
vector<char>terms;
cout<<"Please, enter your k-map type (Variables number):";
type = readInt();
if(type > 0)
cout<<"\a"; //invoke sound for warning
cout<<"Wrong \n";
getOnes(ones); //getOnes
result = minimize(type,ones);
cout<<"Minimization = ";
for(int temp = 0; temp < result.size(); temp++)
cout<<result[temp];
="" tempchoice="getch" ();="" reading="" digit
="" }while(true);
="" }="" end="" set="" kmap
void="" kmap="" ::="" getones="" (vector<int=""> &ones)
int positoin; //for reading positions
cout<<"Please, enter one's position (-1 for stopping) : ";
positoin = readInt () ;
if(positoin > -1 && positoin < pow(2.0,type))
ones.push_back(positoin);
else if(positoin == -1)
cout<<setw(50)<<"wrong\n";
="" }="" end="" while
}="" getones
="" kmap="" processing
vector<char=""> Kmap :: process (int &myType, vector<int> &ones)
vector<int>position;
type = myType; //assuming type
setData (ones); //converete one's to its coordintates
simp(term); //compare ones
unrepeat(term); //remove repeated results
result = posToTerm(term); //converte result to terms of variables
filter(result,ones); //filter result from unessential terms
return result; //return result
}//end process
//save ones with its coordinate in Kmap
void Kmap :: setData (vector<int> ones)
for(temp =0; temp < ones.size(); temp++)
//save position
term.push_back( vector <int> () );
saveTerm (ones[temp]);
//end reading while
void Kmap ::simp (vector < vector< int >> &term)
int count = type;
vector<int>tempSave;
vector<vector<int> >saver; //save similarty
vector<bool>hasSimp;
while(count > 0 && term.size() > 1)
{//times while
hasSave = false;
saverCount = 0; //default case
//initializing has simplified with false
hasSimp.clear();
hasSimp.resize(term.size(), false);
//do essential minimizations
for( temp = 0; temp < term.size() -1 ; temp++)
{//for 1
for ( temp1 = temp + 1; temp1 < term.size(); temp1 ++ )
{//for 2
tempSave.clear(); //clerar temp Save
////////element's loop/////////////////
for (temp2 = 0; temp2 < type; temp2++)
{//for 3
//if(hasSimp[temp] == false && hasSimp[temp1] == false)
//searching for identical
if( ( term[temp][temp2] == term[temp1][temp2] ) ) //mathcing elemnt
//save identical
tempSave.push_back(temp2);
}//end for 3
saveValue(tempSave,saver, hasSimp);
}//end for 2
}//end for 1
//do unessential minimizations
for( temp = 0; temp < term.size() ; temp++)
for ( temp1 = 0; !hasSimp[temp] && temp1 < term.size(); temp1 ++ )
if(temp != temp1)
//add remain funcions
addOther(saver,hasSimp,saverCount);
if(hasSave)
term = saver;
saver.clear(); //clear saver to receive new data
hasSave = false ; //return default
count--; //decrease doing times
}//end times while
}//end simp
//Stretching terms
vector <char> Kmap :: extract(vector<char> &terms, int &type)
vector<char>part; //part of expression
int dashCount = 0;
//save one term in part
for(temp = 0; temp < terms.size(); temp++)
if( isalpha(terms[temp]) || terms[temp] == '\'' )
part.push_back(terms[temp]);
if(terms[temp] == '\'') dashCount++;
if( (terms[temp] =='+' || temp == terms.size()-1 ) && part.size() - dashCount < type )
if(terms[temp] =='+')
temp--; //return temp to last digit
editPart(part,terms,type,temp); //edditing
temp--;//return temp to the digit before part
part.clear(); //edit clear to be used
dashCount=0;
else if (terms[temp] =='+' && part.size() - dashCount == type)
part.clear(); //clear part
dashCount=0; //clear dash
}//end looping for
}//end extr
//fill Term (vector) coordinate of ones (pos)
void Kmap :: saveTerm ( int pos)
//put position with inverse order
for(temp1 = 0; temp1 < type; temp1++)
term[termCount].push_back (pos % 2);
//inverse term
for(temp1 = 0; temp1 <type 2;="" temp1++)
="" swap(term[termcount][temp1],term[termcount][type="" -="" temp1="" 1="" ]="" );
="" termcount++;="" increase="" terms
="" }="" end="" fill="" term
="" void="" kmap="" ::="" editpart(vector<char=""> &part,vector<char> &terms, int &type, int &pos)
//make a condition of last digit
//use parts.size()
int dashCount = 0 ;
vector<char>copyPart; //copying part for don't cares
bool edited = 0; //check edditing in first phase
pos -= part.size()-1; //return to main positiion
terms.erase( terms.begin()+pos,terms.begin()+pos+part.size() );//return the part from total terms
//first phase
for( temp = 0; temp < part.size(); temp++)
if(part[temp] == '\'')dashCount ++;
else if (part[temp] != 65 + temp - dashCount)
part.insert(part.begin()+temp,65+temp-dashCount); //insert letter
copyPart = part; //copy letter
part.insert(part.begin()+temp+1,'\''); //insert ' to the letter
terms.insert(terms.begin()+pos,copyPart.begin(),copyPart.end()); //insert part without dash
terms.insert(terms.begin()+pos,'+'); //insert +
terms.insert(terms.begin()+pos,part.begin(),part.end()); //insert the part with dash to be first
edited = true; //this part has eddieted
//losing last digit
if (edited == false &&part[part.size() -1] != 65+type)
part.insert(part.begin()+temp,65+temp-dashCount); //insert a letter
}//end edit part
void Kmap ::filter (vector<char> &result, vector<int> ones)
vector<char> term; //saving a term
int temp; //temprature variable
vector<bool> subTerm; //check if ones are sub of terms
subTerm.resize(ones.size(), false);
//edit terms (remove unessential terms)
for(temp = 0; temp < result.size(); temp++)
term = getTerm(result,temp);
if(isSub(term,ones,subTerm) )
temp +=term.size();//going to next term
//remove term from result
result.erase(result.begin()+temp-1, result.begin()+temp+term.size());
temp--;//stand on +
}//end edditng for
}//end filter
bool Kmap ::isSub (vector<char> &term, vector<int> &ones, vector<bool> &subTerm) //check if the term is sub of ones
vector<int> termOnes; //savaing a term ones
termOnes = termToPos(term,type);
vector<bool>isHere; //check attendence
isHere.resize(termOnes.size(),false);
int temp, temp1; //temprature variables
bool isAllHere = true; //check all is true
vector<int>oneArrange;
bool sub; //for result
for(temp = 0; temp < termOnes.size(); temp++)
for(temp1 = 0; temp1< ones.size(); temp1++)
if( termOnes[temp] == ones[temp1] )
isHere[temp] = true;
oneArrange .push_back(temp1);
}//end for1
for(temp = 0; temp < isHere.size(); temp++)
if( isHere[temp] == false)
isAllHere = false;
sub = false; //default case
if(isAllHere)
for(temp = 0; temp<onearrange.size(); temp++)
="" if(subterm[onearrange[temp]]="=" false)
="" sub="true;
" break;
="" if(sub)
="" for(temp="0;" temp<onearrange.size();="" subterm[onearrange[temp]]="true;
="" if(sub)="" return="" true;
="" else="" false;
}="" end="" is="" sub
vector<char=""> Kmap :: getTerm (vector<char> &result, int &pos)
vector<char> term;
for(temp = pos; temp < result.size(); temp++)
if(result[temp] != '+')
term.push_back(result[temp]);
}//end getTerm
vector<int> Kmap :: termToPos (vector<char> term, int &type)
vector<int>result; //for returning
int weight = 0; //default case
int pos = 0; //saving position
term = extract(term, type);
for(int temp = term.size()-1; temp >=0 ; temp--)
if(term[temp] == '\'') //dashed digits
pos +=0;
temp --; //going to letter
else if ( isalpha(term[temp] ) ) //normal digits
pos += pow(2.0, weight);
if(term [temp] == '+' || temp == 0)
result.push_back(pos);
pos = 0; //default case
weight = 0; //default case
weight++;
}//end term to pos
//converte ones position to terms
vector<char> Kmap :: posToTerm(vector<vector<int>> &term)
vector<char>result; //for returinging
int smallLetter = false; //small letters
int digit, //for pushing back
dashCount = 0; //dash cound
//terms loop
for(temp = 0; temp < term.size(); temp++)
//minterms loop
for(temp1 = 0; temp1<term[temp].size(); temp1++)
="" {="" minterms="" loop
="" if(smallletter="=" false="" &&="" temp="" -="" dashcount=""> 9)
smallLetter = true;
digit = temp1 + 65;
if (smallLetter) digit + 22; //97 - 65 - 10
// 97 a ascii, 65 A ascii, 10 numerical a
if(term[temp][temp1] == 0)
result.push_back(digit);
result.push_back(39); //add dash
dashCount ++;
if(term[temp][temp1] == 1)
}//end minterms loop
if(temp < term.size() -1)
result.push_back('+');
}//end terms loop
//no function case
if(term.size() == 0)
result.push_back('0');
else if(result.size() == 0)
result.push_back(49); //1
}//end get Result
void Kmap :: saveValue(vector<int> &tempSave, vector<vector<int>> &saver, vector<bool> &hasSimp)
//checking similiraty
if(tempSave.size () == type -1 )
hasSave = true; //ther will be some save
hasSimp[temp] = true;
hasSimp[temp1] = true;
saver.push_back(vector<int> () ); //initializing terms
//add don't care
for(temp2 = 0; temp2 < term[temp].size(); temp2++)
if(temp2 == tempSave.size() )
tempSave.push_back(-1);
else if(temp2 != tempSave [temp2])
tempSave.insert(tempSave.begin()+temp2,-1);
//save values
for(temp2 = 0; temp2 < tempSave.size(); temp2++)
{//saver for
if(	tempSave[temp2] == -1)
saver[saverCount].push_back(tempSave[temp2] );
saver[saverCount].push_back(term[temp][temp2]);
}//end saver for
saverCount++;
}//end if condition
}//end save values
//add elements hasn't been siplified
void Kmap :: addOther (vector<vector<int>> &saver,vector<bool> &hasSimp, int &saverCount)
//add single element
for(temp2 = 0; temp2 <term.size(); temp2++)
="" if(hassimp[temp2]="=" false="" )
="" saver.push_back(="" vector<int=""> () );
for(int temp4 = 0; temp4 < term[temp2].size(); temp4++)
saver[saverCount].push_back(term[temp2][temp4]);
}//end add other
//remove repeated terms
void Kmap :: unrepeat (vector<vector<int>> &tVec)
for(int temp = 0; temp < tVec.size()-1; temp++)
for(int temp1 = temp+1; temp1 < tVec.size(); temp1++)
if(tVec[temp] == tVec[temp1] )//checking repeating
tVec.erase(tVec.begin()+temp1); //remove repeating elements
temp1--; //decrement after removing
}//end unrepeat
Kmap k1;
k1.setKmap();
modified 17-Jul-13 1:52am.
Gurupadh maity16-Apr-13 10:08
Gurupadh maity 16-Apr-13 10:08
I'm fasanating to dis project but when i compile it in dev c++ there error show undefine refrence there r 11 error like this give me the sol. As soon as possible at mail gurumaity5@gmail.com
thanku 4 dis great project
Re: reference error
Muhammad M. Osama16-Apr-13 11:50
Muhammad M. Osama 16-Apr-13 11:50
the bool data type is not recognized with C compiler, to solve this problem
1) First create an empty project with these files' names (q_mc.h, q_mc.c, 3_var)
2) copy the source code from the downloaded files to the new created files
3) in "3_var.c" modify the main function to return an int type
void main() {...}
int main() {... return 0;}
4) in the project options "alt+p" ==> files, mark "3_var.c" file and select "Compile file as C++" in file options. Do the same for "q_mc.c" file
Hit F11 and it should work for u
Tested with dev C++ v5.4.1 x64
Complains/Expectation
OCHAI20-Dec-12 9:50
OCHAI 20-Dec-12 9:50
please,am a student on research... how do I print Screen? and I also need the code for 4 variables. Thanks.
Re: Complains/Expectation
Muhammad M. Osama20-Dec-12 10:06
Muhammad M. Osama 20-Dec-12 10:06
1) Just use the snipping tool on win7 & win8.
2) Sorry, i don't have any code for the 4 vars, but i encourage you to edit that code for what you want.
about kmaps
Member 945112823-Sep-12 0:00
Member 9451128 23-Sep-12 0:00
is there any java code for kmap implementation????
Re: about kmaps
Muhammad M. Osama23-Sep-12 9:18
Muhammad M. Osama 23-Sep-12 9:18
I can't say no , but u should google it
Muhammad M. Osama23-Sep-12 9:19
Muhammad M. Osama 23-Sep-12 9:19
Or u can get the main fundamentals of the algorithm and make your own java code
soho29-Jul-09 3:36
soho 29-Jul-09 3:36
Can we expect in the future to see the updated version handling more than 3 variables?
Anyhow take 5 for the interesting article!
Muhammad M. Osama29-Jul-09 11:03
Muhammad M. Osama 29-Jul-09 11:03
Yea, i'll try to do that even to cover more than it, may be 8 variables max.
uuuuiiii27-Jul-09 13:05
uuuuiiii 27-Jul-09 13:05
Reminds me of my college days. Even though there is no practical use for this knowledge, in academia or in industry, but it was still fun wasting my time learning how to minimize a circuit I will never see or use.
Emilio Garavaglia24-Jul-09 3:30
Emilio Garavaglia 24-Jul-09 3:30
Nice article, but with an imprecision:
The Quine - McClusky algorithm developped to solve karnaugh maps that are too important in digital design or simplifying the boolean functions.
This is not proper: both QMC and KM are methods to simplify boolena functions.
There are boolean function and then, there are methods to simplify them.
The fact that a bool function simplifyed by one method also appear simplified in the others is a consequence, not the goal of each of the methods.
Muhammad M. Osama24-Jul-09 21:27
Muhammad M. Osama 24-Jul-09 21:27
hi emilio_grv,
Thanks for shaing your idea, you right about QMC & KM algorithms used to simplify boolean functions, i meant QMC used
commenly to implement karnaugh maps in programming because to implement a KM with code is too difficult.
It's my fault,i should have said "The Quine - McClusky algorithm developped to implement not "solve" karnaugh maps",i'll
Please can u tell me what exactly the first 2 bugs are?
Anyway i'll check the files i uploaded again to see if any thing wrong.
Emilio Garavaglia25-Jul-09 1:14
Emilio Garavaglia 25-Jul-09 1:14
ulp! No... that's the signature!
Last Visit: 22-Jan-20 4:01 Last Update: 22-Jan-20 4:01 Refresh 1
Article Copyright 2009 by Muhammad M. Osama


text:
The rooms were very clean, beds comfortable... - Review of Colonial Gardens Bed & Breakfast - TripAdvisor
“Our room was large and romantically furnished...”
“Close to Colonial Williamsburg, Jamestown, and...”
The rooms were very clean, beds comfortable... - Review of Colonial Gardens Bed & Breakfast
See the most recent reviews VirginiaReaver
My wife and I stayed at the Colonial Gardens for two nights on a weekend and had a great time. The innkeepers were polite and attentive, even making dinner reservations for us at a very nice restaurant. They were happy to offer suggestions and driving directions to nearby attractions. The rooms were very clean, beds comfortable, grounds well maintained and no noise to speak of. Breakfast was well prepared and served, and the innkeeper provided just the right amount of conversation. We really enjoyed our stay and would stay there again with no hesitation.
Disliked — Road entrance
Thank VirginiaReaver Report Ask VirginiaReaver about Colonial Gardens Bed & Breakfast
English first Any B3959
1 review 1 helpful vote “What a Great Birthday Gift”
Spent three lovely nights after Thanksgiving Day at the Colonial Gardens Bed and Breakfast, Williamsburg Va.. Kate and I stayed in the Library room, which I found to be quite warm and cozy. The rest of the house was charming, romantic and very clean. I found the 8:30 am breakfast time was perfect, giving us time to sleep in and then head out to tour the historic sites of Jamestown, Yorktown and Williamsburg. Each and every breakfast was a different menu and Kate and I enjoyed each one of them. The conversation around the table with the other quest added to the family atmosphere. The location was centrally located to all the historic sites mentioned above as well as restaurants and the Williamsburg Winery. Hey, they keep a bottle of wine (Williamsburg Winery, Governors White wine) in the sunroom’s frig. Karen recommend and was willing to make reservations for dinner at one of the restaurants. As a side note, Ladies if your husband or significant other is a pilot the Williamsburg Jamestown Airport (JGG) is right down the road. Karen and Ron will be more than willing to pick you up. Gentlemen, instead of flying to a fly-in for pancakes, fly into the Williamsburg area with your loved one for a couple of romantic days, it will get you many brownie points. They both are avid flyers making their B& B very pilot friendly. We both would like to thank you for the wonderful experience. We will be back again, but next time with the plane. Don P.S Kate loved her Birthday Gift
Liked — I Loved the personal treatment.
Thank B3959 Report Ask B3959 about Colonial Gardens Bed & Breakfast
This review is the subjective opinion of a TripAdvisor member and not of TripAdvisor LLC. F4iGuy
2 reviews 2 helpful votes “Nice getaway from the busy D.C.”
After several hiccups in my work schedule, Karen was wonderful enough to be able to reschedule our reservation. Upon arrival I new I had picked the right place to celebrate my girlfriend's birthday. We stayed in The Azalea Suite, which was a breath of fresh air everytime we stepped through the door. The breakfasts were great and we enjoyed meeting the other couples over a fresh cup of coffee. The Bed and Breakfast is very close to all the attractions which was great for sleeping in!
Thank F4iGuy Report Ask F4iGuy about Colonial Gardens Bed & Breakfast
This review is the subjective opinion of a TripAdvisor member and not of TripAdvisor LLC. sojournerAlabama
1 review 1 helpful vote “Delicious and Delightful”
We have just returned from a trip to Williamsburg where we werefortunate to stay at the Colonial Gardens Bed and Breakfast. Wewere very pleased. The thought that comes to mind is "complete". The accommodations were large and elegant with a formal living room and setting room available for our use.All the ammenities were available to us, and I even noticed that there were a dozen red roses in the living room on our last day.Breakfast was a special treat, especially the Grand Manier Orange Sauce over our french toast, along with perfect bacon, fruit, and other goodies. It was a feast for the eyes, as well as for the palate. There were also considerations for my husband who had to watch his carbs. Having breakfast together with other guests helped us to make new friends easily. We enjoyed thinking about the history of the house, as we sat quietly on the front porch over looking the landscaped yard.Colonial Gardens has a great location. It is located about half way between Williamsburg and Jamestown and is easily accessible.Again, let me say the word is "complete", complete hospitality,complete comfort, complete thoughtfulness and geniune kindness from our hostess.We also enjoyed the "Fall Special" available to us.
Liked — food and accomodations
Thank sojournerAlabama Report Ask sojournerAlabama about Colonial Gardens Bed & Breakfast
This review is the subjective opinion of a TripAdvisor member and not of TripAdvisor LLC. MacMommy
My boyfriend and I decided in September that we would love to celebrate our fifth anniversary with a special, romantic weekend in Williamsburg, Virginia. We booked the library room at Colonial gardens based on good reviews we read here and the great deal we were able to get on the room. We LOVED the room, though it was somewhat small and located directly off the main foyer of the house. Noise was minimal and the decor/size of the room made it very romantic and cozy. I could have spent hours (and did, in the evenings) browsing the many books from Karen and Ron's personal collection while relaxing in bed. Souvenirs and keepsakes from Ron's many travels in the air force abounded and were a wonderful, personal touch. The property is gorgeous and feels like a true hidden treasure - it's easy to miss tucked away on Jamestown Road, but I like it that way! Knowing and loving this B&B now feels like an insider's secret, and I felt like house guests of Karen's and Ron's rather than a customer at an inn. The inn also has a truly ideal location; a drive to Colonial Williamsburg, the Merchant's Square shopping district, the College of William and Mary, or the Williamsburg Winery takes only five minutes. Karen and Ron are the most gracious hosts; Karen recommended two wonderful restaurants for dinner to help make our anniversary even more special. We had two FABULOUS breakfasts (the croissant filled with cream cheese is to die for! So is the French toast!) complimented with delightful conversation, a morning weather report, and suggestions about what to do for the day. Complimentary afternoon snacks in the sunroom were a great touch and came in handy! Overall, I cannot recommend this B&B highly enough. We will definitely stay there on our next trip to Virginia (this one turned out to be far too short!) and will enthusiastically recommend Colonial Gardens to friends and family looking for a place to stay in Williamsburg.
Liked — Warm hospitality of innkeepers
Disliked — Nothing!! Stayed October 2007, traveled as a couple
Thank MacMommy Report Ask MacMommy about Colonial Gardens Bed & Breakfast
This review is the subjective opinion of a TripAdvisor member and not of TripAdvisor LLC. StanNJ
1 review 1 helpful vote “Outstanding from check-in to check-out!!!”
Welcoming and warm, the innkeepers Karen and Ron were gracious hosts.Karen provided us with wonderful gourmet breakfasts that we are missing as we write this. The inn had beautiful orignial watercolors and paintings that complimented the relaxing surroundings. Karen provided us with morning weather reports and suggestions for the day.She was very hospitable and knowelegable of the area. We stayed in the Primrose room and it was cozy, comfortable and quiet. The inn was so close to everything in Williamsburg and Jamestown making things very easy to get around. This is the place to stay in the area.
Thank StanNJ Report Ask StanNJ about Colonial Gardens Bed & Breakfast
This review is the subjective opinion of a TripAdvisor member and not of TripAdvisor LLC. outlawtartan
1 review 1 helpful vote “Absolutely a wonderful time...and WIlliamsburg is pretty good too!”
We stayed a couple of nights for our anniversary and had hoped to reserve one of the suites but they ended up all being booked, luckily the smaller room (Library Room) was available. It was a very nice and cozy room. The extra space wasn't missed and is perfect for two that for a cozy night's sleep. The wonderful selection of books to read are amazing. The innkeepers were so warm and inviting and the breakfast was far beyond amazing! Ask for the pancakes when you go! :) The house is beautiful and the complimentary snacks and beverages was an unexpected and great touch. We played some checkers and relaxed in the sun room on our first night there. We will definitely stay again when we can get the chance to run down to Williamsburg. If your looking for a great place to stay while in the area, there is no other place to go! (And it's really close to the college). Thanks!!
Liked — The food, the room, the innkeepers!
Thank outlawtartan Report Ask outlawtartan about Colonial Gardens Bed & Breakfast
TripAdvisor is proud to partner with Expedia, Hotels.com, Booking.com, Orbitz, Hotwire, Travelocity, Cheap Tickets, Priceline, Cancelon and TripOnline SA so you can book your Colonial Gardens Bed & Breakfast reservations with confidence. We help millions of travelers each month to find the perfect hotel for both vacation and business trips, always with the best discounts and special offers.
Explore similar hotels Colonial Houses-Colonial Williamsburg298 ReviewsShow Prices 2.0 miles Williamsburg Lodge, Autograph Collection2,012 ReviewsShow Prices 1.9 miles Williamsburg Inn569 ReviewsShow Prices 2.0 miles See all Williamsburg hotels Browse nearby

value: This website is an American online travel company that operates a website and mobile app with user-generated content and a comparison shopping website.


text:
Jan 31, 2019, 14:03 ET
FRASER, Mich., Jan. 31, 2019 /PRNewswire/ -- After first teaming up in 2017, zipLogix™ and RentSpree are now expanding their efforts to automate rental transactions. Since launch, the successful integration has benefited thousands of zipForm® Plus users nationwide.

value: This website .


text:
Patent US7551940 - Two-way voice communication device having external acoustic noise reduction - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inAdvanced Patent SearchPatentsA two-way voice communication device which provides a high-level of acoustic noise reduction is disclosed. A resilient ear tip provides acoustic isolation and secures the earphone within the ear canal of the user. The ability to rotate the earphone within the ear canal allows the user to easily position...http://www.google.com/patents/US7551940?utm_source=gb-gplus-sharePatent US7551940 - Two-way voice communication device having external acoustic noise reductionAdvanced Patent SearchPublication numberUS7551940 B2Publication typeGrantApplication numberUS 10/755,106Publication dateJun 23, 2009Filing dateJan 8, 2004Priority dateJan 9, 2003Fee statusPaidAlso published asCA2512733A1, EP1582049A2, US20040165720, WO2004064443A2, WO2004064443A3Publication number10755106, 755106, US 7551940 B2, US 7551940B2, US-B2-7551940, US7551940 B2, US7551940B2InventorsMary Paulson, Jonathan K. Stewart, Andrew J. Haapapuro, Viorel Drambarean, Robert B. Schulein, Mead C. KillionOriginal AssigneeEtymotic Research, Inc.Export CitationBiBTeX, EndNote, RefManPatent Citations (20), Non-Patent Citations (6), Referenced by (5), Classifications (37), Legal Events (2) External Links: USPTO, USPTO Assignment, EspacenetTwo-way voice communication device having external acoustic noise reduction
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS4766466 *Apr 14, 1987Aug 23, 1988Minolta Camera Kabushiki KaishaVariable magnification projecting deviceUS4945191 *Aug 3, 1988Jul 31, 1990Toyo Boseki Kabushiki KaishaCurled electrical conductor cordUS5298692 *Nov 4, 1991Mar 29, 1994Kabushiki Kaisha PilotEarpiece for insertion in an ear canal, and an earphone, microphone, and earphone/microphone combination comprising the sameUS5715321 *Oct 23, 1995Feb 3, 1998Andrea Electronics CoporationNoise cancellation headset for use with stand or worn on earUS6080110 *Apr 19, 1999Jun 27, 2000Tel, Inc.Heartbeat monitor for wearing during exerciseUS6129175 *May 7, 1999Oct 10, 2000Radians, Inc.Acoustical control plastisol earpiecesUS6175633 *Apr 9, 1997Jan 16, 2001Cavcom, Inc.Radio communications apparatus with attenuating ear pieces for high noise environmentsUS6320960 *Sep 24, 1999Nov 20, 2001Hello Direct, Inc.Headset with adjustable earpieceUS6430217 *Feb 9, 1999Aug 6, 2002Oki Electric Industry Co, Ltd.Noise eliminated digital wireless transceiver apparatusUS6513621 *Aug 15, 2000Feb 4, 2003Doctors Research GroupMethod of producing and making use of ear tips having a filled airtight chamberUS6729726 *Oct 6, 2001May 4, 2004Stryker CorporationEyewear for hands-free communicationUS6760459 *Feb 15, 2002Jul 6, 2004Youngbo Engineering, Inc.Method for securing a headsetUS6993144 *Sep 28, 2000Jan 31, 2006Etymotic Research, Inc.Insert earphone assembly for audiometric testing and method for making sameUS20020131585 *Sep 10, 2001Sep 19, 2002Aura Communications, Inc.In-the-ear headsetUS20020181729 *Jun 1, 2001Dec 5, 2002Smith Richard C.Hearing enhancement communication linkUS20020193151 *Apr 16, 2001Dec 19, 2002Edreich David B.Cell phone retractable earpieceUS20030003969 *Jun 29, 2001Jan 2, 2003Eric TongCellular telephone headsetUS20040082360 *Dec 14, 2001Apr 29, 2004Gunter David CharlesModular communications devicesUS20040125979 *Aug 7, 2001Jul 1, 2004Josef ElidanEarphone for a cellular phoneUSRE38351 *Jan 21, 2000Dec 16, 2003Etymotic Research, Inc.High fidelity insert earphones and methods of making same* Cited by examinerNon-Patent CitationsReference1Jabra Corporation, "FreeSpeak BT200" , Product Information, copyright 2002.2Jabra Corporation, "Jabra 2WayBud", Product Information obtained from website on Jan. 8, 2003, http://jabra.com/products/jabra2waybud.htm.3Jabra Corporation, "Jabra EarWrap", Product Information obtained from website on Jan. 9, 2003, http://www.jabra.com/products/jabraearwrap.htm.4Sony Electronics Inc., "DR-EX150UP", product information obtained from website on Jan. 9, 2003, http://www.sonystyle.com/is-bin/INTERSHOP.enfinity/eCS/Store/en/-/USD/SY.5Sony Electronics Inc., "TL-DR150EX" product information obtained from website on Jan. 9, 2003, http://www.sel.sony.com/SEL/consumer/ss5/home/accessories/wispear/tl-dr150ex.shtml.6Sony Electronics Inc., "wisp.ear Hands-Free Headset TL-DR140", product information obtained from website on Jan. 9, 2003, http://www.sonystyle.com.Referenced byCiting PatentFiling datePublication dateApplicantTitleUS8010171Sep 4, 2007Aug 30, 2011Pinnacle Peak Holding CorporationWireless portable radio vehicle communication systemUS8061473 *Aug 10, 2010Nov 22, 2011Simply SoundPassive personal vocal monitorUS8195253Jul 18, 2011Jun 5, 2012Pinnacle Peak Holding CorporationWireless portable radio vehicle communication systemUS8837713Oct 27, 2010Sep 16, 2014Hewlett-Packard Development Company, L.P.Systems, methods, and apparatus for enabling audio transmission within a communications sessionUS20120220342 *Feb 21, 2012Aug 30, 2012Holliday Thomas RLuminous cellphone display* Cited by examinerClassifications U.S. Classification455/550.1, 379/430, 381/370, 455/569.1, 455/575.1, 381/375, 381/380, 455/569.2, 455/556.1International ClassificationH04M1/60, H04B1/38, H04R1/08, H04M1/05, H04B1/44, H04R1/28, H04R1/10, H04R25/00, H04M1/19, H04M1/00Cooperative ClassificationH04R2201/107, H04R5/033, H04R1/1083, H04R1/1041, H04R1/08, H04M1/6058, H04M1/19, H04M1/05, H04B2001/3866, H04B1/44, H04B1/385, H04R1/1016, H04R1/1033European ClassificationH04B1/38P4, H04M1/60T2B, H04M1/19, H04M1/05, H04R1/10BLegal EventsDateCodeEventDescriptionDec 13, 2012FPAYFee paymentYear of fee payment: 4Jan 13, 2006ASAssignmentOwner name: ETYMOTIC RESEARCH, INC., ILLINOISFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:PAULSON, MARY;STEWART, JONATHAN K.;HAAPAPURO, ANDREW J.;AND OTHERS;REEL/FRAME:017450/0334;SIGNING DATES FROM 20040220 TO 20040224RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services


text:
1 RESULTS Media Type 1 audio Topics & Subjects 1 Dark Ambient 1 Found Sounds 1 Instrumental 1 Lo-Fi Collection 1 Entity 1 rjnagle Favorites 1 Netlabels Creator 1 cd-r SHOW DETAILS
favorite 1 comment 2 Back to Russia, where Nikita Golyshev (CD-R) and Evgeny Novikov performed an impressive live session (13/03/05, Moscow), which formed the building blocks of this quite experimental album. The unique approach of this duo allows for the most distant elements to be combined in something that sounds at times like a (sur)real environment, and at other times more like a guitar thrown in a trash compactor (if you've enjoyed NTT014 - Universumix, you realise that this isn't necessarily a bad thing).... favoritefavoritefavoritefavoritefavorite ( 2 reviews ) Topics: Instrumental, Lo-Fi, Found Sounds, Dark Ambient MORE RESULTS

value: This website is an American digital library with the stated mission of "universal access to all knowledge". It provides free public access to collections of digitized materials, including websites, software applications/games, music, movies/videos, moving images, and millions of books.


text:
Parvez Taj 'Aspen Forest' Canvas Print | Overstock.com Shopping - The Best Prices on Canvas Art
30 x 15 - $173.99 40 x 20 - $234.99 50 x 25 - $277.99 60 x 30 - $311.99 Please select an option first.
$173.99 Item #: 15896253
Aspen Forest' is a canvas art print by artist Parvez Taj. Featuring an eco-friendly, solvent-free ink on canvas, this art piece will never crack, flake or fade, artist signature on the front, artist bio on the back.
Product Features: Ready to hang, high quality canvas print
25 inches high x 50 inches wide
http://www.overstock.com/Main-Street-Revolution/Parvez-Taj-Aspen-Forest-Canvas-Print/8632434/product.html

value: This website is an American internet retailer selling primarily furniture headquartered in Midvale, Utah, near Salt Lake City.


text:
Wide variation in the multiplicity of HIV-1 infectio... [J Virol. 2010] - PubMed - NCBI
Display Settings:AbstractFormatSummarySummary (text)AbstractAbstract (text)MEDLINEXMLPMID ListApplySend to:Choose DestinationFileClipboardCollectionsE-mailOrderMy BibliographyCitation managerFormatSummary (text)Abstract (text)MEDLINEXMLPMID ListCSVCreate File1 selected item: 20375173FormatSummarySummary (text)AbstractAbstract (text)MEDLINEXMLPMID ListMeSH and Other DataE-mailSubjectAdditional textE-mail"SPAM" filtering software noticeAdd to ClipboardAdd to CollectionsOrder articlesAdd to My BibliographyGenerate a file for use with external citation management software.Create File
See comment in PubMed Commons belowJ Virol. 2010 Jun;84(12):6241-7. doi: 10.1128/JVI.00077-10. Epub 2010 Apr 7.Wide variation in the multiplicity of HIV-1 infection among injection drug users.Bar KJ1, Li H, Chamberland A, Tremblay C, Routy JP, Grayson T, Sun C, Wang S, Learn GH, Morgan CJ, Schumacher JE, Haynes BF, Keele BF, Hahn BH, Shaw GM.Author information 1University of Alabama at Birmingham, 720 South 20th Street, 816 KAUL Building, Birmingham, AL 35294-0024, USA.AbstractRecent studies indicate that sexual transmission of human immunodeficiency virus type 1 (HIV-1) generally results from productive infection by only one virus, a finding attributable to the mucosal barrier. Surprisingly, a recent study of injection drug users (IDUs) from St. Petersburg, Russia, also found most subjects to be acutely infected by a single virus. Here, we show by single-genome amplification and sequencing in a different IDU cohort that 60% of IDU subjects were infected by more than one virus, including one subject who was acutely infected by at least 16 viruses. Multivariant transmission was more common in IDUs than in heterosexuals (60% versus 19%; odds ratio, 6.14; 95% confidence interval [CI], 1.37 to 31.27; P = 0.008). These findings highlight the diversity in HIV-1 infection risks among different IDU cohorts and the challenges faced by vaccines in protecting against this mode of infection.PMID: 20375173 [PubMed - indexed for MEDLINE] PMCID: PMC2876625 Free PMC ArticleShareImages from this publication.See all images (2)Free textFIG. 1.NJ trees and Highlighter plots of HIV-1 gp160 env sequences. (A) Composite tree of 382 gp160 env sequences from all study subjects. The numerals at the nodes indicate bootstrap values for which statistical support exceeded 70%. (B) Subject ACT54869022 sequences suggest productive infection by a single virus (V1). (C) Subject HDNDRPI032 sequences suggest productive infection by as many as three viruses. (D) Subject HDNDRPI001 sequences suggest productive infection by at least five viruses with extensive interlineage recombination. Sequences are color coded to indicate viral progeny from distinct transmitted/founder viruses. Recombinant virus sequences are depicted in black. Methods for SGA, sequencing, model analysis, Highlighter plotting, and identification of transmitted/founder virus lineages are described elsewhere (18, 20, 24, 44). The horizontal scale bars represent genetic distance. nt, nucleotide.Wide Variation in the Multiplicity of HIV-1 Infection among Injection Drug Users J Virol. 2010 June;84(12):6241-6247.FIG. 2.NJ tree and Highlighter plot of HIV-1 3′ half-genome sequences from subject HDNDRPI034. Sequences emanating from 16 transmitted/founder viruses are color coded. Fourteen transmitted/founder viral lineages comprised of 2 or more identical or nearly identical sequences could be readily distinguished from recombinant sequences (depicted in black), which invariably appeared as unique sequences containing interspersed segments shared with other transmitted/founder virus lineages. The two sequences with the longest branch lengths (3F8 and G10) were interpreted to represent rare progeny of discrete transmitted/founder viruses because their unique polymorphisms far exceeded the maximum diversity estimated to occur in the first 30 days of infection (0.22%; CI, 0.15 to 0.31%) (18) and far exceeded the diversity observed within the other transmitted/founder virus lineages. The horizontal scale bar represents genetic distance.Wide Variation in the Multiplicity of HIV-1 Infection among Injection Drug Users J Virol. 2010 June;84(12):6241-6247.Publication Types, MeSH Terms, Substances, Secondary Source ID, Grant SupportPublication TypesResearch Support, N.I.H., ExtramuralResearch Support, Non-U.S. Gov'tMeSH TermsAdolescentAdultBase SequenceCohort StudiesDrug Users/statistics & numerical data*FemaleGenetic Variation*Genome, ViralHIV Envelope Protein gp160/geneticsHIV Infections/epidemiologyHIV Infections/virology*HIV-1/classificationHIV-1/genetics*HIV-1/isolation & purificationHIV-1/physiologyHumansMaleMiddle AgedMolecular Sequence DataRussia/epidemiologySequence Analysis, DNAYoung AdultSubstancesHIV Envelope Protein gp160Secondary Source [encoded data, 6295 characters] Support266200400088C/PHS HHS/United StatesAI27767/AI/NIAID NIH HHS/United StatesAI67854/AI/NIAID NIH HHS/United StatesCanadian Institutes of Health Research/CanadaLinkOut - more resourcesFull Text SourcesHighWireEurope PubMed CentralPubMed CentralPubMed Central CanadaOther Literature SourcesCOS Scholar UniverseMedicalHIV - Genetic AllianceHIV/AIDS - MedlinePlus Health InformationHIV/AIDS in Women - MedlinePlus Health InformationMolecular Biology DatabasesLANL HIV DatabasesMiscellaneousSee the articles recommended by F1000Prime's Faculty of more than 5,000 expert scientists and clinical researchers. - Faculty of 1000PubMed Commons home


text: Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS3715718 *Aug 11, 1970Feb 6, 1973Sundstrand Data ControlGround proximity warning system utilizing radio and barometric altimeter combinationUS3946358 *Jun 19, 1974Mar 23, 1976Sundstrand Data Control, Inc.Aircraft ground proximity warning instrumentUS3947810 *Jan 13, 1975Mar 30, 1976Sundstrand Data Control, Inc.Negative climb rate after take-off warning system with predetermined loss of altitude inhibitUS4030065 *Jul 19, 1976Jun 14, 1977Sundstrand CorporationTerrain clearance warning system for aircraftUS4060793 *Jul 19, 1976Nov 29, 1977Sundstrand Data Control, Inc.Excessive sink rate warning system for aircraft* Cited by examinerNon-Patent CitationsReference1 *Sundstrand Data Control, Inc., "Mark II Ground Proximity Warning System", 1976.* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS4431994 *May 6, 1981Feb 14, 1984The United States Of America As Represented By The Secretary Of The Air ForceMethod for supplying altitude signals to an output busUS4516124 *Jul 22, 1982May 7, 1985Harry D. ShannonConvertible amphibious aircraft wheel position warning systemUS4567483 *Dec 10, 1982Jan 28, 1986Sundstrand Data Control, Inc.Position based ground proximity warning system for aircraftUS4639730 *May 13, 1983Jan 27, 1987Sundstrand Data Control, Inc.Excessive terrain closure warning systemUS4818992 *Jun 10, 1983Apr 4, 1989Sundstrand Data Control, Inc.Excessive altitude loss after take-off warning system for rotary wing aircraftUS4916447 *May 13, 1983Apr 10, 1990Sundstrand Data Control, Inc.Warning system for aircraft landing with landing gear upUS4939513 *Aug 20, 1984Jul 3, 1990Sundstrand Data Control, Inc.System for alerting a pilot of a dangerous flight profile during low level maneuveringUS4951047 *May 13, 1983Aug 21, 1990Sunstrand Data Control, Inc.Negative climb after take-off warning systemUS4987413 *Jun 4, 1987Jan 22, 1991Sundstrand Data Control, Inc.Aircraft terrain warning system with configuration modified warning and improved mode switchingUS5047942 *May 11, 1988Sep 10, 1991The United States Of America As Represented By The Administrator Of The National Aeronautics And Space AdministrationAirplane takeoff and landing performance monitoring systemUS5220322 *Aug 29, 1985Jun 15, 1993Sundstrand CorporationGround proximity warning system for use with aircraft having egraded performanceUS5283574 *Jul 31, 1987Feb 1, 1994Sundstrand Data Control, Inc.Altitude loss after take-off warning system utilizing time and altitudeUS5519391 *Sep 7, 1994May 21, 1996Alliedsignal Inc.Improper flap position on take-off warningUS5666110 *Mar 9, 1995Sep 9, 1997Paterson; Noel S.Warning system for providing a warning to a pilotUS5745053 *Dec 8, 1995Apr 28, 1998Fleming, Iii; Hoyt A.Landing gear warning apparatus and method for pilots approaching a runway with retracted landing gearUS5781126 *Apr 29, 1997Jul 14, 1998Alliedsignal Inc.Ground proximity warning system and methods for rotary wing aircraftUS5839080 *Jul 31, 1995Nov 17, 1998Alliedsignal, Inc.Terrain awareness systemUS6043759 *Apr 29, 1997Mar 28, 2000AlliedsignalAir-ground logic system and method for rotary wing aircraftUS6092009 *Jul 30, 1997Jul 18, 2000AlliedsignalAircraft terrain information systemUS6122570 *Jun 19, 1998Sep 19, 2000Alliedsignal Inc.System and method for assisting the prevention of controlled flight into terrain accidentsUS6138060 *Sep 2, 1997Oct 24, 2000Alliedsignal Inc.Terrain awareness systemUS6219592May 8, 1998Apr 17, 2001Alliedsignal Inc.Method and apparatus for terrain awarenessUS6292721Jun 23, 1998Sep 18, 2001Allied Signal Inc.Premature descent into terrain visual awareness enhancement to EGPWSUS6347263Oct 15, 1999Feb 12, 2002Alliedsignal Inc.Aircraft terrain information systemUS6380870Feb 1, 2000Apr 30, 2002Honeywell International, Inc.Apparatus, methods, and computer program products for determining a look ahead distance value for high speed flightUS6445310Feb 1, 2000Sep 3, 2002Honeywell International, Inc.Apparatus, methods, computer program products for generating a runway field clearance floor envelope about a selected runwayUS6469664Jun 26, 2000Oct 22, 2002Honeywell International Inc.Method, apparatus, and computer program products for alerting surface vessels to hazardous conditionsUS6477449Feb 1, 2000Nov 5, 2002Honeywell International Inc.Methods, apparatus and computer program products for determining a corrected distance between an aircraft and a selected runwayUS6484071Feb 1, 2000Nov 19, 2002Honeywell International, Inc.Ground proximity warning system, method and computer program product for controllably altering the base width of an alert envelopeUS6583733May 25, 2001Jun 24, 2003Honeywell International Inc.Apparatus, method and computer program product for helicopter ground proximity warning systemUS6606034Jul 31, 1995Aug 12, 2003Honeywell International Inc.Terrain awareness systemUS6643580Oct 15, 1999Nov 4, 2003Universal Avionics Systems CorporationFlight plan intent alert system and methodUS6691004Jun 25, 2001Feb 10, 2004Honeywell International, Inc.Method for determining a currently obtainable climb gradient of an aircraftUS6707394Feb 1, 2000Mar 16, 2004Honeywell, Inc.Apparatus, method, and computer program product for generating terrain clearance floor envelopes about a selected runwayUS6734808Jun 26, 2000May 11, 2004Honeywell International Inc.Method, apparatus and computer program products for alerting submersible vessels to hazardous conditionsUS6737987May 25, 2001May 18, 2004Honeywell International Inc.Method, apparatus and computer program product for helicopter tail strike warningUS6745115Jan 7, 2003Jun 1, 2004Garmin Ltd.System, method and apparatus for searching geographic area using prioritized spacial orderUS6750815Aug 27, 2002Jun 15, 2004Honeywell International Inc.Method, apparatus, and computer program products for alerting surface vessels to hazardous conditionsUS6785594Mar 24, 2000Aug 31, 2004Honeywell International Inc.Ground proximity warning system and method having a reduced set of input parametersUS6826459Aug 30, 2002Nov 30, 2004Honeywell International Inc.Ground proximity warning system, method and computer program product for controllably altering the base width of an alert envelopeUS6833797May 25, 2001Dec 21, 2004Honeywell International Inc.Method, apparatus and computer program product for displaying terrain in rotary wing aircraftUS6940427Apr 1, 2002Sep 6, 2005Honeywell International, Inc.Pitch alerting angle for enhanced ground proximity warning system (EGPWS)US7363121Mar 30, 2007Apr 22, 2008Garmin International, Inc.System, method and apparatus for searching geographic area using prioritized spatial orderUS7382287Jun 3, 2003Jun 3, 2008Garmin International, IncAvionics system, method and apparatus for selecting a runwayUS7386373 *Nov 24, 2003Jun 10, 2008Garmin International, Inc.System, method and apparatus for searching geographic area using prioritized spatial orderUS7698058Dec 27, 2007Apr 13, 2010Garmin International, Inc.System, method and apparatus for searching geographic area using prioritized spatial orderUS20140172202 *Dec 14, 2012Jun 19, 2014Safe Flight Instrument CorporationSystems and methods for safely landing an aircraftDE3303790A1 *Feb 4, 1983Aug 18, 1983Sundstrand Data ControlBodennaehewarnsystem fuer flugzeugeDE3417827A1 *May 14, 1984Nov 15, 1984Sundstrand Data ControlVerfahren und vorrichtung zur erzeugung eines warnsignals beim absinken eines flugzeugs nach dem startDE3417884A1 *May 14, 1984Dec 13, 1984Sundstrand Data ControlVerfahren und vorrichtung zur anzeige eines gefaehrlichen flugprofils bei flugbewegungen in geringer hoeheEP1990609A2Jun 27, 2000Nov 12, 2008Honeywell International Inc.Method and apparatus for altering surface vessels to hazardous conditionsEP2336716A2Jun 27, 2000Jun 22, 2011Honeywell International Inc.Method and apparatus for alerting surface vessels to hazardous conditionsWO1986005021A1 *Feb 21, 1986Aug 28, 1986Sundstrand Data ControlAircraft terrain warning system with configuration modified warning and improved mode switchingWO1986005022A1 *Feb 21, 1986Aug 28, 1986Sundstrand Data ControlAltitude loss after take-off warning system utilizing time and altitudeWO1998041911A1 *Mar 20, 1998Sep 24, 1998Geoffrey S M HedrickAltitude alert system for aircraft operating in reduced vertical separation minimum airspace and method therefor* Cited by examinerClassifications U.S. Classification340/970, 244/180, 340/959, 73/178.00T, 340/960International ClassificationB64D45/04, G01P3/62, G01C21/00, G01C21/20, G05D1/06, G01C5/00, G08G5/02Cooperative ClassificationG01C5/005, G01P3/62, G05D1/0607, G05D1/0653European ClassificationG01C5/00A, G05D1/06B, G01P3/62, G05D1/06B6Legal EventsDateCodeEventDescriptionDec 7, 1993ASAssignmentOwner name: ALLIEDSIGNAL INC., NEW JERSEYFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:SUNDSTRAND CORPORATION;REEL/FRAME:006797/0346Effective date: 19931117Jan 17, 1992ASAssignmentOwner name: SUNDSTRAND DATA CONTROL, INC.Free format text: ASSIGNMENT OF ASSIGNORS INTEREST.;ASSIGNOR:SUNDSTRAND DATA CONROL, INC. A CORP. OF DELAWRE;REEL/FRAME:005977/0022Effective date: 19920113Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:SUNDSTRAND DATA CONROL, INC.;REEL/FRAME:005977/0022Owner name: SUNDSTRAND DATA CONTROL, INC., STATELESSRotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services©2012 Google


text:
Writing Goals And Objectives and th... by Maria Lorena Guray 2178 views
Technology Goals for the IEP: How t... by Yue-Ting Siu, TVI 647 views
1. FOR FUNCTIONAL LIVING ASSISTIVE TECHNOLOGY Presenters: Barbara Serianni, Kathy Becht, & Kelly Schaffer
2. BIG IDEAS for Today
3. FOUR Everyday Tech Tools
4. • Teach new skills • Convenient reminders • Support independence • Increase self-confidence VIDEO Modeling - WHY
5. • Create it from your desk or record it on the go from your smartphone • Edit video in iMovie (Mac) or Movie Maker (PC) • Push out to YouTube VIDEO Modeling – HOW
6. Let’s Do It! 1. Select a partner 2. Make sure one of you can record video on your phone 3. Pick something to demonstrate 4. Rehearse 5. Video demonstration 6. View playback
7. How To Get it To Our Clients
8. Covert Audio Coaching (Bug in Ear) • Effective in increasing the work performance of supported employees • Performance maintained several weeks following intervention • Intervention was effective across participants and work tasks Bennett, K., Brady, M. P., Scott, J., Dukes, C., & Frain, M. 2010. The Effects of Covert Audio Coaching on the Job Performance of Supported Employees. Focus on Autism and Other Developmental Disabilities (25) 173. DOI: 10.1177/1088357610371636
9. Bug in Ear Coaching - WHY • Discrete • Encourages Independence • Real-time Explicit Coaching • Direct Intervention
10. Bug in Ear Coaching – HOW • Individual being coached wears a bluetooth ear-piece • Coach delivers prompts and corrective feedback through cell phone
11. Bug in Ear Coaching - Example
12. Let’s Do It! 1. Get into small groups with at least one bluetooth device 2. Pick someone to coach 3. Determine an objective for your “client” 4. Connect to “consumer” via phone call 5. Coach “consumer” through bluetooth headset
13. • Video instead of text • Improve understandability • Great for non-readers • Perfect for non-writers Video Email - WHY
14. • Compose from your computer or smartphone • Compose on the fly • No editing required Video Email - HOW http://corp.eyejot.com/
15. Portable Digital Video Tools First Then Visual Schedule First – Then with a countdown timer!
16. Portable Digital Video Tools iPrompts Visual supports, schedules & picture prompting
17. Portable Digital Video Tools Picture Prompt Timer First – Then with a countdown timer!
18. Portable Digital Video Tools Video Scheduler Portable Scheduler PLUS Video Modeling!
19. Questions? More Information? http://coachwandawade.com/ https://sites.google.com/site/ucfaccesstoday/bug-in-ear https://sites.google.com/site/seriannionline/special-populations Email - barbara.serianni@ucf.edu

value: This website is an American hosting service, now owned by Scribd, for professional content including presentations, infographics, documents, and videos. Users can upload files privately or publicly in PowerPoint, Word, PDF, or OpenDocument format.


text:
excel - Rounding up to nearest higher integer in VBA - Stack Overflow
Rounding up to nearest higher integer in VBA
I'm trying to calculate how many layers a commodity will be stacked in. I have a variable quantity (iQty), a given width for the loadbed (dRTW), a width per unit for the commodity (dWidth) and a quantity per layer (iLayerQty).
The quantity per layer is calculated as iLayerQty = Int(dRTW/dWidth)
Now I need to divide the total quantity by the quantity per layer and round up. In an Excel formula it would be easy, but I'm trying to avoid WorksheetFunction calls to minimise A1/R1C1 confusion. At the moment I'm approximating it with this:
(Number of layers) = ((Int(iQty / iLayerQty) + 1)
And that works fine most of the time - except when the numbers give an integer (a cargo width of 0.5 m, for instance, fitting onto a 2.5 m rolltrailer). In those instances, of course, adding the one ruins the result.
Is there any handy way of tweaking that formula to get a better upward rounding?
65522 gold badges77 silver badges2222 bronze badges
use WorksheetFunction.Ceiling() – Vasily Ivoyzha Mar 2 '16 at 12:23
But that's a worksheetfunction as well - then I might as well just use Roundup. That said, having looked up Ceiling, I think it might be useful for another thing I've been working on - thanks! – Andrew Perry Mar 2 '16 at 12:49
Ceiling is a bit extended variant of roundup, you can specify the rounding step, that is why I have proposed it. – Vasily Ivoyzha Mar 2 '16 at 13:02
I don't see any reason to avoid WorksheetFunction; I don't see any confusion here.
Number_of_layers = WorksheetFunction.RoundUp(iQty / iLayerQty, 0)
Function RoundUp(ByVal Value As Double)
If Int(Value) = Value Then
RoundUp = Value
RoundUp = Int(Value) + 1
Number_of_layers = RoundUp(iQty / iLayerQty)
edited Mar 2 '16 at 12:30
If using a WorksheetFunction object to access a ROUNDUP or CEILING function is off the table then the same can be accomplished with some maths.
Number of layers = Int(iQty / iLayerQty) - CBool(Int(iQty / iLayerQty) <> Round(iQty / iLayerQty, 14))
A VBA True is the equivalent of (-1) when used mathematically. The VBA Round is there to avoid 15 digit floating point errors.
answered Mar 2 '16 at 12:33
Finding highest decimals and rounding up with VBA - version numbering
Sorting items into batches
Using Excel's Rounddown in a UDF rounds 1 to 0

value: This website is a question and answer website for professional and enthusiast programmers. It is the flagship site of the Stack Exchange Network, created in 2008 by Jeff Atwood and Joel Spolsky.


text:
Cottage Na Beregu Morja سوشي حجز رخيص فوري مع اجودا دعم عملاء
المزيد حول Cottage Na Beregu Morja
Cottage Na Beregu Morja offers pet-friendly accommodation in Novaya Matsesta. It provides free private parking.
You can play billiards at the property, and the area is popular for skiing. Sochi is 9 km from Cottage Na Beregu Morja, while Adler is 14 km away. A selection of activities are offered in the area, such as fishing and hiking. Adler-Sochi International Airport is 15 km from the property.

value: This website is a Singaporean online travel agency and metasearch engine for hotels, vacation rentals, flights, and airport transfer. It is owned by Agoda Company Pte.


text:
Motorola Moto 360 Sport Smart Watch 2nd Gen 45mm Stainless Steel/Black Good
cellularstream (130966 )
Rubber Silicone Sport Watch Band For Motorola Moto 360 Smart Watch
Last updated on Jun 19, 2019 14:58:29 PDT View all revisions
Band Color: Black Storage Capacity: 4 GB
Network: simply Band Material: Leather
As advertised and looks great. Thank you...

value: This website is an American multinational e-commerce corporation based in San Jose, California, that facilitates consumer-to-consumer and business-to-consumer sales through its website.


text:
Cece on Etsy
French Sterling Silver Ornate Holy Cross, Crucifix Charm Religious Medal, Antique Catholic Necklace Pendant, Fleur De Lis Baroque Revival
Antique Virgin Mary Medal
SALE Petal Top, Flowers, Floral, Vintage Tea Towel, Upcycled, Vintage print fabric, Tunic
Handmade Vintage style camisole with ribbon straps/ Upcycled fashion
Women's Bubble Dress Patchwork Clothing Sleeveless Boho Dress Funky Clothes Upcycle Recycle Balloon Skirt Casual Hipster Wear S M 'BRANDI'
Quick Magazine November 27th, 1950
Vintage Unused Get Well Blue Bird Card with Envelope Made in USA, Blue Birds, Blue Bird Get Well Card, Unused Get Well Card,Good Health Card
Vintage Dictionary (100) Pages- Vintage paper ephemera lot paper pack
FLORAL STAMP | Thank You card
Helicopter Dog Mom Shirt - Dog Mom AF - Fur Mama - Dog Lover Gift - Dog Owner - Bella Canvas Unisex Graphic Tee
Dog Mom - Cute Popular Comfortable Woman's Crewneck Sweatshirt - Winter Clothing Casual Gift for Her, fur mama, rescue Dogs, love dogs
There's Like A Bunch Of Dogs In Here Doormat - Big Dog Paw Prints - Handpainted Custom Cute Funny Welcome Door Mat Dog Mom Quote
Pressed Lavender, Rose and Hydrangea bouquet. Real flower picture. Handmade, unique home decor. Birthday, Mother's Day gift. Rustic style.
PressedFlowerPeace
Personalized Rosary Beads in White and Pink- Baptism Gift, First Communion Gift, Confirmation, Baby or Little Girl Keepsake, Mother Rosary
Gorgeous Swarovski Catholic Rosary, Holy Trinity Catholic Rosaries, Heirloom Baptism Gifts, Pearl Rosaries, Catholic Wedding Gifts,
Blue Sapphire Diamond Engagement Ring 14k White Gold Cluster Simple Wedding Yellow Gold Rose Color Thin Band Matching Casual Ring
RusticMercadito
HannahFarrs

value: This website is an American e-commerce company focused on handmade or vintage items and craft supplies.


text:
Amazon.com: Profile For abombtmc: Reviews
Profile for abombtmc > Reviews
abombtmc's Profile
Top Reviewer Ranking: 4,053,569
Reviews Written by abombtmc Show:
KINGSHOW Men Warm Waterproof Winter Snow Leather Boots Color:Brown Size:8.5
Offered by Wonderful Day -Ships From USA-
3 used & new from $34.88
like I said, January 27, 2016
This review is from: Kingshow - Mens Warm Waterproof Winter Leather High Height Snow Boot (Apparel)
These boots took me through Snowzilla 2016 with flying colors! They kept my feet and socks warm and dry through several hours of being thigh deep in the snow. They are a little roomier inside than I thought for the size I purchased, but that works well if you want to wear thicker socks or layers (although, like I said, even just one pair of regular athletic socks and I was totally fine). The padding in the sole isn't the fanciest, but for the price these are amazing.
Peter Capaldi gets off to a good start, July 22, 2015
This review is from: Doctor Who Season 8 (Amazon Video)
Peter Capaldi has a great take on the Doctor and will continue to grow into the role. Clara is slightly less likable in this season than she was with Matt Smith, and I only liked Danny Pink in episode 8 ("In the Forest of the Night"). Moffat continues to have moments of brilliance but still lacks a sense of season-wide story pacing and character development. Taken as a whole: better than season 7, but not as good as seasons 3 or 4.
SheetWorld Fitted Crib / Toddler Sheet - Fire Engines Blue - Made In USA
Offered by Sheet World
great buy, August 30, 2013
This review is from: SheetWorld Fitted Crib / Toddler Sheet - Fire Engines Blue - Made In USA (Baby Product)
Lot's of fire trucks on a fitted sheet that's ACTUALLY BIG ENOUGH to fit on a toddler mattress. Reasonable price for something that absolutely made my son's day!
Frankie's Firetruck Toddler Bedding Fire Truck 5 Piece Boy Set
Offered by BeyondBedding
too expensive for what you get, August 30, 2013
This review is from: Frankie's Firetruck Toddler Bedding Fire Truck 5 Piece Boy Set (Baby Product)
We ordered this 5 piece set for our toddler who LOVES fire trucks. The quality seems to be good so far (we haven't washed it yet, so I can't speak to how it will hold up in the dryer), so my only complaint is this: the fire truck designs are only on the comforter and pillow sham. 2 out of 5 pieces! The top sheet, fitted sheet, and regular pillow case (you know, the one that you actually use in real life in a little boy's room) are all plain blue and have NO fire truck designs on them. For the money, I really expected more.
by Davis Rider RobinsonEdition: Paperback
34 used & new from $7.10
Great book!, July 13, 2013
This review is from: The Physical Comedy Handbook (Paperback)
I loved this book! Very well written, with a perfect blend of specific instruction balanced with open-ended freedom to explore each exercise. I've been using many of these techniques on stage for years, but it was incredibly validating to see them written out and to understand why they were already such an integral part of my unconscious comedic mind.
88 used & new from $11.74

value: This website is an American multinational technology company which focuses on e-commerce, cloud computing, digital streaming, and artificial intelligence.


text:
Latest News for: valances curtains
Window Coverings ... The crib may look just right centered under the window, but once your little one can reach the curtains, you may be in for some problems ... Curtains are a temptation most young children can’t resist ... That’s why it’s a good idea to skip floor-length curtains and opt instead for valances or bolsters that still add a decorative touch but are well out of reach of curious hands. Door Blinds ... Furniture ... ....
Sophie Donelson: Keep window coverings simple
Q. My curtains feel dated, but I don’t know where to begin the update ... Valances, the upholstered fronts used to mask curtain hardware, can be downright artful in the hands of a gifted decorator, but the rest of us shouldn’t overdo it. Designer Amy Aidinis Hirsch, a Greenwich native, suggests pinch-pleat curtains and a metal 1-inch thick pole in a dark finish and matching curtain rings ... ....
Forget downsizing! Covington empty nesters show off home additions at 'History and Holly' tour
Montrose Press 09 Dec 2017
A few years ago, Tom and Linda McCarthy faced a dilemma about their beloved historic home in Covington. All three of their sons had graduated from college and started lives of their own elsewhere ... Perhaps it made sense to downsize or move ... +9 ... +9 ... “She came up with the idea for the bed curtains in the master and for finding the right fabrics for things like the valance in the kitchen over the sink and curtains in the hallway,” Linda said....
Forget downsizing! Covington empty nesters add on instead
Upgrade curtainsNo, we are not talking about replacing the curtains of the room, but we are suggesting you upgrade the existing curtains. Applying braid, tape or trim to the leading edge of the curtains will accentuate the height of your bedroom. Adding a valance or cornice adds a royal feeling to the room while keeping draperies pulled together ... How about a canopy?Let a piece of curtain or an old shift act as a makeshift canopy....
Handy tips to brighten dark rooms
You have been feeling for some time now that your home is dark, and consequently, gloomy. But, you have either been lazy or afraid to do something about it. Experts agree that gloomy rooms cause moods to swing towards depression. And of course, we don’t want that. So, what can you do about it? Well, there is plenty ... Curtains without a doubt are a part of any good decor ... To keep a room light, avoid heavy curtains and valances ... ....
Pioneer Woman Kitchen Curtain and Valance Set for $14 + pickup at Walmart
Walmart offers the Pioneer Woman 2-Piece Kitchen Curtain and Valance Set in Flea Market for $13.52. Opt for in-store pickup to dodge the $5.99 shipping charge. That's $6 off and the lowest price we could find. It includes two 40" x 54" rod pocket panels and two tiebacks ... ....
Mainstays Textured Solid Valance Curtain for $5 + pickup at Walmart
Walmart offers the Mainstays Textured Solid Valance Curtain in four colors (Taupe pictured) for $4.97. Opt for in-store pickup to avoid the $5.99 shipping charge. That's tied with our mention from a month ago, a buck off, and the lowest price we could find. It measures 56" x 17" and fits curtain rods up to 1-1/2" in diameter ... ....
Dua Lipa has arrived: Meet the dance-pop diva who's dominating NYC (PHOTOS)>
Lipa hasn't "broken through" in the U.S. yet? Tell that to sold-out Irving Plaza. NEW YORK -- The best-selling British female artist of 2016 was, unsurprisingly, Adele. Can you guess who was No. 2? Probably not, unless you're visiting this website from Krakow or Bratislava ... and reached No ... For NJ.com) ... Few could have pulled off her night's outfit -- what appeared to be repurposed checker-print curtain valances. ....
Having a luxurious bed isn’t just a fairy tale from a catalog; it is a real, affordable possibility with offerings like this Olive+Owen bedroom set ... It includes an oversize comforter, a collection of decorative pillows and shams, and design touches like curtain valances, ties, and a bed skirt to hide all of your underbed storage. And the stately gray color scheme pretty much goes with anything ... ....
Nimrita Genomal, co-founder, Eazelly.com advices, “Playing with soft furnishings and linings is the simplest way to get the boho chic feel in a space — patchworked rugs, colourful cushion covers, an eye catching throw, bright curtains, cotton table cloths etc ... A simple window treatment can be given a boho look by using valances instead of curtains....
Palm Beach Daily News 21 Sep 2016
You remember seeing them, I bet. Do you also remember all that celery-green wall-to-wall carpet? Those rooms featured French-style wood furniture and upholstery in minty pale green, with draw curtains of a tinted green sheen ... Once you have found that cabbage print — or one with lettuce or leaves — purchase enough yardage to use for window curtains and valances. The valances can be lined in vivid carrot ... * ... ....
Here are easy no-sew curtains and window treatments made from repurposed materials. DIY remodeling for window treatments, no-sew curtains in rod pocket style from repurposed sheets ... So make no-sew curtains with top sheets ... Make no-sew curtains for window treatments by cutting small holes in the wider hem of the top sheet ... Got ugly cupboard doors? Remove them and doors from repurposed swag or valance curtains....

value: This website is a news aggregator founded in March 1995 and launched online in 1998. In 2003, Search Engine Watch praised the service for its "Special Reports", and called it "an interesting alternative" to other news aggregation services.