Essential-Web v1.0
Collection
10 items
β’
Updated
β’
6
Dataset Viewer
id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
1,020,817,250,056,350,600 | 4 TYPES OF VOR CHECKS
Your airplanes VOR received must be checked every 30 days for IFR Operations and there are multiple ways pilot's can check their VORs. How are they performed? What do you need to annotate?
Here's what you need to know.
VOR Checks:
VOR Receivers are required to be checked every 30 days for IFR Flight Operations. However, it is also important for VFR Pilotβs to check their aircraftβs VOR Receivers.
What to Write (SLED)
Signature (of pilot performing the check)
Location (of the check)
Error (amount of error detected during check)
Date (of the check)
VOT (VOR Test Facility)
A VOT is coded to emit the 360 Radial in all directions around the facility.
This means the airplaneβs VOR Receiver should read either: 360 FROM or 180 TO, regardless of the aircraftβs location in relation to the VOR.
How the check is done:
1. Tune and Identify the VOT.
2. Twist the OBS Knob to center the CDI Needle.
3. Check for proper TO/FROM Indication.
4. The radial selected must be within:
5. +/- 4 degrees of 360 or 180.
Ground Check
With a VOR Ground Check:
β’ The Pilot must park the airplane in the designated ground spot.
β’ The Pilot must tune and identify the correct VOR.
β’ The Pilot must use the ground check sign to know:
β’ Which radial he/she should be on.
β’ Whether he/she should have a TO or a FROM Indication.
How the check is done:
1. Park aircraft in designated check spot.
2. Tune and Identify the Correct VOR.
3. Twist the OBS Knob to center the CDI Needle.
4. Check for proper TO/FROM Indication.
5. The radial selected must be within:
6. +/- 4 degrees of Designated Radial.
Airborne Check
With an Airborne VOR check:
β’ The Pilot must position the airplane over the designated location.
β’ The Pilot must tune and identify the correct VOR.
β’ The Pilot must use the information in the Chart Supplement to know:
β’ Which radial he/she should be on.
β’ Whether he/she should have a TO or a FROM Indication.
How the check is done:
1. Position aircraft over designated check spot.
2. Tune and Identify the Correct VOR.
3. Twist the OBS Knob to center the CDI Needle.
4. Check for proper TO/FROM Indication.
5. The radial selected must be within:
6. +/- 6 degrees of Designated Radial.
Dual VOR Check
With a Dual VOR check, the airplane must be equipped with 2 VOR Receivers.
How the check is done:
1. The pilot tunes both VOR Receivers to the same VOR.
2. The pilot centers both CDI Needles.
3. Check for proper TO/FROM Indications.
4. With both CDI Needles Centered:
5. The Selected Radials should be within 4 degrees of each other.
VOR Check Summary:
β’ VOT = +/- 4
β’ Ground Check = +/- 4
β’ Airborne Check = +/- 6
β’ Dual Check = within 4 degrees of each other
Author - Nate Hodell
CFI/CFII/MEI/ATP - Creator of wifiCFI - Owner of Axiom Aviation Flight School.
This information is included in the Navigation Aids: VOR Lessons on wifiCFI. Sign up today to watch videos, listen to podcasts, take lesson quizzes, join live webinars, print lesson quicktakes, and more by clicking this link >
where aviation comes to study
worldwide site members: 27,532 | {
"url": "https://www.wificfi.com/post/4-types-of-vor-checks",
"source_domain": "www.wificfi.com",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "881246",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:X7YCEUHWCEREU3GPGTLTWYERMVJHMC6K",
"WARC-Concurrent-To": "<urn:uuid:1128cf77-7d87-4504-884c-1a5c89af11b8>",
"WARC-Date": "2021-04-20T20:18:45Z",
"WARC-IP-Address": "185.230.60.177",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PMA3V7BVZBUO7PN3EJTCFM33V72PBJXY",
"WARC-Record-ID": "<urn:uuid:6e89ce06-9ab4-48f9-ad85-15d70c3e3e40>",
"WARC-Target-URI": "https://www.wificfi.com/post/4-types-of-vor-checks",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d7221bdf-798b-40ad-8e86-386e500a5cb4>"
},
"warc_info": "isPartOf: CC-MAIN-2021-17\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-40.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
22,
23,
212,
213,
214,
244,
245,
257,
258,
427,
428,
449,
450,
492,
493,
517,
518,
564,
565,
585,
586,
610,
611,
688,
689,
830,
831,
854,
855,
887,
888,
938,
939,
981,
982,
1023,
1024,
1058,
1059,
1060,
1073,
1074,
1099,
1100,
1168,
1169,
1223,
1224,
1278,
1279,
1317,
1318,
1376,
1377,
1400,
1401,
1446,
1447,
1487,
1488,
1538,
1539,
1581,
1582,
1623,
1624,
1665,
1666,
1667,
1682,
1683,
1711,
1712,
1783,
1784,
1838,
1839,
1911,
1912,
1950,
1951,
2009,
2010,
2033,
2034,
2085,
2086,
2126,
2127,
2177,
2178,
2220,
2221,
2262,
2263,
2304,
2305,
2306,
2321,
2322,
2397,
2398,
2421,
2422,
2479,
2480,
2521,
2522,
2565,
2566,
2603,
2604,
2672,
2673,
2674,
2693,
2694,
2710,
2711,
2736,
2737,
2764,
2765,
2813,
2814,
2815,
2836,
2837,
2916,
2917,
2918,
3145,
3146,
3147,
3177,
3178
],
"line_end_idx": [
22,
23,
212,
213,
214,
244,
245,
257,
258,
427,
428,
449,
450,
492,
493,
517,
518,
564,
565,
585,
586,
610,
611,
688,
689,
830,
831,
854,
855,
887,
888,
938,
939,
981,
982,
1023,
1024,
1058,
1059,
1060,
1073,
1074,
1099,
1100,
1168,
1169,
1223,
1224,
1278,
1279,
1317,
1318,
1376,
1377,
1400,
1401,
1446,
1447,
1487,
1488,
1538,
1539,
1581,
1582,
1623,
1624,
1665,
1666,
1667,
1682,
1683,
1711,
1712,
1783,
1784,
1838,
1839,
1911,
1912,
1950,
1951,
2009,
2010,
2033,
2034,
2085,
2086,
2126,
2127,
2177,
2178,
2220,
2221,
2262,
2263,
2304,
2305,
2306,
2321,
2322,
2397,
2398,
2421,
2422,
2479,
2480,
2521,
2522,
2565,
2566,
2603,
2604,
2672,
2673,
2674,
2693,
2694,
2710,
2711,
2736,
2737,
2764,
2765,
2813,
2814,
2815,
2836,
2837,
2916,
2917,
2918,
3145,
3146,
3147,
3177,
3178,
3208
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3208,
"ccnet_original_nlines": 136,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28966522216796875,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08588063716888428,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2663755416870117,
"rps_doc_frac_unique_words": 0.3327171802520752,
"rps_doc_mean_word_length": 4.38817024230957,
"rps_doc_num_sentences": 60,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.627996444702148,
"rps_doc_word_count": 541,
"rps_doc_frac_chars_dupe_10grams": 0.25273799896240234,
"rps_doc_frac_chars_dupe_5grams": 0.3748946785926819,
"rps_doc_frac_chars_dupe_6grams": 0.3378264605998993,
"rps_doc_frac_chars_dupe_7grams": 0.28938499093055725,
"rps_doc_frac_chars_dupe_8grams": 0.2674810290336609,
"rps_doc_frac_chars_dupe_9grams": 0.2674810290336609,
"rps_doc_frac_chars_top_2gram": 0.02695872075855732,
"rps_doc_frac_chars_top_3gram": 0.02274641953408718,
"rps_doc_frac_chars_top_4gram": 0.032855939120054245,
"rps_doc_books_importance": -258.48724365234375,
"rps_doc_books_importance_length_correction": -258.48724365234375,
"rps_doc_openwebtext_importance": -213.08082580566406,
"rps_doc_openwebtext_importance_length_correction": -213.08082580566406,
"rps_doc_wikipedia_importance": -145.76365661621094,
"rps_doc_wikipedia_importance_length_correction": -145.76365661621094
},
"fasttext": {
"dclm": 0.21038347482681274,
"english": 0.8743082284927368,
"fineweb_edu_approx": 2.599010705947876,
"eai_general_math": 0.08103054761886597,
"eai_open_web_math": 0.29271847009658813,
"eai_web_code": 0.002431750064715743
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "629.1372",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": ""
}
},
"secondary": {
"code": "629.137",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 71f077df794da2774531b20248bb19b0 |
3,527,264,977,384,483,000 | How to Convert A Hexadecimal Number to Decimal in Excel
Sometimes we use hexadecimal numbers to mark products in daily life, and we want to convert these hexadecimal numbers to decimal numbers in some situations. We can convert number between two number types by convert tool online, actually we can also convert numbers by function in excel as well. In excel, =HEX2DEC(number) can help you to convert hexadecimal number to decimal properly, and on the other side, you can use =DEX2HEX(number) to convert decimal to hexadecimal number.
1. Convert Hex Number to Decimal in Excel
As we mentioned above, we can use HEX2DEC function to convert numbers conveniently. Just prepare a table with two columns, one column is used for recording HEX numbers, the second column is used for saving the converted decimal numbers.
Convert A Hexadecimal Number to Decimal 1
Step1: in B1 enter the formula:
=HEX2DEC(A2)
Convert A Hexadecimal Number to Decimal 2
Step2: Click Enter to get returned value. So 21163 in B2 is the mapping decimal number for 52AB.
Convert A Hexadecimal Number to Decimal 3
Step3: Drag the fill handle down to fill the following cells.
Convert A Hexadecimal Number to Decimal 4
Verify that all hexadecimal numbers are converted to decimal numbers correctly. You can also double check the result by convert tool online to make sure the result is correct.
Note:
Sometimes hexadecimal numbers are displayed like 0x52AB, user can remove 0x before 52AB and then use HEX2DEC function to convert number.
2. Convert Decimal to Hex Number in Excel
Prepare another table, the first column is Decimal, the second column is Hex Number.
Convert A Hexadecimal Number to Decimal 5
Step1: in B10 enter the formula:
=HEX2DEC(A2)
Convert A Hexadecimal Number to Decimal 6
Step2: Click Enter to get returned value. So 4D2 in B10 is the mapping hex number for 1234.
Convert A Hexadecimal Number to Decimal 7
Step3: Drag the fill handle down to fill the following cells.
Convert A Hexadecimal Number to Decimal 8
Note:
There are some other functions to convert numbers between different types. See below screenshot.
Convert A Hexadecimal Number to Decimal 9
Convert A Hexadecimal Number to Decimal 10
Convert A Hexadecimal Number to Decimal 11
3. Video: Converting Hex Numbers to Decimal and Decimal to Hex
In this video, weβll explore two essential skills: converting Hexadecimal numbers to Decimal and Decimal numbers to Hex in Excel.
4. SAMPLE FIlES
Below are sample files in Microsoft Excel that you can download for reference if you wish. | {
"url": "https://www.excelhow.net/how-to-convert-a-hexadecimal-number-to-decimal-in-excel.html",
"source_domain": "www.excelhow.net",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "90175",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LO2RBF7KKBVVTCT3L5WUO3TYPUZBN3QP",
"WARC-Concurrent-To": "<urn:uuid:57e22687-e72d-4bbc-9b2f-cdd353523407>",
"WARC-Date": "2024-07-21T09:20:01Z",
"WARC-IP-Address": "54.85.8.229",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JLF6M2XDYBNVI6OGFJPLR7WZY4CFAKVM",
"WARC-Record-ID": "<urn:uuid:a1f6b1a9-a103-44bb-97a2-d4a83bf2c1fc>",
"WARC-Target-URI": "https://www.excelhow.net/how-to-convert-a-hexadecimal-number-to-decimal-in-excel.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:10ce5d5f-8c15-4ca3-9a24-342e0e06bb74>"
},
"warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-131\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
56,
57,
537,
538,
580,
581,
818,
819,
861,
862,
894,
895,
908,
950,
951,
1048,
1049,
1091,
1092,
1154,
1155,
1197,
1198,
1374,
1375,
1381,
1382,
1519,
1520,
1562,
1563,
1648,
1649,
1691,
1692,
1725,
1726,
1740,
1782,
1783,
1875,
1876,
1918,
1919,
1981,
1982,
2024,
2025,
2031,
2032,
2129,
2130,
2172,
2215,
2258,
2259,
2322,
2323,
2453,
2454,
2470,
2471
],
"line_end_idx": [
56,
57,
537,
538,
580,
581,
818,
819,
861,
862,
894,
895,
908,
950,
951,
1048,
1049,
1091,
1092,
1154,
1155,
1197,
1198,
1374,
1375,
1381,
1382,
1519,
1520,
1562,
1563,
1648,
1649,
1691,
1692,
1725,
1726,
1740,
1782,
1783,
1875,
1876,
1918,
1919,
1981,
1982,
2024,
2025,
2031,
2032,
2129,
2130,
2172,
2215,
2258,
2259,
2322,
2323,
2453,
2454,
2470,
2471,
2561
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2561,
"ccnet_original_nlines": 62,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32098764181137085,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05967077985405922,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15843620896339417,
"rps_doc_frac_unique_words": 0.3325415551662445,
"rps_doc_mean_word_length": 4.874109268188477,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.264982223510742,
"rps_doc_word_count": 421,
"rps_doc_frac_chars_dupe_10grams": 0.13742689788341522,
"rps_doc_frac_chars_dupe_5grams": 0.3698830306529999,
"rps_doc_frac_chars_dupe_6grams": 0.3040935695171356,
"rps_doc_frac_chars_dupe_7grams": 0.17153996229171753,
"rps_doc_frac_chars_dupe_8grams": 0.17153996229171753,
"rps_doc_frac_chars_dupe_9grams": 0.13742689788341522,
"rps_doc_frac_chars_top_2gram": 0.07894737273454666,
"rps_doc_frac_chars_top_3gram": 0.10233917832374573,
"rps_doc_frac_chars_top_4gram": 0.16471734642982483,
"rps_doc_books_importance": -242.1373291015625,
"rps_doc_books_importance_length_correction": -242.1373291015625,
"rps_doc_openwebtext_importance": -146.94801330566406,
"rps_doc_openwebtext_importance_length_correction": -146.94801330566406,
"rps_doc_wikipedia_importance": -102.18488311767578,
"rps_doc_wikipedia_importance_length_correction": -102.18488311767578
},
"fasttext": {
"dclm": 0.7406157851219177,
"english": 0.7236505150794983,
"fineweb_edu_approx": 2.966196298599243,
"eai_general_math": 0.6738846898078918,
"eai_open_web_math": 0.25127464532852173,
"eai_web_code": 0.17411237955093384
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "512.7",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 71f077df794da2774531b20248bb19b0 |
-7,833,709,416,494,027,000 | skip to Main Content
What is In Vitro Fertilization?
An Overview of IVF
In Vitro fertilization (IVF)Β has become the most popular choice of treatment for couples with various types of infertility. It is generally accepted as the most successful and fastest method available to achieve pregnancy. While it was initially reserved for patients with blocked, damaged, or absent fallopian tubes (tubal factor infertility), IVF is now also used to overcome infertility caused by endometriosis, male factor (sperm) issues, diminished egg quality, ovulatory problems, or other unexplained reasons.
IVFΒ is an advanced method of assisted reproduction in which the manβs sperm and the womanβs eggs are combined in a laboratory where fertilization occurs, and the resultant embryos are then transferred to the womanβs uterus (embryo transfer) in hopes of achieving a pregnancy. Initially, the patient undergoes ovulation enhancement (superovulation) with a combination of injectable fertility medications that results in the development of multiple eggs in both ovaries. When the eggs have sufficiently matured, the transvaginal ultrasound-guided egg retrieval procedure is then performed in the office, with an anesthesiologist present to provide complete pain relief. The patient is discharged home soon after the procedure.
On the day the eggs are harvested, the partner provides a semen specimen from which the sperm are isolated in the laboratory, and used to fertilize the eggs. If a significant male factor is present, such as low sperm concentrations, or a diminished percentage of normal appearing sperm (morphology) or normally motile sperm (motility), intracytoplasmic sperm injection (ICSI) is an extremely useful modality that is employed to maximize the chances for fertilization.
ICSI
Intracytoplasmic Sperm Injection (ICSI βΒ pronounced βick-seeβ)Β is a technique of gamete (sperm/egg) micro-manipulation, or assisted fertilization, in which individual sperm are captured in a microscopic glass pipette and meticulously injected directly into the individual eggs. The resultant fertilized eggs (early embryos) are then allowed to grow and mature in the sterile laboratory conditions in a manner similar to that of standard IVF. In cases where there is a complete absence of sperm in the ejaculate, such as in gentlemen who have previously undergone a vasectomy, microsurgical epididymal sperm aspiration (MESA) or testicular sperm extraction (TESE) is performed by a specialized urologist here in our office for retrieval of the sperm, and ICSI is then carried out.
Embryo Transfer
An appropriate number of fertilized eggs (pre-embryos) are returned into the patientβs uterus three days later following the egg retrieval viaΒ Day 3 embryo transfer, or in select cases, the embryos are cultured for an additional 2-3 days and aΒ blastocyst transferΒ is performed. We are extremely careful to limit the number of embryos transferred so as to help avoid a high order multiple pregnancy (3 or more fetuses) from occurring.
To learn more, pleaseΒ contact us onlineΒ or by phone at 732-339-9300, or please continue reading on ourΒ Frequently Asked Questions page.
Back To Top | {
"url": "http://infertilitydocs.com/overview-of-ivf/",
"source_domain": "infertilitydocs.com",
"snapshot_id": "crawl=CC-MAIN-2017-39",
"warc_metadata": {
"Content-Length": "48127",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EE4LBZBACQWZJ2IQL6EBDRA6WSXVVRNT",
"WARC-Concurrent-To": "<urn:uuid:557e1430-4272-4565-a7ef-75040d3da955>",
"WARC-Date": "2017-09-25T13:23:40Z",
"WARC-IP-Address": "64.64.8.22",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:A4YX2V3JDMRXVDWG75TZZTO66ECFYVQ3",
"WARC-Record-ID": "<urn:uuid:db67ef09-cc41-4a12-9566-078cb004f408>",
"WARC-Target-URI": "http://infertilitydocs.com/overview-of-ivf/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:55e415fe-ad4e-4003-ad52-d955010a82b7>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-159-149-228.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-39\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for September 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
21,
22,
54,
55,
74,
75,
592,
593,
1318,
1319,
1787,
1788,
1793,
1794,
2574,
2575,
2591,
2592,
3026,
3027,
3163,
3164
],
"line_end_idx": [
21,
22,
54,
55,
74,
75,
592,
593,
1318,
1319,
1787,
1788,
1793,
1794,
2574,
2575,
2591,
2592,
3026,
3027,
3163,
3164,
3175
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3175,
"ccnet_original_nlines": 22,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3582608699798584,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01913042925298214,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.156521737575531,
"rps_doc_frac_unique_words": 0.5135135054588318,
"rps_doc_mean_word_length": 5.41580057144165,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.010844707489014,
"rps_doc_word_count": 481,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.009596929885447025,
"rps_doc_frac_chars_top_3gram": 0.01535508967936039,
"rps_doc_frac_chars_top_4gram": 0.02610364928841591,
"rps_doc_books_importance": -176.73353576660156,
"rps_doc_books_importance_length_correction": -176.73353576660156,
"rps_doc_openwebtext_importance": -124.57745361328125,
"rps_doc_openwebtext_importance_length_correction": -124.57745361328125,
"rps_doc_wikipedia_importance": -89.30268859863281,
"rps_doc_wikipedia_importance_length_correction": -89.30268859863281
},
"fasttext": {
"dclm": 0.07196903228759766,
"english": 0.9265336990356445,
"fineweb_edu_approx": 2.5333333015441895,
"eai_general_math": 0.09520775079727173,
"eai_open_web_math": 0.22034436464309692,
"eai_web_code": 0.004884839989244938
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "618.122",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Women β Health and hygiene, Children β Health and hygiene, Gynecology, and Pediatrics"
}
},
"secondary": {
"code": "618.12",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Women β Health and hygiene, Children β Health and hygiene, Gynecology, and Pediatrics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 71f077df794da2774531b20248bb19b0 |
5,951,628,676,535,350,000 | Server dies every night at 4:00
Discussion in 'General' started by smartcall, Mar 11, 2007.
1. smartcall
smartcall ISPConfig Developer ISPConfig Developer
Hi,
I have this bug issue for already two nights. It started at 4:00 am on Saturday and again repeated at 4:00 am on Sunday - today.
I have FC6 with ISPConfig 2.2.9. I haven't made any changes to the system for months. And it is a production one with many sites.
The server dies completely. Only a hardware reboot fixes the problem. I can't identify what causes it.
It must be connected to the scripts that start to run at 4:00 am, but I don't know where to look. All common log files don't show anything.
I also monitor the server with snmpd and the graphs are normal. Nothing special. Just after 4:00 am there is no more data for the graphs, because the server is dead.
Please HELP. I need to resolve this before 4:00 am tomorrow.
Β
2. djtremors
djtremors ISPConfig Developer ISPConfig Developer
I'm using fedora 5 and 6 too. I have no issues though cron wise.
cron.daily runs at 4am and so does webalizer for ispconfig.
PHP:
#Β cdΒ /etc/cron.daily
#Β lsΒ -l
-rwxr-xr-xΒ 1Β rootΒ rootΒ Β 577Β FebΒ 27Β 00:40Β 000-delay.cron
-rwxr-xr-xΒ 1Β rootΒ rootΒ Β 379Β OctΒ 30Β 18:37Β 0anacron
-rwxr-xr-xΒ 1Β rootΒ rootΒ 2936Β NovΒ 29Β 00:16Β beagle-crawl-system
-rwxr-xr-xΒ 1Β rootΒ rootΒ Β 118Β JanΒ 25Β 01:06Β cups
-rwxr-xr-xΒ 1Β rootΒ rootΒ Β 180Β FebΒ Β 9Β 01:45Β logrotate
-rwxr-xr-xΒ 1Β rootΒ rootΒ Β 418Β JanΒ Β 9Β 20:56Β makewhatis.cron
-rwxr-xr-xΒ 1Β rootΒ rootΒ Β 137Β NovΒ 26Β 23:04Β mlocate.cron
-rwxr-xr-xΒ 1Β rootΒ rootΒ 2181Β JunΒ 21Β Β 2006Β prelink
-rwxr-xr-xΒ 1Β rootΒ rootΒ Β 114Β SepΒ Β 7Β Β 2006Β rpm
-rwxr-xr-xΒ 1Β rootΒ rootΒ Β 290Β JulΒ 13Β Β 2006Β tmpwatch
PHP:
#Β crontabΒ -e
0Β 4Β *Β *Β *Β /root/ispconfig/php/phpΒ /root/ispconfig/scripts/shell/webalizer.phpΒ &>Β /dev/null
You can try remarking or moving these out and see which is causing it.
My guess is to check /var/log/cron and see what was the last message before the crash/hang.
Also, was the console sitting at a login or was there any kernel messages?
Β
3. martinfst
martinfst ISPConfig Developer ISPConfig Developer
As you say: at 4.00 couple of scripts are started. Could it be a hardware memory problem? Or are you running out of memory in general (swap full)
Code:
vmstat -s
might be useful. For real hardware problem, you will have to run vendor specific memory tests; often you need to boot from a diagnostics CD.
Β
4. till
till Super Moderator Staff Member ISPConfig Developer
If you dont find anything in the logs then its most likely hardware related. At 4 AM run serveral cronjobs which may cause a higher load on your server, if there is e.g. some bad RAM or power supply, the server might die.
Β
5. smartcall
smartcall ISPConfig Developer ISPConfig Developer
This is the last I see in /var/log/cron.1
Code:
Mar 11 04:00:01 ns1 crond[21239]: (root) CMD (/usr/bin/rdate -s ntp3.fau.de)
Mar 11 04:00:01 ns1 crond[21240]: (root) CMD (/root/ispconfig/php/php /root/ispconfig/scripts/shell/check_services.php &> /dev
/null)
Mar 11 04:00:01 ns1 crond[21241]: (root) CMD (/root/ispconfig/php/php /root/ispconfig/scripts/shell/webalizer.php &> /dev/null)
And I have Intel Dual Core CPU.
All the scripts besides webalizer one re-run after I boot the server and nothing happends.
Could that be the webalizer script?
Thanks
Β
6. dlpc
dlpc New Member
Could be a heat problem, have a look at the cpu-cooler.
Had the same problem here, cron start >> server shut down no entry in any log.
Cpu cooler not running :(
Β
7. smartcall
smartcall ISPConfig Developer ISPConfig Developer
Cooler is working. I'm currently running the wealizer script manually to see what's happenrng. It's taking a long time to finish as I have more than 300 sites. But I don't see any significant load on the CPU.
Β
8. martinfst
martinfst ISPConfig Developer ISPConfig Developer
Any read/write error for your disks? If it runs long, something is the bottleneck. That's either CPU, Disk or Memory. find out what's (over-)used and you probably have an indication where to look for a possible hardware problem.
Β
9. smartcall
smartcall ISPConfig Developer ISPConfig Developer
Webalizer still runs for already an hour. Memory, CPU and disks are OK. The reason for such long operation is extreemly big web.log files. I have sites in my server that have over 150MB web.log files. But I monitor it now, while webalizer script runs and I don't see anything strange.
Code:
top - 15:48:13 up 5:48, 2 users, load average: 0.15, 0.51, 0.65
Tasks: 151 total, 1 running, 150 sleeping, 0 stopped, 0 zombie
Cpu(s): 2.9%us, 0.8%sy, 0.0%ni, 92.2%id, 3.9%wa, 0.0%hi, 0.2%si, 0.0%st
Mem: 2074448k total, 1992100k used, 82348k free, 194392k buffers
Swap: 2939868k total, 0k used, 2939868k free, 1500392k cached
I may move the cron.daily to run later in the morning, so I could be there and look at the console output. Because now the screensaver prevents me from seing the output.
Β
10. martinfst
martinfst ISPConfig Developer ISPConfig Developer
It's waiting on data to be retrieved from disk. I'd suspect disk problems. On my system 200Mb log files are processed within 10 minutes on a 2.8M dual core.
Β
11. smartcall
smartcall ISPConfig Developer ISPConfig Developer
It finished and all is OK. But if you advise to check the disks, how could I do this?
Β
12. martinfst
martinfst ISPConfig Developer ISPConfig Developer
I can only think of (non-destructive) vendor diagnostics. And of course watch the log files for read/write errors. Do you have hardware RAID? Maybe the raid controller can provide more info, but that's also (raid-controller) vendor specific. Most of these require you to take your server offline for some period of time, and it's not sure errors will be detected. You've probably done so already, but making backups may save your a... sometime in the future.
Problem is, these type of errors occur "randomly" and are most of the times not reproducable under controlled testing. :(
Β
13. smartcall
smartcall ISPConfig Developer ISPConfig Developer
I use RAID and mdadm. I believe mdadm would mail me if there were any errors.
I don't think it's HDD error. I will move cron.daily to execute at 11:00 am and will watch closely what is happening.
I can't think of anything else.
Thanks.
Β
14. martinfst
martinfst ISPConfig Developer ISPConfig Developer
Oke, that's software RAID. Yes, mdadm will report problems, but normally not through email. Check /var/log/messages and/or /var/log/syslog and or /var/log/kern.log. I'm not familiar with FC6, so maybe they even use different logfiles.
Β
15. smartcall
smartcall ISPConfig Developer ISPConfig Developer
It happend again. Nothing in logs. Last from cron.log is webaliser and hourly parts. But when I run webalizer script from command line nothing bad happends.
How can I edit the webaliser cronjob? I don't see it in crontab.
Thanks.
Β
16. martinfst
martinfst ISPConfig Developer ISPConfig Developer
As 'root', use
Code:
crontab -e
Β
17. smartcall
smartcall ISPConfig Developer ISPConfig Developer
Thanks.
I'll edit it to run at 11am and see what's happening. If it dies then this is it.
But I still can't believe, because when I run it manualy nothing goes wrong.
Β
18. smartcall
smartcall ISPConfig Developer ISPConfig Developer
All cronjobs finished after I moved them to new time of execution. All is OK.
No issues. STRANGE:confused:
I am currently running mprime torture test. Again all is OK.
I remembered this extremely strange thing: I had a problem with one of my other servers. It was running Debian and every morning at 4 the internet connection to it used to go down. I noticed that it started since I put a mobile phone next to it. I removed the phone and the issue was gone.
So now this same phone was near the other server. I removed it again and hopefully the problem will stop happening.
I will report. But don't put mobile phones near servers.;)
Β
19. smartcall
smartcall ISPConfig Developer ISPConfig Developer
I tested the CPU at full load of both cores for hours. This test also utilizes the memory. NO errors.
So the only thing that could be causing this is the cell phone.
Β
20. djtremors
djtremors ISPConfig Developer ISPConfig Developer
phone or no phone, bit strange that it's happening at 4am unless you're calling your servers for a 'booty call' at 4am ;) SO DON'T CALL THEM AT 4AM :p
very strange.
Β
Share This Page | {
"url": "https://www.howtoforge.com/community/threads/server-dies-every-night-at-4-00.11295/",
"source_domain": "www.howtoforge.com",
"snapshot_id": "crawl=CC-MAIN-2017-09",
"warc_metadata": {
"Content-Length": "76399",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YOYAVC2ELLN3D6NG5VUMBVA3LL73A3CQ",
"WARC-Concurrent-To": "<urn:uuid:306abb41-9cc9-43a8-aa94-63318f8f7681>",
"WARC-Date": "2017-02-21T18:24:49Z",
"WARC-IP-Address": "104.24.0.68",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:QU6QA4IZWP5HF6BV57LKQFUG34PDMUJE",
"WARC-Record-ID": "<urn:uuid:bbdfdafa-94ce-4587-a7ee-2972835391d6>",
"WARC-Target-URI": "https://www.howtoforge.com/community/threads/server-dies-every-night-at-4-00.11295/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6941a611-e960-448d-99bf-9c3ab5350ce6>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-10-108.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-09\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
32,
33,
93,
94,
109,
110,
164,
165,
173,
174,
307,
441,
548,
692,
862,
863,
928,
934,
949,
950,
1004,
1005,
1074,
1075,
1139,
1148,
1173,
1185,
1245,
1299,
1364,
1414,
1469,
1530,
1588,
1641,
1690,
1744,
1753,
1770,
1865,
1940,
2036,
2115,
2121,
2136,
2137,
2191,
2192,
2342,
2352,
2366,
2511,
2517,
2527,
2528,
2586,
2587,
2813,
2819,
2834,
2835,
2889,
2890,
2936,
2937,
2947,
3028,
3159,
3170,
3302,
3338,
3433,
3473,
3474,
3485,
3491,
3501,
3502,
3522,
3523,
3583,
3666,
3696,
3702,
3717,
3718,
3772,
3773,
3986,
3992,
4007,
4008,
4062,
4063,
4296,
4302,
4317,
4318,
4372,
4373,
4662,
4663,
4673,
4744,
4817,
4900,
4977,
5053,
5058,
5063,
5237,
5243,
5259,
5260,
5314,
5315,
5476,
5482,
5498,
5499,
5553,
5554,
5644,
5650,
5666,
5667,
5721,
5722,
6185,
6186,
6312,
6318,
6334,
6335,
6389,
6390,
6472,
6594,
6630,
6631,
6643,
6649,
6665,
6666,
6720,
6721,
6960,
6966,
6982,
6983,
7037,
7038,
7199,
7268,
7269,
7281,
7287,
7303,
7304,
7358,
7359,
7378,
7388,
7403,
7409,
7425,
7426,
7480,
7481,
7493,
7579,
7660,
7666,
7682,
7683,
7737,
7738,
7820,
7853,
7918,
7919,
8213,
8333,
8396,
8402,
8418,
8419,
8473,
8474,
8580,
8648,
8654,
8670,
8671,
8725,
8726,
8881,
8882,
8900,
8906,
8907
],
"line_end_idx": [
32,
33,
93,
94,
109,
110,
164,
165,
173,
174,
307,
441,
548,
692,
862,
863,
928,
934,
949,
950,
1004,
1005,
1074,
1075,
1139,
1148,
1173,
1185,
1245,
1299,
1364,
1414,
1469,
1530,
1588,
1641,
1690,
1744,
1753,
1770,
1865,
1940,
2036,
2115,
2121,
2136,
2137,
2191,
2192,
2342,
2352,
2366,
2511,
2517,
2527,
2528,
2586,
2587,
2813,
2819,
2834,
2835,
2889,
2890,
2936,
2937,
2947,
3028,
3159,
3170,
3302,
3338,
3433,
3473,
3474,
3485,
3491,
3501,
3502,
3522,
3523,
3583,
3666,
3696,
3702,
3717,
3718,
3772,
3773,
3986,
3992,
4007,
4008,
4062,
4063,
4296,
4302,
4317,
4318,
4372,
4373,
4662,
4663,
4673,
4744,
4817,
4900,
4977,
5053,
5058,
5063,
5237,
5243,
5259,
5260,
5314,
5315,
5476,
5482,
5498,
5499,
5553,
5554,
5644,
5650,
5666,
5667,
5721,
5722,
6185,
6186,
6312,
6318,
6334,
6335,
6389,
6390,
6472,
6594,
6630,
6631,
6643,
6649,
6665,
6666,
6720,
6721,
6960,
6966,
6982,
6983,
7037,
7038,
7199,
7268,
7269,
7281,
7287,
7303,
7304,
7358,
7359,
7378,
7388,
7403,
7409,
7425,
7426,
7480,
7481,
7493,
7579,
7660,
7666,
7682,
7683,
7737,
7738,
7820,
7853,
7918,
7919,
8213,
8333,
8396,
8402,
8418,
8419,
8473,
8474,
8580,
8648,
8654,
8670,
8671,
8725,
8726,
8881,
8882,
8900,
8906,
8907,
8922
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 8922,
"ccnet_original_nlines": 202,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2833675742149353,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.041067760437726974,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2941478490829468,
"rps_doc_frac_unique_words": 0.38154980540275574,
"rps_doc_mean_word_length": 4.7365312576293945,
"rps_doc_num_sentences": 155,
"rps_doc_symbol_to_word_ratio": 0.002053390024229884,
"rps_doc_unigram_entropy": 5.627297878265381,
"rps_doc_word_count": 1355,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.15316298604011536,
"rps_doc_frac_chars_dupe_6grams": 0.1530071645975113,
"rps_doc_frac_chars_dupe_7grams": 0.052041128277778625,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.1037706509232521,
"rps_doc_frac_chars_top_3gram": 0.0757245197892189,
"rps_doc_frac_chars_top_4gram": 0.10096602886915207,
"rps_doc_books_importance": -808.23583984375,
"rps_doc_books_importance_length_correction": -808.23583984375,
"rps_doc_openwebtext_importance": -385.242431640625,
"rps_doc_openwebtext_importance_length_correction": -385.242431640625,
"rps_doc_wikipedia_importance": -284.8584899902344,
"rps_doc_wikipedia_importance_length_correction": -284.8584899902344
},
"fasttext": {
"dclm": 0.03298794850707054,
"english": 0.8222026228904724,
"fineweb_edu_approx": 1.1615674495697021,
"eai_general_math": 0.13421636819839478,
"eai_open_web_math": 0.33158451318740845,
"eai_web_code": 0.146528422832489
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.17",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "5",
"label": "Evaluate"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 71f077df794da2774531b20248bb19b0 |
-6,424,293,758,248,281,000 | Genesis, 1-3
Genesis, 1-3
Without blaming serpent, Eve or Adam, what do you think is the crime which gets Adam and Eve thrown out of the garden? To say it another way, what is this knowledge which God wants to keep human beings from having?
Eusa Story (Blackboard)
What is Eusaβs crime?
In what way does his story retell the shut-down of the Garden of Eden?
Galileo (Blackboard and Copernicus film: https://www.youtube.com/watch?v=zHUWP9zu4W8)
On the night of January 7, 1610, Galileo has a new βsuperlative instrument.β He writes, βWhen I inspected the celestial constellations through a spyglass, Jupiter presented himself.β
p. 64βWhat does Galileo see when he looks up at Jupiter?
p. 65βWhy does he decide, on January 8, to look at Jupiter again?
p. 65βWhat does he see, on that second night (January 8) when he looks at Jupiter again?
pp. 65-85βBetween January 8 and March 1, 1610, what does Galileo do every night that the weather is clear?
p. 85βWhat does Galileo know for certain by March 1, 1610?
(film) Briefly describe Galileoβs scientific achievement
(film) Briefly describe Galileoβs trial for heresy
(film) Briefly describe the advance of science since Galileoβs day
GALILEOβS OBSERVATIONS OF THE MOON
1β1610: What was happening in your home country at this time?
2βIs Galileo the 1st to create a telescope?
3βWith his own self-made telescope, how close is he able to make the moon appear?
4βHow far is the moon, actually, from the Earth? How many βterrestrial diameters?β
5βOn the 4th or 5th day after βconjunction,β the moon appears to have horns. Explain. See page 40.
6βOn Earth, when the sun rises and its light catches the peak of a mountain, what light reaches the valleys on either side of the mountain?
7βHow well-lit are the valleys when the sun rises high in the sky?
8βIf the surface of the moon is covered with mountains, why does the moon appear to be almost perfectly round? See page 49.
9βGalileo believes that the moon, like the Earth, has an atmosphere. Is he right? See pages 50β51.
10βEven when the moon is dark, it isnβt perfectly dark. Itβs as if some faint light is shining on it. Where does this light come from? See pages 53β56.
11βBased on your general knowledge, in what way or ways can you imagine that Galileoβs observations may get him in trouble with the Catholic Church?
The 6th Extinction ppt slides
#6 Describe the trajectory of human population from 4000 BC to 2100 AD (projected)
#9 How does Darwin explain extinction?
#15 How does E. O. Wilson explain extinction?
#19-20 How long have there been human beings? How long have there been ginkgo trees?
#21 What is the relationship between megafauna extinctions around the world and the spread of human beings?
#28 Karl Marx almost seems to admire the βsubjection of Natureβs forces to manβ which has happened during the brief βruleβ of the bourgeoisie. Explain.
The 6th Extinction (text)
Chapter 1βWhy are the golden frogs dying? What change in the world is causing the frogs to die?
Chapter 2βpp. 27-28 What does Jefferson write about βthe economy of nature,β and what does he expect Lewis & Clark to find on their expedition to the West?
p. 29 How does Cuvier arrive at the conclusion that the bones of a mastodon belong to an βespece perdue (lost species)?β
p. 44 βThe thread of operations is broken,β Cuvier writes. Explain.
Chapter 3 pp. 48-52 Lyell, like Darwin, is a βuniformitarian.β Explain.
p. 69 How does Darwin explain extinction?
Chapter 4 pp 74-78 in 1977, Walter Avarez sends soil samples to a colleague, Frank Asaro. In 1980, Walter Alvarez and his father, Luis Alvarez, publish a paper, βExtraterrestrial Cause for the Cretaceous-Tertiary Extinction.β What is their theory? What is their evidence ?
p. 91 Paul Taylor says about the death of the ammonites that, in certain moments, βthe rules of the survival gameβ abruptly change. How is this a restatement of Cuvierβs idea that βthe thread of operations is broken?β How does this theory put a major dent in Darwinβs theory of how extinctions take place?
Chapter 5 pp. 107-108 Paul Crutzen argues that the Earth is now in a new phase of extinction which he calls the Anthropocene. Name 5 geologic-scale processes which people are now causing.
Chapter 6 p. 113 How much CO2 will there be in the air by 2050? What global warming effects can be expected?
pp. 113-114 How much of this CO2 finds its way into the worldβs oceans? How much more acidic will the oceans be than they were at the start of the Industrial Revolution?
pp. 116-117 How do the underwater CO2 vents along the sides of the Italian island, Castello Aragonese, offer scientists an βunderwater time machine?β
pp. 121-124 How does ocean acidification increase βthe cost of calcification?β
Chapter 7 pp. 128-130 How do coral reefs get built? How do they change the world?
pp. 136-137 With ocean acidification, what will happen to the worldβs coral reefs? What will happen to their βtenants?β
Chapter 8 pp. 151-153 Imagine walking from the North Pole to the equator. To what degree are there more species in the tropics than anywhere else? Describe 3 theories to explain this difference.
p. 161 According to Darwin, how do species respond to temperature change?
p. 167 Describe 2 different predictions for the % of species loss by 2050, based on temperature change alone.
Chapter 9 p. 176 How much ice-free βwildlandsβ exist today?
p. 177 what is a βfishboneβ pattern of deforestation?
p. 186 As a result of tropical deforestation, how many insect species are being lost every year?
p. 189 Describe the βdark synergyβ between fragmentation and global warming.
Chapter 10 p. 197 What is meant by word, βPangaea?β
pp. 204-205 just as golden frogs and other amphibians are being wiped out by chytrid fungus, little brown bats are being wiped out by white nose syndrome. How are human beings to blame?
pp. 205-208 What is an βintroduced species?β How can it be argued that human beings are causing a βNew Pangaea?β
Chapter 11 p. 221 Human beings βhave brought (the Sumatran rhinoceros) so low that it seems only heroic human efforts can save it.β Explain.
p. 226 βWhat happened to all these Brobdingnagian animals? Cuvier, who was the first to note their disappearance, believed they had been done in by the most recent catastrophe: βa revolution on the surface of the earthβ that took place just before the start of recorded history.β Explain.
p. 234 It appears that the Anthropocene era does not begin with the Industrial Revolution, but with the dispersal of human beings around the earth. Comment.
Chapter 12 pp.246-247 Neanderthals are gone, but something like 4% of our genes today are, in fact, Neanderthal genes. Explain.
p. 249 Human children do not seem to be brighter than ape children except in one regard. What is it?
Chapter 13 p. 260 What is the Frozen Zoo?
Order a unique copy of this paper
(550 words)
Approximate price: $22
Basic features
β’ Free title page and bibliography
β’ Unlimited revisions
β’ Plagiarism-free guarantee
β’ Money-back guarantee
β’ 24/7 support
On-demand options
β’ Writerβs samples
β’ Part-by-part delivery
β’ Overnight delivery
β’ Copies of used sources
β’ Expert Proofreading
Paper format
β’ 275 words per page
β’ 12 pt Arial/Times New Roman
β’ Double line spacing
β’ Any citation style (APA, MLA, Chicago/Turabian, Harvard)
Our guarantees
Delivering a high-quality product at a reasonable price is not enough anymore.
Thatβs why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.
Money-back guarantee
You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.
Read more
Zero-plagiarism guarantee
Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.
Read more
Free-revision policy
Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.
Read more
Privacy policy
Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.
Read more
Fair-cooperation guarantee
By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.
Read more
Calculate the price of your order
550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
$26
The price is based on these factors:
Academic level
Number of pages
Urgency | {
"url": "https://essaymine.com/genesis-1-3/",
"source_domain": "essaymine.com",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "42081",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WWOWKSE6CGJTPBAZPJHWBPRUELZQBLLJ",
"WARC-Concurrent-To": "<urn:uuid:e18a166d-e448-4129-a4b6-0ae3c56a9a48>",
"WARC-Date": "2021-08-03T07:01:57Z",
"WARC-IP-Address": "192.64.117.85",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:H2S3BYBNAF6O3YV7WWX4BCH2YET7YIF6",
"WARC-Record-ID": "<urn:uuid:77c7bb7c-7061-4e15-8ec0-247739776744>",
"WARC-Target-URI": "https://essaymine.com/genesis-1-3/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4824a382-05b6-43ff-8c56-17e0aaccadda>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-169.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
13,
14,
27,
28,
243,
244,
268,
269,
291,
292,
363,
364,
450,
451,
634,
635,
692,
693,
759,
760,
849,
850,
957,
958,
1017,
1018,
1075,
1076,
1127,
1128,
1195,
1196,
1231,
1232,
1294,
1295,
1339,
1340,
1422,
1423,
1506,
1507,
1606,
1607,
1747,
1748,
1815,
1816,
1940,
1941,
2040,
2041,
2193,
2194,
2343,
2344,
2374,
2375,
2458,
2459,
2498,
2499,
2545,
2546,
2631,
2632,
2740,
2741,
2893,
2894,
2920,
2921,
3017,
3018,
3174,
3175,
3296,
3297,
3365,
3366,
3438,
3439,
3481,
3482,
3755,
3756,
4062,
4063,
4251,
4252,
4361,
4362,
4532,
4533,
4683,
4684,
4763,
4764,
4846,
4847,
4967,
4968,
5163,
5164,
5238,
5239,
5349,
5350,
5410,
5411,
5465,
5466,
5563,
5564,
5641,
5642,
5694,
5695,
5881,
5882,
5995,
5996,
6137,
6138,
6427,
6428,
6585,
6586,
6714,
6715,
6816,
6817,
6859,
6860,
6894,
6906,
6907,
6930,
6931,
6946,
6983,
7007,
7037,
7062,
7079,
7097,
7118,
7144,
7167,
7194,
7218,
7231,
7254,
7286,
7310,
7371,
7372,
7387,
7388,
7467,
7595,
7596,
7617,
7618,
7789,
7790,
7800,
7801,
7827,
7828,
8005,
8006,
8016,
8017,
8038,
8039,
8187,
8188,
8198,
8199,
8214,
8215,
8371,
8372,
8382,
8383,
8410,
8411,
8570,
8571,
8581,
8582,
8616,
8617,
8627,
8705,
8718,
8722,
8759,
8774,
8790
],
"line_end_idx": [
13,
14,
27,
28,
243,
244,
268,
269,
291,
292,
363,
364,
450,
451,
634,
635,
692,
693,
759,
760,
849,
850,
957,
958,
1017,
1018,
1075,
1076,
1127,
1128,
1195,
1196,
1231,
1232,
1294,
1295,
1339,
1340,
1422,
1423,
1506,
1507,
1606,
1607,
1747,
1748,
1815,
1816,
1940,
1941,
2040,
2041,
2193,
2194,
2343,
2344,
2374,
2375,
2458,
2459,
2498,
2499,
2545,
2546,
2631,
2632,
2740,
2741,
2893,
2894,
2920,
2921,
3017,
3018,
3174,
3175,
3296,
3297,
3365,
3366,
3438,
3439,
3481,
3482,
3755,
3756,
4062,
4063,
4251,
4252,
4361,
4362,
4532,
4533,
4683,
4684,
4763,
4764,
4846,
4847,
4967,
4968,
5163,
5164,
5238,
5239,
5349,
5350,
5410,
5411,
5465,
5466,
5563,
5564,
5641,
5642,
5694,
5695,
5881,
5882,
5995,
5996,
6137,
6138,
6427,
6428,
6585,
6586,
6714,
6715,
6816,
6817,
6859,
6860,
6894,
6906,
6907,
6930,
6931,
6946,
6983,
7007,
7037,
7062,
7079,
7097,
7118,
7144,
7167,
7194,
7218,
7231,
7254,
7286,
7310,
7371,
7372,
7387,
7388,
7467,
7595,
7596,
7617,
7618,
7789,
7790,
7800,
7801,
7827,
7828,
8005,
8006,
8016,
8017,
8038,
8039,
8187,
8188,
8198,
8199,
8214,
8215,
8371,
8372,
8382,
8383,
8410,
8411,
8570,
8571,
8581,
8582,
8616,
8617,
8627,
8705,
8718,
8722,
8759,
8774,
8790,
8797
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 8797,
"ccnet_original_nlines": 201,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.338405042886734,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00891919992864132,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2607555091381073,
"rps_doc_frac_unique_words": 0.45597270131111145,
"rps_doc_mean_word_length": 4.722867012023926,
"rps_doc_num_sentences": 146,
"rps_doc_symbol_to_word_ratio": 0.003147949930280447,
"rps_doc_unigram_entropy": 5.835875511169434,
"rps_doc_word_count": 1465,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.028616849333047867,
"rps_doc_frac_chars_dupe_6grams": 0.008960830047726631,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.008671769872307777,
"rps_doc_frac_chars_top_3gram": 0.008238179609179497,
"rps_doc_frac_chars_top_4gram": 0.00809365976601839,
"rps_doc_books_importance": -884.6453857421875,
"rps_doc_books_importance_length_correction": -884.6453857421875,
"rps_doc_openwebtext_importance": -523.4774780273438,
"rps_doc_openwebtext_importance_length_correction": -523.4774780273438,
"rps_doc_wikipedia_importance": -276.42431640625,
"rps_doc_wikipedia_importance_length_correction": -276.42431640625
},
"fasttext": {
"dclm": 0.7454750537872314,
"english": 0.9306598901748657,
"fineweb_edu_approx": 2.810534715652466,
"eai_general_math": 0.23503565788269043,
"eai_open_web_math": 0.20594388246536255,
"eai_web_code": 0.0043920897878706455
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "500",
"labels": {
"level_1": "Science and Natural history",
"level_2": "",
"level_3": ""
}
},
"secondary": {
"code": "577",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Biology and Anthropology",
"level_3": "Life (Biology)"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "5",
"label": "Evaluate"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "3",
"label": "Academic Writing"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 71f077df794da2774531b20248bb19b0 |
-1,477,381,749,907,361,000 | Main Page FileTypesMan Utility NirSoft Utilities
.xhtm Extension - List of programs that can open .xhtm files
In the following table, you can find a list of programs that can open files with .xhtm extension.This list is created by collecting extension information reported by users through the 'send report' option of FileTypesMan utility.
The product name, description, and company name are taken from the version information of the .exe file.The 'Actions' list is taken from the context menu items added to Explorer by the specified program.The 'Popularity' column displays one of the following 4 values: Low, Medium, High, and Very High, which is determined according to the number of users that sent the specified record.
EXE NameProduct NameDescriptionCompanyActionsPopularity
chrome.exeGoogle ChromeGoogle ChromeGoogle Inc.openLow
msohtmed.exeMicrosoft Office 2000Microsoft Office 2000 componentMicrosoft CorporationEdit, PrintLow
msohtmed.exe2007 Microsoft Office system2007 Microsoft Office componentMicrosoft CorporationEdit, PrintMedium
msohtmed.exeMicrosoft Office 2010Microsoft Office 2010 componentMicrosoft CorporationEdit, PrintMedium
msohtmed.exeMicrosoft Office XPMicrosoft Office XP componentMicrosoft CorporationEdit, PrintLow
msohtmed.exeMicrosoft Office 2016Microsoft Office 2016 componentMicrosoft CorporationEdit, PrintLow
msohtmed.exeMicrosoft Office 2003Microsoft Office 2003 componentMicrosoft CorporationEdit, PrintMedium
msohtmed.exeMicrosoft Office 2013Microsoft Office 2013 componentMicrosoft CorporationEdit, PrintLow
Opera.exeΒ Β Β openLow
opera.exeOpera Internet BrowserOpera Internet BrowserOpera SoftwareopenVery High
Safari (Mac).exeΒ Β Β openLow
uniextract.exeΒ Universal ExtractorΒ UniExtract Files..., UniExtract Here, UniExtract to SubdirLow
In the following table, you can find a list of file types information that is associated with .xhtm extension.
Type NameDescriptionPerceived TypeContentTypeDLL/EXE FileDLL/EXE DetailsPopularity
Opera.HTMLHTML DocumentΒ Β opera.exeOpera Internet Browser, Opera SoftwareHigh
Opera.HTMLOpera HTML DocumentΒ Β opera.exeOpera Internet Browser, Opera SoftwareLow
Opera.HTMLOpera Web DocumentΒ Β Β Β Low
Opera.HTMLΒ Β Β Β Β Very High
xhtmlfileXHTML Documenttextapplication/xhtml+xmliexplore.exeInternet Explorer, Microsoft CorporationLow
xhtm_auto_fileΒ Β Β Β Β Low
Registry keys related to this extension
HKEY_CLASSES_ROOT\.xhtm
HKEY_CLASSES_ROOT\Opera.HTML
HKEY_CLASSES_ROOT\xhtmlfile
HKEY_CLASSES_ROOT\xhtm_auto_file
Links to other Web sites
Search more extensions information:
If you are looking for information about another extension, you can try to find it in the following alphabetic list:
A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | Others |
Β | {
"url": "http://extension.nirsoft.net/xhtm",
"source_domain": "extension.nirsoft.net",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "9061",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PMB7GNR62WM5VXIULND6RZEOTYQOY35N",
"WARC-Concurrent-To": "<urn:uuid:133b63d8-7475-4d4f-a118-227d29d97c66>",
"WARC-Date": "2018-06-25T06:12:01Z",
"WARC-IP-Address": "50.22.232.74",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SSDR4KH4TI2MVNBX7RSBEJVVIZSKCO2M",
"WARC-Record-ID": "<urn:uuid:0a67772e-5891-4bb0-ab4b-7ae6fdb4cb0f>",
"WARC-Target-URI": "http://extension.nirsoft.net/xhtm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b23671d9-62bf-4315-a1c6-d3d46935b01d>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-143-72-160.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
49,
110,
111,
341,
727,
728,
784,
839,
939,
1049,
1152,
1248,
1348,
1451,
1551,
1571,
1652,
1679,
1776,
1777,
1888,
1889,
1972,
2049,
2131,
2167,
2192,
2296,
2319,
2320,
2360,
2361,
2385,
2414,
2442,
2475,
2476,
2501,
2502,
2538,
2539,
2656,
2657,
2770,
2771
],
"line_end_idx": [
49,
110,
111,
341,
727,
728,
784,
839,
939,
1049,
1152,
1248,
1348,
1451,
1551,
1571,
1652,
1679,
1776,
1777,
1888,
1889,
1972,
2049,
2131,
2167,
2192,
2296,
2319,
2320,
2360,
2361,
2385,
2414,
2442,
2475,
2476,
2501,
2502,
2538,
2539,
2656,
2657,
2770,
2771,
2772
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2772,
"ccnet_original_nlines": 45,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.17777778208255768,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08444444090127945,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23333333432674408,
"rps_doc_frac_unique_words": 0.5673981308937073,
"rps_doc_mean_word_length": 7.147335529327393,
"rps_doc_num_sentences": 35,
"rps_doc_symbol_to_word_ratio": 0.0022222199477255344,
"rps_doc_unigram_entropy": 4.898346424102783,
"rps_doc_word_count": 319,
"rps_doc_frac_chars_dupe_10grams": 0.031578950583934784,
"rps_doc_frac_chars_dupe_5grams": 0.23771929740905762,
"rps_doc_frac_chars_dupe_6grams": 0.05087719112634659,
"rps_doc_frac_chars_dupe_7grams": 0.031578950583934784,
"rps_doc_frac_chars_dupe_8grams": 0.031578950583934784,
"rps_doc_frac_chars_dupe_9grams": 0.031578950583934784,
"rps_doc_frac_chars_top_2gram": 0.10131578892469406,
"rps_doc_frac_chars_top_3gram": 0.07192981988191605,
"rps_doc_frac_chars_top_4gram": 0.08421052992343903,
"rps_doc_books_importance": -217.0122833251953,
"rps_doc_books_importance_length_correction": -217.0122833251953,
"rps_doc_openwebtext_importance": -85.14187622070312,
"rps_doc_openwebtext_importance_length_correction": -85.14187622070312,
"rps_doc_wikipedia_importance": -81.53911590576172,
"rps_doc_wikipedia_importance_length_correction": -81.53911590576172
},
"fasttext": {
"dclm": 0.061007678508758545,
"english": 0.6269308924674988,
"fineweb_edu_approx": 1.6656553745269775,
"eai_general_math": 0.09845752269029617,
"eai_open_web_math": 0.27239882946014404,
"eai_web_code": 0.010984360240399837
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "1",
"label": "No Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 71f077df794da2774531b20248bb19b0 |
86,336,382,197,474,930 | Frequently Asked Questions
We have put together a list of Frequently Asked Questions to help you understand better whatβs involved with Chiropractic and our Body in Balance clinic. If you canβt find the answer to your question, please phone us or use the form at the bottom of the page and we will answer your question directly.
Does treatment hurt?
Treatment is usually painless, and most patients look forward to and enjoy the experience (children often laugh!).
Sometimes though, especially after the first one or two treatments there may be a temporary reaction to treatment such as soreness similar to that felt after a work out, or tiredness (usually resulting in a good nightβs sleep)
I saw on Trevor MacDonalds Tonight programme on TV that back problems can be cured by taking fillings out it was reported by Jonathan Maitland β is this true?
The TV programme showed the opinion of one practitioner regarding one specific patient. As a Chiropractor, I am trained to take a full history and carry out a through examination of a patient β following on from this I will share my findings and recommend a treatment programme.
Chiropractors may refer a patient for other tests or to other healthcare professionals. Each patient is different and the approach that an individual chiropractor may take in each case can vary, but has the aim of treating the problem through chiropractic treatment and then seeking to prevent re-occurrence in the future through individual exercise programmes, diet and lifestyle advice.
We describe this as a patient focused package of care. Along with my fellow chiropractors in the UK, I am regulated by the government appointed regulator, the General Chiropractic Council and abide by their strict codes of practice.
As a BCA member I have completed a minimum four-year full-time degree level education in chiropractic and am required by the regulator to demonstrate continuous learning and professional development each year.
How long will a visit to the Pain Relief Centre take?
Please click the following link to our βWhat to Expectβ section on the Start Here page. You will find all the relevant details as well as an overview of the treatments and therapies we offer.
What does a chiropractor do?
A chiropractor checks your spine, and often your limbs, jaw and cranial bones, to see if you have any misalignmentβs, stiffness or instability. When you have a misalignment, your spinal bones (vertebrae) create havoc with your nervous system and cerebro-spinal fluid flow.
This interference disturbs the neurological impulses flowing from your brain to your body and from your body back to your brain. Your brain then can no longer keep the body healthy.
As a result this can cause a negative effect on the body, a weakened immune system, arthritis and other diseases.
Do I need to contact my GP?
Only if you want to, or if you need a referral letter for private medical cover. We may, with your permission send a report to your GP to keep your medical records up to date.
Are Chiropractors βrealβ doctors?
In the sense that doctor means βeducatorβ then yes, most chiropractors spend time educating their patients about health and well-being. Something medical doctors ironically rarely have time for.
In the legal sense, yes again, chiropractors can call themselves doctors as long as they make it clear they are not medical doctors.
Chiropractors are trained similar to medical doctors for the first two years, but then spend much more time on neurology, orthopedics, physical assessment, radiology and radiography.
Medical doctors spend this time learning about drugs, surgery and disease.
Is there any parking at the clinics?
At Body In Balance in Brookmans Park, you will find free parking right by the clinic.
How long will it take to get better?
As every body is unique this is very difficult to answer until you have been examined. It also depends on what you mean by βbetterβ. Most people mean βhow long before Iβm out of pain?β Pain can start to reduce right from the very first treatment or may take several sessions.
At Body In Balance our initial objective is to relieve the pain. Once we achieve this we work with you to help to βfixβ the underlying problem and help you to get βbetterβ from a medical point of view.
A rough guide can be given though, as most people feel relief within 6-8 treatments over a few weeks, whereas to be healed to prevent reoccurrences would usually take a minimum of 3 months of care for simple cases in healthy, active people.
The longer you have had a problem, and the poorer your general condition and health, the longer it will take. The longer you leave a problem the more attention will be required to rectify it.
Can I have Chiropractic care after surgery?
Yes. Some techniques can be used directly after surgery to help speed up the healing process. If you had surgery for a specific problem and you still have pain β do not give up hope, chiropractic, and the correct exercise, has helped many people recover.
Can people with osteoporosis get chiropractic care?
Of course. When developing a care plan the unique circumstances of each patient are considered. There are many ways to adjust the spine.
The method selected will be best suited to your age, size and condition. Also, we can give you up to date advice on how to combat osteoporosis including what exercise to do, what foods and drinks to avoid that weaken your bones, and what supplements and foods may be of benefit.
How can chiropractic treatment benefit you?
Alleviates pain and discomfort. Helps you return to normal activity. Prevents recurrence. Promotes good health and well-being β please see articles in download section for more details.
What do chiropractors treat?
The primary goal for a chiropractor is to remove interference from your bodyβs own capacity to heal. So in a medical sense chiropractors treat nothing in particular, but can help in almost all health conditions.
For a list of the main problems seen by chiropractors please go to our Start Here page
What is the difference between Chiropractic and Osteopathy?
Well to be honest there can be more similarities than differences. Both try to improve health by mainly working on your spine.
What differs are the techniques learned at college. Some chiropractic and osteopathic techniques are very gentle, and some can seem very rough.
Very often it is the practitioner themselves that are the difference, rather than the profession. On the whole though osteopathic treatment tends to take longer to perform.
A final difference is that chiropractors learn to take and interpret X-rays.
Find Us and Contact Us
Address
9 Bradmore Green
Brookmans Park
Hertfordshire AL9 7QW
Phone
Use the form below to contact Body In Balance | {
"url": "https://www.thepainreliefcentres.co.uk/faqs/",
"source_domain": "www.thepainreliefcentres.co.uk",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "61094",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NWEPTWXT5DB75O62NXZJZMYFACHQAZYA",
"WARC-Concurrent-To": "<urn:uuid:b7f604b7-7264-45b1-8b38-394d4ca8cb6b>",
"WARC-Date": "2021-10-27T14:02:11Z",
"WARC-IP-Address": "92.205.0.58",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BHH2KFVOCYPVMKMCNHDL7LPR4URUAESB",
"WARC-Record-ID": "<urn:uuid:e491836e-ac38-4252-b5dd-96f6f8c9349c>",
"WARC-Target-URI": "https://www.thepainreliefcentres.co.uk/faqs/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:531fbd38-702b-40ec-9132-bf9d0c7f5e24>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-149\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
27,
28,
330,
331,
352,
353,
468,
469,
696,
697,
856,
857,
1136,
1137,
1526,
1527,
1760,
1761,
1971,
1972,
2026,
2027,
2219,
2220,
2249,
2250,
2523,
2524,
2706,
2707,
2821,
2822,
2850,
2851,
3027,
3028,
3062,
3063,
3258,
3259,
3392,
3393,
3576,
3577,
3652,
3653,
3690,
3691,
3777,
3778,
3815,
3816,
4092,
4093,
4295,
4296,
4537,
4538,
4730,
4731,
4775,
4776,
5031,
5032,
5084,
5085,
5222,
5223,
5502,
5503,
5547,
5548,
5734,
5735,
5764,
5765,
5977,
5978,
6065,
6066,
6126,
6127,
6254,
6255,
6399,
6400,
6573,
6574,
6651,
6652,
6675,
6676,
6684,
6685,
6702,
6717,
6739,
6740,
6746,
6747
],
"line_end_idx": [
27,
28,
330,
331,
352,
353,
468,
469,
696,
697,
856,
857,
1136,
1137,
1526,
1527,
1760,
1761,
1971,
1972,
2026,
2027,
2219,
2220,
2249,
2250,
2523,
2524,
2706,
2707,
2821,
2822,
2850,
2851,
3027,
3028,
3062,
3063,
3258,
3259,
3392,
3393,
3576,
3577,
3652,
3653,
3690,
3691,
3777,
3778,
3815,
3816,
4092,
4093,
4295,
4296,
4537,
4538,
4730,
4731,
4775,
4776,
5031,
5032,
5084,
5085,
5222,
5223,
5502,
5503,
5547,
5548,
5734,
5735,
5764,
5765,
5977,
5978,
6065,
6066,
6126,
6127,
6254,
6255,
6399,
6400,
6573,
6574,
6651,
6652,
6675,
6676,
6684,
6685,
6702,
6717,
6739,
6740,
6746,
6747,
6792
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6792,
"ccnet_original_nlines": 100,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4460822343826294,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01551590021699667,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11559347808361053,
"rps_doc_frac_unique_words": 0.40740740299224854,
"rps_doc_mean_word_length": 4.836860656738281,
"rps_doc_num_sentences": 69,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.496006488800049,
"rps_doc_word_count": 1134,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.013673660345375538,
"rps_doc_frac_chars_top_3gram": 0.009480400010943413,
"rps_doc_frac_chars_top_4gram": 0.005469460040330887,
"rps_doc_books_importance": -563.7809448242188,
"rps_doc_books_importance_length_correction": -563.7809448242188,
"rps_doc_openwebtext_importance": -349.55303955078125,
"rps_doc_openwebtext_importance_length_correction": -349.55303955078125,
"rps_doc_wikipedia_importance": -230.50054931640625,
"rps_doc_wikipedia_importance_length_correction": -230.50054931640625
},
"fasttext": {
"dclm": 0.1753089427947998,
"english": 0.9526565670967102,
"fineweb_edu_approx": 2.018526315689087,
"eai_general_math": 0.04868059977889061,
"eai_open_web_math": 0.11202734708786011,
"eai_web_code": 0.003552319947630167
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "617.5",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Surgery and Dentistry"
}
},
"secondary": {
"code": "617.0072",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Surgery and Dentistry"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "9",
"label": "FAQ"
},
"secondary": {
"code": "1",
"label": "About (Org.)"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 71f077df794da2774531b20248bb19b0 |
-5,625,099,641,200,200,000 | summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorNick Piggin <[email protected]>2006-08-27 01:23:54 -0700
committerLinus Torvalds <[email protected]>2006-08-27 11:01:32 -0700
commit0d673a5a4775d3dc565b6668ed75fd2db2ede624 (patch)
treea447aa33cf8b8fea26a81add012169a1a8060706
parent36920e069a87c6fccffbc0ec5e74985d94d3bcc4 (diff)
[PATCH] cpuset: oom panic fix
cpuset_excl_nodes_overlap always returns 0 if current is exiting. This caused customer's systems to panic in the OOM killer when processes were having trouble getting memory for the final put_user in mm_release. Even though there were lots of processes to kill. Change to returning 1 in this case. This achieves parity with !CONFIG_CPUSETS case, and was observed to fix the problem. Signed-off-by: Nick Piggin <[email protected]> Acked-by: Paul Jackson <[email protected]> Signed-off-by: Andrew Morton <[email protected]> Signed-off-by: Linus Torvalds <[email protected]>
-rw-r--r--kernel/cpuset.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/kernel/cpuset.c b/kernel/cpuset.c
index f1dda98bdffe..4ea6f0dc2fc5 100644
--- a/kernel/cpuset.c
+++ b/kernel/cpuset.c
@@ -2420,7 +2420,7 @@ EXPORT_SYMBOL_GPL(cpuset_mem_spread_node);
int cpuset_excl_nodes_overlap(const struct task_struct *p)
{
const struct cpuset *cs1, *cs2; /* my and p's cpuset ancestors */
- int overlap = 0; /* do cpusets overlap? */
+ int overlap = 1; /* do cpusets overlap? */
task_lock(current);
if (current->flags & PF_EXITING) { | {
"url": "https://evilpiepirate.org/git/linux-bcache.git/commit/?h=v2.6.18-rc5&id=0d673a5a4775d3dc565b6668ed75fd2db2ede624",
"source_domain": "evilpiepirate.org",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "9706",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YX52QZRPDG6HUGDC6AVWVNFD5WZYPA47",
"WARC-Concurrent-To": "<urn:uuid:e65857d2-0908-44ab-a17b-288a0cc0db9e>",
"WARC-Date": "2021-07-27T21:25:02Z",
"WARC-IP-Address": "173.230.148.140",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3ST7FPO3F3SWDZWNDHOI3MSFLJOUPTSY",
"WARC-Record-ID": "<urn:uuid:20f6f7c4-3ab6-4ed1-a2bd-24bb7be34f06>",
"WARC-Target-URI": "https://evilpiepirate.org/git/linux-bcache.git/commit/?h=v2.6.18-rc5&id=0d673a5a4775d3dc565b6668ed75fd2db2ede624",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:efd9899b-f123-450c-a5a6-3bc27c10496c>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-86.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
29,
42,
51,
58,
64,
125,
197,
252,
297,
351,
381,
940,
967,
1010,
1057,
1097,
1119,
1141,
1206,
1265,
1267,
1333,
1378,
1423,
1443
],
"line_end_idx": [
29,
42,
51,
58,
64,
125,
197,
252,
297,
351,
381,
940,
967,
1010,
1057,
1097,
1119,
1141,
1206,
1265,
1267,
1333,
1378,
1423,
1443,
1477
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1477,
"ccnet_original_nlines": 25,
"rps_doc_curly_bracket": 0.0013540999498218298,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.158208966255188,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014925369992852211,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.45373132824897766,
"rps_doc_frac_unique_words": 0.7189542651176453,
"rps_doc_mean_word_length": 7.490196228027344,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.582411766052246,
"rps_doc_word_count": 153,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04886562004685402,
"rps_doc_frac_chars_top_3gram": 0.027923209592700005,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -162.52993774414062,
"rps_doc_books_importance_length_correction": -155.59405517578125,
"rps_doc_openwebtext_importance": -100.4540786743164,
"rps_doc_openwebtext_importance_length_correction": -100.4540786743164,
"rps_doc_wikipedia_importance": -77.16667175292969,
"rps_doc_wikipedia_importance_length_correction": -66.6469497680664
},
"fasttext": {
"dclm": 0.04131418094038963,
"english": 0.7240703105926514,
"fineweb_edu_approx": 1.5642130374908447,
"eai_general_math": 0.0034103998914361,
"eai_open_web_math": 0.7316979765892029,
"eai_web_code": 0.0005681500188075006
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 71f077df794da2774531b20248bb19b0 |
-1,152,059,771,445,213,800 | Asbestos health problem
Over time, accumulated asbestos fibers can cause tissue inflammation and scarring, which can affect breathing and lead to serious health problems low levels of asbestos fibers are present in the air, water, and soil. Asbestos poses health risks only when fibres are present in the air that people breathe health risks of asbestos also find out how to properly handle a potential asbestos problem asbestos, if inhaled, can cause cancer and other diseases on this page. People who get health problems from inhaling asbestos have usually been exposed to high levels of asbestos for a long time the symptoms of these diseases do not usually appear until about 20 to 30 years after the first exposure to asbestos. In general, the greater the exposure to asbestos, the greater the chance of developing harmful health effects disease symptoms may take many years to develop following exposure asbestos-related conditions can be difficult to identify. Asbestos an environmental and a health problem by dr hussein fatehy mahmoud phd-fccp -mcts consultant pulmonologist abbassia chest hospital cairo-egypt 2 agenda asbestos overview asbestos- an environmental problem asbestos-a health problem role of egyptian press media in asbestos banning role of egyptian government in asbestos banning take.
asbestos health problem Asbestos deaths remain a public health problem : shots - health news exposure to the tiny fibers in asbestos can lead people who work around the material to develop mesothelioma, a cancer of the.
Asbestosis is a serious long-term lung condition caused by prolonged exposure to asbestos asbestos is a whitish material that was used in buildings for insulation, flooring and roofing in the past, but is now no longer used. The port allegany asbestos health program (paahp) is a unique, community-run program that resulted from the successful cooperative efforts of a labor union, a corporation, community health care providers, and a medical school. Asbestos still kills around 5000 workers each year, this is more than the number of people killed on the road around 20 tradesman die each week as a result of past exposure however, asbestos is not just a problem of the past it can be present today in any building built or refurbished before the.
The world trade center health registry estimates about 410,000 people were exposed to a host of toxins including asbestos during the rescue, recovery and clean-up efforts that followed 9/11 people most affected by asbestos at ground zero were people assigned to rescue survivors. Workers exposed to asbestos have an increased risk of developing lung cancer this risk is greatly increased if the person smokes it is very difficult to distinguish lung cancer caused by asbestos and that caused by smoking or other environmental pollutants, so it is often very difficult to get a clear diagnosis of asbestos-related lung cancer. Asbestos in some form is in millions of homes, but i haven't been able to find statistics on the health effects of asbestos exposure in the home that doesn't mean they aren't there, but the cases of health problems from occupational exposure dominate. In may 2018, the epa published a document known as the βproblem formulation of the risk evaluation for asbestos,β which establishes the scientific approach the epa will take in evaluating. Hd historic stock footage - story of asbestos mining and mfg 1920s - duration: 11:38 buyout footage historic film archive 11,743 views.
The legal limit for safe exposure to asbestos in the workplace is now 01 fiber/ml, so any asbestos measurement in the home of 01 fiber/ml or greater is a health concern. Once they are trapped in the body, the fibers can cause health problems asbestos is most hazardous when it is friable the term friable means that the asbestos is easily crumbled by hand, releasing fibers into the air. Asbestosis is a lung disease that develops when asbestos fibers cause scarring in your lungs the scarring restricts your breathing and interferes with the ability of oxygen to enter your bloodstream.
asbestos health problem Asbestos deaths remain a public health problem : shots - health news exposure to the tiny fibers in asbestos can lead people who work around the material to develop mesothelioma, a cancer of the.
Asbestos can cause health problems when inhaled into the lungs breathing in very small, airborne asbestos fibres has been associated with diseases such as asbestosis, mesothelioma and lung cancer. The environmental impact of asbestos used in the past as a common part of construction materials, asbestos continues to pose major risks to human health and the environment once it was discovered that it caused health problems, products that contained asbestos were discontinued, but the risks remain. Health problems associated with exposure to asbestos breathing asbestos mainly causes problems in the lungs and the membrane that surrounds the lungs, including: asbestosis : scarring of lung tissue that causes breathing problems, usually in workers exposed to asbestos in workplaces before the federal government began regulating asbestos use. Health problems attributed to asbestos include: asbestosis - a lung disease first found in textile workers, asbestosis is a scarring of the lung tissue resulting from the production of growth factors that stimulate fibroblasts (the scar-producing lung cells) to proliferate and synthesize the scar tissue in response to injury by the inhaled.
β’ βasbestosβ is a commercial name, not a mineralogical definition, given to a variety of six naturally occurring fibrous minerals these minerals possess high tensile strength, flexibility, resistance to chemical and thermal degradation, and electrical resistance.
β’ Tigerite β geologically compressed blue asbestos white asbestos is also known as βserpentineβ, as itsβ fibres are bendy all the rest are called βamphiboleβ, as their crystals are constructed in columns (and so more rigid and liable to snap into tiny fragments.
β’ Install asbestos cement pipe, primarily because of issues with handling, there appears to be no concern for health of consumers receiving the water and no programmes to specifically replace asbestos cement pipe for this reason.
Asbestos becomes a health risk when its fibres are released into the air and breathed in breathing in asbestos fibres can cause asbestosis, lung cancer and mesothelioma asbestos was once used in australia in more than 3,000 different products including fibro, flue pipes, drains, roofs, gutters, brakes, clutches and gaskets. Asbestos use continued to grow through most of the 20th century until public knowledge of the health hazards of asbestos dust led to its outlawing by courts and legislatures in mainstream construction and fireproofing in most countries. What is asbestos asbestos is the name given to a group of naturally occurring minerals that are resistant to heat and corrosion asbestos has been used in products, such as insulation for pipes (steam lines for example), floor tiles, building materials, and in vehicle brakes and clutches. Knowledge or suspicion of health issues existed for a long time: the health issues related to asbestos were known, suspected, or reported, for decades, with modern medical coverage dating back to the 19th century.
asbestos health problem Asbestos deaths remain a public health problem : shots - health news exposure to the tiny fibers in asbestos can lead people who work around the material to develop mesothelioma, a cancer of the. asbestos health problem Asbestos deaths remain a public health problem : shots - health news exposure to the tiny fibers in asbestos can lead people who work around the material to develop mesothelioma, a cancer of the. asbestos health problem Asbestos deaths remain a public health problem : shots - health news exposure to the tiny fibers in asbestos can lead people who work around the material to develop mesothelioma, a cancer of the.
Asbestos health problem
Rated 3/5 based on 14 review
2018. | {
"url": "http://gcessayynrs.alisher.info/asbestos-health-problem.html",
"source_domain": "gcessayynrs.alisher.info",
"snapshot_id": "crawl=CC-MAIN-2018-43",
"warc_metadata": {
"Content-Length": "16682",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4QHTVIOUSGNNNXQHUV3WOGF2GLJ6A2WZ",
"WARC-Concurrent-To": "<urn:uuid:9829e4ee-4b91-43b1-ac50-22aefd67ca22>",
"WARC-Date": "2018-10-15T21:21:45Z",
"WARC-IP-Address": "104.18.59.249",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4TZ4GN67WJGAKQ6FHHKGBXER3PPJFGKG",
"WARC-Record-ID": "<urn:uuid:17986781-05f5-4750-804e-2f5898cd588f>",
"WARC-Target-URI": "http://gcessayynrs.alisher.info/asbestos-health-problem.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dcc015de-582c-4862-a340-ec5cdb0117b6>"
},
"warc_info": "isPartOf: CC-MAIN-2018-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-164-201-98.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
24,
25,
1312,
1313,
1533,
1534,
2284,
2285,
3488,
3489,
4077,
4078,
4298,
4299,
5486,
5487,
5753,
6018,
6250,
6251,
7317,
7318,
7978,
8002,
8031,
8032
],
"line_end_idx": [
24,
25,
1312,
1313,
1533,
1534,
2284,
2285,
3488,
3489,
4077,
4078,
4298,
4299,
5486,
5487,
5753,
6018,
6250,
6251,
7317,
7318,
7978,
8002,
8031,
8032,
8037
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 8037,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3771868348121643,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12106367945671082,
"rps_doc_frac_unique_words": 0.36846277117729187,
"rps_doc_mean_word_length": 5.232171058654785,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.263218879699707,
"rps_doc_word_count": 1262,
"rps_doc_frac_chars_dupe_10grams": 0.1399363875389099,
"rps_doc_frac_chars_dupe_5grams": 0.14993184804916382,
"rps_doc_frac_chars_dupe_6grams": 0.1399363875389099,
"rps_doc_frac_chars_dupe_7grams": 0.1399363875389099,
"rps_doc_frac_chars_dupe_8grams": 0.1399363875389099,
"rps_doc_frac_chars_dupe_9grams": 0.1399363875389099,
"rps_doc_frac_chars_top_2gram": 0.027563229203224182,
"rps_doc_frac_chars_top_3gram": 0.022262610495090485,
"rps_doc_frac_chars_top_4gram": 0.02195972017943859,
"rps_doc_books_importance": -468.957275390625,
"rps_doc_books_importance_length_correction": -468.957275390625,
"rps_doc_openwebtext_importance": -295.2218322753906,
"rps_doc_openwebtext_importance_length_correction": -295.2218322753906,
"rps_doc_wikipedia_importance": -155.77627563476562,
"rps_doc_wikipedia_importance_length_correction": -155.77627563476562
},
"fasttext": {
"dclm": 0.09827960282564163,
"english": 0.9437577724456787,
"fineweb_edu_approx": 3.303859233856201,
"eai_general_math": 0.0907697081565857,
"eai_open_web_math": 0.22871720790863037,
"eai_web_code": 0.001346049946732819
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "614.5",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Public health"
}
},
"secondary": {
"code": "628.5",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Sanitary engineering, Sanitation, and Water-supply"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "1",
"label": "News/Editorial"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "14",
"label": "News Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 71f077df794da2774531b20248bb19b0 |
5,017,310,095,028,601,000 | Users' mental models
13 Oct 2006 - 12:12pm
364 reads
Juan Lanus
2005
Hi Shalini, all,
Yes, this subject is of paramount importance. Given that you are to
provide a web site fopr to do something on it, noy just for the user
to like it or not, but to act on it.
A web site or any other human-computer interaction with a device that
can be perceived by the user as stubborn as a computer can be.
This is due to a lack of mental model coupling.
On the other hand, sometimes we meet another person and soon we find
out that there is good communication, that without saying nothing
there are implicit agreements and coincidences. This is bocause of
common mental models.
When I design a software piece I want the user to feel like in the
second example, in tacit complete agreement.
To achieve this I have to find out what's the users "conceptual model"
and try to match it with the system's "manifest model". The closer the
matching, the more the user has that cozy feeling of being understood.
One common error is to think that our own mental model is "the" mental
model, and that the user will share it. This leads to self-referential
design, which sometimes might not be appropriate. Most of the times,
in fact.
When the manifest model of the system does not match the user's mental
model, the user might reject the system, this is usually termed
"resistance to change."
It is assumed that the users know how to do the task the system is
intended for. This is usually true in a company's internal business
applications, and also in web applications intended for the general
public to do known tasks. These users do not need a different, newer,
better, way to do things. But it generally happens that their current
way, the system to be replaced, has some drawbacks and problems. The
new system must solve these issues.
Sometimes UI developers think that emulating the real thing they are
"user friendly." This is not always true, in fact it's seldom true.
For example emulating an office environment on screen with an office
visual animation. Albeit this is an attempt to make friends, the
drawbacks of the emulated thingie will soon raear. For example there
is no air conditioner. Dragging a document in not the same as making
balls and aimint them at the basket, etc ... Most "realistic" UIs
fail.
...
--
Juan Lanus
TECNOSOL
Argentina
Syndicate content Get the feed | {
"url": "http://ixda.org/node/12789",
"source_domain": "ixda.org",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "23093",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:B7HCWSSQ4H544IDEA3LDEZLEZBKZJYCA",
"WARC-Concurrent-To": "<urn:uuid:eb7eed28-7367-4bea-8de1-1eb6a939b127>",
"WARC-Date": "2014-03-10T21:50:54Z",
"WARC-IP-Address": "96.30.48.104",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:6EJKIUDNQBSG3WADYTPMV6OFESPFIP2N",
"WARC-Record-ID": "<urn:uuid:196a8781-cd9a-44c1-9d4a-3e57a4da6d39>",
"WARC-Target-URI": "http://ixda.org/node/12789",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:29781f8f-749a-4d0f-b929-1ca1b29f156b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-142-35.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-10\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
21,
22,
44,
54,
65,
70,
71,
88,
89,
157,
226,
263,
333,
396,
444,
445,
514,
580,
647,
669,
670,
737,
782,
783,
854,
925,
996,
997,
1068,
1139,
1208,
1217,
1218,
1289,
1353,
1377,
1378,
1445,
1513,
1581,
1651,
1721,
1790,
1826,
1827,
1896,
1964,
2033,
2098,
2167,
2236,
2302,
2308,
2309,
2313,
2316,
2327,
2336,
2346,
2347
],
"line_end_idx": [
21,
22,
44,
54,
65,
70,
71,
88,
89,
157,
226,
263,
333,
396,
444,
445,
514,
580,
647,
669,
670,
737,
782,
783,
854,
925,
996,
997,
1068,
1139,
1208,
1217,
1218,
1289,
1353,
1377,
1378,
1445,
1513,
1581,
1651,
1721,
1790,
1826,
1827,
1896,
1964,
2033,
2098,
2167,
2236,
2302,
2308,
2309,
2313,
2316,
2327,
2336,
2346,
2347,
2377
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2377,
"ccnet_original_nlines": 60,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4534412920475006,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012145750224590302,
"rps_doc_frac_lines_end_with_ellipsis": 0.01639343984425068,
"rps_doc_frac_no_alph_words": 0.14979757368564606,
"rps_doc_frac_unique_words": 0.513189435005188,
"rps_doc_mean_word_length": 4.479616165161133,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0.004048579838126898,
"rps_doc_unigram_entropy": 4.895516395568848,
"rps_doc_word_count": 417,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.022483939304947853,
"rps_doc_frac_chars_top_3gram": 0.008565310388803482,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -208.90460205078125,
"rps_doc_books_importance_length_correction": -208.90460205078125,
"rps_doc_openwebtext_importance": -124.3022232055664,
"rps_doc_openwebtext_importance_length_correction": -124.3022232055664,
"rps_doc_wikipedia_importance": -100.06871795654297,
"rps_doc_wikipedia_importance_length_correction": -100.06871795654297
},
"fasttext": {
"dclm": 0.280458927154541,
"english": 0.9513545036315918,
"fineweb_edu_approx": 2.1536786556243896,
"eai_general_math": 0.8395451307296753,
"eai_open_web_math": 0.24592560529708862,
"eai_web_code": 0.5982415080070496
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 71f077df794da2774531b20248bb19b0 |
-603,290,575,849,058,200 | Bismuth
Le bismuth est l'élément chimique de numéro atomique 83, de symbole Bi. C'est le cinquième et dernier élément du groupe des pnictogènes (groupe no 15). Il est toxique mais moins que le plomb qu'il tend donc à remplacer pour certains usages, et ce n'est pas un oligo-élément : il n'a aucun rôle physiologique connu. Réputé très faiblement présent dans les organismes animaux, sa cinétique environnementale et dans les organismes a été peu étudiée (contrairement à celle d'autres métaux lourds proches).
Bismuth
Γchantillon de bismuth.
PlombBismuthPolonium
Sb
Β
Β
83
Bi
Β
Β Β Β Β Β Β Β Β
Β Β Β Β Β Β Β Β
Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β
Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β
Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β
Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β
Β Β
Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β
Bi
Mc
Tableau completTableau Γ©tendu
Position dans le tableau pΓ©riodique
Symbole Bi
Nom Bismuth
NumΓ©ro atomique 83
Groupe 15
PΓ©riode 6e pΓ©riode
Bloc Bloc p
Famille d'Γ©lΓ©ments MΓ©tal pauvre
Configuration Γ©lectronique [Xe] 4f14 5d10 6s2 6p3
Γlectrons par niveau dβΓ©nergie 2, 8, 18, 32, 18, 5
PropriΓ©tΓ©s atomiques de l'Γ©lΓ©ment
Masse atomique 208,980Β 40Β Β±Β 0,000Β 01Β u
Rayon atomique (calc) 160Β pm (143Β pm)
Rayon de covalence 148Β Β±Β 4Β pm
Rayon de van der Waals 152Β pm
Γtat dβoxydation 3, 5
ΓlectronΓ©gativitΓ© (Pauling) 2,02
Oxyde Acide
Γnergies dβionisation
1reΒ : 7,285Β 5Β eV 2eΒ : 16,703Β eV
3eΒ : 25,56Β eV 4eΒ : 45,3Β eV
5eΒ : 56,0Β eV 6eΒ : 88,3Β eV
Isotopes les plus stables
Iso AN PΓ©riode MD Ed PD
MeV
207Bi{syn.}31,55Β aΞ²+ Ξ΅2,399207Pb
208Bi{syn.}368Β 000Β aΞ΅2,880208Pb
209Bi100Β %19Β Β±Β 2Γ1018Β aΞ±3,14205Tl
PropriΓ©tΓ©s physiques du corps simple
Γtat ordinaire Solide
Masse volumique 9,79Β gΒ·cm-3 (20Β Β°C)
Système cristallin Rhomboédrique
DuretΓ© (Mohs) 2,5 (Mohs)
Couleur ArgentΓ©-irisΓ©
Point de fusion 271,4Β Β°C
Point dβΓ©bullition 1Β 564Β Β°C
Γnergie de fusion 51Β 816Β JΒ·kg-1
Γnergie de vaporisation 151Β kJΒ·mol-1 (1Β atm, 1Β 564Β Β°C)
Volume molaire 21,31Γ10-6Β m3Β·mol-1
Pression de vapeur 1,013Γ10-4Β kPa (400Β Β°C)
1,013Γ10-1Β kPa (600Β Β°C)
1,013Γ102Β kPa (880Β Β°C)
1,013Γ105Β kPa (1Β 420Β Β°C)
Vitesse du son 1Β 790Β mΒ·s-1 Γ 20Β Β°C
Chaleur massique 122Β JΒ·kg-1Β·K-1 (20Β Β°C)
ConductivitΓ© Γ©lectrique 0,867Γ106Β SΒ·m-1
ConductivitΓ© thermique 7,87Β WΒ·m-1Β·K-1
Divers
NoΒ CAS 7440-69-9
NoΒ ECHA 100.028.343
NoΒ CE 231-177-4
PrΓ©cautions
SGH
Γtat pulvΓ©rulentΒ :
Attention
H228, P210 et P370+P378
SIMDUT
Produit non contrΓ΄lΓ©
Transport
Β Β Β 3089Β Β Β
UnitΓ©s du SI & CNTP, sauf indication contraire.
Cet article concerne l'Γ©lΓ©ment chimique, le corps simple et les composΓ©s correspondants. Pour les autres significations, voir Bismuth (homonymie).
Il peut Γͺtre thΓ©oriquement rapprochΓ© du phosphore P, de l'antimoine Sb et de l'arsenic As, appartenant au groupe 15, mais aussi de l'Γ©tain Sn et du plomb Pb appartenant au groupe 14. Les Γ©lΓ©ments successifs du groupe 15 (azote N, phosphore P, arsenic As, antimoine Sb et bismuth) montrent une tendance croissante Γ former des sulfures stables plutΓ΄t que des oxydesΒ : le bismuth est nettement chalcophile.
Cet article est issu de Wikipedia. Le texte est sous licence Creative Commons - Attribution - Partage dans les MΓͺmes. Des conditions supplΓ©mentaires peuvent s'appliquer aux fichiers multimΓ©dias. | {
"url": "https://kiwix.colibox.colibris-outilslibres.org/wikipedia_fr_all_mini_2022-10/A/Bismuth",
"source_domain": "kiwix.colibox.colibris-outilslibres.org",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "69539",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WZTZEOV47JAVGGX4XY3TD324WVJ5ECCD",
"WARC-Concurrent-To": "<urn:uuid:b27f4177-4ce4-4e81-8c1e-a2eca80ed6d2>",
"WARC-Date": "2024-07-21T06:23:10Z",
"WARC-IP-Address": "65.21.50.40",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BM54A4BDLPYPVTIOWP5NFBNBA3H5VBOQ",
"WARC-Record-ID": "<urn:uuid:ec874b48-8501-4e99-85e7-f9f87914f2ec>",
"WARC-Target-URI": "https://kiwix.colibox.colibris-outilslibres.org/wikipedia_fr_all_mini_2022-10/A/Bismuth",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e8b9ac7d-c2a5-4350-8ad6-00ba87f8bfff>"
},
"warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-168\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
8,
9,
511,
512,
520,
521,
545,
566,
569,
571,
573,
576,
579,
581,
597,
613,
649,
685,
749,
813,
817,
861,
864,
867,
897,
933,
944,
956,
975,
985,
1004,
1016,
1048,
1098,
1149,
1183,
1222,
1260,
1290,
1320,
1342,
1375,
1387,
1409,
1441,
1468,
1494,
1520,
1544,
1548,
1581,
1613,
1647,
1684,
1706,
1742,
1775,
1800,
1822,
1847,
1875,
1907,
1962,
1997,
2040,
2041,
2065,
2088,
2113,
2114,
2149,
2189,
2229,
2267,
2274,
2291,
2311,
2327,
2339,
2343,
2362,
2363,
2373,
2397,
2404,
2405,
2426,
2436,
2447,
2448,
2496,
2497,
2644,
2645,
3050,
3051
],
"line_end_idx": [
8,
9,
511,
512,
520,
521,
545,
566,
569,
571,
573,
576,
579,
581,
597,
613,
649,
685,
749,
813,
817,
861,
864,
867,
897,
933,
944,
956,
975,
985,
1004,
1016,
1048,
1098,
1149,
1183,
1222,
1260,
1290,
1320,
1342,
1375,
1387,
1409,
1441,
1468,
1494,
1520,
1544,
1548,
1581,
1613,
1647,
1684,
1706,
1742,
1775,
1800,
1822,
1847,
1875,
1907,
1962,
1997,
2040,
2041,
2065,
2088,
2113,
2114,
2149,
2189,
2229,
2267,
2274,
2291,
2311,
2327,
2339,
2343,
2362,
2363,
2373,
2397,
2404,
2405,
2426,
2436,
2447,
2448,
2496,
2497,
2644,
2645,
3050,
3051,
3245
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3245,
"ccnet_original_nlines": 96,
"rps_doc_curly_bracket": 0.0012326700380071998,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.05477527901530266,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04775280877947807,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4157303273677826,
"rps_doc_frac_unique_words": 0.6703056693077087,
"rps_doc_mean_word_length": 5.255458354949951,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.473041534423828,
"rps_doc_word_count": 458,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.008724549785256386,
"rps_doc_frac_chars_top_3gram": 0.009970920160412788,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -380.8316650390625,
"rps_doc_books_importance_length_correction": -380.8316650390625,
"rps_doc_openwebtext_importance": -205.84844970703125,
"rps_doc_openwebtext_importance_length_correction": -205.84844970703125,
"rps_doc_wikipedia_importance": -132.39334106445312,
"rps_doc_wikipedia_importance_length_correction": -132.39334106445312
},
"fasttext": {
"dclm": 0.029192570596933365,
"english": 0.004978559911251068,
"fineweb_edu_approx": 1.90000319480896,
"eai_general_math": -0.000009540000064589549,
"eai_open_web_math": 0.8650999069213867,
"eai_web_code": 1.0000100135803223
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "546.6",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Chemistry",
"level_3": "Chemistry, Inorganic"
}
},
"secondary": {
"code": "546",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Chemistry",
"level_3": "Chemistry, Inorganic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 71f077df794da2774531b20248bb19b0 |
-9,046,810,978,757,673,000 | Home | | Chemistry | General properties of Lanthanides
Chapter: 11th 12th std standard Class Organic Inorganic Physical Chemistry Higher secondary school College Notes
General properties of Lanthanides
General properties of Lanthanides
The Lanthanide series include fifteen elements i.e. lanthanum (57 La) to lutetium (71 Lu). Lanthanum and Lutetium have no partly filled 4f- subshell but have electrons in 5d-subshell.
The position of f block elements in the periodic table, is explained above.
The elements in which the extra electron enters ( n- 2 )f orbitals are called f- block elements. These elements are also called as inner transition elements because they form a transition series within the transition elements. The f-block elements are also known as rare earth elements. These are divided into two series.
Β
i) The Lanthanide series (4f-block elements)
ii) The Actinide series (5f- block elements )
The Lanthanide Series
The Lanthanide series include fifteen elements i.e. lanthanum (57Β La) to lutetium (71Β Lu). Lanthanum and Lutetium have no partly filled 4f- subshell but have electrons in 5d-subshell. Thus these elements should not be included in this series. However, all these elements closely resemble lanthanum and hence are considered together.
General properties of Lanthanides
1. Electronic configuration
The electronic configuration of Lanthanides are listed in the table . The fourteen electrons are filled in Ce to Lu with configuration [54Β Xe ]4f1-14Β 5d1Β 6s2
2. Oxidation states
The common oxidation state exhibited by all the lanthanides is +3 (Ln3+) in aqueous solutions and in their solid compounds. Some elements exhibit +2 and +4 states as uncommon oxidation states.
La Β Β Β Β Β Β Β Β Β Β Β Β -Β Β Β Β Β +3
Ce Β Β Β Β Β Β Β Β Β Β Β Β -Β Β Β Β Β +3, +4, +2
Pr Β Β Β Β Β Β Β Β Β Β Β Β -Β Β Β Β Β +3, +4
Nd Β Β Β Β Β Β Β Β Β Β Β -Β Β Β Β Β +3, +4, +2
3. Radii of tripositive lanthanide ions
The size of M3+Β ions decreases as we move through the lanthanides from lanthanum to lutetium. This steady decrease in ionic radii of M3+Β cations in the lanthanide series is called Lanthanide contraction.
Cause of lanthanide contraction
The lanthanide contraction is due to the imperfect shielding of one 4f electron Β by another in the same sub shell. As we move along the lanthanide series, the nuclear charge and the number of 4f electrons increase by one unit at each step. However, due to imperfect shielding, the effective nuclear charge increases causing a contraction in electron cloud of 4f-subshell.
Consequences of lanthanide contraction
Basicity of ions
i) Due to lanthanide contraction, the size of Ln3+Β ions decreases regularly with increase in atomic number. According to Fajan's rule, decrease in size of Ln3+Β ions increase the covalent character and decreases the basic character between Ln3+Β and OH-Β ion in Ln(OH)3. Since the order of size of Ln3+Β ions
are
La3+> Ce3+Β ............... >Lu3+
ii) Β Β There is regular decrease in their ionic radii.
iii) Β Β Regular decrease in their tendency to act as reducing agent, with increase in atomic number.
iv) Due to lanthanide contraction, second and third rows of d-block transistion Β elements are quite close in properties.
v) Due to lanthanide contraction, these elements occur together in natural minerals and are difficult to separate.
Study Material, Lecturing Notes, Assignment, Reference, Wiki description explanation, brief detail
11th 12th std standard Class Organic Inorganic Physical Chemistry Higher secondary school College Notes : General properties of Lanthanides |
Privacy Policy, Terms and Conditions, DMCA Policy and Compliant
Copyright Β© 2018-2023 BrainKart.com; All Rights Reserved. Developed by Therithal info, Chennai. | {
"url": "https://www.brainkart.com/article/General-properties-of-Lanthanides_2849/",
"source_domain": "www.brainkart.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "51552",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NXCXISKVMHLNUQQ5W2PGV4KCPDJ7BYE7",
"WARC-Concurrent-To": "<urn:uuid:84be2b11-2ac0-4ef4-a05f-bdcf63e65884>",
"WARC-Date": "2022-12-03T13:45:00Z",
"WARC-IP-Address": "68.178.145.35",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2T6JWJYFBOG5NZPWDU3XL7K67JXOJHJY",
"WARC-Record-ID": "<urn:uuid:57e08a83-4daa-4b75-8210-7cf707c56ad4>",
"WARC-Target-URI": "https://www.brainkart.com/article/General-properties-of-Lanthanides_2849/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bff7045f-6606-4c58-a523-a51c6daa0c92>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-51\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
55,
56,
169,
170,
204,
205,
239,
423,
424,
425,
501,
502,
824,
825,
827,
828,
873,
874,
920,
921,
922,
944,
945,
1278,
1279,
1280,
1314,
1315,
1316,
1344,
1345,
1503,
1504,
1524,
1525,
1718,
1719,
1745,
1746,
1780,
1781,
1811,
1812,
1845,
1846,
1886,
1887,
2091,
2092,
2124,
2125,
2497,
2498,
2537,
2538,
2555,
2556,
2861,
2862,
2866,
2867,
2900,
2901,
2956,
2957,
3058,
3059,
3180,
3181,
3296,
3297,
3298,
3397,
3539,
3540,
3541,
3605,
3606
],
"line_end_idx": [
55,
56,
169,
170,
204,
205,
239,
423,
424,
425,
501,
502,
824,
825,
827,
828,
873,
874,
920,
921,
922,
944,
945,
1278,
1279,
1280,
1314,
1315,
1316,
1344,
1345,
1503,
1504,
1524,
1525,
1718,
1719,
1745,
1746,
1780,
1781,
1811,
1812,
1845,
1846,
1886,
1887,
2091,
2092,
2124,
2125,
2497,
2498,
2537,
2538,
2555,
2556,
2861,
2862,
2866,
2867,
2900,
2901,
2956,
2957,
3058,
3059,
3180,
3181,
3296,
3297,
3298,
3397,
3539,
3540,
3541,
3605,
3606,
3701
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3701,
"ccnet_original_nlines": 78,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25797101855278015,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0072463802061975,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2289855033159256,
"rps_doc_frac_unique_words": 0.4264705777168274,
"rps_doc_mean_word_length": 5.28125,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0.0072463802061975,
"rps_doc_unigram_entropy": 4.950738906860352,
"rps_doc_word_count": 544,
"rps_doc_frac_chars_dupe_10grams": 0.18517228960990906,
"rps_doc_frac_chars_dupe_5grams": 0.20327183604240417,
"rps_doc_frac_chars_dupe_6grams": 0.18517228960990906,
"rps_doc_frac_chars_dupe_7grams": 0.18517228960990906,
"rps_doc_frac_chars_dupe_8grams": 0.18517228960990906,
"rps_doc_frac_chars_dupe_9grams": 0.18517228960990906,
"rps_doc_frac_chars_top_2gram": 0.031674209982156754,
"rps_doc_frac_chars_top_3gram": 0.03967978060245514,
"rps_doc_frac_chars_top_4gram": 0.05221023038029671,
"rps_doc_books_importance": -253.16864013671875,
"rps_doc_books_importance_length_correction": -253.16864013671875,
"rps_doc_openwebtext_importance": -145.368896484375,
"rps_doc_openwebtext_importance_length_correction": -145.368896484375,
"rps_doc_wikipedia_importance": -119.81608581542969,
"rps_doc_wikipedia_importance_length_correction": -119.81608581542969
},
"fasttext": {
"dclm": 0.14250320196151733,
"english": 0.872583270072937,
"fineweb_edu_approx": 2.8143393993377686,
"eai_general_math": 0.8988602757453918,
"eai_open_web_math": 0.5919374227523804,
"eai_web_code": 0.011554360389709473
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "546.7",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Chemistry",
"level_3": "Chemistry, Inorganic"
}
},
"secondary": {
"code": "546",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Chemistry",
"level_3": "Chemistry, Inorganic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "3",
"label": "Academic Writing"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 71f077df794da2774531b20248bb19b0 |
-6,738,546,002,674,765,000 | How git-annex replaces Dropbox + encfs with untrusted providers
git-annex has been around for a long time, but I just recently stumbled across some of the work Joey has been doing to it. This post isnβt about itβs traditional roots in git or all the features it has for partial copies of large data sets, but rather for its live syncing capabilities like Dropbox. It takes a bit to wrap your head around, because git-annex is just a little different from everything else. Itβs sort of like a different-colored smell.
The git-annex wiki has a lot of great information β both low-level reference and a high-level 10-minute screencast showing how easy it is to set up. I found I had to sort of piece together the architecture between those levels, so Iβm writing this all down hoping it will benefit others that are curious.
Ir you just want to use it, you donβt need to know all this. But I like to understand how my tools work.
Overview
git-annex lets you set up a live syncing solution that requires no central provider at all, or can be used with a completely untrusted central provider. Depending on your usage pattern, this central provider could require only a few MBs of space even for repositories containing gigabytes or terabytes of data that is kept in sync.
Letβs take a look at the high-level architecture of the tool. Then Iβll illustrate how it works with some scenarios.
Three Layers
Fundamentally, git-annex takes layers that are all combined in Dropbox and separates them out. There is the storage layer, which stores the literal data bytes that you are interested in. git-annex indexes the data in storage by a hash. There is metadata, which is for things like a filename-to-hash mapping and revision history. And then there is an optional layer, which is live signaling used to drive the real-time syncing.
git-annex has several modes of operation, and the one that enables live syncing is called the git-annex assistant. It runs as a daemon, and is available for Linux/POSIX platforms, Windows, Mac, and Android. Iβll be covering it here.
The storage layer
The storage layer simply is blobs of data. These blobs are indexed by a hash, and can be optionally encrypted at rest at remote backends. git-annex has a large number of storage backends; some examples include rsync, a remote machine with git-annex on it that has ssh installed, WebDAV, S3, Amazon Glacier, removable USB drive, etc. Thereβs a huge list.
One of the git-annex features is that each client knows the state of each storage repository, as well as the capability set of each storage repository. So letβs say you have a workstation at home and a laptop you take with you to work or the coffee shop. Youβd like changes on one to be instantly recognized on another. With something like Dropbox or OwnCloud, every file in the set you want synchronized has to reside on a server in the cloud. With git-annex, it can be configured such that the server in the cloud only contains a copy of a file until every client has synced it up, at which point it gets removed. Think about it β that is often what you want anyhow, so why maintain an unnecessary copy after itβs synced everywhere? (This behavior is, of course, configurable.) git-annex can also avoid storing in the cloud entirely if the machines are able to reach each other directly at least some of the time.
The metadata layer
Metadata about your files includes a mapping from the file names to the storage location (based on hashes), change history, and information about the status of each machine that participates in the syncing. On your clients, git-annex stores this using git. This detail is very useful to some, and irrelevant to others.
Some of the git-annex storage backends can support only storage (S3, for instance). Some can support both storage and metadata (rsync, ssh, local drives, etc.) You can even configure a backend to support only metadata (more on why that may be useful in a bit). When you are working with a git-backed repository for git-annex, it can hold data, metadata, or both.
So, to have a working sync system, you must have a way to transport both the data and the metadata. The transport for the metadata is generally rsync or git, but it can also be XMPP in which Git changesets are basically wrapped up in XMPP presence messages. Joey says, however, that there are some known issues with XMPP servers sometimes dropping or reordering some XMPP messages, so he doesnβt encourage that method currently.
The live signaling layer
So once you have your data and metadata, you can already do syncs via git annex sync --contents. But the real killer feature here will be automatic detection of changes, both on the local and the remote. To do that, you need some way of live signaling. git-annex supports two methods.
The first requires ssh access to a remote machine where git-annex is installed. In this mode of operation, when the git-annex assistant fires up, it opens up a persistent ssh connection to the remote and runs the git-annex-shell over there, which notifies it of changes to the git metadata repository. When a change is detected, a sync is initiated. This is considered ideal.
A substitute can be XMPP, and git-annex actually converts git commits into a form that can be sent over XMPP. As I mentioned above, there are some known reliability issues with this and it is not the recommended option.
Encryption
When it comes to encryption, you generally are concerned about all three layers. In an ideal scenario, the encryption and decryption happens entirely on the client side, so no service provider ever has any details about your data.
The live signaling layer is encrypted pretty trivially; the ssh sessions are, of course, encrypted and TLS support in XMPP is pervasive these days. However, this is not end-to-end encryption; those messages are decrypted by the service provider, so a service provider could theoretically spy on metadata, which may include change times and filenames, though not the contents of files themselves.
The data layer also can be encrypted very trivially. In the case of the βdumbβ backends like S3, git-annex can use symmetric encryption or a gpg keypair and all that ever shows up on the server are arbitrarily-named buckets.
You can also use a gcrypt-based git repository. This can cover both data and metadata β and, if the target also has git-annex installed, the live signalling layer. Using a gcrypt-based git repository for the metadata and live signalling is the only way to accomplish live syncing with 100% client-side encryption.
All of these methods are implemented in terms of gpg, and can support symmetric of public-key encryption.
It should be noted here that the current release versions of git-annex need a one-character patch in order to fix live syncing with a remote using gcrypt. For those of you running jessie, I recommend the version in jessie-backports, which is presently 5.20151208. For your convenience, I have compiled an amd64 binary that can drop in over /usr/bin/git-annex if you have this version. You can download it and a gpg signature for it. Note that you only need this binary on the clients; the server can use the version from jessie-backports without issue.
Putting the pieces together: some scenarios
Now that Iβve explained the layers, letβs look at how they fit together.
Scenario 1: Central server
In this scenario, you might have a workstation and a laptop that sync up with each other by way of a central server that also has a full copy of the data. This is the scenario that most closely resembles Dropbox, box, or OwnCloud.
Here you would basically follow the steps in the git-assistant screencast: install git-annex on a server somewhere, and point your clients to it. If you want full end-to-end encryption, I would recommend letting git-annex generate a gpg keypair for you, which you would then need to copy to both your laptop and workstation (but not the server).
Every change you make locally will be synced to the server, and then from the server to your other PC. All three systems would be configured in the βclientβ transfer group.
Scenario 1a: Central server without a full copy of the data
In this scenario, everything is configured the same except the central server is configured with the βtransferβ transfer group. This means that the actual data synced to it is deleted after it has been propagated to all clients. Since git-annex can verify which repository has received a copy of which data, it can easily enough delete the actual file content from the central server after it has been copied to all the clients. Many people use something like Dropbox or OwnCloud as a multi-PC syncing solution anyhow, so once the files have been synced everywhere, it makes sense to remove them from the central server.
This is often a good ideal for people. There are some obvious downsides that are sometimes relevant. For instance, to add a third sync client, it must be able to initially copy down from one of the existing clients. Or, if you intend to access the data from a device such as a cell phone where you donβt intend for it to have a copy of all data all the time, you wonβt have as convenient way to download your data.
Scenario 1b: Split data/metadata central servers
Imagine that you have a shell or rsync account on some remote system where you can run git-annex, but donβt have much storage space. Maybe you have a cheap VPS or shell account somewhere, but itβs just not big enough to hold your data.
The answer to this would be to use this shell or rsync account for the metadata, but put the data elsewhere. You could, for instance, store the data in Amazon S3 or Amazon Glacier. These backends arenβt capable of storing the git-annex metadata, so all you need is a shell or rsync account somewhere to sync up the metadata. (Or, as below, you might even combine a fully distributed approach with this.) Then you can have your encrypted data pushed up to S3 or some such service, which presumably will grow to whatever size you need.
Scenario 2: Fully distributed
Like git itself, git-annex does not actually need a central server at all. If your different clients can reach each other directly at least some of the time, that is good enough. Of course, a given client will not be able to do fully automatic live sync unless it can reach at least one other client, so changes may not propagate as quickly.
You can simply set this up by making ssh connections available between your clients. git-annex assistant can automatically generate appropriate ~/.ssh/authorized_keys entries for you.
Scenario 2a: Fully distributed with multiple disconnected branches
You can even have a graph of connections available. For instance, you might have a couple machines at home and a couple machines at work with no ability to have a direct connection between them (due to, say, firewalls). The two machines at home could sync with each other in real-time, as could the two machines at work. git-annex also supports things like USB drives as a transport mechanism, so you could throw a USB drive in your pocket each morning, pop it in to one client at work, and poof β both clients are synced up over there. Repeat when you get home in the evening, and youβre synced there. The USB driveβs repository can, of course, be of the βtransportβ type so data is automatically deleted from it once itβs been synced everywhere.
Scenario 3: Hybrid
git-annex can support LAN sync even if you have a central server. If your laptop, say, travels around but is sometimes on the same LAN as your PC, git-annex can easily sync directly between the two when they are reachable, saving a round-trip to the server. You can assign a cost to each remote, and git-annex will always try to sync first to the lowest-cost path that is available.
Drawbacks of git-annex
There are some scenarios where git-annex with the assistant wonβt be as useful as one of the more traditional instant-sync systems.
The first and most obvious one is if you want to access the files without the git-annex client. For instance, many of the other tools let you generate a URL that you can email to people, and then they can download files without any special client software. This is not directly possible with git-annex. You could, of course, make something like a public_html directory be managed with git-annex, but it wouldnβt provide things like obfuscated URLs, password-protected sharing, time-limited sharing, etc. that you get with other systems. While you can share your repositories with others that have git-annex, you canβt share individual subdirectories; for a given repository, it is all or nothing.
The Android client for git-annex is a pretty interesting thing: it is mostly a small POSIX environment, providing a terminal, git, gpg, and the same web interface that you get on a standalone machine. This means that the git-annex Android client is fully functional compared to a desktop one. It also has a quick setup process for syncing off your photos/videos. On the other hand, the integration with the Android ecosystem is poor compared to most other tools.
Other git-annex features
git-annex has a lot to offer besides the git-annex assistant. Besides the things Iβve already mentioned, any given git-annex repository β including your client repository β can have a partial copy of the full content. Say, for instance, that you set up a git-annex repository for your music collection, which is quite large. You want some music on your netbook, but donβt have room for it all. You can tell git-annex to get or drop files from the netbookβs repository without deleting them remotely. git-annex has quite a few ways to automate and configure this, including making sure that at least a certain number of copies of a file exist in your git-annex ecosystem.
Conclusion
I initially started looking at git-annex due to the security issues with encfs, and the difficulty with setting up ecryptfs in this way. (I had been layering encfs atop OwnCloud). git-annex certainly ticks the box for me security-wise, and obviously anything encrypted with encfs wasnβt going to be shared with others anyhow. Iβll be using git-annex more in the future, Iβm sure.
Update 2016-06-27: I had some issues with git-annex in this configuration.
1 thought on βHow git-annex replaces Dropbox + encfs with untrusted providers
Leave a Reply
Your email address will not be published.
This site uses Akismet to reduce spam. Learn how your comment data is processed. | {
"url": "https://changelog.complete.org/archives/9669-how-git-annex-replaces-dropbox-encfs-with-untrusted-providers",
"source_domain": "changelog.complete.org",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "78251",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RVMYW3FPGGSO7QE7UEQRB6WHQ4AB63WR",
"WARC-Concurrent-To": "<urn:uuid:b0301abe-98e2-4f37-be58-1a511a99541d>",
"WARC-Date": "2022-07-02T05:51:38Z",
"WARC-IP-Address": "142.4.200.132",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZLJ675HJY2Q7FKGBV7PWVTTWG3LTNIQY",
"WARC-Record-ID": "<urn:uuid:fccae079-2d62-4ceb-b9b3-d62f1cc94fc2>",
"WARC-Target-URI": "https://changelog.complete.org/archives/9669-how-git-annex-replaces-dropbox-encfs-with-untrusted-providers",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4226870b-333f-4df8-b111-62028d1619f9>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-103\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
64,
65,
518,
519,
824,
825,
930,
931,
940,
941,
1273,
1274,
1391,
1392,
1405,
1406,
1833,
1834,
2067,
2068,
2086,
2087,
2441,
2442,
3358,
3359,
3378,
3379,
3698,
3699,
4062,
4063,
4492,
4493,
4518,
4519,
4804,
4805,
5181,
5182,
5402,
5403,
5414,
5415,
5646,
5647,
6043,
6044,
6269,
6270,
6584,
6585,
6691,
6692,
7245,
7246,
7290,
7291,
7364,
7365,
7392,
7393,
7624,
7625,
7971,
7972,
8145,
8146,
8206,
8207,
8828,
8829,
9244,
9245,
9294,
9295,
9531,
9532,
10066,
10067,
10097,
10098,
10440,
10441,
10625,
10626,
10693,
10694,
11442,
11443,
11462,
11463,
11846,
11847,
11870,
11871,
12003,
12004,
12701,
12702,
13165,
13166,
13191,
13192,
13863,
13864,
13875,
13876,
14256,
14257,
14332,
14333,
14411,
14412,
14426,
14427,
14469,
14470
],
"line_end_idx": [
64,
65,
518,
519,
824,
825,
930,
931,
940,
941,
1273,
1274,
1391,
1392,
1405,
1406,
1833,
1834,
2067,
2068,
2086,
2087,
2441,
2442,
3358,
3359,
3378,
3379,
3698,
3699,
4062,
4063,
4492,
4493,
4518,
4519,
4804,
4805,
5181,
5182,
5402,
5403,
5414,
5415,
5646,
5647,
6043,
6044,
6269,
6270,
6584,
6585,
6691,
6692,
7245,
7246,
7290,
7291,
7364,
7365,
7392,
7393,
7624,
7625,
7971,
7972,
8145,
8146,
8206,
8207,
8828,
8829,
9244,
9245,
9294,
9295,
9531,
9532,
10066,
10067,
10097,
10098,
10440,
10441,
10625,
10626,
10693,
10694,
11442,
11443,
11462,
11463,
11846,
11847,
11870,
11871,
12003,
12004,
12701,
12702,
13165,
13166,
13191,
13192,
13863,
13864,
13875,
13876,
14256,
14257,
14332,
14333,
14411,
14412,
14426,
14427,
14469,
14470,
14550
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 14550,
"ccnet_original_nlines": 118,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4480604827404022,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01479289960116148,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14924392104148865,
"rps_doc_frac_unique_words": 0.27878788113594055,
"rps_doc_mean_word_length": 4.688889026641846,
"rps_doc_num_sentences": 130,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.591900825500488,
"rps_doc_word_count": 2475,
"rps_doc_frac_chars_dupe_10grams": 0.007238260004669428,
"rps_doc_frac_chars_dupe_5grams": 0.027574319392442703,
"rps_doc_frac_chars_dupe_6grams": 0.01895735040307045,
"rps_doc_frac_chars_dupe_7grams": 0.015855230391025543,
"rps_doc_frac_chars_dupe_8grams": 0.007238260004669428,
"rps_doc_frac_chars_dupe_9grams": 0.007238260004669428,
"rps_doc_frac_chars_top_2gram": 0.006031880155205727,
"rps_doc_frac_chars_top_3gram": 0.0031021100003272295,
"rps_doc_frac_chars_top_4gram": 0.004911679774522781,
"rps_doc_books_importance": -1256.831787109375,
"rps_doc_books_importance_length_correction": -1256.831787109375,
"rps_doc_openwebtext_importance": -823.6865234375,
"rps_doc_openwebtext_importance_length_correction": -823.6865234375,
"rps_doc_wikipedia_importance": -567.0606079101562,
"rps_doc_wikipedia_importance_length_correction": -567.0606079101562
},
"fasttext": {
"dclm": 0.13918477296829224,
"english": 0.9321603775024414,
"fineweb_edu_approx": 1.877787709236145,
"eai_general_math": 0.7209973335266113,
"eai_open_web_math": 0.2382369041442871,
"eai_web_code": 0.3396546244621277
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 71f077df794da2774531b20248bb19b0 |
-5,509,796,025,102,000,000 | [Numpy-discussion] searchsorted() and memory cache
Nathan Bell wnbell@gmail....
Tue May 13 20:44:01 CDT 2008
On Tue, May 13, 2008 at 6:59 PM, Andrew Straw <[email protected]> wrote:
> easier and still blazingly fast compared to the binary search
> implemented in searchsorted() given today's cached memory architectures.
Andrew, I looked at your code and I don't quite understand something.
Why are you looking up single values?
Is it not the case that the overhead of several Python calls
completely dominates the actual cost of performing a binary search
(e.g. in C code)? For instance, the 'v' argument of searchsorted(a,v)
can be an array:
from scipy import *
haystack = rand(1e7)
needles = haystack[:10000].copy()
haystack.sort()
timeit searchsorted(haystack, needles)
100 loops, best of 3: 12.7 ms per loop
Which seems to be much faster than:
timeit for k in needles: x = searchsorted(haystack,k)
10 loops, best of 3: 43.8 ms per loop
The other thing to consider is that a reasonably smart CPU cache
manager may retain the first few levels that are explored in a binary
search tree. Clearly you could speed this up by increasing the
branching factor of the tree, or using a fast index into the large
array. However, I think that these effects are being masked by Python
overhead in your tests.
I whipped up a weave implementation of searchsorted() that uses the
STL. It clocks in at 9.72ms per loop, so I think NumPy's
searchsorted() is fairly good.
import scipy
import scipy.weave
def searchsorted2(a,v):
N_a = len(a)
N_v = len(v)
indices = scipy.empty(N_v, dtype='intc')
code = """
for(int i = 0; i < N_v; i++){
indices(i) = lower_bound(&a(0), &a(N_a), v(i)) - &a(0);
}
"""
err = scipy.weave.inline(code,
['a','v','N_a', 'N_v','indices'],
type_converters = scipy.weave.converters.blitz,
compiler = 'gcc',
support_code = '#include <algo.h>')
return indices
--
Nathan Bell [email protected]
http://graphics.cs.uiuc.edu/~wnbell/
More information about the Numpy-discussion mailing list | {
"url": "https://mail.scipy.org/pipermail/numpy-discussion/2008-May/033849.html",
"source_domain": "mail.scipy.org",
"snapshot_id": "crawl=CC-MAIN-2015-48",
"warc_metadata": {
"Content-Length": "4855",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LEWQ7LH7LCDK4XE34QEQRPFLSGVK72QD",
"WARC-Concurrent-To": "<urn:uuid:3c4735a0-7ef8-4aa0-81a2-092ff148dec8>",
"WARC-Date": "2015-11-30T04:34:37Z",
"WARC-IP-Address": "23.253.247.54",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:IFMRFXKAM3UFINUXB4M346XJ7UPI55LA",
"WARC-Record-ID": "<urn:uuid:54e58ae0-d7ea-4ddd-baf6-ab264b5a9d94>",
"WARC-Target-URI": "https://mail.scipy.org/pipermail/numpy-discussion/2008-May/033849.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:728bb524-8aa3-4f41-9b89-3bb14e0b40bd>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-71-132-137.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for Nov 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
51,
52,
81,
110,
111,
112,
187,
252,
328,
329,
399,
437,
438,
499,
566,
637,
654,
655,
679,
704,
742,
762,
805,
806,
849,
850,
886,
887,
945,
946,
988,
989,
990,
1055,
1125,
1189,
1256,
1327,
1351,
1352,
1420,
1478,
1509,
1510,
1511,
1524,
1543,
1544,
1568,
1585,
1602,
1647,
1648,
1663,
1697,
1759,
1765,
1773,
1774,
1809,
1872,
1949,
1996,
2061,
2062,
2081,
2082,
2083,
2087,
2116,
2153,
2154,
2155
],
"line_end_idx": [
51,
52,
81,
110,
111,
112,
187,
252,
328,
329,
399,
437,
438,
499,
566,
637,
654,
655,
679,
704,
742,
762,
805,
806,
849,
850,
886,
887,
945,
946,
988,
989,
990,
1055,
1125,
1189,
1256,
1327,
1351,
1352,
1420,
1478,
1509,
1510,
1511,
1524,
1543,
1544,
1568,
1585,
1602,
1647,
1648,
1663,
1697,
1759,
1765,
1773,
1774,
1809,
1872,
1949,
1996,
2061,
2062,
2081,
2082,
2083,
2087,
2116,
2153,
2154,
2155,
2211
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2211,
"ccnet_original_nlines": 73,
"rps_doc_curly_bracket": 0.0009045699844136834,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2612244784832001,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020408159121870995,
"rps_doc_frac_lines_end_with_ellipsis": 0.01351351011544466,
"rps_doc_frac_no_alph_words": 0.3510203957557678,
"rps_doc_frac_unique_words": 0.658450722694397,
"rps_doc_mean_word_length": 5.214788913726807,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0.004081630147993565,
"rps_doc_unigram_entropy": 5.0193610191345215,
"rps_doc_word_count": 284,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.024307899177074432,
"rps_doc_frac_chars_top_3gram": 0.010803510434925556,
"rps_doc_frac_chars_top_4gram": 0.01620526984333992,
"rps_doc_books_importance": -260.6838684082031,
"rps_doc_books_importance_length_correction": -260.6838684082031,
"rps_doc_openwebtext_importance": -142.7017059326172,
"rps_doc_openwebtext_importance_length_correction": -142.7017059326172,
"rps_doc_wikipedia_importance": -91.78765869140625,
"rps_doc_wikipedia_importance_length_correction": -91.78765869140625
},
"fasttext": {
"dclm": 0.6199139952659607,
"english": 0.8174376487731934,
"fineweb_edu_approx": 2.0559613704681396,
"eai_general_math": 0.9323893785476685,
"eai_open_web_math": 0.171170175075531,
"eai_web_code": 0.3213278651237488
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 71f077df794da2774531b20248bb19b0 |
-5,562,905,444,132,178,000 | Search Images Maps Play YouTube News Gmail Drive More Β»
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.
Patents
1. Advanced Patent Search
Publication numberUS4053739 A
Publication typeGrant
Application numberUS 05/713,470
Publication dateOct 11, 1977
Filing dateAug 11, 1976
Priority dateAug 11, 1976
Also published asCA1097407A1, DE2735204A1, DE2735204C2
Publication number05713470, 713470, US 4053739 A, US 4053739A, US-A-4053739, US4053739 A, US4053739A
InventorsRobert Lynn Miller, Robert Neal Weisshappel
Original AssigneeMotorola, Inc.
Export CitationBiBTeX, EndNote, RefMan
External Links:Β USPTO, USPTO Assignment, Espacenet
Dual modulus programmable counter
US 4053739 A
Abstract
The inventive counter is operable to divide an input signal by the sum of two binary numbers, A and B. Each number is stored in memory. These numbers are alternately preset into a binary counter which also receives the input signal. A logic gate monitors the counter output and changes state when the number previously preset in the counter equals the accumulated count. The gate state transition is used to preset the counter with the alternate stored number. Thus, the process continues whereby the output from the logic gate represents the input signal divided by the sum of A and B.
Images(1)
Previous page
Next page
Claims(5)
We claim:
1. A multiple modulus counter for dividing a signal having a frequency f by a divisor N = M1 + M2 + . . . + Mx, where N, M1, M2, . . . , Mx are selected numbers, comprising:
counter means including an input for receiving the signal to be divided, an output for producing a signal representative of the count of signals received at the input, and means to input a preset count state;
a plurality of Mx preset means, each actuable to preset one of the numbers M1 . . . Mx into the counter means;
control means responsive to the count state at the counter output to sequentially actuate a successive one of the preset means in response to the counter counting to the count preset into the counter by the preceding preset means, the control means producing an output waveform having transitions corresponding to the actuation of predetermined preset means,
whereby the control means output waveform is of a frequency f/N.
2. A dual modulus counter for dividing a signal having a frequency f by a divisor N = A + B, where N, A and B are selected numbers, comprising:
counter means including an input for receiving the signal to be divided, an output for producing a signal representative of the count of signals received at the input, and means to input a preset count state;
first preset means actuable to preset the count A in the counter means;
second preset means actuable to preset the count B in the counter means; and
control means responsive to the count state at the counter output to sequentially actuate the second and first preset means in response to the counter counting the numbers A and B, respectively, the control means producing an output waveform having transitions at the times of actuating the first and second preset means,
whereby the control means output waveform is of a frequency f/N.
3. A frequency synthesizer comprising:
a reference signal source for generating a reference signal of frequency f;
a phase comparator for producing at its output an error signal representative of the phase difference of signals received at its input;
means for coupling the reference signal source to the first phase comparator input;
a signal controlled oscillator for producing an oscillator signal of predetermined frequency at its output responsive to a received control signal;
means for processing the phase comparator error signal and producing a control signal in response thereto;
means for coupling the produced control signal to the signal controlled oscillator;
prescaler means actuable to frequency divide the oscillator signal by one of two predetermined divisors P, P';
a dual modulus divider for frequency dividing the output from the prescaler by alternate stored divisors A and B, where A and B are selected numbers, the dual modulus divisor including means to actuate the prescaler means from its P divisor to its P' divisor upon transition from the A divisor to the B divisor and from its P' divisor to its P divisor upon transition from the B divisor to the A divisor; and
means for coupling the output from the dual modulus divider to the comparator second input,
whereby the oscillator signal tends to assume the frequency f/(AP + BP').
4. The frequency synthesizer of claim 3 wherein P' = P + 1.
5. The frequency divisor of claim 3 wherein the dual modulus divider comprises:
counter means including an input for receiving the prescaler output signal, an output for producing a signal representative of the count of signals received at the input, and means to input a preset count state;
first preset means actuable to preset the count A in the counter means;
second preset means actuable to preset the count B in the counter means; and
control means responsive to the count state at the counter output to sequentially actuate the second and first preset means in response to the counter counting the numbers A and B, respectively, the control means producing an output waveform having transitions at the times of actuating the first and second preset means.
Description
BACKGROUND OF THE INVENTION
The present invention pertains to the electronic signal processing art and, in particular, to a programmable frequency counter.
Programmable frequency counters have been well known in the electronic processing art, particularly in the frequency synthesizer field. Frequency synthesizers commonly employ standard phase lock loop circuitry wherein a reference frequency oscillator signal may be divided by a selected one of a plurality of divisors thus providing an output signal of desired frequency. Previous techniques employed in digital frequency synthesizers have used, in the feedback portion of a conventional phase lock loop, a variable prescaler, and first and second counters. The first counter has been programmable and is used to divide the output of the variable prescaler by a fixed number (N). The second counter, often referred to as a swallow counter, has been used to switch the variable prescaler to a new divisor, or modulus, which new modulus is present during the counting of "N". As is discussed at page 10-3 of the Motorola "McMOS HANDBOOK", printed 1974 by Motorola, Inc., the total divisor NT of the feedback loop is given by:
NT = (P + 1)A + P(N - A)
where, the variable modulus prescaler operates between two divisors P and P+1, the swallow counter has a fixed divisor A, and the programmable divider has the divisor N.
While the above described frequency synthesizer provided the desired function, it requires a large number of parts and thus is expensive to manufacture. It is desirable, therefore, to provide the frequency synthesizer function using fewer parts.
SUMMARY OF THE INVENTION
It is an object of this invention, therefore, to provide an improved dual modulus programmable counter which is particularly suited for application in frequency synthesizers.
It is a particular object of the invention to provide the above dual modulus programmable counter which employs a minimum of components and, therefore, results in a minimum cost.
Briefly, according to the invention, a multiple modulus divider divides a signal having a frequency f by a divisor N = N1 + M2 + . . . + Mx, where N, M1, M2, . . . , Mx are selected numbers. The improved counter comprises a counter means which includes an input for receiving the signal to be divided, an output for producing a signal representative of the count of signals received at the input, and means to input a preset count state. Also included are a plurality of Mx preset means, each of which is actuable to preset one of the numbers M1 . . . Mx into the counter means. A control means responds to the count state at the counter output to sequentially actuate successive ones of the preset means in response to the counter counting to the count preset into the counter by the preceeding preset means. The control means produces an output waveform having transitions corresponding to the actuation of the predetermined preset means whereby the control means output waveform is of a frequency f/N.
The improved dual modulus programmable counter may be used in combination with further components to comprise a frequency synthesizer. In particular, additional frequency synthesizer components comprise a reference signal source for generating a reference signal frequency f. This signal is coupled, via appropriate means, to the first input of a phase comparator which compares this signal to the signal received at its second input, and produces an error signal representative of the phase difference therebetween at its output. The phase comparator error signal is processed for application to the control signal of a signal controlled oscillator which, in turn, responds by producing an oscillator signal of predetermined frequency. The output from the signal controlled oscillator couples to a prescaler which is actuable to frequency divide the oscillator signal by one of two predetermined divisors P, P'. The aforementioned dual modulus divider frequency divides the output from the prescaler by alternate stored divisors A and B, where A and B are selected numbers. The divisor includes means to actuate the prescaler means from its P divisor to its P' divisor upon transition from the A divisor to the B divisor, and from its P' divisor to its P divisor upon transition from the B divisor to the A divisor. The output from the divider is coupled to the comparator second input whereby the oscillator signal tends to assume the frequency f/(AP' + BP).
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a schematic diagram illustrating the inventive dual modulus counter; and
FIG. 2 is a schematic diagram illustrating a frequency synthesizer which employs the inventive counter.
DESCRIPTION OF THE PREFERRED EMBODIMENT OF THE INVENTION
Referring to FIG. 1, a signal of frequency f, which is to be divided by a divisor N, is applied at the input 12 of a standard binary counter 10. The binary counter 10, operating in the well known manner, produces a signal at its output terminal 14 in response to a predetermined count of the input signal f. The binary counter 10 also has preset count input terminals 16, 18. A binary number coupled to one of the preset count inputs 16, 18 will activate the counter 10 to the binary number. In the present preferred embodiment of the invention, binary counter 10 is of the count-down type which means that a count state preset at the input terminals 16 or 18 will be decremated one count for each received input pulse at input 12. The binary counter 10 responds to counting down to a zero count state by changing its output logic state at output terminal 14.
A change in the output state at output 14 of binary counter 10 activates the "C" input 22 of a conventional control flip-flop 24. Flip-flop 24 has a first "Q" output 26 and a second "Q" output 28. The control flip-flop 24 responds to transition state changes at its input 22 to alternately activate the Q output 26 high and low, with the Q output 28 correspondingly low and high.
The Q output 28 of the flip-flop 24 couples to the input terminals 32, 42 of a pair of preset storage registers 30, 40, respectively. Each register 30, 40 is programmed to contain a preset number. In this case preset register 30 contains the number A and preset register 40 contains the number B. Upon suitable activation at their inputs 32, 42 each register 30, 40 applies the number stored therein to the preset input terminals 16, 18 of the binary counter 10, activating the count in the same to the appropriate number A, B. Each number A, B corresponds to a modulus with which the input signal f will be divided. In this preferred embodiment of the invention a dual modulus system is provided. Thus, there are two preset registers 30, 40 each containing the number A, B respectively. In a generalized system, any one of a number of divisors of modulus M1 + M2 + . . . + Mx might be used, in which case there would be a preset register for each, each containing the appropriate number M1, M2, . . . Mx. For purposes of clarity the following discussion deals primarily with a dual modulus counter. Nonetheless, it should be understood that anyone of ordinary skill in the art could practice the invention by constructing a counter having more than two moduli.
Operation of the dual modulus programmable counter of FIG. 1 may be understood as follows.
Assume initially that the Q output 28 of the flip-flop 24 has activated preset register 30 to place the count A into the binary counter 10. Thus, each successive count of the input signal f reduces the counter by one whereby, finally, the counter reaches a count of zero. At this time the counter output 14 makes a transition thereby activating the control input 22 of the flip-flop 24. At this point the Q output 26 and Q output 28 of flip-flop 24 make a transition to the opposite logic state. This transition causes the second preset register 40 to input the count B into the binary counter 10. Now successive input counts at input 12 of binary counter 10 due to the input signal f reduce the count state of the counter 10 until it again reaches zero, at which point an output transition at output 14 once again activates the control input 22 of the flip-flop 24, thus activating preset register 30 to again input the count A into the binary counter 10.
Henceforth, the cycle repeats and the Q output 26 of the flip-flop 24 assumes a waveform having a frequency f/N, where N = A + B. Thus, with a minimum of components at input signal f is divided by two moduli A, B, thereby dividing the input signal f by the sum of the two moduli, N. As is discussed with reference to FIG. 2, the fact that the control flip-flop 24 produces an output transition after the A count period renders the instant dual modulus programmable counter extremely useful in frequency synthesizer applications.
FIG. 2 illustrates the preferred embodiment of a frequency synthesizer which employs the novel dual modulus programmable counter. There a standard phase lock loop chain includes a reference oscillator 100 which produces a reference signal of frequency f. The signal f is fed to the first input 112 of a phase detector 110. Phase detector 110 has a second input 114 and an output 116. Acting in the conventional manner, the phase detector 110 produces an error signal at its output 116, which error signal is representative of the phase difference between signals received at the input terminals 112, 114.
In the conventional manner, the output error signal at output terminal 116 is low pass filtered through a low pass filter circuit 118 and applied to the control input 122 of a voltage controlled oscillator 120. The voltage controlled oscillator 120 produces an oscillator signal of predetermined frequency at its output 124 responsive to a control signal received at its control input 122. This oscillator output signal is the output signal fout of the frequency synthesizer.
The output terminal 124 of the voltage controlled oscillator 120 also feeds to the input terminal 132 of a variable modulus prescaler 130. The variable modulus prescaler 130 responds to a signal at its divisor input 134 to divide signals received at its input terminal 132 by either one of two moduli P, or P' reproducing the output frequency divided signal at its output terminal 136. In the preferred embodiment of the invention, P' = P + 1, however it should be understood that the selection of the P' modulus is one of individual designer's choice. The frequency divided output 136 of the variable modulus prescaler 130 is applied to the input terminal 142 of the dual modulus programmable counter 150. The dual modulus programmable counter 150 is seen to be identical to the preferred embodiment thereof illustrated in FIG. 1. For example, input terminal 142 is the input of a binary counter 140 corresponding to the binary counter 10 of FIG. 1. Binary counter 140 has an output 144 which feeds to the control input 152 of a control flip-flop 154. The control flip-flop 154 has a Q output 156 and a Q output 158. The Q output 158 actuates the inputs 162, 172 of the preset storage registers 160, 170 respectively. As before, each preset register 160, 170 contains preset numbers A, B, respectively, which, upon actuation via the input terminals 162, 172 feed their corresponding number into the binary counter 140 via the preset input terminals 146, 148.
The Q output 156 of the flip-flop 154 feeds to the modulus control terminal 134 of the variable modulus prescaler 130. A transition in logic state at input 134 causes the variable modulus prescaler 130 to alternate between the P and P+1 divisors. Finally, the Q output 158 of the control flip-flop 154 feeds to the second input 114 of the phase comparator 110.
Operation of the frequency synthesizer of FIG. 2 is understood as follows.
The reference oscillator 100 feeds a signal of frequency f to the first input 112 of the phase detector 110. Phase detector 110, in turn, produces an error signal at its output 116 which, when low pass filtered via the filter 118, controls the voltage controlled oscillator 120. The oscillator output signal from the voltage controlled oscillator 120 is frequency divided by the variable modulus prescaler 130. Assuming that the variable modulus prescaler 130 is activated to its P modulus, the variable modulus prescaler 130 will produce an output transition at its output terminal 136 when it has counted P counts in the oscillator signal. At this time the first count is received by the binary counter 140 at its input 142. Stored within the binary counter 140 initially is the binary number A. Thus, this binary preset count is decremented by one count. This process continues until the variable modulus prescaler 130 counts to the number P, A times. After the binary counter 140 has counted down from its preset input A, it produces an output at output terminal 144 which in turn is applied to the control input 152 of the control flip-flop 144. This transition at the control input 152 causes the Q output 156 and Q output 158 to flip to their opposite states. Thus, the Q output 156 activates the variable modulus prescaler 130 to begin dividing by its second modulus P+1. Also, the Q output 158 causes the number B stored in register 170 to be fed into the binary counter 40. Now, the binary counter 140 does not change its output state at its output terminal 144 until the variable modulus prescaler has counted P+1 counts a total of B times.
Thereafter, the cycle repeats whereby the waveform at the Q output 158 of the flip-flop 154 is of a frequency fout /Nt, where Nt = A(P) + B(P+1). Now, in the conventional manner, the waveform fout /Nt is phase compared with the reference oscillator 100 signal f, whereby the two tend to phase lock producing the output signal fout = f/NT.
Thus, the dual modulus programmable counter 150 replaces the variable counter and the swallow counter of the prior art when used in a frequency synthesizer which provides an output signal which is the frequency division of a reference signal. Since the inventive dual modulus programmable counter does not require both a programmable counter, and a swallow counter, as has been known in the prior art, a significant reduction in parts count, and thus cost, has been achieved.
While a preferred embodiment of the invention has been described in detail, it should be understood that many modifications and variations thereto are possible, all of which fall within the true spirit and scope of the invention.
Patent Citations
Cited PatentFiling datePublication dateApplicantTitle
US3353104 *Jun 14, 1965Nov 14, 1967Ltv Electrosystems IncFrequency synthesizer using fractional division by digital techniques within a phase-locked loop
US3594551 *Nov 29, 1966Jul 20, 1971Electronic CommunicationsHigh speed digital counter
US3605025 *Jun 30, 1969Sep 14, 1971Sperry Rand CorpFractional output frequency-dividing apparatus
US3714589 *Dec 1, 1971Jan 30, 1973Lewis RDigitally controlled phase shifter
US3959737 *Nov 18, 1974May 25, 1976Engelmann Microwave Co.Frequency synthesizer having fractional frequency divider in phase-locked loop
US3982199 *Jan 6, 1975Sep 21, 1976The Bendix CorporationDigital frequency synthesizer
Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US4184068 *Nov 14, 1977Jan 15, 1980Harris CorporationFull binary programmed frequency divider
US4231104 *Apr 26, 1978Oct 28, 1980Teradyne, Inc.Generating timing signals
US4241408 *Apr 4, 1979Dec 23, 1980Norlin Industries, Inc.High resolution fractional divider
US4316151 *Feb 13, 1980Feb 16, 1982Motorola, Inc.Phase locked loop frequency synthesizer using multiple dual modulus prescalers
US4325031 *Feb 13, 1980Apr 13, 1982Motorola, Inc.Divider with dual modulus prescaler for phase locked loop frequency synthesizer
US4327623 *Mar 31, 1980May 4, 1982Nippon Gakki Seizo Kabushiki KaishaReference frequency signal generator for tuning apparatus
US4330751 *Dec 3, 1979May 18, 1982Norlin Industries, Inc.Programmable frequency and duty cycle tone signal generator
US4357527 *Jan 25, 1979Nov 2, 1982Tokyo Shibaura Denki Kabushiki KaishaProgrammable divider
US4390960 *Nov 21, 1980Jun 28, 1983Hitachi, Ltd.Frequency divider
US4468797 *Feb 3, 1982Aug 28, 1984Oki Electric Industry Co., Ltd.Swallow counters
US4559613 *Jun 29, 1982Dec 17, 1985The United States Of America As Represented By The Secretary Of The Air ForceDigital frequency synthesizer circuit
US4574385 *Feb 16, 1984Mar 4, 1986Rockwell International CorporationClock divider circuit incorporating a J-K flip-flop as the count logic decoding means in the feedback loop
US4651334 *Dec 24, 1984Mar 17, 1987Hitachi, Ltd.Variable-ratio frequency divider
US4658406 *Aug 12, 1985Apr 14, 1987Andreas PappasDigital frequency divider or synthesizer and applications thereof
US4891825 *Feb 9, 1988Jan 2, 1990Motorola, Inc.Fully synchronized programmable counter with a near 50% duty cycle output signal
US5065415 *Feb 21, 1990Nov 12, 1991Nihon Musen Kabushiki KaishaProgrammable frequency divider
US5066927 *Sep 6, 1990Nov 19, 1991Ericsson Ge Mobile Communication Holding, Inc.Dual modulus counter for use in a phase locked loop
US5195111 *Aug 13, 1991Mar 16, 1993Nihon Musen Kabushiki KaishaProgrammable frequency dividing apparatus
US5202906 *Dec 23, 1987Apr 13, 1993Nippon Telegraph And Telephone CompanyFrequency divider which has a variable length first cycle by changing a division ratio after the first cycle and a frequency synthesizer using same
US5235531 *Dec 13, 1991Aug 10, 1993Siemens AktiengesellschaftMethod and arrangement for dividing the frequency of an alternating voltage with a non-whole-numbered division factor
US5495505 *Dec 20, 1990Feb 27, 1996Motorola, Inc.Increased frequency resolution in a synthesizer
US5781459 *Apr 16, 1996Jul 14, 1998Bienz; Richard AlanMethod and system for rational frequency synthesis using a numerically controlled oscillator
US5842006 *Sep 6, 1995Nov 24, 1998National Instruments CorporationCounter circuit with multiple registers for seamless signal switching
US6035182 *Jan 20, 1998Mar 7, 2000Motorola, Inc.Single counter dual modulus frequency division apparatus
US6072404 *Apr 29, 1997Jun 6, 2000Eaton CorporationUniversal garage door opener
US6725245May 3, 2002Apr 20, 2004P.C. Peripherals, IncHigh speed programmable counter architecture
USRE32605 *Jun 28, 1985Feb 16, 1988Hitachi, Ltd.Frequency divider
WO1981002371A1 *Jan 5, 1981Aug 20, 1981Motorola IncAn improved frequency synthesizer using multiple dual modulus prescalers
WO1981002372A1 *Jan 5, 1981Aug 20, 1981Motorola IncImproved divider with dual modulus prescaler
WO1982003477A1 *Mar 30, 1982Oct 14, 1982Inc MotorolaFrequency synthesized transceiver
Classifications
U.S. Classification708/103, 377/52, 331/25, 331/1.00A, 331/16, 377/47
International ClassificationG06F7/68, H03K23/66, H03L7/193, H03L7/18
Cooperative ClassificationH03K23/665, H03L7/193, H03L7/18, H03K23/667, G06F7/68
European ClassificationH03K23/66P, H03K23/66S, G06F7/68, H03L7/18, H03L7/193 | {
"url": "http://www.google.com/patents/US4053739?ie=ISO-8859-1&dq=4052565",
"source_domain": "www.google.com",
"snapshot_id": "crawl=CC-MAIN-2015-22",
"warc_metadata": {
"Content-Length": "66865",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:U6WWTVIHAK6CXIYXMWRQBRQUDTQPMCTJ",
"WARC-Concurrent-To": "<urn:uuid:61bc9ebe-7651-47c9-a230-a1e3e9c2d546>",
"WARC-Date": "2015-05-23T00:15:11Z",
"WARC-IP-Address": "74.125.21.106",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:L7JFNNY6K6IKQ7YRCANFKJKEPQU4E4GH",
"WARC-Record-ID": "<urn:uuid:c4618909-fcb1-44b1-bfa8-21dee71d792e>",
"WARC-Target-URI": "http://www.google.com/patents/US4053739?ie=ISO-8859-1&dq=4052565",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:851dee20-a43f-4d97-be8f-a629490e221a>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-206-219.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
56,
64,
205,
206,
214,
215,
243,
273,
295,
327,
356,
380,
406,
461,
562,
615,
647,
686,
737,
771,
784,
793,
1380,
1390,
1404,
1414,
1424,
1434,
1608,
1817,
1928,
2287,
2352,
2496,
2705,
2777,
2854,
3176,
3241,
3280,
3356,
3492,
3576,
3724,
3831,
3915,
4026,
4435,
4527,
4601,
4661,
4741,
4953,
5025,
5102,
5424,
5436,
5464,
5465,
5593,
5594,
6618,
6619,
6644,
6645,
6815,
6816,
7062,
7063,
7088,
7089,
7264,
7265,
7444,
7445,
8450,
8451,
9912,
9913,
9947,
9948,
10031,
10032,
10136,
10137,
10194,
10195,
11055,
11056,
11436,
11437,
12699,
12700,
12791,
12792,
13749,
13750,
14279,
14280,
14885,
14886,
15362,
15363,
16823,
16824,
17185,
17186,
17261,
17262,
18914,
18915,
19254,
19255,
19731,
19732,
19962,
19963,
19980,
20034,
20188,
20275,
20373,
20449,
20586,
20672,
20686,
20741,
20835,
20910,
21002,
21130,
21259,
21386,
21503,
21595,
21661,
21743,
21893,
22068,
22149,
22264,
22392,
22486,
22618,
22723,
22944,
23123,
23220,
23367,
23503,
23608,
23688,
23786,
23852,
23976,
24072,
24158,
24174,
24244,
24313,
24393
],
"line_end_idx": [
56,
64,
205,
206,
214,
215,
243,
273,
295,
327,
356,
380,
406,
461,
562,
615,
647,
686,
737,
771,
784,
793,
1380,
1390,
1404,
1414,
1424,
1434,
1608,
1817,
1928,
2287,
2352,
2496,
2705,
2777,
2854,
3176,
3241,
3280,
3356,
3492,
3576,
3724,
3831,
3915,
4026,
4435,
4527,
4601,
4661,
4741,
4953,
5025,
5102,
5424,
5436,
5464,
5465,
5593,
5594,
6618,
6619,
6644,
6645,
6815,
6816,
7062,
7063,
7088,
7089,
7264,
7265,
7444,
7445,
8450,
8451,
9912,
9913,
9947,
9948,
10031,
10032,
10136,
10137,
10194,
10195,
11055,
11056,
11436,
11437,
12699,
12700,
12791,
12792,
13749,
13750,
14279,
14280,
14885,
14886,
15362,
15363,
16823,
16824,
17185,
17186,
17261,
17262,
18914,
18915,
19254,
19255,
19731,
19732,
19962,
19963,
19980,
20034,
20188,
20275,
20373,
20449,
20586,
20672,
20686,
20741,
20835,
20910,
21002,
21130,
21259,
21386,
21503,
21595,
21661,
21743,
21893,
22068,
22149,
22264,
22392,
22486,
22618,
22723,
22944,
23123,
23220,
23367,
23503,
23608,
23688,
23786,
23852,
23976,
24072,
24158,
24174,
24244,
24313,
24393,
24469
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 24469,
"ccnet_original_nlines": 161,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.29951903223991394,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05684303119778633,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20288588106632233,
"rps_doc_frac_unique_words": 0.20181113481521606,
"rps_doc_mean_word_length": 5.143855094909668,
"rps_doc_num_sentences": 153,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.391733646392822,
"rps_doc_word_count": 3865,
"rps_doc_frac_chars_dupe_10grams": 0.1609576940536499,
"rps_doc_frac_chars_dupe_5grams": 0.30129268765449524,
"rps_doc_frac_chars_dupe_6grams": 0.24038025736808777,
"rps_doc_frac_chars_dupe_7grams": 0.20396357774734497,
"rps_doc_frac_chars_dupe_8grams": 0.1925959438085556,
"rps_doc_frac_chars_dupe_9grams": 0.17665107548236847,
"rps_doc_frac_chars_top_2gram": 0.01383229997009039,
"rps_doc_frac_chars_top_3gram": 0.01126703992486,
"rps_doc_frac_chars_top_4gram": 0.016598759219050407,
"rps_doc_books_importance": -2223.29296875,
"rps_doc_books_importance_length_correction": -2223.29296875,
"rps_doc_openwebtext_importance": -1225.209716796875,
"rps_doc_openwebtext_importance_length_correction": -1225.209716796875,
"rps_doc_wikipedia_importance": -891.47509765625,
"rps_doc_wikipedia_importance_length_correction": -891.47509765625
},
"fasttext": {
"dclm": 0.667489230632782,
"english": 0.8620277047157288,
"fineweb_edu_approx": 2.884641647338867,
"eai_general_math": 0.9597821235656738,
"eai_open_web_math": 0.3795697093009949,
"eai_web_code": 0.3061007261276245
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "621.3840285",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
},
"secondary": {
"code": "621.310285",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "11",
"label": "Legal/Regulatory"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 71f077df794da2774531b20248bb19b0 |
-7,585,084,133,096,919,000 | Β IBM Certification Questions
Q:
Which of the following extenders allows data to be presented in a three dimensional format?
A) DB2 AVI Extender B) DB2 XML Extender
C) DB2 Text Extender D) DB2 Spatial Extender
Β
Answer & Explanation Answer: D) DB2 Spatial Extender
Explanation:
Report Error
View Answer Workspace Report Error Discuss
Filed Under: IBM Certification
3 1193
Q:
Which of the following DB2 data types CANNOT be used to contain the date an employee was hired?
A) CLOB B) TIME
C) VARCHAR D) TIMESTAMP
Β
Answer & Explanation Answer: B) TIME
Explanation:
Report Error
View Answer Workspace Report Error Discuss
Filed Under: IBM Certification
4 1163
Q:
With database logging, where are transaction records first placed?
A) in the logical log buffer B) in the primary chunk
C) in the physical buffer D) in a temporary database table
Β
Answer & Explanation Answer: A) in the logical log buffer
Explanation:
Report Error
View Answer Workspace Report Error Discuss
Filed Under: IBM Certification
4 1088
Q:
The DBA can set the registry variable DB2_HASH_JOIN on or off because:
A) hash joins may require more resources to run. B) hash joins are not used unless outer joins are requested.
C) If hash joins are enabled, no other join method can be used. D) Hash joins are only needed when the tables are portioned using hash keys.
Β
Answer & Explanation Answer: A) hash joins may require more resources to run.
Explanation:
Report Error
View Answer Workspace Report Error Discuss
Filed Under: IBM Certification
4 1073
Q:
Suppose a System z customer has a new CIO. The CIO is concerned about continuing operations and recovery following a catastrophe.Which of the following addresses this issue?
A) GDPS B) TAM
C) DR D) WASS
Β
Answer & Explanation Answer: A) GDPS
Explanation:
Report Error
View Answer Workspace Report Error Discuss
Filed Under: IBM Certification
2 1035 | {
"url": "http://www.sawaal.com/certifications/ibm-certification-questions-and-answers.html",
"source_domain": "www.sawaal.com",
"snapshot_id": "crawl=CC-MAIN-2017-17",
"warc_metadata": {
"Content-Length": "83029",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RGZUKY2QAISKUVG62NI7LRFQTXRCUBB4",
"WARC-Concurrent-To": "<urn:uuid:718bc7dd-9bad-468c-8c13-5bb4ca130d8b>",
"WARC-Date": "2017-04-27T14:58:09Z",
"WARC-IP-Address": "35.154.141.62",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:REX42B6ROSE5ARRLLGIGK7JGDJWUJCHS",
"WARC-Record-ID": "<urn:uuid:a9b85ecd-f664-41a1-bd3b-91e2b3ed1949>",
"WARC-Target-URI": "http://www.sawaal.com/certifications/ibm-certification-questions-and-answers.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:eb3f46c8-07be-4911-b3ce-8d165ce7f6ff>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-167-34.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-17\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
29,
30,
33,
34,
126,
127,
167,
212,
214,
267,
268,
281,
294,
295,
338,
339,
370,
371,
378,
381,
382,
478,
479,
495,
519,
521,
558,
559,
572,
585,
586,
629,
630,
661,
662,
669,
672,
673,
740,
741,
794,
853,
855,
913,
914,
927,
940,
941,
984,
985,
1016,
1017,
1024,
1027,
1028,
1099,
1100,
1210,
1351,
1353,
1431,
1432,
1445,
1458,
1459,
1502,
1503,
1534,
1535,
1542,
1545,
1546,
1720,
1721,
1736,
1750,
1752,
1789,
1790,
1803,
1816,
1817,
1860,
1861,
1892,
1893
],
"line_end_idx": [
29,
30,
33,
34,
126,
127,
167,
212,
214,
267,
268,
281,
294,
295,
338,
339,
370,
371,
378,
381,
382,
478,
479,
495,
519,
521,
558,
559,
572,
585,
586,
629,
630,
661,
662,
669,
672,
673,
740,
741,
794,
853,
855,
913,
914,
927,
940,
941,
984,
985,
1016,
1017,
1024,
1027,
1028,
1099,
1100,
1210,
1351,
1353,
1431,
1432,
1445,
1458,
1459,
1502,
1503,
1534,
1535,
1542,
1545,
1546,
1720,
1721,
1736,
1750,
1752,
1789,
1790,
1803,
1816,
1817,
1860,
1861,
1892,
1893,
1899
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1899,
"ccnet_original_nlines": 86,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.20652173459529877,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.16032609343528748,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20108695328235626,
"rps_doc_frac_unique_words": 0.4323432445526123,
"rps_doc_mean_word_length": 4.8976898193359375,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.451825141906738,
"rps_doc_word_count": 303,
"rps_doc_frac_chars_dupe_10grams": 0.2884097099304199,
"rps_doc_frac_chars_dupe_5grams": 0.3962264060974121,
"rps_doc_frac_chars_dupe_6grams": 0.36927223205566406,
"rps_doc_frac_chars_dupe_7grams": 0.3396226465702057,
"rps_doc_frac_chars_dupe_8grams": 0.3396226465702057,
"rps_doc_frac_chars_dupe_9grams": 0.3396226465702057,
"rps_doc_frac_chars_top_2gram": 0.07412399351596832,
"rps_doc_frac_chars_top_3gram": 0.07749325782060623,
"rps_doc_frac_chars_top_4gram": 0.08760108053684235,
"rps_doc_books_importance": -146.648681640625,
"rps_doc_books_importance_length_correction": -146.64840698242188,
"rps_doc_openwebtext_importance": -88.16869354248047,
"rps_doc_openwebtext_importance_length_correction": -88.16869354248047,
"rps_doc_wikipedia_importance": -56.97698211669922,
"rps_doc_wikipedia_importance_length_correction": -56.97698211669922
},
"fasttext": {
"dclm": 0.3512539267539978,
"english": 0.7116735577583313,
"fineweb_edu_approx": 2.137883186340332,
"eai_general_math": 0.054550651460886,
"eai_open_web_math": 0.05742866173386574,
"eai_web_code": 0.000003099999958067201
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 71f077df794da2774531b20248bb19b0 |
End of preview. Expand
in Data Studio
π¬ EAI-Taxonomy STEM w/ DCLM (100B sample)
π Website | π₯οΈ Code | π Paper
A high-quality STEM dataset curated from web data using taxonomy-based filtering, containing 100 billion tokens of science, technology, engineering, and mathematics content.
π― Dataset Overview
This dataset is part of the Essential-Web project, which introduces a new paradigm for dataset curation using expressive metadata and simple semantic filters. Unlike traditional STEM datasets that require complex domain-specific pipelines, our approach leverages a 12-category taxonomy to efficiently identify and extract high-quality STEM content.
π§ͺ EAI-Taxonomy STEM w/ DCLM (100B tokens): Documents targeting science, engineering, medical, and computer science content that exhibit reasoning, combined with the DCLM classifier to filter for instruction-dense documents.
π Performance
Our taxonomy-based approach achieves superior results with significantly less curation effort:
| Dataset | MMLU-STEM | Curation Complexity |
|---|---|---|
| DCLM-baseline | 27.7% | General web filtering |
| FineWeb-Edu | 26.7% | Educational filtering |
| EAI-Taxonomy STEM | 29.1% | Simple semantic filter |
| EAI-Taxonomy STEM w/ DCLM | 34.5% | + DCLM classifier |
Results show +24.5% improvement over DCLM and +29.2% improvement over FineWeb-Edu.
π Key Findings
- Strong STEM Performance: Outperforms baseline and educational datasets beyond standard error
- Efficient Curation: Achieves superior results without complex domain-specific pipelines
- Broad Coverage: Encompasses science, engineering, medical, and computer science domains
- Quality Focus: Selects high-quality document types and filters for reasoning content
Dataset Schema Documentation
Overview
This dataset contains web-crawled text data with comprehensive metadata, quality signals, and taxonomic classifications. Each record represents a document extracted from web archives with detailed provenance tracking and quality assessment metrics.
Core Fields
| Field | Type | Description | Path |
|---|---|---|---|
id |
Int64 |
Unique identifier based on document hash | id |
text |
String |
The main textual content of the document | text |
EAI Taxonomy Classification
Comprehensive hierarchical classification system with primary and secondary labels - the most important feature of this dataset. The taxonomy is designed to provide detailed subject categorization, document type identification, content quality assessment, and extraction quality indicators.
Free Decimal Correspondence (FDC)
A Dewey Decimal-inspired classification system with 3-level hierarchical labels. The FDC provides nested categories where each successive level refines its parent category. It's designed to be compatible with the Dewey Decimal System for library cataloging.
Level Structure:
- Level 1: Top-level categories (0-9) covering broad subject areas like General works, Philosophy, Religion, Social Sciences, etc.
- Level 2: Sub-divisions (00-99) that refine Level 1 categories
- Level 3: Specific categories (000-999) that further refine Level 2 categories
| Component | Description | Path |
|---|---|---|
| Primary Code | Main classification code | eai_taxonomy.free_decimal_correspondence.primary.code |
| Primary Level 1 | Top-level category (0=General works, 1=Philosophy, 2=Religion, 3=Social Sciences, 4=Language, 5=Science, 6=Technology, 7=Arts, 8=Literature, 9=History/Geography) | eai_taxonomy.free_decimal_correspondence.primary.labels.level_1 |
| Primary Level 2 | Mid-level category | eai_taxonomy.free_decimal_correspondence.primary.labels.level_2 |
| Primary Level 3 | Specific category | eai_taxonomy.free_decimal_correspondence.primary.labels.level_3 |
| Secondary Code | Alternative classification code | eai_taxonomy.free_decimal_correspondence.secondary.code |
| Secondary Level 1 | Alternative top-level category | eai_taxonomy.free_decimal_correspondence.secondary.labels.level_1 |
| Secondary Level 2 | Alternative mid-level category | eai_taxonomy.free_decimal_correspondence.secondary.labels.level_2 |
| Secondary Level 3 | Alternative specific category | eai_taxonomy.free_decimal_correspondence.secondary.labels.level_3 |
We recommend this viewer for easily navigating the FDC categories when curating filters: https://www.librarything.com/mds
Bloom's Taxonomy Integration
Based on Anderson and Krathwohl's 2001 revision of Bloom's Taxonomy of Educational Objectives, providing two complementary categorization dimensions for educational content analysis.
Knowledge Domain
Categorizes the type of knowledge demonstrated in the document:
| Component | Description | Path |
|---|---|---|
| Primary Code | Main knowledge domain code | eai_taxonomy.bloom_knowledge_domain.primary.code |
| Primary Label | Main knowledge domain label | eai_taxonomy.bloom_knowledge_domain.primary.label |
| Secondary Code | Alternative knowledge domain code | eai_taxonomy.bloom_knowledge_domain.secondary.code |
| Secondary Label | Alternative knowledge domain label | eai_taxonomy.bloom_knowledge_domain.secondary.label |
Possible Values:
| Code | Label | Description |
|---|---|---|
-1 |
Abstain | Unable to determine |
1 |
Factual | Basic elements to learn or solve problems |
2 |
Conceptual | Interrelationships between basic elements within larger context |
3 |
Procedural | Methods and techniques in the discipline |
4 |
Metacognitive | Awareness of how learning works in relation to oneself |
Cognitive Processing Level
Assesses the learning and thinking skill levels demonstrated by the document author:
| Component | Description | Path |
|---|---|---|
| Primary Code | Main cognitive process code | eai_taxonomy.bloom_cognitive_process.primary.code |
| Primary Label | Main cognitive process label | eai_taxonomy.bloom_cognitive_process.primary.label |
| Secondary Code | Alternative cognitive process code | eai_taxonomy.bloom_cognitive_process.secondary.code |
| Secondary Label | Alternative cognitive process label | eai_taxonomy.bloom_cognitive_process.secondary.label |
Possible Values:
| Code | Label | Description |
|---|---|---|
-1 |
Abstain | Unable to determine |
1 |
Remember | Retrieve relevant knowledge from memory |
2 |
Understand | Determine meaning of instructional messages |
3 |
Apply | Use a procedure in a given situation |
4 |
Analyze | Break materials into components and determine relationships |
5 |
Evaluate | Make judgments based on criteria and standards |
6 |
Create | Create new or original work |
Document Characteristics
Document Type v1
In-house classification of common web document types and formats:
| Component | Description | Path |
|---|---|---|
| Primary Code | Main document type code | eai_taxonomy.document_type_v1.primary.code |
| Primary Label | Main document type label | eai_taxonomy.document_type_v1.primary.label |
| Secondary Code | Alternative document type code | eai_taxonomy.document_type_v1.secondary.code |
| Secondary Label | Alternative document type label | eai_taxonomy.document_type_v1.secondary.label |
Possible Values:
| Code | Label | Examples |
|---|---|---|
-1 |
Abstain | Unable to classify |
1 |
News/Editorial | CNN articles, opinion columns |
2 |
Academic/Research | ArXiv papers, research articles |
3 |
Reference/Encyclopedic/Educational | FAQs, Wikipedia entries |
4 |
Code/Software | GitHub repos, code examples |
5 |
Social/Forum | Conversation threads, Q&A boards |
6 |
Promotional/Advertisement | Product pages, calls to action |
7 |
Search/Directory/Bibliography | Link pages, search results |
8 |
Adult/Pornographic | Adult content |
9 |
Personal/Misc | Blogs, user profiles |
10 |
Machine-Generated | Lorem ipsum, garbled text |
11 |
Legal/Regulatory | Contracts, terms of service |
12 |
Government/Political | Legislation, press releases |
13 |
Literary/Creative | Poems, short stories |
14 |
Reviews/Critiques | Film critiques, product reviews |
15 |
E-Commerce/Marketplace | eBay listings, Amazon pages |
16 |
Images/Videos/Audio | YouTube videos, Imgur pages |
17 |
Other/Unclassified | Documents that resist classification |
Document Type v2
Updated classification based on WebOrganizer taxonomy with refined categories for improved document classification accuracy:
| Component | Description | Path |
|---|---|---|
| Primary Code | Main document type code (v2) | eai_taxonomy.document_type_v2.primary.code |
| Primary Label | Main document type label (v2) | eai_taxonomy.document_type_v2.primary.label |
| Secondary Code | Alternative document type code (v2) | eai_taxonomy.document_type_v2.secondary.code |
| Secondary Label | Alternative document type label (v2) | eai_taxonomy.document_type_v2.secondary.label |
Complete Value Mapping:
| Code | Label | Examples |
|---|---|---|
-1 |
Abstain | Documents requiring human review |
1 |
About (Org.) | Company about pages, mission statements |
2 |
About (Personal) | Personal bios, LinkedIn profiles |
3 |
Academic Writing | Research papers, abstracts, dissertations |
4 |
Audio Transcript | Interview transcripts, court records, captions |
5 |
Comment Section | Reddit threads, blog comments |
6 |
Content Listing | Site maps, product catalogs, directory listings |
7 |
Creative Writing | Song lyrics, novel excerpts, poetry |
8 |
Documentation | API docs, README files, user manuals |
9 |
FAQ | FAQ pages, Q&A lists |
10 |
Knowledge Article | Wikipedia articles, Britannica entries |
11 |
Legal Notices | Privacy policies, license agreements, terms of service |
12 |
Listicle | Buzzfeed-style articles, "Top 10" lists |
13 |
News (Org.) | Government blog posts, corporate announcements |
14 |
News Article | Newspaper articles, CNN content, breaking news |
15 |
Nonfiction Writing | Editorials, obituaries, memoirs, opinion pieces |
16 |
Personal Blog | Personal journals, diary entries, lifestyle blogs |
17 |
Product Page | Product descriptions, course offerings, sales pages |
18 |
Q&A Forum | Quora posts, Stack Exchange discussions |
19 |
Spam / Ads | SEO keyword stuffing, promotional spam |
20 |
Structured Data | Datasheets, glossaries, JSON files, databases |
21 |
Customer Support | Help articles, troubleshooting guides |
22 |
Truncated | Paywalled sites, image galleries, partial content |
23 |
Tutorial | Cooking recipes, WikiHow pages, step-by-step guides |
24 |
User Review | Yelp reviews, TripAdvisor feedback, product reviews |
25 |
Other/Unclassified | Miscellaneous documents not fitting other categories |
Extraction Artifacts
Assessment of technical extraction quality, identifying issues from HTML-to-text conversion:
| Component | Description | Path |
|---|---|---|
| Primary Code | Main extraction artifact code | eai_taxonomy.extraction_artifacts.primary.code |
| Primary Label | Main extraction artifact label | eai_taxonomy.extraction_artifacts.primary.label |
| Secondary Code | Alternative extraction artifact code | eai_taxonomy.extraction_artifacts.secondary.code |
| Secondary Label | Alternative extraction artifact label | eai_taxonomy.extraction_artifacts.secondary.label |
Possible Values:
| Code | Label | Description |
|---|---|---|
-1 |
Abstain | Unable to determine |
0 |
No Artifacts | Clean text with no leftover HTML or irrelevant elements |
1 |
Leftover HTML | HTML/code artifacts remaining after extraction |
2 |
Text Extraction Errors | Broken math expressions, encoding errors, improperly parsed tables |
3 |
Irrelevant Content | Headers, footers, nav menus extracted by mistake |
4 |
Indeterminate | Insufficient content to judge |
Missing Content
Assessment of content completeness and extraction success:
| Component | Description | Path |
|---|---|---|
| Primary Code | Main missing content code | eai_taxonomy.missing_content.primary.code |
| Primary Label | Main missing content label | eai_taxonomy.missing_content.primary.label |
| Secondary Code | Alternative missing content code | eai_taxonomy.missing_content.secondary.code |
| Secondary Label | Alternative missing content label | eai_taxonomy.missing_content.secondary.label |
Possible Values:
| Code | Label | Description |
|---|---|---|
-1 |
Abstain | Unable to determine |
0 |
No Missing Content | Complete and coherent text |
1 |
Truncated Snippets | Obvious "...", incomplete paragraphs, cut-off text |
2 |
Click Here References | "Download here", "Click here" without linked content |
3 |
Incoherent Flow | Unreadable or illogical flow due to missing context |
4 |
Missing Images or Figures | Placeholders or references to missing visual content |
5 |
Missing Referenced Data | References to absent tables/datasets (e.g., "See Table 3") |
6 |
Indeterminate | Insufficient content to judge |
Text Structure Information
| Field | Type | Description | Path |
|---|---|---|---|
| Line Start Indices | List[Int32] |
Starting indices of each line | line_start_n_end_idx.line_start_idx |
| Line End Indices | List[Int32] |
Ending indices of each line | line_start_n_end_idx.line_end_idx |
Content Quality Dimensions
Quality assessment inspired by NaturalReasoning and FineWeb efforts to categorize web data by information sophistication.
Reasoning Depth
Assesses the complexity and sophistication of logical reasoning in the document:
| Component | Description | Path |
|---|---|---|
| Primary Code | Main reasoning depth code | eai_taxonomy.reasoning_depth.primary.code |
| Primary Label | Main reasoning depth label | eai_taxonomy.reasoning_depth.primary.label |
| Secondary Code | Alternative reasoning depth code | eai_taxonomy.reasoning_depth.secondary.code |
| Secondary Label | Alternative reasoning depth label | eai_taxonomy.reasoning_depth.secondary.label |
Possible Values:
| Code | Label | Description |
|---|---|---|
-1 |
Abstain | Unable to determine |
1 |
No Reasoning | Facts present but no evidence of reasoning |
2 |
Basic Reasoning | Basic analysis with minimal explanation and summarization |
3 |
Intermediate Reasoning | Some logical steps connecting ideas and structured thinking |
4 |
Advanced Reasoning | Multi-step reasoning and thorough analysis with well-developed explanations |
5 |
Exceptional Reasoning | Novel abstractions, theoretical frameworks, long chain-of-thought, original insights, or proofs |
6 |
Indeterminate | Insufficient context to judge |
Technical Correctness
Evaluates the accuracy and precision of technical information:
| Component | Description | Path |
|---|---|---|
| Primary Code | Main technical correctness code | eai_taxonomy.technical_correctness.primary.code |
| Primary Label | Main technical correctness label | eai_taxonomy.technical_correctness.primary.label |
| Secondary Code | Alternative technical correctness code | eai_taxonomy.technical_correctness.secondary.code |
| Secondary Label | Alternative technical correctness label | eai_taxonomy.technical_correctness.secondary.label |
Possible Values:
| Code | Label | Description |
|---|---|---|
-1 |
Abstain | Unable to determine |
1 |
Technically Flawed | Significant errors undermining content validity |
2 |
Partially Correct | Some correctness but contains flaws, omissions, or errors |
3 |
Mostly Correct | Technical correctness with minor flaws or incomplete explanations |
4 |
Highly Correct | High technical correctness with precise definitions and clear explanations |
5 |
Exceptionally Correct | Exceptional technical correctness with formal proofs and flawless content |
6 |
Not Applicable/Indeterminate | No technical content or insufficient context |
Education Level
Assesses the appropriate educational background required to comprehend the content:
| Component | Description | Path |
|---|---|---|
| Primary Code | Main education level code | eai_taxonomy.education_level.primary.code |
| Primary Label | Main education level label | eai_taxonomy.education_level.primary.label |
| Secondary Code | Alternative education level code | eai_taxonomy.education_level.secondary.code |
| Secondary Label | Alternative education level label | eai_taxonomy.education_level.secondary.label |
Possible Values:
| Code | Label | Description |
|---|---|---|
-1 |
Abstain | Unable to determine |
1 |
General Audience | Accessible to anyone with basic literacy; simple terms |
2 |
High School Level | Requires high school education; specialized terminology explained for non-experts |
3 |
Undergraduate Level | Requires college education; uses specialized terminology and assumes background knowledge |
4 |
Graduate/Expert Level | Requires graduate education or domain expertise; assumes deep background knowledge |
5 |
Indeterminate | Insufficient content to judge educational level |
Metadata
Metadata Structure
The metadata field contains a nested structure with web archive information:
| Field | Type | Description | Path |
|---|---|---|---|
| URL Information | |||
| URL | String |
Original URL of the document | metadata.url |
| Source Domain | String |
Domain name of the source | metadata.source_domain |
| Snapshot ID | String |
Identifier for the web archive snapshot | metadata.snapshot_id |
| WARC Metadata | WARC (Web ARChive) format metadata | ||
| Content Length | String |
Size of the content | metadata.warc_metadata.Content-Length |
| Content Type | String |
MIME type of the content | metadata.warc_metadata.Content-Type |
| Block Digest | String |
Checksum of the WARC block | metadata.warc_metadata.WARC-Block-Digest |
| Concurrent To | String |
Related WARC records | metadata.warc_metadata.WARC-Concurrent-To |
| Date | String |
Timestamp of the crawl | metadata.warc_metadata.WARC-Date |
| IP Address | String |
Source server IP address | metadata.warc_metadata.WARC-IP-Address |
| Payload Type | String |
Identified content type | metadata.warc_metadata.WARC-Identified-Payload-Type |
| Payload Digest | String |
Checksum of the payload | metadata.warc_metadata.WARC-Payload-Digest |
| Record ID | String |
Unique WARC record identifier | metadata.warc_metadata.WARC-Record-ID |
| Target URI | String |
Original target URL | metadata.warc_metadata.WARC-Target-URI |
| Truncated | String |
Truncation status | metadata.warc_metadata.WARC-Truncated |
| Type | String |
WARC record type | metadata.warc_metadata.WARC-Type |
| Warcinfo ID | String |
Associated warcinfo record | metadata.warc_metadata.WARC-Warcinfo-ID |
| Additional Info | |||
| WARC Info | String |
Additional WARC information | metadata.warc_info |
Quality Signals
The dataset includes two comprehensive quality assessment frameworks:
Red Pajama v2 Quality Metrics
Text quality indicators derived from the Red Pajama v2 filtering pipeline:
Content Structure Metrics
| Metric | Description | Path |
|---|---|---|
| Original Length | Original document length | quality_signals.red_pajama_v2.ccnet_original_length |
| Original Lines | Number of lines in original document | quality_signals.red_pajama_v2.ccnet_original_nlines |
| Sentence Count | Total sentence count | quality_signals.red_pajama_v2.rps_doc_num_sentences |
| Word Count | Total word count | quality_signals.red_pajama_v2.rps_doc_word_count |
| Mean Word Length | Average word length | quality_signals.red_pajama_v2.rps_doc_mean_word_length |
Language Quality Metrics
| Metric | Description | Path |
|---|---|---|
| Stop Word Fraction | Proportion of stop words | quality_signals.red_pajama_v2.rps_doc_stop_word_fraction |
| Unique Words Fraction | Fraction of unique words | quality_signals.red_pajama_v2.rps_doc_frac_unique_words |
| All Caps Words | Fraction of words in all capitals | quality_signals.red_pajama_v2.rps_doc_frac_all_caps_words |
| Non-Alphabetic Words | Fraction of non-alphabetic words | quality_signals.red_pajama_v2.rps_doc_frac_no_alph_words |
| Unigram Entropy | Entropy measure of word distribution | quality_signals.red_pajama_v2.rps_doc_unigram_entropy |
Content Pattern Analysis
| Metric | Description | Path |
|---|---|---|
| Curly Bracket Density | Curly bracket density (code indicator) | quality_signals.red_pajama_v2.rps_doc_curly_bracket |
| Symbol-to-Word Ratio | Symbol-to-word ratio | quality_signals.red_pajama_v2.rps_doc_symbol_to_word_ratio |
| Ellipsis Line Endings | Lines ending with ellipsis | quality_signals.red_pajama_v2.rps_doc_frac_lines_end_with_ellipsis |
| Lorem Ipsum Detection | Lorem ipsum text detection | quality_signals.red_pajama_v2.rps_doc_lorem_ipsum |
| Offensive Content | Potentially offensive content detection | quality_signals.red_pajama_v2.rps_doc_ldnoobw_words |
| UT1 Blacklist | UT1 blacklist filtering score | quality_signals.red_pajama_v2.rps_doc_ut1_blacklist |
Duplication Detection
| Metric | Description | Path |
|---|---|---|
| 5-gram Duplication | Character-level duplication for 5-grams | quality_signals.red_pajama_v2.rps_doc_frac_chars_dupe_5grams |
| 6-gram Duplication | Character-level duplication for 6-grams | quality_signals.red_pajama_v2.rps_doc_frac_chars_dupe_6grams |
| 7-gram Duplication | Character-level duplication for 7-grams | quality_signals.red_pajama_v2.rps_doc_frac_chars_dupe_7grams |
| 8-gram Duplication | Character-level duplication for 8-grams | quality_signals.red_pajama_v2.rps_doc_frac_chars_dupe_8grams |
| 9-gram Duplication | Character-level duplication for 9-grams | quality_signals.red_pajama_v2.rps_doc_frac_chars_dupe_9grams |
| 10-gram Duplication | Character-level duplication for 10-grams | quality_signals.red_pajama_v2.rps_doc_frac_chars_dupe_10grams |
| Top 2-gram Coverage | Most frequent 2-gram coverage | quality_signals.red_pajama_v2.rps_doc_frac_chars_top_2gram |
| Top 3-gram Coverage | Most frequent 3-gram coverage | quality_signals.red_pajama_v2.rps_doc_frac_chars_top_3gram |
| Top 4-gram Coverage | Most frequent 4-gram coverage | quality_signals.red_pajama_v2.rps_doc_frac_chars_top_4gram |
Domain Importance Scores
| Metric | Description | Path |
|---|---|---|
| Books Importance | Similarity to book content | quality_signals.red_pajama_v2.rps_doc_books_importance |
| Books Importance (Length Corrected) | Length-corrected books similarity | quality_signals.red_pajama_v2.rps_doc_books_importance_length_correction |
| OpenWebText Importance | Similarity to OpenWebText | quality_signals.red_pajama_v2.rps_doc_openwebtext_importance |
| OpenWebText Importance (Length Corrected) | Length-corrected OpenWebText similarity | quality_signals.red_pajama_v2.rps_doc_openwebtext_importance_length_correction |
| Wikipedia Importance | Similarity to Wikipedia | quality_signals.red_pajama_v2.rps_doc_wikipedia_importance |
| Wikipedia Importance (Length Corrected) | Length-corrected Wikipedia similarity | quality_signals.red_pajama_v2.rps_doc_wikipedia_importance_length_correction |
FastText Classification Scores
Domain and content type classification probabilities:
| Metric | Description | Path |
|---|---|---|
| DCLM Score | DataComp-LM classifier score | quality_signals.fasttext.dclm |
| English Confidence | English language confidence | quality_signals.fasttext.english |
| Educational Content | Educational content approximation | quality_signals.fasttext.fineweb_edu_approx |
| General Math | General mathematics content | quality_signals.fasttext.eai_general_math |
| Web Math | OWM Web-based mathematics content | quality_signals.fasttext.eai_open_web_math |
| Code Content | Code content detection | quality_signals.fasttext.eai_web_code |
How to Load the Dataset
This section provides examples of how to load the EssentialAI/eai-taxonomy-stem-w-dclm-100b-sample dataset using different Python libraries and frameworks.
Using Hugging Face Datasets (Standard Method)
The simplest way to load the dataset is using the Hugging Face datasets library:
from datasets import load_dataset
# Load the entire dataset
dataset = load_dataset("EssentialAI/eai-taxonomy-stem-w-dclm-100b-sample")
# View dataset structure
print(dataset)
print(f"Number of examples: {len(dataset['train'])}")
You can also load the dataset in streaming mode to avoid downloading the entire dataset at once:
from datasets import load_dataset
# Load in streaming mode
dataset = load_dataset("EssentialAI/eai-taxonomy-stem-w-dclm-100b-sample", streaming=True)
data_stream = dataset["train"]
# Iterate through examples
for example in data_stream.take(5):
print(example)
Using PySpark
For large-scale distributed processing, you can load the dataset using PySpark with the pyspark_huggingface library:
# First install the required library:
# pip install pyspark_huggingface
import pyspark_huggingface
from pyspark.sql import SparkSession
# Initialize Spark session
spark = SparkSession.builder.appName("EAI-Taxonomy-STEM-w-DCLM").getOrCreate()
# Load the dataset using the "huggingface" data source
df = spark.read.format("huggingface").load("EssentialAI/eai-taxonomy-stem-w-dclm-100b-sample")
# Basic dataset exploration
print(f"Dataset shape: {df.count()} rows, {len(df.columns)} columns")
df.show(10)
df.printSchema()
# Load only specific columns for efficiency
df_subset = (
spark.read.format("huggingface")
.option("columns", '["column1", "column2"]') # Replace with actual column names
.load("EssentialAI/eai-taxonomy-stem-w-dclm-100b-sample")
)
# Run SQL queries on the dataset
df.createOrReplaceTempView("eai_taxonomy_stem_w_dclm_dataset")
result = spark.sql("""
SELECT COUNT(*) as total_examples
FROM eai_taxonomy_stem_w_dclm_dataset
""")
result.show()
Using Daft
Daft provides a modern DataFrame library optimized for machine learning workloads. You can load the dataset directly from Hugging Face:
import daft
# Load the entire dataset
df = daft.read_parquet("hf://datasets/EssentialAI/eai-taxonomy-stem-w-dclm-100b-sample")
# Basic exploration
print("Dataset schema:")
df.schema()
print("First 5 rows:")
df.show(5)
If you need to access private datasets or use authentication:
import daft
from daft.io import IOConfig, HTTPConfig
io_config = IOConfig(http=HTTPConfig(bearer_token="your_token"))
df = daft.read_parquet("hf://datasets/EssentialAI/eai-taxonomy-stem-w-dclm-100b-sample", io_config=io_config)
Installation Requirements
Make sure you have the required libraries installed:
# For Hugging Face datasets
pip install datasets
# For PySpark with Hugging Face integration
pip install pyspark_huggingface
# For Daft
pip install daft
π Citation
@misc{ai2025essentialwebv1024ttokens,
title={Essential-Web v1.0: 24T tokens of organized web data},
author={Essential AI and : and Andrew Hojel and Michael Pust and Tim Romanski and Yash Vanjani and Ritvik Kapila and Mohit Parmar and Adarsh Chaluvaraju and Alok Tripathy and Anil Thomas and Ashish Tanwer and Darsh J Shah and Ishaan Shah and Karl Stratos and Khoi Nguyen and Kurt Smith and Michael Callahan and Peter Rushton and Philip Monk and Platon Mazarakis and Saad Jamal and Saurabh Srivastava and Somanshu Singla and Ashish Vaswani},
year={2025},
eprint={2506.14111},
archivePrefix={arXiv},
primaryClass={cs.CL},
url={https://arxiv.org/abs/2506.14111},
}
- Downloads last month
- 292
Size of downloaded dataset files:
254 GB
Size of the auto-converted Parquet files:
254 GB
Number of rows:
35,482,877