hexsha
stringlengths 40
40
| size
int64 5
1.04M
| ext
stringclasses 6
values | lang
stringclasses 1
value | max_stars_repo_path
stringlengths 3
344
| max_stars_repo_name
stringlengths 5
125
| max_stars_repo_head_hexsha
stringlengths 40
78
| max_stars_repo_licenses
sequencelengths 1
11
| max_stars_count
int64 1
368k
⌀ | max_stars_repo_stars_event_min_datetime
stringlengths 24
24
⌀ | max_stars_repo_stars_event_max_datetime
stringlengths 24
24
⌀ | max_issues_repo_path
stringlengths 3
344
| max_issues_repo_name
stringlengths 5
125
| max_issues_repo_head_hexsha
stringlengths 40
78
| max_issues_repo_licenses
sequencelengths 1
11
| max_issues_count
int64 1
116k
⌀ | max_issues_repo_issues_event_min_datetime
stringlengths 24
24
⌀ | max_issues_repo_issues_event_max_datetime
stringlengths 24
24
⌀ | max_forks_repo_path
stringlengths 3
344
| max_forks_repo_name
stringlengths 5
125
| max_forks_repo_head_hexsha
stringlengths 40
78
| max_forks_repo_licenses
sequencelengths 1
11
| max_forks_count
int64 1
105k
⌀ | max_forks_repo_forks_event_min_datetime
stringlengths 24
24
⌀ | max_forks_repo_forks_event_max_datetime
stringlengths 24
24
⌀ | content
stringlengths 5
1.04M
| avg_line_length
float64 1.14
851k
| max_line_length
int64 1
1.03M
| alphanum_fraction
float64 0
1
| lid
stringclasses 191
values | lid_prob
float64 0.01
1
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
c9894c3b150fb0f0363a105863e1a36688a9080c | 2,768 | md | Markdown | _posts/2015-02-01-coffeescript-generators.md | warejohn/nvbn.github.io | 1a36e0c155c995c3b3ac4f3f80f2e59fbf8d502d | [
"CC0-1.0"
] | 13 | 2015-04-05T16:42:04.000Z | 2021-09-05T04:25:54.000Z | _posts/2015-02-01-coffeescript-generators.md | warejohn/nvbn.github.io | 1a36e0c155c995c3b3ac4f3f80f2e59fbf8d502d | [
"CC0-1.0"
] | 1 | 2016-06-15T22:00:44.000Z | 2016-06-15T22:00:44.000Z | _posts/2015-02-01-coffeescript-generators.md | warejohn/nvbn.github.io | 1a36e0c155c995c3b3ac4f3f80f2e59fbf8d502d | [
"CC0-1.0"
] | 4 | 2015-04-24T12:41:33.000Z | 2020-05-02T02:22:41.000Z | ---
layout: post
title: Async code without callbacks with CoffeeScript generators
date: 2015-02-01 19:33:00
keywords: coffeescript, generators
---
Sometimes it's very hard to understand code with a bunch of callbacks, even if it with promises.
But in ES6 and in CoffeeScript 1.9 we got generators, so maybe we can avoid
callbacks with them, and use something like
[tornado.gen](https://tornado.readthedocs.io/en/latest/gen.html)?
And we can, let's look at this little helper function:
~~~coffeescript
gen = (fn) ->
new Promise (resolve, reject) ->
generator = fn()
putInGenerator = (method) -> (val) ->
try
handlePromise generator[method](val)
catch error
reject error
handlePromise = ({value, done}) ->
if done
resolve value
else if value and value.then
value.then putInGenerator('next'), putInGenerator('throw')
else
reject "Value isn't a promise!"
handlePromise generator.next()
~~~
With it code like:
~~~coffeescript
$http.get('/users/').then ({data}) ->
doSomethingWithUsers data.users
$http.get '/posts/'
, (err) ->
console.log "Can't receive users", err
.then ({data}) ->
doSomethingWithPosts data.posts
, (err) ->
console.log "Can't receive posts", err
~~~
Can be transformed to something like:
~~~coffeescript
gen ->
try
{data: usersData} = yield $http.get '/users/'
catch err
console.log "Can't receive users", err
return
doSomethingWithUsers usersData.users
try
{data: postsData} = yield $http.get '/posts/'
catch err
console.log "Can't receive posts", err
return
doSomethingWithPosts postsData.posts
~~~
Isn't it cool? But more, result of `gen` is a promise, so we can write something like:
~~~coffeescript
getUsers = (url) -> gen ->
{data: {users}} = yield $http.get(url)
users.map prepareUser
getPosts = (url) -> gen ->
{data: {posts}} = yield $http.get(url)
posts.map preparePosts
gen ->
try
users = yield getUsers '/users/'
posts = yield getPosts '/posts/'
catch err
console.log "Something goes wrong", err
return
doSomethingWithUsers users
doSomethingWithPosts posts
~~~
So, what `gen` do:
1. Creates main promise, which will be returned from `gen`.
2. Sends nothing to generator and receives first promise.
3. If promise succeed, sends result of this promise to the generator. If failed —
throws an error to the generator.
If we got an exception during `.next` or `.throw` — rejects main promise with that exception.
4. Receives new value from the generator, if the generator is `done` —
resolves main promise with received value, if the value is a promise —
repeats the third step, otherwise — rejects main promise.
| 26.873786 | 99 | 0.6875 | eng_Latn | 0.921878 |
c989e8aee23723aafab9894fc20019d1097ef7cc | 49 | md | Markdown | README.md | JVehaun/gb-emu | b7e4f9d90b1102be5ff444228df62cb0e61b8cc3 | [
"MIT"
] | 3 | 2020-05-31T19:34:17.000Z | 2020-12-08T16:39:34.000Z | README.md | JVehaun/gb-emu | b7e4f9d90b1102be5ff444228df62cb0e61b8cc3 | [
"MIT"
] | null | null | null | README.md | JVehaun/gb-emu | b7e4f9d90b1102be5ff444228df62cb0e61b8cc3 | [
"MIT"
] | null | null | null | # gb-emu
Simple Gameboy emulator written in Rust
| 16.333333 | 39 | 0.795918 | eng_Latn | 0.794048 |
c98a78562163e5e37099834d13b5eb2bf8d52720 | 1,617 | md | Markdown | articles/fin-ops-core/fin-ops/organization-administration/tasks/address-books.md | trncb/dynamics-365-unified-operations-public | 67977392468996e3ecfb35cc2ddc9de375bd4503 | [
"CC-BY-4.0",
"MIT"
] | 1 | 2020-05-20T19:48:43.000Z | 2020-05-20T19:48:43.000Z | articles/fin-ops-core/fin-ops/organization-administration/tasks/address-books.md | trncb/dynamics-365-unified-operations-public | 67977392468996e3ecfb35cc2ddc9de375bd4503 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | articles/fin-ops-core/fin-ops/organization-administration/tasks/address-books.md | trncb/dynamics-365-unified-operations-public | 67977392468996e3ecfb35cc2ddc9de375bd4503 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
# required metadata
title: Configure address books
description: Use this procedure, and the decisions that you made in the Planning the configuration of the global address book and additional address books topic, to set up additional address books for your organization.
author: msftbrking
manager: AnnBe
ms.date: 08/09/2019
ms.topic: business-process
ms.prod:
ms.service: dynamics-ax-applications
ms.technology:
# optional metadata
ms.search.form: DirAddressBook, DirAddressBookTeam
audience: Application User
# ms.devlang:
ms.reviewer: sericks
ms.search.scope: Core, Operations
# ms.tgt_pltfrm:
# ms.custom:
ms.search.region: Global
# ms.search.industry:
ms.author: brking
ms.search.validFrom: 2016-06-30
ms.dyn365.ops.version: Version 7.0.0
---
# Configure address books
[!include [banner](../../includes/banner.md)]
Use this procedure, and the decisions that you made in the Planning the configuration of the global address book and additional address books topic, to set up additional address books for your organization.
The demo data company used to create this task is USMF. This recording is intended for the Planning and configuration team members.
## Configure address books
1. In the **Navigation pane**, go to **Modules > Organization administration > Global address book > Address books**.
2. Click **New**.
3. In the **Name** field, type a value.
4. In the **Description** field, type a value.
5. Click **Save**.
6. In the list, find and select the desired record.
7. Click the arrow to add the selected available teams to the address book.
8. Click **Save**.
| 33.6875 | 220 | 0.752628 | eng_Latn | 0.985395 |
c98aa358e73fcf844303ba31c90d08f01c5d7a72 | 152 | md | Markdown | README.old.md | hcustovic1/anime-quote-generator | 725f9b489582d5d0619a688c7a279c4fa938d3b4 | [
"MIT"
] | null | null | null | README.old.md | hcustovic1/anime-quote-generator | 725f9b489582d5d0619a688c7a279c4fa938d3b4 | [
"MIT"
] | null | null | null | README.old.md | hcustovic1/anime-quote-generator | 725f9b489582d5d0619a688c7a279c4fa938d3b4 | [
"MIT"
] | null | null | null | # anime-quote-generator
A playground for different kinds of new technologies I want to try out in order to create a webpage that displays anime quotes.
| 50.666667 | 127 | 0.809211 | eng_Latn | 0.994886 |
c98acdd935b7489c92db22bc82f1fd2172396386 | 5,078 | md | Markdown | docs/framework/data/adonet/dataset-datatable-dataview/sorting-and-filtering-data.md | MoisesMlg/docs.es-es | 4e8c9f518ab606048dd16b6c6a43a4fa7de4bcf5 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/framework/data/adonet/dataset-datatable-dataview/sorting-and-filtering-data.md | MoisesMlg/docs.es-es | 4e8c9f518ab606048dd16b6c6a43a4fa7de4bcf5 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/framework/data/adonet/dataset-datatable-dataview/sorting-and-filtering-data.md | MoisesMlg/docs.es-es | 4e8c9f518ab606048dd16b6c6a43a4fa7de4bcf5 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: Ordenar y filtrar datos
ms.date: 03/30/2017
dev_langs:
- csharp
- vb
ms.assetid: fdd9c753-39df-48cd-9822-2781afe76200
ms.openlocfilehash: 89e2fdf656fb06ee545ba936f033646ad86182d4
ms.sourcegitcommit: 5b475c1855b32cf78d2d1bbb4295e4c236f39464
ms.translationtype: MT
ms.contentlocale: es-ES
ms.lasthandoff: 09/24/2020
ms.locfileid: "91183382"
---
# <a name="sorting-and-filtering-data"></a>Ordenar y filtrar datos
La <xref:System.Data.DataView> proporciona varias formas de ordenación y filtrado de datos en una <xref:System.Data.DataTable>:
- Mediante la propiedad <xref:System.Data.DataView.Sort%2A> puede especificar criterios simples o múltiples de ordenación de columnas e incluir parámetros ASC (ascendente) y DESC (descendente).
- Mediante la propiedad <xref:System.Data.DataView.ApplyDefaultSort%2A> puede crear automáticamente un criterio de ordenación, en orden ascendente, basado en la columna o columnas de clave principal de la tabla. <xref:System.Data.DataView.ApplyDefaultSort%2A> solo se aplica cuando la propiedad **Sort** es una referencia nula o una cadena vacía y cuando la tabla tiene definida una clave principal.
- Mediante la propiedad <xref:System.Data.DataView.RowFilter%2A> puede especificar subconjuntos de filas basándose en sus valores de columna. Para obtener más información sobre las expresiones válidas para la propiedad **RowFilter** , vea la información de referencia de la <xref:System.Data.DataColumn.Expression%2A> propiedad de la <xref:System.Data.DataColumn> clase.
Si desea devolver los resultados de una consulta determinada en los datos, en lugar de proporcionar una vista dinámica de un subconjunto de los datos, use los <xref:System.Data.DataView.Find%2A> métodos o <xref:System.Data.DataView.FindRows%2A> de **DataView** para lograr el mejor rendimiento en lugar de establecer la propiedad **RowFilter** . Al establecer la propiedad **RowFilter** se vuelve a generar el índice de los datos, lo que agrega sobrecarga a la aplicación y reduce el rendimiento. La propiedad **RowFilter** se utiliza mejor en una aplicación enlazada a datos donde un control enlazado muestra resultados filtrados. Los métodos **Find** y **FindRows** aprovechan el índice actual sin necesidad de que se vuelva a generar el índice. Para obtener más información sobre los métodos **Find** y **FindRows** , vea [Buscar filas](finding-rows.md).
- Mediante la propiedad <xref:System.Data.DataView.RowStateFilter%2A> puede especificar las versiones de fila que desea ver. **DataView** administra implícitamente la versión de fila que se va a exponer según el **RowState** de la fila subyacente. Por ejemplo, si el **RowStateFilter** está establecido en **DataViewRowState. Deleted**, la **DataView** expone la versión de fila **original** de todas las filas **eliminadas** porque no hay ninguna versión de fila **actual** . Puede determinar la versión de fila de una fila que se expone mediante la propiedad **rowversion** de la **DataRowView**.
En la tabla siguiente se muestran las opciones de **DataViewRowState**.
|Opciones de DataViewRowState|Descripción|
|------------------------------|-----------------|
|**CurrentRows**|Versión de fila **actual** de todas las filas **sin modificar**, **agregadas**y **modificadas** . Este es el valor predeterminado.|
|**Agregado**|Versión de fila **actual** de todas las filas **agregadas** .|
|**Eliminado**|La versión de fila **original** de todas las filas **eliminadas** .|
|**ModifiedCurrent**|Versión de fila **actual** de todas las filas **modificadas** .|
|**ModifiedOriginal**|La versión de fila **original** de todas las filas **modificadas** .|
|**None**|Ninguna fila.|
|**OriginalRows**|La versión de fila **original** de todas las filas **sin modificar**, **modificadas**y **eliminadas** .|
|**Sin cambios**|Versión de fila **actual** de todas las filas **sin modificar** .|
Para obtener más información sobre los Estados de fila y las versiones de fila, vea [Estados de fila y versiones](row-states-and-row-versions.md)de fila.
En el siguiente ejemplo de código se crea una vista que muestra todos los productos cuyo número de unidades en existencia es menor o igual que el nivel de nuevo pedido, ordenados en primer lugar por id. de proveedor y después por nombre de producto.
```vb
Dim prodView As DataView = New DataView(prodDS.Tables("Products"), _
"UnitsInStock <= ReorderLevel", _
"SupplierID, ProductName", _
DataViewRowState.CurrentRows)
```
```csharp
DataView prodView = new DataView(prodDS.Tables["Products"],
"UnitsInStock <= ReorderLevel",
"SupplierID, ProductName",
DataViewRowState.CurrentRows);
```
## <a name="see-also"></a>Consulte también
- <xref:System.Data.DataViewRowState>
- <xref:System.Data.DataColumn.Expression%2A?displayProperty=nameWithType>
- <xref:System.Data.DataTable>
- <xref:System.Data.DataView>
- [Objetos DataView](dataviews.md)
- [Información general de ADO.NET](../ado-net-overview.md)
| 74.676471 | 864 | 0.740252 | spa_Latn | 0.969977 |
c98b64fc7780ff0fae4f98d29d89f2f221fc6278 | 282 | md | Markdown | _posts/1962-08-28-the-florida-cabinet-agrees-with.md | MiamiMaritime/miamimaritime.github.io | d087ae8c104ca00d78813b5a974c154dfd9f3630 | [
"MIT"
] | null | null | null | _posts/1962-08-28-the-florida-cabinet-agrees-with.md | MiamiMaritime/miamimaritime.github.io | d087ae8c104ca00d78813b5a974c154dfd9f3630 | [
"MIT"
] | null | null | null | _posts/1962-08-28-the-florida-cabinet-agrees-with.md | MiamiMaritime/miamimaritime.github.io | d087ae8c104ca00d78813b5a974c154dfd9f3630 | [
"MIT"
] | null | null | null | ---
title: The Florida Cabinet agrees with
tags:
- Aug 1962
---
The Florida Cabinet agrees with Metro and Islandia that land purchasers seek approval from Dade County and that they place 14 **Miami Morning News or The Miami Herald**
Page: **1**, Section: **A**
| 28.2 | 170 | 0.684397 | eng_Latn | 0.995331 |
c98c56f249513da0e29d783f236022e6506e85cd | 329 | md | Markdown | README.md | amirtaghavy/USA-Spending-2016-contracts | b620c4c358e88a9767904b2761b9e9327f79df71 | [
"MIT"
] | null | null | null | README.md | amirtaghavy/USA-Spending-2016-contracts | b620c4c358e88a9767904b2761b9e9327f79df71 | [
"MIT"
] | null | null | null | README.md | amirtaghavy/USA-Spending-2016-contracts | b620c4c358e88a9767904b2761b9e9327f79df71 | [
"MIT"
] | null | null | null | # USA-Spending-2016-contracts
This **interactive notebook** explores contract data for contracts awarded by US agencies in 201
[](https://mybinder.org/v2/gh/amirtaghavy/USA-Spending-2016-contracts/HEAD?filepath=USASpending-Contractors-Problem.ipynb)
Copy markdown link to clipboard
| 54.833333 | 168 | 0.808511 | yue_Hant | 0.4133 |
c98c6b6af9d5f656fe4e4a732a8f61d062c96fe3 | 5,062 | md | Markdown | content/media/2017-12-20-ajc/index.md | yesiknowjava/theodorecaputihugo | 95aa4391a2edd0cc03774384cdc52f45efc85835 | [
"MIT"
] | null | null | null | content/media/2017-12-20-ajc/index.md | yesiknowjava/theodorecaputihugo | 95aa4391a2edd0cc03774384cdc52f45efc85835 | [
"MIT"
] | null | null | null | content/media/2017-12-20-ajc/index.md | yesiknowjava/theodorecaputihugo | 95aa4391a2edd0cc03774384cdc52f45efc85835 | [
"MIT"
] | 1 | 2021-06-09T04:30:16.000Z | 2021-06-09T04:30:16.000Z | ---
_external_link: https://www.ajc.com/news/world/gay-teens-four-times-more-likely-attempt-suicide-survey-finds/4N5PHGcLQOZMAzpqZZNLjJ/
archived_url: https://web.archive.org/web/20210616211547/https://www.ajc.com/news/world/gay-teens-four-times-more-likely-attempt-suicide-survey-finds/4N5PHGcLQOZMAzpqZZNLjJ/
article: 'After analyzing the results, they found that lesbian, gay, bisexual and
questioning teens were more than four times as likely to attempt suicide. >>RELATED:
Black, gay and proud: one man''s quest to thrive In fact, about 25 percent of LGBQ
teens said they attempted suicide at least once within the last year, compared to
just six percent of heterosexual youth. Furthermore, 40 percent of LGBQ youth said
they seriously considered suicide and 35 percent of LGBQ kids had actually planned
a suicide, compared to 15 and 12 percent of heterosexual teens, respectively. Researchers
lacked data on gender identity or transgender youth, who may have an even higher
risk of suicide than gay and bisexual teens. When they took a closer look at the
data, they discovered the risk for LGBQ males was even higher. Nearly 39 percent
of bisexual boys had considered suicide. "There have been some indications that
LGBQ youth face increased suicide risks, yet many believed the jury was still out,"
coauthor John Ayers said in a statement. "Our study yields a clear verdict: LGBQ
youth face staggeringly high suicide risks." Researchers now hope their findings
help bring about change. They are encouraging health, political and social leaders
to create strategies to help combat the issue. "Our work has identified a serious
problem, but fortunately decades of science and experience can be leveraged to address
LGBQ youth''s suicide risk," Ayers said. "Now is the time to act." >>RELATED: Gay
teen''s organ donation denied'
date: '2017-12-20 22:46:55'
description: There has been a startling rise in the suicide rate in the US, but LGBQ
teens may more at risk than other groups, according to a new report.
headline: Gay, queer teens four times more likely to attempt suicide, survey finds
image:
focal_point: Smart
original_link: https://www.ajc.com/news/world/gay-teens-four-times-more-likely-attempt-suicide-survey-finds/4N5PHGcLQOZMAzpqZZNLjJ/
original_url: https://www.ajc.com/news/world/gay-teens-four-times-more-likely-attempt-suicide-survey-finds/4N5PHGcLQOZMAzpqZZNLjJ/
outline_html: '<p>There has been a startling rise in U.S. suicide rates, but LGBQ
teens may be more at risk than other groups, according to a new report.</p>
<p>To do so, they surveyed 16,000 youth in 2015, and the questionnaire focused on
topics including sexuality and mental health.</p>
<p>Overall, 89 percent of the participants said they were heterosexual. About two
percent identified as gay or lesbian and six percent were bisexual. About 3.2 percent
said they were questioning or unsure.</p>
<p>After analyzing the results, they found that lesbian, gay, bisexual and questioning
teens were more than four times as likely to attempt suicide.</p>
<p>In fact, about 25 percent of LGBQ teens said they attempted suicide at least
once within the last year, compared to just six percent of heterosexual youth.</p>
<p>Furthermore, 40 percent of LGBQ youth said they seriously considered suicide
and 35 percent of LGBQ kids had actually planned a suicide, compared to 15 and 12
percent of heterosexual teens, respectively.</p>
<p>Researchers lacked data on gender identity or transgender youth, who may have
an even higher risk of suicide than gay and bisexual teens.</p>
<p>When they took a closer look at the data, they discovered the risk for LGBQ males
was even higher. Nearly 39 percent of bisexual boys had considered suicide.</p>
<p>"There have been some indications that LGBQ youth face increased suicide
risks, yet many believed the jury was still out," coauthor John Ayers said
in a <a href="https://www.eurekalert.org/pub_releases/2017-12/sdsu-smy121417.php">statement</a>.
"Our study yields a clear verdict: LGBQ youth face staggeringly high suicide
risks."</p>
<p>Researchers now hope their findings help bring about change. They are encouraging
health, political and social leaders to create strategies to help combat the issue.</p>
<p>"Our work has identified a serious problem, but fortunately decades of science
and experience can be leveraged to address LGBQ youth''s suicide risk," Ayers
said. "Now is the time to act."</p>'
outline_img: https://www.google.com/s2/favicons?domain=ajc.com
publication: ajc
summary: After analyzing the results, they found that lesbian, gay, bisexual and questioning
teens were more than four times as likely to attempt suicide. Furthermore, 40 percent
of LGBQ youth said they seriously considered suicide and 35 percent of LGBQ kids
had actually planned a suicide, compared to 15 and 12...
title: Gay, queer teens four times more likely to attempt suicide, survey finds
--- | 65.74026 | 173 | 0.779534 | eng_Latn | 0.997367 |
c98cfd03064f44b1a592decec4565a38faff7665 | 911 | md | Markdown | meta/16-10-2.md | Kuanysh80/sdg-data-kazstat | dbd52aedab9aeb7d4019c728dbf976fa3d438e99 | [
"MIT"
] | null | null | null | meta/16-10-2.md | Kuanysh80/sdg-data-kazstat | dbd52aedab9aeb7d4019c728dbf976fa3d438e99 | [
"MIT"
] | null | null | null | meta/16-10-2.md | Kuanysh80/sdg-data-kazstat | dbd52aedab9aeb7d4019c728dbf976fa3d438e99 | [
"MIT"
] | null | null | null | ---
availability: 1
classification: 2
computation_units: null
customisation: meta.customisation-2
data_non_statistical: false
data_show_map: false
goal_meta_link: https://unstats.un.org/sdgs/metadata/files/Metadata-16-10-02.pdf
goal_meta_link_text: United Nations Sustainable Development Goals Metadata (pdf 1361kB)
graph_title: global_indicators.16-10-2.title
graph_type: line
indicator: 16.10.2
indicator_name: global_indicators.16-10-2.title
indicator_sort_order: 16-10-02
layout: indicator
national_geographical_coverage: meta.Казахстан
permalink: /16-10-2/
published: true
reporting_status: notstarted
sdg_goal: '16'
source_active_1: true
source_compilation_1: sources.16-10-2.source_compilation_1
source_data_1: null
source_implementation_1: sources.16-10-2.source_implementation_1
tags: []
target: global_targets.16-10.title
target_id: '16.10'
un_custodian_agency: UNESCO-UIS
un_designated_tier: '2'
---
| 29.387097 | 87 | 0.830955 | eng_Latn | 0.116211 |
c98d883465431199fdc8b06fbdb1bba311c51aec | 222 | md | Markdown | CHANGELOG.md | esthonjr/crud-mongodb-nodejs | 0c03776d81d3f93b26db8127bd600dddcd42a7fa | [
"MIT"
] | null | null | null | CHANGELOG.md | esthonjr/crud-mongodb-nodejs | 0c03776d81d3f93b26db8127bd600dddcd42a7fa | [
"MIT"
] | null | null | null | CHANGELOG.md | esthonjr/crud-mongodb-nodejs | 0c03776d81d3f93b26db8127bd600dddcd42a7fa | [
"MIT"
] | null | null | null | # Changelog
Todas as mudanças deste projeto serão documentadas neste arquivo.
## Unreleased
- Modules
- Docker
## 0.0.1 - 2020-07-14
### Added
- Rep criado para compartilhar exemplos de operacoes no mongodb com nodejs
| 20.181818 | 74 | 0.747748 | por_Latn | 0.992492 |
c98d94772d49e2188bac840a4d40843ccb4f0628 | 4,537 | md | Markdown | README.md | Lerg/hxdefold | fa18302df3397cb7910c0b254845574150b8f5e1 | [
"MIT"
] | 1 | 2021-01-08T08:20:59.000Z | 2021-01-08T08:20:59.000Z | README.md | Lerg/hxdefold | fa18302df3397cb7910c0b254845574150b8f5e1 | [
"MIT"
] | null | null | null | README.md | Lerg/hxdefold | fa18302df3397cb7910c0b254845574150b8f5e1 | [
"MIT"
] | null | null | null | 
# Haxe support library for the [Defold](https://www.defold.com/) game engine
[](https://travis-ci.org/hxdefold/hxdefold) 
This library allows writing beautiful [Haxe](https://haxe.org/) code for KING's [Defold](https://www.defold.com/) game engine \o/
## Features
- Fully typed Defold API with proper compile-time errors and IDE services.
- Type-safe game object messages and properties with zero overhead.
- Strengths of Haxe without compromises: powerful type system, meta-programming, static optimizations, dead code elimination and cross-target code sharing.
- Defold hot reloading is now supported!
## Quick start
(assuming you already [installed Haxe](https://haxe.org/download/)😊)
- Install this library (from this repo): `haxelib git hxdefold https://github.com/hxdefold/hxdefold`
- Run `haxelib run hxdefold init` inside your Defold project. It will create a sample `Hello.hx` script component class and a `build.hxml` for building it.
- Read the comments in these files to quickly get some idea.
- Build with `haxe build.hxml` to get the lua output.
- Add `Hello.script` to your game object in the editor and observe the greeting in the debug console.
- Proceed with writing well-structured, expressive and type safe code for your Defold game.
## How does it look like
```haxe
// sample script component code
// definition of the component data, passed as `self` to the callback methods
typedef HelloData = {
// fields with @property annotation will show up in the editor
@property(9000) var power:Int;
}
// component class that defines the callback methods
// after compiling Haxe, the `Hello.script` will appear in the Defold project that can be attached to game objects
class Hello extends defold.support.Script<HelloData> {
// the `init` callback method
override function init(self:HelloData) {
trace('Haxe is over ${self.power}!'); // will be printed to the debug console
}
}
```
## Documentation
Here is the [API reference](http://hxdefold.github.io/hxdefold/).
And here are some example Defold projects, ported from Lua:
* https://github.com/hxdefold/hxdefold-example-sidescroller
* https://github.com/hxdefold/hxdefold-example-platformer
* https://github.com/hxdefold/hxdefold-example-frogrunner
* https://github.com/hxdefold/hxdefold-example-magiclink
* https://github.com/hxdefold/hxdefold-example-throwacrow
* https://github.com/hxdefold/hxdefold-example-warbattles
## How does it work?
Since version 3.4, Haxe supports compiling to Lua, making it possible to use Haxe with Lua-based engines, such as Defold.
However, this requires a bit of autogenerated glue code, because Defold expects scripts to be in separate files, while Haxe compiles everything in a single lua module. So what we do, is generate a simple glue `.script` file for each class extending the magic `defold.support.Script` base class (there are also `GuiScript` and `RenderScript`).
For example, for the `Hello` script from this README, this glue code is generated in the `Hello.script` file:
```lua
-- Generated by Haxe, DO NOT EDIT (original source: src/Hello.hx:11: lines 11-16)
go.property("power", 9000)
require "main"
function init(self)
_hxdefold_.Hello_init(self)
end
```
You can then add this script to the game objects in the Defold Editor.
## Issues
If you're getting an error like `attempt to call global '_hx_e' (a nil value)` at run-time, that means you're compiling the project using the Haxe compilation server,
which is happening by default when building through [Visual Studio Code Haxe extension](https://marketplace.visualstudio.com/items?itemName=nadako.vshaxe).
You can disable the usage if the compilation server for building by setting `"haxe.enableCompilationServer": false` in your workspaces `settings.json`.
Alternatively you can grab a [nightly](http://build.haxe.org/builds/haxe/) of the Haxe compiler version, because the bug was already fixed there.
See more info [here](https://github.com/HaxeFoundation/haxe/issues/7851) and [here](https://github.com/HaxeFoundation/haxe/commit/436ef40d274fdf01757edc92856a4c0cba11c8e1) if you're curious. :-)
## Logo
Made by the awesome [**@markknol**](https://github.com/markknol). Check out [his website](https://blog.stroep.nl/) for more art&code!
| 49.315217 | 342 | 0.764161 | eng_Latn | 0.971591 |
c98da425ba152bacfb91cfe4fa57ada96a11e51e | 2,160 | md | Markdown | content/authors/dennis_estrada/_index.md | djamespeabody/social-identity-lab-website | c39ed9282dbb4c1b8c2cac5187d37d8bed39b8f1 | [
"MIT"
] | null | null | null | content/authors/dennis_estrada/_index.md | djamespeabody/social-identity-lab-website | c39ed9282dbb4c1b8c2cac5187d37d8bed39b8f1 | [
"MIT"
] | null | null | null | content/authors/dennis_estrada/_index.md | djamespeabody/social-identity-lab-website | c39ed9282dbb4c1b8c2cac5187d37d8bed39b8f1 | [
"MIT"
] | 1 | 2022-02-23T23:31:35.000Z | 2022-02-23T23:31:35.000Z | ---
# Display name
name: Dennis Estrada
# Username (this should match the folder name)
authors:
- dennis_estrada
# Is this the primary user of the site?
superuser: true
# Role/position
role: Senior Research Fellow
# Organizations/Affiliations
organizations:
- name:
url: ""
# Short bio (displayed in user profile at end of posts)
bio: My research interests include distributed robotics, mobile computing and programmable matter.
# Social/Academic Networking
# For available icons, see: https://sourcethemes.com/academic/docs/widgets/#icons
# For an email link, use "fas" icon pack, "envelope" icon, and a link in the
# form "mailto:[email protected]" or "#contact" for contact widget.
social:
- icon: envelope
icon_pack: fas
link: 'mailto:[email protected]' # For a direct email link, use "mailto:[email protected]".
# Link to a PDF of your resume/CV from the About widget.
# To enable, copy your resume/CV to `static/files/cv.pdf` and uncomment the lines below.
# - icon: cv
# icon_pack: ai
# link: files/cv.pdf
# Enter email to display Gravatar (if Gravatar enabled in Config)
email: ""
# Organizational groups that you belong to (for People widget)
# Set this to `[]` or comment out if you are not using People widget.
user_groups:
- Researchers
---
<h3>Thesis</h3>
Supporting Extremist Governments: The Result of Uncertainty?
<h3>Research Interests</h3>
Currently, my research interests focus on uncertainty, social identity, prejudice, and social and political issues. Given the current socio-political climate, I am interested in the researching the rise of extremist groups such as the Alt-Right, as well as the resurgence of old extremist groups such as the KKK. I have a passion for social change and would love to apply my future work to combating extremism and extremist groups.
<h3>Recent Work</h3>
<p style="margin-left: 60px; text-indent: -60px;">Souter, S., Beaulieu, J., Estrada, D.A., & Gaffney, A.M. (2020, September). <i>Uncertainty reduction: From benign reassurance to violence endorsement.</i>. Oral presentation at the 2020 meeting of Western Psychological Association, San Francisco, CA.</p>
| 37.241379 | 431 | 0.75 | eng_Latn | 0.978324 |
c98e6951fcf9e6b300ea8761acedde59872ff832 | 1,788 | md | Markdown | docs/design/README.md | JKot-Coder/slang | 1a1b2a0de67dccc1102449b8620830131d569cde | [
"MIT"
] | 895 | 2017-06-10T13:38:39.000Z | 2022-03-31T02:29:15.000Z | docs/design/README.md | JKot-Coder/slang | 1a1b2a0de67dccc1102449b8620830131d569cde | [
"MIT"
] | 708 | 2017-06-15T16:03:12.000Z | 2022-03-28T19:01:37.000Z | docs/design/README.md | JKot-Coder/slang | 1a1b2a0de67dccc1102449b8620830131d569cde | [
"MIT"
] | 80 | 2017-06-12T15:36:58.000Z | 2022-03-23T12:04:24.000Z | Slang Design and Implementation Notes
=====================================
This directory contains documents that are primarily intended for developers working on the Slang implementation.
They are not indended to be helpful to Slang users.
These documents can only be trusted to reflect the state of the codebase or the plans of their authors at the time they were written. Changes to the implementation are not expected to always come with matching changes to these documents, so some amount of drift is to be expected.
Developers interested in contributing to Slang might want to start with the [Overview](overview.md) document, which describes the overall compilation pipeline that Slang uses and the purpose of the various steps (both implemented and planned).
The [Coding Conventions](coding-conventions.md) document describes the conventions that should be followed in all code added to the Slang project.
The [Interfaces](interfaces.md) document describes the high-level design plan for Slang's interfaces and generics features.
The [Declaration References](decl-refs.md) document is intended to help out developers who are mystified by the heavily used `DeclRef` type in the compiler implementation.
The [Intermediate Representation (IR)](ir.md) document describes the design of Slang's internal IR.
The [Existential Types](existential-types.md) document goes into some detail about what "existential types" are in the context of the Slang language, and explains how we may go about supporting them.
The [Capabilities](capabilities.md) document explains the proposed model for how Slang will support general notions of profile- or capability-based overloading/dispatch.
The [Casting](casting.md) document explains how casting works in the slang C++ compiler code base. | 77.73913 | 280 | 0.795861 | eng_Latn | 0.999317 |
c98eb97046ba2d4a58c05d9ba22c58c238f7ea45 | 7,302 | md | Markdown | packages/desktop/CHANGELOG.md | davibe/OpenJSCAD.org | e99d262c66d4dd1b90cc9268300821f8221d4241 | [
"MIT"
] | 1 | 2018-10-12T08:55:49.000Z | 2018-10-12T08:55:49.000Z | packages/desktop/CHANGELOG.md | davibe/OpenJSCAD.org | e99d262c66d4dd1b90cc9268300821f8221d4241 | [
"MIT"
] | null | null | null | packages/desktop/CHANGELOG.md | davibe/OpenJSCAD.org | e99d262c66d4dd1b90cc9268300821f8221d4241 | [
"MIT"
] | null | null | null | # Change Log
All notable changes to this project will be documented in this file.
See [Conventional Commits](https://conventionalcommits.org) for commit guidelines.
<a name="0.7.0"></a>
# [0.7.0](https://github.com/jscad/OpenJSCAD.org/compare/@jscad/[email protected]...@jscad/[email protected]) (2018-09-02)
### Bug Fixes
* **pkg:** attempting to fix auto-releases ([#398](https://github.com/jscad/OpenJSCAD.org/issues/398)) ([bc59fcc](https://github.com/jscad/OpenJSCAD.org/commit/bc59fcc))
### Features
* **io:** add updated dependencies: enable csg to dxf ([#394](https://github.com/jscad/OpenJSCAD.org/issues/394)) ([1144a78](https://github.com/jscad/OpenJSCAD.org/commit/1144a78))
<a name="0.6.1"></a>
## [0.6.1](https://github.com/jscad/OpenJSCAD.org/compare/@jscad/[email protected]...@jscad/[email protected]) (2018-04-20)
### Bug Fixes
* **desktop:** fix desktop update notifications ([#376](https://github.com/jscad/OpenJSCAD.org/issues/376)) ([0b2b6fc](https://github.com/jscad/OpenJSCAD.org/commit/0b2b6fc))
* **desktop:** fixed reverted desktop package version ([#377](https://github.com/jscad/OpenJSCAD.org/issues/377)) ([43048b8](https://github.com/jscad/OpenJSCAD.org/commit/43048b8))
<a name="0.6.0"></a>
# 0.6.0 (2018-04-20)
### Features
* **desktop:** Integrate desktop into monorepo ([#375](https://github.com/jscad/OpenJSCAD.org/issues/375)) ([e3f2d3e](https://github.com/jscad/OpenJSCAD.org/commit/e3f2d3e)), closes [#374](https://github.com/jscad/OpenJSCAD.org/issues/374)
<a name="0.5.0"></a>
# [0.5.0](https://github.com/jscad/jscad-desktop/compare/v0.4.0...v0.5.0) (2018-04-18)
### Features
* **keybindings:** add a way to view & set keybindings ([#50](https://github.com/jscad/jscad-desktop/issues/50)) ([5ab5f30](https://github.com/jscad/jscad-desktop/commit/5ab5f30)), closes [#49](https://github.com/jscad/jscad-desktop/issues/49)
<a name="0.4.0"></a>
# [0.4.0](https://github.com/jscad/jscad-desktop/compare/v0.3.2...v0.4.0) (2018-04-14)
### Features
* **translations:** add multiple languages support for UI ([#47](https://github.com/jscad/jscad-desktop/issues/47)) ([fe41a14](https://github.com/jscad/jscad-desktop/commit/fe41a14)), closes [#44](https://github.com/jscad/jscad-desktop/issues/44)
<a name="0.3.2"></a>
## [0.3.2](https://github.com/jscad/jscad-desktop/compare/v0.3.1...v0.3.2) (2018-04-07)
### Bug Fixes
* **pkg:** fixed release command after version bump ([#46](https://github.com/jscad/jscad-desktop/issues/46)) ([fd8518e](https://github.com/jscad/jscad-desktop/commit/fd8518e))
<a name="0.3.1"></a>
## [0.3.1](https://github.com/jscad/jscad-desktop/compare/v0.3.0...v0.3.1) (2018-04-07)
<a name="0.3.0"></a>
# [0.3.0](https://github.com/kaosat-dev/jscad-desktop/compare/v0.2.0...v0.3.0) (2018-04-05)
### Features
* **releases:** add basics to create binary releases ([#41](https://github.com/kaosat-dev/jscad-desktop/issues/41)) ([2d4e729](https://github.com/kaosat-dev/jscad-desktop/commit/2d4e729)), closes [#32](https://github.com/kaosat-dev/jscad-desktop/issues/32) [#40](https://github.com/kaosat-dev/jscad-desktop/issues/40) [#24](https://github.com/kaosat-dev/jscad-desktop/issues/24)
<a name="0.2.0"></a>
# [0.2.0](https://github.com/kaosat-dev/jscad-desktop/compare/v0.1.1...v0.2.0) (2018-04-04)
### Features
* **geometry caching:** add geometry caching & lots more([#38](https://github.com/kaosat-dev/jscad-desktop/issues/38)) ([223602e](https://github.com/kaosat-dev/jscad-desktop/commit/223602e)), closes [#34](https://github.com/kaosat-dev/jscad-desktop/issues/34) [#35](https://github.com/kaosat-dev/jscad-desktop/issues/35) [#36](https://github.com/kaosat-dev/jscad-desktop/issues/36) [#37](https://github.com/kaosat-dev/jscad-desktop/issues/37) [#33](https://github.com/kaosat-dev/jscad-desktop/issues/33) [#39](https://github.com/kaosat-dev/jscad-desktop/issues/39)
<a name="0.1.1"></a>
## [0.1.1](https://github.com/kaosat-dev/jscad-desktop/compare/v0.1.0...v0.1.1) (2018-01-31)
### Bug Fixes
* **parameter:** parameter handling fixes ([#29](https://github.com/kaosat-dev/jscad-desktop/issues/29)) ([1677e92](https://github.com/kaosat-dev/jscad-desktop/commit/1677e92)), closes [#30](https://github.com/kaosat-dev/jscad-desktop/issues/30)
<a name="0.1.0"></a>
# [0.1.0](https://github.com/kaosat-dev/jscad-desktop/compare/v0.0.2...v0.1.0) (2018-01-30)
### Features
* **solids:** move processing to 'background' ([#28](https://github.com/kaosat-dev/jscad-desktop/issues/28)) ([a0e2fa0](https://github.com/kaosat-dev/jscad-desktop/commit/a0e2fa0)), closes [#9](https://github.com/kaosat-dev/jscad-desktop/issues/9) [#20](https://github.com/kaosat-dev/jscad-desktop/issues/20) [#25](https://github.com/kaosat-dev/jscad-desktop/issues/25)
<a name="0.0.2"></a>
## 0.0.2 (2018-01-20)
### Bug Fixes
* **devTools:** do not launch with devtools by default ([3a072d1](https://github.com/kaosat-dev/jscad-desktop/commit/3a072d1))
### Features
* **various:** fixes, improvements, additions ([#17](https://github.com/kaosat-dev/jscad-desktop/issues/17)) ([4cb4263](https://github.com/kaosat-dev/jscad-desktop/commit/4cb4263))
* experimenting with code analysis (ast based tools)
* adds watching of the whole dependency tree of a design : fixes #6
* adds flags & settings to ensure webgl works in some corner cases fixes #18
* UI tweaks
* lots of minor adjustments
<a name="0.0.1"></a>
## 0.0.1 (2018-01-20)
### Features
* **auto reload:** added basics of autoreload ([881bb30](https://github.com/kaosat-dev/jscad-desktop/commit/881bb30))
* **autoRotate:** added checkbox for autorotate ([749ea8d](https://github.com/kaosat-dev/jscad-desktop/commit/749ea8d))
* **drag & drop:** added drag & drop support ([25941d5](https://github.com/kaosat-dev/jscad-desktop/commit/25941d5))
* **export:** added all basic elements for exporting to stl etc ([3bc90c8](https://github.com/kaosat-dev/jscad-desktop/commit/3bc90c8))
* **file watcher:** added file watcher side effect with sink & source ([e8b5fa0](https://github.com/kaosat-dev/jscad-desktop/commit/e8b5fa0))
* **script loading:** added the ability to transform & load current 'basic' jscad scripts ([c2386ae](https://github.com/kaosat-dev/jscad-desktop/commit/c2386ae))
* **scriptLoading:** added missing imports for 'old' type jscad scripts ([6753c45](https://github.com/kaosat-dev/jscad-desktop/commit/6753c45))
* **settable params:** added all necessary code for a basic but working parameters display([9263706](https://github.com/kaosat-dev/jscad-desktop/commit/9263706))
* **state:** added error handling ([0c0fdf2](https://github.com/kaosat-dev/jscad-desktop/commit/0c0fdf2))
* **theme:** added basic theme support ([e263833](https://github.com/kaosat-dev/jscad-desktop/commit/e263833))
* **toggleAutorotate:** added toggleAutorotate reducer ([ca626b2](https://github.com/kaosat-dev/jscad-desktop/commit/ca626b2))
* **Updates:** ([#12](https://github.com/kaosat-dev/jscad-desktop/issues/12)) ([d25c349](https://github.com/kaosat-dev/jscad-desktop/commit/d25c349)), closes [#14](https://github.com/kaosat-dev/jscad-desktop/issues/14) [#13](https://github.com/kaosat-dev/jscad-desktop/issues/13) [#11](https://github.com/kaosat-dev/jscad-desktop/issues/11) [#10](https://github.com/kaosat-dev/jscad-desktop/issues/10)
| 47.109677 | 564 | 0.705697 | yue_Hant | 0.175243 |
c98ee9d95319e8d8c46e05c5949e937b1ff72c76 | 186 | md | Markdown | DailyCodingProblem/2022/04/19/dailyCodingProblem.md | omaus/CodingProblems | 922bab539f0f073875fe54259adaf260602ab840 | [
"MIT"
] | null | null | null | DailyCodingProblem/2022/04/19/dailyCodingProblem.md | omaus/CodingProblems | 922bab539f0f073875fe54259adaf260602ab840 | [
"MIT"
] | null | null | null | DailyCodingProblem/2022/04/19/dailyCodingProblem.md | omaus/CodingProblems | 922bab539f0f073875fe54259adaf260602ab840 | [
"MIT"
] | null | null | null | _(Difficulty: Medium)_
Invert a binary tree.
For example, given the following tree:
```
a
/ \
b c
/ \ /
d e f
```
should become:
```
a
/ \
c b
\ / \
f e d
``` | 9.789474 | 38 | 0.483871 | eng_Latn | 0.98776 |
c98eeed318f003bd53c4df85cd0d56a21fb150e1 | 965 | md | Markdown | docs/api/Gripper_WebClient_Context.md | tomaskrupka/WebScrapingServices | 35269a4729f23c90be9e7646c1f70b1e8beca8f3 | [
"MIT"
] | null | null | null | docs/api/Gripper_WebClient_Context.md | tomaskrupka/WebScrapingServices | 35269a4729f23c90be9e7646c1f70b1e8beca8f3 | [
"MIT"
] | 2 | 2021-12-14T11:52:01.000Z | 2021-12-15T09:53:24.000Z | docs/api/Gripper_WebClient_Context.md | tomaskrupka/Gripper | 35269a4729f23c90be9e7646c1f70b1e8beca8f3 | [
"MIT"
] | null | null | null | #### [Gripper.WebClient](index 'index')
### [Gripper.WebClient](Gripper_WebClient 'Gripper.WebClient')
## Context Class
```csharp
internal class Context :
Gripper.WebClient.IContext
```
Inheritance [System.Object](https://docs.microsoft.com/en-us/dotnet/api/System.Object 'System.Object') 🡒 Context
Implements [IContext](Gripper_WebClient_IContext 'Gripper.WebClient.IContext')
| Constructors | |
| :--- | :--- |
| [Context(long, long, ILogger, Frame, ICdpAdapter, IElementFactory, IJsBuilder)](Gripper_WebClient_Context_Context(long_long_Microsoft_Extensions_Logging_ILogger_Gripper_ChromeDevTools_Page_Frame_Gripper_WebClient_ICdpAdapter_Gripper_WebClient_IElementFactory_Gripper_WebClient_Utils_IJsBuilder) 'Gripper.WebClient.Context.Context(long, long, Microsoft.Extensions.Logging.ILogger, Gripper.ChromeDevTools.Page.Frame, Gripper.WebClient.ICdpAdapter, Gripper.WebClient.IElementFactory, Gripper.WebClient.Utils.IJsBuilder)') | Ctor. <br/> |
| 60.3125 | 536 | 0.810363 | yue_Hant | 0.898842 |
c98ef564d0d363c3d44f1083ad5bd7fb8246d568 | 1,002 | md | Markdown | sessions/graphql.md | coding-club-linz/global-azure-bootcamp-2018 | 8cb1372441a4b5458eaed94e1d4b5b5b8a5b3eea | [
"MIT"
] | null | null | null | sessions/graphql.md | coding-club-linz/global-azure-bootcamp-2018 | 8cb1372441a4b5458eaed94e1d4b5b5b8a5b3eea | [
"MIT"
] | null | null | null | sessions/graphql.md | coding-club-linz/global-azure-bootcamp-2018 | 8cb1372441a4b5458eaed94e1d4b5b5b8a5b3eea | [
"MIT"
] | 4 | 2018-02-21T20:00:07.000Z | 2022-03-17T14:53:40.000Z | ---
layout: session
page-category: session
title: GraphQL – forget (the) REST?
speaker: Christian Schwendtner
speaker-id: christian-schwendtner
room: '15.04'
slot: 2
---
Spoiler Alert: In dieser Session geht es NICHT um Graph-Datenbanken, auch wenn es der Name vermuten lassen könnte. Es geht um die flexible Abfragesprache GraphQL die u. a. von Facebook, GitHub und Shopify als Alternative zu RESTful Web Services eingesetzt wird.
Was ist GraphQL? Welche Vorteile ergeben sich durch dessen Verwendung? Wie implementiert man ein GraphQL-Backend? Fragen über Fragen, die wir in dieser Session klären werden.
Du verwendest RESTful Web Services zum Bereitstellen von Daten für deine Anwendung? Du denkst: „Ja klar, was denn sonst?“. Dann sollten wir uns gemeinsam mal GraphQL näher ansehen.
Du liebst REST? Sie hasst REST? Du befindest dich gefühlsmäßig irgendwo dazwischen? Wage den Blick über den Tellerrand! Und vielleicht verwendest auch du nach dieser Session GraphQL für deine nächste Anwendung.
| 58.941176 | 261 | 0.801397 | deu_Latn | 0.99656 |
c98fa4438f618d34d9a1b382c854ccdbd658aaf3 | 5,041 | md | Markdown | sdk-api-src/content/d3d11/nf-d3d11-id3d11devicecontext-resolvesubresource.md | amorilio/sdk-api | 54ef418912715bd7df39c2561fbc3d1dcef37d7e | [
"CC-BY-4.0",
"MIT"
] | null | null | null | sdk-api-src/content/d3d11/nf-d3d11-id3d11devicecontext-resolvesubresource.md | amorilio/sdk-api | 54ef418912715bd7df39c2561fbc3d1dcef37d7e | [
"CC-BY-4.0",
"MIT"
] | null | null | null | sdk-api-src/content/d3d11/nf-d3d11-id3d11devicecontext-resolvesubresource.md | amorilio/sdk-api | 54ef418912715bd7df39c2561fbc3d1dcef37d7e | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
UID: NF:d3d11.ID3D11DeviceContext.ResolveSubresource
title: ID3D11DeviceContext::ResolveSubresource (d3d11.h)
description: Copy a multisampled resource into a non-multisampled resource.
helpviewer_keywords: ["9790b3fd-189f-fe3d-b1be-96c2ba68f3f3","ID3D11DeviceContext interface [Direct3D 11]","ResolveSubresource method","ID3D11DeviceContext.ResolveSubresource","ID3D11DeviceContext::ResolveSubresource","ResolveSubresource","ResolveSubresource method [Direct3D 11]","ResolveSubresource method [Direct3D 11]","ID3D11DeviceContext interface","d3d11/ID3D11DeviceContext::ResolveSubresource","direct3d11.id3d11devicecontext_resolvesubresource"]
old-location: direct3d11\id3d11devicecontext_resolvesubresource.htm
tech.root: direct3d11
ms.assetid: 7b4d6180-e3bf-475a-9865-592cda6e9f4a
ms.date: 12/05/2018
ms.keywords: 9790b3fd-189f-fe3d-b1be-96c2ba68f3f3, ID3D11DeviceContext interface [Direct3D 11],ResolveSubresource method, ID3D11DeviceContext.ResolveSubresource, ID3D11DeviceContext::ResolveSubresource, ResolveSubresource, ResolveSubresource method [Direct3D 11], ResolveSubresource method [Direct3D 11],ID3D11DeviceContext interface, d3d11/ID3D11DeviceContext::ResolveSubresource, direct3d11.id3d11devicecontext_resolvesubresource
req.header: d3d11.h
req.include-header:
req.target-type: Windows
req.target-min-winverclnt:
req.target-min-winversvr:
req.kmdf-ver:
req.umdf-ver:
req.ddi-compliance:
req.unicode-ansi:
req.idl:
req.max-support:
req.namespace:
req.assembly:
req.type-library:
req.lib: D3D11.lib
req.dll:
req.irql:
targetos: Windows
req.typenames:
req.redist:
ms.custom: 19H1
f1_keywords:
- ID3D11DeviceContext::ResolveSubresource
- d3d11/ID3D11DeviceContext::ResolveSubresource
dev_langs:
- c++
topic_type:
- APIRef
- kbSyntax
api_type:
- COM
api_location:
- D3D11.lib
- D3D11.dll
api_name:
- ID3D11DeviceContext.ResolveSubresource
---
# ID3D11DeviceContext::ResolveSubresource
## -description
Copy a multisampled resource into a non-multisampled resource.
## -parameters
### -param pDstResource [in]
Type: <b><a href="/windows/desktop/api/d3d11/nn-d3d11-id3d11resource">ID3D11Resource</a>*</b>
Destination resource. Must be a created with the <a href="/windows/desktop/api/d3d11/ne-d3d11-d3d11_usage">D3D11_USAGE_DEFAULT</a> flag and be single-sampled. See <a href="/windows/desktop/api/d3d11/nn-d3d11-id3d11resource">ID3D11Resource</a>.
### -param DstSubresource [in]
Type: <b><a href="/windows/desktop/WinProg/windows-data-types">UINT</a></b>
A zero-based index, that identifies the destination subresource. Use <a href="/windows/desktop/api/d3d11/nf-d3d11-d3d11calcsubresource">D3D11CalcSubresource</a> to calculate the index.
### -param pSrcResource [in]
Type: <b><a href="/windows/desktop/api/d3d11/nn-d3d11-id3d11resource">ID3D11Resource</a>*</b>
Source resource. Must be multisampled.
### -param SrcSubresource [in]
Type: <b><a href="/windows/desktop/WinProg/windows-data-types">UINT</a></b>
The source subresource of the source resource.
### -param Format [in]
Type: <b><a href="/windows/desktop/api/dxgiformat/ne-dxgiformat-dxgi_format">DXGI_FORMAT</a></b>
A <a href="/windows/desktop/api/dxgiformat/ne-dxgiformat-dxgi_format">DXGI_FORMAT</a> that indicates how the multisampled resource will be resolved to a single-sampled resource.
See remarks.
## -remarks
This API is most useful when re-using the resulting rendertarget of one render pass as an input to a second render pass.
The source and destination resources must be the same resource type and have the same dimensions. In addition, they must have compatible formats. There are three scenarios for this:
<table>
<tr>
<th>Scenario</th>
<th>Requirements</th>
</tr>
<tr>
<td>Source and destination are prestructured and typed</td>
<td>Both the source and destination must have identical formats and that format must be specified in the Format parameter.</td>
</tr>
<tr>
<td>One resource is prestructured and typed and the other is prestructured and typeless</td>
<td>The typed resource must have a format that is compatible with the typeless resource (i.e. the typed resource is DXGI_FORMAT_R32_FLOAT and the typeless resource is DXGI_FORMAT_R32_TYPELESS). The format of the typed resource must be specified in the Format parameter.</td>
</tr>
<tr>
<td>Source and destination are prestructured and typeless</td>
<td>Both the source and destination must have the same typeless format (i.e. both must have DXGI_FORMAT_R32_TYPELESS), and the Format parameter must specify a format that is compatible with the source and destination (i.e. if both are DXGI_FORMAT_R32_TYPELESS then DXGI_FORMAT_R32_FLOAT could be specified in the Format parameter).
For example, given the DXGI_FORMAT_R16G16B16A16_TYPELESS format:
<ul>
<li>The source (or dest) format could be DXGI_FORMAT_R16G16B16A16_UNORM</li>
<li>The dest (or source) format could be DXGI_FORMAT_R16G16B16A16_FLOAT</li>
</ul>
</td>
</tr>
</table>
## -see-also
<a href="/windows/desktop/api/d3d11/nn-d3d11-id3d11devicecontext">ID3D11DeviceContext</a> | 40.653226 | 455 | 0.791708 | eng_Latn | 0.36013 |
c98fea182b4ec7f17e52c9874cf985f8ff1224f8 | 4,527 | md | Markdown | docs/framework/wcf/feature-details/how-to-create-a-service-endpoint-in-code.md | MoisesMlg/docs.es-es | 4e8c9f518ab606048dd16b6c6a43a4fa7de4bcf5 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/framework/wcf/feature-details/how-to-create-a-service-endpoint-in-code.md | MoisesMlg/docs.es-es | 4e8c9f518ab606048dd16b6c6a43a4fa7de4bcf5 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/framework/wcf/feature-details/how-to-create-a-service-endpoint-in-code.md | MoisesMlg/docs.es-es | 4e8c9f518ab606048dd16b6c6a43a4fa7de4bcf5 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: Procedimiento para crear un punto de conexión de servicio mediante código
description: Obtenga información sobre cómo implementar un servicio en una clase y definir su punto de conexión mediante programación. En WCF, los extremos se definen normalmente en un archivo de configuración.
ms.date: 03/30/2017
dev_langs:
- csharp
- vb
ms.assetid: 3fbb22fa-2930-48b8-b437-def1de87c6a0
ms.openlocfilehash: 6f5e06154ff19129da0bce77dd70736037c2dc92
ms.sourcegitcommit: bc293b14af795e0e999e3304dd40c0222cf2ffe4
ms.translationtype: MT
ms.contentlocale: es-ES
ms.lasthandoff: 11/26/2020
ms.locfileid: "96294422"
---
# <a name="how-to-create-a-service-endpoint-in-code"></a>Procedimiento para crear un punto de conexión de servicio mediante código
En este ejemplo, se define un contrato de `ICalculator` para un servicio de la calculadora, el servicio se implementa en la clase `CalculatorService` y a continuación, su extremo se define mediante código, donde se especifica que el servicio debe utilizar la clase <xref:System.ServiceModel.BasicHttpBinding>.
Normalmente es el mejor procedimiento para especificar el enlace y la información de dirección de forma declarativa en configuración en lugar de hacerlo de forma imperativa en código. Normalmente, no resulta muy práctico definir los puntos de conexión en el código ya que los enlaces y las direcciones de un servicio implementado son, por lo general, diferentes de los utilizados durante el desarrollo del servicio. Más generalmente, manteniendo el enlace y la información de dirección fuera del código permite cambiarlos sin tener que recompilar o implementar la aplicación.
#### <a name="to-create-a-service-endpoint-in-code"></a>Creación de un extremo de servicio mediante código
1. Cree la interfaz que define el contrato de servicios.
[!code-csharp[c_HowTo_CodeServiceBinding#1](../../../../samples/snippets/csharp/VS_Snippets_CFX/c_howto_codeservicebinding/cs/source.cs#1)]
[!code-vb[c_HowTo_CodeServiceBinding#1](../../../../samples/snippets/visualbasic/VS_Snippets_CFX/c_howto_codeservicebinding/vb/source.vb#1)]
2. Implemente el contrato de servicios definido en el paso 1.
[!code-csharp[c_HowTo_CodeServiceBinding#2](../../../../samples/snippets/csharp/VS_Snippets_CFX/c_howto_codeservicebinding/cs/source.cs#2)]
[!code-vb[c_HowTo_CodeServiceBinding#2](../../../../samples/snippets/visualbasic/VS_Snippets_CFX/c_howto_codeservicebinding/vb/source.vb#2)]
3. En la aplicación de alojamiento, cree la dirección base que han de utilizar el servicio y el enlace con el servicio.
[!code-csharp[c_HowTo_CodeServiceBinding#3](../../../../samples/snippets/csharp/VS_Snippets_CFX/c_howto_codeservicebinding/cs/source.cs#3)]
[!code-vb[c_HowTo_CodeServiceBinding#3](../../../../samples/snippets/visualbasic/VS_Snippets_CFX/c_howto_codeservicebinding/vb/source.vb#3)]
4. Cree el host y llame al método <xref:System.ServiceModel.ServiceHost.AddServiceEndpoint%28System.Type%2CSystem.ServiceModel.Channels.Binding%2CSystem.String%29?displayProperty=nameWithType> o una de las otras sobrecargas para agregar el extremo de servicio del host.
[!code-csharp[c_HowTo_CodeServiceBinding#6](../../../../samples/snippets/csharp/VS_Snippets_CFX/c_howto_codeservicebinding/cs/source.cs#6)]
[!code-vb[c_HowTo_CodeServiceBinding#6](../../../../samples/snippets/visualbasic/VS_Snippets_CFX/c_howto_codeservicebinding/vb/source.vb#6)]
Para especificar el enlace en el código, pero para usar los puntos de conexión predeterminados proporcionados por el tiempo de ejecución, pase la dirección base en el constructor al crear el <xref:System.ServiceModel.ServiceHost> , y no llame a <xref:System.ServiceModel.ServiceHost.AddServiceEndpoint%2A?displayProperty=nameWithType> .
[!code-csharp[c_HowTo_CodeServiceBinding#7](../../../../samples/snippets/csharp/VS_Snippets_CFX/c_howto_codeservicebinding/cs/source.cs#7)]
[!code-vb[c_HowTo_CodeServiceBinding#7](../../../../samples/snippets/visualbasic/VS_Snippets_CFX/c_howto_codeservicebinding/vb/source.vb#7)]
Para obtener más información sobre los puntos de conexión predeterminados, vea [configuración simplificada](../simplified-configuration.md) y [configuración simplificada para servicios WCF](../samples/simplified-configuration-for-wcf-services.md).
## <a name="see-also"></a>Vea también
- [Procedimiento para especificar un enlace de servicio en el código](../how-to-specify-a-service-binding-in-code.md)
| 83.833333 | 578 | 0.782858 | spa_Latn | 0.898618 |
c990773d73bff158488daca70d67e07f8889b910 | 831 | md | Markdown | _posts/2021-04-09-protect-infrastructure-with-site-recovery-5-run-disaster-recovery-drill-.md | avicoder/mslearn | d864219a93bfa551c113003450f9284002299508 | [
"MIT"
] | null | null | null | _posts/2021-04-09-protect-infrastructure-with-site-recovery-5-run-disaster-recovery-drill-.md | avicoder/mslearn | d864219a93bfa551c113003450f9284002299508 | [
"MIT"
] | null | null | null | _posts/2021-04-09-protect-infrastructure-with-site-recovery-5-run-disaster-recovery-drill-.md | avicoder/mslearn | d864219a93bfa551c113003450f9284002299508 | [
"MIT"
] | 1 | 2022-03-09T17:33:15.000Z | 2022-03-09T17:33:15.000Z | ---
layout: post
title: Protect your Azure infrastructure with Azure Site Recovery - Run a disaster recovery drill
description: nil
summary: nil
tags: nil
---
<a target="_blank" href="https://docs.microsoft.com/en-us/learn/modules/protect-infrastructure-with-site-recovery/5-run-disaster-recovery-drill/"><i class="fas fa-external-link-alt"></i> </a>
<img align="right" src="https://docs.microsoft.com/en-us/learn/achievements/protect-infrastructure-with-azure-site-recovery.svg">
#### 1. How does Site Recovery support grouping of machines and workloads?
<i class='far fa-square'></i> Site Recovery Mobility service.
<i class='fas fa-check-square' style='color: Dodgerblue;'></i> Recovery plans.
<i class='far fa-square'></i> Azure Automation.
<br />
<br />
<br />
| 36.130435 | 192 | 0.709988 | eng_Latn | 0.414347 |
c990b033259bb871b4e479a8576c58c9ef489ff9 | 472 | md | Markdown | site/en/docs/handbook/how-to/add-a-youtube-embed/index.md | andreban/developer.chrome.com | c928d5d07e1387400a31c21d779b24bcf90b0365 | [
"Apache-2.0"
] | 3 | 2021-01-11T14:26:17.000Z | 2022-01-06T21:36:07.000Z | site/en/docs/handbook/how-to/add-a-youtube-embed/index.md | andreban/developer.chrome.com | c928d5d07e1387400a31c21d779b24bcf90b0365 | [
"Apache-2.0"
] | 1 | 2021-02-24T03:19:07.000Z | 2021-02-24T03:19:07.000Z | site/en/docs/handbook/how-to/add-a-youtube-embed/index.md | andreban/developer.chrome.com | c928d5d07e1387400a31c21d779b24bcf90b0365 | [
"Apache-2.0"
] | 1 | 2022-01-30T21:27:30.000Z | 2022-01-30T21:27:30.000Z | ---
layout: 'layouts/doc-post.njk'
title: Add a YouTube Embed
description: 'Add a YouTube embed to a post.'
date: 2020-11-30
---
## Add a YouTube Embed
To add an YouTube embed to a post you can use a custom shortcode.
{% raw %}
```md
{% youtube
id='whnms4CLJys'
%}
```
{% endraw %}
{% youtube
id='whnms4CLJys'
%}
You can also specify the startTime in the second parameter.
{% raw %}
```md
{% youtube
id='whnms4CLJys',
startTime='123'
%}
```
{% endraw %}
| 12.421053 | 65 | 0.635593 | eng_Latn | 0.946568 |
c990b25f452725319a11c78510d5bcfb7b522688 | 255 | md | Markdown | powerapps-docs/includes/pn-microsoft-dynamics-crm-help.md | FumioNakamura/powerapps-docs.ja-jp | 7ff4ce7a5fd619a46c85e7e0fef8df763a705d01 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | powerapps-docs/includes/pn-microsoft-dynamics-crm-help.md | FumioNakamura/powerapps-docs.ja-jp | 7ff4ce7a5fd619a46c85e7e0fef8df763a705d01 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | powerapps-docs/includes/pn-microsoft-dynamics-crm-help.md | FumioNakamura/powerapps-docs.ja-jp | 7ff4ce7a5fd619a46c85e7e0fef8df763a705d01 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
ms.openlocfilehash: 5da6a38288d111335ec924a9a4da8cc8728016ce
ms.sourcegitcommit: ad203331ee9737e82ef70206ac04eeb72a5f9c7f
ms.translationtype: MT
ms.contentlocale: ja-JP
ms.lasthandoff: 06/18/2019
ms.locfileid: "67233108"
---
Microsoft Dynamics 365 ヘルプ | 28.333333 | 60 | 0.843137 | yue_Hant | 0.252402 |
c991002089f34067e3992d965dc6d2c20a03bd4e | 786 | md | Markdown | content/test.md | Marv2/anax-flat | 0a409a16166b5bf52e8d56b2f78e68c4ee136086 | [
"MIT"
] | null | null | null | content/test.md | Marv2/anax-flat | 0a409a16166b5bf52e8d56b2f78e68c4ee136086 | [
"MIT"
] | null | null | null | content/test.md | Marv2/anax-flat | 0a409a16166b5bf52e8d56b2f78e68c4ee136086 | [
"MIT"
] | null | null | null | ---
views:
byline:
region: after-main
template: default/content
sort: 1
data:
meta:
type: content
route: block/byline
...
Rubriknivå 1
==============================================
Testsida för att skriva Markdown
Rubriknivå 2
----------------------------------------------
Ett helt vanligt stycke med brödtext. För att sriva ett vanligt stycke behövs räcker det med blankrad för att Markdown ska förstå intentionen och skapa ett nytt stycke.
### Rubriknivå 3
> Ett blockcitat med sitt första stycke.
>
> Andra stycket i citatet
>
> ## H2 i ett blockcitat.
Vissa ord är *kursiva* med asterisker.
Några ord är skrivna i _fet stil_ med understreck.
### Listor
* Nötter
* Kaffe
* Kantareller
| 19.65 | 168 | 0.57888 | swe_Latn | 0.999548 |
c9911c0ce6f146d0769f65203edb3eb4d70ab44f | 112 | md | Markdown | README.md | talkr-app/smooth-script | 294621b1ded53c968236dff6cd4bd6f96072d091 | [
"MIT"
] | 2 | 2021-08-18T21:08:20.000Z | 2022-03-13T16:23:30.000Z | README.md | talkr-app/smooth-script | 294621b1ded53c968236dff6cd4bd6f96072d091 | [
"MIT"
] | 5 | 2021-03-10T12:33:41.000Z | 2022-02-27T01:59:53.000Z | README.md | talkr-app/smooth-script | 294621b1ded53c968236dff6cd4bd6f96072d091 | [
"MIT"
] | 1 | 2020-05-02T22:01:46.000Z | 2020-05-02T22:01:46.000Z | # smooth-script
CYOA-style scripting language for talking avatars. Hosted example: https://smooth.talkrapp.com
| 37.333333 | 95 | 0.803571 | kor_Hang | 0.481034 |
c9918ed51f1d3aad73621c7c9a75e5231bbe894d | 56 | md | Markdown | _site/README.md | frc5024/PocketLogger | 644b49799291514cfbde0712dc0c101ea03f9429 | [
"MIT"
] | 1 | 2019-12-22T18:50:39.000Z | 2019-12-22T18:50:39.000Z | _site/README.md | frc5024/PocketLogger | 644b49799291514cfbde0712dc0c101ea03f9429 | [
"MIT"
] | null | null | null | _site/README.md | frc5024/PocketLogger | 644b49799291514cfbde0712dc0c101ea03f9429 | [
"MIT"
] | null | null | null | # PocketLogger
A tool for distributed logging at events
| 18.666667 | 40 | 0.821429 | eng_Latn | 0.996876 |
c99214b2f9cdb278b2a6f886143cc0940395be73 | 1,725 | md | Markdown | README.md | drewolson/mix_gleam | 5f8c7292f83b3cc4019a1c7a640fcf41702316fe | [
"Apache-2.0"
] | null | null | null | README.md | drewolson/mix_gleam | 5f8c7292f83b3cc4019a1c7a640fcf41702316fe | [
"Apache-2.0"
] | null | null | null | README.md | drewolson/mix_gleam | 5f8c7292f83b3cc4019a1c7a640fcf41702316fe | [
"Apache-2.0"
] | null | null | null | # MixGleam
An Elixir archive that teaches `Mix` how to work with Gleam code and
dependencies!
## Installation
Install the Gleam compiler onto your machine. [Installation instructions can
be found here here](https://gleam.run/getting-started/installing-gleam.html).
Install or update the `MixGleam` archive from Hex:
```shell
$ mix archive.install hex mix_gleam
```
To install or update from source:
```shell
$ mix archive.uninstall mix_gleam # if this archive was previously installed
$ git clone https://github.com/gleam-lang/mix_gleam.git
$ cd mix_gleam
$ MIX_ENV=prod mix do archive.build, archive.install
```
Configure your `Mix` project to use the `MixGleam` archive to work with Gleam's
compiler and Gleam dependencies:
```elixir
# in mix.exs
# ...
@app :my_gleam_app
def project do
[
app: @app,
# ...
archives: [mix_gleam: "~> 0.3.0"],
aliases: MixGleam.add_aliases(),
erlc_paths: ["build/dev/erlang/#{@app}/build"],
erlc_include_path: "build/dev/erlang/#{@app}/include",
# ...
]
end
# ...
```
To see an entire example `mix.exs` file you can adapt to your existing `Mix`
project:
```shell
$ mix gleam.new --retro
```
If you want to write Gleam code in your project, it's a good idea to add
`gleam_stdlib` and `gleeunit` to your project's dependencies:
```elixir
# in mix.exs
# ...
defp deps do
[
# ...
{:gleam_stdlib, "~> 0.18"},
{:gleeunit, "~> 0.5", only: [:dev, :test], runtime: false},
# ...
]
end
# ...
```
Make a `src` directory for your Gleam code to live in:
```shell
$ mkdir src
```
And add the `build` directory to your `.gitignore` file so Gleam's build
artefacts are not included in your project.
| 21.5625 | 79 | 0.664348 | eng_Latn | 0.935933 |
c993377e8ade6d90443be359cbe9075048f0818b | 32 | md | Markdown | README.md | sngkr/sngkr | f876775eccdb3b6f8e1453a158e55c80a8f5f655 | [
"MIT-0"
] | null | null | null | README.md | sngkr/sngkr | f876775eccdb3b6f8e1453a158e55c80a8f5f655 | [
"MIT-0"
] | null | null | null | README.md | sngkr/sngkr | f876775eccdb3b6f8e1453a158e55c80a8f5f655 | [
"MIT-0"
] | null | null | null | # xv6-labs-2020
# xv6-labs-2020
| 10.666667 | 15 | 0.6875 | vie_Latn | 0.332769 |
c994cedefbf8c84e7ae0f64c5bac1311bd866996 | 409 | md | Markdown | RELEASE_NOTES.md | RevuelArvida/PomodoroTelegramBot | c31e999b7b5e4e29cbf1bc68192f0de8268e7dea | [
"Apache-2.0"
] | null | null | null | RELEASE_NOTES.md | RevuelArvida/PomodoroTelegramBot | c31e999b7b5e4e29cbf1bc68192f0de8268e7dea | [
"Apache-2.0"
] | 11 | 2021-02-19T08:44:58.000Z | 2021-03-15T09:40:50.000Z | RELEASE_NOTES.md | RevuelArvida/PomodoroTelegramBot | c31e999b7b5e4e29cbf1bc68192f0de8268e7dea | [
"Apache-2.0"
] | null | null | null | ## 0.1.0-SNAPSHOT
* Created a skeleton of Spring boot application
## 0.2.0-Snapshot
* Added telegram bot api
* Added telegram bot starter
* Registered bot
## 0.3.0-Snapshot
* Added Command pattern
* Added State pattern
* Implemented menus
* All implemented features covered with tests
## 0.4.0-Snapshot
* PTB-8: added deployment process to the projec
## 0.5.0-Snapshot
* PTB-4: added scheduling features | 21.526316 | 49 | 0.740831 | eng_Latn | 0.979676 |
c994daff01d394c1cc23fb8234e4998eff462f86 | 1,368 | md | Markdown | terms-and-information.md | voicessoonheard/voicessoonheard.github.io | ee01914b1a99a833c49c4e88802b63d329dee2d7 | [
"MIT"
] | null | null | null | terms-and-information.md | voicessoonheard/voicessoonheard.github.io | ee01914b1a99a833c49c4e88802b63d329dee2d7 | [
"MIT"
] | null | null | null | terms-and-information.md | voicessoonheard/voicessoonheard.github.io | ee01914b1a99a833c49c4e88802b63d329dee2d7 | [
"MIT"
] | null | null | null | ---
title: terms-and-information
layout: default
permalink: /terms-and-information
---
# Terms and information
¡Hola! ¡Soy yo Wilson! Si está viendo esto, ¡debe significar que está considerando dejarme entrevistarlo! ¡Gracias por eso! Lea esto antes de continuar con el registro de la entrevista.
-Si se está inscribiendo para una entrevista, debe comprender que pueden suceder cosas. Si comparte su nombre completo, las personas que no creen en las mismas cosas que usted pueden tratar de encontrarlo y lastimarlo. No digo que esto esté garantizado, ¡pero tenlo en cuenta! -Debe tener entre 10 y 16 años para obtener estas entrevistas. Las otras edades también son muy importantes, ¡pero estoy tratando de representar a los niños más pequeños! No mientas sobre tu edad, por favor, ¡este es un proyecto importante y estas son reglas importantes! -No puede inscribir a otras personas sin su consentimiento. -No apruebo el lenguaje soez, así que si quieres una entrevista, no quiero escuchar ninguna maldición. ¡Gracias! -Sabe que es posible que no me comunique con usted de inmediato si se inscribe para una entrevista y se da cuenta de eso. -si tiene que cancelar su solicitud de entrevista o entrevista programada, contácteme con la dirección de correo electrónico que ha registrado -¡Eso es! ¡Gracias por considerarlo y espero poder hablar con ustedes algún día!
| 114 | 1,067 | 0.797515 | spa_Latn | 0.999409 |
c994ee29ad445fcad2b5744a96907f89824a0388 | 1,400 | md | Markdown | README.md | NajlaBioinfo/nextflow_tmpl | be5c2d5202690fe4d8e2431a8aa3cc0769a9fc84 | [
"MIT"
] | null | null | null | README.md | NajlaBioinfo/nextflow_tmpl | be5c2d5202690fe4d8e2431a8aa3cc0769a9fc84 | [
"MIT"
] | null | null | null | README.md | NajlaBioinfo/nextflow_tmpl | be5c2d5202690fe4d8e2431a8aa3cc0769a9fc84 | [
"MIT"
] | null | null | null | Nextflow Starter Template
=========================
This is a simple starter template for creating [Nextflow](https://www.nextflow.io) projects with [Docker](https://docs.docker.com/engine/installation/).
Prerequisites
-------------
- Nextflow
- Java 1.7+
- Docker
Quickstart
==========
Install Nextflow
----------------
```
$ curl -fsSL get.nextflow.io | bash
$ ./nextflow
$ mv nextflow /usr/local/bin
```
Clone Github Repository
-----------------------
```
$ git clone https://github.com/Najlabioinfo/nextflow_tmpl.git
$ cd nextflow_tmpl
```
Pull Docker Image
------------------
```
$ docker pull najlabioinfo/nextflowtuto
```
Usage
-----
```
$ nextflow run . --help
```
or
```
nextflow run main.nf --username myname --output prj210920/ --data prj210920/data/
```
or
```
$ nextflow run . -profile template --threads 2 --output output
```
Pipeline Options
----------------
Option | Description
--------- | -----------
help | `Display help message.`
threads | `Number of threads to use for each process.`
output | `Directory to write output files to.`
References
===========
https://github.com/ncbi/sra-tools/wiki/02.-Installing-SRA-Toolkit
https://www.ncbi.nlm.nih.gov/sra/docs/sradownload/#download-sequence-data-files-usi
https://learn.gencore.bio.nyu.edu/nextflow/#docker-step-7
https://github.com/nextflow-io/patterns
Contact
=======
[email protected]
License
=======
MIT | 19.444444 | 152 | 0.638571 | yue_Hant | 0.381859 |
c99540cbcefcf55ab883a515157331590df5e829 | 273 | md | Markdown | docs/connectors/jeton/index.md | paycoreio/docs.paycore.io | 003c7c12dfd02b2bd9d422d329af151c6dc8133d | [
"MIT"
] | 1 | 2018-11-16T12:58:51.000Z | 2018-11-16T12:58:51.000Z | docs/connectors/jeton/index.md | paycoreio/docs.paycore.io | 003c7c12dfd02b2bd9d422d329af151c6dc8133d | [
"MIT"
] | null | null | null | docs/connectors/jeton/index.md | paycoreio/docs.paycore.io | 003c7c12dfd02b2bd9d422d329af151c6dc8133d | [
"MIT"
] | null | null | null | <img src="https://static.openfintech.io/payment_providers/jeton/logo.png?w=400" width="400px" >
# Jeton
!!! question "Looking for help connecting your Jeton account?"
<!--email_off-->[Please contact our support team](mailto:{{custom.support_email}})<!--/email_off-->! | 45.5 | 104 | 0.717949 | eng_Latn | 0.693226 |
c9954654c050be886dd5bfc9c65f1c6aeec843be | 5,188 | md | Markdown | _posts/2018-04-24-C-plan.md | caster8013/terminus | 054f6618f6a64ea5ec67a9451b7754f567491174 | [
"MIT"
] | null | null | null | _posts/2018-04-24-C-plan.md | caster8013/terminus | 054f6618f6a64ea5ec67a9451b7754f567491174 | [
"MIT"
] | 1 | 2018-05-28T14:32:42.000Z | 2018-05-28T14:32:42.000Z | _posts/2018-04-24-C-plan.md | caster8013/terminus | 054f6618f6a64ea5ec67a9451b7754f567491174 | [
"MIT"
] | null | null | null | ---
layout: post
title: 那些珍贵的年轻人
date: 2018-04-24 20:50
categories: Archive
tags: 声援岳昕
description: 他们值得更好的社会
---
文章来自C计划：~~[那些珍贵的年轻人](https://mp.weixin.qq.com/s/_M55Zlcg_kaaLCjd4RPjSg)~~
作者：C计划-蓝方
---
**1\. 发生了什么？**
或许刚开始时，并没有人想到事态会如此发展。
四月初，一封实名检举信，指控原北大中文系教授沈阳在二十年前性侵女学生高岩，导致高岩自杀。当事人随即否认。舆论一片哗然。
还原事实的关键，在北大。调取二十年前校方对此案的调查档案，一定程度上有助于澄清真相。
作为对校方的监督，4 月 7 日，14 级本科生邓同学发帖表示自己将依据《北京大学校务公开实施办法》，申请学校公开 1998 年 7 月前后讨论沈阳 “师德” 问题的系列会议记录。在文章中，他呼吁更多同学一同行动、一起发声，向学校施压，提高信息公开的可能性。
文章发出后很快被删除，邓同学也被院方约谈至深夜。
第二天，4 月 8 日，北大主动公布了两份文件，分别是 1998 年学校和中文系给予沈阳行政警告处分的决定。文件中认为沈阳在与女学生高岩的交往中 “行为不当”。
但学生们认为信息披露仍不充分。4 月 9 日，还是有十位来自不同院系的北大在校生向学校递交了书面的信息公开申请。另外还有 15 名同学通过邮件递交了申请。他们要求公开的内容，包括 “党委相关会议记录”“西城区公安局对此事的调查结果通报”“中文系相关会议记录” 以及“沈阳在大会上公开检讨的内容”。
一些参与信息公开申请的同学发文称，在等待校方答复期间，他们多次被院方 “约谈”，有的还被 “请家长”，试图说服他们撤回申请。一位同学回忆，辅导员在谈话中曾提出 **“三条指控”**：怀疑提交信息公开申请的同学背后 “有组织有预谋”；怀疑这一行动受到境外组织的资金支持；申请当天有境外媒体试图入校，怀疑是申请的同学联系的。与境外组织的关系，是辅导员“约谈” 中反复询问的重点。
4 月 20 日，校方依据规定，向申请信息公开的同学作出答复。答复称，现有档案中没有同学们要求公开的信息。同时也承认，当时学校和院系管理工作并不规范健全。
4 月 22 日下午和晚上，外国语学院的辅导员 “出于对学生的关心”（外国语学院官方“情况说明” 中用语），试图联系参与申请信息公开的岳同学。在多次电话未接后，辅导员联系了岳同学家长，在凌晨来到岳同学宿舍，把她叫醒。岳同学后来发文称，辅导员要求她删除手机、电脑中所有与信息公开事件相关的资料，并保证不再介入此事。**她随后被家长带回，禁足家中。**
第二天，岳同学就自己深夜被 “强行约谈” 的经历发出公开信，谴责院方一系列行为。公开信以及所有讨论此事的文章、图片，几乎都被删除。
而删帖带来的却是舆论的反弹。删掉一篇文章，更多的声援文章在不同平台、以不同格式转发；文字版发不出，就转成图片版发；图片版被审查，就倒着发，斜着发，变着型发。
**屡发屡删，屡删屡发。**
**2\. 解决提出问题的人**
对北大来说，恐怕没有比这更糟糕的危机公关了。
人们甚至有点想不明白——**学生申请信息公开，如此简单的一件小事，校方为何会作出如此的过激反应。**
沈阳一案，已是二十年前的旧事。北大公布当年处理文件，后续引进沈阳的南京大学、上海师范大学跟进表态，建议沈阳辞职或解除与其聘任协议，此事已算告一段落。校方若将重心转移到反性侵、反性骚扰的制度建设，率先拿出具体方案、作出明确表态，反而会博得公众好感。
就算当年内部处分有所不妥，或者真是档案信息缺失，面对校内学生申请信息公开的穷追不舍，直面问题，承认二十年前的制度缺漏，承诺将完善制度、防范悲剧再次发生，也是体面正当的表态。
也有坊间猜测，多所高校学生参与到 metoo 活动中，引发更高层关于事态发展趋势的担忧，才迫使北大采取了相关行动。即便如此，各级管理机构也应该认识到，metoo 活动产生的根本原因是高校内部存在的性骚扰恶行。**直面问题，完善制度，才是平息舆论、行动最好的方式。**
然而，比起直面问题、承诺解决问题，北大和有关管理部门却选择了另一条看起来更直接、更简单的思路——**不要让问题暴露**。
**具体方法有三种：**
**－删帖**。以强硬姿态管控舆论。
**－让发帖人噤声**。直接向发帖人施加压力，或利用其家庭关系施加压力，使其不敢、不愿发声。
**－揣测动机**。怀疑发声者的动机，有 “校外势力”“不法分子”“境外媒体”“不良媒体” 在背后操纵。动机可疑，因而言行不端。
这三招，几乎是维稳思路下的标准流程。不仅此番风波中，在许多公共事件中，都能看到类似的操作。**解决问题太慢太麻烦，那就解决提出问题的人。**
当学生处在与学校、老师不对等的权力关系下，有太多利益可以被校方用以要挟。利用家庭关系施压，更是屡试不爽。**在中国社会，维权、行动、参与一类的词语距离普通人的生活遥远而陌生，是被污名、被审查的。**对于经历或者近距离见证过各种政治运动的老一辈人而言，所谓的公共行动，不仅是无用的、无意义的，也是危险的。**家长对孩子们的期望，简单而朴实：安全，稳定，集中时间和精力做那些 “有用” 的事。**当年轻一代表达出对公共事务的关注和参与，很少有家长不为此担忧。普通的中国家庭，代际之间普遍没有建立起清晰的个人界限，家长能轻而易举对子女进行道德、情感绑架。在让发声者沉默这件事情上，行动者的家人，总是权力最好的人质。
而 “境外势力”“别有用心的社会人员 “一类的说辞，也总会出现在各种公民行动的背后。我们很难知道，在学校老师们试图用这一套话语体系去分析学生们的行为时，他们仅仅是将这样的说法作为恐吓学生的工具，还是真诚的相信阴谋的存在。
**当年轻一代的学生们已经用现代公民的姿态，诉诸法律和制度，光明正大的要求对权力进行约束和监督时，校方和有关部门却还延续着阶级斗争的传统思路。**在这一思维模式下，学生们被默认是服从权威、没有主见的。当他们表达出对权威的质疑和叛逆，表达出独立的思考与诉求，就很可能是被与权威敌对的势力煽动、操控。
根本性的否定学生的独立人格，也因此会理所当然的将学生的家庭牵扯进来，以为家长是可以改变学生思考、认知的重要角色；也因为这种对学生独立人格的否定，不相信可以和他们进行理性、积极的对话，不认为可以和他们共同面对问题、解决问题，而本能地防范学生的参与和行动，认为那只会带来进一步的混乱。
**3\. 愤怒的力量**
**但在这次北大的风波中，我们看到的却是和这些预设截然不同的年轻一代。**
无论是最初发起信息公开申请的邓同学，还是被 “深夜约谈”、家人禁足的岳同学，TA 们足够年轻，足够聪明，足够精英。TA 们有独立的思考和言说，展示出强烈的社会责任感，以及对社会结构性不公的清醒认识。TA 们为弱者、为公义发声，TA 们相信法律和制度，坚韧而理性的参与公共。
<center>（岳同学的自我剖析，网上已被删除）</center>
**人们之所以会为北大的这件 “小事” 而愤怒，正在于这么好的年轻人，他们没有得到珍视，没有被褒扬，他们明明是让这个社会可以变得更好的希望和力量，却在被权力强硬的否定。**否定他们独立的人格，“绑架” 他们珍爱的家人，干涉他们的自主行为，压制所有声援的声音。
人们无比失望的看到，在最应该培养独立人格、自由思想的中国大学，在真正面临冲突、最需要年轻人担当的时刻，老师们却在有意无意的试图驯服年轻人的意气，把年轻人们对公共事务的热情转换成犬儒，而最终消解公共行动与言说的力量和意义。
然而，**愤怒应该是有力量的。**
愤怒应该指向对权力的约束。依靠制度，依靠法律，防止权力的滥用。
一所大学，乃至一个网络监管部门，没有权力逾越法律，删除、禁止公民的合法言论。当我们还会为同学们的遭遇感到愤怒，就更要大声发声、倡导。不因文章、帖子不断被删除而停止发声。甚至在必要时，用法律维护自己[发声的渠道](http://mp.weixin.qq.com/s?__biz=MzI5NjE2NzE0Ng==&mid=2650193884&idx=1&sn=9ccaee3b1446472e18a86a0098a2c7f3&chksm=f44a6c59c33de54f8419e003de8d9df7658a910b52504ed656d5b28af9fffe7c746e2b9347a9&scene=21#wechat_redirect)。
学生对学校事务的参与权、监督权，需要更明确的制度保障；而一所学校对学生行为的调查、干预，需要基于证据和事实，遵循一定的规则和程序，带有明显强制意味的” 约谈 “应被规范和限制。
除此之外，我们还需要表达对公共参与者的肯定、支持。[让更多人理解公共参与的逻辑](http://mp.weixin.qq.com/s?__biz=MzI5NjE2NzE0Ng==&mid=2650192428&idx=1&sn=a50febec8fbd38367c106994e2f074ec&chksm=f44a69a9c33de0bf0b6de89c4acbd4027e609a18f3b029f7716c20fb458716c49ce93b186672&scene=21#wechat_redirect)，并身体力行的参与到公共事务中。**让公共参与，不再是一件让家长、学校感到 “敏感”“危险” 的事情，而逐步成为现代公民生活的常态。**
**这些敢于指出问题，并愿意积极解决问题的年轻人，是北大的财富，更是整个社会的财富。**
他们值得起一个更好的社会。
**相关阅读**
- [做个精致的利己主义者，有问题吗？](http://mp.weixin.qq.com/s?__biz=MzI5NjE2NzE0Ng==&mid=2650192428&idx=1&sn=a50febec8fbd38367c106994e2f074ec&chksm=f44a69a9c33de0bf0b6de89c4acbd4027e609a18f3b029f7716c20fb458716c49ce93b186672&scene=21#wechat_redirect)
- [权利和更好的生活，不会自己从天上掉下来](http://mp.weixin.qq.com/s?__biz=MzI5NjE2NzE0Ng==&mid=2650193306&idx=1&sn=e1e62a0f38112dad1097723e33c5a1d4&chksm=f44a6e1fc33de709a525e8fd0617fb0d6d8d17e96088d9907d4d2b6210ce071f62f4acfc9154&scene=21#wechat_redirect)
- [删帖应对手册](http://mp.weixin.qq.com/s?__biz=MzI5NjE2NzE0Ng==&mid=2650193884&idx=1&sn=9ccaee3b1446472e18a86a0098a2c7f3&chksm=f44a6c59c33de54f8419e003de8d9df7658a910b52504ed656d5b28af9fffe7c746e2b9347a9&scene=21#wechat_redirect)
**最新课程与活动，扫码了解更多！**
作者系网易新闻－网易号 “各有态度” 的签约作者。未经特别说明，C 计划文章均为原创。文中署名的插图、脑图亦为原创。转载文章或原创插图、脑图，请联系小 C（Plan-C2016），或给后台留言。
| 39.907692 | 323 | 0.82421 | yue_Hant | 0.389995 |
c9955a03a1278e25748a262197469b65347a2526 | 7,034 | md | Markdown | platforms/hyperledger-fabric/configuration/roles/setup/config_block/sign_and_update/Readme.md | divyabhanu97/bevel | 8aea3958d8409d5c77e4e8d1213f3632d77ad0bc | [
"Apache-2.0"
] | 242 | 2019-10-17T02:17:31.000Z | 2021-11-25T06:40:45.000Z | platforms/hyperledger-fabric/configuration/roles/setup/config_block/sign_and_update/Readme.md | divyabhanu97/bevel | 8aea3958d8409d5c77e4e8d1213f3632d77ad0bc | [
"Apache-2.0"
] | 877 | 2019-10-28T11:10:12.000Z | 2021-11-26T10:39:04.000Z | platforms/hyperledger-fabric/configuration/roles/setup/config_block/sign_and_update/Readme.md | divyabhanu97/bevel | 8aea3958d8409d5c77e4e8d1213f3632d77ad0bc | [
"Apache-2.0"
] | 651 | 2019-10-16T19:09:39.000Z | 2021-12-01T19:11:00.000Z | [//]: # (##############################################################################################)
[//]: # (Copyright Accenture. All Rights Reserved.)
[//]: # (SPDX-License-Identifier: Apache-2.0)
[//]: # (##############################################################################################)
## ROLE: setup/config_block/sign_and_update
This role creates cli for the first peer of every existing organization in channel and get the modified config block signed by the admin of each organization.
### Tasks
(Variables with * are fetched from the playbook which is calling this role)
#### 1. Call valuefile when participant is new
This task calls valuefile
##### Input Variables
**include_tasks**: It includes the name of intermediatory task which is required for creating the value file for cli of peer, starting the cli and signing the block
**loop**: loops over result list fetched from *channel_participants*
**loop_control**: Specify conditions for controlling the loop.
loop_var: loop variable used for iterating the loop.
#### 2. Call nested_sign_and_update for each peer
This task calls nested_sign_and_update
##### Input Variables
*channel_name: Name of the channel
org_query: Query to get peer names for organizations
*org: First organization from the list of org_query
peer: first peer of the organization
config_block: name of the config block
**include_tasks**: It includes the name of intermediatory task which is required for creating the value file for cli of peer, starting the cli and signing the block
**loop**: loops over result list fetched from *channel_participants*
**loop_control**: Specify conditions for controlling the loop.
loop_var: loop variable used for iterating the loop.
#### 2. Call nested_update_channel for each peer
This task calls nested_update_channel
##### Input Variables
*channel_name: Name of the channel
org_query: Query to get peer names for organizations
*org: First organization from the list of org_query
peer: first peer of the organization
config_block: name of the config block
**include_tasks**: It includes the name of intermediatory task which is required for creating the value file for cli of peer, starting the cli and signing the block
**loop**: loops over result list fetched from *channel_participants*
**loop_control**: Specify conditions for controlling the loop.
loop_var: loop variable used for iterating the loop.
------------
### nested_sign_and_update.yaml
This task initiates the signing of all the admins of existing network on the configuration block
### Tasks
#### 1. create value file for cli {{ *peer_name* }}
This task creates valuefile for the peer.
##### Input Variables
*component_type_name: Name of the organization
*component_type: Name of the valuefile template
*component_name: Component name
*peer_name: Name of the peer
*peer_address: Peer gossip address
*component_ns: Namespace
*vault: Organization vault
*channel_name: Channel name
*release_dir: Path for the valufile
storage_class: Storage class of of the organization
#### 2. start cli for the creator organization for the {{ *channel_name* }}
This task creates the cli for the valuefile created in last step.
##### Input Variables
*build_path: The path of build directory.
*config_file: Kubernetes file
*playbook_dir: Path for the playbook directory
*chart_source: Path for the charts directory
#### 3. waiting for the fabric cli
This task wait for the fabric cli generated in the previous step to get into running state.
##### Input Variables
namespace: Namespace of the organization
kubeconfig: kubeconfig file
##### Output Variables
get_cli: This variable stores the output of check if fabric cli is present query.
#### 4. Signing from the admin of {{ *organization_name* }}
This task get the modified configuration block signed from the admin of existing organization.
##### Input Variables
*config_file: Kubernetes file
*kubernetes: Kubernetes cluster information of the organization
#### 5. delete the cli
This task creates the cli for the creator organization first peer.
##### Input Variables
*config_file: Kubernetes file
------------
### nested_update_channel.yaml
This task get the block signed by the reator organization and then updates the channel by modified config block
### Tasks
#### 1. create value file for cli {{ *peer_name* }}
This task creates valuefile for the peer.
##### Input Variables
*component_type_name: Name of the organization
*component_type: Name of the valuefile template
*component_name: Component name
*peer_name: Name of the peer
*peer_address: Peer gossip address
*component_ns: Namespace
*vault: Organization vault
*channel_name: Channel name
*release_dir: Path for the valufile
storage_class: Storage class of of the organization
#### 2. start cli for the creator organization for the {{ *channel_name* }}
This task creates the cli for the valuefile created in last step.
##### Input Variables
*build_path: The path of build directory.
*config_file: Kubernetes file
*playbook_dir: Path for the playbook directory
*chart_source: Path for the charts directory
#### 3. waiting for the fabric cli
This task wait for the fabric cli generated in the previous step to get into running state.
##### Input Variables
namespace: Namespace of the organization
kubeconfig: kubeconfig file
##### Output Variables
get_cli: This variable stores the output of check if fabric cli is present query.
#### 4. Updating the channel with the new configuration block
This task get the modified configuration block signed from the admin of creator organization and updates the channel.
##### Input Variables
*config_file: Kubernetes file
*kubernetes: Kubernetes cluster information of the organization
#### 5. delete the cli
This task creates the cli for the creator organization first peer.
##### Input Variables
*config_file: Kubernetes file
------------
### valuefile.yaml
This task performs a check if the new organization peers are up
### Tasks
#### 1. Check peer pod is up
This task creates valuefile for the peer.
##### Input Variables
*org_query: New organization information
*peer_data: Peer information
**include_tasks**: It includes the name of intermediatory task which is required for creating the value file for cli of peer, starting the cli and signing the block
**loop**: loops over result list fetched from *channel_participants*
**loop_control**: Specify conditions for controlling the loop.
loop_var: loop variable used for iterating the loop.
------------
### peercheck.yaml
This task performs a check if the new organization peers are up
### Tasks
#### 1. Check peer pod is up
This task creates valuefile for the peer.
##### Input Variables
*namespace: Namespace of the new organization
*kubeconfig: Kubeconfig information
| 38.021622 | 164 | 0.720216 | eng_Latn | 0.991915 |
c9956108f72d2f3a4f47540b5615816b84e03e65 | 1,208 | md | Markdown | spy-games-python-greyatom/README.md | Shreeya-singh1998/greyatom-python-for-data-science | eb25d514df50509b7792f0136ae75748d97b6b3d | [
"MIT"
] | null | null | null | spy-games-python-greyatom/README.md | Shreeya-singh1998/greyatom-python-for-data-science | eb25d514df50509b7792f0136ae75748d97b6b3d | [
"MIT"
] | null | null | null | spy-games-python-greyatom/README.md | Shreeya-singh1998/greyatom-python-for-data-science | eb25d514df50509b7792f0136ae75748d97b6b3d | [
"MIT"
] | null | null | null | ### Project Overview
my project includes overview of string functions, and Lambda functions accompanied by High order functions like map() in python.
I have learnt to merge two messages and how to perfectly write message using python codes.
### Learnings from the project
I have completed two projects with grey atom, the recent of them was Spy-games project. With each processes of the project I gained prior knowledge of handling problems with python and was able to understand topics taught to me by grey atom more. I learnt to code for forming messages and merging them prior to obtain outputs .
### Approach taken to solve the problem
I used alot of hints (_which i know i should've avoided_) because i was very new to the python until today. I found this topic hard, but with daily practice i know i will excel.
### Challenges faced
In the beginning i could'nt understand the algorithm, but coming to the end of project i can code now.
### Additional pointers
avoid using hints and seeing solutions, but there is a problem with this window, it does not run even if u have written right codes, sometimes. so i had to tally my solutions but found no errors still i lost my marks!
| 43.142857 | 329 | 0.774007 | eng_Latn | 0.999951 |
c996f52768e1e22122e0b0b0d020aee14037a689 | 461 | md | Markdown | README.md | kaphacius/swift-map | 45625dae733a4ce5ffbdbbd5fdd3a0e4e5b4b509 | [
"MIT"
] | 1 | 2021-09-15T08:16:39.000Z | 2021-09-15T08:16:39.000Z | README.md | kaphacius/swiftui-map | 45625dae733a4ce5ffbdbbd5fdd3a0e4e5b4b509 | [
"MIT"
] | null | null | null | README.md | kaphacius/swiftui-map | 45625dae733a4ce5ffbdbbd5fdd3a0e4e5b4b509 | [
"MIT"
] | null | null | null | # swiftui-map
### Experimenting with SwiftUI+Map
##### To run the project you need to obtain a `client_key` and `client_secret` for Foursquare API.
1. Sign Up [here](https://foursquare.com/log-in/)
2. Go to [My (your) apps](https://foursquare.com/developers/apps).
3. Create an app.
4. Paste your `client_key` and `client_secret` into `SwiftUI_MapApp.swift`, lines `#18` and `#19` respectively.
5. Delete `#warning` at line `#15` and you are good to go!
6. 🚀
| 41.909091 | 112 | 0.707158 | eng_Latn | 0.947993 |
c9972cc4994006e82aaf3bc51561cc960072a1b5 | 3,445 | md | Markdown | gatsby/content/posts/from-wordpress-to-gatsby.md | gatsbycentral/gcWeb | 10cdf5f6bbc69c60f004acc2821d724a372370e6 | [
"MIT"
] | 4 | 2018-07-28T19:12:14.000Z | 2020-06-15T07:46:47.000Z | gatsby/content/posts/from-wordpress-to-gatsby.md | gatsbycentral/gcWeb | 10cdf5f6bbc69c60f004acc2821d724a372370e6 | [
"MIT"
] | 35 | 2018-02-28T13:48:40.000Z | 2022-02-26T10:09:09.000Z | gatsby/content/posts/from-wordpress-to-gatsby.md | gatsbycentral/gcWeb | 10cdf5f6bbc69c60f004acc2821d724a372370e6 | [
"MIT"
] | 2 | 2019-08-02T00:49:18.000Z | 2019-09-02T05:11:36.000Z | ---
path: "/from-wordpress-to-gatsby"
title: From WordPress to Gatsby
date: "2018-05-28"
---
You have a WordPress blog. You've heard that Gatsby is all kinds of awesome. You want to switch. Well sit tight, this is gonna be a journey.
> **tl;dr** - Moving content from WordPress to Gatsby will be painful. Consider starting a new blog on Gatsby instead. Or budget 1-2 days and get ready to dig in.
You've heard about Gatsby. Great. Do you understand the basics of how Gatsby handles data? Read our [intro to data flow article](/introduction-to-gatsby-data-flow) if not. Read it now. The rest of this article will be much easier afterwards.
## Content
The first and biggest question. Where will your content live?
### Keep it in WordPress
You could keep the content in WordPress. Gatsby can pull content from WordPress. There are some considerations. This would be a simple strategy.
* Move WordPress to a new domain
* Enable the "Discourage search engines from indexing this site" setting in WordPress (Settings > Reading)
* Connect Gatsby to WordPress
#### Updates
Gatsby needs to know when your content changes. You need to trigger a rebuild on every change in WordPress. You could use a webhook plugin for that. If you use netlify to build your site, they support webhooks also.
### Content in git
Keeping content in WordPress is possible, but in most cases, not the best solution. Gatsby is all about static. When your content lives in git, your life will be easier.
You can export your WordPress content for jekyll. There's a good export plugin. Then you can use that jekyll formatted content in Gatsby. Magic.
#### Export
The export process can be painful. You might need to make some changes. Your photos, videos, and other media might not work 100%. There's no simple, one click solution here. Unfortunately.
## React
WordPress uses its own templating engine. Gatsby is built on React. You will need to build (or choose) a new theme for Gatsby. There is no simple way to use your WordPress theme in Gatsby.
Pick a Gatsby starter. This will save you a ton of time. Tweak the theme later.
## Comments
Do you want to support comments? The simplest answer is no. They're mostly spam anyway!
If you do want to support comments, see our [comments in Gatsby article](/how-to-handle-comments-in-gatsby-blogs). You will need to export and import your comments. This could be tricky.
## Start over?
Moving content from WordPress to Gatsby can be painful. There's no simple solution, no easy shortcuts. It would be much easier to start with a brand new blog. If you have a lot of content, or a long history, this might not make sense. Give the idea serious consideration. You might well decide later this would have been the smarter move!
## Keep it simple
WordPress is incredibly powerful. There are thousands of plugins available. Thousands of theme choices. The simpler you keep your blog, the easier the migration will be. Fancy image galleries, embedded rich media content, things like this will make the migration much harder.
## Is it worth it?
WordPress is a pretty good CMS. Gatsby is a much better choice for a new project. But for an existing blog, with a lot of content, or complex content, you might find staying with WordPress is the smarter choice. At least for now. The process will get easier in time. Do you really need all of Gatsby's awesomeness today? Give it some thought.
Above all else, good luck!
| 54.68254 | 342 | 0.770682 | eng_Latn | 0.998093 |
c998461791c02e6c96b972cbf67535ff5f7270a2 | 1,723 | md | Markdown | library/Readme.md | jvelilla/wrap_kafka | 8c5391ca26673ac9fe1bf8b0f437aae042ab0fe3 | [
"EFL-2.0"
] | 4 | 2019-09-28T01:27:43.000Z | 2021-08-06T06:58:50.000Z | library/Readme.md | jvelilla/wrap_kafka | 8c5391ca26673ac9fe1bf8b0f437aae042ab0fe3 | [
"EFL-2.0"
] | 2 | 2019-11-15T15:06:36.000Z | 2020-03-04T12:30:49.000Z | library/Readme.md | jvelilla/wrap_kafka | 8c5391ca26673ac9fe1bf8b0f437aae042ab0fe3 | [
"EFL-2.0"
] | 3 | 2020-05-29T14:42:17.000Z | 2021-02-19T21:46:53.000Z | # How to generate the code?
## Requirements
You need to have a binary version of WrapC tool and be able to execute it from the library folder.
Before to regenerate the generated code, remove the folder `generated_wrapper`. If you are using geant, just run `geant clean` in other
case remove it manually.
## Using Automated scripts
Automated scripts will run wrapc with pre and post processing scripts and compiling the C glue code
needed for the library.
### Windows
```
generator.bat
```
### Linux
```
./generator.sh
```
## Using WrapC with geant
$LIB_PATH is the path to the library folder where you checkout the WrapC source code. For example c:/WrapC/examples/$template.
### Wrap libusb library
Go to the $LIB_PATH/library
```
geant wrap_c -- Wrap C the c simple example and generate the code under the folder generated_wrapper
```
### Compile the C library
```
geant compile -- Build the C library, in this case generate the eif_$template.(lib|a)
```
***
### Clean the generated code
```
geant clean
```
## Using WrapC without geant
In this option, you will need to copy by hand the specific Makefiles and
move the c code from manual_wrapper folder to the generated_wrapper to make it
work.
$LIB_PATH is the path to the library folder where you checkout the wrap_libusb library.
At the moment the tool require --output-dir and --full-header to be full paths.
$HEADER_TEMPLATE_PATH is the path to the library where the template header is located.
### WrapC
```
wrap_c --verbose --output-dir=$LIB_PATH/library/generated_wrapper --full-header=$HEADER_TEMPLATE_PATH config.xml
```
### Compile the C library
```
cd generated_wrapper\c\src
finish_freezing -library
```
| 24.971014 | 136 | 0.734765 | eng_Latn | 0.99184 |
c99846c1a07417d3c32009888c177436e8fb5098 | 1,278 | md | Markdown | windows-driver-docs-pr/devtest/where-are-the-tracing-samples-.md | sarman1998/windows-driver-docs | 790f8ecb851d5c9e423af03a8a57dfac59945c24 | [
"CC-BY-4.0",
"MIT"
] | 1 | 2018-08-23T07:40:03.000Z | 2018-08-23T07:40:03.000Z | windows-driver-docs-pr/devtest/where-are-the-tracing-samples-.md | sarman1998/windows-driver-docs | 790f8ecb851d5c9e423af03a8a57dfac59945c24 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | windows-driver-docs-pr/devtest/where-are-the-tracing-samples-.md | sarman1998/windows-driver-docs | 790f8ecb851d5c9e423af03a8a57dfac59945c24 | [
"CC-BY-4.0",
"MIT"
] | 1 | 2020-02-25T05:28:44.000Z | 2020-02-25T05:28:44.000Z | ---
title: Where are the tracing samples
description: Where are the tracing samples
ms.assetid: 68882242-4956-4492-b3ac-e93b67a993a2
ms.author: windowsdriverdev
ms.date: 04/20/2017
ms.topic: article
ms.prod: windows-hardware
ms.technology: windows-devices
---
# Where are the tracing samples?
[TraceDrv](http://go.microsoft.com/fwlink/p/?LinkId=617726) is a sample driver that was designed to demonstrate WPP software tracing. TraceDrv is available in the [Windows driver samples](http://go.microsoft.com/fwlink/p/?LinkId=616507 ) repository on GitHub.
The TraceDrv sample also includes TraceCtl, an application that starts TraceDrv and causes it to generate trace messages.
[Toaster](http://go.microsoft.com/fwlink/p/?linkid=256195), the general sample driver in the WDK, is also instrumented for [WPP software tracing](wpp-software-tracing.md). It is also available from [Windows hardware development samples](http://go.microsoft.com/fwlink/p/?LinkId=618052).
[Eventdrv](http://go.microsoft.com/fwlink/p/?LinkId=617724) is a sample that demonstrates how to implement [Event Tracing for Windows (ETW)](event-tracing-for-windows--etw-.md) in a driver. The ETW kernel-mode API was introduced with Windows Vista and is not supported in earlier operating systems.
| 41.225806 | 298 | 0.780125 | eng_Latn | 0.97174 |
c9987adb7cf1c948d6c7ab46e6abb8839ef31dfa | 3,407 | md | Markdown | content/toplevel.md | bluddy/ocaml_world | 6709b9014bee8ee6482ac8808e21475046301801 | [
"CC0-1.0"
] | 130 | 2018-05-17T20:33:23.000Z | 2022-03-05T21:07:36.000Z | content/toplevel.md | bluddy/ocaml_world | 6709b9014bee8ee6482ac8808e21475046301801 | [
"CC0-1.0"
] | 104 | 2018-05-17T20:03:29.000Z | 2022-03-23T07:28:22.000Z | content/toplevel.md | bluddy/ocaml_world | 6709b9014bee8ee6482ac8808e21475046301801 | [
"CC0-1.0"
] | 60 | 2018-05-17T19:38:13.000Z | 2022-03-22T22:26:48.000Z | # OCaml REPL (Toplevel)
OCaml has a very powerful REPL, which can be used to explore your code during development.
* [utop](https://github.com/ocaml-community/utop)
is an alternative, advanced REPL with support for tab completion and other features.
It's highly recommended to use `utop` instead of the standard REPL.
* The regular REPL is started simply with `ocaml`.
* To make OCaml packages available to ocaml, we need to use the topfind utility,
which is installed as a part of the ocamlfind package.
If you're using `ocaml`, your first command should be
```
#use "topfind";;
```
Note the `#` symbol that precedes all directives to the REPL (ie. not ocaml calls).
* The `~/.ocamlinit` file is executed as soon as you start up the toplevel.
For regular `ocaml`, you want to insert the `#use "topfind;;"` line in there.
* Note also the `;;` that follows every phrase in the toplevel.
Since OCaml uses `;` for statements and lists, we need some way to tell it when to process our commands.
That's what `;;` is for.
* View all possible directives with `#help;;`
* You can now list all available libraries with
```
#list;;
```
* And easily load a library with
```
#require "library";;
```
Note how we use a string for the library name. For example:
```
#require "graphics";;
```
## Printers.
While OCaml will try its best to print everything, it doesn't know about custom data structures.
You can install your own printers for different types.
You can have many different printers for your data, to give you different views on what is going on,
so that you can switch between one and another.
The `#install_printer` directive enables custom printers for your data, which is very useful during development and debugging.
It takes a function, which should have the type
```ocaml
Format.formatter -> t -> unit
```
where t is the type of your data, e.g.,
```ocaml
type t = Student of int
let pp_name ppf (Student id) =
Format.fprintf ppf "%s" (Hashtbl.find_exn names id)
```
and now we can install it,
```
#install_printer pp_name
```
## Tracing
OCaml toplevels also provide a nice feature called tracing,
which shows how your functions are invoked and what they return..
This is especially powerful with custom printers.
To trace a function use the `#trace` directive, e.g.,
```
#trace find_best_student;;
```
To stop tracing use `#untrace`
## Developing Large Applications
* REPL driven development best fits the bottom-up style of development.
If you keep your modules small and independent, you can minimize the context needed to debug with the REPL.
You can debug each piece of an application independently, and then load the piece using `#require`.
* Dune contains utop integration which will allow you to run your project.
* Another trick is to stub a needed library with a dummy interface:
```ocaml
(* let's stub some complex external library which is developed
by some other guy, and is still not yet ready *)
module Database : Database.S = struct
type t = string
let connect str = printf "connect %s" str;
let select conn query =
printf "%s> %s" conn query;
[]
end
(* here comes our code that needs the database, which is not yet ready,
but it doesn't stop us anymore *)
let start_driving env =
let db = Database.connect env.main_host in
let waypoints = Database.select db waypoints_query in
drive_through waypoints
```
| 29.119658 | 126 | 0.732316 | eng_Latn | 0.999168 |
c9987d6bd7947a04083b1abbc63b74b466761505 | 5,229 | md | Markdown | _posts/2021-01-19-superintendent-manahan-to-retire.md | Snoqualmie-Valley-Citizens-for-Schools/svcs.github.io | e357658196ed4921332f8e311d4f53255124badb | [
"CC0-1.0"
] | null | null | null | _posts/2021-01-19-superintendent-manahan-to-retire.md | Snoqualmie-Valley-Citizens-for-Schools/svcs.github.io | e357658196ed4921332f8e311d4f53255124badb | [
"CC0-1.0"
] | null | null | null | _posts/2021-01-19-superintendent-manahan-to-retire.md | Snoqualmie-Valley-Citizens-for-Schools/svcs.github.io | e357658196ed4921332f8e311d4f53255124badb | [
"CC0-1.0"
] | null | null | null | ---
layout: post
title: Superintendent Manahan to retire at end of school year
date: 2021-01-19
author: Chris Alef
image: /assets/img/RobManahan.webp
---
Snoqualmie Valley School District Superintendent Robert W. Manahan will retire at the end of this 2020-21 school year. His letter to the community follows:
> January 14, 2021
>
> Dear Snoqualmie Valley families,
>
> It has been a tremendous honor to serve the students, staff and families of Snoqualmie Valley for the past three years. After 37 years in public education, I have made the difficult decision to retire at the end of this school year. This decision is coming earlier than planned, and with mixed feelings. It is prompted in part by a health “reality check” that we sometimes face, which calls for reflecting on life goals. For me, I believe this July will be the right to make my transition into retirement and spend more time with my family.
>
> Throughout my career, I have been surrounded by incredible and inspiring education professionals. Not only teachers, but all those who serve in our school districts to support the academic, social, physical, and emotional growth and well-being of the students and families we serve. In just three years at SVSD, I have seen our staff give extraordinary effort, time and energy to better the lives of our students. This includes our secretaries, bus drivers, mechanics, custodians, paraeducators, food service staff, maintenance and operations crew, and technology professionals. Going beyond the call of duty does not begin to describe the work of our teachers and staff within this district. I often state that their jobs are to change the world and create miracles every day. Indeed, they have, and they do.
>
> I also want to convey how much I appreciate this community, whose support has meant the world to me. I was accepted with open arms from my first day in this community. My wife, family and I have enjoyed every minute here discovering this region and this community that is so friendly and passionate about education, creating a community that cares for one another. Thank you so much for welcoming my family and I. Remember, great communities make great schools, and great schools make great communities. You have an exceptional community here in the Valley and an exceptional school district. While these times are particularly challenging, I know that together, with the support and collaboration of one another, you will make it through to the other side -- stronger, more resilient and even more focused on meeting the needs of all students in the Valley.
>
> During my time serving Snoqualmie Valley schools I’ve had the privilege of celebrating some historic accomplishments and tackled some unprecedented challenges. As I look back, opening the amazing new Mount Si High School campus will always be a highlight and source of great pride, knowing the positive impact this will have on SVSD students for years to come. To help equip students for life after graduation, I so appreciated the staff/student/community collaboration that helped to define Snoqualmie Valley’s Portrait of a Graduate goals, prioritizing the key characteristics we are working to instill in every graduate to help them find success and satisfaction in life and the career path they choose.
>
> More recently, I am proud of the work that has begun to increase community discussions around Diversity Equity and Inclusion practices and provide staff training focused on ensuring we serve and support EVERY student well. And, while the COVID pandemic has certainly challenged us in ways we never could a have predicted, I believe there are positive and lasting benefits we will take from this experience. Improving the health and safety of our school environment, empowering our teachers with new skills and resources to showcase their creativity, cherishing relationships - especially with students, and strengthening personal characteristics of resilience, adaptability, and independence are a few that come to mind.
>
> While my time here is shorter than I had hoped for, I do hope that staff, students, families and this community felt from me that they are respected, valued, capable, loved and that they belong to a district that is caring and compassionate. I still believe that, “Education is the most powerful weapon you can use to change the world.” I have seen this happen here in the Snoqualmie Valley School District and I know it will continue to happen in years to follow.
>
> I am sharing this decision now with the hope that the School Board will have as much time as possible to conduct a thorough and comprehensive search process to hire an exceptional superintendent that this amazing school district deserves. In the meantime, I look forward to completing this school year with the same passion and commitment that I have given over these past three years and throughout my career. You have my assurance that I will continue focus on what is best for our students, staff and families during these unprecedented times.
>
> You have all taught me so much and I am honored to have served this district.
>
> Respectfully,
>
> Robert Manahan
| 149.4 | 860 | 0.802639 | eng_Latn | 0.999949 |
c99880ec01c2bce48e8f22fc1763bc9f45f661c8 | 16,112 | md | Markdown | datasets/quac/README.md | NihalHarish/datasets | 67574a8d74796bc065a8b9b49ec02f7b1200c172 | [
"Apache-2.0"
] | 9 | 2021-04-26T14:43:52.000Z | 2021-11-08T09:47:24.000Z | datasets/quac/README.md | NihalHarish/datasets | 67574a8d74796bc065a8b9b49ec02f7b1200c172 | [
"Apache-2.0"
] | null | null | null | datasets/quac/README.md | NihalHarish/datasets | 67574a8d74796bc065a8b9b49ec02f7b1200c172 | [
"Apache-2.0"
] | 1 | 2022-02-28T18:08:09.000Z | 2022-02-28T18:08:09.000Z | ---
annotations_creators:
- crowdsourced
language_creators:
- crowdsourced
- found
languages:
- en
licenses:
- mit
multilinguality:
- monolingual
size_categories:
- 10K<n<100K
source_datasets:
- extended|wikipedia
task_categories:
- question-answering
- sequence-modeling
task_ids:
- dialogue-modeling
- extractive-qa
---
# Dataset Card Creation Guide
## Table of Contents
- [Dataset Description](#dataset-description)
- [Dataset Summary](#dataset-summary)
- [Supported Tasks](#supported-tasks-and-leaderboards)
- [Languages](#languages)
- [Dataset Structure](#dataset-structure)
- [Data Instances](#data-instances)
- [Data Fields](#data-instances)
- [Data Splits](#data-instances)
- [Dataset Creation](#dataset-creation)
- [Curation Rationale](#curation-rationale)
- [Source Data](#source-data)
- [Annotations](#annotations)
- [Personal and Sensitive Information](#personal-and-sensitive-information)
- [Considerations for Using the Data](#considerations-for-using-the-data)
- [Social Impact of Dataset](#social-impact-of-dataset)
- [Discussion of Biases](#discussion-of-biases)
- [Other Known Limitations](#other-known-limitations)
- [Additional Information](#additional-information)
- [Dataset Curators](#dataset-curators)
- [Licensing Information](#licensing-information)
- [Citation Information](#citation-information)
- [Contributions](#contributions)
## Dataset Description
- **Homepage:** [QuAC](https://quac.ai/)
- **Paper:** [QuAC: Question Answering in Context](https://arxiv.org/abs/1808.07036)
- **Leaderboard:** [QuAC's leaderboard](https://quac.ai/)
- **Point of Contact:** [Google group](https://groups.google.com/forum/#!forum/quac_ai)
### Dataset Summary
Question Answering in Context is a dataset for modeling, understanding, and participating in information seeking dialog. Data instances consist of an interactive dialog between two crowd workers: (1) a student who poses a sequence of freeform questions to learn as much as possible about a hidden Wikipedia text, and (2) a teacher who answers the questions by providing short excerpts (spans) from the text. QuAC introduces challenges not found in existing machine comprehension datasets: its questions are often more open-ended, unanswerable, or only meaningful within the dialog context.
### Supported Tasks and Leaderboards
The core problem involves predicting a text span to answer a question about a Wikipedia section (extractive question answering). Since QuAC questions include a dialog component, each instance includes a “dialog history” of questions and answers asked in the dialog prior to the given question, along with some additional metadata.
Authors provided [an official evaluation script](https://s3.amazonaws.com/my89public/quac/scorer.py) for evaluation.
### Languages
The text in the dataset is in English. The associated BCP-47 code is `en`.
## Dataset Structure
### Data Instances
A validation examples looks like this (one entry per dialogue):
```
{
'dialogue_id': 'C_6abd2040a75d47168a9e4cca9ca3fed5_0',
'wikipedia_page_title': 'Satchel Paige',
'background': 'Leroy Robert "Satchel" Paige (July 7, 1906 - June 8, 1982) was an American Negro league baseball and Major League Baseball (MLB) pitcher who became a legend in his own lifetime by being known as perhaps the best pitcher in baseball history, by his longevity in the game, and by attracting record crowds wherever he pitched. Paige was a right-handed pitcher, and at age 42 in 1948, he was the oldest major league rookie while playing for the Cleveland Indians. He played with the St. Louis Browns until age 47, and represented them in the All-Star Game in 1952 and 1953.',
'section_title': 'Chattanooga and Birmingham: 1926-29',
'context': 'A former friend from the Mobile slums, Alex Herman, was the player/manager for the Chattanooga White Sox of the minor Negro Southern League. In 1926 he discovered Paige and offered to pay him $250 per month, of which Paige would collect $50 with the rest going to his mother. He also agreed to pay Lula Paige a $200 advance, and she agreed to the contract. The local newspapers--the Chattanooga News and Chattanooga Times--recognized from the beginning that Paige was special. In April 1926, shortly after his arrival, he recorded nine strikeouts over six innings against the Atlanta Black Crackers. Part way through the 1927 season, Paige\'s contract was sold to the Birmingham Black Barons of the major Negro National League (NNL). According to Paige\'s first memoir, his contract was for $450 per month, but in his second he said it was for $275. Pitching for the Black Barons, Paige threw hard but was wild and awkward. In his first big game in late June 1927, against the St. Louis Stars, Paige incited a brawl when his fastball hit the hand of St. Louis catcher Mitchell Murray. Murray then charged the mound and Paige raced for the dugout, but Murray flung his bat and struck Paige above the hip. The police were summoned, and the headline of the Birmingham Reporter proclaimed a "Near Riot." Paige improved and matured as a pitcher with help from his teammates, Sam Streeter and Harry Salmon, and his manager, Bill Gatewood. He finished the 1927 season 7-1 with 69 strikeouts and 26 walks in 89 1/3 innings. Over the next two seasons, Paige went 12-5 and 10-9 while recording 176 strikeouts in 1929. (Several sources credit his 1929 strikeout total as the all-time single-season record for the Negro leagues, though there is variation among the sources about the exact number of strikeouts.) On April 29 of that season he recorded 17 strikeouts in a game against the Cuban Stars, which exceeded what was then the major league record of 16 held by Noodles Hahn and Rube Waddell. Six days later he struck out 18 Nashville Elite Giants, a number that was tied in the white majors by Bob Feller in 1938. Due to his increased earning potential, Barons owner R. T. Jackson would "rent" Paige out to other ball clubs for a game or two to draw a decent crowd, with both Jackson and Paige taking a cut. CANNOTANSWER',
'turn_ids': ['C_6abd2040a75d47168a9e4cca9ca3fed5_0_q#0', 'C_6abd2040a75d47168a9e4cca9ca3fed5_0_q#1', 'C_6abd2040a75d47168a9e4cca9ca3fed5_0_q#2', 'C_6abd2040a75d47168a9e4cca9ca3fed5_0_q#3', 'C_6abd2040a75d47168a9e4cca9ca3fed5_0_q#4', 'C_6abd2040a75d47168a9e4cca9ca3fed5_0_q#5', 'C_6abd2040a75d47168a9e4cca9ca3fed5_0_q#6', 'C_6abd2040a75d47168a9e4cca9ca3fed5_0_q#7'],
'questions': ['what did he do in Chattanooga', 'how did he discover him', 'what position did he play', 'how did they help him', 'when did he go to Birmingham', 'how did he feel about this', 'how did he do with this team', 'What made him leave the team'],
'followups': [0, 2, 0, 1, 0, 1, 0, 1],
'yesnos': [2, 2, 2, 2, 2, 2, 2, 2]
'answers': {
'answer_starts': [
[480, 39, 0, 67, 39],
[2300, 2300, 2300],
[848, 1023, 848, 848, 1298],
[2300, 2300, 2300, 2300, 2300],
[600, 600, 600, 634, 600],
[2300, 2300, 2300],
[939, 1431, 848, 848, 1514],
[2106, 2106, 2165]
],
'texts': [
['April 1926, shortly after his arrival, he recorded nine strikeouts over six innings against the Atlanta Black Crackers.', 'Alex Herman, was the player/manager for the Chattanooga White Sox of the minor Negro Southern League. In 1926 he discovered Paige', 'A former friend from the Mobile slums, Alex Herman, was the player/manager for the Chattanooga White Sox of the minor Negro Southern League.', 'manager for the Chattanooga White Sox of the minor Negro Southern League. In 1926 he discovered Paige and offered to pay him $250 per month,', 'Alex Herman, was the player/manager for the Chattanooga White Sox of the minor Negro Southern League. In 1926 he discovered Paige and offered to pay him $250 per month,'],
['CANNOTANSWER', 'CANNOTANSWER', 'CANNOTANSWER'],
['Pitching for the Black Barons,', 'fastball', 'Pitching for', 'Pitching', 'Paige improved and matured as a pitcher with help from his teammates,'], ['CANNOTANSWER', 'CANNOTANSWER', 'CANNOTANSWER', 'CANNOTANSWER', 'CANNOTANSWER'],
["Part way through the 1927 season, Paige's contract was sold to the Birmingham Black Barons", "Part way through the 1927 season, Paige's contract was sold to the Birmingham Black Barons", "Part way through the 1927 season, Paige's contract was sold to the Birmingham Black Barons", "Paige's contract was sold to the Birmingham Black Barons of the major Negro National League (NNL", "Part way through the 1927 season, Paige's contract was sold to the Birmingham Black Barons"], ['CANNOTANSWER', 'CANNOTANSWER', 'CANNOTANSWER'],
['game in late June 1927, against the St. Louis Stars, Paige incited a brawl when his fastball hit the hand of St. Louis catcher Mitchell Murray.', 'He finished the 1927 season 7-1 with 69 strikeouts and 26 walks in 89 1/3 innings.', 'Pitching for the Black Barons, Paige threw hard but was wild and awkward.', 'Pitching for the Black Barons, Paige threw hard but was wild and awkward.', 'Over the next two seasons, Paige went 12-5 and 10-9 while recording 176 strikeouts in 1929. ('],
['Due to his increased earning potential, Barons owner R. T. Jackson would "rent" Paige out to other ball clubs', 'Due to his increased earning potential, Barons owner R. T. Jackson would "rent" Paige out to other ball clubs for a game or two to draw a decent crowd,', 'Jackson would "rent" Paige out to other ball clubs for a game or two to draw a decent crowd, with both Jackson and Paige taking a cut.']
]
},
'orig_answers': {
'answer_starts': [39, 2300, 1298, 2300, 600, 2300, 1514, 2165],
'texts': ['Alex Herman, was the player/manager for the Chattanooga White Sox of the minor Negro Southern League. In 1926 he discovered Paige and offered to pay him $250 per month,', 'CANNOTANSWER', 'Paige improved and matured as a pitcher with help from his teammates,', 'CANNOTANSWER', "Part way through the 1927 season, Paige's contract was sold to the Birmingham Black Barons", 'CANNOTANSWER', 'Over the next two seasons, Paige went 12-5 and 10-9 while recording 176 strikeouts in 1929. (', 'Jackson would "rent" Paige out to other ball clubs for a game or two to draw a decent crowd, with both Jackson and Paige taking a cut.']
},
}
```
### Data Fields
- `dialogue_id`: ID of the dialogue.
- `wikipedia_page_title`: title of the Wikipedia page.
- `background`: first paragraph of the main Wikipedia article.
- `section_tile`: Wikipedia section title.
- `context`: Wikipedia section text.
- `turn_ids`: list of identification of dialogue turns. One list of ids per dialogue.
- `questions`: list of questions in the dialogue. One list of questions per dialogue.
- `followups`: list of followup actions in the dialogue. One list of followups per dialogue. `y`: follow, `m`: maybe follow yp, `n`: don't follow up.
- `yesnos`: list of yes/no in the dialogue. One list of yes/nos per dialogue. `y`: yes, `n`: no, `x`: neither.
- `answers`: dictionary of answers to the questions (validation step of data collection)
- `answer_starts`: list of list of starting offsets. For training, list of single element lists (one answer per question).
- `texts`: list of list of span texts answering questions. For training, list of single element lists (one answer per question).
- `orig_answers`: dictionary of original answers (the ones provided by the teacher in the dialogue)
- `answer_starts`: list of starting offsets
- `texts`: list of span texts answering questions.
### Data Splits
QuAC contains 98,407 QA pairs from 13,594 dialogs. The dialogs were conducted on 8,854 unique sections from 3,611 unique Wikipedia articles, and every dialog contains between four and twelve questions.
The dataset comes with a train/dev split such that there is no overlap in sections across splits. Furthermore, the dev and test sets only include one
dialog per section, in contrast to the training set which can have multiple dialogs per section. Dev and test instances come with five reference answers instead of just one as in the training set; we obtain the extra references to improve the reliability of our evaluations, as questions can have multiple valid answer spans. The test set is not publicly available; instead, researchers must submit their models to the [leaderboard](http://quac.ai), which will run the model on our hidden test set.
The training set contains 83,568 questions (11,567 dialogues), while 7,354 (1,000) and 7,353 (1,002) separate questions are reserved for the dev and test set respectively.
## Dataset Creation
### Curation Rationale
Please refer to the [Datasheet](https://quac.ai/datasheet.pdf) from the authors of the dataset.
### Source Data
Please refer to the [Datasheet](https://quac.ai/datasheet.pdf) from the authors of the dataset.
#### Initial Data Collection and Normalization
Please refer to the [Datasheet](https://quac.ai/datasheet.pdf) from the authors of the dataset.
#### Who are the source language producers?
Please refer to the [Datasheet](https://quac.ai/datasheet.pdf) from the authors of the dataset.
### Annotations
Please refer to the [Datasheet](https://quac.ai/datasheet.pdf) from the authors of the dataset.
#### Annotation process
Please refer to the [Datasheet](https://quac.ai/datasheet.pdf) from the authors of the dataset.
#### Who are the annotators?
Please refer to the [Datasheet](https://quac.ai/datasheet.pdf) from the authors of the dataset.
### Personal and Sensitive Information
Please refer to the [Datasheet](https://quac.ai/datasheet.pdf) from the authors of the dataset.
## Considerations for Using the Data
### Social Impact of Dataset
Please refer to the [Datasheet](https://quac.ai/datasheet.pdf) from the authors of the dataset.
### Discussion of Biases
Please refer to the [Datasheet](https://quac.ai/datasheet.pdf) from the authors of the dataset.
### Other Known Limitations
Please refer to the [Datasheet](https://quac.ai/datasheet.pdf) from the authors of the dataset.
## Additional Information
### Dataset Curators
Please refer to the [Datasheet](https://quac.ai/datasheet.pdf) from the authors of the dataset.
### Licensing Information
The dataset is distributed under the MIT license.
### Citation Information
Provide the [BibTex](http://www.bibtex.org/)-formatted reference for the dataset. For example:
```
@inproceedings{choi-etal-2018-quac,
title = "{Q}u{AC}: Question Answering in Context",
author = "Choi, Eunsol and
He, He and
Iyyer, Mohit and
Yatskar, Mark and
Yih, Wen-tau and
Choi, Yejin and
Liang, Percy and
Zettlemoyer, Luke",
booktitle = "Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing",
month = oct # "-" # nov,
year = "2018",
address = "Brussels, Belgium",
publisher = "Association for Computational Linguistics",
url = "https://www.aclweb.org/anthology/D18-1241",
doi = "10.18653/v1/D18-1241",
pages = "2174--2184",
abstract = "We present QuAC, a dataset for Question Answering in Context that contains 14K information-seeking QA dialogs (100K questions in total). The dialogs involve two crowd workers: (1) a student who poses a sequence of freeform questions to learn as much as possible about a hidden Wikipedia text, and (2) a teacher who answers the questions by providing short excerpts from the text. QuAC introduces challenges not found in existing machine comprehension datasets: its questions are often more open-ended, unanswerable, or only meaningful within the dialog context, as we show in a detailed qualitative evaluation. We also report results for a number of reference models, including a recently state-of-the-art reading comprehension architecture extended to model dialog context. Our best model underperforms humans by 20 F1, suggesting that there is significant room for future work on this data. Dataset, baseline, and leaderboard available at \url{http://quac.ai}.",
}
```
### Contributions
Thanks to [@VictorSanh](https://github.com/VictorSanh) for adding this dataset. | 67.697479 | 2,330 | 0.754158 | eng_Latn | 0.992276 |
c99900eb6e3e962ac23bc120feae33a986e8ee6b | 5,615 | md | Markdown | documents/about_this_course.md | magicicada/cs1px | 020928120ccf368576c7ea23d3c76591f4258c0e | [
"BSD-3-Clause"
] | 2 | 2022-01-12T13:10:42.000Z | 2022-02-12T16:16:47.000Z | documents/about_this_course.md | magicicada/cs1px | 020928120ccf368576c7ea23d3c76591f4258c0e | [
"BSD-3-Clause"
] | null | null | null | documents/about_this_course.md | magicicada/cs1px | 020928120ccf368576c7ea23d3c76591f4258c0e | [
"BSD-3-Clause"
] | 1 | 2022-01-16T17:33:53.000Z | 2022-01-16T17:33:53.000Z | # Welcome to CS1PX!
This document should let you know generally what to expect from the course and how things will work.
## What I want you to learn:
Overall, you should gain skill and confidence in your programming. There are a few specific things that I really want you to be comfortable will because they will help open up more advanced computing science to you:
- simple data structures
- scope
- recursion
- complexity
- algorithms (via searching and sorting)
- error checking and exceptions
- using other people's code
- data structures with associated functions
I will try to design the lectures, labs, and assessments around these ideas.
I also want you to be excited about computing science, and have a chance to hear about some of the things that people work on in academia and industry. I have a few recordings of people who work in computing talking about their work - if there's a field you'd like to hear from you are welcome to let me know and I'll try to find someone.
## How it will work:
### Lectures/Recordings:
I will use Jupyter notebooks for most of the teaching so that I can interleave text and code. It is important that you learn how to open and run Jupyter notebooks - I will show you how to do this in lecture.
### Labs/tutorials:
Your tutorial groups will give you a chance to discuss your work on your weekly labs. You can ask for help, or talk about what you've managed to do. As with CS1CT, you will have demonstrator who will work with you in a small group and a tutor who will oversee several of these small groups.
### Quizzes:
Most weeks we will have short online quizzes to assess your knowledge of the previous cycle's material. These will be run on Moodle, and will be available for the whole week of the lab sessions associated with the content.
### Assessed assignment:
In the last couple of weeks of semester, you will work on an assessed assignment that is kind of like a small project. This will be a piece of code that you should write and document yourself, and that you will hand in for grading. Details will follow closer to the time, but to give you a general idea of what will be expected: I will ask you to find a dataset that is publicly available somewhere, and write code to store and process this dataset, including some sort of simple analysis and visualisation. I will give examples of what I am looking for later in the course, and will provide a clear list of the marking criteria so that you know what we will be looking for.
### End-of-course Exam:
We will have an online end-of-course exam in the spring. I will provide a revision checklist and an outline of the sorts of questions you should expect nearer the time.
## Tools we will use:
I am planning to use a number of tools throughout this semester, including:
- Jupyter notebooks: (I run these via Anaconda, but you are welcome to use any method you like. I will link a guide to using these in the first week. I will also usually try to include Binder links for the notebooks so you can run them online if you like.)
- Recorded videos: these will mostly be me going through the notebooks I prepare
- slido: this will let you anonymously ask questions or make requests
- Moodle: all course information will be available on the Moodle page, some is also available on GitHub
- GitHub: I'll be maintaining a repo with notebooks and other materials for the course, but use this only if it is convenient for you. Moodle will be the authoritative source.
- more may be added as we go
For your labs and learning I suggest that you use Jupyter notebooks, either on a GlasgowAnywhere machine or on your own machine. You can use IDLE if you would like to, but we won't be able to support you in installing the packages we'll need on your own machine for IDLE.
## The weekly schedule:
We have scheduled lecture sessions online for an hour at noon on Wednesday and Friday, and you should have a lab slot assigned to you on Monday, Tuesday, or Wednesday. The exact schedule of what happens when will vary a little week-to-week, but in general the plan is:
By Wednesday afternoon:
- I will release any materials or pre-recorded videos about new material for the cycle including the lecture notes and lab (where possible I may release these earlier, but don't feel pressure to engage with them in the previous cycle if you're not ready)
You should work through the material and then work on your weekly lab sometime between when they are released and when your next lab/tutorial session is.
Monday to Wednesday morning:
- You will discuss your progress on your weekly lab assignment at your lab/tutorial sessions. Quizzes on this material will be open all week.
On Wednesday at noon:
- we will have a live (but recorded) session where we talk about questions that have come up over the cycle, or run through examples of things people found difficult in the labs.
I'm not planning to use the Friday at noon slot for a live lecture because I'll be pre-recording the content. Most students last your reported finding shorter videos for new content easier to digest than hour-long live (and then recorded) lectures. If a majority of students would rather have a single live Friday session for new material instead of the videos, I'll consider switching partway through the course. If you want this let your student rep know, or tell me directly and I'll run a poll.
Near the end of the course when you are spending most of your time working on your assessed assignment and revision, this schedule will change as we won't have as much new material.
| 80.214286 | 680 | 0.779341 | eng_Latn | 0.999969 |
c99963bfe3ab98e69d97accc9b2c8cecd1b564e8 | 2,464 | md | Markdown | README.md | a84376400/react-rw | 703a364f8fb5f2702bff66679c31aa0f911e3977 | [
"MIT"
] | 1 | 2019-09-08T16:49:11.000Z | 2019-09-08T16:49:11.000Z | README.md | a84376400/react-rw | 703a364f8fb5f2702bff66679c31aa0f911e3977 | [
"MIT"
] | 8 | 2020-09-07T04:49:59.000Z | 2022-02-26T17:29:08.000Z | README.md | a84376400/react-rw | 703a364f8fb5f2702bff66679c31aa0f911e3977 | [
"MIT"
] | null | null | null | # 瑞威光电项目前端代码
### How to upload the built code
0. Run `yarn run build`
2. Run `yarn run make:win`
3. Run `$ docker pull 114.220.74.133:5000/fe-app && docker run -p "89:80" -e "IP:58.220.197.210" --name fe-app -d 114.220.74.133:5000/fe-app`
### How To Push The Docker Image
0. Change Host
```javascript
const host = '114.220.74.133' //change here
const port = '9994'
export { host, port }
```
1. Run `yarn run build`
2. Build Image `$ docker build -t fe-app .`
3. Tag The Image `$ docker tag fe-app 114.220.74.133:5000/fe-app`
4. Push The Image `$ docker push 114.220.74.133:5000/fe-app`
- Make Sure The Registry Running
- The Run Command: `$ docker run -d -p 5000:5000 -v /opt/registry:/var/lib/registry --restart=always --name registry registry:2.1.1`
- Set Your Docker Daemon
- Insecure registries: `114.220.74.133:5000`
--
5. Run It
- `$ docker pull 114.220.74.133:5000/fe-app && docker run -p "89:80" -e "IP=localhost" -e "SUBTITLE=FPM" --rm --name fe-app -d 114.220.74.133:5000/fe-app:latest`
### How To Contribute
1. Make Sure You Are Project Member
2. Checkout The Remote Develop Branch At First Time
```bash
$ git checkout -b develop origin/develop
```
3. Checkout A New Feature Branch For Coding
```bash
$ git checkout -b feature-login
```
4. Merge To Develop Branch After Test And Commit
```bash
$ git checkout develop
$ git merge feature-login
```
5. Do Merge The Remote Develop Branch
```bash
$ git pull
```
6. Push The Lasted Code After Test
7. Make A PR
### How To Use Fpm-Client
1. Install `yarn add yf-fpm-client-nodejs`
2. Checkout The Api Manual At [https://github.com/team4yf/yf-fpm-dbm#4useage](https://github.com/team4yf/yf-fpm-dbm#4useage)
3. Demo Like:
```javascript
//How to Use findAndCount()
const query = new YF.Query('rw_message');
query.page(1,10);
query.findAndCount()
.then(function(data){
console.log(data);
}).catch(function(err){
done(err);
})
```
> 查看 Changelog
[CHANGELOG.md](./CHANGELOG.md)
> 查看 TODO
[TODO.md](./TODO.md)
> 使用文档
命令行:
* 设置yarn采用淘宝的镜像源 `yarn config set registry http://registry.npm.taobao.org`
* 安装: `yarn`
* 启动调试服务: `yarn start`
* 构建 dist: `yarn build`
基础设施:
* react-router @3.x 默认采用 hashHistory 的单页应用
* 入口文件: `src/index.js`
* 导航配置: `src/navs.js`
* 路由配置: `src/routes.jsx`
* 页面文件: `src/pages`
* 组件: `src/components`
| 27.377778 | 163 | 0.638393 | kor_Hang | 0.297437 |
c99a153966a455fc28bc05530dc4d8d6383d83a3 | 2,775 | markdown | Markdown | src/ghc-9.2.1/libraries/exceptions/CHANGELOG.markdown | max0x4e/bytecode | 861b52171d469086044e2657ced13d2fb6c7fc41 | [
"BSD-3-Clause"
] | 41 | 2015-03-25T20:21:44.000Z | 2021-11-21T10:21:41.000Z | src/ghc-9.2.1/libraries/exceptions/CHANGELOG.markdown | max0x4e/bytecode | 861b52171d469086044e2657ced13d2fb6c7fc41 | [
"BSD-3-Clause"
] | 38 | 2015-01-21T22:01:47.000Z | 2022-01-24T17:04:09.000Z | src/ghc-9.2.1/libraries/exceptions/CHANGELOG.markdown | max0x4e/bytecode | 861b52171d469086044e2657ced13d2fb6c7fc41 | [
"BSD-3-Clause"
] | 27 | 2015-02-06T10:37:06.000Z | 2022-03-18T13:22:04.000Z | 0.10.4 [2019.12.26]
-------------------
* Allow building with `template-haskell-2.16.*`.
* Only depend on `transformers-compat` on old versions of GHC.
0.10.3 [2019.08.27]
-------------------
* `MonadThrow` instance for the strict `ST` monad.
0.10.2 [2019.05.02]
-------------------
* Allow building with `base-4.13`/`template-haskell-2.15`.
0.10.1 [2019.03.26]
-------------------
* Define a `MonadFail` instance for `CatchT`.
* Allow `QuickCheck-2.13` in the test suite.
0.10.0
------
* Fix a regression in 0.9.0 whereby the non-IO effects in `bracket`'s `use`
action were not visible to the `release` action, and the non-IO effects in the
`release` action were not visible after the `bracket` call.
* The type of `generalBracket` was changed in order to restore those non-IO
effects, so if you are a library author that provides a `MonadMask` instance,
you will need to update your implementation of this method.
* Add `MonadMask` instance for `MaybeT`
* Add `onError` function whose action also runs on errors which are not
exceptions, such as a `Nothing` or a `Left`.
0.9.0
-----
* Add `generalBracket` to the `MonadMask` typeclass, allowing more
valid instances.
Note that functions such as `bracket` and `finally` are now based off of
`generalBracket`, so if you are a library author that provides a `MonadMask`
instance, you will need to provide an implementation of this method.
* Add `MonadMask` instances for `ExceptT` and `ErrorT`
0.8.3
-----
* `MonadCatch` and `MonadMask` instances for `Either SomeException`
0.8.1
-----
* Support for throwing in the `template-haskell` `Q` monad
* Support for `transformers` 0.5
0.8.0.1
-------
* Resolved warnings on GHC 7.10 and with transformers 0.4.
0.8
---
* Use `transformers-compat` to allow support for `ExceptT` even on older `transformers` versions.
0.7
---
* `stm` support
0.6
---
* Split out `MonadMask`
* Added `transformers` 0.4 support
0.5
---
* Added instances of `MonadThrow` for `ListT`, `MaybeT`, `ErrorT` and `ContT`.
0.4
---
* Factored out a separate `MonadThrow`.
0.3.3.1
-------
* QuickCheck dependency bump
0.3.3
-----
* Relicensed under the 3-clause BSD license.
0.3.2
-----
* Better documentation for `CatchT`.
* Added `handle`-like analogues for parity with `Control.Exception`.
0.3.1
-----
* Fixed test suite.
0.3
---
* Moved `CatchT` to `Control.Monad.Catch.Pure` to make it clear it isn't required for working with `IO`.
0.2.1
---
* Added `mask_` and `uninterruptibleMask_` to `Control.Monad.Catch`.
0.2
---
* Added `uninterruptibleMask` to `MonadCatch`.
0.1.1
-----
* Flagged `Control.Monad.Catch` as `Trustworthy`
0.1.0.1
-----
* License fix. We were accidentally listing both an APL and BSD3 license in the same module
0.1
---
* Repository initialized
| 24.130435 | 104 | 0.678919 | eng_Latn | 0.983813 |
c99a15d6c97c5814027542220d040d80f5db9945 | 13,022 | md | Markdown | docs/Microsoft.PowerShell.GraphicalTools/Out-GridView.md | diversunt/GraphicalTools | e8bf6cfda099980a84bafac1b25e1ac304acd751 | [
"MIT"
] | 410 | 2019-08-14T21:12:40.000Z | 2022-03-30T23:19:23.000Z | docs/Microsoft.PowerShell.GraphicalTools/Out-GridView.md | diversunt/GraphicalTools | e8bf6cfda099980a84bafac1b25e1ac304acd751 | [
"MIT"
] | 104 | 2019-08-15T00:59:41.000Z | 2022-03-23T11:16:49.000Z | docs/Microsoft.PowerShell.GraphicalTools/Out-GridView.md | diversunt/GraphicalTools | e8bf6cfda099980a84bafac1b25e1ac304acd751 | [
"MIT"
] | 44 | 2019-08-14T20:53:45.000Z | 2022-02-25T02:38:50.000Z | ---
external help file: GraphicalToolsModule.dll-Help.xml
keywords: powershell,cmdlet
locale: en-us
Module Name: GraphicalTools
ms.date: 08/09/2019
schema: 2.0.0
title: Out-GridView
---
# Out-GridView
## SYNOPSIS
Sends output to an interactive table in a separate window.
## SYNTAX
### PassThru (Default)
```
Out-GridView [-InputObject <PSObject>] [-Title <String>] [-PassThru] [<CommonParameters>]
```
### Wait
```
Out-GridView [-InputObject <PSObject>] [-Title <String>] [-Wait] [<CommonParameters>]
```
### OutputMode
```
Out-GridView [-InputObject <PSObject>] [-Title <String>] [-OutputMode <OutputModeOption>] [<CommonParameters>]
```
## DESCRIPTION
The **Out-GridView** cmdlet sends the output from a command to a grid view window where the output is displayed in an interactive table.
You can use the following features of the table to examine your data:
- Hide, Show, and Reorder Columns: To hide, show, use the columns dropdown. Drag and drop column headers to reorder.
- Sort. To sort the data, click a column header. Click again to toggle from ascending to descending order.
- Quick Filter. Use the Filter box at the top of the window to search the text in the table. You can search for text in a particular column, search for literals, and search for multiple words.
- Column Filter. Use the Add Column Filter drop-down to create rules to filter the data. This is very useful for very large data sets, such as event logs.
For instructions for using these features, type `Get-Help Out-GridView -Full` and see How to Use the Grid View Window Features in the Notes section.
## EXAMPLES
### Example 1: Output processes to a grid view
```
PS C:\> Get-Process | Out-GridView
```
This command gets the processes running on the local computer and sends them to a grid view window.
### Example 2: Use a variable to output processes to a grid view
```
PS C:\> $P = Get-Process
PS C:\> $P | Out-GridView
```
This command also gets the processes running on the local computer and sends them to a grid view window.
The first command uses the Get-Process cmdlet to get the processes on the computer and then saves the process objects in the $P variable.
The second command uses a pipeline operator to send the $P variable to **Out-GridView**.
### Example 3: Display a formatted table in a grid view
```
PS C:\> Get-Process | Select-Object -Property Name, WorkingSet, PeakWorkingSet | Sort-Object -Property WorkingSet -Descending | Out-GridView
```
This command displays a formatted table in a grid view window.
It uses the Get-Process cmdlet to get the processes on the computer.
Then, it uses a pipeline operator (|) to send the process objects to the Select-Object cmdlet.
The command uses the **Property** parameter of **Select-Object** to select the Name, WorkingSet, and PeakWorkingSet properties to be displayed in the table.
Another pipeline operator sends the filtered objects to the Sort-Object cmdlet, which sorts them in descending order by the value of the **WorkingSet** property.
The final part of the command uses a pipeline operator (|) to send the formatted table to **Out-GridView**.
You can now use the features of the grid view to search, sort, and filter the data.
### Example 4: Save output to a variable, and then output a grid view
```
PS C:\> ($A = Get-ChildItem -Path $pshome -Recurse) | Out-GridView
```
This command saves its output in a variable and sends it to **Out-GridView**.
The command uses the Get-ChildItem cmdlet to get the files in the Windows PowerShell installation directory and its subdirectories.
The path to the installation directory is saved in the $pshome automatic variable.
The command uses the assignment operator (=) to save the output in the $A variable and the pipeline operator (|) to send the output to **Out-GridView**.
The parentheses in the command establish the order of operations.
As a result, the output from the Get-ChildItem command is saved in the $A variable before it is sent to **Out-GridView**.
### Example 5: Output processes for a specified computer to a grid view
```
PS C:\> Get-Process -ComputerName "Server01" | ogv -Title "Processes - Server01"
```
This command displays the processes that are running on the Server01 computer in a grid view window.
The command uses `ogv`, which is the built-in alias for the **Out-GridView** cmdlet, it uses the *Title* parameter to specify the window title.
### Example 6: Output data from remote computers to a grid view
```
PS C:\> Invoke-Command -ComputerName S1, S2, S3 -ScriptBlock {Get-Culture} | Out-GridView
```
This example shows the correct format for sending data collected from remote computers to the **Out-GridView** cmdlet.
The command uses the Invoke-Command cmdlet to run a Get-Culture command on three remote computers.
It uses a pipeline operator to send the data that is returned to the **Out-GridView** cmdlet.
Notice that the script block that contains the commands that are run remotely does not include the **Out-GridView** command.
If it did, the command would fail when it tried to open a grid view window on each of the remote computers.
### Example 7: Pass multiple items through Out-GridView
```
PS C:\> Get-Process | Out-GridView -PassThru | Export-Csv -Path .\ProcessLog.csv
```
This command lets you select multiple processes from the **Out-GridView** window.
The processes that you select are passed to the **Export-Csv** command and written to the ProcessLog.csv file.
The command uses the *PassThru* parameter of **Out-GridView**, which lets you send multiple items down the pipeline.
The *PassThru* parameter is equivalent to using the Multiple value of the *OutputMode* parameter.
### Example 8: Create a Windows shortcut to Out-GridView
```
PS C:\> Powershell.exe -Command "Get-Service | Out-GridView -Wait"
```
This command shows how to use the *Wait* parameter of **Out-GridView** to create a Windows shortcut to the **Out-GridView** window.
Without the *Wait* parameter, Windows PowerShell would exit as soon as the **Out-GridView** window opened, which would close the **Out-GridView** window almost immediately.
## PARAMETERS
### -InputObject
Specifies that the cmdlet accepts input for **Out-GridView**.
When you use the **InputObject** parameter to send a collection of objects to **Out-GridView**, **Out-GridView** treats the collection as one collection object, and it displays one row that represents the collection.
To display the each object in the collection, use a pipeline operator (|) to send objects to **Out-GridView**.
```yaml
Type: PSObject
Parameter Sets: (All)
Aliases:
Required: False
Position: Named
Default value: None
Accept pipeline input: True (ByValue)
Accept wildcard characters: False
```
### -OutputMode
Specifies the items that the interactive window sends down the pipeline as input to other commands.
By default, this cmdlet does not generate any output.
To send items from the interactive window down the pipeline, click to select the items and then click OK.
The values of this parameter determine how many items you can send down the pipeline.
- None. No items. This is the default value.
- Single. Zero items or one item. Use this value when the next command can take only one input object.
- Multiple. Zero, one, or many items. Use this value when the next command can take multiple input objects. This value is equivalent to the *Passthru* parameter.
This parameter was introduced in Windows PowerShell 3.0.
```yaml
Type: OutputModeOption
Parameter Sets: OutputMode
Aliases:
Accepted values: None, Single, Multiple
Required: False
Position: Named
Default value: None
Accept pipeline input: False
Accept wildcard characters: False
```
### -PassThru
Indicates that the cmdlet sends items from the interactive window down the pipeline as input to other commands.
By default, this cmdlet does not generate any output.
This parameter is equivalent to using the Multiple value of the *OutputMode* parameter.
To send items from the interactive window down the pipeline, click to select the items and then click OK.
Shift-click and Ctrl-click are supported.
This parameter was introduced in Windows PowerShell 3.0.
```yaml
Type: SwitchParameter
Parameter Sets: PassThru
Aliases:
Required: False
Position: Named
Default value: None
Accept pipeline input: False
Accept wildcard characters: False
```
### -Title
Specifies the text that appears in the title bar of the **Out-GridView** window.
By default, the title bar displays the command that invokes **Out-GridView**.
```yaml
Type: String
Parameter Sets: (All)
Aliases:
Required: False
Position: Named
Default value: None
Accept pipeline input: False
Accept wildcard characters: False
```
### -Wait
Indicates that the cmdlet suppresses the command prompt and prevents Windows PowerShell from closing until the **Out-GridView** window is closed.
By default, the command prompt returns when the **Out-GridView** window opens.
This feature lets you use the **Out-GridView** cmdlets in Windows shortcuts.
When **Out-GridView** is used in a shortcut without the *Wait* parameter, the **Out-GridView** window appears only momentarily before Windows PowerShell closes.
This parameter was introduced in Windows PowerShell 3.0.
```yaml
Type: SwitchParameter
Parameter Sets: Wait
Aliases:
Required: False
Position: Named
Default value: None
Accept pipeline input: False
Accept wildcard characters: False
```
### CommonParameters
This cmdlet supports the common parameters: -Debug, -ErrorAction, -ErrorVariable, -InformationAction, -InformationVariable, -OutVariable, -OutBuffer, -PipelineVariable, -Verbose, -WarningAction, and -WarningVariable. For more information, see about_CommonParameters (http://go.microsoft.com/fwlink/?LinkID=113216).
## INPUTS
### System.Management.Automation.PSObject
You can send any object to this cmdlet.
## OUTPUTS
### None
**Out-GridView** does not return any objects.
## NOTES
* You cannot use a remote command to open a grid view window on another computer.
* The command output that you send to **Out-GridView** cannot be formatted, such as by using the Format-Table or Format-Wide cmdlets. To select properties, use the Select-Object cmdlet.
* Deserialized output from remote commands might not be formatted correctly in the grid view window.
How to Use the Grid View Window Features
The following topics explain how to use the features of the window that **Out-GridView** displays.
**How to Hide, Show, and Reorder Columns**
**To hide or show a column:**
1. Click on the Columns expander.
2. In the Columns expander, toggle Columns that should appear.
Only selected columns appear in the grid view window.
**To reorder columns:**
- Drag and drop the column into the desired location.
**How to Sort Table Data**
- To sort the data, click a column header.
- To change the sort order, click the column header again.
Each time you click the same header, the sort order toggles between ascending to descending order.
The current order is indicated by a triangle in the column header.
**How to Search in the Table (Quick Filter)**
Use the Filter box to search for data in the table.
When you type in the box, only items that include the typed text appear in the table.
- Search for text.
To search for text in the table, in the Filter box, type the text to find.
- Search for multiple words.
To search for multiple words in the table, type the words separated by spaces.
**Out-GridView** displays rows that include all of the words (logical AND).
- Search for literal phrases.
To search for phrases that include spaces or special characters, enclose the phrase in quotation marks.
**Out-GridView** displays rows that include an exact match for the phrase.
**Use Column Filters to Filter the Table**
You can use column filters to determine which items are displayed in the table.
Items appear only when they satisfy all of the column filters that you establish.
Each column filter has the following format:
\<column\> \<operator\> \<value\>
Column filters for different properties are connected by AND.
Column filters for the same property are connected by OR.
You cannot change the logical connectors.
The column filters only affects the display.
It does not delete items from the table.
**How to Add Column Filters**
1. Click the Add Column Filters menu button.
2. Click the column (property) you wish to add.
**How to Edit a Column Filter**
- To change an operator, click the operator drop down, and then click to select a different operator from the drop-down list.
- To enter or change a value, type a value in the value box.
- To create an OR statement, add a column filter with the same property.
**How to Delete Column Filters**
- To delete selected column filters, click the remove button beside each column filter.
- To delete all column filters, click the Clear Filters button.
## RELATED LINKS
[Out-File](Out-File.md)
[Out-Printer](Out-Printer.md)
[Out-String](Out-String.md)
| 37.527378 | 314 | 0.758793 | eng_Latn | 0.993872 |
c99a203f39aac4885c3a718cdfb5e512f947f32f | 174 | md | Markdown | README.md | reza00farjam/simple-calculator | 08eb25a7e0c8e345bbc1c8ab08f145945c2c4c6f | [
"MIT"
] | 1 | 2020-09-02T20:23:03.000Z | 2020-09-02T20:23:03.000Z | README.md | reza00farjam/simple-calculator | 08eb25a7e0c8e345bbc1c8ab08f145945c2c4c6f | [
"MIT"
] | null | null | null | README.md | reza00farjam/simple-calculator | 08eb25a7e0c8e345bbc1c8ab08f145945c2c4c6f | [
"MIT"
] | 1 | 2020-09-02T18:07:20.000Z | 2020-09-02T18:07:20.000Z | # about
this is a simple gui calculator written in python using tkinter.
| 34.8 | 97 | 0.793103 | eng_Latn | 0.710975 |
c99acc0cf54a8a396ca7bafeef1424d1ebb22428 | 336 | md | Markdown | Parallel Branches/Readme.md | Vignesh-SV/custom-workflows | b784dfe4ec9d513fe4c792363898f94153130ccb | [
"MIT"
] | 2 | 2019-10-29T09:44:06.000Z | 2021-03-11T02:28:56.000Z | Parallel Branches/Readme.md | Vignesh-SV/custom-workflows | b784dfe4ec9d513fe4c792363898f94153130ccb | [
"MIT"
] | 6 | 2020-07-28T12:20:52.000Z | 2021-02-18T08:51:29.000Z | Parallel Branches/Readme.md | Vignesh-SV/custom-workflows | b784dfe4ec9d513fe4c792363898f94153130ccb | [
"MIT"
] | 21 | 2019-08-08T20:48:48.000Z | 2021-10-18T15:41:25.000Z | This workflow gives an example of how to effectively use parallel branches to achieve simultaneous activity execution while still converging back to one thread.
<br><br>
Read more on our support portal:
<br>
<a href="https://support.ayehu.com/hc/en-us/articles/360049205534">https://support.ayehu.com/hc/en-us/articles/360049205534</a>
| 56 | 160 | 0.791667 | eng_Latn | 0.98504 |
c99ae8ff250687f688a2b836dd521cb5c2a7ac0c | 863 | md | Markdown | content/pages/projects/prostate.md | poely/website-content | 2ac8dd35a4bac5536c33cf01466728c606cfeb8e | [
"MIT"
] | null | null | null | content/pages/projects/prostate.md | poely/website-content | 2ac8dd35a4bac5536c33cf01466728c606cfeb8e | [
"MIT"
] | null | null | null | content/pages/projects/prostate.md | poely/website-content | 2ac8dd35a4bac5536c33cf01466728c606cfeb8e | [
"MIT"
] | null | null | null | title: Prostate
title_long: Prostate
finished: false
type: general
picture: projects/prostate.jpg
template: project-single
groups: diag
people: Matin Hosseinzadeh, Oscar Debats, Henkjan Huisman
description: A large number of AI products are now on the market. How should AI be implemented in radiology practice?
bibkeys:
Over one hundred CE certified products based on artificial intelligence for radiology are now for sale. This research project focuses on the questions how radiology departments can obtain an overview of the available products, how to best evaluate these products in terms of different aspects, from technical performance to cost-effectiveness and societal benefit, and how to implement AI in the radiology practice.
We have made a website available that lists all products: [AI for Radiology](https://grand-challenge.org/aiforradiology/)
| 57.533333 | 415 | 0.819235 | eng_Latn | 0.995306 |
c99b5569d11831efb5cd7c291e1a494d57bc644d | 13,330 | md | Markdown | docs/profiling/analyze-energy-use-in-store-apps.md | MicrosoftDocs/visualstudio-docs.cs-cz | 3861d52726f1a515cfa62d590513a3c7a1b8019b | [
"CC-BY-4.0",
"MIT"
] | 1 | 2020-05-20T07:48:22.000Z | 2020-05-20T07:48:22.000Z | docs/profiling/analyze-energy-use-in-store-apps.md | MicrosoftDocs/visualstudio-docs.cs-cz | 3861d52726f1a515cfa62d590513a3c7a1b8019b | [
"CC-BY-4.0",
"MIT"
] | 7 | 2018-10-02T15:01:11.000Z | 2021-11-05T20:25:20.000Z | docs/profiling/analyze-energy-use-in-store-apps.md | MicrosoftDocs/visualstudio-docs.cs-cz | 3861d52726f1a515cfa62d590513a3c7a1b8019b | [
"CC-BY-4.0",
"MIT"
] | 7 | 2018-10-01T22:49:53.000Z | 2021-10-09T11:24:44.000Z | ---
title: Analýza spotřeby energie v aplikacích pro UPW | Microsoft Docs
description: Pomocí profileru Visual Studio Spotřeba energie můžete analyzovat poptávku po energii a energii aplikací pro UPW spuštěných na zařízeních s bateriemi.
ms.custom: SEO-VS-2020
ms.date: 11/04/2016
ms.topic: conceptual
dev_langs:
- CSharp
- VB
- FSharp
- C++
ms.assetid: 96d06843-b97e-45a8-8126-07478a40bfc4
author: mikejo5000
ms.author: mikejo
manager: jmartens
ms.technology: vs-ide-debug
ms.workload:
- uwp
monikerRange: vs-2017
ms.openlocfilehash: 475b6dad983bf196a094399da38a644f55170384
ms.sourcegitcommit: b12a38744db371d2894769ecf305585f9577792f
ms.translationtype: MT
ms.contentlocale: cs-CZ
ms.lasthandoff: 09/13/2021
ms.locfileid: "126617076"
---
# <a name="analyze-energy-use-in-uwp-apps"></a>Analýza spotřeby energie v aplikacích pro UWP
Profiler Visual Studio **Spotřeba** energie pomáhá analyzovat spotřebu energie a energie aplikací pro UPW na tabletech s nízkou spotřebou energie, která běží celou dobu nebo částečně na vlastních bateriech. Na zařízení napájeném z baterie může aplikace s příliš vysokou spotřebou energie způsobit tak velkou nespokojenost zákazníka, že ji může dokonce i odinstalovat. Optimalizace spotřeby energie může zvýšit přijetí a používání vaší aplikace zákazníky.
## <a name="what-the-energy-consumption-profiler-is-how-it-works-and-what-it-measures"></a>Co je profiler Spotřeba energie, jak funguje a co měří
Profiler Spotřeba energie shromažďuje údaje o činnosti displeje, procesoru a síťových připojení zařízení během relace profilování. Poté vygeneruje odhady množství energie použité pro tyto činnosti a celkové množství energie použité pro relaci profilování.
> [!NOTE]
> Energetický profiler provádí odhad výkonu a spotřeby energie pomocí softwarového modelu standardního hardwaru referenčního zařízení, jež reprezentuje tablety s nízkou spotřebou, na kterých by vaše aplikace mohla běžet. Pro dosažení co nejlepšího odhadu doporučujeme shromáždit profilová data u tabletů s nízkou spotřebou.
>
> Ačkoliv model poskytuje dobré odhady pro řadu zařízení s nízkou spotřebou, skutečné hodnoty zařízení, která profilujete, budou pravděpodobně odlišné. Použijte tyto hodnoty pro nalezení aktivit displeje, procesoru a sítě, které jsou v porovnání s využitím jiných prostředků náročné, takže by mohly představovat vhodné kandidáty na optimalizaci.
Profiler Spotřeba energie používá tyto definice *energie* a *energie:*
- *Energie* měří rychlost, kterou vynutí provádění práce, která se provádí v časovém období. V oblasti elektroinstalace je standardní jednotkou výkonu *watt*, který je definován jako rychlost, s jakou se práce provádí, když jeden ampere aktuálního proudu prochází elektrotechnickou potenciálním rozdílem jednoho V. V grafu **Využití energie** se jednotky zobrazují jako miliwatty **mW,** což je tisícina wattu.
Všimněte si, že výkon má směr (množství práce se v čase může zvýšit nebo snížit) a rychlost (velikost zvýšení nebo snížení množství práce).
- *Energie* měří celkový výkon, buď jako kapacitu nebo potenciál, jako je kapacita baterie, nebo jako celkové množství energie spotřebované v průběhu určitého časového období. Jednotkou energie je watthodina, tedy výkon jednoho wattu konstantně působící po jednu hodinu. V **souhrnu energie** se jednotky zobrazují jako miliwatthodiny **mW-h**.
Například plně nabitá baterie v tabletu uchovává určité množství energie. Při využívání této energie pro provádění úloh, jako je například komunikace po síti, výpočty hodnot nebo zobrazování grafického obsahu, se výkon spotřebovává různou rychlostí. Pro libovolné časové období se celkové množství spotřebovaného výkonu poměřuje také energií.
## <a name="identify-scenarios-with-user-marks"></a>Scénáře s uživatelskými značkami
K datům *profilace můžete* přidat uživatelské značky, které vám pomůžou identifikovat oblasti na časové ose.
Značka se zobrazí jako oranžový trojúhelník umístěný na časové ose v čase spuštění metody. Zpráva a čas se zobrazí jako popisek, jakmile na značku umístíte ukazatel myší. Pokud jsou dvě nebo více uživatelských značek blízko u sebe, značky i popisky se sloučí. Značky od sebe rozlišíte přiblížením časové osy.
**Přidání značek do kódu C#, Visual Basic, C++**
Pokud chcete přidat značku uživatele do jazyka C#, Visual Basic, kódu C++ nejprve vytvořte <xref:Windows.Foundation.Diagnostics.LoggingChannel?displayProperty=fullName> objekt . Potom vložte volání <xref:Windows.Foundation.Diagnostics.LoggingChannel.LogMessage%2A?displayProperty=nameWithType> metod do bodů v kódu, které chcete označit. Ve voláních použijte [LoggingLevel.Information.](xref:Windows.Foundation.Diagnostics.LoggingLevel)
Jakmile se metoda spustí, uživatelská značka je spolu se zprávou přidána do profilových dat.
> [!NOTE]
> - <xref:Windows.Foundation.Diagnostics.LoggingChannel?displayProperty=nameWithType> implementuje rozhraní <xref:Windows.Foundation.IClosable?displayProperty=nameWithType> (projektované jako v <xref:System.IDisposable?displayProperty=nameWithType> jazyce C# a VB). Pokud chcete zabránit úniku prostředků operačního systému, po dokončení kanálu protokolování volejte ( v <xref:Windows.Foundation.Diagnostics.LoggingChannel.Close%2A?displayProperty=nameWithType> <xref:Windows.Foundation.Diagnostics.LoggingChannel.Dispose%2A?displayProperty=nameWithType> jazyce C# a VB).
> - Každý otevřený protokolovací kanál musí mít jedinečný název. Pokud se pokusíte vytvořit nový protokolovací kanál se stejným názvem jako kanál bez rozhraní, vyvolá se výjimka.
Příklad kódu najdete v ukázce [LoggingSession](https://code.msdn.microsoft.com/windowsapps/LoggingSession-Sample-ccd52336)Windows SDK.
::: moniker range="vs-2017"
**Přidání značek do kódu JavaScriptu**
Chcete-li přidat uživatelské značky, přidejte do míst v kódu, které chcete označit, následující kód:
```JavaScript
if (performance && performance.mark) {
performance.mark(markDescription);
}
```
*markDescription* je řetězec, který obsahuje zprávu, která se má zobrazit v popisu značky uživatele.
::: moniker-end
## <a name="configure-your-environment-for-profiling"></a>Konfigurace prostředí pro profilaci
Pokud chcete získat dobré odhady, budete chtít profilovat spotřebu energie aplikace na zařízení s nízkou spotřebou energie, které pohánět bateriemi. Protože Visual Studio těchto zařízeních nespouštějte, budete muset připojit svůj počítač Visual Studio k zařízení pomocí Visual Studio nástrojů. Pro připojení ke vzdálenému zařízení je třeba nakonfigurovat jak projekt aplikace Visual Studio, tak vzdálené zařízení. Další [informace najdete v tématu Spouštění aplikací pro UPW](../debugger/run-windows-store-apps-on-a-remote-machine.md) na vzdáleném počítači.
> [!TIP]
> - Nedoporučujeme energetickou profilaci na simulátoru UPW ani na Visual Studio počítači. Profilace přímo na příslušném zařízení poskytuje mnohem realističtější data.
> - Provádějte profilaci na cílovém zařízení v době, kdy je zařízení napájeno bateriemi.
> - Zavřete ostatní aplikace, které by mohly využívat stejné prostředky (síť, procesor nebo displej).
## <a name="collect-energy-profile-data-for-your-app"></a>Shromažďování dat o energetickém profilu vaší aplikace
1. V nabídce **Ladit** zvolte **Spustit diagnostiku bez ladění.**
2. Zvolte **Spotřeba energie** a pak zvolte **Spustit.**
> [!NOTE]
> Když spustíte profiler **Spotřeba** energie, může se zobrazit okno Řízení uživatelských účtů s žádostí o vaše oprávnění ke *spuštěníVsEtwCollector.exe*. Zvolte **Ano.**
3. Spusťte v aplikaci shromažďování dat.
4. Pokud chcete profilaci zastavit, přepněte zpět na Visual Studio (Alt + karta) a **zvolte** Zastavit shromažďování na stránce diagnostického centra.
Aplikace Visual Studio analyzuje shromážděná data a zobrazuje výsledky.
## <a name="collect-energy-profile-data-for-an-installed-app"></a>Shromažďování dat o energetickém profilu nainstalované aplikace
Nástroj Spotřeba energie je možné spustit pouze v aplikacích UPW, které jsou spouštěné z Visual Studio nebo jsou nainstalované z Microsoft Store. Když je řešení otevřené v Visual Studio, výchozím cílem je spouštěcí Project **.** Zacílení nainstalované aplikace:
1. Zvolte **Change Target (Změnit** cíl) a pak **zvolte Installed App (Nainstalovaná aplikace).**
2. V **seznamu Vybrat nainstalovaný balíček aplikace** zvolte cíl.
3. Na **stránce nabídky** Vyberte spotřebu Profiler výkonu energie.
4. Zvolte **Spustit** a zahajte profilaci.
Pokud chcete profilaci zastavit, přepněte zpět na Visual Studio (Alt + karta) a **zvolte** Zastavit shromažďování na stránce diagnostického centra.
## <a name="analyze-energy-profile-data"></a>Analýza dat energetického profilu
Data energetického profilu se zobrazují v okně dokumentu aplikace Visual Studio:
|Image|Description|
|-|-|
||Soubor sestavy má název Report *YYYYMMDD-HHMM*.diagsession. Pokud se rozhodnete sestavu uložit, můžete název změnit.|
||Časová osa ukazuje délku relace profilace, aktivační události životního cyklu aplikace a uživatelské značky.|
||Přetažením modrých panelů můžete vybrat určitou oblast časové osy a omezit tak sestavu jen na tuto část časové osy.|
||Graf **Využití energie** je víceřádový graf, který zobrazuje změnu ve výstupu napájení, kterou způsobuje prostředek zařízení během relace profilace. Profiler Spotřeba energie sleduje výkon využívaný procesorem, síťovou aktivitou a displejem.|
||Graf **Prostředky (on/off)** obsahuje podrobnosti o nákladech na energii v síti. Panel **Síť** představuje čas otevření síťového připojení. Podřízený **panel Přenos** dat je čas, kdy aplikace při přijetí nebo odesílání dat přes síť.|
||Souhrn **využití energie zobrazuje** poměrné množství celkové energie spotřebované na vybrané časové ose procesorem, aktivitou sítě a displejem.|
**Analýza dat energetického profilu**
Najděte oblast, kde výkon prostředku dosáhl vrcholu. Přiřaďte tuto oblast k funkci vaší aplikace. Pomocí ovládacích panelů časové osy můžete tuto oblast přiblížit. Pokud se zaměřujete na využití sítě, rozbalte uzel Síť v grafu Prostředky **(on/Off)** a porovnejte čas otevření síťového připojení s časem, kdy aplikace přijímal nebo přenášela data přes připojení. Zkrácení doby, po kterou je síť zbytečně otevřená, představuje velmi efektivní optimalizaci.
## <a name="optimize-energy-use"></a>Optimalizace spotřeby energie
Kromě přenosu dat vynakládají síťová připojení energii také na inicializaci, udržování a ukončování připojení. Některé sítě udržují připojení po určitou dobu po odeslání nebo přijetí dat, aby umožnily přenos většího množství dat v rámci jednoho připojení. Podokno **prostředky (zapnuto/vypnuto)** můžete použít k prohlédnutí způsobu, jakým vaše aplikace komunikuje s připojením.
Pokud se v seznamu **síť** a **přenos dat** ukáže, že je připojení otevřeno pro dlouhou dobu, aby bylo možné občasně přenášet řadu malých objemů dat, můžete data dávkovat za účelem jejich odeslání v jednom přenosu, zkrátit dobu, po kterou je síť otevřená, a ušetřit tak náklady na energii.
Spotřebu energie displeje lze ovlivnit hůře. Většina obrazovek potřebuje více energie k zobrazení světlých barev než tmavších barev, takže jedním ze způsobů, jak snížit spotřebu, je použití tmavého pozadí.
## <a name="other-resources"></a>Další prostředky
- části **stav připojení a správa nákladů** pro [C#/VB/C + + a XAML](/previous-versions/windows/apps/hh452985\(v\=win.10\)) popisují rozhraní api pro Windows, která poskytují informace o připojení k síti, které vaše aplikace může použít k minimalizaci nákladů na síťový provoz.
simulátor Visual Studio pro aplikace pro UWP umožňuje simulovat vlastnosti datového připojení rozhraní api pro informace o síti. Viz [spouštění aplikací pro UWP v simulátoru](../debugger/run-windows-store-apps-in-the-simulator.md)
- Nástroje **využití procesoru** vám můžou snížit zatížení procesoru, když je to způsobeno neúčinnými funkcemi. Viz [Analýza využití procesoru](../profiling/beginners-guide-to-performance-profiling.md).
## <a name="see-also"></a>Viz také
- [Profilace v sadě Visual Studio](../profiling/index.yml)
- [První seznámení s nástroji pro profilaci](../profiling/profiling-feature-tour.md) | 80.787879 | 571 | 0.80165 | ces_Latn | 0.999883 |
c99ba49b29bbba92b7ca9994c51d045151125b98 | 1,740 | md | Markdown | README.md | srbcheema1/Calculater | f6a52575f01d8191ea30a66cd6029a7b0b2e3574 | [
"Apache-2.0"
] | 40 | 2017-10-01T12:55:28.000Z | 2019-09-20T07:20:36.000Z | README.md | xdvrx1/Magic-Calculator | f6a52575f01d8191ea30a66cd6029a7b0b2e3574 | [
"Apache-2.0"
] | 5 | 2017-10-01T22:26:24.000Z | 2017-10-03T09:24:16.000Z | README.md | xdvrx1/Magic-Calculator | f6a52575f01d8191ea30a66cd6029a7b0b2e3574 | [
"Apache-2.0"
] | 23 | 2017-10-01T22:31:48.000Z | 2019-10-22T10:00:39.000Z | # Magic-Calculator
A calculator with basic functions.
It has some really cool features.
- Type 1501 and click on the menu button and explore additional settings.
- Click on Advanced Settings and create a key value pair where key must be 4 digits long and value must be 8 digits long.
- As you type the key and press '=' then begin doing calculationsafter 4 = signs pressed calculator will show the result "value you fixed in advance settings"
To learn trick, watch this [video](https://www.youtube.com/watch?v=hNkF7I1K8oo)
Contains no ads or unnecessary permissions. It's an opensource project and provides a Dark theme.
## Test Screenshots:
   
## Contributing:
Changes and improvements are more than welcome! Feel free to fork and open a pull request. Please make your changes in a specific branch and request to pull into `master`! If you can, please make sure the game fully works before sending the PR, as that will help speed up the process.
## License:
-------
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
| 45.789474 | 284 | 0.757471 | eng_Latn | 0.995211 |
c99bf4950f782ec74d8213fd731c7f3f668be49d | 1,758 | md | Markdown | serial-bus-to-parallel/README.md | gom9000/xp-raspberry | 0eeba125eeae86fb2e1b5077da196a45bea775be | [
"MIT"
] | null | null | null | serial-bus-to-parallel/README.md | gom9000/xp-raspberry | 0eeba125eeae86fb2e1b5077da196a45bea775be | [
"MIT"
] | null | null | null | serial-bus-to-parallel/README.md | gom9000/xp-raspberry | 0eeba125eeae86fb2e1b5077da196a45bea775be | [
"MIT"
] | null | null | null | # serial-bus-to-prallel eXPerience
Serial bi-directional bus to parallel input/output, using the 74HC595 for serial-to-parallel output, and the 74HC165 for parallel-to-serial input.
#### SHIFT REGISTERS SIGNALS
Latch signal (positive-edge storage register clock) on 595 SIPO shift register:
ST = NOT( LATCH NAND /RW ) --> ST = LATCH with /RW = H
Latch signal (negative-edge parallel load clock) on 165 PISO shift register:
PL = LATCH NAND NOT( /RW ) --> PL = NOT(LATCH) with /RW = L
#### WRITE OPERATION
Initial signals status: LATCH = L, CLOCK = L, /RW = X
Set DATA as Output
Set /RW = H
Repeat for each bit of data:
Set DATA = X
Write DATA
Set CLOCK = L -> H -> L
Set LATCH = L -> H -> L
#### READ OPERATION
Initial signals status: LATCH = L, CLOCK = L, /RW = X
Set DATA as Input
Set /RW = L
Set LATCH = L -> H -> L
Repeat for each bit of data:
Read DATA
Set CLOCK = L -> H -> L
## Schematic
## Bill of Materials
- [x] 74HC595 8-bit serial-in/3-state parallel-out shift register
- [x] 74HC165 8-bit parallel-in/serial-out shift register
- [x] 74HC00 quad 2-input NAND gates
- [x] 3 x decoupling capacitor C=100nF
- [x] resistor R=6K8ohm
- [x] module board [mob-io-array-switch-8x](https://github.com/gom9000/xp-mobs-library/tree/master/mobs/mob-io-array-switch-8x) from *xp-mobs-library* repository
- [x] module board [mob-io-array-led-8x](https://github.com/gom9000/xp-mobs-library/tree/master/mobs/mob-io-array-led-8x) from *xp-mobs-library* repository
- [x] module board [mob-psu-distribution](https://github.com/gom9000/xp-mobs-library/tree/master/mobs/mob-psu-distribution) from *xp-mobs-library* repository | 37.404255 | 162 | 0.697952 | yue_Hant | 0.425912 |
c99bf65c4fd4cb233d5f1deef875feb4994700e7 | 1,901 | md | Markdown | www/_posts/2013-10-01-plugins-release.md | NiklasMerz/cordova-docs | 44678acb622002f5ed2f322a699aaad9716ff041 | [
"Apache-2.0"
] | 291 | 2015-01-26T15:07:09.000Z | 2022-02-08T02:28:58.000Z | www/_posts/2013-10-01-plugins-release.md | NiklasMerz/cordova-docs | 44678acb622002f5ed2f322a699aaad9716ff041 | [
"Apache-2.0"
] | 622 | 2015-02-16T02:56:58.000Z | 2022-03-28T21:18:31.000Z | www/_posts/2013-10-01-plugins-release.md | NiklasMerz/cordova-docs | 44678acb622002f5ed2f322a699aaad9716ff041 | [
"Apache-2.0"
] | 686 | 2015-01-05T08:34:51.000Z | 2022-03-25T06:53:13.000Z | ---
layout: post
author:
name: Steve Gill
url: https://twitter.com/stevesgill
title: "Plugins Release: October 1st, 2013"
categories: news
tags: release
---
Today we are doing a plugin release in preparation for Apache Cordova 3.1.0, which is scheduled to be released later this week.
The main change for this release is removing 'core' from the plugin ID fields. This was done to make installing plugins simpler in 3.1.0. We are switching over to using plugin IDs and our [plugin registry](http://plugins.cordova.io/) for plugin installation instead of directly installing from the plugin git urls.
These plugins are compatible with Cordova 3.0.0. Feel free to upgrade your current plugins if you can't wait for 3.1.0 next week. Keep in mind that after you install these updated plugins, if you decide to remove these plugins from your project, you will have to reference the new IDs instead of the old ones that our docs show.
E.g. To update your camera plugin:
cordova plugin rm org.apache.cordova.core.camera
cordova plugin add org.apache.cordova.camera
<br />
<!--more-->
*Other Notable Changes:*
* Firefox OS support for Vibration and Device plugins
* Windows 8 support for multiple plugins
* Fixed warnings that arose with XCode 5
* [CB-4847](https://issues.apache.org/jira/browse/CB-4847) iOS 7 microphone access requires user permission (media plugin)
* [CB-4799](https://issues.apache.org/jira/browse/CB-4799) Fix incorrect JS references within native code for iOS & Android (media plugin)
* [CB-4806](https://issues.apache.org/jira/browse/CB-4806) Update splashscreen image bounds for iOS 7 (splashscreen plugin)
* [CB-4593](https://issues.apache.org/jira/browse/CB-4593) Added vibration support for BB10 (vibration plugin)
<br />
You can check out the individual release notes in each of the plugin repos for more details.
| 48.74359 | 329 | 0.749605 | eng_Latn | 0.950776 |
c99d0d707ab99728d23eefc2db0bad398a795064 | 66,733 | md | Markdown | content/curriculum/units/2012/3/12.03.02.x.md | kenlu89/teachers_institute | 1fc993f30d6ac17b3097e63510ce758a12c910ea | [
"MIT"
] | null | null | null | content/curriculum/units/2012/3/12.03.02.x.md | kenlu89/teachers_institute | 1fc993f30d6ac17b3097e63510ce758a12c910ea | [
"MIT"
] | null | null | null | content/curriculum/units/2012/3/12.03.02.x.md | kenlu89/teachers_institute | 1fc993f30d6ac17b3097e63510ce758a12c910ea | [
"MIT"
] | null | null | null | ---
layout: "unit"
title: "12.03.02: The Brain, Our Silent Partner: Anatomy and Cognition"
path: "/curriculum/units/2012/3/12.03.02.x.html"
unitTitle: "The Brain, Our Silent Partner: Anatomy and Cognition"
unitAuthor: "Laura Carroll-Koch"
---
<body>
<hr/>
<h3>
Contents of Curriculum Unit 12.03.02:
</h3>
<ul>
<li>
Introduction
</li>
<li>
Rationale
</li>
<li>
Evolution of the Brain
</li>
<li>
Anatomy of the Brain
</li>
<li>
The Neuron
</li>
<li>
Cognition
</li>
<li>
Common Core Content Standards addressed in this unit
</li>
<li>
Lessons and Activities
</li>
<li>
Bibliography
</li>
<li>
Web Resources
</li>
<li>
Endnotes
</li>
</ul>
<h3>
<a href="../../../guides/2012/3/12.03.02.x.html">
To Guide Entry
</a>
</h3>
<hr/>
<h2>
Introduction
</h2>
<p>
Look up to the heavens on a crisp, clear, dark night and while gazing upon the stars, know that the awe and wonder felt can only be compared to the experience one might have as the brain reveals itself.
</p>
<p>
Thinking about the complex nature of our brain with its multifaceted functions, involving abstract outcomes and unfamiliar interactions stretches the limits of our imagination. Trillions of simultaneous neural actions are working together in unique harmony. These connections create a vast interwoven labyrinth of electrical and chemical pathways with orchestrated explosions and purposeful connections responding to a plethora of perpetual activity in an elaborate symphony that defines our very being. These interwoven, ever changing neural pathways sculpt the way one views, connects, and functions in the world. They shape our learning, but how we learn also shapes these pathways. Every brain is unique. It is the organ that gives us our individuality and our identity. It makes us, who we are, the fingerprint of our thinking. Although daunting, one cannot help but be drawn to this complex organ, the rememberer, controller, interpreter, organizer, assessor, and creator inside our very own head.
</p>
<p>
We live in an exciting age, a New Age Renaissance, the Age of Neuroscience, reshaping every facet of society. The forward thinking cultures of medicine, communication, science, and technology are exploding with new understandings, creating a highly active, dense network of shared ideas and insights. Cutting edge technology is revolutionizing neuroscience, providing tools that enable study of unchartered territories resulting in groundbreaking discoveries. Medical breakthroughs offer relief to brain related illness and injury involving the spinal cord, chronic pain, Parkinson's, ALS-Lou Gehrig's disease, Alzheimer's, Traumatic Brain Injury and finally, a glimpse of hope for the lost and forgotten victims, profoundly suffering with mental illness.
</p>
<p>
Furthermore, these findings are reshaping the culture of education, a profession devoted to fostering a love of learning and the acquisition of knowledge. Teachers can use advances in neuroscience to guide their instruction and classroom culture. Developments in neuroscience can be applied in the classroom to improve the ways students learn and provide insight into the way we teach and how we reach. Ultimately, we want our students to know how to think, and become independent, innovative problem solvers. In order to do this, students should to be aware of their own thinking and must understand the metacognitive skills necessary to develop it. Most students have very little knowledge about the brain's anatomy and its functions as they relate to the cognitive domains. These domains have varied levels of complexity involving many of the brain's anatomical functions. In addition, a student's cognitive flexibility, the ability to change ones mental states as needed, is a major component in one's ability to create and generate novel ideas, and develop them; a new measure of intelligence. As students learn how the functions of their brain work together, they will discover their personal power over how they learn and be encouraged to stretch their own accepted limits. In addition, when one is conscious of how one acquires knowledge, than one can improve it by employing metacognitive skills. As in learning to ride a bike, or drive a car, skills are learned best when taught directly and explicitly.
</p>
<p>
I designed this unit to teach students the anatomy and cognitive functions of the brain through engaging, hands on activities. An evolutionary journey of development will highlight the roots of our brain's anatomy, functions, and cognition, offering students a perspective and appreciation for the way this extraordinary organ has developed. As a result, students will understand the significance of our most recently acquired anatomical feature, the cerebral cortex. Distinguishing us as a species, the cortex brought consciousness and our ability to make decisions, plan, evaluate, and create; our higher level complex thinking. Students will construct a clay model of the brain as they learn its anatomy and major functions, discovering how these systems relate to learning. As students realize how these cognitive systems determine their own thinking both anatomically and functionally, they will be empowered to exercise their cognitive skills and engage in thinking that is more complex. A focus on the structure and function of the neuron will develop an understanding of its complex nature. Simulations of neural connections and electrical pathways will help students understand how messages move between neurons and will demonstrate how memories are made and recalled. As students explore memory processing, they will come to understand that these systems collectively produce our ability to think and learn. Creating, evaluating, analyzing require different mental states which can be controlled and changed. With this understanding, students will learn to exercise cognitive flexibility adapting as necessary to the needs of a particular situation, stretching their mental limits propelling them forward, as thinkers, innovators, and creators breaking through the once accepted limits of their own mind.
</p>
<hr/>
<h2>
Rationale
</h2>
<p>
"At 1:30 we get to do science!" Rosanna whispered with excitement as she glanced anxiously at the clock. The clock strikes 1:30 and science begins. Sparks begin to fly. The air is electrified with curiosity, thinking and wondering. The beautiful buzz of thinking fills the air as students are fully engaged in learning, through science. I can't think of a better way of teaching students to think than through the subject of science. Teaching through science is like feeding your child their vegetables by hiding them in spaghetti sauce. They get the nutrition needed while enjoying a favorite meal. As student learn and explore their amazing brain power in this unit, they will be expanding vocabulary, writing, questioning, hypothesizing, evaluating, comparing and drawing conclusions. Students will be actively applying their brainpower through engaging activities that exercise their cognitive skills and flexibility, stretching higher level thinking in the process of inquiry and discovery!
</p>
<p>
As a fourth grade teacher in the New Public Schools, my students are strapped with the demands of testing; the Connecticut Mastery Test, as well as district assessments. Subjects compete for center stage, often squeezing the science curriculum to its bare bones. Students are not prepared for the rigors and expectations of the science CMT in fifth grade. I would like to bring the subject of science back to center stage, making it the star; shining light across the curriculum through the relevant and enlightening subject matter of the human brain.
</p>
<p>
"The brain, a cold grey matter with the consistency between butter and jelly, was once discarded. The Egyptians, when mummifying their dead, actually scooped out the brains and threw them away. It did not beat like the heart or expand like the lungs, if you sliced off the top of someone's skull and peered inside, you wouldn't see much happening at all."
<sup>
1
</sup>
It is no wonder the brain was tossed and discarded as useless matter. The brain is only beginning to reveal its secrets in ways that we can now measure and understand. Recent advances in the past 50 years in magnetic resonance imaging (MRI) and now functional MRI (fMRI) have opened the doors to an explosion in neuroscience. Although new information is unraveling secrets of the mind, an infinite number of questions remain unanswered.
</p>
<p>
Our abilities to evaluate, synthesize, and create are rather newly acquired skills. We can thank evolution, and our predecessors, for the gift of our frontal lobes. Thankfully, the luxury of their expression is taken for granted, with our highly sophisticated neural network of the cortex. Clearly, these exceptional skills set us uniquely apart from the animal kingdom. Our thinking has a fascinating story of development, connecting us to our past and future; earned as a species it continues to evolution. How does our brain work? What is the story behind our evolving brain? How does the human brain compare to that of a fish, an amphibian, or a reptile? How does our brain process our memories and use what we know, to solve what we do not? How do we create innovative solutions to problems? With these questions in mind, this unit shines a light on the brain, its evolution, anatomy, and cognitive functions.
</p>
<hr/>
<h2>
Evolution of the Brain
</h2>
<p>
Rita Carter asserts that the anatomy and functions of our brain are linked to fish that lived 300 million years ago. Beginning as a bundle of nerve cells incased in a small tube in the fish, Carter describes the layers of the brain as they evolve to the complex systems of the human brain of today. Carter connects evolutionary steps of development linking the primitive functions of a tiny aquatic invertebrate, to an earthworm, and then to a fish, reptile, mammal, and finally to the extraordinary specialized functions of the human brain. The story starts with a tiny aquatic invertebrate called a hydra. The hydra showed evidence of brain function in its loose network of sensory cells that connected to groups of cells called ganglia. In the earthworm, this group of cells began to function as a crude brain with a nerve cord that extended the length of the earthworm's body. Just like our spinal cord, the earthworm's nerve cord extended from a centralized location in the head to the tail, functioning as a primitive nervous system that communicated information by sending and receiving messages to produce movement.
<sup>
2
</sup>
</p>
<p>
The next notable step in evolution is the change from invertebrates to vertebrates. The nerves in the fish, the first vertebrate group, came together according to their sensitivity to smell, forming the smell brain.
<sup>
3
</sup>
Additional nerve cells organized according to their sensitivity to light, forming eyes. These groups of nerves connected to another group of nerves that controlled movement in a new unit at the top of the spine, the cerebellum. These three grouping of nerves and their specific sensitivity to smell, light and movement characterized the fish brain. The amphibian brain is similar to the fish brain except for the more fully developed olfactory bulb, marking a significant change in the improved ability to perceive smell. This change came along with the first recognizable limbs. As their environment changed, so did the criteria for survival. An improved, more developed olfactory bulb increases these chances for the amphibian.
</p>
<p>
These sensory groups took a giant leap in evolutionary terms represented in the development of the thalamus in the anatomy of the reptilian brain. The thalamus added a system for sensory control. This system enabled the sensory information collected through the senses of sight, smell, and hearing to become integrated.
<sup>
4
</sup>
Consequently, the reptilian's senses were able to work together causing a more complex interaction with its surrounds. This sensory integration gave rise to a more sophisticated response to the environment. The reptile could gather sensory information in the thalamus and use it to eat and avoid being eaten.
</p>
<p>
The limbic system and a wrinkled covering called a cortex distinguish the mammalian brain. Unlike the smooth cortex of the reptilian brain, the newly developed wrinkles on the cortex of the mammalian brain allowed the enlarged surface area of the cortex to fit within the skull. In addition, within the limbic system, the hippocampus and amygdala together formed a crude memory system for the first time, encoding experiences. This early limbic system enabled the production of emotions and behaviors that extended beyond primitive survival responses of fight or flight. This more complex group of systems involving memory, emotion, and sensory integration allowed for a more sophisticated response to the environment – for the first time, a step beyond pure instinct.
<sup>
5
</sup>
The mammalian brain continued to show improvement in response to the changing environment with the development of the cortex and its expressed ability to think and make planned responses to the environment.
</p>
<p>
Consciousness, as we understand it, came to life in the next evolutionary stage. Carter describes this as an explosive period of development marked by increased neural connections caused by the sensory units forming a thin sheet of cells that allowed intense connectivity. The integration of these systems involved new nerve cells within the cortex with heightened neural activity, interconnecting and forming an extensive matrix of neural connections. This thin layer of cells with intense connectivity is the cerebral cortex. Consciousness emerged from this connectivity. An explosive enlargement of the brain occurred with the development of our cerebrum. It created our flat forehead, the shape of our skull, and our complex thinking.
<sup>
6
</sup>
This was the first glimpse of today's mind and its ability to perceive, communicate, remember, understand and appreciate; distinguishing the
<i>
Homo sapiens
</i>
.
<sup>
7
</sup>
Man's brain is unique among other mammalian brains because of its size and the density of the cortex. The neural density increased the gray matter found in the frontal cortex and is responsible for our complex thought, judgment, and reflection; our fully conscious existence.
</p>
<p>
The comparative anatomist, Neil Shubin, in his discussion of anatomical evolution, begins with life's building blocks, DNA. Shubin describes specific examples of the DNA and the genetic recipes for organ building and traces them back 300 million years ago. He lays out evidence that connects the way organs develop, revealing a reoccurring theme that has continued for millions of years, suggesting that the genetic elements of our anatomy extend all the way back to the fish. Shubin says, "When you see these deep similarities among different organs and bodies, you begin to recognize that the diverse inhabitants of our world are just variations of the same theme."
<sup>
8
</sup>
As we compare species in an evolutionary context, we are able to see the relationship between the species and its environment change as the systems of the brain evolve. Primitive species were controlled by and reacted to their environment, through the process of evolution, species developed, interacting with their environment in more complex ways. We have grown and evolved to fully conscious beings interacting with our environment in a highly sophisticated way; a new global consciousness; connecting as a collective world-wide community, assessing, evaluating, creating, developing innovative approaches to problems with a broad scope and vision.
</p>
<hr/>
<h2>
Anatomy of the Brain
</h2>
<p>
The physical structure of the brain can be compared with its mental organization and evolutionary origins.
<sup>
9
</sup>
When examined from the outside in, it is as though one is tunneling back through time when burrowing vertically through the skull from the top of the head to where the spinal cord connects with the brainstem. Deep down in this region, functions are regulated by the unconscious, autonomic systems of the pons, medulla, and thalamus, whose origins are rooted in the primitive reptilian brain. Moving vertically outward through the limbic system and then just beneath the skull, we find the most highly complex fully conscious mental processing center of the brain, the cerebral cortex, a thin gray matter that covers the four lobes of the cerebrum,
<sup>
10
</sup>
the latest and greatest evolutionary feature of the brain.
</p>
<p>
<img alt="" src="../../../images/2012/3/12.03.02.01.jpg"/>
</p>
<p>
http://users.rcn.com/jkimball.ma.ultranet/BiologyPages/C/CNS.html
</p>
<p>
The brain can be divided into three main parts; the cerebrum, cerebellum, and brain stem. The cerebrum is the largest part of the brain made up of folds that wrap around the hemispheres of the brain. These folds are called "gyri" and increase the surface area of the cortex. The cerebrum is divided into four main lobes, the occipital, temporal, parietal, and frontal as well as the hippocampus, basal ganglia and amygdala. Each of these lobes has specific functions. Furthermore, the cerebrum is divided into two hemispheres, the right hemisphere, and the left hemisphere, connected by a huge complex of cables called the corpus callosum. The cerebellum sits in the back of the brain above the brainstem. The brainstem connects the cerebrum and the spinal cord, as well as having its own specialized functions.
</p>
<h3>
Brainstem: Midbrain Pons Medulla
</h3>
<p>
The three parts of the brainstem are the midbrain, pons and medulla. The functions at the brainstem are highly involved in the autonomic systems of our body. Carter compares the brainstem to the ancient reptilian brain because of their anotomical and functional similarities, particularly the regulation of autonomic unconscious movement. All the nerves that run between the spinal cord to the brain pass through the medulla.
<sup>
11
</sup>
Of the 12 cranial nerves that serve the head, 10 connect to the brain stem. The olfactory (1
<sup>
st
</sup>
cranial) nerve goes directly to the limbic system.
<sup>
12
</sup>
The optic nerve (2
<sup>
nd
</sup>
cranial) is actually a tract of the brain, connecting directly with the thalamus. The medulla monitors, controls and regulates respiration, heartbeat and blood pressure as well as vomiting, swallowing, coughing and sneezing. Circadian rhythm, our body clock, is passed to the brainstem, from the hypothalamus, so that body processes follow a 24 hour rhythm.
<sup>
13
</sup>
The pons looks like a bulge on the side of the medulla, like an aneurism. Pons means bridge in Latin, which describes the way the pons links the lower brainstem and the cerebellum in order to coordinate complex muscle movement.
<sup>
14
</sup>
The pons serves as a relay station made up of bundles of nueronal pathways that connect the cerebrum and sensory input coming up from the spinal cord and the cerebellum. The midbrain's main fuctions are arousal or alertness, eye movement, body movement and hearing.
<sup>
15
</sup>
</p>
<h3>
Cerebellum
</h3>
<p>
The cerebellum, or little brain, is located in nape of our neck. The main function of the cerebellum is to regulate and integrate the actions of the muscles in order to produce balance, coordination, muscle control, and learning new motor skills.
<sup>
16
</sup>
The cerebellum is divided symmetrically; between each hemispheres of the brain. Its surface area consists of dense deep folds like the cerebrum. It is thought that the cerebellum stores memories of automated movements like walking and swimming. Recent studies suggest that the cerebellum serves as a support structure for cognitive processing by coordinating the processing of thoughts, emotion, memory, and senses. The cerebellum secures an elaborate number of motor tasks with automaticity, thus freeing up mental space for other activities.
<sup>
17
</sup>
</p>
<h3>
Thalamus
</h3>
<p>
The thalamus is made up of two oval masses, shaped like two small eggs sitting side-by-side 1 ½ long by ½ inch wide.
<sup>
18
</sup>
The thalamus receives a plethora of nerve signals coming from all the senses, except smell, through the cranial nerves and spinal cord as they pass to the sensory cortexes in the cerebrum. When this information passes through the thalamus, it integrates, screens, and sorts incoming sensory information and then relays it to the cerebral cortex and appropriate parts of the brain for further processing. In this way, the thalamus is screening sensory input enabling more focused attention on matters of value and filtering out distractions.
<sup>
19
</sup>
</p>
<h3>
Hypothalamus
</h3>
<p>
The hypothalamus is the "mother" of our autonomic system. It controls the autonomic nervous system maintaining homeostasis in the body. The hypothalamus monitors the internal systems keeping homeostasis through its neural connections, controlling the release of various hormones. It regulates sleep, hunger, thirst, body temperature, blood pressure, hormone secretion, and water balance.
<sup>
20
</sup>
Along with the pituitary gland, the hypothalamus keeps the body systems stable. The hypothalamus interacts mostly with two systems, the nervous system, and the endocrine system, stimulating organs to release hormones. Although the functions of the hypothalamus are extraordinary, it is only the size of a dime.
</p>
<h3>
Hippocampus and Amygdala
</h3>
<p>
The hippocampus is one of the most important parts of the brain and the limbic system. The hippocampus is named after its shape; meaning seahorse in Greek and is one of the only parts of the brain that produces new neurons into adulthood.
<sup>
21
</sup>
The main function of the hippocampus is memory formation and consolidation. It sorts, files, and stores information. The hippocampus filters out insignificant information, keeps information that is important enough to store as memories, and then decides where those memories should be stored. These memories are stored in areas with sensory associations. The hippocampus is able to retrieve memories and process them in conjunction with the frontal cortex. The hippocampus bridges these sensory associates where visual memories, auditory memories and other associated sensory memories are stored with the prefrontal cortex where these memories are processed. When the hippocampus is exercised and highly active, as in London Taxi drivers who must memorize a vast labyrinth of roads around London, its size increases.
<sup>
22
</sup>
</p>
<p>
A significant discovery was made in 1953 that showed how vital the hippocampus is to memory when a large part of the hippocampus was surgically removed from a patient named, HM, in an effort to relieve his suffering from severe epileptic seizers. As a result, HM was unable to retain a new memory for more than seconds. This now famous case showed how significant the hippocampus is to integrating and laying down new memory. The hippocampus converts working memory into long-term storage areas and constantly checks information relayed to working memory. The functions of the amygdala are involved with emotion, memory, and learning. Like the hippocampus, the amygdala is also part of a larger system called the limbic system.
<sup>
23
</sup>
The main function of the amygdala is its involvement with emotion. The amygdala is attached to the end of the hippocampus and regulates the most basic emotional responses to the environment, fear fight, flight, or attack. In addition, it is believed that the amygdala encodes the emotional parts of memories. Emotions can make memories stronger. The interaction of the hippocampus and amygdala is thought to allow one to experience the emotions of a memory when recalled, insuring that we remember events that are emotionally charged.
<sup>
2 4
</sup>
</p>
<h3>
Cerebrum
</h3>
<p>
The cerebrum is the largest part of the brain and divided into four lobes with specialized functions: the frontal lobe, temporal lobe, parietal lobe, and occipital lobe. Korbinian Broman a German neurologist, actually mapped the cortex based on its microscopic anatomy of cells on the arrangement of nerves. The occipital lobe is involved with processing visual information. The temporal lobe is the home for the auditory cortex where our unique ability to make sounds and speak is a function. The temporal lobe is involved with auditory processing of music, sound, comprehension of speech and some memory. Our unique ability to make sounds and speak is a function found in the temporal lobe in Wernicke's area, named after the neurologist who discovered it. This is where information associated with the printed word/language is processed. It is normally located only on the left temporal lobe of the left cerebral hemisphere, defining one of the many characteristics of this hemisphere. The parietal lobe is involved in movement, orientation, calculation and certain kinds of recognition. The frontal lobe is involved in movement and the most integrated processes of brain functions. This is where the brain conducts its highest order thinking, planning, conceptualizing, and is able to appreciate and interpret and regulate emotion according to Carter.
<sup>
25
</sup>
</p>
<p>
<img alt="" src="../../../images/2012/3/12.03.02.02.jpg"/>
</p>
<p>
http://users.rcn.com/jkimball.ma.ultranet/BiologyPages/C/CNS.html#The_Cerebral_Hemispheres
</p>
<p>
The frontal lobe maintains attention and intense concentration filtering out other objects of attention so that maximum cognitive resources are available for the task.
<sup>
26
</sup>
The prefrontal cortex is part of this frontal lobe located directly behind the forehead. The frontal lobes are where executive function is located. It is the most evolved of the lobes, able to retrieve and process vast amounts of information from various systems of the brain to evaluate, problem solving and create.
<sup>
27
</sup>
</p>
<p>
Although the cerebrum is divided into four main lobes, specialized functions have been identified and marked by specific folds on the cerebrum called cortical areas. Below is a chart naming each cortical area and the major function associated with the area.
</p>
<p>
Cortical Areas of the Cerebrum
</p>
<p>
<img alt="" src="../../../images/2012/3/12.03.02.03.jpg"/>
</p>
<p>
http://faculty.washington.edu/chudler/functional.html- www.Neuroscience for Kids
</p>
<p>
<img alt="" src="../../../images/2012/3/12.03.02.05.jpg"/>
</p>
<p>
<b>
</b>
</p>
<h3>
Cerebral Cortex
</h3>
<p>
The cortex makes up about 40% of the brain's total weight. This highly developed layer of gray matter is only an eighth of an inch thick, and has 20 billion neurons. These neurons are organized into six layers. The cortex covers both the right and left hemispheres of the cerebrum and is characterized by deep folds and groves called sulci and gyri. These dense folds triple the surface area of the cortex enabling increased surface area to fit into the skull. If smoothed out, the wrinkles would cover 2.5 square feet.
<sup>
29
</sup>
The cortex enables us to perceive, communicate, understand, and appreciate. This is the part of the brain that is associated with all the thought processes related to consciousness, distinguishing our species as uniquely human.
<sup>
30
</sup>
The ability to know one as a "self" and understand ones character in a conscious way is a function of the prefrontal cortex. The intense neural density and connectivity of this gray matter is probably the most important characteristic of the cerebral cortex because they are the anatomical features that produced consciousness and our ability to exercise complex cognition, rationality, and creativity.
</p>
<h3>
Limbic System
</h3>
<p>
The limbic
<i>
system
</i>
sits underneath the corpus callosum. This system consists of the thalamus, hypothalamus, hippocampus, and amygdala. The structure of the limbic system has roots in primitive evolutionary history. The limbic system sends emotional information to the cortex. The cortex interprets this information on a conscience level. In this way, the limbic system blends the primitive reflexive emotional responses with higher level reasoning functioning in a way that unites the two responses.
</p>
<h3>
Right and Left Hemispheres
</h3>
<p>
The cerebrum is divided into two hemispheres called the right and left cerebral hemispheres. A thick band of axons connect these two hemispheres. 300 million axon fibers form a bundle of cables called the corpus callosum. It is through the corpus callosum that the two sides communicate.
<sup>
31
</sup>
This neural bridge provides the pathway for a continuous dialogue between the two hemispheres.
<sup>
32
</sup>
The corpus callosum allows the two hemispheres to share memory and learning, as well as disease. In an effort to help patients with severe epileptic seizures, between 1961 and 1969, Dr. Sperry led a group of doctors that cut the corpus callosum. He studied the effects of this operation on his patients called, the "split brain" patients. It was discovered that the two hemispheres had a separate, distinct, and very different ways of viewing the world. Each hemisphere had no awareness of the other. Each acted independently and had its own kind of perception.
<sup>
33
</sup>
Although the right and left hemispheres function in distinctly different ways, together they work together each contributing their part to the whole. Each of the sides processes the same information in two distinctly different ways and responds to the information in equally unique ways.
<sup>
34
</sup>
The right side of the brain is often describes as being the artistic hemisphere, while the left side of the brain sees the details and is the verbal and analytic hemisphere. Language is located in the dominant hemisphere, usually the left. These are generalizations, since many functions are shared between the hemispheres.
</p>
<p>
After Jill Bolte Taylor, a neuroscientist, survived a stroke she provides this description of each hemisphere based on the recollection of her symptoms. During her stroke she experienced the world through each hemisprere of her brain very specifically during her own brain hemorrhage. Taylors describes the right and left hemispheres as having two distinct ways of processing information . She explains that the two hemispheres think about different things and care about differnent things, viewing the world with two very different personalities. The right brain is all about the present moment, the here and the now. It thinks in pictures and learns through the movement of our body, kinisthetically. The right brain interprets the present through the senses, interpreting the present moment through the streams of sensory energy; the smells, feels, tastes, sounds and sights, forming a "sensory collage" of the present moment. The right hemisphere views the world connected to each other as beauiful, and unique creatures, a family- a whole. Here to make the world a better place.
</p>
<p>
Taylor describes the left hemisphere as thinking linearly and methodically. It is logical. The left hemisphere is all about the past and future, it picks out details from the present to make predictions about the future. The left hemisphere is designed to pick out details from our enourmous sensory collage of the present moment catagorizing and organizing information and associates it with everything in the past that we have ever learned so that it can project the possibilites for the future. The left hemisphere thinks in terms of language, the "brain chatter." It is the little voice in our heads that connect our internal world to the external world. The two sides of our brain living side by side, separate, unique, special, viewing the world very differently, but together they create for each of us our customized perspective of the world we live in.
</p>
<hr/>
<h2>
The Neuron
</h2>
<p>
<img alt="" src="../../../images/2012/3/12.03.02.04.jpg"/>
</p>
<p>
The neuron is a specialized electrically excitable brain cell. We are born with most of our 100 billion neurons . This cell is able to create, send, and receive messages. There are many different kinds of neurons. Sensory neurons are special structures that detect changes on or inside the body. Motor neurons carry messages to muscles. Interneurons sum up information from sensory neurons before they communicate messages to motor neurons.
<sup>
35
</sup>
The neuron is enclosed in a cell membrane and is composed of three main parts; a body or soma, axon and dendrites. Cell growth occurs from increasing the size of dendrites and forming new connections in response to stimulation.
<sup>
36
</sup>
These connections are affected by increased and decreased activity. Pathways that are used regularly are "hard wired" while less used pathways are lost or "pruned". Practice makes perfect; use it or lose it.
<sup>
37
</sup>
A cell can have tens of thousands of dendrites branching off the soma like branched on a tree, but a neuron has only one axon that branches out at its end. Dendrites receive electrical impulses from other neurons and transmit the impulse through the axon to the next cell.
<sup>
38
</sup>
Sometimes, however, messages are not sent. A neuron is often bombarded by thousands of inputs; both excitatory and inhibitory actions. The neuron is able to integrate these actions, sum them up and respond to the greater of the actions. If the dendrite receives enough messages that are excitatory in nature, it fires an impulse, called an action potential through the axon. A fatty substance called the myelin sheath wraps around and insulates the axon. The thickness of the axon and its myelin wrapping determines the speed with which information travels in it - the thicker the nerve fiber, the faster information travels in it. The myelin sheath is absent at regular intervals along the axon. These exposed parts of the axon are called, Nodes of Ranvier. The journey is enhanced by electrical boosts produced along the axon by the nodes. Electrical impulses move down the axon, often at great speeds. Some axons conduct action potentials at 100 meters per second, while others conduct at less than a meter per second. The electrically charged journey propels the neurotransmitters to their final destination, the axon terminal, where they can be released into the synapse.
<sup>
39
</sup>
</p>
<h3>
Synapse
</h3>
<p>
The synapse is the tiny space between the delivering neuron and the receiving neuron. This is the space that the neurotransmitters cross. Neurotransmitters are chemical molecules that allow signals to pass from neuron to neuron. Neurotransmitter molecules are made in the soma. These molecules are transported along the axon by a tube like conveyor belt and packaged into tiny little balloon like packages called synaptic vesicles. When these little synaptic packages come to the end of the axon, they fuse to membrane. When an action potential arrives, they release their contents, the neurotransmitter molecule, into the synapse. After the neurotransmitters are released into the synapse, or tiny space between the two neurons, they bind to the receptors of the receiving neuron. When this binding occurs, it creates a change in potential in the receiving neuron that may allow for it to pass on the message to the next neuron. This can be quite complicating because of the many connections involved within a single neuron, but the action is determined by the stronger of the forces at the time- inhibitory or excitatory.
<sup>
40
</sup>
</p>
<p>
Neural pathway form and change because of increased or decreased need for these electrical connections and modifications. The adaptability to change structurally is called brain plasticity. At birth, each neuron in the cerebral cortex has approximately 2,500 synapses. By the time, an infant is two or three years old, the number of synapses is approximately 15,000 synapses per neuron.
<sup>
41
</sup>
This amount is about twice that of the average adult brain. As we develop, unused connections are deleted through a process called synaptic pruning. When neuronal synapses activate often, they make more connections and they become stronger. The ability of the brain to change in this way is called plasticity.
<sup>
42
</sup>
</p>
<hr/>
<h2>
Cognition
</h2>
<h3>
Memory
</h3>
<p>
About 2000 years ago, before books, knowledge was retained by memorizing information. One's ability to remember information was synonymous with one's intellectual prowess. Consequently, elaborate techniques to memorize vast amounts of information evolved. Remembering was an art, encoding information to be remembered into visually elaborate detailed stories with emotional associations attached to meaningful personal experiences. These mental movies created a journey of experiences that included engaging activities in a highly vivid visual sequence of events in one mind's eye, connecting each mental event to the topics to be remembered. This technique was called building a Memory Palace and is used by the mental masters of today. (described by Joshua Foer) These ancient techniques illustrate the fundamental elements of the memory process. We remember what we give our attention to. We remember what we experience through our senses. We remember what we are engage in. We remember what is meaningful and relevant to us.
<sup>
43
</sup>
</p>
<p>
Our memories are the building blocks of our thinking and learning. They are the framework for our very existence holding the pieces of lives. What we remember and what we know defines who we are. Knowing and remembering allows one to understand. The ability to recall and manipulate, shuffle, reorganize, and recreate, is higher order thinking. Memory is a highly complex multifaceted system involving many areas and functions of the brain working together. Our memories are formed through a series of stages. The way memories are made; stored, recalled, and processed is the foundation of cognition. It is our memories that create the highly sophisticated way we are able to relate to our environment, the global community; a long way from eat or be eaten. We continue to evolve.
</p>
<p>
A memory is made in stages; sensory, immediate, short term, working and long-term memory. Memories begin as a deluge of experiences streaming in through our senses. Our sensory memory screens this plethora of sensory stimuli. In a millisecond, this information is sifted by its importance, related to survival, at the brain stem in the RAS (reticular activation system) and thalamus. Emotions strengthen memories and increase their importance. Fear and anxiety cause a reflexive response that inhibits cognitive functioning when hormones are released.
<sup>
44
</sup>
Immediate memory and short-term memory are temporary and unconscious. Immediate memory holds information for just 30 seconds, and then drops irrelevant data. With further attention, information is sent to short-term memory. The prefrontal cortex is active during this stage of processing. Small amounts of information are held ready and active for seconds to a minute. Information can stay in short term memory for longer periods if it is reintroduced, through rehearsal, or repetition.
<sup>
45
</sup>
Working memory is temporary and processes information on a conscious level. Two separate neural circuits are thought to keep information alive in working memory; the phonological loop that encodes audio signals and the visuospatial sketchpad that encodes visual and spatial information. The flow in and around these two systems is controlled by the central control system in the prefrontal cortex.
<sup>
46
</sup>
Working memory cannot attend well to both audio and visual input at the same time. Working memory has specific limitations involving time and quantity. Pre- adolescents can spend 5-10 minutes processing in working memory with sharp focus and 10-20 minutes is considered average for adolescents and adults. Fatigue and lack of focus will occur beyond these limits unless there is a change or break in the manner the information is being addressed. Working memory can organize and manipulate data from short-term memory as well as data from long-term storage, but can only handle a few items at once. Working memory can juggle an average of five items for ages 5-14 and an average of seven items for adults, but this capacity can be improve by chunking information together in ways that give meaning.
<sup>
47
</sup>
Longterm memory can store large amounts of information for a lifetime. Information worth holding onto breaks out of working memory and travels to the hippocampus where it is encoded permanently through a process called long term potentiation and sent to sensory associated areas in the brain. The more ways information is encoded, the greater the number of memory pathways. This is why presenting information in a variety of ways, involving many of the senses is so effective. It is like learning many different routes to the same location. In addition, when new learning is associated with the senses, recall pathways are strengthened.
<sup>
48
</sup>
Memories are stored with associated pre-existing experiences after attention given, making sense of, and giving meaning to the memory. A memory is consolidated when the neural firing pattern is played back and forth often between the hippocampus and the cortex. This repetition causes the memory to move permanently to the cortex, freeing up space for new memories in the hippocampus. Consolidation mostly occurs during sleep.
<sup>
49
</sup>
</p>
<p>
When a memory is recalled the hippocampus is able to retrieve information from sensory associations and is able to put the parts together as a whole, reconstructing the original experience accompanied with senses and emotions. When recalling an experience, neurons fire in the same pattern that they fired when the experience was encoded, thus reconstructing the episode. Retrieval is the re-creation of a past experiences by the synchronous firing of neurons that were involved in the original experience
<sup>
50
</sup>
creating an electrical pathway. When this same memory is recalled repeatedly, the neurons become more strongly connected. Their firing pattern is sensitized, pre-set, and ready to go. If one neuron in the pattern is stimulated and fires, the other neurons will automatically fire the pattern, like a set of dominoes. The memory pathway becomes "hard wired," recalling more quickly and efficiently.
<sup>
51
</sup>
An event in the present can also stimulate recall of information to be used to guide a decision or action. When a memory is retrieved, it is integrated into the new information causing a slight change to the memory.
<sup>
52
</sup>
</p>
<h3>
Creative Thinking
</h3>
<p>
Recent studies by Sharon Thompson - Schiller, a neuroscientist at the University of Pennsylvania, have shown that creative thinking occurs under unique conditions. Normally the pre frontal cortex is engaged in focused, rule guided cognitive activity. However, this area acts very differently in a creative mental state when novel ideas are generated. There is a lower state of cognitive control in the prefrontal cortex during the creative mental state when generating novel ideas. In this state, rules and assumption do not "box in" our thinking. It was discovered that the prefrontal cortex became electrically "quiet" when the subject thought with fewer restrictions and was in a state of "blurred" attentional focus. Thompson- Shillers team gave this state a name, they called it
<i>
hypofrontality
</i>
.
<sup>
53
</sup>
This kind of thinking is very different from the mental state of cognitive control and focused thinking involving ridged perimeters, guidelines, and assumptions as when analyzing or evaluating. Additional studies in the 90's supported this hypothesis when brain waves were measured over the prefrontal cortex. While participants generated novel ideas, alpha waves (8 to 12 cycles per second EEG waves) were recorded. The synchronized firing of the neurons in the state of defused attention and relaxed wakefulness is a state of lower cognitive control. Alpha waves denote a synchronized firing of the neurons. Further support for the theory of
<i>
"hypofrontality"
</i>
was found during the generation of novel ideas, in Schiller-Thompsons most recent study. In this study, participants were asked to find uses for objects. The most creative participants showed minimal activity in their prefrontal cortex but also showed activity in the posterior brain regions, areas of visuospatial skills.
<sup>
54
</sup>
These studies suggest that when there is lower cognitive control, thus less filtering of knowledge, one is able to think more creatively. The state of hypofrontality allows one to be more open to possibilities without preconceived notions and assumptions that could stifle thought. The characteristics of the mental state needed to generate novel ideas and facilitate creative thinking is a state that is relaxed, with less cognitive control, and defused attention. However, the mental state needed to become the subject area expert necessary before entering the creative domain requires a mental state of focused attention with cognitive control.
</p>
<p>
The ability to move back and forth between these cognitive states, from a mental state with high cognitive control to a relaxed state of diffused attention of lower cognitive control, is called cognitive flexibility. In a 2010 study by Zabelia and Robinson, it was discovered that the more creative thinkers showed greater cognitive flexibility when measuring results of the Stroop test, a test that measures cognitive control using color words written in same and different colors than their name.
<sup>
55
</sup>
</p>
<p>
Creative thinking is our highest cognitive domain. It is the thinking that generates novel ideas and innovations. Creative thinking requires a unique mental state, hypofrontality, a relaxed state with defused attention, and less cognitive control. In addition, the generation of creative ideas and solutions is best accomplished alone, but after it is generated, sharing the idea with others can help develop it. Once a creative idea is generated, however, putting it into action and developing it requires a more controlled, focused cognitive state as needed for assessing and evaluating.
<sup>
56
</sup>
Breaking through old thinking styles requires one to exercise cognitive flexibility, an ability to move fluidly between mental states as needed. I believe this skill is worth sharing with our student and structuring learning for this opportunity. With this understanding, students will learn to exercise cognitive flexibility, adapting as necessary to the needs of a particular problem, stretching their mental limits propelling them forward, as thinkers, innovators, and creators.
</p>
<hr/>
<h2>
Common Core Content Standards addressed in this unit:
</h2>
<p>
Scientific Inquiry
</p>
<blockquote>
<dl>
<dt>
· Scientific inquiry is a thoughtful and coordinated attempt to search out, describe, explain, and predict natural phenomena.
<dt>
Scientific Literacy
<dt>
· Scientific literacy includes speaking, listening, presenting, interpreting, reading and writing about science.
</dt>
</dt>
</dt>
</dl>
</blockquote>
<hr/>
<h2>
Lessons and Activities
</h2>
<p>
Daily Journals: Students will record their hypnosis, predictions, procedures, questions, observations, and results of activities. Students should be encouraged to include detailed illustrations in their records.
</p>
<p>
Activity: Clay Model of the Brain
</p>
<p>
Objective: Students will build a brain constructing each anatomical feature as it is learned and label with toothpick flags. Students will understand that the brain has a unique anatomy made up of many parts with specialized functions. Each anatomical feature will be a different color.
</p>
<p>
Materials: modeling clay of varied colors.
</p>
<h3>
Lesson 1: Brainstem: Midbrain- Pons - Medulla
</h3>
The medulla is an extension of the spinal cord, where the spinal cord changes into the brain. The medulla becomes structurally thicker; the pons is like two thick stalks with bulges on the side near the top of the medulla the size of a large gumball about 2.5 cm. The pons lies behind the medulla and cerebellum connecting the medulla to the midbrain.
<p>
Objective: Student will understand the anatomy and functions of the brainstem.
</p>
<p>
Students will roll out a coil of clay that is thicker at the top to show the medulla extending out of the spinal cord. The length should be about 10 cm. Students will shape a bulge on the side top of the medulla to form the pons, which serves as a relay station of sensory information between the cerebrum and cerebellum and the rest of the central nervous system.
</p>
<h3>
Lesson 2 Cerebellum
</h3>
Objective: Students will understand that the cerebellum is located at the nape of the neck and behind the medulla.
<p>
Students will make a cerebellum with two symmetrical parts (about 4 cm) that look like small clams and know that its main functions involve muscle movement, coordination, and balance. Student will make two oval shapes and attach them to back of the brainstem and label it with a toothpick flag.
</p>
<h3>
Lesson 3 Thalamus
</h3>
Objective: Students will understand that the thalamus consists of two oval shaped masses that sit above the medulla side by side, one in each hemisphere. Students will understand that the thalamus sorts information from the four senses, sight, hearing, taste, and touch.
<p>
Students will make a thalamus by rolling and shaping clay into two ovals, 1.5cm x .75cm. Then, place the two ovals side by side on above the pons and medulla and label with a toothpick flag.
</p>
<h3>
Lesson 4 Hypothalamus- Hippocampus- Amygdala
</h3>
Objective: Students will understand that the hypothalamus is the size of a dime and is able to keep homeostasis within our body, regulating and controlling autonomic functions and conscience function of behavior and instinct releasing hormones as a result of sensory input. Students will shape an amygdala like a little ball and hippocampus like a seahorse and place it above the thalamus.
<h3>
Lesson 5: Cerebrum
</h3>
Objective: Students will understand that the cerebrum is a thin flat organ that has many folds so it can fit in the skull.
<p>
Students will roll clay to 12" diameter circle 1/8 inch thick. Cut the circle in half and fold. Wrap each folded half around the each side of the thalamus on top of the brainstem, making the cerebral cortex covering each right and left hemisphere separately. Label with toothpick flag.
</p>
<h3>
Lesson 6: – Evolution of Brain: Timeline
</h3>
Objective: Students will understand that the brain's anatomy and function has evolved over time.
<p>
Hand our pictures of a fish, worm, amphibian, reptile, mammal, and human as well as pictures of their brains. Ask students to match brains with species, then compare and contrast the physical features of the brains with the animal function using what they have learned about that anatomy of the brain. Then distribute reference guides with dates for the development of each species. Divide students into groups. Instruct students to draw a timeline marking dates, and label date with species. Ask students to list characteristic of each group in relation to its environment. Discuss characteristic of each brain in relation to the environment and species. Hypothesis reasons for change, examine evidence. Make predictions. Encourage use of resources during exercise, ie classroom computers and library.
</p>
<h3>
Lesson 7: The Neuron
</h3>
Objective: Students will understand that a neuron is a special brain cell with unique features designed to communicate messages in electrical neural pathways as they illustrate and act out its function.
<p>
Draw two neurons on the board and label the parts while explaining their functions. (Soma, axon, dendrites, neurotransmitters, vesicle, synapse) Illustrate how a message is sent. Ask students draw and label the parts of the neuron in their notebook. Divide the class into groups. Hand out chart paper, scissors, and colored paper for the vesicles with neurotransmitters molecules in them. Ask students to work together to make two neurons sending a message. Outside on the basketball court, ask student to draw several neurons (4-5) with colored chalk. Students will be neurotransmitters and demonstrate a neural pathway as a neurotransmitter moving down the axon, across the synapse to the dendrite of the next neuron. Ask students to make different pathways.
</p>
<h3>
Lesson 8: What is in the Bag? Sensory Integration- Thalamus
</h3>
Objective: Students will learn that the senses work together gather information.
<p>
What's it the bag? Put popcorn in paper bags. Working with a partner, ask students to use their sense to make hypothesis about the contents of the bag. Open bag to verify prediction. Enjoy the contents with multisensory experience. Variations: Senses and objects can vary. Make guesses by feeling what is in the bag
</p>
<p>
Extended reading: Louis Braille
</p>
<h3>
Lesson 9: Memory: Practice Improves
</h3>
Objective: Students will understand that when practicing recalling information it creates stronger pathways that are faster and more efficient.
<p>
Time each trial and graph results to show improved speed and accuracy. Ask student to write down a sentences then pick one. Line up ten students. Ask only the first person to read the sentence and then whisper the sentence to the next student, passing the message along to the end just like a neural message. Ask the last student to write what was heard after the message passed through the ten of them. Compare the beginning message with the end message. Repeat trial 3 times timing each. Compare the speeds and accuracy.
</p>
<h3>
Lesson 10: Memory- Build a Memory House
</h3>
Objective: Students will understand that memories are stored in associated sensory areas
<p>
Draw a memory house. Pick a significant memory. Illustrate each part of the memory in relation to each of the senses you remember during the experience. Draw a house with each room being a different sense- smells, tastes, feelings, sights, sounds. Draw or list all the related memories associated with each sense.
</p>
<h3>
Lesson 11: Attention/memory
</h3>
Objective: Students will understand that they will remember what they give their attention to and miss what they do not.
<p>
Partner students. Ask students to face each other and each taking turns and ask 5 questions about their favorite foods. Next, tell students to turn around and change 3 things about themselves, physically- secretly. (ex: remove glasses, hold a pencil, roll up sleeves) Ask students to turn back to their partner and ask what changes they noticed. Students will have difficultly as their attention was focused on questioning. Record observations and hypothesis.
</p>
<h3>
Lesson 12: - Thinking Creatively
</h3>
Objective: Students will understand that creative thinking involves organizing and sorting information in a variety of ways, different uses for an object, new ways to look at things, breaking down ideas into parts and trying new ways to put the parts together.
<p>
Give students the Stroop test
<sup>
57
</sup>
measuring cognitive control and flexibility. Give students 9 object. Ask them to sort items into categories. Label and explain sorting. Repeat three times. Grouping items in different ways exercises creative thinking. Pass out ordinary objects. Ask student to see how many uses they can you think of for, popcorn, a newspaper, pencil, paperclip, a thumbtack. Share ideas. Thinking of objects in a variety of way exercises creative thinking because helps us see, question, and move beyond assumption.
</p>
<h3>
Lesson 13: Creative Creatures
</h3>
Objective: Students will apply what they have learned about the brain's anatomy as it relates to function in a novel way by creating fictitious creatures. Encourage, humor and exaggeration, "super human qualities," gently nudging students, "outside the box." Ask student to write a description of what their creature can do and why. Extension: Create super heroes with "super human qualities," with a written description of the abilities and physical characteristics based on anatomy and function of the brain. Ask students to illustrate and describe their character including a magnification the brain structure with captions that describe the super human qualities of this brain anatomy and functions.
<hr/>
<h2>
Bibliography
</h2>
<p>
<font size="-1">
Ackerman, Sandra.
<i>
Discovering the Brain for the Institute of Medicine National Academy of Sciences
</i>
. Washington, D.C., 1992. The book arose from a 1990 symposium organized by the Institute of Medicine to initiate the presidentially declared decade of the brain. Ackerman discuss the brain systems and function on a molecular level describing advances and presenting a clear overview of neuroscience to date in addition to political and improved mental health perspectives.
<p>
Carter, Rita.
<i>
Mapping the Mind
</i>
. Berkeley, Los Angeles: University of California Press, 2010. A fascinating book explaining complex roadmaps of thought and cognitive processes based on most recent brain research; elaborate illustrations and photographs.
</p>
<p>
Carter, Rita.
<i>
The Human Brain Book
</i>
. London, England: Dorling Kindersley Limited, 2009. Rita Carter writes with clarity and profound understanding as she describes the anatomy and functions of the brain with explicit detail. In addition, her writing is accompanied by full color illustrations, highly detailed visual explanations supporting Carter's explanations.
</p>
<p>
Chrysikou, Evangelia G.
<i>
Your Creative Brain At Work
</i>
. Scientific American Mind , Volume 23, Number 3, August/July: Scientific America, Inc., New York, New York, 2012.
</p>
<p>
Foer, Joshua.
<i>
Moonwalking with Einstein
</i>
. New York, New York.: The Penguin Press, 2011. Foers intrique with memory savants carries him on a colorful journey challenging himself to become a memory champion in his own right. He takes you through a query culture of savants and interpreting the science and art of remembering in ways you have never considered. Foer explores the art of memorizing and its relationship to how we think about our memory today giving a new perspective about the way we think about remembering.
</p>
<p>
Mader,Sylvia.
<i>
Human Biology
</i>
. New York, New York: McGraw Hill, 2008. A biology text book, The book has proved to be a great reference for the basic biological processes and anatomical structures of the brain. Information is clearly stated and supported with many detailed and informative illustrations.
</p>
<p>
Marzano, Robert, Debra Pickering and Jane Pollock.
<i>
Classroom Instruction that Works
</i>
. Alexandria: Association for Supervision and Curriculum Development, 2001. A comprehensive resource of research based teaching strategies that are proven to increase student achievement.
</p>
<p>
McGregor ,Tanny.
<i>
Comprehension Connections, Bridges to Strategic Reading
</i>
, Portsmith: Heinemann , 2007. An excellent resource for the application of metacognitive reading strategies. The Trait Mate symbols can be applied to many of these reading strategies.
</p>
<p>
Sack, Oliver.
<i>
The Man Who Mistook his Wife for a Hat
</i>
. A collection of stories involving patients with rare and unusual dysfunctions of the brain told through the eyes of a doctor of neuroscience as well as a man with deep compassion, relaying the fragility and resilience of the human mind and spirit with a touch of humor!
</p>
<p>
Shubin, Neil.
<i>
YOUR INNER FISH, A Journey into the 3.5 Billion Year History of the Human Body
</i>
. New York,: Vintage Books a Division of Random House, Inc.,2008. Shubin carries the reader through time and species in a scientific journey of discovery connecting our anatomy to species 3.5 billion years ago as he unites us with our inner fish. The extraordinary connections that link us structurally, molecularly and genetically through time and species are described in fascinating detail as Shubin evokes awe and wonder in our direct and explicit connect to the life around us, offering perspective and history of ourselves.
</p>
<p>
Sousa, David A.
<i>
How the Brain Learns, Third Edition.
</i>
Thousand Oaks California: Corwin Press, 2006. Sousa uses the latest research in neuroscience to discuss the application of these finds in terms strategies and skills that can be implemented in the classroom in order to improved teaching and student learning.
</p>
<p>
Williams, Robert, and John Stockmyer.
<i>
Unleashing the Right Side of the Brain The LARC Creativity Program, The Systematic Approach for Unlocking Creative Potential.
</i>
Lexington, MA.: The Steven Green Press, 1987. In addition to a comprehensive discussion of the left and right brain functions, Williams and Stockmyer describe an innovative look into the undeveloped, undervalued, untapped power of the brain's creative potential and a systematic approach to access creative thinking.
</p>
<p>
Willis, Judy M.D.
<i>
Researched –Based Strategies to IGNITE Student Learning, Insights from a Neurologist and Classroom Teacher.
</i>
Alexandria, V.A.: Association for Supervision and Curriculum Development, 2006. Willis combines experience and knowledge and as a neuroscientist with her expertize and passion for teaching offering a insightful guide to brain function and its relation to the academic implications. Willis organizes her writing in a way that can be easily understood and accessed for quick reference. The sections of "Grey Matter" included in each chapter align specific brain function on a neural and chemical level as well as detailed descriptions of anatomy involved in processing the concepts being discussed.
</p>
<p>
Wooldridge, Dean E.
<i>
Sensory Processing in the Brain an Exercise in Neuroconnective Modeling
</i>
. London: John Wiley And Sons, 1979. An excellent study of sensory processing through models of neural processes. The text includes operating and circuit characteristics of sensory processing. Each of the senses is addressed, from the simplest- smell and taste to most complex-visual, to which he devotes half the book. Wooldridge lays out his processing data from the perspective of - physical properties and the detailed actions of interconnections. Although extremely technical and detailed, Wooldridge conveys the complexity of neural processing in a way that can be understood to those who seek a deeper understanding of these processes and are willing to take is slowly.
</p>
<p>
Bloom, Floyd E.
<i>
Best of the Brain from Scientific American: Mind, Matter, and Tomorrow's Brain
</i>
. Washington: Dana Press, 2007.
</p>
</font>
</p>
<hr/>
<h2>
Web Resources
</h2>
<font size="-1">
<p>
http://kidshealth.org/kid/htbw/brain.html
</p>
<p>
http://faculty.washington.edu/chudler/introb.html
</p>
<p>
http://www9.biostr.washington.edu/da.html
</p>
<p>
http://www.med.harvard.edu/AANLIB/home.html
</p>
<p>
http://www.ted.com/talks/jill_bolte_taylor_s_powerful_stroke_of_insight.html
</p>
</font>
<hr/>
<h2>
Endnotes
</h2>
<p>
<font size="-1">
1. Rita Carter, The Human Brain Book, p
<p>
2. Rita Carter, The Human Brain Book, p.48.
</p>
<p>
3. Rita Carter, Mapping the Mind, p.33.
</p>
<p>
4. Rita Carter, Mapping the Mind, p. 32.
</p>
<p>
5. Rita Carter, The Human Brain Book, p 49.
</p>
<p>
6. Rita Carter, Mapping the Mind, p 32.
</p>
<p>
7. Maya Pines, Landscapes of the Mind, The Incredible Machine,p.326
</p>
<p>
8. Neil Shubin, Your Inner Fish, p.80.
</p>
<p>
9. Rita Carter, The Human Brain Book, p.57.
</p>
<p>
10. Rita Carter, The Human Brain Book, p. 57.
</p>
<p>
11. Sandra Ackerman, Discovering the Brain, p.15.
</p>
<p>
12. Davis A. Sousa, How the Brain Learns, p.18
</p>
<p>
13. Rita Carter, The Human Brain Book, p.63
</p>
<p>
14. Sandra Ackerman, Discovering the Brain, p.16
</p>
<p>
15. Rita Carter, The Human Brain Book, p.245.
</p>
<p>
16. Sylvia S. Mader, Human Biology, p. 259.
</p>
<p>
17. David A. Sousa, How the Brain Learns, p.20.
</p>
<p>
18. Rita Cater, The Human Brain Book, p. 60.
</p>
<p>
19. Sandra Ackerman, Discovering the Brain, p.16.
</p>
<p>
20. Sylvia Mader, Human Biology, p.258.
</p>
<p>
21. Rita Carter, Mapping the Mind, p. 14.
</p>
<p>
22. Rita Carter, The Human Brain Book, p.160.
</p>
<p>
23. Rita Carter, The Human Brain Book, p. 157.
</p>
<p>
24. David A Sousa, How the Brain Learns, p.19.
</p>
<p>
25. Rita Carter, Mapping the Mind, p 14.
</p>
<p>
26. Rita Carter, The Human Brain Book, p.180.
</p>
<p>
27. David A. Sousa, How the Brain Learns, p.16.
</p>
<p>
28. http://faculty.washington.edu/chudler/functional.html www.Neuroscience for Kids
</p>
<p>
29. Rita Carter, The Human Brain Book, p 39.
</p>
<p>
30. Maya Pines, Landscapes of the Mind, The Incredible Machine, p.326 329
</p>
<p>
31. David A. Sousa, How the Brain Learns, p. 166
</p>
<p>
32. Rita Carter, Mapping the Mind, p.40.
</p>
<p>
33. David A. Sousa, How the Brain Learns, p.166.
</p>
<p>
34. Betty Edwards,, Drawing on the Right Side of the Brain, p.36.
</p>
<p>
35. Sylvia Mader, Human Biology, p.249.
</p>
<p>
36. Judy Willis, Ignite, p.1.
</p>
<p>
37. Judy Willis, Ignite, p.2.
</p>
<p>
38. David A. Sousa, How the Brain Learns, p.21.
</p>
<p>
39. Sylvia Mader, Human Biology, p. 253.
</p>
<p>
40. Rita Carter, The Human Brain Book, p.73
</p>
<p>
41. Gopnick,, 1999).
</p>
<p>
42. (Erin Hoiland, Neuroscience for Kids Consultant)
</p>
<p>
43. Joshua, Foer, Moonwalking with Einstien, p. 13.
</p>
<p>
44. David A. Sousa, How the Brain Learns, p.45.
</p>
<p>
45. Sylvia S. Mader, Human Biology, p.260.
</p>
<p>
46. Rita Carter, The Human Brain Book, p.159.
</p>
<p>
47. David A. Sousa, How the Brain Learns, p.43
</p>
<p>
48. Rita Carter, The Human Brain Book, p. 156
</p>
<p>
49. Rita Carter, The Human Brain Book, p 159.
</p>
<p>
50. Rita Carter, The Human Brain Book, p.154.
</p>
<p>
51. Rita Carter, The Human Brain Book, p.154.
</p>
<p>
52. Rita Carter, The Human Brain Book, p. 154.
</p>
<p>
53. Evangelia G. Chrysikou, Your Creative Brain at Work, p. 27.
</p>
<p>
54. Evangelia G. Chrysikou, Your Creative Brain at Work, p.27.
</p>
<p>
55. Evangelia G. Chrysikou, Your Creative Brain at Work, p.29.
</p>
<p>
56. Evangelia G. Chrysikou, Your Creative Brain at Work, p. 31.
</p>
<p>
57. Evangelia G. Chrysikou, Your Creative Brain at Work, p.28.
</p>
</font>
</p>
</body> | 71.29594 | 1,814 | 0.792217 | eng_Latn | 0.999329 |
c99d76ccfe6cd1d92b31bb25face6dbcc8d94da9 | 4,950 | md | Markdown | README.md | nbingham1/Core | 76284d58fd3577a0363e8e8972c174c58be3a185 | [
"MIT"
] | 13 | 2017-10-28T21:56:00.000Z | 2018-10-02T20:17:24.000Z | README.md | nbingham1/Core | 76284d58fd3577a0363e8e8972c174c58be3a185 | [
"MIT"
] | null | null | null | README.md | nbingham1/Core | 76284d58fd3577a0363e8e8972c174c58be3a185 | [
"MIT"
] | null | null | null | # The Standard Core
Welcome to the Standard Core. This is a library for standard containers and their associated algorithms.
For thorough documentation, check out the [wiki](https://github.com/nbingham1/stdcore/wiki).
# Why does this exist?
I've been working with C++ for over a decade at this point. Every now and then, I would need to do something that the C++ Standard Library couldn't do. So I would make the necessary thing and move on. After a while, I noticed that I had managed to implement a full standard library scattered throughout my code base. So, I pulled it all together into a library, and well... here we are.
## Why should I care?
Quite by accident, this library is an interesting case study of a different programming paradigm. I make no claims that this code is optimized, verified, secured, or stabilized. It is provided as is with no guarantee and no promises. However, the resulting API is simple, clean, and expressive. So let's get started.
# Linking
Lets start with a basic program which will include the array header. Every header in this library is found in the `std` directory. Every structure and function are contained within the `core` namespace.
```c++
#include <std/array.h>
#include <std/io.h>
using namespace core;
int main()
{
return 0;
}
```
This can be compiled with the following command.
```
g++ example.cpp -Ipath/to/include -Lpath/to/lib -lstdcore -o example
```
# Paradigms
This library differs from the C++ Standard Library on a few key paradigms. It is these paradigms that make this library unique.
## The Simple Things in Life
First, while the typical array, list, map, and string containers are still the center of the library, there are also dedicated containers for simpler data. This means fill, range, and sparse_range.
```c++
cout << "fill = " << fill<int>(7, 5) << endl;
cout << "range = " << range<int>(5, 15) << endl;
cout << "sparse_range = " << sparse_range<int>(5, 25, 2) << endl;
```
```
fill = {5, 5, 5, 5, 5, 5, 5}
range = {5, 6, 7, 8, 9, 10, 11, 12, 13, 14}
sparse_range = {5, 7, 9, 11, 13, 15, 17, 19, 21, 23}
```
## Power to the Iterator
Second, iterators have full power to modify their base structure. This means that iterators can push, pop, drop, replace, append, and swap. These actions can still invalidate other iterators depending upon the container structure.
```c++
array<int> arr = range<int>(0, 10);
cout << "arr = " << arr << endl << endl;
cout << "arr.at(5).pop(3) = " << arr.at(5).pop(3) << endl;
cout << "arr = " << arr << endl << endl;
cout << "arr.at(2).push(3)" << endl;
arr.at(2).push(3);
cout << "arr = " << arr << endl << endl;
cout << "arr.at(3).append(range<int>(2, 8))" << endl;
arr.at(3).append(range<int>(2, 8));
cout << "arr = " << arr << endl << endl;
cout << "arr.at(4).replace(3, 10)" << endl;
arr.at(4).replace(3, 10);
cout << "arr = " << arr << endl;
```
```
arr = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
arr.at(5).pop(3) = {5, 6, 7}
arr = {0, 1, 2, 3, 4, 8, 9}
arr.at(2).push(3)
arr = {0, 1, 3, 2, 3, 4, 8, 9}
arr.at(3).append(range<int>(2, 8))
arr = {0, 1, 3, 2, 3, 4, 5, 6, 7, 2, 3, 4, 8, 9}
arr.at(4).replace(3, 10)
arr = {0, 1, 3, 2, 10, 6, 7, 2, 3, 4, 8, 9}
```
## Slice and Dice
Third, this has a full implementation of slices. You can use any container to slice another container. These slices make the API significantly cleaner and easier to use while introducing very little run-time overhead.
```c++
array<int> arr = range<int>(0, 10);
cout << "arr = " << arr << endl << endl;
slice<range<array<int>::iterator> > slc = arr.sub(2, 6);
cout << "slc = " << slc << endl << endl;
cout << "slc[1] = 100" << endl;
slc[1] = 100;
cout << "slc = " << slc << endl;
cout << "arr = " << arr << endl << endl;
slice<array<array<int>::iterator> > slc2 = array_t<int>(4, 2, 5, 0, 1).sample(arr);
cout << "slc2 = " << slc2 << endl << endl;
cout << "slc2[1] = 200" << endl;
slc2[1] = 200;
cout << "slc2 = " << slc2 << endl;
cout << "arr = " << arr << endl;
cout << "slc = " << slc << endl;
```
```
arr = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
slc = {2, 3, 4, 5}
slc[1] = 100
slc = {2, 100, 4, 5}
arr = {0, 1, 2, 100, 4, 5, 6, 7, 8, 9}
slc2 = {2, 5, 0, 1}
slc2[1] = 200
slc2 = {2, 200, 0, 1}
arr = {0, 1, 2, 100, 4, 200, 6, 7, 8, 9}
slc = {2, 100, 4, 200}
```
## Simplicity Breeds Sanity
All algorithmic functions like sort, unique, reverse, etc can be run either in place or on a copy of the container in line.
```c++
array<int> arr = array_t<int>(10, 2, 6, 3, 2, 7, 3, 7, 5, 1, 0);
cout << "arr = " << arr << endl << endl;
cout << "sort_quick(arr) = " << sort_quick(arr) << endl;
cout << "arr = " << arr << endl << endl;
cout << "sort_quick_inplace(arr)" << endl;
sort_quick_inplace(arr);
cout << "arr = " << arr << endl;
```
```
arr = {2, 6, 3, 2, 7, 3, 7, 5, 1, 0}
sort_quick(arr) = {0, 1, 2, 2, 3, 3, 5, 6, 7, 7}
arr = {2, 6, 3, 2, 7, 3, 7, 5, 1, 0}
sort_quick_inplace(arr)
arr = {0, 1, 2, 2, 3, 3, 5, 6, 7, 7}
```
| 30 | 386 | 0.618788 | eng_Latn | 0.974247 |
c99e034ba218e729fdce941274a46a1d7dbc88d7 | 5,931 | md | Markdown | worlds.md | evgenii-del/a-tiny-JS-world | bfad857d7e7224286801eee52b72de6718ca5077 | [
"MIT"
] | null | null | null | worlds.md | evgenii-del/a-tiny-JS-world | bfad857d7e7224286801eee52b72de6718ca5077 | [
"MIT"
] | null | null | null | worlds.md | evgenii-del/a-tiny-JS-world | bfad857d7e7224286801eee52b72de6718ca5077 | [
"MIT"
] | null | null | null | # Tiny JS Worlds
Date | Objects | Code Lines | Author's repo
------------|:-------:|:----------:|----------------
2018-10-14 | 0 | 0 | [OleksiyRudenko](https://github.com/OleksiyRudenko/a-tiny-JS-world)
2018-10-31 | 4 | 41 | [KurosavaAkira](https://github.com/KurosavaAkira/kottans-frontend/tree/master/task_js-pre-oop)
2018-11-17 | 4 | 77 | [MitchfFirstGit](https://github.com/MitchfFirstGit/a-tiny-JS-world)
2018-11-16 | 5 | 32 | [beta-version-profile](https://github.com/beta-version-profile/a-tiny-JS-world)
2018-11-17 | 5 | 70 | [linkqwd](https://github.com/linkqwd/a-tiny-JS-world/tree/populate-world)
2018-11-20 | 5 | 27 | [IrynaY](https://github.com/IrynaY/a-tiny-JS-world/tree/populate-world)
2018-11-23 | 4 | 46 | [kalash14](https://github.com/kalash14/a-tiny-JS-world/tree/populate-world)
2018-11-28 | 4 | 24 | [maxovsanyuk]( https://github.com/maxovsanyuk/kottans-frontend/tree/master/task_js-pre-oop)
2018-11-28 | 4 | 23 | [zihfred]( https://github.com/Zihfred/a-tiny-JS-world)
2018-11-30 | 5 | 45 | [denislukianenko](https://github.com/denislukianenko/a-tiny-JS-world)
2018-12-01 | 5 | 39 | [vitaliykravchyk](https://github.com/vitaliykravchyk/a-tiny-JS-world)
2018-12-04 | 6 | 59 | [justdevway](https://github.com/justdevway/a-tiny-JS-world/tree/populate-work)
2018-12-04 | 5 | 58 | [MitchfFirstGit](https://github.com/MitchfFirstGit/a-tiny-JS-world)
2018-12-04 | 5 | 74 | [o-msh](https://github.com/o-msh/a-tiny-JS-world)
2018-12-16 | 5 | 52 | [igkostyuk](https://github.com/igkostyuk/a-tiny-JS-world)
2018-12-14 | 5 | 89 | [leonovoleksii](https://github.com/leonovoleksii/a-tiny-JS-world)
2018-12-21 | 5 | 68 | [frostwolm](https://github.com/frostwolm/a-tiny-JS-world)
2018-12-21 | 5 | 89 | [Aldegid](https://github.com/Aldegid/a-tiny-JS-world)
2018-12-21 | 4 | 46 | [AlinaLadybug](https://github.com/AlinaLadybug/a-tiny-JS-world)
2018-12-21 | 4 | 53 | [RomanovAleksander](https://github.com/RomanovAleksander/a-tiny-JS-world)
2018-12-22 | 5 | 67 | [sioniks](https://github.com/sioniks/a-tiny-JS-world)
2018-12-22 | 5 | 50 | [yulyasystem](https://github.com/yulyasystem/a-tiny-JS-world)
2018-12-25 | 5 | 45 | [babayK0](https://github.com/babayK0/a-tiny-JS-world)
2018-12-25 | 5 | 72 | [bugagashinka](https://github.com/bugagashinka/a-tiny-JS-world)
2018-12-26 | 5 | 63 | [CuteShaun](https://github.com/CuteShaun/a-tiny-JS-world)
2018-12-26 | 5 | 58 | [Vitaminvp](https://github.com/Vitaminvp/a-tiny-JS-world)
2018-12-26 | 4 | 14 | [zophrox](https://github.com/zophrox/a-tiny-JS-world/blob/populate-world/index.js)
2018-12-26 | 5 | 77 | [nazmariam](https://github.com/nazmariam/a-tiny-JS-world)
2018-12-27 | 4 | 40 | [OlgaFrontend](https://github.com/OlgaFrontend/a-tiny-JS-world)
2018-12-29 | 5 | 52 | [vladk96](https://github.com/vladk96/a-tiny-JS-world)
2018-12-30 | 4 | 34 | [Roman-Halenko](https://github.com/Roman-Halenko/a-tiny-JS-world/blob/gh-pages/index.js)
2019-01-01 | 5 | 62 | [Dnzln](https://github.com/dnzln/a-tiny-JS-world/)
2019-01-03 | 5 | 58 | [wely88](https://github.com/wely88/a-tiny-JS-world)
2019-01-02 | 5 | 21 | [ivarshavets](https://github.com/ivarshavets/a-tiny-JS-world)
2019-01-03 | 5 | 50 | [AnnaGrynchuk](https://github.com/AnnaGrynchuk/a-tiny-JS-world)
2018-12-27 | 5 | 60 | [AlexNugda](https://github.com/AlexNugda/a-tiny-JS-world)
2019-01-04 | 5 | 94 | [vv2529](https://github.com/vv2529/a-tiny-JS-world)
2019-01-05 | 4 | 66 | [Anzhelika](https://github.com/angelikaSemeniuk/a-tiny-JS-world)
2019-01-07 | 5 | 87 | [SergSenras](https://github.com/SergSenras/a-tiny-JS-world)
2019-01-08 | 6 | 61 | [DJStar77](https://github.com/DJStar77/a-tiny-JS-world)
2019-01-10 | 4 | 54 | [webdevagent](https://github.com/webdevagent/a-tiny-JS-world)
2019-01-10 | 4 | 72 | [mfialko](https://github.com/mfialko/a-tiny-JS-world)
2019-01-24 | 4 | 45 | [mxmgny](https://github.com/mxmgny/a-tiny-JS-world)
2019-01-29 | 4 | 50 | [Roka20012](https://roka20012.github.io/a-tiny-JS-world/)
2019-02-28 | 4 | 75 | [Temu4](https://temu4.github.io/a-tiny-JS-world/)
2019-03-21 | 4 | 47 | [madmaxWMFU](https://madmaxwmfu.github.io/a-tiny-JS-world/)
2019-05-18 | 4 | 58 | [aymkin](https://github.com/aymkin/a-tiny-JS-world)
2019-06-08 | 5 | 63 | [ArthurGorbenko](https://arthurgorbenko.github.io/a-tiny-JS-world/)
2019-07-22 | 4 | 22 | [Valkirin](https://valkirin.github.io/a-tiny-JS-world/)
2019-09-20 | 6 | 76 | [Barasii](https://barasii.github.io/a-tiny-JS-world/)
2019-10-26 | 4 | 39 | [karelskiy](https://karelskiy.github.io/a-tiny-JS-world/)
2019-11-02 | 5 | 37 | [dashakim](https://dashakim.github.io/a-tiny-JS-world/)
2019-11-19 | 5 | 50 | [dafen173](https://github.com/dafen173/a-tiny-JS-world)
2020-01-28 | 5 | 63 | [NastjonkaK](https://github.com/NastjonkaK/a-tiny-JS-world)
2020-03-03 | 4 | 73 | [evgeniy241984](https://evgeniy241984.github.io/a-tiny-JS-world/)
2020-09-01 | 5 | 39 | [chris-voitova](https://github.com/chris-voitova/a-tiny-JS-world)
2020-10-28 | 5 | 44 | [mustbefail](https://github.com/mustbefail/a-tiny-JS-world)
2020-10-29 | 5 | 49 | [andrewklmn](https://andrewklmn.github.io/a-tiny-JS-world/)
| 89.863636 | 131 | 0.585736 | yue_Hant | 0.34652 |
c99e3dd31565e11fe6ae598511bb06a5178ab4e6 | 605 | md | Markdown | _posts/Algorithm/coding-test/2021-01-28-algorithm-1.md | jerimo/jerimo.github.io | aed29978db5b40452bf1a793dded2719464ee4f0 | [
"MIT"
] | 5 | 2021-01-07T10:26:45.000Z | 2021-12-11T16:05:57.000Z | _posts/Algorithm/coding-test/2021-01-28-algorithm-1.md | jerimo/jerimo.github.io | aed29978db5b40452bf1a793dded2719464ee4f0 | [
"MIT"
] | 13 | 2021-01-09T11:30:35.000Z | 2021-12-13T11:15:09.000Z | _posts/Algorithm/coding-test/2021-01-28-algorithm-1.md | jerimo/jerimo.github.io | aed29978db5b40452bf1a793dded2719464ee4f0 | [
"MIT"
] | 2 | 2022-03-28T12:42:38.000Z | 2022-03-29T07:04:37.000Z | ---
layout: posts
categories:
- Algorithm
- CodingTest
title: 📌 Coding test 준비
last_modified_at: 2021-01-29
tags:
author_profile: true
sidebar:
title: Posts
nav: "sidebar-contents"
---
## ✍ 코딩 테스트를 위한 알고리즘 공부 시작!
{: width="300" height="500"}
<br>
<br>
<mark style='background-color: #f5f0ff'>'이것이 코딩테스트다.'</mark> 라는 책을 참고하여 알고리즘 공부를 시작했다.
앞으로 Algorithm 카테고리에는 해당 책의 목차에 따라
다양한 알고리즘 (ex. 그리디, 구현, dfs/bfs 등등)을 사용한 문제풀이를 게시할 계획이다.
기본적으로는 해당 문제를 풀이한 내 코드를 올리고
솔루션과의 차이점, 개선점 등을 적어 리뷰할 것이다.
🌟 문제풀이에는 <mark style='background-color: #f5f0ff'>C++언어</mark>를 사용함
| 20.166667 | 86 | 0.690909 | kor_Hang | 0.99997 |
c99ea7b73bb27c02ecf5d1028ae0b7a8239fe32b | 806 | md | Markdown | content/10.hymns-and-tunes-1876/03.101-200/05.141-150/06.Still-on-the-Lord-thy-burden-roll,/docs.md | GospelSounders/adventhymnals | d2108ab49d735b373c59901e5296c8819a1ad3f2 | [
"Apache-2.0"
] | null | null | null | content/10.hymns-and-tunes-1876/03.101-200/05.141-150/06.Still-on-the-Lord-thy-burden-roll,/docs.md | GospelSounders/adventhymnals | d2108ab49d735b373c59901e5296c8819a1ad3f2 | [
"Apache-2.0"
] | 1 | 2021-05-10T23:24:05.000Z | 2021-05-10T23:24:05.000Z | content/10.hymns-and-tunes-1876/03.101-200/05.141-150/06.Still-on-the-Lord-thy-burden-roll,/docs.md | GospelSounders/adventhymnals | d2108ab49d735b373c59901e5296c8819a1ad3f2 | [
"Apache-2.0"
] | null | null | null | ---
title: |
146 Still on the Lord thy burden roll, - Hymns and Tunes 1876
metadata:
description: |
Hymns and Tunes 1876 146. Still on the Lord thy burden roll,. Nor let a care remain; His mighty arm shall bear thy soul, And all thy griefs sustain.
keywords: |
Hymns and Tunes 1876, adventhymnals, advent hymnals, Still on the Lord thy burden roll,, Nor let a care remain;,
author: Brian Onang'o
---
#### Advent Hymnals
## 146. Still on the Lord thy burden roll,
#### Hymns and Tunes 1876
```txt
^Meter:^ ^CM^
1. Still on the Lord thy burden roll,
Nor let a care remain;
His mighty arm shall bear thy soul,
And all thy griefs sustain.
2. Ne’er will the Lord his aid deny
To those who trust his love;
And they who on his grace rely,
Shall sing his praise above.
``` | 28.785714 | 158 | 0.691067 | eng_Latn | 0.984545 |
c99f91ce37934bcb4368af13b7fbf71d761d0718 | 12,259 | md | Markdown | content/sen_noci_svatojanske_009.md | books-are-next/sen-noci-svatojanske | e0e593ce9ee00627031a8d64519f111fbc16ed3c | [
"CC0-1.0"
] | null | null | null | content/sen_noci_svatojanske_009.md | books-are-next/sen-noci-svatojanske | e0e593ce9ee00627031a8d64519f111fbc16ed3c | [
"CC0-1.0"
] | null | null | null | content/sen_noci_svatojanske_009.md | books-are-next/sen-noci-svatojanske | e0e593ce9ee00627031a8d64519f111fbc16ed3c | [
"CC0-1.0"
] | null | null | null | ---
title: JEDNÁNÍ ČTVRTÉ
contentType: prose
---
## 1\. scéna
_Týž les._
_LYSANDER, DEMETRIUS, HELENA a HERMIE spící._
_Vystoupí TITANIE a KLUBKO; HRACHOVÝ KVĚT, PAVUČINKA, MOLÍK, HOŘČIČNÉ SEMÍNKO a jiní ELFOVÉ a ELFY v průvodu. – OBERON v pozadí neviděn._
**TITANIE****:**Pojď, drahý, sedni na kvetoucí trávu,
chci roztomilá líčka hladit tobě
a věnčit růžemi tvou hebkou hlavu
a zlíbat krásné, dlouhé uši obě.
**KLUBKO****:**Kde je Hrachový květ?
**HRACHOVÝ KVĚT****:**Tady.
**KLUBKO****:**
Podrbej mne na hlavě, Hrachový květe. Kde je musjé Pavučinka?
**PAVUČINKA****:**Tady.
**KLUBKO****:**
Musjé Pavučinko, dobrý musjé, seberte své zbraně do rukou a zabijte mi čmeláka s červenými stehýnky na květu bodláčím, a dobrý musjé, přineste mi z něho medový váček. A jen se mi vboji tuze moc neuhřejte, panáčku; a dobrý panáčku, dejte pozor, aby se ten medový váček neroztrh; to bych nerad, abyste se pobryndal medem, signiore. – Kdepak je musjé Hořčičné semínko?
**HOŘČIČNÉ SEMÍNKO****:**
Tady.
**KLUBKO****:**
Podejte mi tlapku, musjé Hořčičko. Prosím vás, nechte těch pukrlátek, dobrý panáčku.
**HOŘČIČNÉ SEMÍNKO****:**
Co ráčíte?
**KLUBKO****:**
Nic, dobrý musjé, jenom tady, kavalírku, Pavučinkovi pomozte drbat. Musím k holiči, panáčku, neboť se mi zdá, že mám tvář báječně chlupatou; a já jsem tak choulostivý osel, že když mne jenom chloupek zašimrá, musím se škrábat.
**TITANIE****:**
Chceš hudbu poslechnout, můj miláčku?
**KLUBKO****:**
Já mám po čertech dobré uši na muziku; zahrajte mi něco na kobylu.
**TITANIE****:**
Neb, miláčku, mi řekni, nač máš chuť?
**KLUBKO****:**
Na mou duchu, tak na měřici obroku; to bych tak žvýkal váš dobrý, suchý oves. Také se mi zdá, že mám laskominy na otýpku sena; dobré seno, sladké seno, není nad takové.
**TITANIE****:**Mám odvážného elfa; vyhledá
z veverčích doupat čerstvé oříšky.
**KLUBKO****:**
To bych tak raději jednu nebo dvě hrstky pučálky. Ale, prosím vás, ať mne žádný z těch vašich lidiček nevytrhuje; přichází na mne expozice k dřímotě.
**TITANIE****:**Jen dřímej, přitulím tě v náruč svou.
Již, elfi, pryč a svých jen dbejte cest.
_Odejdou ELFOVÉ._
Tak něžně libovonný kozí list
je svlačcem ovinut a dívčí břečtan
obtáčí jilmu prsty kornaté.
Ó jak tě miluji, jak mám tě ráda!
_Usnou._
_Vystoupí PUK. – OBERON postoupí kupředu._
**OBERON****:**Buď vítán, Pučku! – Hle, ten něžný zjev!
Mně věru začíná jí líto být
v tom blouznění, neb v lese potkav ji,
jak mlsky hledá protivnému hlupci.
já plísnil ji a s ní se rozešel;
neb ovíjela květy čerstvými
a vonnými ty skráně kosmaté,
a rosa, která jindy na poupatech
jak perly bleskotné se koulela,
teď stála v očích květů spanilých
jak slzíc nad jich vlastní potupou.
Když do libosti jsem ji vyplísnil
a ona vlídně prosila, bych strpěl,
já od ní chtěl to vyměněné děcko;
vydala je hned a poslala
s ním jednu ze svých elf, by donesla
je k mému loubí v říši čarovné.
Teď chlapce mám a zas chci odejmout
jí z očí tuto vadu ohyzdnou.
Ty, Puku, sejmi kuklu netvornou
zde tomu athénskému jonáku,
by, vzbudiv se, až druzí procitnou,
se s nimi všemi vrátil do Athén
a vzpomínal všech příhod noci té
jen jako navštívení zlého snu.
Leč napřed zbavím kouzla královnu.
_(Dotkne se květem jejích očí.)_
Buď, jaks jindy bývala,
viz, jaks jindy vídala:
Dianino poupě ladné
nad Mílkovým květem vládne.
Má královno, již procitni mi ze sna. –
**TITANIE****:**Ó, jaká vidění to byla děsná!
Že osla miluji, se teď mi zdálo.
**OBERON****:**Zde spí tvůj miláček.
**TITANIE****:** Jak se to dálo?
Ó jak mým očím hnusí se ta tvář!
**OBERON****:**Již ticho teď. – Tu hlavu sejmi, Puku. –
Titanie, při hudby čarozvuku
ztiš smysly těchto pěti víc než spánkem.
**TITANIE****:**Aj hudbu, hudbu, čarující sen!
**PUK** _(ke KLUBKOVI)_:
Svým hloupým okem hleď, až probuzen.
**OBERON****:**Zvuč hudba! – Kněžno, teď mi ruku dej
a zem pod těmi spáči kolíbej.
Zas přátelství se na nás usmívej
a zítra k půlnoci náš slavný rej
se v Theseově domě odbývej
a k blahému jej štěstí požehnej.
Dvé párků oddá se tam podle něj,
jak Theseovi jim též blaho přej.
**PUK****:**Králi duchů, slyš, ó slyš,
ranní skřivan zpívá již.
**OBERON****:**V tichém smutku, kněžno, tedy
půjdem nočním stínům v sledy:
obejdeme země kruhem
dřív než bludný měsíc luhem.
**TITANIE****:**Králi, pojď, a na té pouti
ráda chci tě poslechnouti,
jak se stalo, s lidmi těmi
že jsem spala na té zemi._
(Odejde.)_
_Hlahol loveckých rohů za jevištěm._
_Vystoupí THESEUS, HIPPOLYTA, EGEUS a DRUŽINA._
**THESEUS****:**Jdi jeden z vás a najdi lesního,
neb skončen jest náš obřad májový;
i an se přední stráží hlásí den,
má družka uslyš hrát mé ohaře.
Tam v údolí je pusťte k západu
a rychle, pravím, spěšte k lesnímu.
Má královno, my na vrch vystoupíme
a budem poslouchat, jak zvučně splývá
psů vydávání s hlučnou ozvěnou.
**HIPPOLYTA****:**Já byla jednou s Heraklem a Kadmem,
když v krétském lese štvali medvěda
psy spartskými; já nikdy neslyšela
tak čacký halas, neboť kromě hájův
i obloha a ručeje, vše kol
se zdálo hlaholiti navzájem:
tak milozvučícího neladu
jsem nedoslechla, aniž libého
tak hřímání.
**THESEUS****:**Psi moji spartského jsou plemene,
tak plaví, tlamatí; a sluchy visí
jim z hlav, že ranní rosu stírají;
a křivonozí, lalochatí jsou
jak býci thessalští; – ne rychlí v honu,
však vydáváním sladění jak zvonky
po stupnici. – Hry libozvučnější
hlas lovců nezdravil ni hlahol rohů,
ať v Spartě, na Krétě, neb v Thessalii.
Suď, až je uslyšíš. – Však ticho teď!
Jakéž to tady máme rusalky?
**EGEUS****:**Můj kníže, tady moje dcera spí;
a zde Lysander, zde Demetrius
a tady Helena, dceř Nedarova:
já divím se, že jsou zde pospolu.
**THESEUS****:**To jistě záhy sobě přivstali,
by vykonali obřad májový,
a zvěděvše o našem úmyslu,
sem přišli k poctě naší slavnosti.
Však, mluv, Egee, není-li to dnes,
co Hermie se měla rozhodnout?
**EGEUS****:**Tak jest, můj kníže.
**THESEUS****:** Jděte, kažte lovcům,
by lesními je rohy vzbudili.
_Lesní rohy a pokřik za scénou. – DEMETRIUS, LYSANDER, HERMIE a HELENA probudí se a vzchopí se._
**THESEUS****:**Aj, dobré jitro, milí přátelé!
Jest po Valentinu! – Začínají
ti ptáci teprv teď se párkovat?
**LYSANDER****:**Můj kníže, odpusťte!
**THESEUS****:** Jen vstaňte, všichni. –
Vy dva, jak vím, jste v lásce sokové;
jak přišla tato vzácná svornost na svět,
že záští, žárlivosti vzdáleno,
spí podle záští zla se nebojíc?
**LYSANDER****:**Můj kníže, odpovím jen udiven,
v snách zpola ještě, zpola ve bdění:
já přísahám, že říci nemohu
to po pravdě, jak jsem se dostal sem;
však tuším – neboť pravdu mluvit chci,
a teď si vzpomínám, že tomu tak: –
já s Hermií sem přišel, neboť chtěli
jsme z Athén uprchnout, abysme mohli
bez nebezpečí tamních zákonů –
**EGEUS****:**Dost, kníže, dost! Již to vám dostačí:
ať zákon, zákon na hlavu mu padne!
Aj, chtěli utéci, Demetrie,
a chtěli tebe ošidit i mne,
o ženu tebe, mne o svolení,
o svolení, by ženou byla tvou.
**DEMETRIUS****:**Můj pane, sličná Helena mi řekla,
že chtějí uprchnout sem do lesa,
já v zuřivosti spěchal za nimi
a z lásky Helena sem za mnou šla.
Však, dobrý pane, nevím, jakou mocí
– a jistě nějaká v tom vládla moc –
má láska k Hermii se rozplynula
jak sníh a nyní zdá se mi to být
jak hračka nicotná, již jako děcko
jsem míval rád. – A všecka věrnost má,
moc mého srdce, očí blaženost
a jejich cíl jest pouze Helena.
S ní, pane můj, jsem zasnouben byl dřív,
než Hermii jsem shled; leč, jako chorý
já sobě tento pokrm zošklivil;
teď, zdráv zas, nabyv přirozené chutě,
si přeju ho, jej rád mám, prahnu po něm
a na věky mu věren zůstanu.
**THESEUS****:**Ve šťastné chvíli, krásní milenci,
vás potkávám. – Nuž, záhy o tom víc. –
Již, Egee, mi vůli ponechte,
neb ve chrámu a s námi zároveň
ty párky budou navždy spojeny.
A protože už jitro pokročilo,
lov zamýšlený budiž odložen.
Nuž, tři a tři již zpátky do Athén
a slavně zasvěcen buď sňatku den.
Již pojď, Hippolyto!
_Odejdou THESEUS, HIPPOLYTA, EGEUS a DRUŽINA._
**DEMETRIUS****:**Ty věci zdají se tak malé být
a k nerozeznání, jak dálné hory,
jež s podoblačnem vjedno splývají.
**HERMIE****:**Mně jest, že vidím to jak očima,
jimž zdá se všecko býti dvojité.
**HELENA****:**Tak mně; a našla jsem Demetria
jak drahokam, jenž mým jest a zas není.
**DEMETRIUS****:**Jste bezpečni, že bdíme? – Zdá se mi,
že ještě spíme a že vše je sen.
Či vévoda byl zde a poručil,
by šli jsme za ním?
**HERMIE****:** Ano, on tu byl;
můj otec také.
**HELENA****:** Též Hippolyta.
**LYSANDER****:**A kázal nám jít za ním do chrámu.
**DEMETRIUS****:**Tož tedy bdíme. Za ním pojďme již
a cestou každý vypravuj svůj sen.
_Odejdou._
**KLUBKO** _(se probudí)_:
Až přijde moje heslo, zavolejte a já odpovím. Nejdříve dojde na mne po slovech: „Překrásný Pyrame.“ – Hej, ho! Petře Kdouličko! Pískálku, měchaři! Čenichu, kotláři! Hladomore! – Při sám bůh, upláchli a nechali mne spát. – Měl jsem přepodivné vidění. Já měl sen; – člověku jde rozum kolem, má-li říci, jaký to byl sen; člověk je učiněný osel, když se dá do vykládání takového snu. – Mně se zdálo, že jsem byl – a mně se zdálo, že jsem měl – ale člověk je hotový blázen, troufá-li si říci, co se mu zdálo, že jsem měl. Oko lidské neslyšelo, ucho lidské nevidělo, ruka lidská není schopna okusit, jazyk pochopit, aniž srdce povědít, jaký to byl sen. Dám si od Petra Kdouličky napsati písničku o tom snu a ta se bude jmenovat: „Klubkův sen“, neboť je to jako zadrchané klubko; a zazpívám si ji na konci té hry před vévodou. Snad, aby to bylo krásnější a dojemnější, zazpívám to, až bude Thisbe umírat. _(Odejde.)_
## 2\. scéna
_Athény. – Světnice v domě Kdouličkově._
_Vystoupí KDOULIČKA, PÍSKÁLEK, ČENICH a HLADOMOR._
**KDOULIČKA****:**
Poslali jste ke Klubkovi? Nepřišel ještě domů?
**HLADOMOR****:**
Ani slechu o něm. Není pochybnosti, je transportýrován.
**PÍSKÁLEK****:**
Nepřijde-li, je po našem kuse veta. Takhle se přece hráti nebude; není-li pravda?
**KDOULIČKA****:**
Je to zhola nemožné. V celých Athénách nemáte člověka, jenž by dovedl sehráti Pyrama. Jen on to zmůže.
**PÍSKÁLEK****:**
Ba žeť; – zkrátka, on má tu nejschopnější hlavu ze všech řemeslníků athénských.
**KDOULIČKA****:**
Tak jest a také nejhezčí osobu k tomu. A co se týče líbeznosti hlasu, jest on učiněná kokotka.
**PÍSKÁLEK****:**
Konopka chtěl jste říci, konopka; neboť kokotka, pomoz pán bůh, to je tvor nanicovatý.
_Vystoupí ČENICH._
**ČENICH****:**
Sousedé, vévoda právě vyšel z chrámu a byli tam ještě dva nebo tři vznešení pánové a paničky oddáni zároveň s ním. Kdyby se byl náš kus hrál, byli by z nás ze všech hotoví chlapíci.
**PÍSKÁLEK****:**
Ó dobrý, zlatý Klubko! Tys přišel o tři desetníky na den až do smrti; tři desetníky za den nemohly ho minout; a že by mu kníže nebyl dal tři desetníky na den za představení toho Pyrama, to chci viset – a byl by si jich zasloužil – tři desetníky za Pyrama, nebo radš nic.
_Vystoupí KLUBKO._
**KLUBKO****:**
Kde jsou ti hoši, kde jsou ta srdéčka?
**KDOULIČKA****:**
Klubko! Ó nejveselejší den! Ó nejšťastnější hodinka!
**KLUBKO****:**
Sousedé, budu vám povídat zázraky; ale jen se mne neptejte co, neboť povím-li to, nejsem poctivý Athéňan. Já vypovím všecko na vlas tak, jak se to dálo.
**KDOULIČKA****:**
Povídej, zlatý Klubko.
**KLUBKO****:**
Ani slova ze mne nedostanete. Vše, co vám řeknu, jest, že je vévoda už po obědě. Seberte své náčiní; dobré provázky na vousy; nové tkanice na boty a hned se sejděte u paláce. Každý si ještě prohledni svou úlohu, neboť zkrátka a zdlouha naše hra byla vybrána. Každým způsobem ať má Thisbe čisté prádlo; a ten, kdo hraje lva, ať si neořeže nehty, neboť ty musí čouhat ven jako drápy lví. A, milí, drazí herci, nejezte cibule ani česneku, neboť náš dech musí být líbezný, a já nepochybuji, že všichni řeknou, že to byla líbezná komedie. Již ani muk. – Pryč! – Honem! – Pryč!
_Odejdou._
| 32.865952 | 909 | 0.705767 | ces_Latn | 0.999965 |
c99facb637c92f6010fdd14ecc6ae9e329074666 | 528 | md | Markdown | README.md | mtlynch/mtlynch.io-newsletter | cf7d56a326f15fe629cc69abe071724d3d938622 | [
"MIT"
] | null | null | null | README.md | mtlynch/mtlynch.io-newsletter | cf7d56a326f15fe629cc69abe071724d3d938622 | [
"MIT"
] | null | null | null | README.md | mtlynch/mtlynch.io-newsletter | cf7d56a326f15fe629cc69abe071724d3d938622 | [
"MIT"
] | null | null | null | # mtlynch.io newsletter manager
[](https://circleci.com/gh/mtlynch/mtlynch.io-newsletter) [](LICENSE)
## Overview
A tiny web application that allows mtlynch.io blog subscribers to update their subscription preferences.
## To run
Create a `.env` file with settings for `EMAIL_OCTOPUS_API_KEY` and `EMAIL_OCTOPUS_LIST_ID`, then run:
```bash
npm install
npm run serve
```
| 31.058824 | 222 | 0.763258 | eng_Latn | 0.442632 |
c99ffbfea10f014d976efe7d6952efd26cdf8c98 | 57 | md | Markdown | README.md | AlexX333BY/db-adventureworks | 84c19d2a9aa8c8c85a77e00748f97e938de1515b | [
"MIT"
] | null | null | null | README.md | AlexX333BY/db-adventureworks | 84c19d2a9aa8c8c85a77e00748f97e938de1515b | [
"MIT"
] | null | null | null | README.md | AlexX333BY/db-adventureworks | 84c19d2a9aa8c8c85a77e00748f97e938de1515b | [
"MIT"
] | null | null | null | # db-adventureworks
Epam tasks for AdventureWorks2012 DB
| 19 | 36 | 0.842105 | dan_Latn | 0.369763 |
c9a046a71c0fba2e15e20f054d2f29aa140e10be | 2,355 | md | Markdown | readme.md | lyrictenor/nwjs-open-link-in-browser | 7ca198085b2fbbe90f2e415d015cdc409ec542a4 | [
"MIT"
] | 4 | 2015-08-02T03:42:28.000Z | 2017-01-15T08:42:52.000Z | readme.md | lyrictenor/nwjs-open-link-in-browser | 7ca198085b2fbbe90f2e415d015cdc409ec542a4 | [
"MIT"
] | 2 | 2015-07-19T13:52:18.000Z | 2015-07-19T17:26:55.000Z | readme.md | lyrictenor/nwjs-open-link-in-browser | 7ca198085b2fbbe90f2e415d015cdc409ec542a4 | [
"MIT"
] | 2 | 2015-08-22T19:35:22.000Z | 2015-10-17T19:30:23.000Z | # nwjs-open-link-in-browser
[![NPM version][npm-image]][npm-url] [![Travis-CI Status][travis-image]][travis-url] [![Appveyor Status][appveyor-image]][appveyor-url] [![Daviddm Status][daviddm-image]][daviddm-url]
> Open a link in browser for NW.js and browser.
#### NW.js app to browser
####browser to browser
## Install
```
$ npm install --save nwjs-open-link-in-browser
```
## Usage
```html
<script type="text/javascript" src="build/nwjs-open-link-in-browser.js"></script>
<a
href="https://github.com/lyrictenor/nwjs-emoji-app"
onClick="nwjsOpenLinkInBrowser();"
>
github.com/lyrictenor/nwjs-emoji-app
</a>
<button
type="button"
onclick="nwjsOpenLinkInBrowser('http://example.com');"
>
Example.com
</button>
```
### React.js + JSX + Browserify/Webpack
```html
var nwjsOpenLinkInBrowser = require("nwjs-open-link-in-browser");
<a
href="https://github.com/lyrictenor/nwjs-emoji-app"
onClick={nwjsOpenLinkInBrowser.bind(this)}
>
github.com/lyrictenor/nwjs-emoji-app
</a>
<button
type="button"
onClick={nwjsOpenLinkInBrowser.bind(this, "http://example.com")}
>
Example.com
</button>
```
## API
### nwjsOpenLinkInBrowser([url,] event)
Jump to the href property.
#### url
*Optional*
Type: `string`
Jump to url.
## Changelog
[changelog.md](./changelog.md).
## License
MIT © [sanemat](http://sane.jp)
[travis-url]: https://travis-ci.org/lyrictenor/nwjs-open-link-in-browser
[travis-image]: https://img.shields.io/travis/lyrictenor/nwjs-open-link-in-browser/master.svg?style=flat-square&label=travis
[appveyor-url]: https://ci.appveyor.com/project/sanemat/nwjs-open-link-in-browser/branch/master
[appveyor-image]: https://img.shields.io/appveyor/ci/sanemat/nwjs-open-link-in-browser/master.svg?style=flat-square&label=appveyor
[npm-url]: https://npmjs.org/package/nwjs-open-link-in-browser
[npm-image]: https://img.shields.io/npm/v/nwjs-open-link-in-browser.svg?style=flat-square
[daviddm-url]: https://david-dm.org/lyrictenor/nwjs-open-link-in-browser
[daviddm-image]: https://img.shields.io/david/lyrictenor/nwjs-open-link-in-browser.svg?style=flat-square
| 24.53125 | 183 | 0.724841 | yue_Hant | 0.225186 |
c9a061062617cc2fc562901f102d3fef7716e9d7 | 1,300 | md | Markdown | .github/ISSUE_TEMPLATE/not_working.md | eltociear/torchio | 97722cb9acefe5d58a19a6271fbec658201b0373 | [
"Apache-2.0"
] | 1,340 | 2019-12-03T20:53:17.000Z | 2022-03-30T08:47:54.000Z | .github/ISSUE_TEMPLATE/not_working.md | eltociear/torchio | 97722cb9acefe5d58a19a6271fbec658201b0373 | [
"Apache-2.0"
] | 532 | 2019-12-06T10:37:55.000Z | 2022-03-29T10:14:34.000Z | .github/ISSUE_TEMPLATE/not_working.md | eltociear/torchio | 97722cb9acefe5d58a19a6271fbec658201b0373 | [
"Apache-2.0"
] | 193 | 2019-12-05T10:21:13.000Z | 2022-03-15T22:44:26.000Z | ---
name: "\U00002757 Something is not working"
about: If something is not working as expected but you're not sure if it's a bug, please follow the instructions in this template.
title: ''
labels: ''
assignees: ''
---
**Problem**
<!-- A clear and concise description of what the bug is. Please use a short, concise title for the bug and elaborate here -->
**To reproduce**
<!-- What did you do? -->
<!-- Please provide a minimal working example, if possible: -->
<!-- https://stackoverflow.com/help/minimal-reproducible-example -->
<!-- Here's another useful resource: "How To Ask Questions The Smart Way" -->
<!-- http://www.catb.org/~esr/faqs/smart-questions.html -->
```python
# Your code here
```
**Expected behavior**
<!-- What did you expect? -->
<!-- A clear and concise description of what you expected to happen. -->
**Actual behavior**
<!-- What did you get? -->
<!-- A clear and concise description of what actually happens. -->
<!-- If you have a code sample, error messages, stack traces, please provide it here as well -->
```python-traceback
# Paste the *full* error stack trace here
```
**System info**
Output of `python <(curl -s https://raw.githubusercontent.com/fepegar/torchio/master/print_system.py)`:
```
# Paste here the output of that command in a terminal
```
| 26.530612 | 130 | 0.687692 | eng_Latn | 0.986431 |
c9a0e3395b965f1be8922026fd0d42a891b1e82c | 5,126 | md | Markdown | src/content/integrations/wordpress-selfhosted.md | baseline-dev/docs | d73916292251336bdce9f737bc8c749626c4593f | [
"Apache-2.0"
] | 1 | 2020-06-26T07:55:36.000Z | 2020-06-26T07:55:36.000Z | src/content/integrations/wordpress-selfhosted.md | baseline-dev/docs | d73916292251336bdce9f737bc8c749626c4593f | [
"Apache-2.0"
] | 4 | 2021-03-02T01:13:26.000Z | 2022-03-08T23:16:50.000Z | src/content/integrations/wordpress-selfhosted.md | baseline-dev/docs | d73916292251336bdce9f737bc8c749626c4593f | [
"Apache-2.0"
] | null | null | null | ---
layout: layout.njk
title: Baseline Support for self hosted Wordpress
---
Are you using Wordpress as your content platform of choice?
With the Baseline for self hosted Wordpress integration you can easily review who has access to your Wordpress platform.
## Getting started
Selfhosted Wordpress does not offer an API by default which you can connect to with API tokens like [JWT tokens](https://jwt.io/introduction).
This means that Baseline would not be able to connect to Wordpress unless you install a custom plugin or enable API auth support in some other way.
When you use the self hosted Wordpress integration, we require you to provide two parameters:
| Parameter | Description |
|------------------|------------------------------------------------------------|
| wordpressUrl | URL to your Wordpress instance. |
| jwtToken | Authentication token which we pass to your Wordpress API |
We are making the following call to your Wordpress API:
<div class="my-4 rounded bg-red-100 border-t-4 border-red-500 rounded-b text-red-900 px-4 py-3 shadow-sm" role="alert">
<div class="flex">
<div class="py-1"><svg class="fill-current h-6 w-6 text-red-500 mr-4" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 20 20"><path d="M2.93 17.07A10 10 0 1 1 17.07 2.93 10 10 0 0 1 2.93 17.07zm12.73-1.41A8 8 0 1 0 4.34 4.34a8 8 0 0 0 11.32 11.32zM9 11V9h2v6H9v-4zm0-6h2v2H9V5z"/></svg></div>
<div>
<p class="text-sm mb-0">We are sending both the `Authentication` and `Authorization` header as some of the available plugins make use of the non-standard `Authorization` header.</p>
</div>
</div>
</div>
```
curl \
-H 'Content-Type: application/json' \
-H 'Cache-Control: no-cache' \
-H 'Authentication: Bearer YOUR_TOKEN' \
-H 'Authorization: Bearer YOUR_TOKEN' \
'YOUR_WORDPRESS_URL/wp-json/wp/v2/users/?context=edit'
```
## Using the Advanced Access Manager plugin
You can use the [Advanced Access Manager](https://wordpress.org/plugins/advanced-access-manager/) plugin to easily create an expiring JWT token.
To do this, follow these steps:
**Step 1.** Go to your Wordpress plugin section and search for `Advanced Access Manager`.
**Step 2.** Install and activate the plugin.
**Step 3.** Go to the plugin settings and select a user with Admin privileges. Note that you can create a [custom role and scoped down access](#required-access-to-api-endpoint). We recommend this for the Baseline integration.
**Step 4.** Now create a new JWT token. You need to set an expiration date. Pick one which you are comfortable with.
<img src="/assets/docs/services/wordpress/wordpress-aam-jwt-tokens.jpg" width="814" alt="Wordpress AAM JWT tokens.">
**Step 5.** Paste the JWT token and your Wordpress URL into the baseline authentication screen.
**Step 6.** Profit 🎉.
## Wordpress security
We have seen cases where certain managed Wordpress providers would apply very aggressive caching to the Wordpress instances.
These providers would even ignore `Cache-Control` headers. This could result that responses to requests to admin APIs are cached.
Users without admin access could then query the cached API endpoint without having to use an authentication token:
```
curl \
-H 'Content-Type: application/json' \
-H 'Cache-Control: no-cache' \
-H 'Authorization: Bearer YOUR_TOKEN' \
'YOUR_WORDPRESS_URL/wp-json/wp/v2/users/?context=edit'
```
This request would correctly authenticate and return your results.
```
curl \
-H 'Content-Type: application/json' \
-H 'Cache-Control: no-cache' \
'YOUR_WORDPRESS_URL/wp-json/wp/v2/users/?context=edit'
```
Now after calling this endpoint without the credentials, you still get the authenticated response.
This is very bad!
**We got your back 🙌**
When you provide your Wordpress credentials to Baseline, we check if this behaviour is seen with your instance.
If we detect that the API response gets cached, we will not allow you to store your credentials and ask you to first address this issue.
<div class="my-4 rounded bg-red-100 border-t-4 border-red-500 rounded-b text-red-900 px-4 py-3 shadow-sm" role="alert">
<div class="flex">
<div class="py-1"><svg class="fill-current h-6 w-6 text-red-500 mr-4" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 20 20"><path d="M2.93 17.07A10 10 0 1 1 17.07 2.93 10 10 0 0 1 2.93 17.07zm12.73-1.41A8 8 0 1 0 4.34 4.34a8 8 0 0 0 11.32 11.32zM9 11V9h2v6H9v-4zm0-6h2v2H9V5z"/></svg></div>
<div>
<p class="text-sm mb-0">
When we detect this behaviour note that we will not be able to clear your cache.
Please check your hosting provider or services like Cloudflare for a mechanism to clear your cache.
</p>
</div>
</div>
</div>
## Required access to API endpoint
Baseline relies on the following APIs to audit your Wordpress instance.
Use this information if you want to scope down access to just these endpoints.
| METHOD | API endpoint |
|-------------|------------------------------------|
| GET | /wp-json/wp/v2/users/?context=edit |
| 45.362832 | 295 | 0.698986 | eng_Latn | 0.948804 |
c9a113e7e2a2ae2943a95fc355003653f8ceeb3c | 621 | md | Markdown | src/themes/discord-reborn.md | lylboat/BetterDocs-React | 24650fc2f5fdbebd345367f2fc938701e04d338a | [
"MIT"
] | null | null | null | src/themes/discord-reborn.md | lylboat/BetterDocs-React | 24650fc2f5fdbebd345367f2fc938701e04d338a | [
"MIT"
] | null | null | null | src/themes/discord-reborn.md | lylboat/BetterDocs-React | 24650fc2f5fdbebd345367f2fc938701e04d338a | [
"MIT"
] | null | null | null | ---
title: Discord Reborn
author: Omniscient
description:
A nice sleek transparent theme.
download: https://github.com/MrRobotjs/Discord-Reborn
github: https://github.com/MrRobotjs/
support: https://github.com/MrRobotjs/Discord-Reborn/issues/
discord_server: https://discord.gg/D4cAkXX
demo: https://cdn.jsdelivr.net/gh/0mniscient/Discord-Themes@master/Themes/Discord%20Reborn.theme.css
thumbnail: https://i.imgur.com/gnINgso.jpg
images:
- name: Discord Reborn Preview
image: /images/themes/Discord_Reborn_Preview.jpg
style: dark
status: Outdated
ghcommentid: 4
layout: product
---
A nice sleek transparent theme. | 31.05 | 100 | 0.78905 | yue_Hant | 0.38406 |
c9a1221dfb99b32abd49731eb8e63c95253c6872 | 12,678 | md | Markdown | ru/ydb/pricing/serverless.md | k0t3n/docs | c56671784cfbd1978e1fe11834fef65539014d84 | [
"CC-BY-4.0"
] | null | null | null | ru/ydb/pricing/serverless.md | k0t3n/docs | c56671784cfbd1978e1fe11834fef65539014d84 | [
"CC-BY-4.0"
] | null | null | null | ru/ydb/pricing/serverless.md | k0t3n/docs | c56671784cfbd1978e1fe11834fef65539014d84 | [
"CC-BY-4.0"
] | null | null | null | ---
editable: false
__system: {"dislikeVariants":["Нет ответа на мой вопрос","Рекомендации не помогли","Содержание не соответсвует заголовку","Другое"]}
---
# Правила тарификации для бессерверного режима {{ ydb-name }}
{% include [currency-choice](../_includes/pricing/currency-choice.md) %}
При использовании бессерверного режима {{ ydb-name }} плата взимается за каждый выполненный к базе данных запрос. Указывать, какие ресурсы требуются для работы, нет необходимости, база данных оперативно адаптируется к изменению пользовательской нагрузки в рамках выделенных пользователю [квот](../concepts/limits.md). Помимо запросов пользователь оплачивает хранимые в {{ ydb-name }} данные на почасовой основе. Дополнительно тарифицируются другие операции, такие как восстановление из резервной копии.
## Из чего складывается стоимость использования бессерверного режима {{ ydb-name }} {#rules}
При работе {{ ydb-name }} в бессерверном режиме вы оплачиваете:
* операции с данными;
* объем хранимых данных, включая служебные данные, например, индексы;
* дополнительные пользовательские операции, такие как восстановление данных из резервной копии.
Дополнительно оплачиваются иные потребляемые ресурсы:
* место, занятое в сервисе {{ objstorage-name }} для хранения резервных копий по требованию;
* объем исходящего трафика из {{ yandex-cloud }} в интернет.
{% include [pricing-gb-size](../_includes/pricing/pricing-gb-size.md) %}
### Операции с данными и единица запроса {#rules-ru}
Бессерверный режим работы {{ ydb-full-name }} поддерживает несколько способов работы с данными:
* Document API — HTTP API, совместимое с Amazon DynamoDB. С помощью этого API можно выполнять операции над документными таблицами.
* YDB API и его реализации в виде [YDB CLI](../quickstart/yql-api/ydb-cli.md) и [YDB SDK](../sdk/index.md) для [Java](https://github.com/yandex-cloud/ydb-java-sdk), [Python](https://github.com/yandex-cloud/ydb-python-sdk), [Node.js](https://github.com/yandex-cloud/ydb-nodejs-sdk), [PHP](https://github.com/yandex-cloud/ydb-php-sdk) и [Go](https://github.com/yandex-cloud/ydb-go-sdk). С помощью этого API можно выполнять операции над YDB-таблицами.
Для расчета стоимости запросов в {{ ydb-short-name }} используется понятие **единица запроса** (**RU** — request unit). Каждый выполненный запрос в зависимости от его типа, сложности и размера данных приводит к потреблению определенного количества RU. Итоговая стоимость всех выполненных запросов к {{ ydb-short-name }} складывается из стоимости каждого запроса, выраженной в RU.
#### Document API
Стоимость обработки каждого документа при запросе через Document API равна стоимости единицы запроса в RU, умноженной на размер документа в блоках. Размер в блоках равен размеру в байтах, деленному на размер блока и округленному в большую сторону. Запрос несуществующего документа приравнивается к чтению документа размером в 1 блок. Если запрос обрабатывает несколько документов (например, `BatchGetItem`), итоговая стоимость равна сумме стоимостей по каждому документу.
Тип запроса | Стоимость единицы | Размер блока |
---------------------------------------------------------------------------------- | ----------------- | -------------- |
Чтение (`GetItem`, `BatchGetItem`, `Query`, `Scan`) | 1 RU | 4 КБ |
Чтение в рамках транзакции (`TransactGetItems`) | 2 RU | 4 КБ |
Запись (`PutItem`, `BatchWriteItem`, `UpdateItem`) | 2 RU | 1 КБ |
Запись в рамках транзакции (`TransactWriteItems`) | 4 RU | 1 КБ |
Удаление (`DeleteItem`) | 2 RU | Не применяется |
Работа со схемой базы данных (`CreateTable`, `DeleteTable`, `DescribeTable`, `ListTables`) | 0 RU | Не применяется |
#### YDB API {#cost-ydb-api}
При выполнении запроса через {{ ydb-short-name }} API используются ресурсы на стороне сервера. Информация о потребленных ресурсах доступна в статистике исполнения запроса.
Для определения стоимости запроса через YDB API вычисляются стоимость использования CPU и стоимость ввода-вывода данных. Из вычисленных значений выбирается максимальное.
* Стоимость использования CPU.
Суммируется время CPU, затраченное на компиляцию запроса, а также время использования CPU на всех этапах выполнения запроса. Сумма делится на продолжительность одного окна 1,5 мс, округляется в меньшую сторону и переводится в RU по тарифу из таблицы ниже.
Закешированные запросы повторно не компилируются. Чтобы воспользоваться кешированием, применяйте в запросах `bind variables`, а также включите флаг сохранения плана исполнения запроса в кеше.
* Стоимость ввода-вывода данных.
Рассчитываются следующие значения:
* Количество операций чтения с диска. Сравнивается число прочитанных записей и блоков данных, выбирается наибольшее из них. Число блоков вычисляется делением суммы прочитанных байт на размер блока 4 КБ, с округлением вверх.
* Количество операций записи на диск. Сравнивается число записанных записей и блоков данных, выбирается наибольшее и них. Число блоков вычисляется делением суммы записанных байт на размер блока 1 КБ, с округлением вверх.
Учитывается ввод-вывод данных в таблицы и индексы. При удалении записей учитывается только их количество.
Количества операций чтения и записи переводятся в RU по тарифу из таблицы ниже, полученные стоимости складываются.
{% note warning %}
Некоторые преобразования над записями требуют их чтения или удаления перед изменением, это может повлиять на стоимость запроса.
{% endnote %}
Стоимость единиц выполнения запроса в RU:
Оцениваемый параметр | Стоимость |
:--- | :---: |
Одно окно использования CPU | 1 RU
Одна операция чтения | 1 RU
Одна операция записи | 2 RU
Не тарифицируется следующие операции:
* Создание, изменение и удаление схем таблиц.
* Получение описания и списка таблиц.
* Создание и удаление директорий.
{% cut "Пример расчета стоимости запроса" %}
Статистика запроса:
```text
query_phases {
...
table_access {
...
reads {
rows: 2
bytes: 16
}
...
}
cpu_time_us: 475
...
}
query_phases {
...
table_access {
...
updates {
rows: 2
bytes: 2456
}
...
}
cpu_time_us: 514
...
}
compilation {
...
cpu_time_us: 4062
}
process_cpu_time_us: 870
```
Где:
* `query_phases[].cpu_time_us` — время CPU на выполнение запроса в мкс.
* `compilation.cpu_time_us` — время CPU на компиляцию запроса в мкс.
* `process_cpu_time_us` — время CPU на управление взаимодействием в мкс.
* `query_phases[].reads.rows` — число прочитанных записей данных.
* `query_phases[].reads.bytes` — число прочитанных байт данных.
* `query_phases[].updates.rows` — число записанных записей данных.
* `query_phases[].updates.bytes` — число записанных байт данных.
Чтобы получить стоимость использования CPU, сумма времени CPU запроса делится на 1,5 мс, `( 475 + 514 + 4062 + 870 ) / 1500 = 3,95`. Результат округляется в меньшую сторону и переводится в RU:
```text
3 × 1 RU = 3 RU
```
Чтобы получить стоимости ввода-вывода данных:
* Вычисляется количество операций чтения с диска в записях и блоках, из них выбирается максимальное:
* прочитаны 2 записи, количество операций равно 2;
* прочитаны 16 байт, `16 / ( 4 × 1024 ) = 0,004`, результат округляется в большую сторону, количество операций равно 1.
Количество операций чтения равно 2.
* Вычисляется количество операций записи на диск в записях и блоках, из них выбирается максимальное:
* записаны 2 записи, количество операций равно 2;
* записаны 2456 байта, `2456 / 1024 = 2,398`, результат округляется в большую сторону, количество операций равно 3.
Количество операций записи равно 3.
Стоимость ввода-вывода:
```text
2 × 1 RU + 3 × 2 RU = 8 RU
```
Стоимость выполнения запроса равна 8 RU.
{% endcut %}
##### Особенности расчета стоимости некоторых операций
* **ReadTable**
Операция `ReadTable` позволяет эффективно вычитывать большие диапазоны данных таблицы. Стоимость запроса зависит только от объема прочитанных данных и составляет 128 RU за 1 МБ. При расчете стоимости объем округляется в большую сторону до значения, кратного 1 МБ.
* **BulkUpsert**
`BulkUpsert` позволяет эффективно загружать данные в базу. Стоимость записи строки в рамках операции `BulkUpsert` составляет 0,5 RU за 1 КБ записанных данных. При расчете стоимости объем данных округляется в большую сторону до значения, кратного 1 КБ. Итоговая стоимость операции рассчитывается как сумма стоимости всех записанных строк с округлением до ближайшего большего целого.
**Пример расчета стоимости**
Например, в рамках операции `BulkUpsert` вы записываете четыре строки данных объемом 2500 байт, 100 байт, 1200 байт и 1024 байта.
Стоимость такой операции составит:
> 0,5 RU × 3 + 0,5 RU × 1 + 0,5 RU × 2 + 0,5 RU × 1 = 3,5 RU
>
> Итого, после округления в большую сторону: 4 RU
Где:
* 0,5 — стоимость в единицах запросов за 1 КБ записанных данных.
* 3 — объем первой строки в КБ после округления в большую сторону (2500 байт = 1024 байта + 1024 байта + 452 байта).
* 1 — объем второй строки в КБ после округления в большую сторону.
* 2 — объем третьей строки в КБ после округления в большую сторону (1200 байт = 1024 байта + 176 байт).
* 1 — объем четвертой строки в КБ.
* **Построение вторичного индекса**
Стоимость построения индекса складывается из стоимости операции `ReadTable` оригинальной таблицы и `BulkUpsert` в индексную таблицу. Тарифицируется объем проделанной работы — количество строк и их размер, который был прочитан из оригинальной таблицы и записан в индексную таблицу. Процесс построения индекса может быть отменен пользователем. Отмененные операции построения индекса также тарифицируются за объем проделанной работы до отмены операции.
### Объем хранимых данных {#rules-storage}
В бессерверном режиме мощности для хранения данных выделяются автоматически. Объем хранимых данных при этом рассчитывается как совокупный объем пользовательских и служебных данных, которые хранятся в БД. Например, создание глобального индекса приводит к увеличению размера хранилища на размер такого индекса.
### Создание резервных копий {#rules-backup-storage}
#### Автоматические резервные копии {#rules-auto-backup-storage}
{{ ydb-name }} автоматические создает и бесплатно хранит 2 полные резервные копии ваших баз за два последних дня. Плата за хранение автоматических резервных копий не взимается.
#### Резервные копии по требованию {#rules-auto-backup-storage}
Вы можете принудительно выполнить резервное копирование базы данных с сохранением копии в сервисе {{ objstorage-full-name }}. Стоимость такой операции зависит от объема скопированных данных. При расчете стоимости фактический объем округляется в большую сторону до значений, кратных 1 ГБ.
{% note warning %}
В случае выгрузки данных при помощи утилиты ```ydb tools dump``` тарификация производится по тарифам операции `ReadTable`.
{% endnote %}
### Восстановление из резервной копии {#rules-backup-restore}
Вы можете восстанавливать базы и/или отдельные таблицы из резервных копий, которые хранятся в сервисе {{ objstorage-name }}. Стоимость такой операции зависит от объема восстановленных данных. При расчете стоимости фактический объем округляется в большую сторону до значения, кратного 1 ГБ.
{% note warning %}
В случае восстановления данных при помощи утилиты ```ydb tools restore``` тарификация производится по цене записи строки в базу данных для каждой восстановленной строки.
{% endnote %}
## Скидка за резервируемый объем ресурсов {#cvos}
Вы можете получить гарантированную скидку за потребление ресурсов сервиса, запланированное на месяц, на год или на три года вперед.
Бессерверный режим {{ ydb-name }} предоставляет [CVoS](../../billing/concepts/cvos.md) на определенное количество запросов, выраженных в единицах RU, в секунду. Вы можете выбирать размер резерва с шагом 100 RU/с.
При вычислении реального объема потребления количество запросов усредняется каждые пять минут. То есть, например, при резерве 100 RU/с не обязательно потреблять каждую секунду 100 RU. На протяжении интервала усреднения нагрузка может изменяться и составлять в один момент 150 RU/с, в другую — 50 RU/с.
## Цены {#prices}
{% include notitle [rub-serverless](../../_pricing/ydb/rub-serverless.md) %}
{% include notitle [rub-egress-traffic.md](../../_pricing/rub-egress-traffic.md) %}
| 48.949807 | 502 | 0.734895 | rus_Cyrl | 0.966341 |
c9a173b821d0b7fccc10079944af46dfa683efda | 310 | md | Markdown | README.md | Hubear-MUC/Division | 6eff4bdbbb6d8b1da33a7a960f993858ba572d8c | [
"MIT"
] | null | null | null | README.md | Hubear-MUC/Division | 6eff4bdbbb6d8b1da33a7a960f993858ba572d8c | [
"MIT"
] | null | null | null | README.md | Hubear-MUC/Division | 6eff4bdbbb6d8b1da33a7a960f993858ba572d8c | [
"MIT"
] | null | null | null | # Division
Program to divide a number by another one
See readme.txt for details.
Code extent: max. 82 bytes
-----------
Version history:
----------------
Version 2.0:
Implementation of full user interaction to make the program operatable without the usage of a debugger.
Version 1.0:
Initial version.
| 14.761905 | 103 | 0.7 | eng_Latn | 0.97955 |
c9a19b55a277fdea66b97590bceae84650463d12 | 619 | md | Markdown | README.md | mariospr/greasemonkey-scripts | d12a0f9f283771864e98e9733526e732aab2ab0f | [
"MIT"
] | null | null | null | README.md | mariospr/greasemonkey-scripts | d12a0f9f283771864e98e9733526e732aab2ab0f | [
"MIT"
] | null | null | null | README.md | mariospr/greasemonkey-scripts | d12a0f9f283771864e98e9733526e732aab2ab0f | [
"MIT"
] | null | null | null | # My particular homegrown collection of GreaseMonkey scripts
## 1. phabricator-expand-older-comments.js
A GreaseMonkey script to always expand older comments in Phabricator
This script will wait for a task to load and then will simulate a mouse
click on the "Show Older Comments" link, to never keep them hidden.
### Contributing
Contributions are welcome via any way, although the preferred method is via GitHub,
by forking the repository and using Pull Requests to integrate your changes.
### License
This extension is released under the terms of the MIT/X11 license.
See the `LICENSE` file for more details.
| 30.95 | 83 | 0.791599 | eng_Latn | 0.998741 |
c9a1f6b96904836213cbe1188c40bc83ba436858 | 1,436 | md | Markdown | README.md | omm/harbour-commander | 81a2dc7075c923b4bdd2002790b295ccc8d660de | [
"MIT"
] | 1 | 2022-01-13T22:21:13.000Z | 2022-01-13T22:21:13.000Z | README.md | omm/harbour-commander | 81a2dc7075c923b4bdd2002790b295ccc8d660de | [
"MIT"
] | 3 | 2019-01-21T21:09:10.000Z | 2022-01-18T10:52:06.000Z | README.md | omm/harbour-commander | 81a2dc7075c923b4bdd2002790b295ccc8d660de | [
"MIT"
] | 3 | 2019-04-03T02:57:37.000Z | 2022-01-22T01:02:49.000Z | # Welcome to Harbour Commander
Harbour Commander is a lightweight, cross-platform file manager with a dual-pane interface. It runs on any operating system with Microsoft Windows, Linux, Unix variants, several BSD descendants, Mac OS X, MINIX 3, Windows CE, Pocket PC, Symbian, iOS, Android, QNX, VxWorks, OS/2/eComStation, BeOS/Haiku, AIX, MS-DOS and FreeDOS. Harbour commander works in text mode and provides a simple and intuitive interface for performing most of the necessary actions, przeglądanie plików i katalogów, edycja, kopiowanie i zmienianie nazw plików. The software was written in
[Harbour](https://github.com/harbour/core) language, and is thus very fast.
<p align="center"><a href="https://harbour.github.io/"><img src="docs/img/os.png"/></a></p>
### Harbour Commander live source repository
You will need Git version control software installed on your system and to issue this command (remove the --depth option to clone the complete history — useful for development):
git clone --depth=10 https://github.com/omm/harbour-commander
You can get subsequent updates using this command:
git pull
### Harbour Commander unstable binaries (updated after each commit)
Windows
- Not ready yet
Linux
- Not ready yet
## Windows 10
## Linux
## License
Licensed under the [MIT](.github/LICENSE) License.
## Contributor Covenant Code of Conduct
[Contributor Covenant Code of Conduct](.github/CODE_OF_CONDUCT.md) | 41.028571 | 563 | 0.768106 | eng_Latn | 0.928562 |
c9a24900934a2d0c3c77222858a4efc4f93ae7fd | 760 | md | Markdown | README.md | neurotechuoft/bci_workshop | 6c701b9bc0e81a3920c74edcebfe585142d714e8 | [
"MIT"
] | null | null | null | README.md | neurotechuoft/bci_workshop | 6c701b9bc0e81a3920c74edcebfe585142d714e8 | [
"MIT"
] | 2 | 2016-02-09T04:31:06.000Z | 2016-02-09T04:32:33.000Z | README.md | neurotechuoft/HackNight0 | 6c701b9bc0e81a3920c74edcebfe585142d714e8 | [
"MIT"
] | null | null | null | # README
Hack Night 0: Intro to Machine Learning and BCIs
(Based on workshop by BCIMontreal: https://github.com/bcimontreal/bci_workshop)
This repo's still under construction! See the Issues section to see what we have to complete.
## Differences btn Hack Night 0 and BCIMontreal's BCIWorkshop
* use of python-osc for direct data acquisition from the Muse (rather than using the MuLES software due to issues with Windows 8/10): see http://developer.choosemuse.com/research-tools-example/grabbing-data-from-museio-a-few-simple-examples-of-muse-osc-servers#python
* this should make it easier to make our bot in the future
* use of Python 3.5
## Authors
Sayan Faraz
Raymundo Cassani & Hubert Banville
## License
[MIT](http://opensource.org/licenses/MIT).
| 40 | 267 | 0.780263 | eng_Latn | 0.933682 |
c9a3572a64cd53c4acb1479a29aa79e5a435f3de | 842 | md | Markdown | es-es/sc/fw/dotnet/Neo/Storage/Put3.md | dong0277/docs | 671cecc891a03ac873334c873e6c3f5f65123428 | [
"CC-BY-4.0"
] | 6 | 2021-05-26T17:09:32.000Z | 2021-05-26T17:12:25.000Z | es-es/sc/fw/dotnet/Neo/Storage/Put3.md | dong0277/docs | 671cecc891a03ac873334c873e6c3f5f65123428 | [
"CC-BY-4.0"
] | 2 | 2021-01-29T18:40:48.000Z | 2021-07-19T14:47:38.000Z | es-es/sc/fw/dotnet/Neo/Storage/Put3.md | dong0277/docs | 671cecc891a03ac873334c873e6c3f5f65123428 | [
"CC-BY-4.0"
] | 1 | 2019-04-03T16:42:49.000Z | 2019-04-03T16:42:49.000Z | # Método Storage.Put (StorageContext, string, byte[])
Operación de inserción en la forma clave-valor (string,byte-array) en el almacenamiento persitente.
Namespace: [Neo.SmartContract.Framework.Services.Neo](../../Neo.md)
Assembly: Neo.SmartContract.Framework
## Sintaxis
```c#
public extern void Put (Neo.SmartContract.Framework.Services.Neo.StorageContext context, string key, byte[] value)
```
## Parámetros:
Context: Contexto de almacenamiento, tipo [StorageContext](../StorageContext.md)
Key: clave, string.
Value: valor, byte array.
Valor devuelto: void.
## Ejemplo
```c#
public class Contract1: FunctionCode
{
public static void Main ()
{
String key = "key";
byte[] value = new byte[] {1};
Storage.Put (Storage.CurrentContext, key, value);
}
}
```
[Volver arriba](../Storage.md)
| 20.536585 | 114 | 0.691211 | kor_Hang | 0.259717 |
c9a3d5bf9ffd9e92bb1bc954d2f5572e565a563b | 2,421 | md | Markdown | articles/cognitive-services/Speech-Service/scenario-availability.md | cristhianu/azure-docs.es-es | 910ba6adc1547b9e94d5ed4cbcbe781921d009b7 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | articles/cognitive-services/Speech-Service/scenario-availability.md | cristhianu/azure-docs.es-es | 910ba6adc1547b9e94d5ed4cbcbe781921d009b7 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | articles/cognitive-services/Speech-Service/scenario-availability.md | cristhianu/azure-docs.es-es | 910ba6adc1547b9e94d5ed4cbcbe781921d009b7 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: 'Disponibilidad de escenarios: Speech Service'
titleSuffix: Azure Cognitive Services
description: Referencia de las regiones del servicio Voz.
services: cognitive-services
author: chrisbasoglu
manager: xdh
ms.service: cognitive-services
ms.subservice: speech-service
ms.topic: conceptual
ms.date: 11/05/2019
ms.author: cbasoglu
ms.openlocfilehash: 6ec31df7cef8391728eae7845f64f55bb1c6466a
ms.sourcegitcommit: c22327552d62f88aeaa321189f9b9a631525027c
ms.translationtype: HT
ms.contentlocale: es-ES
ms.lasthandoff: 11/04/2019
ms.locfileid: "73491342"
---
# <a name="scenario-availability"></a>Disponibilidad de escenarios
El SDK del servicio Voz presenta muchos escenarios en una amplia variedad de lenguajes y entornos de programación. No todos los escenarios están actualmente disponibles en todos los lenguajes de programación o todos los entornos. A continuación se indica la disponibilidad de cada escenario.
- **Reconocimiento de voz (SR), lista de frases, intención, traducción y contenedores locales**
- Todos los lenguajes de programación y entornos donde haya un vínculo de flecha <img src="media/index/link.jpg" height="15" width="15"></img> en [esta](https://aka.ms/csspeech) tabla de inicio rápido.
- **Texto a voz (TTS)**
- C++/Windows y Linux
- C#/Windows, UWP y Unity
- Java (JRE y Android)
- Python
- Swift
- Objective-C
- La API REST de TTS puede usarse en todas las demás situaciones.
- **Detección de palabras clave (KWS)**
- C++/Windows y Linux
- C#/Windows & Linux
- Python/Windows y Linux
- Java/Windows, Linux y Android (SDK de dispositivos de voz)
- La funcionalidad de detección de palabras clave (KWS) podría funcionar con cualquier tipo de micrófono; no obstante, la compatibilidad oficial de KWS está limitada actualmente a las matrices de micrófonos que se encuentran en el hardware de Azure Kinect DK o el SDK de dispositivos de voz.
- **Asistentes de voz**
- C++/Windows, Linux y macOS
- C#/Windows
- Java/Windows, Linux, macOS y Android (SDK de dispositivos de voz)
- **Transcripción de conversaciones**
- C++/Windows y Linux
- C# (Framework y .NET Core)/Windows, UWP y Linux
- Java/Windows, Linux y Android (SDK de dispositivos de voz)
- **Transcripción para centros de llamadas**
- La API REST se puede usar en cualquier situación.
- **Entrada de audio comprimido con códec**
- C++/Linux
- C#/Linux
- Java/Linux, Android e iOS
| 44.833333 | 293 | 0.755473 | spa_Latn | 0.940193 |
c9a44f8fb5e81674cd25ceb8514001307110676f | 702 | md | Markdown | docs/overview/elafros-api-service.md | ImJasonH/elafros | ea02baacea2f30c859364462cc761458bf2deae7 | [
"Apache-2.0"
] | 1 | 2018-08-06T14:43:51.000Z | 2018-08-06T14:43:51.000Z | docs/overview/elafros-api-service.md | ImJasonH/elafros | ea02baacea2f30c859364462cc761458bf2deae7 | [
"Apache-2.0"
] | null | null | null | docs/overview/elafros-api-service.md | ImJasonH/elafros | ea02baacea2f30c859364462cc761458bf2deae7 | [
"Apache-2.0"
] | null | null | null | # API Objects - Service
* Orchestrates Routes and Configurations to support higher-level tooling.
* Configuration of code + inbound routing in a single API call.
* Definition of specific common rollout policies
* Automatic (latest) rollout
* Manual rollout
* Extensible for other rollout strategies which might be requested
* Provides a top-level resource for graphical UI to key off of.
* Recommended starting point for Knative Serving use, as it provides "guide rails" to avoid unusual and non-idiomatic usage.
* Mirrors labels and annotations to the created objects.
* Advanced scenarios may require disconnecting the Service ownership of the created Route and Configuration.
| 54 | 124 | 0.779202 | eng_Latn | 0.997042 |
c9a45644593d1f05a4c392038e6b08eaad3ea8f3 | 4,877 | md | Markdown | samples/05.b.idiosyncratic-manual-styling/README.md | roxanamihai/BotFramework-WebChat | bc50acee2ec321aa6dbd0b7268776831c51ce7ee | [
"MIT"
] | null | null | null | samples/05.b.idiosyncratic-manual-styling/README.md | roxanamihai/BotFramework-WebChat | bc50acee2ec321aa6dbd0b7268776831c51ce7ee | [
"MIT"
] | 1 | 2019-06-10T13:48:55.000Z | 2019-06-10T19:54:17.000Z | samples/05.b.idiosyncratic-manual-styling/README.md | roxanamihai/BotFramework-WebChat | bc50acee2ec321aa6dbd0b7268776831c51ce7ee | [
"MIT"
] | null | null | null | # Sample - Idiosyncratic manual styling
## Description
This sample introduces the ability to overwrite `createStyleSet`, which is the unsupported way of changing the appearance of Web Chat.
# Test out the hosted sample
- [Try out MockBot](https://microsoft.github.io/BotFramework-WebChat/05.b.idiosyncratic-manual-styling)
# How to run
- Fork this repository
- Navigate to `/Your-Local-WebChat/samples/05.b.idiosyncratic-manual-styling` in command line
- Run `npx serve`
- Browse to [http://localhost:5000/](http://localhost:5000/)
# Things to try out
- Type `hello`: you should see the speech bubbles from the bot and user are pale blue and pale green respectively, and the font has been changed to Comic Sans. This is different from the default grey and blue bubbles and font in Web Chat.
# Code
> Jump to [completed code](#completed-code) to see the end-result `index.html`.
## Overriding `createStyleSet`
> Please note that this method of styling Web Chat is **not recommended** and **not supported**. If you need to make styling changes, we **strongly recommend** using the strategy available in [05.a-branding-webchat-styling](https://github.com/Microsoft/BotFramework-WebChat/tree/master/samples/05.a.branding-webchat-styling). Please take a look at that sample before you decide to use manual styling.
If there are aspects of Web Chat that you want to change in appearance, and do not wish to file a PR with us, you are welcome to use idiosyncratic styling. Please note that this strategy is not protected by the Web Chat repo's team from the possibility of breaking changes in the future. This means that if you use the `/latest/` release of Web Chat, your styling may suddenly break when we create a new release.
To see what style sets are overwrite-able, please look at the [`createStyleSet` Java Script file](https://github.com/Microsoft/BotFramework-WebChat/blob/master/packages/component/src/Styles/createStyleSet.js).
## Getting started
### Goals of this bot
This sample starts with the [full-bundle CDN sample](./../01.a.getting-started-full-bundle/README.md) as the base template.
First, we want to overwrite the current `styleSet` by using the `createStyleSet` method. Once you have your `styleSet` object, you can add changes to any object in `createStyleSet`.
```diff
…
const { token } = await res.json();
+ const styleSet = window.WebChat.createStyleSet({
+ bubbleBackground: 'rgba(0, 0, 255, .1)',
+ bubbleFromUserBackground: 'rgba(0, 255, 0, .1)'
+ });
+ styleSet.textContent = Object.assign(
+ {},
+ styleSet.textContent,
+ {
+ fontFamily: '\'Comic Sans MS\', \'Arial\', sans-serif',
+ fontWeight: 'bold'
+ }
+ );
…
```
Finally, make sure the `styleSet` object is passed into Web Chat, like so:
```diff
…
window.WebChat.renderWebChat({
- directLine: window.WebChat.createDirectLine({ token })
+ directLine: window.WebChat.createDirectLine({ token }),
+ styleSet
}, document.getElementById('webchat'));
…
```
That's it!
## Completed code
Here is the finished `index.html`:
```diff
<!DOCTYPE html>
<html lang="en-US">
<head>
<title>Web Chat: Custom style set</title>
<script src="https://cdn.botframework.com/botframework-webchat/latest/webchat.js"></script>
<style>
html, body { height: 100% }
body { margin: 0 }
#webchat {
height: 100%;
width: 100%;
}
</style>
</head>
<body>
<div id="webchat" role="main"></div>
<script>
(async function () {
const res = await fetch('https://webchat-mockbot.azurewebsites.net/directline/token', { method: 'POST' });
const { token } = await res.json();
+ const styleSet = window.WebChat.createStyleSet({
+ bubbleBackground: 'rgba(0, 0, 255, .1)',
+ bubbleFromUserBackground: 'rgba(0, 255, 0, .1)'
+ });
+ styleSet.textContent = Object.assign(
+ {},
+ styleSet.textContent,
+ {
+ fontFamily: '\'Comic Sans MS\', \'Arial\', sans-serif',
+ fontWeight: 'bold'
+ }
+ );
window.WebChat.renderWebChat({
- directLine: window.WebChat.createDirectLine({ token })
+ directLine: window.WebChat.createDirectLine({ token }),
+ styleSet
}, document.getElementById('webchat'));
document.querySelector('#webchat > *').focus();
})().catch(err => console.error(err));
</script>
</body>
</html>
```
# Further reading
- [Branding styling bot](https://microsoft.github.io/BotFramework-WebChat/05.a.branding-webchat-styling) | [(Branding styling source code)](https://github.com/Microsoft/BotFramework-WebChat/tree/master/samples/05.a.branding-webchat-styling)
## Full list of Web Chat hosted samples
View the list of [available Web Chat samples](https://github.com/Microsoft/BotFramework-WebChat/tree/master/samples)
| 35.860294 | 412 | 0.688128 | eng_Latn | 0.868072 |
c9a4804f1500c5224b88dc2320260156b1df3e3f | 722 | md | Markdown | questions/Database/0175. Combine Two Tables/README_ZH.md | TechStudyGroup/leetcode | e013436e52d16090a6138689804f714329388330 | [
"MIT"
] | 9 | 2019-08-15T05:09:40.000Z | 2021-05-01T09:26:59.000Z | questions/Database/0175. Combine Two Tables/README_ZH.md | TechStudyGroup/leetcode | e013436e52d16090a6138689804f714329388330 | [
"MIT"
] | 135 | 2019-09-26T03:40:11.000Z | 2022-02-02T04:15:39.000Z | questions/Database/0175. Combine Two Tables/README_ZH.md | TechStudyGroup/leetcode | e013436e52d16090a6138689804f714329388330 | [
"MIT"
] | 1 | 2022-01-05T01:43:17.000Z | 2022-01-05T01:43:17.000Z | ### [组合两个表](https://leetcode-cn.com/problems/combine-two-tables)
<p>表1: <code>Person</code></p>
<pre>+-------------+---------+
| 列名 | 类型 |
+-------------+---------+
| PersonId | int |
| FirstName | varchar |
| LastName | varchar |
+-------------+---------+
PersonId 是上表主键
</pre>
<p>表2: <code>Address</code></p>
<pre>+-------------+---------+
| 列名 | 类型 |
+-------------+---------+
| AddressId | int |
| PersonId | int |
| City | varchar |
| State | varchar |
+-------------+---------+
AddressId 是上表主键
</pre>
<p> </p>
<p>编写一个 SQL 查询，满足条件：无论 person 是否有地址信息，都需要基于上述两表提供 person 的以下信息：</p>
<p> </p>
<pre>FirstName, LastName, City, State
</pre>
| 20.055556 | 72 | 0.441828 | yue_Hant | 0.300521 |
c9a482e5b39f71e021eb29640e965a2cb62ca213 | 1,542 | md | Markdown | docs/2014/relational-databases/performance-monitor/sql-server-memory-node.md | moonloverx2/sql-docs.zh-cn | cf2b82125dc2651da559e4f5e5805f1766f0e71a | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/2014/relational-databases/performance-monitor/sql-server-memory-node.md | moonloverx2/sql-docs.zh-cn | cf2b82125dc2651da559e4f5e5805f1766f0e71a | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/2014/relational-databases/performance-monitor/sql-server-memory-node.md | moonloverx2/sql-docs.zh-cn | cf2b82125dc2651da559e4f5e5805f1766f0e71a | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: SQL Server，内存节点 | Microsoft Docs
ms.custom: ''
ms.date: 06/13/2017
ms.prod: sql-server-2014
ms.reviewer: ''
ms.technology: ''
ms.topic: conceptual
ms.assetid: 55b28ba9-b6d5-4ea9-8103-db8a72f42982
author: MikeRayMSFT
ms.author: mikeray
manager: craigg
ms.openlocfilehash: b2bffcd00bad148022e66e95dca9f03f70faee43
ms.sourcegitcommit: 3da2edf82763852cff6772a1a282ace3034b4936
ms.translationtype: MT
ms.contentlocale: zh-CN
ms.lasthandoff: 10/02/2018
ms.locfileid: "48175179"
---
# <a name="sql-server-memory-node"></a>SQL Server、内存节点
Microsoft **中的** “内存节点” [!INCLUDE[ssNoVersion](../../includes/ssnoversion-md.md)] 对象在 NUMA 节点上提供监视服务器内存使用情况的计数器。
## <a name="memory-node-counters"></a>内存节点计数
下表描述 [!INCLUDE[ssNoVersion](../../includes/ssnoversion-md.md)] **内存节点** 计数器。
|SQL Server Memory Manager 计数器|Description|
|----------------------------------------|-----------------|
|**Database Node Memory (KB)**|指定服务器当前在此节点上用于数据库页面的内存量。|
|**Free Node Memory (KB)**|指定服务器在此节点上未使用的内存量。|
|**Foreign Node Memory (KB)**|指定此节点上非 NUMA 本地内存的量。|
|**Stolen Memory Node (KB)**|指定服务器在此节点上出于数据库页面以外的目的使用的内存量。|
|**Target Node Memory**|指定此节点的理想内存量。|
|**Total Node Memory**|指示服务器在此节点上已提交的总内存量。|
## <a name="see-also"></a>请参阅
[监视资源使用情况（系统监视器）](monitor-resource-usage-system-monitor.md)
[SQL Server Buffer Manager 对象](sql-server-buffer-manager-object.md)
[sys.dm_os_performance_counters (Transact-SQL)](/sql/relational-databases/system-dynamic-management-views/sys-dm-os-performance-counters-transact-sql)
| 37.609756 | 153 | 0.707523 | yue_Hant | 0.262576 |
c9a4c949093fb1b26732594a6fc9c3ad115249ae | 1,138 | md | Markdown | README.md | mikelhsia/strapi_example | c1766504873d96418da202e39dac55918a00995b | [
"MIT"
] | null | null | null | README.md | mikelhsia/strapi_example | c1766504873d96418da202e39dac55918a00995b | [
"MIT"
] | null | null | null | README.md | mikelhsia/strapi_example | c1766504873d96418da202e39dac55918a00995b | [
"MIT"
] | null | null | null | # Strapi application
A quick description of your strapi application
# Q&A
### Q: I can't `yarn develop` or `yarn install` to start the project
A: For some reasons, some of the yarn version will create issue when install & run, saying the node-modules/sharp image not found. To resolve this, you need to run `yarn install; npm rebuild` to resolve this issue
### Q: What I need to do to overwrite the admin panel
A: Admin panel is built in react. Need to run `yarn develop --watch-admin` to monitor the changes
### Q: The admin panel was updated on the run time because of the command yarn develop --watch-admin?
If you start your application using `yarn start` or `yarn develop` the admin will be the old version. Your updates are not applied.
To do so, you have to build the admin panel using the following command `yarn build`.
### Q: How to use pm2 to manage your process
`pm2 start server.js` to manage your strapi project through **server.js**
or
use `pm2 start npm --name app -- run start` to to start the project with production environment
or
use `pm2 start ecosystem.config.js` to start application with config file | 39.241379 | 214 | 0.749561 | eng_Latn | 0.999421 |
c9a4e963ab7e7335b62dc5ebfaef5b3b8b506453 | 818 | md | Markdown | README.md | DivineMayura/note-taker | 8144d9ec91799561d431a567fb17a6d7e10f5364 | [
"MIT"
] | null | null | null | README.md | DivineMayura/note-taker | 8144d9ec91799561d431a567fb17a6d7e10f5364 | [
"MIT"
] | null | null | null | README.md | DivineMayura/note-taker | 8144d9ec91799561d431a567fb17a6d7e10f5364 | [
"MIT"
] | null | null | null | # note-taker
Note taker can write and save notes using an Express.js back end to save and retrieve note data from a JSON file.
## Built With
* [HTML](https://developer.mozilla.org/en-US/docs/Web/HTML)
* [CSS](https://developer.mozilla.org/en-US/docs/Web/CSS)
* [Javascript](https://developer.mozilla.org/en-US/docs/Web/JavaScript)
* [NodeJS](https://nodejs.org/en/)
* * [express](https://www.npmjs.com/package/express)
* * [uuid](https://www.npmjs.com/package/uuidv4)
* [Deployed on Heroku](https://dashboard.heroku.com/)
## Author
GitHub username: DivineMayura
May Faucher
- [GitHub Link](https://github.com/DivineMayura)
- [Portfolio](https://divinemayura.github.io/portfolio-2/)
- [LinkedIn](https://www.linkedin.com/in/mayfaucher/)
## License
This project is licensed under the MIT License | 28.206897 | 113 | 0.715159 | kor_Hang | 0.293657 |
c9a536384b23b1fcc4a15897b186b8959ad8271f | 501 | md | Markdown | README.md | dcecile/reactic-tac-toe | ee3a3dafffecc1fbe6651dd42a5fb2e21ab50341 | [
"MIT"
] | null | null | null | README.md | dcecile/reactic-tac-toe | ee3a3dafffecc1fbe6651dd42a5fb2e21ab50341 | [
"MIT"
] | null | null | null | README.md | dcecile/reactic-tac-toe | ee3a3dafffecc1fbe6651dd42a5fb2e21ab50341 | [
"MIT"
] | null | null | null | # Reactic-Tac-Toe
## Developing
1. Install [Yarn](https://yarnpkg.com/en/docs/install)
2. Run `yarn start` to open the development server
3. Change a source file, and the development server will trigger a recompile automatically
For more information, see the [Create React App guide](https://github.com/facebookincubator/create-react-app/blob/master/packages/react-scripts/template/README.md).
## License
This project is released under the MIT License (see
[LICENSE.md](LICENSE.md) for details).
| 33.4 | 164 | 0.774451 | eng_Latn | 0.810828 |
c9a546b6f6452300881640830a2af26c399e041d | 6,749 | md | Markdown | _posts/2018-12-09-Download-kubota-diesel-engine-problems.md | Bunki-booki/29 | 7d0fb40669bcc2bafd132f0991662dfa9e70545d | [
"MIT"
] | null | null | null | _posts/2018-12-09-Download-kubota-diesel-engine-problems.md | Bunki-booki/29 | 7d0fb40669bcc2bafd132f0991662dfa9e70545d | [
"MIT"
] | null | null | null | _posts/2018-12-09-Download-kubota-diesel-engine-problems.md | Bunki-booki/29 | 7d0fb40669bcc2bafd132f0991662dfa9e70545d | [
"MIT"
] | null | null | null | ---
layout: post
comments: true
categories: Other
---
## Download Kubota diesel engine problems book
Make it sad and delicate and use kubota diesel engine problems witch Rose of our village, and the Patterner, not kubota diesel engine problems command, "that we will find everything normal; then we take "And I in my tower," said the Namer. "Kalens may have to hide himself away in a shell," she said. 112. No birdcall. " geographical problem. " all remote descendants of the Old Speech. RAMBRENT! bathroom or kubota diesel engine problems mirror, in regions wall opposite the house, she sea during the coldest season of the year was often free of ice. Then he decided it was not necessary, but afterwards I had an opportunity of convincing had no choice but to get kubota diesel engine problems and move toward the door. Some days after there was another fight with She had chosen to thwart her mother by shrewdly playing along with this to look. [Then they returned and sat down. spades. She couldn't have come with "I notice her condition when she walked to the boat" Moises shrugged, though we said as little about it as we could, with a door at the farther end, with our sensitivities at full might have been composing an official report and closing out the file without the building, his refusal of her. "With The warm afternoon is gradually cooling as the clouds pour out of the west, always the instinct to be the one-man show, sanctions could lead to the foment of rebellion. He could bomb any security routine ever dreamed up. seemed to crack the rhythm of her breathing, but the sight of them it as if it were a jack, and Otter knew he was wrong, summer fruits, every stone steeped computer, then he would quickly lose interest in Junior and move on to a new enthusiasm, dropped a large Manila envelope in the mailbox (the story he'd been working on, 996; file:D|Documents20and20Settingsharry! He turned her over to the housekeeper and forgot about her. " rolling his hips in that funny way he did. Barbaras or Brendas. "Just a suggestion? I wanted to go inside and ask surface of the ice is thus destroyed and broken up. " No? Maybe the cold weather'll put an end to it. Story of King Sindbad and his Falcon v made more varieties of pecan cookies than you could shake a stick at. "I'll set em out for you," she said. Yet she listened, Kubota diesel engine problems be forced to order you to abort, to know they exist simultaneously with my reality. "I wish your dad could have known you," Agnes said. " Wherefore we knew that our device sufficed not. Glacier-clefts. She'll love these cookies. This happened so suddenly that I froze. That would be kubota diesel engine problems. He walked back to the Prosser kubota diesel engine problems, perhaps, the Old Powers were inherently sacral and pre-ethical. Lipscomb delivered the baby like two minutes ago. " you?" He slides out from under Old Yeller and across the console, was unrolled to reveal ordinary newsprint, "Why, the landing of the females they bring forth their young, news was brought that Khorassan had been conquered; (23) whereupon Er Reshid rejoiced and bade decorate Baghdad and release all who were in the prisons. The _Lena_ lay in 3-12 metres water, BECAUSE USE I LOVE YOU MORE THAN ANYTHING, no doubt, or is used the restroom only a short while ago. Anthony Jenkinson's first voyage (_Hakluyt_, starting from To the lid of one jar. Maan ben Zaideh and the Bedouin cclxxi you get the last one, and a pile of cartons. "I won't let you forget. Sometimes her entire body swayed as she moved disconcert her. As for the purse that is with thee, but "Yekargauls" in index by aliens, I look gross, glossy, Intathin 4. I decided to dress in one of my new things, Which be the delightsome of things, Bernard?" soled shoes, that Thorion!" She strode to meet the Patterner as he came into the starlight by the house. He pauses. de Kubota diesel engine problems. Cape Deschnev and reached the Anadyr? " ached like a wound. " girl. Another kubota diesel engine problems. But the "Two leagues short of over there is a garden of violent colors and rich perfume, from night-kissed ridges into Celestina hated the baby with such ferocity that a bitter taste rose into Junior vigorously scrubbed his corpse-licked cheek with one hand. 57). household articles purchased from the Chukches, and The Andy Griffith Show! Machines had more-desirable qualities in that they applied themselves diligently to their tasks without making demands, Bartholomew Prosser didn't delay long enough to make it necessary for Junior to ring the bell twice. That's the best way I know of pleasing our leaders. " were to kubota diesel engine problems the night, on which some carvings had been made This particular pooch. " El Fezl bade release him; so they set him free and he gave him a dress and a dinar. " At first Noah didn't get it. This new strangeness, causing Song to delay her examination of the white Less cautious than the typical accountant, and a large number of our countrymen living in London, Rose nodded once. Leilani much preferred Sinsemilla's screwed-up fairy tales to Preston's natives (Koryaeks), for it was with me that thou depositedst it, bringing it as the most generous "From childhood. 45; ii. The offer of a free lunch-or an entire week of lunches-didn't charm a smile from him. Chew it up, now a fully retired cop but not yet ready to return to a life of the cloth, The Merchant of Cairo and the Favourite of the. " blindingвsmoke that irritated his eyes and pricked tears from them! Kubota diesel engine problems Chironians could turn their backs on each other in the way that people like Howard Kalens would never know, another member of the scenarios included this situation. By leaving the bottle, and could not mark in their six percent: excellent in light of the fact that the runaway inflation of the "Not in the heart," the apparition repeated, that a vessel with the weak steam-power of the _Vega_ In a stolen black Dodge Charger 440 Magnum. kubota diesel engine problems. piece of land, "is this rarer or more marvellous than the story of the four sharpers with the money-changer and the ass, but closed it with such care that Leilani could barely detect the difficult task of redeeming her own screwed-up life, isn't it?" air even at the floor, "we were joined at the back, milk curds, by Allah!' answered Bihkerd. You flatter yourself shamelessly if you think it was all that special even before the polio. Well, Joey was [Illustration: JAPANESE BRIDGE. watching Junior so intently from across the room. More than once, but the job was done: They had reached the "I guess he is, she made plans to conceal her kubota diesel engine problems as long as possible, eh. | 749.888889 | 6,646 | 0.78945 | eng_Latn | 0.999883 |
c9a54f7af1ceebfd0a89d6ac267e03cc007c602e | 918 | md | Markdown | _workbook/l314.md | Christ-Mind-Teachings/oe | 4badeac0bf1c5ad7006ea387ca53d728b4c26105 | [
"MIT"
] | 1 | 2020-08-11T06:56:45.000Z | 2020-08-11T06:56:45.000Z | _workbook/l314.md | Christ-Mind-Teachings/oe | 4badeac0bf1c5ad7006ea387ca53d728b4c26105 | [
"MIT"
] | 6 | 2020-11-13T00:30:29.000Z | 2022-03-10T00:53:32.000Z | _workbook/l314.md | Christ-Mind-Teachings/oe | 4badeac0bf1c5ad7006ea387ca53d728b4c26105 | [
"MIT"
] | 1 | 2020-08-11T23:30:19.000Z | 2020-08-11T23:30:19.000Z | ---
title: I seek a future different from the past.
ref: "314"
---
I seek a future different from the past.
{: .lesson-header}
<sup>1</sup> From new perception of the world there comes a future very
different from the past. The future now is recognized as but extension
of the present. Past mistakes can cast no shadows on it, so that fear
has lost its idols and its images, and being formless, it has no
effects. Death will not claim the future now, for life is now its goal,
and all the needed means are happily provided. Who can grieve or suffer
when the present has been freed, extending its security and peace into a
quiet future filled with hope?
<sup>2</sup> *Father, we were mistaken in the past and choose to use the
present to be free. Now do we leave the future in Your hands, leaving
behind our past mistakes and sure that You will keep Your present
promises and guide the future in their holy light.*
| 39.913043 | 72 | 0.765795 | eng_Latn | 0.999969 |
c9a5f74bbb5fe8be6b6895cc4a6824806472313e | 2,053 | md | Markdown | README.md | PeterJWei/CitywideFootprinting | 98064e6119ceab26079c0b11629f3d428f4e745f | [
"MIT"
] | 1 | 2019-01-25T16:01:57.000Z | 2019-01-25T16:01:57.000Z | README.md | PeterJWei/CitywideFootprinting | 98064e6119ceab26079c0b11629f3d428f4e745f | [
"MIT"
] | 1 | 2018-10-31T18:33:07.000Z | 2018-10-31T18:38:57.000Z | README.md | PeterJWei/CitywideFootprinting | 98064e6119ceab26079c0b11629f3d428f4e745f | [
"MIT"
] | 1 | 2018-12-24T23:35:15.000Z | 2018-12-24T23:35:15.000Z | # City-Wide Energy Footprinting
This is the project repository for the city-wide energy footprinting project from the Intelligent and Connected Systems Laboratory at Columbia University. For any questions, contact Peter Wei at [email protected] or Professor Xiaofan Jiang at [email protected].
We will soon setup a website for this project. Stay tuned!
Until then, if you want to learn how to run it, you can read the documentation (Documentation_Updated.pdf)
## Project Publications
If you want to learn more about this project, you can read our publications in:
[BuildSys 2018 (To Appear)]()
## To Run
Navigate to the EnergyFootprinting/ directory and run the following commands:
~~~~
./python_app restart
sudo nohup ./python_app restart > /dev/null
~~~~
Once the server has started, go to localhost:8000/static/index.html to see the webpage. Click display camera to see the feed.
## License
MIT License
Copyright (c) 2018, Peter Wei, Columbia Intelligent and Connected Systems Lab (ICSL), Columbia University
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the “Software”), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
| 45.622222 | 265 | 0.794447 | eng_Latn | 0.891222 |
c9a7730014ac8c4960cd85711e9e942f9c1f03ed | 79,973 | md | Markdown | GUIDE.md | tsiangsun/examples | 223f51932cada0f61ae243e94dfe3581b16cd96f | [
"CC0-1.0"
] | null | null | null | GUIDE.md | tsiangsun/examples | 223f51932cada0f61ae243e94dfe3581b16cd96f | [
"CC0-1.0"
] | null | null | null | GUIDE.md | tsiangsun/examples | 223f51932cada0f61ae243e94dfe3581b16cd96f | [
"CC0-1.0"
] | 1 | 2021-01-30T08:33:19.000Z | 2021-01-30T08:33:19.000Z | # Brief Guide
Here are some notes to assist in running the programs.
Some details of tests carried out on the programs are also given.
Do not expect to duplicate these results,
they are simply a guide as to the kind of behaviour to expect.
If you find a definite programming error,
please report it via the [Issues](https://github.com/Allen-Tildesley/examples/issues) tab above
(you will need to be signed into GitHub to do this).
## Data Input
Most of the Fortran codes use a `namelist` to input a few parameters from standard input.
This gives an easy way to specify default values in the program itself, and to use a
keyword-based syntax to specify values different from the default ones at run-time.
The input file, or string, should usually begin with `&nml` and end with `/`.
As a minimum, the program will expect to read `&nml /` (an empty list),
and on a Linux/Unix/bash system a typical command line would be
```
echo '&nml /' | ./mc_nvt_lj
```
or similar.
To change the parameters, the namelist input might include the new values like this
```
&nml nblock=20, nstep=10000, temperature=2.0 /
```
Alternatively the namelist may be supplied in a file,
for instance `run.inp` containing
```
&nml
nblock=20,
nstep=10000,
temperature=2.0
/
```
and the program run like this
```
./mc_nvt_lj < run.inp
```
As indicated, the `key=value` pairs may be set out on different lines if you wish.
## Initial Configuration
Simulation runs for bulk liquids require a starting configuration which can usually be prepared using
the `initialize` program (built, by the default SConstruct file, in `build_initialize/`).
The default parameters produce an FCC configuration of 256 atoms at reduced density ρ=0.75,
writing out just the positions (for an MC program) to a file `cnf.inp`.
You would run the program as described above,
for instance on a Linux/Unix/bash system like this
```
echo '&nml /' | ./initialize
```
If the parameter `velocities=.true.` is supplied within the namelist,
then positions and velocities are written to the file,
corresponding to a reduced temperature _T_ = 1.0.
These values of ρ and _T_ (see below) lie in the liquid region of the Lennard-Jones phase diagram.
Non-default values may, of course, be supplied for this or other models.
The `cnf.inp` file may then be copied to the directory in which the run is carried out.
Typically, runs produce a final configuration `cnf.out`
(which may be renamed to `cnf.inp` as a starting point for further runs)
and intermediate configurations `cnf.001`, `cnf.002` etc during the run.
Some of the programs simulate a single chain of atoms, without periodic boundary conditions.
Initial configurations for these may also be prepared using the `initialize` program
selecting `molecules="chain"`, an appropriate number of atoms, for example `n=13`,
and `velocities=.true.` if required. There is an option `constraints=.true.` if the velocities
should be chosen with constraints applied relative to the bonds between neighbouring atoms in the chain.
A utility program, `adjust`, takes in an MC or MD configuration and
scales the velocities to change the kinetic energy per atom by a specified amount,
and/or the positions (and the box length) to change the density by a specified amount.
You may prefer to write your own program or script to perform these types of operation.
## Visualizing configurations
Our simulation configuration files have a very simple format:
the first line is the number of molecules,
the second line is the periodic box length (we always use cubic boxes),
or occasionally the bond length (for chain molecules which are simulated without a box),
and the third and subsequent lines each contain the coordinates of one atom or molecule.
The first three numbers on each of these lines are always the (x,y,z) position,
in simulation units (e.g. Lennard-Jones σ=1).
The rest of the numbers on each line contain velocities, orientation vectors etc.,
as appropriate.
This format is not compatible with most molecular visualization programs,
such as [JMOL](http://jmol.sourceforge.net/)
or [VMD](http://www.ks.uiuc.edu/Research/vmd/).
However, conversion into the basic [XYZ](https://en.wikipedia.org/wiki/XYZ_file_format) format
is easily achieved using a simple program, script, or editor. For example,
on most Linux/Unix systems, the `awk` language will be available:
```
awk '(NR==1) {print} (NR==2) {print "Comment line"} (NR>2) {printf "%5s%15.6f%15.6f%15.6f\n", ("Ar"),($1*3.4),($2*3.4),($3*3.4)}' cnf.inp > cnf.xyz
```
This produces a file which should be recognized as a set of Argon atoms with positions
(in Angstroms) appropriate to their van der Waals diameter.
This can be read into a molecular visualizer,
which will typically have various options for representing the atoms.
No attempt is made here to represent the periodicity of the system in the `cnf.xyz` file.
## Lennard-Jones simulation programs
A large number of the examples simulate the Lennard-Jones liquid.
Before discussing these in detail,
we consider the different variants of the model that appear in the programs,
and the state points used for testing.
### State points for different Lennard-Jones models
For most of the examples, we use a cutoff of _R_<sub>c</sub>=2.5σ.
For MC programs the cut (but not shifted) potential (c) is used in the simulation,
while for MD programs the cut-and-shifted potential (cs) is used.
In all cases, an attempt is made to produce results without, and with, long-range corrections,
the latter giving an estimate for the full potential (f).
Differences between the different models are discussed in various places,
see e.g.
* A Trokhymchuk, J Alejandre, _J Chem Phys,_ __111,__ 8510 (1999).
Using their table V as a guide, we take the critical point to be roughly located at:
LJ model | _T_<sub>crit</sub> | ρ<sub>crit</sub> | _P_<sub>crit</sub>
----- | ---- | ---- | ----
f: full, with LRC | 1.31 | 0.31 | 0.13
c: cut (but not shifted) | 1.19 | 0.32 | 0.11
cs: cut-and-shifted | 1.08 | 0.32 | 0.09
At any temperature below _T_<sub>crit</sub>, the liquid state is bounded below by the
liquid-gas coexistence density, and using Tables II-IV of the same reference as a guide,
we take the values for three example temperatures as
LJ model | _T_ | ρ<sub>L</sub> | _P_
----- | ---- | ---- | ----
f: full, with LRC | 0.8 | 0.793 | 0.005
c: cut (but not shifted) | 0.8 | 0.765 | 0.008
cs: cut-and-shifted | 0.8 | 0.730 | 0.013
LJ model | _T_ | ρ<sub>L</sub> | _P_
----- | ---- | ---- | ----
f: full, with LRC | 0.9 | 0.746 | 0.012
c: cut (but not shifted) | 0.9 | 0.714 | 0.020
cs: cut-and-shifted | 0.9 | 0.665 | 0.030
LJ model | _T_ | ρ<sub>L</sub> | _P_
----- | ---- | ---- | ----
f: full, with LRC | 1.0 | 0.695 | 0.026
c: cut (but not shifted) | 1.0 | 0.652 | 0.036
cs: cut-and-shifted | 1.0 | 0.578 | 0.062
For Lennard-Jones, the state point (ρ,_T_)=(0.75,1.0)
lies in the liquid region of the phase diagram for all these variants of the model.
Approximate equations of state for the full LJ potential have been presented by
* JK Johnson, JA Zollweg, KE Gubbins, _Mol Phys_, __78,__ 591 (1993)
* J Kolafa and I Nezbeda, _Fluid Phase Equil,_ __100,__ 1 (1994)
* M Mecke, A Muller, J Winkelmann, J Vrabec, J Fischer, R Span, W Wagner,
_Int J Thermophys,_ __17,__ 391 (1996) and __19,__ 1493(E) (1998)
For testing our programs we used the more recent fitted equations of state presented by
* M Thol, G Rutkai, R Span, J Vrabec and R Lustig, _Int J Thermophys,_ __36,__ 25 (2015)
* M Thol, G Rutkai, A Koester, R Lustig, R Span, J Vrabec, _J Phys Chem Ref Data,_ __45,__ 023101 (2016)
for both the cut-and-shifted potential (denoted cs below), at _R_<sub>c</sub>=2.5σ,
and the full potential (denoted f).
The formulae are implemented in the supplied program `eos_lj`.
For completeness, note that Thol et al also supply C++ programs, and tables of data,
in the Supplementary Information associated with their papers.
They are not responsible for our (Fortran) program!
### Lennard-Jones MD, BD and SMC programs
First we look at the MD (and related) programs, which use the cut-and-shifted potential.
The first test of the MD codes is that energy, or the appropriate energy-like variable, is conserved.
The following table uses runs of 10 blocks,
each consisting of a number of steps to give 16 units of time per block
with the indicated timestep (e.g. 1000×0.016, 2000×0.008 etc).
We report the MSD values of the conserved variable for each program.
δt | `md_nve_lj` | `md_nvt_lj` | `md_npt_lj`
-------- | -------- | -------- | --------
0.016 | 4.3284×10<sup>-6</sup> | 4.0409×10<sup>-6</sup> | 4.5875×10<sup>-6</sup>
0.008 | 1.8430×10<sup>-7</sup> | 2.0036×10<sup>-7</sup> | 2.4402×10<sup>-7</sup>
0.004 | 1.3121×10<sup>-8</sup> | 1.4494×10<sup>-8</sup> | 1.4956×10<sup>-8</sup>
0.002 | 1.2621×10<sup>-9</sup> | 1.3526×10<sup>-9</sup> | 1.5914×10<sup>-9</sup>
0.001 | 1.8530×10<sup>-10</sup> | 2.1371×10<sup>-10</sup> | 2.1005×10<sup>-10</sup>
Log-log plots show the expected dependence MSD ∝ δt<sup>4</sup>,
hence RMSD ∝ δt<sup>2</sup>,
except for some small deviations at the smallest timestep.
Now we compare EOS data
with typical test runs from our programs using default parameters, _N_=256, except where stated.
Note that _E_ is the total internal energy per atom,
that _C_ is short for _C<sub>v</sub>_ (per atom) and _P_ is the pressure,
all including the ideal gas contributions.
The Smart Monte Carlo code `smc_nvt_lj` is included here since it uses the
cut-and-shifted potential which corresponds to the force calculation
(although it is not essential to do so).
Similarly, we include here the Brownian dynamics program `bd_nvt_lj`.
Numbers in parentheses (here and in the following tables)
indicate errors in the last quoted digit, estimated from block averages.
Results without error estimates are fixed (such as the temperature or density) or conserved.
Source | ρ | _T_ | _E_ (cs) | _P_ (cs) | _C_ (cs) | _E_ (f) | _P_ (f) | _C_ (f)
------ | ----- | ----- | -------- | -------- | --------- | ------- | ------- | --------
Thol et al (2015) (cs) | 0.75 | 1.00 | -2.9286 | 0.9897 | 2.2787 | | |
Thol et al (2016) (f) | 0.75 | 1.00 | | | | -3.7212 | 0.3996 | 2.2630
`md_nvt_lj` | 0.75 | 1.00 | -2.940(4) | 0.965(6) | 2.27(12) | -3.740(4) | 0.363(6) | 2.27(12)
`md_npt_lj`§ | 0.7514(6) | 1.00 | -2.947(6) | 0.995(1) | | -3.748(7) | 0.391(1) |
`md_nve_lj` | 0.75 | 1.0022(3) | -2.9289 | 0.987(2) | 2.24(1) | -3.7284 | 0.386(2) |
`md_nve_lj_omp` | 0.75 | 1.0027(2) | -2.9278 | 0.986(2) | 2.28(1) | -3.7273 | 0.385(2) |
`md_nve_lj_vl` | 0.75 | 1.0023(3) | -2.9278 | 0.992(2) | 2.24(1) | -3.7274 | 0.391(2) |
`md_nve_lj_ll`‡ | 0.75 | 1.0010(1) | -2.9272 | 0.992(1) | 2.28(1) | -3.7268 | 0.391(1) |
`md_nvt_lj_ll`‡ | 0.75 | 1.00 | -2.927(2) | 0.994(3) | 2.3(1) | -3.727(2) | 0.392(3) | 2.3(1)
`smc_nvt_lj`♯(a) | 0.75 | 1.00 | -2.9300(5) | 0.971(2) | 2.263(5) | -3.7296(5) | 0.369(2) | 2.270(5)
`smc_nvt_lj`♯(b) | 0.75 | 1.00 | -2.928(2) | 0.99(1) | 2.26(2) | -3.728(2) | 0.39(1) | 2.27(2)
`smc_nvt_lj`♯(c) | 0.75 | 1.00 | -2.930(3) | 0.98(2) | 2.26(3) | -3.729(3) | 0.38(2) | 2.27(3)
`bd_nvt_lj` | 0.75 | 1.00 | -2.934(4) | 0.974(7) | 2.26(8) | -3.733(4) | 0.373(7) | 2.27(8)
‡ Indicates a larger system size, _N_=864, needed to make the link-list method viable. Note that
the speedup is not enormous for this system size, corresponding to 4×4×4 cells.
§ The constant-pressure simulation was run at _P_=0.99, the program default.
♯ The `smc_nvt_lj` program was tested (a) in default, single-particle-move, mode, with δt=0.1;
(b) in multi-particle mode, moving 100% of particles, with δt=0.02;
and (c) in multi-particle mode, moving 30% of particles, with δt=0.03.
These values give acceptance rates in the 45% – 55% range.
Results for `md_lj_mts` are not directly comparable,
because a larger cutoff (by default _R<sub>c</sub>_=4.0σ) is used to illustrate the method.
The program was tested with _N_=400 (box length 8.1).
The usual state point is simulated: ρ=0.75 throughout.
No fitted EOS for the cs potential for this cutoff is available; obviously the estimates for the full potential
should be comparable with the values given above from Thol et al (2016).
Smallest timestep δt (called `dt1` in the program)
and multiple-timestep-multipliers (the `n_mts` array) are given in column 2.
In all cases the run length was equal to 10 blocks of 20000 steps of length 0.005.
So, for example, 0.005 (142) means 10 blocks of 2500 steps of length 0.04,
each subdivided into 2 steps of length 0.02,
each subdivided again into 4 steps of length 0.005.
We also tried 0.002 (142) meaning 10 blocks of 6250 steps of length 0.016,
each subdivided into 2 steps of length 0.008,
each subdivided again into 4 steps of length 0.002.
The first line in the table below is from a run of `md_nve_lj` with the same system, for reference.
This example is just to illustrate the idea:
most of the test runs are actually slower, not faster, than `md_nve_lj`.
Source | δt | _T_ | _E_ (cs) | _P_ (cs) | _C_ (cs) | _E_ (f) | _P_ (f) | _E_ (MSD)
------- | -------- | ------- | --------- | -------- | --------- | ------- | ------- | ------
`md_nve_lj` | 0.005 | 1.0038(1) | -3.5199 | 0.557(2) | 2.26(1) | -3.7157 | 0.410(2) | 1.7×10<sup>-8</sup>
`md_lj_mts`† | 0.005 (111) | 1.002(3) | -3.5199 | 0.58(1) | 2.4(1) | -3.7157 | 0.43(2) | 1.6×10<sup>-8</sup>
`md_lj_mts`‡ | 0.002 (142) | 1.0040(2) | -3.5196(2) | 0.559(1) | 2.26(1) | -3.7153(2) | 0.412(1) | 1.1×10<sup>-7</sup>
`md_lj_mts`§ | 0.005 (142) | 1.017(2) | -3.491(4) | 0.610(7) | 2.26(1) | -3.686(4) | 0.463(7) | 6.8×10<sup>-6</sup>
`md_lj_mts`¶ | 0.005 (142) | 1.0094(8) | -3.508(2) | 0.576(3) | 2.26(1) | -3.703(2) | 0.429(3) | 7.8×10<sup>-7</sup>
† All the timesteps the same length, as a check of the program book-keeping.
‡ Program default parameters; note the smaller timestep.
§ Program defaults, except for the timestep.
¶ Identical to § except that the switching length lambda is increased from 0.1 to 0.15.
### Lennard-Jones MC programs
Our MC programs use the cut (but not shifted) potential
(which means that there is a delta correction, in the program, for the pressure).
In this case, the value of _C<sub>v</sub>_ (reported as _C_ below)
should be equal to the value for the full potential,
since the energy LRC is independent of temperature.
The Thol et al (2016) EOS for the full potential
is used to predict results for the cut (but not shifted) potential (denoted c),
at _R_<sub>c</sub>=2.5σ, using the same LRC and delta corrections as in the MC codes.
Once again, all values in the table include the ideal gas contribution.
Except where indicated, tests are performed for _N_=256.
Source | ρ | _T_ | _E_ (c) | _P_ (c) | _E_ (f) | _P_ (f) | _C_ (f)
------ | ----- | ----- | ------- | ------- | ------- | ------- | --------
Thol et al (2016) (f) | 0.75 | 1.00 | -3.3197 | 0.7008 | -3.7212 | 0.3996 | 2.2630
`mc_nvt_lj` | 0.75 | 1.00 | -3.332(1) | 0.651(3) | -3.734(1) | 0.350(3) | 2.28(1)
`mc_nvt_lj_re`♯ | 0.75 | 1.00 | -3.332(1) | 0.648(2) | -3.734(1) | 0.347(2) | 2.258(4)
`mc_nvt_lj_ll`‡ | 0.75 | 1.00 | -3.3230(3) | 0.669(1) | -3.7246(3) | 0.367(1) | 2.27(1)
`mc_npt_lj`§ | 0.7501(2) | 1.00 | -3.331(1) | 0.666(2) | -3.733(1) | 0.364(2) |
`mc_npt_lj_ll`ठ| 0.7506(4) | 1.00 | -3.332(3) | 0.660(3) | -3.734(3) | 0.358(3) |
`mc_zvt_lj`¶ | 0.7504(4) | 1.00 | -3.333(3) | 0.668(4) | -3.735(3) | 0.366(4) |
`mc_zvt_lj_ll`ঠ| 0.7501(3) | 1.00 | -3.328(2) | 0.669(2) | -3.729(2) | 0.368(2) |
‡ Indicates a larger system size, _N_=864 (or approximately so for `mc_zvt_lj_ll`).
Note that the linked lists do not give an enormous speedup for this system size,
which corresponds to 4×4×4 cells.
§ The constant pressure simulations were run at _P_=0.69, the program default.
The measured _C<sub>p</sub>_ (full) values were 5.28(7) for `mc_npt_lj` and 5.04(16) for `mc_npt_lj_ll`,
compared with Thol et al (2016) EOS giving 5.22.
The `mc_npt_lj_ll` program was run with non-default value `db_max`=0.015 to give a volume acceptance ratio around 9%.
¶ The grand canonical programs were run at activity _z_=0.0795, the program default value.
The Thol et al (2016) LRC-corrected value to give ρ=0.75 would be _z_=0.080627.
For `mc_zvt_lj` the box length was _L_=7σ; for `mc_zvt_lj_ll` _L_=10.5σ.
Acceptance rate of creation/destruction moves is quite small, at about 0.3%.
For other state points see below.
♯ The `mc_nvt_lj_re` program was run for four temperatures, see below for details.
Several of these programs could be improved to use array reallocation (available in Fortran)
to make them more resilient against changes in box size or number of particles.
For simplicity we have not included these features.
The measured pressures _P_ (c) are systematically a little low;
this is particularly noticeable for the constant-pressure programs,
where they might be expected to agree with the user-defined value of _P_.
This reflects the approximate nature of
the delta correction applied to the virial pressure,
to account for the discontinuous potential at _R<sub>c</sub>_.
At the density ρ=0.75, with _R<sub>c</sub>_=2.5,
the pressure correction is Δ _P_≈-0.3,
which is substantial.
However, this estimate is based on the assumption
that the pair distribution function _g(R<sub>c</sub>)_=1.
In fact, the choice _R<sub>c</sub>_=2.5 is a poor one in this regard,
lying near a local minimum where _g(R<sub>c</sub>)_≈ 0.91
(an illustration of _g(r)_ appears below in the __Pair distribution function__ section).
Consequently the applied correction is slightly too large,
and the resulting estimated pressure is systematically too low by ≈ 0.03.
This serves as a reminder to always make clear what the cutoff is,
and what corrections (for discontinuities or long-range interactions)
have been applied.
In principle, there should be a delta correction for the configurational temperature.
Long-range corrections to _T_<sub>c</sub> are discussed by
A Baranyai _J Chem Phys,_ __112,__ 3964 (2000) and by
A Lervik, O Wilhelmsen, TT Trinh, HR Nagel, _J Chem Phys,_ __143,__ 114106 (2015).
Tests for the grand canonical MC program were initially conducted at a slightly lower density,
very close to the liquid-vapour coexistence line (see Gibbs simulations below).
A box length of 7σ was used, and creation/destruction acceptance ratios were around 1.5%.
Comparison was made with the Thol et al (2016) equation of state, with corrections for the cutoff.
The corresponding density is lower than the liquid coexistence density for the full potential,
so there is no guarantee that the EOS will be accurate
(it is only fitted in the single-phase regions of the full potential).
Source | z | ρ | _T_ | _E_ (c) | _P_ (c) | _E_ (f) | _P_ (f)
------- | ---- | ----- | ---- | --------- | ------- | ------- | -------
Thol et al (2016) (c) | 0.032 | 0.65325 | 1.0 | -2.7212 | 0.0457 | -3.0710 | -0.1828
`mc_zvt_lj` | 0.032 | 0.6532(5) | 1.0 | -2.728(3) | 0.0325(25) | -3.078(4) | -0.196(2)
### Gibbs Monte Carlo program
The program `mc_gibbs_lj` carries out Gibbs ensemble Monte Carlo,
and to test it we selected a temperature _T_=1.0,
which is below the critical point for the cut (but not shifted) LJ potential
(see tables above).
It was found convenient to start from a lower temperature,
with configurations at gas and liquid densities, with roughly equal numbers of particles,
and slowly work upwards in temperature, to equilibrate.
Note that the program expects two starting configurations: `cnf1.inp` and `cnf2.inp`.
The total number of atoms was fixed at _N_<sub>L</sub>+_N_<sub>G</sub>=512
and total volume _V_<sub>L</sub>+_V_<sub>G</sub>≈5514.
Exchanges of box identity are expected as the critical temperature is approached,
and so one should not place blind trust in the separate box averages reported by the program,
but refer to histograms of density, energy etc.,
illustrative examples of which appear here.
At _T_=1.0, however, these exchanges of box identity
are expected to be infrequent, were not observed in the test runs,
and the averages corresponded well to literature values for the coexistence parameters.
The production run corresponded to default parameters in the program.
Source | ρ<sub>L</sub> | ρ<sub>G</sub> | _P_<sub>L</sub> | _P_<sub>G</sub> | _E_<sub>L</sub> (c) | _E_<sub>G</sub> (c)
------- | -------- | -------- | ------- | -------- | -------------- | --------------
Trokhymchuk et al MC | 0.6542 | 0.0439 | 0.0336 | 0.0336 | |
Trokhymchuk et al MD | 0.6507 | 0.0500 | 0.0380 | 0.0380 | -2.713 ‡ | 1.047 ‡
`mc_gibbs_lj` | 0.653(1) | 0.050(1) | 0.031(2) | 0.038(1) | -2.731(5) | 1.049(9)
‡ Indicates values for given ρ and _T_ from the Thol et al (2016) EOS (f) with cutoff correction.
The small discrepancy between measured pressures in the two phases reflects the approximate nature
of the delta correction for potential discontinuity, particularly in the liquid phase (see above).
For a density ρ≈ 0.65 and _R<sub>c</sub>_=2.5
the pressure correction is Δ _P_≈-0.23.
However, this assumes _g(R<sub>c</sub>)_=1,
whereas actually _g(R<sub>c</sub>)_≈ 0.95 at this density.
Hence the correction is too large by approximately 0.01.
### Replica exchange program
The `mc_nvt_lj_re` program uses MPI to handle communications between processes.
Here are some notes on the way the code is written.
We have only attempted to handle the most obvious errors at the start of the program,
such as missing configuration files and incorrect user data,
by closing down all the processes.
A production code would take more care to handle exceptions during the run.
Unhandled exceptions could possibly lead to processes hanging or becoming deadlocked,
so you should be aware of the dangers in running this example.
In the program, all processes write to their standard output `output_unit`, but the default in MPI is
for all this output to be collated (in an undefined order) and written to a single channel. Testing
was carried out using Open MPI, which allows the program to be run with a command line which includes
an option for each process to write to separate files, similar to the following:
```
mpirun -np 4 -output-filename out ./mc_nvt_lj_re < mc.inp
```
whereby the standard output files are named `out##`, the `##` part being determined by the process rank.
If your implementation does not have this option, you should edit the code to explicitly open a file for
standard output, with a process-rank-dependent name, and associate the `output_unit` with it.
The `mc_nvt_lj_re` program conducts runs at several temperatures: four were used in testing.
The default program values include _T_=1.0, which is reported above, and here is the complete set,
with expected values from the Thol et al (2016) equation of state (f) corrected for cutoff.
As usual the program employed the cut (but not shifted) potential.
All runs are for density ρ=0.75, _N_=256, as usual.
At the lowest temperature, the full-potential system would lie in the coexistence region,
and the estimated pressure is negative.
Source | _T_ | _E_ (c) | _P_ (c) | _E_ (f) | _P_ (f) | _C<sub>v</sub>_ (f)
------ | ----- | ------- | ------- | ------- | ------- | --------
Thol et al (2016) (f) | 0.8772 | -3.6001 | 0.1942 | -4.0017 | -0.1070 | 2.3081
`mc_nvt_lj_re` | 0.8772 | -3.613(1) | 0.140(2) | -4.014(1) | -0.161(2) | 2.31(1)
Thol et al (2016) (f) | 1.0000 | -3.3197 | 0.7008 | -3.7212 | 0.3996 | 2.2630
`mc_nvt_lj_re` | 1.0000 | -3.332(1) | 0.648(2) | -3.734(1) | 0.347(2) | 2.258(4)
Thol et al (2016) (f) | 1.1400 | -3.0055 | 1.2571 | -3.4070 | 0.9559 | 2.2278
`mc_nvt_lj_re` | 1.1400 | -3.016(1) | 1.212(2) | -3.417(1) | 0.911(2) | 2.233(4)
Thol et al (2016) (f) | 1.2996 | -2.6523 | 1.8667 | -3.0539 | 1.5655 | 2.1989
`mc_nvt_lj_re` | 1.2996 | -2.662(1) | 1.820(3) | -3.063(1) | 1.519(3) | 2.214(5)
The above (default) temperatures are chosen to give swap acceptance ratios all fairly close to 20% here
(of course, the set of temperatures, and all other run parameters, may be chosen by the user in a
namelist contained in the input file).
It should be noted that process `m` reports the swap acceptance ratio for exchanges with process `m+1`,
and the output file for the process with highest rank will report a zero swap ratio.
## Lees-Edwards programs
The programs `md_nvt_lj_le` and `md_nvt_lj_llle` are intended to illustrate:
the moving boundaries used in nonequilibrium shear flow simulations;
an algorithm for integrating the SLLOD equations of motion with constrained kinetic energy;
and an adapted link-cell method required to handle the modified boundaries.
These programs both use the short-ranged WCA Lennard-Jones potential,
in order to compare results with the following papers:
* G Pan, JF Ely, C McCabe, DJ Isbister, _J Chem Phys,_ __122,__ 094114 (2005)
* KP Travis, DJ Searles, DJ Evans, _Mol Phys,_ __95,__ 195 (1998)
Testing was performed at the state point used in those papers: ρ=0.8442, _T_=0.722.
A system size _N_=256 was used
(for such a short-range potential, this system size was also suitable for the
link-cell program).
The given program defaults, including a time step of 0.005, were used throughout,
except for the strain rate which was varied.
Strain rate | _E_ | _P_ | η | _E_ | _P_ | η
----- | ----- | ----- | ----- | ----- | ----- | -----
0.04 | 1.8042(1) | 6.390(1) | 2.38(4) | 1.8039(3) | 6.389(2) | 2.31(4)
0.16 | 1.8095(2) | 6.426(1) | 2.228(8) | 1.8098(2) | 6.427(1) | 2.23(1)
0.64 | 1.8648(2) | 6.777(2) | 1.938(2) | 1.8646(2) | 6.776(1) | 1.935(2)
In the table above, for each strain rate,
the results in columns 2-4 come from `md_nvt_lj_le`
and those in columns 5-7 from `md_nvt_lj_llle`
(essentially identical, but roughly twice as fast for _N_=256).
In all cases the kinetic energy was conserved very accurately by the algorithm.
The results, particularly the increase in _E_ and _P_,
and the decrease in shear viscosity η,
as the strain rate increases,
are in good agreement with the above papers.
Incidentally, at the highest strain rate 0.64,
the configurational temperature is systematically about 1% lower
than the (constrained) kinetic temperature.
## Hard-particle programs
The programs `mc_nvt_hs` and `md_nve_hs` illustrate, respectively,
the simplest MC and MD methods for the basic hard-sphere model.
The temperature is not important in the first case: a factor _kT_ is used to normalize the energies.
The energy, in the second case, is identical with the (exactly conserved) kinetic energy,
and hence closely related to the temperature.
Equations of state for this model have been reported many times.
Here we refer to some fairly recent, useful, sources of data and/or fitted equations
* H Hansen-Goos, _J Chem Phys,_ __144,__ 164506 (2016)
* MN Bannerman, L Lue, LV Woodcock, _J Chem Phys,_ __132,__ 084507 (2010)
* J Kolafa, S Labik, A Malijevsky, _Phys Chem Chem Phys,_ __6,__ 2335 (2004)
The paper of Kolafa et al (2004) is particularly careful to discuss corrections
due to different ensembles and system size. Here we just present the raw results
for a small system, _N_=256; programs are run with default parameters.
Starting fcc lattice configurations may be prepared using `initialize` in
the usual way.
The EOS is taken from the Hansen-Goos (2016) paper, and a program to evaluate it
may be found in `eos_hs.f90`.
ρ | _P_ (EOS) | _P_ `mc_nvt_hs`| _P_ `md_nve_hs` | ρ `mc_npt_hs`
----- | ----- | ----- | ----- | -----
0.50 | 1.6347 | 1.634(2) | 1.632(1) | 0.502(2)
0.55 | 2.0574 | 2.051(3) | 2.055(1) | 0.553(3)
0.60 | 2.5769 | 2.573(4) | 2.573(1) | 0.600(3)
0.65 | 3.2171 | 3.210(8) | 3.215(2) | 0.651(3)
0.70 | 4.0087 | 3.996(8) | 4.005(3) | 0.700(2)
0.75 | 4.9910 | 4.960(7) | 4.985(4) | 0.749(2)
We must remember that _P_ is calculated by a box-scaling method in the _NVT_ simulation,
which may introduce a small systematic error. This can be reduced by reducing the
scaling factor, at the expense of worsening the statistics.
We also provide a program `mc_npt_hs` to illustrate the constant-_NPT_ method.
For the averages of ρ reported above, the input pressure was that given by
the corresponding EOS entry.
With default parameters, volume move acceptance ratio was nearly 5% at the highest pressure,
and around 11% at the lowest pressure studied here.
We also provide two programs to simulate the hard spherocylinder model,
of cylinder length _L_ and diameter _D_:
`mc_npt_sc` and `mc_nvt_sc`.
In preparing configurations for these programs,
one must not allow overlap between the hard particles.
A simple approach is to
run `initialize` with `molecules="linear", lattice=.false.`,
and to request a very low density.
For the default `length=5` spherocylinders
(_L_=5, _D_=1) a value of `density=0.05` is suitable.
Then,
the constant-pressure program may be used to compress the system to higher density.
This is a fairly slow process,
requiring the density ρ and nematic order parameter _S_ to be carefully monitored.
Once suitable high-density state points have been prepared,
a configuration at a precisely specified density, for use in the constant-volume program,
may be obtained by a small expansion (using the `adjust` program).
For testing we use `N=256`;
such a small system is not recommended for serious work,
but allows us to explore up to ρ=0.148
(box length 12 _D_, twice the interaction range of 6 _D_)
which is sufficient for our purposes.
Equations of state from MC simulations are presented in two papers
* SC McGrother, DC Williamson, G Jackson, _J Chem Phys,_ __104,__ 6755 (1996)
* PG Bolhuis, D Frenkel, _J Chem Phys,_ __106,__ 666 (1997)
In making comparisons, care must be taken with the units.
McGrother et al (1996) quote
densities in the form of the packing fraction η=ρ _v_<sub>mol</sub>
and pressures as _P_ _v_<sub>mol</sub>,
where _v_<sub>mol</sub> is the molecular volume.
We translate selected values from their Table V
(denoted (M) below)
into our reduced units based on _D_=1 below;
for _L/D_=5, _v_<sub>mol</sub>=4.4506.
(Bolhuis and Frenkel (1997) define reduced densities relative to
the density of closest packing of spherocylinders,
while reporting pressures the same way as McGrother et al.
We do not use the Bolhuis-Frenkel results below.)
_P_ _v_<sub>mol</sub> | ρ _v_<sub>mol</sub> | _P_ | ρ | _S_ | ρ | _S_ | _P_ | _S_
----- | ----- | ----- | ----- | ----- | ----- | ----- | ----- | -----
(M) | (M) | (M) | (M) | (M) | `mc_npt_sc` | `mc_npt_sc` | `mc_nvt_sc` | `mc_nvt_sc`
2.53 | 0.310 | 0.568 | 0.070 | 0.041 | 0.0698(2) | 0.081(7) | 0.579(2) | 0.073(6)
3.63 | 0.352 | 0.816 | 0.079 | 0.053 | 0.0799(2) | 0.098(6) | 0.810(3) | 0.098(6)
4.89 | 0.397 | 1.099 | 0.089 | 0.136 | 0.0895(2) | 0.25(1) | 1.126(5) | 0.23(1)
5.05 | 0.400 | 1.135 | 0.090 | 0.170 | 0.0903(2) | 0.32(3) | 1.136(3) | 0.149(7)‡
5.05 | 0.400 | 1.135 | 0.090 | 0.170 | 0.0923(3) | 0.502(7) | 1.061(3) | 0.592(8)‡
5.40 | 0.419 | 1.213 | 0.094 | 0.574 | 0.0966(3) | 0.764(6) | 1.193(6) | 0.596(3)
5.80 | 0.436 | 1.303 | 0.098 | 0.714 | 0.0984(2) | 0.783(8) | 1.325(6) | 0.751(6)
6.20 | 0.448 | 1.393 | 0.101 | 0.754 | 0.1021(3) | 0.839(3) | 1.406(6) | 0.795(4)
The `mc_npt_sc` runs use pressures from column 3 above;
the `mc_nvt_sc` runs are at densities taken from column 4.
At the highest pressure, using default parameters,
move acceptance ratio was around 30%,
and volume acceptance ratio around 10%.
These values rose to 50% and 15% respectively at the lowest pressure.
Several successive runs (10 blocks of 10000 steps each)
were undertaken for state points
near the isotropic-nematic transition,
where very slow evolution of the nematic order parameter could be observed.
Considerable sluggishness is expected around this transition,
giving irreproducible results, an example indicated by ‡ in the table.
Much longer runs are needed to achieve consistency!
Also the system size is about 25% that used by McGrother,
which has a direct effect on the measured nematic order parameter.
With these caveats in mind,
which apply mainly to the middle three state points in the table,
agreement between the two programs, and with the results of McGrother,
is reasonable.
## Chain simulation programs
The program `mc_chain_nvt_cbmc_lj` simulates a single Lennard-Jones chain,
where the atoms are linked by harmonic springs.
There are, therefore,
both bonded and non-bonded interactions,
the former being used to select atom positions,
and the latter appearing in Rosenbluth weights,
which govern the acceptance/rejection of moves.
For comparison with the paper of Calvo, Doye and Wales, _J Chem Phys,_ __116,__ 2642 (2002),
test runs were carried out using _N_=13 atoms, a bond length of 1.122462σ
(prepared using `initialize` with `molecules="chain"` to give random non-overlapping atom positions)
and a rather low spring potential _k_<sub>spring</sub>=20.
We only use CBMC moves in this code: for a practical application it would be advisable
to include other kinds of move, for example crankshaft, pivot, and bridging moves.
Replica exchange (as used by Calvo et al) would also improve the sampling at low temperature.
Below we report the excess, potential, energy per atom _PE_,
and the excess heat capacity per atom _C<sub>v</sub>_(ex),
as well as the radius of gyration _R_<sub>g</sub>.
The program default run length is 10 blocks of 100000 steps.
For lower temperatures (below 0.40), longer runs (10 blocks of 1000000
steps) were used.
For temperatures higher than 1.0,
the bond length fluctuations become unphysically large for this value of _k_<sub>spring</sub>.
_T_ | _PE_ | _R_<sub>g</sub> | _C<sub>v</sub>_(ex)
----- | ------ | ------ | ------
0.26 | -2.044(7) | 1.074(1) | 3.3(2)
0.28 | -1.967(5) | 1.086(1) | 4.16(9)
0.29 | -1.905(4) | 1.096(1) | 4.6(1)
0.30 | -1.893(7) | 1.098(1) | 4.71(9)
0.31 | -1.819(3) | 1.1105(8) | 4.34(6)
0.32 | -1.789(2) | 1.1162(5) | 4.2(1)
0.33 | -1.742(3) | 1.1254(5) | 4.05(1)
0.34 | -1.705(4) | 1.133(1) | 3.7(1)
0.35 | -1.672(3) | 1.140(1) | 3.49(8)
0.40 | -1.50(1) | 1.173(3) | 2.51(17)
0.45 | -1.40(1) | 1.201(3) | 2.26(8)
0.50 | -1.297(8) | 1.224(1) | 1.99(2)
1.00 | -0.438(2) | 1.538(2) | 1.371(3)
At the lowest temperatures, the acceptance rate of CBMC moves (with the default parameters) was around 2%,
while at _T_=0.35 it was around 11%, increasing further at higher temperatures.
The results are broadly in agreement with Calvo et al (2002) showing a similar sized peak in _C<sub>v</sub>_,
although at a somewhat lower temperature (0.30 as opposed to 0.35).
Here we give analogous results for the program default spring constant of _k_<sub>spring</sub>=400.
_T_ | _PE_ | _R_<sub>g</sub> | _C<sub>v</sub>_(ex)
----- | ------- | -------- | --------
0.26 | -2.076(3) | 1.069(1) | 2.13(5)
0.28 | -2.027(5) | 1.075(1) | 2.91(15)
0.29 | -1.993(4) | 1.081(1) | 3.41(8)
0.30 | -1.958(4) | 1.087(1) | 3.79(8)
0.31 | -1.915(4) | 1.094(1) | 4.40(6)
0.32 | -1.859(6) | 1.105(1) | 4.74(8)
0.33 | -1.816(4) | 1.114(1) | 4.94(6)
0.34 | -1.765(5) | 1.125(1) | 4.90(9)
0.35 | -1.719(4) | 1.135(1) | 4.75(7)
0.40 | -1.505(5) | 1.183(1) | 3.06(14)
0.45 | -1.379(3) | 1.212(1) | 2.32(6)
0.50 | -1.266(3) | 1.240(1) | 2.03(3)
1.00 | -0.459(1) | 1.512(1) | 1.233(6)
2.00 | 0.387(2) | 1.850(1) | 0.591(3)
5.00 | 1.986(3) | 2.035(2) | 0.465(2)
Similar models were employed in `md_chain_nve_lj` and `md_chain_mts_lj`:
_N_=13 atoms and equilibrium bond length of 1.122462σ.
Here we report results for constrained bond lengths, using the first program,
and for _k_<sub>spring</sub>=400 and 10000 (the program default value), using the second program.
The default run lengths are fairly modest here: 10 blocks,
each consisting of 100000 steps of length δt=0.002.
The primary indicator of a correctly-functioning program is energy conservation,
and this was checked in all cases.
Energies were chosen to give average temperatures close to the values used in
the MC simulations above.
Results for constrained system (columns 2:4 RATTLE, columns 5:7 MILC-SHAKE):
_E_ | _T_ | _R_<sub>g</sub> | _C<sub>v</sub>_ | _T_ | _R_<sub>g</sub> | _C<sub>v</sub>_
----- | ----- | ----- | ----- | ----- | ----- | -----
-2.0246 | 0.2485(2) | 1.06374(4) | 2.176(6) | 0.2475(1) | 1.06450(3) | 2.172(7)
-1.9145 | 0.296(2) | 1.073(1) | 2.38(8) | 0.2989(3) | 1.0724(1) | 2.27(2)
-1.6145 | 0.345(4) | 1.125(2) | 3.14(8) | 0.347(2) | 1.125(1) | 3.16(6)
-1.3495 | 0.404(1) | 1.182(2) | 2.39(1) | 0.404(2) | 1.183(2) | 2.50(2)
-1.2195 | 0.451(1) | 1.207(1) | 2.36(2) | 0.449(2) | 1.210(1) | 2.34(2)
-1.0968 | 0.499(2) | 1.234(1) | 2.28(1) | 0.503(2) | 1.231(2) | 2.28(2)
-0.1244 | 1.009(5) | 1.471(5) | 2.04(2) | 1.024(6) | 1.455(7) | 2.01(2)
1.0456 | 2.008(5) | 1.754(9) | 1.653(3) | 2.009(7) | 1.753(8) | 1.652(3)
3.6459 | 4.996(4) | 1.889(7) | 1.534(1) | 4.988(3) | 1.901(6) | 1.534(1)
Results for _k_<sub>spring</sub>=10000 system using MTS:
_E_ | _T_ | _R_<sub>g</sub> | _C<sub>v</sub>_
----- | ----- | ----- | -----
-1.7734 | 0.2496(2) | 1.0695(1) | 2.96(4)
-1.3444 | 0.301(2) | 1.144(2) | 5.5(3)
-1.1394 | 0.350(2) | 1.173(2) | 3.70(5)
-0.9494 | 0.399(1) | 1.199(1) | 3.19(5)
-0.7694 | 0.448(1) | 1.230(2) | 3.09(3)
-0.5943 | 0.497(2) | 1.262(3) | 3.04(5)
0.7857 | 1.000(4) | 1.467(12) | 2.50(3)
2.8858 | 1.98(2) | 1.752(14) | 2.08(6)
8.3859 | 5.04(4) | 1.904(2) | 1.94(2)
Results for _k_<sub>spring</sub>=400 system using MTS:
_E_ | _T_ | _R_<sub>g</sub> | _C<sub>v</sub>_
----- | ----- | ----- | -----
-1.7934 | 0.2487(2) | 1.0646(1) | 2.89(5)
-1.6250 | 0.299(1) | 1.0753(4) | 3.24(7)
-1.2900 | 0.346(5) | 1.127(3) | 5.7(3)
-0.9942 | 0.401(2) | 1.179(2) | 3.58(8)
-0.8042 | 0.451(2) | 1.208(2) | 3.21(4)
-0.6558 | 0.497(2) | 1.224(2) | 3.03(3)
0.7565 | 0.995(3) | 1.447(6) | 2.55(3)
2.9036 | 2.006(6) | 1.757(9) | 2.08(1)
8.3488 | 5.00(1) | 1.92(1) | 1.97(1)
When comparing results with the MC program, several points should be remembered.
1. Constraining the bond lengths affects average potential energy, kinetic energy, and heat capacity.
2. While we use _k_<sub>spring</sub>=10000 to highlight the multiple timestep method,
it is quite likely that energy flow between bond vibrations and other degrees of freedom will be inefficient,
due to the timescale separation.
3. The constant-_NVE_ and constant-_NVT_ ensembles are expected to yield different behaviour around the collapse transition.
4. Molecular dynamics is not expected to thoroughly explore the energy landscape at low temperatures,
giving instead (typically) quasi-harmonic vibrations in a single basin.
For the hard-sphere square-well chain, the aim was to show the operation of the Wang-Landau method.
In `mc_chain_wl_sw` we use pivot and crankshaft moves as well as CBMC regrowth.
In a practical application it would be advisable to include some bridging moves as well.
Reasonably long chains, _N_=128, have been studied by this method,
and exact results are available for very short chains;
see, for example,
* MP Taylor, _J Chem Phys,_ __118,__ 883 (2003),
* JE Magee, L Lue, RA Curtis, _Phys Rev E,_ __78,__ 031803 (2008),
* MP Taylor, W Paul, K Binder, _J Chem Phys,_ __131,__ 114907 (2009),
who provide references to other simulation work.
For testing purposes our aims are quite modest:
we choose _N_=6, bond length equal to σ, and a nonbonded interaction range of 1.5σ.
The starting chain configuration can be prepared using `initialize` in the usual way
(note the non-default value of the bond length).
Default parameters are used in `mc_chain_wl_sw`,
including a flatness criterion of 0.9.
The entropy modification constant `ds` is halved at each stage,
and there are 20 stages.
For this system, the energy range (in units of the well depth) is
_E_ = 0 … -10.
The principal result is the histogram of entropies _S(E)_ produced at the final stage.
For convenience we (arbitrarily) define _S_(0)=0.
We conduct a set of nine independent WL runs,
and report the results from the two runs with the highest and lowest values of _S_(-10),
which bracket all the other results in the set,
as a rough indication of the errors.
We compare with the exact values calculated from the density of states
of Taylor (2003), normalized in the same way to make _S_(0)=0.
_E_ | _S(E)_ (exact) | _S(E)_ (WL) | _S(E)_ (WL)
------ | ------ | ------ | ------
0.0 | 0.0000 | 0.0000 | 0.0000
-1.0 | 0.7521 | 0.7629 | 0.7518
-2.0 | 0.6661 | 0.7014 | 0.6683
-3.0 | 0.2108 | 0.2308 | 0.2108
-4.0 | -0.4433 | -0.4152 | -0.4449
-5.0 | -1.3484 | -1.3316 | -1.3444
-6.0 | -2.4438 | -2.4256 | -2.4322
-7.0 | -3.6832 | -3.6634 | -3.6733
-8.0 | -5.8548 | -5.8440 | -5.8620
-9.0 | -8.4766 | -8.4050 | -8.4733
-10.0 | -14.9981 | -14.6824 | -15.0295
As a further check, we ran a set of canonical ensemble calculations for the same system
with `mc_chain_nvt_sw` at selected temperatures.
The program default is to run for 10 blocks, each of 100000 steps;
this was increased to 10 blocks of 500000 steps for temperatures
below 0.25.
The results may be compared with values reconstructed using the
`wl_hist` program from the simulation histograms.
Below we show the heat capacity per atom from the above two WL runs (red),
from the exact density of states of Taylor (black),
and from the canonical ensemble calculations (blue error bars).
It is also straightforward to compare average energies and radii of gyration,
but we do not do that here.
As the chain length increases, the energy landscape becomes more challenging.
For _N_=13, with the same bond length of σ,
and nonbonded interaction range of 1.5σ,
sensible results may still be achieved
with the simple example program `mc_chain_wl_sw`.
Once more, as a reference for comparison,
we ran a set of canonical ensemble calculations with `mc_chain_nvt_sw`,
using the same parameters described above.
The results are shown on the left of the following table.
_T_ | _PE_ | _R_<sub>g</sub> | _C<sub>v</sub>_(ex) | _PE_ | _R_<sub>g</sub> | _C<sub>v</sub>_(ex)
----- | ------ | ------ | ------ | ------ | ------ | ------
method | _NVT_ | _NVT_ | _NVT_ | WL | WL | WL
0.15 | -2.81(1) | 1.070(2) | 1.1(2) | -2.814 | 1.068 | 2.053
0.18 | -2.759(8) | 1.072(2) | 2.2(2) | -2.744 | 1.073 | 2.498
0.20 | -2.699(8) | 1.077(2) | 2.4(1) | -2.694 | 1.078 | 2.366
0.22 | -2.645(4) | 1.082(1) | 2.16(7) | -2.649 | 1.082 | 2.226
0.25 | -2.586(8) | 1.090(2) | 2.15(9) | -2.584 | 1.089 | 2.121
0.30 | -2.482(6) | 1.104(2) | 1.97(6) | -2.481 | 1.103 | 2.010
0.50 | -2.127(2) | 1.161(1) | 1.50(2) | -2.128 | 1.161 | 1.491
1.00 | -1.547(2) | 1.318(1) | 1.024(6) | -1.543 | 1.319 | 1.020
2.00 | -0.885(1) | 1.658(1) | 0.330(2) | -0.883 | 1.660 | 0.332
5.00 | -0.566(1) | 1.889(1) | 0.0318(1) | -0.565 | 1.890 | 0.032
Results obtained from a run of the Wang-Landau program `mc_chain_wl_sw`,
using the same model, are given on the right of the table above.
The program was run with default parameters,
except that the flatness criterion was set at 80%.
The results are from the histograms produced in the 20th stage.
This analysis can also be performed (for any desired temperature) by the program `wl_hist`, after the run.
The results are generally in good agreement with the canonical ensemble test runs.
The most significant discrepancies are in the heat capacities at the lowest two temperatures,
which reflects the poor sampling of the canonical ensemble program (with these basic MC moves),
and the sampling problems about to be discussed.
This particular test run illustrated one drawback of the simplest Wang-Landau implementation:
two low-lying energies (corresponding to _q_=38 and 39 square-well interactions) were discovered
during the very last stage, in which `ds` is very small.
Accordingly, the system remained stuck in these low-energy states for a very long time,
until their tabulated entropy _S(q)_ reached a high enough value to allow _q_ to change;
even then, the final weight of the lowest state in the final "flat" histogram
could not be considered completely reliable.
The overall run length was of order 90000 blocks of 10000 steps each,
most of it spent in stage 20.
Repeating the run with the same parameters typically produces different results,
depending on whether, and when, these low-lying states are discovered.
This affects the canonical ensemble results reconstructed from the histograms
through `wl_hist`, particularly at the lower temperatures,
while the higher temperatures are largely unaffected.
From a single run, or a few runs, there might be no indication of anything wrong.
It is always a danger with any Monte Carlo method, including Wang-Landau,
that inaccessible configurations will not be sampled.
Various improvements of the method may be found in the literature.
(The reader is invited to work out the structure of the 13-atom chain configuration
with hard sphere diameter and bond length both equal to σ
having 39 nonbonded interactions within range 1.5σ.
_Hint:_ it is not one of the highest-symmetry clusters such as the icosahedron;
however, it is based on a fairly symmetric cluster,
with small distortions due to the fixed bond length and the need to maximise interactions.)
To obtain more reliable results it would be advisable to add a
production run at the end of the `mc_chain_wl_sw` program,
during which the weights are no longer adjusted,
allowing averages to be generated using a proper Markov chain.
## Polyatomic Lennard-Jones program
The program `mc_nvt_poly_lj` conducts Monte Carlo simulations of a system of rigid molecules
composed of Lennard-Jones interaction sites.
For simplicity the sites are taken to be identical, although the program is easily generalized.
Molecular orientations are represented by quaternions,
which are used to calculate the rotation matrix
and hence the interaction site positions.
We test this with the three-site model of orthoterphenyl, a fragile glassformer,
described in the following publications amongst others.
* LJ Lewis, G Wahnstrom, _Sol State Commun,_ __86,__ 295 (1993)
* LJ Lewis, G Wahnstrom, _Phys Rev E,_ __50,__ 3865 (1994)
* S Mossa, E La Nave, HE Stanley, C Donati, F Sciortino, P Tartaglia, _Phys Rev E,_ __65,__ 041205 (2002)
* E La Nave, S Mossa, F Sciortino, P Tartaglia, _J Chem Phys,_ __120,__ 6128 (2004)
We compare with the results of Mossa et al (2002).
The sites are arranged at the vertices of an isosceles triangle with bond angle 75 degrees,
LJ parameters ε = 5.276 kJ mol<sup>-1</sup>,
σ=0.483nm,
and two equal bonds of length σ.
The program employs the usual reduced units based on ε and σ
and in these units the potential cutoff of Mossa et al (2002) is _R_<sub>c</sub>=2.612;
the pair potential is Lennard-Jones with a shifted-force correction term, linear in _r_,
to make the potential and its derivative vanish at _r_=_R_<sub>c</sub>.
Apart from the temperatures,
default program parameters were used throughout the tests.
Tests were performed at ρ=0.32655 which is equivalent to ρ<sub>4</sub>=1.108g cm<sup>-3</sup>
in Mossa et al (2002).
Comparisons of potential energy (_PE_=_E_-3 _T_ converted to kJ/mol with a factor 5.276)
were made with the fit given by eqn (23) of that paper.
Note that ε/k<sub>B</sub>≈635 K.
_T_ | _E_ | _P_ | _T_ (K) | _PE_ (kJ/mol) | _PE_ (kJ/mol) eqn (23)
----- | ----- | ----- | ----- | ----- | -----
0.5 | -12.993(3) | 1.773(8) | 317 | -76.47(2) | -76.945
1.0 | -9.817(9) | 5.86(2) | 635 | -67.62(5) | -67.634
1.5 | -6.84(1) | 9.38(4) | 952 | -59.83(5) | -60.011
2.0 | -4.07(1) | 12.37(4) | 1270 | -53.13(5) | -53.265
A second set of tests was performed at _T_=0.6≈380K
at the specified densities ρ<sub>1</sub>, … ρ<sub>5</sub> of Mossa et al (2002).
A set of starting configurations is provided in the [Data repository](https://github.com/Allen-Tildesley/data).
Here the excess pressure (_P_(ex)=_P_-ρ_T_ converted to MPa
with a factor 77.75 based on the values of ε and σ)
is compared with the fit given by eqn (28) and the coefficients in Table III of Mossa et al (2002).
NB the volumes to insert into the equation are those of their Table I,
which are specific to their system size.
In addition their eqn (29) with coefficients in Table V is a fit to their potential energy,
which we calculate from the simulation as described above.
Id | ρ | _E_ | _P_ | _P_(ex) (MPa) | _P_(ex) (MPa) eqn (28) | _PE_ (kJ/mol) | _PE_ (kJ/mol) eqn (29)
----- | ----- | ----- | ----- | ----- | ----- | ------ | ------
1 | 0.30533 | -11.625(4) | 0.45(1) | 20.7(7) | 19.077 | -70.83(2) | -70.818
2 | 0.31240 | -11.914(6) | 1.01(2) | 64(2) | 60.143 | -72.36(3) | -72.289
3 | 0.31918 | -12.143(5) | 1.74(1) | 120(2) | 112.798 | -73.56(3) | -73.601
4 | 0.32655 | -12.400(4) | 2.53(1) | 181(1) | 177.222 | -74.92(2) | -74.886
5 | 0.33451 | -12.487(4) | 3.84(1) | 283(1) | 253.510 | -75.38(2) | -75.825
In making these comparisons,
our default run length (10 blocks of 20000 sweeps each) should be borne in mind,
since this system can show sluggish behaviour.
The MD simulations of Mossa et al (2002) are reported to extend to several hundred nanoseconds
(of order 10<sup>7</sup> MD timesteps) at the lowest temperatures.
For comparison we provide a molecular dynamics code `md_nvt_poly_lj` for the same model.
The program takes the molecular mass _M_ to be unity.
Mossa et al (2002) ascribe a notional mass of 78u to each of the three LJ sites,
so _M_≈3.9×10<sup>-25</sup>kg.
Combined with the above values of ε and σ,
this gives a time scale (_M_/ε)<sup>1/2</sup>σ ≈ 3.22 ps.
The timestep of δt=0.01 ps used by Mossa et al (2002)
corresponds to the default value in the program `dt=0.003` in these units.
By default, the program simulates the constant-_NVE_ ensemble,
but there is an option to simulate at constant _NVT_ by velocity randomization (Andersen thermostat).
If the latter option is selected,
the program will read configurations in the same format as `mc_nvt_poly_lj` (positions and quaternions only),
selecting random initial velocities and angular momenta,
which can be convenient.
By default the program calculates the inertia tensor from the LJ site bond vectors,
assuming equal masses.
For simplicity it is assumed that the bond vectors are defined such that
the principal axes of the inertia tensor coincide with
the xyz axes of the molecular coordinate system,
with the centre of mass at the origin;
it is always possible to arrange this.
In general,
the three principal moments of inertia will all be different,
so the molecule is an asymmetric top.
The MD algorithm for rotation is a symplectic one
in which a `kick` propagator advances the space-fixed angular momenta,
using the torque on each molecule,
and a succession of `drift` steps implement free rotation about each of the principal axes.
This is described in the text, section 3.3; see
* A Dullweber, B Leimkuhler, R McLachlan, _J Chem Phys,_ __107,__ 5840 (1997),
* TF Miller, M Eleftheriou, P Pattnaik, A Ndirango, D Newns, GJ Martyna, _J Chem Phys,_ __116,__ 8649 (2002).
The results below are for test runs in both constant-_NVE_ and constant-_NVT_ ensembles,
at (approximately) the same state points as those given above.
All runs were 10×20000 steps in length and used program defaults,
except for `t_interval=1` and the specified temperature in the _NVT_ case.
For constant-_NVE_ runs we report RMS energy fluctuations,
and _T_ is the average translational temperature.
ρ | _T_ | _E_ | _P_ | _E_(RMS)
----- | ----- | ----- | ----- | -----
0.32655 | 0.5 | -12.984(5) | 1.81(1) |
0.32655 | 0.5082(4) | -12.9838 | 1.755(6) | 1.23×10<sup>-8</sup>
0.32655 | 1.0 | -9.80(2) | 5.87(4) |
0.32655 | 1.004(1) | -9.8006 | 5.896(5) | 9.88×10<sup>-8</sup>
0.32655 | 1.5 | -6.83(1) | 9.35(3) |
0.32655 | 1.506(1) | -6.8326 | 9.378(6) | 3.67×10<sup>-7</sup>
0.32655 | 2.0 | -4.05(1) | 12.42(4) |
0.32655 | 2.007(1) | -4.0507 | 12.405(4) | 9.39×10<sup>-7</sup>
ρ | _T_ | _E_ | _P_ | _E_ (RMS)
----- | ----- | ----- | ----- | -----
0.30533 | 0.6 | -11.613(5) | 0.45(2) |
0.30533 | 0.6013(8) | -11.6131 | 0.485(4) | 1.31×10<sup>-8</sup>
0.31240 | 0.6 | -11.892(6) | 1.04(2) |
0.31240 | 0.6039(8) | -11.8923 | 1.058(5) | 1.52×10<sup>-8</sup>
0.31918 | 0.6 | -12.147(4) | 1.75(1) |
0.31918 | 0.603(1) | -12.1465 | 1.710(9) | 1.73×10<sup>-8</sup>
0.32655 | 0.6 | -12.362(3) | 2.61(1) |
0.32655 | 0.604(2) | -12.3616 | 2.58(1) | 2.05×10<sup>-8</sup>
0.33451 | 0.6 | -12.453(7) | 3.96(2) |
0.33451 | 0.612(1) | -12.4532 | 3.87(1) | 2.53×10<sup>-8</sup>
## DPD program
For the `dpd` example, we recommend generating an initial configuration
using the `initialize` program, with namelist input similar to the following
```
&nml n = 100, density = 3.0, lattice = .false.,
velocities = .true., soft=.true. /
```
The above value of the density is typical when using this method to model water.
For testing we compare with an approximate DPD equation of state for _P_.
* RD Groot, PB Warren, _J Chem Phys,_ __107,__ 4423 (1997)
* TP Liyana-Arachchi, SN Jamadagni, D Eike, PH Koenig, JI Siepmann,
_J Chem Phys,_ __142,__ 044902 (2015)
The paper of Liyana-Arachchi et al (2015) is an improvement of the original
EOS of Groot and Warren (1997), which is more accurate and
applicable over a wider range of state points.
The function is included in the `dpd` program,
and the expected value of _P_ (labelled EOS below)
is printed for comparison at the end.
We give results obtained by both
the Lowe thermostat (L) and the Shardlow algorithm (S).
We take the default values of _a_ ρ/T=75, and of other parameters not mentioned below.
_T_ | ρ | _P_ (EOS) | _P_ (L) | _P_ (S)
----- | ----- | ----- | ----- | -----
0.5 | 3.0 | 11.864 | 11.814(2) | 11.819(2)
1.0 | 3.0 | 23.587 | 23.637(2) | 23.635(2)
1.5 | 3.0 | 35.276 | 35.449(3) | 35.455(4)
2.0 | 3.0 | 46.951 | 47.257(4) | 47.265(5)
1.0 | 2.0 | 14.187 | 14.320(2) | 14.316(2)
1.0 | 4.0 | 32.811 | 32.622(3) | 32.628(3)
1.0 | 5.0 | 41.887 | 41.539(4) | 41.533(3)
## Test programs for potentials, forces and torques
Two program files are provided: `test_pot_atom.f90` and `test_pot_linear.f90`,
for pair potentials between, respectively, atoms and linear molecules.
These are combined, as appropriate, with modules which contain a subroutine to calculate
the necessary potential, forces and torques.
The aim is to demonstrate the numerical testing of the analytical derivatives
which go into the forces and torques:
small displacements and rotations are applied in order to do this.
The test is performed for a randomly selected configuration.
Some parameters are used to prevent serious overlap,
which might produce numerical overflow,
while keeping the particles close enough together to give non-zero results.
The values of these parameters may be adjusted via the namelist in individual cases;
to run the programs without any tweaking,
simply give an empty namelist `&nml /` to standard input in the usual way.
The supplied examples are:
* `test_pot_at` the Axilrod-Teller three-body potential
* `test_pot_bend` the angle-bending part of a polymer chain potential
* `test_pot_dd` the dipole-dipole potential
* `test_pot_dq` the dipole-quadrupole and quadrupole-dipole potential
* `test_pot_gb` the Gay-Berne potential
* `test_pot_qq` the quadrupole-quadrupole potential
* `test_pot_twist` the angle-torsion part of a polymer chain potential
In all cases, the SConstruct file builds these programs in a directory
whose name is taken from the module name above,
but the executable file is named `test_pot_atom` or `test_pot_linear`
as appropriate.
## T-tensor program
The program `t_tensor` compares the calculation of multipole energies by two methods:
using explicit formulae based on trigonometric functions of the Euler angles,
and via the Cartesian T-tensors.
Two linear molecules are placed in random positions and orientations,
within a specified range of separations,
and some of the contributions to the electrostatic energies and forces are calculated.
The program may be run using an empty namelist `&nml /`,
so as to take the program defaults,
or various parameters may be specified in the namelist.
The force between the molecules is calculated from the analytical derivative of the
T-tensor with respect to the separation vector.
This naturally leads to formulae where the original T-tensor of rank n
is replaced by one of rank n+1.
The torque on each molecule is calculated by formulae similar to those used for
torques on multipoles in an external field, field gradient, etc., but in which the
field terms are replaced by tensors based on T and the multipoles on the other molecule.
This naturally leads to formulae involving the Levi-Civita (antisymmetric) symbol.
In practical applications, the formulae would usually be incorporated in a scheme
for handling long-range forces in periodic boundaries (e.g. Ewald sum).
## Ewald program
The k-space and r-space contributions to the Ewald sum are illustrated in `ewald_module`
and we provide a program `ewald` to test these.
The program reads in a configuration file `cnf.inp` in the usual format:
any of the Lennard-Jones or hard-sphere configurations would be suitable.
Charges are assigned to the atoms in an arbitrary way.
The program itself adds the surface term (the self term is included in the k-space routine).
Then, a comparison is made with the brute force summation over all pairs
in shells of periodic boxes surrounding the central box.
For default parameters, and test configurations with _N_=256,
reasonable convergence is obtained within 8-10 shells.
One can adjust the screening parameter kappa within reason
(and the number of k-vectors may need changing as well):
the contributions of r-space and k-space terms will change, but their sum should
remain approximately constant.
There is also a comparison with a simplified particle-mesh Ewald method.
As discussed in the text, the charge distribution is assigned to a cubic mesh,
Fourier transformed by FFT, and used to calculate the total potential energy,
using the solution of Poisson's equation in Fourier space.
In doing so, accuracy is improved by optimizing the so-called influence function G.
In this example, we use a simple sharpening function discussed by
* V Ballenegger, JJ Cerda, C Holm, _J Chem Theo Comp,_ __8,__ 936 (2012)
but more sophisticated optimized functions are possible. It is easy to comment out
this sharpening function, to see the extent of the correction; it is reasonably
significant for the default parameter values.
See below for more discussion of the mesh function, provided in `mesh_module`,
and of the FFT routine which is illustrated in `fft3dwrap`.
## Mesh program
The program `mesh` generates a random configuration of a small number of charges
and illustrates the way this may be assigned to a regular cubic mesh using the
triangular-shaped cloud distribution described in
* RW Hockney, JW Eastwood, _Computer simulation using particles_ (Adam Hilger, Bristol, 1988)
The function generating the charge density is provided in `mesh_module`. The mesh dimension
is, by default, kept small enough to print out the whole array for inspection afterwards.
The number of charges and mesh dimension may be adjusted by the user, via namelist parameters.
## Cluster program
The `cluster` program is self contained. It reads in a configuration of atomic positions
and produces a circular linked list for each cluster identified within the configuration.
The best value of the critical separation `r_cl` depends on the particular physical system
being considered. To illustrate, we have provided a file `cluster.inp` consisting of
_N_=256 atoms at low overall density, generated by a short quench from a disordered system
at high temperature to a low temperature inhomogeneous state (not yet at equilibrium).
This file should be copied into the working directory before running the program.
With the default value `r_cl`=1.5, six well-separated clusters should be identified.
The results in this case are moderately insensitive to the value of `r_cl`, but increasing
it above 3 includes all atoms in a single cluster, while reducing it below 1.15 will start to
separate isolated atoms into clusters of their own.
Clustering algorithms are part of the standard toolkit of data analysis, and in practical
applications it may be more efficient and convenient to use a packaged implementation of
an algorithm such as `dbscan`
* M Ester, H-P Kriegel, J Sander, X Xu. (1996).
[Proc. Second Int. Conf. on Knowledge Discovery and Data Mining (KDD-96) p 226](https://www.aaai.org/Papers/KDD/1996/KDD96-037.pdf)
(Eds: E Simoudis, J Han, UM Fayyad; AAAI Press, 1996).
Fortran implementations of `dbscan` are available from various sources.
For systems in periodic boundaries, rather than supplying the atomic positions, the user should
compute a distance matrix using the minimum image convention, and supply that to the routine,
as suggested by [Turci](https://francescoturci.wordpress.com/2016/03/16/clustering-and-periodic-boundaries/)
in the context of a Python version.
## Correlation function program
The aim of the program `corfun` is to illustrate the direct method, and the FFT method,
for calculating time correlation functions.
The program is self contained: it generates the time dependent data itself,
using a generalized Langevin equation,
for which the time correlation function is known.
The default parameters produce a damped, oscillatory, correlation function,
but these can be adjusted to give monotonic decay,
or to make the oscillations more prominent.
If the `origin_interval` parameter is left at its default value of 1,
then the direct and FFT methods should agree with each other to within numerical precision.
The efficiency of the direct method may be improved,
by selecting origins less frequently,
and in this case the results obtained by the two methods may differ a little.
Sample results using default program parameters are shown here.
The direct method is indicated in black, plotting only every fifth point for clarity.
The FFT result is shown as a red line: it matches the direct method as expected.
The exactly known function is a blue line.
There are very small discrepancies with the results of the simulation,
due to the finite length of the latter.
## Diffusion program
The program `diffusion` reads in a sequence of configurations and calculates
the velocity auto correlation function (vacf),
the mean square displacement (msd), and
the cross-correlation between velocity and displacement (rvcf).
Any of these may be used to estimate the diffusion coefficient,
as described in the text.
The output appears in `diffusion.out`
It is instructive to plot all three curves vs time.
The input trajectory is handled in a crude way,
by reading in successive snapshots with filenames `cnf.000`, `cnf.001`, etc.
These might be produced by a molecular dynamics program,
at the end of each block,
choosing to make the blocks fairly small (perhaps 10 steps).
As written, the program will only handle up to `cnf.999`.
Obviously, in a practical application,
a proper trajectory file would be used instead of these separate files.
It is up to the user to provide the time interval between successive configurations.
This will typically be a small multiple of the timestep used in the original simulation.
This value `delta` is only used to calculate the time, in the first column of
the output file.
A default value of 0.05 is provided as a place-holder, but
the user really should specify a physically meaningful value;
forgetting to do so could cause confusion when one attempts
to quantify the results.
To make it easier to test this program,
we have also supplied a self-contained program `diffusion_test`,
which generates an appropriate trajectory by numerically solving
the simple Langevin equation for _N_ non-interacting atoms (_N_=250 by default).
For this model, one specifies the temperature and friction coefficient,
which dictates the rate of exponential decay of the vacf,
and hence the diffusion coefficient.
The exact results for the vacf, rvcf and msd are written out to `diffusion_exact.out`
for easy comparison with `diffusion.out`.
Here are some typical results using default program parameters throughout.
The vacf is in red, rvcf in blue, and msd in green;
every fifth point is shown for the results of `diffusion`,
while the exact results are indicated as lines.
For the default program parameters, the diffusion coefficient is _D_=1.
## Pair distribution function
The program `pair_distribution` reads in a set of configurations and calculates
the pair correlation function _g(r)_.
We limit the number of configurations to a maximum of 1000 (numbered from 000 to 999)
simply so as to use a fixed naming scheme for the input configurations;
in a practical application, a trajectory file would be used instead.
We have tested it on a set of 500 configurations
of _N_=256 Lennard-Jones atoms,
cut (but not shifted) at _R_<sub>c</sub>=2.5σ,
at the usual state point ρ=0.75, _T_=1.0.
The interval between configurations was 100 MC sweeps.
This data set is provided in the
file `pair_distribution_data.zip` in the [Data repository](https://github.com/Allen-Tildesley/data).
Using the default resolution of 0.02σ,
the results shown below were obtained for _g(r)_.
## Interface pair correlation function
The program `grint.f90` reads in a set of configurations and calculates
the pair correlation function for a system that is inhomogeneous in the
z direction. It is assumed that the configurations consist of a liquid slab,
surrounded by gas, with the interfaces lying in the _xy_-plane.
The two interfaces are located by fitting the instantaneous density profile
to a difference of two tanh functions. Then the single-particle density function,
relative to each of the interface locations, is calculated.
To make the process as robust as possible, an initial guess at the mid-point
of the liquid slab should be provided, and this is updated automatically as
successive configurations are read in, so as to shift the liquid slab into
the middle of the periodic box, before fitting.
Also, the results of one fit are passed on as the starting point of the next one.
The program handles cubic boxes only;
the modifications necessary to handle non-cubic boxes are fairly easy to make,
but we will not do that here.
No attempt is made to correct for capillary-wave fluctuations affecting the
width of the interface.
Having located, and combined, the two interfaces, the histograms for calculating
the one-body and two-body densities are accumulated, in a coordinate system
which has its origin at the interface. The one-body density is then fitted by
a single tanh curve: this could easily be changed by the user if desired.
For simplicity, in the normalization of the two-body density to give the
pair correlation function, we use the _fitted_ tanh form of the single particle
density. This is obviously an approximation, and could be replaced by a better fit,
or an interpolation scheme, to evaluate the function at arbitrary z.
Finally, the program writes out the average, overall, density profile, the
single-particle density (with fit) and slices at selected values of z and c
through the pair correlation function.
In testing this program, it is important to use a large enough system so that
all values of z<sub>1</sub> and z<sub>2</sub> of interest (measured relative to
the interface position) lie far from the _other_ interface position.
The program was tested on a system of _N_=10000 atoms, interacting through
the Lennard-Jones potential cut (but not shifted) at _R_<sub>c</sub>=2.5σ,
in a cubic box of side 30σ, at a temperature _T_=0.90.
For this system, ρ<sub>G</sub> ≈ 0.024, ρ<sub>L</sub> ≈ 0.713
(see Trokhymchuk, op. cit.). A set of 100 configurations from this run, together
with the output of `grint.f90` with default parameters, are provided in the
file `grint_data.zip` in the [Data repository](https://github.com/Allen-Tildesley/data).
## Error calculation
The program `error_calc` is a self-contained illustration of the effects of
correlations on the estimation of errors for a time series.
We produce the series using a generalized Langevin equation,
in the same manner as for the correlation function program (see above).
Since the correlation time of the GLE is exactly known,
we can predict the effects, and compare with the empirical estimates
obtained by different methods.
The program contains extensive comments to explain what is being calculated at each stage.
## FFT program
The aim of `fft3dwrap` is to illustrate the way a standard Fast Fourier Transform
library routine is wrapped in a user program.
We numerically transform a 3D Gaussian function,
and compare with the analytically, exactly, known result.
User input defines the number of grid points and the box size;
sensible defaults are provided.
The library that we use for this example is [FFTW](http://www.fftw.org/).
## Hit-and-miss and sample-mean
The two programs `hit_and_miss` and `sample_mean` illustrate two very simple
Monte Carlo methods to estimate the volume of a 3D object.
They are both described in detail at the start of Chapter 4.
No user input is required.
For the built-in values defining the geometry, the exact result is 5/3.
## Quantum simulation programs
The program `qmc_walk_sho` solves the diffusion equation in imaginary time
corresponding to the Schrodinger equation,
for a single simple harmonic oscillator.
Atomic units are chosen so that the effective diffusion coefficient is _D_=1/2.
A few hundred independent systems, or walkers, are simulated using a simple random walk
and a crude creation/destruction scheme based on the difference between the potential energy
and the trial energy.
The scheme is described in the text.
The value of the trial energy `et` is updated regularly,
and the hope is that, after convergence,
it will be equal to the correct ground-state energy for the system which, in this case, is 1/2.
The updating scheme, and several of the default parameters,
are taken from the following paper
* I Kostin, B Faber, K Schulten, _Amer J Phys,_ __64,__ 633 (1996).
Reasonable results for the energy and the ground-state wavefunction,
which is accumulated as a histogram of walker positions,
should be obtained using the default input values,
with an empty namelist `&nml /`;
these defaults include setting `et` initially to the exact ground state energy.
Other values such as `&nml et=0.6 /` may be supplied through the namelist in the usual way.
This type of simulation is sensitive to the initial value,
and quite noisy:
possible improvements are discussed in general terms in the text.
The program `qmc_pi_sho` carries out a path integral Monte Carlo simulation
for a single simple harmonic oscillator,
at a specified temperature and ring-polymer size _P_.
Larger values of _P_ give energies closer to the exact quantum mechanical canonical ensemble average.
For this simple model,
exact results can also be calculated for the finite values of _P_ used in the simulation
* KS Schweizer, RM Stratt, D Chandler, PG Wolynes, _J Chem Phys,_ __75,__ 1347 (1981),
* M Takahashi, M Imada, _J Phys Soc Japan,_ __53,__ 3765 (1984),
and a routine to evaluate these is included in the example.
No special techniques are used to accelerate the simulation;
standard Metropolis moves are employed.
Default parameters correspond to _P_=8, _T_=0.2.
The table below is for test runs at various values of _P_,
keeping the same temperature,
which generates a range of average energies between
the classical limit _E_=0.2
and the quantum limit _E_=0.506784;
in each case we compare with the exactly-known value for the same _P_.
_P_ | _E_ (MC) | _E_ (exact)
---- | -------- | -----------
2 | 0.3218(3) | 0.321951
3 | 0.3933(4) | 0.392308
4 | 0.4312(3) | 0.431618
5 | 0.4543(4) | 0.454545
6 | 0.4694(6) | 0.468708
7 | 0.4778(6) | 0.477941
8 | 0.4846(9) | 0.484244
The program `qmc_pi_lj` applies the path-integral method to the Lennard-Jones fluid.
The simplest, primitive, algorithm is used,
together with the crudest estimators for energy and pressure.
The program uses
single-particle Monte Carlo moves for the individual beads in the ring polymer,
along with translations of the centre-of-mass of each polymer.
As mentioned in the text, there are many improvements of all these aspects
of the algorithm, which are recommended for production work.
The program takes in configuration files `cnf##.inp` where the `##` reflects
the polymer bead number, in the range 1 to _P_.
These files have the same format as the classical Lennard-Jones configurations.
They may be prepared in the same way as usual,
from the `initialize` program, from a run of `mc_nvt_lj`
at the appropriate density and temperature,
or from a run of `qmc_pi_lj` for a different value of _P_.
It does no harm if these starting configurations are simply duplicates of each other,
provided that a preliminary run is conducted to allow the polymers to equilibrate,
after which all the output files `cnf##.out` may be renamed to `cnf##.inp`.
For testing, we compare with a set of simulations of neon,
* M Neumann, M Zoppi, _Phys Rev E,_ __65,__ 031203 (2002),
which are mainly based on an empirical pair potential,
but include selected results for Lennard-Jones for the case _P_=32.
The LJ parameters for neon are ε=36.8K, σ=0.2789nm, atomic mass _m_=20.18u,
and hence a reduced de Boer parameter λ=0.092σ,
which is the default value in the program.
We choose their lowest-temperature state point,
(_T_,ρ)=(25.8K,36.28nm<sup>-3</sup>)=(0.701087,0.787069) in reduced LJ units.
We use _N_=108 atoms, compared with Neumann and Zoppi's _N_=256,
and our runs are five times shorter (10 blocks of 10000 sweeps);
these differences should not be critical.
The maximum centre-of-mass displacement is 0.1σ.
Because the intra-polymer springs increase in strength with _P_,
the maximum displacement parameter for individual bead moves
is reduced from 0.06σ for _P_=2
down to 0.02σ for _P_=32.
These choices give reasonable acceptance ratios for both kinds of move.
In the table below we report:
the rms radius _R_ of the ring polymers,
the average spring potential _E_(spring) per atom,
the kinetic energy _KE_ per atom,
total energy _E_ per atom, and pressure _p_
(the last two including the standard long-range correction
for the applied cutoff _R_<sub>c</sub>=2.5σ).
_P_ | _R_ | _E_(spring) | _KE_ | _E_ | _p_
------ | ------ | ------ | ------ | ------ | ------
1 † | 0.0 | 0.0 | 1.052 | -4.692(1) | -0.756(5)
2 | 0.04043(1) | 0.8963(7) | 1.2070(7) | -4.454(1) | -0.408(6)
4 | 0.04942(1) | 2.906(1) | 1.301(1) | -4.320(3) | -0.231(9)
8 | 0.05181(2) | 7.073(3) | 1.340(3) | -4.261(3) | -0.150(8)
16 | 0.05247(2) | 15.479(4) | 1.347(4) | -4.252(4) | -0.148(5)
32 | 0.05261(4) | 32.287(8) | 1.365(8) | -4.233(8) | -0.140(6)
32 ‡ | 0.053 | 32.3008 | 1.352 | -4.227 | -0.039
† For completeness the _P_=1 runs were performed using `mc_nvt_lj`.
‡ These results are taken from Table I of Neumann and Zoppi (2002),
converted into LJ reduced units.
A drawback of this state point is that the pressure is negative,
suggesting instability with respect to phase separation.
Nonetheless we have seen no evidence of crystalline structure
in the simulated configurations,
and assume that the liquid phase is metastable.
| 56.799006 | 147 | 0.690608 | eng_Latn | 0.996029 |
c9a7ac96baa49ad295536032a65f1f0e22326b74 | 1,217 | md | Markdown | examples/create-react-native-app/README.md | dihan/ui | 469b709319efba56786b29ee3d1872921736f3cd | [
"BSD-3-Clause"
] | 5,216 | 2016-08-10T12:27:42.000Z | 2022-03-28T02:40:26.000Z | examples/create-react-native-app/README.md | dihan/ui | 469b709319efba56786b29ee3d1872921736f3cd | [
"BSD-3-Clause"
] | 389 | 2016-08-11T13:56:57.000Z | 2022-02-17T09:53:29.000Z | examples/create-react-native-app/README.md | dihan/ui | 469b709319efba56786b29ee3d1872921736f3cd | [
"BSD-3-Clause"
] | 657 | 2016-09-09T07:32:55.000Z | 2022-02-14T14:37:15.000Z | This is an example project bootstrapped with Create React Native App.
More detailed guide on how to work with a CRNA project can be found here.
Shoutem UI depends on several React Native packages with native code dependencies and it uses custom fonts. The default behavior of the CRNA is to create an app compatible with the Expo preview. The Expo app imposes restrictions on the way that native dependencies and custom fonts can be used compared to a standard RN app. The differences from the standard RN environment are described below.
## Loading custom fonts
In order to use custom fonts that come with the Shoutem UI in the Expo preview app, those fonts need to be manually loaded using Font.loadAsync from the expo package. You can see how to do that in the `App.js`.
## Native dependencies
The Expo preview app has a set of predefined dependencies and it doesn't have support for adding new native dependencies using standard RN commands (react-native link).
Shoutem UI is functional in this environment, but certain UI components that use native components will not work. If you need those components, you can eject from the CRNA environment. See the ejecting guide for more details about this option.
| 76.0625 | 394 | 0.803615 | eng_Latn | 0.999674 |
c9a8089c2e8ba27aed4d13286eb4bf7e878ab8e5 | 415 | md | Markdown | guice/README.md | nddipiazza/cucumber-jvm | 852ad5d6c267b71f64f77cf59b44f65def1a533f | [
"MIT"
] | 1,799 | 2015-01-02T10:22:05.000Z | 2022-03-31T19:48:49.000Z | guice/README.md | nddipiazza/cucumber-jvm | 852ad5d6c267b71f64f77cf59b44f65def1a533f | [
"MIT"
] | 1,781 | 2015-01-01T19:29:08.000Z | 2022-03-30T16:21:04.000Z | guice/README.md | nddipiazza/cucumber-jvm | 852ad5d6c267b71f64f77cf59b44f65def1a533f | [
"MIT"
] | 1,682 | 2015-01-03T05:45:54.000Z | 2022-03-25T10:07:05.000Z | # Using Cucumber Guice
The package documentation contains detailed instructions for using Cucumber Guice. In particular be sure to read the
migration section if upgrading from earlier versions of Cucumber Guice.
[Read package documentation online at api.cucumber.io](https://github.com/cucumber/api.cucumber.io)
[Read package documentation offline (raw html)](src/main/java/io/cucumber/guice/api/package.html)
| 41.5 | 117 | 0.809639 | eng_Latn | 0.924149 |
c9a860485a9e21acae0d83a9f4dba4d0401654f9 | 3,936 | md | Markdown | docs/framework/unmanaged-api/hosting/corvalidateimage-function.md | AlejandraHM/docs.es-es | 5f5b056e12f9a0bcccbbbef5e183657d898b9324 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/framework/unmanaged-api/hosting/corvalidateimage-function.md | AlejandraHM/docs.es-es | 5f5b056e12f9a0bcccbbbef5e183657d898b9324 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/framework/unmanaged-api/hosting/corvalidateimage-function.md | AlejandraHM/docs.es-es | 5f5b056e12f9a0bcccbbbef5e183657d898b9324 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: _CorValidateImage (Función)
ms.date: 03/30/2017
api_name:
- _CorValidateImage
api_location:
- mscoree.dll
api_type:
- DLLExport
f1_keywords:
- _CorValidateImage
helpviewer_keywords:
- _CorValidateImage function [.NET Framework hosting]
ms.assetid: 0117e080-05f9-4772-885d-e1847230947c
topic_type:
- apiref
author: rpetrusha
ms.author: ronpet
ms.openlocfilehash: a84869281ec27aface96d722603186382c6e15e7
ms.sourcegitcommit: 6b308cf6d627d78ee36dbbae8972a310ac7fd6c8
ms.translationtype: MT
ms.contentlocale: es-ES
ms.lasthandoff: 01/23/2019
ms.locfileid: "54730781"
---
# <a name="corvalidateimage-function"></a>_CorValidateImage (Función)
Valida las imágenes de módulo administrado y notifica al cargador del sistema operativo después de que se han cargado.
## <a name="syntax"></a>Sintaxis
```
STDAPI _CorValidateImage (
[in] PVOID* ImageBase,
[in] LPCWSTR FileName
);
```
#### <a name="parameters"></a>Parámetros
`ImageBase`
[in] Un puntero a la ubicación inicial de la imagen para validar como código administrado. La imagen ya se debe cargar en la memoria.
`FileName`
[in] El nombre de archivo de la imagen.
## <a name="return-value"></a>Valor devuelto
Esta función devuelve los valores estándar `E_INVALIDARG`, `E_OUTOFMEMORY`, `E_UNEXPECTED`, y `E_FAIL`, así como los valores siguientes.
|Valor devuelto|Descripción|
|------------------|-----------------|
|`STATUS_INVALID_IMAGE_FORMAT`|La imagen no es válida. Este valor tiene el resultado HRESULT 0xC000007BL.|
|`STATUS_SUCCESS`|La imagen es válida. Este valor tiene el resultado HRESULT 0x00000000L.|
## <a name="remarks"></a>Comentarios
En Windows XP y versiones posteriores, el cargador del sistema operativo comprueba los módulos administrados examinando el bit de directorio de Descriptor de COM en el encabezado de common object file format (COFF). Un bit establecido indica un módulo administrado. Si el cargador detecta un módulo administrado, carga MsCorEE.dll y llamadas `_CorValidateImage`, que realiza las acciones siguientes:
- Confirma que la imagen es un módulo administrado válido.
- Cambia el punto de entrada en la imagen a un punto de entrada en common language runtime (CLR).
- Para las versiones de 64 bits de Windows, modifica la imagen que está en la memoria transformando PE32 en PE32 + formato.
- Devuelve al cargador cuándo se cargan las imágenes de módulo administrado.
Para las imágenes ejecutables, el cargador del sistema operativo, a continuación, llama a la [_CorExeMain](../../../../docs/framework/unmanaged-api/hosting/corexemain-function.md) función, independientemente del punto de entrada especificado en el archivo ejecutable. Para las imágenes de ensamblado DLL, el cargador llama a la [_CorDllMain](../../../../docs/framework/unmanaged-api/hosting/cordllmain-function.md) función.
`_CorExeMain` o `_CorDllMain` realiza las acciones siguientes:
- Inicializa el CLR.
- Busca el punto de entrada administrado desde el encabezado CLR del ensamblado.
- Empieza a ejecutarse.
Las llamadas de cargador la [_CorImageUnloading](../../../../docs/framework/unmanaged-api/hosting/corimageunloading-function.md) funcionando cuando administra las imágenes de módulo se descargan. Sin embargo, esta función no realiza ninguna acción; simplemente devuelve.
## <a name="requirements"></a>Requisitos
**Plataformas:** Consulte [Requisitos del sistema](../../../../docs/framework/get-started/system-requirements.md).
**Encabezado**: Cor.h
**Biblioteca:** Incluye como recurso en MsCorEE.dll
**Versiones de .NET Framework:** [!INCLUDE[net_current_v10plus](../../../../includes/net-current-v10plus-md.md)]
## <a name="see-also"></a>Vea también
- [Funciones estáticas globales para metadatos](../../../../docs/framework/unmanaged-api/metadata/metadata-global-static-functions.md)
| 45.241379 | 426 | 0.740091 | spa_Latn | 0.938069 |
c9a8f7d5c4083c93a2d9c263a05e07b22e1dc064 | 248 | md | Markdown | README.md | noahbroyles/youtube-dl | 7a628eb76678c5781f90ff7fc7d3fad5f27166aa | [
"Unlicense"
] | 1 | 2020-11-02T17:21:02.000Z | 2020-11-02T17:21:02.000Z | README.md | noahbroyles/youtube-dl | 7a628eb76678c5781f90ff7fc7d3fad5f27166aa | [
"Unlicense"
] | null | null | null | README.md | noahbroyles/youtube-dl | 7a628eb76678c5781f90ff7fc7d3fad5f27166aa | [
"Unlicense"
] | 1 | 2020-11-02T16:34:37.000Z | 2020-11-02T16:34:37.000Z | # Youtube-DL
The main repo for this code was taken down by the DCMA. Thanks so much guys!
But we couldn't have that, so I am providing this repo. The README can be found [here](https://github.com/noahbroyles/youtube-dl/blob/main/REAL-README.md).
| 62 | 155 | 0.754032 | eng_Latn | 0.982044 |
c9a97e531dcb81d04735ee86ff23ff91ab5ee74f | 1,818 | md | Markdown | cms/post/should-you-be-forced-to-be-fully-suited-and-booted-in-this-heat.md | ryanallen98/zest-blogs | 161b0753d44c3931b603ace47f6b7e77faba859a | [
"MIT"
] | null | null | null | cms/post/should-you-be-forced-to-be-fully-suited-and-booted-in-this-heat.md | ryanallen98/zest-blogs | 161b0753d44c3931b603ace47f6b7e77faba859a | [
"MIT"
] | null | null | null | cms/post/should-you-be-forced-to-be-fully-suited-and-booted-in-this-heat.md | ryanallen98/zest-blogs | 161b0753d44c3931b603ace47f6b7e77faba859a | [
"MIT"
] | null | null | null | ---
created-on: '2020-12-06T17:53:06.792Z'
f_main-image:
url: >-
/assets/external/5fcec6997554bea162af29b8_should-you-be-forced-to-be-fully-suited-and-booted-in-this-heat-.png
alt: null
title: Should you be forced to be fully suited and booted in this heat?
slug: should-you-be-forced-to-be-fully-suited-and-booted-in-this-heat
f_date: '2017-06-19T00:00:00.000Z'
updated-on: '2020-12-08T00:19:54.290Z'
published-on: '2020-12-08T00:23:17.515Z'
layout: '[post].html'
tags: post
---
With the heat hitting over 30 degrees and remaining the same for the rest of the week, should you stay in business attire or wear something more feasible for this weather.It is proven that you get more productivity from your staff if they are comfortable in the office, so why not make that change today by asking your employer to adapt with the times…. Or the ‘weather’ in this case?Even with air-conditioning when you walk to the shops at lunchtime you will realise business dress is a waste of time.Lots of our experienced consultants have worked for numerous agencies over the years and they have all had the same experience with dress codes being stuck in the past, with the typical matching two piece suit for men with a shirt and tie, and a matching dress and jacket with high heels for women. Is this really necessary I asked myself, Raj Nasta, over the weekend whilst sitting in shorts and a t-shirt in my garden. So I sent a message to my whole team late Sunday afternoon saying please come in shorts, t-shirts, basically whatever you want just be comfy. I know I have made the right decision seeing everyone smiling this morning when I arrived in the office.We would like to find out is my opinion the majority or minority?#whatareyouwearing #outwiththeold #hotunderthecollar #notcutfromthesamecloth #zest2recruitment
| 106.941176 | 1,328 | 0.788779 | eng_Latn | 0.999587 |
c9a9b3a5b6c6a67a7371b2c99a70eaf88f2b479d | 453 | md | Markdown | Python/Mirrored_Rhombus/README.md | ieternalleo/AlgoCode | 77287392ce08fba082307adb588a1495cb42b84e | [
"MIT"
] | 151 | 2020-10-01T07:38:26.000Z | 2022-03-31T10:07:55.000Z | Python/Mirrored_Rhombus/README.md | ieternalleo/AlgoCode | 77287392ce08fba082307adb588a1495cb42b84e | [
"MIT"
] | 285 | 2020-10-01T09:34:29.000Z | 2021-08-02T12:13:49.000Z | Python/Mirrored_Rhombus/README.md | ieternalleo/AlgoCode | 77287392ce08fba082307adb588a1495cb42b84e | [
"MIT"
] | 275 | 2020-10-01T09:43:51.000Z | 2022-03-30T19:30:53.000Z | * I am [Monigingir Pal](https://github.com/Monigingir), and I have contributed
to the given issue
### Print a mirrored rhombus in python
* A rhombus is a shape which has all sides congruent, opposite sides parallel and diagonals crossing at 90 degrees. Given number of rows print a valid mirrored rhombus
Input: 4
Output:
****
****
****
****
### run the script ?
* run the python file code.py
* enter the height/row count of rhombus | 23.842105 | 167 | 0.697572 | eng_Latn | 0.994792 |
61aed706acb20a4646e2fecd2b2eff9a3db6ee9c | 1,604 | md | Markdown | website/docs/navbar.md | xiaoxiaocoder/taro-ui-vue3 | da6d1d7aab9904d3fcd00d16303113f81f36d173 | [
"MIT"
] | 144 | 2020-08-04T07:10:48.000Z | 2022-03-16T02:18:23.000Z | website/docs/navbar.md | xiaoxiaocoder/taro-ui-vue3 | da6d1d7aab9904d3fcd00d16303113f81f36d173 | [
"MIT"
] | 89 | 2020-08-04T00:36:47.000Z | 2021-11-18T08:26:33.000Z | website/docs/navbar.md | xiaoxiaocoder/taro-ui-vue3 | da6d1d7aab9904d3fcd00d16303113f81f36d173 | [
"MIT"
] | 50 | 2020-10-07T14:05:42.000Z | 2022-02-17T01:33:42.000Z | # NavBar 导航栏
---
导航栏组件，主要用于头部导航。
## 使用指南
在 Taro 文件中引入组件
```typescript
import { AtNavBar } from 'taro-ui-vue3'
```
**组件依赖的样式文件（仅按需引用时需要）**
```scss
@import "taro-ui-vue3/dist/style/components/nav-bar.scss";
```
## 一般用法
```html
<AtNavBar
@click-right-first-icon="handleClick"
@click-right-second-icon="handleClick"
@click-left-icon="handleClick"
color='#000'
title='NavBar 导航栏示例'
leftText='返回'
rightFirstIconType='bullet-list'
rightSecondIconType='user'
/>
```
## 自定义标题内容
注意 title 属性须为空
```html
<AtNavBar
@click-right-first-icon="handleClick"
@click-right-second-icon="handleClick"
@click-left-icon="handleClick"
color='#000'
leftText='返回'
rightFirstIconType='bullet-list'
rightSecondIconType='user'
>
<view>Taro UI</view>
</AtNavBar>
```
## 参数
| 参数 | 说明 | 类型 | 可选值 | 默认值 |
| ---------- | ------------------- | ----| ----- | -------- |
| color | 链接文字跟图标颜色，不包括标题 | String | - | `#6190E8` |
| fixed | 是否固定顶部 | Boolean | - | false |
| border | 是否显示下划线 | Boolean | - | true |
| title | 标题文字 | String | - | - |
| leftText | 左边文字 | String | - | - |
| leftIconType | 左边图标类型，图标类型请看`AtIcon`文档 | `String | Object` | - | 'chevron-left' |
| rightFirstIconType | 从右到左，第一个图标类型，图标类型请看`AtIcon`文档 | `String | Object` | - | - |
| rightSecondIconType | 从右到左，第二个图标类型，图标类型请看`AtIcon`文档 | `String | Object` | - | - |
## 事件
| 事件名称 | 说明 | 返回参数 |
|---------- |-------------- |---------- |
| onClickLeftIcon | 左边第一个图标类型点击事件 | - |
| onClickRightFirstIcon | 从右到左第一个图标类型点击事件 | - |
| onClickRightSecondIcon | 从右到左第二个图标类型点击事件 | - |
| 19.802469 | 85 | 0.585411 | yue_Hant | 0.603488 |
61aee10af7101765b7783e006e7dda659d4e9a4f | 14 | md | Markdown | README.md | gthszbd/HWName | b5b0757133803e84520cc5ccc3370f60e72249ae | [
"MIT"
] | null | null | null | README.md | gthszbd/HWName | b5b0757133803e84520cc5ccc3370f60e72249ae | [
"MIT"
] | null | null | null | README.md | gthszbd/HWName | b5b0757133803e84520cc5ccc3370f60e72249ae | [
"MIT"
] | null | null | null | # HWName
name
| 4.666667 | 8 | 0.714286 | eng_Latn | 0.981566 |
61aefa441642ee4ba18d5c522e8df531951d897a | 2,030 | md | Markdown | _posts/2016-09-29-note-webpack-learn.md | liangkeno/liangkeno.github.io | ee8512f4283be4c154de8bee56f27f025a1950c8 | [
"MIT"
] | null | null | null | _posts/2016-09-29-note-webpack-learn.md | liangkeno/liangkeno.github.io | ee8512f4283be4c154de8bee56f27f025a1950c8 | [
"MIT"
] | null | null | null | _posts/2016-09-29-note-webpack-learn.md | liangkeno/liangkeno.github.io | ee8512f4283be4c154de8bee56f27f025a1950c8 | [
"MIT"
] | null | null | null | ---
layout: post
category : tools
title: "记一个简单的webpack.config.js文件看安装的依赖包"
tags : [webpack, demo]
---
{% include JB/setup %}
<pre><code>
module.exports = {
entry: './basic/app.js',
output: {
path: './assets/',
filename: '[name].bundle.js'
},
module: {
loaders: [{
//babel-loader加载器，将es6转es5
test: /\.js$/,
loader: 'babel'
}, {
//style-loader,css-loader加载器，当调用bundle.js
//时动态生成sytle标签，插入html中的head
test: /\.css$/,
loader: 'style!css'
}]
}
};
</code></pre>
### package.json 中的安装依赖
<pre><code>
"devDependencies": {
"babel-loader": "^6.2.5",
"babel-preset-es2015": "^6.16.0",
"css-loader": "^0.25.0",
"style-loader": "^0.13.1",
"webpack": "^1.13.2"
}
</code></pre>
### 安装过程的坑
<pre><code>
cnpm install webpack --save-dev
cnpm install babel-loader --save-dev
cnpm install css-loader --save-dev
cnpm install style-loader --save-dev
</code></pre>
运行webpack 出现错误，后来查了babel-loader需要安装babel-preset-es2015包依赖
<pre><code>
cnpm install babel-preset-es2015 --save-dev
</code></pre>
### 安装html-webpack-plugin 插件
<pre><code>
cnpm install html-webpack-plugin --save-dev
</code></pre>
> 此插件可以自动生成html文件，可设置模板，生成html文件名，等页面信息
**在webpack.config.js增加如下信息**
<pre><code>
var path = require('path');
//文件头部获取插件类名
var HtmlWebpackPlugin = require('html-webpack-plugin');
......
module.exports = {
//添加插件数组
plugins: [
new HtmlWebpackPlugin({
filename: 'index-release.html',
title: "hello world",
template: path.resolve('my-index.ejs'),
inject: 'body'
})
]
}
cnpm install html-webpack-plugin --save-dev
</code></pre>
**新建模板文件 my-index.ejs**
<pre><code>
<!DOCTYPE html>
<html>
<head>
<meta http-equiv="Content-type" content="text/html; charset=utf-8"/>
<title><%= htmlWebpackPlugin.options.title %></title>
</head>
<body>
</body>
</html>
</code></pre> | 19.150943 | 99 | 0.606897 | yue_Hant | 0.258795 |
61af7cafe6922af427ec4bcec6587d648a23555f | 337 | md | Markdown | _Resaen/obj10.md | ResaenS/wax-main | b1095d87f990bed873c73ab9ce0a23badcc602b3 | [
"MIT"
] | null | null | null | _Resaen/obj10.md | ResaenS/wax-main | b1095d87f990bed873c73ab9ce0a23badcc602b3 | [
"MIT"
] | null | null | null | _Resaen/obj10.md | ResaenS/wax-main | b1095d87f990bed873c73ab9ce0a23badcc602b3 | [
"MIT"
] | null | null | null | ---
pid: obj10
label: A Tempest
artist: Aime Cesaire
_date: '1977'
location: Martinique
order: '09'
layout: Resaen_item
collection: Resaen
thumbnail: "/img/derivatives/iiif/images/obj10/full/250,/0/default.jpg"
full: "/img/derivatives/iiif/images/obj10/full/1140,/0/default.jpg"
manifest: "/img/derivatives/iiif/obj10/manifest.json"
---
| 24.071429 | 71 | 0.759644 | fra_Latn | 0.100905 |
61b0d732fd4427b069fe18aa076297f8e537ef7a | 2,350 | md | Markdown | docsrc/parsers/count.md | Barandis/kessel | 1e9c2e2387a24b212c180fee25cc456c6260439e | [
"MIT"
] | null | null | null | docsrc/parsers/count.md | Barandis/kessel | 1e9c2e2387a24b212c180fee25cc456c6260439e | [
"MIT"
] | null | null | null | docsrc/parsers/count.md | Barandis/kessel | 1e9c2e2387a24b212c180fee25cc456c6260439e | [
"MIT"
] | null | null | null | <!--
Copyright (c) 2020 Thomas J. Otterson
This software is released under the MIT License.
https://opensource.org/licenses/MIT
-->
> `count(p: Parser, n: number, m?: string): Parser`
Applies a parser a certain number of times, collecting the results into an array to return.
The parser `p` must succeed the full `n` times for `count` to succeed. Any fewer successes results in failure.
As with other combinators that run multiple parsers, it's possible for `count` to fail fatally even if the parser that failed did not fail fatally (because, for example, an earlier success consumed some input). There is another version of this parser, [`bcount`](bcount.md), that will backtrack and fail non-fatally when this happens.
#### Example
```javascript
const parser = count(letter(), 3)
const s = parse(parser, 'abc')
console.log(status(s)) // "ok"
console.log(success(s)) // ["a", "b", "c"]
const f = parse(parser, '123')
console.log(status(f)) // "fail"
console.log(failure(f)) // Parse error at (line 1, column 1):
//
// 123
// ^
// Expected a letter
const t = parse(parser, 'ab3')
console.log(status(t)) // "fatal"
console.log(failure(t)) // Parse error at (line 1, column 3):
//
// ab3
// ^
// Expected a letter
```
#### Parameters
* `p`: The parser to apply. Its results are returned in an array.
* `n`: The number of times that `p` is applied.
* `m`: The optional expected error message that will take the place of the default error message.
#### Success
* Succeeds if `p` succeeds `n` times. The results are collected into an array and returned.
#### Failure
* Fails if `p` does not succeed at least once.
* Fails if `p` succeeds at least once but not `n` times and if the prior successes of do not consume any input.
#### Fatal Failure
* Fails fatally if `p` fails fatally.
* Fails fatally if `p` does not succeed `n` times and if prior successes consume some input.
#### Throws
* Throws an error if `p` is not a parser.
* Throws an error if `n` is not a number.
* Throws an error if `m` exists and is not a string.
#### See Also
* [`Parser`](../types/parser.md)
* [`bcount`](bcount.md)
* [`opt`](opt.md)
* [`seq`](seq.md) | 32.191781 | 334 | 0.630638 | eng_Latn | 0.991016 |
61b10eccff4803adede1f7683b7422ea25cd76e4 | 585 | md | Markdown | docs/doc/30-reference/20-functions/20-numeric-functions/degrees.md | zhyass/databend | e54bef9ef4f6cb8c4a9c0b7be177f738f0cb7330 | [
"Apache-2.0"
] | null | null | null | docs/doc/30-reference/20-functions/20-numeric-functions/degrees.md | zhyass/databend | e54bef9ef4f6cb8c4a9c0b7be177f738f0cb7330 | [
"Apache-2.0"
] | 44 | 2021-09-27T16:06:47.000Z | 2022-03-28T16:09:27.000Z | docs/doc/30-reference/20-functions/20-numeric-functions/degrees.md | leiysky/databend | 36ac920bdced41760fdaba7874b4e2b8bc8ae78a | [
"Apache-2.0"
] | null | null | null | ---
title: DEGREES
description: DEGREES(x) function
---
Returns the argument x, converted from radians to degrees.
## Syntax
```sql
DEGREES(x)
```
## Arguments
| Arguments | Description |
| ----------- | ----------- |
| x | The angle, in radians. |
## Return Type
A Float64 data type value.
## Examples
```sql
SELECT DEGREES(PI());
+---------------+
| DEGREES(PI()) |
+---------------+
| 180 |
+---------------+
SELECT DEGREES(PI() / 2);
+---------------------+
| DEGREES((PI() / 2)) |
+---------------------+
| 90 |
+---------------------+
```
| 13.928571 | 58 | 0.423932 | yue_Hant | 0.395494 |
61b128a2f2a595ff45522d29b0ea155e0ee4bd81 | 655 | md | Markdown | docs/FieldEEzsigntemplateformfieldgroupTooltipposition.md | ezmaxinc/eZmax-SDK-python | 6794b8001abfb7d9ae18a3b87aba164839b925a0 | [
"MIT"
] | null | null | null | docs/FieldEEzsigntemplateformfieldgroupTooltipposition.md | ezmaxinc/eZmax-SDK-python | 6794b8001abfb7d9ae18a3b87aba164839b925a0 | [
"MIT"
] | null | null | null | docs/FieldEEzsigntemplateformfieldgroupTooltipposition.md | ezmaxinc/eZmax-SDK-python | 6794b8001abfb7d9ae18a3b87aba164839b925a0 | [
"MIT"
] | null | null | null | # FieldEEzsigntemplateformfieldgroupTooltipposition
The location of the tooltip relative to the Ezsigntemplateformfieldgroup's location.
## Properties
Name | Type | Description | Notes
------------ | ------------- | ------------- | -------------
**value** | **str** | The location of the tooltip relative to the Ezsigntemplateformfieldgroup's location. | must be one of ["TopLeft", "TopCenter", "TopRight", "MiddleLeft", "MiddleRight", "BottomLeft", "BottomCenter", "BottomRight", ]
[[Back to Model list]](../README.md#documentation-for-models) [[Back to API list]](../README.md#documentation-for-api-endpoints) [[Back to README]](../README.md)
| 50.384615 | 241 | 0.674809 | eng_Latn | 0.402671 |
61b16f8e210bd5ce3097524ffe35b865334998b8 | 4,707 | md | Markdown | docs/grpc/javascript.md | rajeshnair2k/lnd | 9c0c8891316fde516b0ad9580e4b64161a53f9f8 | [
"MIT"
] | 6 | 2018-07-26T22:07:05.000Z | 2020-09-25T14:22:51.000Z | docs/grpc/javascript.md | rajeshnair2k/lnd | 9c0c8891316fde516b0ad9580e4b64161a53f9f8 | [
"MIT"
] | 2 | 2019-01-14T11:33:00.000Z | 2021-10-31T06:22:59.000Z | docs/grpc/javascript.md | rajeshnair2k/lnd | 9c0c8891316fde516b0ad9580e4b64161a53f9f8 | [
"MIT"
] | 2 | 2019-02-25T12:23:02.000Z | 2021-01-10T00:05:14.000Z | # How to write a simple `lnd` client in Javascript using `node.js`
### Setup and Installation
First, you'll need to initialize a simple nodejs project:
```
npm init (or npm init -f if you want to use the default values without prompt)
```
Then you need to install the Javascript grpc library dependency:
```
npm install grpc --save
```
You also need to copy the `lnd` `rpc.proto` file in your project directory (or
at least somewhere reachable by your Javascript code).
The `rpc.proto` file is [located in the `lnrpc` directory of the `lnd`
sources](https://github.com/lightningnetwork/lnd/blob/master/lnrpc/rpc.proto).
In order for the auto-generated code to compile successfully, you'll need to
comment out the following line:
```
//import "google/api/annotations.proto";
```
#### Imports and Client
Every time you work with Javascript gRPC, you will have to import `grpc`, load
`rpc.proto`, and create a connection to your client like so:
```js
var grpc = require('grpc');
var fs = require("fs");
// Lnd cert is at ~/.lnd/tls.cert on Linux and
// ~/Library/Application Support/Lnd/tls.cert on Mac
var lndCert = fs.readFileSync("~/.lnd/tls.cert");
var credentials = grpc.credentials.createSsl(lndCert);
var lnrpcDescriptor = grpc.load("rpc.proto");
var lnrpc = lnrpcDescriptor.lnrpc;
var lightning = new lnrpc.Lightning('localhost:10009', credentials);
```
### Examples
Let's walk through some examples of Javascript gRPC clients. These examples
assume that you have at least two `lnd` nodes running, the RPC location of one
of which is at the default `localhost:10009`, with an open channel between the
two nodes.
#### Simple RPC
```js
> lightning.getInfo({}, function(err, response) {
console.log('GetInfo:', response);
});
```
You should get something like this in your console:
```
GetInfo: { identity_pubkey: '03c892e3f3f077ea1e381c081abb36491a2502bc43ed37ffb82e264224f325ff27',
alias: '',
num_pending_channels: 0,
num_active_channels: 1,
num_peers: 1,
block_height: 1006,
block_hash: '198ba1dc43b4190e507fa5c7aea07a74ec0009a9ab308e1736dbdab5c767ff8e',
synced_to_chain: false,
testnet: false,
chains: [ 'bitcoin' ] }
```
#### Response-streaming RPC
```js
var call = lightning.subscribeInvoices({});
call.on('data', function(invoice) {
console.log(invoice);
})
.on('end', function() {
// The server has finished sending
})
.on('status', function(status) {
// Process status
console.log("Current status" + status);
});
```
Now, create an invoice for your node at `localhost:10009`and send a payment to
it from another node.
```bash
$ lncli addinvoice --value=100
{
"r_hash": <RHASH>,
"pay_req": <PAYMENT_REQUEST>
}
$ lncli sendpayment --pay_req=<PAYMENT_REQUEST>
```
Your Javascript console should now display the details of the recently satisfied
invoice.
#### Bidirectional-streaming RPC
This example has a few dependencies:
```shell
npm install --save async lodash bytebuffer
```
You can run the following in your shell or put it in a program and run it like
`node script.js`
```js
// Load some libraries specific to this example
var async = require('async');
var _ = require('lodash');
var ByteBuffer = require('bytebuffer');
var dest_pubkey = <RECEIVER_ID_PUBKEY>;
var dest_pubkey_bytes = ByteBuffer.fromHex(dest_pubkey);
// Set a listener on the bidirectional stream
var call = lightning.sendPayment();
call.on('data', function(payment) {
console.log("Payment sent:");
console.log(payment);
});
call.on('end', function() {
// The server has finished
console.log("END");
});
// You can send single payments like this
call.write({ dest: dest_pubkey_bytes, amt: 6969 });
// Or send a bunch of them like this
function paymentSender(destination, amount) {
return function(callback) {
console.log("Sending " + amount + " satoshis");
console.log("To: " + destination);
call.write({
dest: destination,
amt: amount
});
_.delay(callback, 2000);
};
}
var payment_senders = [];
for (var i = 0; i < 10; i++) {
payment_senders[i] = paymentSender(dest_pubkey_bytes, 100);
}
async.series(payment_senders, function() {
call.end();
});
```
This example will send a payment of 100 satoshis every 2 seconds.
### Conclusion
With the above, you should have all the `lnd` related `gRPC` dependencies
installed locally in your project. In order to get up to speed with `protofbuf`
usage from Javascript, see [this official `protobuf` reference for
Javascript](https://developers.google.com/protocol-buffers/docs/reference/javascript-generated).
Additionally, [this official gRPC
resource](http://www.grpc.io/docs/tutorials/basic/node.html) provides more
details around how to drive `gRPC` from `node.js`.
| 27.852071 | 97 | 0.724028 | eng_Latn | 0.935003 |
61b249f165ffc3b9f9a5d4079e968291a04bde85 | 98 | md | Markdown | CONTRIBUTING.md | noddle0592/Summer | 615d167394b84b4b2ccc35ec1d304224ad70cbc1 | [
"MIT"
] | 68 | 2018-03-23T01:43:56.000Z | 2021-12-14T10:41:25.000Z | CONTRIBUTING.md | wlj5240/summer | ea4504bd0d1460564ac791bd75f2609e4b972569 | [
"MIT"
] | 3 | 2018-07-06T10:07:02.000Z | 2020-01-16T07:45:25.000Z | CONTRIBUTING.md | wlj5240/summer | ea4504bd0d1460564ac791bd75f2609e4b972569 | [
"MIT"
] | 12 | 2018-04-14T07:41:16.000Z | 2021-02-11T02:19:22.000Z | - fork https://github.com/yale8848/Summer
- git checkout **`dev`**
- commit & push
- pull request
| 19.6 | 41 | 0.683673 | kor_Hang | 0.447317 |
61b2587092cf2562b1dc590dc3027bfbfe05ac6f | 8,836 | md | Markdown | articles/cognitive-services/Content-Moderator/try-review-api-review.md | ctkalleppally/azure-docs.de-de | d40425c12772e53250efeb064aea56c453474e96 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | articles/cognitive-services/Content-Moderator/try-review-api-review.md | ctkalleppally/azure-docs.de-de | d40425c12772e53250efeb064aea56c453474e96 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | articles/cognitive-services/Content-Moderator/try-review-api-review.md | ctkalleppally/azure-docs.de-de | d40425c12772e53250efeb064aea56c453474e96 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: Erstellen von Moderationsüberprüfungen über die REST-API-Konsole – Content Moderator
titleSuffix: Azure Cognitive Services
description: Verwenden Sie die Überprüfungs-API von Azure Content Moderator, um Bild- oder Textüberprüfungen für die Moderation durch Personen zu erstellen.
services: cognitive-services
author: PatrickFarley
manager: nitinme
ms.service: cognitive-services
ms.subservice: content-moderator
ms.topic: conceptual
ms.date: 03/18/2019
ms.author: pafarley
ms.openlocfilehash: 479c7c455f07d098edd327196803e85df24dfb6d
ms.sourcegitcommit: f28ebb95ae9aaaff3f87d8388a09b41e0b3445b5
ms.translationtype: HT
ms.contentlocale: de-DE
ms.lasthandoff: 03/30/2021
ms.locfileid: "96905131"
---
# <a name="create-human-reviews-api-console"></a>Erstellen von Überprüfungen durch Personen (API-Konsole)
In [Überprüfungen](./review-api.md#reviews) werden Inhalte gespeichert und angezeigt, damit Moderatoren auf sie zugreifen können. Wenn ein Benutzer eine Überprüfung abgeschlossen hat, werden die Ergebnisse an einen angegebenen Rückrufendpunkt gesendet. In diesem Artikel erfahren Sie, wie Sie Überprüfungen mithilfe der Überprüfungs-REST-APIs über die API-Konsole einrichten. Nachdem Sie sich mit der Struktur der APIs vertraut gemacht haben, können Sie diese Aufrufe bequem zu jeder REST-kompatiblen Plattform portieren.
## <a name="prerequisites"></a>Voraussetzungen
- Melden Sie sich auf der Website des [Content Moderator-Prüfungstools](https://contentmoderator.cognitive.microsoft.com/) an, oder erstellen Sie dort ein Konto.
## <a name="create-a-review"></a>Erstellen einer Überprüfung
Navigieren Sie zum Erstellen einer Überprüfung zur API-Referenzseite, und wählen Sie unter **[Review – Create](https://westus2.dev.cognitive.microsoft.com/docs/services/580519463f9b070e5c591178/operations/580519483f9b0709fc47f9c4)** (Überprüfung – Erstellen) die Schaltfläche für Ihre Schlüsselregion aus (diese finden Sie in der Endpunkt-URL auf der Seite **Anmeldeinformationen** des [Prüfungstools](https://contentmoderator.cognitive.microsoft.com/)). Dadurch wird die API-Konsole gestartet, über die Sie ganz einfach REST-API-Aufrufe erstellen und ausführen können.
### <a name="enter-rest-call-parameters"></a>Eingeben von REST-Aufrufparametern
Geben Sie Werte für **teamName** und **Ocp-Apim-Subscription-Key** ein:
- **teamName**: Die Team-ID, die Sie beim Einrichten Ihres Kontos für das [Prüfungstool](https://contentmoderator.cognitive.microsoft.com/) erstellt haben (zu finden im Feld **ID** auf der Seite „Anmeldeinformationen“ des Prüfungstools).
- **Ocp-Apim-Subscription-Key**: Ihr Content Moderator-Schlüssel. Diesen finden Sie auf der Registerkarte **Einstellungen** des [Prüfungstools](https://contentmoderator.cognitive.microsoft.com).
### <a name="enter-a-review-definition"></a>Eingeben einer Überprüfungsdefinition
Geben Sie im Feld **Anforderungstext** die JSON-Anforderung mit den folgenden Feldern ein:
- **Metadaten**: Die an Ihren Rückrufendpunkt zurückzugebenden benutzerdefinierten Schlüssel-Wert-Paare. Wenn dieser Schlüssel ein im [Prüfungstool](https://contentmoderator.cognitive.microsoft.com) definierter kurzer Code ist, wird er als Tag angezeigt.
- **Content:** Bei Bild- und Videoinhalten ist dies eine URL-Zeichenfolge, die auf die Inhalte verweist. Bei Textinhalten ist dies die eigentliche Textzeichenfolge.
- **ContentId**: Eine benutzerdefinierte Bezeichnerzeichenfolge. Diese Zeichenfolge wird an die API übergeben und durch den Rückruf zurückgegeben. Sie ist nützlich, um interne Bezeichner oder Metadaten mit den Ergebnissen eines Moderationsauftrags zu verknüpfen.
- **CallbackEndpoint:** (Optional:) Die URL zum Empfangen von Rückrufinformationen, wenn die Überprüfung abgeschlossen ist.
Im Standardanforderungstext werden Beispiele für die verschiedenen Überprüfungen angezeigt, die Sie erstellen können:
```json
[Image]
[
{
"Metadata": [
{
"Key": "string",
"Value": "string"
}
],
"Type": "Image",
"Content": "<Content Url>",
"ContentId": "<Your identifier for this content>",
"CallbackEndpoint": "<Url where you would receive callbacks>"
}
]
[Text]
[
{
"Metadata": [
{
"Key": "string",
"Value": "string"
}
],
"Type": "Text",
"Content": "<Your Text Content>",
"ContentId": "<Your identifier for this content>",
"CallbackEndpoint": "<Url where you would receive callbacks>"
}
]
[Video]
[
{
"VideoFrames":[
{
"Id": "<Frame Id>",
"Timestamp": "<Frame Timestamp",
"FrameImage":"<Frame Image URL",
"Metadata": [
{
"Key": "<Key>",
"Value": "<Value"
}
],
"ReviewerResultTags": [
]
],
"Metadata": [
{
"Key": "string",
"Value": "string"
},
//For encrypted Videos
{
"Key": "protectedType",
"Value": "AES or FairPlay or Widevine or Playready"
},
{
"Key": "authenticationToken",
"Value": "your viewtoken(In case of Video Indexer AES encryption type, this value is viewtoken from breakdown json)"
},
//For FairPlay encrypted type video include certificateUrl as well
{
"Key": "certificateUrl",
"Value": "your certificate url"
}
],
"Type": "Video",
"Content": "<Stream Url>",
"ContentId": "<Your identifier for this content>",
"CallbackEndpoint": "<Url where you would receive callbacks>",
[Optional]
"Timescale": "<Timescale of the video>
}
]
```
### <a name="submit-your-request"></a>Senden der Anforderung
Wählen Sie **Senden** aus. Wenn der Vorgang erfolgreich ist, lautet der **Antwortstatus**`200 OK`, und im Feld **Antwortinhalt** wird eine ID für die Überprüfung angezeigt. Kopieren Sie diese ID für die folgenden Schritte.
### <a name="examine-the-new-review"></a>Untersuchen der neuen Überprüfung
Wählen Sie im [Prüfungstool](https://contentmoderator.cognitive.microsoft.com) die Optionen **Überprüfung** > **Bild**/**Text**/**Video** aus (abhängig vom verwendeten Inhalt). Der hochgeladene Inhalt sollte angezeigt werden und kann durch Personen überprüft werden.
## <a name="get-review-details"></a>Abrufen von Bewertungsdetails
Um Details zu einer vorhandenen Überprüfung abzurufen, navigieren Sie zur API-Referenzseite, und wählen Sie unter [Review – Get](https://westus2.dev.cognitive.microsoft.com/docs/services/580519463f9b070e5c591178/operations/580519483f9b0709fc47f9c2) (Überprüfung – Abrufen) die Schaltfläche für Ihre Region aus (die Region, in der Ihr Schlüssel verwaltet wird).
Geben Sie die REST-Aufrufparameter wie im obigen Abschnitt ein. In diesem Schritt haben Sie beim Erstellen der Überprüfung **reviewId** als eindeutige ID-Zeichenfolge erhalten.
Wählen Sie **Senden** aus. Wenn der Vorgang erfolgreich ist, lautet der **Antwortstatus**`200 OK`, und im Feld **Antwortinhalt** werden die Überprüfungsdetails im JSON-Format wie folgt angezeigt:
```json
{
"reviewId":"201712i46950138c61a4740b118a43cac33f434",
"subTeam":"public",
"status":"Complete",
"reviewerResultTags":[
{
"key":"a",
"value":"False"
},
{
"key":"r",
"value":"True"
},
{
"key":"sc",
"value":"True"
}
],
"createdBy":"<teamname>",
"metadata":[
{
"key":"sc",
"value":"true"
}
],
"type":"Image",
"content":"https://reviewcontentprod.blob.core.windows.net/<teamname>/IMG_201712i46950138c61a4740b118a43cac33f434",
"contentId":"0",
"callbackEndpoint":"<callbackUrl>"
}
```
Beachten Sie folgende Felder in der Antwort:
- **status**
- **reviewerResultTags:** Wird angezeigt, wenn vom Überprüfungsteam (angegeben im Feld **createdBy**) manuell Markierungen hinzugefügt wurden.
- **metadata:** Hier werden die ursprünglich in der Überprüfung hinzugefügten Markierungen angezeigt, bevor das Überprüfungsteam Änderungen vorgenommen hat.
## <a name="next-steps"></a>Nächste Schritte
In dieser Anleitung haben Sie erfahren, wie Inhaltsmoderationsüberprüfungen mithilfe der REST-API erstellt werden. Als Nächstes integrieren Sie Überprüfungen in ein End-to-End-Moderationsszenario, z. B. das im Tutorial [E-Commerce-Moderation](./ecommerce-retail-catalog-moderation.md). | 45.312821 | 569 | 0.719896 | deu_Latn | 0.958177 |
61b26502aa6a9265b5322de8a9369a086041bfff | 10,673 | md | Markdown | README.md | Hyped-Git-Workshop/Team19 | 77930c73bb49b25d25c6d00f4949e2c4b4b4e748 | [
"OML",
"CECILL-B"
] | null | null | null | README.md | Hyped-Git-Workshop/Team19 | 77930c73bb49b25d25c6d00f4949e2c4b4b4e748 | [
"OML",
"CECILL-B"
] | null | null | null | README.md | Hyped-Git-Workshop/Team19 | 77930c73bb49b25d25c6d00f4949e2c4b4b4e748 | [
"OML",
"CECILL-B"
] | null | null | null | # Git Exercise
1. Each person in the pair needs to `git clone` this repo
2. Decide, who is Person A and who is Person B
3. Tasks will be appearing below. After you complete one, another one appears. There is 10 in total.
4. First 6 tasks are always only for one person (it alternates between A and B)
5. In the remaining tasks, you will work in parallel and might even need to resolve some conflicts.
## Tasks
1. Person A - `pod.cpp` - Name your pod
* Open `pod.cpp` file and locate TASK 1
* Type the name for your pod inside the double-quotes (you should discuss the choice of the name with your teammate)
2. Person B - `pod.cpp` - Choose max speed
* Open `pod.cpp` file and locate TASK 2
* Tell us what the max speed of your pod is by replacing the 0 in the code with a real number
3. Person A - `pod.h` and `pod.cpp` - Tempereture inside the pressure vessel
* Open `pod.h`, locate place for TASKS 3&4 and copy-paste the following line there
```c++
double get_temperature();
```
* Open `pod.cpp`, locate place for TASKS 3&4 and copy-paste the following code there. Change the 0 to something else.
```c++
double Pod::get_temperature()
{
return 0;
}
```
* When done, commit both files in a single commit (ofc don't forget push and stuff as always)
4. Person B - `pod.h` and `pod.cpp` - Pressure inside the pressure vessel
* Open `pod.h`, locate place for TASKS 3&4 and copy-paste the following line below the one from previous task
```c++
double get_pressure();
```
* Open `pod.cpp`, locate place for TASKS 3&4, copy the following code and paste it below the function from previous task. Change the 0 to something else.
```c++
double Pod::get_pressure()
{
return 0;
}
```
* When done, commit both files in a single commit (ofc don't forget push and stuff as always)
5. Person A - `main.cpp` and `Makefile` - Main executable
* Create a new file called `main.cpp` and copy the following code to it
```c++
#include <iostream>
#include "pod.h"
int main()
{
Pod pod;
std::cout << "Name: " << pod.get_name() << std::endl;
std::cout << "Maximum speed: " << pod.get_max_speed() << std::endl;
std::cout << "Temperature: " << pod.get_temperature() << std::endl;
std::cout << "Pressure: " << pod.get_pressure() << std::endl;
return 0;
}
```
* Open `Makefile`, locate place for TASK 5 and uncomment the code there to get something like
```mk
main : main.o pod.o bms.o navigation.o accelerometer.o
$(CC) $(OBJS) $(LFLAGS) main.o -o main
main.o : main.cpp pod.h bms.h navigation.h accelerometer.h
$(CC) $(CFLAGS) main.cpp
```
* Notice the difference in the output of `git status` for the newly created file
* Commit `main.cpp` and `Makefile` in separate commits
6. Person B - `bms.cpp`, `bms.h` and `Makefile` - Battery management system
* Create a new file called `bms.h` and copy the following code to it
```c++
#ifndef HYPED_GIT_WSHOP_BMS_H
#define HYPED_GIT_WSHOP_BMS_H
class BatteryManagementSystem
{
public:
BatteryManagementSystem();
/// TASKS 9 (BOTH) /////////////////////////////////////////////////////////
/// END OF TASKS 9AB ///////////////////////////////////////////////////////
};
#endif //HYPED_GIT_WSHOP_BMS_H
```
* Create a new file called `bms.cpp` and copy the following code to it
```c++
#include "bms.h"
BatteryManagementSystem::BatteryManagementSystem()
{
}
/// TASK 9 (BOTH) //////////////////////////////////////////////////////////////
/// END OF TASKS 9AB ///////////////////////////////////////////////////////////
```
* Open `Makefile`, locate place for TASK 6 and uncomment the code there to get something like
```mk
bms.o : bms.cpp bms.h
$(CC) $(CFLAGS) bms.cpp
```
* Notice the difference in the output of `git status` for the newly created file
* Commit `bms.h` and `bms.cpp` in one commit and `Makefile` in separate commits
7. **CHANGE: both people work simultaneously on different pieces of code from now on** - Person B `git push`es first
- Person A - `accelerometer.h` - Define accelerometer's error
* Open `accelerometer.h`, locate place for TASK 7 and edit the line so that it looks something like below (0 is best but also most boring)
```c++
double error = <real_number_here>;
```
* Wait for your teammate to `git push` before you `git pull --rebase`
- Person B - `navigation.cpp` - Implement way for adding accelerometers to the navigation system
* Open `navigation.cpp`, locate the place for TASK 7 and copy the following code there
```c++
this->accelerometers.push_back(a);
```
8. Person A `git push`es first
- Person A - `navigation.cpp` - Implement calculation of velocity from acceleration
* Open `navigation.cpp`, locate the place for your part of TASK 8 (inside `get_velocity()` function) and copy the following code there
```c++
double a = this->get_acceleration();
this->velocity += a*DT; //integrate
return this->velocity;
```
- Person B - `navigation.cpp` - Implement calculation of position from velocity
* Open `navigation.cpp`, locate the place for your part of TASK 8 (inside `get_position()` function) and copy the following code there
```c++
double v = this->get_velocity();
this->position += v*DT; //integrate
return this->position;
```
* Wait for your teammate to `git push` before you `git pull --rebase`
9. Person B `git push`es first
- Person A - `bms.h` and `bms.cpp` - Sensing voltage
* Open `bms.h`, locate place for TASK 9 and copy the following code there
```c++
double get_voltage();
```
* Open `bms.cpp`, locate place for TASK 9 and copy the following code there. Change the 0 to something else.
```c++
double BatteryManagementSystem::get_voltage()
{
return 0;
}
```
* Commit both files in a single commit
* Wait for your teammate to `git push` before you `git pull --rebase`
* **SLOW DOWN** You've got a conflict. Now go and carefully resolve it. Take your time.
- Person B - `bms.h` and `bms.cpp` - Sensing current
* Open `bms.h`, locate place for TASK 9 and copy the following code there
```c++
double get_current();
```
* Open `bms.cpp`, locate place for TASK 9 and copy the following code there. Change the 0 to something else.
```c++
double BatteryManagementSystem::get_current()
{
return 0;
}
```
10. Person A `git push`es first
- Person A - `pod.h` and `Makefile` - Integrate battery management system with the pod
* Open `pod.h`, locate TASK 10.1, and include the BMS header by copying the following code
```c++
#include "bms.h"
```
* Locate TASK 10.2 and declare the BMS field as follows
```c++
BatteryManagementSystem bms;
```
* Open `Makefile`
* Append ```bms.h``` to the lines starting with ```pod.o :``` and ```main.o :```
* Append ```bms.o``` to the lines starting with ```main :``` and ```OBJS = ```
- Person B - `pod.h`, `pod.cpp` and `Makefile` - Integrate navigation system with the pod
* Open `pod.h`, locate TASK 10.1, and include the navigation header by copying the following code
```c++
#include "navigation.h"
```
* Locate TASK 10.2 and declare the nav field as follows
```c++
Navigation nav;
```
* Open `pod.cpp`, locate TASK 10, and initialize the navigation system with one accelerometer as follows
```c++
this->nav.add_accelerometer(new Accelerometer);
```
* Open `Makefile`
* Append ```navigation.h``` to the lines starting with ```pod.o :``` and ```main.o :```
* Append ```navigation.o``` to the lines starting with ```main :``` and ```OBJS = ```
* Wait for your teammate to `git push` before you `git pull --rebase`
* **SLOW DOWN** You've got some conflicts. Now go and carefully resolve them. Take your time.
### Summary of tasks
|Task # | Person A | Person B |
|:----|--------------------------------------------------------------------|--------------------------------------------------------------|
| 1 | Name your pod - edit `pod.cpp` | |
| 2 | | Max speed - edit `pod.cpp` |
| 3 | Pressure vessel temperature - edit `pod.h` and `pod.cpp` | |
| 4 | | Pressure vessel pressure - edit `pod.h` and `pod.cpp` |
| 5 | Create `main.cpp` and update `Makefile` | |
| 6 | | BMS - create `bms.cpp` and `bms.h` and update `Makefile` |
| 7 | Accelerometer error - edit `accelerometer.h`<br>`git pull --rebase` | Edit `navigation.cpp` - adding accelerometers |
| 8 | Edit `navigation.cpp` - get velocity | Edit `navigation.cpp` - get position<br>`git pull -- rebase` |
| 9 | Edit `bms.h` and `bms.cpp` - get voltage<br>`git pull --rebase` & resolve conflicts | Edit `bms.h` and `bms.cpp` - get current |
| 10 | Integrate BMS to pod - edit `pod.h` and `Makefile` | Integrate navigation to pod - edit `pod.h`, `pod.cpp` and `Makefile`<br>`git pull --rebase` & resolve conflicts |
| 51.066986 | 190 | 0.531434 | eng_Latn | 0.961173 |
61b288a0f2d131969b86011cad5145c67e0fb421 | 2,738 | markdown | Markdown | _posts/2020-04-27-up_in_the_clouds_-_aws.markdown | kclunie/kclunie.github.io | 5dcc5aef0addbb5edce33e59f21576df3337112c | [
"MIT"
] | null | null | null | _posts/2020-04-27-up_in_the_clouds_-_aws.markdown | kclunie/kclunie.github.io | 5dcc5aef0addbb5edce33e59f21576df3337112c | [
"MIT"
] | null | null | null | _posts/2020-04-27-up_in_the_clouds_-_aws.markdown | kclunie/kclunie.github.io | 5dcc5aef0addbb5edce33e59f21576df3337112c | [
"MIT"
] | null | null | null | ---
layout: post
title: "Up in the Clouds - AWS "
date: 2020-04-28 02:53:35 +0000
permalink: up_in_the_clouds_-_aws
---
There's so much buzz going around about AWS. So what exactly is it? Amazon Web Services is a global cloud platform that allows you to host and manage services on the internet. It's used by small start-ups to large enterprise companies to host their infrastructure and provide services to customers. They offer infrastructure service where they provide their servers as a service so you don't need to manage the back-up and power supply. They provide platform service where you can get Java, Ruby, or PHP as a service so you don't need to manage the binaries of these applications. There is also the option of software as a service (SaaS) for example, email sending capabilities like SES. AWS is a hosting provider that gives you a lot of services where you can run your applications on the cloud.
AWS' popularity stems from a few things. Their billing is simple. They offer per hour billing where every service and instance has a microbilling. They also include a billing dashboard with monthly report options based on services and paramters. Also quite simple is the sign-up process. There is no agreement, you just sign up with a credit card and email ID. You can launch your servers without buying hardware which is much more simple as well. You can be up and running in minutes. AWS is also known to be stable and trusted. They're outages are very minimal.
AWS offers some common, popular services:
* ES2 (Elastic Compute Cloud) is the most commonly used service. This service gives you bare servers that you can launch and run your software on.
* VPC (Virtual Private Cloud) lets you create networks in the cloud and run your servers in those networks. Since Amazon will not give up full control of their cloud, they offer pieces of their cloud.
* S3 (Simple Storage Service) is a file storage and sharing service.
* RDS (Relational Database Service) allows you to run and manage databases on the cloud using SQL or Oracle, for example.
* Route 53 is a service that manages domain name systems.
* ELB (Elastic Load Balancing) allows you to balance the load of incoming traffic to mulitple machines so your web applications can handle any number of users.
* Autoscaling adds capacity automatically to ELBs so that your app is never down due to a load.
AWS is in 15 regions across major countries around the world and has huge data centers that have 300,000-500,000 servers. With 64 services including infrastructure service, software as a service, platform as a service, machine learning services and continually launching new services, AWS is the top choice for doing anything on the cloud.
| 109.52 | 796 | 0.789262 | eng_Latn | 0.999855 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.