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 listlengths 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 listlengths 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 listlengths 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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
618d5532dd23d882b4c7b80bd432f1f5243a3126 | 1,990 | md | Markdown | AlchemyInsights/solutions-for-office-64-bit-or-32-bit-couldn-t-be-installed.md | isabella232/OfficeDocs-AlchemyInsights-pr.pt-PT | 90231c80c97b1b9ed11265c724351335698b74e2 | [
"CC-BY-4.0",
"MIT"
] | 1 | 2020-05-19T19:07:32.000Z | 2020-05-19T19:07:32.000Z | AlchemyInsights/solutions-for-office-64-bit-or-32-bit-couldn-t-be-installed.md | MicrosoftDocs/OfficeDocs-AlchemyInsights-pr.pt-PT | 0ab4044e197cacbe672dd3619523546c471d53c2 | [
"CC-BY-4.0",
"MIT"
] | 4 | 2020-06-02T23:16:58.000Z | 2022-02-09T06:59:55.000Z | AlchemyInsights/solutions-for-office-64-bit-or-32-bit-couldn-t-be-installed.md | isabella232/OfficeDocs-AlchemyInsights-pr.pt-PT | 90231c80c97b1b9ed11265c724351335698b74e2 | [
"CC-BY-4.0",
"MIT"
] | 4 | 2019-10-09T20:26:06.000Z | 2021-10-09T10:39:37.000Z | ---
title: Não foi Office a instalação das soluções para "Office (64 bits ou 32 bits)
ms.author: janellem
author: janellem
manager: scotv
ms.date: 04/21/2020
ms.audience: ITPro
ms.topic: article
ms.service: o365-administration
ROBOTS: NOINDEX, NOFOLLOW
localization_priority: Normal
ms.collection: Adm_O365
ms.custom:
- "905"
- "2000023"
ms.assetid: 5bfed1a3-473e-4e2d-acf0-9b1bbb08fa26
ms.openlocfilehash: 21c4ea922fd3e24c818cab441c9847c2ab8b3cdf6701a922fe30d284317d2291
ms.sourcegitcommit: b5f7da89a650d2915dc652449623c78be6247175
ms.translationtype: MT
ms.contentlocale: pt-PT
ms.lasthandoff: 08/05/2021
ms.locfileid: "53957255"
---
# <a name="solutions-for-office-64-bit-or-32-bit-couldnt-be-installed"></a>Soluções para "Office (64 bits ou 32 bits) não podiam ser instaladas
O erro "Office (64 bits ou 32 bits) não foi possível instalar" ocorre porque não pode misturar versões de 64 bits e de 32 bits do Office.
Para corrigir este erro e mudar de uma de 32 bits para uma de 64 bits, tem de fazer o seguinte pela seguinte ordem.
1. Transfira e instale o [Assistente de Recuperação e Suporte](https://aka.ms/SARA-OfficeUninstall-Alchemy).
1. Ao abrir, em **Desinstalar** produtos Office selecione a versão que pretende desinstalar e **selecione Seguinte.**
2. Progrida pelos ecrãs que vão aparecendo e reinicie o seu computador quando lhe for pedido.
Após reiniciar, a Assistente de Recuperação e Suporte abre automaticamente para concluir o processo de desinstalação.
3. Siga as restantes instruções e [reinstale a Office](https://portal.office.com/OLS/MySoftware.aspx) com a versão correta de 32 bits ou de 64 bits.
Siga os passos em [Instalar Office num PC](https://support.office.com/article/4414eaaf-0478-48be-9c42-23adc4716658?wt.mc_id=Alchemy_ClientDIA)
Para obter mais informações, consulte Erro "não foi Office [(64 bits ou 32 bits)"](https://support.office.com/article/2e2dc9e5-3eb0-420c-862a-ab085b38597f?wt.mc_id=Alchemy_ClientDIA) ao tentar instalar
| 46.27907 | 201 | 0.788442 | por_Latn | 0.985053 |
618d7ef43efbd421401b1a49b261079b11776689 | 280 | md | Markdown | README.md | AudioCommons/semantic-mappings-jamendo | ffdf48cf2b2c0427df8c691d169324f71f836f4a | [
"MIT"
] | null | null | null | README.md | AudioCommons/semantic-mappings-jamendo | ffdf48cf2b2c0427df8c691d169324f71f836f4a | [
"MIT"
] | null | null | null | README.md | AudioCommons/semantic-mappings-jamendo | ffdf48cf2b2c0427df8c691d169324f71f836f4a | [
"MIT"
] | null | null | null | # jamendo-to-audiocommons
Declarative adaptation of the Jamendo API for the Audio Commons Ecosystem
## Available queries
- **track_search_name**: to search tracks by name
- **playlist_search_name**: to search tracks by name
- **playlist_members**: to get the tracks in a plalist | 35 | 73 | 0.775 | eng_Latn | 0.986322 |
618d9f08446805951cb455fd8ff7bbe5309d1fb5 | 1,243 | md | Markdown | 2-resources/BLOG/PRACTICE-PROMPTS/curriculum2016/year1/units/unit1/projects/project1/README.md | impastasyndrome/Lambda-Resource-Static-Assets | 7070672038620d29844991250f2476d0f1a60b0a | [
"MIT"
] | null | null | null | 2-resources/BLOG/PRACTICE-PROMPTS/curriculum2016/year1/units/unit1/projects/project1/README.md | impastasyndrome/Lambda-Resource-Static-Assets | 7070672038620d29844991250f2476d0f1a60b0a | [
"MIT"
] | null | null | null | 2-resources/BLOG/PRACTICE-PROMPTS/curriculum2016/year1/units/unit1/projects/project1/README.md | impastasyndrome/Lambda-Resource-Static-Assets | 7070672038620d29844991250f2476d0f1a60b0a | [
"MIT"
] | 1 | 2021-11-05T07:48:26.000Z | 2021-11-05T07:48:26.000Z | #Unit 1: Project 1
#My First Website
##Scope
The project for this unit asks the student to create a webpage that includes text, a title, images and links. The students will push their project to GitHub and will finish the unit off with a three question unit challenge.
##Estimated Completion Time
This project should take one 45 minute period to complete. Projects may take more or less time depending on students' needs.
##Teacher Pro Tips
* Today will be the first day to introduce the students to the daily session doc (bit.ly/ScriptEd). The lead teacher must update the document and have students navigate to the link at the beginning of class.
<br>
| Starter code | Solution Code |
|-------|-------|
|This project does not contain any Starter Code. |[Solution Code](https://github.com/ScriptEdcurriculum/solutions2016/tree/master/year1/unit1/project1) (Private Repo) |
##[Google Slides](https://docs.google.com/presentation/d/1el_Ohy5n9a6RRTq_hEgtFa0rUUYhJenPrDfVAe3JUWs/edit?usp=sharing)
##Project Extensions
If students complete this project early, they are encouraged to add a list to their page. Students should be directed to Google "How to make a list in HTML" to do this.
| 42.862069 | 223 | 0.767498 | eng_Latn | 0.991226 |
618eecdf2a1f1a0891634b81adb8367b944b0f18 | 1,696 | md | Markdown | docs/odbc/reference/database-access-architecture.md | IsmaelArmas/sql-docs.es-es | 214db19ea9bd9ddaf26f7ae1274d5e8ba8277716 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/odbc/reference/database-access-architecture.md | IsmaelArmas/sql-docs.es-es | 214db19ea9bd9ddaf26f7ae1274d5e8ba8277716 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/odbc/reference/database-access-architecture.md | IsmaelArmas/sql-docs.es-es | 214db19ea9bd9ddaf26f7ae1274d5e8ba8277716 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: Arquitectura de acceso a la base de datos | Microsoft Docs
ms.custom: ''
ms.date: 01/19/2017
ms.prod: sql
ms.prod_service: connectivity
ms.reviewer: ''
ms.technology: connectivity
ms.topic: conceptual
helpviewer_keywords:
- ODBC [ODBC], database access
- standardizing database access [ODBC], about standardizing
- SQL [ODBC], database access
- database access [ODBC]
- standardizing database access [ODBC]
ms.assetid: 3811599f-48cb-4205-9fe5-5ab4b240047d
author: MightyPen
ms.author: genemi
manager: craigg
ms.openlocfilehash: 43c6ffd93020b1db1b90ad1768822075299d16b2
ms.sourcegitcommit: 2429fbcdb751211313bd655a4825ffb33354bda3
ms.translationtype: MT
ms.contentlocale: es-ES
ms.lasthandoff: 11/28/2018
ms.locfileid: "52527676"
---
# <a name="database-access-architecture"></a>Arquitectura de acceso a base de datos
Una de las preguntas en el desarrollo de ODBC era qué parte de la arquitectura de acceso de base de datos a estandarizar. Las interfaces de programación de SQL que se describen en la sección anterior, SQL incrustado, los módulos SQL y CLI - son solo una parte de esta arquitectura. De hecho, dado que ODBC se diseñó principalmente para conectarse a aplicaciones basadas en el equipo personal para minicomputadoras y mainframe DBMS, también había una serie de componentes de red, algunas de las cuales podrían estar estandarizado.
Esta sección contiene los temas siguientes.
- [Acceso a la base de datos de red](../../odbc/reference/network-database-access.md)
- [Arquitecturas de acceso a base de datos estándar](../../odbc/reference/standard-database-access-architectures.md)
- [La solución ODBC](../../odbc/reference/the-odbc-solution.md)
| 45.837838 | 531 | 0.78125 | spa_Latn | 0.869969 |
619035ec6aaf4e817f65775a490ea97468976718 | 21 | md | Markdown | README.md | sanspirit/Java | c3d47ed545faf84c6c1de554262d9da77236b26d | [
"MIT"
] | null | null | null | README.md | sanspirit/Java | c3d47ed545faf84c6c1de554262d9da77236b26d | [
"MIT"
] | null | null | null | README.md | sanspirit/Java | c3d47ed545faf84c6c1de554262d9da77236b26d | [
"MIT"
] | null | null | null | # Java
Java to learn
| 7 | 13 | 0.714286 | eng_Latn | 0.783031 |
619051d56cf7ce0c259031235da050a20a5bac06 | 51 | md | Markdown | content/FloorWire/StudsBetweenTextures.md | scriptis/types | 1dbc2c049b0577edefe95f6216b64fe3606a8542 | [
"MIT"
] | 2 | 2019-04-09T21:58:22.000Z | 2019-04-14T08:05:58.000Z | content/FloorWire/StudsBetweenTextures.md | scriptis/types | 1dbc2c049b0577edefe95f6216b64fe3606a8542 | [
"MIT"
] | null | null | null | content/FloorWire/StudsBetweenTextures.md | scriptis/types | 1dbc2c049b0577edefe95f6216b64fe3606a8542 | [
"MIT"
] | null | null | null | The number of studs between each FloorWire segment. | 51 | 51 | 0.843137 | eng_Latn | 0.999616 |
6190678991159add07883b6e7a0fd49cf90a8a4c | 21 | md | Markdown | notes/notes-ch-8.md | ItsMeijers/tiger-haskell | d166ba40a22127cf441620ba68780be72cbdf734 | [
"BSD-3-Clause"
] | null | null | null | notes/notes-ch-8.md | ItsMeijers/tiger-haskell | d166ba40a22127cf441620ba68780be72cbdf734 | [
"BSD-3-Clause"
] | null | null | null | notes/notes-ch-8.md | ItsMeijers/tiger-haskell | d166ba40a22127cf441620ba68780be72cbdf734 | [
"BSD-3-Clause"
] | null | null | null | # Notes on Chapter 8
| 10.5 | 20 | 0.714286 | eng_Latn | 0.839327 |
6190ce9434fb1c4d6f1422cb6625a9315860a577 | 3,675 | md | Markdown | _posts/2019-06-17-Download-english-for-tourism-and-hospitality-in-higher-education-studies-teachers-book-english-for-specific-a.md | Anja-Allende/Anja-Allende | 4acf09e3f38033a4abc7f31f37c778359d8e1493 | [
"MIT"
] | 2 | 2019-02-28T03:47:33.000Z | 2020-04-06T07:49:53.000Z | _posts/2019-06-17-Download-english-for-tourism-and-hospitality-in-higher-education-studies-teachers-book-english-for-specific-a.md | Anja-Allende/Anja-Allende | 4acf09e3f38033a4abc7f31f37c778359d8e1493 | [
"MIT"
] | null | null | null | _posts/2019-06-17-Download-english-for-tourism-and-hospitality-in-higher-education-studies-teachers-book-english-for-specific-a.md | Anja-Allende/Anja-Allende | 4acf09e3f38033a4abc7f31f37c778359d8e1493 | [
"MIT"
] | null | null | null | ---
layout: post
comments: true
categories: Other
---
## Download English for tourism and hospitality in higher education studies teachers book english for specific a book
selfishness was the most misunderstood, probably because the animal and run screaming, Enoch?" Kamchatka, "Hello. Especially in former times a great many Sometimes there were great rooms. They must be real. needed? " for her, viz, and then looked up, no one begrudged him his winnings. [So he fared on towards them] and when he drew near unto them, but only single words and expressions came through to me -- "loop flight," Robert Block off, a plaintive whistle high above us rent the unseen sky. interest expresses only in matters of survival, blond tresses lashing the air. how sorry I am, drawn by O. MI thought so at first, so maybe He decided to use the tool just three times on each deadbolt before trying the door. Half of me is sort of 24' 0" Long, downshifting with a hack and grind of protesting gear teeth. "Bertram, "now he makes you his reason for our meeting, and critical care to works that only abuse such shouting at him merely to distract his attention from the incident with the romance novel. The camera pulled back and angled down even more severely to reveal Noah's "вis it, but a dish of carefully-shelled oysters, and to calculate the radius of destruction of each burst, not headed directly toward them, the singing lasted longer than before. The co-op teacher monitors your studies, but but a life of the mind, fought one another in bloody and ruinous battles, either because her nerves were still ringing and her arms were weak--or because she was faking weakness in the hope of luring him to a reckless response, steadily reciting: "O anomaly eccentric. A trickle of blood crawled from the wound, the work was done in memory of his mother. On December 18, either, as she would have expected, the 1828, a plaintive whistle high above us rent the unseen sky. I don't buy the alien abduction for a second. " "Come now? There's still one number to go! 380 wood over a little fall of boulders. Sunlight had bleached the drapes into shades no "Listen, during the last summer season, orange-red Proxima Centauri with heavy absorption in the violet and prominent CO, L. His head appeared too large for his body, Sabine) B! " He might not have this future-living thing down perfectly, his composure regained. She's also smiling. Her bathing cap. " Angel asked. "Tomorrow I can bake another apple pie all for winter must be excessively severe; for when the reindeer in spring We english for tourism and hospitality in higher education studies teachers book english for specific a therefore imagine that at birth, only that it had all been brilliant and really cool, whereupon she made her stand behind the curtain and gave her to know that El Abbas was the king's son of Yemen and that english for tourism and hospitality in higher education studies teachers book english for specific a were his mamelukes. electroshocked snakehandler, of whose visit I have blood-revenge was now probably complete according to the where everyone spoke a single english for tourism and hospitality in higher education studies teachers book english for specific a and had all the blueberry pies they of the Arctic Ocean far beyond the sea which was opened by Chancelor moving far faster than prudence allowed, and as straight. Brother Hart which continue to prowl in their wake, they ate lunch. But it was already too late. I won't. The clumsy and year-round swimming. But he looked old. mother's expense: feelings she knew were not worthy of her, and left him so for The aide looked up from her work. | 408.333333 | 3,501 | 0.794014 | eng_Latn | 0.999956 |
61917778ef8ef23411eaa8227ffaaffff47f4182 | 426 | md | Markdown | packages/2012/readme.md | antonmedv/year | ae5d8524f58eaad481c2ba599389c7a9a38c0819 | [
"MIT"
] | 7 | 2017-07-03T19:53:01.000Z | 2021-04-05T18:15:55.000Z | packages/2012/readme.md | antonmedv/year | ae5d8524f58eaad481c2ba599389c7a9a38c0819 | [
"MIT"
] | 1 | 2018-09-05T11:53:41.000Z | 2018-12-16T12:36:21.000Z | packages/2012/readme.md | antonmedv/year | ae5d8524f58eaad481c2ba599389c7a9a38c0819 | [
"MIT"
] | 2 | 2019-01-27T16:57:34.000Z | 2020-10-11T09:30:25.000Z | # @year/2012
A year 2012
## Install
~~~
npm install @year/2012
~~~
## Usage
~~~js
const day = require('@year/2012/01/01')
~~~
Returns a [Date](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date) object.
## Related
* [@year/2011](https://github.com/antonmedv/year/tree/master/packages/2011)
* [@year/2013](https://github.com/antonmedv/year/tree/master/packages/2013)
## License
MIT
| 15.777778 | 111 | 0.697183 | yue_Hant | 0.52437 |
6191fe927bee6990c671b442a4e05c962d7ad5ea | 10,747 | markdown | Markdown | _posts/2012-11-20-clocked-combustor-can-array2.markdown | api-evangelist/patents-2012 | b40b8538ba665ccb33aae82cc07e8118ba100591 | [
"Apache-2.0"
] | 3 | 2018-09-08T18:14:33.000Z | 2020-10-11T11:16:26.000Z | _posts/2012-11-20-clocked-combustor-can-array2.markdown | api-evangelist/patents-2012 | b40b8538ba665ccb33aae82cc07e8118ba100591 | [
"Apache-2.0"
] | null | null | null | _posts/2012-11-20-clocked-combustor-can-array2.markdown | api-evangelist/patents-2012 | b40b8538ba665ccb33aae82cc07e8118ba100591 | [
"Apache-2.0"
] | 4 | 2018-04-05T13:55:08.000Z | 2022-02-10T11:30:07.000Z | ---
title: Clocked combustor can array
abstract: The present application provides a clocked combustor can array for coherence reduction in a gas turbine engine. The clocked combustor can array may include a number of combustor cans positioned in a circumferential array. A first set of the combustor cans may have a first orientation and a second set of the combustor cans may have a second orientation.
url: http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-adv.htm&r=1&f=G&l=50&d=PALL&S1=09546601&OS=09546601&RS=09546601
owner: General Electric Company
number: 09546601
owner_city: Schenectady
owner_country: US
publication_date: 20121120
---
This invention was made with Government support under grant number DE FC26 05NT42643 ARRA awarded by the Department of Energy. The Government has certain rights in the invention.
The present application and the resultant patent relate generally to gas turbine engines and more particularly relate to an array of non circular head end combustors arranged in a clocked configuration for coherence reduction and increased component life.
Combustor cans in a multiple can array may communicate acoustically with each other. Large pressure oscillations also known as combustion dynamics may result when heat release fluctuations couple with combustor can acoustic tones. Some of these combustor can acoustic tones may be in phase with the tones of an adjacent can while other tones may be out of phase. The in phase tones may excite the turbine blades in the hot gas path if the tones coincide with the natural frequency of the blades. The in phase tones may be particularly of concern when the instabilities in different combustor cans are coherent i.e. a strong relationship in the frequency and the amplitude of the instability in one can to the next can. Such coherent in phase tones may excite the turbine buckets so as to lead to durability issues and thereby limit the operability of the gas turbine engine.
Current solutions to these potentially damaging in phase coherent tones focus on combustor tuning. Such tuning may provide cans of different volume and length so as to limit the amplitude of the in phase coherent tones near the bucket natural frequencies as compared to typical design practice limits. These tuning techniques thus may mean that the overall operability space may be limited by the in phase coherent tones. Moreover a significant amount of time and resources may be required to achieve frequency avoidance between the combustor and the turbine components. Further frequency avoidance may only as accurate as the predictive capability used to achieve such.
There is thus a desire for improved systems and methods for coherence reduction between combustor components and turbine components without requiring combustor tuning and other types of conventional frequency avoidance techniques. Preferably such systems and methods may reduce overall coherence so as to improve component lifetime without compromising system efficiency and output and without requiring extensive modifications.
The present application and the resultant patent may provide a clocked combustor can array for coherence reduction in a gas turbine engine. The clocked combustor can array may include a number of combustor cans positioned in a circumferential array. A first set of the combustor cans may have a first orientation and a second set of the combustor cans may have a second orientation.
The present application and the resultant patent further may provide a method of operating a combustor can array with reduced coherence. The method may include the steps of positioning a first set of combustor cans at a first orientation operating the first set of combustor cans in a first tone positioning a second set of combustor cans at a second orientation and operating the second set of combustor cans in a second tone.
The present application and the resultant patent may provide a clocked combustor can array for coherence reduction in a gas turbine engine. The clocked combustor can array may include a number of combustor cans positioned in a circumferential array. Each of the combustor cans may include a non circular head end. A first set of the combustor cans may have a first orientation and a second set of the combustor cans may have a second orientation.
These and other features and improvements of the present application and the resultant patent will become apparent to one of ordinary skill in the art upon review of the following detailed description when taken in conjunction with the several drawings and the appended claims.
Referring now to the drawings in which like numerals refer to like elements throughout the several views shows a schematic diagram of gas turbine engine as may be used herein. The gas turbine engine may include a compressor . The compressor compresses an incoming flow of air . The compressor delivers the compressed flow of air to a number of combustor cans . The combustor cans mix the compressed flow of air with a pressurized flow of fuel and ignite the mixture to create a flow of hot combustion gases . Although only a single combustor can is shown the gas turbine engine may include any number of combustor cans . The flow of the hot combustion gases is in turn delivered to a turbine . The flow of the hot combustion gases drives the turbine so as to produce mechanical work. The mechanical work produced in the turbine drives the compressor via a shaft and an external load such as an electrical generator and the like.
The gas turbine engine may use natural gas various types of syngas and or other types of fuels. The gas turbine engine may be any one of a number of different gas turbine engines offered by General Electric Company of Schenectady N.Y. including but not limited to those such as a or a series heavy duty gas turbine engine and the like. The gas turbine engine may have different configurations and may use other types of components. Other types of gas turbine engines also may be used herein. Multiple gas turbine engines other types of turbines and other types of power generation equipment also may be used herein together.
The combustor can may include a head end . A number of fuel nozzles may extend from an end cover not shown to a cap . The combustor can also may be configured as an integrated piece . As described above the integrated piece may include the liner the transition piece and the first stage nozzle. The integrated piece may extend from the head end to an aft end about a first stage bucket blade of the turbine and the like. An impingement sleeve may surround the integrated piece so as to provide a flow of cooling air thereto from the compressor or elsewhere. Other components and other configurations also may be used herein.
The head end may have a substantially non circular configuration . The non circular configuration is not limited to any particular shape. The head end thus may be an oval head end an elliptical head end or any type of substantially non circular head end . Similarly the cap also may have the non circular configurations . As a result the cap may be an oval cap an elliptical cap or any type of substantially non circular cap . Likewise a transition piece of the integrated piece about the head end also may have the non circular configuration before transitioning into any other shape. As a result an oval transition piece an elliptical transition piece or any type of substantially non circular transition piece may be used herein. The combustor cans with the head end having the non circular configuration thus may promote a more efficient transition of the flow of hot combustion gases to the first stage bucket of the turbine with lower total pressure losses. Other components and other configurations also may be used herein.
For example shows a clocked combustor can array with a configuration that may be the reverse of that of the clocked combustor can array of . In this example ten 10 of the combustor cans may be the clocked combustor cans in the first orientation and the remaining six 6 combustor cans may be in their original or second orientation . Any combination of combustor cans in any orientation may be used herein. Other components and other configurations may be used herein.
In use the clocked combustor cans may mitigate interaction between combustor tones and the turbine buckets. As opposed to traditional combustor tuning approaches in which combustor cans of different volumes and lengths may be required for reducing coherence the clocked combustor arrays described herein maintain uniform combustor sizing while varying the clocking of the combustor cans . By altering the circumferential orientation with respect to neighboring combustor cans relative flame characteristics of the individual combustor cans may be effectively changed for reduced coherence.
Likewise entire arrays of combustor cans may be similarly oriented. shows a circumferential array with a number of combustor cans in five 5 around one 1 configuration having fuel nozzles with the clockwise configuration . shows a circumferential array with a number of combustor cans having the five 5 around one 1 orientation with a number of the center fuel nozzles having the counter clockwise orientation while the outer fuel nozzles have the clockwise orientation . shows a circumferential array with a number of combustor cans in the six 6 around zero 0 orientation . In this example the fuel nozzles of certain combustor cans may have the clockwise configuration while the others have the counter clockwise configuration . The circumferential arrays thus may have combustor cans with any configuration and with any type of fuel nozzles and swozzle vanes in any number position or direction.
In use the swozzle vanes may alter the flame characteristics flame to flame interactions and corresponding dynamics behavior in either an individual combustor or a circumferential array. Specifically the direction of the swozzle vanes or other types of vanes may be altered while the remaining hardware configurations may stay substantially unchanged. The use of the swozzle vanes and the like thus may be an alternative and a lower cost approach for coherence breaking as opposed to combustors with different volumes and lengths.
It should be apparent that the foregoing relates only to certain embodiments of the present application and the resultant patent. Numerous changes and modifications may be made herein by one of ordinary skill in the art without departing from the general spirit and scope of the invention as defined by the following claims and the equivalents thereof.
| 223.895833 | 1,031 | 0.821439 | eng_Latn | 0.9999 |
6192c34a7f3de6b9540c081c1acc6f45d01afab4 | 437 | md | Markdown | Old/Goals/FinalGoals.md | bradleypeterson/WeberStateEval | 7e345465844e66184a03fcdce5a972712b5041ae | [
"MIT"
] | null | null | null | Old/Goals/FinalGoals.md | bradleypeterson/WeberStateEval | 7e345465844e66184a03fcdce5a972712b5041ae | [
"MIT"
] | null | null | null | Old/Goals/FinalGoals.md | bradleypeterson/WeberStateEval | 7e345465844e66184a03fcdce5a972712b5041ae | [
"MIT"
] | null | null | null | ## Eval Group One Goals
### Dates: 8.8.2016 - 8.15.2016
- Merge Documentation between groups, and finalize all documentation, goal sheets, what has been completed and what still needs to be completed.
- Have the queries built for the User Permissions GUI completed. Attempt to finish the Front end, but based on the time constraint, that won't happen, so achieve as much as possible.
- Fix as many bugs as we can with the Pin Graph GUI
| 62.428571 | 182 | 0.76659 | eng_Latn | 0.999633 |
619313bee9953703acb39f75f7d17a93afe55650 | 784 | md | Markdown | sessions/need-more-computing-power.md | coding-club-linz/global-azure-bootcamp-2018 | 8cb1372441a4b5458eaed94e1d4b5b5b8a5b3eea | [
"MIT"
] | null | null | null | sessions/need-more-computing-power.md | coding-club-linz/global-azure-bootcamp-2018 | 8cb1372441a4b5458eaed94e1d4b5b5b8a5b3eea | [
"MIT"
] | null | null | null | sessions/need-more-computing-power.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: Need more computing power? No problem ... use Azure Batch!
speaker: Oliver Lintner
speaker-id: oliver-lintner
room: '15.05'
slot: 2
---
Outsourcing computational workloads to the cloud is getting more and more popular. Azure offers different services to fulfill all sorts of requirements and allowing users to leverage existing skills. One of these services is Azure Batch. Azure Batch, a platform service for running large-scale parallel and high-performance computing (HPC) applications efficiently in the cloud.
This sessions will provide a tour around Azure Batch. See how it works, what options are available to run workloads and how existing applications can be moved to Azure Batch - leveraging the power of the Azure cloud. | 60.307692 | 379 | 0.799745 | eng_Latn | 0.998398 |
6194063a784c114f27df0b49f3bf4552bf93547d | 62 | md | Markdown | build/content/papers/Z/Z19/Z19-2003.md | briemadu/semdial-proceedings | 59f13adcc73dc9433c3c07ee929fadd8d271b022 | [
"Apache-2.0"
] | null | null | null | build/content/papers/Z/Z19/Z19-2003.md | briemadu/semdial-proceedings | 59f13adcc73dc9433c3c07ee929fadd8d271b022 | [
"Apache-2.0"
] | null | null | null | build/content/papers/Z/Z19/Z19-2003.md | briemadu/semdial-proceedings | 59f13adcc73dc9433c3c07ee929fadd8d271b022 | [
"Apache-2.0"
] | 2 | 2021-09-16T07:16:15.000Z | 2021-10-30T06:41:55.000Z | ---
anthology_id: Z19-2003
title: The Science of Laughter
---
| 12.4 | 30 | 0.709677 | eng_Latn | 0.960021 |
6194a8b8597acdb3d5ed44cf2f0315370dd45f08 | 742 | md | Markdown | CHANGELOG.md | mike-engel/homebrew-jwt-cli | d7c48bf2a73652fef3ee8188d25090ca9390f22b | [
"MIT"
] | 1 | 2019-07-09T09:16:43.000Z | 2019-07-09T09:16:43.000Z | CHANGELOG.md | mike-engel/homebrew-jwt-cli | d7c48bf2a73652fef3ee8188d25090ca9390f22b | [
"MIT"
] | 1 | 2021-02-22T13:42:18.000Z | 2021-02-25T08:42:27.000Z | CHANGELOG.md | mike-engel/homebrew-jwt-cli | d7c48bf2a73652fef3ee8188d25090ca9390f22b | [
"MIT"
] | 1 | 2021-02-22T12:57:06.000Z | 2021-02-22T12:57:06.000Z | # 2021-11-14
Update for jwt-cli 5.0.0
# 2021-02-16
Update for jwt-cli 4.0.0
# 2020-09-11
Update for jwt-cli 3.2.1
# 2020-09-13
Fix archive for jwt-cli 3.2.0
# 2020-09-11
Update for jwt-cli 3.2.0
# 2020-04-17
Update for jwt-cli 3.1.0
# 2020-02-02
Update for jwt-cli 2.5.2
# 2019-10-07
Update for jwt-cli 2.5.1
# 2019-05-29
Update for jwt-cli 2.5.0
# 2019-04-19
Update for jwt-cli 2.4.0
# 2019-01-10
Update for jwt-cli 2.3.0
# 2018-11-28
Update for jwt-cli 2.2.1
# 2018-11-18
Update for jwt-cli 2.2.0
# 2018-09-24
Update for jwt-cli 2.1.0
# 2018-04-28
Update for jwt-cli 2.0.0
# 2017-09-05
Update for jwt-cli 1.2.0
# 2017-07-13
Update for jwt-cli 1.1.0
# 2017-07-13
Initial release with jwt-cli version 1.0.0
| 10.305556 | 42 | 0.657682 | yue_Hant | 0.550761 |
61953418a1bea289bbed09f466c87e59c6e0997e | 78 | md | Markdown | README.md | guidetheorient/100-imitation-effects-of-websites | 8f96da91f3e25ecfd28b92acd43f4fd0996f58a2 | [
"MIT"
] | null | null | null | README.md | guidetheorient/100-imitation-effects-of-websites | 8f96da91f3e25ecfd28b92acd43f4fd0996f58a2 | [
"MIT"
] | null | null | null | README.md | guidetheorient/100-imitation-effects-of-websites | 8f96da91f3e25ecfd28b92acd43f4fd0996f58a2 | [
"MIT"
] | null | null | null | # 100-imitation-effects-of-websites
imitation of delicate interaction effects
| 26 | 41 | 0.846154 | eng_Latn | 0.874909 |
6196b913dcb1fdc56228f04d3b895b954fe6874d | 232 | md | Markdown | france.code-civil/Livre III/Titre III/Article 1311.md | bradchesney79/illacceptanything | 4594ae4634fdb5e39263a6423dc255ed46c25208 | [
"MIT"
] | 2,986 | 2015-03-31T06:53:53.000Z | 2022-03-29T13:03:22.000Z | france.code-civil/Livre III/Titre III/Article 1311.md | bradchesney79/illacceptanything | 4594ae4634fdb5e39263a6423dc255ed46c25208 | [
"MIT"
] | 42 | 2015-03-31T08:46:31.000Z | 2020-11-01T11:28:43.000Z | france.code-civil/Livre III/Titre III/Article 1311.md | bradchesney79/illacceptanything | 4594ae4634fdb5e39263a6423dc255ed46c25208 | [
"MIT"
] | 243 | 2015-03-31T06:43:04.000Z | 2022-02-20T21:26:49.000Z | Article 1311
----
Il n'est plus recevable à revenir contre l'engagement qu'il avait souscrit en
minorité, lorsqu'il l'a ratifié en majorité, soit que cet engagement fût nul en
sa forme, soit qu'il fût seulement sujet à restitution.
| 38.666667 | 79 | 0.780172 | fra_Latn | 0.99078 |
6197724d8efdfd2397f07238953bef57d429c5b5 | 3,372 | markdown | Markdown | howto/index.markdown | genzel/gigaspaces-wiki-jekyll | 6f101054804a38a95cf471c35ec8dd9a88350297 | [
"Apache-2.0"
] | null | null | null | howto/index.markdown | genzel/gigaspaces-wiki-jekyll | 6f101054804a38a95cf471c35ec8dd9a88350297 | [
"Apache-2.0"
] | null | null | null | howto/index.markdown | genzel/gigaspaces-wiki-jekyll | 6f101054804a38a95cf471c35ec8dd9a88350297 | [
"Apache-2.0"
] | null | null | null | ---
layout: post
title: Authoring Guidelines
categories: HOWTO
---
* We use [Markdown](http://daringfireball.net/projects/markdown) as markup language for all the documentation pages. Please refer to [the markdown syntax guide](http://daringfireball.net/projects/markdown/syntax) for more details. That also means that all files should have the `.markdown` extension.
* All pages should start with a [yaml front matter](http://jekyllrb.com/docs/frontmatter/), which basically looks like this (See one of the existing pages under xap97 or xap97net for a full example):
{%raw%}
\---
layout: post
title: About Jini
weight: 100
categories: XAP97
\---
{%endraw%}
* `layout` refers to the page layout, which essentially determins the HTML elemenets that wrap the page content. The appropriate layout for every documentation page is `post`.
* `title` is the page title, as will appear in the page itself and the table of contents.
You don't need to refer to other elements if such exist.
{%comment%}
* XAP versions: each XAP version is placed under its own directory. For example, XAP 9.7 is placed under `xap97` and XAP.NET 9.7 is placed under `xap97net`.
* Images and other attached files: all images should placed under the directory `attachement_files`. Images and files that are shared between version should be placed at the root of this folder, images specific to a certain version (that you don't expect to be relevant to future versions) should be placed under a directory that has the same name (e.g. `xap97`).
* Special markup helpers (summary section, documentation links, code blocks, tabbed views, tips, info box, warning box, etc.) are described [below](#available-markup-helpers-jekyll-plugins).
* Tables can be created using the following syntax:
```
{: .table .table-bordered}
|Header1|Header2|Header3|
|:------|:------|:------|
|value1 |value2 |very long value in my table|
```
* HTML snippets: Markdown supports direct HTML injection, so you can always embed a complete html snippet to the page in case there's some formatting, markup or element that is not supported (e.g. embedding a slideshare deck).
## Available Markup Helpers (Jekyll Plugins)
The following table contains a list of available plugins and simple example for how to use each within markdown files. This is not an exhaustive list and contains only the main and most commonly used plugins, the entire set of plugins can be found in the [`_plugins`](_plugins) directory, and usage samples for all plugins can be found within the documentation pages.
* `align`
* `anchor`
* `bgcolor`
* `children`
* `cloack`
* `color`
* `comment`
* `currentversion`
* `dotnetdoc`
* `exclamation`
* `fontsize`
* `indent`
* `info`
* `infosign`
* `javadoc`
* `lampoff`
* `latestxaprelease`
* `lampon`
* `learn`
* `lozenge`
* `minus`
* `next`
* `note`
* `oksign`
* `panel`
* `plus`
* `question`
* `quote`
* `redirect`
* `refer`
* `remove`
* `scaladoc`
* `section`
* `star`
* `summary`
Creates a summary section at the top of the page. The section will include the text in the markup help, and shotcut links to all h1 titles in the page (every title which is prefixed by a single `#` sign).
* __Usage__:
```
{% summary %}This is a page summary.{% endsummary %}
```
* __Parameters__: None
* `tabs`
* `tip`
* `warning`
* `wbr`
* `whr`
{%endcomment%}
| 24.085714 | 367 | 0.720047 | eng_Latn | 0.997195 |
61979526c61f1b8599a43ca617664f6af05efbfd | 536 | md | Markdown | README.md | usbr/bmorph | ba5dbaee89833ddef02a17929d674ca2e5677337 | [
"MIT"
] | null | null | null | README.md | usbr/bmorph | ba5dbaee89833ddef02a17929d674ca2e5677337 | [
"MIT"
] | null | null | null | README.md | usbr/bmorph | ba5dbaee89833ddef02a17929d674ca2e5677337 | [
"MIT"
] | 1 | 2019-10-15T21:57:38.000Z | 2019-10-15T21:57:38.000Z | | [UW-Hydro/bmorph](https://github.com/UW-Hydro/bmorph) | [](https://travis-ci.org/UW-Hydro/bmorph) |
|----|----|
# bmorph
Bias correction for streamflow time series
Install by running
`python setup.py install`
in the top level directory
`./scripts/bmorph_tip304` contains an implementation of the method for the
TIP304 project. The script can be run as:
`bmorph_tip304 --cfg <configuration file> --verbose`
There is a sample configuration file in `./config`
| 31.529412 | 173 | 0.740672 | eng_Latn | 0.777419 |
619911e80828f63d96869ddd632bde8779bcdd54 | 1,763 | md | Markdown | _posts/2021-01-01-Template.md | JavaBookStudy/javabookstudy.github.io | ef4c8e022140b4f2e5d9c0259eab3fa1389b3929 | [
"MIT"
] | null | null | null | _posts/2021-01-01-Template.md | JavaBookStudy/javabookstudy.github.io | ef4c8e022140b4f2e5d9c0259eab3fa1389b3929 | [
"MIT"
] | null | null | null | _posts/2021-01-01-Template.md | JavaBookStudy/javabookstudy.github.io | ef4c8e022140b4f2e5d9c0259eab3fa1389b3929 | [
"MIT"
] | 1 | 2021-09-11T09:20:21.000Z | 2021-09-11T09:20:21.000Z | ---
title: "게시물 작성 방법"
subtitle: 게시물을 작성하는 Template입니다. 참고해 주세요
date: 2021-01-01 13:59:24 +0900
author: Your Name
toc:
categories: 기타
tags:
- temp Tag
toc: true
toc_sticky: true
---
> Java
아래와 같은 방법으로 하면 글을 작성하면 됩니다.
# 큰 제목
전체적인 글의 제목을 여기에 작성하시면 됩니다.
## 부 제목
각 항목 하나씩을 `##`을 붙혀서 작성하시면 됩니다.
### 소 제목
`##`내의 항목을 `###`으로 작성하면 됩니다.
## 포스트 정보 표시법(명칭이 기억안남)
아래와 같은 양식에 맞추어야 제대로 글이 올라갑니다.
```
title: "게시물 작성 방법" <- 주 제목을 써주세요
subtitle: 게시물을 작성하는 Template <- 부 제목을 써주세요
date: 2021-06-16 13:59:23 +0900 <- 날짜를 기록 해주세요
author: Your Name <- 저자를 적어주세요
toc:
categories: 기타 <- 카테고리를 적어주세요 Ex) 이펙티브 자바 : Effective_Java / 토비의 스프링 : Toby
tags:
- temp Tag <- 태그를 적어주세요
toc: true
toc_sticky: true
```
## 코드 작성 법
다음과 같이 코드를 작성하시면 됩니다.
```java
import java.util.*;
import java.io.*;
public class JavaBook {
public static void main(String[] args) throws IOException {
System.out.println("I'm Taxol");
return;
}
}
```
## 사진 등록 하는 법
사진 등록 및 크기 확인
크기 100%
<img src="/assets/images/sample/Spring-Time.jpg" width="100%" height="100%">
크기 40%
<img src="/assets/images/sample/Spring-Time.jpg" width="40%" height="40%">
## 지수 나타내기
2의 N승 : 2<sup>N</sup>
로그 2의 N: log<sub>2</sub>N
## 글 숨기기
<details>
<summary>숨길 글의 제목</summary>
<div markdown="1">
여기에 숨길 내용 작성
</div>
</details>
## 테이블 만들기
| | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 |
| --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- |
| T | 5 | 4 | 3 | 2 | 1 | 1 | 2 | 3 | 4 | 5 | x |
| P | 50 | 40 | 30 | 20 | 10 | 10 | 20 | 30 | 40 | 50 | x |
| DP | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 18.364583 | 97 | 0.505956 | kor_Hang | 0.999924 |
61997a947adb0e78da908a0e16476a3b0f662f26 | 218 | markdown | Markdown | _posts/2020-05-05-figure5.markdown | Sansuiz/books | 9a557f2b820221a2603c034c0717cc913637d0f4 | [
"MIT"
] | null | null | null | _posts/2020-05-05-figure5.markdown | Sansuiz/books | 9a557f2b820221a2603c034c0717cc913637d0f4 | [
"MIT"
] | null | null | null | _posts/2020-05-05-figure5.markdown | Sansuiz/books | 9a557f2b820221a2603c034c0717cc913637d0f4 | [
"MIT"
] | 2 | 2020-11-19T19:32:25.000Z | 2020-12-28T05:11:10.000Z | ---
layout: post
title: Figures
date: 2020-05-05 16:04:00 +0300
image: 15.jpg
tags: Figures
---
60 x 80
| 18.166667 | 80 | 0.408257 | fra_Latn | 0.082449 |
6199d7ff8c18fc563cabb56059149dce279629e5 | 109 | md | Markdown | README.md | RossNelsonn/RossNelsonn.github.io | b67191f75d809e3e83a073a43d1cb3aac1d1d856 | [
"MIT"
] | null | null | null | README.md | RossNelsonn/RossNelsonn.github.io | b67191f75d809e3e83a073a43d1cb3aac1d1d856 | [
"MIT"
] | null | null | null | README.md | RossNelsonn/RossNelsonn.github.io | b67191f75d809e3e83a073a43d1cb3aac1d1d856 | [
"MIT"
] | null | null | null | # [My Site](http://RossNelsonn.github.io)
A stylish and personable webpage to tell the world about yourself.
| 36.333333 | 66 | 0.770642 | eng_Latn | 0.952139 |
6199f8ff0b39799d88cbd29f6cc6ddfdea93500e | 2,161 | md | Markdown | upload/README.md | TYM1/TempUpload | f403ba719f630fe503ef709b184443d70d0b6286 | [
"Apache-2.0"
] | null | null | null | upload/README.md | TYM1/TempUpload | f403ba719f630fe503ef709b184443d70d0b6286 | [
"Apache-2.0"
] | null | null | null | upload/README.md | TYM1/TempUpload | f403ba719f630fe503ef709b184443d70d0b6286 | [
"Apache-2.0"
] | null | null | null | # Trust - Ethereum Wallet and Web3 DApp Browser for iOS
[](https://travis-ci.org/TrustWallet/trust-wallet-ios)
[](https://copilot.blackducksoftware.com/github/repos/TrustWallet/trust-wallet-ios/branches/master)
[](https://github.com/fastlane/fastlane/blob/master/LICENSE)
[<img src="https://raw.githubusercontent.com/TrustWallet/trust-wallet-ios/master/resources/iphone_cover.png">](https://itunes.apple.com/us/app/trust-ethereum-wallet/id1288339409)
[<img src=resources/app-store-badge.png height="88">](https://itunes.apple.com/us/app/trust-ethereum-wallet/id1288339409)
Welcome to Trust's open source iOS app!
## Getting Started
1. [Download](https://developer.apple.com/xcode/download/) the Xcode 9 release.
1. Clone this repository.
1. Run `make bootstrap` to install tools and dependencies.
## Contributing
We intend for this project to be an educational resource: we are excited to
share our wins, mistakes, and methodology of iOS development as we work
in the open. Our primary focus is to continue improving the app for our users in
line with our roadmap.
The best way to submit feedback and report bugs is to open a GitHub issue.
Please be sure to include your operating system, device, version number, and
steps to reproduce reported bugs. Keep in mind that all participants will be
expected to follow our code of conduct.
## Code of Conduct
We aim to share our knowledge and findings as we work daily to improve our
product, for our community, in a safe and open space. We work as we live, as
kind and considerate human beings who learn and grow from giving and receiving
positive, constructive feedback. We reserve the right to delete or ban any
behavior violating this base foundation of respect.
Help with localization?
Here is a public link to join localization project: https://lokalise.co/signup/3947163159df13df851b51.98101647/all/
| 52.707317 | 238 | 0.789912 | eng_Latn | 0.943948 |
619a1d4e3629d1946e045f36266f30d93fccc6e5 | 4,265 | md | Markdown | book/src/http/spec.md | dpdanpittman/lighthouse | cfe13718d6889046634abf2573b2eae6f9fc797c | [
"Apache-2.0"
] | 1 | 2021-06-15T06:52:07.000Z | 2021-06-15T06:52:07.000Z | book/src/http/spec.md | dpdanpittman/lighthouse | cfe13718d6889046634abf2573b2eae6f9fc797c | [
"Apache-2.0"
] | null | null | null | book/src/http/spec.md | dpdanpittman/lighthouse | cfe13718d6889046634abf2573b2eae6f9fc797c | [
"Apache-2.0"
] | 1 | 2021-07-19T14:56:43.000Z | 2021-07-19T14:56:43.000Z | # Lighthouse REST API: `/spec`
The `/spec` endpoints provide information about Eth2.0 specifications that the node is running.
## Endpoints
HTTP Path | Description |
| --- | -- |
[`/spec`](#spec) | Get the full spec object that a node's running.
[`/spec/slots_per_epoch`](#specslots_per_epoch) | Get the number of slots per epoch.
[`/spec/eth2_config`](#specseth2_config) | Get the full Eth2 config object.
## `/spec`
Requests the full spec object that a node's running.
### HTTP Specification
| Property | Specification |
| --- |--- |
Path | `/spec`
Method | GET
JSON Encoding | Object
Query Parameters | None
Typical Responses | 200
### Example Response
```json
{
"genesis_slot": 0,
"base_rewards_per_epoch": 4,
"deposit_contract_tree_depth": 32,
"max_committees_per_slot": 64,
"target_committee_size": 128,
"min_per_epoch_churn_limit": 4,
"churn_limit_quotient": 65536,
"shuffle_round_count": 90,
"min_genesis_active_validator_count": 16384,
"min_genesis_time": 1578009600,
"min_deposit_amount": 1000000000,
"max_effective_balance": 32000000000,
"ejection_balance": 16000000000,
"effective_balance_increment": 1000000000,
"genesis_fork_version": "0x00000000",
"bls_withdrawal_prefix_byte": "0x00",
"genesis_delay": 172800,
"milliseconds_per_slot": 12000,
"min_attestation_inclusion_delay": 1,
"min_seed_lookahead": 1,
"max_seed_lookahead": 4,
"min_epochs_to_inactivity_penalty": 4,
"min_validator_withdrawability_delay": 256,
"shard_committee_period": 2048,
"base_reward_factor": 64,
"whistleblower_reward_quotient": 512,
"proposer_reward_quotient": 8,
"inactivity_penalty_quotient": 33554432,
"min_slashing_penalty_quotient": 32,
"domain_beacon_proposer": 0,
"domain_beacon_attester": 1,
"domain_randao": 2,
"domain_deposit": 3,
"domain_voluntary_exit": 4,
"safe_slots_to_update_justified": 8,
"eth1_follow_distance": 1024,
"seconds_per_eth1_block": 14,
"boot_nodes": [],
"network_id": 1
}
```
## `/spec/eth2_config`
Requests the full `Eth2Config` object.
### HTTP Specification
| Property | Specification |
| --- |--- |
Path | `/spec/eth2_config`
Method | GET
JSON Encoding | Object
Query Parameters | None
Typical Responses | 200
### Example Response
```json
{
"spec_constants": "mainnet",
"spec": {
"genesis_slot": 0,
"base_rewards_per_epoch": 4,
"deposit_contract_tree_depth": 32,
"max_committees_per_slot": 64,
"target_committee_size": 128,
"min_per_epoch_churn_limit": 4,
"churn_limit_quotient": 65536,
"shuffle_round_count": 90,
"min_genesis_active_validator_count": 16384,
"min_genesis_time": 1578009600,
"min_deposit_amount": 1000000000,
"max_effective_balance": 32000000000,
"ejection_balance": 16000000000,
"effective_balance_increment": 1000000000,
"genesis_fork_version": "0x00000000",
"bls_withdrawal_prefix_byte": "0x00",
"genesis_delay": 172800,
"milliseconds_per_slot": 12000,
"min_attestation_inclusion_delay": 1,
"min_seed_lookahead": 1,
"max_seed_lookahead": 4,
"min_epochs_to_inactivity_penalty": 4,
"min_validator_withdrawability_delay": 256,
"shard_committee_period": 2048,
"base_reward_factor": 64,
"whistleblower_reward_quotient": 512,
"proposer_reward_quotient": 8,
"inactivity_penalty_quotient": 33554432,
"min_slashing_penalty_quotient": 32,
"domain_beacon_proposer": 0,
"domain_beacon_attester": 1,
"domain_randao": 2,
"domain_deposit": 3,
"domain_voluntary_exit": 4,
"safe_slots_to_update_justified": 8,
"eth1_follow_distance": 1024,
"seconds_per_eth1_block": 14,
"boot_nodes": [],
"network_id": 1
}
}
```
## `/spec/slots_per_epoch`
Requests the `SLOTS_PER_EPOCH` parameter from the specs that the node is running.
### HTTP Specification
| Property | Specification |
| --- |--- |
Path | `/spec/slots_per_epoch`
Method | GET
JSON Encoding | Number
Query Parameters | None
Typical Responses | 200
### Example Response
```json
32
``` | 27.694805 | 95 | 0.677374 | eng_Latn | 0.317207 |
619a3fc8553a8c128cbe861f3c1cc935708cd92b | 2,806 | md | Markdown | README.md | jshakespear/summer | 337fa89019642239e14db37ca902d7b1b36371a1 | [
"Unlicense"
] | null | null | null | README.md | jshakespear/summer | 337fa89019642239e14db37ca902d7b1b36371a1 | [
"Unlicense"
] | null | null | null | README.md | jshakespear/summer | 337fa89019642239e14db37ca902d7b1b36371a1 | [
"Unlicense"
] | 1 | 2019-08-19T08:58:50.000Z | 2019-08-19T08:58:50.000Z | # Summer
HTTP <-> File System Adapter. Interact with Linux file system via REST API calls.
## Usage
### Choose how to Install
#### Default Configuration
- Download `summer` from here - [https://github.com/dolftax/summer/releases/download/v1.0.0/summer](https://github.com/dolftax/summer/releases/download/v1.0.0/summer)
- Run `./summer`
#### Custom Configuration
- Clone `summer` repository
- Install [glide](https://github.com/Masterminds/glide#install)
- Run `cd summer && glide install`
- Populate `config.json` with necessary values
- Default values are
```
"appPort" - Application Port (Default: 9000)
"logger" - Enable/Disable access logs (Default: true)
"root" - Root Folder to be served (Default: "")
```
> Note: If you want to serve `/home/foo/` set `root` to `/home/foo` (Do not append forward slash `/`)
- Compile into binary by running `go build .`
- Run `./summer`
## API Docs
### Request
##### `GET /path/to/file`
Serve a file to the client as a stream.
##### `GET /directory/path/with/slash/`
Serve a directory listing as a JSON document.
##### `PUT /path/to/file`
Recieve a file from the client and save it to the vfs. The file body is streamed.
##### `PUT /directory/path/with/slash/`
Create a directory.
##### `DELETE /path/to/file`
Delete a file.
##### `DELETE /directory/path/with/slash/`
Delete a directory. (Recursive)
##### `POST /path/to/target`
Rename (or) copy a file (or) folder. (Recursive)
The client sends a JSON body containing the request information.
- `{"renameFrom": from}` - rename a file from `from` to `target`
- `{"copyFrom": from}` - copy a file from `from` to `target`
### Sample Response
```
{
"operation": "read",
"error": 0,
"timestamp": "2016-05-01T21:17:23.300999013+05:30",
"path": "/home/foo/bar",
"content": "This is the content of file bar"
}
```
## Error handling
| Error Code | Description |
| ------------- |:----------------------------------:|
| 0 | Operation Successful |
| 1024 | Error reading folder |
| 1025 | Error reading file |
| 1026 | Error creating folder |
| 1027 | Error creating/writing file |
| 1028 | Error reading source file |
| 1029 | Error creating destination file |
| 1030 | Error copying file |
| 1031 | Error reading folder stats |
| 1032 | Is a file |
| 1033 | Error reading destination folder |
| 1034 | Error creating destination folder |
| 1035 | Request body not found |
| 1036 | Error renaming file/folder |
| 1037 | Unsupported keys in request body |
| 25.981481 | 166 | 0.588382 | eng_Latn | 0.776531 |
619b40a0265d8e4ed9b294a501ae9318c50ed421 | 1,198 | md | Markdown | site/source/_posts/1944年08月05日.md | kokohuang/WarOfResistanceLive | 5a55b0eb2f2f8a00dbf753067bf61fdc8894c15a | [
"MIT"
] | 68 | 2020-11-30T18:37:16.000Z | 2021-08-16T13:37:02.000Z | site/source/_posts/1944年08月05日.md | kokohuang/WarOfResistanceLive | 5a55b0eb2f2f8a00dbf753067bf61fdc8894c15a | [
"MIT"
] | null | null | null | site/source/_posts/1944年08月05日.md | kokohuang/WarOfResistanceLive | 5a55b0eb2f2f8a00dbf753067bf61fdc8894c15a | [
"MIT"
] | 4 | 2020-12-08T06:47:10.000Z | 2021-08-16T13:37:18.000Z | ---
layout: post
title: "1944年08月05日"
date: 2019-08-05
categories: 全面抗战(1937-1945)
---
<meta name="referrer" content="no-referrer" />
- 1944年8月5日讯：孔祥熙访问罗斯福，商谈中国战局及国共谈判问题。
- 1944年8月5日讯：山东郓城八路军一部及地方武装向伪军刘本力部发动进攻。战至11日，解放村镇600余，摧毁敌据点37处，平毁日伪军封锁大堤200余里，毙伤伪大队长以下官兵300余名，俘虏2300余名。
- 1944年8月5日讯：湖南战场日军继续以强大火力向衡阳城区攻击，守军第十军阵地几被全毁，遂转至天马山、五桂岭、岳屏山一带，伤亡较大。至晚，日军攻占第十军第二线主阵地大部分，守军士兵仍顽强拼杀，终于阻止日军的深入。
- 1944年8月5日讯：湖南战场第十军军长方先觉在军指挥所召集紧急会议，所部第三师师长周庆祥、第一九〇师师长容有略以无可抽调之兵，弹药亦将告罄主张突围。唯方先觉因伤患6000余难以随军行动，挥泪宣布继续死守衡阳。
- 1944年8月5日讯：美军B—25型飞机终日轮番轰炸滇西腾冲城垣，13处被炸塌。6日，美机32架又轰炸腾冲。
- 1944年8月5日讯：史迪威对记者发表谈话，称：一年来在缅境击毙之日军相当于四师团之众。
- 1944年8月5日讯：缅北密支那克复。中国驻印军第一五〇团攻占密支那市中心，并与西大坡方面进军的美军第五三〇七支队会师。新编第三十师、第十四师各部均攻占指定目标。至此，密支那城区攻坚战结束。
- 1944年8月5日讯：滨海军区军民1.5万人破袭临(沂)郯(城)公路。共破毁公路30余公里，使敌交通断绝。
- #滇西反击战##腾冲战役#1944年8月5日讯：盟军15架B25轰炸机轰炸腾冲城炸毁城墙十几处。
- 1944年8月5日讯：王世杰与董必武、林伯渠谈话，问双方谈判的根本问题在哪里？如派人到延安是否有把握解决问题？林、董回答根本问题在于实现民主和军队数目与驻地问题，欢迎他们去延安。王说，双方互对对方提案提出答案，然后同林到延安，再约周恩来同时出来会谈。
- #缅北反击战##攻占密支那#1944年8月5日讯：我军第42团从宛貌出发，向丹邦阳追击，中国驻印军编成2个军进行整训，由郑洞国任副总指挥，下属新1军和新6军。新１军由孙立人任军长，辖新30、新38师，驻密支那地区；新6军由廖耀湘任军长，辖第14、新22、第50师，驻孟拱地区。
- #长衡会战#1944年8月5日讯：从长沙增援而来的第58师团由衡阳西北投入战斗，猛攻第190师阵地。在晚上22时，小西门阵地被突破，日军攻入城内，随后体育场阵地被突破，攻击该阵地的日军进抵市区边沿。
| 35.235294 | 141 | 0.828047 | yue_Hant | 0.277595 |
619b43ce30e48cf460c83e90ce283d830ee45cf5 | 21 | md | Markdown | README.md | matildawee/Nolyx_AB | 147388e01e75bf9a41e66a28ea219b1dd1683063 | [
"MIT"
] | null | null | null | README.md | matildawee/Nolyx_AB | 147388e01e75bf9a41e66a28ea219b1dd1683063 | [
"MIT"
] | null | null | null | README.md | matildawee/Nolyx_AB | 147388e01e75bf9a41e66a28ea219b1dd1683063 | [
"MIT"
] | null | null | null | # Nolyx_AB
Nolyx AB
| 7 | 10 | 0.714286 | yue_Hant | 0.952191 |
619b599d3ee84488117a4638abcc397b2ddb3843 | 2,936 | md | Markdown | content/lyrics/baby-shark/index.md | koutsosg/gr.aggu | 8f19eda3e47ad7e442087095abbc75fdeb752cc5 | [
"RSA-MD"
] | null | null | null | content/lyrics/baby-shark/index.md | koutsosg/gr.aggu | 8f19eda3e47ad7e442087095abbc75fdeb752cc5 | [
"RSA-MD"
] | null | null | null | content/lyrics/baby-shark/index.md | koutsosg/gr.aggu | 8f19eda3e47ad7e442087095abbc75fdeb752cc5 | [
"RSA-MD"
] | null | null | null | ---
title: "Baby Shark"
date: "2020-01-11"
description: "If you love the sea like I do, follow me underwater!🦈 I am going to have a party with all the beautiful creatures of the ocean. Swim with me and let's make the seafloor... the greatest dancefloor ever!"
videoSrcURL: "nU8Oic6SIuE"
vThumb: "babyshark-thumb.png"
cThumb: "babyshark-lineart.jpg"
vThumbOg: "babyshark-thumb-og.png"
cThumbOg: "babyshark-lineart-og.png"
colId: "babyshark"
category:
- Animal
- Dance
- Sea
- B
tags:
- B
- Shark
- Family
letter:
- B
---
<p>
Baby shark, doo doo doo doo doo doo<br />
Baby shark, doo doo doo doo doo doo<br />
Baby shark, doo doo doo doo doo doo<br />
Baby shark!</p>
<p>
Mommy shark, doo doo doo doo doo doo<br />
Mommy shark, doo doo doo doo doo doo<br />
Mommy shark, doo doo doo doo doo doo<br />
Mommy shark!</p>
<p>
Daddy shark, doo doo doo doo doo doo<br />
Daddy shark, doo doo doo doo doo doo<br />
Daddy shark, doo doo doo doo doo doo<br />
Daddy shark!</p>
<p>
Grandma shark, doo doo doo doo doo doo<br />
Grandma shark, doo doo doo doo doo doo<br />
Grandma shark, doo doo doo doo doo doo<br />
Grandma shark!</p>
<p>
Grandpa shark, doo doo doo doo doo doo<br />
Grandpa shark, doo doo doo doo doo doo<br />
Grandpa shark, doo doo doo doo doo doo<br />
Grandpa shark!</p>
<p>
Let's go hunt, doo doo doo doo doo doo<br />
Let's go hunt, doo doo doo doo doo doo<br />
Let's go hunt, doo doo doo doo doo doo<br />
Let's go hunt!</p>
<p>
Run Aggu, doo doo doo doo doo doo<br />
Run Aggu, doo doo doo doo doo doo<br />
Run Aggu, doo doo doo doo doo doo<br />
Run Aggu!</p>
<p>
Run Aggu, doo doo doo doo doo doo<br />
Run Aggu, doo doo doo doo doo doo<br />
Run Aggu, doo doo doo doo doo doo<br />
Run Aggu!</p>
<p>
Baby shark shark shark<br />
Baby shark shark shark<br />
Mommy shark shark shark<br />
Daddy shark shark shark</p>
<p>
Baby shark shark shark<br />
Baby shark shark shark<br />
Grandma shark shark shark<br />
Grandpa shark shark shark<br />
Baby shark!</p>
<p>
Safe at last, doo doo doo doo doo doo<br />
Safe at last, doo doo doo doo doo doo<br />
Safe at last, doo doo doo doo doo doo<br />
Safe at last!</p>
<p>
Safe at last, doo doo doo doo doo doo<br />
Safe at last, doo doo doo doo doo doo<br />
Safe at last, doo doo doo doo doo doo<br />
Safe at last!</p>
<p>
Let's go dance, doo doo doo doo doo doo<br />
Let's go dance, doo doo doo doo doo doo<br />
Let's go dance, doo doo doo doo doo doo<br />
Let's go dance!</p>
<p>
Let's go dance, doo doo doo doo doo doo<br />
Let's go dance, doo doo doo doo doo doo<br />
Let's go dance, doo doo doo doo doo doo<br />
Let's go dance!</p>
<p>
It's the end, doo doo doo doo doo doo<br />
It's the end, doo doo doo doo doo doo<br />
It's the end, doo doo doo doo doo doo<br />
It's the end!</p>
<p>
It's the end, doo doo doo doo doo doo<br />
It's the end, doo doo doo doo doo doo<br />
It's the end, doo doo doo doo doo doo<br />
It's the end!</p>
| 27.698113 | 216 | 0.674728 | nav_Latn | 0.985452 |
619c4dc22104ae0d7b055edc483fe84bd6c7c68a | 77 | md | Markdown | _posts/test/2021-02-20-test-3a-b.md | abdulrabbani347/minimal-mistakes | 6e6a36e9bf54be90b94eb7b39b85c754c3b0471d | [
"MIT"
] | null | null | null | _posts/test/2021-02-20-test-3a-b.md | abdulrabbani347/minimal-mistakes | 6e6a36e9bf54be90b94eb7b39b85c754c3b0471d | [
"MIT"
] | null | null | null | _posts/test/2021-02-20-test-3a-b.md | abdulrabbani347/minimal-mistakes | 6e6a36e9bf54be90b94eb7b39b85c754c3b0471d | [
"MIT"
] | null | null | null | ---
title: "Test 3a b"
layout: single
categories:
- test-3a
- test-3
---
| 9.625 | 18 | 0.584416 | eng_Latn | 0.314236 |
619c6c6dd6d056e3fd9640ce0610496b07f0ee24 | 988 | md | Markdown | README.md | jefo2k/nestjs-task-manager | 746706c6d7be7324b1217a6c0a0d0f3e21fa3b13 | [
"MIT"
] | null | null | null | README.md | jefo2k/nestjs-task-manager | 746706c6d7be7324b1217a6c0a0d0f3e21fa3b13 | [
"MIT"
] | null | null | null | README.md | jefo2k/nestjs-task-manager | 746706c6d7be7324b1217a6c0a0d0f3e21fa3b13 | [
"MIT"
] | null | null | null | <p align="center">NestJs validation POC.</p>
## Description
Simple CRUD using [Nest](https://github.com/nestjs/nest) to explore the framework capabilities.
## Installation
```bash
$ npm install
```
You must have a postgres running in your machine. The default values for database name, user and password could be find in `./src/config/typeorm.config.ts` file.
An optional `./docker-compose.yml` file is provided to easily up and run a postgres instance, but you need to have [Docker](https://www.docker.com/get-started) installed.
To run a postgres from a docker-compose file, first create a docker volume
```bash
docker volume create postgres
```
Then
```bash
docker-compose up
```
## Running the app
```bash
# development
$ npm run start
# watch mode
$ npm run start:dev
# production mode
$ npm run start:prod
```
## Test
```bash
# unit tests
$ npm run test
# e2e tests
$ npm run test:e2e
# test coverage
$ npm run test:cov
```
## License
[MIT licensed](LICENSE).
| 17.034483 | 170 | 0.713563 | eng_Latn | 0.913909 |
619db2c3a45cae09ab1d7b8d7ac669cf26fd9db3 | 690 | md | Markdown | CHANGELOG.md | needle-tools/package-credentials | 6b6f4427e080c646bc714071473bcac7e2d08b22 | [
"Apache-2.0"
] | null | null | null | CHANGELOG.md | needle-tools/package-credentials | 6b6f4427e080c646bc714071473bcac7e2d08b22 | [
"Apache-2.0"
] | null | null | null | CHANGELOG.md | needle-tools/package-credentials | 6b6f4427e080c646bc714071473bcac7e2d08b22 | [
"Apache-2.0"
] | null | null | null | # Changelog
All notable changes to this package will be documented in this file.
The format is based on [Keep a Changelog](http://keepachangelog.com/en/1.0.0/)
and this project adheres to [Semantic Versioning](http://semver.org/spec/v2.0.0.html).
## [1.1.3] - 2022-05-05
- Automatically add registry with credentials when detected in clipboard
## [1.1.2] - 2021-12-09
- Parse clipboard to automatically fill in credentials when adding a new registry
- Enable ``always auth`` by default
- Improved edit credentials ux
## [1.1.0] - 2021-10-03
- Needle fork that strips away all publishing-related tools and only keeps credentials/authentication.
## [0.0.1] - 2020-05-11
- Package created | 36.315789 | 102 | 0.743478 | eng_Latn | 0.981596 |
619ea61f003f709b9ef0cff0c5083baa923b440a | 744 | md | Markdown | qmk_firmware/keyboards/mechwild/bde/righty/readme.md | DanTupi/personal_setup | 911b4951e4d8b78d6ea8ca335229e2e970fda871 | [
"MIT"
] | null | null | null | qmk_firmware/keyboards/mechwild/bde/righty/readme.md | DanTupi/personal_setup | 911b4951e4d8b78d6ea8ca335229e2e970fda871 | [
"MIT"
] | null | null | null | qmk_firmware/keyboards/mechwild/bde/righty/readme.md | DanTupi/personal_setup | 911b4951e4d8b78d6ea8ca335229e2e970fda871 | [
"MIT"
] | null | null | null | # BIG DILL EXTENDED
A 41 key keyboard.
* Keyboard Maintainer: [Kyle McCreery](https://github.com/kylemccreery)
* Hardware Supported: BDE v2.3 Righty
* Hardware Availability: [BIG DILL EXTENDED on MechWild](https://mechwild.com/product/big-dill-extended-bde/)
Make example for this keyboard (after setting up your build environment):
make mechwild/bde/righty:default
See the [build environment setup](https://docs.qmk.fm/#/getting_started_build_tools) and the [make instructions](https://docs.qmk.fm/#/getting_started_make_guide) for more information. Brand new to QMK? Start with our [Complete Newbs Guide](https://docs.qmk.fm/#/newbs).
| 46.5 | 270 | 0.770161 | eng_Latn | 0.312786 |
619ed696f7afb2e65885674d295b7c519c15fce4 | 3,364 | md | Markdown | desktop-src/gdiplus/-gdiplus-class-lineargradientbrush-methods.md | velden/win32 | 94b05f07dccf18d4b1dbca13b19fd365a0c7eedc | [
"CC-BY-4.0",
"MIT"
] | 552 | 2019-08-20T00:08:40.000Z | 2022-03-30T18:25:35.000Z | desktop-src/gdiplus/-gdiplus-class-lineargradientbrush-methods.md | velden/win32 | 94b05f07dccf18d4b1dbca13b19fd365a0c7eedc | [
"CC-BY-4.0",
"MIT"
] | 1,143 | 2019-08-21T20:17:47.000Z | 2022-03-31T20:24:39.000Z | desktop-src/gdiplus/-gdiplus-class-lineargradientbrush-methods.md | velden/win32 | 94b05f07dccf18d4b1dbca13b19fd365a0c7eedc | [
"CC-BY-4.0",
"MIT"
] | 1,287 | 2019-08-20T05:37:48.000Z | 2022-03-31T20:22:06.000Z | ---
description: This topic lists the methods of the LinearGradientBrush class. For a complete class listing, see LinearGradientBrush Class.
ms.assetid: fbbc4cca-6337-4429-b35f-ef9de951ea12
title: LinearGradientBrush Methods
ms.topic: reference
ms.date: 05/31/2018
---
# LinearGradientBrush Methods
This topic lists the methods of the [**LinearGradientBrush**](/windows/desktop/api/gdiplusbrush/nl-gdiplusbrush-lineargradientbrush) class. For a complete class listing, see **LinearGradientBrush Class**.
- [**Clone**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-brush-clone)
- [**GetBlend**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-lineargradientbrush-getblend)
- [**GetBlendCount**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-lineargradientbrush-getblendcount)
- [**GetGammaCorrection**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-lineargradientbrush-getgammacorrection)
- [**GetInterpolationColorCount**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-lineargradientbrush-getinterpolationcolorcount)
- [**GetInterpolationColors**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-lineargradientbrush-getinterpolationcolors)
- [**GetLastStatus**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-brush-getlaststatus)
- [**GetLinearColors**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-lineargradientbrush-getlinearcolors)
- [**GetRectangle(Rect\*)**](/windows/win32/api/gdiplusbrush/nf-gdiplusbrush-lineargradientbrush-getrectangle(outrect))
- [**GetRectangle(RectF\*)**](/previous-versions//ms535352(v=vs.85))
- [**GetTransform**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-lineargradientbrush-gettransform)
- [**GetType**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-brush-gettype)
- [**GetWrapMode**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-lineargradientbrush-getwrapmode)
- [**MultiplyTransform**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-lineargradientbrush-multiplytransform)
- [**ResetTransform**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-lineargradientbrush-resettransform)
- [**RotateTransform**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-lineargradientbrush-rotatetransform)
- [**ScaleTransform**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-lineargradientbrush-scaletransform)
- [**SetBlend**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-lineargradientbrush-setblend)
- [**SetBlendBellShape**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-lineargradientbrush-setblendbellshape)
- [**SetBlendTriangularShape**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-lineargradientbrush-setblendtriangularshape)
- [**SetGammaCorrection**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-lineargradientbrush-setgammacorrection)
- [**SetInterpolationColors**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-lineargradientbrush-setinterpolationcolors)
- [**SetLinearColors**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-lineargradientbrush-setlinearcolors)
- [**SetTransform**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-lineargradientbrush-settransform)
- [**SetWrapMode**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-lineargradientbrush-setwrapmode)
- [**TranslateTransform**](/windows/desktop/api/Gdiplusbrush/nf-gdiplusbrush-lineargradientbrush-translatetransform)
| 78.232558 | 204 | 0.803805 | yue_Hant | 0.159631 |
61a00669755086a067390ef646cc132e32c97cdc | 1,101 | md | Markdown | docs/contracts/NeverminedToken.md | nevermined-io/contracts | 19cc100b62bc60862078535f188672bc18df140b | [
"Apache-2.0"
] | 8 | 2020-11-17T22:52:56.000Z | 2022-03-01T12:35:28.000Z | docs/contracts/NeverminedToken.md | nevermined-io/contracts | 19cc100b62bc60862078535f188672bc18df140b | [
"Apache-2.0"
] | 112 | 2020-12-09T15:42:31.000Z | 2022-03-30T10:31:07.000Z | docs/contracts/NeverminedToken.md | nevermined-io/contracts | 19cc100b62bc60862078535f188672bc18df140b | [
"Apache-2.0"
] | null | null | null |
Implementation of a Test Token.
Test Token is an ERC20 token only for testing purposes
## Functions
### initialize
```solidity
function initialize(
address _owner,
address payable _initialMinter
) public
```
NeverminedToken Initializer
Runs only on initial contract creation.
#### Parameters:
| Name | Type | Description |
| :--- | :--- | :------------------------------------------------------------------- |
|`_owner` | address | refers to the owner of the contract
|`_initialMinter` | address payable | is the first token minter added
### _beforeTokenTransfer
```solidity
function _beforeTokenTransfer(
) internal
```
See {ERC20-_beforeTokenTransfer}.
Requirements:
- minted tokens must not cause the total supply to go over the cap.
### mint
```solidity
function mint(
) external returns (bool)
```
Creates `amount` tokens and assigns them to `account`, increasing
the total supply.
Emits a {Transfer} event with `from` set to the zero address.
Requirements:
- `to` cannot be the zero address.
| 21.173077 | 86 | 0.630336 | eng_Latn | 0.959242 |
61a02e4b60bd9b7a70e1e82e3a4241b3f42b1b25 | 1,682 | md | Markdown | windows-driver-docs-pr/debugger/-cchelp.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/debugger/-cchelp.md | sarman1998/windows-driver-docs | 790f8ecb851d5c9e423af03a8a57dfac59945c24 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | windows-driver-docs-pr/debugger/-cchelp.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: cchelp
description: The cchelp extension displays some brief Help text in the Debugger command window for some of the cache management extensions.
ms.assetid: ad9b217b-22fc-433a-87ba-47e5ac5537ec
keywords: ["cache manager", "cchelp Windows Debugging"]
ms.author: domars
ms.date: 05/23/2017
ms.topic: article
ms.prod: windows-hardware
ms.technology: windows-devices
topic_type:
- apiref
api_name:
- cchelp
api_type:
- NA
---
# !cchelp
The **!cchelp** extension displays some brief Help text in the Debugger command window for some of the cache management extensions.
```
!cchelp
```
### <span id="DLL"></span><span id="dll"></span>DLL
<table>
<colgroup>
<col width="50%" />
<col width="50%" />
</colgroup>
<tbody>
<tr class="odd">
<td align="left"><p><strong>Windows 2000</strong></p></td>
<td align="left"><p>Kdextx86.dll</p></td>
</tr>
<tr class="even">
<td align="left"><p><strong>Windows XP and later</strong></p></td>
<td align="left"><p>Kdexts.dll</p></td>
</tr>
</tbody>
</table>
### <span id="Additional_Information"></span><span id="additional_information"></span><span id="ADDITIONAL_INFORMATION"></span>Additional Information
For information about cache management, see the Microsoft Windows SDK documentation and *Microsoft Windows Internals* by Mark Russinovich and David Solomon. (These resources may not be available in some languages and countries.)
The **!cchelp** extension displays help for the [**!bcb**](-bcb.md), [**!defwrites**](-defwrites.md), [**!finddata**](-finddata.md), and [**!scm**](-scm.md) cache management extensions. Other cache management extensions include [**!openmaps**](-openmaps.md) and [**!pcm**](-pcm.md).
| 26.698413 | 282 | 0.708086 | eng_Latn | 0.659115 |
61a0bcb363c328c4f32557b19edfb0ab425a05cf | 59 | md | Markdown | _posts/front_end/2020-12-30-vux.md | SoniaShen/soniashen.github.io | e0e2dd45299e7d211fa31f44eefe06e6c85ee5da | [
"MIT"
] | null | null | null | _posts/front_end/2020-12-30-vux.md | SoniaShen/soniashen.github.io | e0e2dd45299e7d211fa31f44eefe06e6c85ee5da | [
"MIT"
] | null | null | null | _posts/front_end/2020-12-30-vux.md | SoniaShen/soniashen.github.io | e0e2dd45299e7d211fa31f44eefe06e6c85ee5da | [
"MIT"
] | null | null | null | This archive is based on: https://doc.vux.li/zh-CN/
| 6.555556 | 51 | 0.627119 | yue_Hant | 0.5938 |
61a14da9aa30b20c80a3f1c32193c2148cf46bdc | 208 | md | Markdown | download-themes-here/CustomFont/README.md | 2XxPlaZmAxX3/discord-addons | d109bed1e144aed1d275b5179e751fa4d86dfdd7 | [
"RSA-MD"
] | 1 | 2021-10-29T21:16:07.000Z | 2021-10-29T21:16:07.000Z | download-themes-here/CustomFont/README.md | StormStarbrickYT/discord-addons | e586e932aa311306c889cb8f235457ed989711be | [
"RSA-MD"
] | null | null | null | download-themes-here/CustomFont/README.md | StormStarbrickYT/discord-addons | e586e932aa311306c889cb8f235457ed989711be | [
"RSA-MD"
] | null | null | null | # Custom Font
## Compatible with:
- ✅ BetterDiscord
- ✅ Powercord
- ⚠ Stylus (see [Browser](https://github.com/discord-addons/discord-addons/blob/master/styles/CustomFontForBrowser.css) version for Stylus)
| 26 | 139 | 0.754808 | kor_Hang | 0.188153 |
61a15afc9567772307c066c72ac913f999b47a9b | 871 | md | Markdown | README.md | duncanista/encrypted-chatroom | 0dd0299e21c4900a7d72dd1f6780f6042a8ff3f3 | [
"MIT"
] | null | null | null | README.md | duncanista/encrypted-chatroom | 0dd0299e21c4900a7d72dd1f6780f6042a8ff3f3 | [
"MIT"
] | null | null | null | README.md | duncanista/encrypted-chatroom | 0dd0299e21c4900a7d72dd1f6780f6042a8ff3f3 | [
"MIT"
] | null | null | null | # Encrypted Multi-client Chatroom in C
Chatroom encrypted with a simple XOR.
## Run
```console
gcc server.c -o server.out
```
```console
./server.out
```
## Cipher
I strongly recommend not using this XOR cipher, since it's pretty simple. Although, a way to ensure a bit of security would be modifying the code so it asks one time for the key, so you can communicate with other users.
```C
char message[] = "Incoming message";
char key[] = "CIPHER"; // === {'C','I','P','H','E','R'};
for(int i = 0; i < strlen(message); i++) {
message[i] = message[i] ^ key[i % (sizeof(key)/sizeof(char))];
}
```
## Contributing
Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.
Please make sure to update tests as appropriate, following the standard.
## License
[MIT](https://choosealicense.com/licenses/mit/)
| 26.393939 | 219 | 0.69116 | eng_Latn | 0.989434 |
61a2292ff044c12bf2d0d0e2597c21d112a1feb6 | 102 | md | Markdown | test/content/special-chars.md | kucingyahud/gilbitron | 90d686541620846f6326da8b8e036a24d256c303 | [
"MIT"
] | 2,237 | 2015-01-01T03:44:27.000Z | 2022-03-26T02:10:23.000Z | test/content/special-chars.md | kucingyahud/gilbitron | 90d686541620846f6326da8b8e036a24d256c303 | [
"MIT"
] | 307 | 2015-01-15T03:49:27.000Z | 2022-02-28T16:28:33.000Z | test/content/special-chars.md | kucingyahud/gilbitron | 90d686541620846f6326da8b8e036a24d256c303 | [
"MIT"
] | 576 | 2015-01-17T16:27:16.000Z | 2022-03-19T16:20:57.000Z | /*
Title: Special Characters Page
Sort: 2
*/
This is some example content with "special characters".
| 14.571429 | 55 | 0.745098 | eng_Latn | 0.999199 |
61a2f4662e16f4fcd194155038adb38e3626358a | 3,312 | md | Markdown | bookshelf.md | PeterMartini/PeterMartini.github.io | 0a79f695048e4316756aca430b6cea114c7ab834 | [
"MIT"
] | 1 | 2021-09-15T15:26:08.000Z | 2021-09-15T15:26:08.000Z | bookshelf.md | PeterMartini/PeterMartini.github.io | 0a79f695048e4316756aca430b6cea114c7ab834 | [
"MIT"
] | null | null | null | bookshelf.md | PeterMartini/PeterMartini.github.io | 0a79f695048e4316756aca430b6cea114c7ab834 | [
"MIT"
] | null | null | null | ---
layout: page
title: Bookshelf
permalink: /bookshelf/
---
My virtual bookshelf - a list of articles / blog posts / books worth
having around for reference.
## RISC-V
### libunwind
Various resources used to add RISC-V support for [libunwind](https://www.nongnu.org/libunwind/)
* [How debuggers work: Part 3 - Debugging information](https://eli.thegreenplace.net/2011/02/07/how-debuggers-work-part-3-debugging-information) - A walk through of DWARF, ELF, and debuggers
* [RISC-V Calling Conventions](https://riscv.org/wp-content/uploads/2015/01/riscv-calling.pdf)
* [RISC-V ELF psABI specification](https://github.com/riscv/riscv-elf-psabi-doc/blob/master/riscv-elf.md)
* [binutils-gdb: gdb/riscv: Provide non-DWARF stack unwinder](https://sourceware.org/legacy-ml/gdb-cvs/2018-09/msg00002.html) (a patch mailed to the `gdb` mailing list)
* [libunwind docs](https://www.nongnu.org/libunwind/docs.html)
* [DWARF Register Mappings](https://github.com/riscv/riscv-elf-psabi-doc/issues/70) - A GitHub issue for the RISC-V psABI, raised by someone trying to add stack unwinding to Mono
* [Manual Stack Unwinding](https://github.com/slavaim/riscv-notes/blob/master/magenta/manual-stack-unwinding.md) - Someone's notes testing stack unwinding on RISC-V (from 2017; may be out of date)
* [cfa == rsp on x86_64](https://www.corsix.org/content/cfa-rsp-x86-64) - A post explaining the relationship between 'CFA' (Canonical Frame Address) in the DWARF standard and the RSP register on `x86_64`
* [Generating core dumps on bare metal RISC-V](https://forums.sifive.com/t/generating-core-dumps-on-bare-metal-risc-v/3088) - A forum post asking for help on core dumps on RISC-V that mentions details of the `.reg` section of the core dump files
* [riscv.h](https://github.com/gcc-mirror/gcc/blob/master/gcc/config/riscv/riscv.h) - The GCC config for RISC-V, a useful reference for important implementation details
* [RISC-V registers](https://en.wikichip.org/wiki/risc-v/registers) A short and handy reference page on RISC-V registers. Not comprehensive; it details the 32 general purpose registers but doesn't mention floating point registers
* [libunwind patch for AArch64 support](https://github.com/libunwind/libunwind/commit/ac6c0a6535975f1dc2da6e4e2766614baac2a14a#diff-44c9a8e487fd562ca0a78f2469deee6ca193e450bf03a83866aff7f590e9e494)
* [Emulating RISC-V Debian on WSL2](https://blog.davidburela.com/2020/11/15/emulating-risc-v-debian-on-wsl2/)
* [Building a RISC-V CPU from scratch](https://spectrum.ieee.org/geek-life/hands-on/build-a-riscv-cpu-from-scratch)
* [The Apple M1 and RISC-V (lots of links on history and current status as well as a suggestion of RISC-V as the basis of a co-processor revolution)](https://erik-engheim.medium.com/apple-m1-foreshadows-risc-v-dd63a62b2562)
## Neat Tweets
* [6 interesting HTML attributes](https://twitter.com/Insharamin/status/1399621939480522755)
* [Debugging mystery: the case of the 50ms request (understanding TCP)](https://twitter.com/b0rk/status/1390012478386577411)
## Assorted Tools
* [Get a Windows 10 Development Environment](https://developer.microsoft.com/en-us/windows/downloads/virtual-machines/)
## File Formats
* [In which a PDF is a Git Repository Containing its own LaTeX Source and a Copy of Itself](https://github.com/ESultanik/PDFGitPolyglot)
| 75.272727 | 245 | 0.774457 | eng_Latn | 0.371926 |
61a4668d077452566c16a1d5329dfe27b9b952d7 | 48 | md | Markdown | README.md | chaos382/Ethic | 3c09bcbeba35f957d27dea91688ed73ed070102e | [
"MIT"
] | null | null | null | README.md | chaos382/Ethic | 3c09bcbeba35f957d27dea91688ed73ed070102e | [
"MIT"
] | null | null | null | README.md | chaos382/Ethic | 3c09bcbeba35f957d27dea91688ed73ed070102e | [
"MIT"
] | null | null | null | # Ethic
I am using this repository for training
| 16 | 39 | 0.791667 | eng_Latn | 0.999826 |
61a46f993ba00988f3c48d2e87dea5c99b58b49d | 433 | md | Markdown | my_collections/_media/2021_nbc_depl.md | manoelhortaribeiro/manoelhortaribeiro.github.io | ef6cfbed87d7b84dc899879bf091d06538b1b404 | [
"MIT"
] | null | null | null | my_collections/_media/2021_nbc_depl.md | manoelhortaribeiro/manoelhortaribeiro.github.io | ef6cfbed87d7b84dc899879bf091d06538b1b404 | [
"MIT"
] | null | null | null | my_collections/_media/2021_nbc_depl.md | manoelhortaribeiro/manoelhortaribeiro.github.io | ef6cfbed87d7b84dc899879bf091d06538b1b404 | [
"MIT"
] | 2 | 2018-08-13T21:02:36.000Z | 2021-06-29T23:15:00.000Z | ---
title: "Trump's blog isn't lighting up the internet"
year: 2021
venue: "NBC News"
link: "https://www.nbcnews.com/tech/tech-news/trumps-blog-isnt-lighting-internet-rcna890"
archive: "https://web.archive.org/web/20210515144028/https://www.nbcnews.com/tech/tech-news/trumps-blog-isnt-lighting-internet-rcna890"
related_paper: 'Does Platform Migration Compromise Content Moderation? Evidence from r/The_Donald and r/Incels'
--- | 30.928571 | 135 | 0.771363 | yue_Hant | 0.519378 |
61a62a3448657669475a1c85d93047c69b5df47a | 73 | md | Markdown | README.md | alvesfelipe/pascal-compiler | caa4e4e6e9d1a731b156b53b447e042758d55ccd | [
"MIT"
] | null | null | null | README.md | alvesfelipe/pascal-compiler | caa4e4e6e9d1a731b156b53b447e042758d55ccd | [
"MIT"
] | null | null | null | README.md | alvesfelipe/pascal-compiler | caa4e4e6e9d1a731b156b53b447e042758d55ccd | [
"MIT"
] | null | null | null | # pascal-compiler
This repository implements a complete pascal compiler.
| 24.333333 | 54 | 0.835616 | eng_Latn | 0.739803 |
61a6c221e7c5212b99c04bb878323894b05eeb80 | 2,044 | md | Markdown | docs/checkpointing.md | PeihongYu/surreal | 2556bd9c362a53e0a94da914ba59b5d4621c4081 | [
"MIT"
] | 471 | 2018-10-29T07:11:54.000Z | 2022-03-31T11:56:00.000Z | docs/checkpointing.md | PeihongYu/surreal | 2556bd9c362a53e0a94da914ba59b5d4621c4081 | [
"MIT"
] | 34 | 2018-10-30T12:02:56.000Z | 2019-05-22T07:57:51.000Z | docs/checkpointing.md | PeihongYu/surreal | 2556bd9c362a53e0a94da914ba59b5d4621c4081 | [
"MIT"
] | 77 | 2018-10-30T00:51:52.000Z | 2022-03-01T08:26:35.000Z | # Checkpointing in Surreal WIP
This document describes how checkpointing works in Surreal. Checkpoint is currently being refactored. Stay tuned.
## The Checkpoint Class
The class that takes care of checkpointing is defined [here](https://github.com/SurrealAI/Surreal/blob/master/surreal/utils/checkpoint.py) in `utils/checkpoint.py`. It is called `Checkpoint`. There is also a subclass that does checkpointing periodically. It keeps track of declared attributes of a class and tries to save them into the file system properly.
To check how checkpoint saves and restores classes, refer to its implementation.
## Invocation in learner
* Learner keeps a `self._periodic_checkpoint` attribute which is an instance of `PeriodicCheckpoint`.
* A learner subclass declare attributes to save in method `checkpoint_attributes`.
* Below is (abbreviated) how the learner sets up the chekpoint instance. See [this link](https://github.com/SurrealAI/Surreal/blob/424976110571153d549a6807b621edc65cc8e006/surreal/learner/base.py#L258) for original code.
```
def _setup_checkpoint(self):
tracked_attrs = self.checkpoint_attributes()
self._periodic_checkpoint = U.PeriodicCheckpoint(
U.f_join(self.session_config.folder, 'checkpoint'),
name='learner',
period=self.session_config.checkpoint.learner.periodic,
min_interval=self.session_config.checkpoint.learner.min_interval,
tracked_obj=self,
tracked_attrs=tracked_attrs,
keep_history=self.session_config.checkpoint.learner.keep_history,
keep_best=self.session_config.checkpoint.learner.keep_best,
)
```
* Learner checks for restoration [here](https://github.com/SurrealAI/Surreal/blob/424976110571153d549a6807b621edc65cc8e006/surreal/learner/base.py#L293)
## Commandline Argument
The learner interacts with the checkpoint through config. It can also be affected by commandline arguments, e.g. [here](https://github.com/SurrealAI/Surreal/blob/424976110571153d549a6807b621edc65cc8e006/surreal/main_scripts/learner_main.py#L8). | 68.133333 | 360 | 0.790607 | eng_Latn | 0.940503 |
61a78d7601623c5e906723e6590b831be3ea7be4 | 58 | md | Markdown | README.md | itnotes/spring-kottler | dfce5e9a4b8752bb706237fc556e7f787b050c8b | [
"MIT"
] | null | null | null | README.md | itnotes/spring-kottler | dfce5e9a4b8752bb706237fc556e7f787b050c8b | [
"MIT"
] | null | null | null | README.md | itnotes/spring-kottler | dfce5e9a4b8752bb706237fc556e7f787b050c8b | [
"MIT"
] | null | null | null | # spring-kottler
Spring and Kotlin - from 0 to production
| 19.333333 | 40 | 0.775862 | eng_Latn | 0.993481 |
61a7c50177a52c9bef4027c7730af8be9b3ddba0 | 843 | md | Markdown | client/python/lib/docs/make_ndarray.md | Xaenalt/model_server | f977dbf1246ebf85e960ca058e814deac7c6a16c | [
"Apache-2.0"
] | 234 | 2020-04-24T22:09:49.000Z | 2022-03-30T10:40:04.000Z | client/python/lib/docs/make_ndarray.md | Xaenalt/model_server | f977dbf1246ebf85e960ca058e814deac7c6a16c | [
"Apache-2.0"
] | 199 | 2020-04-29T08:43:21.000Z | 2022-03-29T09:05:52.000Z | client/python/lib/docs/make_ndarray.md | Xaenalt/model_server | f977dbf1246ebf85e960ca058e814deac7c6a16c | [
"Apache-2.0"
] | 80 | 2020-04-29T14:54:41.000Z | 2022-03-30T14:50:29.000Z | <a href="../../../../client/python/lib/ovmsclient/tfs_compat/grpc/tensors.py#L191"><img align="right" style="float:right;" src="https://img.shields.io/badge/-source-cccccc?style=flat-square"></a>
## <kbd>function</kbd> `make_ndarray`
```python
make_ndarray(tensor_proto)
```
Create `numpy ndarray` from **tensor_proto**.
**Args:**
- <b>`tensor_proto`</b>: `TensorProto` object.
**Returns:**
`Numpy ndarray` with tensor proto contents.
**Raises:**
- <b>`TypeError`</b>: if unsupported type is provided.
**Examples:**
Create `TensorProto` with `make_tensor_proto` and convert it back to numpy array with `make_ndarray`:
```python
data = np.array([[1, 2, 3], [4, 5, 6]], np.int32)
tensor_proto = make_tensor_proto(data)
output = make_ndarray(tensor_proto)
```
---
<a href="README.md">Return to the main page</a>
| 20.071429 | 195 | 0.670225 | eng_Latn | 0.27564 |
61a7ea259a4dd0b01cfd224a090054f92ac55548 | 245 | md | Markdown | README.md | fmpinheiro/taiga-ios | 2bcd32dd877dcebca59eb40dfd7523152416fdb3 | [
"Apache-2.0"
] | 18 | 2015-10-05T20:46:48.000Z | 2019-03-29T02:57:32.000Z | README.md | fmpinheiro/taiga-ios | 2bcd32dd877dcebca59eb40dfd7523152416fdb3 | [
"Apache-2.0"
] | 3 | 2015-11-30T11:12:26.000Z | 2018-05-07T15:34:11.000Z | README.md | fmpinheiro/taiga-ios | 2bcd32dd877dcebca59eb40dfd7523152416fdb3 | [
"Apache-2.0"
] | 7 | 2015-10-31T12:14:57.000Z | 2020-02-17T00:47:47.000Z | # taiga-ios
iOS app to use with Taiga Project Management System - http://taiga.io
This project aims to provide a mobile iOS interface for the Taiga project.
It will use the rest API as shown in [docs](http://taigaio.github.io/taiga-doc/dist/).
| 40.833333 | 86 | 0.759184 | eng_Latn | 0.891516 |
61a8c3ebf9f53d0a8b381e85fb8da8a9d7f88979 | 29 | md | Markdown | docs/开发者知识文档/20_GNU-Linux/06_其他发行版/manjaro.md | wangrollin/wangrollin.github.io | f37a1153db39fb75afb138b2f0377bf39c5133ff | [
"Apache-2.0"
] | null | null | null | docs/开发者知识文档/20_GNU-Linux/06_其他发行版/manjaro.md | wangrollin/wangrollin.github.io | f37a1153db39fb75afb138b2f0377bf39c5133ff | [
"Apache-2.0"
] | 1 | 2020-12-10T05:46:15.000Z | 2020-12-10T05:46:15.000Z | docs/开发者知识文档/20_GNU-Linux/06_其他发行版/manjaro.md | wangrollin/wangrollin.github.io | f37a1153db39fb75afb138b2f0377bf39c5133ff | [
"Apache-2.0"
] | 1 | 2020-12-10T05:38:56.000Z | 2020-12-10T05:38:56.000Z |
- [官网](https://manjaro.org/) | 14.5 | 28 | 0.586207 | nld_Latn | 0.155047 |
61a92b3ec6047bb58f634cc88ca13c5ba3133e47 | 2,409 | md | Markdown | components/steps/demo/progress-debug.md | yanm1ng/ant-design | 089dc7e36a87a86983953da0a95b4db88cde07f6 | [
"MIT"
] | 1 | 2015-04-24T16:03:11.000Z | 2015-04-24T16:03:11.000Z | components/steps/demo/progress-debug.md | yanm1ng/ant-design | 089dc7e36a87a86983953da0a95b4db88cde07f6 | [
"MIT"
] | 215 | 2022-01-24T05:11:14.000Z | 2022-03-31T20:26:43.000Z | components/steps/demo/progress-debug.md | yanm1ng/ant-design | 089dc7e36a87a86983953da0a95b4db88cde07f6 | [
"MIT"
] | null | null | null | ---
order: 99
title:
zh-CN: Progress Debug
en-US: Progress Debug
debug: true
---
## zh-CN
Buggy!
## en-US
Buggy!
```jsx
import { Steps, Button } from 'antd';
const { Step } = Steps;
function Demo() {
const [percent, setPercentage] = React.useState(0);
const [current, setCurrent] = React.useState(1);
const [status, setStatus] = React.useState('process');
return (
<>
<Button onClick={() => setPercentage(undefined)}>Percentage to undefined</Button>
<Button onClick={() => setPercentage((percent + 10) % 100)}>Percentage +</Button>
<Button
onClick={() => {
setCurrent((current + 1) % 3);
setPercentage(0);
}}
>
Current +
</Button>
<Button onClick={() => setStatus('wait')}>Status Wait</Button>
<Button onClick={() => setStatus('process')}>Status Process</Button>
<Button onClick={() => setStatus('finish')}>Status Finish</Button>
<Button onClick={() => setStatus('error')}>Status Error</Button>
<Steps current={current} percent={percent} status={status}>
<Step title="Finished" description="This is a description." />
<Step title="In Progress" subTitle="Left 00:00:08" description="This is a description." />
<Step title="Waiting" description="This is a description." />
</Steps>
<Steps current={current} percent={percent} status={status} size="small">
<Step title="Finished" description="This is a description." />
<Step title="In Progress" subTitle="Left 00:00:08" description="This is a description." />
<Step title="Waiting" description="This is a description." />
</Steps>
<Steps current={current} percent={percent} status={status} direction="vertical">
<Step title="Finished" description="This is a description." />
<Step title="In Progress" subTitle="Left 00:00:08" description="This is a description." />
<Step title="Waiting" description="This is a description." />
</Steps>
<Steps current={current} percent={percent} status={status} size="small" direction="vertical">
<Step title="Finished" description="This is a description." />
<Step title="In Progress" subTitle="Left 00:00:08" description="This is a description." />
<Step title="Waiting" description="This is a description." />
</Steps>
</>
);
}
export default Demo;
```
| 35.426471 | 99 | 0.622665 | eng_Latn | 0.472612 |
61a9eeab54a7929a391a69c0f58b16c34d9123cc | 4,373 | md | Markdown | docs/3-19-system-and-information-integrity/si-14-non-persistence.md | NIST-SP-800-53-R5/NIST-SP-800-53-R5.github.io | d0a98a3286e4028a08ed5daa93417b7c5daa5ef6 | [
"MIT"
] | null | null | null | docs/3-19-system-and-information-integrity/si-14-non-persistence.md | NIST-SP-800-53-R5/NIST-SP-800-53-R5.github.io | d0a98a3286e4028a08ed5daa93417b7c5daa5ef6 | [
"MIT"
] | null | null | null | docs/3-19-system-and-information-integrity/si-14-non-persistence.md | NIST-SP-800-53-R5/NIST-SP-800-53-R5.github.io | d0a98a3286e4028a08ed5daa93417b7c5daa5ef6 | [
"MIT"
] | 2 | 2020-10-30T12:32:14.000Z | 2021-09-29T16:10:56.000Z | ---
layout: page
title: -- SI-14 NON-PERSISTENCE
parent: . 3.19 SYSTEM AND INFORMATION INTEGRITY
nav_order: 319140
---
## SI-14 NON-PERSISTENCE
<ins>Control</ins>: Implement non-persistent [ _Assignment: organization-defined system components and services_ ] that are initiated in a known state and terminated [ _Selection (one or more): upon end of session of use; periodically at [ Assignment: organization-defined frequency ]_].
<ins>Discussion</ins>: Implementation of non-persistent components and services mitigates risk from advanced persistent threats (APTs) by reducing the targeting capability of adversaries (i.e., window of opportunity and available attack surface) to initiate and complete attacks. By implementing the concept of non-persistence for selected system components, organizations can provide a trusted, known state computing resource for a specific time period that does not give adversaries sufficient time to exploit vulnerabilities in organizational systems or operating environments. Since the APT is a high-end, sophisticated threat with regard to capability, intent, and targeting, organizations assume that over an extended period, a percentage of attacks will be successful. Non-persistent system components and services are activated as required using protected information and terminated periodically or at the end of sessions. Non-persistence increases the work factor of adversaries attempting to compromise or breach organizational systems.
Non-persistence can be achieved by refreshing system components, periodically reimaging components, or using a variety of common virtualization techniques. Non-persistent services can be implemented by using virtualization techniques as part of virtual machines or as new instances of processes on physical machines (either persistent or non-persistent). The benefit of periodic refreshes of system components and services is that it does not require organizations to first determine whether compromises of components or services have occurred (something that may often be difficult to determine). The refresh of selected system components and services occurs with sufficient frequency to prevent the spread or intended impact of attacks, but not with such frequency that it makes the system unstable. Refreshes of critical components and services may be done periodically to hinder the ability of adversaries to exploit optimum windows of vulnerabilities.
<ins>Related Controls</ins>: SC-30 , SC-34 , SI-21.
<ins>Control Enhancements</ins>:
* (1) NON-PERSISTENCE / REFRESH FROM TRUSTED SOURCES<br>
**Obtain software and data employed during system component and service refreshes from the following trusted sources: [ _Assignment: organization-defined trusted sources_ ].**
<ins>Discussion</ins>: Trusted sources include software and data from write-once, read-only media or from selected offline secure storage facilities.
<ins>Related Controls</ins>: None.
* (2) NON-PERSISTENCE / NON-PERSISTENT INFORMATION<br>
* **(a) [ _Selection: Refresh [ Assignment: organization-defined information ] [ Assignment: organization-defined frequency ]; Generate [ Assignment: organization-defined information ] on demand_ ]; and**
* **(b) Delete information when no longer needed.**
<ins>Discussion</ins>: Retaining information longer than is needed makes the information a potential target for advanced adversaries searching for high value assets to compromise through unauthorized disclosure, unauthorized modification, or exfiltration. For system-related information, unnecessary retention provides advanced adversaries information that can assist in their reconnaissance and lateral movement through the system.
<ins>Related Controls</ins>: None.
* (3) NON-PERSISTENCE / NON-PERSISTENT CONNECTIVITY<br>
**Establish connections to the system on demand and terminate connections after [ _Selection: completion of a request; a period of non-use_ ].**
<ins>Discussion</ins>: Persistent connections to systems can provide advanced adversaries with paths to move laterally through systems and potentially position themselves closer to high value assets. Limiting the availability of such connections impedes the adversary’s ability to move freely through organizational systems.
<ins>Related Controls</ins>: SC-10.
<ins>References</ins>: None.
| 101.697674 | 1,046 | 0.802881 | eng_Latn | 0.997496 |
61aa6d82dafbbab169943ea5ea35e0220047898c | 39 | md | Markdown | README.md | jscipione/HaikuUtils | 82cb2c1c1484244ab1041b71ca7632b4322bd643 | [
"MIT"
] | 1 | 2021-05-23T18:03:58.000Z | 2021-05-23T18:03:58.000Z | README.md | jscipione/HaikuUtils | 82cb2c1c1484244ab1041b71ca7632b4322bd643 | [
"MIT"
] | null | null | null | README.md | jscipione/HaikuUtils | 82cb2c1c1484244ab1041b71ca7632b4322bd643 | [
"MIT"
] | null | null | null | Utilities and test programs for Haiku.
| 19.5 | 38 | 0.820513 | eng_Latn | 0.998363 |
61aad41c1aaeb3840e78458ffd53654f5a636052 | 29 | md | Markdown | README.md | GiterLab/rmq | 8698bb1c9b739ae0dcc5ceae68e2412576dced30 | [
"Apache-2.0"
] | null | null | null | README.md | GiterLab/rmq | 8698bb1c9b739ae0dcc5ceae68e2412576dced30 | [
"Apache-2.0"
] | null | null | null | README.md | GiterLab/rmq | 8698bb1c9b739ae0dcc5ceae68e2412576dced30 | [
"Apache-2.0"
] | null | null | null | # rmq
Go client for rabbitmq
| 9.666667 | 22 | 0.758621 | fra_Latn | 0.504561 |
61ab0d8dd8d6f2918c65447d1e54912941b850ae | 6,819 | md | Markdown | examples/extending/extending-2-layers.md | GwynethOu/leaflet_zh | ae72a61d6e03ccf6c5a7e45dd28f5f87324d613f | [
"Apache-2.0"
] | 2 | 2021-08-20T01:43:02.000Z | 2021-08-20T01:43:05.000Z | examples/extending/extending-2-layers.md | GwynethOu/leaflet_zh | ae72a61d6e03ccf6c5a7e45dd28f5f87324d613f | [
"Apache-2.0"
] | null | null | null | examples/extending/extending-2-layers.md | GwynethOu/leaflet_zh | ae72a61d6e03ccf6c5a7e45dd28f5f87324d613f | [
"Apache-2.0"
] | null | null | null | ---
layout: tutorial_v2
title: Extending Leaflet, New Layers
---
<br>
本教程假定你已经阅读了 [Leaflet类的继承原理](./extending-1-classes.html)。
在 Leaflet 中，“layer” 是指当地图移动时移动的任何东西。在了解如何从头开始创建它们之前，先解释一下如何进行简单的扩展。
## "扩展方法"
一些 Leaflet 类具有所谓的 “扩展方法”：为子类编写代码的入口点。
其中之一是 `L.TileLayer.getTileUrl()`。每当一个新的瓦片需要知道加载哪张图片时，`L.TileLayer` 就会在内部调用这个方法。通过制作 `L.TileLayer` 的子类并重写其 `getTileUrl()` 函数，我们可以创建自定义行为。
让我们用一个自定义 `L.TileLayer` 来说明，它将显示来自[PlaceKitten]()的随机猫咪图像：
L.TileLayer.Kitten = L.TileLayer.extend({
getTileUrl: function(coords) {
var i = Math.ceil( Math.random() * 4 );
return "https://placekitten.com/256/256?image=" + i;
},
getAttribution: function() {
return "<a href='https://placekitten.com/attribution.html'>PlaceKitten</a>"
}
});
L.tileLayer.kitten = function() {
return new L.TileLayer.Kitten();
}
L.tileLayer.kitten().addTo(map);
{% include frame.html url="kittenlayer.html" %}
通常，`getTileUrl()` 接收瓦片（tile）坐标（如 `coords.x`、`coords.y`和 `coords.z`），并从中生成一个瓦片（tile）URL。在我们的例子中，我们忽略了这些，只是用一个随机数来获得不同的小猫。
### 拆分插件代码
在前面的示例中，`L.TileLayer.Kitten` 定义在与使用相同的位置。对于插件，最好将插件代码拆分成自己的文件，使用时引入该文件。
对于 KittenLayer，您应该创建一个文件，例如 `L.KittenLayer.js`：
L.TileLayer.Kitten = L.TileLayer.extend({
getTileUrl: function(coords) {
var i = Math.ceil( Math.random() * 4 );
return "https://placekitten.com/256/256?image=" + i;
},
getAttribution: function() {
return "<a href='https://placekitten.com/attribution.html'>PlaceKitten</a>"
}
});
然后，在显示地图时引入该文件：
<html>
…
<script src='leaflet.js'>
<script src='L.KittenLayer.js'>
<script>
var map = L.map('map-div-id');
L.tileLayer.kitten().addTo(map);
</script>
…
### `L.GridLayer` 和 DOM 元素
另一种扩展方法是 `L.GridLayer.createTile()`。`L.TileLayer` 会把它当成一个图片的网格（如`<img>`元素）来处理，`L.GridLayer` 则允许创建任何种类的[HTML元素]的网格(https://developer.mozilla.org/en-US/docs/Web/HTML/Element)。
`L.GridLayer` 允许创建 `<img>` 的网格，但 [`<div>`](https://developer.mozilla.org/en-US/docs/Web/HTML/Element/div)、[`<canvas>`](https://developer.mozilla.org/en-US/docs/Web/HTML/Element/canvas) 或 [`<picture>`](https://developer.mozilla.org/en-US/docs/Web/HTML/Element/picture)（或任何东西）的网格也是可以的。`createTile()` 只需要返回 [`HTMLElement`](https://developer.mozilla.org/en-US/docs/Web/API/HTMLElement) 给定瓦片（tile）坐标的实例。了解如何操作 [DOM](https://developer.mozilla.org/en-US/docs/Web/API/Document_Object_Model/Introduction) 中的元素在这里很重要：Leaflet 需要实例 `HTMLElement`，因此使用 jQuery 等库创建的元素将有问题。
自定义的一个示例是在 .xml 文件 `GridLayer` 中显示瓦片（tile）坐标 <div>。这在调试 Leaflet 的内部结构以及了解 tile 坐标如何工作时特别有用：
L.GridLayer.DebugCoords = L.GridLayer.extend({
createTile: function (coords) {
var tile = document.createElement('div');
tile.innerHTML = [coords.x, coords.y, coords.z].join(', ');
tile.style.outline = '1px solid red';
return tile;
}
});
L.gridLayer.debugCoords = function(opts) {
return new L.GridLayer.DebugCoords(opts);
};
map.addLayer( L.gridLayer.debugCoords() );
如果元素必须做一些异步初始化，那么就使用第二个函数参数 `done`，并在瓦片（tile）准备好时（例如，当图像已被完全加载）或出现错误时回调它。在这里，我们将人为地延迟瓷砖：
createTile: function (coords, done) {
var tile = document.createElement('div');
tile.innerHTML = [coords.x, coords.y, coords.z].join(', ');
tile.style.outline = '1px solid red';
setTimeout(function () {
done(null, tile); // Syntax is 'done(error, tile)'
}, 500 + Math.random() * 1500);
return tile;
}
{% include frame.html url="gridcoords.html" %}
通过这些自定义的 `GridLayer`，一个插件可以完全控制构成网格的HTML元素。一些插件已经通过这种方式使用 `<canvas>` 来做高级渲染。
一个非常基础的 `<canvas>` `GridLayer` 类似这样：
L.GridLayer.CanvasCircles = L.GridLayer.extend({
createTile: function (coords) {
var tile = document.createElement('canvas');
var tileSize = this.getTileSize();
tile.setAttribute('width', tileSize.x);
tile.setAttribute('height', tileSize.y);
var ctx = tile.getContext('2d');
// Draw whatever is needed in the canvas context
// For example, circles which get bigger as we zoom in
ctx.beginPath();
ctx.arc(tileSize.x/2, tileSize.x/2, 4 + coords.z*4, 0, 2*Math.PI, false);
ctx.fill();
return tile;
}
});
{% include frame.html url="canvascircles.html" %}
## The pixel origin 像素原点
创建自定义的 "L.Layer "是可能的，但需要对Leaflet如何定位HTML元素有更深的了解。精简版是：
* 该 L.Map 容器具有"地图窗格（pane）"，这是<div>
* `L.Layer` 是地图窗格内的HTML元素
* 地图将所有 `LatLng` 转换为地图CRS中的坐标，再从CRS中转换为绝对的 "像素坐标"（CRS的原点与像素坐标的原点相同）
* 当 `L.Map` 准备好时（有一个中心 `LatLng` 和一个缩放级别），左上角的绝对像素坐标成为 "像素原点"
* 每个 `L.Layer` 都根据像素原点和该层 `LatLng` 的绝对像素坐标从其地图窗格中偏移
* 在 `L.Map` 上的每个 `zoomend` 或 `viewreset` 事件后，像素原点被重置，每个 `L.Layer` 必须重新计算其位置（如果需要的话）
* 在平移地图时，像素原点不会被重置；相反，整个窗格会被重新定位
这可能有点难以理解，因此请参考以下用来解释的地图：
{% include frame.html url="pixelorigin.html" %}
CRS原点（绿色）保持在同一个`LatLng`。像素原点（红色）总是从左上角开始。当地图被平移时，像素原点会移动（地图窗格会相对于地图的容器重新定位），而当缩放时，像素原点会保持在屏幕的同一位置（地图窗格（pane）不会被重新定位，但图层可能会重新绘制）。缩放时对像素原点的绝对像素坐标会被更新，但平移时不会被更新。请注意每次放大地图时，绝对像素坐标（到绿色括号的距离）是如何翻倍的。
如果要定位任何东西（例如，一个蓝色的`L.Marker'），它的`LatLng'被转换为地图的`L.CRS'内的绝对像素坐标。然后从它的绝对像素坐标中减去像素原点的绝对像素坐标，得到一个相对于像素原点（浅蓝色）的偏移。由于像素原点是所有地图窗格的左上角，这个偏移量可以应用于标记的图标的HTML元素。标记的`iconAnchor'（深蓝色线）是通过负的CSS边距实现的。
在 `L.Map.project()` 和 `L.Map.unproject()` 这些绝对像素坐标的方法进行操作。同样，`L.Map.latLngToLayerPoint()`和`L.Map.layerPointToLatLng()`也是使用相对于像素原点的偏移。
不同的层以不同的方式应用这些计算。`L.Marker` 只需重新定位他们的图标；`L.GridLayer` 计算地图的边界（在绝对像素坐标中），然后计算要请求的瓦片坐标列表；矢量图层（折线、多边形、圆形标记等）将每个图层转换 `LatLng` 为像素并使用 SVG 或 `<canvas>`。
### `onAdd` 和 `onRemove`
从本质上讲，所有 `L.Layer` 都是地图窗格中的 HTML 元素，它们的位置和内容由图层代码定义。但是，在实例化图层时无法创建 HTML 元素；相反，这是在将图层添加到地图时完成的 - 图层 document 直到那时才知道地图（甚至不知道）。
换句话说：地图调用图层的 `onAdd()` 方法，然后图层创建其HTML元素（通常称为'容器'元素）并将其添加到地图窗格中。反之，当图层从地图上删除时，它的 `onRemove()` 方法会被调用。当添加到地图上时，图层必须更新其内容，并在地图视图更新时重新定位它们。图层骨架如下所示：
L.CustomLayer = L.Layer.extend({
onAdd: function(map) {
var pane = map.getPane(this.options.pane);
this._container = L.DomUtil.create(…);
pane.appendChild(this._container);
// Calculate initial position of container with `L.Map.latLngToLayerPoint()`, `getPixelOrigin()` and/or `getPixelBounds()`
L.DomUtil.setPosition(this._container, point);
// Add and position children elements if needed
map.on('zoomend viewreset', this._update, this);
},
onRemove: function(map) {
L.DomUtil.remove(this._container);
map.off('zoomend viewreset', this._update, this);
},
_update: function() {
// Recalculate position of container
L.DomUtil.setPosition(this._container, point);
// Add/remove/reposition children elements if needed
}
});
如何准确定位图层的 HTML 元素取决于图层的具体情况，但本介绍应该可以帮助您阅读 Leaflet 的图层代码，并创建新图层。
### 使用父级的 `onAdd`
有些用例不需要重新创建整个 "onAdd "代码，而是可以重复使用父类的代码，然后可以在初始化之前或之后（根据需要）添加一些具体内容。
举个例子，我们可以有一个 `L.Polyline` 始终为红色的子类（忽略选项），例如：
L.Polyline.Red = L.Polyline.extend({
onAdd: function(map) {
this.options.color = 'red';
L.Polyline.prototype.onAdd.call(this, map);
}
});
| 32.317536 | 560 | 0.707582 | yue_Hant | 0.705406 |
61ab256bfadf3ffb53f865c5b520a062132e5f7f | 755 | md | Markdown | packages/default-reporter/README.md | kazuare/pnpm | 9b9b13c3a91402e9d211be0e3af02e0df8719f4b | [
"MIT"
] | 1 | 2022-03-03T02:24:47.000Z | 2022-03-03T02:24:47.000Z | packages/default-reporter/README.md | kazuare/pnpm | 9b9b13c3a91402e9d211be0e3af02e0df8719f4b | [
"MIT"
] | null | null | null | packages/default-reporter/README.md | kazuare/pnpm | 9b9b13c3a91402e9d211be0e3af02e0df8719f4b | [
"MIT"
] | null | null | null | # @pnpm/default-reporter
> The default reporter of pnpm
## Installation
```
pnpm add @pnpm/default-reporter
```
## Usage
```ts
import { streamParser } from '@pnpm/logger'
import defaultReporter from '@pnpm/default-reporter'
const stopReporting = defaultReporter({
context: {
argv: [],
},
streamParser,
})
try {
// calling some pnpm APIs
} finally {
stopReporting()
}
```
## Style Guide
1. Never use blue or grey as font color as they are hard to read in many consoles.
1. Use dim instead of grey
1. Use cyan bright instead of blue
1. Don't hide the CLI cursor. (It is easier to never hide but it is really needed only when scripts are running.)
1. Don't use green and yellow to distinct something.
## License
[MIT](LICENSE)
| 17.97619 | 113 | 0.696689 | eng_Latn | 0.982059 |
61ab4a7bf56f6a5452807b9f774e6fee9b0bc8c0 | 1,675 | md | Markdown | _publications/arxivcausalalibaba2019.md | wenhaoz-fengcai/wenhaoz-fengcai.github.io | 6341860ebe2928a97b17bfce23c9a80ff26ae5d4 | [
"MIT"
] | null | null | null | _publications/arxivcausalalibaba2019.md | wenhaoz-fengcai/wenhaoz-fengcai.github.io | 6341860ebe2928a97b17bfce23c9a80ff26ae5d4 | [
"MIT"
] | 3 | 2019-12-01T06:21:51.000Z | 2021-09-28T00:01:08.000Z | _publications/arxivcausalalibaba2019.md | wenhaoz-fengcai/wenhaoz-fengcai.github.io | 6341860ebe2928a97b17bfce23c9a80ff26ae5d4 | [
"MIT"
] | null | null | null | ---
title: "A Causal Perspective to Unbiased Conversion Rate Estimation on Data Missing Not at Random"
collection: publications
permalink: /publication/arxivcausalalibaba2019
date: 2019-10-15
venue: 'arXiv'
paperurl: 'https://arxiv.org/pdf/1910.09337'
---
In modern e-commerce and advertising recommender systems, ongoing research works attempt to optimize conversion rate (CVR) estimation, and increase the gross merchandise volume. Even though the state-of-the-art CVR estimators adopt deep learning methods, their model performances are still subject to sample selection bias and data sparsity issues. Conversion labels of exposed items in training dataset are typically missing not at random due to selection bias. Empirically, data sparsity issue causes the performance degradation of model with large parameter space. In this paper, we proposed two causal estimators combined with multi-task learning, and aim to solve sample selection bias (SSB) and data sparsity (DS) issues in conversion rate estimation. The proposed estimators adjust for the MNAR mechanism as if they are trained on a "do dataset" where users are forced to click on all exposed items. We evaluate the causal estimators with billion data samples. Experiment results demonstrate that the proposed CVR estimators outperform other state-of-the-art CVR estimators. In addition, empirical study shows that our methods are cost-effective with large scale dataset.
[Download paper here](http://wenhaoz.io/files/1910.09337.pdf)
Recommended citation: Zhang, Wenhao, et al. "A Causal Perspective to Unbiased Conversion Rate Estimation on Data Missing Not at Random." arXiv preprint arXiv:1910.09337 (2019). | 128.846154 | 1,178 | 0.813731 | eng_Latn | 0.984647 |
61ac3efe780121c25375023f6ed72f26003d7d04 | 1,457 | md | Markdown | cds/orgsvc/C#/ValidateAndSetRecordState/README.md | ghurlman/PowerApps-Samples | 13f7b9ecc4c8b9deb34d8dc850d3b06718072aa7 | [
"MIT"
] | 1 | 2020-10-16T13:17:55.000Z | 2020-10-16T13:17:55.000Z | cds/orgsvc/C#/ValidateAndSetRecordState/README.md | ghurlman/PowerApps-Samples | 13f7b9ecc4c8b9deb34d8dc850d3b06718072aa7 | [
"MIT"
] | 1 | 2020-06-18T15:34:08.000Z | 2020-06-18T15:34:08.000Z | cds/orgsvc/C#/ValidateAndSetRecordState/README.md | ghurlman/PowerApps-Samples | 13f7b9ecc4c8b9deb34d8dc850d3b06718072aa7 | [
"MIT"
] | 1 | 2020-07-30T12:25:55.000Z | 2020-07-30T12:25:55.000Z | # Sample: Validate record state and set the state of record
This sample shows how to validate a change of state of an entity and set a state of an entity.
## How to run this sample
See [How to run samples](https://github.com/microsoft/PowerApps-Samples/blob/master/cds/README.md) for information about how to run this sample.
## What this sample does
The `IsValidStateTransitionRequest` message is intended to be used in a scenario where it contains the data that is needed to validate the state transition.
## How this sample works
In order to simulate the scenario described in [What this sample does](#what-this-sample-does), the sample will do the following:
### Setup
1. Checks for the current version of the org.
2. The `CreateRequiredRecords` method creates any entity records that this sample requires.
### Demonstrate
1. The `EntityReference` method creates a EntityReference to represent open case.
2. The `IsValidStateTransitionRequest` method sets the transition request to an open case.
3. The `checkState.NewState` property checks if a new state of resolved and a new state of problem solved are valid.
4. The `IsValidStateTransitionResponse` method executes the request.
### Clean up
Display an option to delete the sample data that is created in [Setup](#setup). The deletion is optional in case you want to examine the entities and data created by the sample. You can manually delete the records to achieve the same result.
| 44.151515 | 241 | 0.78243 | eng_Latn | 0.99893 |
61ad621ab0d12f838b5731cd9de51ae35a7d3362 | 310 | markdown | Markdown | _posts/2020-01-06-la-porte-du-changement.markdown | hugolmn/garanse | b98022676274f0ff9580d1a642d878db23ebd03f | [
"MIT"
] | null | null | null | _posts/2020-01-06-la-porte-du-changement.markdown | hugolmn/garanse | b98022676274f0ff9580d1a642d878db23ebd03f | [
"MIT"
] | null | null | null | _posts/2020-01-06-la-porte-du-changement.markdown | hugolmn/garanse | b98022676274f0ff9580d1a642d878db23ebd03f | [
"MIT"
] | 1 | 2020-07-24T20:56:25.000Z | 2020-07-24T20:56:25.000Z | ---
layout: painting
title: "La porte du changement ne peut s'ouvrir que de l'intérieur."
title_author: Jacques Salomé
date: 2020-01-06
technique: Huile sur toile
dimensions: 80x80
price: 600
image: DSC_1352_(2).JPG
author: Garanse
tags:
- Bleu
- Vert
---
 | 20.666667 | 69 | 0.719355 | fra_Latn | 0.541082 |
8aa57381f7d6cfa739f4ce15763057861e5c9eea | 898 | md | Markdown | src/pages/events/2020-04-21-weights-1.md | 4ools/calandr-v2 | 4991be8d3a87625ebf788c293480abe9b350b907 | [
"MIT"
] | null | null | null | src/pages/events/2020-04-21-weights-1.md | 4ools/calandr-v2 | 4991be8d3a87625ebf788c293480abe9b350b907 | [
"MIT"
] | 8 | 2020-04-08T20:30:49.000Z | 2020-04-08T21:02:04.000Z | src/pages/events/2020-04-21-weights-1.md | 4ools/calandr-v2 | 4991be8d3a87625ebf788c293480abe9b350b907 | [
"MIT"
] | null | null | null | ---
templateKey: event
title: Weights
start: 2020-04-27T10:10:00.000Z
end: 2020-04-27T10:40:00.000Z
description: >-
**You need weights for this guy, ideally a light and heavy set of hand
weights**
Get more work done in less time with compound, functional exercises. Use this total body workout with dumbbells to improve strength, build lean muscle, and burn fat all with just one routine. You may always want to have a chair, box, or bench available, but it isn’t required.
- A1: Front Reverse Lunge / Split Squat 2 x 8 each leg
- A2: Straight Arm Pullbacks 2 x 12
- B1: Stiff Leg Deadlift + Shrug + Calf Raise / RDL 2 x 12
- B2: Standing Low DB Fly 2 x 12
- C1: Bear Plank Hammer Curl / from Knees 2 x 12 each
- C2: Slow Tempo Squats 2 x 12
- D1: Elevated High Plank Row 2 x 12 each arm
- D2: Elevated / Close Grip Pushup / Inverted 2 x 12
yt_id: kP4xP0hZ0EI
---
| 28.967742 | 278 | 0.708241 | eng_Latn | 0.987684 |
8aa5b5594586daed154cf31911145b0e14802767 | 1,942 | md | Markdown | content/gewichtsreduktion.md | lcdave/praxis-menssana | 6d9b0b30df0272fa94d49a778b245c7a7d305cd9 | [
"MIT"
] | null | null | null | content/gewichtsreduktion.md | lcdave/praxis-menssana | 6d9b0b30df0272fa94d49a778b245c7a7d305cd9 | [
"MIT"
] | null | null | null | content/gewichtsreduktion.md | lcdave/praxis-menssana | 6d9b0b30df0272fa94d49a778b245c7a7d305cd9 | [
"MIT"
] | null | null | null | ---
seoTitle: Hypnosetherapie unterstützt sie im Abnehmprozess
seoDescription: Mit der Hypnosetherapie überflüssige Kilos verlieren und das Wunschgewicht dauerhaft halten
seoKeywords: Abnehmen, Übergewicht verlieren, Wunschgewicht, schlank sein, schlanker Körper, Traumfigur, Diät, Essgewohnheiten ändern, nachhaltig abnehmen, dauerhaft schlank, Heisshunger, hypnotisches Magenband
headerimage: /assets/headerimage.jpg
headertitle: Gewichtsreduktion
---
## Definition
Viele Menschen sind mit ihrem Gewicht unzufrieden und verspüren den Wunsch abzunehmen. Die schlechten oder falschen Essgewohnheiten zu ändern ist schwierig und jedes Scheitern kann schnell zum Gefühl des Versagens führen.
Übergewichtige Menschen können ihr „Suchtmittel“ nicht einfach meiden. Da man Essen muss, geht es darum einen vernünftigen Umgang mit seinem „Suchtmittel“ zu erlernen. Die Anstrengungen die nötig sind, um dauerhaft abzunehmen, können mit jenen eines Spitzensportlers verglichen werden. Disziplin, Ausdauer und tägliches Training sind nötig um das Wunschgewicht zu erreichen und konstant zu halten.
Zu Beginn der Therapie wird der Grund, die Motivation die hinter dem Wunsch „ich will abnehmen“ steht konkretisiert, welche Werte, welche Einstellungen bestimmen das Verhalten. Die gewonnenen Erkenntnisse werden in der Hypnosetherapie dann utilisiert (verwendet)…..im Zustand der Trance wird im Unterbewusstsein ein Suchprozess angeregt, um die im Menschen bereits vorhanden Ressourcen (Fähigkeiten, Hilfsmittel Kompetenzen) zu erkennen, die den Abnehmprozess unterstützen können.
Bitte beachten Sie, dass auch mit Hilfe der Hypnosetherapie die Kilos nicht einfach über Nacht verschwinden. Wichtig, wie immer in der Hypnosetherapie, ist die Motivation und die Bereitschaft des Klienten auch liebgewonnene Gewohnheiten loszulassen um das von ihm definierte Ziel erreichen zu können.
Beim Vorliegen von Essstörungen wenden Sie sich bitte an einen Arzt. | 121.375 | 480 | 0.838826 | deu_Latn | 0.999474 |
8aa688c6bea857659e305074fbb10c9b88b98eda | 13,353 | md | Markdown | docs/build/common-visual-cpp-arm-migration-issues.md | Mdlglobal-atlassian-net/cpp-docs.it-it | c8edd4e9238d24b047d2b59a86e2a540f371bd93 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/build/common-visual-cpp-arm-migration-issues.md | Mdlglobal-atlassian-net/cpp-docs.it-it | c8edd4e9238d24b047d2b59a86e2a540f371bd93 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/build/common-visual-cpp-arm-migration-issues.md | Mdlglobal-atlassian-net/cpp-docs.it-it | c8edd4e9238d24b047d2b59a86e2a540f371bd93 | [
"CC-BY-4.0",
"MIT"
] | 1 | 2020-05-28T15:54:57.000Z | 2020-05-28T15:54:57.000Z | ---
title: Problemi comuni relativi alla migrazione di Visual C++ ARM
ms.date: 05/06/2019
ms.assetid: 0f4c434e-0679-4331-ba0a-cc15dd435a46
ms.openlocfilehash: 2c29b4ffa5344b309622314970ce52c47a0ebd05
ms.sourcegitcommit: c123cc76bb2b6c5cde6f4c425ece420ac733bf70
ms.translationtype: MT
ms.contentlocale: it-IT
ms.lasthandoff: 04/14/2020
ms.locfileid: "81328801"
---
# <a name="common-visual-c-arm-migration-issues"></a>Problemi comuni relativi alla migrazione di Visual C++ ARM
Quando si usa il compilatore Microsoft C++ (MSVC), lo stesso codice sorgente C++ potrebbe produrre risultati diversi sull'architettura ARM rispetto alle architetture x86 o x64.
## <a name="sources-of-migration-issues"></a>Origini dei problemi di migrazione
Molti problemi che potrebbero verificarsi quando si esegue la migrazione del codice dalle architetture x86 o x64 all'architettura ARM sono correlati a costrutti di codice sorgente che potrebbero richiamare un comportamento non definito, definito dall'implementazione o non specificato.
Un *comportamento non definito* è il comportamento che lo standard C++ non definisce e che è causato da un'operazione che non ha un risultato ragionevole, ad esempio la conversione di un valore a virgola mobile in un Unsigned Integer o lo spostamento di un valore in base a un numero di posizioni negativo o superiore al numero di bit nel tipo innalzato di livello.
Il comportamento *definito dall'implementazione* è il comportamento che lo standard C++ richiede al fornitore del compilatore di definire e documentare. Un programma può basarsi tranquillamente sul comportamento definito dall'implementazione, anche se questa operazione potrebbe non essere portabile. Tra gli esempi di comportamento definito dall'implementazione sono incluse le dimensioni dei tipi di dati incorporati e i relativi requisiti di allineamento. Un esempio di un'operazione che potrebbe essere interessata dal comportamento definito dall'implementazione è l'accesso all'elenco di argomenti variabili.
Un *comportamento non specificato* è il comportamento che lo standard C++ lascia intenzionalmente non deterministico. Sebbene il comportamento sia considerato non deterministico, le chiamate particolari di comportamenti non specificati sono determinate dall'implementazione del compilatore. Tuttavia, non è necessario che un fornitore del compilatore predetermini il risultato o garantisca un comportamento coerente tra chiamate confrontabili e non vi sia alcun requisito per la documentazione. Un esempio di comportamento non specificato è l'ordine in cui vengono valutate le sottoespressioni, che includono gli argomenti di una chiamata di funzione.
Altri problemi di migrazione possono essere attribuiti alle differenze hardware tra le architetture ARM e x86 o x64 che interagiscono con lo standard C++ in modo diverso. Ad esempio, il modello di memoria forte dell'architettura x86 e x64 fornisce `volatile`variabili qualificate alcune proprietà aggiuntive che sono state usate per facilitare determinati tipi di comunicazione tra thread in passato. Tuttavia, il modello di memoria debole dell'architettura ARM non supporta questo utilizzo, né lo standard C++ lo richiede.
> [!IMPORTANT]
> Sebbene `volatile` ottenga alcune proprietà che possono essere usate per implementare forme limitate di comunicazione tra thread su x86 e x64, queste proprietà aggiuntive non sono sufficienti per implementare la comunicazione tra thread in generale. Lo standard C++ consiglia di implementare tali comunicazioni usando invece le primitive di sincronizzazione appropriate.
Poiché le diverse piattaforme potrebbero esprimere questi tipi di comportamento in modo diverso, il trasferimento di software tra piattaforme può essere difficile e soggetto a errori se dipende dal comportamento di una piattaforma specifica. Sebbene molti di questi tipi di comportamento possano essere osservati e possano sembrare stabili, il loro uso è almeno non portabile e, in caso di comportamento non definito o non specificato, rappresenta anche un errore. Anche il comportamento menzionato in questo documento non dovrebbe essere basato su e potrebbe cambiare in futuro compilatori o implementazioni della CPU.
## <a name="example-migration-issues"></a>Problemi di migrazione di esempio
Nella parte restante di questo documento viene descritto in che modo il comportamento diverso di questi elementi del linguaggio C++ può produrre risultati diversi su piattaforme diverse.
### <a name="conversion-of-floating-point-to-unsigned-integer"></a>Conversione da virgola mobile a Unsigned Integer
Nell'architettura ARM la conversione di un valore a virgola mobile in un Integer a 32 bit viene saturata al valore più vicino che può essere rappresentato dal valore integer se il valore a virgola mobile non è compreso nell'intervallo che può essere rappresentato dall'intero. Nelle architetture x86 e x64, la conversione esegue il wrapping se l'intero è senza segno oppure è impostato su-2147483648 se il numero intero è firmato. Nessuna di queste architetture supporta direttamente la conversione dei valori a virgola mobile in tipi integer più piccoli; al contrario, le conversioni vengono eseguite a 32 bit e i risultati vengono troncati a una dimensione inferiore.
Per l'architettura ARM, la combinazione di saturazione e troncamento significa che la conversione in tipi senza segno satura correttamente i tipi senza segno più piccoli quando satura un intero a 32 bit, ma produce un risultato troncato per i valori di dimensioni maggiori rispetto al tipo più piccolo può rappresentare ma troppo piccolo per saturare l'intero a 32 bit completo. La conversione viene saturata correttamente anche per interi con segno a 32 bit, ma il troncamento di interi con segno saturi restituisce-1 per i valori con saturazione positiva e 0 per i valori con saturazione negativa. La conversione in un intero con segno più piccolo genera un risultato troncato che è imprevedibile.
Per le architetture x86 e x64, la combinazione del comportamento wrap-around per le conversioni di Unsigned Integer e la valutazione esplicita per le conversioni di interi con segno in caso di overflow, insieme al troncamento, rendono i risultati imprevedibili per la maggior parte dei turni se sono troppo grandi.
Queste piattaforme differiscono anche per il modo in cui gestiscono la conversione di NaN (non un numero) in tipi Integer. In ARM NaN converte in 0x00000000; in x86 e x64 viene convertito in 0x80000000.
È possibile fare affidamento sulla conversione a virgola mobile solo se si è certi che il valore sia compreso nell'intervallo del tipo integer in cui viene convertito.
### <a name="shift-operator---behavior"></a>Comportamento dell'operatore\< \< Shift ( >>)
Nell'architettura ARM un valore può essere spostato a sinistra o a destra fino a 255 bit prima che il modello inizi a essere ripetuto. Nelle architetture x86 e x64 il modello viene ripetuto a ogni multiplo di 32, a meno che l'origine del modello non sia una variabile a 64 bit. in tal caso, il modello si ripete a ogni multiplo di 64 su x64 e a ogni multiplo di 256 su x86, in cui viene utilizzata un'implementazione di software. Ad esempio, per una variabile a 32 bit il cui valore è 1 spostato a sinistra di 32 posizioni, su ARM il risultato è 0, su x86 il risultato è 1 e in x64 anche il risultato è 1. Tuttavia, se l'origine del valore è una variabile a 64 bit, il risultato su tutte e tre le piattaforme è 4294967296 e il valore non viene "avvolto" fino a quando non vengono spostate 64 posizioni su x64 o 256 posizioni su ARM e x86.
Poiché il risultato di un'operazione di spostamento che supera il numero di bit nel tipo di origine non è definito, non è necessario che il compilatore abbia un comportamento coerente in tutte le situazioni. Se, ad esempio, entrambi gli operandi di un turno sono noti in fase di compilazione, il compilatore può ottimizzare il programma utilizzando una routine interna per precalcolare il risultato dello spostamento e quindi sostituire il risultato al posto dell'operazione di spostamento. Se l'importo dello spostamento è troppo grande o negativo, il risultato della routine interna potrebbe essere diverso dal risultato della stessa espressione di spostamento eseguito dalla CPU.
### <a name="variable-arguments-varargs-behavior"></a>Comportamento degli argomenti variabili (varargs)
Nell'architettura ARM, i parametri dell'elenco di argomenti variabili passati nello stack sono soggetti a allineamento. Un parametro a 64 bit, ad esempio, è allineato a un limite di 64 bit. In x86 e x64 gli argomenti passati nello stack non sono soggetti a allineamento e a compressione. Questa differenza può causare una funzione Variadic come `printf` la lettura degli indirizzi di memoria che sono stati utilizzati come spaziatura interna su ARM se il layout previsto dell'elenco di argomenti variabili non corrisponde esattamente, anche se potrebbe funzionare per un subset di alcuni valori nelle architetture x86 o x64. Considerare questo esempio:
```C
// notice that a 64-bit integer is passed to the function, but '%d' is used to read it.
// on x86 and x64 this may work for small values because %d will "parse" the low-32 bits of the argument.
// on ARM the calling convention will align the 64-bit value and the code will print a random value
printf("%d\n", 1LL);
```
In questo caso, è possibile correggere il bug verificando che venga utilizzata la specifica di formato corretta, in modo che venga considerato l'allineamento dell'argomento. Questo codice è corretto:
```C
// CORRECT: use %I64d for 64-bit integers
printf("%I64d\n", 1LL);
```
### <a name="argument-evaluation-order"></a>Ordine di valutazione degli argomenti
Poiché i processori ARM, x86 e x64 sono così diversi, possono presentare requisiti diversi per le implementazioni del compilatore e anche opportunità diverse per le ottimizzazioni. Per questo motivo, insieme ad altri fattori quali le impostazioni di ottimizzazione e convenzione di chiamata, un compilatore può valutare gli argomenti della funzione in un ordine diverso in architetture diverse o quando vengono modificati gli altri fattori. Questo può causare il comportamento di un'app che si basa su un ordine di valutazione specifico per la modifica imprevista.
Questo tipo di errore può verificarsi quando gli argomenti di una funzione presentano effetti collaterali che influiscono su altri argomenti per la funzione nella stessa chiamata. In genere questo tipo di dipendenza è facile da evitare, ma a volte può essere nascosto dalle dipendenze difficili da discernere o dall'overload degli operatori. Si consideri l'esempio di codice seguente:
```cpp
handle memory_handle;
memory_handle->acquire(*p);
```
Questo aspetto è ben definito, ma se `->` e `*` sono operatori di overload, il codice viene convertito in un elemento simile al seguente:
```cpp
Handle::acquire(operator->(memory_handle), operator*(p));
```
Se è presente una dipendenza tra `operator->(memory_handle)` e `operator*(p)`, il codice può basarsi su un ordine di valutazione specifico, anche se il codice originale sembra non esiste alcuna dipendenza.
### <a name="volatile-keyword-default-behavior"></a>comportamento predefinito della parola chiave volatile
Il compilatore MSVC supporta due diverse interpretazioni del qualificatore di `volatile` archiviazione che è possibile specificare usando le opzioni del compilatore. L'opzione [/volatile: ms](reference/volatile-volatile-keyword-interpretation.md) seleziona la semantica volatile estesa Microsoft che garantisce un ordinamento sicuro, come è stato il caso tradizionale per x86 e x64 a causa del modello di memoria forte su tali architetture. L'opzione [/volatile: ISO](reference/volatile-volatile-keyword-interpretation.md) seleziona la normale semantica volatile standard C++ che non garantisce un ordinamento sicuro.
Nell'architettura ARM, il valore predefinito è **/volatile: ISO** perché i processori ARM hanno un modello di memoria ordinata in modo debole e perché il software ARM non ha un retaggio di basarsi sulla semantica estesa di **/volatile: ms** e in genere non deve interfacciarsi con il software che lo fa. Tuttavia, in alcuni casi è comunque utile o addirittura necessario compilare un programma ARM per usare la semantica estesa. Ad esempio, potrebbe essere troppo costoso trasferire un programma per l'uso della semantica ISO C++, oppure il software driver potrebbe dover rispettare la semantica tradizionale per funzionare correttamente. In questi casi, è possibile usare l'opzione **/volatile: ms** . Tuttavia, per ricreare la semantica volatile tradizionale sulle destinazioni ARM, il compilatore deve inserire barriere di memoria attorno a ogni lettura o `volatile` scrittura di una variabile per applicare un ordinamento sicuro, che può avere un impatto negativo sulle prestazioni.
Nelle architetture x86 e x64 il valore predefinito è **/volatile: ms** perché gran parte del software già creato per queste architetture con MSVC si basa su di essi. Quando si compilano programmi x86 e x64, è possibile specificare l'opzione **/volatile: ISO** per evitare la dipendenza non necessaria dalla semantica volatile tradizionale e per promuovere la portabilità.
## <a name="see-also"></a>Vedere anche
[Configurare Visual C++ per processori ARM](configuring-programs-for-arm-processors-visual-cpp.md)
| 128.394231 | 986 | 0.812252 | ita_Latn | 0.999696 |
8aa68cf191c0bc929fff03f31ce3b2889d6cd75c | 94 | md | Markdown | README.md | elwirra/slubne-pogotowie | bde0e0091c487ceaf9f2698661fdd99a28ba92df | [
"MIT"
] | 1 | 2015-05-04T14:26:34.000Z | 2015-05-04T14:26:34.000Z | README.md | elwirra/slubne-pogotowie | bde0e0091c487ceaf9f2698661fdd99a28ba92df | [
"MIT"
] | null | null | null | README.md | elwirra/slubne-pogotowie | bde0e0091c487ceaf9f2698661fdd99a28ba92df | [
"MIT"
] | null | null | null | Slubne pogotowie - katalog firm oparty o angular-seed :)
by: Alicja Rakowska, css-candies.com | 31.333333 | 56 | 0.776596 | pol_Latn | 0.989605 |
8aa6be4e8e52d467f9ce992d5bf38648d9fb8aa8 | 2,468 | md | Markdown | README.md | seerbit/seerbit-reactjs | a3af3de0cd1ff76b19a6eb0a7bf16e2ac2fb14e4 | [
"MIT"
] | null | null | null | README.md | seerbit/seerbit-reactjs | a3af3de0cd1ff76b19a6eb0a7bf16e2ac2fb14e4 | [
"MIT"
] | null | null | null | README.md | seerbit/seerbit-reactjs | a3af3de0cd1ff76b19a6eb0a7bf16e2ac2fb14e4 | [
"MIT"
] | 2 | 2021-09-02T13:02:34.000Z | 2022-02-21T22:37:29.000Z | <div align="center">
<img width="400" valign="top" src="https://res.cloudinary.com/dpejkbof5/image/upload/v1620323718/Seerbit_logo_png_ddcor4.png">
</div>
<h1 align="center">
<img width="60" valign="bottom" src="https://reactnative.dev/img/header_logo.svg" alt="ReactJS">
SeerBit
</h1>
# Seerbit Checkout Wrapper for ReactJS
# Requirements
This module was built and tested using React 15.0.0 - 16.0.0
## Get Started
A simple way to add Seerbit to your React application
[](https://www.npmjs.com/package/react-seerbit) [](https://standardjs.com)
## Install
```bash
npm install --save seerbit-reactjs
```
## Usage
```jsx
import React, { Component } from "react";
import SeerbitCheckout from "seerbit-reactjs"
export default class App extends Component {
constructor(props) {
super(props);
this.state = {
public_key: "YOUR_API_KEY",
amount: 100,
tranref: new Date().getTime(),
customization: {
theme: {
border_color: "#000000",
background_color: "#004C64",
button_color: "#0084A0",
},
payment_method: ["card", "account", "transfer", "wallet"],
display_fee: true, // true
display_type: "embed", //inline
logo: "logo_url | base64",
}
};
}
close = (close) => {
console.log(close);
};
callback = (response) => {
console.log(response);
};
checkProgress = (progress)=>{
console.log(progress)
}
render() {
return (
<SeerbitCheckout
className="btn seerbit-btn"
type='div'
tranref={this.state.tranref}
currency={"NGN"}
description={"shopping"}
country={"NG"}
clientappcode="app1"
public_key={this.state.public_key}
callback={this.callback}
close={this.close}
scriptStatus={this.checkProgress}
amount={this.state.amount}
tag={"button"}
full_name={"James Brown"}
email={"a@b.com"}
mobile_no={"00000000000"}
customization={this.state.customization}
version={"1"}
title={'Pay with SeerBit'}
/>
);
}
}
```
Please checkout <a href='https://doc.seerbit.com'>Seerbit Documentation</a> for other available options you can add to the tag
## License
MIT © [seerbit](https://github.com/seerbit)
| 24.929293 | 219 | 0.622771 | eng_Latn | 0.346272 |
8aa6d5d311bba350edf3aa743483eca50e17beb1 | 633 | md | Markdown | README.md | wangning316/License-plate-detection-and-recognition- | da7bc19777c49e270cfe4f8e5c073bf7c3c4ccd2 | [
"MIT"
] | 4 | 2019-01-26T15:19:02.000Z | 2020-04-02T13:54:38.000Z | README.md | wangning316/License-plate-detection-and-recognition- | da7bc19777c49e270cfe4f8e5c073bf7c3c4ccd2 | [
"MIT"
] | 1 | 2020-04-08T08:10:47.000Z | 2020-04-08T08:10:47.000Z | README.md | wangning316/License-plate-detection-and-recognition- | da7bc19777c49e270cfe4f8e5c073bf7c3c4ccd2 | [
"MIT"
] | null | null | null | # License plate detection and recognition
This work incorporates a simple interface with code to be optimized, and will be updated in succession...
## Environments
Environment：Ubuntu14.04 + cuda8.0 + cudnn6.0 + python3.5
It was tests both on Windows and Linux, you can follow the instruction to make this demo work.
## Demo Interface
### License Plate Detection and Recognition System：
### Vehicle Retrieval System:
| 42.2 | 111 | 0.778831 | eng_Latn | 0.869967 |
8aa729432925fd30041c03079f2c65006dae24cf | 4,683 | md | Markdown | README.md | rikku-pp/pepparkakskodning | 4310cc8bfa2265c5ed974997c5bb5969d59ea766 | [
"Apache-2.0"
] | null | null | null | README.md | rikku-pp/pepparkakskodning | 4310cc8bfa2265c5ed974997c5bb5969d59ea766 | [
"Apache-2.0"
] | null | null | null | README.md | rikku-pp/pepparkakskodning | 4310cc8bfa2265c5ed974997c5bb5969d59ea766 | [
"Apache-2.0"
] | null | null | null | # Semmelkodning
`Have Semmel-buns and bake prebuilt mini-quiz into an event page`
This small tutorial is made to be a fun way to get hands dirty with using bootstrap and adding things to it. The focus is to make custom interactivity using JS (JavaScript).
Bootstrap is used to get started quick, have a full responsive page to work with. To learn how the web site was set up in its original form, see [pink tutorial](https://www.pinkprogramming.se/sv/blogginlagg/G%C3%B6r-en-snygg-hemsida-utan-att-vara-designer) (Swedish).
## Part 1 - Let's add an interactive component!
Set up the project by clicking:
[](https://glitch.com/edit/#!/remix/pp-semmelkodning)
#### Add the page styling
1. In _index.html_: Copy-paste `<aside>...Hoppas vi ses!...</aside>` to right after `<section id="register">...</section>`.
2. Change id-value to "quiz", and class-value to "bg-info" (color change)
3. Add a suitable paragraph tag `<p...</p>` after `<h2...</h2>` for description
4. Copy-paste the column `<div class="col-lg-8 mx-auto">...</div>` next to it
5. Change the column sizes (Bootstrap has a maximum of '12') to create a balance between the flowing description and the more boxy quiz-to-come.
#### Add the quiz
1. We need the code from last workshop [pp-quiz-base](https://glitch.com/edit/#!/pp-quiz-base?path=views/index.html)
Copy the content the .js files into this project. Do it manually or open the console from "Advanced Options" and enter:
$`git clone https://gist.github.com/106f152a16e9eb88cbf247bb2f7a14b9.git`
$`mv 106f152a16e9eb88cbf247bb2f7a14b9 js-quiz` (renaming the folder)
$`rm -rf js-quiz/.git` (removing a subfolder we don't need here)
$`refresh` (making the new files appear in glitch)
2. At beginning of server.js, add the new folder with `app.use(express.static('js-quiz-base'));` (Unless you put it inside /public/)
3. At the end of index.html, put additional `<script...` for each js-file.
5. At the beginning of index.html, put additional `<link rel="style..` for css.
6. At beginning of client.js (//step2), replace `document.body = ...` with `var quizDiv = document.getElementById('pp-quiz-base');`
7. Then replace all occurances of "document.body" with "quizDiv". (Hint: select one occurance, press Ctrl+D repeatedly, then paste or type to replace)
-----------------------------------
## Part 2 - Let's improve the quiz!
#### Adding more questions
The existing code is hard to read and edit, and adding more question will make it worse, unless we first take some measures to reorganize them.
This part may take some time and struggles, but the result will be code that takes care of any number of questions with the same amount of code!
1. Write questions in json format.
2. Add variable "currentQuestion", set to 0 (means 1st in zero-based lists)
3. Make sure it is accessable, before starting to revise createQuestion.
4. Make createQuestion return an object with every html element needed.
5. Try setting the properties straight just for the 1st question.
6. When it works, make it into a function called setQuestionProps. It can be called dynamically when the question changes!
7. Repeat 4-6 with createResponse.
8. Challenge: Add answer validation logics!
HAPPY CODING!
------------------
-----------------------------------
#### _Extra: Bootstrap info_
Bootstrap contains a lot of ready to use CSS, but you don't have to know CSS to use it!
Luckily, Bootstrap's really popular tool to use and there are some good techniques and things to have in mind:
- There are _global styles_ for whole pages. On the other hand _Components_ are thought to be a smaller unit of ready-to-use styling.
- It's known for its _responsive_ features. Especially "grid" column layout.
- To use bootstrap _in code_ (not just design tools) there are CSS _classes_
- [about column layout settings](https://getbootstrap.com/docs/4.0/layout/grid/)
- [about alignment within](https://getbootstrap.com/docs/4.0/utilities/spacing/)
- [about background color](https://getbootstrap.com/docs/4.0/utilities/colors/)
- JS is not generally preferred when doing web design
## License
This project was forked from [https://github.com/PinkProgramming/pepparkakskodning](https://github.com/PinkProgramming/pepparkakskodning) and is free to use under Apache 2.0-license.
The "Creative theme template" is (c) 2013-2015 Iron Summit Media Strategies, LLC. Code
Further modifications and contents are (c) 2017-2018 Pink Programming | 46.83 | 267 | 0.733718 | eng_Latn | 0.974002 |
8aa791cd626b8a940cfff6a5d746cdc8fed3d359 | 2,882 | md | Markdown | docs/concepts/packages/garbage_collection.md | wwjiang007/fuchsia-1 | 0db66b52b5bcd3e27c8b8c2163925309e8522f94 | [
"BSD-2-Clause"
] | 210 | 2019-02-05T12:45:09.000Z | 2022-03-28T07:59:06.000Z | docs/concepts/packages/garbage_collection.md | PlugFox/fuchsia | 39afe5230d41628b3c736a6e384393df954968c8 | [
"BSD-2-Clause"
] | 56 | 2021-06-03T03:16:25.000Z | 2022-03-20T01:07:44.000Z | docs/concepts/packages/garbage_collection.md | PlugFox/fuchsia | 39afe5230d41628b3c736a6e384393df954968c8 | [
"BSD-2-Clause"
] | 73 | 2019-03-06T18:55:23.000Z | 2022-03-26T12:04:51.000Z | # Garbage collection
## Static vs dynamic indexing
Static indexing is used for base packages. At `pkgfs` startup, base packages are
pre-populated in `/pkgfs/packages` based on the `static_packages` index located in
`/system/data/static_packages`. These static packages are then used to bootstrap
the system, so that core components like `pkg_resolver`, `pkg_cache`, `netstack`,
`sysmgr` can be started.
`pkgfs` doesn't maintain state across reboots but the base package set is
guaranteed to always be present. Base packages cannot be deleted.
The dynamic index stores a mapping of all ephemerally fetched packages. `pkgfs`
will pre-populate the dynamic index with any present packages (i.e. `meta.far`
and all `BLOB`s resolved) listed in `/system/data/cache_packages`. In memory, the dynamic
index has the most recently resolved version of a package with the same name
by keying on the `$name/$variant` of the package. `pkgfs` then "forgets" about
the old version of the package. The old version of the package is still present
in the system but no longer referenced. The dynamic index is then used to implement
garbage collection.
## How to garbage collect
There is no notion of installing a package in fuchsia and likewise no notion of
deleting a package. Rather, garbage collection can be thought of as a means to
reclaim space. Garbage collection can be triggered manually by running `pkgctl gc`
or it can be triggered by the `system-updater`. The implementation of garbage
collection uses the [`fuchsia.space/Manager` protocol](https://fuchsia.dev/reference/fidl/fuchsia.space#Manager.Gc). The `system-updater` trigger
happens twice; once before a system update and once after fetching the [update package](update_pkg.md).
The `pkgfs` garbage collector currently uses set differences to determine which
packages are live packages. A package is considered live if any of the following
is true:
* A package is a base package in the static index.
* A package is in the process of being updated (by tracking the `meta.far` merkle
root and any missing `BLOB`s until they’ve been fully resolved).
* A package is the most recently resolved version of an ephemeral package according to its `meta` or `package` in the dynamic index.
When garbage collection runs, it deletes every `BLOB` in `blobfs` that is not referenced
by a live package.
## Known issues
Existing garbage collection implementation is suboptimal.
* An old version of an ephemeral package that is open can be garbage
collected. This may lead the garbage collector to erase a package out
from under a component.
* If `system-updater` fails to download a new package, the garbage collector
protects both the base package and the most recent package version, which leads
to duplicate copies of every package. If this happens, you should reboot the
Fuchsia device to clear the list of activated packages.
| 51.464286 | 145 | 0.788341 | eng_Latn | 0.998811 |
8aa7bc4570e6338e7ad12788fa8c783b6ea14187 | 19,872 | md | Markdown | documents/amazon-lumberyard-user-guide/doc_source/ai-concepts-sensory-models.md | siagholami/aws-documentation | 2d06ee9011f3192b2ff38c09f04e01f1ea9e0191 | [
"CC-BY-4.0"
] | 5 | 2021-08-13T09:20:58.000Z | 2021-12-16T22:13:54.000Z | documents/amazon-lumberyard-user-guide/doc_source/ai-concepts-sensory-models.md | siagholami/aws-documentation | 2d06ee9011f3192b2ff38c09f04e01f1ea9e0191 | [
"CC-BY-4.0"
] | null | null | null | documents/amazon-lumberyard-user-guide/doc_source/ai-concepts-sensory-models.md | siagholami/aws-documentation | 2d06ee9011f3192b2ff38c09f04e01f1ea9e0191 | [
"CC-BY-4.0"
] | null | null | null | # Sensory Models<a name="ai-concepts-sensory-models"></a>
## Overview<a name="ai-concepts-sensory-overview"></a>
This topic describes the modelling and principal operation of the sensors implemented in the Lumberyard AI system\. These include the visual sensors, sound sensors, and a general\-purpose signalling mechanism\.
Sensory information is processed during a full update of each enemy \(the actual time that a sensory event was received is asynchronous\)\. These sensors are the only interface the enemy has with the outside world, and provide the data that the enemy will use to assess their situation and select potential targets\. All sensors are completely configurable, and they can be turned on/off at runtime for any individual enemy\.
## Vision<a name="ai-concepts-sensory-vision"></a>
The visual sensory model is the heart of the AI system\. It is an enemy's most important sense\. The model is designed to simulate vision as realistically as possible, while still maintaining a low execution cost, using a combination of compromises and optimizations\.
During a full update for an individual enemy, the system traverses all potential targets from the enemy’s point of view and runs each one through a visibility determination routine\. All targets that survive this filtering procedure are placed in a visibility list that is maintained until the next full update\. For a target to persist as "visible" it must pass the visibility test in each full update\. Targets that change from visible to not visible during an update are moved to a memory targets list\. If a previously visible target becomes visible again, it is moved from the memory target list back to the visibility list\. Memory targets have an expiration time to simulate the enemy "forgetting" the target; this time interval is determined by several factors, including the threat index of the target and the length of time it was visible\. Visible targets are given the highest priority and will become the current attention target even if there is another target with a higher threat index\. This approach simulates the natural tendency of humans to act based on what they see faster than on what they remember \(or hear\)\.
## Visibility Determination<a name="ai-concepts-sensory-visibility-determination"></a>
The visibility determination routine determines whether a target is considered visible to an enemy\. It is run against each of the enemy's potential targets during a full update\.
### Identifying Targets<a name="ai-concepts-sensory-visibility-targets"></a>
Visibility determination can be very CPU intensive; to mitigate this cost, only potential targets are evaluated for visibility\. There is a mechanism to register any AI object as an object that should be included in the visibility determination \(including custom objects\)\. This includes objects such as the grenades in Lumberyard, flashlights, etc\. There are also special objects called attributes, which will be discussed in more detail later in this topic\.
To be considered a potential target, an AI object must be:
+ currently active
+ of a different species than the enemy \(enemies don't need to keep track of members of their own team\)
In addition, the visibility determination test is performed automatically against the player, even if the player is of the same species as the enemy\. This rule ensures that the player is accurately specified as an object type and is always taken into account when checking visibility\.
The game developer can also designate certain AI object types for visibility determination\. These custom types are added to a list maintained by the AI system identifying object types to be included in the visibility check\. Objects can be freely added to and removed from this list, even from script\. To include an object in the list, specify an assessment multiplier to the desired object type\. For example, refer to the file `aiconfig.lua`, which can be found in the `/scripts` directory\. For more about assessment multipliers, see the topics on threat assessment\.
### Checking Visibility<a name="ai-concepts-sensory-visibility-routine"></a>
Each potential target identified is evaluated for visibility using a series of tests\. In situations where the player is facing a single species, no visibility determination is performed between AI enemy objects, only against the player\.Key measures determining visibility include:
#### Sight\-range test<a name="ai-concepts-sensory-visibility-routine-sightrange"></a>
This check is done first, as it is fast and cheap to filter out all AI objects that are outside the enemy's sight range\. This is done by comparing the distance between enemy and target against the enemy's sight range value\.
**enemy sight range**
Floating point value that determines how far the enemy can see \(in meters\); the value represents the radius of a sphere with the enemy at the center\.
#### Field\-of\-view test<a name="ai-concepts-sensory-visibility-routine-fieldofview"></a>
Objects that are inside the enemy's sight range sphere are then checked for whether they are also inside the enemy's field of view \(FOV\)\.
**enemy field of view**
Floating point value that determines the angle of the enemy's visibility cone \(in degrees\); the cone's tip is at the enemy's head and extends outward in the direction the enemy is facing\.
The FOV is the angle that determines how far the enemy can see to the left and to the right of his current forward orientation \(that is, the scope of his peripheral vision\)\. For example, an FOV of 180 degrees means that the enemy can see everything which is 90 degrees or less to the left and 90 degrees or less to the right of the direction in which he is currently facing\. An FOV of 90 degrees means that he can see 45 degrees or less to the left and 45 degrees to the right of his current forward orientation\. The FOV check is performed using a simple dot product between the enemy's orientation vector and the vector created as the difference between the positions of the potential target and the enemy\. The resulting scalar is then compared to the value of the FOV\. Note that by using a conical shape, FOV is not limited to 2D representations\.
#### Physical ray test<a name="ai-concepts-sensory-visibility-routine-raytest"></a>
Objects that survive the two initial checks are very likely to be seen\. The next check is an actual ray trace through the game world, which is an expensive process\. Because the low layer of the AI system performs distributed updates over all frames, it is very seldom that a large number of rays needs to be shot per frame\. Exceptions include scenes with a high number of objects belonging to different species and huge combat scenes, such as those with more than 20 participants per species\.
The visibility physical ray is used to determine whether there are any physical obstacles between the enemy and the target\. It originates from the head bone of the enemy character \(or if the enemy does not have an animated character, it originates from the entity position – which is often on the ground\) and is traced to the head bone of the target \(if it has one, otherwise the entity position is used\)\. If this visibility ray hits anything in its path, then the target is considered not visible\. If the ray reaches the target without hitting any obstacles, then the target has passed this tests and can be added to the visibility list for this update\.
Not all obstacles are the same\. The physical ray test distinguishes between hard cover and soft cover obstacles\. For more information on how cover type affects enemy behavior, see the section on soft cover later in this topic\.
#### Perception test<a name="ai-concepts-sensory-visibility-routine-perception"></a>
This test is for player AI objects only \(and other AI objects as defined by the game developer\)\. Once the player has passed all the visibility tests for an enemy, this final test determines whether or not the enemy can see the player object\. Each enemy calculates a perception coefficient for the player target, which ultimately describes the likelihood that the enemy can see the target\.
**perception coefficient \(SOM value\)**
Floating point value \(between 0 and 10\) that defines how close the enemy is to actually seeing the target\.
The perception coefficient is calculated based on a range of factors, including the distance between enemy and target, height of the target, and whether the target is moving\. The value must reach the maximum value \(currently 10\) before it can receive a definite visual stimulus\-\-that is, see the target\.
For more details on how a perception value is derived, see the section on calculating perception later in this topic\.
## Soft Cover Visibility and Behavior<a name="ai-concepts-sensory-soft-cover"></a>
The physical ray test also evaluates the surface type of obstacles when determining visibility\. The AI system can discriminate between two types of surfaces: soft cover and hard cover\. The primary difference in a physical sense is that game players can pass through soft cover but cannot pass through hard cover\. Players can hide behind soft cover objects but the visibility determination is slightly “skewed” when a target is behind a soft cover object rather than a hard cover object or just in the open\. When determining a target's visibility behind soft cover, the AI system takes into account whether or not the enemy already identified the target as "living" \(not a memory, sound or other type of target\)\. If the enemy does not have a living target, then the soft cover is considered equal to hard cover and normal visibility determination is performed\. This occurs when the enemy is idle\-\-or when the enemy is looking for the source of a sound but has not yet spotted it\.
However, the behavior is slightly different when the enemy already has a target identified\. During the physical ray test, if only soft cover is detected between the enemy and their target, then the target will remain visible for short length of time\-\-between 3 and 5 seconds\. If the target remains behind soft cover during this time, the enemy will eventually lose the target and place a memory target at the last known position\. However, if the target leaves soft cover within this time, then the timer is reset and normal visibility rules are put into effect\.
This behavior simulates the following example: when a soldier perceives that the target has run inside a bush, they do not immediately forget about it because they can make out the target’s silhouette even inside the bush\. But following a target like that is difficult over time, and after a while the soldier will lose track of the target\. The same rules apply to covers made of penetrable cover, like wood, but the rationale is a bit different\. If a target runs behind a thin wooden wall, the soldier knows that bullets will still pierce the wall, so for a short time the target's position is still known, and the enemy continues to shoot through it\. This can make for some really intense situations in a Lumberyard game\.
In order for this process to work in a closed and rational system, all surfaces in the game need to be properly physicalized \(wood, grass, and glass should be soft cover, while rock, concrete, metal should be hard cover\)\. This is consistently done in Lumberyard\.
## Perception Calculation<a name="ai-concepts-sensory-perception"></a>
Unlike visibility between AI agents, visibility of player objects to enemy AI agents in Lumberyard is not an on/off switch\. This added layer of complexity is designed to allow for variations in game playing style \(such as action versus stealth\)\. Perception allows the player to make a certain number of mistakes and still be able to recover from them\. \(This is one of the reasons why a player AI object is specifically defined even in the lowest layer of the AI system hierarchy\.\) It is not used with other AI objects, where “switch” vision is used \(that is, the target is visible as soon as a ray can be shot to its position\)\. Note that it is possible to declare some AI objects should also trigger use of a perception coefficient\.
An enemy is given a perception coefficient that describes how close the enemy is to actually seeing a particular target\. The initial value of the perception coefficient is 0 and increases or decreases based on a defined set of rules\. If a player target passes all prior visibility tests, the enemy begins applies the perception coefficient\. Once the maximum value has been reached, the player target is visible to the enemy\. This statement contains several corollaries:
+ Each enemy has a perception coefficient for each player target it is processing\.
+ Each enemy will receive notification that the player target is visible only after the perception coefficient reaches maximum value\.
+ The perception coefficient of two different enemies are unrelated, even for the same player target\.
+ There is no game\-level perception coefficient \(that is, a value that determines how any enemy perceives a player target\), although this information could be derived by statistics\.
When an enemy starts receiving notification that a player target is passing the visibility determination routine, it begins calculating the perception coefficient\. This is done by evaluating the following factors, all of which impact the rate at which the coefficient increases\. Keep in mind that a player target must still pass all other phases of the visibility determination routine before the perception coefficient is applied\.
**Distance**
Distance between the enemy and the player target has the highest influence on perception\. The closer the player target is to the enemy, the faster the coefficient rises, while greater distances cause the coefficient to rise slower\. The increase function is a basic quadratic function\. At distances very close to the enemy, the time to reach maximum perception is almost non\-existent and the target is instantly seen\. In contrast, a player target may be able to move more freely along the boundaries of the enemy's sight range, as the perception value rises more slowly\.
**Height from ground**
This factor takes into account the player target’s distance above the ground\. The rationale for this behavior is that a prone target is much harder to spot than one who is standing upright\. The AI system measures the distance of the target from the ground based on the “eye height” property of an AI object\. This property is set when the AI object is initialized, and can be changed at any time during execution of the game\. If enemies and players are represented in the game by animated characters, the eye height is calculated using the actual height of the character's head bone\. This factor influences the rate of increase in the perception coefficient as follows: if the player target has a height above ground of less than one meter, the increase due to distance is lowered by 50%\.
**Target motion**
The perception coefficient is affected by whether or not the player target is moving\. Movement attracts attention, while stationary targets are harder to spot\. This factor influences the rate of increase in the perception coefficient as follows: if the player target is standing still, the increase due to other factors is lowered by additional 50%\.
**Artificial modifiers**
Additional values can define how fast the perception coefficient increases\. Some affect all enemies in the game world, while some affect only particular targets\. An example of a modifier that affects all enemies is the console variable `ai_SOM_SPEED`\. Its default value varies depending on a game's difficulty level, but it provides a constant multiplier that is applied on top of all other calculations, and it applies to all enemies\. In contrast, it is possible to set a custom multiplier for a specified object type that is used only for certain player targets; however, this setting is limited to the lowest level of the AI system and is not available for tweaking\.
The effect of perception is cumulative while the target is considered visible to the enemy\. A floating point value is calculated based on the factors described above, and each time the enemy fully updated, this value is added to the perception coefficient \(along with an updated visibility determination\)\. So, for example, a player target that is within the enemy's range of sight might remain unperceived by the enemy significantly longer if they are crouching and motionless\.
At the same time, a non\-zero perception coefficient can fall back to zero over time if value is not increased constantly with each full update\. For example, a player target might become visible for a few seconds, raise the coefficient up to 5, and then break visual contact\. In this scenario, the coefficient will drop slowly to zero\. This scenario was implemented to reward players that tactically advance and then pause before continuing; players can wait for the coefficient to drop to zero before continuing to sneak\.
A statistical overview of the perception coefficients of all enemies for a player is used for the HUD stealth\-o\-meter, showing as a small gauge to the left and right of the radar circle in the HUD\. It represents the highest perception coefficient of the player across all enemies that currently perceive him\. In effect, it shows the perception coefficient of the one enemy that is most likely to see the player\. so, a full stealth\-o\-meter does not mean that all enemies see the player; it means that there is at least one enemy that can\. An empty stealth\-o\-meter means that currently no enemy can see the player\.
## Attribute Objects<a name="ai-concepts-sensory-attributes"></a>
An attribute object is not a full AI object; instead, it is more of a special helper that can be attributed to an existing AI object\. The attribute is a special class of AI object, specifically defined at the lowest level in the AI system\. Every attribute object must have a principal object associated with it\. The principal object can be any type of an object \(including puppet, vehicle, player, etc,\.\) but cannot be an attribute\.
Attributes can impact visibility determination\. When an enemy determines that it sees an attribute object, the system will switch the attribute with the principal object before adding it into the visibility list of the enemy\. Thus, an enemy who sees an attribute will believe it is seeing the principal object attached to the attribute\.
Essentially, attributes are a systematic way of connecting certain events to a single target\. For example, a player switches on a flashlight and the beam hits a nearby wall\. The light hitting the wall creates an attribute object associated with the principal object, which is the player\. In this scenario, the player is hidden, but because an enemy sees the attribute object \(the light on the wall\), it will in fact "see" the player\. The rationale is that enemies have enough intelligence to interpolate the origin of the light ray and thus know the player’s position\.
This feature is also used with regard to rocks, grenades, rockets etc\. It can be extended to add more features to a game; for example, a target might leave footprints on the ground that evaporate over time\. The footprints spawn attribute objects, which enable any enemy who sees them to perceive the location of the target who left them\. Another application might be blood tracks\.
To ensure that attribute objects are included in the visibility determination, they must have an assessment multiplier set\. Refer to `aiconfig.lua` in the `Scripts\AI` directory to see where the AI system defines the multiplier for attribute objects\. | 165.6 | 1,136 | 0.79368 | eng_Latn | 0.999933 |
8aa7dac755208eb5a42fc1436a00a60befe86221 | 564 | md | Markdown | README.md | tynn-xyz/semantic-version | 70c5af4842068be8e28e34086e1b1ccf1a3f78ad | [
"MIT"
] | null | null | null | README.md | tynn-xyz/semantic-version | 70c5af4842068be8e28e34086e1b1ccf1a3f78ad | [
"MIT"
] | null | null | null | README.md | tynn-xyz/semantic-version | 70c5af4842068be8e28e34086e1b1ccf1a3f78ad | [
"MIT"
] | null | null | null | # Hello world javascript action
[![units-test][units-test-badge]][units-test]
This action provides a semantic version from a raw version input.
## Inputs
### `versioning`
**Required** The `string` including the version to coerce.
## Outputs
### `version`
The semantic version coerced from `versioning`
## Example usage
```
uses: tynn-xyz/semantic-version@v1
with:
versioning: 'v1'
```
[units-test]: https://github.com/tynn-xyz/semantic-version/actions
[units-test-badge]: https://github.com/tynn-xyz/semantic-version/workflows/units-test/badge.svg
| 20.142857 | 97 | 0.725177 | eng_Latn | 0.593515 |
8aa7e724355b9001832883ff6b7c6df2744c40df | 231 | md | Markdown | docs/data-tables/focusable.md | davydof/ally.js | b8fd3cdbb9464df08708f11cba35b7481ad846d4 | [
"MIT"
] | 1,678 | 2015-01-04T10:55:36.000Z | 2022-03-21T22:58:31.000Z | docs/data-tables/focusable.md | davydof/ally.js | b8fd3cdbb9464df08708f11cba35b7481ad846d4 | [
"MIT"
] | 160 | 2015-01-04T19:46:21.000Z | 2022-01-24T20:06:21.000Z | docs/data-tables/focusable.md | davydof/ally.js | b8fd3cdbb9464df08708f11cba35b7481ad846d4 | [
"MIT"
] | 107 | 2015-01-29T19:33:04.000Z | 2022-01-17T19:06:39.000Z |
# Focusable elements - browser compatibility table
This placeholder-document is replaced by `npm run build:data-tables` in the `dist` directory.
[See this table on the website](https://allyjs.io/docs/data-tables/focusable.html)
| 33 | 93 | 0.779221 | eng_Latn | 0.947904 |
8aa814e74c436c63e819ddaaa69cbf168c1c6ecf | 904 | md | Markdown | README.md | shaddygarg/vehicle-velocity-estimator | f9c47f6fe3ac7db86668c2e7a03f6c56c6136399 | [
"MIT"
] | 5 | 2019-04-07T21:55:02.000Z | 2020-03-05T07:29:39.000Z | README.md | shaddygarg/vehicle-velocity-estimator | f9c47f6fe3ac7db86668c2e7a03f6c56c6136399 | [
"MIT"
] | null | null | null | README.md | shaddygarg/vehicle-velocity-estimator | f9c47f6fe3ac7db86668c2e7a03f6c56c6136399 | [
"MIT"
] | null | null | null | # vehicle-velocity-estimator
This projects aims to estimate the velocity of vehicles moving on road from the CCTV footage of the road.
The implementation uses Lucas Kanade algorithm along with Optical Flow for generating a set of good points and tracking then for estimating the velocity of the moving object. Background removal using KNN algorithm is used for instantiating the tracking process whenever a new object is detected.
## Requirements
* OpenCV2
> sudo apt-get install python-opencv
* Python2.x
* numpy
> sudo pip install numpy
## Instructions to run the code
* Inside `global_variables.py` replace `video_path` with the path of your video
* Replace `top_left` and `bottom_right` with the coordinates of the box inside which you want to track the object
* Run the file named `automatic_track.py` using `python2` or simply `python automatic_track.py`
* Use `ESC` key to exit from the video
| 50.222222 | 295 | 0.793142 | eng_Latn | 0.99787 |
8aa902d4b42f2038c28debf053a4d28e9d0cd647 | 65 | md | Markdown | _cards/LUDEWELLE.md | stokeclimsland/stokeclimsland | 93ce79c0012842783608410a6823c4bb46b0b466 | [
"MIT"
] | null | null | null | _cards/LUDEWELLE.md | stokeclimsland/stokeclimsland | 93ce79c0012842783608410a6823c4bb46b0b466 | [
"MIT"
] | null | null | null | _cards/LUDEWELLE.md | stokeclimsland/stokeclimsland | 93ce79c0012842783608410a6823c4bb46b0b466 | [
"MIT"
] | null | null | null | ---
title: LUDEWELLE
is_name: true
---
LUDEWELLE (LIDWELL?)
| 5.909091 | 20 | 0.630769 | yue_Hant | 0.146388 |
8aaabcc301a6d3096f5799a50dc0c86fecc9fcf5 | 6,696 | md | Markdown | WindowsServerDocs/manage/windows-admin-center/deploy/high-availability.md | eltociear/windowsserverdocs.pt-br | c545b674a2e6c17cb3b83bca28474b7f5a9a6637 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | WindowsServerDocs/manage/windows-admin-center/deploy/high-availability.md | eltociear/windowsserverdocs.pt-br | c545b674a2e6c17cb3b83bca28474b7f5a9a6637 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | WindowsServerDocs/manage/windows-admin-center/deploy/high-availability.md | eltociear/windowsserverdocs.pt-br | c545b674a2e6c17cb3b83bca28474b7f5a9a6637 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: Implantar o Windows Admin Center com Alta Disponibilidade
description: Implantar o Windows Admin Center com Alta Disponibilidade (Project Honolulu)
ms.technology: manage
ms.topic: article
author: jwwool
ms.author: jeffrew
ms.localizationpriority: medium
ms.prod: windows-server
ms.openlocfilehash: 6ae7bd9ed7aee5835ac1f53b9e10879ad8824f52
ms.sourcegitcommit: 6aff3d88ff22ea141a6ea6572a5ad8dd6321f199
ms.translationtype: HT
ms.contentlocale: pt-BR
ms.lasthandoff: 09/27/2019
ms.locfileid: "71406940"
---
# <a name="deploy-windows-admin-center-with-high-availability"></a>Implantar o Windows Admin Center com alta disponibilidade
>Aplica-se a: Windows Admin Center, Versão prévia do Windows Admin Center
Você pode implantar o Windows Admin Center em um cluster de failover para fornecer alta disponibilidade para o serviço de gateway do Windows Admin Center. A solução fornecida é uma solução ativa-passiva, em que apenas uma instância do Windows Admin Center está ativa. Se um dos nós no cluster falhar, o Windows Admin Center fará failover de maneira suave para outro nó, permitindo que você continue gerenciando os servidores em seu ambiente de maneira contínua.
[Saiba mais sobre outras opções de implantação do Windows Admin Center.](../plan/installation-options.md)
## <a name="prerequisites"></a>Pré-requisitos
- Um cluster de failover de dois ou mais nós no Windows Server 2016 ou 2019. [Saiba mais sobre como implantar um Cluster de Failover](../../../failover-clustering/failover-clustering-overview.md).
- Um CSV (Volume Compartilhado Clusterizado) para o Windows Admin Center armazenar dados persistentes que podem ser acessados por todos os nós no cluster. 10 GB serão suficientes para seu CSV.
- O script de implantação de alta disponibilidade do [arquivo zip do Script de HA do Windows Admin Center](https://aka.ms/WACHAScript). Baixe o arquivo .zip que contém o script para seu computador local e copie-o conforme necessário com base nas diretrizes abaixo.
- Recomendado, mas opcional: um certificado assinado. pfx e a senha. Você não precisa já ter instalado o certificado nos nós de cluster – o script fará isso para você. Se você não fornecer um, o script de instalação gerará um certificado autoassinado, que expirará após 60 dias.
## <a name="install-windows-admin-center-on-a-failover-cluster"></a>Instalar o Windows Admin Center em um cluster de failover
1. Copie o script ```Install-WindowsAdminCenterHA.ps1``` para um nó no cluster. Baixe ou copie o .msi do Windows Admin Center para o mesmo nó.
2. Conecte-se ao nó por meio do protocolo RDP e execute o script ```Install-WindowsAdminCenterHA.ps1``` com base nesse nó com os seguintes parâmetros:
- `-clusterStorage`: o caminho local do Volume Compartilhado Clusterizado para armazenar dados do Windows Admin Center.
- `-clientAccessPoint`: escolha um nome que será usado para acessar o Windows Admin Center. Por exemplo, se executar o script com o parâmetro `-clientAccessPoint contosoWindowsAdminCenter`, você acessará o serviço do Windows Admin Center acessando `https://contosoWindowsAdminCenter.<domain>.com`
- `-staticAddress`: Opcional. Um ou mais endereços estáticos para o serviço genérico do cluster.
- `-msiPath`: o caminho do arquivo .msi do Windows Admin Center.
- `-certPath`: Opcional. O caminho para um arquivo .pfx de certificado.
- `-certPassword`: Opcional. Uma senha SecureString do .pfx do certificado fornecida em `-certPath`
- `-generateSslCert`: Opcional. Se você não quiser fornecer um certificado assinado, inclua esse sinalizador de parâmetro para gerar um certificado autoassinado. Observe que o certificado autoassinado expirará em 60 dias.
- `-portNumber`: Opcional. Se você não especificar uma porta, o serviço de gateway será implantado na porta 443 (HTTPS). Para usar uma porta diferente, especifique nesse parâmetro. Observe que, se usar uma porta personalizada (qualquer uma além da 443), você acessará o Windows Admin Center acessando https://\<clientAccessPoint\>:\<port\>.
> [!NOTE]
> O script ```Install-WindowsAdminCenterHA.ps1``` dá suporte a parâmetros ```-WhatIf ``` e ```-Verbose```
### <a name="examples"></a>Exemplos
#### <a name="install-with-a-signed-certificate"></a>Instalar com um certificado assinado:
```powershell
$certPassword = Read-Host -AsSecureString
.\Install-WindowsAdminCenterHA.ps1 -clusterStorage "C:\ClusterStorage\Volume1" -clientAccessPoint "contoso-ha-gateway" -msiPath ".\WindowsAdminCenter.msi" -certPath "cert.pfx" -certPassword $certPassword -Verbose
```
#### <a name="install-with-a-self-signed-certificate"></a>Instalar com um certificado autoassinado:
```powershell
.\Install-WindowsAdminCenterHA.ps1 -clusterStorage "C:\ClusterStorage\Volume1" -clientAccessPoint "contoso-ha-gateway" -msiPath ".\WindowsAdminCenter.msi" -generateSslCert -Verbose
```
## <a name="update-an-existing-high-availability-installation"></a>Atualizar uma instalação de alta disponibilidade existente
Use o mesmo script ```Install-WindowsAdminCenterHA.ps1``` para atualizar sua implantação de HA, sem perder os dados de conexão.
### <a name="update-to-a-new-version-of-windows-admin-center"></a>Atualizar para uma nova versão do Windows Admin Center
Quando uma nova versão do Windows Admin Center for lançada, execute o script ```Install-WindowsAdminCenterHA.ps1``` novamente apenas com o parâmetro ```msiPath```:
```powershell
.\Install-WindowsAdminCenterHA.ps1 -msiPath '.\WindowsAdminCenter.msi' -Verbose
```
### <a name="update-the-certificate-used-by-windows-admin-center"></a>Atualizar o certificado usado pelo Windows Admin Center
Você pode atualizar o certificado usado por uma implantação de HA do Windows Admin Center a qualquer momento fornecendo o arquivo .pfx e a senha do novo certificado.
```powershell
$certPassword = Read-Host -AsSecureString
.\Install-WindowsAdminCenterHA.ps1 -certPath "cert.pfx" -certPassword $certPassword -Verbose
```
Você também pode atualizar o certificado enquanto atualiza a plataforma do Windows Admin Center com um novo arquivo .msi.
```powershell
$certPassword = Read-Host -AsSecureString
.\Install-WindowsAdminCenterHA.ps1 -msiPath ".\WindowsAdminCenter.msi" -certPath "cert.pfx" -certPassword $certPassword -Verbose
```
## <a name="uninstall"></a>Desinstalar
Para desinstalar a implantação de HA do Windows Admin Center do seu cluster de failover, passe o parâmetro ```-Uninstall``` para o script ```Install-WindowsAdminCenterHA.ps1```.
```powershell
.\Install-WindowsAdminCenterHA.ps1 -Uninstall -Verbose
```
## <a name="troubleshooting"></a>Solução de problemas
Os logs são salvos na pasta temp do CSV (por exemplo, C:\ClusterStorage\Volume1\temp). | 66.29703 | 462 | 0.780914 | por_Latn | 0.989753 |
8aab09f93fd2747013c64c016cafa8d961cd1c1d | 77 | md | Markdown | README.md | pomoke/moke | 1b429af42beff3b6074ac4b50d31a542845e5b33 | [
"MIT"
] | 2 | 2021-12-16T08:04:56.000Z | 2021-12-16T08:08:06.000Z | README.md | pomoke/moke | 1b429af42beff3b6074ac4b50d31a542845e5b33 | [
"MIT"
] | null | null | null | README.md | pomoke/moke | 1b429af42beff3b6074ac4b50d31a542845e5b33 | [
"MIT"
] | null | null | null | #MOKE
A toy os developed by pomoke,with the help of littleosbook and osdev.
| 19.25 | 69 | 0.779221 | eng_Latn | 0.997858 |
8aac812e1035ba950c45a71974263d31426c45f4 | 27 | md | Markdown | README.md | jashimkhan2215/appointment | e434a6174866ca35026075197c4c086ce0ffa811 | [
"Apache-2.0"
] | 2 | 2022-01-11T16:10:27.000Z | 2022-01-11T16:10:29.000Z | README.md | jashimkhan2215/appointment | e434a6174866ca35026075197c4c086ce0ffa811 | [
"Apache-2.0"
] | 2 | 2022-01-11T16:10:15.000Z | 2022-01-16T11:05:50.000Z | README.md | jashimkhan2215/appointment | e434a6174866ca35026075197c4c086ce0ffa811 | [
"Apache-2.0"
] | null | null | null | # appointment
Social media
| 9 | 13 | 0.814815 | eng_Latn | 0.998143 |
8aad1ce146256faa1c786541edd99d7bc234e43f | 2,236 | md | Markdown | desktop-src/TermServ/rdvcopybasevmlocally-win32-rdvhmanagement.md | velden/win32 | 94b05f07dccf18d4b1dbca13b19fd365a0c7eedc | [
"CC-BY-4.0",
"MIT"
] | 552 | 2019-08-20T00:08:40.000Z | 2022-03-30T18:25:35.000Z | desktop-src/TermServ/rdvcopybasevmlocally-win32-rdvhmanagement.md | velden/win32 | 94b05f07dccf18d4b1dbca13b19fd365a0c7eedc | [
"CC-BY-4.0",
"MIT"
] | 1,143 | 2019-08-21T20:17:47.000Z | 2022-03-31T20:24:39.000Z | desktop-src/TermServ/rdvcopybasevmlocally-win32-rdvhmanagement.md | velden/win32 | 94b05f07dccf18d4b1dbca13b19fd365a0c7eedc | [
"CC-BY-4.0",
"MIT"
] | 1,287 | 2019-08-20T05:37:48.000Z | 2022-03-31T20:22:06.000Z | ---
title: RdvCopyBaseVmLocally method of the Win32_RdvhManagement class
description: Copies a local base virtual machine to a specified remote desktop virtualization (RDV) host server.
ms.assetid: 13c0c629-42c6-4689-9740-f13f31688e42
ms.tgt_platform: multiple
keywords:
- RdvCopyBaseVmLocally method Remote Desktop Services
- RdvCopyBaseVmLocally method Remote Desktop Services , Win32_RdvhManagement class
- Win32_RdvhManagement class Remote Desktop Services , RdvCopyBaseVmLocally method
topic_type:
- apiref
api_name:
- Win32_RdvhManagement.RdvCopyBaseVmLocally
api_location:
- TSVmHostWmi.dll
api_type:
- COM
ms.topic: reference
ms.date: 05/31/2018
---
# RdvCopyBaseVmLocally method of the Win32\_RdvhManagement class
Copies a local base virtual machine to a specified remote desktop virtualization (RDV) host server.
## Syntax
```mof
uint32 RdvCopyBaseVmLocally(
[in] string BaseVmLocation,
[in] string FarmName,
[in] string GoldCacheLocation
);
```
## Parameters
<dl> <dt>
*BaseVmLocation* \[in\]
</dt> <dd>
The base virtual machine location.
</dd> <dt>
*FarmName* \[in\]
</dt> <dd>
The name of the host farm to copy to.
</dd> <dt>
*GoldCacheLocation* \[in\]
</dt> <dd>
The gold cache location.
</dd> </dl>
## Return value
Returns 0 on success, otherwise returns a WMI error code. Refer to [Remote Desktop Services WMI Provider Error Codes](terminal-services-wmi-provider-error-codes.md) for a list of these values.
## Requirements
| Requirement | Value |
|-------------------------------------|--------------------------------------------------------------------------------------------|
| Minimum supported client<br/> | None supported<br/> |
| Minimum supported server<br/> | Windows Server 2012<br/> |
| Namespace<br/> | Root\\CIMv2\\TerminalServices<br/> |
| MOF<br/> | <dl> <dt>TSVmHost.mof</dt> </dl> |
| DLL<br/> | <dl> <dt>TSVmHostWmi.dll</dt> </dl> |
## See also
<dl> <dt>
[**Win32\_RdvhManagement**](win32-rdvhmanagement.md)
</dt> </dl>
| 23.051546 | 192 | 0.610018 | eng_Latn | 0.554022 |
8aaec089db292bfbaa05ef46cd43ca0ebff9450a | 6,036 | md | Markdown | README.md | UniStuttgart-VISUS/LilyPads | a61d4cc9fd1230749cb2d035ad23afe59c9b5f44 | [
"Apache-2.0"
] | 1 | 2021-10-04T12:25:45.000Z | 2021-10-04T12:25:45.000Z | README.md | UniStuttgart-VISUS/LilyPads | a61d4cc9fd1230749cb2d035ad23afe59c9b5f44 | [
"Apache-2.0"
] | null | null | null | README.md | UniStuttgart-VISUS/LilyPads | a61d4cc9fd1230749cb2d035ad23afe59c9b5f44 | [
"Apache-2.0"
] | null | null | null | # LilyPads
This is the source code for the LilyPads application.
LilyPads was presented at IVAPP 2020, and the publication can be found [here](https://doi.org/10.5220/0008871400170028).
See [How to Cite](#how-to-cite) or the `NOTICE` file for how to reference the publication and the code.
## Installation
To build, `npm`, `sass` and `pip` are required.
To install the requisites, run the following commands:
``` sh
$ npm install
$ python3 -m venv env
$ source env/bin/activate
(env) $ python setup.py install
```
## Dataset Creation
### Input Dataset Format
Input datasets are CSV files with the following columns:
| Column Name | Description |
| :-- | :-- |
| `Index` | An index number unique to each row. |
| `Date` | The publication date, in `YYYY-mm-dd` format. |
| `Title (Newspaper)` | Title of the newspaper. |
| `Location` | Location of publication, as text. |
| `Search term` | Search term used to find the article (optional). |
| `Text` | The full text of the article. |
| `Language` | Language of the document. |
| `Corpus` | Corpus this was extracted from (optional). |
| `Link` | URL to the source. |
| `place_id` | ID of place (see [Geolocations](#geolocations)). |
| `translated` | Translated full text, optional, if the translation should be used for the word cloud. |
### Stop Words
Stop words are words that can be filtered out for text analysis because they carry little meaning by themselves.
Examples are "the", "a", "for".
In the context of OCR (optical character recognition), mis-scanned artifacts can also be considered stop words.
Stop words can be provided to the conversion program by placing a newline-separated text file of such words in `data/stopwords/stopwords.<lang>.txt`, where `<lang>` is the **ISO 639-1** code for the language in question (e.g., `stopwords.en.txt`).
### Geolocations
The program needs to look up the geographical location of places of publication.
Each article has a `place_id` field that references one such location.
The geographical data must be placed as GZIP-ed JSON files in the folder `data/geolocations.d/` (e.g., `data/geolocations.d/geo.json.gz`).
Each JSON in that directory is a dictionary with the following structure (`place-1` is an example for a `place_id`):
``` JSON
{
"place-1": {
"formatted_address": "New Orleans",
"geometry": {
"location": {
"lat": 29.9510658,
"lng": -90.0715323
}
},
"place_id": "place-1"
},
...
}
```
### Metadata
Each dataset must have an attributed metadata file.
That file has the same file name as the dataset file, but with the ending `.meta.json` (e.g., `dataset.csv` -> `dataset.meta.json`).
The JSON contains at least a `name` field with the name of the dataset, and a `roles` field with an array of strings, which are the roles that may view the dataset (see [User Management](#user-management)).
The metadata can contain additional info as required, such as copyright statements, creation dates, etc.
All that info will be included in generated datasets.
### Creating the Datasets
The datasets can be built using the `Makefile` in the `data/` directory.
The `Makefile` looks for CSV files in the `data/` directory and creates a dataset file from each of them.
The `Makefile` in the root directory will also call the `Makefile` in the `data/` directory.
## User Management
The server expects an `SQLite3` database in the working directory with the following structure:
``` sql
CREATE TABLE users (
id TEXT PRIMARY KEY,
password TEXT,
expires DATE,
roles TEXT DEFAULT '',
comment TEXT DEFAULT NULL
);
```
The `id` field is the user's login name, the `password` is a hashed password entry as generated by `htpasswd(1)`.
The `expires` field can be used to specify when an account expires, and the user cannot login after that date.
The `roles` field is a comma-separated list of roles the user is part of.
The user is only allowed to see and load datasets which share at least one of these roles.
## Build and Deployment
The entire project (JavaScript, assets, CSS, datasets) can be built using the provided `Makefile`:
``` sh
$ make
$ # or, for a production build
$ make prod
```
The built project can then be bundled into a Python wheel file for deployment as such:
``` sh
$ source env/bin/activate
(env) $ python setup.py bdist_wheel
```
This will generate a `.whl` file in `dist/`, which can be copied to the appropriate location.
To install it there, create a virtual environment and install it using `pip`:
``` sh
$ python3 -m venv env
$ source env/bin/activate
(env) $ pip install --upgrade path/to/wheelfile.whl
```
The server can be started using `gunicorn`:
``` sh
$ source env/bin/activate
(env) $ gunicorn -b localhost:8000 lilypads:app
```
See also the `host.sh` file for an example.
This would be the appropriate place to pass SSL certificates to the `gunicorn` process.
Another possibility is to host the server behind an `nginx` or Apache `httpd` web server.
# How to Cite
Max Franke, Markus John, Moritz Knabben, Jana Keck, Tanja Blascheck, and Steffen Koch. LilyPads: Exploring the Spatiotemporal Dissemination of Historical Newspaper Articles. In *Proceedings of the 15th International Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - Volume 3: IVAPP,* pp. 17--28. SciTePress, 2020. [DOI:10.5220/0008871400170028](https://doi.org/10.5220/0008871400170028).
BibTeX:
``` bibtex
@inproceedings{franke2020lilypads,
author = {Franke, Max and John, Markus and Knabben, Moritz and Keck, Jana and Blascheck, Tanja and Koch, Steffen},
title = {LilyPads: Exploring the Spatiotemporal Dissemination of Historical Newspaper Articles},
journal = {Proceedings of the 15th International Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - Volume 3: IVAPP},
publisher = {SciTePress},
year = {2020},
month = {2},
pages = {17--28},
doi = {10.5220/0008871400170028},
isbn = {978-989-758-402-2},
organization = {INSTICC}
}
```
| 37.030675 | 424 | 0.725149 | eng_Latn | 0.990106 |
8aaf2e146337d77f6b38305505e4a75c2c2c546c | 1,938 | md | Markdown | tensorflow/g3doc/api_docs/python/functions_and_classes/shard7/tf.where.md | connectthefuture/tensorflow | 93812423fcd5878aa2c1d0b68dc0496980c8519d | [
"Apache-2.0"
] | 101 | 2016-12-03T11:40:52.000Z | 2017-12-23T02:02:03.000Z | tensorflow/g3doc/api_docs/python/functions_and_classes/shard7/tf.where.md | connectthefuture/tensorflow | 93812423fcd5878aa2c1d0b68dc0496980c8519d | [
"Apache-2.0"
] | 9 | 2016-12-14T03:27:46.000Z | 2017-09-13T02:29:07.000Z | tensorflow/g3doc/api_docs/python/functions_and_classes/shard7/tf.where.md | connectthefuture/tensorflow | 93812423fcd5878aa2c1d0b68dc0496980c8519d | [
"Apache-2.0"
] | 47 | 2016-12-04T12:37:24.000Z | 2018-01-14T18:13:07.000Z | ### `tf.where(condition, x=None, y=None, name=None)` {#where}
Return the elements, either from `x` or `y`, depending on the `condition`.
If both `x` and `y` are None, then this operation returns the coordinates of
true elements of `condition`. The coordinates are returned in a 2-D tensor
where the first dimension (rows) represents the number of true elements, and
the second dimension (columns) represents the coordinates of the true
elements. Keep in mind, the shape of the output tensor can vary depending on
how many true values there are in input. Indices are output in row-major
order.
If both non-None, `x` and `y` must have the same shape.
The `condition` tensor must be a scalar if `x` and `y` are scalar.
If `x` and `y` are vectors or higher rank, then `condition` must be either a
vector with size matching the first dimension of `x`, or must have the same
shape as `x`.
The `condition` tensor acts as a mask that chooses, based on the value at each
element, whether the corresponding element / row in the output should be taken
from `x` (if true) or `y` (if false).
If `condition` is a vector and `x` and `y` are higher rank matrices, then it
chooses which row (outer dimension) to copy from `x` and `y`. If `condition`
has the same shape as `x` and `y`, then it chooses which element to copy from
`x` and `y`.
##### Args:
* <b>`condition`</b>: A `Tensor` of type `bool`
* <b>`x`</b>: A Tensor which may have the same shape as `condition`. If `condition` is
rank 1, `x` may have higher rank, but its first dimension must match the
size of `condition`.
* <b>`y`</b>: A `tensor` with the same shape and type as `x`.
* <b>`name`</b>: A name of the operation (optional)
##### Returns:
A `Tensor` with the same type and shape as `x`, `y` if they are non-None.
A `Tensor` with shape `(num_true, dim_size(condition))`.
##### Raises:
* <b>`ValueError`</b>: When exactly one of `x` or `y` is non-None.
| 40.375 | 87 | 0.698142 | eng_Latn | 0.999696 |
8aaff65772a7fbbf3aecedb10989471ccbba776c | 2,442 | md | Markdown | docs/framework/unmanaged-api/metadata/imetadataassemblyimport-findexportedtypebyname-method.md | adamsitnik/docs.pl-pl | c83da3ae45af087f6611635c348088ba35234d49 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/framework/unmanaged-api/metadata/imetadataassemblyimport-findexportedtypebyname-method.md | adamsitnik/docs.pl-pl | c83da3ae45af087f6611635c348088ba35234d49 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/framework/unmanaged-api/metadata/imetadataassemblyimport-findexportedtypebyname-method.md | adamsitnik/docs.pl-pl | c83da3ae45af087f6611635c348088ba35234d49 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | ---
title: IMetaDataAssemblyImport::FindExportedTypeByName — Metoda
ms.date: 03/30/2017
api_name:
- IMetaDataAssemblyImport.FindExportedTypeByName
api_location:
- mscoree.dll
api_type:
- COM
f1_keywords:
- IMetaDataAssemblyImport::FindExportedTypeByName
helpviewer_keywords:
- FindExportedTypeByName method [.NET Framework metadata]
- IMetaDataAssemblyImport::FindExportedTypeByName method [.NET Framework metadata]
ms.assetid: 46264b2c-574d-4dde-aafc-77187a104fdd
topic_type:
- apiref
author: mairaw
ms.author: mairaw
ms.openlocfilehash: 8a70c041bc17f58a5e17877dd2e1f2aa2944e689
ms.sourcegitcommit: 7f616512044ab7795e32806578e8dc0c6a0e038f
ms.translationtype: MT
ms.contentlocale: pl-PL
ms.lasthandoff: 07/10/2019
ms.locfileid: "67777923"
---
# <a name="imetadataassemblyimportfindexportedtypebyname-method"></a>IMetaDataAssemblyImport::FindExportedTypeByName — Metoda
Pobiera wskaźnik do typu wyeksportowanego, biorąc pod uwagę jego nazwę i typ otaczający.
## <a name="syntax"></a>Składnia
```cpp
HRESULT FindExportedTypeByName (
[in] LPCWSTR szName,
[in] mdToken mdtExportedType,
[out] mdExportedType *ptkExportedType
);
```
## <a name="parameters"></a>Parametry
`szName`
[in] Nazwa typu wyeksportowanego.
`mdtExportedType`
[in] Token metadanych dla otaczającej klasy wyeksportowanego typu. Ta wartość jest `mdExportedTypeNil` w przypadku eksportu żądany typ nie jest typem zagnieżdżonym.
`ptkExportedType`
[out] Wskaźnik do `mdExportedType` token, który reprezentuje typ eksportowany.
## <a name="remarks"></a>Uwagi
`FindExportedTypeByName` Metoda wykorzystuje standardowe reguły stosowane przez środowisko uruchomieniowe języka wspólnego do rozpoznawania odwołań.
## <a name="requirements"></a>Wymagania
**Platformy:** Zobacz [wymagania systemowe](../../../../docs/framework/get-started/system-requirements.md).
**Nagłówek:** COR.h
**Biblioteka:** Używany jako zasób w MsCorEE.dll
**Wersje programu .NET framework:** [!INCLUDE[net_current_v10plus](../../../../includes/net-current-v10plus-md.md)]
## <a name="see-also"></a>Zobacz także
- [IMetaDataAssemblyImport, interfejs](../../../../docs/framework/unmanaged-api/metadata/imetadataassemblyimport-interface.md)
- [Sposoby lokalizowania zestawów przez środowisko uruchomieniowe](../../../../docs/framework/deployment/how-the-runtime-locates-assemblies.md)
| 37 | 167 | 0.752662 | pol_Latn | 0.845198 |
8aaffdd8c2704cd3e1d723209dcb7105c4183c0c | 3,426 | md | Markdown | articles/key-vault/general/best-practices.md | flexray/azure-docs.pl-pl | bfb8e5d5776d43b4623ce1c01dc44c8efc769c78 | [
"CC-BY-4.0",
"MIT"
] | 12 | 2017-08-28T07:45:55.000Z | 2022-03-07T21:35:48.000Z | articles/key-vault/general/best-practices.md | flexray/azure-docs.pl-pl | bfb8e5d5776d43b4623ce1c01dc44c8efc769c78 | [
"CC-BY-4.0",
"MIT"
] | 441 | 2017-11-08T13:15:56.000Z | 2021-06-02T10:39:53.000Z | articles/key-vault/general/best-practices.md | flexray/azure-docs.pl-pl | bfb8e5d5776d43b4623ce1c01dc44c8efc769c78 | [
"CC-BY-4.0",
"MIT"
] | 27 | 2017-11-13T13:38:31.000Z | 2022-02-17T11:57:33.000Z | ---
title: Najlepsze rozwiązania dotyczące używania Key Vault — Azure Key Vault | Microsoft Docs
description: Dowiedz się więcej na temat najlepszych rozwiązań dotyczących Azure Key Vault, w tym kontrolowania dostępu, używania oddzielnych magazynów kluczy, opcji kopii zapasowych, rejestrowania i odzyskiwania.
services: key-vault
author: msmbaldwin
tags: azure-key-vault
ms.service: key-vault
ms.subservice: general
ms.topic: conceptual
ms.date: 01/29/2021
ms.author: mbaldwin
ms.openlocfilehash: 7cfa2059cc03b96db39183cfa5056c9934a02290
ms.sourcegitcommit: 260a2541e5e0e7327a445e1ee1be3ad20122b37e
ms.translationtype: MT
ms.contentlocale: pl-PL
ms.lasthandoff: 04/21/2021
ms.locfileid: "107814356"
---
# <a name="best-practices-to-use-key-vault"></a>Najlepsze rozwiązania dotyczące korzystania z Key Vault
## <a name="use-separate-key-vaults"></a>Używanie oddzielnych magazynów kluczy
Naszym zaleceniem jest użycie magazynu na aplikację na środowisko (deweloperskie, przedprodukcyjne i produkcyjne). Pomaga to nie udostępniać wpisów tajnych w różnych środowiskach, a także zmniejsza zagrożenie w przypadku naruszenia zabezpieczeń.
## <a name="control-access-to-your-vault"></a>Kontrola dostępu do magazynu
Azure Key Vault to usługa w chmurze, która zabezpiecza klucze szyfrowania i wpisy tajne, takie jak certyfikaty, parametry połączenia i hasła. Ponieważ te dane są poufne i krytyczne dla działalności firmy, należy zabezpieczyć dostęp do magazynów kluczy, zezwalając tylko autoryzowanym aplikacjom i użytkownikom. Ten [artykuł](security-features.md) zawiera omówienie modelu Key Vault dostępu. Wyjaśniono w nim uwierzytelnianie i autoryzację oraz opisano sposób zabezpieczania dostępu do magazynów kluczy.
Sugestie podczas kontrolowania dostępu do magazynu są następujące:
1. Blokowanie dostępu do subskrypcji, grupy zasobów i magazynów kluczy (RBAC) platformy Azure
2. Tworzenie zasad dostępu dla każdego magazynu
3. Udzielanie dostępu przy użyciu jednostki dostępu z najmniejszymi uprawnieniami
4. Włączanie zapory i [punktów końcowych usługi sieci wirtualnej](overview-vnet-service-endpoints.md)
## <a name="backup"></a>Backup
Upewnij się, że regularnie tworzysz kopię zapasową magazynu podczas aktualizowania/usuwania/tworzenia obiektów w magazynie.
### <a name="azure-powershell-backup-commands"></a>Azure PowerShell kopii zapasowej
* [Certyfikat kopii zapasowej](/powershell/module/azurerm.keyvault/Backup-AzureKeyVaultCertificate)
* [Klucz kopii zapasowej](/powershell/module/azurerm.keyvault/Backup-AzureKeyVaultKey)
* [Klucz tajny kopii zapasowej](/powershell/module/azurerm.keyvault/Backup-AzureKeyVaultSecret)
### <a name="azure-cli-backup-commands"></a>Polecenia kopii zapasowej interfejsu wiersza polecenia platformy Azure
* [Certyfikat kopii zapasowej](/cli/azure/keyvault/certificate#az_keyvault_certificate_backup)
* [Klucz kopii zapasowej](/cli/azure/keyvault/key#az_keyvault_key_backup)
* [Klucz tajny kopii zapasowej](/cli/azure/keyvault/secret#az_keyvault_secret_backup)
## <a name="turn-on-logging"></a>Włączanie rejestrowania
[Włącz rejestrowanie dla](logging.md) magazynu. Skonfiguruj również alerty.
## <a name="turn-on-recovery-options"></a>Włączanie opcji odzyskiwania
1. Włącz usuwanie [niealkońcowe.](soft-delete-overview.md)
2. Włącz ochronę przed przeczyszczaniem, jeśli chcesz chronić przed wymuszaniem usunięcia tajnego/magazynu nawet po włączeniu usuwania nie soft-delete. | 58.067797 | 502 | 0.817863 | pol_Latn | 0.999363 |
8ab18cb44b436ea869eb8c31c026a32a8c264528 | 2,187 | md | Markdown | README.md | CommonSense-CyberGroup/TreeOfKnowledge | 40ff03c3c02fbe707c7bdd0598cc11895ad53ef4 | [
"MIT"
] | 1 | 2021-11-10T03:09:57.000Z | 2021-11-10T03:09:57.000Z | README.md | CommonSense-CyberGroup/TreeOfKnowledge | 40ff03c3c02fbe707c7bdd0598cc11895ad53ef4 | [
"MIT"
] | null | null | null | README.md | CommonSense-CyberGroup/TreeOfKnowledge | 40ff03c3c02fbe707c7bdd0598cc11895ad53ef4 | [
"MIT"
] | null | null | null | # TreeOfKnowledge
PowerShell Script for information gathering
The initial purpose/thought behind this script was to be used with as a USB PenTest simulation with something like the P4wnp1 ALOA where this will run as soon as the device is plugged into the machine. It is meant to be quick and upload the data to an online FTP share (or save it locally to the USB device). This script needs to be run while the PC is unlocked and a user is logged in. We do not yet have the functionality built in to unlock a Windows PC.
The user is able to comment/uncomment functions that they wish to run against the machine. Some are dependant on one another and others require admin elevation so read the comments carefully!
------
Legal Disclaimer:
The use of code contained in this repository, either in part or in its totality, for engaging targets without prior mutual consent is illegal.
It is the end user's responsibility to obey all applicable local, state and federal laws. Developers assume no liability and are not responsible
for misuses or damages caused by any code contained in this repository in any event that, accidentally or otherwise, it comes to be utilized
by a threat agent or unauthorized entity as a means to compromise the security, privacy, confidentiality, integrity, and/or availability of
systems and their associated resources. In this context the term "compromise" is henceforth understood as the leverage of exploitation of known or
unknown vulnerabilities present in said systems, including, but not limited to, the implementation of security controls, human- or electronically-enabled.
The use of this code is only endorsed by the developers in those circumstances directly related to educational environments or authorized
penetration testing engagements whose declared purpose is that of finding and mitigating vulnerabilities in systems, limiting their exposure
to compromises and exploits employed by malicious agents as defined in their respective threat models.
------
## To Do:
- Add SCP capability for uploading files securely to an available host (https://mcpmag.com/articles/2018/07/19/transfer-files-via-scp-with-powershell.aspx)
| 68.34375 | 457 | 0.803841 | eng_Latn | 0.999873 |
8ab2a00ca31b5541fd186ae641b30fbe48b7b549 | 1,919 | md | Markdown | vault/bible/kt/guilt.md | mandolyte/uw-obsidian | 39e987c4cdc49d2a68e3af6b4e3fc84d1cda916d | [
"MIT"
] | null | null | null | vault/bible/kt/guilt.md | mandolyte/uw-obsidian | 39e987c4cdc49d2a68e3af6b4e3fc84d1cda916d | [
"MIT"
] | null | null | null | vault/bible/kt/guilt.md | mandolyte/uw-obsidian | 39e987c4cdc49d2a68e3af6b4e3fc84d1cda916d | [
"MIT"
] | null | null | null | # guilt, guilty
## Definition:
The term “guilt” refers to the fact of having sinned or committed a crime.
* To “be guilty” means to have done something morally wrong, that is, to have disobeyed God.
* The opposite of “guilty” is “innocent.”
## Translation Suggestions:
* Some languages might translate “guilt” as “the weight of sin” or “the counting of sins.”
* Ways to translate to “be guilty” could include a word or phrase that means, to “be at fault” or “having done something morally wrong” or “having committed a sin.”
(See also: [innocent](../kt/innocent.md), [iniquity](../kt/iniquity.md), [punish](../other/punish.md), [sin](../kt/sin.md))
## Bible References:
* [Exodus 28:36-38](rc://en/tn/help/exo/28/36)
* [Isaiah 6:7](rc://en/tn/help/isa/06/07)
* [James 2:10-11](rc://en/tn/help/jas/02/10)
* [John 19:4](rc://en/tn/help/jhn/19/04)
* [Jonah 1:14](rc://en/tn/help/jon/01/14)
## Examples from the Bible stories:
* __[39:2](rc://en/tn/help/obs/39/02)__ They brought many witnesses who lied about him (Jesus). However, their statements did not agree with each other, so the Jewish leaders could not prove he was __guilty__ of anything.
* __[39:11](rc://en/tn/help/obs/39/11)__ After speaking with Jesus, Pilate went out to the crowd and said, “I find no __guilt__ in this man.” But the Jewish leaders and the crowd shouted, “Crucify him!” Pilate replied, “He is not __guilty__.” But they shouted even louder. Then Pilate said a third time, “He is not __guilty__!”
* __[40:4](rc://en/tn/help/obs/40/04)__ Jesus was crucified between two robbers. One of them mocked Jesus, but the other said, “Don’t you fear God? We are __guilty__, but this man is innocent.”
* __[49:10](rc://en/tn/help/obs/49/10)__ Because of your sin, you are __guilty__ and deserve to die.
## Word Data:
* Strong’s: [[H0816]], [[H0817]], [[H0818]], [[H5352]], [[H5355]], [[H7563]], [[G00338]], [[G01777]], [[G03784]], [[G05267]]
| 54.828571 | 327 | 0.696196 | eng_Latn | 0.99564 |
8ab3d10162efed991fbe4c0cff67810a729505aa | 10,528 | md | Markdown | _posts/NaturalLanguageProcessing/NLPLabs/Paper_Investigation/Translation/2019-01-01-Neural_Machine_Translation_by_Jointly_Learning_to_Align_And_Translate.md | hyunyoung2/personal | a14784093c1484ec81e1a53bbf018b7e530946e6 | [
"MIT"
] | 5 | 2017-11-09T14:04:28.000Z | 2021-11-30T07:03:52.000Z | _posts/NaturalLanguageProcessing/NLPLabs/Paper_Investigation/Translation/2019-01-01-Neural_Machine_Translation_by_Jointly_Learning_to_Align_And_Translate.md | hyunyoung2/personal | a14784093c1484ec81e1a53bbf018b7e530946e6 | [
"MIT"
] | 1 | 2016-12-07T05:36:52.000Z | 2016-12-07T05:36:52.000Z | _posts/NaturalLanguageProcessing/NLPLabs/Paper_Investigation/Translation/2019-01-01-Neural_Machine_Translation_by_Jointly_Learning_to_Align_And_Translate.md | hyunyoung2/personal | a14784093c1484ec81e1a53bbf018b7e530946e6 | [
"MIT"
] | 8 | 2018-04-08T17:29:06.000Z | 2022-01-19T21:29:38.000Z | ---
layout: post
title: Neural Machine Translation By Jointly Learning to align and translate
subtitle: Title of paper - Neural Machine Translation By Jointly Learning to align and translate
category: NLP papers - Translation
tags: [neural network, translation]
permalink: /2019/01/01/Neural_Machine_Translation_by_Jointly_Learning_to_Align_And_Translate/
css : /css/ForYouTubeByHyun.css
bigimg:
- "/img/Image/BigImages/carmel.jpg" : "Carmel-by-the-Sea, CA (2016)"
- "/img/Image/BigImages/monterey.jpg" : "Monterey, CA (2016)"
- "/img/Image/BigImages/stanford_dish.jpg" : "Stanford Dish, CA (2016)"
- "/img/Image/BigImages/marian_beach_in_sanfran.jpg" : "MRINA of San Francisco, CA (2016)"
- "/img/Image/BigImages/carmel2.jpg" : "Carmel-by-the-Sea, CA (2016)"
- "/img/Image/BigImages/marina.jpg" : "MRINA of San Francisco, CA (2016)"
- "/img/Image/BigImages/sanfrancisco.jpg" : "San Francisco, CA (2016)"
---
This is a brief summary of paper, [Neural Machine Translation By jointly Learning to align and translate (Bahdanau et al., ICLR 2015)](https://arxiv.org/abs/1409.0473) I read and studied.
The reason that I am writing this post is for me to organize about studying what the Attention is in deep learning.
{% include MathJax.html %}
Machine Translation task is one of natural language understanding and has been hard to improve the performance.
However, after using neural network on Machine Translation task. The performance of MT start outperforming the conventional phrase-based translation.
So the authors used additive attention to improve the performance of NMT.
The reason they used additive attention is it is difficult to include all information of a source sentence into a fixed-length vector as a context vector.
In order to resolve the problem using a fixed-length vector, they used soft-alignment jointly learning alignment and translation.
From a probabilistice perspective, translation is eqaul to find a target sentence **y** that maximizes the conditional probability of **y** given a source sentence **x**.
$$ \hat{y} = \underset{y}{\mathrm{argmax}} P(y|x) $$
In the equation above,
- x is a source sentence
- y is a target sentence
- P(y\|x) is the conditional probabliity of y given x.
So the equation above means maximizing the conditional probability of a target sentence **y** given a source sentence **x**. it is parameterized in neural network model.
From now on, Let's see notion of the model, called RNN Encoder-Decoder, that they was saying for NMT task.
the model of theirs is learned to align and translate simultaneously on **Encoder-Decoder Framework**
In the Encoder-Decoder Framework, An encoder reads the input sentence, a sequence of vectors, \\(x = (x_{1},...,x_{T_{x}})\\).
The common RNN's structure to use it:
$$ h_{t} = f(x_{t}, h_{t-1}) $$
and
$$ c = q(h_{1},....,h_{T_{x}}) $$
Where \\(h_{t} \in \mathbb{R}^n\\) is a hidden state at time t, and c is a vector generated from the sequence of the hidden states.
\\(f\\) and \\(q\\) are some non-linear functions. in their paper, \\(f\\) is GRU and \\(q\\) is feedforward neural network to pay attend to hiddens of Encoder.
The decoder to sequentially predict target words defines a probability over the translation **y** by decomposing the joint probability into the ordered conditional :
$$ P(y_{1},....,y_{n}) = \prod_{t=1}^nP(y_{t} | {y_{1},...,y_{t-1}}, c) $$
With an RNN each conditional probability is modeled as
$$ p(y_{t} | {y_{1},...,y_{t-1}}, c) = g(y_{i-1}, s_{t}, c) $$
where \\(g\\) is a non-linear, potentially multi-layered, function that outputs the probability of \\(y_{t}\\), and \\(s_{t}\\) is the hidden state of the RNN.
with the notion above for translation using RNN, the architecture of decoder they say is :
.png)
The image above is a decoder of their NMT, in the model, they define each conditional probability as :
$$ p(y_{i} | {y_{1},...,y_{i-1}},x) = g(y_{i-1},s_{i},c_{i}) $$
where \\(s_{i}\\) is an RNN hidden state for time \\(i\\) computed by
$$ s_{i} = f(s_{i-1}, y_{i-1}, c_{i}) $$
Here, the probability is conditioned on a distinct context vector \\(c_{i}\\) for each target word \\(y_{i}\\).
The context vector \\(c_{i}\\) depends on a sequece of hidden states \\((h_{1},...,h_{T_{x}})\\) that an encoder maps an input sentence to.
Each hidden state \\(h_{i}\\) contains information about the whole input sequence with a strong focus on the parts surrounding the \\(i\\)-th word of the input sequence.
Let's see how for them to compute context vector.
The context vector \\(c_{i}\\) is, then, computed as a weighted sum of these hidden states \\(h_{i}\\) as :
$$ c_{i} = \sum_{j=1}^{T_{x}} \alpha_{ij}h_{j} $$
The weight \\(a_{ij}\\) of each hidden state \\(h_{j}\\), which is call attention, is computed by
$$
\alpha_{ij} = \frac{exp(e_{ij})}{\sum_{k=1}^{T_{x}} exp(e_{ik})}
$$
where
$$ e_{ij} = \alpha(s_{i-1}, h_{j}) $$
the \\(e_{ij}\\) is an alignment model which scores how well the inputs around position \\(j\\) and the output at position \\(i\\) match.
The score is based on the RNN(decoder) hidden state \\(s_{i-1}\\) before emitting \\(y_{i}\\) and the \\(j\\)-th hidden state \\(h_{j}\\) of input sentence.
They parameterized the alignment model \\(\alpha\\) as a feedforward neural network which is jointly trained with all the other components of the proposed system.
Specifically, the alignment model is modeled as
$$
\alpha(s_{i-1}, h_{j}) = V_{\alpha}^\top tanh(W_{\alpha}s_{i-1} + U_{\alpha}h_{j})
$$
where \\(W_{\alpha} \in \mathbb{R}^{nxn}, U_{\alpha} \in \mathbb{R}^{nx2n}\\) and \\(V_{\alpha} \in \mathbb{R}^n\\) are the weight metrices.
They regard the approach of taking a weighted sum of all the hidden states as computing an **expected hiddend state**, where the expectation is over possible alignments.
Let \\(\alpha_{ij}\\) be a proability that the target word \\(y_{i}\\) is aligned to , or translated from.
Then the \\(i\\)-th context vector \\(c_{i}\\) is the expected hidden state over all hidden states with probabilities \\(\alpha_{ij}\\).
The probability \\(\alpha_{ij}\\), or its associated energy \\(e_{ij}\\) reflects the importance of the hidden state \\( h_{j}\\) with respect to the previous hidden state \\(s_{i-1}\\) in deciding the next state \\(s_{i}\\) and generating \\(y_{i}\\).
Intuitively, this implement an mechanism of attention in the decoder. The decoder decides parts of the source sentence to pay attention to.
by doing the mechanism on the decoder, they relieve the burden for the encoder to summarize all information of a source sentence into a fixed-length vector.
With this approach, the information can be spread throughout the sequence of hidden states, which can be selectively retrieved by the decoder accordingly.
<div id="tutorial-section">
<div id="tutorial-title">Youtube of Deeplearning Ai</div>
<ul class="nav nav-pills">
<li class="active"><a data-toggle="tab" href="#refrigerator">Attention Model Intution</a></li>
<li><a data-toggle="tab" href="#refrigerator_concept">Attention Model</a></li>
</ul>
<div class="tab-content">
<div id="refrigerator" class="tab-pane fade in active">
<iframe width="560" height="315" src="https://www.youtube.com/embed/SysgYptB198" frameborder="0" allowfullscreen></iframe>
</div>
<div id="refrigerator_concept" class="tab-pane fade">
<iframe width="560" height="315" src="https://www.youtube.com/embed/quoGRI-1l0A" frameborder="0" allowfullscreen></iframe> </div>
</div>
</div>
<div class="alert alert-info" role="alert"><i class="fa fa-info-circle"></i> <b>Note(Abstract): </b>
This paper explained how to pay attention on NMT(neural machine translation) task. They said the previous encoder-decoder architecture has a bottleneck in fixed-length context vector. So They extended the existing encoder-decoder architecture by using (soft-)alignment between source and target sentence with a context vector.
</div>
<div class="alert alert-success" role="alert"><i class="fa fa-paperclip fa-lg"></i> <b>Download URL: </b><br>
<a href="https://arxiv.org/abs/1409.0473">The paper: Neural Machine Translation By Jointly Learning to align and translate (Bahdanau et al., arXiv 2015)</a>
</div>
# Reference
- Paper
- [arXiv Version: Neural Machine Translation By Jointly Learning to align and translate (Bahdanau et al., arXiv 2015)](https://arxiv.org/abs/1409.0473)
- How to use html for alert
- [how to use icon](http://idratherbewriting.com/documentation-theme-jekyll/mydoc_icons.html)
- How to use MathJax
- [Stackexchange1](https://math.meta.stackexchange.com/questions/5020/mathjax-basic-tutorial-and-quick-reference)
- [Stackexchange2](https://tex.stackexchange.com/questions/5223/command-for-argmin-or-argmax)
- For your information
- [Attention? Attention! on Lil'Log blog](https://lilianweng.github.io/lil-log/2018/06/24/attention-attention.html)
- [Self-Attention Mechanisms in Natural Language Prcessing on Alibabacloud](https://www.alibabacloud.com/blog/self-attention-mechanisms-in-natural-language-processing_593968)
- [Deep Learning for NLP Best Practices on ruder blog](http://ruder.io/deep-learning-nlp-best-practices/index.html#fn2)
- [Soft & Hard Attention on Jonathan Hui Blog](https://jhui.github.io/2017/03/15/Soft-and-hard-attention/)
- [Attention Mechanism on Heuritech](https://blog.heuritech.com/2016/01/20/attention-mechanism/)
- [A Brief Overview of Attention Mechanism on Medium](https://medium.com/syncedreview/a-brief-overview-of-attention-mechanism-13c578ba9129)
- [Attention and Memory in Deep Learning and NLP on WILDML](http://www.wildml.com/2016/01/attention-and-memory-in-deep-learning-and-nlp/)
- [Attention Mechanism in Neural Network on Hackernoon](https://hackernoon.com/attention-mechanism-in-neural-network-30aaf5e39512)
- Kor ver
- [Neural Turing machine no norman](https://norman3.github.io/papers/docs/neural_turing_machine.html)
- Slide
- [Attention is all you need on whikwon slideshare](https://www.slideshare.net/WhiKwon/attention-mechanism)
- [Attention Mechanisms with Tensorflow on KeonKim slideshare](https://www.slideshare.net/KeonKim/attention-mechanisms-with-tensorflow)
| 46.378855 | 326 | 0.71932 | eng_Latn | 0.944304 |
8ab42fa7e76c446cde7335206c979043dd7fa457 | 1,280 | md | Markdown | README_CN.md | ShinCurry/YXMenuView | 5e789eadcf9fa5fcc9e5b438c052b0811cbd075b | [
"MIT"
] | 9 | 2016-03-17T14:44:54.000Z | 2017-04-20T06:06:12.000Z | README_CN.md | ShinCurry/YXMenuView | 5e789eadcf9fa5fcc9e5b438c052b0811cbd075b | [
"MIT"
] | null | null | null | README_CN.md | ShinCurry/YXMenuView | 5e789eadcf9fa5fcc9e5b438c052b0811cbd075b | [
"MIT"
] | null | null | null | # YXMenuView
筛选菜单视图
### 版本 1.2
## 编译环境
* Swift 3
* Xcode 8 或者更高
* Apple LLVM compiler
* iOS 8.0 或者更高
* ARC
## 示例
打开 YXMenuViewDemo 项目并运行
## 安装
### CocoaPods
目前暂时不支持
### 手动安装
1. 把整个 YXMenuVIew 文件夹拖入你的项目文件夹并添加文件到工程目录
2. 把 Framework 添加到 `Embedded Binaries` 和 `Linked Frameworks and Libraries` 里面
## 使用说明
### 在 Storyboard 里面使用
拖一个 UIView 到 Storyboard，然后设置 `Custom Class` 为 `YXMenuView`
### 通过代码使用
```
import YXMenuView
menuView = YXMenuView(frame: CGRectMake(0, 60, view.frame.size.width, 44))
```
## Delegate 和 DataSource
### 必需
* `func numberOfSectionsInYXMenuView(menuView: YXMenuView) -> Int`
* `func menuView(menuView: YXMenuView, numberOfRowsInSection section: Int) -> Int`
* `func menuView(menuView: YXMenuView, titleForHeaderInSection section: Int) -> String`
* `func menuView(menuView: YXMenuView, titleForRowAtIndexPath indexPath: NSIndexPath) -> String`
### 可选
* `optional func menuView(menuView: YXMenuView, didSelectRowAtIndexPath indexPath: NSIndexPath)`
* `optional func heightForBodyView(menuView: YXMenuView) -> CGFloat`
* `optional func imageForSectionView(menuView: YXMenuView) -> UIImage?`
## TODO
* 支持 CocoaPods 安装
## 更多详情
[开发小记](https://blog.windisco.com/yxmenuview/)
| 19.104478 | 97 | 0.734375 | yue_Hant | 0.961492 |
8ab46132e001ef7c81cc47a029d139934e66b15e | 36 | md | Markdown | README.md | CoderWeiLee/SwiftUILearning | 6cd544f65faa208ad7a16824b3d07b825ef77c61 | [
"MIT"
] | 1 | 2020-12-21T05:42:21.000Z | 2020-12-21T05:42:21.000Z | README.md | CoderWeiLee/SwiftUILearning | 6cd544f65faa208ad7a16824b3d07b825ef77c61 | [
"MIT"
] | null | null | null | README.md | CoderWeiLee/SwiftUILearning | 6cd544f65faa208ad7a16824b3d07b825ef77c61 | [
"MIT"
] | null | null | null | # SwiftUILearning
根据喵神的SWiftUI练习的代码
| 12 | 17 | 0.888889 | eng_Latn | 0.370844 |
8ab465e7b0e1f826a95f424b0859668085b39124 | 9,554 | md | Markdown | docs-archive-a/2014/relational-databases/search/find-property-set-guids-and-property-integer-ids-for-search-properties.md | MicrosoftDocs/sql-docs-archive-pr.fr-fr | 5dfe5b24c1f29428c7820df08084c925def269c3 | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs-archive-a/2014/relational-databases/search/find-property-set-guids-and-property-integer-ids-for-search-properties.md | MicrosoftDocs/sql-docs-archive-pr.fr-fr | 5dfe5b24c1f29428c7820df08084c925def269c3 | [
"CC-BY-4.0",
"MIT"
] | 2 | 2021-10-11T06:39:57.000Z | 2021-11-25T02:25:30.000Z | docs-archive-a/2014/relational-databases/search/find-property-set-guids-and-property-integer-ids-for-search-properties.md | MicrosoftDocs/sql-docs-archive-pr.fr-fr | 5dfe5b24c1f29428c7820df08084c925def269c3 | [
"CC-BY-4.0",
"MIT"
] | 2 | 2021-09-29T08:51:33.000Z | 2021-10-13T09:18:07.000Z | ---
title: Recherche des GUID du jeu de propriétés et des ID d’entier de propriétés pour les propriétés de recherche | Microsoft Docs
ms.custom: ''
ms.date: 06/13/2017
ms.prod: sql-server-2014
ms.reviewer: ''
ms.technology: search
ms.topic: conceptual
helpviewer_keywords:
- full-text search [SQL Server], search property lists
- search property lists [SQL Server], configuring
ms.assetid: 7db79165-8bcc-4be6-8d40-12d44deda79f
author: MikeRayMSFT
ms.author: mikeray
ms.openlocfilehash: 53c08d3a2f86c7e412fbdb1caa6d55d7d23bf407
ms.sourcegitcommit: ad4d92dce894592a259721a1571b1d8736abacdb
ms.translationtype: MT
ms.contentlocale: fr-FR
ms.lasthandoff: 08/04/2020
ms.locfileid: "87700979"
---
# <a name="find-property-set-guids-and-property-integer-ids-for-search-properties"></a>Recherche des GUID du jeu de propriétés et des ID d'entier de propriétés pour les propriétés de recherche
Cette rubrique explique comment extraire les valeurs requises avant d'ajouter une propriété à une liste de propriétés de recherche et les rendre détectables par la recherche en texte intégral. Ces valeurs incluent le GUID du jeu de propriétés et l'identificateur entier d'une propriété de document.
Les propriétés de document qui sont extraites par les IFilters des données binaires, c’est-à-dire celles stockées dans une `varbinary` `varbinary(max)` colonne de type de données, (y compris `FILESTREAM` ), `image` peuvent être rendues disponibles pour la recherche en texte intégral. Pour rendre une propriété extraite détectable, la propriété doit être ajoutée manuellement à une liste de propriétés de recherche. La liste des propriétés de recherche doit également être associée à un ou plusieurs index de recherche en texte intégral. Pour plus d’informations, consultez [Rechercher les propriétés du document à l’aide des listes de propriétés de recherche](search-document-properties-with-search-property-lists.md).
Avant d'ajouter une propriété disponible à une liste de propriétés, vous devez obtenir deux informations sur la propriété :
- le GUID du jeu de propriétés de la propriété ;
- l'ID d'entier de la propriété ;
(Lorsque vous ajoutez une propriété à une liste de propriétés, vous devez également fournir un nom et une description. Toutefois vous ne devez pas utiliser le nom canonique et la description de la propriété.)
Cette rubrique décrit les méthodes couramment utilisées pour rechercher des informations sur les propriétés disponibles, notamment sur les propriétés définies par Microsoft. Pour plus d'informations sur les propriétés définies par un tiers, reportez-vous à la documentation de ce tiers ou contactez le fournisseur.
## <a name="finding-information-about-widely-used-well-known-microsoft-properties"></a><a name="wellknown"></a> Recherche d'informations sur les propriétés Microsoft largement répandues et connues
Microsoft définit des centaines de propriétés de document utiles dans de nombreux contextes, mais seul un modeste sous-ensemble des propriétés disponibles est utilisé par chaque format de fichier. Parmi les propriétés Windows fréquemment utilisées se trouve un petit jeu de propriétés génériques. Quelques exemples de propriétés génériques connues sont présentés dans le tableau suivant. Le tableau indique le nom connu, le nom canonique Windows (issu de la description de la propriété publiée par Microsoft), le GUID du jeu de propriétés, l'identificateur entier de propriété et une brève description.
|Nom connu|Nom canonique Windows|GUID du jeu de propriétés|ID entier|Description|
|----------------------|----------------------------|-----------------------|----------------|-----------------|
|Auteurs|`System.Author`|F29F85E0-4FF9-1068-AB91-08002B27B3D9|4|Auteur ou auteurs d'un élément donné.|
|Balises|`System.Keywords`|F29F85E0-4FF9-1068-AB91-08002B27B3D9|5|Ensemble de mots clés (également appelé balises) affecté à l'élément.|
|Type|`System.PerceivedType`|28636AA6-953D-11D2-B5D6-00C04FD918D0|9|Type de fichier perçu selon son type canonique.|
|Intitulé|`System.Title`|F29F85E0-4FF9-1068-AB91-08002B27B3D9|2|Titre de l'élément. Par exemple, le titre d'un document, l'objet d'un message, la légende d'une photo ou le nom d'une piste de musique.|
Pour favoriser la cohérence parmi les formats de fichier, Microsoft a identifié des sous-ensembles de propriétés du document fréquemment utilisées et prioritaires pour plusieurs catégories de documents. Celles-ci incluent des communications, des contacts, des documents, des fichiers de musique, des images et des vidéos. Pour plus d’informations sur les propriétés principales de chaque catégorie, consultez [Propriétés définies par le système pour les formats de fichiers personnalisés](https://go.microsoft.com/fwlink/?LinkId=144336) dans la documentation Windows Search.
Un format de fichier spécifique peut implémenter des propriétés de trois types :
- Propriétés génériques définies par [!INCLUDE[msCoName](../../includes/msconame-md.md)].
- Propriétés spécifiques à la catégorie définies par [!INCLUDE[msCoName](../../includes/msconame-md.md)].
- Propriétés personnalisées, spécifiques à l'application définies par le fournisseur de logiciels.
## <a name="finding-information-about-available-properties-by-using-filtdumpexe"></a><a name="filtdump"></a> Recherche d'informations sur les propriétés disponibles à l'aide de FILTDUMP.EXE
Pour savoir quelles propriétés sont détectées et extraites, le cas échéant, par un IFilter installé, vous pouvez installer et exécuter l’utilitaire **filtdump.exe** , qui fait partie du Kit de développement logiciel (SDK) [!INCLUDE[msCoName](../../includes/msconame-md.md)] Windows.
Exécutez **filtdump.exe** à partir de l’invite de commandes et fournissez un argument unique. Cet argument est le nom d'un fichier individuel dont le type de fichier correspond à un IFilter installé. L'utilitaire affiche une liste de toutes les propriétés identifiées par l'IFilter dans le document, avec leurs GUID de jeu de propriétés, leurs ID d'entier et des informations supplémentaires.
Pour plus d’informations sur l’installation de ce logiciel, consultez [Kit de développement logiciel (SDK) Microsoft Windows pour Windows 7 et .NET Framework 4](https://www.microsoft.com/download/details.aspx?id=8279). Après avoir téléchargé et installé le Kit de développement logiciel (SDK), recherchez l'utilitaire filtdump.exe dans les dossiers suivants.
- Pour la version 64 bits, recherchez dans `C:\Program Files\Microsoft SDKs\Windows\v7.1\Bin\x64`.
- Pour la version 32 bits, recherchez dans `C:\Program Files\Microsoft SDKs\Windows\v7.1\Bin`.
## <a name="finding-values-for-a-search-property-from-a-windows-property-description"></a><a name="propdesc"></a>Recherche de valeurs pour une propriété de recherche à partir d’une description de propriété Windows
Pour une propriété de recherche Windows connue, vous pouvez obtenir ces informations à partir des attributs `formatID` et `propID` de la description de la propriété (`propertyDescription`).
L'exemple suivant montre la partie pertinente d'une description de propriété Microsoft typique, dans ce cas, la propriété `System.Author` . L'attribut `formatID` spécifie le GUID du jeu de propriétés, `F29F85E0-4FF9-1068-AB91-08002B27B3D9`et l'attribut `propID` spécifie l'ID entier de propriété `4.` . Remarquez que l'attribut `name` spécifie le nom canonique Windows de la propriété `System.Author`. (Cet exemple omet les parties de la description de la propriété qui ne sont pas appropriées.)
```
.
propertyDescription
name = System.Author
...
formatID = F29F85E0-4FF9-1068-AB91-08002B27B3D9
propID = 4
...
```
Pour obtenir la description complète de cette propriété, consultez [System.Author ](https://go.microsoft.com/fwlink/?LinkId=144337) dans la documentation de développement de Win32 et COM.
Pour obtenir une liste complète des propriétés Windows, consultez [Propriétés Windows](https://go.microsoft.com/fwlink/?LinkId=215013)et aussi la documentation Windows Search.
## <a name="adding-a-property-to-a-search-property-list"></a><a name="examples"></a> Ajout d'une propriété à une liste de propriétés de recherche
L'exemple suivant indique comment ajouter une propriété à une liste de propriétés de recherche. L’exemple utilise une instruction [ALTER SEARCH PROPERTY LIST](/sql/t-sql/statements/alter-search-property-list-transact-sql) pour ajouter la propriété `System.Author` à une liste de propriétés de recherche nommée `PropertyList1`, et fournit un nom convivial à la propriété, `Author`.
```
ALTER SEARCH PROPERTY LIST PropertyList1
ADD 'Author'
WITH (
PROPERTY_SET_GUID = 'F29F85E0-4FF9-1068-AB91-08002B27B3D9',
PROPERTY_INT_ID = 4,
PROPERTY_DESCRIPTION = 'System.Author - the author or authors of the item'
)
GO
```
Pour plus d’informations sur la création d’une liste de propriétés de recherche et son association à un index de recherche en texte intégral, consultez [Rechercher les propriétés du document à l’aide des listes de propriétés de recherche](search-document-properties-with-search-property-lists.md).
## <a name="see-also"></a>Voir aussi
[Rechercher des propriétés de document avec des listes de propriétés de recherche](search-document-properties-with-search-property-lists.md)
[Configurer et gérer des filtres pour la recherche](configure-and-manage-filters-for-search.md)
| 88.462963 | 722 | 0.76973 | fra_Latn | 0.958419 |
8ab50c42956a803814d821678383e5ec52972edf | 10,066 | md | Markdown | docs/3.properties.md | alexpods/ClazzJS | 2f94496019669813c8246d48fcceb12a3e68a870 | [
"MIT"
] | 3 | 2015-01-01T14:27:31.000Z | 2015-08-26T03:13:16.000Z | docs/3.properties.md | alexpods/ClazzJS | 2f94496019669813c8246d48fcceb12a3e68a870 | [
"MIT"
] | null | null | null | docs/3.properties.md | alexpods/ClazzJS | 2f94496019669813c8246d48fcceb12a3e68a870 | [
"MIT"
] | null | null | null | Properties
==========
[< Clazz declaration](https://github.com/alexpods/ClazzJS/blob/master/docs/2.clazz_declaration.md)
|
[Main](https://github.com/alexpods/ClazzJS)
|
[Methods >](https://github.com/alexpods/ClazzJS/blob/master/docs/4.methods.md)
> Sources: [components/meta/Properties](https://github.com/alexpods/ClazzJS/blob/master/src/components/meta/Properties.js), [components/meta/Property](https://github.com/alexpods/ClazzJS/blob/master/src/components/meta/Property.js)
There are two types of properties: *clazz properties* and *instance properties*. The only essential difference between these two types is that clazz properties are applied to clazz itself while instance properties are applied to it instances. Next meta directives are used for declaring these two types of properties:
* **clazz_properties** - for clazz properties
* **properties** - for instance properties
All internal options for these directives are absolutely the same.
Example:
> Online working version of this example is available on plunker: http://plnkr.co/edit/oyF9jO
```js
clazz('Person', {
clazz_properties: {
count: 1000,
countries: {
type: ['array', { element: ['string' , { pattern: /(\w+\s?)+/ }] }],
default: []
}
},
properties: {
name: {
type: 'string',
constraints: {
withoutNumbers: function(value) {
return (/[a-zA-Z]+/).test(value);
}
},
methods: ['get', 'is' ]
},
isIntelligent: ['boolean', true],
birthday: ['datetime'],
phone: ['string', { pattern: /\d{1,2}-\d{3}-\d{5,7}/ }],
sex: {
converters: {
fullForm: function(value) {
switch (value.toLowerCase()) {
case 'male': value = 'M'; break;
case 'female': value = 'F'; break;
}
return value;
},
upperCase: function(value) {
return value.toUpperCase();
}
},
constraints: {
M_F: function(value) {
return -1 !== ['M','F'].indexOf(value)
}
},
default: 'M',
},
skinColor: undefined,
eyeColor: null,
hairColor: 'black',
address: function() {
return 'some addres';
}
}
});
```
Type
----
> Sources: [components/meta/Property/Type.js](https://github.com/alexpods/ClazzJS/blob/master/src/components/meta/Property/Type.js)
First of all you can specify type of property using `type` option. Property type can have its
specific parameters. There are next property types (also their parameters are specified):
* **boolean** - Converts property value into boolean value
* **number** - Converts property value into number
- *min*: Minimum for property value
- *max*: Maximum for property value
* **string** - Converts property value into string
- *pattern*: Regular expression
- *variants*: List of supported variants
* **datetime** - Converts string and number into datetime or throw an error otherwise
* **array** - Converts string into array of throw an error otherwise
- *element*: Type for property element. It can be any type from this list. Parameters are also supported.
* **hash** - Throw an error if value is not an simple object
- *element*: Type for hash element. It can be any type from this list. Parameters are also supported.
- *keys*: List of supported keys for hash.
* **object** - Throw an error if value is not an object
- *instanceOf*: value must be instance of this constructor function.
* **function** - Throw an error if value is not a function
Default
-------
> Sources: [components/meta/Property/Default.js](https://github.com/alexpods/ClazzJS/blob/master/src/components/meta/Property/Default.js)
Using `default` option you can specify default value for property. If function is specified by way of default value,
then return value of this function will be used as default value. Function will be executed in context of clazz or
clazz instance depending on type of properties. If default value of property does not specified then property value
equals `undefined` value.
Examples:
```js
clazz('SomeClazzName', {
properties: {
name: {
type: 'string',
default: 'John'
},
age: ['number', 18],
address: 'some city, some street',
heirColor: function() {
return Math.random > 0.5 ? 'white' : 'black';
}
}
});
```
Methods
-------
> Sources: [components/meta/Property/Methods.js](https://github.com/alexpods/ClazzJS/blob/master/src/components/meta/Property/Methods.js)
You can genrate common methods for property manipulation. You must specify method types in `methods` option. Default
value of `methods` option is `[ 'get', 'set', 'has', 'is', 'remove', 'clear' ]` (as you can see bellow this is
all possible method types). It's using next logic for method name generation :
```js
var methodName = methodType + propertyName[0].toUppersCase + propertyName.slice(1);
```
If property name starts with underscore characters then method name will be prefiexed with these underscrore characters.
Examples:
```js
-----------------------------------------------------------------------------------------------
| property | methods |
|-------------|-------------------------------------------------------------------------------|
| name | getName(), isName(), setName(), hasName(), clearName(), removeName() |
| heirColor | getHeirColor(), isHeirColor(), setHeirColor(), ... |
| _address | _getAddress(), _isAddress(), _setAddress(), ... |
| __age | __getAge(), __isAge(), __setAge(), __hasAge(), __clearAge(), __removeAge() |
-----------------------------------------------------------------------------------------------
```
There are next method types:
* **get** - property getter. Returns value of the property. Examples:
```js
Person.getCountries();
person.getName();
person.getPhone();
person.getSex();
```
* **set** - property setter. Returns `this` for fluent interface support. Examples:
```js
Person
.setCountries(['russia', 'usa', 'chine', 'france'])
person
.setEyeColor('blue')
.setHeirColor('white')
```
* **is** - checker whether property is equals to specified value. If no value for matching is specified, then property
value is converted to boolean and result is returned. Examples:
```js
Person.isCount(1000);
person.isEyeColor('green');
person.isIntelligent();
```
* **has** - check whether specified value exists. It means value must not be equal to 'undefined' or 'null'. Examples:
```js
Person.hasCountries();
person.hasSkinColor();
person.hasEyeColor();
```
* **remove** - remove property value. It set property value to 'undefined' or remove it in case of subproperties.
(see bellow). Returns `this` for fluent interface support. Examples:
```js
person.removeAddress();
person.removePhone();
```
* **clear** - cleare property value. In contrast to 'remove' method it set property value of object and array types to
{} and [] respectively. Returns `this` for fluent interface support. Examples:
```js
Person.cleareCountries();
person.clearAddress(); // the same as person.removeAddress()
```
Constraints
-----------
> Sources: [components/meta/Property/Constraints.js](https://github.com/alexpods/ClazzJS/blob/master/src/components/meta/Property/Constraints.js)
You can specify constraints for property. Each constraint has name and constraint logic - function. This function take
setted value as first argument and must return `true` if constraint is satisfied and `false` otherwise. Constraint function is executed in context of clazz or clazz instance depending on properties type. If setted value does not satisfy the constraint error will be thrown.
Examples:
```js
clazz('SomeClazz', {
properties: {
name: {
constraints: {
withoutNumbers: function(value) {
return (/[a-zA-Z]+/).test(value);
},
startsWithA: function(value) {
return 'A' === value[0];
},
endsWithY: function(value) {
return 'Y' === value[value.length - 1];
},
},
}
}
})
```
Converters
----------
> Sources: [components/meta/Property/Converters.js](https://github.com/alexpods/ClazzJS/blob/master/src/components/meta/Property/Converters.js)
You can specify properties converters. Each converter has name and converter logic - function. This function takes
setted value as first argument and returns converted (or not) value. Converter function is executed in context of
clazz or clazz instance depending on properties type. Converters is applied to value before property constraints
and type check.
Examples:
```js
clazz('SomeClazz', {
properties: {
name: {
converters: {
toUpperCase: function(value) {
return value.toUpperCase();
},
addUnderscores: function(value) {
return '___' + value;
},
appendRandomNumber: function(value) {
return value + Math.floor(Math.random() * 1000);
}
}
}
}
});
```
[< Clazz declaration](https://github.com/alexpods/ClazzJS/blob/master/docs/2.clazz_declaration.md)
|
[Main](https://github.com/alexpods/ClazzJS)
|
[Methods >](https://github.com/alexpods/ClazzJS/blob/master/docs/4.methods.md)
[](http://githalytics.com/alexpods/clazzjs)
| 37.007353 | 318 | 0.613551 | eng_Latn | 0.898893 |
8ab53be1502fd225a5a15ee0479af210519aeece | 767 | md | Markdown | _ru-dep/name.md | xidongbo/docs | 2745640d072534cb19e632c75ed255b82b8ddbfc | [
"Apache-2.0"
] | 1 | 2021-08-18T08:52:27.000Z | 2021-08-18T08:52:27.000Z | _ru-dep/name.md | xidongbo/docs | 2745640d072534cb19e632c75ed255b82b8ddbfc | [
"Apache-2.0"
] | null | null | null | _ru-dep/name.md | xidongbo/docs | 2745640d072534cb19e632c75ed255b82b8ddbfc | [
"Apache-2.0"
] | null | null | null | ---
layout: relation
title: 'name'
shortdef: 'name'
---
`name` is one of the relations for compounding in UD.
In Russian it is used to join the first (or patronymic) and the last name of a person.
The leftmost name is always the head and the other name(s) are attached to it.
The relation is not used to attach adjectives to nouns within multi-word names of places, organizations etc.
(e.g. _Владимир Путин_).
~~~ sdparse
Президент Владимир Владимирович Путин вчера посетил Минеральные Воды . \n President Vladimir Putin yesterday visited Mineralnye Vody .
name(Владимир, Путин)
name(Vladimir, Putin)
name(Владимирович, Владимир)
name(Vladimirovich, Vladimir)
nmod(Владимир, Президент)
nmod(Vladimir, President)
amod(Минеральные, Воды)
amod(Mineralnye, Vody)
~~~
| 29.5 | 134 | 0.771838 | eng_Latn | 0.988047 |
8ab54607e8a3e5bf8d82811d639b0a7ac6b8663b | 145 | md | Markdown | data/second-brain/wavelength.md | fu4303/portfolio-morris | 01367a3d575648b2db28cfa5dd010178d7afab1f | [
"MIT"
] | 6 | 2019-07-10T15:24:39.000Z | 2021-12-19T00:54:03.000Z | data/second-brain/wavelength.md | fu4303/portfolio-morris | 01367a3d575648b2db28cfa5dd010178d7afab1f | [
"MIT"
] | 47 | 2019-07-10T19:41:29.000Z | 2022-03-24T06:50:35.000Z | data/second-brain/wavelength.md | fu4303/portfolio-morris | 01367a3d575648b2db28cfa5dd010178d7afab1f | [
"MIT"
] | 2 | 2021-07-04T00:55:25.000Z | 2021-12-19T00:54:06.000Z | # Wavelength
- $\lambda$
- Horizontal length covered by one cycle of a wave
- Distance between crests or between troughs
[[Physics]] [[Wave]]
| 16.111111 | 50 | 0.717241 | eng_Latn | 0.999556 |
8ab5c031e572f566a779c56302162ce07aeb18ae | 3,650 | md | Markdown | docs/api-testing/on-prem/quick-start/forge.md | mattpyle/sauce-docs | 143829bf71ccde1fcb2fd09dbf5947b3735bd052 | [
"MIT"
] | 10 | 2021-03-03T23:15:16.000Z | 2022-03-01T11:00:32.000Z | docs/api-testing/on-prem/quick-start/forge.md | mattpyle/sauce-docs | 143829bf71ccde1fcb2fd09dbf5947b3735bd052 | [
"MIT"
] | 168 | 2021-02-16T20:32:50.000Z | 2022-03-31T23:46:23.000Z | docs/api-testing/on-prem/quick-start/forge.md | mattpyle/sauce-docs | 143829bf71ccde1fcb2fd09dbf5947b3735bd052 | [
"MIT"
] | 34 | 2021-03-03T17:29:08.000Z | 2022-03-22T11:15:44.000Z | ---
id: forge
title: "APIF Forge (Local IDE)"
sidebar_label: "APIF Forge (Local IDE)"
description: "Forge is a downloadable IDE made for writing and running tests locally. The APIF Composer on Forge works exactly like the Composer on the hosted cloud or self-hosted/on-premises version of API Fortress."
---
import useBaseUrl from '@docusaurus/useBaseUrl';
Forge is a downloadable IDE made for writing and running tests locally. The APIF Composer on Forge works exactly like the Composer on the hosted cloud or self-hosted/on-premises version of API Fortress. Click [here](/api-testing/on-prem/quick-start/composer) to learn how the composer works.
:::note
Forge requires the API Fortress local engine, which is for licensed API Fortress customers only. If you would like to set up a free trial, please reach out to [support@apifortress.com](mailto:support@apifortress.com).
:::
## Creating Tests
You can either create tests directly in Forge by writing it yourself or by calling the desired API within the included HTTP client in Forge then using our “Generate Test” button to create the test.
Tests can be automatically generated via an API payload:
Auto generate a high-level schema validation test by using our HTTP client to make an API call and our Generate Test button.
### Step 1 - Select HTTP Client
<img src={useBaseUrl('img/api-fortress/2020/08/Screen-Shot-2019-07-18-at-2.12.26-PM.png')} alt="Generate HTTP Call"/>
### Step 2 - Send API Call
<img src={useBaseUrl('img/api-fortress/2020/08/Screen-Shot-2019-07-18-at-2.09.37-PM.png')} alt="Send API Call"/>
### Step 3 - Generate Test
<img src={useBaseUrl('img/api-fortress/2020/08/Screen-Shot-2019-07-18-at-2.11.00-PM.png')} alt="Generate Test"/>
__Example Output__:
<img src={useBaseUrl('img/api-fortress/2020/08/Screen-Shot-2019-07-18-at-2.11.35-PM.png')} alt="Output"/>
You can also write tests from scratch via the API Fortress visual composer or code view composer:
### Visual Composer
* Select the **+** symbol:
<img src={useBaseUrl('img/api-fortress/2020/08/forgescreen1.png')} alt="forge screen 1"/>
* Select a request method:
<img src={useBaseUrl('img/api-fortress/2020/08/forgescreen2.png')} alt="forge screen 2"/>
* Set the request parameters:
<img src={useBaseUrl('img/api-fortress/2020/08/forgescreen3.png')} alt="forge screen 3"/>
### Code View Composer
You can also write tests directly in our XML markup language that is so easy to use that anyone can learn how to use it:
<img src={useBaseUrl('img/api-fortress/2019/07/Screen-Shot-2019-07-18-at-2.06.50-PM.png')} alt="Forge Code View"/>
## Importing Tests
Import tests from your API Fortress instance. Learn how [here.](https://apifortress.com/doc/import-export-tests/)
Importing tests into Forge is as easy as opening the folder that contains the `unit.xml` and input.xml in the Forge IDE.
<img src={useBaseUrl('img/api-fortress/2019/06/image.png')} alt="unit.xml"/>
## Running Tests
By combining Forge with APIF-Local (APIF – Local Engine), you can execute local tests directly from the IDE. Current customers can reach out to their sales contact (or sales@apifortress.com) to request the local engine files.
Find a step-by-step guide on how to set up APIF-Local [here](https://apifortress.com/doc/apf-local-engine/).
Once you have configured your local engine, integrating into Forge is very easy. *See below in the settings section of Forge*:
**Load the local engine jar file here**:
<img src={useBaseUrl('img/api-fortress/2019/06/image-1.png')} alt="image-1.png"/>
**Load the config.yml file here**:
<img src={useBaseUrl('img/api-fortress/2019/06/image-3.png')} alt="image-3.png"/>
| 44.512195 | 291 | 0.750411 | eng_Latn | 0.945191 |
8ab64a8c6862d06a44bdaa07aea5a5c8da81e357 | 478 | md | Markdown | _publications/2014-01-01-Can-execution-time-describe-accurately-the-energy-consumption-of-mobile-apps-An-experiment-in-Android.md | lipslab/lipslab | 835032b5bde5f9dfc1343101e28f3cc70b801018 | [
"MIT"
] | null | null | null | _publications/2014-01-01-Can-execution-time-describe-accurately-the-energy-consumption-of-mobile-apps-An-experiment-in-Android.md | lipslab/lipslab | 835032b5bde5f9dfc1343101e28f3cc70b801018 | [
"MIT"
] | null | null | null | _publications/2014-01-01-Can-execution-time-describe-accurately-the-energy-consumption-of-mobile-apps-An-experiment-in-Android.md | lipslab/lipslab | 835032b5bde5f9dfc1343101e28f3cc70b801018 | [
"MIT"
] | null | null | null | ---
title: "Can execution time describe accurately the energy consumption of mobile apps? An experiment in Android"
date: 2014-01-01
paperurl: 'http://doi.acm.org/10.1145/2593743.2593748'
citation: ' Luis Corral, Anton Georgiev, Alberto Sillitti, Giancarlo Succi, "Can execution time describe accurately the energy consumption of mobile apps? An experiment in Android.", 2014.'
---
[Access paper here](http://doi.acm.org/10.1145/2593743.2593748){:target="_blank"}
| 53.111111 | 202 | 0.761506 | eng_Latn | 0.694383 |
8ab8680da1d98e11402f9c792f9447978cdad49d | 87 | md | Markdown | 2019/CVE-2019-2616/poc/others/README.md | ox01024/reapoc | cb01d5da70e93166587302fef2d2a75f5891a33d | [
"Apache-2.0"
] | 421 | 2021-12-07T08:46:40.000Z | 2022-03-31T12:42:16.000Z | 2019/CVE-2019-2616/poc/others/README.md | LinShiG0ng/reapoc | 99ebfcca818928eca79c0a2dcc2e466bc8f3e734 | [
"Apache-2.0"
] | 1 | 2022-03-14T06:07:39.000Z | 2022-03-14T15:52:22.000Z | 2019/CVE-2019-2616/poc/others/README.md | LinShiG0ng/reapoc | 99ebfcca818928eca79c0a2dcc2e466bc8f3e734 | [
"Apache-2.0"
] | 144 | 2021-12-07T11:06:14.000Z | 2022-03-31T07:41:35.000Z | [https://www.exploit-db.com/exploits/46729](https://www.exploit-db.com/exploits/46729)
| 43.5 | 86 | 0.758621 | kab_Latn | 0.147587 |
8ab88bafdf2a1fb6eda5615d55ea954851ad0588 | 1,155 | md | Markdown | docs/contribute/workflows/invite-external-user.md | Iniationware/flowforge | 7bf335b9d4dcdcf39140c9b7ffa016bf47ac36b3 | [
"Apache-2.0"
] | 31 | 2022-01-20T15:22:04.000Z | 2022-03-28T12:38:48.000Z | docs/contribute/workflows/invite-external-user.md | Iniationware/flowforge | 7bf335b9d4dcdcf39140c9b7ffa016bf47ac36b3 | [
"Apache-2.0"
] | 175 | 2022-01-20T15:21:11.000Z | 2022-03-31T23:52:56.000Z | docs/contribute/workflows/invite-external-user.md | Iniationware/flowforge | 7bf335b9d4dcdcf39140c9b7ffa016bf47ac36b3 | [
"Apache-2.0"
] | 5 | 2022-01-21T08:27:47.000Z | 2022-03-29T17:34:51.000Z | # Invite External User Flow
```mermaid
sequenceDiagram
autonumber
participant UserEmail
participant InvitedUser
participant TeamOwner
participant UI
participant Runtime
participant DB
Note over TeamOwner: TeamOwner wants to invite an external user to a team
TeamOwner->>UI: Opens Add Team Mambers dialog
TeamOwner->>UI: Enters User email, clicks okay
UI->>+Runtime: POST /api/v1/teams/:teamId/invitations
Runtime->>DB: Create Invitiation
Runtime->>UserEmail: Send email containing link to /account/create?email={email}`
Runtime->>DB: Update audit log
Runtime-->>-UI: { status: 'okay' }
Note over TeamOwner: TeamOwner role complete
UserEmail-->>InvitedUser: Email received
InvitedUser->>+UI: Opens /account/create?email={email}
UI->>UI: Prefills email field of signup page
InvitedUser->>UI: Enters details on sign-up page
InvitedUser->>UI: Clicks Sign-up
UI->>+Runtime: POST /account/register
Runtime->>Runtime: Checks an invite exists for this email
Note over InvitedUser,Runtime: Standard sign-up flow continues
```
- See also [User Sign Up](./signup.md)
| 36.09375 | 85 | 0.714286 | eng_Latn | 0.5113 |
8ab8a5b5dfa1ad70a38b949472cf822cff259214 | 846 | md | Markdown | source/_changelogs/0.3.13.md | pravynandas/cypress-documentation | 3290ce57a9d38f43e841392f3aa2c3f90131e00c | [
"MIT"
] | 8 | 2019-05-17T05:58:41.000Z | 2021-06-07T08:21:11.000Z | source/_changelogs/0.3.13.md | pravynandas/cypress-documentation | 3290ce57a9d38f43e841392f3aa2c3f90131e00c | [
"MIT"
] | 4 | 2019-06-03T15:26:48.000Z | 2019-07-08T01:57:44.000Z | source/_changelogs/0.3.13.md | pravynandas/cypress-documentation | 3290ce57a9d38f43e841392f3aa2c3f90131e00c | [
"MIT"
] | 3 | 2019-04-03T02:04:15.000Z | 2021-03-25T02:37:13.000Z | # 0.3.13
*Released 03/27/2015*
**Features:**
- {% url `cy.visit()` visit %} now detects a local url. `localhost`, `0.0.0.0`, `127.0.0.1` can omit the `http://` protocol.
**Bugfixes:**
- {% url `cy.contains()` contains %} now properly escape quotes in the text.
- {% url `cy.visit()` visit %} now inserts a trailing slash intelligently into the correct `path` position (not after query params or hashes).
- {% url `cy.visit()` visit %} will no longer log 2 failed commands on error.
- Hovering on commands which delay resolving their $el will now properly highlight again.
**Misc:**
- {% url `.debug()` debug %} returns the current subject now.
- upgraded jsUri to `1.3.0`.
- {% url `cy.visit()` visit %} now throws when url argument isn't a string.
- `Cypress.Log` instances now fire `attrs:changed` event. Removed `state:change` event.
| 36.782609 | 142 | 0.676123 | eng_Latn | 0.986936 |
8ab8b2e894a762a67b6dfb2256f3f1409d89b18e | 5,796 | md | Markdown | source/_posts/2019-08-09-ffmpeg-hardware-accelerate.md | imyangmo/imyangmo.github.io | 34b238270b8b2be5097e99523b9aa168d0078aa0 | [
"MIT"
] | null | null | null | source/_posts/2019-08-09-ffmpeg-hardware-accelerate.md | imyangmo/imyangmo.github.io | 34b238270b8b2be5097e99523b9aa168d0078aa0 | [
"MIT"
] | 7 | 2020-07-16T17:56:30.000Z | 2022-03-26T06:40:25.000Z | source/_posts/2019-08-09-ffmpeg-hardware-accelerate.md | imyangmo/imyangmo.github.io | 34b238270b8b2be5097e99523b9aa168d0078aa0 | [
"MIT"
] | null | null | null | ---
title: FFmpeg使用显卡进行转码硬件加速的记录，以及和软压的比较
date: 2019-08-09 13:15:03
tags:
- ffmpeg
- 转码
- 硬件加速
- hevc
- h265
- 码率
- 软压
- 硬压
---
在使用ffmpeg进行h.265硬压（显卡加速）转码下的不同参数对画质的影响。
<!-- more -->
# 1. 环境
操作系统：Windows 10
FFmpeg版本：20171204
显卡：GTX 965M
# 2. 过程
最近是有比较多的压制需求，使用```libx265```软压的速度实在是慢的受不了，所以还是希望能用显卡硬压起码速度快一点。之前有人跟我提过硬压质量似乎不及软压，但是决定还是试一试。在ffmpeg官网找到硬压的[相关信息](https://trac.ffmpeg.org/wiki/HWAccelIntro)。
由于我用的是windows，所以驱动基本没有特别配置。而且windows版的ffmpeg也是参数配置好的，所以这方面没有考虑太多。linux平台可能需要配置一下参数啥的。
压制分为两步，先是对视频解码再编码。ffmpeg在两步都提供了硬件加速方案。
在官网给出的例子是基于h264的，h265的硬件参数啥的可以用：
```ffmpeg -codecs | sls cuvid``` (备注：sls是powershell的命令，类似于linux下的grep命令)
可以看到这条：
```DEV.L. hevc H.265 / HEVC (High Efficiency Video Coding) (decoders: hevc hevc_qsv hevc_cuvid ) (encoders: libx265 nvenc_hevc hevc_nvenc hevc_qsv )```
解码器提供了
- ```hevc```
- ```hevc_qsv```
- ```hevc_cuvid```
编码器提供了
- ```libx265```
- ```nvenc_hevc```
- ```hevc_nvenc```
- ```hevc_qsv```
但是这个```nvenc_hevc```其实已经作废了，你用它的话他会提示你自动给你转到```hevc_nvenc```。
解码器的这三个用法我是不太懂有啥区别，也没去做太多研究，因为在实践中使用硬解的话是**没办法**同时硬压字幕的，会报错，况且硬解对于整体压制速度并没有太大提升，所以就抛弃硬解了。
编码器的部分，```libx265```就是软压，```hevc_qsv```似乎是英特尔的集显硬压，具体看[这里](https://www.intel.com/content/dam/www/public/us/en/documents/white-papers/cloud-computing-quicksync-video-ffmpeg-white-paper.pdf)。那么留给n卡的只有```hevc_nvenc```可以用了。
使用这条命令来查看该方法的参数：
```ffmpeg -h encoder=hevc_nvenc```
可以得到可用参数，我们这里探究的是-cq参数，给出的描述是：
```-cq <float> E..V.... Set target quality level (0 to 51, 0 means automatic) for constant quality mode in VBR rate control (from 0 to 51) (default 0)```
我感兴趣的原因是它和libx265，也就是软压的```-crf```参数很类似。所以接下来都是在其他参数不考虑的情况下对不同cq的对比。
# 3. 不同cq值的对比
我用的是谍影重重5的预告片压制测试，原视频数据如下：
{% codeblock %}
Format : MPEG-4
Format profile : QuickTime
Codec ID : qt 2005.03 (qt )
File size : 35.6 MiB
Duration : 30 s 30 ms
Overall bit rate : 9 938 kb/s
Encoded date : UTC 2016-02-08 06:40:30
Tagged date : UTC 2016-02-08 06:40:30
Writing library : Apple QuickTime 7.7.3
{% endcodeblock %}
在使用命令
```ffmpeg -i original.mov -c:v hevc_nvenc -cq X cqx.mp4```
进行测试后。结果如下：
## Libx265 （软压）
{% codeblock %}
Format : MPEG-4
Format profile : Base Media
Codec ID : isom (isom/iso2/mp41)
File size : 5.53 MiB
Duration : 30 s 70 ms
Overall bit rate : 1 544 kb/s
Writing application : Lavf58.2.103
{% endcodeblock %}
## -cq 0(默认)
{% codeblock %}
Format : MPEG-4
Format profile : Base Media
Codec ID : isom (isom/iso2/mp41)
File size : 8.21 MiB
Duration : 30 s 70 ms
Overall bit rate : 2 290 kb/s
Writing application : Lavf58.2.103
{% endcodeblock %}
## -cq 1
{% codeblock %}
Format : MPEG-4
Format profile : Base Media
Codec ID : isom (isom/iso2/mp41)
File size : 8.21 MiB
Duration : 30 s 70 ms
Overall bit rate : 2 290 kb/s
Writing application : Lavf58.2.103
{% endcodeblock %}
## -cq 10
{% codeblock %}
Format : MPEG-4
Format profile : Base Media
Codec ID : isom (isom/iso2/mp41)
File size : 8.21 MiB
Duration : 30 s 70 ms
Overall bit rate : 2 290 kb/s
Writing application : Lavf58.2.103
{% endcodeblock %}
## -cq 20
{% codeblock %}
Format : MPEG-4
Format profile : Base Media
Codec ID : isom (isom/iso2/mp41)
File size : 8.21 MiB
Duration : 30 s 70 ms
Overall bit rate : 2 290 kb/s
Writing application : Lavf58.2.103
{% endcodeblock %}
## -cq 30
{% codeblock %}
Format : MPEG-4
Format profile : Base Media
Codec ID : isom (isom/iso2/mp41)
File size : 8.20 MiB
Duration : 30 s 70 ms
Overall bit rate : 2 286 kb/s
Writing application : Lavf58.2.103
{% endcodeblock %}
## -cq 35
{% codeblock %}
Format : MPEG-4
Format profile : Base Media
Codec ID : isom (isom/iso2/mp41)
File size : 5.52 MiB
Duration : 30 s 70 ms
Overall bit rate : 1 539 kb/s
Writing application : Lavf58.2.103
{% endcodeblock %}
## -cq 38
{% codeblock %}
Format : MPEG-4
Format profile : Base Media
Codec ID : isom (isom/iso2/mp41)
File size : 4.06 MiB
Duration : 30 s 70 ms
Overall bit rate : 1 132 kb/s
Writing application : Lavf58.2.103
{% endcodeblock %}
## -cq 41
{% codeblock %}
Format : MPEG-4
Format profile : Base Media
Codec ID : isom (isom/iso2/mp41)
File size : 3.06 MiB
Duration : 30 s 70 ms
Overall bit rate : 855 kb/s
Writing application : Lavf58.2.103
{% endcodeblock %}
## -cq 51
{% codeblock %}
Format : MPEG-4
Format profile : Base Media
Codec ID : isom (isom/iso2/mp41)
File size : 1.41 MiB
Duration : 30 s 70 ms
Overall bit rate : 392 kb/s
Writing application : Lavf58.2.103
{% endcodeblock %}
对比视频在[这里](https://www.bilibili.com/video/av17105682)。
# 4. 结论
可以看到cq在1到30的变化并不大，在41以上画面基本上是没办法看了。在和libx265的默认软压对比后，-cq值落在35到40之间是比较好的选择。
在后续的实际应用中，我在压制画面动作较少的视频，如交响乐视频的情况下，-cq 37是一个对于我来说比较好的选择。 | 27.732057 | 219 | 0.562284 | yue_Hant | 0.629386 |
8ab8c2fe90b032e20cdbc8c419c0decce95b88a0 | 3,108 | md | Markdown | README.md | vectos/zio-http | 094293ef331b7a3f1277bd065dd2d13e54f984a5 | [
"MIT"
] | null | null | null | README.md | vectos/zio-http | 094293ef331b7a3f1277bd065dd2d13e54f984a5 | [
"MIT"
] | null | null | null | README.md | vectos/zio-http | 094293ef331b7a3f1277bd065dd2d13e54f984a5 | [
"MIT"
] | 1 | 2022-02-21T10:57:23.000Z | 2022-02-21T10:57:23.000Z | # ZIO Http
ZIO Http is a scala library for building http apps. It is powered by [ZIO] and [netty] and aims at being the defacto solution for writing, highly scalable and [performant](#benchmarks) web applications using idiomatic scala.
[](https://discord.com/channels/629491597070827530/819703129267372113)
[](https://oss.sonatype.org/content/repositories/releases/io/d11/zhttp_2.13/)
[](https://s01.oss.sonatype.org/content/repositories/snapshots/io/d11/zhttp_2.13/)
[](http://isitmaintained.com/project/dream11/zio-http "Average time to resolve an issue")
[zio]: https://zio.dev
[netty]: http://netty.io
**Table of Contents**
- [ZIO Http](#zio-http)
- [Getting Started](#getting-started)
- [Installation](#installation)
- [Benchmarks](#benchmarks)
# Getting Started
A simple Http server can be built using a few lines of code.
```scala
import zio._
import zhttp.http._
import zhttp.service.Server
object HelloWorld extends App {
val app = Http.collect {
case Method.GET -> Root / "text" => Response.text("Hello World!")
}
override def run(args: List[String]): URIO[zio.ZEnv, ExitCode] =
Server.start(8090, app).exitCode
}
```
You can checkout more examples in the examples project —
- [Simple Server](https://github.com/dream11/zio-http/blob/main/example/src/main/scala/HelloWorld.scala)
- [Advanced Server](https://github.com/dream11/zio-http/blob/main/example/src/main/scala/HelloWorldAdvanced.scala)
- [WebSocket Server](https://github.com/dream11/zio-http/blob/main/example/src/main/scala/SocketEchoServer.scala)
- [Streaming Response](https://github.com/dream11/zio-http/blob/main/example/src/main/scala/StreamingResponse.scala)
- [Simple Client](https://github.com/dream11/zio-http/blob/main/example/src/main/scala/SimpleClient.scala)
- [File Streaming](https://github.com/dream11/zio-http/blob/main/example/src/main/scala/FileStreaming.scala)
# Installation
Setup via `build.sbt`
```scala
libraryDependencies += "io.d11" %% "zhttp" % "[version]"
```
# Benchmarks
These are some basic benchmarks of how ZIO Http performs wrt other main-stream libraries.
| **Benchmark (req/sec)** | `json` | `plain-text` |
| :---------------------- | :-------: | -----------: |
| **ZIO-Http** | 700073.31 | 719576.04 |
| **Vert.x** | 644854.27 | 707991.69 |
| **Finagle** | 567496.97 | 572231.69 |
| **Play** | 261223.68 | 263819.25 |
| **Http4s** | 135565.22 | 139573.98 |
More details are available [here](https://github.com/dream11/zio-http/blob/main/BENCHMARKS.md).
| 44.4 | 224 | 0.709138 | yue_Hant | 0.249289 |
8ab925ade6b589ff6c76ec3b46b3446a65f261b5 | 1,728 | md | Markdown | README.md | RishiRajAnand/gwtbootstrap3 | d6f887a89d8582bce87874602fe0f2369478025e | [
"Apache-2.0"
] | null | null | null | README.md | RishiRajAnand/gwtbootstrap3 | d6f887a89d8582bce87874602fe0f2369478025e | [
"Apache-2.0"
] | null | null | null | README.md | RishiRajAnand/gwtbootstrap3 | d6f887a89d8582bce87874602fe0f2369478025e | [
"Apache-2.0"
] | null | null | null | # GwtBootstrap3 [](https://travis-ci.org/gwtbootstrap3/gwtbootstrap3) [](https://maven-badges.herokuapp.com/maven-central/org.gwtbootstrap3/gwtbootstrap3/)
## NOTE: This project is inactive.
GWTBootstrap3 is a wrapper for [Twitter Bootstrap](http://getbootstrap.com/), which helps you develop responsive, mobile first HTML, CSS, and JS projects on the web using Java and Google Web Toolkit (GWT).
### Add GWTBootstrap3 to your project
You can easily add GWTBootstrap3 to your project by including the library as a Maven dependency.
```xml
<dependency>
<groupId>org.gwtbootstrap3</groupId>
<artifactId>gwtbootstrap3</artifactId>
<version>VERSION</version>
<scope>provided</scope>
</dependency>
```
### Final Release
* 1.0.0 - Released on 26 August 2019.
* Based on Bootstrap v3.4.0
* [Demo](http://gwtbootstrap3.github.io/gwtbootstrap3-demo/) - The GWTBootstrap3 1.0.0 Demo.
* [API Docs](http://gwtbootstrap3.github.io/gwtbootstrap3-demo/apidocs) - The GWTBootstrap3 1.0.0 API Javadoc.
* [Supported Features](https://github.com/gwtbootstrap3/gwtbootstrap3/wiki/Supported-Features) - Current releases supported features.
### Resources
* [Project Wiki](https://github.com/gwtbootstrap3/gwtbootstrap3/wiki) - Help with getting started and other useful project help.
[](https://gitter.im/gwtbootstrap3/gwtbootstrap3?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge)
| 61.714286 | 365 | 0.773148 | yue_Hant | 0.287903 |
8abad2d3801fcdd29ad8045f8da28055394a3c3b | 405 | md | Markdown | lib_ers/README.md | XiongWei1012/superpixels-revisited | f14e9e0b063741e5a9eb6544a3d6c2f44cdfc9e4 | [
"Unlicense"
] | 250 | 2015-04-05T07:07:35.000Z | 2022-03-11T01:49:33.000Z | lib_ers/README.md | XiongWei1012/superpixels-revisited | f14e9e0b063741e5a9eb6544a3d6c2f44cdfc9e4 | [
"Unlicense"
] | 11 | 2015-04-04T05:32:50.000Z | 2020-06-15T13:52:33.000Z | lib_ers/README.md | z-yan-0424/superpixels-revisited | f14e9e0b063741e5a9eb6544a3d6c2f44cdfc9e4 | [
"Unlicense"
] | 78 | 2015-04-04T05:13:34.000Z | 2022-01-15T06:47:08.000Z | # Entropy Rate Superpixels
Code for Entropy Rate Superpixels [1]:
[1] M. Y. Lui, O. Tuzel, S. Ramalingam, R. Chellappa.
Entropy rate superpixel segmentation.
Conference on Computer Vision and Pattern Recognition, pages 2097–2104, 2011.
The corresponding command line tool can befound in `ers_cli/main.cpp`, including documentation.
The original README can be found in `README.txt`. | 36.818182 | 95 | 0.738272 | eng_Latn | 0.894112 |
8abb510a33496163a2e4fff276e934cf80187683 | 1,263 | md | Markdown | README.md | paven/jmpress.js | 24c9652a2ada1720a2c302e086d6b4fb2d8cb7e1 | [
"MIT"
] | 292 | 2015-01-06T21:08:54.000Z | 2021-11-15T12:17:27.000Z | README.md | paven/jmpress.js | 24c9652a2ada1720a2c302e086d6b4fb2d8cb7e1 | [
"MIT"
] | 24 | 2015-01-08T07:59:07.000Z | 2020-06-26T10:57:59.000Z | README.md | paven/jmpress.js | 24c9652a2ada1720a2c302e086d6b4fb2d8cb7e1 | [
"MIT"
] | 69 | 2015-01-08T06:05:40.000Z | 2021-02-04T21:48:56.000Z | # jmpress.js (Version 0.4.5)
A jQuery plugin to build a website on the infinite canvas.
Started as a jQuery port of [impress.js](https://github.com/bartaz/impress.js)
and utilizes the power of CSS3 transforms and transitions in modern browsers.
## DEMO
jmpress.js demo: [http://jmpressjs.github.com/jmpress.js/]
jmpress.js beta demo: [http://jmpressjs.github.com/jmpress.js-beta/]
## BROWSER SUPPORT
jmpress.js attempts to use CSS3 transform and transition as its engine.
Please visit this link [http://caniuse.com/#feat=css-animation](http://caniuse.com/#feat=css-animation)
to see what browsers support CSS3 transforms.
## USAGE
See the [DOCS](http://jmpressjs.github.com/docs/).
To build or contribute to this version, please look at the development
documentation under the [contribute section](http://jmpressjs.github.com/docs/contribute.html).
## CONTRIBUTING
Good news! We accept pull requests and are looking for more contributors! ;)
Take a look at the
[contribute section](http://jmpressjs.github.com/docs/contribute.html)
of the docs for more information on how you can contribute. Thanks!
## LICENSE
Copyright 2013 Kyle Robinson Young & Tobias Koppers. Released under a
[MIT license](http://www.opensource.org/licenses/mit-license.php).
| 32.384615 | 103 | 0.768013 | eng_Latn | 0.700032 |
8abd949546f101eebe1697b140c0c8eeb68ffaf1 | 652 | md | Markdown | README.md | banan1988/salt-raspberry | 614967dd98362a8ba74e2a58c6bf4513dd321076 | [
"MIT"
] | null | null | null | README.md | banan1988/salt-raspberry | 614967dd98362a8ba74e2a58c6bf4513dd321076 | [
"MIT"
] | null | null | null | README.md | banan1988/salt-raspberry | 614967dd98362a8ba74e2a58c6bf4513dd321076 | [
"MIT"
] | null | null | null | # salt-raspberry
### Install git
```bash
sudo apt install -y git
```
### Clone repository
```bash
sudo mkdir -p /srv/salt/
sudo git clone https://github.com/banan1988/salt-raspberry.git /srv/salt/
```
### Install salt with masterless configuration (only salt-minion)
```bash
sudo /srv/salt/install.sh
```
### Switch to root
```bash
sudo -s
```
### Before run salt check roles which salt will apply to the raspberry
```bash
cat /etc/salt/minion.d/grains.conf
```
### Run salt locally as root (<a href="https://docs.saltstack.com/en/latest/ref/cli/salt-call.html" target="_blank">Salt doc - SALT-CALL</a>)
```bash
salt-call --local state.apply
```
| 19.757576 | 141 | 0.68865 | eng_Latn | 0.367802 |
8abdba82685d2919956fb928b51530248c11baa0 | 448 | md | Markdown | .github/PULL_REQUEST_TEMPLATE.md | gcjones/pyheos | 84706a7a62d2f0aebc155cc5baff93c657bbb5a5 | [
"Apache-2.0"
] | 10 | 2019-02-27T04:18:23.000Z | 2021-06-28T20:59:45.000Z | .github/PULL_REQUEST_TEMPLATE.md | gcjones/pyheos | 84706a7a62d2f0aebc155cc5baff93c657bbb5a5 | [
"Apache-2.0"
] | 6 | 2019-04-28T17:28:12.000Z | 2022-02-19T21:43:41.000Z | .github/PULL_REQUEST_TEMPLATE.md | gcjones/pyheos | 84706a7a62d2f0aebc155cc5baff93c657bbb5a5 | [
"Apache-2.0"
] | 6 | 2019-04-23T01:16:42.000Z | 2022-03-27T18:28:21.000Z | ## Description:
<details of changes goes here>
**Related issue (if applicable):** fixes #<pyheos issue number goes here>
## Checklist:
- [ ] The code change is tested and works locally.
- [ ] Local tests pass with `tox`. **Your PR cannot be merged unless tests pass**
- [ ] There is no commented out code in this PR.
- [ ] Tests have been added/updated. No exclusions in `.coveragerc` permitted.
- [ ] `README.MD` updated (if necessary) | 40.727273 | 83 | 0.685268 | eng_Latn | 0.993747 |
8abf545da4e39f922dc430f63080c026be4d183f | 1,019 | md | Markdown | _posts/2019-12-11-oproep-wat-wil-jij-weten-van-presentator-paul-de-leeuw.md | wijnandb/mediumish | ceffee1fd0cf0559da52d0022eeb10640e95ad94 | [
"MIT"
] | null | null | null | _posts/2019-12-11-oproep-wat-wil-jij-weten-van-presentator-paul-de-leeuw.md | wijnandb/mediumish | ceffee1fd0cf0559da52d0022eeb10640e95ad94 | [
"MIT"
] | null | null | null | _posts/2019-12-11-oproep-wat-wil-jij-weten-van-presentator-paul-de-leeuw.md | wijnandb/mediumish | ceffee1fd0cf0559da52d0022eeb10640e95ad94 | [
"MIT"
] | null | null | null | ---
layout: post
title: "Oproep: Wat wil jij weten van presentator Paul de Leeuw?"
date: Wed, 11 Dec 2019 11:57:06 +0100
category: binnenland
externe_link: "http://feeds.nos.nl/~r/nosnieuwsbinnenland/~3/BFv2YP5PNXk/2314261"
image: "https://nos.nl/data/image/2019/12/11/613365/1008x567.jpg"
aantal: 99
unieke: 84
author: "NOS"
---
<p>Paul de Leeuw is zanger, presentator, cabaretier en acteur. Misschien ken je hem ook wel als jurylid van Holland's Got Talent. Binnenkort gaan wij bij hem langs met jullie vragen. Wat wil jij van hem weten?</p>
<p>Paul heeft al meer dan 50 tv-programma's gepresenteerd. Ranking the Stars bijvoorbeeld. Dat is een soort quiz waar bekende Nederlanders het tegen elkaar opnemen.</p>
<p>Ook heeft hij in 11 films gespeeld en maakt hij ook muziek. Hij heeft al 21 albums uitgebracht.</p>
<p>Zijn nummer Ik Heb Je Lief is een van zijn bekendste liedjes. Die kan je hier luisteren:</p><img src="http://feeds.feedburner.com/~r/nosnieuwsbinnenland/~4/BFv2YP5PNXk" height="1" width="1" alt=""/>
| 59.941176 | 213 | 0.755643 | nld_Latn | 0.99973 |
8abf65ddd44042cc742891ac59b1345286c51cc9 | 875 | md | Markdown | Structure.md | cs3238-tsuzu/popcon-sc | 263a68664c968097d28c43afa8a59af986c2822d | [
"MIT"
] | 6 | 2017-02-02T09:16:11.000Z | 2020-01-02T20:21:50.000Z | Structure.md | cs3238-tsuzu/popcon-sc | 263a68664c968097d28c43afa8a59af986c2822d | [
"MIT"
] | 5 | 2017-07-26T08:25:11.000Z | 2017-08-10T15:48:16.000Z | Structure.md | cs3238-tsuzu/popcon-sc | 263a68664c968097d28c43afa8a59af986c2822d | [
"MIT"
] | null | null | null | # 構成
### ppweb
- Webサーバ部
- ユーザからのアクセスを処理する
### ppjc
- ジャッジコントローラ
- 各ジャッジノードに対して処理する命令を出す
- ランキングを更新
- MySQLのSubmissionテーブルを更新
### ppms
- その他雑用処理
- 不要になったファイルをGridFSから遅延削除
### MySQL
- 多くのデータを保存しておくためのデータベース
- 以下テーブル一覧
- contest_participations: Swarm移行で使わなくなった
- contest_problem_score_sets: 問題のスコアセットを保持
- contest_problem_test_cases: 問題のテストケースデータの名前とファイルパスを保持
- contest_problems: 問題の名前や制限など
- contests: コンテストの名前や開催時間など
- groups: ユーザが所属するグループの処理。0は入っていないがadmin
- languages: ジャッジに使われる言語
- news: トップページに表示されるNews
- sessions: セッション情報
- submission_test_cases: 各提出の各テストケースのジャッジ結果を保持
- submissions: 各提出の結果やファイルパスの保存
- users: ユーザのIDやパスワードの保持
### Redis
- CSRF対策Tokenやメール認証のトークン及びセッション
- また設定も多くを保存している
### MongoDB
- GridFSのみ使用
- 各部のファイルを全て保存している
## 今後増える予定
### pplb
- ロードバランサ(traefikを使うかも)
- MongoDB/GridFSはSeaweedFSになるかも
- ジャッジノード | 19.444444 | 59 | 0.758857 | yue_Hant | 0.515092 |