OpenLLM-France/wikimedia huggingface dataset:
# Minecraft/Shulker Box

Minecraft
Blocks | Items | Mobs
Structures
Miscellaneous
Guides
Shulker boxes can be very useful when you need to store lots of items. They can store 27 slots worth of items, which it retains when broken.

## Obtaining

Crafting recipe:
* Shulker Shell
* Chest
* Shulker Shell
This makes {{{makes}}}.

## Use

Shulker boxes can store 27 slots worth of items, and it keeps those items inside it, even if it is destroyed.
They can be put into another chest, your inventory, a barrel, or an ender chest (good idea). However, you cannot put a shulker box inside another shulker box.
You can dye shulker boxes by crafting their dye. While doing so shouldn't empty their inventory, be careful, since this has happened in the past.

## Achievements
### Organizational Wizard

Name a shulker box with an anvil.
# Minecraft/Raw Beef

Minecraft
Blocks | Items | Mobs
Structures
Miscellaneous
Guides
Dropped from cows. Also known as "steak" or "raw steak" on older editions.
# Minecraft/Sandstone

Minecraft
Blocks | Items | Mobs
Structures
Miscellaneous
Guides
Can be used as decoration.
# Minecraft/Sand

Minecraft
Blocks | Items | Mobs
Structures
Miscellaneous
Guides
Found in deserts and beaches.

## Use

Can hold cacti, be turned to glass and sandstone and suffocate enemies in a single-use trap. That is about it.

## Crafting

Crafting recipe:
| Sand | Sand |
| Sand | Sand |
This makes sandstone.
# Radiation Oncology/Thymoma

* Front Page: Radiation Oncology | RTOG Trials | Randomized Trials
Thymoma/Thymic Carcinoma
Thymoma:
* Staging
* Official Guidelines
* Overview
* Randomized Evidence
Thymic Carcinoma:
# Radiation Oncology/Thyroid

* Front Page: Radiation Oncology | RTOG Trials | Randomized Trials
Edit the thyroid table of contents bar
* Workup
* Staging
* Official Guidelines
* Papillary and follicular
* Medullary
* Hurthle cell
* Anaplastic
See also:
# Radiation Oncology/Thyroid/Hurthle cell

| Front Page: Radiation Oncology | RTOG Trials | Edit this |
| Thyroid: Main Page | Workup | Staging | Papillary and follicular | Medullary | Hurthle cell | Anaplastic | |

# Hürthle cell carcinoma

Variant of follicular carcinoma. Is relatively aggressive with prognosis worse than papillary carcinoma. Represent about 3% of thyroid cancer.

## Prognostic factors

* M.D.Anderson, 2003 (1944 - 1995) - PMID 12599224 — "Prognostic factors in patients with Hurthle cell neoplasms of the thyroid." Lopez-Penabad L et al. Cancer. 2003 Mar 1;97(5):1186-94.
** 89 pts with Hurthle cell carcinoma, 38 with Hurthle cell adenoma.

## Patterns of failure

Most recurrences are in the neck. Lung is most common site of distant mets. Recurrent disease in the neck can be treated surgically.
Cause-specific mortality approximately 30%.

## Treatment

Treatment should include total thyroidectomy and unilateral central compartment neck dissection. There is no known role for adjuvant radiation therapy; however, the tumor is radiosensitive.
Only about 7% respond to I-131; however, one study (PMID 12599224; see M.D.Anderson study above) suggested a survival benefit for thyroid ablation with radioactive iodine.

### Adjuvant Radiation Therapy

* Mayo Clinic, 2003 - PMID 12829143 — "Is there a role for radiation therapy in the management of Hurthle cell carcinoma?" Foote RL et al. Int J Radiat Oncol Biol Phys. 2003 Jul 15;56(4):1067-72.
# Radiation Oncology/Thyroid/Guidelines

Thyroid Official Guidelines
Thyroid Nodules:
Thyroid Cancer:
Radioiodine Therapy:
* ATA (American Thyroid Association) Website
** 2011 PDF "Radiation Safety in the Treatment of Patients with Thyroid Diseases by Radioiodine 131I: Practice Recommendations of the American Thyroid Association"
* EANM (European Association of Nuclear Medicine)
** 2008 PMID 18670773 PDF "Guidelines for radioiodine therapy of differentiated thyroid cancer."
Medullary Thyroid Cancer:
# Radiation Oncology/Thymic Carcinoma

Thymic Carcinoma

## Pathology

Most thymic carcinomas are CD5+ CD70+ CD117+ (c-kit). In contrast, thymomas are CD5- (except type B3). Squamous cell carcinomas of other organs are CD5- and CD70-. (Hodgkin lymphoma and nasopharyngeal carcinoma can be CD70+) Neuroendocrine markers are positive in 2/3 of cases.
* ↑ "World Health Organization Classification of Tumors: Pathology & Genetics: Tumors of the Lung, Pleura, Thymus and Heart", 2004, PDF
# Radiation Oncology/Thymoma/Randomized

* Front Page: Radiation Oncology | RTOG Trials | Randomized Trials
Thymoma Randomized Evidence

## Surgery +/- Adjuvant RT

Stage I
* Peking; 1999 (China)(1981-1996) PMID 11593579 -- "Postoperative radiotherapy for stage I thymoma: a prospective randomized trial in 29 cases." (Zhang H, Chin Med J (Engl). 1999 Feb;112(2):136-8.)
** Randomized. 29 patients, Stage I, age <65 years. Arm 1) surgery alone vs. Arm 2) surgery + adjuvant RT. RT AP and/or two anterior oblique wedge fields. If lymphocytic predominant, used 50/25, if epithelial/mixed used 60/30
** Outcome: No recurrence or metastases in either group; 10-year OS surgery 92% vs. surgery + RT 88% (NS)
** Conclusion: Adjuvant RT not necessary for Stage I thymoma
# Radiation Oncology/Thymoma/Guidelines

* Front Page: Radiation Oncology | RTOG Trials | Randomized Trials
Thymoma Guidelines
General
* NCCN: Thymic Malignancies
** Guideline link
* Ontario: "The Management of Thymoma: Guideline Recommendations" (2008)
** Guideline link
# Radiation Oncology/Thymoma/Staging

* Front Page: Radiation Oncology | RTOG Trials | Randomized Trials
Thymoma Staging
* There is no universally accepted system; no AJCC staging existed before the 8th edition, which will go into effect January 1st, 2018 in the United States
* Historically, a classification system used both histological features and clinical behavior
* Masaoka staging is the clinically used staging system, although it may not be predictive for thymic carcinoma
* GETT staging is the surgical staging system, and may have better correlation with outcome
* A meta-analysis from UCLA suggests that evaluation of transcapsular extension (Stage I vs. Stage IIa) is of no clinical value, as they have same DFS and OS outcomes
Historical Classification
* Benign Thymoma (histologically and behaviorally benign)
* Malignant Thymoma (invasive)
** Type I - histologically benign, but behaving aggressively with local invasion
** Type II ("thymic carcinoma") - histologically malignant, aggresive behavior
Masaoka TNM Staging (1999) - PMID 10047676
| Stage | Description |
| T1 | Macroscopically completely encapsulated AND microscopically no invasion |
| T2 | Invasion into or through the capsule |
| T2a | Microscopic invasion into capsule |
| T2b | Macroscopic adhesion, or invasion into surrounding fatty tissue, or mediastinal pleura |
| T3 | Invasion into neighboring organs |
| T3a | No invasion of great vessels |
| T3b | Invasion of great vessels |
| T4 | Pleural or pericardial dissemination |
| N | Lymph node status |
| N1 | Anterior mediastinal LNs |
| N2 | Intrathoracic LNs except anterior mediastinal LNs |
| N3 | Supraclavicular LNs |
| M0 | Metastatic status |
| M1 | Hematogenous metastasis or extrathoracic LNs except supraclavicular LNs |
Original Masaoka Staging (1991) - PMID 1913546
* Stage I - Macroscopically and microscopically completely encapsulated
* Stage II - Macroscopic invasion into surrounding fatty tissues or mediastinal pleura or microscopic invasion into the capsule
* Stage III - Macroscopic invasion into adjacent organs or intrathoracic metastases
* Stage IVA - Pleural or pericardial implants/dissemination
* Stage IVB - Nodal or hematogenous metastases
GETT Staging
* Stage IA - Encapsulated, completely resected
* Stage IB - Macroscopically completely resected but suspicion of mediastinal adhesions or potential capsular invasion at surgery
* Stage II - Invasive tumor, completely resected
* Stage IIIA - Invasive tumor, subtotal resection
* Stage IIIB - Invasive tumor, biopsy alone
* Stage IVa - Supraclav or pleural met
* Stage IVb - Distant metastases
# Optimizing C++/Writing efficient code

In this chapter, guidelines are presented for the avoidance of inefficient operations and for the preparation of source code for a possible optimization stage - all without jeopardizing code safety or maintainability.
Following these guidelines might result in no overall performance gain. But equally there is unlikely to be a performance loss. The guidelines can therefore be applied without worrying about their impact on performance. It is advisable always to follow these guidelines, even in code portions that have no particular efficiency requirements.
* Performance improving features
* Performance worsening features
* Constructions and destructions
* Allocations and deallocations
* Memory access
* Thread usage
# Optimizing C++/Writing efficient code/Memory access

This section presents guidelines for improving main-memory access performance by exploiting features of the processor caches and of secondary memory swapping by the operating system virtual memory manager.

### Memory access order

Access memory in increasing addresses order. In particular:
* scan arrays in increasing order;
* scan multi-dimensional arrays using the rightmost index for innermost loops;
* in class constructors and in assignment operators (operator=), access member variables in the order of declaration.
Data caches optimize memory access in increasing sequential order.
When a multi-dimensional array is scanned, the innermost loop should iterate on the last index, the innermost-but-one loop should iterate on the last-but-one index, and so on. In such a way, it is guaranteed that array cells are processed in the same order in which they are arranged in memory. For example, the following code is optimized:

### Memory alignment

Keep the compiler default memory alignment.
By default, compilers use an alignment criterion for fundamental types, for which objects may have only memory addresses that are a multiple of particular factors. Such criterion guarantees top performance, but it may add paddings (or holes) between successive objects.
If it is necessary to avoid such paddings for some structures, use the pragma directive only around such structure definitions.

### Grouping functions in compilation units

Define in the same compilation unit all the member functions of a class, all the friend functions of the class, and all the member functions of friend classes of the class, except when the resulting file becomes unwieldy because of its size.
In this way, both the machine code resulting from the compilation of the functions and the static data defined in the classes and functions will have adjacent addresses. In addition, even compilers that do not perform whole program optimization may optimize calls among these functions.

### Grouping variables in compilation units

Define every global variable in the compilation unit in which it is used most often.
In this way, such variables will have addresses near to each other and to the static variables defined in such compilation units. In addition, even compilers that do not perform whole program optimization may optimize accesses to such variables from the functions that use them most often.

### Private functions and variables in compilation units

Declare in an anonymous namespace the variables and functions that are global to a compilation unit, but that are not used by other compilation units.
In the C language and also in C++, such variables and functions may be declared static. However, in modern C++, the use of static global variables and functions is not recommended and should be replaced by variables and functions declared in an anonymous namespace.
In both cases, the compiler is notified that such identifiers will never be used by other compilation units. This allows compilers that do not perform whole program optimization to optimize the use of such variables and functions.
# Optimizing C++/Writing efficient code/Thread usage
### Worker thread

In an interactive application, whenever you must perform an operation that can take more than few seconds, assign the operation to a worker thread having a lower priority than normal.
In this way, the main thread is ready to handle new user commands and by assigning the worker thread a lower priority, the user interface remains responsive.
Strictly speaking, this guideline does not improve the speed of the application, only its responsiveness. However, this is perceived by users as an improvement in speed.

### Multiple worker threads

In a multicore system, if you can split a CPU-intensive operation across several threads, use as many worker threads as there are processor cores.
In this way, every core can process a worker thread. If more worker threads are assigned than there are cores, the result will be heavy thread-switching, thus reducing execution speed. The main thread does not affect operational speed as it is mostly inactive.
This recipe does not hold for I/O-bound tasks; scheduling threads that are all waiting for the same disk only causes overhead. But one thread can compute while another is reading from disk, so two threads can perform useful work in some I/O-bound programs. Similarly, two threads can sometimes make better use of a full-duplex network link than one can.

### Use of multi-threaded libraries

If you are developing a single-threaded application, don't use libraries designed only for multi-threaded applications.
The techniques used to make a library thread-safe may have memory and time overheads. If you don't use threads, avoid paying their costs.

### Creation of multi-threaded libraries

If you are developing a library, handle its use by multi-threaded applications correctly, but also optimize for cases where it is used by single-threaded applications.
The techniques used to make a library thread-safe may have memory and time overheads. If the users of your library don't use threads, avoid forcing your users to pay the cost of threads.

### Mutual exclusion

Use mutual exclusion primitives only when several threads access the same data concurrently and at least one of these accesses is for writing.
Mutual exclusion primitives have an overhead.
If you are sure that, in a given period, no thread is writing in a memory area, there is no need to synchronize read accesses for such area.
# Optimizing C++/Tools

A list of tools to access the CPU hardware counters:
* OProfile (Linux)
* PAPI (Linux, various Unices)
# Optimizing C++/Writing efficient code/Allocations and deallocations

Dynamic memory allocation and deallocation are very slow operations when compared to automatic memory allocation and deallocation. In other words, the heap is much slower than the stack.
In addition, dynamic allocation has a per-allocation overhead, causes virtual memory fragmentation, and causes bad data locality of reference, with the ensuing bad usage of both the processor data cache and virtual memory space.
Dynamic memory allocation/deallocation was performed in the C language using the malloc and free standard library functions. In C++, although these functions are still available, the new, new, delete, and delete operators are normally used.
An obvious way to decrease the allocation count is to decrease the number of constructed objects and for that you should refer to the section "Constructions and destructions" in this chapter.
Here we concentrate on guidelines for decreasing the allocation count for a given number of new operator calls.

### Fixed length arrays

If a static or non-large array has compile-time constant length, instead of a vector object, use a C-language array, std::array, or an array object from the Boost library.
vectors store data in a dynamically allocated buffer, whereas arrays allocate data inside the object itself. This avoids repeated allocations/deallocations of dynamic memory and favors data locality.
If the array is large, such advantages are diminished and it becomes more important to avoid using too much stack space.

### Allocating many small objects

If you have to allocate many objects of the same size, use a block allocator.
A block allocator (aka pool allocator) allocates medium to large memory blocks and provides a service to allocate/deallocate smaller, fixed-size blocks. It allows high allocation/deallocation speed, low memory fragmentation and efficient use of data caches and of virtual memory.
In particular, an allocator of this kind can greatly improve the performance of the std::list, std::set, std::multiset, std::map, and std::multimap standard containers.
If your standard library implementation does not already use a block allocator for such containers, you should get one and specify it as a template parameter of instances of such container templates. Boost provides two customizable block allocators, pool_allocator and fast_pool_allocator. Other pool allocator libraries can be found on the World Wide Web. Always measure first to find the fastest allocator for the job at hand.

### Appending elements to a collection

When you have to append elements to a collection, use push_back to append a single element, use insert to append a sequence of elements, and use back_inserter to cause an STL algorithm to append elements to a sequence.
The push_back functions guarantees an amortized linear time, as, in case of vectors, it increases the capacity exponentially.
The back_inserter class calls the push_back function internally.
The insert function allows a whole sequence to be inserted in an optimized way and therefore a single insert call is faster than many calls to push_back.
# Radiation Oncology/Bile duct/Clinical Trials

| Front Page: Radiation Oncology | RTOG Trials | Edit this |
| Bile Duct: Main Page | Resectable Disease | Adjuvant RT | Unresectable Disease | Clinical Trials | | |
Link to Cancer.gov biliary tract cancer trials. Protocol ID below is cross-linked to the appropriate cancer.gov page.
Chemotherapy
| Phase | Protocol ID | Protocol Name |
| Phase III | XL119-001 | XL119 Versus 5-Fluorouracil (5-FU) Plus Leucovorin (LV) in Subjects with Advanced Biliary Tumors |
| Phase II | SWS-SAKK-44/02 | Phase II Study of Adjuvant Palliative Capecitabine and Gemcitabine in Patients With Locally Advanced or Metastatic Biliary Tract Cancer |
| Phase II | NYWCCC-0803945 | Phase II Study of 3-AP (Triapine®) and Gemcitabine in Patients With Unresectable or Metastatic Biliary Duct or Gallbladder Cancer |
| Phase II | FCCC-03042 | Phase II Study of Bortezomib as First-Line Systemic Therapy in Patients With Unresectable Locally Advanced or Metastatic Adenocarcinoma of the Bile Duct or Gallbladder |
| Phase II | NCI-04-C-0273 | Phase II Study of Intrahepatic Arterial Infusion of Melphalan With Venous Filtration Via Peripheral Hepatic Perfusion in Patients With Unresectable Primary or Metastatic Liver Cancer |
| Phase II | UTMB-NCI-931 | Phase II Randomized Study of Immunization With Carcinoembryonic Antigen (CEA) Peptide 1-6D Emulsified in Montanide ISA-51 Versus Dissolved in Sargramostim (GM-CSF) in HLA-A2+ Patients With CEA-Producing Adenocarcinomas of Gastrointestinal Tract Origin |
| Phase I/II | NCCTG-N9943 | Phase I/II Study of Gemcitabine and Pemetrexed Disodium in Patients With Unresectable or Metastatic Biliary Tract or Gallbladder Cancer |
# Radiation Oncology/Bile duct/Randomized

* Front Page: Radiation Oncology | RTOG Trials | Randomized Trials
Cholangiocarcinoma Randomized Evidence
# Radiation Oncology/Bile duct/Pathology

* Front Page: Radiation Oncology | RTOG Trials | Randomized Trials
* 90% adenocarcinoma (papillary, nodular, sclerosing)
** CA19-9 and CA-50 are positive in 80-90% of cholangiocarcinomas and rarely in hepatomas
** AFP is rarely positive in cholangiocarcinoma but in 35-75% of hepatomas
** Presence of MIB-1 and AgNOR, and lack of CD44 (esp. CD44v6) appears correlated with LN mets and tumor progression
* 10% all other histologies (squamous cell, mucoepidermoid, etc.)
They are locally invasive, and rarely metastatic PMID 4354116
# Radiation Oncology/Bile duct/Periampullary

* Front Page: Radiation Oncology | RTOG Trials | Randomized Trials

## Imaging

* MRI: Korea, 2002 - PMID 12432106 — "Differential diagnosis of periampullary carcinomas at MR imaging." Kim JH et al. Radiographics. 2002 Nov-Dec;22(6):1335-52.

## Treatment

* MGH Pattern of Failure Study PMID 8093983 -- Patterns of Failure after pancreaticoduodenectomy for ampullary carcinoma. (Willet CG, Surg Gyne Obstet. 1993 Jan; 176 (1):33-8.)
** Retrospective. 41 pts with ampullary carcinoma. 69% local control, 55% OS at 5 yrs.
** Low risk features included limited to ampulla/duodenum, well differentiated, node neg, clear margins. Low risk w/ 100% local control and 80% OS at 5yrs.
** High risk features included invasion of pancreas,poorly differentiated,+nodes/margins. 50% local control and 38% OS at 5yrs. Xrt appeared to benefit local control in this cohort. Distant mets (liver, peritoneum, pleura) were dominant mode of failure in hi risk group.
* EORTC PMID 10615932 -- Adjuvant radiotherapy and 5-fluorouracil after curative resection of cancer of the pancreas and periampullary region: phase III trial of the EORTC gastrointestinal tract cancer cooperative group. (Klinkenbijl JH, Annals of Surgery. 1999 Dec; 230(6):776-82.)
** Randomized prospective. Included both pancreatic head and peri-ampullary tumors. T1-T3, N0-N1a peri-ampullary allowed. 218 pts total. 45% had peri-ampullary. Randomized to 5FU/xrt vs observation. On subgroup analysis, 2yr OS for peri-ampullary CA was 63% (obs) vs 67% (chemoxrt) p=0.737. No reduction in locoregional recurrence rate was seen in this group.
* Stanford 1995-99 PMID 11146780 -- Adjuvant chemoradiotherapy for "unfavorable" carcinoma of the ampulla of Vater: preliminary report. (2001 Mehta VK, Arch Surg. 2001 Jan;136(1):65-9.)
** Prospective. 12 patients with "unfavorable" features (+LN, positive margins, poorly differentiated, >2 cm, neurovascular invasion). After surgery, RT 45 Gy + continuous infusion 5-FU. **2-yr OS 89%, MS 34 months, 8/12 disease-free at 2 years.
** Conclusion: "Adjuvant chemoradiotherapy for carcinoma of the ampulla of Vater is well tolerated and might improve control of this disease in patients with unfavorable features."
# DESCRIPTION:

Returns TRUE for any-function values.
ANY-FUNCTION? is an action value.

# ARGUMENTS

* value -- (Type: any-type)
# DESCRIPTION:

Returns TRUE for any-type values.
ANY-TYPE? is an action value.

# ARGUMENTS

* value -- (Type: any-type)
# DESCRIPTION:

Returns the first value ANDed with the second.
AND is an op value.

# ARGUMENTS

* value1 -- (Type: logic number char tuple binary string image)
* value2 -- (Type: logic number char tuple binary string image)
# DESCRIPTION:

Return TRUE if value is any type of object.
ANY-OBJECT? is a function value.

# ARGUMENTS

* value -- (Type: any-type)
# DESCRIPTION:

Returns TRUE for any-string values.
ANY-STRING? is an action value.

# ARGUMENTS

* value -- (Type: any-type)
# DESCRIPTION:

Returns the first value, but also evaluates the second.
ALSO is a function value.

# ARGUMENTS

* value1 -- (Type: any-type)
* value2 -- (Type: any-type)
# DESCRIPTION:

If a value is not found in a series, append it; otherwise, remove it. Returns true if added. (Modifies)
ALTER is a function value.

# ARGUMENTS

* series -- (Type: series port)
* value -- (Type: any)

# REFINEMENTS

* /case -- Case-sensitive comparison
# DESCRIPTION:

Return TRUE if value is any type of path.
ANY-PATH? is a function value.

# ARGUMENTS

* value -- (Type: any-type)
# DESCRIPTION:

Shortcut OR. Evaluates and returns the first value that is not FALSE or NONE.
ANY is a native value.

# ARGUMENTS

* block -- Block of expressions (Type: block)
# DESCRIPTION:

Returns TRUE for any-block values.
ANY-BLOCK? is an action value.

# ARGUMENTS

* value -- (Type: any-type)
# Pinyin/Anthropology

Anthropology is the subject which studies about the human. Its research scope covers humanities, natural sciences and social sciences.
Rénlèixué shì yánjiū rénlèi de xuékē. Tā de yánjiū fànwéi bāokuò rénwénkēxué, zìrán kēxué hé shèhuì kēxué.
# Pinyin/Antarctic

Search Antarctic
* Narnjir d
* Narnjir
# Pinyin/Apostrophe

An apostrophe is a punctuation mark that is used to show a separation in a word.
Piēhào shì zài yīgè dāncí zhōng yònglái biǎoshì gékāi de biāodiǎn fúhào.